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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
36 #include "insn-attr.h"
37 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
47 #include "langhooks.h"
51 /* Decide whether a function's arguments should be processed
52 from first to last or from last to first.
54 They should if the stack and args grow in opposite directions, but
55 only if we have push insns. */
59 #ifndef PUSH_ARGS_REVERSED
60 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
61 #define PUSH_ARGS_REVERSED /* If it's last to first. */
67 #ifndef STACK_PUSH_CODE
68 #ifdef STACK_GROWS_DOWNWARD
69 #define STACK_PUSH_CODE PRE_DEC
71 #define STACK_PUSH_CODE PRE_INC
75 /* Assume that case vectors are not pc-relative. */
76 #ifndef CASE_VECTOR_PC_RELATIVE
77 #define CASE_VECTOR_PC_RELATIVE 0
80 /* Convert defined/undefined to boolean. */
81 #ifdef TARGET_MEM_FUNCTIONS
82 #undef TARGET_MEM_FUNCTIONS
83 #define TARGET_MEM_FUNCTIONS 1
85 #define TARGET_MEM_FUNCTIONS 0
89 /* If this is nonzero, we do not bother generating VOLATILE
90 around volatile memory references, and we are willing to
91 output indirect addresses. If cse is to follow, we reject
92 indirect addresses so a useful potential cse is generated;
93 if it is used only once, instruction combination will produce
94 the same indirect address eventually. */
97 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
98 tree placeholder_list = 0;
100 /* This structure is used by move_by_pieces to describe the move to
102 struct move_by_pieces
111 int explicit_inc_from;
112 unsigned HOST_WIDE_INT len;
113 HOST_WIDE_INT offset;
117 /* This structure is used by store_by_pieces to describe the clear to
120 struct store_by_pieces
126 unsigned HOST_WIDE_INT len;
127 HOST_WIDE_INT offset;
128 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
133 static rtx enqueue_insn PARAMS ((rtx, rtx));
134 static unsigned HOST_WIDE_INT move_by_pieces_ninsns
135 PARAMS ((unsigned HOST_WIDE_INT,
137 static void move_by_pieces_1 PARAMS ((rtx (*) (rtx, ...), enum machine_mode,
138 struct move_by_pieces *));
139 static bool block_move_libcall_safe_for_call_parm PARAMS ((void));
140 static bool emit_block_move_via_movstr PARAMS ((rtx, rtx, rtx, unsigned));
141 static rtx emit_block_move_via_libcall PARAMS ((rtx, rtx, rtx));
142 static tree emit_block_move_libcall_fn PARAMS ((int));
143 static void emit_block_move_via_loop PARAMS ((rtx, rtx, rtx, unsigned));
144 static rtx clear_by_pieces_1 PARAMS ((PTR, HOST_WIDE_INT,
146 static void clear_by_pieces PARAMS ((rtx, unsigned HOST_WIDE_INT,
148 static void store_by_pieces_1 PARAMS ((struct store_by_pieces *,
150 static void store_by_pieces_2 PARAMS ((rtx (*) (rtx, ...),
152 struct store_by_pieces *));
153 static bool clear_storage_via_clrstr PARAMS ((rtx, rtx, unsigned));
154 static rtx clear_storage_via_libcall PARAMS ((rtx, rtx));
155 static tree clear_storage_libcall_fn PARAMS ((int));
156 static rtx compress_float_constant PARAMS ((rtx, rtx));
157 static rtx get_subtarget PARAMS ((rtx));
158 static int is_zeros_p PARAMS ((tree));
159 static int mostly_zeros_p PARAMS ((tree));
160 static void store_constructor_field PARAMS ((rtx, unsigned HOST_WIDE_INT,
161 HOST_WIDE_INT, enum machine_mode,
162 tree, tree, int, int));
163 static void store_constructor PARAMS ((tree, rtx, int, HOST_WIDE_INT));
164 static rtx store_field PARAMS ((rtx, HOST_WIDE_INT,
165 HOST_WIDE_INT, enum machine_mode,
166 tree, enum machine_mode, int, tree,
168 static rtx var_rtx PARAMS ((tree));
170 static unsigned HOST_WIDE_INT highest_pow2_factor PARAMS ((tree));
171 static unsigned HOST_WIDE_INT highest_pow2_factor_for_type PARAMS ((tree,
174 static int is_aligning_offset PARAMS ((tree, tree));
175 static rtx expand_increment PARAMS ((tree, int, int));
176 static rtx do_store_flag PARAMS ((tree, rtx, enum machine_mode, int));
178 static void emit_single_push_insn PARAMS ((enum machine_mode, rtx, tree));
180 static void do_tablejump PARAMS ((rtx, enum machine_mode, rtx, rtx, rtx));
181 static rtx const_vector_from_tree PARAMS ((tree));
183 /* Record for each mode whether we can move a register directly to or
184 from an object of that mode in memory. If we can't, we won't try
185 to use that mode directly when accessing a field of that mode. */
187 static char direct_load[NUM_MACHINE_MODES];
188 static char direct_store[NUM_MACHINE_MODES];
190 /* Record for each mode whether we can float-extend from memory. */
192 static bool float_extend_from_mem[NUM_MACHINE_MODES][NUM_MACHINE_MODES];
194 /* If a memory-to-memory move would take MOVE_RATIO or more simple
195 move-instruction sequences, we will do a movstr or libcall instead. */
198 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
201 /* If we are optimizing for space (-Os), cut down the default move ratio. */
202 #define MOVE_RATIO (optimize_size ? 3 : 15)
206 /* This macro is used to determine whether move_by_pieces should be called
207 to perform a structure copy. */
208 #ifndef MOVE_BY_PIECES_P
209 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
210 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) MOVE_RATIO)
213 /* If a clear memory operation would take CLEAR_RATIO or more simple
214 move-instruction sequences, we will do a clrstr or libcall instead. */
217 #if defined (HAVE_clrstrqi) || defined (HAVE_clrstrhi) || defined (HAVE_clrstrsi) || defined (HAVE_clrstrdi) || defined (HAVE_clrstrti)
218 #define CLEAR_RATIO 2
220 /* If we are optimizing for space, cut down the default clear ratio. */
221 #define CLEAR_RATIO (optimize_size ? 3 : 15)
225 /* This macro is used to determine whether clear_by_pieces should be
226 called to clear storage. */
227 #ifndef CLEAR_BY_PIECES_P
228 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
229 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) CLEAR_RATIO)
232 /* This macro is used to determine whether store_by_pieces should be
233 called to "memset" storage with byte values other than zero, or
234 to "memcpy" storage when the source is a constant string. */
235 #ifndef STORE_BY_PIECES_P
236 #define STORE_BY_PIECES_P(SIZE, ALIGN) MOVE_BY_PIECES_P (SIZE, ALIGN)
239 /* This array records the insn_code of insns to perform block moves. */
240 enum insn_code movstr_optab[NUM_MACHINE_MODES];
242 /* This array records the insn_code of insns to perform block clears. */
243 enum insn_code clrstr_optab[NUM_MACHINE_MODES];
245 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
247 #ifndef SLOW_UNALIGNED_ACCESS
248 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
251 /* This is run once per compilation to set up which modes can be used
252 directly in memory and to initialize the block move optab. */
258 enum machine_mode mode;
263 /* Try indexing by frame ptr and try by stack ptr.
264 It is known that on the Convex the stack ptr isn't a valid index.
265 With luck, one or the other is valid on any machine. */
266 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
267 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
269 /* A scratch register we can modify in-place below to avoid
270 useless RTL allocations. */
271 reg = gen_rtx_REG (VOIDmode, -1);
273 insn = rtx_alloc (INSN);
274 pat = gen_rtx_SET (0, NULL_RTX, NULL_RTX);
275 PATTERN (insn) = pat;
277 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
278 mode = (enum machine_mode) ((int) mode + 1))
282 direct_load[(int) mode] = direct_store[(int) mode] = 0;
283 PUT_MODE (mem, mode);
284 PUT_MODE (mem1, mode);
285 PUT_MODE (reg, mode);
287 /* See if there is some register that can be used in this mode and
288 directly loaded or stored from memory. */
290 if (mode != VOIDmode && mode != BLKmode)
291 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
292 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
295 if (! HARD_REGNO_MODE_OK (regno, mode))
301 SET_DEST (pat) = reg;
302 if (recog (pat, insn, &num_clobbers) >= 0)
303 direct_load[(int) mode] = 1;
305 SET_SRC (pat) = mem1;
306 SET_DEST (pat) = reg;
307 if (recog (pat, insn, &num_clobbers) >= 0)
308 direct_load[(int) mode] = 1;
311 SET_DEST (pat) = mem;
312 if (recog (pat, insn, &num_clobbers) >= 0)
313 direct_store[(int) mode] = 1;
316 SET_DEST (pat) = mem1;
317 if (recog (pat, insn, &num_clobbers) >= 0)
318 direct_store[(int) mode] = 1;
322 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
324 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
325 mode = GET_MODE_WIDER_MODE (mode))
327 enum machine_mode srcmode;
328 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
329 srcmode = GET_MODE_WIDER_MODE (srcmode))
333 ic = can_extend_p (mode, srcmode, 0);
334 if (ic == CODE_FOR_nothing)
337 PUT_MODE (mem, srcmode);
339 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
340 float_extend_from_mem[mode][srcmode] = true;
345 /* This is run at the start of compiling a function. */
350 cfun->expr = (struct expr_status *) ggc_alloc (sizeof (struct expr_status));
353 pending_stack_adjust = 0;
354 stack_pointer_delta = 0;
355 inhibit_defer_pop = 0;
357 apply_args_value = 0;
361 /* Small sanity check that the queue is empty at the end of a function. */
364 finish_expr_for_function ()
370 /* Manage the queue of increment instructions to be output
371 for POSTINCREMENT_EXPR expressions, etc. */
373 /* Queue up to increment (or change) VAR later. BODY says how:
374 BODY should be the same thing you would pass to emit_insn
375 to increment right away. It will go to emit_insn later on.
377 The value is a QUEUED expression to be used in place of VAR
378 where you want to guarantee the pre-incrementation value of VAR. */
381 enqueue_insn (var, body)
384 pending_chain = gen_rtx_QUEUED (GET_MODE (var), var, NULL_RTX, NULL_RTX,
385 body, pending_chain);
386 return pending_chain;
389 /* Use protect_from_queue to convert a QUEUED expression
390 into something that you can put immediately into an instruction.
391 If the queued incrementation has not happened yet,
392 protect_from_queue returns the variable itself.
393 If the incrementation has happened, protect_from_queue returns a temp
394 that contains a copy of the old value of the variable.
396 Any time an rtx which might possibly be a QUEUED is to be put
397 into an instruction, it must be passed through protect_from_queue first.
398 QUEUED expressions are not meaningful in instructions.
400 Do not pass a value through protect_from_queue and then hold
401 on to it for a while before putting it in an instruction!
402 If the queue is flushed in between, incorrect code will result. */
405 protect_from_queue (x, modify)
409 RTX_CODE code = GET_CODE (x);
411 #if 0 /* A QUEUED can hang around after the queue is forced out. */
412 /* Shortcut for most common case. */
413 if (pending_chain == 0)
419 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
420 use of autoincrement. Make a copy of the contents of the memory
421 location rather than a copy of the address, but not if the value is
422 of mode BLKmode. Don't modify X in place since it might be
424 if (code == MEM && GET_MODE (x) != BLKmode
425 && GET_CODE (XEXP (x, 0)) == QUEUED && !modify)
428 rtx new = replace_equiv_address_nv (x, QUEUED_VAR (y));
432 rtx temp = gen_reg_rtx (GET_MODE (x));
434 emit_insn_before (gen_move_insn (temp, new),
439 /* Copy the address into a pseudo, so that the returned value
440 remains correct across calls to emit_queue. */
441 return replace_equiv_address (new, copy_to_reg (XEXP (new, 0)));
444 /* Otherwise, recursively protect the subexpressions of all
445 the kinds of rtx's that can contain a QUEUED. */
448 rtx tem = protect_from_queue (XEXP (x, 0), 0);
449 if (tem != XEXP (x, 0))
455 else if (code == PLUS || code == MULT)
457 rtx new0 = protect_from_queue (XEXP (x, 0), 0);
458 rtx new1 = protect_from_queue (XEXP (x, 1), 0);
459 if (new0 != XEXP (x, 0) || new1 != XEXP (x, 1))
468 /* If the increment has not happened, use the variable itself. Copy it
469 into a new pseudo so that the value remains correct across calls to
471 if (QUEUED_INSN (x) == 0)
472 return copy_to_reg (QUEUED_VAR (x));
473 /* If the increment has happened and a pre-increment copy exists,
475 if (QUEUED_COPY (x) != 0)
476 return QUEUED_COPY (x);
477 /* The increment has happened but we haven't set up a pre-increment copy.
478 Set one up now, and use it. */
479 QUEUED_COPY (x) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x)));
480 emit_insn_before (gen_move_insn (QUEUED_COPY (x), QUEUED_VAR (x)),
482 return QUEUED_COPY (x);
485 /* Return nonzero if X contains a QUEUED expression:
486 if it contains anything that will be altered by a queued increment.
487 We handle only combinations of MEM, PLUS, MINUS and MULT operators
488 since memory addresses generally contain only those. */
494 enum rtx_code code = GET_CODE (x);
500 return queued_subexp_p (XEXP (x, 0));
504 return (queued_subexp_p (XEXP (x, 0))
505 || queued_subexp_p (XEXP (x, 1)));
511 /* Perform all the pending incrementations. */
517 while ((p = pending_chain))
519 rtx body = QUEUED_BODY (p);
521 switch (GET_CODE (body))
529 QUEUED_INSN (p) = body;
533 #ifdef ENABLE_CHECKING
540 QUEUED_INSN (p) = emit_insn (body);
544 pending_chain = QUEUED_NEXT (p);
548 /* Copy data from FROM to TO, where the machine modes are not the same.
549 Both modes may be integer, or both may be floating.
550 UNSIGNEDP should be nonzero if FROM is an unsigned type.
551 This causes zero-extension instead of sign-extension. */
554 convert_move (to, from, unsignedp)
558 enum machine_mode to_mode = GET_MODE (to);
559 enum machine_mode from_mode = GET_MODE (from);
560 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
561 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
565 /* rtx code for making an equivalent value. */
566 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
567 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
569 to = protect_from_queue (to, 1);
570 from = protect_from_queue (from, 0);
572 if (to_real != from_real)
575 /* If FROM is a SUBREG that indicates that we have already done at least
576 the required extension, strip it. We don't handle such SUBREGs as
579 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
580 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
581 >= GET_MODE_SIZE (to_mode))
582 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
583 from = gen_lowpart (to_mode, from), from_mode = to_mode;
585 if (GET_CODE (to) == SUBREG && SUBREG_PROMOTED_VAR_P (to))
588 if (to_mode == from_mode
589 || (from_mode == VOIDmode && CONSTANT_P (from)))
591 emit_move_insn (to, from);
595 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
597 if (GET_MODE_BITSIZE (from_mode) != GET_MODE_BITSIZE (to_mode))
600 if (VECTOR_MODE_P (to_mode))
601 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
603 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
605 emit_move_insn (to, from);
609 if (to_real != from_real)
616 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode))
618 /* Try converting directly if the insn is supported. */
619 if ((code = can_extend_p (to_mode, from_mode, 0))
622 emit_unop_insn (code, to, from, UNKNOWN);
627 #ifdef HAVE_trunchfqf2
628 if (HAVE_trunchfqf2 && from_mode == HFmode && to_mode == QFmode)
630 emit_unop_insn (CODE_FOR_trunchfqf2, to, from, UNKNOWN);
634 #ifdef HAVE_trunctqfqf2
635 if (HAVE_trunctqfqf2 && from_mode == TQFmode && to_mode == QFmode)
637 emit_unop_insn (CODE_FOR_trunctqfqf2, to, from, UNKNOWN);
641 #ifdef HAVE_truncsfqf2
642 if (HAVE_truncsfqf2 && from_mode == SFmode && to_mode == QFmode)
644 emit_unop_insn (CODE_FOR_truncsfqf2, to, from, UNKNOWN);
648 #ifdef HAVE_truncdfqf2
649 if (HAVE_truncdfqf2 && from_mode == DFmode && to_mode == QFmode)
651 emit_unop_insn (CODE_FOR_truncdfqf2, to, from, UNKNOWN);
655 #ifdef HAVE_truncxfqf2
656 if (HAVE_truncxfqf2 && from_mode == XFmode && to_mode == QFmode)
658 emit_unop_insn (CODE_FOR_truncxfqf2, to, from, UNKNOWN);
662 #ifdef HAVE_trunctfqf2
663 if (HAVE_trunctfqf2 && from_mode == TFmode && to_mode == QFmode)
665 emit_unop_insn (CODE_FOR_trunctfqf2, to, from, UNKNOWN);
670 #ifdef HAVE_trunctqfhf2
671 if (HAVE_trunctqfhf2 && from_mode == TQFmode && to_mode == HFmode)
673 emit_unop_insn (CODE_FOR_trunctqfhf2, to, from, UNKNOWN);
677 #ifdef HAVE_truncsfhf2
678 if (HAVE_truncsfhf2 && from_mode == SFmode && to_mode == HFmode)
680 emit_unop_insn (CODE_FOR_truncsfhf2, to, from, UNKNOWN);
684 #ifdef HAVE_truncdfhf2
685 if (HAVE_truncdfhf2 && from_mode == DFmode && to_mode == HFmode)
687 emit_unop_insn (CODE_FOR_truncdfhf2, to, from, UNKNOWN);
691 #ifdef HAVE_truncxfhf2
692 if (HAVE_truncxfhf2 && from_mode == XFmode && to_mode == HFmode)
694 emit_unop_insn (CODE_FOR_truncxfhf2, to, from, UNKNOWN);
698 #ifdef HAVE_trunctfhf2
699 if (HAVE_trunctfhf2 && from_mode == TFmode && to_mode == HFmode)
701 emit_unop_insn (CODE_FOR_trunctfhf2, to, from, UNKNOWN);
706 #ifdef HAVE_truncsftqf2
707 if (HAVE_truncsftqf2 && from_mode == SFmode && to_mode == TQFmode)
709 emit_unop_insn (CODE_FOR_truncsftqf2, to, from, UNKNOWN);
713 #ifdef HAVE_truncdftqf2
714 if (HAVE_truncdftqf2 && from_mode == DFmode && to_mode == TQFmode)
716 emit_unop_insn (CODE_FOR_truncdftqf2, to, from, UNKNOWN);
720 #ifdef HAVE_truncxftqf2
721 if (HAVE_truncxftqf2 && from_mode == XFmode && to_mode == TQFmode)
723 emit_unop_insn (CODE_FOR_truncxftqf2, to, from, UNKNOWN);
727 #ifdef HAVE_trunctftqf2
728 if (HAVE_trunctftqf2 && from_mode == TFmode && to_mode == TQFmode)
730 emit_unop_insn (CODE_FOR_trunctftqf2, to, from, UNKNOWN);
735 #ifdef HAVE_truncdfsf2
736 if (HAVE_truncdfsf2 && from_mode == DFmode && to_mode == SFmode)
738 emit_unop_insn (CODE_FOR_truncdfsf2, to, from, UNKNOWN);
742 #ifdef HAVE_truncxfsf2
743 if (HAVE_truncxfsf2 && from_mode == XFmode && to_mode == SFmode)
745 emit_unop_insn (CODE_FOR_truncxfsf2, to, from, UNKNOWN);
749 #ifdef HAVE_trunctfsf2
750 if (HAVE_trunctfsf2 && from_mode == TFmode && to_mode == SFmode)
752 emit_unop_insn (CODE_FOR_trunctfsf2, to, from, UNKNOWN);
756 #ifdef HAVE_truncxfdf2
757 if (HAVE_truncxfdf2 && from_mode == XFmode && to_mode == DFmode)
759 emit_unop_insn (CODE_FOR_truncxfdf2, to, from, UNKNOWN);
763 #ifdef HAVE_trunctfdf2
764 if (HAVE_trunctfdf2 && from_mode == TFmode && to_mode == DFmode)
766 emit_unop_insn (CODE_FOR_trunctfdf2, to, from, UNKNOWN);
778 libcall = extendsfdf2_libfunc;
782 libcall = extendsfxf2_libfunc;
786 libcall = extendsftf2_libfunc;
798 libcall = truncdfsf2_libfunc;
802 libcall = extenddfxf2_libfunc;
806 libcall = extenddftf2_libfunc;
818 libcall = truncxfsf2_libfunc;
822 libcall = truncxfdf2_libfunc;
834 libcall = trunctfsf2_libfunc;
838 libcall = trunctfdf2_libfunc;
850 if (libcall == (rtx) 0)
851 /* This conversion is not implemented yet. */
855 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
857 insns = get_insns ();
859 emit_libcall_block (insns, to, value, gen_rtx_FLOAT_TRUNCATE (to_mode,
864 /* Now both modes are integers. */
866 /* Handle expanding beyond a word. */
867 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
868 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
875 enum machine_mode lowpart_mode;
876 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
878 /* Try converting directly if the insn is supported. */
879 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
882 /* If FROM is a SUBREG, put it into a register. Do this
883 so that we always generate the same set of insns for
884 better cse'ing; if an intermediate assignment occurred,
885 we won't be doing the operation directly on the SUBREG. */
886 if (optimize > 0 && GET_CODE (from) == SUBREG)
887 from = force_reg (from_mode, from);
888 emit_unop_insn (code, to, from, equiv_code);
891 /* Next, try converting via full word. */
892 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
893 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
894 != CODE_FOR_nothing))
896 if (GET_CODE (to) == REG)
897 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
898 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
899 emit_unop_insn (code, to,
900 gen_lowpart (word_mode, to), equiv_code);
904 /* No special multiword conversion insn; do it by hand. */
907 /* Since we will turn this into a no conflict block, we must ensure
908 that the source does not overlap the target. */
910 if (reg_overlap_mentioned_p (to, from))
911 from = force_reg (from_mode, from);
913 /* Get a copy of FROM widened to a word, if necessary. */
914 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
915 lowpart_mode = word_mode;
917 lowpart_mode = from_mode;
919 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
921 lowpart = gen_lowpart (lowpart_mode, to);
922 emit_move_insn (lowpart, lowfrom);
924 /* Compute the value to put in each remaining word. */
926 fill_value = const0_rtx;
931 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
932 && STORE_FLAG_VALUE == -1)
934 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
936 fill_value = gen_reg_rtx (word_mode);
937 emit_insn (gen_slt (fill_value));
943 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
944 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
946 fill_value = convert_to_mode (word_mode, fill_value, 1);
950 /* Fill the remaining words. */
951 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
953 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
954 rtx subword = operand_subword (to, index, 1, to_mode);
959 if (fill_value != subword)
960 emit_move_insn (subword, fill_value);
963 insns = get_insns ();
966 emit_no_conflict_block (insns, to, from, NULL_RTX,
967 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
971 /* Truncating multi-word to a word or less. */
972 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
973 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
975 if (!((GET_CODE (from) == MEM
976 && ! MEM_VOLATILE_P (from)
977 && direct_load[(int) to_mode]
978 && ! mode_dependent_address_p (XEXP (from, 0)))
979 || GET_CODE (from) == REG
980 || GET_CODE (from) == SUBREG))
981 from = force_reg (from_mode, from);
982 convert_move (to, gen_lowpart (word_mode, from), 0);
986 /* Handle pointer conversion. */ /* SPEE 900220. */
987 if (to_mode == PQImode)
989 if (from_mode != QImode)
990 from = convert_to_mode (QImode, from, unsignedp);
992 #ifdef HAVE_truncqipqi2
993 if (HAVE_truncqipqi2)
995 emit_unop_insn (CODE_FOR_truncqipqi2, to, from, UNKNOWN);
998 #endif /* HAVE_truncqipqi2 */
1002 if (from_mode == PQImode)
1004 if (to_mode != QImode)
1006 from = convert_to_mode (QImode, from, unsignedp);
1011 #ifdef HAVE_extendpqiqi2
1012 if (HAVE_extendpqiqi2)
1014 emit_unop_insn (CODE_FOR_extendpqiqi2, to, from, UNKNOWN);
1017 #endif /* HAVE_extendpqiqi2 */
1022 if (to_mode == PSImode)
1024 if (from_mode != SImode)
1025 from = convert_to_mode (SImode, from, unsignedp);
1027 #ifdef HAVE_truncsipsi2
1028 if (HAVE_truncsipsi2)
1030 emit_unop_insn (CODE_FOR_truncsipsi2, to, from, UNKNOWN);
1033 #endif /* HAVE_truncsipsi2 */
1037 if (from_mode == PSImode)
1039 if (to_mode != SImode)
1041 from = convert_to_mode (SImode, from, unsignedp);
1046 #ifdef HAVE_extendpsisi2
1047 if (! unsignedp && HAVE_extendpsisi2)
1049 emit_unop_insn (CODE_FOR_extendpsisi2, to, from, UNKNOWN);
1052 #endif /* HAVE_extendpsisi2 */
1053 #ifdef HAVE_zero_extendpsisi2
1054 if (unsignedp && HAVE_zero_extendpsisi2)
1056 emit_unop_insn (CODE_FOR_zero_extendpsisi2, to, from, UNKNOWN);
1059 #endif /* HAVE_zero_extendpsisi2 */
1064 if (to_mode == PDImode)
1066 if (from_mode != DImode)
1067 from = convert_to_mode (DImode, from, unsignedp);
1069 #ifdef HAVE_truncdipdi2
1070 if (HAVE_truncdipdi2)
1072 emit_unop_insn (CODE_FOR_truncdipdi2, to, from, UNKNOWN);
1075 #endif /* HAVE_truncdipdi2 */
1079 if (from_mode == PDImode)
1081 if (to_mode != DImode)
1083 from = convert_to_mode (DImode, from, unsignedp);
1088 #ifdef HAVE_extendpdidi2
1089 if (HAVE_extendpdidi2)
1091 emit_unop_insn (CODE_FOR_extendpdidi2, to, from, UNKNOWN);
1094 #endif /* HAVE_extendpdidi2 */
1099 /* Now follow all the conversions between integers
1100 no more than a word long. */
1102 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1103 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
1104 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1105 GET_MODE_BITSIZE (from_mode)))
1107 if (!((GET_CODE (from) == MEM
1108 && ! MEM_VOLATILE_P (from)
1109 && direct_load[(int) to_mode]
1110 && ! mode_dependent_address_p (XEXP (from, 0)))
1111 || GET_CODE (from) == REG
1112 || GET_CODE (from) == SUBREG))
1113 from = force_reg (from_mode, from);
1114 if (GET_CODE (from) == REG && REGNO (from) < FIRST_PSEUDO_REGISTER
1115 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
1116 from = copy_to_reg (from);
1117 emit_move_insn (to, gen_lowpart (to_mode, from));
1121 /* Handle extension. */
1122 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
1124 /* Convert directly if that works. */
1125 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
1126 != CODE_FOR_nothing)
1129 from = force_not_mem (from);
1131 emit_unop_insn (code, to, from, equiv_code);
1136 enum machine_mode intermediate;
1140 /* Search for a mode to convert via. */
1141 for (intermediate = from_mode; intermediate != VOIDmode;
1142 intermediate = GET_MODE_WIDER_MODE (intermediate))
1143 if (((can_extend_p (to_mode, intermediate, unsignedp)
1144 != CODE_FOR_nothing)
1145 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
1146 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1147 GET_MODE_BITSIZE (intermediate))))
1148 && (can_extend_p (intermediate, from_mode, unsignedp)
1149 != CODE_FOR_nothing))
1151 convert_move (to, convert_to_mode (intermediate, from,
1152 unsignedp), unsignedp);
1156 /* No suitable intermediate mode.
1157 Generate what we need with shifts. */
1158 shift_amount = build_int_2 (GET_MODE_BITSIZE (to_mode)
1159 - GET_MODE_BITSIZE (from_mode), 0);
1160 from = gen_lowpart (to_mode, force_reg (from_mode, from));
1161 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
1163 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
1166 emit_move_insn (to, tmp);
1171 /* Support special truncate insns for certain modes. */
1173 if (from_mode == DImode && to_mode == SImode)
1175 #ifdef HAVE_truncdisi2
1176 if (HAVE_truncdisi2)
1178 emit_unop_insn (CODE_FOR_truncdisi2, to, from, UNKNOWN);
1182 convert_move (to, force_reg (from_mode, from), unsignedp);
1186 if (from_mode == DImode && to_mode == HImode)
1188 #ifdef HAVE_truncdihi2
1189 if (HAVE_truncdihi2)
1191 emit_unop_insn (CODE_FOR_truncdihi2, to, from, UNKNOWN);
1195 convert_move (to, force_reg (from_mode, from), unsignedp);
1199 if (from_mode == DImode && to_mode == QImode)
1201 #ifdef HAVE_truncdiqi2
1202 if (HAVE_truncdiqi2)
1204 emit_unop_insn (CODE_FOR_truncdiqi2, to, from, UNKNOWN);
1208 convert_move (to, force_reg (from_mode, from), unsignedp);
1212 if (from_mode == SImode && to_mode == HImode)
1214 #ifdef HAVE_truncsihi2
1215 if (HAVE_truncsihi2)
1217 emit_unop_insn (CODE_FOR_truncsihi2, to, from, UNKNOWN);
1221 convert_move (to, force_reg (from_mode, from), unsignedp);
1225 if (from_mode == SImode && to_mode == QImode)
1227 #ifdef HAVE_truncsiqi2
1228 if (HAVE_truncsiqi2)
1230 emit_unop_insn (CODE_FOR_truncsiqi2, to, from, UNKNOWN);
1234 convert_move (to, force_reg (from_mode, from), unsignedp);
1238 if (from_mode == HImode && to_mode == QImode)
1240 #ifdef HAVE_trunchiqi2
1241 if (HAVE_trunchiqi2)
1243 emit_unop_insn (CODE_FOR_trunchiqi2, to, from, UNKNOWN);
1247 convert_move (to, force_reg (from_mode, from), unsignedp);
1251 if (from_mode == TImode && to_mode == DImode)
1253 #ifdef HAVE_trunctidi2
1254 if (HAVE_trunctidi2)
1256 emit_unop_insn (CODE_FOR_trunctidi2, to, from, UNKNOWN);
1260 convert_move (to, force_reg (from_mode, from), unsignedp);
1264 if (from_mode == TImode && to_mode == SImode)
1266 #ifdef HAVE_trunctisi2
1267 if (HAVE_trunctisi2)
1269 emit_unop_insn (CODE_FOR_trunctisi2, to, from, UNKNOWN);
1273 convert_move (to, force_reg (from_mode, from), unsignedp);
1277 if (from_mode == TImode && to_mode == HImode)
1279 #ifdef HAVE_trunctihi2
1280 if (HAVE_trunctihi2)
1282 emit_unop_insn (CODE_FOR_trunctihi2, to, from, UNKNOWN);
1286 convert_move (to, force_reg (from_mode, from), unsignedp);
1290 if (from_mode == TImode && to_mode == QImode)
1292 #ifdef HAVE_trunctiqi2
1293 if (HAVE_trunctiqi2)
1295 emit_unop_insn (CODE_FOR_trunctiqi2, to, from, UNKNOWN);
1299 convert_move (to, force_reg (from_mode, from), unsignedp);
1303 /* Handle truncation of volatile memrefs, and so on;
1304 the things that couldn't be truncated directly,
1305 and for which there was no special instruction. */
1306 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
1308 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
1309 emit_move_insn (to, temp);
1313 /* Mode combination is not recognized. */
1317 /* Return an rtx for a value that would result
1318 from converting X to mode MODE.
1319 Both X and MODE may be floating, or both integer.
1320 UNSIGNEDP is nonzero if X is an unsigned value.
1321 This can be done by referring to a part of X in place
1322 or by copying to a new temporary with conversion.
1324 This function *must not* call protect_from_queue
1325 except when putting X into an insn (in which case convert_move does it). */
1328 convert_to_mode (mode, x, unsignedp)
1329 enum machine_mode mode;
1333 return convert_modes (mode, VOIDmode, x, unsignedp);
1336 /* Return an rtx for a value that would result
1337 from converting X from mode OLDMODE to mode MODE.
1338 Both modes may be floating, or both integer.
1339 UNSIGNEDP is nonzero if X is an unsigned value.
1341 This can be done by referring to a part of X in place
1342 or by copying to a new temporary with conversion.
1344 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1346 This function *must not* call protect_from_queue
1347 except when putting X into an insn (in which case convert_move does it). */
1350 convert_modes (mode, oldmode, x, unsignedp)
1351 enum machine_mode mode, oldmode;
1357 /* If FROM is a SUBREG that indicates that we have already done at least
1358 the required extension, strip it. */
1360 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
1361 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
1362 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
1363 x = gen_lowpart (mode, x);
1365 if (GET_MODE (x) != VOIDmode)
1366 oldmode = GET_MODE (x);
1368 if (mode == oldmode)
1371 /* There is one case that we must handle specially: If we are converting
1372 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1373 we are to interpret the constant as unsigned, gen_lowpart will do
1374 the wrong if the constant appears negative. What we want to do is
1375 make the high-order word of the constant zero, not all ones. */
1377 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
1378 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
1379 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
1381 HOST_WIDE_INT val = INTVAL (x);
1383 if (oldmode != VOIDmode
1384 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
1386 int width = GET_MODE_BITSIZE (oldmode);
1388 /* We need to zero extend VAL. */
1389 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1392 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
1395 /* We can do this with a gen_lowpart if both desired and current modes
1396 are integer, and this is either a constant integer, a register, or a
1397 non-volatile MEM. Except for the constant case where MODE is no
1398 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1400 if ((GET_CODE (x) == CONST_INT
1401 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
1402 || (GET_MODE_CLASS (mode) == MODE_INT
1403 && GET_MODE_CLASS (oldmode) == MODE_INT
1404 && (GET_CODE (x) == CONST_DOUBLE
1405 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
1406 && ((GET_CODE (x) == MEM && ! MEM_VOLATILE_P (x)
1407 && direct_load[(int) mode])
1408 || (GET_CODE (x) == REG
1409 && (! HARD_REGISTER_P (x)
1410 || HARD_REGNO_MODE_OK (REGNO (x), mode))
1411 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1412 GET_MODE_BITSIZE (GET_MODE (x)))))))))
1414 /* ?? If we don't know OLDMODE, we have to assume here that
1415 X does not need sign- or zero-extension. This may not be
1416 the case, but it's the best we can do. */
1417 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
1418 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
1420 HOST_WIDE_INT val = INTVAL (x);
1421 int width = GET_MODE_BITSIZE (oldmode);
1423 /* We must sign or zero-extend in this case. Start by
1424 zero-extending, then sign extend if we need to. */
1425 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1427 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
1428 val |= (HOST_WIDE_INT) (-1) << width;
1430 return gen_int_mode (val, mode);
1433 return gen_lowpart (mode, x);
1436 temp = gen_reg_rtx (mode);
1437 convert_move (temp, x, unsignedp);
1441 /* This macro is used to determine what the largest unit size that
1442 move_by_pieces can use is. */
1444 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1445 move efficiently, as opposed to MOVE_MAX which is the maximum
1446 number of bytes we can move with a single instruction. */
1448 #ifndef MOVE_MAX_PIECES
1449 #define MOVE_MAX_PIECES MOVE_MAX
1452 /* STORE_MAX_PIECES is the number of bytes at a time that we can
1453 store efficiently. Due to internal GCC limitations, this is
1454 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
1455 for an immediate constant. */
1457 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
1459 /* Generate several move instructions to copy LEN bytes from block FROM to
1460 block TO. (These are MEM rtx's with BLKmode). The caller must pass FROM
1461 and TO through protect_from_queue before calling.
1463 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
1464 used to push FROM to the stack.
1466 ALIGN is maximum stack alignment we can assume. */
1469 move_by_pieces (to, from, len, align)
1471 unsigned HOST_WIDE_INT len;
1474 struct move_by_pieces data;
1475 rtx to_addr, from_addr = XEXP (from, 0);
1476 unsigned int max_size = MOVE_MAX_PIECES + 1;
1477 enum machine_mode mode = VOIDmode, tmode;
1478 enum insn_code icode;
1480 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
1483 data.from_addr = from_addr;
1486 to_addr = XEXP (to, 0);
1489 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
1490 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
1492 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
1499 #ifdef STACK_GROWS_DOWNWARD
1505 data.to_addr = to_addr;
1508 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
1509 || GET_CODE (from_addr) == POST_INC
1510 || GET_CODE (from_addr) == POST_DEC);
1512 data.explicit_inc_from = 0;
1513 data.explicit_inc_to = 0;
1514 if (data.reverse) data.offset = len;
1517 /* If copying requires more than two move insns,
1518 copy addresses to registers (to make displacements shorter)
1519 and use post-increment if available. */
1520 if (!(data.autinc_from && data.autinc_to)
1521 && move_by_pieces_ninsns (len, align) > 2)
1523 /* Find the mode of the largest move... */
1524 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1525 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1526 if (GET_MODE_SIZE (tmode) < max_size)
1529 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
1531 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
1532 data.autinc_from = 1;
1533 data.explicit_inc_from = -1;
1535 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
1537 data.from_addr = copy_addr_to_reg (from_addr);
1538 data.autinc_from = 1;
1539 data.explicit_inc_from = 1;
1541 if (!data.autinc_from && CONSTANT_P (from_addr))
1542 data.from_addr = copy_addr_to_reg (from_addr);
1543 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
1545 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
1547 data.explicit_inc_to = -1;
1549 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
1551 data.to_addr = copy_addr_to_reg (to_addr);
1553 data.explicit_inc_to = 1;
1555 if (!data.autinc_to && CONSTANT_P (to_addr))
1556 data.to_addr = copy_addr_to_reg (to_addr);
1559 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1560 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1561 align = MOVE_MAX * BITS_PER_UNIT;
1563 /* First move what we can in the largest integer mode, then go to
1564 successively smaller modes. */
1566 while (max_size > 1)
1568 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1569 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1570 if (GET_MODE_SIZE (tmode) < max_size)
1573 if (mode == VOIDmode)
1576 icode = mov_optab->handlers[(int) mode].insn_code;
1577 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1578 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1580 max_size = GET_MODE_SIZE (mode);
1583 /* The code above should have handled everything. */
1588 /* Return number of insns required to move L bytes by pieces.
1589 ALIGN (in bits) is maximum alignment we can assume. */
1591 static unsigned HOST_WIDE_INT
1592 move_by_pieces_ninsns (l, align)
1593 unsigned HOST_WIDE_INT l;
1596 unsigned HOST_WIDE_INT n_insns = 0;
1597 unsigned HOST_WIDE_INT max_size = MOVE_MAX + 1;
1599 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1600 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1601 align = MOVE_MAX * BITS_PER_UNIT;
1603 while (max_size > 1)
1605 enum machine_mode mode = VOIDmode, tmode;
1606 enum insn_code icode;
1608 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1609 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1610 if (GET_MODE_SIZE (tmode) < max_size)
1613 if (mode == VOIDmode)
1616 icode = mov_optab->handlers[(int) mode].insn_code;
1617 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1618 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1620 max_size = GET_MODE_SIZE (mode);
1628 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1629 with move instructions for mode MODE. GENFUN is the gen_... function
1630 to make a move insn for that mode. DATA has all the other info. */
1633 move_by_pieces_1 (genfun, mode, data)
1634 rtx (*genfun) PARAMS ((rtx, ...));
1635 enum machine_mode mode;
1636 struct move_by_pieces *data;
1638 unsigned int size = GET_MODE_SIZE (mode);
1639 rtx to1 = NULL_RTX, from1;
1641 while (data->len >= size)
1644 data->offset -= size;
1648 if (data->autinc_to)
1649 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1652 to1 = adjust_address (data->to, mode, data->offset);
1655 if (data->autinc_from)
1656 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1659 from1 = adjust_address (data->from, mode, data->offset);
1661 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1662 emit_insn (gen_add2_insn (data->to_addr,
1663 GEN_INT (-(HOST_WIDE_INT)size)));
1664 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1665 emit_insn (gen_add2_insn (data->from_addr,
1666 GEN_INT (-(HOST_WIDE_INT)size)));
1669 emit_insn ((*genfun) (to1, from1));
1672 #ifdef PUSH_ROUNDING
1673 emit_single_push_insn (mode, from1, NULL);
1679 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1680 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1681 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1682 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1684 if (! data->reverse)
1685 data->offset += size;
1691 /* Emit code to move a block Y to a block X. This may be done with
1692 string-move instructions, with multiple scalar move instructions,
1693 or with a library call.
1695 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1696 SIZE is an rtx that says how long they are.
1697 ALIGN is the maximum alignment we can assume they have.
1698 METHOD describes what kind of copy this is, and what mechanisms may be used.
1700 Return the address of the new block, if memcpy is called and returns it,
1704 emit_block_move (x, y, size, method)
1706 enum block_op_methods method;
1714 case BLOCK_OP_NORMAL:
1715 may_use_call = true;
1718 case BLOCK_OP_CALL_PARM:
1719 may_use_call = block_move_libcall_safe_for_call_parm ();
1721 /* Make inhibit_defer_pop nonzero around the library call
1722 to force it to pop the arguments right away. */
1726 case BLOCK_OP_NO_LIBCALL:
1727 may_use_call = false;
1734 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1736 if (GET_MODE (x) != BLKmode)
1738 if (GET_MODE (y) != BLKmode)
1741 x = protect_from_queue (x, 1);
1742 y = protect_from_queue (y, 0);
1743 size = protect_from_queue (size, 0);
1745 if (GET_CODE (x) != MEM)
1747 if (GET_CODE (y) != MEM)
1752 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1753 can be incorrect is coming from __builtin_memcpy. */
1754 if (GET_CODE (size) == CONST_INT)
1756 x = shallow_copy_rtx (x);
1757 y = shallow_copy_rtx (y);
1758 set_mem_size (x, size);
1759 set_mem_size (y, size);
1762 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1763 move_by_pieces (x, y, INTVAL (size), align);
1764 else if (emit_block_move_via_movstr (x, y, size, align))
1766 else if (may_use_call)
1767 retval = emit_block_move_via_libcall (x, y, size);
1769 emit_block_move_via_loop (x, y, size, align);
1771 if (method == BLOCK_OP_CALL_PARM)
1777 /* A subroutine of emit_block_move. Returns true if calling the
1778 block move libcall will not clobber any parameters which may have
1779 already been placed on the stack. */
1782 block_move_libcall_safe_for_call_parm ()
1788 /* Check to see whether memcpy takes all register arguments. */
1790 takes_regs_uninit, takes_regs_no, takes_regs_yes
1791 } takes_regs = takes_regs_uninit;
1795 case takes_regs_uninit:
1797 CUMULATIVE_ARGS args_so_far;
1800 fn = emit_block_move_libcall_fn (false);
1801 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0);
1803 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1804 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1806 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1807 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1808 if (!tmp || !REG_P (tmp))
1809 goto fail_takes_regs;
1810 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1811 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode,
1813 goto fail_takes_regs;
1815 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1818 takes_regs = takes_regs_yes;
1821 case takes_regs_yes:
1825 takes_regs = takes_regs_no;
1836 /* A subroutine of emit_block_move. Expand a movstr pattern;
1837 return true if successful. */
1840 emit_block_move_via_movstr (x, y, size, align)
1844 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1845 enum machine_mode mode;
1847 /* Since this is a move insn, we don't care about volatility. */
1850 /* Try the most limited insn first, because there's no point
1851 including more than one in the machine description unless
1852 the more limited one has some advantage. */
1854 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1855 mode = GET_MODE_WIDER_MODE (mode))
1857 enum insn_code code = movstr_optab[(int) mode];
1858 insn_operand_predicate_fn pred;
1860 if (code != CODE_FOR_nothing
1861 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1862 here because if SIZE is less than the mode mask, as it is
1863 returned by the macro, it will definitely be less than the
1864 actual mode mask. */
1865 && ((GET_CODE (size) == CONST_INT
1866 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1867 <= (GET_MODE_MASK (mode) >> 1)))
1868 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1869 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1870 || (*pred) (x, BLKmode))
1871 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1872 || (*pred) (y, BLKmode))
1873 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1874 || (*pred) (opalign, VOIDmode)))
1877 rtx last = get_last_insn ();
1880 op2 = convert_to_mode (mode, size, 1);
1881 pred = insn_data[(int) code].operand[2].predicate;
1882 if (pred != 0 && ! (*pred) (op2, mode))
1883 op2 = copy_to_mode_reg (mode, op2);
1885 /* ??? When called via emit_block_move_for_call, it'd be
1886 nice if there were some way to inform the backend, so
1887 that it doesn't fail the expansion because it thinks
1888 emitting the libcall would be more efficient. */
1890 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1898 delete_insns_since (last);
1906 /* A subroutine of emit_block_move. Expand a call to memcpy or bcopy.
1907 Return the return value from memcpy, 0 otherwise. */
1910 emit_block_move_via_libcall (dst, src, size)
1913 rtx dst_addr, src_addr;
1914 tree call_expr, arg_list, fn, src_tree, dst_tree, size_tree;
1915 enum machine_mode size_mode;
1918 /* DST, SRC, or SIZE may have been passed through protect_from_queue.
1920 It is unsafe to save the value generated by protect_from_queue and reuse
1921 it later. Consider what happens if emit_queue is called before the
1922 return value from protect_from_queue is used.
1924 Expansion of the CALL_EXPR below will call emit_queue before we are
1925 finished emitting RTL for argument setup. So if we are not careful we
1926 could get the wrong value for an argument.
1928 To avoid this problem we go ahead and emit code to copy the addresses of
1929 DST and SRC and SIZE into new pseudos. We can then place those new
1930 pseudos into an RTL_EXPR and use them later, even after a call to
1933 Note this is not strictly needed for library calls since they do not call
1934 emit_queue before loading their arguments. However, we may need to have
1935 library calls call emit_queue in the future since failing to do so could
1936 cause problems for targets which define SMALL_REGISTER_CLASSES and pass
1937 arguments in registers. */
1939 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1940 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1942 #ifdef POINTERS_EXTEND_UNSIGNED
1943 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1944 src_addr = convert_memory_address (ptr_mode, src_addr);
1947 dst_tree = make_tree (ptr_type_node, dst_addr);
1948 src_tree = make_tree (ptr_type_node, src_addr);
1950 if (TARGET_MEM_FUNCTIONS)
1951 size_mode = TYPE_MODE (sizetype);
1953 size_mode = TYPE_MODE (unsigned_type_node);
1955 size = convert_to_mode (size_mode, size, 1);
1956 size = copy_to_mode_reg (size_mode, size);
1958 /* It is incorrect to use the libcall calling conventions to call
1959 memcpy in this context. This could be a user call to memcpy and
1960 the user may wish to examine the return value from memcpy. For
1961 targets where libcalls and normal calls have different conventions
1962 for returning pointers, we could end up generating incorrect code.
1964 For convenience, we generate the call to bcopy this way as well. */
1966 if (TARGET_MEM_FUNCTIONS)
1967 size_tree = make_tree (sizetype, size);
1969 size_tree = make_tree (unsigned_type_node, size);
1971 fn = emit_block_move_libcall_fn (true);
1972 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
1973 if (TARGET_MEM_FUNCTIONS)
1975 arg_list = tree_cons (NULL_TREE, src_tree, arg_list);
1976 arg_list = tree_cons (NULL_TREE, dst_tree, arg_list);
1980 arg_list = tree_cons (NULL_TREE, dst_tree, arg_list);
1981 arg_list = tree_cons (NULL_TREE, src_tree, arg_list);
1984 /* Now we have to build up the CALL_EXPR itself. */
1985 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1986 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1987 call_expr, arg_list, NULL_TREE);
1988 TREE_SIDE_EFFECTS (call_expr) = 1;
1990 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1992 /* If we are initializing a readonly value, show the above call clobbered
1993 it. Otherwise, a load from it may erroneously be hoisted from a loop, or
1994 the delay slot scheduler might overlook conflicts and take nasty
1996 if (RTX_UNCHANGING_P (dst))
1997 add_function_usage_to
1998 (last_call_insn (), gen_rtx_EXPR_LIST (VOIDmode,
1999 gen_rtx_CLOBBER (VOIDmode, dst),
2002 return TARGET_MEM_FUNCTIONS ? retval : NULL_RTX;
2005 /* A subroutine of emit_block_move_via_libcall. Create the tree node
2006 for the function we use for block copies. The first time FOR_CALL
2007 is true, we call assemble_external. */
2009 static GTY(()) tree block_move_fn;
2012 init_block_move_fn (asmspec)
2013 const char *asmspec;
2019 if (TARGET_MEM_FUNCTIONS)
2021 fn = get_identifier ("memcpy");
2022 args = build_function_type_list (ptr_type_node, ptr_type_node,
2023 const_ptr_type_node, sizetype,
2028 fn = get_identifier ("bcopy");
2029 args = build_function_type_list (void_type_node, const_ptr_type_node,
2030 ptr_type_node, unsigned_type_node,
2034 fn = build_decl (FUNCTION_DECL, fn, args);
2035 DECL_EXTERNAL (fn) = 1;
2036 TREE_PUBLIC (fn) = 1;
2037 DECL_ARTIFICIAL (fn) = 1;
2038 TREE_NOTHROW (fn) = 1;
2045 SET_DECL_RTL (block_move_fn, NULL_RTX);
2046 SET_DECL_ASSEMBLER_NAME (block_move_fn, get_identifier (asmspec));
2051 emit_block_move_libcall_fn (for_call)
2054 static bool emitted_extern;
2057 init_block_move_fn (NULL);
2059 if (for_call && !emitted_extern)
2061 emitted_extern = true;
2062 make_decl_rtl (block_move_fn, NULL);
2063 assemble_external (block_move_fn);
2066 return block_move_fn;
2069 /* A subroutine of emit_block_move. Copy the data via an explicit
2070 loop. This is used only when libcalls are forbidden. */
2071 /* ??? It'd be nice to copy in hunks larger than QImode. */
2074 emit_block_move_via_loop (x, y, size, align)
2076 unsigned int align ATTRIBUTE_UNUSED;
2078 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
2079 enum machine_mode iter_mode;
2081 iter_mode = GET_MODE (size);
2082 if (iter_mode == VOIDmode)
2083 iter_mode = word_mode;
2085 top_label = gen_label_rtx ();
2086 cmp_label = gen_label_rtx ();
2087 iter = gen_reg_rtx (iter_mode);
2089 emit_move_insn (iter, const0_rtx);
2091 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
2092 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
2093 do_pending_stack_adjust ();
2095 emit_note (NULL, NOTE_INSN_LOOP_BEG);
2097 emit_jump (cmp_label);
2098 emit_label (top_label);
2100 tmp = convert_modes (Pmode, iter_mode, iter, true);
2101 x_addr = gen_rtx_PLUS (Pmode, x_addr, tmp);
2102 y_addr = gen_rtx_PLUS (Pmode, y_addr, tmp);
2103 x = change_address (x, QImode, x_addr);
2104 y = change_address (y, QImode, y_addr);
2106 emit_move_insn (x, y);
2108 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
2109 true, OPTAB_LIB_WIDEN);
2111 emit_move_insn (iter, tmp);
2113 emit_note (NULL, NOTE_INSN_LOOP_CONT);
2114 emit_label (cmp_label);
2116 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
2119 emit_note (NULL, NOTE_INSN_LOOP_END);
2122 /* Copy all or part of a value X into registers starting at REGNO.
2123 The number of registers to be filled is NREGS. */
2126 move_block_to_reg (regno, x, nregs, mode)
2130 enum machine_mode mode;
2133 #ifdef HAVE_load_multiple
2141 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
2142 x = validize_mem (force_const_mem (mode, x));
2144 /* See if the machine can do this with a load multiple insn. */
2145 #ifdef HAVE_load_multiple
2146 if (HAVE_load_multiple)
2148 last = get_last_insn ();
2149 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
2157 delete_insns_since (last);
2161 for (i = 0; i < nregs; i++)
2162 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
2163 operand_subword_force (x, i, mode));
2166 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
2167 The number of registers to be filled is NREGS. */
2170 move_block_from_reg (regno, x, nregs)
2180 /* See if the machine can do this with a store multiple insn. */
2181 #ifdef HAVE_store_multiple
2182 if (HAVE_store_multiple)
2184 rtx last = get_last_insn ();
2185 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
2193 delete_insns_since (last);
2197 for (i = 0; i < nregs; i++)
2199 rtx tem = operand_subword (x, i, 1, BLKmode);
2204 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
2208 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
2209 ORIG, where ORIG is a non-consecutive group of registers represented by
2210 a PARALLEL. The clone is identical to the original except in that the
2211 original set of registers is replaced by a new set of pseudo registers.
2212 The new set has the same modes as the original set. */
2215 gen_group_rtx (orig)
2221 if (GET_CODE (orig) != PARALLEL)
2224 length = XVECLEN (orig, 0);
2225 tmps = (rtx *) alloca (sizeof (rtx) * length);
2227 /* Skip a NULL entry in first slot. */
2228 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
2233 for (; i < length; i++)
2235 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
2236 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
2238 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
2241 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
2244 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
2245 registers represented by a PARALLEL. SSIZE represents the total size of
2246 block SRC in bytes, or -1 if not known. */
2247 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatant assumption that
2248 the balance will be in what would be the low-order memory addresses, i.e.
2249 left justified for big endian, right justified for little endian. This
2250 happens to be true for the targets currently using this support. If this
2251 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
2255 emit_group_load (dst, orig_src, ssize)
2262 if (GET_CODE (dst) != PARALLEL)
2265 /* Check for a NULL entry, used to indicate that the parameter goes
2266 both on the stack and in registers. */
2267 if (XEXP (XVECEXP (dst, 0, 0), 0))
2272 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (dst, 0));
2274 /* Process the pieces. */
2275 for (i = start; i < XVECLEN (dst, 0); i++)
2277 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
2278 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
2279 unsigned int bytelen = GET_MODE_SIZE (mode);
2282 /* Handle trailing fragments that run over the size of the struct. */
2283 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2285 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2286 bytelen = ssize - bytepos;
2291 /* If we won't be loading directly from memory, protect the real source
2292 from strange tricks we might play; but make sure that the source can
2293 be loaded directly into the destination. */
2295 if (GET_CODE (orig_src) != MEM
2296 && (!CONSTANT_P (orig_src)
2297 || (GET_MODE (orig_src) != mode
2298 && GET_MODE (orig_src) != VOIDmode)))
2300 if (GET_MODE (orig_src) == VOIDmode)
2301 src = gen_reg_rtx (mode);
2303 src = gen_reg_rtx (GET_MODE (orig_src));
2305 emit_move_insn (src, orig_src);
2308 /* Optimize the access just a bit. */
2309 if (GET_CODE (src) == MEM
2310 && MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode)
2311 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2312 && bytelen == GET_MODE_SIZE (mode))
2314 tmps[i] = gen_reg_rtx (mode);
2315 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
2317 else if (GET_CODE (src) == CONCAT)
2319 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
2320 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
2322 if ((bytepos == 0 && bytelen == slen0)
2323 || (bytepos != 0 && bytepos + bytelen <= slen))
2325 /* The following assumes that the concatenated objects all
2326 have the same size. In this case, a simple calculation
2327 can be used to determine the object and the bit field
2329 tmps[i] = XEXP (src, bytepos / slen0);
2330 if (! CONSTANT_P (tmps[i])
2331 && (GET_CODE (tmps[i]) != REG || GET_MODE (tmps[i]) != mode))
2332 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
2333 (bytepos % slen0) * BITS_PER_UNIT,
2334 1, NULL_RTX, mode, mode, ssize);
2336 else if (bytepos == 0)
2338 rtx mem = assign_stack_temp (GET_MODE (src), slen, 0);
2339 emit_move_insn (mem, src);
2340 tmps[i] = adjust_address (mem, mode, 0);
2345 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
2346 SIMD register, which is currently broken. While we get GCC
2347 to emit proper RTL for these cases, let's dump to memory. */
2348 else if (VECTOR_MODE_P (GET_MODE (dst))
2349 && GET_CODE (src) == REG)
2351 int slen = GET_MODE_SIZE (GET_MODE (src));
2354 mem = assign_stack_temp (GET_MODE (src), slen, 0);
2355 emit_move_insn (mem, src);
2356 tmps[i] = adjust_address (mem, mode, (int) bytepos);
2358 else if (CONSTANT_P (src)
2359 || (GET_CODE (src) == REG && GET_MODE (src) == mode))
2362 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
2363 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
2366 if (BYTES_BIG_ENDIAN && shift)
2367 expand_binop (mode, ashl_optab, tmps[i], GEN_INT (shift),
2368 tmps[i], 0, OPTAB_WIDEN);
2373 /* Copy the extracted pieces into the proper (probable) hard regs. */
2374 for (i = start; i < XVECLEN (dst, 0); i++)
2375 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0), tmps[i]);
2378 /* Emit code to move a block SRC to block DST, where SRC and DST are
2379 non-consecutive groups of registers, each represented by a PARALLEL. */
2382 emit_group_move (dst, src)
2387 if (GET_CODE (src) != PARALLEL
2388 || GET_CODE (dst) != PARALLEL
2389 || XVECLEN (src, 0) != XVECLEN (dst, 0))
2392 /* Skip first entry if NULL. */
2393 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
2394 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
2395 XEXP (XVECEXP (src, 0, i), 0));
2398 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
2399 registers represented by a PARALLEL. SSIZE represents the total size of
2400 block DST, or -1 if not known. */
2403 emit_group_store (orig_dst, src, ssize)
2410 if (GET_CODE (src) != PARALLEL)
2413 /* Check for a NULL entry, used to indicate that the parameter goes
2414 both on the stack and in registers. */
2415 if (XEXP (XVECEXP (src, 0, 0), 0))
2420 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (src, 0));
2422 /* Copy the (probable) hard regs into pseudos. */
2423 for (i = start; i < XVECLEN (src, 0); i++)
2425 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
2426 tmps[i] = gen_reg_rtx (GET_MODE (reg));
2427 emit_move_insn (tmps[i], reg);
2431 /* If we won't be storing directly into memory, protect the real destination
2432 from strange tricks we might play. */
2434 if (GET_CODE (dst) == PARALLEL)
2438 /* We can get a PARALLEL dst if there is a conditional expression in
2439 a return statement. In that case, the dst and src are the same,
2440 so no action is necessary. */
2441 if (rtx_equal_p (dst, src))
2444 /* It is unclear if we can ever reach here, but we may as well handle
2445 it. Allocate a temporary, and split this into a store/load to/from
2448 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
2449 emit_group_store (temp, src, ssize);
2450 emit_group_load (dst, temp, ssize);
2453 else if (GET_CODE (dst) != MEM && GET_CODE (dst) != CONCAT)
2455 dst = gen_reg_rtx (GET_MODE (orig_dst));
2456 /* Make life a bit easier for combine. */
2457 emit_move_insn (dst, CONST0_RTX (GET_MODE (orig_dst)));
2460 /* Process the pieces. */
2461 for (i = start; i < XVECLEN (src, 0); i++)
2463 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2464 enum machine_mode mode = GET_MODE (tmps[i]);
2465 unsigned int bytelen = GET_MODE_SIZE (mode);
2468 /* Handle trailing fragments that run over the size of the struct. */
2469 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2471 if (BYTES_BIG_ENDIAN)
2473 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2474 expand_binop (mode, ashr_optab, tmps[i], GEN_INT (shift),
2475 tmps[i], 0, OPTAB_WIDEN);
2477 bytelen = ssize - bytepos;
2480 if (GET_CODE (dst) == CONCAT)
2482 if (bytepos + bytelen <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2483 dest = XEXP (dst, 0);
2484 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2486 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2487 dest = XEXP (dst, 1);
2489 else if (bytepos == 0 && XVECLEN (src, 0))
2491 dest = assign_stack_temp (GET_MODE (dest),
2492 GET_MODE_SIZE (GET_MODE (dest)), 0);
2493 emit_move_insn (adjust_address (dest, GET_MODE (tmps[i]), bytepos),
2502 /* Optimize the access just a bit. */
2503 if (GET_CODE (dest) == MEM
2504 && MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode)
2505 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2506 && bytelen == GET_MODE_SIZE (mode))
2507 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2509 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2510 mode, tmps[i], ssize);
2515 /* Copy from the pseudo into the (probable) hard reg. */
2516 if (orig_dst != dst)
2517 emit_move_insn (orig_dst, dst);
2520 /* Generate code to copy a BLKmode object of TYPE out of a
2521 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2522 is null, a stack temporary is created. TGTBLK is returned.
2524 The primary purpose of this routine is to handle functions
2525 that return BLKmode structures in registers. Some machines
2526 (the PA for example) want to return all small structures
2527 in registers regardless of the structure's alignment. */
2530 copy_blkmode_from_reg (tgtblk, srcreg, type)
2535 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2536 rtx src = NULL, dst = NULL;
2537 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2538 unsigned HOST_WIDE_INT bitpos, xbitpos, big_endian_correction = 0;
2542 tgtblk = assign_temp (build_qualified_type (type,
2544 | TYPE_QUAL_CONST)),
2546 preserve_temp_slots (tgtblk);
2549 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2550 into a new pseudo which is a full word. */
2552 if (GET_MODE (srcreg) != BLKmode
2553 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2554 srcreg = convert_to_mode (word_mode, srcreg, TREE_UNSIGNED (type));
2556 /* Structures whose size is not a multiple of a word are aligned
2557 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2558 machine, this means we must skip the empty high order bytes when
2559 calculating the bit offset. */
2560 if (BYTES_BIG_ENDIAN
2561 && bytes % UNITS_PER_WORD)
2562 big_endian_correction
2563 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2565 /* Copy the structure BITSIZE bites at a time.
2567 We could probably emit more efficient code for machines which do not use
2568 strict alignment, but it doesn't seem worth the effort at the current
2570 for (bitpos = 0, xbitpos = big_endian_correction;
2571 bitpos < bytes * BITS_PER_UNIT;
2572 bitpos += bitsize, xbitpos += bitsize)
2574 /* We need a new source operand each time xbitpos is on a
2575 word boundary and when xbitpos == big_endian_correction
2576 (the first time through). */
2577 if (xbitpos % BITS_PER_WORD == 0
2578 || xbitpos == big_endian_correction)
2579 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2582 /* We need a new destination operand each time bitpos is on
2584 if (bitpos % BITS_PER_WORD == 0)
2585 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2587 /* Use xbitpos for the source extraction (right justified) and
2588 xbitpos for the destination store (left justified). */
2589 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2590 extract_bit_field (src, bitsize,
2591 xbitpos % BITS_PER_WORD, 1,
2592 NULL_RTX, word_mode, word_mode,
2600 /* Add a USE expression for REG to the (possibly empty) list pointed
2601 to by CALL_FUSAGE. REG must denote a hard register. */
2604 use_reg (call_fusage, reg)
2605 rtx *call_fusage, reg;
2607 if (GET_CODE (reg) != REG
2608 || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
2612 = gen_rtx_EXPR_LIST (VOIDmode,
2613 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2616 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2617 starting at REGNO. All of these registers must be hard registers. */
2620 use_regs (call_fusage, regno, nregs)
2627 if (regno + nregs > FIRST_PSEUDO_REGISTER)
2630 for (i = 0; i < nregs; i++)
2631 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2634 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2635 PARALLEL REGS. This is for calls that pass values in multiple
2636 non-contiguous locations. The Irix 6 ABI has examples of this. */
2639 use_group_regs (call_fusage, regs)
2645 for (i = 0; i < XVECLEN (regs, 0); i++)
2647 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2649 /* A NULL entry means the parameter goes both on the stack and in
2650 registers. This can also be a MEM for targets that pass values
2651 partially on the stack and partially in registers. */
2652 if (reg != 0 && GET_CODE (reg) == REG)
2653 use_reg (call_fusage, reg);
2658 /* Determine whether the LEN bytes generated by CONSTFUN can be
2659 stored to memory using several move instructions. CONSTFUNDATA is
2660 a pointer which will be passed as argument in every CONSTFUN call.
2661 ALIGN is maximum alignment we can assume. Return nonzero if a
2662 call to store_by_pieces should succeed. */
2665 can_store_by_pieces (len, constfun, constfundata, align)
2666 unsigned HOST_WIDE_INT len;
2667 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2671 unsigned HOST_WIDE_INT max_size, l;
2672 HOST_WIDE_INT offset = 0;
2673 enum machine_mode mode, tmode;
2674 enum insn_code icode;
2678 if (! STORE_BY_PIECES_P (len, align))
2681 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2682 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2683 align = MOVE_MAX * BITS_PER_UNIT;
2685 /* We would first store what we can in the largest integer mode, then go to
2686 successively smaller modes. */
2689 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2694 max_size = STORE_MAX_PIECES + 1;
2695 while (max_size > 1)
2697 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2698 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2699 if (GET_MODE_SIZE (tmode) < max_size)
2702 if (mode == VOIDmode)
2705 icode = mov_optab->handlers[(int) mode].insn_code;
2706 if (icode != CODE_FOR_nothing
2707 && align >= GET_MODE_ALIGNMENT (mode))
2709 unsigned int size = GET_MODE_SIZE (mode);
2716 cst = (*constfun) (constfundata, offset, mode);
2717 if (!LEGITIMATE_CONSTANT_P (cst))
2727 max_size = GET_MODE_SIZE (mode);
2730 /* The code above should have handled everything. */
2738 /* Generate several move instructions to store LEN bytes generated by
2739 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2740 pointer which will be passed as argument in every CONSTFUN call.
2741 ALIGN is maximum alignment we can assume. */
2744 store_by_pieces (to, len, constfun, constfundata, align)
2746 unsigned HOST_WIDE_INT len;
2747 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2751 struct store_by_pieces data;
2753 if (! STORE_BY_PIECES_P (len, align))
2755 to = protect_from_queue (to, 1);
2756 data.constfun = constfun;
2757 data.constfundata = constfundata;
2760 store_by_pieces_1 (&data, align);
2763 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2764 rtx with BLKmode). The caller must pass TO through protect_from_queue
2765 before calling. ALIGN is maximum alignment we can assume. */
2768 clear_by_pieces (to, len, align)
2770 unsigned HOST_WIDE_INT len;
2773 struct store_by_pieces data;
2775 data.constfun = clear_by_pieces_1;
2776 data.constfundata = NULL;
2779 store_by_pieces_1 (&data, align);
2782 /* Callback routine for clear_by_pieces.
2783 Return const0_rtx unconditionally. */
2786 clear_by_pieces_1 (data, offset, mode)
2787 PTR data ATTRIBUTE_UNUSED;
2788 HOST_WIDE_INT offset ATTRIBUTE_UNUSED;
2789 enum machine_mode mode ATTRIBUTE_UNUSED;
2794 /* Subroutine of clear_by_pieces and store_by_pieces.
2795 Generate several move instructions to store LEN bytes of block TO. (A MEM
2796 rtx with BLKmode). The caller must pass TO through protect_from_queue
2797 before calling. ALIGN is maximum alignment we can assume. */
2800 store_by_pieces_1 (data, align)
2801 struct store_by_pieces *data;
2804 rtx to_addr = XEXP (data->to, 0);
2805 unsigned HOST_WIDE_INT max_size = STORE_MAX_PIECES + 1;
2806 enum machine_mode mode = VOIDmode, tmode;
2807 enum insn_code icode;
2810 data->to_addr = to_addr;
2812 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2813 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2815 data->explicit_inc_to = 0;
2817 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2819 data->offset = data->len;
2821 /* If storing requires more than two move insns,
2822 copy addresses to registers (to make displacements shorter)
2823 and use post-increment if available. */
2824 if (!data->autinc_to
2825 && move_by_pieces_ninsns (data->len, align) > 2)
2827 /* Determine the main mode we'll be using. */
2828 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2829 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2830 if (GET_MODE_SIZE (tmode) < max_size)
2833 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2835 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2836 data->autinc_to = 1;
2837 data->explicit_inc_to = -1;
2840 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2841 && ! data->autinc_to)
2843 data->to_addr = copy_addr_to_reg (to_addr);
2844 data->autinc_to = 1;
2845 data->explicit_inc_to = 1;
2848 if ( !data->autinc_to && CONSTANT_P (to_addr))
2849 data->to_addr = copy_addr_to_reg (to_addr);
2852 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2853 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2854 align = MOVE_MAX * BITS_PER_UNIT;
2856 /* First store what we can in the largest integer mode, then go to
2857 successively smaller modes. */
2859 while (max_size > 1)
2861 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2862 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2863 if (GET_MODE_SIZE (tmode) < max_size)
2866 if (mode == VOIDmode)
2869 icode = mov_optab->handlers[(int) mode].insn_code;
2870 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2871 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2873 max_size = GET_MODE_SIZE (mode);
2876 /* The code above should have handled everything. */
2881 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2882 with move instructions for mode MODE. GENFUN is the gen_... function
2883 to make a move insn for that mode. DATA has all the other info. */
2886 store_by_pieces_2 (genfun, mode, data)
2887 rtx (*genfun) PARAMS ((rtx, ...));
2888 enum machine_mode mode;
2889 struct store_by_pieces *data;
2891 unsigned int size = GET_MODE_SIZE (mode);
2894 while (data->len >= size)
2897 data->offset -= size;
2899 if (data->autinc_to)
2900 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2903 to1 = adjust_address (data->to, mode, data->offset);
2905 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2906 emit_insn (gen_add2_insn (data->to_addr,
2907 GEN_INT (-(HOST_WIDE_INT) size)));
2909 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2910 emit_insn ((*genfun) (to1, cst));
2912 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2913 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2915 if (! data->reverse)
2916 data->offset += size;
2922 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2923 its length in bytes. */
2926 clear_storage (object, size)
2931 unsigned int align = (GET_CODE (object) == MEM ? MEM_ALIGN (object)
2932 : GET_MODE_ALIGNMENT (GET_MODE (object)));
2934 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2935 just move a zero. Otherwise, do this a piece at a time. */
2936 if (GET_MODE (object) != BLKmode
2937 && GET_CODE (size) == CONST_INT
2938 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (object)))
2939 emit_move_insn (object, CONST0_RTX (GET_MODE (object)));
2942 object = protect_from_queue (object, 1);
2943 size = protect_from_queue (size, 0);
2945 if (GET_CODE (size) == CONST_INT
2946 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2947 clear_by_pieces (object, INTVAL (size), align);
2948 else if (clear_storage_via_clrstr (object, size, align))
2951 retval = clear_storage_via_libcall (object, size);
2957 /* A subroutine of clear_storage. Expand a clrstr pattern;
2958 return true if successful. */
2961 clear_storage_via_clrstr (object, size, align)
2965 /* Try the most limited insn first, because there's no point
2966 including more than one in the machine description unless
2967 the more limited one has some advantage. */
2969 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2970 enum machine_mode mode;
2972 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2973 mode = GET_MODE_WIDER_MODE (mode))
2975 enum insn_code code = clrstr_optab[(int) mode];
2976 insn_operand_predicate_fn pred;
2978 if (code != CODE_FOR_nothing
2979 /* We don't need MODE to be narrower than
2980 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2981 the mode mask, as it is returned by the macro, it will
2982 definitely be less than the actual mode mask. */
2983 && ((GET_CODE (size) == CONST_INT
2984 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2985 <= (GET_MODE_MASK (mode) >> 1)))
2986 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2987 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2988 || (*pred) (object, BLKmode))
2989 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2990 || (*pred) (opalign, VOIDmode)))
2993 rtx last = get_last_insn ();
2996 op1 = convert_to_mode (mode, size, 1);
2997 pred = insn_data[(int) code].operand[1].predicate;
2998 if (pred != 0 && ! (*pred) (op1, mode))
2999 op1 = copy_to_mode_reg (mode, op1);
3001 pat = GEN_FCN ((int) code) (object, op1, opalign);
3008 delete_insns_since (last);
3015 /* A subroutine of clear_storage. Expand a call to memset or bzero.
3016 Return the return value of memset, 0 otherwise. */
3019 clear_storage_via_libcall (object, size)
3022 tree call_expr, arg_list, fn, object_tree, size_tree;
3023 enum machine_mode size_mode;
3026 /* OBJECT or SIZE may have been passed through protect_from_queue.
3028 It is unsafe to save the value generated by protect_from_queue
3029 and reuse it later. Consider what happens if emit_queue is
3030 called before the return value from protect_from_queue is used.
3032 Expansion of the CALL_EXPR below will call emit_queue before
3033 we are finished emitting RTL for argument setup. So if we are
3034 not careful we could get the wrong value for an argument.
3036 To avoid this problem we go ahead and emit code to copy OBJECT
3037 and SIZE into new pseudos. We can then place those new pseudos
3038 into an RTL_EXPR and use them later, even after a call to
3041 Note this is not strictly needed for library calls since they
3042 do not call emit_queue before loading their arguments. However,
3043 we may need to have library calls call emit_queue in the future
3044 since failing to do so could cause problems for targets which
3045 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
3047 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
3049 if (TARGET_MEM_FUNCTIONS)
3050 size_mode = TYPE_MODE (sizetype);
3052 size_mode = TYPE_MODE (unsigned_type_node);
3053 size = convert_to_mode (size_mode, size, 1);
3054 size = copy_to_mode_reg (size_mode, size);
3056 /* It is incorrect to use the libcall calling conventions to call
3057 memset in this context. This could be a user call to memset and
3058 the user may wish to examine the return value from memset. For
3059 targets where libcalls and normal calls have different conventions
3060 for returning pointers, we could end up generating incorrect code.
3062 For convenience, we generate the call to bzero this way as well. */
3064 object_tree = make_tree (ptr_type_node, object);
3065 if (TARGET_MEM_FUNCTIONS)
3066 size_tree = make_tree (sizetype, size);
3068 size_tree = make_tree (unsigned_type_node, size);
3070 fn = clear_storage_libcall_fn (true);
3071 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
3072 if (TARGET_MEM_FUNCTIONS)
3073 arg_list = tree_cons (NULL_TREE, integer_zero_node, arg_list);
3074 arg_list = tree_cons (NULL_TREE, object_tree, arg_list);
3076 /* Now we have to build up the CALL_EXPR itself. */
3077 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
3078 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
3079 call_expr, arg_list, NULL_TREE);
3080 TREE_SIDE_EFFECTS (call_expr) = 1;
3082 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
3084 /* If we are initializing a readonly value, show the above call
3085 clobbered it. Otherwise, a load from it may erroneously be
3086 hoisted from a loop. */
3087 if (RTX_UNCHANGING_P (object))
3088 emit_insn (gen_rtx_CLOBBER (VOIDmode, object));
3090 return (TARGET_MEM_FUNCTIONS ? retval : NULL_RTX);
3093 /* A subroutine of clear_storage_via_libcall. Create the tree node
3094 for the function we use for block clears. The first time FOR_CALL
3095 is true, we call assemble_external. */
3097 static GTY(()) tree block_clear_fn;
3100 init_block_clear_fn (asmspec)
3101 const char *asmspec;
3103 if (!block_clear_fn)
3107 if (TARGET_MEM_FUNCTIONS)
3109 fn = get_identifier ("memset");
3110 args = build_function_type_list (ptr_type_node, ptr_type_node,
3111 integer_type_node, sizetype,
3116 fn = get_identifier ("bzero");
3117 args = build_function_type_list (void_type_node, ptr_type_node,
3118 unsigned_type_node, NULL_TREE);
3121 fn = build_decl (FUNCTION_DECL, fn, args);
3122 DECL_EXTERNAL (fn) = 1;
3123 TREE_PUBLIC (fn) = 1;
3124 DECL_ARTIFICIAL (fn) = 1;
3125 TREE_NOTHROW (fn) = 1;
3127 block_clear_fn = fn;
3132 SET_DECL_RTL (block_clear_fn, NULL_RTX);
3133 SET_DECL_ASSEMBLER_NAME (block_clear_fn, get_identifier (asmspec));
3138 clear_storage_libcall_fn (for_call)
3141 static bool emitted_extern;
3143 if (!block_clear_fn)
3144 init_block_clear_fn (NULL);
3146 if (for_call && !emitted_extern)
3148 emitted_extern = true;
3149 make_decl_rtl (block_clear_fn, NULL);
3150 assemble_external (block_clear_fn);
3153 return block_clear_fn;
3156 /* Generate code to copy Y into X.
3157 Both Y and X must have the same mode, except that
3158 Y can be a constant with VOIDmode.
3159 This mode cannot be BLKmode; use emit_block_move for that.
3161 Return the last instruction emitted. */
3164 emit_move_insn (x, y)
3167 enum machine_mode mode = GET_MODE (x);
3168 rtx y_cst = NULL_RTX;
3171 x = protect_from_queue (x, 1);
3172 y = protect_from_queue (y, 0);
3174 if (mode == BLKmode || (GET_MODE (y) != mode && GET_MODE (y) != VOIDmode))
3177 /* Never force constant_p_rtx to memory. */
3178 if (GET_CODE (y) == CONSTANT_P_RTX)
3180 else if (CONSTANT_P (y))
3183 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3184 && (last_insn = compress_float_constant (x, y)))
3187 if (!LEGITIMATE_CONSTANT_P (y))
3190 y = force_const_mem (mode, y);
3192 /* If the target's cannot_force_const_mem prevented the spill,
3193 assume that the target's move expanders will also take care
3194 of the non-legitimate constant. */
3200 /* If X or Y are memory references, verify that their addresses are valid
3202 if (GET_CODE (x) == MEM
3203 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
3204 && ! push_operand (x, GET_MODE (x)))
3206 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
3207 x = validize_mem (x);
3209 if (GET_CODE (y) == MEM
3210 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
3212 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
3213 y = validize_mem (y);
3215 if (mode == BLKmode)
3218 last_insn = emit_move_insn_1 (x, y);
3220 if (y_cst && GET_CODE (x) == REG)
3221 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3226 /* Low level part of emit_move_insn.
3227 Called just like emit_move_insn, but assumes X and Y
3228 are basically valid. */
3231 emit_move_insn_1 (x, y)
3234 enum machine_mode mode = GET_MODE (x);
3235 enum machine_mode submode;
3236 enum mode_class class = GET_MODE_CLASS (mode);
3238 if ((unsigned int) mode >= (unsigned int) MAX_MACHINE_MODE)
3241 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3243 emit_insn (GEN_FCN (mov_optab->handlers[(int) mode].insn_code) (x, y));
3245 /* Expand complex moves by moving real part and imag part, if possible. */
3246 else if ((class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)
3247 && BLKmode != (submode = GET_MODE_INNER (mode))
3248 && (mov_optab->handlers[(int) submode].insn_code
3249 != CODE_FOR_nothing))
3251 /* Don't split destination if it is a stack push. */
3252 int stack = push_operand (x, GET_MODE (x));
3254 #ifdef PUSH_ROUNDING
3255 /* In case we output to the stack, but the size is smaller machine can
3256 push exactly, we need to use move instructions. */
3258 && (PUSH_ROUNDING (GET_MODE_SIZE (submode))
3259 != GET_MODE_SIZE (submode)))
3262 HOST_WIDE_INT offset1, offset2;
3264 /* Do not use anti_adjust_stack, since we don't want to update
3265 stack_pointer_delta. */
3266 temp = expand_binop (Pmode,
3267 #ifdef STACK_GROWS_DOWNWARD
3275 (GET_MODE_SIZE (GET_MODE (x)))),
3276 stack_pointer_rtx, 0, OPTAB_LIB_WIDEN);
3278 if (temp != stack_pointer_rtx)
3279 emit_move_insn (stack_pointer_rtx, temp);
3281 #ifdef STACK_GROWS_DOWNWARD
3283 offset2 = GET_MODE_SIZE (submode);
3285 offset1 = -PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)));
3286 offset2 = (-PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))
3287 + GET_MODE_SIZE (submode));
3290 emit_move_insn (change_address (x, submode,
3291 gen_rtx_PLUS (Pmode,
3293 GEN_INT (offset1))),
3294 gen_realpart (submode, y));
3295 emit_move_insn (change_address (x, submode,
3296 gen_rtx_PLUS (Pmode,
3298 GEN_INT (offset2))),
3299 gen_imagpart (submode, y));
3303 /* If this is a stack, push the highpart first, so it
3304 will be in the argument order.
3306 In that case, change_address is used only to convert
3307 the mode, not to change the address. */
3310 /* Note that the real part always precedes the imag part in memory
3311 regardless of machine's endianness. */
3312 #ifdef STACK_GROWS_DOWNWARD
3313 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3314 (gen_rtx_MEM (submode, XEXP (x, 0)),
3315 gen_imagpart (submode, y)));
3316 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3317 (gen_rtx_MEM (submode, XEXP (x, 0)),
3318 gen_realpart (submode, y)));
3320 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3321 (gen_rtx_MEM (submode, XEXP (x, 0)),
3322 gen_realpart (submode, y)));
3323 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3324 (gen_rtx_MEM (submode, XEXP (x, 0)),
3325 gen_imagpart (submode, y)));
3330 rtx realpart_x, realpart_y;
3331 rtx imagpart_x, imagpart_y;
3333 /* If this is a complex value with each part being smaller than a
3334 word, the usual calling sequence will likely pack the pieces into
3335 a single register. Unfortunately, SUBREG of hard registers only
3336 deals in terms of words, so we have a problem converting input
3337 arguments to the CONCAT of two registers that is used elsewhere
3338 for complex values. If this is before reload, we can copy it into
3339 memory and reload. FIXME, we should see about using extract and
3340 insert on integer registers, but complex short and complex char
3341 variables should be rarely used. */
3342 if (GET_MODE_BITSIZE (mode) < 2 * BITS_PER_WORD
3343 && (reload_in_progress | reload_completed) == 0)
3346 = (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER);
3348 = (REG_P (y) && REGNO (y) < FIRST_PSEUDO_REGISTER);
3350 if (packed_dest_p || packed_src_p)
3352 enum mode_class reg_class = ((class == MODE_COMPLEX_FLOAT)
3353 ? MODE_FLOAT : MODE_INT);
3355 enum machine_mode reg_mode
3356 = mode_for_size (GET_MODE_BITSIZE (mode), reg_class, 1);
3358 if (reg_mode != BLKmode)
3360 rtx mem = assign_stack_temp (reg_mode,
3361 GET_MODE_SIZE (mode), 0);
3362 rtx cmem = adjust_address (mem, mode, 0);
3365 = N_("function using short complex types cannot be inline");
3369 rtx sreg = gen_rtx_SUBREG (reg_mode, x, 0);
3371 emit_move_insn_1 (cmem, y);
3372 return emit_move_insn_1 (sreg, mem);
3376 rtx sreg = gen_rtx_SUBREG (reg_mode, y, 0);
3378 emit_move_insn_1 (mem, sreg);
3379 return emit_move_insn_1 (x, cmem);
3385 realpart_x = gen_realpart (submode, x);
3386 realpart_y = gen_realpart (submode, y);
3387 imagpart_x = gen_imagpart (submode, x);
3388 imagpart_y = gen_imagpart (submode, y);
3390 /* Show the output dies here. This is necessary for SUBREGs
3391 of pseudos since we cannot track their lifetimes correctly;
3392 hard regs shouldn't appear here except as return values.
3393 We never want to emit such a clobber after reload. */
3395 && ! (reload_in_progress || reload_completed)
3396 && (GET_CODE (realpart_x) == SUBREG
3397 || GET_CODE (imagpart_x) == SUBREG))
3398 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3400 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3401 (realpart_x, realpart_y));
3402 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3403 (imagpart_x, imagpart_y));
3406 return get_last_insn ();
3409 /* Handle MODE_CC modes: If we don't have a special move insn for this mode,
3410 find a mode to do it in. If we have a movcc, use it. Otherwise,
3411 find the MODE_INT mode of the same width. */
3412 else if (GET_MODE_CLASS (mode) == MODE_CC
3413 && mov_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
3415 enum insn_code insn_code;
3416 enum machine_mode tmode = VOIDmode;
3420 && mov_optab->handlers[(int) CCmode].insn_code != CODE_FOR_nothing)
3423 for (tmode = QImode; tmode != VOIDmode;
3424 tmode = GET_MODE_WIDER_MODE (tmode))
3425 if (GET_MODE_SIZE (tmode) == GET_MODE_SIZE (mode))
3428 if (tmode == VOIDmode)
3431 /* Get X and Y in TMODE. We can't use gen_lowpart here because it
3432 may call change_address which is not appropriate if we were
3433 called when a reload was in progress. We don't have to worry
3434 about changing the address since the size in bytes is supposed to
3435 be the same. Copy the MEM to change the mode and move any
3436 substitutions from the old MEM to the new one. */
3438 if (reload_in_progress)
3440 x = gen_lowpart_common (tmode, x1);
3441 if (x == 0 && GET_CODE (x1) == MEM)
3443 x = adjust_address_nv (x1, tmode, 0);
3444 copy_replacements (x1, x);
3447 y = gen_lowpart_common (tmode, y1);
3448 if (y == 0 && GET_CODE (y1) == MEM)
3450 y = adjust_address_nv (y1, tmode, 0);
3451 copy_replacements (y1, y);
3456 x = gen_lowpart (tmode, x);
3457 y = gen_lowpart (tmode, y);
3460 insn_code = mov_optab->handlers[(int) tmode].insn_code;
3461 return emit_insn (GEN_FCN (insn_code) (x, y));
3464 /* This will handle any multi-word or full-word mode that lacks a move_insn
3465 pattern. However, you will get better code if you define such patterns,
3466 even if they must turn into multiple assembler instructions. */
3467 else if (GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
3474 #ifdef PUSH_ROUNDING
3476 /* If X is a push on the stack, do the push now and replace
3477 X with a reference to the stack pointer. */
3478 if (push_operand (x, GET_MODE (x)))
3483 /* Do not use anti_adjust_stack, since we don't want to update
3484 stack_pointer_delta. */
3485 temp = expand_binop (Pmode,
3486 #ifdef STACK_GROWS_DOWNWARD
3494 (GET_MODE_SIZE (GET_MODE (x)))),
3495 stack_pointer_rtx, 0, OPTAB_LIB_WIDEN);
3497 if (temp != stack_pointer_rtx)
3498 emit_move_insn (stack_pointer_rtx, temp);
3500 code = GET_CODE (XEXP (x, 0));
3502 /* Just hope that small offsets off SP are OK. */
3503 if (code == POST_INC)
3504 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3505 GEN_INT (-((HOST_WIDE_INT)
3506 GET_MODE_SIZE (GET_MODE (x)))));
3507 else if (code == POST_DEC)
3508 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3509 GEN_INT (GET_MODE_SIZE (GET_MODE (x))));
3511 temp = stack_pointer_rtx;
3513 x = change_address (x, VOIDmode, temp);
3517 /* If we are in reload, see if either operand is a MEM whose address
3518 is scheduled for replacement. */
3519 if (reload_in_progress && GET_CODE (x) == MEM
3520 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3521 x = replace_equiv_address_nv (x, inner);
3522 if (reload_in_progress && GET_CODE (y) == MEM
3523 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3524 y = replace_equiv_address_nv (y, inner);
3530 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3533 rtx xpart = operand_subword (x, i, 1, mode);
3534 rtx ypart = operand_subword (y, i, 1, mode);
3536 /* If we can't get a part of Y, put Y into memory if it is a
3537 constant. Otherwise, force it into a register. If we still
3538 can't get a part of Y, abort. */
3539 if (ypart == 0 && CONSTANT_P (y))
3541 y = force_const_mem (mode, y);
3542 ypart = operand_subword (y, i, 1, mode);
3544 else if (ypart == 0)
3545 ypart = operand_subword_force (y, i, mode);
3547 if (xpart == 0 || ypart == 0)
3550 need_clobber |= (GET_CODE (xpart) == SUBREG);
3552 last_insn = emit_move_insn (xpart, ypart);
3558 /* Show the output dies here. This is necessary for SUBREGs
3559 of pseudos since we cannot track their lifetimes correctly;
3560 hard regs shouldn't appear here except as return values.
3561 We never want to emit such a clobber after reload. */
3563 && ! (reload_in_progress || reload_completed)
3564 && need_clobber != 0)
3565 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3575 /* If Y is representable exactly in a narrower mode, and the target can
3576 perform the extension directly from constant or memory, then emit the
3577 move as an extension. */
3580 compress_float_constant (x, y)
3583 enum machine_mode dstmode = GET_MODE (x);
3584 enum machine_mode orig_srcmode = GET_MODE (y);
3585 enum machine_mode srcmode;
3588 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3590 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3591 srcmode != orig_srcmode;
3592 srcmode = GET_MODE_WIDER_MODE (srcmode))
3595 rtx trunc_y, last_insn;
3597 /* Skip if the target can't extend this way. */
3598 ic = can_extend_p (dstmode, srcmode, 0);
3599 if (ic == CODE_FOR_nothing)
3602 /* Skip if the narrowed value isn't exact. */
3603 if (! exact_real_truncate (srcmode, &r))
3606 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3608 if (LEGITIMATE_CONSTANT_P (trunc_y))
3610 /* Skip if the target needs extra instructions to perform
3612 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3615 else if (float_extend_from_mem[dstmode][srcmode])
3616 trunc_y = validize_mem (force_const_mem (srcmode, trunc_y));
3620 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3621 last_insn = get_last_insn ();
3623 if (GET_CODE (x) == REG)
3624 REG_NOTES (last_insn)
3625 = gen_rtx_EXPR_LIST (REG_EQUAL, y, REG_NOTES (last_insn));
3633 /* Pushing data onto the stack. */
3635 /* Push a block of length SIZE (perhaps variable)
3636 and return an rtx to address the beginning of the block.
3637 Note that it is not possible for the value returned to be a QUEUED.
3638 The value may be virtual_outgoing_args_rtx.
3640 EXTRA is the number of bytes of padding to push in addition to SIZE.
3641 BELOW nonzero means this padding comes at low addresses;
3642 otherwise, the padding comes at high addresses. */
3645 push_block (size, extra, below)
3651 size = convert_modes (Pmode, ptr_mode, size, 1);
3652 if (CONSTANT_P (size))
3653 anti_adjust_stack (plus_constant (size, extra));
3654 else if (GET_CODE (size) == REG && extra == 0)
3655 anti_adjust_stack (size);
3658 temp = copy_to_mode_reg (Pmode, size);
3660 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3661 temp, 0, OPTAB_LIB_WIDEN);
3662 anti_adjust_stack (temp);
3665 #ifndef STACK_GROWS_DOWNWARD
3671 temp = virtual_outgoing_args_rtx;
3672 if (extra != 0 && below)
3673 temp = plus_constant (temp, extra);
3677 if (GET_CODE (size) == CONST_INT)
3678 temp = plus_constant (virtual_outgoing_args_rtx,
3679 -INTVAL (size) - (below ? 0 : extra));
3680 else if (extra != 0 && !below)
3681 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3682 negate_rtx (Pmode, plus_constant (size, extra)));
3684 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3685 negate_rtx (Pmode, size));
3688 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3691 #ifdef PUSH_ROUNDING
3693 /* Emit single push insn. */
3696 emit_single_push_insn (mode, x, type)
3698 enum machine_mode mode;
3702 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3704 enum insn_code icode;
3705 insn_operand_predicate_fn pred;
3707 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3708 /* If there is push pattern, use it. Otherwise try old way of throwing
3709 MEM representing push operation to move expander. */
3710 icode = push_optab->handlers[(int) mode].insn_code;
3711 if (icode != CODE_FOR_nothing)
3713 if (((pred = insn_data[(int) icode].operand[0].predicate)
3714 && !((*pred) (x, mode))))
3715 x = force_reg (mode, x);
3716 emit_insn (GEN_FCN (icode) (x));
3719 if (GET_MODE_SIZE (mode) == rounded_size)
3720 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3723 #ifdef STACK_GROWS_DOWNWARD
3724 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3725 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3727 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3728 GEN_INT (rounded_size));
3730 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3733 dest = gen_rtx_MEM (mode, dest_addr);
3737 set_mem_attributes (dest, type, 1);
3739 if (flag_optimize_sibling_calls)
3740 /* Function incoming arguments may overlap with sibling call
3741 outgoing arguments and we cannot allow reordering of reads
3742 from function arguments with stores to outgoing arguments
3743 of sibling calls. */
3744 set_mem_alias_set (dest, 0);
3746 emit_move_insn (dest, x);
3750 /* Generate code to push X onto the stack, assuming it has mode MODE and
3752 MODE is redundant except when X is a CONST_INT (since they don't
3754 SIZE is an rtx for the size of data to be copied (in bytes),
3755 needed only if X is BLKmode.
3757 ALIGN (in bits) is maximum alignment we can assume.
3759 If PARTIAL and REG are both nonzero, then copy that many of the first
3760 words of X into registers starting with REG, and push the rest of X.
3761 The amount of space pushed is decreased by PARTIAL words,
3762 rounded *down* to a multiple of PARM_BOUNDARY.
3763 REG must be a hard register in this case.
3764 If REG is zero but PARTIAL is not, take any all others actions for an
3765 argument partially in registers, but do not actually load any
3768 EXTRA is the amount in bytes of extra space to leave next to this arg.
3769 This is ignored if an argument block has already been allocated.
3771 On a machine that lacks real push insns, ARGS_ADDR is the address of
3772 the bottom of the argument block for this call. We use indexing off there
3773 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3774 argument block has not been preallocated.
3776 ARGS_SO_FAR is the size of args previously pushed for this call.
3778 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3779 for arguments passed in registers. If nonzero, it will be the number
3780 of bytes required. */
3783 emit_push_insn (x, mode, type, size, align, partial, reg, extra,
3784 args_addr, args_so_far, reg_parm_stack_space,
3787 enum machine_mode mode;
3796 int reg_parm_stack_space;
3800 enum direction stack_direction
3801 #ifdef STACK_GROWS_DOWNWARD
3807 /* Decide where to pad the argument: `downward' for below,
3808 `upward' for above, or `none' for don't pad it.
3809 Default is below for small data on big-endian machines; else above. */
3810 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3812 /* Invert direction if stack is post-decrement.
3814 if (STACK_PUSH_CODE == POST_DEC)
3815 if (where_pad != none)
3816 where_pad = (where_pad == downward ? upward : downward);
3818 xinner = x = protect_from_queue (x, 0);
3820 if (mode == BLKmode)
3822 /* Copy a block into the stack, entirely or partially. */
3825 int used = partial * UNITS_PER_WORD;
3826 int offset = used % (PARM_BOUNDARY / BITS_PER_UNIT);
3834 /* USED is now the # of bytes we need not copy to the stack
3835 because registers will take care of them. */
3838 xinner = adjust_address (xinner, BLKmode, used);
3840 /* If the partial register-part of the arg counts in its stack size,
3841 skip the part of stack space corresponding to the registers.
3842 Otherwise, start copying to the beginning of the stack space,
3843 by setting SKIP to 0. */
3844 skip = (reg_parm_stack_space == 0) ? 0 : used;
3846 #ifdef PUSH_ROUNDING
3847 /* Do it with several push insns if that doesn't take lots of insns
3848 and if there is no difficulty with push insns that skip bytes
3849 on the stack for alignment purposes. */
3852 && GET_CODE (size) == CONST_INT
3854 && MEM_ALIGN (xinner) >= align
3855 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3856 /* Here we avoid the case of a structure whose weak alignment
3857 forces many pushes of a small amount of data,
3858 and such small pushes do rounding that causes trouble. */
3859 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3860 || align >= BIGGEST_ALIGNMENT
3861 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3862 == (align / BITS_PER_UNIT)))
3863 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3865 /* Push padding now if padding above and stack grows down,
3866 or if padding below and stack grows up.
3867 But if space already allocated, this has already been done. */
3868 if (extra && args_addr == 0
3869 && where_pad != none && where_pad != stack_direction)
3870 anti_adjust_stack (GEN_INT (extra));
3872 move_by_pieces (NULL, xinner, INTVAL (size) - used, align);
3875 #endif /* PUSH_ROUNDING */
3879 /* Otherwise make space on the stack and copy the data
3880 to the address of that space. */
3882 /* Deduct words put into registers from the size we must copy. */
3885 if (GET_CODE (size) == CONST_INT)
3886 size = GEN_INT (INTVAL (size) - used);
3888 size = expand_binop (GET_MODE (size), sub_optab, size,
3889 GEN_INT (used), NULL_RTX, 0,
3893 /* Get the address of the stack space.
3894 In this case, we do not deal with EXTRA separately.
3895 A single stack adjust will do. */
3898 temp = push_block (size, extra, where_pad == downward);
3901 else if (GET_CODE (args_so_far) == CONST_INT)
3902 temp = memory_address (BLKmode,
3903 plus_constant (args_addr,
3904 skip + INTVAL (args_so_far)));
3906 temp = memory_address (BLKmode,
3907 plus_constant (gen_rtx_PLUS (Pmode,
3912 if (!ACCUMULATE_OUTGOING_ARGS)
3914 /* If the source is referenced relative to the stack pointer,
3915 copy it to another register to stabilize it. We do not need
3916 to do this if we know that we won't be changing sp. */
3918 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3919 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3920 temp = copy_to_reg (temp);
3923 target = gen_rtx_MEM (BLKmode, temp);
3927 set_mem_attributes (target, type, 1);
3928 /* Function incoming arguments may overlap with sibling call
3929 outgoing arguments and we cannot allow reordering of reads
3930 from function arguments with stores to outgoing arguments
3931 of sibling calls. */
3932 set_mem_alias_set (target, 0);
3935 /* ALIGN may well be better aligned than TYPE, e.g. due to
3936 PARM_BOUNDARY. Assume the caller isn't lying. */
3937 set_mem_align (target, align);
3939 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3942 else if (partial > 0)
3944 /* Scalar partly in registers. */
3946 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3949 /* # words of start of argument
3950 that we must make space for but need not store. */
3951 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3952 int args_offset = INTVAL (args_so_far);
3955 /* Push padding now if padding above and stack grows down,
3956 or if padding below and stack grows up.
3957 But if space already allocated, this has already been done. */
3958 if (extra && args_addr == 0
3959 && where_pad != none && where_pad != stack_direction)
3960 anti_adjust_stack (GEN_INT (extra));
3962 /* If we make space by pushing it, we might as well push
3963 the real data. Otherwise, we can leave OFFSET nonzero
3964 and leave the space uninitialized. */
3968 /* Now NOT_STACK gets the number of words that we don't need to
3969 allocate on the stack. */
3970 not_stack = partial - offset;
3972 /* If the partial register-part of the arg counts in its stack size,
3973 skip the part of stack space corresponding to the registers.
3974 Otherwise, start copying to the beginning of the stack space,
3975 by setting SKIP to 0. */
3976 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3978 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3979 x = validize_mem (force_const_mem (mode, x));
3981 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3982 SUBREGs of such registers are not allowed. */
3983 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER
3984 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3985 x = copy_to_reg (x);
3987 /* Loop over all the words allocated on the stack for this arg. */
3988 /* We can do it by words, because any scalar bigger than a word
3989 has a size a multiple of a word. */
3990 #ifndef PUSH_ARGS_REVERSED
3991 for (i = not_stack; i < size; i++)
3993 for (i = size - 1; i >= not_stack; i--)
3995 if (i >= not_stack + offset)
3996 emit_push_insn (operand_subword_force (x, i, mode),
3997 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3999 GEN_INT (args_offset + ((i - not_stack + skip)
4001 reg_parm_stack_space, alignment_pad);
4008 /* Push padding now if padding above and stack grows down,
4009 or if padding below and stack grows up.
4010 But if space already allocated, this has already been done. */
4011 if (extra && args_addr == 0
4012 && where_pad != none && where_pad != stack_direction)
4013 anti_adjust_stack (GEN_INT (extra));
4015 #ifdef PUSH_ROUNDING
4016 if (args_addr == 0 && PUSH_ARGS)
4017 emit_single_push_insn (mode, x, type);
4021 if (GET_CODE (args_so_far) == CONST_INT)
4023 = memory_address (mode,
4024 plus_constant (args_addr,
4025 INTVAL (args_so_far)));
4027 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
4029 dest = gen_rtx_MEM (mode, addr);
4032 set_mem_attributes (dest, type, 1);
4033 /* Function incoming arguments may overlap with sibling call
4034 outgoing arguments and we cannot allow reordering of reads
4035 from function arguments with stores to outgoing arguments
4036 of sibling calls. */
4037 set_mem_alias_set (dest, 0);
4040 emit_move_insn (dest, x);
4044 /* If part should go in registers, copy that part
4045 into the appropriate registers. Do this now, at the end,
4046 since mem-to-mem copies above may do function calls. */
4047 if (partial > 0 && reg != 0)
4049 /* Handle calls that pass values in multiple non-contiguous locations.
4050 The Irix 6 ABI has examples of this. */
4051 if (GET_CODE (reg) == PARALLEL)
4052 emit_group_load (reg, x, -1); /* ??? size? */
4054 move_block_to_reg (REGNO (reg), x, partial, mode);
4057 if (extra && args_addr == 0 && where_pad == stack_direction)
4058 anti_adjust_stack (GEN_INT (extra));
4060 if (alignment_pad && args_addr == 0)
4061 anti_adjust_stack (alignment_pad);
4064 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4072 /* Only registers can be subtargets. */
4073 || GET_CODE (x) != REG
4074 /* If the register is readonly, it can't be set more than once. */
4075 || RTX_UNCHANGING_P (x)
4076 /* Don't use hard regs to avoid extending their life. */
4077 || REGNO (x) < FIRST_PSEUDO_REGISTER
4078 /* Avoid subtargets inside loops,
4079 since they hide some invariant expressions. */
4080 || preserve_subexpressions_p ())
4084 /* Expand an assignment that stores the value of FROM into TO.
4085 If WANT_VALUE is nonzero, return an rtx for the value of TO.
4086 (This may contain a QUEUED rtx;
4087 if the value is constant, this rtx is a constant.)
4088 Otherwise, the returned value is NULL_RTX.
4090 SUGGEST_REG is no longer actually used.
4091 It used to mean, copy the value through a register
4092 and return that register, if that is possible.
4093 We now use WANT_VALUE to decide whether to do this. */
4096 expand_assignment (to, from, want_value, suggest_reg)
4099 int suggest_reg ATTRIBUTE_UNUSED;
4104 /* Don't crash if the lhs of the assignment was erroneous. */
4106 if (TREE_CODE (to) == ERROR_MARK)
4108 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
4109 return want_value ? result : NULL_RTX;
4112 /* Assignment of a structure component needs special treatment
4113 if the structure component's rtx is not simply a MEM.
4114 Assignment of an array element at a constant index, and assignment of
4115 an array element in an unaligned packed structure field, has the same
4118 if (TREE_CODE (to) == COMPONENT_REF || TREE_CODE (to) == BIT_FIELD_REF
4119 || TREE_CODE (to) == ARRAY_REF || TREE_CODE (to) == ARRAY_RANGE_REF
4120 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4122 enum machine_mode mode1;
4123 HOST_WIDE_INT bitsize, bitpos;
4131 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4132 &unsignedp, &volatilep);
4134 /* If we are going to use store_bit_field and extract_bit_field,
4135 make sure to_rtx will be safe for multiple use. */
4137 if (mode1 == VOIDmode && want_value)
4138 tem = stabilize_reference (tem);
4140 orig_to_rtx = to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
4144 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4146 if (GET_CODE (to_rtx) != MEM)
4149 #ifdef POINTERS_EXTEND_UNSIGNED
4150 if (GET_MODE (offset_rtx) != Pmode)
4151 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
4153 if (GET_MODE (offset_rtx) != ptr_mode)
4154 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4157 /* A constant address in TO_RTX can have VOIDmode, we must not try
4158 to call force_reg for that case. Avoid that case. */
4159 if (GET_CODE (to_rtx) == MEM
4160 && GET_MODE (to_rtx) == BLKmode
4161 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4163 && (bitpos % bitsize) == 0
4164 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4165 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4167 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4171 to_rtx = offset_address (to_rtx, offset_rtx,
4172 highest_pow2_factor_for_type (TREE_TYPE (to),
4176 if (GET_CODE (to_rtx) == MEM)
4178 /* If the field is at offset zero, we could have been given the
4179 DECL_RTX of the parent struct. Don't munge it. */
4180 to_rtx = shallow_copy_rtx (to_rtx);
4182 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4185 /* Deal with volatile and readonly fields. The former is only done
4186 for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4187 if (volatilep && GET_CODE (to_rtx) == MEM)
4189 if (to_rtx == orig_to_rtx)
4190 to_rtx = copy_rtx (to_rtx);
4191 MEM_VOLATILE_P (to_rtx) = 1;
4194 if (TREE_CODE (to) == COMPONENT_REF
4195 && TREE_READONLY (TREE_OPERAND (to, 1)))
4197 if (to_rtx == orig_to_rtx)
4198 to_rtx = copy_rtx (to_rtx);
4199 RTX_UNCHANGING_P (to_rtx) = 1;
4202 if (GET_CODE (to_rtx) == MEM && ! can_address_p (to))
4204 if (to_rtx == orig_to_rtx)
4205 to_rtx = copy_rtx (to_rtx);
4206 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4209 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4211 /* Spurious cast for HPUX compiler. */
4212 ? ((enum machine_mode)
4213 TYPE_MODE (TREE_TYPE (to)))
4215 unsignedp, TREE_TYPE (tem), get_alias_set (to));
4217 preserve_temp_slots (result);
4221 /* If the value is meaningful, convert RESULT to the proper mode.
4222 Otherwise, return nothing. */
4223 return (want_value ? convert_modes (TYPE_MODE (TREE_TYPE (to)),
4224 TYPE_MODE (TREE_TYPE (from)),
4226 TREE_UNSIGNED (TREE_TYPE (to)))
4230 /* If the rhs is a function call and its value is not an aggregate,
4231 call the function before we start to compute the lhs.
4232 This is needed for correct code for cases such as
4233 val = setjmp (buf) on machines where reference to val
4234 requires loading up part of an address in a separate insn.
4236 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4237 since it might be a promoted variable where the zero- or sign- extension
4238 needs to be done. Handling this in the normal way is safe because no
4239 computation is done before the call. */
4240 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from)
4241 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4242 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4243 && GET_CODE (DECL_RTL (to)) == REG))
4248 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
4250 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4252 /* Handle calls that return values in multiple non-contiguous locations.
4253 The Irix 6 ABI has examples of this. */
4254 if (GET_CODE (to_rtx) == PARALLEL)
4255 emit_group_load (to_rtx, value, int_size_in_bytes (TREE_TYPE (from)));
4256 else if (GET_MODE (to_rtx) == BLKmode)
4257 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4260 #ifdef POINTERS_EXTEND_UNSIGNED
4261 if (POINTER_TYPE_P (TREE_TYPE (to))
4262 && GET_MODE (to_rtx) != GET_MODE (value))
4263 value = convert_memory_address (GET_MODE (to_rtx), value);
4265 emit_move_insn (to_rtx, value);
4267 preserve_temp_slots (to_rtx);
4270 return want_value ? to_rtx : NULL_RTX;
4273 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4274 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4277 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4279 /* Don't move directly into a return register. */
4280 if (TREE_CODE (to) == RESULT_DECL
4281 && (GET_CODE (to_rtx) == REG || GET_CODE (to_rtx) == PARALLEL))
4286 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
4288 if (GET_CODE (to_rtx) == PARALLEL)
4289 emit_group_load (to_rtx, temp, int_size_in_bytes (TREE_TYPE (from)));
4291 emit_move_insn (to_rtx, temp);
4293 preserve_temp_slots (to_rtx);
4296 return want_value ? to_rtx : NULL_RTX;
4299 /* In case we are returning the contents of an object which overlaps
4300 the place the value is being stored, use a safe function when copying
4301 a value through a pointer into a structure value return block. */
4302 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
4303 && current_function_returns_struct
4304 && !current_function_returns_pcc_struct)
4309 size = expr_size (from);
4310 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
4312 if (TARGET_MEM_FUNCTIONS)
4313 emit_library_call (memmove_libfunc, LCT_NORMAL,
4314 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4315 XEXP (from_rtx, 0), Pmode,
4316 convert_to_mode (TYPE_MODE (sizetype),
4317 size, TREE_UNSIGNED (sizetype)),
4318 TYPE_MODE (sizetype));
4320 emit_library_call (bcopy_libfunc, LCT_NORMAL,
4321 VOIDmode, 3, XEXP (from_rtx, 0), Pmode,
4322 XEXP (to_rtx, 0), Pmode,
4323 convert_to_mode (TYPE_MODE (integer_type_node),
4325 TREE_UNSIGNED (integer_type_node)),
4326 TYPE_MODE (integer_type_node));
4328 preserve_temp_slots (to_rtx);
4331 return want_value ? to_rtx : NULL_RTX;
4334 /* Compute FROM and store the value in the rtx we got. */
4337 result = store_expr (from, to_rtx, want_value);
4338 preserve_temp_slots (result);
4341 return want_value ? result : NULL_RTX;
4344 /* Generate code for computing expression EXP,
4345 and storing the value into TARGET.
4346 TARGET may contain a QUEUED rtx.
4348 If WANT_VALUE & 1 is nonzero, return a copy of the value
4349 not in TARGET, so that we can be sure to use the proper
4350 value in a containing expression even if TARGET has something
4351 else stored in it. If possible, we copy the value through a pseudo
4352 and return that pseudo. Or, if the value is constant, we try to
4353 return the constant. In some cases, we return a pseudo
4354 copied *from* TARGET.
4356 If the mode is BLKmode then we may return TARGET itself.
4357 It turns out that in BLKmode it doesn't cause a problem.
4358 because C has no operators that could combine two different
4359 assignments into the same BLKmode object with different values
4360 with no sequence point. Will other languages need this to
4363 If WANT_VALUE & 1 is 0, we return NULL, to make sure
4364 to catch quickly any cases where the caller uses the value
4365 and fails to set WANT_VALUE.
4367 If WANT_VALUE & 2 is set, this is a store into a call param on the
4368 stack, and block moves may need to be treated specially. */
4371 store_expr (exp, target, want_value)
4377 int dont_return_target = 0;
4378 int dont_store_target = 0;
4380 if (VOID_TYPE_P (TREE_TYPE (exp)))
4382 /* C++ can generate ?: expressions with a throw expression in one
4383 branch and an rvalue in the other. Here, we resolve attempts to
4384 store the throw expression's nonexistant result. */
4387 expand_expr (exp, const0_rtx, VOIDmode, 0);
4390 if (TREE_CODE (exp) == COMPOUND_EXPR)
4392 /* Perform first part of compound expression, then assign from second
4394 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4395 want_value & 2 ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4397 return store_expr (TREE_OPERAND (exp, 1), target, want_value);
4399 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4401 /* For conditional expression, get safe form of the target. Then
4402 test the condition, doing the appropriate assignment on either
4403 side. This avoids the creation of unnecessary temporaries.
4404 For non-BLKmode, it is more efficient not to do this. */
4406 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4409 target = protect_from_queue (target, 1);
4411 do_pending_stack_adjust ();
4413 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4414 start_cleanup_deferral ();
4415 store_expr (TREE_OPERAND (exp, 1), target, want_value & 2);
4416 end_cleanup_deferral ();
4418 emit_jump_insn (gen_jump (lab2));
4421 start_cleanup_deferral ();
4422 store_expr (TREE_OPERAND (exp, 2), target, want_value & 2);
4423 end_cleanup_deferral ();
4428 return want_value & 1 ? target : NULL_RTX;
4430 else if (queued_subexp_p (target))
4431 /* If target contains a postincrement, let's not risk
4432 using it as the place to generate the rhs. */
4434 if (GET_MODE (target) != BLKmode && GET_MODE (target) != VOIDmode)
4436 /* Expand EXP into a new pseudo. */
4437 temp = gen_reg_rtx (GET_MODE (target));
4438 temp = expand_expr (exp, temp, GET_MODE (target),
4440 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4443 temp = expand_expr (exp, NULL_RTX, GET_MODE (target),
4445 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4447 /* If target is volatile, ANSI requires accessing the value
4448 *from* the target, if it is accessed. So make that happen.
4449 In no case return the target itself. */
4450 if (! MEM_VOLATILE_P (target) && (want_value & 1) != 0)
4451 dont_return_target = 1;
4453 else if ((want_value & 1) != 0
4454 && GET_CODE (target) == MEM
4455 && ! MEM_VOLATILE_P (target)
4456 && GET_MODE (target) != BLKmode)
4457 /* If target is in memory and caller wants value in a register instead,
4458 arrange that. Pass TARGET as target for expand_expr so that,
4459 if EXP is another assignment, WANT_VALUE will be nonzero for it.
4460 We know expand_expr will not use the target in that case.
4461 Don't do this if TARGET is volatile because we are supposed
4462 to write it and then read it. */
4464 temp = expand_expr (exp, target, GET_MODE (target),
4465 want_value & 2 ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4466 if (GET_MODE (temp) != BLKmode && GET_MODE (temp) != VOIDmode)
4468 /* If TEMP is already in the desired TARGET, only copy it from
4469 memory and don't store it there again. */
4471 || (rtx_equal_p (temp, target)
4472 && ! side_effects_p (temp) && ! side_effects_p (target)))
4473 dont_store_target = 1;
4474 temp = copy_to_reg (temp);
4476 dont_return_target = 1;
4478 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4479 /* If this is a scalar in a register that is stored in a wider mode
4480 than the declared mode, compute the result into its declared mode
4481 and then convert to the wider mode. Our value is the computed
4484 rtx inner_target = 0;
4486 /* If we don't want a value, we can do the conversion inside EXP,
4487 which will often result in some optimizations. Do the conversion
4488 in two steps: first change the signedness, if needed, then
4489 the extend. But don't do this if the type of EXP is a subtype
4490 of something else since then the conversion might involve
4491 more than just converting modes. */
4492 if ((want_value & 1) == 0
4493 && INTEGRAL_TYPE_P (TREE_TYPE (exp))
4494 && TREE_TYPE (TREE_TYPE (exp)) == 0)
4496 if (TREE_UNSIGNED (TREE_TYPE (exp))
4497 != SUBREG_PROMOTED_UNSIGNED_P (target))
4499 ((*lang_hooks.types.signed_or_unsigned_type)
4500 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)), exp);
4502 exp = convert ((*lang_hooks.types.type_for_mode)
4503 (GET_MODE (SUBREG_REG (target)),
4504 SUBREG_PROMOTED_UNSIGNED_P (target)),
4507 inner_target = SUBREG_REG (target);
4510 temp = expand_expr (exp, inner_target, VOIDmode,
4511 want_value & 2 ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4513 /* If TEMP is a MEM and we want a result value, make the access
4514 now so it gets done only once. Strictly speaking, this is
4515 only necessary if the MEM is volatile, or if the address
4516 overlaps TARGET. But not performing the load twice also
4517 reduces the amount of rtl we generate and then have to CSE. */
4518 if (GET_CODE (temp) == MEM && (want_value & 1) != 0)
4519 temp = copy_to_reg (temp);
4521 /* If TEMP is a VOIDmode constant, use convert_modes to make
4522 sure that we properly convert it. */
4523 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4525 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4526 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4527 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4528 GET_MODE (target), temp,
4529 SUBREG_PROMOTED_UNSIGNED_P (target));
4532 convert_move (SUBREG_REG (target), temp,
4533 SUBREG_PROMOTED_UNSIGNED_P (target));
4535 /* If we promoted a constant, change the mode back down to match
4536 target. Otherwise, the caller might get confused by a result whose
4537 mode is larger than expected. */
4539 if ((want_value & 1) != 0 && GET_MODE (temp) != GET_MODE (target))
4541 if (GET_MODE (temp) != VOIDmode)
4543 temp = gen_lowpart_SUBREG (GET_MODE (target), temp);
4544 SUBREG_PROMOTED_VAR_P (temp) = 1;
4545 SUBREG_PROMOTED_UNSIGNED_SET (temp,
4546 SUBREG_PROMOTED_UNSIGNED_P (target));
4549 temp = convert_modes (GET_MODE (target),
4550 GET_MODE (SUBREG_REG (target)),
4551 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4554 return want_value & 1 ? temp : NULL_RTX;
4558 temp = expand_expr (exp, target, GET_MODE (target),
4559 want_value & 2 ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4560 /* Return TARGET if it's a specified hardware register.
4561 If TARGET is a volatile mem ref, either return TARGET
4562 or return a reg copied *from* TARGET; ANSI requires this.
4564 Otherwise, if TEMP is not TARGET, return TEMP
4565 if it is constant (for efficiency),
4566 or if we really want the correct value. */
4567 if (!(target && GET_CODE (target) == REG
4568 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4569 && !(GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
4570 && ! rtx_equal_p (temp, target)
4571 && (CONSTANT_P (temp) || (want_value & 1) != 0))
4572 dont_return_target = 1;
4575 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4576 the same as that of TARGET, adjust the constant. This is needed, for
4577 example, in case it is a CONST_DOUBLE and we want only a word-sized
4579 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4580 && TREE_CODE (exp) != ERROR_MARK
4581 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4582 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4583 temp, TREE_UNSIGNED (TREE_TYPE (exp)));
4585 /* If value was not generated in the target, store it there.
4586 Convert the value to TARGET's type first if necessary.
4587 If TEMP and TARGET compare equal according to rtx_equal_p, but
4588 one or both of them are volatile memory refs, we have to distinguish
4590 - expand_expr has used TARGET. In this case, we must not generate
4591 another copy. This can be detected by TARGET being equal according
4593 - expand_expr has not used TARGET - that means that the source just
4594 happens to have the same RTX form. Since temp will have been created
4595 by expand_expr, it will compare unequal according to == .
4596 We must generate a copy in this case, to reach the correct number
4597 of volatile memory references. */
4599 if ((! rtx_equal_p (temp, target)
4600 || (temp != target && (side_effects_p (temp)
4601 || side_effects_p (target))))
4602 && TREE_CODE (exp) != ERROR_MARK
4603 && ! dont_store_target
4604 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4605 but TARGET is not valid memory reference, TEMP will differ
4606 from TARGET although it is really the same location. */
4607 && (TREE_CODE_CLASS (TREE_CODE (exp)) != 'd'
4608 || target != DECL_RTL_IF_SET (exp))
4609 /* If there's nothing to copy, don't bother. Don't call expr_size
4610 unless necessary, because some front-ends (C++) expr_size-hook
4611 aborts on objects that are not supposed to be bit-copied or
4613 && expr_size (exp) != const0_rtx)
4615 target = protect_from_queue (target, 1);
4616 if (GET_MODE (temp) != GET_MODE (target)
4617 && GET_MODE (temp) != VOIDmode)
4619 int unsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
4620 if (dont_return_target)
4622 /* In this case, we will return TEMP,
4623 so make sure it has the proper mode.
4624 But don't forget to store the value into TARGET. */
4625 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4626 emit_move_insn (target, temp);
4629 convert_move (target, temp, unsignedp);
4632 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4634 /* Handle copying a string constant into an array. The string
4635 constant may be shorter than the array. So copy just the string's
4636 actual length, and clear the rest. First get the size of the data
4637 type of the string, which is actually the size of the target. */
4638 rtx size = expr_size (exp);
4640 if (GET_CODE (size) == CONST_INT
4641 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4642 emit_block_move (target, temp, size,
4644 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4647 /* Compute the size of the data to copy from the string. */
4649 = size_binop (MIN_EXPR,
4650 make_tree (sizetype, size),
4651 size_int (TREE_STRING_LENGTH (exp)));
4653 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4655 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4658 /* Copy that much. */
4659 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx,
4660 TREE_UNSIGNED (sizetype));
4661 emit_block_move (target, temp, copy_size_rtx,
4663 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4665 /* Figure out how much is left in TARGET that we have to clear.
4666 Do all calculations in ptr_mode. */
4667 if (GET_CODE (copy_size_rtx) == CONST_INT)
4669 size = plus_constant (size, -INTVAL (copy_size_rtx));
4670 target = adjust_address (target, BLKmode,
4671 INTVAL (copy_size_rtx));
4675 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4676 copy_size_rtx, NULL_RTX, 0,
4679 #ifdef POINTERS_EXTEND_UNSIGNED
4680 if (GET_MODE (copy_size_rtx) != Pmode)
4681 copy_size_rtx = convert_to_mode (Pmode, copy_size_rtx,
4682 TREE_UNSIGNED (sizetype));
4685 target = offset_address (target, copy_size_rtx,
4686 highest_pow2_factor (copy_size));
4687 label = gen_label_rtx ();
4688 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4689 GET_MODE (size), 0, label);
4692 if (size != const0_rtx)
4693 clear_storage (target, size);
4699 /* Handle calls that return values in multiple non-contiguous locations.
4700 The Irix 6 ABI has examples of this. */
4701 else if (GET_CODE (target) == PARALLEL)
4702 emit_group_load (target, temp, int_size_in_bytes (TREE_TYPE (exp)));
4703 else if (GET_MODE (temp) == BLKmode)
4704 emit_block_move (target, temp, expr_size (exp),
4706 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4708 emit_move_insn (target, temp);
4711 /* If we don't want a value, return NULL_RTX. */
4712 if ((want_value & 1) == 0)
4715 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
4716 ??? The latter test doesn't seem to make sense. */
4717 else if (dont_return_target && GET_CODE (temp) != MEM)
4720 /* Return TARGET itself if it is a hard register. */
4721 else if ((want_value & 1) != 0
4722 && GET_MODE (target) != BLKmode
4723 && ! (GET_CODE (target) == REG
4724 && REGNO (target) < FIRST_PSEUDO_REGISTER))
4725 return copy_to_reg (target);
4731 /* Return 1 if EXP just contains zeros. */
4739 switch (TREE_CODE (exp))
4743 case NON_LVALUE_EXPR:
4744 case VIEW_CONVERT_EXPR:
4745 return is_zeros_p (TREE_OPERAND (exp, 0));
4748 return integer_zerop (exp);
4752 is_zeros_p (TREE_REALPART (exp)) && is_zeros_p (TREE_IMAGPART (exp));
4755 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp), dconst0);
4758 for (elt = TREE_VECTOR_CST_ELTS (exp); elt;
4759 elt = TREE_CHAIN (elt))
4760 if (!is_zeros_p (TREE_VALUE (elt)))
4766 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4767 return CONSTRUCTOR_ELTS (exp) == NULL_TREE;
4768 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4769 if (! is_zeros_p (TREE_VALUE (elt)))
4779 /* Return 1 if EXP contains mostly (3/4) zeros. */
4782 mostly_zeros_p (exp)
4785 if (TREE_CODE (exp) == CONSTRUCTOR)
4787 int elts = 0, zeros = 0;
4788 tree elt = CONSTRUCTOR_ELTS (exp);
4789 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4791 /* If there are no ranges of true bits, it is all zero. */
4792 return elt == NULL_TREE;
4794 for (; elt; elt = TREE_CHAIN (elt))
4796 /* We do not handle the case where the index is a RANGE_EXPR,
4797 so the statistic will be somewhat inaccurate.
4798 We do make a more accurate count in store_constructor itself,
4799 so since this function is only used for nested array elements,
4800 this should be close enough. */
4801 if (mostly_zeros_p (TREE_VALUE (elt)))
4806 return 4 * zeros >= 3 * elts;
4809 return is_zeros_p (exp);
4812 /* Helper function for store_constructor.
4813 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4814 TYPE is the type of the CONSTRUCTOR, not the element type.
4815 CLEARED is as for store_constructor.
4816 ALIAS_SET is the alias set to use for any stores.
4818 This provides a recursive shortcut back to store_constructor when it isn't
4819 necessary to go through store_field. This is so that we can pass through
4820 the cleared field to let store_constructor know that we may not have to
4821 clear a substructure if the outer structure has already been cleared. */
4824 store_constructor_field (target, bitsize, bitpos, mode, exp, type, cleared,
4827 unsigned HOST_WIDE_INT bitsize;
4828 HOST_WIDE_INT bitpos;
4829 enum machine_mode mode;
4834 if (TREE_CODE (exp) == CONSTRUCTOR
4835 && bitpos % BITS_PER_UNIT == 0
4836 /* If we have a nonzero bitpos for a register target, then we just
4837 let store_field do the bitfield handling. This is unlikely to
4838 generate unnecessary clear instructions anyways. */
4839 && (bitpos == 0 || GET_CODE (target) == MEM))
4841 if (GET_CODE (target) == MEM)
4843 = adjust_address (target,
4844 GET_MODE (target) == BLKmode
4846 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4847 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4850 /* Update the alias set, if required. */
4851 if (GET_CODE (target) == MEM && ! MEM_KEEP_ALIAS_SET_P (target)
4852 && MEM_ALIAS_SET (target) != 0)
4854 target = copy_rtx (target);
4855 set_mem_alias_set (target, alias_set);
4858 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4861 store_field (target, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
4865 /* Store the value of constructor EXP into the rtx TARGET.
4866 TARGET is either a REG or a MEM; we know it cannot conflict, since
4867 safe_from_p has been called.
4868 CLEARED is true if TARGET is known to have been zero'd.
4869 SIZE is the number of bytes of TARGET we are allowed to modify: this
4870 may not be the same as the size of EXP if we are assigning to a field
4871 which has been packed to exclude padding bits. */
4874 store_constructor (exp, target, cleared, size)
4880 tree type = TREE_TYPE (exp);
4881 #ifdef WORD_REGISTER_OPERATIONS
4882 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4885 if (TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4886 || TREE_CODE (type) == QUAL_UNION_TYPE)
4890 /* We either clear the aggregate or indicate the value is dead. */
4891 if ((TREE_CODE (type) == UNION_TYPE
4892 || TREE_CODE (type) == QUAL_UNION_TYPE)
4894 && ! CONSTRUCTOR_ELTS (exp))
4895 /* If the constructor is empty, clear the union. */
4897 clear_storage (target, expr_size (exp));
4901 /* If we are building a static constructor into a register,
4902 set the initial value as zero so we can fold the value into
4903 a constant. But if more than one register is involved,
4904 this probably loses. */
4905 else if (! cleared && GET_CODE (target) == REG && TREE_STATIC (exp)
4906 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4908 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4912 /* If the constructor has fewer fields than the structure
4913 or if we are initializing the structure to mostly zeros,
4914 clear the whole structure first. Don't do this if TARGET is a
4915 register whose mode size isn't equal to SIZE since clear_storage
4916 can't handle this case. */
4917 else if (! cleared && size > 0
4918 && ((list_length (CONSTRUCTOR_ELTS (exp))
4919 != fields_length (type))
4920 || mostly_zeros_p (exp))
4921 && (GET_CODE (target) != REG
4922 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4925 rtx xtarget = target;
4927 if (readonly_fields_p (type))
4929 xtarget = copy_rtx (xtarget);
4930 RTX_UNCHANGING_P (xtarget) = 1;
4933 clear_storage (xtarget, GEN_INT (size));
4938 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4940 /* Store each element of the constructor into
4941 the corresponding field of TARGET. */
4943 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4945 tree field = TREE_PURPOSE (elt);
4946 tree value = TREE_VALUE (elt);
4947 enum machine_mode mode;
4948 HOST_WIDE_INT bitsize;
4949 HOST_WIDE_INT bitpos = 0;
4951 rtx to_rtx = target;
4953 /* Just ignore missing fields.
4954 We cleared the whole structure, above,
4955 if any fields are missing. */
4959 if (cleared && is_zeros_p (value))
4962 if (host_integerp (DECL_SIZE (field), 1))
4963 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4967 mode = DECL_MODE (field);
4968 if (DECL_BIT_FIELD (field))
4971 offset = DECL_FIELD_OFFSET (field);
4972 if (host_integerp (offset, 0)
4973 && host_integerp (bit_position (field), 0))
4975 bitpos = int_bit_position (field);
4979 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4985 if (CONTAINS_PLACEHOLDER_P (offset))
4986 offset = build (WITH_RECORD_EXPR, sizetype,
4987 offset, make_tree (TREE_TYPE (exp), target));
4989 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4990 if (GET_CODE (to_rtx) != MEM)
4993 #ifdef POINTERS_EXTEND_UNSIGNED
4994 if (GET_MODE (offset_rtx) != Pmode)
4995 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
4997 if (GET_MODE (offset_rtx) != ptr_mode)
4998 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
5001 to_rtx = offset_address (to_rtx, offset_rtx,
5002 highest_pow2_factor (offset));
5005 if (TREE_READONLY (field))
5007 if (GET_CODE (to_rtx) == MEM)
5008 to_rtx = copy_rtx (to_rtx);
5010 RTX_UNCHANGING_P (to_rtx) = 1;
5013 #ifdef WORD_REGISTER_OPERATIONS
5014 /* If this initializes a field that is smaller than a word, at the
5015 start of a word, try to widen it to a full word.
5016 This special case allows us to output C++ member function
5017 initializations in a form that the optimizers can understand. */
5018 if (GET_CODE (target) == REG
5019 && bitsize < BITS_PER_WORD
5020 && bitpos % BITS_PER_WORD == 0
5021 && GET_MODE_CLASS (mode) == MODE_INT
5022 && TREE_CODE (value) == INTEGER_CST
5024 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5026 tree type = TREE_TYPE (value);
5028 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5030 type = (*lang_hooks.types.type_for_size)
5031 (BITS_PER_WORD, TREE_UNSIGNED (type));
5032 value = convert (type, value);
5035 if (BYTES_BIG_ENDIAN)
5037 = fold (build (LSHIFT_EXPR, type, value,
5038 build_int_2 (BITS_PER_WORD - bitsize, 0)));
5039 bitsize = BITS_PER_WORD;
5044 if (GET_CODE (to_rtx) == MEM && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5045 && DECL_NONADDRESSABLE_P (field))
5047 to_rtx = copy_rtx (to_rtx);
5048 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5051 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5052 value, type, cleared,
5053 get_alias_set (TREE_TYPE (field)));
5056 else if (TREE_CODE (type) == ARRAY_TYPE
5057 || TREE_CODE (type) == VECTOR_TYPE)
5062 tree domain = TYPE_DOMAIN (type);
5063 tree elttype = TREE_TYPE (type);
5065 HOST_WIDE_INT minelt = 0;
5066 HOST_WIDE_INT maxelt = 0;
5068 /* Vectors are like arrays, but the domain is stored via an array
5070 if (TREE_CODE (type) == VECTOR_TYPE)
5072 /* Note that although TYPE_DEBUG_REPRESENTATION_TYPE uses
5073 the same field as TYPE_DOMAIN, we are not guaranteed that
5075 domain = TYPE_DEBUG_REPRESENTATION_TYPE (type);
5076 domain = TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (domain)));
5079 const_bounds_p = (TYPE_MIN_VALUE (domain)
5080 && TYPE_MAX_VALUE (domain)
5081 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5082 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5084 /* If we have constant bounds for the range of the type, get them. */
5087 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5088 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5091 /* If the constructor has fewer elements than the array,
5092 clear the whole array first. Similarly if this is
5093 static constructor of a non-BLKmode object. */
5094 if (cleared || (GET_CODE (target) == REG && TREE_STATIC (exp)))
5098 HOST_WIDE_INT count = 0, zero_count = 0;
5099 need_to_clear = ! const_bounds_p;
5101 /* This loop is a more accurate version of the loop in
5102 mostly_zeros_p (it handles RANGE_EXPR in an index).
5103 It is also needed to check for missing elements. */
5104 for (elt = CONSTRUCTOR_ELTS (exp);
5105 elt != NULL_TREE && ! need_to_clear;
5106 elt = TREE_CHAIN (elt))
5108 tree index = TREE_PURPOSE (elt);
5109 HOST_WIDE_INT this_node_count;
5111 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5113 tree lo_index = TREE_OPERAND (index, 0);
5114 tree hi_index = TREE_OPERAND (index, 1);
5116 if (! host_integerp (lo_index, 1)
5117 || ! host_integerp (hi_index, 1))
5123 this_node_count = (tree_low_cst (hi_index, 1)
5124 - tree_low_cst (lo_index, 1) + 1);
5127 this_node_count = 1;
5129 count += this_node_count;
5130 if (mostly_zeros_p (TREE_VALUE (elt)))
5131 zero_count += this_node_count;
5134 /* Clear the entire array first if there are any missing elements,
5135 or if the incidence of zero elements is >= 75%. */
5137 && (count < maxelt - minelt + 1 || 4 * zero_count >= 3 * count))
5141 if (need_to_clear && size > 0)
5146 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5148 clear_storage (target, GEN_INT (size));
5152 else if (REG_P (target))
5153 /* Inform later passes that the old value is dead. */
5154 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
5156 /* Store each element of the constructor into
5157 the corresponding element of TARGET, determined
5158 by counting the elements. */
5159 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
5161 elt = TREE_CHAIN (elt), i++)
5163 enum machine_mode mode;
5164 HOST_WIDE_INT bitsize;
5165 HOST_WIDE_INT bitpos;
5167 tree value = TREE_VALUE (elt);
5168 tree index = TREE_PURPOSE (elt);
5169 rtx xtarget = target;
5171 if (cleared && is_zeros_p (value))
5174 unsignedp = TREE_UNSIGNED (elttype);
5175 mode = TYPE_MODE (elttype);
5176 if (mode == BLKmode)
5177 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5178 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5181 bitsize = GET_MODE_BITSIZE (mode);
5183 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5185 tree lo_index = TREE_OPERAND (index, 0);
5186 tree hi_index = TREE_OPERAND (index, 1);
5187 rtx index_r, pos_rtx, loop_end;
5188 struct nesting *loop;
5189 HOST_WIDE_INT lo, hi, count;
5192 /* If the range is constant and "small", unroll the loop. */
5194 && host_integerp (lo_index, 0)
5195 && host_integerp (hi_index, 0)
5196 && (lo = tree_low_cst (lo_index, 0),
5197 hi = tree_low_cst (hi_index, 0),
5198 count = hi - lo + 1,
5199 (GET_CODE (target) != MEM
5201 || (host_integerp (TYPE_SIZE (elttype), 1)
5202 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5205 lo -= minelt; hi -= minelt;
5206 for (; lo <= hi; lo++)
5208 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5210 if (GET_CODE (target) == MEM
5211 && !MEM_KEEP_ALIAS_SET_P (target)
5212 && TREE_CODE (type) == ARRAY_TYPE
5213 && TYPE_NONALIASED_COMPONENT (type))
5215 target = copy_rtx (target);
5216 MEM_KEEP_ALIAS_SET_P (target) = 1;
5219 store_constructor_field
5220 (target, bitsize, bitpos, mode, value, type, cleared,
5221 get_alias_set (elttype));
5226 expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
5227 loop_end = gen_label_rtx ();
5229 unsignedp = TREE_UNSIGNED (domain);
5231 index = build_decl (VAR_DECL, NULL_TREE, domain);
5234 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
5236 SET_DECL_RTL (index, index_r);
5237 if (TREE_CODE (value) == SAVE_EXPR
5238 && SAVE_EXPR_RTL (value) == 0)
5240 /* Make sure value gets expanded once before the
5242 expand_expr (value, const0_rtx, VOIDmode, 0);
5245 store_expr (lo_index, index_r, 0);
5246 loop = expand_start_loop (0);
5248 /* Assign value to element index. */
5250 = convert (ssizetype,
5251 fold (build (MINUS_EXPR, TREE_TYPE (index),
5252 index, TYPE_MIN_VALUE (domain))));
5253 position = size_binop (MULT_EXPR, position,
5255 TYPE_SIZE_UNIT (elttype)));
5257 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
5258 xtarget = offset_address (target, pos_rtx,
5259 highest_pow2_factor (position));
5260 xtarget = adjust_address (xtarget, mode, 0);
5261 if (TREE_CODE (value) == CONSTRUCTOR)
5262 store_constructor (value, xtarget, cleared,
5263 bitsize / BITS_PER_UNIT);
5265 store_expr (value, xtarget, 0);
5267 expand_exit_loop_if_false (loop,
5268 build (LT_EXPR, integer_type_node,
5271 expand_increment (build (PREINCREMENT_EXPR,
5273 index, integer_one_node), 0, 0);
5275 emit_label (loop_end);
5278 else if ((index != 0 && ! host_integerp (index, 0))
5279 || ! host_integerp (TYPE_SIZE (elttype), 1))
5284 index = ssize_int (1);
5287 index = convert (ssizetype,
5288 fold (build (MINUS_EXPR, index,
5289 TYPE_MIN_VALUE (domain))));
5291 position = size_binop (MULT_EXPR, index,
5293 TYPE_SIZE_UNIT (elttype)));
5294 xtarget = offset_address (target,
5295 expand_expr (position, 0, VOIDmode, 0),
5296 highest_pow2_factor (position));
5297 xtarget = adjust_address (xtarget, mode, 0);
5298 store_expr (value, xtarget, 0);
5303 bitpos = ((tree_low_cst (index, 0) - minelt)
5304 * tree_low_cst (TYPE_SIZE (elttype), 1));
5306 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5308 if (GET_CODE (target) == MEM && !MEM_KEEP_ALIAS_SET_P (target)
5309 && TREE_CODE (type) == ARRAY_TYPE
5310 && TYPE_NONALIASED_COMPONENT (type))
5312 target = copy_rtx (target);
5313 MEM_KEEP_ALIAS_SET_P (target) = 1;
5316 store_constructor_field (target, bitsize, bitpos, mode, value,
5317 type, cleared, get_alias_set (elttype));
5323 /* Set constructor assignments. */
5324 else if (TREE_CODE (type) == SET_TYPE)
5326 tree elt = CONSTRUCTOR_ELTS (exp);
5327 unsigned HOST_WIDE_INT nbytes = int_size_in_bytes (type), nbits;
5328 tree domain = TYPE_DOMAIN (type);
5329 tree domain_min, domain_max, bitlength;
5331 /* The default implementation strategy is to extract the constant
5332 parts of the constructor, use that to initialize the target,
5333 and then "or" in whatever non-constant ranges we need in addition.
5335 If a large set is all zero or all ones, it is
5336 probably better to set it using memset (if available) or bzero.
5337 Also, if a large set has just a single range, it may also be
5338 better to first clear all the first clear the set (using
5339 bzero/memset), and set the bits we want. */
5341 /* Check for all zeros. */
5342 if (elt == NULL_TREE && size > 0)
5345 clear_storage (target, GEN_INT (size));
5349 domain_min = convert (sizetype, TYPE_MIN_VALUE (domain));
5350 domain_max = convert (sizetype, TYPE_MAX_VALUE (domain));
5351 bitlength = size_binop (PLUS_EXPR,
5352 size_diffop (domain_max, domain_min),
5355 nbits = tree_low_cst (bitlength, 1);
5357 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
5358 are "complicated" (more than one range), initialize (the
5359 constant parts) by copying from a constant. */
5360 if (GET_MODE (target) != BLKmode || nbits <= 2 * BITS_PER_WORD
5361 || (nbytes <= 32 && TREE_CHAIN (elt) != NULL_TREE))
5363 unsigned int set_word_size = TYPE_ALIGN (TREE_TYPE (exp));
5364 enum machine_mode mode = mode_for_size (set_word_size, MODE_INT, 1);
5365 char *bit_buffer = (char *) alloca (nbits);
5366 HOST_WIDE_INT word = 0;
5367 unsigned int bit_pos = 0;
5368 unsigned int ibit = 0;
5369 unsigned int offset = 0; /* In bytes from beginning of set. */
5371 elt = get_set_constructor_bits (exp, bit_buffer, nbits);
5374 if (bit_buffer[ibit])
5376 if (BYTES_BIG_ENDIAN)
5377 word |= (1 << (set_word_size - 1 - bit_pos));
5379 word |= 1 << bit_pos;
5383 if (bit_pos >= set_word_size || ibit == nbits)
5385 if (word != 0 || ! cleared)
5387 rtx datum = GEN_INT (word);
5390 /* The assumption here is that it is safe to use
5391 XEXP if the set is multi-word, but not if
5392 it's single-word. */
5393 if (GET_CODE (target) == MEM)
5394 to_rtx = adjust_address (target, mode, offset);
5395 else if (offset == 0)
5399 emit_move_insn (to_rtx, datum);
5406 offset += set_word_size / BITS_PER_UNIT;
5411 /* Don't bother clearing storage if the set is all ones. */
5412 if (TREE_CHAIN (elt) != NULL_TREE
5413 || (TREE_PURPOSE (elt) == NULL_TREE
5415 : ( ! host_integerp (TREE_VALUE (elt), 0)
5416 || ! host_integerp (TREE_PURPOSE (elt), 0)
5417 || (tree_low_cst (TREE_VALUE (elt), 0)
5418 - tree_low_cst (TREE_PURPOSE (elt), 0) + 1
5419 != (HOST_WIDE_INT) nbits))))
5420 clear_storage (target, expr_size (exp));
5422 for (; elt != NULL_TREE; elt = TREE_CHAIN (elt))
5424 /* Start of range of element or NULL. */
5425 tree startbit = TREE_PURPOSE (elt);
5426 /* End of range of element, or element value. */
5427 tree endbit = TREE_VALUE (elt);
5428 HOST_WIDE_INT startb, endb;
5429 rtx bitlength_rtx, startbit_rtx, endbit_rtx, targetx;
5431 bitlength_rtx = expand_expr (bitlength,
5432 NULL_RTX, MEM, EXPAND_CONST_ADDRESS);
5434 /* Handle non-range tuple element like [ expr ]. */
5435 if (startbit == NULL_TREE)
5437 startbit = save_expr (endbit);
5441 startbit = convert (sizetype, startbit);
5442 endbit = convert (sizetype, endbit);
5443 if (! integer_zerop (domain_min))
5445 startbit = size_binop (MINUS_EXPR, startbit, domain_min);
5446 endbit = size_binop (MINUS_EXPR, endbit, domain_min);
5448 startbit_rtx = expand_expr (startbit, NULL_RTX, MEM,
5449 EXPAND_CONST_ADDRESS);
5450 endbit_rtx = expand_expr (endbit, NULL_RTX, MEM,
5451 EXPAND_CONST_ADDRESS);
5457 ((build_qualified_type ((*lang_hooks.types.type_for_mode)
5458 (GET_MODE (target), 0),
5461 emit_move_insn (targetx, target);
5464 else if (GET_CODE (target) == MEM)
5469 /* Optimization: If startbit and endbit are constants divisible
5470 by BITS_PER_UNIT, call memset instead. */
5471 if (TARGET_MEM_FUNCTIONS
5472 && TREE_CODE (startbit) == INTEGER_CST
5473 && TREE_CODE (endbit) == INTEGER_CST
5474 && (startb = TREE_INT_CST_LOW (startbit)) % BITS_PER_UNIT == 0
5475 && (endb = TREE_INT_CST_LOW (endbit) + 1) % BITS_PER_UNIT == 0)
5477 emit_library_call (memset_libfunc, LCT_NORMAL,
5479 plus_constant (XEXP (targetx, 0),
5480 startb / BITS_PER_UNIT),
5482 constm1_rtx, TYPE_MODE (integer_type_node),
5483 GEN_INT ((endb - startb) / BITS_PER_UNIT),
5484 TYPE_MODE (sizetype));
5487 emit_library_call (setbits_libfunc, LCT_NORMAL,
5488 VOIDmode, 4, XEXP (targetx, 0),
5489 Pmode, bitlength_rtx, TYPE_MODE (sizetype),
5490 startbit_rtx, TYPE_MODE (sizetype),
5491 endbit_rtx, TYPE_MODE (sizetype));
5494 emit_move_insn (target, targetx);
5502 /* Store the value of EXP (an expression tree)
5503 into a subfield of TARGET which has mode MODE and occupies
5504 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5505 If MODE is VOIDmode, it means that we are storing into a bit-field.
5507 If VALUE_MODE is VOIDmode, return nothing in particular.
5508 UNSIGNEDP is not used in this case.
5510 Otherwise, return an rtx for the value stored. This rtx
5511 has mode VALUE_MODE if that is convenient to do.
5512 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
5514 TYPE is the type of the underlying object,
5516 ALIAS_SET is the alias set for the destination. This value will
5517 (in general) be different from that for TARGET, since TARGET is a
5518 reference to the containing structure. */
5521 store_field (target, bitsize, bitpos, mode, exp, value_mode, unsignedp, type,
5524 HOST_WIDE_INT bitsize;
5525 HOST_WIDE_INT bitpos;
5526 enum machine_mode mode;
5528 enum machine_mode value_mode;
5533 HOST_WIDE_INT width_mask = 0;
5535 if (TREE_CODE (exp) == ERROR_MARK)
5538 /* If we have nothing to store, do nothing unless the expression has
5541 return expand_expr (exp, const0_rtx, VOIDmode, 0);
5542 else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
5543 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5545 /* If we are storing into an unaligned field of an aligned union that is
5546 in a register, we may have the mode of TARGET being an integer mode but
5547 MODE == BLKmode. In that case, get an aligned object whose size and
5548 alignment are the same as TARGET and store TARGET into it (we can avoid
5549 the store if the field being stored is the entire width of TARGET). Then
5550 call ourselves recursively to store the field into a BLKmode version of
5551 that object. Finally, load from the object into TARGET. This is not
5552 very efficient in general, but should only be slightly more expensive
5553 than the otherwise-required unaligned accesses. Perhaps this can be
5554 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5555 twice, once with emit_move_insn and once via store_field. */
5558 && (GET_CODE (target) == REG || GET_CODE (target) == SUBREG))
5560 rtx object = assign_temp (type, 0, 1, 1);
5561 rtx blk_object = adjust_address (object, BLKmode, 0);
5563 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5564 emit_move_insn (object, target);
5566 store_field (blk_object, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
5569 emit_move_insn (target, object);
5571 /* We want to return the BLKmode version of the data. */
5575 if (GET_CODE (target) == CONCAT)
5577 /* We're storing into a struct containing a single __complex. */
5581 return store_expr (exp, target, 0);
5584 /* If the structure is in a register or if the component
5585 is a bit field, we cannot use addressing to access it.
5586 Use bit-field techniques or SUBREG to store in it. */
5588 if (mode == VOIDmode
5589 || (mode != BLKmode && ! direct_store[(int) mode]
5590 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5591 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5592 || GET_CODE (target) == REG
5593 || GET_CODE (target) == SUBREG
5594 /* If the field isn't aligned enough to store as an ordinary memref,
5595 store it as a bit field. */
5597 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5598 || bitpos % GET_MODE_ALIGNMENT (mode))
5599 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5600 || (bitpos % BITS_PER_UNIT != 0)))
5601 /* If the RHS and field are a constant size and the size of the
5602 RHS isn't the same size as the bitfield, we must use bitfield
5605 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5606 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5608 rtx temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5610 /* If BITSIZE is narrower than the size of the type of EXP
5611 we will be narrowing TEMP. Normally, what's wanted are the
5612 low-order bits. However, if EXP's type is a record and this is
5613 big-endian machine, we want the upper BITSIZE bits. */
5614 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5615 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5616 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5617 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5618 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5622 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5624 if (mode != VOIDmode && mode != BLKmode
5625 && mode != TYPE_MODE (TREE_TYPE (exp)))
5626 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5628 /* If the modes of TARGET and TEMP are both BLKmode, both
5629 must be in memory and BITPOS must be aligned on a byte
5630 boundary. If so, we simply do a block copy. */
5631 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5633 if (GET_CODE (target) != MEM || GET_CODE (temp) != MEM
5634 || bitpos % BITS_PER_UNIT != 0)
5637 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5638 emit_block_move (target, temp,
5639 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5643 return value_mode == VOIDmode ? const0_rtx : target;
5646 /* Store the value in the bitfield. */
5647 store_bit_field (target, bitsize, bitpos, mode, temp,
5648 int_size_in_bytes (type));
5650 if (value_mode != VOIDmode)
5652 /* The caller wants an rtx for the value.
5653 If possible, avoid refetching from the bitfield itself. */
5655 && ! (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)))
5658 enum machine_mode tmode;
5660 tmode = GET_MODE (temp);
5661 if (tmode == VOIDmode)
5665 return expand_and (tmode, temp,
5666 gen_int_mode (width_mask, tmode),
5669 count = build_int_2 (GET_MODE_BITSIZE (tmode) - bitsize, 0);
5670 temp = expand_shift (LSHIFT_EXPR, tmode, temp, count, 0, 0);
5671 return expand_shift (RSHIFT_EXPR, tmode, temp, count, 0, 0);
5674 return extract_bit_field (target, bitsize, bitpos, unsignedp,
5675 NULL_RTX, value_mode, VOIDmode,
5676 int_size_in_bytes (type));
5682 rtx addr = XEXP (target, 0);
5683 rtx to_rtx = target;
5685 /* If a value is wanted, it must be the lhs;
5686 so make the address stable for multiple use. */
5688 if (value_mode != VOIDmode && GET_CODE (addr) != REG
5689 && ! CONSTANT_ADDRESS_P (addr)
5690 /* A frame-pointer reference is already stable. */
5691 && ! (GET_CODE (addr) == PLUS
5692 && GET_CODE (XEXP (addr, 1)) == CONST_INT
5693 && (XEXP (addr, 0) == virtual_incoming_args_rtx
5694 || XEXP (addr, 0) == virtual_stack_vars_rtx)))
5695 to_rtx = replace_equiv_address (to_rtx, copy_to_reg (addr));
5697 /* Now build a reference to just the desired component. */
5699 to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5701 if (to_rtx == target)
5702 to_rtx = copy_rtx (to_rtx);
5704 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5705 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5706 set_mem_alias_set (to_rtx, alias_set);
5708 return store_expr (exp, to_rtx, value_mode != VOIDmode);
5712 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5713 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5714 codes and find the ultimate containing object, which we return.
5716 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5717 bit position, and *PUNSIGNEDP to the signedness of the field.
5718 If the position of the field is variable, we store a tree
5719 giving the variable offset (in units) in *POFFSET.
5720 This offset is in addition to the bit position.
5721 If the position is not variable, we store 0 in *POFFSET.
5723 If any of the extraction expressions is volatile,
5724 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5726 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5727 is a mode that can be used to access the field. In that case, *PBITSIZE
5730 If the field describes a variable-sized object, *PMODE is set to
5731 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5732 this case, but the address of the object can be found. */
5735 get_inner_reference (exp, pbitsize, pbitpos, poffset, pmode,
5736 punsignedp, pvolatilep)
5738 HOST_WIDE_INT *pbitsize;
5739 HOST_WIDE_INT *pbitpos;
5741 enum machine_mode *pmode;
5746 enum machine_mode mode = VOIDmode;
5747 tree offset = size_zero_node;
5748 tree bit_offset = bitsize_zero_node;
5749 tree placeholder_ptr = 0;
5752 /* First get the mode, signedness, and size. We do this from just the
5753 outermost expression. */
5754 if (TREE_CODE (exp) == COMPONENT_REF)
5756 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5757 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5758 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5760 *punsignedp = TREE_UNSIGNED (TREE_OPERAND (exp, 1));
5762 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5764 size_tree = TREE_OPERAND (exp, 1);
5765 *punsignedp = TREE_UNSIGNED (exp);
5769 mode = TYPE_MODE (TREE_TYPE (exp));
5770 *punsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
5772 if (mode == BLKmode)
5773 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5775 *pbitsize = GET_MODE_BITSIZE (mode);
5780 if (! host_integerp (size_tree, 1))
5781 mode = BLKmode, *pbitsize = -1;
5783 *pbitsize = tree_low_cst (size_tree, 1);
5786 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5787 and find the ultimate containing object. */
5790 if (TREE_CODE (exp) == BIT_FIELD_REF)
5791 bit_offset = size_binop (PLUS_EXPR, bit_offset, TREE_OPERAND (exp, 2));
5792 else if (TREE_CODE (exp) == COMPONENT_REF)
5794 tree field = TREE_OPERAND (exp, 1);
5795 tree this_offset = DECL_FIELD_OFFSET (field);
5797 /* If this field hasn't been filled in yet, don't go
5798 past it. This should only happen when folding expressions
5799 made during type construction. */
5800 if (this_offset == 0)
5802 else if (CONTAINS_PLACEHOLDER_P (this_offset))
5803 this_offset = build (WITH_RECORD_EXPR, sizetype, this_offset, exp);
5805 offset = size_binop (PLUS_EXPR, offset, this_offset);
5806 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5807 DECL_FIELD_BIT_OFFSET (field));
5809 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5812 else if (TREE_CODE (exp) == ARRAY_REF
5813 || TREE_CODE (exp) == ARRAY_RANGE_REF)
5815 tree index = TREE_OPERAND (exp, 1);
5816 tree array = TREE_OPERAND (exp, 0);
5817 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
5818 tree low_bound = (domain ? TYPE_MIN_VALUE (domain) : 0);
5819 tree unit_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (array)));
5821 /* We assume all arrays have sizes that are a multiple of a byte.
5822 First subtract the lower bound, if any, in the type of the
5823 index, then convert to sizetype and multiply by the size of the
5825 if (low_bound != 0 && ! integer_zerop (low_bound))
5826 index = fold (build (MINUS_EXPR, TREE_TYPE (index),
5829 /* If the index has a self-referential type, pass it to a
5830 WITH_RECORD_EXPR; if the component size is, pass our
5831 component to one. */
5832 if (CONTAINS_PLACEHOLDER_P (index))
5833 index = build (WITH_RECORD_EXPR, TREE_TYPE (index), index, exp);
5834 if (CONTAINS_PLACEHOLDER_P (unit_size))
5835 unit_size = build (WITH_RECORD_EXPR, sizetype, unit_size, array);
5837 offset = size_binop (PLUS_EXPR, offset,
5838 size_binop (MULT_EXPR,
5839 convert (sizetype, index),
5843 else if (TREE_CODE (exp) == PLACEHOLDER_EXPR)
5845 tree new = find_placeholder (exp, &placeholder_ptr);
5847 /* If we couldn't find the replacement, return the PLACEHOLDER_EXPR.
5848 We might have been called from tree optimization where we
5849 haven't set up an object yet. */
5858 /* We can go inside most conversions: all NON_VALUE_EXPRs, all normal
5859 conversions that don't change the mode, and all view conversions
5860 except those that need to "step up" the alignment. */
5861 else if (TREE_CODE (exp) != NON_LVALUE_EXPR
5862 && ! (TREE_CODE (exp) == VIEW_CONVERT_EXPR
5863 && ! ((TYPE_ALIGN (TREE_TYPE (exp))
5864 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
5866 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
5867 < BIGGEST_ALIGNMENT)
5868 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
5869 || TYPE_ALIGN_OK (TREE_TYPE
5870 (TREE_OPERAND (exp, 0))))))
5871 && ! ((TREE_CODE (exp) == NOP_EXPR
5872 || TREE_CODE (exp) == CONVERT_EXPR)
5873 && (TYPE_MODE (TREE_TYPE (exp))
5874 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
5877 /* If any reference in the chain is volatile, the effect is volatile. */
5878 if (TREE_THIS_VOLATILE (exp))
5881 exp = TREE_OPERAND (exp, 0);
5884 /* If OFFSET is constant, see if we can return the whole thing as a
5885 constant bit position. Otherwise, split it up. */
5886 if (host_integerp (offset, 0)
5887 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5889 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5890 && host_integerp (tem, 0))
5891 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5893 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5899 /* Return 1 if T is an expression that get_inner_reference handles. */
5902 handled_component_p (t)
5905 switch (TREE_CODE (t))
5910 case ARRAY_RANGE_REF:
5911 case NON_LVALUE_EXPR:
5912 case VIEW_CONVERT_EXPR:
5917 return (TYPE_MODE (TREE_TYPE (t))
5918 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (t, 0))));
5925 /* Given an rtx VALUE that may contain additions and multiplications, return
5926 an equivalent value that just refers to a register, memory, or constant.
5927 This is done by generating instructions to perform the arithmetic and
5928 returning a pseudo-register containing the value.
5930 The returned value may be a REG, SUBREG, MEM or constant. */
5933 force_operand (value, target)
5937 /* Use subtarget as the target for operand 0 of a binary operation. */
5938 rtx subtarget = get_subtarget (target);
5939 enum rtx_code code = GET_CODE (value);
5941 /* Check for a PIC address load. */
5942 if ((code == PLUS || code == MINUS)
5943 && XEXP (value, 0) == pic_offset_table_rtx
5944 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5945 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5946 || GET_CODE (XEXP (value, 1)) == CONST))
5949 subtarget = gen_reg_rtx (GET_MODE (value));
5950 emit_move_insn (subtarget, value);
5954 if (code == ZERO_EXTEND || code == SIGN_EXTEND)
5957 target = gen_reg_rtx (GET_MODE (value));
5958 convert_move (target, force_operand (XEXP (value, 0), NULL),
5959 code == ZERO_EXTEND);
5963 if (GET_RTX_CLASS (code) == '2' || GET_RTX_CLASS (code) == 'c')
5965 op2 = XEXP (value, 1);
5966 if (!CONSTANT_P (op2) && !(GET_CODE (op2) == REG && op2 != subtarget))
5968 if (code == MINUS && GET_CODE (op2) == CONST_INT)
5971 op2 = negate_rtx (GET_MODE (value), op2);
5974 /* Check for an addition with OP2 a constant integer and our first
5975 operand a PLUS of a virtual register and something else. In that
5976 case, we want to emit the sum of the virtual register and the
5977 constant first and then add the other value. This allows virtual
5978 register instantiation to simply modify the constant rather than
5979 creating another one around this addition. */
5980 if (code == PLUS && GET_CODE (op2) == CONST_INT
5981 && GET_CODE (XEXP (value, 0)) == PLUS
5982 && GET_CODE (XEXP (XEXP (value, 0), 0)) == REG
5983 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5984 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5986 rtx temp = expand_simple_binop (GET_MODE (value), code,
5987 XEXP (XEXP (value, 0), 0), op2,
5988 subtarget, 0, OPTAB_LIB_WIDEN);
5989 return expand_simple_binop (GET_MODE (value), code, temp,
5990 force_operand (XEXP (XEXP (value,
5992 target, 0, OPTAB_LIB_WIDEN);
5995 op1 = force_operand (XEXP (value, 0), subtarget);
5996 op2 = force_operand (op2, NULL_RTX);
6000 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6002 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6003 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6004 target, 1, OPTAB_LIB_WIDEN);
6006 return expand_divmod (0,
6007 FLOAT_MODE_P (GET_MODE (value))
6008 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6009 GET_MODE (value), op1, op2, target, 0);
6012 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6016 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6020 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6024 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6025 target, 0, OPTAB_LIB_WIDEN);
6028 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6029 target, 1, OPTAB_LIB_WIDEN);
6032 if (GET_RTX_CLASS (code) == '1')
6034 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6035 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6038 #ifdef INSN_SCHEDULING
6039 /* On machines that have insn scheduling, we want all memory reference to be
6040 explicit, so we need to deal with such paradoxical SUBREGs. */
6041 if (GET_CODE (value) == SUBREG && GET_CODE (SUBREG_REG (value)) == MEM
6042 && (GET_MODE_SIZE (GET_MODE (value))
6043 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6045 = simplify_gen_subreg (GET_MODE (value),
6046 force_reg (GET_MODE (SUBREG_REG (value)),
6047 force_operand (SUBREG_REG (value),
6049 GET_MODE (SUBREG_REG (value)),
6050 SUBREG_BYTE (value));
6056 /* Subroutine of expand_expr: return nonzero iff there is no way that
6057 EXP can reference X, which is being modified. TOP_P is nonzero if this
6058 call is going to be used to determine whether we need a temporary
6059 for EXP, as opposed to a recursive call to this function.
6061 It is always safe for this routine to return zero since it merely
6062 searches for optimization opportunities. */
6065 safe_from_p (x, exp, top_p)
6072 static tree save_expr_list;
6075 /* If EXP has varying size, we MUST use a target since we currently
6076 have no way of allocating temporaries of variable size
6077 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6078 So we assume here that something at a higher level has prevented a
6079 clash. This is somewhat bogus, but the best we can do. Only
6080 do this when X is BLKmode and when we are at the top level. */
6081 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6082 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6083 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6084 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6085 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6087 && GET_MODE (x) == BLKmode)
6088 /* If X is in the outgoing argument area, it is always safe. */
6089 || (GET_CODE (x) == MEM
6090 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6091 || (GET_CODE (XEXP (x, 0)) == PLUS
6092 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6095 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6096 find the underlying pseudo. */
6097 if (GET_CODE (x) == SUBREG)
6100 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6104 /* A SAVE_EXPR might appear many times in the expression passed to the
6105 top-level safe_from_p call, and if it has a complex subexpression,
6106 examining it multiple times could result in a combinatorial explosion.
6107 E.g. on an Alpha running at least 200MHz, a Fortran test case compiled
6108 with optimization took about 28 minutes to compile -- even though it was
6109 only a few lines long. So we mark each SAVE_EXPR we see with TREE_PRIVATE
6110 and turn that off when we are done. We keep a list of the SAVE_EXPRs
6111 we have processed. Note that the only test of top_p was above. */
6120 rtn = safe_from_p (x, exp, 0);
6122 for (t = save_expr_list; t != 0; t = TREE_CHAIN (t))
6123 TREE_PRIVATE (TREE_PURPOSE (t)) = 0;
6128 /* Now look at our tree code and possibly recurse. */
6129 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6132 exp_rtl = DECL_RTL_IF_SET (exp);
6139 if (TREE_CODE (exp) == TREE_LIST)
6143 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6145 exp = TREE_CHAIN (exp);
6148 if (TREE_CODE (exp) != TREE_LIST)
6149 return safe_from_p (x, exp, 0);
6152 else if (TREE_CODE (exp) == ERROR_MARK)
6153 return 1; /* An already-visited SAVE_EXPR? */
6159 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6164 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6168 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6169 the expression. If it is set, we conflict iff we are that rtx or
6170 both are in memory. Otherwise, we check all operands of the
6171 expression recursively. */
6173 switch (TREE_CODE (exp))
6176 /* If the operand is static or we are static, we can't conflict.
6177 Likewise if we don't conflict with the operand at all. */
6178 if (staticp (TREE_OPERAND (exp, 0))
6179 || TREE_STATIC (exp)
6180 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6183 /* Otherwise, the only way this can conflict is if we are taking
6184 the address of a DECL a that address if part of X, which is
6186 exp = TREE_OPERAND (exp, 0);
6189 if (!DECL_RTL_SET_P (exp)
6190 || GET_CODE (DECL_RTL (exp)) != MEM)
6193 exp_rtl = XEXP (DECL_RTL (exp), 0);
6198 if (GET_CODE (x) == MEM
6199 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6200 get_alias_set (exp)))
6205 /* Assume that the call will clobber all hard registers and
6207 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
6208 || GET_CODE (x) == MEM)
6213 /* If a sequence exists, we would have to scan every instruction
6214 in the sequence to see if it was safe. This is probably not
6216 if (RTL_EXPR_SEQUENCE (exp))
6219 exp_rtl = RTL_EXPR_RTL (exp);
6222 case WITH_CLEANUP_EXPR:
6223 exp_rtl = WITH_CLEANUP_EXPR_RTL (exp);
6226 case CLEANUP_POINT_EXPR:
6227 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6230 exp_rtl = SAVE_EXPR_RTL (exp);
6234 /* If we've already scanned this, don't do it again. Otherwise,
6235 show we've scanned it and record for clearing the flag if we're
6237 if (TREE_PRIVATE (exp))
6240 TREE_PRIVATE (exp) = 1;
6241 if (! safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6243 TREE_PRIVATE (exp) = 0;
6247 save_expr_list = tree_cons (exp, NULL_TREE, save_expr_list);
6251 /* The only operand we look at is operand 1. The rest aren't
6252 part of the expression. */
6253 return safe_from_p (x, TREE_OPERAND (exp, 1), 0);
6255 case METHOD_CALL_EXPR:
6256 /* This takes an rtx argument, but shouldn't appear here. */
6263 /* If we have an rtx, we do not need to scan our operands. */
6267 nops = first_rtl_op (TREE_CODE (exp));
6268 for (i = 0; i < nops; i++)
6269 if (TREE_OPERAND (exp, i) != 0
6270 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6273 /* If this is a language-specific tree code, it may require
6274 special handling. */
6275 if ((unsigned int) TREE_CODE (exp)
6276 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
6277 && !(*lang_hooks.safe_from_p) (x, exp))
6281 /* If we have an rtl, find any enclosed object. Then see if we conflict
6285 if (GET_CODE (exp_rtl) == SUBREG)
6287 exp_rtl = SUBREG_REG (exp_rtl);
6288 if (GET_CODE (exp_rtl) == REG
6289 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6293 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6294 are memory and they conflict. */
6295 return ! (rtx_equal_p (x, exp_rtl)
6296 || (GET_CODE (x) == MEM && GET_CODE (exp_rtl) == MEM
6297 && true_dependence (exp_rtl, VOIDmode, x,
6298 rtx_addr_varies_p)));
6301 /* If we reach here, it is safe. */
6305 /* Subroutine of expand_expr: return rtx if EXP is a
6306 variable or parameter; else return 0. */
6313 switch (TREE_CODE (exp))
6317 return DECL_RTL (exp);
6323 #ifdef MAX_INTEGER_COMPUTATION_MODE
6326 check_max_integer_computation_mode (exp)
6329 enum tree_code code;
6330 enum machine_mode mode;
6332 /* Strip any NOPs that don't change the mode. */
6334 code = TREE_CODE (exp);
6336 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
6337 if (code == NOP_EXPR
6338 && TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
6341 /* First check the type of the overall operation. We need only look at
6342 unary, binary and relational operations. */
6343 if (TREE_CODE_CLASS (code) == '1'
6344 || TREE_CODE_CLASS (code) == '2'
6345 || TREE_CODE_CLASS (code) == '<')
6347 mode = TYPE_MODE (TREE_TYPE (exp));
6348 if (GET_MODE_CLASS (mode) == MODE_INT
6349 && mode > MAX_INTEGER_COMPUTATION_MODE)
6350 internal_error ("unsupported wide integer operation");
6353 /* Check operand of a unary op. */
6354 if (TREE_CODE_CLASS (code) == '1')
6356 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6357 if (GET_MODE_CLASS (mode) == MODE_INT
6358 && mode > MAX_INTEGER_COMPUTATION_MODE)
6359 internal_error ("unsupported wide integer operation");
6362 /* Check operands of a binary/comparison op. */
6363 if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<')
6365 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6366 if (GET_MODE_CLASS (mode) == MODE_INT
6367 && mode > MAX_INTEGER_COMPUTATION_MODE)
6368 internal_error ("unsupported wide integer operation");
6370 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1)));
6371 if (GET_MODE_CLASS (mode) == MODE_INT
6372 && mode > MAX_INTEGER_COMPUTATION_MODE)
6373 internal_error ("unsupported wide integer operation");
6378 /* Return the highest power of two that EXP is known to be a multiple of.
6379 This is used in updating alignment of MEMs in array references. */
6381 static unsigned HOST_WIDE_INT
6382 highest_pow2_factor (exp)
6385 unsigned HOST_WIDE_INT c0, c1;
6387 switch (TREE_CODE (exp))
6390 /* We can find the lowest bit that's a one. If the low
6391 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6392 We need to handle this case since we can find it in a COND_EXPR,
6393 a MIN_EXPR, or a MAX_EXPR. If the constant overlows, we have an
6394 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6396 if (TREE_CONSTANT_OVERFLOW (exp))
6397 return BIGGEST_ALIGNMENT;
6400 /* Note: tree_low_cst is intentionally not used here,
6401 we don't care about the upper bits. */
6402 c0 = TREE_INT_CST_LOW (exp);
6404 return c0 ? c0 : BIGGEST_ALIGNMENT;
6408 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6409 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6410 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6411 return MIN (c0, c1);
6414 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6415 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6418 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6420 if (integer_pow2p (TREE_OPERAND (exp, 1))
6421 && host_integerp (TREE_OPERAND (exp, 1), 1))
6423 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6424 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6425 return MAX (1, c0 / c1);
6429 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
6430 case SAVE_EXPR: case WITH_RECORD_EXPR:
6431 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6434 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6437 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6438 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6439 return MIN (c0, c1);
6448 /* Similar, except that it is known that the expression must be a multiple
6449 of the alignment of TYPE. */
6451 static unsigned HOST_WIDE_INT
6452 highest_pow2_factor_for_type (type, exp)
6456 unsigned HOST_WIDE_INT type_align, factor;
6458 factor = highest_pow2_factor (exp);
6459 type_align = TYPE_ALIGN (type) / BITS_PER_UNIT;
6460 return MAX (factor, type_align);
6463 /* Return an object on the placeholder list that matches EXP, a
6464 PLACEHOLDER_EXPR. An object "matches" if it is of the type of the
6465 PLACEHOLDER_EXPR or a pointer type to it. For further information, see
6466 tree.def. If no such object is found, return 0. If PLIST is nonzero, it
6467 is a location which initially points to a starting location in the
6468 placeholder list (zero means start of the list) and where a pointer into
6469 the placeholder list at which the object is found is placed. */
6472 find_placeholder (exp, plist)
6476 tree type = TREE_TYPE (exp);
6477 tree placeholder_expr;
6479 for (placeholder_expr
6480 = plist && *plist ? TREE_CHAIN (*plist) : placeholder_list;
6481 placeholder_expr != 0;
6482 placeholder_expr = TREE_CHAIN (placeholder_expr))
6484 tree need_type = TYPE_MAIN_VARIANT (type);
6487 /* Find the outermost reference that is of the type we want. If none,
6488 see if any object has a type that is a pointer to the type we
6490 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
6491 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
6492 || TREE_CODE (elt) == COND_EXPR)
6493 ? TREE_OPERAND (elt, 1)
6494 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6495 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6496 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6497 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6498 ? TREE_OPERAND (elt, 0) : 0))
6499 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
6502 *plist = placeholder_expr;
6506 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
6508 = ((TREE_CODE (elt) == COMPOUND_EXPR
6509 || TREE_CODE (elt) == COND_EXPR)
6510 ? TREE_OPERAND (elt, 1)
6511 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6512 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6513 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6514 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6515 ? TREE_OPERAND (elt, 0) : 0))
6516 if (POINTER_TYPE_P (TREE_TYPE (elt))
6517 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
6521 *plist = placeholder_expr;
6522 return build1 (INDIRECT_REF, need_type, elt);
6529 /* expand_expr: generate code for computing expression EXP.
6530 An rtx for the computed value is returned. The value is never null.
6531 In the case of a void EXP, const0_rtx is returned.
6533 The value may be stored in TARGET if TARGET is nonzero.
6534 TARGET is just a suggestion; callers must assume that
6535 the rtx returned may not be the same as TARGET.
6537 If TARGET is CONST0_RTX, it means that the value will be ignored.
6539 If TMODE is not VOIDmode, it suggests generating the
6540 result in mode TMODE. But this is done only when convenient.
6541 Otherwise, TMODE is ignored and the value generated in its natural mode.
6542 TMODE is just a suggestion; callers must assume that
6543 the rtx returned may not have mode TMODE.
6545 Note that TARGET may have neither TMODE nor MODE. In that case, it
6546 probably will not be used.
6548 If MODIFIER is EXPAND_SUM then when EXP is an addition
6549 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6550 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6551 products as above, or REG or MEM, or constant.
6552 Ordinarily in such cases we would output mul or add instructions
6553 and then return a pseudo reg containing the sum.
6555 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6556 it also marks a label as absolutely required (it can't be dead).
6557 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6558 This is used for outputting expressions used in initializers.
6560 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6561 with a constant address even if that address is not normally legitimate.
6562 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6564 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6565 a call parameter. Such targets require special care as we haven't yet
6566 marked TARGET so that it's safe from being trashed by libcalls. We
6567 don't want to use TARGET for anything but the final result;
6568 Intermediate values must go elsewhere. Additionally, calls to
6569 emit_block_move will be flagged with BLOCK_OP_CALL_PARM. */
6572 expand_expr (exp, target, tmode, modifier)
6575 enum machine_mode tmode;
6576 enum expand_modifier modifier;
6579 tree type = TREE_TYPE (exp);
6580 int unsignedp = TREE_UNSIGNED (type);
6581 enum machine_mode mode;
6582 enum tree_code code = TREE_CODE (exp);
6584 rtx subtarget, original_target;
6588 /* Handle ERROR_MARK before anybody tries to access its type. */
6589 if (TREE_CODE (exp) == ERROR_MARK || TREE_CODE (type) == ERROR_MARK)
6591 op0 = CONST0_RTX (tmode);
6597 mode = TYPE_MODE (type);
6598 /* Use subtarget as the target for operand 0 of a binary operation. */
6599 subtarget = get_subtarget (target);
6600 original_target = target;
6601 ignore = (target == const0_rtx
6602 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6603 || code == CONVERT_EXPR || code == REFERENCE_EXPR
6604 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
6605 && TREE_CODE (type) == VOID_TYPE));
6607 /* If we are going to ignore this result, we need only do something
6608 if there is a side-effect somewhere in the expression. If there
6609 is, short-circuit the most common cases here. Note that we must
6610 not call expand_expr with anything but const0_rtx in case this
6611 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6615 if (! TREE_SIDE_EFFECTS (exp))
6618 /* Ensure we reference a volatile object even if value is ignored, but
6619 don't do this if all we are doing is taking its address. */
6620 if (TREE_THIS_VOLATILE (exp)
6621 && TREE_CODE (exp) != FUNCTION_DECL
6622 && mode != VOIDmode && mode != BLKmode
6623 && modifier != EXPAND_CONST_ADDRESS)
6625 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6626 if (GET_CODE (temp) == MEM)
6627 temp = copy_to_reg (temp);
6631 if (TREE_CODE_CLASS (code) == '1' || code == COMPONENT_REF
6632 || code == INDIRECT_REF || code == BUFFER_REF)
6633 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6636 else if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<'
6637 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6639 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6640 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6643 else if ((code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6644 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
6645 /* If the second operand has no side effects, just evaluate
6647 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6649 else if (code == BIT_FIELD_REF)
6651 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6652 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6653 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6660 #ifdef MAX_INTEGER_COMPUTATION_MODE
6661 /* Only check stuff here if the mode we want is different from the mode
6662 of the expression; if it's the same, check_max_integer_computation_mode
6663 will handle it. Do we really need to check this stuff at all? */
6666 && GET_MODE (target) != mode
6667 && TREE_CODE (exp) != INTEGER_CST
6668 && TREE_CODE (exp) != PARM_DECL
6669 && TREE_CODE (exp) != ARRAY_REF
6670 && TREE_CODE (exp) != ARRAY_RANGE_REF
6671 && TREE_CODE (exp) != COMPONENT_REF
6672 && TREE_CODE (exp) != BIT_FIELD_REF
6673 && TREE_CODE (exp) != INDIRECT_REF
6674 && TREE_CODE (exp) != CALL_EXPR
6675 && TREE_CODE (exp) != VAR_DECL
6676 && TREE_CODE (exp) != RTL_EXPR)
6678 enum machine_mode mode = GET_MODE (target);
6680 if (GET_MODE_CLASS (mode) == MODE_INT
6681 && mode > MAX_INTEGER_COMPUTATION_MODE)
6682 internal_error ("unsupported wide integer operation");
6686 && TREE_CODE (exp) != INTEGER_CST
6687 && TREE_CODE (exp) != PARM_DECL
6688 && TREE_CODE (exp) != ARRAY_REF
6689 && TREE_CODE (exp) != ARRAY_RANGE_REF
6690 && TREE_CODE (exp) != COMPONENT_REF
6691 && TREE_CODE (exp) != BIT_FIELD_REF
6692 && TREE_CODE (exp) != INDIRECT_REF
6693 && TREE_CODE (exp) != VAR_DECL
6694 && TREE_CODE (exp) != CALL_EXPR
6695 && TREE_CODE (exp) != RTL_EXPR
6696 && GET_MODE_CLASS (tmode) == MODE_INT
6697 && tmode > MAX_INTEGER_COMPUTATION_MODE)
6698 internal_error ("unsupported wide integer operation");
6700 check_max_integer_computation_mode (exp);
6703 /* If will do cse, generate all results into pseudo registers
6704 since 1) that allows cse to find more things
6705 and 2) otherwise cse could produce an insn the machine
6706 cannot support. An exception is a CONSTRUCTOR into a multi-word
6707 MEM: that's much more likely to be most efficient into the MEM.
6708 Another is a CALL_EXPR which must return in memory. */
6710 if (! cse_not_expected && mode != BLKmode && target
6711 && (GET_CODE (target) != REG || REGNO (target) < FIRST_PSEUDO_REGISTER)
6712 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
6713 && ! (code == CALL_EXPR && aggregate_value_p (exp)))
6720 tree function = decl_function_context (exp);
6721 /* Labels in containing functions, or labels used from initializers,
6723 if (modifier == EXPAND_INITIALIZER
6724 || (function != current_function_decl
6725 && function != inline_function_decl
6727 temp = force_label_rtx (exp);
6729 temp = label_rtx (exp);
6731 temp = gen_rtx_MEM (FUNCTION_MODE, gen_rtx_LABEL_REF (Pmode, temp));
6732 if (function != current_function_decl
6733 && function != inline_function_decl && function != 0)
6734 LABEL_REF_NONLOCAL_P (XEXP (temp, 0)) = 1;
6739 if (!DECL_RTL_SET_P (exp))
6741 error_with_decl (exp, "prior parameter's size depends on `%s'");
6742 return CONST0_RTX (mode);
6745 /* ... fall through ... */
6748 /* If a static var's type was incomplete when the decl was written,
6749 but the type is complete now, lay out the decl now. */
6750 if (DECL_SIZE (exp) == 0
6751 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
6752 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6753 layout_decl (exp, 0);
6755 /* ... fall through ... */
6759 if (DECL_RTL (exp) == 0)
6762 /* Ensure variable marked as used even if it doesn't go through
6763 a parser. If it hasn't be used yet, write out an external
6765 if (! TREE_USED (exp))
6767 assemble_external (exp);
6768 TREE_USED (exp) = 1;
6771 /* Show we haven't gotten RTL for this yet. */
6774 /* Handle variables inherited from containing functions. */
6775 context = decl_function_context (exp);
6777 /* We treat inline_function_decl as an alias for the current function
6778 because that is the inline function whose vars, types, etc.
6779 are being merged into the current function.
6780 See expand_inline_function. */
6782 if (context != 0 && context != current_function_decl
6783 && context != inline_function_decl
6784 /* If var is static, we don't need a static chain to access it. */
6785 && ! (GET_CODE (DECL_RTL (exp)) == MEM
6786 && CONSTANT_P (XEXP (DECL_RTL (exp), 0))))
6790 /* Mark as non-local and addressable. */
6791 DECL_NONLOCAL (exp) = 1;
6792 if (DECL_NO_STATIC_CHAIN (current_function_decl))
6794 (*lang_hooks.mark_addressable) (exp);
6795 if (GET_CODE (DECL_RTL (exp)) != MEM)
6797 addr = XEXP (DECL_RTL (exp), 0);
6798 if (GET_CODE (addr) == MEM)
6800 = replace_equiv_address (addr,
6801 fix_lexical_addr (XEXP (addr, 0), exp));
6803 addr = fix_lexical_addr (addr, exp);
6805 temp = replace_equiv_address (DECL_RTL (exp), addr);
6808 /* This is the case of an array whose size is to be determined
6809 from its initializer, while the initializer is still being parsed.
6812 else if (GET_CODE (DECL_RTL (exp)) == MEM
6813 && GET_CODE (XEXP (DECL_RTL (exp), 0)) == REG)
6814 temp = validize_mem (DECL_RTL (exp));
6816 /* If DECL_RTL is memory, we are in the normal case and either
6817 the address is not valid or it is not a register and -fforce-addr
6818 is specified, get the address into a register. */
6820 else if (GET_CODE (DECL_RTL (exp)) == MEM
6821 && modifier != EXPAND_CONST_ADDRESS
6822 && modifier != EXPAND_SUM
6823 && modifier != EXPAND_INITIALIZER
6824 && (! memory_address_p (DECL_MODE (exp),
6825 XEXP (DECL_RTL (exp), 0))
6827 && GET_CODE (XEXP (DECL_RTL (exp), 0)) != REG)))
6828 temp = replace_equiv_address (DECL_RTL (exp),
6829 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6831 /* If we got something, return it. But first, set the alignment
6832 if the address is a register. */
6835 if (GET_CODE (temp) == MEM && GET_CODE (XEXP (temp, 0)) == REG)
6836 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6841 /* If the mode of DECL_RTL does not match that of the decl, it
6842 must be a promoted value. We return a SUBREG of the wanted mode,
6843 but mark it so that we know that it was already extended. */
6845 if (GET_CODE (DECL_RTL (exp)) == REG
6846 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6848 /* Get the signedness used for this variable. Ensure we get the
6849 same mode we got when the variable was declared. */
6850 if (GET_MODE (DECL_RTL (exp))
6851 != promote_mode (type, DECL_MODE (exp), &unsignedp,
6852 (TREE_CODE (exp) == RESULT_DECL ? 1 : 0)))
6855 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6856 SUBREG_PROMOTED_VAR_P (temp) = 1;
6857 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6861 return DECL_RTL (exp);
6864 temp = immed_double_const (TREE_INT_CST_LOW (exp),
6865 TREE_INT_CST_HIGH (exp), mode);
6867 /* ??? If overflow is set, fold will have done an incomplete job,
6868 which can result in (plus xx (const_int 0)), which can get
6869 simplified by validate_replace_rtx during virtual register
6870 instantiation, which can result in unrecognizable insns.
6871 Avoid this by forcing all overflows into registers. */
6872 if (TREE_CONSTANT_OVERFLOW (exp)
6873 && modifier != EXPAND_INITIALIZER)
6874 temp = force_reg (mode, temp);
6879 return const_vector_from_tree (exp);
6882 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
6885 /* If optimized, generate immediate CONST_DOUBLE
6886 which will be turned into memory by reload if necessary.
6888 We used to force a register so that loop.c could see it. But
6889 this does not allow gen_* patterns to perform optimizations with
6890 the constants. It also produces two insns in cases like "x = 1.0;".
6891 On most machines, floating-point constants are not permitted in
6892 many insns, so we'd end up copying it to a register in any case.
6894 Now, we do the copying in expand_binop, if appropriate. */
6895 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
6896 TYPE_MODE (TREE_TYPE (exp)));
6900 temp = output_constant_def (exp, 1);
6902 /* temp contains a constant address.
6903 On RISC machines where a constant address isn't valid,
6904 make some insns to get that address into a register. */
6905 if (modifier != EXPAND_CONST_ADDRESS
6906 && modifier != EXPAND_INITIALIZER
6907 && modifier != EXPAND_SUM
6908 && (! memory_address_p (mode, XEXP (temp, 0))
6909 || flag_force_addr))
6910 return replace_equiv_address (temp,
6911 copy_rtx (XEXP (temp, 0)));
6914 case EXPR_WITH_FILE_LOCATION:
6917 location_t saved_loc = input_location;
6918 input_filename = EXPR_WFL_FILENAME (exp);
6919 input_line = EXPR_WFL_LINENO (exp);
6920 if (EXPR_WFL_EMIT_LINE_NOTE (exp))
6921 emit_line_note (input_filename, input_line);
6922 /* Possibly avoid switching back and forth here. */
6923 to_return = expand_expr (EXPR_WFL_NODE (exp), target, tmode, modifier);
6924 input_location = saved_loc;
6929 context = decl_function_context (exp);
6931 /* If this SAVE_EXPR was at global context, assume we are an
6932 initialization function and move it into our context. */
6934 SAVE_EXPR_CONTEXT (exp) = current_function_decl;
6936 /* We treat inline_function_decl as an alias for the current function
6937 because that is the inline function whose vars, types, etc.
6938 are being merged into the current function.
6939 See expand_inline_function. */
6940 if (context == current_function_decl || context == inline_function_decl)
6943 /* If this is non-local, handle it. */
6946 /* The following call just exists to abort if the context is
6947 not of a containing function. */
6948 find_function_data (context);
6950 temp = SAVE_EXPR_RTL (exp);
6951 if (temp && GET_CODE (temp) == REG)
6953 put_var_into_stack (exp, /*rescan=*/true);
6954 temp = SAVE_EXPR_RTL (exp);
6956 if (temp == 0 || GET_CODE (temp) != MEM)
6959 replace_equiv_address (temp,
6960 fix_lexical_addr (XEXP (temp, 0), exp));
6962 if (SAVE_EXPR_RTL (exp) == 0)
6964 if (mode == VOIDmode)
6967 temp = assign_temp (build_qualified_type (type,
6969 | TYPE_QUAL_CONST)),
6972 SAVE_EXPR_RTL (exp) = temp;
6973 if (!optimize && GET_CODE (temp) == REG)
6974 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, temp,
6977 /* If the mode of TEMP does not match that of the expression, it
6978 must be a promoted value. We pass store_expr a SUBREG of the
6979 wanted mode but mark it so that we know that it was already
6982 if (GET_CODE (temp) == REG && GET_MODE (temp) != mode)
6984 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
6985 promote_mode (type, mode, &unsignedp, 0);
6986 SUBREG_PROMOTED_VAR_P (temp) = 1;
6987 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6990 if (temp == const0_rtx)
6991 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
6993 store_expr (TREE_OPERAND (exp, 0), temp,
6994 modifier == EXPAND_STACK_PARM ? 2 : 0);
6996 TREE_USED (exp) = 1;
6999 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
7000 must be a promoted value. We return a SUBREG of the wanted mode,
7001 but mark it so that we know that it was already extended. */
7003 if (GET_CODE (SAVE_EXPR_RTL (exp)) == REG
7004 && GET_MODE (SAVE_EXPR_RTL (exp)) != mode)
7006 /* Compute the signedness and make the proper SUBREG. */
7007 promote_mode (type, mode, &unsignedp, 0);
7008 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
7009 SUBREG_PROMOTED_VAR_P (temp) = 1;
7010 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
7014 return SAVE_EXPR_RTL (exp);
7019 temp = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7020 TREE_OPERAND (exp, 0)
7021 = (*lang_hooks.unsave_expr_now) (TREE_OPERAND (exp, 0));
7025 case PLACEHOLDER_EXPR:
7027 tree old_list = placeholder_list;
7028 tree placeholder_expr = 0;
7030 exp = find_placeholder (exp, &placeholder_expr);
7034 placeholder_list = TREE_CHAIN (placeholder_expr);
7035 temp = expand_expr (exp, original_target, tmode, modifier);
7036 placeholder_list = old_list;
7040 case WITH_RECORD_EXPR:
7041 /* Put the object on the placeholder list, expand our first operand,
7042 and pop the list. */
7043 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
7045 target = expand_expr (TREE_OPERAND (exp, 0), original_target, tmode,
7047 placeholder_list = TREE_CHAIN (placeholder_list);
7051 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
7052 expand_goto (TREE_OPERAND (exp, 0));
7054 expand_computed_goto (TREE_OPERAND (exp, 0));
7058 expand_exit_loop_if_false (NULL,
7059 invert_truthvalue (TREE_OPERAND (exp, 0)));
7062 case LABELED_BLOCK_EXPR:
7063 if (LABELED_BLOCK_BODY (exp))
7064 expand_expr_stmt_value (LABELED_BLOCK_BODY (exp), 0, 1);
7065 /* Should perhaps use expand_label, but this is simpler and safer. */
7066 do_pending_stack_adjust ();
7067 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp)));
7070 case EXIT_BLOCK_EXPR:
7071 if (EXIT_BLOCK_RETURN (exp))
7072 sorry ("returned value in block_exit_expr");
7073 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp)));
7078 expand_start_loop (1);
7079 expand_expr_stmt_value (TREE_OPERAND (exp, 0), 0, 1);
7087 tree vars = TREE_OPERAND (exp, 0);
7089 /* Need to open a binding contour here because
7090 if there are any cleanups they must be contained here. */
7091 expand_start_bindings (2);
7093 /* Mark the corresponding BLOCK for output in its proper place. */
7094 if (TREE_OPERAND (exp, 2) != 0
7095 && ! TREE_USED (TREE_OPERAND (exp, 2)))
7096 (*lang_hooks.decls.insert_block) (TREE_OPERAND (exp, 2));
7098 /* If VARS have not yet been expanded, expand them now. */
7101 if (!DECL_RTL_SET_P (vars))
7103 expand_decl_init (vars);
7104 vars = TREE_CHAIN (vars);
7107 temp = expand_expr (TREE_OPERAND (exp, 1), target, tmode, modifier);
7109 expand_end_bindings (TREE_OPERAND (exp, 0), 0, 0);
7115 if (RTL_EXPR_SEQUENCE (exp))
7117 if (RTL_EXPR_SEQUENCE (exp) == const0_rtx)
7119 emit_insn (RTL_EXPR_SEQUENCE (exp));
7120 RTL_EXPR_SEQUENCE (exp) = const0_rtx;
7122 preserve_rtl_expr_result (RTL_EXPR_RTL (exp));
7123 free_temps_for_rtl_expr (exp);
7124 return RTL_EXPR_RTL (exp);
7127 /* If we don't need the result, just ensure we evaluate any
7133 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
7134 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
7139 /* All elts simple constants => refer to a constant in memory. But
7140 if this is a non-BLKmode mode, let it store a field at a time
7141 since that should make a CONST_INT or CONST_DOUBLE when we
7142 fold. Likewise, if we have a target we can use, it is best to
7143 store directly into the target unless the type is large enough
7144 that memcpy will be used. If we are making an initializer and
7145 all operands are constant, put it in memory as well.
7147 FIXME: Avoid trying to fill vector constructors piece-meal.
7148 Output them with output_constant_def below unless we're sure
7149 they're zeros. This should go away when vector initializers
7150 are treated like VECTOR_CST instead of arrays.
7152 else if ((TREE_STATIC (exp)
7153 && ((mode == BLKmode
7154 && ! (target != 0 && safe_from_p (target, exp, 1)))
7155 || TREE_ADDRESSABLE (exp)
7156 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7157 && (! MOVE_BY_PIECES_P
7158 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7160 && ((TREE_CODE (type) == VECTOR_TYPE
7161 && !is_zeros_p (exp))
7162 || ! mostly_zeros_p (exp)))))
7163 || ((modifier == EXPAND_INITIALIZER
7164 || modifier == EXPAND_CONST_ADDRESS)
7165 && TREE_CONSTANT (exp)))
7167 rtx constructor = output_constant_def (exp, 1);
7169 if (modifier != EXPAND_CONST_ADDRESS
7170 && modifier != EXPAND_INITIALIZER
7171 && modifier != EXPAND_SUM)
7172 constructor = validize_mem (constructor);
7178 /* Handle calls that pass values in multiple non-contiguous
7179 locations. The Irix 6 ABI has examples of this. */
7180 if (target == 0 || ! safe_from_p (target, exp, 1)
7181 || GET_CODE (target) == PARALLEL
7182 || modifier == EXPAND_STACK_PARM)
7184 = assign_temp (build_qualified_type (type,
7186 | (TREE_READONLY (exp)
7187 * TYPE_QUAL_CONST))),
7188 0, TREE_ADDRESSABLE (exp), 1);
7190 store_constructor (exp, target, 0, int_expr_size (exp));
7196 tree exp1 = TREE_OPERAND (exp, 0);
7198 tree string = string_constant (exp1, &index);
7200 /* Try to optimize reads from const strings. */
7202 && TREE_CODE (string) == STRING_CST
7203 && TREE_CODE (index) == INTEGER_CST
7204 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0
7205 && GET_MODE_CLASS (mode) == MODE_INT
7206 && GET_MODE_SIZE (mode) == 1
7207 && modifier != EXPAND_WRITE)
7208 return gen_int_mode (TREE_STRING_POINTER (string)
7209 [TREE_INT_CST_LOW (index)], mode);
7211 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
7212 op0 = memory_address (mode, op0);
7213 temp = gen_rtx_MEM (mode, op0);
7214 set_mem_attributes (temp, exp, 0);
7216 /* If we are writing to this object and its type is a record with
7217 readonly fields, we must mark it as readonly so it will
7218 conflict with readonly references to those fields. */
7219 if (modifier == EXPAND_WRITE && readonly_fields_p (type))
7220 RTX_UNCHANGING_P (temp) = 1;
7226 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
7230 tree array = TREE_OPERAND (exp, 0);
7231 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
7232 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
7233 tree index = convert (sizetype, TREE_OPERAND (exp, 1));
7236 /* Optimize the special-case of a zero lower bound.
7238 We convert the low_bound to sizetype to avoid some problems
7239 with constant folding. (E.g. suppose the lower bound is 1,
7240 and its mode is QI. Without the conversion, (ARRAY
7241 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
7242 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
7244 if (! integer_zerop (low_bound))
7245 index = size_diffop (index, convert (sizetype, low_bound));
7247 /* Fold an expression like: "foo"[2].
7248 This is not done in fold so it won't happen inside &.
7249 Don't fold if this is for wide characters since it's too
7250 difficult to do correctly and this is a very rare case. */
7252 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
7253 && TREE_CODE (array) == STRING_CST
7254 && TREE_CODE (index) == INTEGER_CST
7255 && compare_tree_int (index, TREE_STRING_LENGTH (array)) < 0
7256 && GET_MODE_CLASS (mode) == MODE_INT
7257 && GET_MODE_SIZE (mode) == 1)
7258 return gen_int_mode (TREE_STRING_POINTER (array)
7259 [TREE_INT_CST_LOW (index)], mode);
7261 /* If this is a constant index into a constant array,
7262 just get the value from the array. Handle both the cases when
7263 we have an explicit constructor and when our operand is a variable
7264 that was declared const. */
7266 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
7267 && TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array)
7268 && TREE_CODE (index) == INTEGER_CST
7269 && 0 > compare_tree_int (index,
7270 list_length (CONSTRUCTOR_ELTS
7271 (TREE_OPERAND (exp, 0)))))
7275 for (elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)),
7276 i = TREE_INT_CST_LOW (index);
7277 elem != 0 && i != 0; i--, elem = TREE_CHAIN (elem))
7281 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
7285 else if (optimize >= 1
7286 && modifier != EXPAND_CONST_ADDRESS
7287 && modifier != EXPAND_INITIALIZER
7288 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
7289 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
7290 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
7292 if (TREE_CODE (index) == INTEGER_CST)
7294 tree init = DECL_INITIAL (array);
7296 if (TREE_CODE (init) == CONSTRUCTOR)
7300 for (elem = CONSTRUCTOR_ELTS (init);
7302 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
7303 elem = TREE_CHAIN (elem))
7306 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
7307 return expand_expr (fold (TREE_VALUE (elem)), target,
7310 else if (TREE_CODE (init) == STRING_CST
7311 && 0 > compare_tree_int (index,
7312 TREE_STRING_LENGTH (init)))
7314 tree type = TREE_TYPE (TREE_TYPE (init));
7315 enum machine_mode mode = TYPE_MODE (type);
7317 if (GET_MODE_CLASS (mode) == MODE_INT
7318 && GET_MODE_SIZE (mode) == 1)
7319 return gen_int_mode (TREE_STRING_POINTER (init)
7320 [TREE_INT_CST_LOW (index)], mode);
7325 goto normal_inner_ref;
7328 /* If the operand is a CONSTRUCTOR, we can just extract the
7329 appropriate field if it is present. */
7330 if (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR)
7334 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
7335 elt = TREE_CHAIN (elt))
7336 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
7337 /* We can normally use the value of the field in the
7338 CONSTRUCTOR. However, if this is a bitfield in
7339 an integral mode that we can fit in a HOST_WIDE_INT,
7340 we must mask only the number of bits in the bitfield,
7341 since this is done implicitly by the constructor. If
7342 the bitfield does not meet either of those conditions,
7343 we can't do this optimization. */
7344 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
7345 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
7347 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
7348 <= HOST_BITS_PER_WIDE_INT))))
7350 if (DECL_BIT_FIELD (TREE_PURPOSE (elt))
7351 && modifier == EXPAND_STACK_PARM)
7353 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
7354 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
7356 HOST_WIDE_INT bitsize
7357 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
7358 enum machine_mode imode
7359 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
7361 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
7363 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
7364 op0 = expand_and (imode, op0, op1, target);
7369 = build_int_2 (GET_MODE_BITSIZE (imode) - bitsize,
7372 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
7374 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
7382 goto normal_inner_ref;
7385 case ARRAY_RANGE_REF:
7388 enum machine_mode mode1;
7389 HOST_WIDE_INT bitsize, bitpos;
7392 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7393 &mode1, &unsignedp, &volatilep);
7396 /* If we got back the original object, something is wrong. Perhaps
7397 we are evaluating an expression too early. In any event, don't
7398 infinitely recurse. */
7402 /* If TEM's type is a union of variable size, pass TARGET to the inner
7403 computation, since it will need a temporary and TARGET is known
7404 to have to do. This occurs in unchecked conversion in Ada. */
7408 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
7409 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
7411 && modifier != EXPAND_STACK_PARM
7412 ? target : NULL_RTX),
7414 (modifier == EXPAND_INITIALIZER
7415 || modifier == EXPAND_CONST_ADDRESS
7416 || modifier == EXPAND_STACK_PARM)
7417 ? modifier : EXPAND_NORMAL);
7419 /* If this is a constant, put it into a register if it is a
7420 legitimate constant and OFFSET is 0 and memory if it isn't. */
7421 if (CONSTANT_P (op0))
7423 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
7424 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
7426 op0 = force_reg (mode, op0);
7428 op0 = validize_mem (force_const_mem (mode, op0));
7433 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
7436 /* If this object is in a register, put it into memory.
7437 This case can't occur in C, but can in Ada if we have
7438 unchecked conversion of an expression from a scalar type to
7439 an array or record type. */
7440 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
7441 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
7443 /* If the operand is a SAVE_EXPR, we can deal with this by
7444 forcing the SAVE_EXPR into memory. */
7445 if (TREE_CODE (TREE_OPERAND (exp, 0)) == SAVE_EXPR)
7447 put_var_into_stack (TREE_OPERAND (exp, 0),
7449 op0 = SAVE_EXPR_RTL (TREE_OPERAND (exp, 0));
7454 = build_qualified_type (TREE_TYPE (tem),
7455 (TYPE_QUALS (TREE_TYPE (tem))
7456 | TYPE_QUAL_CONST));
7457 rtx memloc = assign_temp (nt, 1, 1, 1);
7459 emit_move_insn (memloc, op0);
7464 if (GET_CODE (op0) != MEM)
7467 #ifdef POINTERS_EXTEND_UNSIGNED
7468 if (GET_MODE (offset_rtx) != Pmode)
7469 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
7471 if (GET_MODE (offset_rtx) != ptr_mode)
7472 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
7475 /* A constant address in OP0 can have VOIDmode, we must not try
7476 to call force_reg for that case. Avoid that case. */
7477 if (GET_CODE (op0) == MEM
7478 && GET_MODE (op0) == BLKmode
7479 && GET_MODE (XEXP (op0, 0)) != VOIDmode
7481 && (bitpos % bitsize) == 0
7482 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
7483 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
7485 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7489 op0 = offset_address (op0, offset_rtx,
7490 highest_pow2_factor (offset));
7493 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7494 record its alignment as BIGGEST_ALIGNMENT. */
7495 if (GET_CODE (op0) == MEM && bitpos == 0 && offset != 0
7496 && is_aligning_offset (offset, tem))
7497 set_mem_align (op0, BIGGEST_ALIGNMENT);
7499 /* Don't forget about volatility even if this is a bitfield. */
7500 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
7502 if (op0 == orig_op0)
7503 op0 = copy_rtx (op0);
7505 MEM_VOLATILE_P (op0) = 1;
7508 /* The following code doesn't handle CONCAT.
7509 Assume only bitpos == 0 can be used for CONCAT, due to
7510 one element arrays having the same mode as its element. */
7511 if (GET_CODE (op0) == CONCAT)
7513 if (bitpos != 0 || bitsize != GET_MODE_BITSIZE (GET_MODE (op0)))
7518 /* In cases where an aligned union has an unaligned object
7519 as a field, we might be extracting a BLKmode value from
7520 an integer-mode (e.g., SImode) object. Handle this case
7521 by doing the extract into an object as wide as the field
7522 (which we know to be the width of a basic mode), then
7523 storing into memory, and changing the mode to BLKmode. */
7524 if (mode1 == VOIDmode
7525 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
7526 || (mode1 != BLKmode && ! direct_load[(int) mode1]
7527 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7528 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
7529 && modifier != EXPAND_CONST_ADDRESS
7530 && modifier != EXPAND_INITIALIZER)
7531 /* If the field isn't aligned enough to fetch as a memref,
7532 fetch it as a bit field. */
7533 || (mode1 != BLKmode
7534 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
7535 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0))
7536 && SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0)))
7537 || (bitpos % BITS_PER_UNIT != 0)))
7538 /* If the type and the field are a constant size and the
7539 size of the type isn't the same size as the bitfield,
7540 we must use bitfield operations. */
7542 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (exp)))
7544 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7547 enum machine_mode ext_mode = mode;
7549 if (ext_mode == BLKmode
7550 && ! (target != 0 && GET_CODE (op0) == MEM
7551 && GET_CODE (target) == MEM
7552 && bitpos % BITS_PER_UNIT == 0))
7553 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7555 if (ext_mode == BLKmode)
7557 /* In this case, BITPOS must start at a byte boundary and
7558 TARGET, if specified, must be a MEM. */
7559 if (GET_CODE (op0) != MEM
7560 || (target != 0 && GET_CODE (target) != MEM)
7561 || bitpos % BITS_PER_UNIT != 0)
7564 op0 = adjust_address (op0, VOIDmode, bitpos / BITS_PER_UNIT);
7566 target = assign_temp (type, 0, 1, 1);
7568 emit_block_move (target, op0,
7569 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7571 (modifier == EXPAND_STACK_PARM
7572 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7577 op0 = validize_mem (op0);
7579 if (GET_CODE (op0) == MEM && GET_CODE (XEXP (op0, 0)) == REG)
7580 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7582 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
7583 (modifier == EXPAND_STACK_PARM
7584 ? NULL_RTX : target),
7586 int_size_in_bytes (TREE_TYPE (tem)));
7588 /* If the result is a record type and BITSIZE is narrower than
7589 the mode of OP0, an integral mode, and this is a big endian
7590 machine, we must put the field into the high-order bits. */
7591 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7592 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7593 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
7594 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7595 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7599 if (mode == BLKmode)
7601 rtx new = assign_temp (build_qualified_type
7602 ((*lang_hooks.types.type_for_mode)
7604 TYPE_QUAL_CONST), 0, 1, 1);
7606 emit_move_insn (new, op0);
7607 op0 = copy_rtx (new);
7608 PUT_MODE (op0, BLKmode);
7609 set_mem_attributes (op0, exp, 1);
7615 /* If the result is BLKmode, use that to access the object
7617 if (mode == BLKmode)
7620 /* Get a reference to just this component. */
7621 if (modifier == EXPAND_CONST_ADDRESS
7622 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7623 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
7625 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7627 if (op0 == orig_op0)
7628 op0 = copy_rtx (op0);
7630 set_mem_attributes (op0, exp, 0);
7631 if (GET_CODE (XEXP (op0, 0)) == REG)
7632 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7634 MEM_VOLATILE_P (op0) |= volatilep;
7635 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7636 || modifier == EXPAND_CONST_ADDRESS
7637 || modifier == EXPAND_INITIALIZER)
7639 else if (target == 0)
7640 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7642 convert_move (target, op0, unsignedp);
7648 rtx insn, before = get_last_insn (), vtbl_ref;
7650 /* Evaluate the interior expression. */
7651 subtarget = expand_expr (TREE_OPERAND (exp, 0), target,
7654 /* Get or create an instruction off which to hang a note. */
7655 if (REG_P (subtarget))
7658 insn = get_last_insn ();
7661 if (! INSN_P (insn))
7662 insn = prev_nonnote_insn (insn);
7666 target = gen_reg_rtx (GET_MODE (subtarget));
7667 insn = emit_move_insn (target, subtarget);
7670 /* Collect the data for the note. */
7671 vtbl_ref = XEXP (DECL_RTL (TREE_OPERAND (exp, 1)), 0);
7672 vtbl_ref = plus_constant (vtbl_ref,
7673 tree_low_cst (TREE_OPERAND (exp, 2), 0));
7674 /* Discard the initial CONST that was added. */
7675 vtbl_ref = XEXP (vtbl_ref, 0);
7678 = gen_rtx_EXPR_LIST (REG_VTABLE_REF, vtbl_ref, REG_NOTES (insn));
7683 /* Intended for a reference to a buffer of a file-object in Pascal.
7684 But it's not certain that a special tree code will really be
7685 necessary for these. INDIRECT_REF might work for them. */
7691 /* Pascal set IN expression.
7694 rlo = set_low - (set_low%bits_per_word);
7695 the_word = set [ (index - rlo)/bits_per_word ];
7696 bit_index = index % bits_per_word;
7697 bitmask = 1 << bit_index;
7698 return !!(the_word & bitmask); */
7700 tree set = TREE_OPERAND (exp, 0);
7701 tree index = TREE_OPERAND (exp, 1);
7702 int iunsignedp = TREE_UNSIGNED (TREE_TYPE (index));
7703 tree set_type = TREE_TYPE (set);
7704 tree set_low_bound = TYPE_MIN_VALUE (TYPE_DOMAIN (set_type));
7705 tree set_high_bound = TYPE_MAX_VALUE (TYPE_DOMAIN (set_type));
7706 rtx index_val = expand_expr (index, 0, VOIDmode, 0);
7707 rtx lo_r = expand_expr (set_low_bound, 0, VOIDmode, 0);
7708 rtx hi_r = expand_expr (set_high_bound, 0, VOIDmode, 0);
7709 rtx setval = expand_expr (set, 0, VOIDmode, 0);
7710 rtx setaddr = XEXP (setval, 0);
7711 enum machine_mode index_mode = TYPE_MODE (TREE_TYPE (index));
7713 rtx diff, quo, rem, addr, bit, result;
7715 /* If domain is empty, answer is no. Likewise if index is constant
7716 and out of bounds. */
7717 if (((TREE_CODE (set_high_bound) == INTEGER_CST
7718 && TREE_CODE (set_low_bound) == INTEGER_CST
7719 && tree_int_cst_lt (set_high_bound, set_low_bound))
7720 || (TREE_CODE (index) == INTEGER_CST
7721 && TREE_CODE (set_low_bound) == INTEGER_CST
7722 && tree_int_cst_lt (index, set_low_bound))
7723 || (TREE_CODE (set_high_bound) == INTEGER_CST
7724 && TREE_CODE (index) == INTEGER_CST
7725 && tree_int_cst_lt (set_high_bound, index))))
7729 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7731 /* If we get here, we have to generate the code for both cases
7732 (in range and out of range). */
7734 op0 = gen_label_rtx ();
7735 op1 = gen_label_rtx ();
7737 if (! (GET_CODE (index_val) == CONST_INT
7738 && GET_CODE (lo_r) == CONST_INT))
7739 emit_cmp_and_jump_insns (index_val, lo_r, LT, NULL_RTX,
7740 GET_MODE (index_val), iunsignedp, op1);
7742 if (! (GET_CODE (index_val) == CONST_INT
7743 && GET_CODE (hi_r) == CONST_INT))
7744 emit_cmp_and_jump_insns (index_val, hi_r, GT, NULL_RTX,
7745 GET_MODE (index_val), iunsignedp, op1);
7747 /* Calculate the element number of bit zero in the first word
7749 if (GET_CODE (lo_r) == CONST_INT)
7750 rlow = GEN_INT (INTVAL (lo_r)
7751 & ~((HOST_WIDE_INT) 1 << BITS_PER_UNIT));
7753 rlow = expand_binop (index_mode, and_optab, lo_r,
7754 GEN_INT (~((HOST_WIDE_INT) 1 << BITS_PER_UNIT)),
7755 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7757 diff = expand_binop (index_mode, sub_optab, index_val, rlow,
7758 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7760 quo = expand_divmod (0, TRUNC_DIV_EXPR, index_mode, diff,
7761 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7762 rem = expand_divmod (1, TRUNC_MOD_EXPR, index_mode, index_val,
7763 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7765 addr = memory_address (byte_mode,
7766 expand_binop (index_mode, add_optab, diff,
7767 setaddr, NULL_RTX, iunsignedp,
7770 /* Extract the bit we want to examine. */
7771 bit = expand_shift (RSHIFT_EXPR, byte_mode,
7772 gen_rtx_MEM (byte_mode, addr),
7773 make_tree (TREE_TYPE (index), rem),
7775 result = expand_binop (byte_mode, and_optab, bit, const1_rtx,
7776 GET_MODE (target) == byte_mode ? target : 0,
7777 1, OPTAB_LIB_WIDEN);
7779 if (result != target)
7780 convert_move (target, result, 1);
7782 /* Output the code to handle the out-of-range case. */
7785 emit_move_insn (target, const0_rtx);
7790 case WITH_CLEANUP_EXPR:
7791 if (WITH_CLEANUP_EXPR_RTL (exp) == 0)
7793 WITH_CLEANUP_EXPR_RTL (exp)
7794 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7795 expand_decl_cleanup_eh (NULL_TREE, TREE_OPERAND (exp, 1),
7796 CLEANUP_EH_ONLY (exp));
7798 /* That's it for this cleanup. */
7799 TREE_OPERAND (exp, 1) = 0;
7801 return WITH_CLEANUP_EXPR_RTL (exp);
7803 case CLEANUP_POINT_EXPR:
7805 /* Start a new binding layer that will keep track of all cleanup
7806 actions to be performed. */
7807 expand_start_bindings (2);
7809 target_temp_slot_level = temp_slot_level;
7811 op0 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7812 /* If we're going to use this value, load it up now. */
7814 op0 = force_not_mem (op0);
7815 preserve_temp_slots (op0);
7816 expand_end_bindings (NULL_TREE, 0, 0);
7821 /* Check for a built-in function. */
7822 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7823 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7825 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7827 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7828 == BUILT_IN_FRONTEND)
7829 return (*lang_hooks.expand_expr) (exp, original_target,
7832 return expand_builtin (exp, target, subtarget, tmode, ignore);
7835 return expand_call (exp, target, ignore);
7837 case NON_LVALUE_EXPR:
7840 case REFERENCE_EXPR:
7841 if (TREE_OPERAND (exp, 0) == error_mark_node)
7844 if (TREE_CODE (type) == UNION_TYPE)
7846 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7848 /* If both input and output are BLKmode, this conversion isn't doing
7849 anything except possibly changing memory attribute. */
7850 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7852 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7855 result = copy_rtx (result);
7856 set_mem_attributes (result, exp, 0);
7861 target = assign_temp (type, 0, 1, 1);
7863 if (GET_CODE (target) == MEM)
7864 /* Store data into beginning of memory target. */
7865 store_expr (TREE_OPERAND (exp, 0),
7866 adjust_address (target, TYPE_MODE (valtype), 0),
7867 modifier == EXPAND_STACK_PARM ? 2 : 0);
7869 else if (GET_CODE (target) == REG)
7870 /* Store this field into a union of the proper type. */
7871 store_field (target,
7872 MIN ((int_size_in_bytes (TREE_TYPE
7873 (TREE_OPERAND (exp, 0)))
7875 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7876 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7877 VOIDmode, 0, type, 0);
7881 /* Return the entire union. */
7885 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7887 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7890 /* If the signedness of the conversion differs and OP0 is
7891 a promoted SUBREG, clear that indication since we now
7892 have to do the proper extension. */
7893 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7894 && GET_CODE (op0) == SUBREG)
7895 SUBREG_PROMOTED_VAR_P (op0) = 0;
7900 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7901 if (GET_MODE (op0) == mode)
7904 /* If OP0 is a constant, just convert it into the proper mode. */
7905 if (CONSTANT_P (op0))
7907 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7908 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7910 if (modifier == EXPAND_INITIALIZER)
7911 return simplify_gen_subreg (mode, op0, inner_mode,
7912 subreg_lowpart_offset (mode,
7915 return convert_modes (mode, inner_mode, op0,
7916 TREE_UNSIGNED (inner_type));
7919 if (modifier == EXPAND_INITIALIZER)
7920 return gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7924 convert_to_mode (mode, op0,
7925 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7927 convert_move (target, op0,
7928 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7931 case VIEW_CONVERT_EXPR:
7932 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7934 /* If the input and output modes are both the same, we are done.
7935 Otherwise, if neither mode is BLKmode and both are integral and within
7936 a word, we can use gen_lowpart. If neither is true, make sure the
7937 operand is in memory and convert the MEM to the new mode. */
7938 if (TYPE_MODE (type) == GET_MODE (op0))
7940 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7941 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7942 && GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT
7943 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7944 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7945 op0 = gen_lowpart (TYPE_MODE (type), op0);
7946 else if (GET_CODE (op0) != MEM)
7948 /* If the operand is not a MEM, force it into memory. Since we
7949 are going to be be changing the mode of the MEM, don't call
7950 force_const_mem for constants because we don't allow pool
7951 constants to change mode. */
7952 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7954 if (TREE_ADDRESSABLE (exp))
7957 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7959 = assign_stack_temp_for_type
7960 (TYPE_MODE (inner_type),
7961 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7963 emit_move_insn (target, op0);
7967 /* At this point, OP0 is in the correct mode. If the output type is such
7968 that the operand is known to be aligned, indicate that it is.
7969 Otherwise, we need only be concerned about alignment for non-BLKmode
7971 if (GET_CODE (op0) == MEM)
7973 op0 = copy_rtx (op0);
7975 if (TYPE_ALIGN_OK (type))
7976 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7977 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7978 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7980 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7981 HOST_WIDE_INT temp_size
7982 = MAX (int_size_in_bytes (inner_type),
7983 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7984 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7985 temp_size, 0, type);
7986 rtx new_with_op0_mode = adjust_address (new, GET_MODE (op0), 0);
7988 if (TREE_ADDRESSABLE (exp))
7991 if (GET_MODE (op0) == BLKmode)
7992 emit_block_move (new_with_op0_mode, op0,
7993 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))),
7994 (modifier == EXPAND_STACK_PARM
7995 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7997 emit_move_insn (new_with_op0_mode, op0);
8002 op0 = adjust_address (op0, TYPE_MODE (type), 0);
8008 this_optab = ! unsignedp && flag_trapv
8009 && (GET_MODE_CLASS (mode) == MODE_INT)
8010 ? addv_optab : add_optab;
8012 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
8013 something else, make sure we add the register to the constant and
8014 then to the other thing. This case can occur during strength
8015 reduction and doing it this way will produce better code if the
8016 frame pointer or argument pointer is eliminated.
8018 fold-const.c will ensure that the constant is always in the inner
8019 PLUS_EXPR, so the only case we need to do anything about is if
8020 sp, ap, or fp is our second argument, in which case we must swap
8021 the innermost first argument and our second argument. */
8023 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
8024 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
8025 && TREE_CODE (TREE_OPERAND (exp, 1)) == RTL_EXPR
8026 && (RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
8027 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
8028 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
8030 tree t = TREE_OPERAND (exp, 1);
8032 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
8033 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
8036 /* If the result is to be ptr_mode and we are adding an integer to
8037 something, we might be forming a constant. So try to use
8038 plus_constant. If it produces a sum and we can't accept it,
8039 use force_operand. This allows P = &ARR[const] to generate
8040 efficient code on machines where a SYMBOL_REF is not a valid
8043 If this is an EXPAND_SUM call, always return the sum. */
8044 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
8045 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
8047 if (modifier == EXPAND_STACK_PARM)
8049 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
8050 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
8051 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
8055 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
8057 /* Use immed_double_const to ensure that the constant is
8058 truncated according to the mode of OP1, then sign extended
8059 to a HOST_WIDE_INT. Using the constant directly can result
8060 in non-canonical RTL in a 64x32 cross compile. */
8062 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
8064 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
8065 op1 = plus_constant (op1, INTVAL (constant_part));
8066 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8067 op1 = force_operand (op1, target);
8071 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
8072 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
8073 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
8077 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
8078 (modifier == EXPAND_INITIALIZER
8079 ? EXPAND_INITIALIZER : EXPAND_SUM));
8080 if (! CONSTANT_P (op0))
8082 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
8083 VOIDmode, modifier);
8084 /* Don't go to both_summands if modifier
8085 says it's not right to return a PLUS. */
8086 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8090 /* Use immed_double_const to ensure that the constant is
8091 truncated according to the mode of OP1, then sign extended
8092 to a HOST_WIDE_INT. Using the constant directly can result
8093 in non-canonical RTL in a 64x32 cross compile. */
8095 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
8097 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
8098 op0 = plus_constant (op0, INTVAL (constant_part));
8099 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8100 op0 = force_operand (op0, target);
8105 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8108 /* No sense saving up arithmetic to be done
8109 if it's all in the wrong mode to form part of an address.
8110 And force_operand won't know whether to sign-extend or
8112 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8113 || mode != ptr_mode)
8115 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8116 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8117 if (op0 == const0_rtx)
8119 if (op1 == const0_rtx)
8124 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, modifier);
8125 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, modifier);
8127 /* We come here from MINUS_EXPR when the second operand is a
8130 /* Make sure any term that's a sum with a constant comes last. */
8131 if (GET_CODE (op0) == PLUS
8132 && CONSTANT_P (XEXP (op0, 1)))
8138 /* If adding to a sum including a constant,
8139 associate it to put the constant outside. */
8140 if (GET_CODE (op1) == PLUS
8141 && CONSTANT_P (XEXP (op1, 1)))
8143 rtx constant_term = const0_rtx;
8145 temp = simplify_binary_operation (PLUS, mode, XEXP (op1, 0), op0);
8148 /* Ensure that MULT comes first if there is one. */
8149 else if (GET_CODE (op0) == MULT)
8150 op0 = gen_rtx_PLUS (mode, op0, XEXP (op1, 0));
8152 op0 = gen_rtx_PLUS (mode, XEXP (op1, 0), op0);
8154 /* Let's also eliminate constants from op0 if possible. */
8155 op0 = eliminate_constant_term (op0, &constant_term);
8157 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
8158 their sum should be a constant. Form it into OP1, since the
8159 result we want will then be OP0 + OP1. */
8161 temp = simplify_binary_operation (PLUS, mode, constant_term,
8166 op1 = gen_rtx_PLUS (mode, constant_term, XEXP (op1, 1));
8169 /* Put a constant term last and put a multiplication first. */
8170 if (CONSTANT_P (op0) || GET_CODE (op1) == MULT)
8171 temp = op1, op1 = op0, op0 = temp;
8173 temp = simplify_binary_operation (PLUS, mode, op0, op1);
8174 return temp ? temp : gen_rtx_PLUS (mode, op0, op1);
8177 /* For initializers, we are allowed to return a MINUS of two
8178 symbolic constants. Here we handle all cases when both operands
8180 /* Handle difference of two symbolic constants,
8181 for the sake of an initializer. */
8182 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8183 && really_constant_p (TREE_OPERAND (exp, 0))
8184 && really_constant_p (TREE_OPERAND (exp, 1)))
8186 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode,
8188 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode,
8191 /* If the last operand is a CONST_INT, use plus_constant of
8192 the negated constant. Else make the MINUS. */
8193 if (GET_CODE (op1) == CONST_INT)
8194 return plus_constant (op0, - INTVAL (op1));
8196 return gen_rtx_MINUS (mode, op0, op1);
8199 this_optab = ! unsignedp && flag_trapv
8200 && (GET_MODE_CLASS(mode) == MODE_INT)
8201 ? subv_optab : sub_optab;
8203 /* No sense saving up arithmetic to be done
8204 if it's all in the wrong mode to form part of an address.
8205 And force_operand won't know whether to sign-extend or
8207 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8208 || mode != ptr_mode)
8211 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8214 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, modifier);
8215 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, modifier);
8217 /* Convert A - const to A + (-const). */
8218 if (GET_CODE (op1) == CONST_INT)
8220 op1 = negate_rtx (mode, op1);
8227 /* If first operand is constant, swap them.
8228 Thus the following special case checks need only
8229 check the second operand. */
8230 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
8232 tree t1 = TREE_OPERAND (exp, 0);
8233 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
8234 TREE_OPERAND (exp, 1) = t1;
8237 /* Attempt to return something suitable for generating an
8238 indexed address, for machines that support that. */
8240 if (modifier == EXPAND_SUM && mode == ptr_mode
8241 && host_integerp (TREE_OPERAND (exp, 1), 0))
8243 tree exp1 = TREE_OPERAND (exp, 1);
8245 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
8248 /* If we knew for certain that this is arithmetic for an array
8249 reference, and we knew the bounds of the array, then we could
8250 apply the distributive law across (PLUS X C) for constant C.
8251 Without such knowledge, we risk overflowing the computation
8252 when both X and C are large, but X+C isn't. */
8253 /* ??? Could perhaps special-case EXP being unsigned and C being
8254 positive. In that case we are certain that X+C is no smaller
8255 than X and so the transformed expression will overflow iff the
8256 original would have. */
8258 if (GET_CODE (op0) != REG)
8259 op0 = force_operand (op0, NULL_RTX);
8260 if (GET_CODE (op0) != REG)
8261 op0 = copy_to_mode_reg (mode, op0);
8263 return gen_rtx_MULT (mode, op0,
8264 gen_int_mode (tree_low_cst (exp1, 0),
8265 TYPE_MODE (TREE_TYPE (exp1))));
8268 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8271 if (modifier == EXPAND_STACK_PARM)
8274 /* Check for multiplying things that have been extended
8275 from a narrower type. If this machine supports multiplying
8276 in that narrower type with a result in the desired type,
8277 do it that way, and avoid the explicit type-conversion. */
8278 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
8279 && TREE_CODE (type) == INTEGER_TYPE
8280 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
8281 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
8282 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
8283 && int_fits_type_p (TREE_OPERAND (exp, 1),
8284 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
8285 /* Don't use a widening multiply if a shift will do. */
8286 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
8287 > HOST_BITS_PER_WIDE_INT)
8288 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
8290 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
8291 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
8293 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
8294 /* If both operands are extended, they must either both
8295 be zero-extended or both be sign-extended. */
8296 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
8298 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))))))
8300 enum machine_mode innermode
8301 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)));
8302 optab other_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
8303 ? smul_widen_optab : umul_widen_optab);
8304 this_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
8305 ? umul_widen_optab : smul_widen_optab);
8306 if (mode == GET_MODE_WIDER_MODE (innermode))
8308 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
8310 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8311 NULL_RTX, VOIDmode, 0);
8312 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
8313 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
8316 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
8317 NULL_RTX, VOIDmode, 0);
8320 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
8321 && innermode == word_mode)
8324 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8325 NULL_RTX, VOIDmode, 0);
8326 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
8327 op1 = convert_modes (innermode, mode,
8328 expand_expr (TREE_OPERAND (exp, 1),
8329 NULL_RTX, VOIDmode, 0),
8332 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
8333 NULL_RTX, VOIDmode, 0);
8334 temp = expand_binop (mode, other_optab, op0, op1, target,
8335 unsignedp, OPTAB_LIB_WIDEN);
8336 htem = expand_mult_highpart_adjust (innermode,
8337 gen_highpart (innermode, temp),
8339 gen_highpart (innermode, temp),
8341 emit_move_insn (gen_highpart (innermode, temp), htem);
8346 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8347 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8348 return expand_mult (mode, op0, op1, target, unsignedp);
8350 case TRUNC_DIV_EXPR:
8351 case FLOOR_DIV_EXPR:
8353 case ROUND_DIV_EXPR:
8354 case EXACT_DIV_EXPR:
8355 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8357 if (modifier == EXPAND_STACK_PARM)
8359 /* Possible optimization: compute the dividend with EXPAND_SUM
8360 then if the divisor is constant can optimize the case
8361 where some terms of the dividend have coeffs divisible by it. */
8362 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8363 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8364 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
8367 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
8368 expensive divide. If not, combine will rebuild the original
8370 if (flag_unsafe_math_optimizations && optimize && !optimize_size
8371 && TREE_CODE (type) == REAL_TYPE
8372 && !real_onep (TREE_OPERAND (exp, 0)))
8373 return expand_expr (build (MULT_EXPR, type, TREE_OPERAND (exp, 0),
8374 build (RDIV_EXPR, type,
8375 build_real (type, dconst1),
8376 TREE_OPERAND (exp, 1))),
8377 target, tmode, modifier);
8378 this_optab = sdiv_optab;
8381 case TRUNC_MOD_EXPR:
8382 case FLOOR_MOD_EXPR:
8384 case ROUND_MOD_EXPR:
8385 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8387 if (modifier == EXPAND_STACK_PARM)
8389 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8390 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8391 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
8393 case FIX_ROUND_EXPR:
8394 case FIX_FLOOR_EXPR:
8396 abort (); /* Not used for C. */
8398 case FIX_TRUNC_EXPR:
8399 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
8400 if (target == 0 || modifier == EXPAND_STACK_PARM)
8401 target = gen_reg_rtx (mode);
8402 expand_fix (target, op0, unsignedp);
8406 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
8407 if (target == 0 || modifier == EXPAND_STACK_PARM)
8408 target = gen_reg_rtx (mode);
8409 /* expand_float can't figure out what to do if FROM has VOIDmode.
8410 So give it the correct mode. With -O, cse will optimize this. */
8411 if (GET_MODE (op0) == VOIDmode)
8412 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8414 expand_float (target, op0,
8415 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
8419 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8420 if (modifier == EXPAND_STACK_PARM)
8422 temp = expand_unop (mode,
8423 ! unsignedp && flag_trapv
8424 && (GET_MODE_CLASS(mode) == MODE_INT)
8425 ? negv_optab : neg_optab, op0, target, 0);
8431 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8432 if (modifier == EXPAND_STACK_PARM)
8435 /* Handle complex values specially. */
8436 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_INT
8437 || GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
8438 return expand_complex_abs (mode, op0, target, unsignedp);
8440 /* Unsigned abs is simply the operand. Testing here means we don't
8441 risk generating incorrect code below. */
8442 if (TREE_UNSIGNED (type))
8445 return expand_abs (mode, op0, target, unsignedp,
8446 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
8450 target = original_target;
8452 || modifier == EXPAND_STACK_PARM
8453 || ! safe_from_p (target, TREE_OPERAND (exp, 1), 1)
8454 || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
8455 || GET_MODE (target) != mode
8456 || (GET_CODE (target) == REG
8457 && REGNO (target) < FIRST_PSEUDO_REGISTER))
8458 target = gen_reg_rtx (mode);
8459 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8460 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8462 /* First try to do it with a special MIN or MAX instruction.
8463 If that does not win, use a conditional jump to select the proper
8465 this_optab = (TREE_UNSIGNED (type)
8466 ? (code == MIN_EXPR ? umin_optab : umax_optab)
8467 : (code == MIN_EXPR ? smin_optab : smax_optab));
8469 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8474 /* At this point, a MEM target is no longer useful; we will get better
8477 if (GET_CODE (target) == MEM)
8478 target = gen_reg_rtx (mode);
8481 emit_move_insn (target, op0);
8483 op0 = gen_label_rtx ();
8485 /* If this mode is an integer too wide to compare properly,
8486 compare word by word. Rely on cse to optimize constant cases. */
8487 if (GET_MODE_CLASS (mode) == MODE_INT
8488 && ! can_compare_p (GE, mode, ccp_jump))
8490 if (code == MAX_EXPR)
8491 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
8492 target, op1, NULL_RTX, op0);
8494 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
8495 op1, target, NULL_RTX, op0);
8499 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)));
8500 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
8501 unsignedp, mode, NULL_RTX, NULL_RTX,
8504 emit_move_insn (target, op1);
8509 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8510 if (modifier == EXPAND_STACK_PARM)
8512 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8518 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8519 if (modifier == EXPAND_STACK_PARM)
8521 temp = expand_unop (mode, ffs_optab, op0, target, 1);
8527 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8528 temp = expand_unop (mode, clz_optab, op0, target, 1);
8534 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8535 temp = expand_unop (mode, ctz_optab, op0, target, 1);
8541 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8542 temp = expand_unop (mode, popcount_optab, op0, target, 1);
8548 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8549 temp = expand_unop (mode, parity_optab, op0, target, 1);
8554 /* ??? Can optimize bitwise operations with one arg constant.
8555 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8556 and (a bitwise1 b) bitwise2 b (etc)
8557 but that is probably not worth while. */
8559 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8560 boolean values when we want in all cases to compute both of them. In
8561 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8562 as actual zero-or-1 values and then bitwise anding. In cases where
8563 there cannot be any side effects, better code would be made by
8564 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8565 how to recognize those cases. */
8567 case TRUTH_AND_EXPR:
8569 this_optab = and_optab;
8574 this_optab = ior_optab;
8577 case TRUTH_XOR_EXPR:
8579 this_optab = xor_optab;
8586 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8588 if (modifier == EXPAND_STACK_PARM)
8590 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8591 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
8594 /* Could determine the answer when only additive constants differ. Also,
8595 the addition of one can be handled by changing the condition. */
8602 case UNORDERED_EXPR:
8609 temp = do_store_flag (exp,
8610 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8611 tmode != VOIDmode ? tmode : mode, 0);
8615 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8616 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
8618 && GET_CODE (original_target) == REG
8619 && (GET_MODE (original_target)
8620 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
8622 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
8625 /* If temp is constant, we can just compute the result. */
8626 if (GET_CODE (temp) == CONST_INT)
8628 if (INTVAL (temp) != 0)
8629 emit_move_insn (target, const1_rtx);
8631 emit_move_insn (target, const0_rtx);
8636 if (temp != original_target)
8638 enum machine_mode mode1 = GET_MODE (temp);
8639 if (mode1 == VOIDmode)
8640 mode1 = tmode != VOIDmode ? tmode : mode;
8642 temp = copy_to_mode_reg (mode1, temp);
8645 op1 = gen_label_rtx ();
8646 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
8647 GET_MODE (temp), unsignedp, op1);
8648 emit_move_insn (temp, const1_rtx);
8653 /* If no set-flag instruction, must generate a conditional
8654 store into a temporary variable. Drop through
8655 and handle this like && and ||. */
8657 case TRUTH_ANDIF_EXPR:
8658 case TRUTH_ORIF_EXPR:
8661 || modifier == EXPAND_STACK_PARM
8662 || ! safe_from_p (target, exp, 1)
8663 /* Make sure we don't have a hard reg (such as function's return
8664 value) live across basic blocks, if not optimizing. */
8665 || (!optimize && GET_CODE (target) == REG
8666 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8667 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8670 emit_clr_insn (target);
8672 op1 = gen_label_rtx ();
8673 jumpifnot (exp, op1);
8676 emit_0_to_1_insn (target);
8679 return ignore ? const0_rtx : target;
8681 case TRUTH_NOT_EXPR:
8682 if (modifier == EXPAND_STACK_PARM)
8684 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8685 /* The parser is careful to generate TRUTH_NOT_EXPR
8686 only with operands that are always zero or one. */
8687 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8688 target, 1, OPTAB_LIB_WIDEN);
8694 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
8696 return expand_expr (TREE_OPERAND (exp, 1),
8697 (ignore ? const0_rtx : target),
8698 VOIDmode, modifier);
8701 /* If we would have a "singleton" (see below) were it not for a
8702 conversion in each arm, bring that conversion back out. */
8703 if (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
8704 && TREE_CODE (TREE_OPERAND (exp, 2)) == NOP_EXPR
8705 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0))
8706 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 2), 0))))
8708 tree iftrue = TREE_OPERAND (TREE_OPERAND (exp, 1), 0);
8709 tree iffalse = TREE_OPERAND (TREE_OPERAND (exp, 2), 0);
8711 if ((TREE_CODE_CLASS (TREE_CODE (iftrue)) == '2'
8712 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8713 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '2'
8714 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0))
8715 || (TREE_CODE_CLASS (TREE_CODE (iftrue)) == '1'
8716 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8717 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '1'
8718 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0)))
8719 return expand_expr (build1 (NOP_EXPR, type,
8720 build (COND_EXPR, TREE_TYPE (iftrue),
8721 TREE_OPERAND (exp, 0),
8723 target, tmode, modifier);
8727 /* Note that COND_EXPRs whose type is a structure or union
8728 are required to be constructed to contain assignments of
8729 a temporary variable, so that we can evaluate them here
8730 for side effect only. If type is void, we must do likewise. */
8732 /* If an arm of the branch requires a cleanup,
8733 only that cleanup is performed. */
8736 tree binary_op = 0, unary_op = 0;
8738 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
8739 convert it to our mode, if necessary. */
8740 if (integer_onep (TREE_OPERAND (exp, 1))
8741 && integer_zerop (TREE_OPERAND (exp, 2))
8742 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8746 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
8751 if (modifier == EXPAND_STACK_PARM)
8753 op0 = expand_expr (TREE_OPERAND (exp, 0), target, mode, modifier);
8754 if (GET_MODE (op0) == mode)
8758 target = gen_reg_rtx (mode);
8759 convert_move (target, op0, unsignedp);
8763 /* Check for X ? A + B : A. If we have this, we can copy A to the
8764 output and conditionally add B. Similarly for unary operations.
8765 Don't do this if X has side-effects because those side effects
8766 might affect A or B and the "?" operation is a sequence point in
8767 ANSI. (operand_equal_p tests for side effects.) */
8769 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '2'
8770 && operand_equal_p (TREE_OPERAND (exp, 2),
8771 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8772 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
8773 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '2'
8774 && operand_equal_p (TREE_OPERAND (exp, 1),
8775 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8776 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
8777 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '1'
8778 && operand_equal_p (TREE_OPERAND (exp, 2),
8779 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8780 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
8781 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '1'
8782 && operand_equal_p (TREE_OPERAND (exp, 1),
8783 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8784 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
8786 /* If we are not to produce a result, we have no target. Otherwise,
8787 if a target was specified use it; it will not be used as an
8788 intermediate target unless it is safe. If no target, use a
8793 else if (modifier == EXPAND_STACK_PARM)
8794 temp = assign_temp (type, 0, 0, 1);
8795 else if (original_target
8796 && (safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8797 || (singleton && GET_CODE (original_target) == REG
8798 && REGNO (original_target) >= FIRST_PSEUDO_REGISTER
8799 && original_target == var_rtx (singleton)))
8800 && GET_MODE (original_target) == mode
8801 #ifdef HAVE_conditional_move
8802 && (! can_conditionally_move_p (mode)
8803 || GET_CODE (original_target) == REG
8804 || TREE_ADDRESSABLE (type))
8806 && (GET_CODE (original_target) != MEM
8807 || TREE_ADDRESSABLE (type)))
8808 temp = original_target;
8809 else if (TREE_ADDRESSABLE (type))
8812 temp = assign_temp (type, 0, 0, 1);
8814 /* If we had X ? A + C : A, with C a constant power of 2, and we can
8815 do the test of X as a store-flag operation, do this as
8816 A + ((X != 0) << log C). Similarly for other simple binary
8817 operators. Only do for C == 1 if BRANCH_COST is low. */
8818 if (temp && singleton && binary_op
8819 && (TREE_CODE (binary_op) == PLUS_EXPR
8820 || TREE_CODE (binary_op) == MINUS_EXPR
8821 || TREE_CODE (binary_op) == BIT_IOR_EXPR
8822 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
8823 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
8824 : integer_onep (TREE_OPERAND (binary_op, 1)))
8825 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8829 optab boptab = (TREE_CODE (binary_op) == PLUS_EXPR
8830 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8831 ? addv_optab : add_optab)
8832 : TREE_CODE (binary_op) == MINUS_EXPR
8833 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8834 ? subv_optab : sub_optab)
8835 : TREE_CODE (binary_op) == BIT_IOR_EXPR ? ior_optab
8838 /* If we had X ? A : A + 1, do this as A + (X == 0). */
8839 if (singleton == TREE_OPERAND (exp, 1))
8840 cond = invert_truthvalue (TREE_OPERAND (exp, 0));
8842 cond = TREE_OPERAND (exp, 0);
8844 result = do_store_flag (cond, (safe_from_p (temp, singleton, 1)
8846 mode, BRANCH_COST <= 1);
8848 if (result != 0 && ! integer_onep (TREE_OPERAND (binary_op, 1)))
8849 result = expand_shift (LSHIFT_EXPR, mode, result,
8850 build_int_2 (tree_log2
8854 (safe_from_p (temp, singleton, 1)
8855 ? temp : NULL_RTX), 0);
8859 op1 = expand_expr (singleton, NULL_RTX, VOIDmode, 0);
8860 return expand_binop (mode, boptab, op1, result, temp,
8861 unsignedp, OPTAB_LIB_WIDEN);
8865 do_pending_stack_adjust ();
8867 op0 = gen_label_rtx ();
8869 if (singleton && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0)))
8873 /* If the target conflicts with the other operand of the
8874 binary op, we can't use it. Also, we can't use the target
8875 if it is a hard register, because evaluating the condition
8876 might clobber it. */
8878 && ! safe_from_p (temp, TREE_OPERAND (binary_op, 1), 1))
8879 || (GET_CODE (temp) == REG
8880 && REGNO (temp) < FIRST_PSEUDO_REGISTER))
8881 temp = gen_reg_rtx (mode);
8882 store_expr (singleton, temp,
8883 modifier == EXPAND_STACK_PARM ? 2 : 0);
8886 expand_expr (singleton,
8887 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8888 if (singleton == TREE_OPERAND (exp, 1))
8889 jumpif (TREE_OPERAND (exp, 0), op0);
8891 jumpifnot (TREE_OPERAND (exp, 0), op0);
8893 start_cleanup_deferral ();
8894 if (binary_op && temp == 0)
8895 /* Just touch the other operand. */
8896 expand_expr (TREE_OPERAND (binary_op, 1),
8897 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8899 store_expr (build (TREE_CODE (binary_op), type,
8900 make_tree (type, temp),
8901 TREE_OPERAND (binary_op, 1)),
8902 temp, modifier == EXPAND_STACK_PARM ? 2 : 0);
8904 store_expr (build1 (TREE_CODE (unary_op), type,
8905 make_tree (type, temp)),
8906 temp, modifier == EXPAND_STACK_PARM ? 2 : 0);
8909 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
8910 comparison operator. If we have one of these cases, set the
8911 output to A, branch on A (cse will merge these two references),
8912 then set the output to FOO. */
8914 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8915 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8916 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8917 TREE_OPERAND (exp, 1), 0)
8918 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8919 || TREE_CODE (TREE_OPERAND (exp, 1)) == SAVE_EXPR)
8920 && safe_from_p (temp, TREE_OPERAND (exp, 2), 1))
8922 if (GET_CODE (temp) == REG
8923 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8924 temp = gen_reg_rtx (mode);
8925 store_expr (TREE_OPERAND (exp, 1), temp,
8926 modifier == EXPAND_STACK_PARM ? 2 : 0);
8927 jumpif (TREE_OPERAND (exp, 0), op0);
8929 start_cleanup_deferral ();
8930 store_expr (TREE_OPERAND (exp, 2), temp,
8931 modifier == EXPAND_STACK_PARM ? 2 : 0);
8935 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8936 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8937 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8938 TREE_OPERAND (exp, 2), 0)
8939 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8940 || TREE_CODE (TREE_OPERAND (exp, 2)) == SAVE_EXPR)
8941 && safe_from_p (temp, TREE_OPERAND (exp, 1), 1))
8943 if (GET_CODE (temp) == REG
8944 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8945 temp = gen_reg_rtx (mode);
8946 store_expr (TREE_OPERAND (exp, 2), temp,
8947 modifier == EXPAND_STACK_PARM ? 2 : 0);
8948 jumpifnot (TREE_OPERAND (exp, 0), op0);
8950 start_cleanup_deferral ();
8951 store_expr (TREE_OPERAND (exp, 1), temp,
8952 modifier == EXPAND_STACK_PARM ? 2 : 0);
8957 op1 = gen_label_rtx ();
8958 jumpifnot (TREE_OPERAND (exp, 0), op0);
8960 start_cleanup_deferral ();
8962 /* One branch of the cond can be void, if it never returns. For
8963 example A ? throw : E */
8965 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node)
8966 store_expr (TREE_OPERAND (exp, 1), temp,
8967 modifier == EXPAND_STACK_PARM ? 2 : 0);
8969 expand_expr (TREE_OPERAND (exp, 1),
8970 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8971 end_cleanup_deferral ();
8973 emit_jump_insn (gen_jump (op1));
8976 start_cleanup_deferral ();
8978 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node)
8979 store_expr (TREE_OPERAND (exp, 2), temp,
8980 modifier == EXPAND_STACK_PARM ? 2 : 0);
8982 expand_expr (TREE_OPERAND (exp, 2),
8983 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8986 end_cleanup_deferral ();
8997 /* Something needs to be initialized, but we didn't know
8998 where that thing was when building the tree. For example,
8999 it could be the return value of a function, or a parameter
9000 to a function which lays down in the stack, or a temporary
9001 variable which must be passed by reference.
9003 We guarantee that the expression will either be constructed
9004 or copied into our original target. */
9006 tree slot = TREE_OPERAND (exp, 0);
9007 tree cleanups = NULL_TREE;
9010 if (TREE_CODE (slot) != VAR_DECL)
9014 target = original_target;
9016 /* Set this here so that if we get a target that refers to a
9017 register variable that's already been used, put_reg_into_stack
9018 knows that it should fix up those uses. */
9019 TREE_USED (slot) = 1;
9023 if (DECL_RTL_SET_P (slot))
9025 target = DECL_RTL (slot);
9026 /* If we have already expanded the slot, so don't do
9028 if (TREE_OPERAND (exp, 1) == NULL_TREE)
9033 target = assign_temp (type, 2, 0, 1);
9034 /* All temp slots at this level must not conflict. */
9035 preserve_temp_slots (target);
9036 SET_DECL_RTL (slot, target);
9037 if (TREE_ADDRESSABLE (slot))
9038 put_var_into_stack (slot, /*rescan=*/false);
9040 /* Since SLOT is not known to the called function
9041 to belong to its stack frame, we must build an explicit
9042 cleanup. This case occurs when we must build up a reference
9043 to pass the reference as an argument. In this case,
9044 it is very likely that such a reference need not be
9047 if (TREE_OPERAND (exp, 2) == 0)
9048 TREE_OPERAND (exp, 2)
9049 = (*lang_hooks.maybe_build_cleanup) (slot);
9050 cleanups = TREE_OPERAND (exp, 2);
9055 /* This case does occur, when expanding a parameter which
9056 needs to be constructed on the stack. The target
9057 is the actual stack address that we want to initialize.
9058 The function we call will perform the cleanup in this case. */
9060 /* If we have already assigned it space, use that space,
9061 not target that we were passed in, as our target
9062 parameter is only a hint. */
9063 if (DECL_RTL_SET_P (slot))
9065 target = DECL_RTL (slot);
9066 /* If we have already expanded the slot, so don't do
9068 if (TREE_OPERAND (exp, 1) == NULL_TREE)
9073 SET_DECL_RTL (slot, target);
9074 /* If we must have an addressable slot, then make sure that
9075 the RTL that we just stored in slot is OK. */
9076 if (TREE_ADDRESSABLE (slot))
9077 put_var_into_stack (slot, /*rescan=*/true);
9081 exp1 = TREE_OPERAND (exp, 3) = TREE_OPERAND (exp, 1);
9082 /* Mark it as expanded. */
9083 TREE_OPERAND (exp, 1) = NULL_TREE;
9085 store_expr (exp1, target, modifier == EXPAND_STACK_PARM ? 2 : 0);
9087 expand_decl_cleanup_eh (NULL_TREE, cleanups, CLEANUP_EH_ONLY (exp));
9094 tree lhs = TREE_OPERAND (exp, 0);
9095 tree rhs = TREE_OPERAND (exp, 1);
9097 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
9103 /* If lhs is complex, expand calls in rhs before computing it.
9104 That's so we don't compute a pointer and save it over a
9105 call. If lhs is simple, compute it first so we can give it
9106 as a target if the rhs is just a call. This avoids an
9107 extra temp and copy and that prevents a partial-subsumption
9108 which makes bad code. Actually we could treat
9109 component_ref's of vars like vars. */
9111 tree lhs = TREE_OPERAND (exp, 0);
9112 tree rhs = TREE_OPERAND (exp, 1);
9116 /* Check for |= or &= of a bitfield of size one into another bitfield
9117 of size 1. In this case, (unless we need the result of the
9118 assignment) we can do this more efficiently with a
9119 test followed by an assignment, if necessary.
9121 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9122 things change so we do, this code should be enhanced to
9125 && TREE_CODE (lhs) == COMPONENT_REF
9126 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9127 || TREE_CODE (rhs) == BIT_AND_EXPR)
9128 && TREE_OPERAND (rhs, 0) == lhs
9129 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9130 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9131 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9133 rtx label = gen_label_rtx ();
9135 do_jump (TREE_OPERAND (rhs, 1),
9136 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
9137 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
9138 expand_assignment (lhs, convert (TREE_TYPE (rhs),
9139 (TREE_CODE (rhs) == BIT_IOR_EXPR
9141 : integer_zero_node)),
9143 do_pending_stack_adjust ();
9148 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
9154 if (!TREE_OPERAND (exp, 0))
9155 expand_null_return ();
9157 expand_return (TREE_OPERAND (exp, 0));
9160 case PREINCREMENT_EXPR:
9161 case PREDECREMENT_EXPR:
9162 return expand_increment (exp, 0, ignore);
9164 case POSTINCREMENT_EXPR:
9165 case POSTDECREMENT_EXPR:
9166 /* Faster to treat as pre-increment if result is not used. */
9167 return expand_increment (exp, ! ignore, ignore);
9170 if (modifier == EXPAND_STACK_PARM)
9172 /* Are we taking the address of a nested function? */
9173 if (TREE_CODE (TREE_OPERAND (exp, 0)) == FUNCTION_DECL
9174 && decl_function_context (TREE_OPERAND (exp, 0)) != 0
9175 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp, 0))
9176 && ! TREE_STATIC (exp))
9178 op0 = trampoline_address (TREE_OPERAND (exp, 0));
9179 op0 = force_operand (op0, target);
9181 /* If we are taking the address of something erroneous, just
9183 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
9185 /* If we are taking the address of a constant and are at the
9186 top level, we have to use output_constant_def since we can't
9187 call force_const_mem at top level. */
9189 && (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
9190 || (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0)))
9192 op0 = XEXP (output_constant_def (TREE_OPERAND (exp, 0), 0), 0);
9195 /* We make sure to pass const0_rtx down if we came in with
9196 ignore set, to avoid doing the cleanups twice for something. */
9197 op0 = expand_expr (TREE_OPERAND (exp, 0),
9198 ignore ? const0_rtx : NULL_RTX, VOIDmode,
9199 (modifier == EXPAND_INITIALIZER
9200 ? modifier : EXPAND_CONST_ADDRESS));
9202 /* If we are going to ignore the result, OP0 will have been set
9203 to const0_rtx, so just return it. Don't get confused and
9204 think we are taking the address of the constant. */
9208 /* Pass 1 for MODIFY, so that protect_from_queue doesn't get
9209 clever and returns a REG when given a MEM. */
9210 op0 = protect_from_queue (op0, 1);
9212 /* We would like the object in memory. If it is a constant, we can
9213 have it be statically allocated into memory. For a non-constant,
9214 we need to allocate some memory and store the value into it. */
9216 if (CONSTANT_P (op0))
9217 op0 = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
9219 else if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
9220 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF
9221 || GET_CODE (op0) == PARALLEL || GET_CODE (op0) == LO_SUM)
9223 /* If the operand is a SAVE_EXPR, we can deal with this by
9224 forcing the SAVE_EXPR into memory. */
9225 if (TREE_CODE (TREE_OPERAND (exp, 0)) == SAVE_EXPR)
9227 put_var_into_stack (TREE_OPERAND (exp, 0),
9229 op0 = SAVE_EXPR_RTL (TREE_OPERAND (exp, 0));
9233 /* If this object is in a register, it can't be BLKmode. */
9234 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9235 rtx memloc = assign_temp (inner_type, 1, 1, 1);
9237 if (GET_CODE (op0) == PARALLEL)
9238 /* Handle calls that pass values in multiple
9239 non-contiguous locations. The Irix 6 ABI has examples
9241 emit_group_store (memloc, op0,
9242 int_size_in_bytes (inner_type));
9244 emit_move_insn (memloc, op0);
9250 if (GET_CODE (op0) != MEM)
9253 mark_temp_addr_taken (op0);
9254 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9256 op0 = XEXP (op0, 0);
9257 #ifdef POINTERS_EXTEND_UNSIGNED
9258 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
9259 && mode == ptr_mode)
9260 op0 = convert_memory_address (ptr_mode, op0);
9265 /* If OP0 is not aligned as least as much as the type requires, we
9266 need to make a temporary, copy OP0 to it, and take the address of
9267 the temporary. We want to use the alignment of the type, not of
9268 the operand. Note that this is incorrect for FUNCTION_TYPE, but
9269 the test for BLKmode means that can't happen. The test for
9270 BLKmode is because we never make mis-aligned MEMs with
9273 We don't need to do this at all if the machine doesn't have
9274 strict alignment. */
9275 if (STRICT_ALIGNMENT && GET_MODE (op0) == BLKmode
9276 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
9278 && MEM_ALIGN (op0) < BIGGEST_ALIGNMENT)
9280 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9283 if (TYPE_ALIGN_OK (inner_type))
9286 if (TREE_ADDRESSABLE (inner_type))
9288 /* We can't make a bitwise copy of this object, so fail. */
9289 error ("cannot take the address of an unaligned member");
9293 new = assign_stack_temp_for_type
9294 (TYPE_MODE (inner_type),
9295 MEM_SIZE (op0) ? INTVAL (MEM_SIZE (op0))
9296 : int_size_in_bytes (inner_type),
9297 1, build_qualified_type (inner_type,
9298 (TYPE_QUALS (inner_type)
9299 | TYPE_QUAL_CONST)));
9301 emit_block_move (new, op0, expr_size (TREE_OPERAND (exp, 0)),
9302 (modifier == EXPAND_STACK_PARM
9303 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9308 op0 = force_operand (XEXP (op0, 0), target);
9312 && GET_CODE (op0) != REG
9313 && modifier != EXPAND_CONST_ADDRESS
9314 && modifier != EXPAND_INITIALIZER
9315 && modifier != EXPAND_SUM)
9316 op0 = force_reg (Pmode, op0);
9318 if (GET_CODE (op0) == REG
9319 && ! REG_USERVAR_P (op0))
9320 mark_reg_pointer (op0, TYPE_ALIGN (TREE_TYPE (type)));
9322 #ifdef POINTERS_EXTEND_UNSIGNED
9323 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
9324 && mode == ptr_mode)
9325 op0 = convert_memory_address (ptr_mode, op0);
9330 case ENTRY_VALUE_EXPR:
9333 /* COMPLEX type for Extended Pascal & Fortran */
9336 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
9339 /* Get the rtx code of the operands. */
9340 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
9341 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
9344 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
9348 /* Move the real (op0) and imaginary (op1) parts to their location. */
9349 emit_move_insn (gen_realpart (mode, target), op0);
9350 emit_move_insn (gen_imagpart (mode, target), op1);
9352 insns = get_insns ();
9355 /* Complex construction should appear as a single unit. */
9356 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
9357 each with a separate pseudo as destination.
9358 It's not correct for flow to treat them as a unit. */
9359 if (GET_CODE (target) != CONCAT)
9360 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
9368 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
9369 return gen_realpart (mode, op0);
9372 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
9373 return gen_imagpart (mode, op0);
9377 enum machine_mode partmode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
9381 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
9384 target = gen_reg_rtx (mode);
9388 /* Store the realpart and the negated imagpart to target. */
9389 emit_move_insn (gen_realpart (partmode, target),
9390 gen_realpart (partmode, op0));
9392 imag_t = gen_imagpart (partmode, target);
9393 temp = expand_unop (partmode,
9394 ! unsignedp && flag_trapv
9395 && (GET_MODE_CLASS(partmode) == MODE_INT)
9396 ? negv_optab : neg_optab,
9397 gen_imagpart (partmode, op0), imag_t, 0);
9399 emit_move_insn (imag_t, temp);
9401 insns = get_insns ();
9404 /* Conjugate should appear as a single unit
9405 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
9406 each with a separate pseudo as destination.
9407 It's not correct for flow to treat them as a unit. */
9408 if (GET_CODE (target) != CONCAT)
9409 emit_no_conflict_block (insns, target, op0, NULL_RTX, NULL_RTX);
9416 case TRY_CATCH_EXPR:
9418 tree handler = TREE_OPERAND (exp, 1);
9420 expand_eh_region_start ();
9422 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
9424 expand_eh_region_end_cleanup (handler);
9429 case TRY_FINALLY_EXPR:
9431 tree try_block = TREE_OPERAND (exp, 0);
9432 tree finally_block = TREE_OPERAND (exp, 1);
9434 if (!optimize || unsafe_for_reeval (finally_block) > 1)
9436 /* In this case, wrapping FINALLY_BLOCK in an UNSAVE_EXPR
9437 is not sufficient, so we cannot expand the block twice.
9438 So we play games with GOTO_SUBROUTINE_EXPR to let us
9439 expand the thing only once. */
9440 /* When not optimizing, we go ahead with this form since
9441 (1) user breakpoints operate more predictably without
9442 code duplication, and
9443 (2) we're not running any of the global optimizers
9444 that would explode in time/space with the highly
9445 connected CFG created by the indirect branching. */
9447 rtx finally_label = gen_label_rtx ();
9448 rtx done_label = gen_label_rtx ();
9449 rtx return_link = gen_reg_rtx (Pmode);
9450 tree cleanup = build (GOTO_SUBROUTINE_EXPR, void_type_node,
9451 (tree) finally_label, (tree) return_link);
9452 TREE_SIDE_EFFECTS (cleanup) = 1;
9454 /* Start a new binding layer that will keep track of all cleanup
9455 actions to be performed. */
9456 expand_start_bindings (2);
9457 target_temp_slot_level = temp_slot_level;
9459 expand_decl_cleanup (NULL_TREE, cleanup);
9460 op0 = expand_expr (try_block, target, tmode, modifier);
9462 preserve_temp_slots (op0);
9463 expand_end_bindings (NULL_TREE, 0, 0);
9464 emit_jump (done_label);
9465 emit_label (finally_label);
9466 expand_expr (finally_block, const0_rtx, VOIDmode, 0);
9467 emit_indirect_jump (return_link);
9468 emit_label (done_label);
9472 expand_start_bindings (2);
9473 target_temp_slot_level = temp_slot_level;
9475 expand_decl_cleanup (NULL_TREE, finally_block);
9476 op0 = expand_expr (try_block, target, tmode, modifier);
9478 preserve_temp_slots (op0);
9479 expand_end_bindings (NULL_TREE, 0, 0);
9485 case GOTO_SUBROUTINE_EXPR:
9487 rtx subr = (rtx) TREE_OPERAND (exp, 0);
9488 rtx return_link = *(rtx *) &TREE_OPERAND (exp, 1);
9489 rtx return_address = gen_label_rtx ();
9490 emit_move_insn (return_link,
9491 gen_rtx_LABEL_REF (Pmode, return_address));
9493 emit_label (return_address);
9498 return expand_builtin_va_arg (TREE_OPERAND (exp, 0), type);
9501 return get_exception_pointer (cfun);
9504 /* Function descriptors are not valid except for as
9505 initialization constants, and should not be expanded. */
9509 return (*lang_hooks.expand_expr) (exp, original_target, tmode, modifier);
9512 /* Here to do an ordinary binary operator, generating an instruction
9513 from the optab already placed in `this_optab'. */
9515 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
9517 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
9518 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9520 if (modifier == EXPAND_STACK_PARM)
9522 temp = expand_binop (mode, this_optab, op0, op1, target,
9523 unsignedp, OPTAB_LIB_WIDEN);
9529 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9530 when applied to the address of EXP produces an address known to be
9531 aligned more than BIGGEST_ALIGNMENT. */
9534 is_aligning_offset (offset, exp)
9538 /* Strip off any conversions and WITH_RECORD_EXPR nodes. */
9539 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9540 || TREE_CODE (offset) == NOP_EXPR
9541 || TREE_CODE (offset) == CONVERT_EXPR
9542 || TREE_CODE (offset) == WITH_RECORD_EXPR)
9543 offset = TREE_OPERAND (offset, 0);
9545 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9546 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9547 if (TREE_CODE (offset) != BIT_AND_EXPR
9548 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9549 || compare_tree_int (TREE_OPERAND (offset, 1), BIGGEST_ALIGNMENT) <= 0
9550 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9553 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9554 It must be NEGATE_EXPR. Then strip any more conversions. */
9555 offset = TREE_OPERAND (offset, 0);
9556 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9557 || TREE_CODE (offset) == NOP_EXPR
9558 || TREE_CODE (offset) == CONVERT_EXPR)
9559 offset = TREE_OPERAND (offset, 0);
9561 if (TREE_CODE (offset) != NEGATE_EXPR)
9564 offset = TREE_OPERAND (offset, 0);
9565 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9566 || TREE_CODE (offset) == NOP_EXPR
9567 || TREE_CODE (offset) == CONVERT_EXPR)
9568 offset = TREE_OPERAND (offset, 0);
9570 /* This must now be the address either of EXP or of a PLACEHOLDER_EXPR
9571 whose type is the same as EXP. */
9572 return (TREE_CODE (offset) == ADDR_EXPR
9573 && (TREE_OPERAND (offset, 0) == exp
9574 || (TREE_CODE (TREE_OPERAND (offset, 0)) == PLACEHOLDER_EXPR
9575 && (TREE_TYPE (TREE_OPERAND (offset, 0))
9576 == TREE_TYPE (exp)))));
9579 /* Return the tree node if an ARG corresponds to a string constant or zero
9580 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9581 in bytes within the string that ARG is accessing. The type of the
9582 offset will be `sizetype'. */
9585 string_constant (arg, ptr_offset)
9591 if (TREE_CODE (arg) == ADDR_EXPR
9592 && TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9594 *ptr_offset = size_zero_node;
9595 return TREE_OPERAND (arg, 0);
9597 else if (TREE_CODE (arg) == PLUS_EXPR)
9599 tree arg0 = TREE_OPERAND (arg, 0);
9600 tree arg1 = TREE_OPERAND (arg, 1);
9605 if (TREE_CODE (arg0) == ADDR_EXPR
9606 && TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST)
9608 *ptr_offset = convert (sizetype, arg1);
9609 return TREE_OPERAND (arg0, 0);
9611 else if (TREE_CODE (arg1) == ADDR_EXPR
9612 && TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST)
9614 *ptr_offset = convert (sizetype, arg0);
9615 return TREE_OPERAND (arg1, 0);
9622 /* Expand code for a post- or pre- increment or decrement
9623 and return the RTX for the result.
9624 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
9627 expand_increment (exp, post, ignore)
9633 tree incremented = TREE_OPERAND (exp, 0);
9634 optab this_optab = add_optab;
9636 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
9637 int op0_is_copy = 0;
9638 int single_insn = 0;
9639 /* 1 means we can't store into OP0 directly,
9640 because it is a subreg narrower than a word,
9641 and we don't dare clobber the rest of the word. */
9644 /* Stabilize any component ref that might need to be
9645 evaluated more than once below. */
9647 || TREE_CODE (incremented) == BIT_FIELD_REF
9648 || (TREE_CODE (incremented) == COMPONENT_REF
9649 && (TREE_CODE (TREE_OPERAND (incremented, 0)) != INDIRECT_REF
9650 || DECL_BIT_FIELD (TREE_OPERAND (incremented, 1)))))
9651 incremented = stabilize_reference (incremented);
9652 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
9653 ones into save exprs so that they don't accidentally get evaluated
9654 more than once by the code below. */
9655 if (TREE_CODE (incremented) == PREINCREMENT_EXPR
9656 || TREE_CODE (incremented) == PREDECREMENT_EXPR)
9657 incremented = save_expr (incremented);
9659 /* Compute the operands as RTX.
9660 Note whether OP0 is the actual lvalue or a copy of it:
9661 I believe it is a copy iff it is a register or subreg
9662 and insns were generated in computing it. */
9664 temp = get_last_insn ();
9665 op0 = expand_expr (incremented, NULL_RTX, VOIDmode, 0);
9667 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
9668 in place but instead must do sign- or zero-extension during assignment,
9669 so we copy it into a new register and let the code below use it as
9672 Note that we can safely modify this SUBREG since it is know not to be
9673 shared (it was made by the expand_expr call above). */
9675 if (GET_CODE (op0) == SUBREG && SUBREG_PROMOTED_VAR_P (op0))
9678 SUBREG_REG (op0) = copy_to_reg (SUBREG_REG (op0));
9682 else if (GET_CODE (op0) == SUBREG
9683 && GET_MODE_BITSIZE (GET_MODE (op0)) < BITS_PER_WORD)
9685 /* We cannot increment this SUBREG in place. If we are
9686 post-incrementing, get a copy of the old value. Otherwise,
9687 just mark that we cannot increment in place. */
9689 op0 = copy_to_reg (op0);
9694 op0_is_copy = ((GET_CODE (op0) == SUBREG || GET_CODE (op0) == REG)
9695 && temp != get_last_insn ());
9696 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9698 /* Decide whether incrementing or decrementing. */
9699 if (TREE_CODE (exp) == POSTDECREMENT_EXPR
9700 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9701 this_optab = sub_optab;
9703 /* Convert decrement by a constant into a negative increment. */
9704 if (this_optab == sub_optab
9705 && GET_CODE (op1) == CONST_INT)
9707 op1 = GEN_INT (-INTVAL (op1));
9708 this_optab = add_optab;
9711 if (TYPE_TRAP_SIGNED (TREE_TYPE (exp)))
9712 this_optab = this_optab == add_optab ? addv_optab : subv_optab;
9714 /* For a preincrement, see if we can do this with a single instruction. */
9717 icode = (int) this_optab->handlers[(int) mode].insn_code;
9718 if (icode != (int) CODE_FOR_nothing
9719 /* Make sure that OP0 is valid for operands 0 and 1
9720 of the insn we want to queue. */
9721 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9722 && (*insn_data[icode].operand[1].predicate) (op0, mode)
9723 && (*insn_data[icode].operand[2].predicate) (op1, mode))
9727 /* If OP0 is not the actual lvalue, but rather a copy in a register,
9728 then we cannot just increment OP0. We must therefore contrive to
9729 increment the original value. Then, for postincrement, we can return
9730 OP0 since it is a copy of the old value. For preincrement, expand here
9731 unless we can do it with a single insn.
9733 Likewise if storing directly into OP0 would clobber high bits
9734 we need to preserve (bad_subreg). */
9735 if (op0_is_copy || (!post && !single_insn) || bad_subreg)
9737 /* This is the easiest way to increment the value wherever it is.
9738 Problems with multiple evaluation of INCREMENTED are prevented
9739 because either (1) it is a component_ref or preincrement,
9740 in which case it was stabilized above, or (2) it is an array_ref
9741 with constant index in an array in a register, which is
9742 safe to reevaluate. */
9743 tree newexp = build (((TREE_CODE (exp) == POSTDECREMENT_EXPR
9744 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9745 ? MINUS_EXPR : PLUS_EXPR),
9748 TREE_OPERAND (exp, 1));
9750 while (TREE_CODE (incremented) == NOP_EXPR
9751 || TREE_CODE (incremented) == CONVERT_EXPR)
9753 newexp = convert (TREE_TYPE (incremented), newexp);
9754 incremented = TREE_OPERAND (incremented, 0);
9757 temp = expand_assignment (incremented, newexp, ! post && ! ignore , 0);
9758 return post ? op0 : temp;
9763 /* We have a true reference to the value in OP0.
9764 If there is an insn to add or subtract in this mode, queue it.
9765 Queueing the increment insn avoids the register shuffling
9766 that often results if we must increment now and first save
9767 the old value for subsequent use. */
9769 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
9770 op0 = stabilize (op0);
9773 icode = (int) this_optab->handlers[(int) mode].insn_code;
9774 if (icode != (int) CODE_FOR_nothing
9775 /* Make sure that OP0 is valid for operands 0 and 1
9776 of the insn we want to queue. */
9777 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9778 && (*insn_data[icode].operand[1].predicate) (op0, mode))
9780 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9781 op1 = force_reg (mode, op1);
9783 return enqueue_insn (op0, GEN_FCN (icode) (op0, op0, op1));
9785 if (icode != (int) CODE_FOR_nothing && GET_CODE (op0) == MEM)
9787 rtx addr = (general_operand (XEXP (op0, 0), mode)
9788 ? force_reg (Pmode, XEXP (op0, 0))
9789 : copy_to_reg (XEXP (op0, 0)));
9792 op0 = replace_equiv_address (op0, addr);
9793 temp = force_reg (GET_MODE (op0), op0);
9794 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9795 op1 = force_reg (mode, op1);
9797 /* The increment queue is LIFO, thus we have to `queue'
9798 the instructions in reverse order. */
9799 enqueue_insn (op0, gen_move_insn (op0, temp));
9800 result = enqueue_insn (temp, GEN_FCN (icode) (temp, temp, op1));
9805 /* Preincrement, or we can't increment with one simple insn. */
9807 /* Save a copy of the value before inc or dec, to return it later. */
9808 temp = value = copy_to_reg (op0);
9810 /* Arrange to return the incremented value. */
9811 /* Copy the rtx because expand_binop will protect from the queue,
9812 and the results of that would be invalid for us to return
9813 if our caller does emit_queue before using our result. */
9814 temp = copy_rtx (value = op0);
9816 /* Increment however we can. */
9817 op1 = expand_binop (mode, this_optab, value, op1, op0,
9818 TREE_UNSIGNED (TREE_TYPE (exp)), OPTAB_LIB_WIDEN);
9820 /* Make sure the value is stored into OP0. */
9822 emit_move_insn (op0, op1);
9827 /* Generate code to calculate EXP using a store-flag instruction
9828 and return an rtx for the result. EXP is either a comparison
9829 or a TRUTH_NOT_EXPR whose operand is a comparison.
9831 If TARGET is nonzero, store the result there if convenient.
9833 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
9836 Return zero if there is no suitable set-flag instruction
9837 available on this machine.
9839 Once expand_expr has been called on the arguments of the comparison,
9840 we are committed to doing the store flag, since it is not safe to
9841 re-evaluate the expression. We emit the store-flag insn by calling
9842 emit_store_flag, but only expand the arguments if we have a reason
9843 to believe that emit_store_flag will be successful. If we think that
9844 it will, but it isn't, we have to simulate the store-flag with a
9845 set/jump/set sequence. */
9848 do_store_flag (exp, target, mode, only_cheap)
9851 enum machine_mode mode;
9855 tree arg0, arg1, type;
9857 enum machine_mode operand_mode;
9861 enum insn_code icode;
9862 rtx subtarget = target;
9865 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9866 result at the end. We can't simply invert the test since it would
9867 have already been inverted if it were valid. This case occurs for
9868 some floating-point comparisons. */
9870 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
9871 invert = 1, exp = TREE_OPERAND (exp, 0);
9873 arg0 = TREE_OPERAND (exp, 0);
9874 arg1 = TREE_OPERAND (exp, 1);
9876 /* Don't crash if the comparison was erroneous. */
9877 if (arg0 == error_mark_node || arg1 == error_mark_node)
9880 type = TREE_TYPE (arg0);
9881 operand_mode = TYPE_MODE (type);
9882 unsignedp = TREE_UNSIGNED (type);
9884 /* We won't bother with BLKmode store-flag operations because it would mean
9885 passing a lot of information to emit_store_flag. */
9886 if (operand_mode == BLKmode)
9889 /* We won't bother with store-flag operations involving function pointers
9890 when function pointers must be canonicalized before comparisons. */
9891 #ifdef HAVE_canonicalize_funcptr_for_compare
9892 if (HAVE_canonicalize_funcptr_for_compare
9893 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
9894 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
9896 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
9897 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
9898 == FUNCTION_TYPE))))
9905 /* Get the rtx comparison code to use. We know that EXP is a comparison
9906 operation of some type. Some comparisons against 1 and -1 can be
9907 converted to comparisons with zero. Do so here so that the tests
9908 below will be aware that we have a comparison with zero. These
9909 tests will not catch constants in the first operand, but constants
9910 are rarely passed as the first operand. */
9912 switch (TREE_CODE (exp))
9921 if (integer_onep (arg1))
9922 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9924 code = unsignedp ? LTU : LT;
9927 if (! unsignedp && integer_all_onesp (arg1))
9928 arg1 = integer_zero_node, code = LT;
9930 code = unsignedp ? LEU : LE;
9933 if (! unsignedp && integer_all_onesp (arg1))
9934 arg1 = integer_zero_node, code = GE;
9936 code = unsignedp ? GTU : GT;
9939 if (integer_onep (arg1))
9940 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
9942 code = unsignedp ? GEU : GE;
9945 case UNORDERED_EXPR:
9971 /* Put a constant second. */
9972 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
9974 tem = arg0; arg0 = arg1; arg1 = tem;
9975 code = swap_condition (code);
9978 /* If this is an equality or inequality test of a single bit, we can
9979 do this by shifting the bit being tested to the low-order bit and
9980 masking the result with the constant 1. If the condition was EQ,
9981 we xor it with 1. This does not require an scc insn and is faster
9982 than an scc insn even if we have it. */
9984 if ((code == NE || code == EQ)
9985 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
9986 && integer_pow2p (TREE_OPERAND (arg0, 1)))
9988 tree inner = TREE_OPERAND (arg0, 0);
9989 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
9992 /* If INNER is a right shift of a constant and it plus BITNUM does
9993 not overflow, adjust BITNUM and INNER. */
9995 if (TREE_CODE (inner) == RSHIFT_EXPR
9996 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
9997 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
9998 && bitnum < TYPE_PRECISION (type)
9999 && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
10000 bitnum - TYPE_PRECISION (type)))
10002 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
10003 inner = TREE_OPERAND (inner, 0);
10006 /* If we are going to be able to omit the AND below, we must do our
10007 operations as unsigned. If we must use the AND, we have a choice.
10008 Normally unsigned is faster, but for some machines signed is. */
10009 ops_unsignedp = (bitnum == TYPE_PRECISION (type) - 1 ? 1
10010 #ifdef LOAD_EXTEND_OP
10011 : (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND ? 0 : 1)
10017 if (! get_subtarget (subtarget)
10018 || GET_MODE (subtarget) != operand_mode
10019 || ! safe_from_p (subtarget, inner, 1))
10022 op0 = expand_expr (inner, subtarget, VOIDmode, 0);
10025 op0 = expand_shift (RSHIFT_EXPR, operand_mode, op0,
10026 size_int (bitnum), subtarget, ops_unsignedp);
10028 if (GET_MODE (op0) != mode)
10029 op0 = convert_to_mode (mode, op0, ops_unsignedp);
10031 if ((code == EQ && ! invert) || (code == NE && invert))
10032 op0 = expand_binop (mode, xor_optab, op0, const1_rtx, subtarget,
10033 ops_unsignedp, OPTAB_LIB_WIDEN);
10035 /* Put the AND last so it can combine with more things. */
10036 if (bitnum != TYPE_PRECISION (type) - 1)
10037 op0 = expand_and (mode, op0, const1_rtx, subtarget);
10042 /* Now see if we are likely to be able to do this. Return if not. */
10043 if (! can_compare_p (code, operand_mode, ccp_store_flag))
10046 icode = setcc_gen_code[(int) code];
10047 if (icode == CODE_FOR_nothing
10048 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
10050 /* We can only do this if it is one of the special cases that
10051 can be handled without an scc insn. */
10052 if ((code == LT && integer_zerop (arg1))
10053 || (! only_cheap && code == GE && integer_zerop (arg1)))
10055 else if (BRANCH_COST >= 0
10056 && ! only_cheap && (code == NE || code == EQ)
10057 && TREE_CODE (type) != REAL_TYPE
10058 && ((abs_optab->handlers[(int) operand_mode].insn_code
10059 != CODE_FOR_nothing)
10060 || (ffs_optab->handlers[(int) operand_mode].insn_code
10061 != CODE_FOR_nothing)))
10067 if (! get_subtarget (target)
10068 || GET_MODE (subtarget) != operand_mode
10069 || ! safe_from_p (subtarget, arg1, 1))
10072 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
10073 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
10076 target = gen_reg_rtx (mode);
10078 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10079 because, if the emit_store_flag does anything it will succeed and
10080 OP0 and OP1 will not be used subsequently. */
10082 result = emit_store_flag (target, code,
10083 queued_subexp_p (op0) ? copy_rtx (op0) : op0,
10084 queued_subexp_p (op1) ? copy_rtx (op1) : op1,
10085 operand_mode, unsignedp, 1);
10090 result = expand_binop (mode, xor_optab, result, const1_rtx,
10091 result, 0, OPTAB_LIB_WIDEN);
10095 /* If this failed, we have to do this with set/compare/jump/set code. */
10096 if (GET_CODE (target) != REG
10097 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
10098 target = gen_reg_rtx (GET_MODE (target));
10100 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
10101 result = compare_from_rtx (op0, op1, code, unsignedp,
10102 operand_mode, NULL_RTX);
10103 if (GET_CODE (result) == CONST_INT)
10104 return (((result == const0_rtx && ! invert)
10105 || (result != const0_rtx && invert))
10106 ? const0_rtx : const1_rtx);
10108 /* The code of RESULT may not match CODE if compare_from_rtx
10109 decided to swap its operands and reverse the original code.
10111 We know that compare_from_rtx returns either a CONST_INT or
10112 a new comparison code, so it is safe to just extract the
10113 code from RESULT. */
10114 code = GET_CODE (result);
10116 label = gen_label_rtx ();
10117 if (bcc_gen_fctn[(int) code] == 0)
10120 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
10121 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
10122 emit_label (label);
10128 /* Stubs in case we haven't got a casesi insn. */
10129 #ifndef HAVE_casesi
10130 # define HAVE_casesi 0
10131 # define gen_casesi(a, b, c, d, e) (0)
10132 # define CODE_FOR_casesi CODE_FOR_nothing
10135 /* If the machine does not have a case insn that compares the bounds,
10136 this means extra overhead for dispatch tables, which raises the
10137 threshold for using them. */
10138 #ifndef CASE_VALUES_THRESHOLD
10139 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
10140 #endif /* CASE_VALUES_THRESHOLD */
10143 case_values_threshold ()
10145 return CASE_VALUES_THRESHOLD;
10148 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10149 0 otherwise (i.e. if there is no casesi instruction). */
10151 try_casesi (index_type, index_expr, minval, range,
10152 table_label, default_label)
10153 tree index_type, index_expr, minval, range;
10154 rtx table_label ATTRIBUTE_UNUSED;
10157 enum machine_mode index_mode = SImode;
10158 int index_bits = GET_MODE_BITSIZE (index_mode);
10159 rtx op1, op2, index;
10160 enum machine_mode op_mode;
10165 /* Convert the index to SImode. */
10166 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10168 enum machine_mode omode = TYPE_MODE (index_type);
10169 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
10171 /* We must handle the endpoints in the original mode. */
10172 index_expr = build (MINUS_EXPR, index_type,
10173 index_expr, minval);
10174 minval = integer_zero_node;
10175 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10176 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10177 omode, 1, default_label);
10178 /* Now we can safely truncate. */
10179 index = convert_to_mode (index_mode, index, 0);
10183 if (TYPE_MODE (index_type) != index_mode)
10185 index_expr = convert ((*lang_hooks.types.type_for_size)
10186 (index_bits, 0), index_expr);
10187 index_type = TREE_TYPE (index_expr);
10190 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10193 index = protect_from_queue (index, 0);
10194 do_pending_stack_adjust ();
10196 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10197 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10199 index = copy_to_mode_reg (op_mode, index);
10201 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
10203 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10204 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10205 op1, TREE_UNSIGNED (TREE_TYPE (minval)));
10206 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10208 op1 = copy_to_mode_reg (op_mode, op1);
10210 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
10212 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10213 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10214 op2, TREE_UNSIGNED (TREE_TYPE (range)));
10215 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10217 op2 = copy_to_mode_reg (op_mode, op2);
10219 emit_jump_insn (gen_casesi (index, op1, op2,
10220 table_label, default_label));
10224 /* Attempt to generate a tablejump instruction; same concept. */
10225 #ifndef HAVE_tablejump
10226 #define HAVE_tablejump 0
10227 #define gen_tablejump(x, y) (0)
10230 /* Subroutine of the next function.
10232 INDEX is the value being switched on, with the lowest value
10233 in the table already subtracted.
10234 MODE is its expected mode (needed if INDEX is constant).
10235 RANGE is the length of the jump table.
10236 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10238 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10239 index value is out of range. */
10242 do_tablejump (index, mode, range, table_label, default_label)
10243 rtx index, range, table_label, default_label;
10244 enum machine_mode mode;
10248 if (INTVAL (range) > cfun->max_jumptable_ents)
10249 cfun->max_jumptable_ents = INTVAL (range);
10251 /* Do an unsigned comparison (in the proper mode) between the index
10252 expression and the value which represents the length of the range.
10253 Since we just finished subtracting the lower bound of the range
10254 from the index expression, this comparison allows us to simultaneously
10255 check that the original index expression value is both greater than
10256 or equal to the minimum value of the range and less than or equal to
10257 the maximum value of the range. */
10259 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10262 /* If index is in range, it must fit in Pmode.
10263 Convert to Pmode so we can index with it. */
10265 index = convert_to_mode (Pmode, index, 1);
10267 /* Don't let a MEM slip thru, because then INDEX that comes
10268 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10269 and break_out_memory_refs will go to work on it and mess it up. */
10270 #ifdef PIC_CASE_VECTOR_ADDRESS
10271 if (flag_pic && GET_CODE (index) != REG)
10272 index = copy_to_mode_reg (Pmode, index);
10275 /* If flag_force_addr were to affect this address
10276 it could interfere with the tricky assumptions made
10277 about addresses that contain label-refs,
10278 which may be valid only very near the tablejump itself. */
10279 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10280 GET_MODE_SIZE, because this indicates how large insns are. The other
10281 uses should all be Pmode, because they are addresses. This code
10282 could fail if addresses and insns are not the same size. */
10283 index = gen_rtx_PLUS (Pmode,
10284 gen_rtx_MULT (Pmode, index,
10285 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10286 gen_rtx_LABEL_REF (Pmode, table_label));
10287 #ifdef PIC_CASE_VECTOR_ADDRESS
10289 index = PIC_CASE_VECTOR_ADDRESS (index);
10292 index = memory_address_noforce (CASE_VECTOR_MODE, index);
10293 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10294 vector = gen_rtx_MEM (CASE_VECTOR_MODE, index);
10295 RTX_UNCHANGING_P (vector) = 1;
10296 MEM_NOTRAP_P (vector) = 1;
10297 convert_move (temp, vector, 0);
10299 emit_jump_insn (gen_tablejump (temp, table_label));
10301 /* If we are generating PIC code or if the table is PC-relative, the
10302 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10303 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10308 try_tablejump (index_type, index_expr, minval, range,
10309 table_label, default_label)
10310 tree index_type, index_expr, minval, range;
10311 rtx table_label, default_label;
10315 if (! HAVE_tablejump)
10318 index_expr = fold (build (MINUS_EXPR, index_type,
10319 convert (index_type, index_expr),
10320 convert (index_type, minval)));
10321 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10323 index = protect_from_queue (index, 0);
10324 do_pending_stack_adjust ();
10326 do_tablejump (index, TYPE_MODE (index_type),
10327 convert_modes (TYPE_MODE (index_type),
10328 TYPE_MODE (TREE_TYPE (range)),
10329 expand_expr (range, NULL_RTX,
10331 TREE_UNSIGNED (TREE_TYPE (range))),
10332 table_label, default_label);
10336 /* Nonzero if the mode is a valid vector mode for this architecture.
10337 This returns nonzero even if there is no hardware support for the
10338 vector mode, but we can emulate with narrower modes. */
10341 vector_mode_valid_p (mode)
10342 enum machine_mode mode;
10344 enum mode_class class = GET_MODE_CLASS (mode);
10345 enum machine_mode innermode;
10347 /* Doh! What's going on? */
10348 if (class != MODE_VECTOR_INT
10349 && class != MODE_VECTOR_FLOAT)
10352 /* Hardware support. Woo hoo! */
10353 if (VECTOR_MODE_SUPPORTED_P (mode))
10356 innermode = GET_MODE_INNER (mode);
10358 /* We should probably return 1 if requesting V4DI and we have no DI,
10359 but we have V2DI, but this is probably very unlikely. */
10361 /* If we have support for the inner mode, we can safely emulate it.
10362 We may not have V2DI, but me can emulate with a pair of DIs. */
10363 return mov_optab->handlers[innermode].insn_code != CODE_FOR_nothing;
10366 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10368 const_vector_from_tree (exp)
10374 enum machine_mode inner, mode;
10376 mode = TYPE_MODE (TREE_TYPE (exp));
10378 if (is_zeros_p (exp))
10379 return CONST0_RTX (mode);
10381 units = GET_MODE_NUNITS (mode);
10382 inner = GET_MODE_INNER (mode);
10384 v = rtvec_alloc (units);
10386 link = TREE_VECTOR_CST_ELTS (exp);
10387 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10389 elt = TREE_VALUE (link);
10391 if (TREE_CODE (elt) == REAL_CST)
10392 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10395 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
10396 TREE_INT_CST_HIGH (elt),
10400 return gen_rtx_raw_CONST_VECTOR (mode, v);
10403 #include "gt-expr.h"