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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
30 #include "hard-reg-set.h"
33 #include "insn-flags.h"
34 #include "insn-codes.h"
35 #include "insn-config.h"
36 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
41 #include "typeclass.h"
47 #ifndef ACCUMULATE_OUTGOING_ARGS
48 #define ACCUMULATE_OUTGOING_ARGS 0
51 /* Supply a default definition for PUSH_ARGS. */
54 #define PUSH_ARGS !ACCUMULATE_OUTGOING_ARGS
60 /* Decide whether a function's arguments should be processed
61 from first to last or from last to first.
63 They should if the stack and args grow in opposite directions, but
64 only if we have push insns. */
68 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
69 #define PUSH_ARGS_REVERSED /* If it's last to first. */
74 #ifndef STACK_PUSH_CODE
75 #ifdef STACK_GROWS_DOWNWARD
76 #define STACK_PUSH_CODE PRE_DEC
78 #define STACK_PUSH_CODE PRE_INC
82 /* Assume that case vectors are not pc-relative. */
83 #ifndef CASE_VECTOR_PC_RELATIVE
84 #define CASE_VECTOR_PC_RELATIVE 0
87 /* Hook called by safe_from_p for language-specific tree codes. It is
88 up to the language front-end to install a hook if it has any such
89 codes that safe_from_p needs to know about. Since same_from_p will
90 recursively explore the TREE_OPERANDs of an expression, this hook
91 should not reexamine those pieces. This routine may recursively
92 call safe_from_p; it should always pass `0' as the TOP_P
94 int (*lang_safe_from_p) PARAMS ((rtx, tree));
96 /* If this is nonzero, we do not bother generating VOLATILE
97 around volatile memory references, and we are willing to
98 output indirect addresses. If cse is to follow, we reject
99 indirect addresses so a useful potential cse is generated;
100 if it is used only once, instruction combination will produce
101 the same indirect address eventually. */
102 int cse_not_expected;
104 /* Don't check memory usage, since code is being emitted to check a memory
105 usage. Used when current_function_check_memory_usage is true, to avoid
106 infinite recursion. */
107 static int in_check_memory_usage;
109 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
110 static tree placeholder_list = 0;
112 /* This structure is used by move_by_pieces to describe the move to
114 struct move_by_pieces
123 int explicit_inc_from;
124 unsigned HOST_WIDE_INT len;
125 HOST_WIDE_INT offset;
129 /* This structure is used by store_by_pieces to describe the clear to
132 struct store_by_pieces
138 unsigned HOST_WIDE_INT len;
139 HOST_WIDE_INT offset;
140 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
145 extern struct obstack permanent_obstack;
147 static rtx get_push_address PARAMS ((int));
149 static rtx enqueue_insn PARAMS ((rtx, rtx));
150 static unsigned HOST_WIDE_INT move_by_pieces_ninsns
151 PARAMS ((unsigned HOST_WIDE_INT,
153 static void move_by_pieces_1 PARAMS ((rtx (*) (rtx, ...), enum machine_mode,
154 struct move_by_pieces *));
155 static rtx clear_by_pieces_1 PARAMS ((PTR, HOST_WIDE_INT,
157 static void clear_by_pieces PARAMS ((rtx, unsigned HOST_WIDE_INT,
159 static void store_by_pieces_1 PARAMS ((struct store_by_pieces *,
161 static void store_by_pieces_2 PARAMS ((rtx (*) (rtx, ...),
163 struct store_by_pieces *));
164 static rtx get_subtarget PARAMS ((rtx));
165 static int is_zeros_p PARAMS ((tree));
166 static int mostly_zeros_p PARAMS ((tree));
167 static void store_constructor_field PARAMS ((rtx, unsigned HOST_WIDE_INT,
168 HOST_WIDE_INT, enum machine_mode,
169 tree, tree, unsigned int, int,
171 static void store_constructor PARAMS ((tree, rtx, unsigned int, int,
173 static rtx store_field PARAMS ((rtx, HOST_WIDE_INT,
174 HOST_WIDE_INT, enum machine_mode,
175 tree, enum machine_mode, int,
176 unsigned int, HOST_WIDE_INT, int));
177 static enum memory_use_mode
178 get_memory_usage_from_modifier PARAMS ((enum expand_modifier));
179 static tree save_noncopied_parts PARAMS ((tree, tree));
180 static tree init_noncopied_parts PARAMS ((tree, tree));
181 static int fixed_type_p PARAMS ((tree));
182 static rtx var_rtx PARAMS ((tree));
183 static rtx expand_expr_unaligned PARAMS ((tree, unsigned int *));
184 static rtx expand_increment PARAMS ((tree, int, int));
185 static void do_jump_by_parts_greater PARAMS ((tree, int, rtx, rtx));
186 static void do_jump_by_parts_equality PARAMS ((tree, rtx, rtx));
187 static void do_compare_and_jump PARAMS ((tree, enum rtx_code, enum rtx_code,
189 static rtx do_store_flag PARAMS ((tree, rtx, enum machine_mode, int));
191 /* Record for each mode whether we can move a register directly to or
192 from an object of that mode in memory. If we can't, we won't try
193 to use that mode directly when accessing a field of that mode. */
195 static char direct_load[NUM_MACHINE_MODES];
196 static char direct_store[NUM_MACHINE_MODES];
198 /* If a memory-to-memory move would take MOVE_RATIO or more simple
199 move-instruction sequences, we will do a movstr or libcall instead. */
202 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
205 /* If we are optimizing for space (-Os), cut down the default move ratio. */
206 #define MOVE_RATIO (optimize_size ? 3 : 15)
210 /* This macro is used to determine whether move_by_pieces should be called
211 to perform a structure copy. */
212 #ifndef MOVE_BY_PIECES_P
213 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
214 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) MOVE_RATIO)
217 /* This array records the insn_code of insns to perform block moves. */
218 enum insn_code movstr_optab[NUM_MACHINE_MODES];
220 /* This array records the insn_code of insns to perform block clears. */
221 enum insn_code clrstr_optab[NUM_MACHINE_MODES];
223 /* SLOW_UNALIGNED_ACCESS is non-zero if unaligned accesses are very slow. */
225 #ifndef SLOW_UNALIGNED_ACCESS
226 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
229 /* This is run once per compilation to set up which modes can be used
230 directly in memory and to initialize the block move optab. */
236 enum machine_mode mode;
242 /* Try indexing by frame ptr and try by stack ptr.
243 It is known that on the Convex the stack ptr isn't a valid index.
244 With luck, one or the other is valid on any machine. */
245 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
246 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
248 insn = emit_insn (gen_rtx_SET (0, NULL_RTX, NULL_RTX));
249 pat = PATTERN (insn);
251 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
252 mode = (enum machine_mode) ((int) mode + 1))
257 direct_load[(int) mode] = direct_store[(int) mode] = 0;
258 PUT_MODE (mem, mode);
259 PUT_MODE (mem1, mode);
261 /* See if there is some register that can be used in this mode and
262 directly loaded or stored from memory. */
264 if (mode != VOIDmode && mode != BLKmode)
265 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
266 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
269 if (! HARD_REGNO_MODE_OK (regno, mode))
272 reg = gen_rtx_REG (mode, regno);
275 SET_DEST (pat) = reg;
276 if (recog (pat, insn, &num_clobbers) >= 0)
277 direct_load[(int) mode] = 1;
279 SET_SRC (pat) = mem1;
280 SET_DEST (pat) = reg;
281 if (recog (pat, insn, &num_clobbers) >= 0)
282 direct_load[(int) mode] = 1;
285 SET_DEST (pat) = mem;
286 if (recog (pat, insn, &num_clobbers) >= 0)
287 direct_store[(int) mode] = 1;
290 SET_DEST (pat) = mem1;
291 if (recog (pat, insn, &num_clobbers) >= 0)
292 direct_store[(int) mode] = 1;
299 /* This is run at the start of compiling a function. */
304 cfun->expr = (struct expr_status *) xmalloc (sizeof (struct expr_status));
307 pending_stack_adjust = 0;
308 stack_pointer_delta = 0;
309 inhibit_defer_pop = 0;
311 apply_args_value = 0;
317 struct expr_status *p;
322 ggc_mark_rtx (p->x_saveregs_value);
323 ggc_mark_rtx (p->x_apply_args_value);
324 ggc_mark_rtx (p->x_forced_labels);
335 /* Small sanity check that the queue is empty at the end of a function. */
338 finish_expr_for_function ()
344 /* Manage the queue of increment instructions to be output
345 for POSTINCREMENT_EXPR expressions, etc. */
347 /* Queue up to increment (or change) VAR later. BODY says how:
348 BODY should be the same thing you would pass to emit_insn
349 to increment right away. It will go to emit_insn later on.
351 The value is a QUEUED expression to be used in place of VAR
352 where you want to guarantee the pre-incrementation value of VAR. */
355 enqueue_insn (var, body)
358 pending_chain = gen_rtx_QUEUED (GET_MODE (var), var, NULL_RTX, NULL_RTX,
359 body, pending_chain);
360 return pending_chain;
363 /* Use protect_from_queue to convert a QUEUED expression
364 into something that you can put immediately into an instruction.
365 If the queued incrementation has not happened yet,
366 protect_from_queue returns the variable itself.
367 If the incrementation has happened, protect_from_queue returns a temp
368 that contains a copy of the old value of the variable.
370 Any time an rtx which might possibly be a QUEUED is to be put
371 into an instruction, it must be passed through protect_from_queue first.
372 QUEUED expressions are not meaningful in instructions.
374 Do not pass a value through protect_from_queue and then hold
375 on to it for a while before putting it in an instruction!
376 If the queue is flushed in between, incorrect code will result. */
379 protect_from_queue (x, modify)
383 register RTX_CODE code = GET_CODE (x);
385 #if 0 /* A QUEUED can hang around after the queue is forced out. */
386 /* Shortcut for most common case. */
387 if (pending_chain == 0)
393 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
394 use of autoincrement. Make a copy of the contents of the memory
395 location rather than a copy of the address, but not if the value is
396 of mode BLKmode. Don't modify X in place since it might be
398 if (code == MEM && GET_MODE (x) != BLKmode
399 && GET_CODE (XEXP (x, 0)) == QUEUED && !modify)
401 register rtx y = XEXP (x, 0);
402 register rtx new = gen_rtx_MEM (GET_MODE (x), QUEUED_VAR (y));
404 MEM_COPY_ATTRIBUTES (new, x);
408 register rtx temp = gen_reg_rtx (GET_MODE (new));
409 emit_insn_before (gen_move_insn (temp, new),
415 /* Otherwise, recursively protect the subexpressions of all
416 the kinds of rtx's that can contain a QUEUED. */
419 rtx tem = protect_from_queue (XEXP (x, 0), 0);
420 if (tem != XEXP (x, 0))
426 else if (code == PLUS || code == MULT)
428 rtx new0 = protect_from_queue (XEXP (x, 0), 0);
429 rtx new1 = protect_from_queue (XEXP (x, 1), 0);
430 if (new0 != XEXP (x, 0) || new1 != XEXP (x, 1))
439 /* If the increment has not happened, use the variable itself. */
440 if (QUEUED_INSN (x) == 0)
441 return QUEUED_VAR (x);
442 /* If the increment has happened and a pre-increment copy exists,
444 if (QUEUED_COPY (x) != 0)
445 return QUEUED_COPY (x);
446 /* The increment has happened but we haven't set up a pre-increment copy.
447 Set one up now, and use it. */
448 QUEUED_COPY (x) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x)));
449 emit_insn_before (gen_move_insn (QUEUED_COPY (x), QUEUED_VAR (x)),
451 return QUEUED_COPY (x);
454 /* Return nonzero if X contains a QUEUED expression:
455 if it contains anything that will be altered by a queued increment.
456 We handle only combinations of MEM, PLUS, MINUS and MULT operators
457 since memory addresses generally contain only those. */
463 register enum rtx_code code = GET_CODE (x);
469 return queued_subexp_p (XEXP (x, 0));
473 return (queued_subexp_p (XEXP (x, 0))
474 || queued_subexp_p (XEXP (x, 1)));
480 /* Perform all the pending incrementations. */
486 while ((p = pending_chain))
488 rtx body = QUEUED_BODY (p);
490 if (GET_CODE (body) == SEQUENCE)
492 QUEUED_INSN (p) = XVECEXP (QUEUED_BODY (p), 0, 0);
493 emit_insn (QUEUED_BODY (p));
496 QUEUED_INSN (p) = emit_insn (QUEUED_BODY (p));
497 pending_chain = QUEUED_NEXT (p);
501 /* Copy data from FROM to TO, where the machine modes are not the same.
502 Both modes may be integer, or both may be floating.
503 UNSIGNEDP should be nonzero if FROM is an unsigned type.
504 This causes zero-extension instead of sign-extension. */
507 convert_move (to, from, unsignedp)
508 register rtx to, from;
511 enum machine_mode to_mode = GET_MODE (to);
512 enum machine_mode from_mode = GET_MODE (from);
513 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
514 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
518 /* rtx code for making an equivalent value. */
519 enum rtx_code equiv_code = (unsignedp ? ZERO_EXTEND : SIGN_EXTEND);
521 to = protect_from_queue (to, 1);
522 from = protect_from_queue (from, 0);
524 if (to_real != from_real)
527 /* If FROM is a SUBREG that indicates that we have already done at least
528 the required extension, strip it. We don't handle such SUBREGs as
531 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
532 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
533 >= GET_MODE_SIZE (to_mode))
534 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
535 from = gen_lowpart (to_mode, from), from_mode = to_mode;
537 if (GET_CODE (to) == SUBREG && SUBREG_PROMOTED_VAR_P (to))
540 if (to_mode == from_mode
541 || (from_mode == VOIDmode && CONSTANT_P (from)))
543 emit_move_insn (to, from);
547 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
549 if (GET_MODE_BITSIZE (from_mode) != GET_MODE_BITSIZE (to_mode))
552 if (VECTOR_MODE_P (to_mode))
553 from = gen_rtx_SUBREG (to_mode, from, 0);
555 to = gen_rtx_SUBREG (from_mode, to, 0);
557 emit_move_insn (to, from);
561 if (to_real != from_real)
568 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode))
570 /* Try converting directly if the insn is supported. */
571 if ((code = can_extend_p (to_mode, from_mode, 0))
574 emit_unop_insn (code, to, from, UNKNOWN);
579 #ifdef HAVE_trunchfqf2
580 if (HAVE_trunchfqf2 && from_mode == HFmode && to_mode == QFmode)
582 emit_unop_insn (CODE_FOR_trunchfqf2, to, from, UNKNOWN);
586 #ifdef HAVE_trunctqfqf2
587 if (HAVE_trunctqfqf2 && from_mode == TQFmode && to_mode == QFmode)
589 emit_unop_insn (CODE_FOR_trunctqfqf2, to, from, UNKNOWN);
593 #ifdef HAVE_truncsfqf2
594 if (HAVE_truncsfqf2 && from_mode == SFmode && to_mode == QFmode)
596 emit_unop_insn (CODE_FOR_truncsfqf2, to, from, UNKNOWN);
600 #ifdef HAVE_truncdfqf2
601 if (HAVE_truncdfqf2 && from_mode == DFmode && to_mode == QFmode)
603 emit_unop_insn (CODE_FOR_truncdfqf2, to, from, UNKNOWN);
607 #ifdef HAVE_truncxfqf2
608 if (HAVE_truncxfqf2 && from_mode == XFmode && to_mode == QFmode)
610 emit_unop_insn (CODE_FOR_truncxfqf2, to, from, UNKNOWN);
614 #ifdef HAVE_trunctfqf2
615 if (HAVE_trunctfqf2 && from_mode == TFmode && to_mode == QFmode)
617 emit_unop_insn (CODE_FOR_trunctfqf2, to, from, UNKNOWN);
622 #ifdef HAVE_trunctqfhf2
623 if (HAVE_trunctqfhf2 && from_mode == TQFmode && to_mode == HFmode)
625 emit_unop_insn (CODE_FOR_trunctqfhf2, to, from, UNKNOWN);
629 #ifdef HAVE_truncsfhf2
630 if (HAVE_truncsfhf2 && from_mode == SFmode && to_mode == HFmode)
632 emit_unop_insn (CODE_FOR_truncsfhf2, to, from, UNKNOWN);
636 #ifdef HAVE_truncdfhf2
637 if (HAVE_truncdfhf2 && from_mode == DFmode && to_mode == HFmode)
639 emit_unop_insn (CODE_FOR_truncdfhf2, to, from, UNKNOWN);
643 #ifdef HAVE_truncxfhf2
644 if (HAVE_truncxfhf2 && from_mode == XFmode && to_mode == HFmode)
646 emit_unop_insn (CODE_FOR_truncxfhf2, to, from, UNKNOWN);
650 #ifdef HAVE_trunctfhf2
651 if (HAVE_trunctfhf2 && from_mode == TFmode && to_mode == HFmode)
653 emit_unop_insn (CODE_FOR_trunctfhf2, to, from, UNKNOWN);
658 #ifdef HAVE_truncsftqf2
659 if (HAVE_truncsftqf2 && from_mode == SFmode && to_mode == TQFmode)
661 emit_unop_insn (CODE_FOR_truncsftqf2, to, from, UNKNOWN);
665 #ifdef HAVE_truncdftqf2
666 if (HAVE_truncdftqf2 && from_mode == DFmode && to_mode == TQFmode)
668 emit_unop_insn (CODE_FOR_truncdftqf2, to, from, UNKNOWN);
672 #ifdef HAVE_truncxftqf2
673 if (HAVE_truncxftqf2 && from_mode == XFmode && to_mode == TQFmode)
675 emit_unop_insn (CODE_FOR_truncxftqf2, to, from, UNKNOWN);
679 #ifdef HAVE_trunctftqf2
680 if (HAVE_trunctftqf2 && from_mode == TFmode && to_mode == TQFmode)
682 emit_unop_insn (CODE_FOR_trunctftqf2, to, from, UNKNOWN);
687 #ifdef HAVE_truncdfsf2
688 if (HAVE_truncdfsf2 && from_mode == DFmode && to_mode == SFmode)
690 emit_unop_insn (CODE_FOR_truncdfsf2, to, from, UNKNOWN);
694 #ifdef HAVE_truncxfsf2
695 if (HAVE_truncxfsf2 && from_mode == XFmode && to_mode == SFmode)
697 emit_unop_insn (CODE_FOR_truncxfsf2, to, from, UNKNOWN);
701 #ifdef HAVE_trunctfsf2
702 if (HAVE_trunctfsf2 && from_mode == TFmode && to_mode == SFmode)
704 emit_unop_insn (CODE_FOR_trunctfsf2, to, from, UNKNOWN);
708 #ifdef HAVE_truncxfdf2
709 if (HAVE_truncxfdf2 && from_mode == XFmode && to_mode == DFmode)
711 emit_unop_insn (CODE_FOR_truncxfdf2, to, from, UNKNOWN);
715 #ifdef HAVE_trunctfdf2
716 if (HAVE_trunctfdf2 && from_mode == TFmode && to_mode == DFmode)
718 emit_unop_insn (CODE_FOR_trunctfdf2, to, from, UNKNOWN);
730 libcall = extendsfdf2_libfunc;
734 libcall = extendsfxf2_libfunc;
738 libcall = extendsftf2_libfunc;
750 libcall = truncdfsf2_libfunc;
754 libcall = extenddfxf2_libfunc;
758 libcall = extenddftf2_libfunc;
770 libcall = truncxfsf2_libfunc;
774 libcall = truncxfdf2_libfunc;
786 libcall = trunctfsf2_libfunc;
790 libcall = trunctfdf2_libfunc;
802 if (libcall == (rtx) 0)
803 /* This conversion is not implemented yet. */
807 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
809 insns = get_insns ();
811 emit_libcall_block (insns, to, value, gen_rtx_FLOAT_TRUNCATE (to_mode,
816 /* Now both modes are integers. */
818 /* Handle expanding beyond a word. */
819 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
820 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
827 enum machine_mode lowpart_mode;
828 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
830 /* Try converting directly if the insn is supported. */
831 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
834 /* If FROM is a SUBREG, put it into a register. Do this
835 so that we always generate the same set of insns for
836 better cse'ing; if an intermediate assignment occurred,
837 we won't be doing the operation directly on the SUBREG. */
838 if (optimize > 0 && GET_CODE (from) == SUBREG)
839 from = force_reg (from_mode, from);
840 emit_unop_insn (code, to, from, equiv_code);
843 /* Next, try converting via full word. */
844 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
845 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
846 != CODE_FOR_nothing))
848 if (GET_CODE (to) == REG)
849 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
850 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
851 emit_unop_insn (code, to,
852 gen_lowpart (word_mode, to), equiv_code);
856 /* No special multiword conversion insn; do it by hand. */
859 /* Since we will turn this into a no conflict block, we must ensure
860 that the source does not overlap the target. */
862 if (reg_overlap_mentioned_p (to, from))
863 from = force_reg (from_mode, from);
865 /* Get a copy of FROM widened to a word, if necessary. */
866 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
867 lowpart_mode = word_mode;
869 lowpart_mode = from_mode;
871 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
873 lowpart = gen_lowpart (lowpart_mode, to);
874 emit_move_insn (lowpart, lowfrom);
876 /* Compute the value to put in each remaining word. */
878 fill_value = const0_rtx;
883 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
884 && STORE_FLAG_VALUE == -1)
886 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
888 fill_value = gen_reg_rtx (word_mode);
889 emit_insn (gen_slt (fill_value));
895 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
896 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
898 fill_value = convert_to_mode (word_mode, fill_value, 1);
902 /* Fill the remaining words. */
903 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
905 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
906 rtx subword = operand_subword (to, index, 1, to_mode);
911 if (fill_value != subword)
912 emit_move_insn (subword, fill_value);
915 insns = get_insns ();
918 emit_no_conflict_block (insns, to, from, NULL_RTX,
919 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
923 /* Truncating multi-word to a word or less. */
924 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
925 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
927 if (!((GET_CODE (from) == MEM
928 && ! MEM_VOLATILE_P (from)
929 && direct_load[(int) to_mode]
930 && ! mode_dependent_address_p (XEXP (from, 0)))
931 || GET_CODE (from) == REG
932 || GET_CODE (from) == SUBREG))
933 from = force_reg (from_mode, from);
934 convert_move (to, gen_lowpart (word_mode, from), 0);
938 /* Handle pointer conversion. */ /* SPEE 900220. */
939 if (to_mode == PQImode)
941 if (from_mode != QImode)
942 from = convert_to_mode (QImode, from, unsignedp);
944 #ifdef HAVE_truncqipqi2
945 if (HAVE_truncqipqi2)
947 emit_unop_insn (CODE_FOR_truncqipqi2, to, from, UNKNOWN);
950 #endif /* HAVE_truncqipqi2 */
954 if (from_mode == PQImode)
956 if (to_mode != QImode)
958 from = convert_to_mode (QImode, from, unsignedp);
963 #ifdef HAVE_extendpqiqi2
964 if (HAVE_extendpqiqi2)
966 emit_unop_insn (CODE_FOR_extendpqiqi2, to, from, UNKNOWN);
969 #endif /* HAVE_extendpqiqi2 */
974 if (to_mode == PSImode)
976 if (from_mode != SImode)
977 from = convert_to_mode (SImode, from, unsignedp);
979 #ifdef HAVE_truncsipsi2
980 if (HAVE_truncsipsi2)
982 emit_unop_insn (CODE_FOR_truncsipsi2, to, from, UNKNOWN);
985 #endif /* HAVE_truncsipsi2 */
989 if (from_mode == PSImode)
991 if (to_mode != SImode)
993 from = convert_to_mode (SImode, from, unsignedp);
998 #ifdef HAVE_extendpsisi2
999 if (! unsignedp && HAVE_extendpsisi2)
1001 emit_unop_insn (CODE_FOR_extendpsisi2, to, from, UNKNOWN);
1004 #endif /* HAVE_extendpsisi2 */
1005 #ifdef HAVE_zero_extendpsisi2
1006 if (unsignedp && HAVE_zero_extendpsisi2)
1008 emit_unop_insn (CODE_FOR_zero_extendpsisi2, to, from, UNKNOWN);
1011 #endif /* HAVE_zero_extendpsisi2 */
1016 if (to_mode == PDImode)
1018 if (from_mode != DImode)
1019 from = convert_to_mode (DImode, from, unsignedp);
1021 #ifdef HAVE_truncdipdi2
1022 if (HAVE_truncdipdi2)
1024 emit_unop_insn (CODE_FOR_truncdipdi2, to, from, UNKNOWN);
1027 #endif /* HAVE_truncdipdi2 */
1031 if (from_mode == PDImode)
1033 if (to_mode != DImode)
1035 from = convert_to_mode (DImode, from, unsignedp);
1040 #ifdef HAVE_extendpdidi2
1041 if (HAVE_extendpdidi2)
1043 emit_unop_insn (CODE_FOR_extendpdidi2, to, from, UNKNOWN);
1046 #endif /* HAVE_extendpdidi2 */
1051 /* Now follow all the conversions between integers
1052 no more than a word long. */
1054 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1055 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
1056 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1057 GET_MODE_BITSIZE (from_mode)))
1059 if (!((GET_CODE (from) == MEM
1060 && ! MEM_VOLATILE_P (from)
1061 && direct_load[(int) to_mode]
1062 && ! mode_dependent_address_p (XEXP (from, 0)))
1063 || GET_CODE (from) == REG
1064 || GET_CODE (from) == SUBREG))
1065 from = force_reg (from_mode, from);
1066 if (GET_CODE (from) == REG && REGNO (from) < FIRST_PSEUDO_REGISTER
1067 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
1068 from = copy_to_reg (from);
1069 emit_move_insn (to, gen_lowpart (to_mode, from));
1073 /* Handle extension. */
1074 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
1076 /* Convert directly if that works. */
1077 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
1078 != CODE_FOR_nothing)
1080 emit_unop_insn (code, to, from, equiv_code);
1085 enum machine_mode intermediate;
1089 /* Search for a mode to convert via. */
1090 for (intermediate = from_mode; intermediate != VOIDmode;
1091 intermediate = GET_MODE_WIDER_MODE (intermediate))
1092 if (((can_extend_p (to_mode, intermediate, unsignedp)
1093 != CODE_FOR_nothing)
1094 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
1095 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1096 GET_MODE_BITSIZE (intermediate))))
1097 && (can_extend_p (intermediate, from_mode, unsignedp)
1098 != CODE_FOR_nothing))
1100 convert_move (to, convert_to_mode (intermediate, from,
1101 unsignedp), unsignedp);
1105 /* No suitable intermediate mode.
1106 Generate what we need with shifts. */
1107 shift_amount = build_int_2 (GET_MODE_BITSIZE (to_mode)
1108 - GET_MODE_BITSIZE (from_mode), 0);
1109 from = gen_lowpart (to_mode, force_reg (from_mode, from));
1110 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
1112 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
1115 emit_move_insn (to, tmp);
1120 /* Support special truncate insns for certain modes. */
1122 if (from_mode == DImode && to_mode == SImode)
1124 #ifdef HAVE_truncdisi2
1125 if (HAVE_truncdisi2)
1127 emit_unop_insn (CODE_FOR_truncdisi2, to, from, UNKNOWN);
1131 convert_move (to, force_reg (from_mode, from), unsignedp);
1135 if (from_mode == DImode && to_mode == HImode)
1137 #ifdef HAVE_truncdihi2
1138 if (HAVE_truncdihi2)
1140 emit_unop_insn (CODE_FOR_truncdihi2, to, from, UNKNOWN);
1144 convert_move (to, force_reg (from_mode, from), unsignedp);
1148 if (from_mode == DImode && to_mode == QImode)
1150 #ifdef HAVE_truncdiqi2
1151 if (HAVE_truncdiqi2)
1153 emit_unop_insn (CODE_FOR_truncdiqi2, to, from, UNKNOWN);
1157 convert_move (to, force_reg (from_mode, from), unsignedp);
1161 if (from_mode == SImode && to_mode == HImode)
1163 #ifdef HAVE_truncsihi2
1164 if (HAVE_truncsihi2)
1166 emit_unop_insn (CODE_FOR_truncsihi2, to, from, UNKNOWN);
1170 convert_move (to, force_reg (from_mode, from), unsignedp);
1174 if (from_mode == SImode && to_mode == QImode)
1176 #ifdef HAVE_truncsiqi2
1177 if (HAVE_truncsiqi2)
1179 emit_unop_insn (CODE_FOR_truncsiqi2, to, from, UNKNOWN);
1183 convert_move (to, force_reg (from_mode, from), unsignedp);
1187 if (from_mode == HImode && to_mode == QImode)
1189 #ifdef HAVE_trunchiqi2
1190 if (HAVE_trunchiqi2)
1192 emit_unop_insn (CODE_FOR_trunchiqi2, to, from, UNKNOWN);
1196 convert_move (to, force_reg (from_mode, from), unsignedp);
1200 if (from_mode == TImode && to_mode == DImode)
1202 #ifdef HAVE_trunctidi2
1203 if (HAVE_trunctidi2)
1205 emit_unop_insn (CODE_FOR_trunctidi2, to, from, UNKNOWN);
1209 convert_move (to, force_reg (from_mode, from), unsignedp);
1213 if (from_mode == TImode && to_mode == SImode)
1215 #ifdef HAVE_trunctisi2
1216 if (HAVE_trunctisi2)
1218 emit_unop_insn (CODE_FOR_trunctisi2, to, from, UNKNOWN);
1222 convert_move (to, force_reg (from_mode, from), unsignedp);
1226 if (from_mode == TImode && to_mode == HImode)
1228 #ifdef HAVE_trunctihi2
1229 if (HAVE_trunctihi2)
1231 emit_unop_insn (CODE_FOR_trunctihi2, to, from, UNKNOWN);
1235 convert_move (to, force_reg (from_mode, from), unsignedp);
1239 if (from_mode == TImode && to_mode == QImode)
1241 #ifdef HAVE_trunctiqi2
1242 if (HAVE_trunctiqi2)
1244 emit_unop_insn (CODE_FOR_trunctiqi2, to, from, UNKNOWN);
1248 convert_move (to, force_reg (from_mode, from), unsignedp);
1252 /* Handle truncation of volatile memrefs, and so on;
1253 the things that couldn't be truncated directly,
1254 and for which there was no special instruction. */
1255 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
1257 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
1258 emit_move_insn (to, temp);
1262 /* Mode combination is not recognized. */
1266 /* Return an rtx for a value that would result
1267 from converting X to mode MODE.
1268 Both X and MODE may be floating, or both integer.
1269 UNSIGNEDP is nonzero if X is an unsigned value.
1270 This can be done by referring to a part of X in place
1271 or by copying to a new temporary with conversion.
1273 This function *must not* call protect_from_queue
1274 except when putting X into an insn (in which case convert_move does it). */
1277 convert_to_mode (mode, x, unsignedp)
1278 enum machine_mode mode;
1282 return convert_modes (mode, VOIDmode, x, unsignedp);
1285 /* Return an rtx for a value that would result
1286 from converting X from mode OLDMODE to mode MODE.
1287 Both modes may be floating, or both integer.
1288 UNSIGNEDP is nonzero if X is an unsigned value.
1290 This can be done by referring to a part of X in place
1291 or by copying to a new temporary with conversion.
1293 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1295 This function *must not* call protect_from_queue
1296 except when putting X into an insn (in which case convert_move does it). */
1299 convert_modes (mode, oldmode, x, unsignedp)
1300 enum machine_mode mode, oldmode;
1306 /* If FROM is a SUBREG that indicates that we have already done at least
1307 the required extension, strip it. */
1309 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
1310 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
1311 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
1312 x = gen_lowpart (mode, x);
1314 if (GET_MODE (x) != VOIDmode)
1315 oldmode = GET_MODE (x);
1317 if (mode == oldmode)
1320 /* There is one case that we must handle specially: If we are converting
1321 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1322 we are to interpret the constant as unsigned, gen_lowpart will do
1323 the wrong if the constant appears negative. What we want to do is
1324 make the high-order word of the constant zero, not all ones. */
1326 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
1327 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
1328 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
1330 HOST_WIDE_INT val = INTVAL (x);
1332 if (oldmode != VOIDmode
1333 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
1335 int width = GET_MODE_BITSIZE (oldmode);
1337 /* We need to zero extend VAL. */
1338 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1341 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
1344 /* We can do this with a gen_lowpart if both desired and current modes
1345 are integer, and this is either a constant integer, a register, or a
1346 non-volatile MEM. Except for the constant case where MODE is no
1347 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1349 if ((GET_CODE (x) == CONST_INT
1350 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
1351 || (GET_MODE_CLASS (mode) == MODE_INT
1352 && GET_MODE_CLASS (oldmode) == MODE_INT
1353 && (GET_CODE (x) == CONST_DOUBLE
1354 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
1355 && ((GET_CODE (x) == MEM && ! MEM_VOLATILE_P (x)
1356 && direct_load[(int) mode])
1357 || (GET_CODE (x) == REG
1358 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1359 GET_MODE_BITSIZE (GET_MODE (x)))))))))
1361 /* ?? If we don't know OLDMODE, we have to assume here that
1362 X does not need sign- or zero-extension. This may not be
1363 the case, but it's the best we can do. */
1364 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
1365 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
1367 HOST_WIDE_INT val = INTVAL (x);
1368 int width = GET_MODE_BITSIZE (oldmode);
1370 /* We must sign or zero-extend in this case. Start by
1371 zero-extending, then sign extend if we need to. */
1372 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1374 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
1375 val |= (HOST_WIDE_INT) (-1) << width;
1377 return GEN_INT (val);
1380 return gen_lowpart (mode, x);
1383 temp = gen_reg_rtx (mode);
1384 convert_move (temp, x, unsignedp);
1388 /* This macro is used to determine what the largest unit size that
1389 move_by_pieces can use is. */
1391 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1392 move efficiently, as opposed to MOVE_MAX which is the maximum
1393 number of bytes we can move with a single instruction. */
1395 #ifndef MOVE_MAX_PIECES
1396 #define MOVE_MAX_PIECES MOVE_MAX
1399 /* Generate several move instructions to copy LEN bytes
1400 from block FROM to block TO. (These are MEM rtx's with BLKmode).
1401 The caller must pass FROM and TO
1402 through protect_from_queue before calling.
1403 ALIGN is maximum alignment we can assume. */
1406 move_by_pieces (to, from, len, align)
1408 unsigned HOST_WIDE_INT len;
1411 struct move_by_pieces data;
1412 rtx to_addr = XEXP (to, 0), from_addr = XEXP (from, 0);
1413 unsigned int max_size = MOVE_MAX_PIECES + 1;
1414 enum machine_mode mode = VOIDmode, tmode;
1415 enum insn_code icode;
1418 data.to_addr = to_addr;
1419 data.from_addr = from_addr;
1423 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
1424 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
1426 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
1427 || GET_CODE (from_addr) == POST_INC
1428 || GET_CODE (from_addr) == POST_DEC);
1430 data.explicit_inc_from = 0;
1431 data.explicit_inc_to = 0;
1433 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
1434 if (data.reverse) data.offset = len;
1437 /* If copying requires more than two move insns,
1438 copy addresses to registers (to make displacements shorter)
1439 and use post-increment if available. */
1440 if (!(data.autinc_from && data.autinc_to)
1441 && move_by_pieces_ninsns (len, align) > 2)
1443 /* Find the mode of the largest move... */
1444 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1445 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1446 if (GET_MODE_SIZE (tmode) < max_size)
1449 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
1451 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
1452 data.autinc_from = 1;
1453 data.explicit_inc_from = -1;
1455 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
1457 data.from_addr = copy_addr_to_reg (from_addr);
1458 data.autinc_from = 1;
1459 data.explicit_inc_from = 1;
1461 if (!data.autinc_from && CONSTANT_P (from_addr))
1462 data.from_addr = copy_addr_to_reg (from_addr);
1463 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
1465 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
1467 data.explicit_inc_to = -1;
1469 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
1471 data.to_addr = copy_addr_to_reg (to_addr);
1473 data.explicit_inc_to = 1;
1475 if (!data.autinc_to && CONSTANT_P (to_addr))
1476 data.to_addr = copy_addr_to_reg (to_addr);
1479 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1480 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1481 align = MOVE_MAX * BITS_PER_UNIT;
1483 /* First move what we can in the largest integer mode, then go to
1484 successively smaller modes. */
1486 while (max_size > 1)
1488 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1489 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1490 if (GET_MODE_SIZE (tmode) < max_size)
1493 if (mode == VOIDmode)
1496 icode = mov_optab->handlers[(int) mode].insn_code;
1497 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1498 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1500 max_size = GET_MODE_SIZE (mode);
1503 /* The code above should have handled everything. */
1508 /* Return number of insns required to move L bytes by pieces.
1509 ALIGN (in bytes) is maximum alignment we can assume. */
1511 static unsigned HOST_WIDE_INT
1512 move_by_pieces_ninsns (l, align)
1513 unsigned HOST_WIDE_INT l;
1516 unsigned HOST_WIDE_INT n_insns = 0;
1517 unsigned HOST_WIDE_INT max_size = MOVE_MAX + 1;
1519 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1520 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1521 align = MOVE_MAX * BITS_PER_UNIT;
1523 while (max_size > 1)
1525 enum machine_mode mode = VOIDmode, tmode;
1526 enum insn_code icode;
1528 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1529 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1530 if (GET_MODE_SIZE (tmode) < max_size)
1533 if (mode == VOIDmode)
1536 icode = mov_optab->handlers[(int) mode].insn_code;
1537 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1538 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1540 max_size = GET_MODE_SIZE (mode);
1548 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1549 with move instructions for mode MODE. GENFUN is the gen_... function
1550 to make a move insn for that mode. DATA has all the other info. */
1553 move_by_pieces_1 (genfun, mode, data)
1554 rtx (*genfun) PARAMS ((rtx, ...));
1555 enum machine_mode mode;
1556 struct move_by_pieces *data;
1558 unsigned int size = GET_MODE_SIZE (mode);
1561 while (data->len >= size)
1564 data->offset -= size;
1566 if (data->autinc_to)
1568 to1 = gen_rtx_MEM (mode, data->to_addr);
1569 MEM_COPY_ATTRIBUTES (to1, data->to);
1572 to1 = change_address (data->to, mode,
1573 plus_constant (data->to_addr, data->offset));
1575 if (data->autinc_from)
1577 from1 = gen_rtx_MEM (mode, data->from_addr);
1578 MEM_COPY_ATTRIBUTES (from1, data->from);
1581 from1 = change_address (data->from, mode,
1582 plus_constant (data->from_addr, data->offset));
1584 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1585 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (-size)));
1586 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1587 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (-size)));
1589 emit_insn ((*genfun) (to1, from1));
1591 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1592 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1593 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1594 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1596 if (! data->reverse)
1597 data->offset += size;
1603 /* Emit code to move a block Y to a block X.
1604 This may be done with string-move instructions,
1605 with multiple scalar move instructions, or with a library call.
1607 Both X and Y must be MEM rtx's (perhaps inside VOLATILE)
1609 SIZE is an rtx that says how long they are.
1610 ALIGN is the maximum alignment we can assume they have.
1612 Return the address of the new block, if memcpy is called and returns it,
1616 emit_block_move (x, y, size, align)
1622 #ifdef TARGET_MEM_FUNCTIONS
1624 tree call_expr, arg_list;
1627 if (GET_MODE (x) != BLKmode)
1630 if (GET_MODE (y) != BLKmode)
1633 x = protect_from_queue (x, 1);
1634 y = protect_from_queue (y, 0);
1635 size = protect_from_queue (size, 0);
1637 if (GET_CODE (x) != MEM)
1639 if (GET_CODE (y) != MEM)
1644 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1645 move_by_pieces (x, y, INTVAL (size), align);
1648 /* Try the most limited insn first, because there's no point
1649 including more than one in the machine description unless
1650 the more limited one has some advantage. */
1652 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1653 enum machine_mode mode;
1655 /* Since this is a move insn, we don't care about volatility. */
1658 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1659 mode = GET_MODE_WIDER_MODE (mode))
1661 enum insn_code code = movstr_optab[(int) mode];
1662 insn_operand_predicate_fn pred;
1664 if (code != CODE_FOR_nothing
1665 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1666 here because if SIZE is less than the mode mask, as it is
1667 returned by the macro, it will definitely be less than the
1668 actual mode mask. */
1669 && ((GET_CODE (size) == CONST_INT
1670 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1671 <= (GET_MODE_MASK (mode) >> 1)))
1672 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1673 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1674 || (*pred) (x, BLKmode))
1675 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1676 || (*pred) (y, BLKmode))
1677 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1678 || (*pred) (opalign, VOIDmode)))
1681 rtx last = get_last_insn ();
1684 op2 = convert_to_mode (mode, size, 1);
1685 pred = insn_data[(int) code].operand[2].predicate;
1686 if (pred != 0 && ! (*pred) (op2, mode))
1687 op2 = copy_to_mode_reg (mode, op2);
1689 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1697 delete_insns_since (last);
1703 /* X, Y, or SIZE may have been passed through protect_from_queue.
1705 It is unsafe to save the value generated by protect_from_queue
1706 and reuse it later. Consider what happens if emit_queue is
1707 called before the return value from protect_from_queue is used.
1709 Expansion of the CALL_EXPR below will call emit_queue before
1710 we are finished emitting RTL for argument setup. So if we are
1711 not careful we could get the wrong value for an argument.
1713 To avoid this problem we go ahead and emit code to copy X, Y &
1714 SIZE into new pseudos. We can then place those new pseudos
1715 into an RTL_EXPR and use them later, even after a call to
1718 Note this is not strictly needed for library calls since they
1719 do not call emit_queue before loading their arguments. However,
1720 we may need to have library calls call emit_queue in the future
1721 since failing to do so could cause problems for targets which
1722 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1723 x = copy_to_mode_reg (Pmode, XEXP (x, 0));
1724 y = copy_to_mode_reg (Pmode, XEXP (y, 0));
1726 #ifdef TARGET_MEM_FUNCTIONS
1727 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
1729 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
1730 TREE_UNSIGNED (integer_type_node));
1731 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
1734 #ifdef TARGET_MEM_FUNCTIONS
1735 /* It is incorrect to use the libcall calling conventions to call
1736 memcpy in this context.
1738 This could be a user call to memcpy and the user may wish to
1739 examine the return value from memcpy.
1741 For targets where libcalls and normal calls have different conventions
1742 for returning pointers, we could end up generating incorrect code.
1744 So instead of using a libcall sequence we build up a suitable
1745 CALL_EXPR and expand the call in the normal fashion. */
1746 if (fn == NULL_TREE)
1750 /* This was copied from except.c, I don't know if all this is
1751 necessary in this context or not. */
1752 fn = get_identifier ("memcpy");
1753 fntype = build_pointer_type (void_type_node);
1754 fntype = build_function_type (fntype, NULL_TREE);
1755 fn = build_decl (FUNCTION_DECL, fn, fntype);
1756 ggc_add_tree_root (&fn, 1);
1757 DECL_EXTERNAL (fn) = 1;
1758 TREE_PUBLIC (fn) = 1;
1759 DECL_ARTIFICIAL (fn) = 1;
1760 make_decl_rtl (fn, NULL_PTR);
1761 assemble_external (fn);
1764 /* We need to make an argument list for the function call.
1766 memcpy has three arguments, the first two are void * addresses and
1767 the last is a size_t byte count for the copy. */
1769 = build_tree_list (NULL_TREE,
1770 make_tree (build_pointer_type (void_type_node), x));
1771 TREE_CHAIN (arg_list)
1772 = build_tree_list (NULL_TREE,
1773 make_tree (build_pointer_type (void_type_node), y));
1774 TREE_CHAIN (TREE_CHAIN (arg_list))
1775 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
1776 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
1778 /* Now we have to build up the CALL_EXPR itself. */
1779 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1780 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1781 call_expr, arg_list, NULL_TREE);
1782 TREE_SIDE_EFFECTS (call_expr) = 1;
1784 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1786 emit_library_call (bcopy_libfunc, LCT_NORMAL,
1787 VOIDmode, 3, y, Pmode, x, Pmode,
1788 convert_to_mode (TYPE_MODE (integer_type_node), size,
1789 TREE_UNSIGNED (integer_type_node)),
1790 TYPE_MODE (integer_type_node));
1797 /* Copy all or part of a value X into registers starting at REGNO.
1798 The number of registers to be filled is NREGS. */
1801 move_block_to_reg (regno, x, nregs, mode)
1805 enum machine_mode mode;
1808 #ifdef HAVE_load_multiple
1816 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1817 x = validize_mem (force_const_mem (mode, x));
1819 /* See if the machine can do this with a load multiple insn. */
1820 #ifdef HAVE_load_multiple
1821 if (HAVE_load_multiple)
1823 last = get_last_insn ();
1824 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1832 delete_insns_since (last);
1836 for (i = 0; i < nregs; i++)
1837 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1838 operand_subword_force (x, i, mode));
1841 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1842 The number of registers to be filled is NREGS. SIZE indicates the number
1843 of bytes in the object X. */
1846 move_block_from_reg (regno, x, nregs, size)
1853 #ifdef HAVE_store_multiple
1857 enum machine_mode mode;
1862 /* If SIZE is that of a mode no bigger than a word, just use that
1863 mode's store operation. */
1864 if (size <= UNITS_PER_WORD
1865 && (mode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0)) != BLKmode)
1867 emit_move_insn (change_address (x, mode, NULL),
1868 gen_rtx_REG (mode, regno));
1872 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
1873 to the left before storing to memory. Note that the previous test
1874 doesn't handle all cases (e.g. SIZE == 3). */
1875 if (size < UNITS_PER_WORD && BYTES_BIG_ENDIAN)
1877 rtx tem = operand_subword (x, 0, 1, BLKmode);
1883 shift = expand_shift (LSHIFT_EXPR, word_mode,
1884 gen_rtx_REG (word_mode, regno),
1885 build_int_2 ((UNITS_PER_WORD - size)
1886 * BITS_PER_UNIT, 0), NULL_RTX, 0);
1887 emit_move_insn (tem, shift);
1891 /* See if the machine can do this with a store multiple insn. */
1892 #ifdef HAVE_store_multiple
1893 if (HAVE_store_multiple)
1895 last = get_last_insn ();
1896 pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1904 delete_insns_since (last);
1908 for (i = 0; i < nregs; i++)
1910 rtx tem = operand_subword (x, i, 1, BLKmode);
1915 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1919 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
1920 registers represented by a PARALLEL. SSIZE represents the total size of
1921 block SRC in bytes, or -1 if not known. ALIGN is the known alignment of
1923 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatent assumption that
1924 the balance will be in what would be the low-order memory addresses, i.e.
1925 left justified for big endian, right justified for little endian. This
1926 happens to be true for the targets currently using this support. If this
1927 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
1931 emit_group_load (dst, orig_src, ssize, align)
1939 if (GET_CODE (dst) != PARALLEL)
1942 /* Check for a NULL entry, used to indicate that the parameter goes
1943 both on the stack and in registers. */
1944 if (XEXP (XVECEXP (dst, 0, 0), 0))
1949 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (dst, 0));
1951 /* If we won't be loading directly from memory, protect the real source
1952 from strange tricks we might play. */
1954 if (GET_CODE (src) != MEM && ! CONSTANT_P (src))
1956 if (GET_MODE (src) == VOIDmode)
1957 src = gen_reg_rtx (GET_MODE (dst));
1959 src = gen_reg_rtx (GET_MODE (orig_src));
1960 emit_move_insn (src, orig_src);
1963 /* Process the pieces. */
1964 for (i = start; i < XVECLEN (dst, 0); i++)
1966 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1967 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1968 unsigned int bytelen = GET_MODE_SIZE (mode);
1971 /* Handle trailing fragments that run over the size of the struct. */
1972 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1974 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1975 bytelen = ssize - bytepos;
1980 /* Optimize the access just a bit. */
1981 if (GET_CODE (src) == MEM
1982 && align >= GET_MODE_ALIGNMENT (mode)
1983 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1984 && bytelen == GET_MODE_SIZE (mode))
1986 tmps[i] = gen_reg_rtx (mode);
1987 emit_move_insn (tmps[i],
1988 change_address (src, mode,
1989 plus_constant (XEXP (src, 0),
1992 else if (GET_CODE (src) == CONCAT)
1995 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 0))))
1996 tmps[i] = XEXP (src, 0);
1997 else if (bytepos == (HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (XEXP (src, 0)))
1998 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 1))))
1999 tmps[i] = XEXP (src, 1);
2003 else if ((CONSTANT_P (src)
2004 && (GET_MODE (src) == VOIDmode || GET_MODE (src) == mode))
2005 || (GET_CODE (src) == REG && GET_MODE (src) == mode))
2008 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
2009 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
2010 mode, mode, align, ssize);
2012 if (BYTES_BIG_ENDIAN && shift)
2013 expand_binop (mode, ashl_optab, tmps[i], GEN_INT (shift),
2014 tmps[i], 0, OPTAB_WIDEN);
2019 /* Copy the extracted pieces into the proper (probable) hard regs. */
2020 for (i = start; i < XVECLEN (dst, 0); i++)
2021 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0), tmps[i]);
2024 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
2025 registers represented by a PARALLEL. SSIZE represents the total size of
2026 block DST, or -1 if not known. ALIGN is the known alignment of DST. */
2029 emit_group_store (orig_dst, src, ssize, align)
2037 if (GET_CODE (src) != PARALLEL)
2040 /* Check for a NULL entry, used to indicate that the parameter goes
2041 both on the stack and in registers. */
2042 if (XEXP (XVECEXP (src, 0, 0), 0))
2047 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (src, 0));
2049 /* Copy the (probable) hard regs into pseudos. */
2050 for (i = start; i < XVECLEN (src, 0); i++)
2052 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
2053 tmps[i] = gen_reg_rtx (GET_MODE (reg));
2054 emit_move_insn (tmps[i], reg);
2058 /* If we won't be storing directly into memory, protect the real destination
2059 from strange tricks we might play. */
2061 if (GET_CODE (dst) == PARALLEL)
2065 /* We can get a PARALLEL dst if there is a conditional expression in
2066 a return statement. In that case, the dst and src are the same,
2067 so no action is necessary. */
2068 if (rtx_equal_p (dst, src))
2071 /* It is unclear if we can ever reach here, but we may as well handle
2072 it. Allocate a temporary, and split this into a store/load to/from
2075 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
2076 emit_group_store (temp, src, ssize, align);
2077 emit_group_load (dst, temp, ssize, align);
2080 else if (GET_CODE (dst) != MEM)
2082 dst = gen_reg_rtx (GET_MODE (orig_dst));
2083 /* Make life a bit easier for combine. */
2084 emit_move_insn (dst, const0_rtx);
2087 /* Process the pieces. */
2088 for (i = start; i < XVECLEN (src, 0); i++)
2090 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2091 enum machine_mode mode = GET_MODE (tmps[i]);
2092 unsigned int bytelen = GET_MODE_SIZE (mode);
2094 /* Handle trailing fragments that run over the size of the struct. */
2095 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2097 if (BYTES_BIG_ENDIAN)
2099 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2100 expand_binop (mode, ashr_optab, tmps[i], GEN_INT (shift),
2101 tmps[i], 0, OPTAB_WIDEN);
2103 bytelen = ssize - bytepos;
2106 /* Optimize the access just a bit. */
2107 if (GET_CODE (dst) == MEM
2108 && align >= GET_MODE_ALIGNMENT (mode)
2109 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2110 && bytelen == GET_MODE_SIZE (mode))
2111 emit_move_insn (change_address (dst, mode,
2112 plus_constant (XEXP (dst, 0),
2116 store_bit_field (dst, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2117 mode, tmps[i], align, ssize);
2122 /* Copy from the pseudo into the (probable) hard reg. */
2123 if (GET_CODE (dst) == REG)
2124 emit_move_insn (orig_dst, dst);
2127 /* Generate code to copy a BLKmode object of TYPE out of a
2128 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2129 is null, a stack temporary is created. TGTBLK is returned.
2131 The primary purpose of this routine is to handle functions
2132 that return BLKmode structures in registers. Some machines
2133 (the PA for example) want to return all small structures
2134 in registers regardless of the structure's alignment. */
2137 copy_blkmode_from_reg (tgtblk, srcreg, type)
2142 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2143 rtx src = NULL, dst = NULL;
2144 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2145 unsigned HOST_WIDE_INT bitpos, xbitpos, big_endian_correction = 0;
2149 tgtblk = assign_temp (build_qualified_type (type,
2151 | TYPE_QUAL_CONST)),
2153 preserve_temp_slots (tgtblk);
2156 /* This code assumes srcreg is at least a full word. If it isn't,
2157 copy it into a new pseudo which is a full word. */
2158 if (GET_MODE (srcreg) != BLKmode
2159 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2160 srcreg = convert_to_mode (word_mode, srcreg, TREE_UNSIGNED (type));
2162 /* Structures whose size is not a multiple of a word are aligned
2163 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2164 machine, this means we must skip the empty high order bytes when
2165 calculating the bit offset. */
2166 if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD)
2167 big_endian_correction
2168 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2170 /* Copy the structure BITSIZE bites at a time.
2172 We could probably emit more efficient code for machines which do not use
2173 strict alignment, but it doesn't seem worth the effort at the current
2175 for (bitpos = 0, xbitpos = big_endian_correction;
2176 bitpos < bytes * BITS_PER_UNIT;
2177 bitpos += bitsize, xbitpos += bitsize)
2179 /* We need a new source operand each time xbitpos is on a
2180 word boundary and when xbitpos == big_endian_correction
2181 (the first time through). */
2182 if (xbitpos % BITS_PER_WORD == 0
2183 || xbitpos == big_endian_correction)
2184 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD, BLKmode);
2186 /* We need a new destination operand each time bitpos is on
2188 if (bitpos % BITS_PER_WORD == 0)
2189 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2191 /* Use xbitpos for the source extraction (right justified) and
2192 xbitpos for the destination store (left justified). */
2193 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2194 extract_bit_field (src, bitsize,
2195 xbitpos % BITS_PER_WORD, 1,
2196 NULL_RTX, word_mode, word_mode,
2197 bitsize, BITS_PER_WORD),
2198 bitsize, BITS_PER_WORD);
2204 /* Add a USE expression for REG to the (possibly empty) list pointed
2205 to by CALL_FUSAGE. REG must denote a hard register. */
2208 use_reg (call_fusage, reg)
2209 rtx *call_fusage, reg;
2211 if (GET_CODE (reg) != REG
2212 || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
2216 = gen_rtx_EXPR_LIST (VOIDmode,
2217 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2220 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2221 starting at REGNO. All of these registers must be hard registers. */
2224 use_regs (call_fusage, regno, nregs)
2231 if (regno + nregs > FIRST_PSEUDO_REGISTER)
2234 for (i = 0; i < nregs; i++)
2235 use_reg (call_fusage, gen_rtx_REG (reg_raw_mode[regno + i], regno + i));
2238 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2239 PARALLEL REGS. This is for calls that pass values in multiple
2240 non-contiguous locations. The Irix 6 ABI has examples of this. */
2243 use_group_regs (call_fusage, regs)
2249 for (i = 0; i < XVECLEN (regs, 0); i++)
2251 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2253 /* A NULL entry means the parameter goes both on the stack and in
2254 registers. This can also be a MEM for targets that pass values
2255 partially on the stack and partially in registers. */
2256 if (reg != 0 && GET_CODE (reg) == REG)
2257 use_reg (call_fusage, reg);
2263 can_store_by_pieces (len, constfun, constfundata, align)
2264 unsigned HOST_WIDE_INT len;
2265 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2269 unsigned HOST_WIDE_INT max_size, l;
2270 HOST_WIDE_INT offset = 0;
2271 enum machine_mode mode, tmode;
2272 enum insn_code icode;
2276 if (! MOVE_BY_PIECES_P (len, align))
2279 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2280 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2281 align = MOVE_MAX * BITS_PER_UNIT;
2283 /* We would first store what we can in the largest integer mode, then go to
2284 successively smaller modes. */
2287 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2292 max_size = MOVE_MAX_PIECES + 1;
2293 while (max_size > 1)
2295 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2296 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2297 if (GET_MODE_SIZE (tmode) < max_size)
2300 if (mode == VOIDmode)
2303 icode = mov_optab->handlers[(int) mode].insn_code;
2304 if (icode != CODE_FOR_nothing
2305 && align >= GET_MODE_ALIGNMENT (mode))
2307 unsigned int size = GET_MODE_SIZE (mode);
2314 cst = (*constfun) (constfundata, offset, mode);
2315 if (!LEGITIMATE_CONSTANT_P (cst))
2325 max_size = GET_MODE_SIZE (mode);
2328 /* The code above should have handled everything. */
2336 /* Generate several move instructions to store LEN bytes generated by
2337 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2338 pointer which will be passed as argument in every CONSTFUN call.
2339 ALIGN is maximum alignment we can assume. */
2342 store_by_pieces (to, len, constfun, constfundata, align)
2344 unsigned HOST_WIDE_INT len;
2345 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2349 struct store_by_pieces data;
2351 if (! MOVE_BY_PIECES_P (len, align))
2353 to = protect_from_queue (to, 1);
2354 data.constfun = constfun;
2355 data.constfundata = constfundata;
2358 store_by_pieces_1 (&data, align);
2361 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2362 rtx with BLKmode). The caller must pass TO through protect_from_queue
2363 before calling. ALIGN is maximum alignment we can assume. */
2366 clear_by_pieces (to, len, align)
2368 unsigned HOST_WIDE_INT len;
2371 struct store_by_pieces data;
2373 data.constfun = clear_by_pieces_1;
2374 data.constfundata = NULL_PTR;
2377 store_by_pieces_1 (&data, align);
2380 /* Callback routine for clear_by_pieces.
2381 Return const0_rtx unconditionally. */
2384 clear_by_pieces_1 (data, offset, mode)
2385 PTR data ATTRIBUTE_UNUSED;
2386 HOST_WIDE_INT offset ATTRIBUTE_UNUSED;
2387 enum machine_mode mode ATTRIBUTE_UNUSED;
2392 /* Subroutine of clear_by_pieces and store_by_pieces.
2393 Generate several move instructions to store LEN bytes of block TO. (A MEM
2394 rtx with BLKmode). The caller must pass TO through protect_from_queue
2395 before calling. ALIGN is maximum alignment we can assume. */
2398 store_by_pieces_1 (data, align)
2399 struct store_by_pieces *data;
2402 rtx to_addr = XEXP (data->to, 0);
2403 unsigned HOST_WIDE_INT max_size = MOVE_MAX_PIECES + 1;
2404 enum machine_mode mode = VOIDmode, tmode;
2405 enum insn_code icode;
2408 data->to_addr = to_addr;
2410 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2411 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2413 data->explicit_inc_to = 0;
2415 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2417 data->offset = data->len;
2419 /* If storing requires more than two move insns,
2420 copy addresses to registers (to make displacements shorter)
2421 and use post-increment if available. */
2422 if (!data->autinc_to
2423 && move_by_pieces_ninsns (data->len, align) > 2)
2425 /* Determine the main mode we'll be using. */
2426 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2427 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2428 if (GET_MODE_SIZE (tmode) < max_size)
2431 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2433 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2434 data->autinc_to = 1;
2435 data->explicit_inc_to = -1;
2438 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2439 && ! data->autinc_to)
2441 data->to_addr = copy_addr_to_reg (to_addr);
2442 data->autinc_to = 1;
2443 data->explicit_inc_to = 1;
2446 if ( !data->autinc_to && CONSTANT_P (to_addr))
2447 data->to_addr = copy_addr_to_reg (to_addr);
2450 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2451 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2452 align = MOVE_MAX * BITS_PER_UNIT;
2454 /* First store what we can in the largest integer mode, then go to
2455 successively smaller modes. */
2457 while (max_size > 1)
2459 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2460 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2461 if (GET_MODE_SIZE (tmode) < max_size)
2464 if (mode == VOIDmode)
2467 icode = mov_optab->handlers[(int) mode].insn_code;
2468 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2469 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2471 max_size = GET_MODE_SIZE (mode);
2474 /* The code above should have handled everything. */
2479 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2480 with move instructions for mode MODE. GENFUN is the gen_... function
2481 to make a move insn for that mode. DATA has all the other info. */
2484 store_by_pieces_2 (genfun, mode, data)
2485 rtx (*genfun) PARAMS ((rtx, ...));
2486 enum machine_mode mode;
2487 struct store_by_pieces *data;
2489 unsigned int size = GET_MODE_SIZE (mode);
2492 while (data->len >= size)
2495 data->offset -= size;
2497 if (data->autinc_to)
2499 to1 = gen_rtx_MEM (mode, data->to_addr);
2500 MEM_COPY_ATTRIBUTES (to1, data->to);
2503 to1 = change_address (data->to, mode,
2504 plus_constant (data->to_addr, data->offset));
2506 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2507 emit_insn (gen_add2_insn (data->to_addr,
2508 GEN_INT (-(HOST_WIDE_INT) size)));
2510 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2511 emit_insn ((*genfun) (to1, cst));
2513 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2514 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2516 if (! data->reverse)
2517 data->offset += size;
2523 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2524 its length in bytes and ALIGN is the maximum alignment we can is has.
2526 If we call a function that returns the length of the block, return it. */
2529 clear_storage (object, size, align)
2534 #ifdef TARGET_MEM_FUNCTIONS
2536 tree call_expr, arg_list;
2540 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2541 just move a zero. Otherwise, do this a piece at a time. */
2542 if (GET_MODE (object) != BLKmode
2543 && GET_CODE (size) == CONST_INT
2544 && GET_MODE_SIZE (GET_MODE (object)) == (unsigned int) INTVAL (size))
2545 emit_move_insn (object, CONST0_RTX (GET_MODE (object)));
2548 object = protect_from_queue (object, 1);
2549 size = protect_from_queue (size, 0);
2551 if (GET_CODE (size) == CONST_INT
2552 && MOVE_BY_PIECES_P (INTVAL (size), align))
2553 clear_by_pieces (object, INTVAL (size), align);
2556 /* Try the most limited insn first, because there's no point
2557 including more than one in the machine description unless
2558 the more limited one has some advantage. */
2560 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2561 enum machine_mode mode;
2563 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2564 mode = GET_MODE_WIDER_MODE (mode))
2566 enum insn_code code = clrstr_optab[(int) mode];
2567 insn_operand_predicate_fn pred;
2569 if (code != CODE_FOR_nothing
2570 /* We don't need MODE to be narrower than
2571 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2572 the mode mask, as it is returned by the macro, it will
2573 definitely be less than the actual mode mask. */
2574 && ((GET_CODE (size) == CONST_INT
2575 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2576 <= (GET_MODE_MASK (mode) >> 1)))
2577 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2578 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2579 || (*pred) (object, BLKmode))
2580 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2581 || (*pred) (opalign, VOIDmode)))
2584 rtx last = get_last_insn ();
2587 op1 = convert_to_mode (mode, size, 1);
2588 pred = insn_data[(int) code].operand[1].predicate;
2589 if (pred != 0 && ! (*pred) (op1, mode))
2590 op1 = copy_to_mode_reg (mode, op1);
2592 pat = GEN_FCN ((int) code) (object, op1, opalign);
2599 delete_insns_since (last);
2603 /* OBJECT or SIZE may have been passed through protect_from_queue.
2605 It is unsafe to save the value generated by protect_from_queue
2606 and reuse it later. Consider what happens if emit_queue is
2607 called before the return value from protect_from_queue is used.
2609 Expansion of the CALL_EXPR below will call emit_queue before
2610 we are finished emitting RTL for argument setup. So if we are
2611 not careful we could get the wrong value for an argument.
2613 To avoid this problem we go ahead and emit code to copy OBJECT
2614 and SIZE into new pseudos. We can then place those new pseudos
2615 into an RTL_EXPR and use them later, even after a call to
2618 Note this is not strictly needed for library calls since they
2619 do not call emit_queue before loading their arguments. However,
2620 we may need to have library calls call emit_queue in the future
2621 since failing to do so could cause problems for targets which
2622 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
2623 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2625 #ifdef TARGET_MEM_FUNCTIONS
2626 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
2628 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
2629 TREE_UNSIGNED (integer_type_node));
2630 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
2633 #ifdef TARGET_MEM_FUNCTIONS
2634 /* It is incorrect to use the libcall calling conventions to call
2635 memset in this context.
2637 This could be a user call to memset and the user may wish to
2638 examine the return value from memset.
2640 For targets where libcalls and normal calls have different
2641 conventions for returning pointers, we could end up generating
2644 So instead of using a libcall sequence we build up a suitable
2645 CALL_EXPR and expand the call in the normal fashion. */
2646 if (fn == NULL_TREE)
2650 /* This was copied from except.c, I don't know if all this is
2651 necessary in this context or not. */
2652 fn = get_identifier ("memset");
2653 fntype = build_pointer_type (void_type_node);
2654 fntype = build_function_type (fntype, NULL_TREE);
2655 fn = build_decl (FUNCTION_DECL, fn, fntype);
2656 ggc_add_tree_root (&fn, 1);
2657 DECL_EXTERNAL (fn) = 1;
2658 TREE_PUBLIC (fn) = 1;
2659 DECL_ARTIFICIAL (fn) = 1;
2660 make_decl_rtl (fn, NULL_PTR);
2661 assemble_external (fn);
2664 /* We need to make an argument list for the function call.
2666 memset has three arguments, the first is a void * addresses, the
2667 second a integer with the initialization value, the last is a
2668 size_t byte count for the copy. */
2670 = build_tree_list (NULL_TREE,
2671 make_tree (build_pointer_type (void_type_node),
2673 TREE_CHAIN (arg_list)
2674 = build_tree_list (NULL_TREE,
2675 make_tree (integer_type_node, const0_rtx));
2676 TREE_CHAIN (TREE_CHAIN (arg_list))
2677 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
2678 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
2680 /* Now we have to build up the CALL_EXPR itself. */
2681 call_expr = build1 (ADDR_EXPR,
2682 build_pointer_type (TREE_TYPE (fn)), fn);
2683 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2684 call_expr, arg_list, NULL_TREE);
2685 TREE_SIDE_EFFECTS (call_expr) = 1;
2687 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2689 emit_library_call (bzero_libfunc, LCT_NORMAL,
2690 VOIDmode, 2, object, Pmode, size,
2691 TYPE_MODE (integer_type_node));
2699 /* Generate code to copy Y into X.
2700 Both Y and X must have the same mode, except that
2701 Y can be a constant with VOIDmode.
2702 This mode cannot be BLKmode; use emit_block_move for that.
2704 Return the last instruction emitted. */
2707 emit_move_insn (x, y)
2710 enum machine_mode mode = GET_MODE (x);
2711 rtx y_cst = NULL_RTX;
2714 x = protect_from_queue (x, 1);
2715 y = protect_from_queue (y, 0);
2717 if (mode == BLKmode || (GET_MODE (y) != mode && GET_MODE (y) != VOIDmode))
2720 /* Never force constant_p_rtx to memory. */
2721 if (GET_CODE (y) == CONSTANT_P_RTX)
2723 else if (CONSTANT_P (y) && ! LEGITIMATE_CONSTANT_P (y))
2726 y = force_const_mem (mode, y);
2729 /* If X or Y are memory references, verify that their addresses are valid
2731 if (GET_CODE (x) == MEM
2732 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
2733 && ! push_operand (x, GET_MODE (x)))
2735 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
2736 x = change_address (x, VOIDmode, XEXP (x, 0));
2738 if (GET_CODE (y) == MEM
2739 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
2741 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
2742 y = change_address (y, VOIDmode, XEXP (y, 0));
2744 if (mode == BLKmode)
2747 last_insn = emit_move_insn_1 (x, y);
2749 if (y_cst && GET_CODE (x) == REG)
2750 REG_NOTES (last_insn)
2751 = gen_rtx_EXPR_LIST (REG_EQUAL, y_cst, REG_NOTES (last_insn));
2756 /* Low level part of emit_move_insn.
2757 Called just like emit_move_insn, but assumes X and Y
2758 are basically valid. */
2761 emit_move_insn_1 (x, y)
2764 enum machine_mode mode = GET_MODE (x);
2765 enum machine_mode submode;
2766 enum mode_class class = GET_MODE_CLASS (mode);
2769 if ((unsigned int) mode >= (unsigned int) MAX_MACHINE_MODE)
2772 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2774 emit_insn (GEN_FCN (mov_optab->handlers[(int) mode].insn_code) (x, y));
2776 /* Expand complex moves by moving real part and imag part, if possible. */
2777 else if ((class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)
2778 && BLKmode != (submode = mode_for_size ((GET_MODE_UNIT_SIZE (mode)
2780 (class == MODE_COMPLEX_INT
2781 ? MODE_INT : MODE_FLOAT),
2783 && (mov_optab->handlers[(int) submode].insn_code
2784 != CODE_FOR_nothing))
2786 /* Don't split destination if it is a stack push. */
2787 int stack = push_operand (x, GET_MODE (x));
2789 #ifdef PUSH_ROUNDING
2790 /* In case we output to the stack, but the size is smaller machine can
2791 push exactly, we need to use move instructions. */
2793 && PUSH_ROUNDING (GET_MODE_SIZE (submode)) != GET_MODE_SIZE (submode))
2796 int offset1, offset2;
2798 /* Do not use anti_adjust_stack, since we don't want to update
2799 stack_pointer_delta. */
2800 temp = expand_binop (Pmode,
2801 #ifdef STACK_GROWS_DOWNWARD
2808 (PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))),
2812 if (temp != stack_pointer_rtx)
2813 emit_move_insn (stack_pointer_rtx, temp);
2814 #ifdef STACK_GROWS_DOWNWARD
2816 offset2 = GET_MODE_SIZE (submode);
2818 offset1 = -PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)));
2819 offset2 = (-PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))
2820 + GET_MODE_SIZE (submode));
2822 emit_move_insn (change_address (x, submode,
2823 gen_rtx_PLUS (Pmode,
2825 GEN_INT (offset1))),
2826 gen_realpart (submode, y));
2827 emit_move_insn (change_address (x, submode,
2828 gen_rtx_PLUS (Pmode,
2830 GEN_INT (offset2))),
2831 gen_imagpart (submode, y));
2834 /* If this is a stack, push the highpart first, so it
2835 will be in the argument order.
2837 In that case, change_address is used only to convert
2838 the mode, not to change the address. */
2841 /* Note that the real part always precedes the imag part in memory
2842 regardless of machine's endianness. */
2843 #ifdef STACK_GROWS_DOWNWARD
2844 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2845 (gen_rtx_MEM (submode, XEXP (x, 0)),
2846 gen_imagpart (submode, y)));
2847 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2848 (gen_rtx_MEM (submode, XEXP (x, 0)),
2849 gen_realpart (submode, y)));
2851 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2852 (gen_rtx_MEM (submode, XEXP (x, 0)),
2853 gen_realpart (submode, y)));
2854 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2855 (gen_rtx_MEM (submode, XEXP (x, 0)),
2856 gen_imagpart (submode, y)));
2861 rtx realpart_x, realpart_y;
2862 rtx imagpart_x, imagpart_y;
2864 /* If this is a complex value with each part being smaller than a
2865 word, the usual calling sequence will likely pack the pieces into
2866 a single register. Unfortunately, SUBREG of hard registers only
2867 deals in terms of words, so we have a problem converting input
2868 arguments to the CONCAT of two registers that is used elsewhere
2869 for complex values. If this is before reload, we can copy it into
2870 memory and reload. FIXME, we should see about using extract and
2871 insert on integer registers, but complex short and complex char
2872 variables should be rarely used. */
2873 if (GET_MODE_BITSIZE (mode) < 2 * BITS_PER_WORD
2874 && (reload_in_progress | reload_completed) == 0)
2876 int packed_dest_p = (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER);
2877 int packed_src_p = (REG_P (y) && REGNO (y) < FIRST_PSEUDO_REGISTER);
2879 if (packed_dest_p || packed_src_p)
2881 enum mode_class reg_class = ((class == MODE_COMPLEX_FLOAT)
2882 ? MODE_FLOAT : MODE_INT);
2884 enum machine_mode reg_mode
2885 = mode_for_size (GET_MODE_BITSIZE (mode), reg_class, 1);
2887 if (reg_mode != BLKmode)
2889 rtx mem = assign_stack_temp (reg_mode,
2890 GET_MODE_SIZE (mode), 0);
2891 rtx cmem = change_address (mem, mode, NULL_RTX);
2894 = N_("function using short complex types cannot be inline");
2898 rtx sreg = gen_rtx_SUBREG (reg_mode, x, 0);
2899 emit_move_insn_1 (cmem, y);
2900 return emit_move_insn_1 (sreg, mem);
2904 rtx sreg = gen_rtx_SUBREG (reg_mode, y, 0);
2905 emit_move_insn_1 (mem, sreg);
2906 return emit_move_insn_1 (x, cmem);
2912 realpart_x = gen_realpart (submode, x);
2913 realpart_y = gen_realpart (submode, y);
2914 imagpart_x = gen_imagpart (submode, x);
2915 imagpart_y = gen_imagpart (submode, y);
2917 /* Show the output dies here. This is necessary for SUBREGs
2918 of pseudos since we cannot track their lifetimes correctly;
2919 hard regs shouldn't appear here except as return values.
2920 We never want to emit such a clobber after reload. */
2922 && ! (reload_in_progress || reload_completed)
2923 && (GET_CODE (realpart_x) == SUBREG
2924 || GET_CODE (imagpart_x) == SUBREG))
2926 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2929 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2930 (realpart_x, realpart_y));
2931 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2932 (imagpart_x, imagpart_y));
2935 return get_last_insn ();
2938 /* This will handle any multi-word mode that lacks a move_insn pattern.
2939 However, you will get better code if you define such patterns,
2940 even if they must turn into multiple assembler instructions. */
2941 else if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)
2947 #ifdef PUSH_ROUNDING
2949 /* If X is a push on the stack, do the push now and replace
2950 X with a reference to the stack pointer. */
2951 if (push_operand (x, GET_MODE (x)))
2953 anti_adjust_stack (GEN_INT (GET_MODE_SIZE (GET_MODE (x))));
2954 x = change_address (x, VOIDmode, stack_pointer_rtx);
2958 /* If we are in reload, see if either operand is a MEM whose address
2959 is scheduled for replacement. */
2960 if (reload_in_progress && GET_CODE (x) == MEM
2961 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
2963 rtx new = gen_rtx_MEM (GET_MODE (x), inner);
2965 MEM_COPY_ATTRIBUTES (new, x);
2968 if (reload_in_progress && GET_CODE (y) == MEM
2969 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
2971 rtx new = gen_rtx_MEM (GET_MODE (y), inner);
2973 MEM_COPY_ATTRIBUTES (new, y);
2981 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
2984 rtx xpart = operand_subword (x, i, 1, mode);
2985 rtx ypart = operand_subword (y, i, 1, mode);
2987 /* If we can't get a part of Y, put Y into memory if it is a
2988 constant. Otherwise, force it into a register. If we still
2989 can't get a part of Y, abort. */
2990 if (ypart == 0 && CONSTANT_P (y))
2992 y = force_const_mem (mode, y);
2993 ypart = operand_subword (y, i, 1, mode);
2995 else if (ypart == 0)
2996 ypart = operand_subword_force (y, i, mode);
2998 if (xpart == 0 || ypart == 0)
3001 need_clobber |= (GET_CODE (xpart) == SUBREG);
3003 last_insn = emit_move_insn (xpart, ypart);
3006 seq = gen_sequence ();
3009 /* Show the output dies here. This is necessary for SUBREGs
3010 of pseudos since we cannot track their lifetimes correctly;
3011 hard regs shouldn't appear here except as return values.
3012 We never want to emit such a clobber after reload. */
3014 && ! (reload_in_progress || reload_completed)
3015 && need_clobber != 0)
3017 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3028 /* Pushing data onto the stack. */
3030 /* Push a block of length SIZE (perhaps variable)
3031 and return an rtx to address the beginning of the block.
3032 Note that it is not possible for the value returned to be a QUEUED.
3033 The value may be virtual_outgoing_args_rtx.
3035 EXTRA is the number of bytes of padding to push in addition to SIZE.
3036 BELOW nonzero means this padding comes at low addresses;
3037 otherwise, the padding comes at high addresses. */
3040 push_block (size, extra, below)
3046 size = convert_modes (Pmode, ptr_mode, size, 1);
3047 if (CONSTANT_P (size))
3048 anti_adjust_stack (plus_constant (size, extra));
3049 else if (GET_CODE (size) == REG && extra == 0)
3050 anti_adjust_stack (size);
3053 temp = copy_to_mode_reg (Pmode, size);
3055 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3056 temp, 0, OPTAB_LIB_WIDEN);
3057 anti_adjust_stack (temp);
3060 #ifndef STACK_GROWS_DOWNWARD
3061 #ifdef ARGS_GROW_DOWNWARD
3062 if (!ACCUMULATE_OUTGOING_ARGS)
3070 /* Return the lowest stack address when STACK or ARGS grow downward and
3071 we are not aaccumulating outgoing arguments (the c4x port uses such
3073 temp = virtual_outgoing_args_rtx;
3074 if (extra != 0 && below)
3075 temp = plus_constant (temp, extra);
3079 if (GET_CODE (size) == CONST_INT)
3080 temp = plus_constant (virtual_outgoing_args_rtx,
3081 -INTVAL (size) - (below ? 0 : extra));
3082 else if (extra != 0 && !below)
3083 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3084 negate_rtx (Pmode, plus_constant (size, extra)));
3086 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3087 negate_rtx (Pmode, size));
3090 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3096 return gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3099 /* Return an rtx for the address of the beginning of a as-if-it-was-pushed
3100 block of SIZE bytes. */
3103 get_push_address (size)
3108 if (STACK_PUSH_CODE == POST_DEC)
3109 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (size));
3110 else if (STACK_PUSH_CODE == POST_INC)
3111 temp = gen_rtx_MINUS (Pmode, stack_pointer_rtx, GEN_INT (size));
3113 temp = stack_pointer_rtx;
3115 return copy_to_reg (temp);
3118 /* Generate code to push X onto the stack, assuming it has mode MODE and
3120 MODE is redundant except when X is a CONST_INT (since they don't
3122 SIZE is an rtx for the size of data to be copied (in bytes),
3123 needed only if X is BLKmode.
3125 ALIGN is maximum alignment we can assume.
3127 If PARTIAL and REG are both nonzero, then copy that many of the first
3128 words of X into registers starting with REG, and push the rest of X.
3129 The amount of space pushed is decreased by PARTIAL words,
3130 rounded *down* to a multiple of PARM_BOUNDARY.
3131 REG must be a hard register in this case.
3132 If REG is zero but PARTIAL is not, take any all others actions for an
3133 argument partially in registers, but do not actually load any
3136 EXTRA is the amount in bytes of extra space to leave next to this arg.
3137 This is ignored if an argument block has already been allocated.
3139 On a machine that lacks real push insns, ARGS_ADDR is the address of
3140 the bottom of the argument block for this call. We use indexing off there
3141 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3142 argument block has not been preallocated.
3144 ARGS_SO_FAR is the size of args previously pushed for this call.
3146 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3147 for arguments passed in registers. If nonzero, it will be the number
3148 of bytes required. */
3151 emit_push_insn (x, mode, type, size, align, partial, reg, extra,
3152 args_addr, args_so_far, reg_parm_stack_space,
3155 enum machine_mode mode;
3164 int reg_parm_stack_space;
3168 enum direction stack_direction
3169 #ifdef STACK_GROWS_DOWNWARD
3175 /* Decide where to pad the argument: `downward' for below,
3176 `upward' for above, or `none' for don't pad it.
3177 Default is below for small data on big-endian machines; else above. */
3178 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3180 /* Invert direction if stack is post-update. */
3181 if (STACK_PUSH_CODE == POST_INC || STACK_PUSH_CODE == POST_DEC)
3182 if (where_pad != none)
3183 where_pad = (where_pad == downward ? upward : downward);
3185 xinner = x = protect_from_queue (x, 0);
3187 if (mode == BLKmode)
3189 /* Copy a block into the stack, entirely or partially. */
3192 int used = partial * UNITS_PER_WORD;
3193 int offset = used % (PARM_BOUNDARY / BITS_PER_UNIT);
3201 /* USED is now the # of bytes we need not copy to the stack
3202 because registers will take care of them. */
3205 xinner = change_address (xinner, BLKmode,
3206 plus_constant (XEXP (xinner, 0), used));
3208 /* If the partial register-part of the arg counts in its stack size,
3209 skip the part of stack space corresponding to the registers.
3210 Otherwise, start copying to the beginning of the stack space,
3211 by setting SKIP to 0. */
3212 skip = (reg_parm_stack_space == 0) ? 0 : used;
3214 #ifdef PUSH_ROUNDING
3215 /* Do it with several push insns if that doesn't take lots of insns
3216 and if there is no difficulty with push insns that skip bytes
3217 on the stack for alignment purposes. */
3220 && GET_CODE (size) == CONST_INT
3222 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3223 /* Here we avoid the case of a structure whose weak alignment
3224 forces many pushes of a small amount of data,
3225 and such small pushes do rounding that causes trouble. */
3226 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3227 || align >= BIGGEST_ALIGNMENT
3228 || PUSH_ROUNDING (align) == align)
3229 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3231 /* Push padding now if padding above and stack grows down,
3232 or if padding below and stack grows up.
3233 But if space already allocated, this has already been done. */
3234 if (extra && args_addr == 0
3235 && where_pad != none && where_pad != stack_direction)
3236 anti_adjust_stack (GEN_INT (extra));
3238 stack_pointer_delta += INTVAL (size) - used;
3239 move_by_pieces (gen_rtx_MEM (BLKmode, gen_push_operand ()), xinner,
3240 INTVAL (size) - used, align);
3242 if (current_function_check_memory_usage && ! in_check_memory_usage)
3246 in_check_memory_usage = 1;
3247 temp = get_push_address (INTVAL (size) - used);
3248 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
3249 emit_library_call (chkr_copy_bitmap_libfunc,
3250 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, temp,
3251 Pmode, XEXP (xinner, 0), Pmode,
3252 GEN_INT (INTVAL (size) - used),
3253 TYPE_MODE (sizetype));
3255 emit_library_call (chkr_set_right_libfunc,
3256 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, temp,
3257 Pmode, GEN_INT (INTVAL (size) - used),
3258 TYPE_MODE (sizetype),
3259 GEN_INT (MEMORY_USE_RW),
3260 TYPE_MODE (integer_type_node));
3261 in_check_memory_usage = 0;
3265 #endif /* PUSH_ROUNDING */
3269 /* Otherwise make space on the stack and copy the data
3270 to the address of that space. */
3272 /* Deduct words put into registers from the size we must copy. */
3275 if (GET_CODE (size) == CONST_INT)
3276 size = GEN_INT (INTVAL (size) - used);
3278 size = expand_binop (GET_MODE (size), sub_optab, size,
3279 GEN_INT (used), NULL_RTX, 0,
3283 /* Get the address of the stack space.
3284 In this case, we do not deal with EXTRA separately.
3285 A single stack adjust will do. */
3288 temp = push_block (size, extra, where_pad == downward);
3291 else if (GET_CODE (args_so_far) == CONST_INT)
3292 temp = memory_address (BLKmode,
3293 plus_constant (args_addr,
3294 skip + INTVAL (args_so_far)));
3296 temp = memory_address (BLKmode,
3297 plus_constant (gen_rtx_PLUS (Pmode,
3301 if (current_function_check_memory_usage && ! in_check_memory_usage)
3303 in_check_memory_usage = 1;
3304 target = copy_to_reg (temp);
3305 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
3306 emit_library_call (chkr_copy_bitmap_libfunc,
3307 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
3309 XEXP (xinner, 0), Pmode,
3310 size, TYPE_MODE (sizetype));
3312 emit_library_call (chkr_set_right_libfunc,
3313 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
3315 size, TYPE_MODE (sizetype),
3316 GEN_INT (MEMORY_USE_RW),
3317 TYPE_MODE (integer_type_node));
3318 in_check_memory_usage = 0;
3321 target = gen_rtx_MEM (BLKmode, temp);
3325 set_mem_attributes (target, type, 1);
3326 /* Function incoming arguments may overlap with sibling call
3327 outgoing arguments and we cannot allow reordering of reads
3328 from function arguments with stores to outgoing arguments
3329 of sibling calls. */
3330 MEM_ALIAS_SET (target) = 0;
3333 /* TEMP is the address of the block. Copy the data there. */
3334 if (GET_CODE (size) == CONST_INT
3335 && MOVE_BY_PIECES_P ((unsigned) INTVAL (size), align))
3337 move_by_pieces (target, xinner, INTVAL (size), align);
3342 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
3343 enum machine_mode mode;
3345 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3347 mode = GET_MODE_WIDER_MODE (mode))
3349 enum insn_code code = movstr_optab[(int) mode];
3350 insn_operand_predicate_fn pred;
3352 if (code != CODE_FOR_nothing
3353 && ((GET_CODE (size) == CONST_INT
3354 && ((unsigned HOST_WIDE_INT) INTVAL (size)
3355 <= (GET_MODE_MASK (mode) >> 1)))
3356 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
3357 && (!(pred = insn_data[(int) code].operand[0].predicate)
3358 || ((*pred) (target, BLKmode)))
3359 && (!(pred = insn_data[(int) code].operand[1].predicate)
3360 || ((*pred) (xinner, BLKmode)))
3361 && (!(pred = insn_data[(int) code].operand[3].predicate)
3362 || ((*pred) (opalign, VOIDmode))))
3364 rtx op2 = convert_to_mode (mode, size, 1);
3365 rtx last = get_last_insn ();
3368 pred = insn_data[(int) code].operand[2].predicate;
3369 if (pred != 0 && ! (*pred) (op2, mode))
3370 op2 = copy_to_mode_reg (mode, op2);
3372 pat = GEN_FCN ((int) code) (target, xinner,
3380 delete_insns_since (last);
3385 if (!ACCUMULATE_OUTGOING_ARGS)
3387 /* If the source is referenced relative to the stack pointer,
3388 copy it to another register to stabilize it. We do not need
3389 to do this if we know that we won't be changing sp. */
3391 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3392 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3393 temp = copy_to_reg (temp);
3396 /* Make inhibit_defer_pop nonzero around the library call
3397 to force it to pop the bcopy-arguments right away. */
3399 #ifdef TARGET_MEM_FUNCTIONS
3400 emit_library_call (memcpy_libfunc, LCT_NORMAL,
3401 VOIDmode, 3, temp, Pmode, XEXP (xinner, 0), Pmode,
3402 convert_to_mode (TYPE_MODE (sizetype),
3403 size, TREE_UNSIGNED (sizetype)),
3404 TYPE_MODE (sizetype));
3406 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3407 VOIDmode, 3, XEXP (xinner, 0), Pmode, temp, Pmode,
3408 convert_to_mode (TYPE_MODE (integer_type_node),
3410 TREE_UNSIGNED (integer_type_node)),
3411 TYPE_MODE (integer_type_node));
3416 else if (partial > 0)
3418 /* Scalar partly in registers. */
3420 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3423 /* # words of start of argument
3424 that we must make space for but need not store. */
3425 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3426 int args_offset = INTVAL (args_so_far);
3429 /* Push padding now if padding above and stack grows down,
3430 or if padding below and stack grows up.
3431 But if space already allocated, this has already been done. */
3432 if (extra && args_addr == 0
3433 && where_pad != none && where_pad != stack_direction)
3434 anti_adjust_stack (GEN_INT (extra));
3436 /* If we make space by pushing it, we might as well push
3437 the real data. Otherwise, we can leave OFFSET nonzero
3438 and leave the space uninitialized. */
3442 /* Now NOT_STACK gets the number of words that we don't need to
3443 allocate on the stack. */
3444 not_stack = partial - offset;
3446 /* If the partial register-part of the arg counts in its stack size,
3447 skip the part of stack space corresponding to the registers.
3448 Otherwise, start copying to the beginning of the stack space,
3449 by setting SKIP to 0. */
3450 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3452 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3453 x = validize_mem (force_const_mem (mode, x));
3455 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3456 SUBREGs of such registers are not allowed. */
3457 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER
3458 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3459 x = copy_to_reg (x);
3461 /* Loop over all the words allocated on the stack for this arg. */
3462 /* We can do it by words, because any scalar bigger than a word
3463 has a size a multiple of a word. */
3464 #ifndef PUSH_ARGS_REVERSED
3465 for (i = not_stack; i < size; i++)
3467 for (i = size - 1; i >= not_stack; i--)
3469 if (i >= not_stack + offset)
3470 emit_push_insn (operand_subword_force (x, i, mode),
3471 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3473 GEN_INT (args_offset + ((i - not_stack + skip)
3475 reg_parm_stack_space, alignment_pad);
3480 rtx target = NULL_RTX;
3483 /* Push padding now if padding above and stack grows down,
3484 or if padding below and stack grows up.
3485 But if space already allocated, this has already been done. */
3486 if (extra && args_addr == 0
3487 && where_pad != none && where_pad != stack_direction)
3488 anti_adjust_stack (GEN_INT (extra));
3490 #ifdef PUSH_ROUNDING
3491 if (args_addr == 0 && PUSH_ARGS)
3493 addr = gen_push_operand ();
3494 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3499 if (GET_CODE (args_so_far) == CONST_INT)
3501 = memory_address (mode,
3502 plus_constant (args_addr,
3503 INTVAL (args_so_far)));
3505 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3510 dest = gen_rtx_MEM (mode, addr);
3513 set_mem_attributes (dest, type, 1);
3514 /* Function incoming arguments may overlap with sibling call
3515 outgoing arguments and we cannot allow reordering of reads
3516 from function arguments with stores to outgoing arguments
3517 of sibling calls. */
3518 MEM_ALIAS_SET (dest) = 0;
3521 emit_move_insn (dest, x);
3523 if (current_function_check_memory_usage && ! in_check_memory_usage)
3525 in_check_memory_usage = 1;
3527 target = get_push_address (GET_MODE_SIZE (mode));
3529 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
3530 emit_library_call (chkr_copy_bitmap_libfunc,
3531 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, target,
3532 Pmode, XEXP (x, 0), Pmode,
3533 GEN_INT (GET_MODE_SIZE (mode)),
3534 TYPE_MODE (sizetype));
3536 emit_library_call (chkr_set_right_libfunc,
3537 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, target,
3538 Pmode, GEN_INT (GET_MODE_SIZE (mode)),
3539 TYPE_MODE (sizetype),
3540 GEN_INT (MEMORY_USE_RW),
3541 TYPE_MODE (integer_type_node));
3542 in_check_memory_usage = 0;
3547 /* If part should go in registers, copy that part
3548 into the appropriate registers. Do this now, at the end,
3549 since mem-to-mem copies above may do function calls. */
3550 if (partial > 0 && reg != 0)
3552 /* Handle calls that pass values in multiple non-contiguous locations.
3553 The Irix 6 ABI has examples of this. */
3554 if (GET_CODE (reg) == PARALLEL)
3555 emit_group_load (reg, x, -1, align); /* ??? size? */
3557 move_block_to_reg (REGNO (reg), x, partial, mode);
3560 if (extra && args_addr == 0 && where_pad == stack_direction)
3561 anti_adjust_stack (GEN_INT (extra));
3563 if (alignment_pad && args_addr == 0)
3564 anti_adjust_stack (alignment_pad);
3567 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3575 /* Only registers can be subtargets. */
3576 || GET_CODE (x) != REG
3577 /* If the register is readonly, it can't be set more than once. */
3578 || RTX_UNCHANGING_P (x)
3579 /* Don't use hard regs to avoid extending their life. */
3580 || REGNO (x) < FIRST_PSEUDO_REGISTER
3581 /* Avoid subtargets inside loops,
3582 since they hide some invariant expressions. */
3583 || preserve_subexpressions_p ())
3587 /* Expand an assignment that stores the value of FROM into TO.
3588 If WANT_VALUE is nonzero, return an rtx for the value of TO.
3589 (This may contain a QUEUED rtx;
3590 if the value is constant, this rtx is a constant.)
3591 Otherwise, the returned value is NULL_RTX.
3593 SUGGEST_REG is no longer actually used.
3594 It used to mean, copy the value through a register
3595 and return that register, if that is possible.
3596 We now use WANT_VALUE to decide whether to do this. */
3599 expand_assignment (to, from, want_value, suggest_reg)
3602 int suggest_reg ATTRIBUTE_UNUSED;
3604 register rtx to_rtx = 0;
3607 /* Don't crash if the lhs of the assignment was erroneous. */
3609 if (TREE_CODE (to) == ERROR_MARK)
3611 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3612 return want_value ? result : NULL_RTX;
3615 /* Assignment of a structure component needs special treatment
3616 if the structure component's rtx is not simply a MEM.
3617 Assignment of an array element at a constant index, and assignment of
3618 an array element in an unaligned packed structure field, has the same
3621 if (TREE_CODE (to) == COMPONENT_REF || TREE_CODE (to) == BIT_FIELD_REF
3622 || TREE_CODE (to) == ARRAY_REF)
3624 enum machine_mode mode1;
3625 HOST_WIDE_INT bitsize, bitpos;
3630 unsigned int alignment;
3633 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3634 &unsignedp, &volatilep, &alignment);
3636 /* If we are going to use store_bit_field and extract_bit_field,
3637 make sure to_rtx will be safe for multiple use. */
3639 if (mode1 == VOIDmode && want_value)
3640 tem = stabilize_reference (tem);
3642 to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_DONT);
3645 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
3647 if (GET_CODE (to_rtx) != MEM)
3650 if (GET_MODE (offset_rtx) != ptr_mode)
3652 #ifdef POINTERS_EXTEND_UNSIGNED
3653 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
3655 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3659 /* A constant address in TO_RTX can have VOIDmode, we must not try
3660 to call force_reg for that case. Avoid that case. */
3661 if (GET_CODE (to_rtx) == MEM
3662 && GET_MODE (to_rtx) == BLKmode
3663 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3665 && (bitpos % bitsize) == 0
3666 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3667 && alignment == GET_MODE_ALIGNMENT (mode1))
3669 rtx temp = change_address (to_rtx, mode1,
3670 plus_constant (XEXP (to_rtx, 0),
3673 if (GET_CODE (XEXP (temp, 0)) == REG)
3676 to_rtx = change_address (to_rtx, mode1,
3677 force_reg (GET_MODE (XEXP (temp, 0)),
3682 to_rtx = change_address (to_rtx, VOIDmode,
3683 gen_rtx_PLUS (ptr_mode, XEXP (to_rtx, 0),
3684 force_reg (ptr_mode,
3690 if (GET_CODE (to_rtx) == MEM)
3692 /* When the offset is zero, to_rtx is the address of the
3693 structure we are storing into, and hence may be shared.
3694 We must make a new MEM before setting the volatile bit. */
3696 to_rtx = copy_rtx (to_rtx);
3698 MEM_VOLATILE_P (to_rtx) = 1;
3700 #if 0 /* This was turned off because, when a field is volatile
3701 in an object which is not volatile, the object may be in a register,
3702 and then we would abort over here. */
3708 if (TREE_CODE (to) == COMPONENT_REF
3709 && TREE_READONLY (TREE_OPERAND (to, 1)))
3712 to_rtx = copy_rtx (to_rtx);
3714 RTX_UNCHANGING_P (to_rtx) = 1;
3717 /* Check the access. */
3718 if (current_function_check_memory_usage && GET_CODE (to_rtx) == MEM)
3723 enum machine_mode best_mode;
3725 best_mode = get_best_mode (bitsize, bitpos,
3726 TYPE_ALIGN (TREE_TYPE (tem)),
3728 if (best_mode == VOIDmode)
3731 best_mode_size = GET_MODE_BITSIZE (best_mode);
3732 to_addr = plus_constant (XEXP (to_rtx, 0), (bitpos / BITS_PER_UNIT));
3733 size = CEIL ((bitpos % best_mode_size) + bitsize, best_mode_size);
3734 size *= GET_MODE_SIZE (best_mode);
3736 /* Check the access right of the pointer. */
3737 in_check_memory_usage = 1;
3739 emit_library_call (chkr_check_addr_libfunc, LCT_CONST_MAKE_BLOCK,
3740 VOIDmode, 3, to_addr, Pmode,
3741 GEN_INT (size), TYPE_MODE (sizetype),
3742 GEN_INT (MEMORY_USE_WO),
3743 TYPE_MODE (integer_type_node));
3744 in_check_memory_usage = 0;
3747 /* If this is a varying-length object, we must get the address of
3748 the source and do an explicit block move. */
3751 unsigned int from_align;
3752 rtx from_rtx = expand_expr_unaligned (from, &from_align);
3754 = change_address (to_rtx, VOIDmode,
3755 plus_constant (XEXP (to_rtx, 0),
3756 bitpos / BITS_PER_UNIT));
3758 emit_block_move (inner_to_rtx, from_rtx, expr_size (from),
3759 MIN (alignment, from_align));
3766 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3768 /* Spurious cast for HPUX compiler. */
3769 ? ((enum machine_mode)
3770 TYPE_MODE (TREE_TYPE (to)))
3774 int_size_in_bytes (TREE_TYPE (tem)),
3775 get_alias_set (to));
3777 preserve_temp_slots (result);
3781 /* If the value is meaningful, convert RESULT to the proper mode.
3782 Otherwise, return nothing. */
3783 return (want_value ? convert_modes (TYPE_MODE (TREE_TYPE (to)),
3784 TYPE_MODE (TREE_TYPE (from)),
3786 TREE_UNSIGNED (TREE_TYPE (to)))
3791 /* If the rhs is a function call and its value is not an aggregate,
3792 call the function before we start to compute the lhs.
3793 This is needed for correct code for cases such as
3794 val = setjmp (buf) on machines where reference to val
3795 requires loading up part of an address in a separate insn.
3797 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3798 since it might be a promoted variable where the zero- or sign- extension
3799 needs to be done. Handling this in the normal way is safe because no
3800 computation is done before the call. */
3801 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from)
3802 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3803 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3804 && GET_CODE (DECL_RTL (to)) == REG))
3809 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3811 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_WO);
3813 /* Handle calls that return values in multiple non-contiguous locations.
3814 The Irix 6 ABI has examples of this. */
3815 if (GET_CODE (to_rtx) == PARALLEL)
3816 emit_group_load (to_rtx, value, int_size_in_bytes (TREE_TYPE (from)),
3817 TYPE_ALIGN (TREE_TYPE (from)));
3818 else if (GET_MODE (to_rtx) == BLKmode)
3819 emit_block_move (to_rtx, value, expr_size (from),
3820 TYPE_ALIGN (TREE_TYPE (from)));
3823 #ifdef POINTERS_EXTEND_UNSIGNED
3824 if (TREE_CODE (TREE_TYPE (to)) == REFERENCE_TYPE
3825 || TREE_CODE (TREE_TYPE (to)) == POINTER_TYPE)
3826 value = convert_memory_address (GET_MODE (to_rtx), value);
3828 emit_move_insn (to_rtx, value);
3830 preserve_temp_slots (to_rtx);
3833 return want_value ? to_rtx : NULL_RTX;
3836 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3837 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3841 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_WO);
3842 if (GET_CODE (to_rtx) == MEM)
3843 MEM_ALIAS_SET (to_rtx) = get_alias_set (to);
3846 /* Don't move directly into a return register. */
3847 if (TREE_CODE (to) == RESULT_DECL
3848 && (GET_CODE (to_rtx) == REG || GET_CODE (to_rtx) == PARALLEL))
3853 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3855 if (GET_CODE (to_rtx) == PARALLEL)
3856 emit_group_load (to_rtx, temp, int_size_in_bytes (TREE_TYPE (from)),
3857 TYPE_ALIGN (TREE_TYPE (from)));
3859 emit_move_insn (to_rtx, temp);
3861 preserve_temp_slots (to_rtx);
3864 return want_value ? to_rtx : NULL_RTX;
3867 /* In case we are returning the contents of an object which overlaps
3868 the place the value is being stored, use a safe function when copying
3869 a value through a pointer into a structure value return block. */
3870 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3871 && current_function_returns_struct
3872 && !current_function_returns_pcc_struct)
3877 size = expr_size (from);
3878 from_rtx = expand_expr (from, NULL_RTX, VOIDmode,
3879 EXPAND_MEMORY_USE_DONT);
3881 /* Copy the rights of the bitmap. */
3882 if (current_function_check_memory_usage)
3883 emit_library_call (chkr_copy_bitmap_libfunc, LCT_CONST_MAKE_BLOCK,
3884 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3885 XEXP (from_rtx, 0), Pmode,
3886 convert_to_mode (TYPE_MODE (sizetype),
3887 size, TREE_UNSIGNED (sizetype)),
3888 TYPE_MODE (sizetype));
3890 #ifdef TARGET_MEM_FUNCTIONS
3891 emit_library_call (memcpy_libfunc, LCT_NORMAL,
3892 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3893 XEXP (from_rtx, 0), Pmode,
3894 convert_to_mode (TYPE_MODE (sizetype),
3895 size, TREE_UNSIGNED (sizetype)),
3896 TYPE_MODE (sizetype));
3898 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3899 VOIDmode, 3, XEXP (from_rtx, 0), Pmode,
3900 XEXP (to_rtx, 0), Pmode,
3901 convert_to_mode (TYPE_MODE (integer_type_node),
3902 size, TREE_UNSIGNED (integer_type_node)),
3903 TYPE_MODE (integer_type_node));
3906 preserve_temp_slots (to_rtx);
3909 return want_value ? to_rtx : NULL_RTX;
3912 /* Compute FROM and store the value in the rtx we got. */
3915 result = store_expr (from, to_rtx, want_value);
3916 preserve_temp_slots (result);
3919 return want_value ? result : NULL_RTX;
3922 /* Generate code for computing expression EXP,
3923 and storing the value into TARGET.
3924 TARGET may contain a QUEUED rtx.
3926 If WANT_VALUE is nonzero, return a copy of the value
3927 not in TARGET, so that we can be sure to use the proper
3928 value in a containing expression even if TARGET has something
3929 else stored in it. If possible, we copy the value through a pseudo
3930 and return that pseudo. Or, if the value is constant, we try to
3931 return the constant. In some cases, we return a pseudo
3932 copied *from* TARGET.
3934 If the mode is BLKmode then we may return TARGET itself.
3935 It turns out that in BLKmode it doesn't cause a problem.
3936 because C has no operators that could combine two different
3937 assignments into the same BLKmode object with different values
3938 with no sequence point. Will other languages need this to
3941 If WANT_VALUE is 0, we return NULL, to make sure
3942 to catch quickly any cases where the caller uses the value
3943 and fails to set WANT_VALUE. */
3946 store_expr (exp, target, want_value)
3948 register rtx target;
3952 int dont_return_target = 0;
3953 int dont_store_target = 0;
3955 if (TREE_CODE (exp) == COMPOUND_EXPR)
3957 /* Perform first part of compound expression, then assign from second
3959 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
3961 return store_expr (TREE_OPERAND (exp, 1), target, want_value);
3963 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
3965 /* For conditional expression, get safe form of the target. Then
3966 test the condition, doing the appropriate assignment on either
3967 side. This avoids the creation of unnecessary temporaries.
3968 For non-BLKmode, it is more efficient not to do this. */
3970 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
3973 target = protect_from_queue (target, 1);
3975 do_pending_stack_adjust ();
3977 jumpifnot (TREE_OPERAND (exp, 0), lab1);
3978 start_cleanup_deferral ();
3979 store_expr (TREE_OPERAND (exp, 1), target, 0);
3980 end_cleanup_deferral ();
3982 emit_jump_insn (gen_jump (lab2));
3985 start_cleanup_deferral ();
3986 store_expr (TREE_OPERAND (exp, 2), target, 0);
3987 end_cleanup_deferral ();
3992 return want_value ? target : NULL_RTX;
3994 else if (queued_subexp_p (target))
3995 /* If target contains a postincrement, let's not risk
3996 using it as the place to generate the rhs. */
3998 if (GET_MODE (target) != BLKmode && GET_MODE (target) != VOIDmode)
4000 /* Expand EXP into a new pseudo. */
4001 temp = gen_reg_rtx (GET_MODE (target));
4002 temp = expand_expr (exp, temp, GET_MODE (target), 0);
4005 temp = expand_expr (exp, NULL_RTX, GET_MODE (target), 0);
4007 /* If target is volatile, ANSI requires accessing the value
4008 *from* the target, if it is accessed. So make that happen.
4009 In no case return the target itself. */
4010 if (! MEM_VOLATILE_P (target) && want_value)
4011 dont_return_target = 1;
4013 else if (want_value && GET_CODE (target) == MEM && ! MEM_VOLATILE_P (target)
4014 && GET_MODE (target) != BLKmode)
4015 /* If target is in memory and caller wants value in a register instead,
4016 arrange that. Pass TARGET as target for expand_expr so that,
4017 if EXP is another assignment, WANT_VALUE will be nonzero for it.
4018 We know expand_expr will not use the target in that case.
4019 Don't do this if TARGET is volatile because we are supposed
4020 to write it and then read it. */
4022 temp = expand_expr (exp, target, GET_MODE (target), 0);
4023 if (GET_MODE (temp) != BLKmode && GET_MODE (temp) != VOIDmode)
4025 /* If TEMP is already in the desired TARGET, only copy it from
4026 memory and don't store it there again. */
4028 || (rtx_equal_p (temp, target)
4029 && ! side_effects_p (temp) && ! side_effects_p (target)))
4030 dont_store_target = 1;
4031 temp = copy_to_reg (temp);
4033 dont_return_target = 1;
4035 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4036 /* If this is an scalar in a register that is stored in a wider mode
4037 than the declared mode, compute the result into its declared mode
4038 and then convert to the wider mode. Our value is the computed
4041 /* If we don't want a value, we can do the conversion inside EXP,
4042 which will often result in some optimizations. Do the conversion
4043 in two steps: first change the signedness, if needed, then
4044 the extend. But don't do this if the type of EXP is a subtype
4045 of something else since then the conversion might involve
4046 more than just converting modes. */
4047 if (! want_value && INTEGRAL_TYPE_P (TREE_TYPE (exp))
4048 && TREE_TYPE (TREE_TYPE (exp)) == 0)
4050 if (TREE_UNSIGNED (TREE_TYPE (exp))
4051 != SUBREG_PROMOTED_UNSIGNED_P (target))
4054 (signed_or_unsigned_type (SUBREG_PROMOTED_UNSIGNED_P (target),
4058 exp = convert (type_for_mode (GET_MODE (SUBREG_REG (target)),
4059 SUBREG_PROMOTED_UNSIGNED_P (target)),
4063 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
4065 /* If TEMP is a volatile MEM and we want a result value, make
4066 the access now so it gets done only once. Likewise if
4067 it contains TARGET. */
4068 if (GET_CODE (temp) == MEM && want_value
4069 && (MEM_VOLATILE_P (temp)
4070 || reg_mentioned_p (SUBREG_REG (target), XEXP (temp, 0))))
4071 temp = copy_to_reg (temp);
4073 /* If TEMP is a VOIDmode constant, use convert_modes to make
4074 sure that we properly convert it. */
4075 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4076 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4077 TYPE_MODE (TREE_TYPE (exp)), temp,
4078 SUBREG_PROMOTED_UNSIGNED_P (target));
4080 convert_move (SUBREG_REG (target), temp,
4081 SUBREG_PROMOTED_UNSIGNED_P (target));
4083 /* If we promoted a constant, change the mode back down to match
4084 target. Otherwise, the caller might get confused by a result whose
4085 mode is larger than expected. */
4087 if (want_value && GET_MODE (temp) != GET_MODE (target)
4088 && GET_MODE (temp) != VOIDmode)
4090 temp = gen_rtx_SUBREG (GET_MODE (target), temp, 0);
4091 SUBREG_PROMOTED_VAR_P (temp) = 1;
4092 SUBREG_PROMOTED_UNSIGNED_P (temp)
4093 = SUBREG_PROMOTED_UNSIGNED_P (target);
4096 return want_value ? temp : NULL_RTX;
4100 temp = expand_expr (exp, target, GET_MODE (target), 0);
4101 /* Return TARGET if it's a specified hardware register.
4102 If TARGET is a volatile mem ref, either return TARGET
4103 or return a reg copied *from* TARGET; ANSI requires this.
4105 Otherwise, if TEMP is not TARGET, return TEMP
4106 if it is constant (for efficiency),
4107 or if we really want the correct value. */
4108 if (!(target && GET_CODE (target) == REG
4109 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4110 && !(GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
4111 && ! rtx_equal_p (temp, target)
4112 && (CONSTANT_P (temp) || want_value))
4113 dont_return_target = 1;
4116 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4117 the same as that of TARGET, adjust the constant. This is needed, for
4118 example, in case it is a CONST_DOUBLE and we want only a word-sized
4120 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4121 && TREE_CODE (exp) != ERROR_MARK
4122 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4123 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4124 temp, TREE_UNSIGNED (TREE_TYPE (exp)));
4126 if (current_function_check_memory_usage
4127 && GET_CODE (target) == MEM
4128 && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
4130 in_check_memory_usage = 1;
4131 if (GET_CODE (temp) == MEM)
4132 emit_library_call (chkr_copy_bitmap_libfunc, LCT_CONST_MAKE_BLOCK,
4133 VOIDmode, 3, XEXP (target, 0), Pmode,
4134 XEXP (temp, 0), Pmode,
4135 expr_size (exp), TYPE_MODE (sizetype));
4137 emit_library_call (chkr_check_addr_libfunc, LCT_CONST_MAKE_BLOCK,
4138 VOIDmode, 3, XEXP (target, 0), Pmode,
4139 expr_size (exp), TYPE_MODE (sizetype),
4140 GEN_INT (MEMORY_USE_WO),
4141 TYPE_MODE (integer_type_node));
4142 in_check_memory_usage = 0;
4145 /* If value was not generated in the target, store it there.
4146 Convert the value to TARGET's type first if nec. */
4147 /* If TEMP and TARGET compare equal according to rtx_equal_p, but
4148 one or both of them are volatile memory refs, we have to distinguish
4150 - expand_expr has used TARGET. In this case, we must not generate
4151 another copy. This can be detected by TARGET being equal according
4153 - expand_expr has not used TARGET - that means that the source just
4154 happens to have the same RTX form. Since temp will have been created
4155 by expand_expr, it will compare unequal according to == .
4156 We must generate a copy in this case, to reach the correct number
4157 of volatile memory references. */
4159 if ((! rtx_equal_p (temp, target)
4160 || (temp != target && (side_effects_p (temp)
4161 || side_effects_p (target))))
4162 && TREE_CODE (exp) != ERROR_MARK
4163 && ! dont_store_target)
4165 target = protect_from_queue (target, 1);
4166 if (GET_MODE (temp) != GET_MODE (target)
4167 && GET_MODE (temp) != VOIDmode)
4169 int unsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
4170 if (dont_return_target)
4172 /* In this case, we will return TEMP,
4173 so make sure it has the proper mode.
4174 But don't forget to store the value into TARGET. */
4175 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4176 emit_move_insn (target, temp);
4179 convert_move (target, temp, unsignedp);
4182 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4184 /* Handle copying a string constant into an array.
4185 The string constant may be shorter than the array.
4186 So copy just the string's actual length, and clear the rest. */
4190 /* Get the size of the data type of the string,
4191 which is actually the size of the target. */
4192 size = expr_size (exp);
4193 if (GET_CODE (size) == CONST_INT
4194 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4195 emit_block_move (target, temp, size, TYPE_ALIGN (TREE_TYPE (exp)));
4198 /* Compute the size of the data to copy from the string. */
4200 = size_binop (MIN_EXPR,
4201 make_tree (sizetype, size),
4202 size_int (TREE_STRING_LENGTH (exp)));
4203 unsigned int align = TYPE_ALIGN (TREE_TYPE (exp));
4204 rtx copy_size_rtx = expand_expr (copy_size, NULL_RTX,
4208 /* Copy that much. */
4209 emit_block_move (target, temp, copy_size_rtx,
4210 TYPE_ALIGN (TREE_TYPE (exp)));
4212 /* Figure out how much is left in TARGET that we have to clear.
4213 Do all calculations in ptr_mode. */
4215 addr = XEXP (target, 0);
4216 addr = convert_modes (ptr_mode, Pmode, addr, 1);
4218 if (GET_CODE (copy_size_rtx) == CONST_INT)
4220 addr = plus_constant (addr, TREE_STRING_LENGTH (exp));
4221 size = plus_constant (size, -TREE_STRING_LENGTH (exp));
4223 (unsigned int) (BITS_PER_UNIT
4224 * (INTVAL (copy_size_rtx)
4225 & - INTVAL (copy_size_rtx))));
4229 addr = force_reg (ptr_mode, addr);
4230 addr = expand_binop (ptr_mode, add_optab, addr,
4231 copy_size_rtx, NULL_RTX, 0,
4234 size = expand_binop (ptr_mode, sub_optab, size,
4235 copy_size_rtx, NULL_RTX, 0,
4238 align = BITS_PER_UNIT;
4239 label = gen_label_rtx ();
4240 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4241 GET_MODE (size), 0, 0, label);
4243 align = MIN (align, expr_align (copy_size));
4245 if (size != const0_rtx)
4247 rtx dest = gen_rtx_MEM (BLKmode, addr);
4249 MEM_COPY_ATTRIBUTES (dest, target);
4251 /* Be sure we can write on ADDR. */
4252 in_check_memory_usage = 1;
4253 if (current_function_check_memory_usage)
4254 emit_library_call (chkr_check_addr_libfunc,
4255 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
4257 size, TYPE_MODE (sizetype),
4258 GEN_INT (MEMORY_USE_WO),
4259 TYPE_MODE (integer_type_node));
4260 in_check_memory_usage = 0;
4261 clear_storage (dest, size, align);
4268 /* Handle calls that return values in multiple non-contiguous locations.
4269 The Irix 6 ABI has examples of this. */
4270 else if (GET_CODE (target) == PARALLEL)
4271 emit_group_load (target, temp, int_size_in_bytes (TREE_TYPE (exp)),
4272 TYPE_ALIGN (TREE_TYPE (exp)));
4273 else if (GET_MODE (temp) == BLKmode)
4274 emit_block_move (target, temp, expr_size (exp),
4275 TYPE_ALIGN (TREE_TYPE (exp)));
4277 emit_move_insn (target, temp);
4280 /* If we don't want a value, return NULL_RTX. */
4284 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
4285 ??? The latter test doesn't seem to make sense. */
4286 else if (dont_return_target && GET_CODE (temp) != MEM)
4289 /* Return TARGET itself if it is a hard register. */
4290 else if (want_value && GET_MODE (target) != BLKmode
4291 && ! (GET_CODE (target) == REG
4292 && REGNO (target) < FIRST_PSEUDO_REGISTER))
4293 return copy_to_reg (target);
4299 /* Return 1 if EXP just contains zeros. */
4307 switch (TREE_CODE (exp))
4311 case NON_LVALUE_EXPR:
4312 return is_zeros_p (TREE_OPERAND (exp, 0));
4315 return integer_zerop (exp);
4319 is_zeros_p (TREE_REALPART (exp)) && is_zeros_p (TREE_IMAGPART (exp));
4322 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp), dconst0);
4325 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4326 return CONSTRUCTOR_ELTS (exp) == NULL_TREE;
4327 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4328 if (! is_zeros_p (TREE_VALUE (elt)))
4338 /* Return 1 if EXP contains mostly (3/4) zeros. */
4341 mostly_zeros_p (exp)
4344 if (TREE_CODE (exp) == CONSTRUCTOR)
4346 int elts = 0, zeros = 0;
4347 tree elt = CONSTRUCTOR_ELTS (exp);
4348 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4350 /* If there are no ranges of true bits, it is all zero. */
4351 return elt == NULL_TREE;
4353 for (; elt; elt = TREE_CHAIN (elt))
4355 /* We do not handle the case where the index is a RANGE_EXPR,
4356 so the statistic will be somewhat inaccurate.
4357 We do make a more accurate count in store_constructor itself,
4358 so since this function is only used for nested array elements,
4359 this should be close enough. */
4360 if (mostly_zeros_p (TREE_VALUE (elt)))
4365 return 4 * zeros >= 3 * elts;
4368 return is_zeros_p (exp);
4371 /* Helper function for store_constructor.
4372 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4373 TYPE is the type of the CONSTRUCTOR, not the element type.
4374 ALIGN and CLEARED are as for store_constructor.
4375 ALIAS_SET is the alias set to use for any stores.
4377 This provides a recursive shortcut back to store_constructor when it isn't
4378 necessary to go through store_field. This is so that we can pass through
4379 the cleared field to let store_constructor know that we may not have to
4380 clear a substructure if the outer structure has already been cleared. */
4383 store_constructor_field (target, bitsize, bitpos,
4384 mode, exp, type, align, cleared, alias_set)
4386 unsigned HOST_WIDE_INT bitsize;
4387 HOST_WIDE_INT bitpos;
4388 enum machine_mode mode;
4394 if (TREE_CODE (exp) == CONSTRUCTOR
4395 && bitpos % BITS_PER_UNIT == 0
4396 /* If we have a non-zero bitpos for a register target, then we just
4397 let store_field do the bitfield handling. This is unlikely to
4398 generate unnecessary clear instructions anyways. */
4399 && (bitpos == 0 || GET_CODE (target) == MEM))
4403 = change_address (target,
4404 GET_MODE (target) == BLKmode
4406 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4407 ? BLKmode : VOIDmode,
4408 plus_constant (XEXP (target, 0),
4409 bitpos / BITS_PER_UNIT));
4412 /* Show the alignment may no longer be what it was and update the alias
4413 set, if required. */
4415 align = MIN (align, (unsigned int) bitpos & - bitpos);
4416 if (GET_CODE (target) == MEM)
4417 MEM_ALIAS_SET (target) = alias_set;
4419 store_constructor (exp, target, align, cleared, bitsize / BITS_PER_UNIT);
4422 store_field (target, bitsize, bitpos, mode, exp, VOIDmode, 0, align,
4423 int_size_in_bytes (type), alias_set);
4426 /* Store the value of constructor EXP into the rtx TARGET.
4427 TARGET is either a REG or a MEM.
4428 ALIGN is the maximum known alignment for TARGET.
4429 CLEARED is true if TARGET is known to have been zero'd.
4430 SIZE is the number of bytes of TARGET we are allowed to modify: this
4431 may not be the same as the size of EXP if we are assigning to a field
4432 which has been packed to exclude padding bits. */
4435 store_constructor (exp, target, align, cleared, size)
4442 tree type = TREE_TYPE (exp);
4443 #ifdef WORD_REGISTER_OPERATIONS
4444 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4447 /* We know our target cannot conflict, since safe_from_p has been called. */
4449 /* Don't try copying piece by piece into a hard register
4450 since that is vulnerable to being clobbered by EXP.
4451 Instead, construct in a pseudo register and then copy it all. */
4452 if (GET_CODE (target) == REG && REGNO (target) < FIRST_PSEUDO_REGISTER)
4454 rtx temp = gen_reg_rtx (GET_MODE (target));
4455 store_constructor (exp, temp, align, cleared, size);
4456 emit_move_insn (target, temp);
4461 if (TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4462 || TREE_CODE (type) == QUAL_UNION_TYPE)
4466 /* Inform later passes that the whole union value is dead. */
4467 if ((TREE_CODE (type) == UNION_TYPE
4468 || TREE_CODE (type) == QUAL_UNION_TYPE)
4471 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4473 /* If the constructor is empty, clear the union. */
4474 if (! CONSTRUCTOR_ELTS (exp) && ! cleared)
4475 clear_storage (target, expr_size (exp), TYPE_ALIGN (type));
4478 /* If we are building a static constructor into a register,
4479 set the initial value as zero so we can fold the value into
4480 a constant. But if more than one register is involved,
4481 this probably loses. */
4482 else if (GET_CODE (target) == REG && TREE_STATIC (exp)
4483 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4486 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4491 /* If the constructor has fewer fields than the structure
4492 or if we are initializing the structure to mostly zeros,
4493 clear the whole structure first. Don't do this is TARGET is
4494 register whose mode size isn't equal to SIZE since clear_storage
4495 can't handle this case. */
4497 && ((list_length (CONSTRUCTOR_ELTS (exp))
4498 != fields_length (type))
4499 || mostly_zeros_p (exp))
4500 && (GET_CODE (target) != REG
4501 || (HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target)) == size))
4504 clear_storage (target, GEN_INT (size), align);
4509 /* Inform later passes that the old value is dead. */
4510 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4512 /* Store each element of the constructor into
4513 the corresponding field of TARGET. */
4515 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4517 register tree field = TREE_PURPOSE (elt);
4518 #ifdef WORD_REGISTER_OPERATIONS
4519 tree value = TREE_VALUE (elt);
4521 register enum machine_mode mode;
4522 HOST_WIDE_INT bitsize;
4523 HOST_WIDE_INT bitpos = 0;
4526 rtx to_rtx = target;
4528 /* Just ignore missing fields.
4529 We cleared the whole structure, above,
4530 if any fields are missing. */
4534 if (cleared && is_zeros_p (TREE_VALUE (elt)))
4537 if (host_integerp (DECL_SIZE (field), 1))
4538 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4542 unsignedp = TREE_UNSIGNED (field);
4543 mode = DECL_MODE (field);
4544 if (DECL_BIT_FIELD (field))
4547 offset = DECL_FIELD_OFFSET (field);
4548 if (host_integerp (offset, 0)
4549 && host_integerp (bit_position (field), 0))
4551 bitpos = int_bit_position (field);
4555 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4561 if (contains_placeholder_p (offset))
4562 offset = build (WITH_RECORD_EXPR, sizetype,
4563 offset, make_tree (TREE_TYPE (exp), target));
4565 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4566 if (GET_CODE (to_rtx) != MEM)
4569 if (GET_MODE (offset_rtx) != ptr_mode)
4571 #ifdef POINTERS_EXTEND_UNSIGNED
4572 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
4574 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4579 = change_address (to_rtx, VOIDmode,
4580 gen_rtx_PLUS (ptr_mode, XEXP (to_rtx, 0),
4581 force_reg (ptr_mode,
4583 align = DECL_OFFSET_ALIGN (field);
4586 if (TREE_READONLY (field))
4588 if (GET_CODE (to_rtx) == MEM)
4589 to_rtx = copy_rtx (to_rtx);
4591 RTX_UNCHANGING_P (to_rtx) = 1;
4594 #ifdef WORD_REGISTER_OPERATIONS
4595 /* If this initializes a field that is smaller than a word, at the
4596 start of a word, try to widen it to a full word.
4597 This special case allows us to output C++ member function
4598 initializations in a form that the optimizers can understand. */
4599 if (GET_CODE (target) == REG
4600 && bitsize < BITS_PER_WORD
4601 && bitpos % BITS_PER_WORD == 0
4602 && GET_MODE_CLASS (mode) == MODE_INT
4603 && TREE_CODE (value) == INTEGER_CST
4605 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4607 tree type = TREE_TYPE (value);
4608 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4610 type = type_for_size (BITS_PER_WORD, TREE_UNSIGNED (type));
4611 value = convert (type, value);
4613 if (BYTES_BIG_ENDIAN)
4615 = fold (build (LSHIFT_EXPR, type, value,
4616 build_int_2 (BITS_PER_WORD - bitsize, 0)));
4617 bitsize = BITS_PER_WORD;
4621 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4622 TREE_VALUE (elt), type, align, cleared,
4623 (DECL_NONADDRESSABLE_P (field)
4624 && GET_CODE (to_rtx) == MEM)
4625 ? MEM_ALIAS_SET (to_rtx)
4626 : get_alias_set (TREE_TYPE (field)));
4629 else if (TREE_CODE (type) == ARRAY_TYPE)
4634 tree domain = TYPE_DOMAIN (type);
4635 tree elttype = TREE_TYPE (type);
4636 int const_bounds_p = (host_integerp (TYPE_MIN_VALUE (domain), 0)
4637 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4638 HOST_WIDE_INT minelt;
4639 HOST_WIDE_INT maxelt;
4641 /* If we have constant bounds for the range of the type, get them. */
4644 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4645 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4648 /* If the constructor has fewer elements than the array,
4649 clear the whole array first. Similarly if this is
4650 static constructor of a non-BLKmode object. */
4651 if (cleared || (GET_CODE (target) == REG && TREE_STATIC (exp)))
4655 HOST_WIDE_INT count = 0, zero_count = 0;
4656 need_to_clear = ! const_bounds_p;
4658 /* This loop is a more accurate version of the loop in
4659 mostly_zeros_p (it handles RANGE_EXPR in an index).
4660 It is also needed to check for missing elements. */
4661 for (elt = CONSTRUCTOR_ELTS (exp);
4662 elt != NULL_TREE && ! need_to_clear;
4663 elt = TREE_CHAIN (elt))
4665 tree index = TREE_PURPOSE (elt);
4666 HOST_WIDE_INT this_node_count;
4668 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4670 tree lo_index = TREE_OPERAND (index, 0);
4671 tree hi_index = TREE_OPERAND (index, 1);
4673 if (! host_integerp (lo_index, 1)
4674 || ! host_integerp (hi_index, 1))
4680 this_node_count = (tree_low_cst (hi_index, 1)
4681 - tree_low_cst (lo_index, 1) + 1);
4684 this_node_count = 1;
4686 count += this_node_count;
4687 if (mostly_zeros_p (TREE_VALUE (elt)))
4688 zero_count += this_node_count;
4691 /* Clear the entire array first if there are any missing elements,
4692 or if the incidence of zero elements is >= 75%. */
4694 && (count < maxelt - minelt + 1 || 4 * zero_count >= 3 * count))
4698 if (need_to_clear && size > 0)
4701 clear_storage (target, GEN_INT (size), align);
4705 /* Inform later passes that the old value is dead. */
4706 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4708 /* Store each element of the constructor into
4709 the corresponding element of TARGET, determined
4710 by counting the elements. */
4711 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4713 elt = TREE_CHAIN (elt), i++)
4715 register enum machine_mode mode;
4716 HOST_WIDE_INT bitsize;
4717 HOST_WIDE_INT bitpos;
4719 tree value = TREE_VALUE (elt);
4720 unsigned int align = TYPE_ALIGN (TREE_TYPE (value));
4721 tree index = TREE_PURPOSE (elt);
4722 rtx xtarget = target;
4724 if (cleared && is_zeros_p (value))
4727 unsignedp = TREE_UNSIGNED (elttype);
4728 mode = TYPE_MODE (elttype);
4729 if (mode == BLKmode)
4730 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4731 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4734 bitsize = GET_MODE_BITSIZE (mode);
4736 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4738 tree lo_index = TREE_OPERAND (index, 0);
4739 tree hi_index = TREE_OPERAND (index, 1);
4740 rtx index_r, pos_rtx, addr, hi_r, loop_top, loop_end;
4741 struct nesting *loop;
4742 HOST_WIDE_INT lo, hi, count;
4745 /* If the range is constant and "small", unroll the loop. */
4747 && host_integerp (lo_index, 0)
4748 && host_integerp (hi_index, 0)
4749 && (lo = tree_low_cst (lo_index, 0),
4750 hi = tree_low_cst (hi_index, 0),
4751 count = hi - lo + 1,
4752 (GET_CODE (target) != MEM
4754 || (host_integerp (TYPE_SIZE (elttype), 1)
4755 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4758 lo -= minelt; hi -= minelt;
4759 for (; lo <= hi; lo++)
4761 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4762 store_constructor_field
4763 (target, bitsize, bitpos, mode, value, type, align,
4765 TYPE_NONALIASED_COMPONENT (type)
4766 ? MEM_ALIAS_SET (target) : get_alias_set (elttype));
4771 hi_r = expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4772 loop_top = gen_label_rtx ();
4773 loop_end = gen_label_rtx ();
4775 unsignedp = TREE_UNSIGNED (domain);
4777 index = build_decl (VAR_DECL, NULL_TREE, domain);
4779 DECL_RTL (index) = index_r
4780 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4783 if (TREE_CODE (value) == SAVE_EXPR
4784 && SAVE_EXPR_RTL (value) == 0)
4786 /* Make sure value gets expanded once before the
4788 expand_expr (value, const0_rtx, VOIDmode, 0);
4791 store_expr (lo_index, index_r, 0);
4792 loop = expand_start_loop (0);
4794 /* Assign value to element index. */
4796 = convert (ssizetype,
4797 fold (build (MINUS_EXPR, TREE_TYPE (index),
4798 index, TYPE_MIN_VALUE (domain))));
4799 position = size_binop (MULT_EXPR, position,
4801 TYPE_SIZE_UNIT (elttype)));
4803 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4804 addr = gen_rtx_PLUS (Pmode, XEXP (target, 0), pos_rtx);
4805 xtarget = change_address (target, mode, addr);
4806 if (TREE_CODE (value) == CONSTRUCTOR)
4807 store_constructor (value, xtarget, align, cleared,
4808 bitsize / BITS_PER_UNIT);
4810 store_expr (value, xtarget, 0);
4812 expand_exit_loop_if_false (loop,
4813 build (LT_EXPR, integer_type_node,
4816 expand_increment (build (PREINCREMENT_EXPR,
4818 index, integer_one_node), 0, 0);
4820 emit_label (loop_end);
4823 else if ((index != 0 && ! host_integerp (index, 0))
4824 || ! host_integerp (TYPE_SIZE (elttype), 1))
4830 index = ssize_int (1);
4833 index = convert (ssizetype,
4834 fold (build (MINUS_EXPR, index,
4835 TYPE_MIN_VALUE (domain))));
4837 position = size_binop (MULT_EXPR, index,
4839 TYPE_SIZE_UNIT (elttype)));
4840 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4841 addr = gen_rtx_PLUS (Pmode, XEXP (target, 0), pos_rtx);
4842 xtarget = change_address (target, mode, addr);
4843 store_expr (value, xtarget, 0);
4848 bitpos = ((tree_low_cst (index, 0) - minelt)
4849 * tree_low_cst (TYPE_SIZE (elttype), 1));
4851 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
4853 store_constructor_field (target, bitsize, bitpos, mode, value,
4854 type, align, cleared,
4855 TYPE_NONALIASED_COMPONENT (type)
4856 && GET_CODE (target) == MEM
4857 ? MEM_ALIAS_SET (target) :
4858 get_alias_set (elttype));
4864 /* Set constructor assignments. */
4865 else if (TREE_CODE (type) == SET_TYPE)
4867 tree elt = CONSTRUCTOR_ELTS (exp);
4868 unsigned HOST_WIDE_INT nbytes = int_size_in_bytes (type), nbits;
4869 tree domain = TYPE_DOMAIN (type);
4870 tree domain_min, domain_max, bitlength;
4872 /* The default implementation strategy is to extract the constant
4873 parts of the constructor, use that to initialize the target,
4874 and then "or" in whatever non-constant ranges we need in addition.
4876 If a large set is all zero or all ones, it is
4877 probably better to set it using memset (if available) or bzero.
4878 Also, if a large set has just a single range, it may also be
4879 better to first clear all the first clear the set (using
4880 bzero/memset), and set the bits we want. */
4882 /* Check for all zeros. */
4883 if (elt == NULL_TREE && size > 0)
4886 clear_storage (target, GEN_INT (size), TYPE_ALIGN (type));
4890 domain_min = convert (sizetype, TYPE_MIN_VALUE (domain));
4891 domain_max = convert (sizetype, TYPE_MAX_VALUE (domain));
4892 bitlength = size_binop (PLUS_EXPR,
4893 size_diffop (domain_max, domain_min),
4896 nbits = tree_low_cst (bitlength, 1);
4898 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
4899 are "complicated" (more than one range), initialize (the
4900 constant parts) by copying from a constant. */
4901 if (GET_MODE (target) != BLKmode || nbits <= 2 * BITS_PER_WORD
4902 || (nbytes <= 32 && TREE_CHAIN (elt) != NULL_TREE))
4904 unsigned int set_word_size = TYPE_ALIGN (TREE_TYPE (exp));
4905 enum machine_mode mode = mode_for_size (set_word_size, MODE_INT, 1);
4906 char *bit_buffer = (char *) alloca (nbits);
4907 HOST_WIDE_INT word = 0;
4908 unsigned int bit_pos = 0;
4909 unsigned int ibit = 0;
4910 unsigned int offset = 0; /* In bytes from beginning of set. */
4912 elt = get_set_constructor_bits (exp, bit_buffer, nbits);
4915 if (bit_buffer[ibit])
4917 if (BYTES_BIG_ENDIAN)
4918 word |= (1 << (set_word_size - 1 - bit_pos));
4920 word |= 1 << bit_pos;
4924 if (bit_pos >= set_word_size || ibit == nbits)
4926 if (word != 0 || ! cleared)
4928 rtx datum = GEN_INT (word);
4931 /* The assumption here is that it is safe to use
4932 XEXP if the set is multi-word, but not if
4933 it's single-word. */
4934 if (GET_CODE (target) == MEM)
4936 to_rtx = plus_constant (XEXP (target, 0), offset);
4937 to_rtx = change_address (target, mode, to_rtx);
4939 else if (offset == 0)
4943 emit_move_insn (to_rtx, datum);
4950 offset += set_word_size / BITS_PER_UNIT;
4955 /* Don't bother clearing storage if the set is all ones. */
4956 if (TREE_CHAIN (elt) != NULL_TREE
4957 || (TREE_PURPOSE (elt) == NULL_TREE
4959 : ( ! host_integerp (TREE_VALUE (elt), 0)
4960 || ! host_integerp (TREE_PURPOSE (elt), 0)
4961 || (tree_low_cst (TREE_VALUE (elt), 0)
4962 - tree_low_cst (TREE_PURPOSE (elt), 0) + 1
4963 != (HOST_WIDE_INT) nbits))))
4964 clear_storage (target, expr_size (exp), TYPE_ALIGN (type));
4966 for (; elt != NULL_TREE; elt = TREE_CHAIN (elt))
4968 /* Start of range of element or NULL. */
4969 tree startbit = TREE_PURPOSE (elt);
4970 /* End of range of element, or element value. */
4971 tree endbit = TREE_VALUE (elt);
4972 #ifdef TARGET_MEM_FUNCTIONS
4973 HOST_WIDE_INT startb, endb;
4975 rtx bitlength_rtx, startbit_rtx, endbit_rtx, targetx;
4977 bitlength_rtx = expand_expr (bitlength,
4978 NULL_RTX, MEM, EXPAND_CONST_ADDRESS);
4980 /* Handle non-range tuple element like [ expr ]. */
4981 if (startbit == NULL_TREE)
4983 startbit = save_expr (endbit);
4987 startbit = convert (sizetype, startbit);
4988 endbit = convert (sizetype, endbit);
4989 if (! integer_zerop (domain_min))
4991 startbit = size_binop (MINUS_EXPR, startbit, domain_min);
4992 endbit = size_binop (MINUS_EXPR, endbit, domain_min);
4994 startbit_rtx = expand_expr (startbit, NULL_RTX, MEM,
4995 EXPAND_CONST_ADDRESS);
4996 endbit_rtx = expand_expr (endbit, NULL_RTX, MEM,
4997 EXPAND_CONST_ADDRESS);
5003 ((build_qualified_type (type_for_mode (GET_MODE (target), 0),
5006 emit_move_insn (targetx, target);
5009 else if (GET_CODE (target) == MEM)
5014 #ifdef TARGET_MEM_FUNCTIONS
5015 /* Optimization: If startbit and endbit are
5016 constants divisible by BITS_PER_UNIT,
5017 call memset instead. */
5018 if (TREE_CODE (startbit) == INTEGER_CST
5019 && TREE_CODE (endbit) == INTEGER_CST
5020 && (startb = TREE_INT_CST_LOW (startbit)) % BITS_PER_UNIT == 0
5021 && (endb = TREE_INT_CST_LOW (endbit) + 1) % BITS_PER_UNIT == 0)
5023 emit_library_call (memset_libfunc, LCT_NORMAL,
5025 plus_constant (XEXP (targetx, 0),
5026 startb / BITS_PER_UNIT),
5028 constm1_rtx, TYPE_MODE (integer_type_node),
5029 GEN_INT ((endb - startb) / BITS_PER_UNIT),
5030 TYPE_MODE (sizetype));
5034 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__setbits"),
5035 LCT_NORMAL, VOIDmode, 4, XEXP (targetx, 0),
5036 Pmode, bitlength_rtx, TYPE_MODE (sizetype),
5037 startbit_rtx, TYPE_MODE (sizetype),
5038 endbit_rtx, TYPE_MODE (sizetype));
5041 emit_move_insn (target, targetx);
5049 /* Store the value of EXP (an expression tree)
5050 into a subfield of TARGET which has mode MODE and occupies
5051 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5052 If MODE is VOIDmode, it means that we are storing into a bit-field.
5054 If VALUE_MODE is VOIDmode, return nothing in particular.
5055 UNSIGNEDP is not used in this case.
5057 Otherwise, return an rtx for the value stored. This rtx
5058 has mode VALUE_MODE if that is convenient to do.
5059 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
5061 ALIGN is the alignment that TARGET is known to have.
5062 TOTAL_SIZE is the size in bytes of the structure, or -1 if varying.
5064 ALIAS_SET is the alias set for the destination. This value will
5065 (in general) be different from that for TARGET, since TARGET is a
5066 reference to the containing structure. */
5069 store_field (target, bitsize, bitpos, mode, exp, value_mode,
5070 unsignedp, align, total_size, alias_set)
5072 HOST_WIDE_INT bitsize;
5073 HOST_WIDE_INT bitpos;
5074 enum machine_mode mode;
5076 enum machine_mode value_mode;
5079 HOST_WIDE_INT total_size;
5082 HOST_WIDE_INT width_mask = 0;
5084 if (TREE_CODE (exp) == ERROR_MARK)
5087 if (bitsize < HOST_BITS_PER_WIDE_INT)
5088 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5090 /* If we are storing into an unaligned field of an aligned union that is
5091 in a register, we may have the mode of TARGET being an integer mode but
5092 MODE == BLKmode. In that case, get an aligned object whose size and
5093 alignment are the same as TARGET and store TARGET into it (we can avoid
5094 the store if the field being stored is the entire width of TARGET). Then
5095 call ourselves recursively to store the field into a BLKmode version of
5096 that object. Finally, load from the object into TARGET. This is not
5097 very efficient in general, but should only be slightly more expensive
5098 than the otherwise-required unaligned accesses. Perhaps this can be
5099 cleaned up later. */
5102 && (GET_CODE (target) == REG || GET_CODE (target) == SUBREG))
5106 (build_qualified_type (type_for_mode (GET_MODE (target), 0),
5109 rtx blk_object = copy_rtx (object);
5111 PUT_MODE (blk_object, BLKmode);
5113 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5114 emit_move_insn (object, target);
5116 store_field (blk_object, bitsize, bitpos, mode, exp, VOIDmode, 0,
5117 align, total_size, alias_set);
5119 /* Even though we aren't returning target, we need to
5120 give it the updated value. */
5121 emit_move_insn (target, object);
5126 if (GET_CODE (target) == CONCAT)
5128 /* We're storing into a struct containing a single __complex. */
5132 return store_expr (exp, target, 0);
5135 /* If the structure is in a register or if the component
5136 is a bit field, we cannot use addressing to access it.
5137 Use bit-field techniques or SUBREG to store in it. */
5139 if (mode == VOIDmode
5140 || (mode != BLKmode && ! direct_store[(int) mode]
5141 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5142 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5143 || GET_CODE (target) == REG
5144 || GET_CODE (target) == SUBREG
5145 /* If the field isn't aligned enough to store as an ordinary memref,
5146 store it as a bit field. */
5147 || (mode != BLKmode && SLOW_UNALIGNED_ACCESS (mode, align)
5148 && (align < GET_MODE_ALIGNMENT (mode)
5149 || bitpos % GET_MODE_ALIGNMENT (mode)))
5150 || (mode == BLKmode && SLOW_UNALIGNED_ACCESS (mode, align)
5151 && (TYPE_ALIGN (TREE_TYPE (exp)) > align
5152 || bitpos % TYPE_ALIGN (TREE_TYPE (exp)) != 0))
5153 /* If the RHS and field are a constant size and the size of the
5154 RHS isn't the same size as the bitfield, we must use bitfield
5157 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5158 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5160 rtx temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5162 /* If BITSIZE is narrower than the size of the type of EXP
5163 we will be narrowing TEMP. Normally, what's wanted are the
5164 low-order bits. However, if EXP's type is a record and this is
5165 big-endian machine, we want the upper BITSIZE bits. */
5166 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5167 && bitsize < GET_MODE_BITSIZE (GET_MODE (temp))
5168 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5169 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5170 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5174 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5176 if (mode != VOIDmode && mode != BLKmode
5177 && mode != TYPE_MODE (TREE_TYPE (exp)))
5178 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5180 /* If the modes of TARGET and TEMP are both BLKmode, both
5181 must be in memory and BITPOS must be aligned on a byte
5182 boundary. If so, we simply do a block copy. */
5183 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5185 unsigned int exp_align = expr_align (exp);
5187 if (GET_CODE (target) != MEM || GET_CODE (temp) != MEM
5188 || bitpos % BITS_PER_UNIT != 0)
5191 target = change_address (target, VOIDmode,
5192 plus_constant (XEXP (target, 0),
5193 bitpos / BITS_PER_UNIT));
5195 /* Make sure that ALIGN is no stricter than the alignment of EXP. */
5196 align = MIN (exp_align, align);
5198 /* Find an alignment that is consistent with the bit position. */
5199 while ((bitpos % align) != 0)
5202 emit_block_move (target, temp,
5203 bitsize == -1 ? expr_size (exp)
5204 : GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5208 return value_mode == VOIDmode ? const0_rtx : target;
5211 /* Store the value in the bitfield. */
5212 store_bit_field (target, bitsize, bitpos, mode, temp, align, total_size);
5213 if (value_mode != VOIDmode)
5215 /* The caller wants an rtx for the value. */
5216 /* If possible, avoid refetching from the bitfield itself. */
5218 && ! (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)))
5221 enum machine_mode tmode;
5224 return expand_and (temp, GEN_INT (width_mask), NULL_RTX);
5225 tmode = GET_MODE (temp);
5226 if (tmode == VOIDmode)
5228 count = build_int_2 (GET_MODE_BITSIZE (tmode) - bitsize, 0);
5229 temp = expand_shift (LSHIFT_EXPR, tmode, temp, count, 0, 0);
5230 return expand_shift (RSHIFT_EXPR, tmode, temp, count, 0, 0);
5232 return extract_bit_field (target, bitsize, bitpos, unsignedp,
5233 NULL_RTX, value_mode, 0, align,
5240 rtx addr = XEXP (target, 0);
5243 /* If a value is wanted, it must be the lhs;
5244 so make the address stable for multiple use. */
5246 if (value_mode != VOIDmode && GET_CODE (addr) != REG
5247 && ! CONSTANT_ADDRESS_P (addr)
5248 /* A frame-pointer reference is already stable. */
5249 && ! (GET_CODE (addr) == PLUS
5250 && GET_CODE (XEXP (addr, 1)) == CONST_INT
5251 && (XEXP (addr, 0) == virtual_incoming_args_rtx
5252 || XEXP (addr, 0) == virtual_stack_vars_rtx)))
5253 addr = copy_to_reg (addr);
5255 /* Now build a reference to just the desired component. */
5257 to_rtx = copy_rtx (change_address (target, mode,
5258 plus_constant (addr,
5260 / BITS_PER_UNIT))));
5261 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5262 MEM_ALIAS_SET (to_rtx) = alias_set;
5264 return store_expr (exp, to_rtx, value_mode != VOIDmode);
5268 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5269 or an ARRAY_REF, look for nested COMPONENT_REFs, BIT_FIELD_REFs, or
5270 ARRAY_REFs and find the ultimate containing object, which we return.
5272 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5273 bit position, and *PUNSIGNEDP to the signedness of the field.
5274 If the position of the field is variable, we store a tree
5275 giving the variable offset (in units) in *POFFSET.
5276 This offset is in addition to the bit position.
5277 If the position is not variable, we store 0 in *POFFSET.
5278 We set *PALIGNMENT to the alignment of the address that will be
5279 computed. This is the alignment of the thing we return if *POFFSET
5280 is zero, but can be more less strictly aligned if *POFFSET is nonzero.
5282 If any of the extraction expressions is volatile,
5283 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5285 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5286 is a mode that can be used to access the field. In that case, *PBITSIZE
5289 If the field describes a variable-sized object, *PMODE is set to
5290 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5291 this case, but the address of the object can be found. */
5294 get_inner_reference (exp, pbitsize, pbitpos, poffset, pmode,
5295 punsignedp, pvolatilep, palignment)
5297 HOST_WIDE_INT *pbitsize;
5298 HOST_WIDE_INT *pbitpos;
5300 enum machine_mode *pmode;
5303 unsigned int *palignment;
5306 enum machine_mode mode = VOIDmode;
5307 tree offset = size_zero_node;
5308 tree bit_offset = bitsize_zero_node;
5309 unsigned int alignment = BIGGEST_ALIGNMENT;
5312 /* First get the mode, signedness, and size. We do this from just the
5313 outermost expression. */
5314 if (TREE_CODE (exp) == COMPONENT_REF)
5316 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5317 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5318 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5320 *punsignedp = TREE_UNSIGNED (TREE_OPERAND (exp, 1));
5322 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5324 size_tree = TREE_OPERAND (exp, 1);
5325 *punsignedp = TREE_UNSIGNED (exp);
5329 mode = TYPE_MODE (TREE_TYPE (exp));
5330 *punsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
5332 if (mode == BLKmode)
5333 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5335 *pbitsize = GET_MODE_BITSIZE (mode);
5340 if (! host_integerp (size_tree, 1))
5341 mode = BLKmode, *pbitsize = -1;
5343 *pbitsize = tree_low_cst (size_tree, 1);
5346 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5347 and find the ultimate containing object. */
5350 if (TREE_CODE (exp) == BIT_FIELD_REF)
5351 bit_offset = size_binop (PLUS_EXPR, bit_offset, TREE_OPERAND (exp, 2));
5352 else if (TREE_CODE (exp) == COMPONENT_REF)
5354 tree field = TREE_OPERAND (exp, 1);
5355 tree this_offset = DECL_FIELD_OFFSET (field);
5357 /* If this field hasn't been filled in yet, don't go
5358 past it. This should only happen when folding expressions
5359 made during type construction. */
5360 if (this_offset == 0)
5362 else if (! TREE_CONSTANT (this_offset)
5363 && contains_placeholder_p (this_offset))
5364 this_offset = build (WITH_RECORD_EXPR, sizetype, this_offset, exp);
5366 offset = size_binop (PLUS_EXPR, offset, this_offset);
5367 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5368 DECL_FIELD_BIT_OFFSET (field));
5370 if (! host_integerp (offset, 0))
5371 alignment = MIN (alignment, DECL_OFFSET_ALIGN (field));
5374 else if (TREE_CODE (exp) == ARRAY_REF)
5376 tree index = TREE_OPERAND (exp, 1);
5377 tree domain = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5378 tree low_bound = (domain ? TYPE_MIN_VALUE (domain) : 0);
5379 tree unit_size = TYPE_SIZE_UNIT (TREE_TYPE (exp));
5381 /* We assume all arrays have sizes that are a multiple of a byte.
5382 First subtract the lower bound, if any, in the type of the
5383 index, then convert to sizetype and multiply by the size of the
5385 if (low_bound != 0 && ! integer_zerop (low_bound))
5386 index = fold (build (MINUS_EXPR, TREE_TYPE (index),
5389 /* If the index has a self-referential type, pass it to a
5390 WITH_RECORD_EXPR; if the component size is, pass our
5391 component to one. */
5392 if (! TREE_CONSTANT (index)
5393 && contains_placeholder_p (index))
5394 index = build (WITH_RECORD_EXPR, TREE_TYPE (index), index, exp);
5395 if (! TREE_CONSTANT (unit_size)
5396 && contains_placeholder_p (unit_size))
5397 unit_size = build (WITH_RECORD_EXPR, sizetype, unit_size,
5398 TREE_OPERAND (exp, 0));
5400 offset = size_binop (PLUS_EXPR, offset,
5401 size_binop (MULT_EXPR,
5402 convert (sizetype, index),
5406 else if (TREE_CODE (exp) != NON_LVALUE_EXPR
5407 && ! ((TREE_CODE (exp) == NOP_EXPR
5408 || TREE_CODE (exp) == CONVERT_EXPR)
5409 && (TYPE_MODE (TREE_TYPE (exp))
5410 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
5413 /* If any reference in the chain is volatile, the effect is volatile. */
5414 if (TREE_THIS_VOLATILE (exp))
5417 /* If the offset is non-constant already, then we can't assume any
5418 alignment more than the alignment here. */
5419 if (! TREE_CONSTANT (offset))
5420 alignment = MIN (alignment, TYPE_ALIGN (TREE_TYPE (exp)));
5422 exp = TREE_OPERAND (exp, 0);
5426 alignment = MIN (alignment, DECL_ALIGN (exp));
5427 else if (TREE_TYPE (exp) != 0)
5428 alignment = MIN (alignment, TYPE_ALIGN (TREE_TYPE (exp)));
5430 /* If OFFSET is constant, see if we can return the whole thing as a
5431 constant bit position. Otherwise, split it up. */
5432 if (host_integerp (offset, 0)
5433 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5435 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5436 && host_integerp (tem, 0))
5437 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5439 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5442 *palignment = alignment;
5446 /* Subroutine of expand_exp: compute memory_usage from modifier. */
5448 static enum memory_use_mode
5449 get_memory_usage_from_modifier (modifier)
5450 enum expand_modifier modifier;
5456 return MEMORY_USE_RO;
5458 case EXPAND_MEMORY_USE_WO:
5459 return MEMORY_USE_WO;
5461 case EXPAND_MEMORY_USE_RW:
5462 return MEMORY_USE_RW;
5464 case EXPAND_MEMORY_USE_DONT:
5465 /* EXPAND_CONST_ADDRESS and EXPAND_INITIALIZER are converted into
5466 MEMORY_USE_DONT, because they are modifiers to a call of
5467 expand_expr in the ADDR_EXPR case of expand_expr. */
5468 case EXPAND_CONST_ADDRESS:
5469 case EXPAND_INITIALIZER:
5470 return MEMORY_USE_DONT;
5471 case EXPAND_MEMORY_USE_BAD:
5477 /* Given an rtx VALUE that may contain additions and multiplications, return
5478 an equivalent value that just refers to a register, memory, or constant.
5479 This is done by generating instructions to perform the arithmetic and
5480 returning a pseudo-register containing the value.
5482 The returned value may be a REG, SUBREG, MEM or constant. */
5485 force_operand (value, target)
5488 register optab binoptab = 0;
5489 /* Use a temporary to force order of execution of calls to
5493 /* Use subtarget as the target for operand 0 of a binary operation. */
5494 register rtx subtarget = get_subtarget (target);
5496 /* Check for a PIC address load. */
5498 && (GET_CODE (value) == PLUS || GET_CODE (value) == MINUS)
5499 && XEXP (value, 0) == pic_offset_table_rtx
5500 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5501 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5502 || GET_CODE (XEXP (value, 1)) == CONST))
5505 subtarget = gen_reg_rtx (GET_MODE (value));
5506 emit_move_insn (subtarget, value);
5510 if (GET_CODE (value) == PLUS)
5511 binoptab = add_optab;
5512 else if (GET_CODE (value) == MINUS)
5513 binoptab = sub_optab;
5514 else if (GET_CODE (value) == MULT)
5516 op2 = XEXP (value, 1);
5517 if (!CONSTANT_P (op2)
5518 && !(GET_CODE (op2) == REG && op2 != subtarget))
5520 tmp = force_operand (XEXP (value, 0), subtarget);
5521 return expand_mult (GET_MODE (value), tmp,
5522 force_operand (op2, NULL_RTX),
5528 op2 = XEXP (value, 1);
5529 if (!CONSTANT_P (op2)
5530 && !(GET_CODE (op2) == REG && op2 != subtarget))
5532 if (binoptab == sub_optab && GET_CODE (op2) == CONST_INT)
5534 binoptab = add_optab;
5535 op2 = negate_rtx (GET_MODE (value), op2);
5538 /* Check for an addition with OP2 a constant integer and our first
5539 operand a PLUS of a virtual register and something else. In that
5540 case, we want to emit the sum of the virtual register and the
5541 constant first and then add the other value. This allows virtual
5542 register instantiation to simply modify the constant rather than
5543 creating another one around this addition. */
5544 if (binoptab == add_optab && GET_CODE (op2) == CONST_INT
5545 && GET_CODE (XEXP (value, 0)) == PLUS
5546 && GET_CODE (XEXP (XEXP (value, 0), 0)) == REG
5547 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5548 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5550 rtx temp = expand_binop (GET_MODE (value), binoptab,
5551 XEXP (XEXP (value, 0), 0), op2,
5552 subtarget, 0, OPTAB_LIB_WIDEN);
5553 return expand_binop (GET_MODE (value), binoptab, temp,
5554 force_operand (XEXP (XEXP (value, 0), 1), 0),
5555 target, 0, OPTAB_LIB_WIDEN);
5558 tmp = force_operand (XEXP (value, 0), subtarget);
5559 return expand_binop (GET_MODE (value), binoptab, tmp,
5560 force_operand (op2, NULL_RTX),
5561 target, 0, OPTAB_LIB_WIDEN);
5562 /* We give UNSIGNEDP = 0 to expand_binop
5563 because the only operations we are expanding here are signed ones. */
5568 /* Subroutine of expand_expr:
5569 save the non-copied parts (LIST) of an expr (LHS), and return a list
5570 which can restore these values to their previous values,
5571 should something modify their storage. */
5574 save_noncopied_parts (lhs, list)
5581 for (tail = list; tail; tail = TREE_CHAIN (tail))
5582 if (TREE_CODE (TREE_VALUE (tail)) == TREE_LIST)
5583 parts = chainon (parts, save_noncopied_parts (lhs, TREE_VALUE (tail)));
5586 tree part = TREE_VALUE (tail);
5587 tree part_type = TREE_TYPE (part);
5588 tree to_be_saved = build (COMPONENT_REF, part_type, lhs, part);
5590 = assign_temp (build_qualified_type (part_type,
5591 (TYPE_QUALS (part_type)
5592 | TYPE_QUAL_CONST)),
5595 if (! memory_address_p (TYPE_MODE (part_type), XEXP (target, 0)))
5596 target = change_address (target, TYPE_MODE (part_type), NULL_RTX);
5597 parts = tree_cons (to_be_saved,
5598 build (RTL_EXPR, part_type, NULL_TREE,
5601 store_expr (TREE_PURPOSE (parts), RTL_EXPR_RTL (TREE_VALUE (parts)), 0);
5606 /* Subroutine of expand_expr:
5607 record the non-copied parts (LIST) of an expr (LHS), and return a list
5608 which specifies the initial values of these parts. */
5611 init_noncopied_parts (lhs, list)
5618 for (tail = list; tail; tail = TREE_CHAIN (tail))
5619 if (TREE_CODE (TREE_VALUE (tail)) == TREE_LIST)
5620 parts = chainon (parts, init_noncopied_parts (lhs, TREE_VALUE (tail)));
5621 else if (TREE_PURPOSE (tail))
5623 tree part = TREE_VALUE (tail);
5624 tree part_type = TREE_TYPE (part);
5625 tree to_be_initialized = build (COMPONENT_REF, part_type, lhs, part);
5626 parts = tree_cons (TREE_PURPOSE (tail), to_be_initialized, parts);
5631 /* Subroutine of expand_expr: return nonzero iff there is no way that
5632 EXP can reference X, which is being modified. TOP_P is nonzero if this
5633 call is going to be used to determine whether we need a temporary
5634 for EXP, as opposed to a recursive call to this function.
5636 It is always safe for this routine to return zero since it merely
5637 searches for optimization opportunities. */
5640 safe_from_p (x, exp, top_p)
5647 static tree save_expr_list;
5650 /* If EXP has varying size, we MUST use a target since we currently
5651 have no way of allocating temporaries of variable size
5652 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5653 So we assume here that something at a higher level has prevented a
5654 clash. This is somewhat bogus, but the best we can do. Only
5655 do this when X is BLKmode and when we are at the top level. */
5656 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5657 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5658 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5659 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5660 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5662 && GET_MODE (x) == BLKmode)
5663 /* If X is in the outgoing argument area, it is always safe. */
5664 || (GET_CODE (x) == MEM
5665 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5666 || (GET_CODE (XEXP (x, 0)) == PLUS
5667 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5670 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5671 find the underlying pseudo. */
5672 if (GET_CODE (x) == SUBREG)
5675 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5679 /* A SAVE_EXPR might appear many times in the expression passed to the
5680 top-level safe_from_p call, and if it has a complex subexpression,
5681 examining it multiple times could result in a combinatorial explosion.
5682 E.g. on an Alpha running at least 200MHz, a Fortran test case compiled
5683 with optimization took about 28 minutes to compile -- even though it was
5684 only a few lines long. So we mark each SAVE_EXPR we see with TREE_PRIVATE
5685 and turn that off when we are done. We keep a list of the SAVE_EXPRs
5686 we have processed. Note that the only test of top_p was above. */
5695 rtn = safe_from_p (x, exp, 0);
5697 for (t = save_expr_list; t != 0; t = TREE_CHAIN (t))
5698 TREE_PRIVATE (TREE_PURPOSE (t)) = 0;
5703 /* Now look at our tree code and possibly recurse. */
5704 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5707 exp_rtl = DECL_RTL (exp);
5714 if (TREE_CODE (exp) == TREE_LIST)
5715 return ((TREE_VALUE (exp) == 0
5716 || safe_from_p (x, TREE_VALUE (exp), 0))
5717 && (TREE_CHAIN (exp) == 0
5718 || safe_from_p (x, TREE_CHAIN (exp), 0)));
5719 else if (TREE_CODE (exp) == ERROR_MARK)
5720 return 1; /* An already-visited SAVE_EXPR? */
5725 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5729 return (safe_from_p (x, TREE_OPERAND (exp, 0), 0)
5730 && safe_from_p (x, TREE_OPERAND (exp, 1), 0));
5734 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5735 the expression. If it is set, we conflict iff we are that rtx or
5736 both are in memory. Otherwise, we check all operands of the
5737 expression recursively. */
5739 switch (TREE_CODE (exp))
5742 return (staticp (TREE_OPERAND (exp, 0))
5743 || TREE_STATIC (exp)
5744 || safe_from_p (x, TREE_OPERAND (exp, 0), 0));
5747 if (GET_CODE (x) == MEM
5748 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5749 get_alias_set (exp)))
5754 /* Assume that the call will clobber all hard registers and
5756 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5757 || GET_CODE (x) == MEM)
5762 /* If a sequence exists, we would have to scan every instruction
5763 in the sequence to see if it was safe. This is probably not
5765 if (RTL_EXPR_SEQUENCE (exp))
5768 exp_rtl = RTL_EXPR_RTL (exp);
5771 case WITH_CLEANUP_EXPR:
5772 exp_rtl = RTL_EXPR_RTL (exp);
5775 case CLEANUP_POINT_EXPR:
5776 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5779 exp_rtl = SAVE_EXPR_RTL (exp);
5783 /* If we've already scanned this, don't do it again. Otherwise,
5784 show we've scanned it and record for clearing the flag if we're
5786 if (TREE_PRIVATE (exp))
5789 TREE_PRIVATE (exp) = 1;
5790 if (! safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5792 TREE_PRIVATE (exp) = 0;
5796 save_expr_list = tree_cons (exp, NULL_TREE, save_expr_list);
5800 /* The only operand we look at is operand 1. The rest aren't
5801 part of the expression. */
5802 return safe_from_p (x, TREE_OPERAND (exp, 1), 0);
5804 case METHOD_CALL_EXPR:
5805 /* This takes a rtx argument, but shouldn't appear here. */
5812 /* If we have an rtx, we do not need to scan our operands. */
5816 nops = first_rtl_op (TREE_CODE (exp));
5817 for (i = 0; i < nops; i++)
5818 if (TREE_OPERAND (exp, i) != 0
5819 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5822 /* If this is a language-specific tree code, it may require
5823 special handling. */
5824 if ((unsigned int) TREE_CODE (exp)
5825 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5827 && !(*lang_safe_from_p) (x, exp))
5831 /* If we have an rtl, find any enclosed object. Then see if we conflict
5835 if (GET_CODE (exp_rtl) == SUBREG)
5837 exp_rtl = SUBREG_REG (exp_rtl);
5838 if (GET_CODE (exp_rtl) == REG
5839 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5843 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5844 are memory and they conflict. */
5845 return ! (rtx_equal_p (x, exp_rtl)
5846 || (GET_CODE (x) == MEM && GET_CODE (exp_rtl) == MEM
5847 && true_dependence (exp_rtl, GET_MODE (x), x,
5848 rtx_addr_varies_p)));
5851 /* If we reach here, it is safe. */
5855 /* Subroutine of expand_expr: return nonzero iff EXP is an
5856 expression whose type is statically determinable. */
5862 if (TREE_CODE (exp) == PARM_DECL
5863 || TREE_CODE (exp) == VAR_DECL
5864 || TREE_CODE (exp) == CALL_EXPR || TREE_CODE (exp) == TARGET_EXPR
5865 || TREE_CODE (exp) == COMPONENT_REF
5866 || TREE_CODE (exp) == ARRAY_REF)
5871 /* Subroutine of expand_expr: return rtx if EXP is a
5872 variable or parameter; else return 0. */
5879 switch (TREE_CODE (exp))
5883 return DECL_RTL (exp);
5889 #ifdef MAX_INTEGER_COMPUTATION_MODE
5892 check_max_integer_computation_mode (exp)
5895 enum tree_code code;
5896 enum machine_mode mode;
5898 /* Strip any NOPs that don't change the mode. */
5900 code = TREE_CODE (exp);
5902 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
5903 if (code == NOP_EXPR
5904 && TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
5907 /* First check the type of the overall operation. We need only look at
5908 unary, binary and relational operations. */
5909 if (TREE_CODE_CLASS (code) == '1'
5910 || TREE_CODE_CLASS (code) == '2'
5911 || TREE_CODE_CLASS (code) == '<')
5913 mode = TYPE_MODE (TREE_TYPE (exp));
5914 if (GET_MODE_CLASS (mode) == MODE_INT
5915 && mode > MAX_INTEGER_COMPUTATION_MODE)
5916 internal_error ("unsupported wide integer operation");
5919 /* Check operand of a unary op. */
5920 if (TREE_CODE_CLASS (code) == '1')
5922 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5923 if (GET_MODE_CLASS (mode) == MODE_INT
5924 && mode > MAX_INTEGER_COMPUTATION_MODE)
5925 internal_error ("unsupported wide integer operation");
5928 /* Check operands of a binary/comparison op. */
5929 if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<')
5931 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5932 if (GET_MODE_CLASS (mode) == MODE_INT
5933 && mode > MAX_INTEGER_COMPUTATION_MODE)
5934 internal_error ("unsupported wide integer operation");
5936 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1)));
5937 if (GET_MODE_CLASS (mode) == MODE_INT
5938 && mode > MAX_INTEGER_COMPUTATION_MODE)
5939 internal_error ("unsupported wide integer operation");
5944 /* expand_expr: generate code for computing expression EXP.
5945 An rtx for the computed value is returned. The value is never null.
5946 In the case of a void EXP, const0_rtx is returned.
5948 The value may be stored in TARGET if TARGET is nonzero.
5949 TARGET is just a suggestion; callers must assume that
5950 the rtx returned may not be the same as TARGET.
5952 If TARGET is CONST0_RTX, it means that the value will be ignored.
5954 If TMODE is not VOIDmode, it suggests generating the
5955 result in mode TMODE. But this is done only when convenient.
5956 Otherwise, TMODE is ignored and the value generated in its natural mode.
5957 TMODE is just a suggestion; callers must assume that
5958 the rtx returned may not have mode TMODE.
5960 Note that TARGET may have neither TMODE nor MODE. In that case, it
5961 probably will not be used.
5963 If MODIFIER is EXPAND_SUM then when EXP is an addition
5964 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
5965 or a nest of (PLUS ...) and (MINUS ...) where the terms are
5966 products as above, or REG or MEM, or constant.
5967 Ordinarily in such cases we would output mul or add instructions
5968 and then return a pseudo reg containing the sum.
5970 EXPAND_INITIALIZER is much like EXPAND_SUM except that
5971 it also marks a label as absolutely required (it can't be dead).
5972 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
5973 This is used for outputting expressions used in initializers.
5975 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
5976 with a constant address even if that address is not normally legitimate.
5977 EXPAND_INITIALIZER and EXPAND_SUM also have this effect. */
5980 expand_expr (exp, target, tmode, modifier)
5983 enum machine_mode tmode;
5984 enum expand_modifier modifier;
5986 register rtx op0, op1, temp;
5987 tree type = TREE_TYPE (exp);
5988 int unsignedp = TREE_UNSIGNED (type);
5989 register enum machine_mode mode;
5990 register enum tree_code code = TREE_CODE (exp);
5992 rtx subtarget, original_target;
5995 /* Used by check-memory-usage to make modifier read only. */
5996 enum expand_modifier ro_modifier;
5998 /* Handle ERROR_MARK before anybody tries to access its type. */
5999 if (TREE_CODE (exp) == ERROR_MARK || TREE_CODE (type) == ERROR_MARK)
6001 op0 = CONST0_RTX (tmode);
6007 mode = TYPE_MODE (type);
6008 /* Use subtarget as the target for operand 0 of a binary operation. */
6009 subtarget = get_subtarget (target);
6010 original_target = target;
6011 ignore = (target == const0_rtx
6012 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6013 || code == CONVERT_EXPR || code == REFERENCE_EXPR
6014 || code == COND_EXPR)
6015 && TREE_CODE (type) == VOID_TYPE));
6017 /* Make a read-only version of the modifier. */
6018 if (modifier == EXPAND_NORMAL || modifier == EXPAND_SUM
6019 || modifier == EXPAND_CONST_ADDRESS || modifier == EXPAND_INITIALIZER)
6020 ro_modifier = modifier;
6022 ro_modifier = EXPAND_NORMAL;
6024 /* If we are going to ignore this result, we need only do something
6025 if there is a side-effect somewhere in the expression. If there
6026 is, short-circuit the most common cases here. Note that we must
6027 not call expand_expr with anything but const0_rtx in case this
6028 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6032 if (! TREE_SIDE_EFFECTS (exp))
6035 /* Ensure we reference a volatile object even if value is ignored, but
6036 don't do this if all we are doing is taking its address. */
6037 if (TREE_THIS_VOLATILE (exp)
6038 && TREE_CODE (exp) != FUNCTION_DECL
6039 && mode != VOIDmode && mode != BLKmode
6040 && modifier != EXPAND_CONST_ADDRESS)
6042 temp = expand_expr (exp, NULL_RTX, VOIDmode, ro_modifier);
6043 if (GET_CODE (temp) == MEM)
6044 temp = copy_to_reg (temp);
6048 if (TREE_CODE_CLASS (code) == '1' || code == COMPONENT_REF
6049 || code == INDIRECT_REF || code == BUFFER_REF)
6050 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx,
6051 VOIDmode, ro_modifier);
6052 else if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<'
6053 || code == ARRAY_REF)
6055 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, ro_modifier);
6056 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, ro_modifier);
6059 else if ((code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6060 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
6061 /* If the second operand has no side effects, just evaluate
6063 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx,
6064 VOIDmode, ro_modifier);
6065 else if (code == BIT_FIELD_REF)
6067 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, ro_modifier);
6068 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, ro_modifier);
6069 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, ro_modifier);
6076 #ifdef MAX_INTEGER_COMPUTATION_MODE
6077 /* Only check stuff here if the mode we want is different from the mode
6078 of the expression; if it's the same, check_max_integer_computiation_mode
6079 will handle it. Do we really need to check this stuff at all? */
6082 && GET_MODE (target) != mode
6083 && TREE_CODE (exp) != INTEGER_CST
6084 && TREE_CODE (exp) != PARM_DECL
6085 && TREE_CODE (exp) != ARRAY_REF
6086 && TREE_CODE (exp) != COMPONENT_REF
6087 && TREE_CODE (exp) != BIT_FIELD_REF
6088 && TREE_CODE (exp) != INDIRECT_REF
6089 && TREE_CODE (exp) != CALL_EXPR
6090 && TREE_CODE (exp) != VAR_DECL
6091 && TREE_CODE (exp) != RTL_EXPR)
6093 enum machine_mode mode = GET_MODE (target);
6095 if (GET_MODE_CLASS (mode) == MODE_INT
6096 && mode > MAX_INTEGER_COMPUTATION_MODE)
6097 internal_error ("unsupported wide integer operation");
6101 && TREE_CODE (exp) != INTEGER_CST
6102 && TREE_CODE (exp) != PARM_DECL
6103 && TREE_CODE (exp) != ARRAY_REF
6104 && TREE_CODE (exp) != COMPONENT_REF
6105 && TREE_CODE (exp) != BIT_FIELD_REF
6106 && TREE_CODE (exp) != INDIRECT_REF
6107 && TREE_CODE (exp) != VAR_DECL
6108 && TREE_CODE (exp) != CALL_EXPR
6109 && TREE_CODE (exp) != RTL_EXPR
6110 && GET_MODE_CLASS (tmode) == MODE_INT
6111 && tmode > MAX_INTEGER_COMPUTATION_MODE)
6112 internal_error ("unsupported wide integer operation");
6114 check_max_integer_computation_mode (exp);
6117 /* If will do cse, generate all results into pseudo registers
6118 since 1) that allows cse to find more things
6119 and 2) otherwise cse could produce an insn the machine
6122 if (! cse_not_expected && mode != BLKmode && target
6123 && (GET_CODE (target) != REG || REGNO (target) < FIRST_PSEUDO_REGISTER))
6130 tree function = decl_function_context (exp);
6131 /* Handle using a label in a containing function. */
6132 if (function != current_function_decl
6133 && function != inline_function_decl && function != 0)
6135 struct function *p = find_function_data (function);
6136 p->expr->x_forced_labels
6137 = gen_rtx_EXPR_LIST (VOIDmode, label_rtx (exp),
6138 p->expr->x_forced_labels);
6142 if (modifier == EXPAND_INITIALIZER)
6143 forced_labels = gen_rtx_EXPR_LIST (VOIDmode,
6148 temp = gen_rtx_MEM (FUNCTION_MODE,
6149 gen_rtx_LABEL_REF (Pmode, label_rtx (exp)));
6150 if (function != current_function_decl
6151 && function != inline_function_decl && function != 0)
6152 LABEL_REF_NONLOCAL_P (XEXP (temp, 0)) = 1;
6157 if (DECL_RTL (exp) == 0)
6159 error_with_decl (exp, "prior parameter's size depends on `%s'");
6160 return CONST0_RTX (mode);
6163 /* ... fall through ... */
6166 /* If a static var's type was incomplete when the decl was written,
6167 but the type is complete now, lay out the decl now. */
6168 if (DECL_SIZE (exp) == 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6169 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6171 layout_decl (exp, 0);
6172 PUT_MODE (DECL_RTL (exp), DECL_MODE (exp));
6175 /* Although static-storage variables start off initialized, according to
6176 ANSI C, a memcpy could overwrite them with uninitialized values. So
6177 we check them too. This also lets us check for read-only variables
6178 accessed via a non-const declaration, in case it won't be detected
6179 any other way (e.g., in an embedded system or OS kernel without
6182 Aggregates are not checked here; they're handled elsewhere. */
6183 if (cfun && current_function_check_memory_usage
6185 && GET_CODE (DECL_RTL (exp)) == MEM
6186 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp)))
6188 enum memory_use_mode memory_usage;
6189 memory_usage = get_memory_usage_from_modifier (modifier);
6191 in_check_memory_usage = 1;
6192 if (memory_usage != MEMORY_USE_DONT)
6193 emit_library_call (chkr_check_addr_libfunc,
6194 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
6195 XEXP (DECL_RTL (exp), 0), Pmode,
6196 GEN_INT (int_size_in_bytes (type)),
6197 TYPE_MODE (sizetype),
6198 GEN_INT (memory_usage),
6199 TYPE_MODE (integer_type_node));
6200 in_check_memory_usage = 0;
6203 /* ... fall through ... */
6207 if (DECL_RTL (exp) == 0)
6210 /* Ensure variable marked as used even if it doesn't go through
6211 a parser. If it hasn't be used yet, write out an external
6213 if (! TREE_USED (exp))
6215 assemble_external (exp);
6216 TREE_USED (exp) = 1;
6219 /* Show we haven't gotten RTL for this yet. */
6222 /* Handle variables inherited from containing functions. */
6223 context = decl_function_context (exp);
6225 /* We treat inline_function_decl as an alias for the current function
6226 because that is the inline function whose vars, types, etc.
6227 are being merged into the current function.
6228 See expand_inline_function. */
6230 if (context != 0 && context != current_function_decl
6231 && context != inline_function_decl
6232 /* If var is static, we don't need a static chain to access it. */
6233 && ! (GET_CODE (DECL_RTL (exp)) == MEM
6234 && CONSTANT_P (XEXP (DECL_RTL (exp), 0))))
6238 /* Mark as non-local and addressable. */
6239 DECL_NONLOCAL (exp) = 1;
6240 if (DECL_NO_STATIC_CHAIN (current_function_decl))
6242 mark_addressable (exp);
6243 if (GET_CODE (DECL_RTL (exp)) != MEM)
6245 addr = XEXP (DECL_RTL (exp), 0);
6246 if (GET_CODE (addr) == MEM)
6247 addr = change_address (addr, Pmode,
6248 fix_lexical_addr (XEXP (addr, 0), exp));
6250 addr = fix_lexical_addr (addr, exp);
6252 temp = change_address (DECL_RTL (exp), mode, addr);
6255 /* This is the case of an array whose size is to be determined
6256 from its initializer, while the initializer is still being parsed.
6259 else if (GET_CODE (DECL_RTL (exp)) == MEM
6260 && GET_CODE (XEXP (DECL_RTL (exp), 0)) == REG)
6261 temp = change_address (DECL_RTL (exp), GET_MODE (DECL_RTL (exp)),
6262 XEXP (DECL_RTL (exp), 0));
6264 /* If DECL_RTL is memory, we are in the normal case and either
6265 the address is not valid or it is not a register and -fforce-addr
6266 is specified, get the address into a register. */
6268 else if (GET_CODE (DECL_RTL (exp)) == MEM
6269 && modifier != EXPAND_CONST_ADDRESS
6270 && modifier != EXPAND_SUM
6271 && modifier != EXPAND_INITIALIZER
6272 && (! memory_address_p (DECL_MODE (exp),
6273 XEXP (DECL_RTL (exp), 0))
6275 && GET_CODE (XEXP (DECL_RTL (exp), 0)) != REG)))
6276 temp = change_address (DECL_RTL (exp), VOIDmode,
6277 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6279 /* If we got something, return it. But first, set the alignment
6280 the address is a register. */
6283 if (GET_CODE (temp) == MEM && GET_CODE (XEXP (temp, 0)) == REG)
6284 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6289 /* If the mode of DECL_RTL does not match that of the decl, it
6290 must be a promoted value. We return a SUBREG of the wanted mode,
6291 but mark it so that we know that it was already extended. */
6293 if (GET_CODE (DECL_RTL (exp)) == REG
6294 && GET_MODE (DECL_RTL (exp)) != mode)
6296 /* Get the signedness used for this variable. Ensure we get the
6297 same mode we got when the variable was declared. */
6298 if (GET_MODE (DECL_RTL (exp))
6299 != promote_mode (type, DECL_MODE (exp), &unsignedp, 0))
6302 temp = gen_rtx_SUBREG (mode, DECL_RTL (exp), 0);
6303 SUBREG_PROMOTED_VAR_P (temp) = 1;
6304 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6308 return DECL_RTL (exp);
6311 return immed_double_const (TREE_INT_CST_LOW (exp),
6312 TREE_INT_CST_HIGH (exp), mode);
6315 return expand_expr (DECL_INITIAL (exp), target, VOIDmode,
6316 EXPAND_MEMORY_USE_BAD);
6319 /* If optimized, generate immediate CONST_DOUBLE
6320 which will be turned into memory by reload if necessary.
6322 We used to force a register so that loop.c could see it. But
6323 this does not allow gen_* patterns to perform optimizations with
6324 the constants. It also produces two insns in cases like "x = 1.0;".
6325 On most machines, floating-point constants are not permitted in
6326 many insns, so we'd end up copying it to a register in any case.
6328 Now, we do the copying in expand_binop, if appropriate. */
6329 return immed_real_const (exp);
6333 if (! TREE_CST_RTL (exp))
6334 output_constant_def (exp, 1);
6336 /* TREE_CST_RTL probably contains a constant address.
6337 On RISC machines where a constant address isn't valid,
6338 make some insns to get that address into a register. */
6339 if (GET_CODE (TREE_CST_RTL (exp)) == MEM
6340 && modifier != EXPAND_CONST_ADDRESS
6341 && modifier != EXPAND_INITIALIZER
6342 && modifier != EXPAND_SUM
6343 && (! memory_address_p (mode, XEXP (TREE_CST_RTL (exp), 0))
6345 && GET_CODE (XEXP (TREE_CST_RTL (exp), 0)) != REG)))
6346 return change_address (TREE_CST_RTL (exp), VOIDmode,
6347 copy_rtx (XEXP (TREE_CST_RTL (exp), 0)));
6348 return TREE_CST_RTL (exp);
6350 case EXPR_WITH_FILE_LOCATION:
6353 const char *saved_input_filename = input_filename;
6354 int saved_lineno = lineno;
6355 input_filename = EXPR_WFL_FILENAME (exp);
6356 lineno = EXPR_WFL_LINENO (exp);
6357 if (EXPR_WFL_EMIT_LINE_NOTE (exp))
6358 emit_line_note (input_filename, lineno);
6359 /* Possibly avoid switching back and force here. */
6360 to_return = expand_expr (EXPR_WFL_NODE (exp), target, tmode, modifier);
6361 input_filename = saved_input_filename;
6362 lineno = saved_lineno;
6367 context = decl_function_context (exp);
6369 /* If this SAVE_EXPR was at global context, assume we are an
6370 initialization function and move it into our context. */
6372 SAVE_EXPR_CONTEXT (exp) = current_function_decl;
6374 /* We treat inline_function_decl as an alias for the current function
6375 because that is the inline function whose vars, types, etc.
6376 are being merged into the current function.
6377 See expand_inline_function. */
6378 if (context == current_function_decl || context == inline_function_decl)
6381 /* If this is non-local, handle it. */
6384 /* The following call just exists to abort if the context is
6385 not of a containing function. */
6386 find_function_data (context);
6388 temp = SAVE_EXPR_RTL (exp);
6389 if (temp && GET_CODE (temp) == REG)
6391 put_var_into_stack (exp);
6392 temp = SAVE_EXPR_RTL (exp);
6394 if (temp == 0 || GET_CODE (temp) != MEM)
6396 return change_address (temp, mode,
6397 fix_lexical_addr (XEXP (temp, 0), exp));
6399 if (SAVE_EXPR_RTL (exp) == 0)
6401 if (mode == VOIDmode)
6404 temp = assign_temp (build_qualified_type (type,
6406 | TYPE_QUAL_CONST)),
6409 SAVE_EXPR_RTL (exp) = temp;
6410 if (!optimize && GET_CODE (temp) == REG)
6411 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, temp,
6414 /* If the mode of TEMP does not match that of the expression, it
6415 must be a promoted value. We pass store_expr a SUBREG of the
6416 wanted mode but mark it so that we know that it was already
6417 extended. Note that `unsignedp' was modified above in
6420 if (GET_CODE (temp) == REG && GET_MODE (temp) != mode)
6422 temp = gen_rtx_SUBREG (mode, SAVE_EXPR_RTL (exp), 0);
6423 SUBREG_PROMOTED_VAR_P (temp) = 1;
6424 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6427 if (temp == const0_rtx)
6428 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6429 EXPAND_MEMORY_USE_BAD);
6431 store_expr (TREE_OPERAND (exp, 0), temp, 0);
6433 TREE_USED (exp) = 1;
6436 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
6437 must be a promoted value. We return a SUBREG of the wanted mode,
6438 but mark it so that we know that it was already extended. */
6440 if (GET_CODE (SAVE_EXPR_RTL (exp)) == REG
6441 && GET_MODE (SAVE_EXPR_RTL (exp)) != mode)
6443 /* Compute the signedness and make the proper SUBREG. */
6444 promote_mode (type, mode, &unsignedp, 0);
6445 temp = gen_rtx_SUBREG (mode, SAVE_EXPR_RTL (exp), 0);
6446 SUBREG_PROMOTED_VAR_P (temp) = 1;
6447 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6451 return SAVE_EXPR_RTL (exp);
6456 temp = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6457 TREE_OPERAND (exp, 0) = unsave_expr_now (TREE_OPERAND (exp, 0));
6461 case PLACEHOLDER_EXPR:
6463 tree placeholder_expr;
6465 /* If there is an object on the head of the placeholder list,
6466 see if some object in it of type TYPE or a pointer to it. For
6467 further information, see tree.def. */
6468 for (placeholder_expr = placeholder_list;
6469 placeholder_expr != 0;
6470 placeholder_expr = TREE_CHAIN (placeholder_expr))
6472 tree need_type = TYPE_MAIN_VARIANT (type);
6474 tree old_list = placeholder_list;
6477 /* Find the outermost reference that is of the type we want.
6478 If none, see if any object has a type that is a pointer to
6479 the type we want. */
6480 for (elt = TREE_PURPOSE (placeholder_expr);
6481 elt != 0 && object == 0;
6483 = ((TREE_CODE (elt) == COMPOUND_EXPR
6484 || TREE_CODE (elt) == COND_EXPR)
6485 ? TREE_OPERAND (elt, 1)
6486 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6487 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6488 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6489 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6490 ? TREE_OPERAND (elt, 0) : 0))
6491 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
6494 for (elt = TREE_PURPOSE (placeholder_expr);
6495 elt != 0 && object == 0;
6497 = ((TREE_CODE (elt) == COMPOUND_EXPR
6498 || TREE_CODE (elt) == COND_EXPR)
6499 ? TREE_OPERAND (elt, 1)
6500 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6501 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6502 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6503 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6504 ? TREE_OPERAND (elt, 0) : 0))
6505 if (POINTER_TYPE_P (TREE_TYPE (elt))
6506 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
6508 object = build1 (INDIRECT_REF, need_type, elt);
6512 /* Expand this object skipping the list entries before
6513 it was found in case it is also a PLACEHOLDER_EXPR.
6514 In that case, we want to translate it using subsequent
6516 placeholder_list = TREE_CHAIN (placeholder_expr);
6517 temp = expand_expr (object, original_target, tmode,
6519 placeholder_list = old_list;
6525 /* We can't find the object or there was a missing WITH_RECORD_EXPR. */
6528 case WITH_RECORD_EXPR:
6529 /* Put the object on the placeholder list, expand our first operand,
6530 and pop the list. */
6531 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
6533 target = expand_expr (TREE_OPERAND (exp, 0), original_target,
6534 tmode, ro_modifier);
6535 placeholder_list = TREE_CHAIN (placeholder_list);
6539 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6540 expand_goto (TREE_OPERAND (exp, 0));
6542 expand_computed_goto (TREE_OPERAND (exp, 0));
6546 expand_exit_loop_if_false (NULL_PTR,
6547 invert_truthvalue (TREE_OPERAND (exp, 0)));
6550 case LABELED_BLOCK_EXPR:
6551 if (LABELED_BLOCK_BODY (exp))
6552 expand_expr_stmt (LABELED_BLOCK_BODY (exp));
6553 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp)));
6556 case EXIT_BLOCK_EXPR:
6557 if (EXIT_BLOCK_RETURN (exp))
6558 sorry ("returned value in block_exit_expr");
6559 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp)));
6564 expand_start_loop (1);
6565 expand_expr_stmt (TREE_OPERAND (exp, 0));
6573 tree vars = TREE_OPERAND (exp, 0);
6574 int vars_need_expansion = 0;
6576 /* Need to open a binding contour here because
6577 if there are any cleanups they must be contained here. */
6578 expand_start_bindings (2);
6580 /* Mark the corresponding BLOCK for output in its proper place. */
6581 if (TREE_OPERAND (exp, 2) != 0
6582 && ! TREE_USED (TREE_OPERAND (exp, 2)))
6583 insert_block (TREE_OPERAND (exp, 2));
6585 /* If VARS have not yet been expanded, expand them now. */
6588 if (DECL_RTL (vars) == 0)
6590 vars_need_expansion = 1;
6593 expand_decl_init (vars);
6594 vars = TREE_CHAIN (vars);
6597 temp = expand_expr (TREE_OPERAND (exp, 1), target, tmode, ro_modifier);
6599 expand_end_bindings (TREE_OPERAND (exp, 0), 0, 0);
6605 if (RTL_EXPR_SEQUENCE (exp))
6607 if (RTL_EXPR_SEQUENCE (exp) == const0_rtx)
6609 emit_insns (RTL_EXPR_SEQUENCE (exp));
6610 RTL_EXPR_SEQUENCE (exp) = const0_rtx;
6612 preserve_rtl_expr_result (RTL_EXPR_RTL (exp));
6613 free_temps_for_rtl_expr (exp);
6614 return RTL_EXPR_RTL (exp);
6617 /* If we don't need the result, just ensure we evaluate any
6622 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6623 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode,
6624 EXPAND_MEMORY_USE_BAD);
6628 /* All elts simple constants => refer to a constant in memory. But
6629 if this is a non-BLKmode mode, let it store a field at a time
6630 since that should make a CONST_INT or CONST_DOUBLE when we
6631 fold. Likewise, if we have a target we can use, it is best to
6632 store directly into the target unless the type is large enough
6633 that memcpy will be used. If we are making an initializer and
6634 all operands are constant, put it in memory as well. */
6635 else if ((TREE_STATIC (exp)
6636 && ((mode == BLKmode
6637 && ! (target != 0 && safe_from_p (target, exp, 1)))
6638 || TREE_ADDRESSABLE (exp)
6639 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6640 && (! MOVE_BY_PIECES_P
6641 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6643 && ! mostly_zeros_p (exp))))
6644 || (modifier == EXPAND_INITIALIZER && TREE_CONSTANT (exp)))
6646 rtx constructor = output_constant_def (exp, 1);
6648 if (modifier != EXPAND_CONST_ADDRESS
6649 && modifier != EXPAND_INITIALIZER
6650 && modifier != EXPAND_SUM
6651 && (! memory_address_p (GET_MODE (constructor),
6652 XEXP (constructor, 0))
6654 && GET_CODE (XEXP (constructor, 0)) != REG)))
6655 constructor = change_address (constructor, VOIDmode,
6656 XEXP (constructor, 0));
6661 /* Handle calls that pass values in multiple non-contiguous
6662 locations. The Irix 6 ABI has examples of this. */
6663 if (target == 0 || ! safe_from_p (target, exp, 1)
6664 || GET_CODE (target) == PARALLEL)
6666 = assign_temp (build_qualified_type (type,
6668 | (TREE_READONLY (exp)
6669 * TYPE_QUAL_CONST))),
6670 TREE_ADDRESSABLE (exp), 1, 1);
6672 store_constructor (exp, target, TYPE_ALIGN (TREE_TYPE (exp)), 0,
6673 int_size_in_bytes (TREE_TYPE (exp)));
6679 tree exp1 = TREE_OPERAND (exp, 0);
6681 tree string = string_constant (exp1, &index);
6683 /* Try to optimize reads from const strings. */
6685 && TREE_CODE (string) == STRING_CST
6686 && TREE_CODE (index) == INTEGER_CST
6687 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0
6688 && GET_MODE_CLASS (mode) == MODE_INT
6689 && GET_MODE_SIZE (mode) == 1
6690 && modifier != EXPAND_MEMORY_USE_WO)
6692 GEN_INT (TREE_STRING_POINTER (string)[TREE_INT_CST_LOW (index)]);
6694 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6695 op0 = memory_address (mode, op0);
6697 if (cfun && current_function_check_memory_usage
6698 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp)))
6700 enum memory_use_mode memory_usage;
6701 memory_usage = get_memory_usage_from_modifier (modifier);
6703 if (memory_usage != MEMORY_USE_DONT)
6705 in_check_memory_usage = 1;
6706 emit_library_call (chkr_check_addr_libfunc,
6707 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, op0,
6708 Pmode, GEN_INT (int_size_in_bytes (type)),
6709 TYPE_MODE (sizetype),
6710 GEN_INT (memory_usage),
6711 TYPE_MODE (integer_type_node));
6712 in_check_memory_usage = 0;
6716 temp = gen_rtx_MEM (mode, op0);
6717 set_mem_attributes (temp, exp, 0);
6719 /* It is incorrect to set RTX_UNCHANGING_P from TREE_READONLY
6720 here, because, in C and C++, the fact that a location is accessed
6721 through a pointer to const does not mean that the value there can
6722 never change. Languages where it can never change should
6723 also set TREE_STATIC. */
6724 RTX_UNCHANGING_P (temp) = TREE_READONLY (exp) & TREE_STATIC (exp);
6726 /* If we are writing to this object and its type is a record with
6727 readonly fields, we must mark it as readonly so it will
6728 conflict with readonly references to those fields. */
6729 if (modifier == EXPAND_MEMORY_USE_WO && readonly_fields_p (type))
6730 RTX_UNCHANGING_P (temp) = 1;
6736 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
6740 tree array = TREE_OPERAND (exp, 0);
6741 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
6742 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
6743 tree index = convert (sizetype, TREE_OPERAND (exp, 1));
6746 /* Optimize the special-case of a zero lower bound.
6748 We convert the low_bound to sizetype to avoid some problems
6749 with constant folding. (E.g. suppose the lower bound is 1,
6750 and its mode is QI. Without the conversion, (ARRAY
6751 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
6752 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
6754 if (! integer_zerop (low_bound))
6755 index = size_diffop (index, convert (sizetype, low_bound));
6757 /* Fold an expression like: "foo"[2].
6758 This is not done in fold so it won't happen inside &.
6759 Don't fold if this is for wide characters since it's too
6760 difficult to do correctly and this is a very rare case. */
6762 if (TREE_CODE (array) == STRING_CST
6763 && TREE_CODE (index) == INTEGER_CST
6764 && compare_tree_int (index, TREE_STRING_LENGTH (array)) < 0
6765 && GET_MODE_CLASS (mode) == MODE_INT
6766 && GET_MODE_SIZE (mode) == 1)
6768 GEN_INT (TREE_STRING_POINTER (array)[TREE_INT_CST_LOW (index)]);
6770 /* If this is a constant index into a constant array,
6771 just get the value from the array. Handle both the cases when
6772 we have an explicit constructor and when our operand is a variable
6773 that was declared const. */
6775 if (TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array)
6776 && TREE_CODE (index) == INTEGER_CST
6777 && 0 > compare_tree_int (index,
6778 list_length (CONSTRUCTOR_ELTS
6779 (TREE_OPERAND (exp, 0)))))
6783 for (elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)),
6784 i = TREE_INT_CST_LOW (index);
6785 elem != 0 && i != 0; i--, elem = TREE_CHAIN (elem))
6789 return expand_expr (fold (TREE_VALUE (elem)), target,
6790 tmode, ro_modifier);
6793 else if (optimize >= 1
6794 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6795 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6796 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
6798 if (TREE_CODE (index) == INTEGER_CST)
6800 tree init = DECL_INITIAL (array);
6802 if (TREE_CODE (init) == CONSTRUCTOR)
6806 for (elem = CONSTRUCTOR_ELTS (init);
6808 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6809 elem = TREE_CHAIN (elem))
6813 return expand_expr (fold (TREE_VALUE (elem)), target,
6814 tmode, ro_modifier);
6816 else if (TREE_CODE (init) == STRING_CST
6817 && 0 > compare_tree_int (index,
6818 TREE_STRING_LENGTH (init)))
6820 tree type = TREE_TYPE (TREE_TYPE (init));
6821 enum machine_mode mode = TYPE_MODE (type);
6823 if (GET_MODE_CLASS (mode) == MODE_INT
6824 && GET_MODE_SIZE (mode) == 1)
6826 (TREE_STRING_POINTER
6827 (init)[TREE_INT_CST_LOW (index)]));
6836 /* If the operand is a CONSTRUCTOR, we can just extract the
6837 appropriate field if it is present. Don't do this if we have
6838 already written the data since we want to refer to that copy
6839 and varasm.c assumes that's what we'll do. */
6840 if (code != ARRAY_REF
6841 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
6842 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
6846 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6847 elt = TREE_CHAIN (elt))
6848 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6849 /* We can normally use the value of the field in the
6850 CONSTRUCTOR. However, if this is a bitfield in
6851 an integral mode that we can fit in a HOST_WIDE_INT,
6852 we must mask only the number of bits in the bitfield,
6853 since this is done implicitly by the constructor. If
6854 the bitfield does not meet either of those conditions,
6855 we can't do this optimization. */
6856 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6857 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6859 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6860 <= HOST_BITS_PER_WIDE_INT))))
6862 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6863 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6865 HOST_WIDE_INT bitsize
6866 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
6868 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
6870 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
6871 op0 = expand_and (op0, op1, target);
6875 enum machine_mode imode
6876 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
6878 = build_int_2 (GET_MODE_BITSIZE (imode) - bitsize,
6881 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
6883 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
6893 enum machine_mode mode1;
6894 HOST_WIDE_INT bitsize, bitpos;
6897 unsigned int alignment;
6898 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6899 &mode1, &unsignedp, &volatilep,
6902 /* If we got back the original object, something is wrong. Perhaps
6903 we are evaluating an expression too early. In any event, don't
6904 infinitely recurse. */
6908 /* If TEM's type is a union of variable size, pass TARGET to the inner
6909 computation, since it will need a temporary and TARGET is known
6910 to have to do. This occurs in unchecked conversion in Ada. */
6912 op0 = expand_expr (tem,
6913 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
6914 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
6916 ? target : NULL_RTX),
6918 (modifier == EXPAND_INITIALIZER
6919 || modifier == EXPAND_CONST_ADDRESS)
6920 ? modifier : EXPAND_NORMAL);
6922 /* If this is a constant, put it into a register if it is a
6923 legitimate constant and OFFSET is 0 and memory if it isn't. */
6924 if (CONSTANT_P (op0))
6926 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
6927 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
6929 op0 = force_reg (mode, op0);
6931 op0 = validize_mem (force_const_mem (mode, op0));
6936 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
6938 /* If this object is in memory, put it into a register.
6939 This case can't occur in C, but can in Ada if we have
6940 unchecked conversion of an expression from a scalar type to
6941 an array or record type. */
6942 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
6943 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
6945 tree nt = build_qualified_type (TREE_TYPE (tem),
6946 (TYPE_QUALS (TREE_TYPE (tem))
6947 | TYPE_QUAL_CONST));
6948 rtx memloc = assign_temp (nt, 1, 1, 1);
6950 mark_temp_addr_taken (memloc);
6951 emit_move_insn (memloc, op0);
6955 if (GET_CODE (op0) != MEM)
6958 if (GET_MODE (offset_rtx) != ptr_mode)
6960 #ifdef POINTERS_EXTEND_UNSIGNED
6961 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
6963 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
6967 /* A constant address in OP0 can have VOIDmode, we must not try
6968 to call force_reg for that case. Avoid that case. */
6969 if (GET_CODE (op0) == MEM
6970 && GET_MODE (op0) == BLKmode
6971 && GET_MODE (XEXP (op0, 0)) != VOIDmode
6973 && (bitpos % bitsize) == 0
6974 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
6975 && alignment == GET_MODE_ALIGNMENT (mode1))
6977 rtx temp = change_address (op0, mode1,
6978 plus_constant (XEXP (op0, 0),
6981 if (GET_CODE (XEXP (temp, 0)) == REG)
6984 op0 = change_address (op0, mode1,
6985 force_reg (GET_MODE (XEXP (temp, 0)),
6990 op0 = change_address (op0, VOIDmode,
6991 gen_rtx_PLUS (ptr_mode, XEXP (op0, 0),
6992 force_reg (ptr_mode,
6996 /* Don't forget about volatility even if this is a bitfield. */
6997 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
6999 op0 = copy_rtx (op0);
7000 MEM_VOLATILE_P (op0) = 1;
7003 /* Check the access. */
7004 if (cfun != 0 && current_function_check_memory_usage
7005 && GET_CODE (op0) == MEM)
7007 enum memory_use_mode memory_usage;
7008 memory_usage = get_memory_usage_from_modifier (modifier);
7010 if (memory_usage != MEMORY_USE_DONT)
7015 to = plus_constant (XEXP (op0, 0), (bitpos / BITS_PER_UNIT));
7016 size = (bitpos % BITS_PER_UNIT) + bitsize + BITS_PER_UNIT - 1;
7018 /* Check the access right of the pointer. */
7019 in_check_memory_usage = 1;
7020 if (size > BITS_PER_UNIT)
7021 emit_library_call (chkr_check_addr_libfunc,
7022 LCT_CONST_MAKE_BLOCK, VOIDmode, 3, to,
7023 Pmode, GEN_INT (size / BITS_PER_UNIT),
7024 TYPE_MODE (sizetype),
7025 GEN_INT (memory_usage),
7026 TYPE_MODE (integer_type_node));
7027 in_check_memory_usage = 0;
7031 /* In cases where an aligned union has an unaligned object
7032 as a field, we might be extracting a BLKmode value from
7033 an integer-mode (e.g., SImode) object. Handle this case
7034 by doing the extract into an object as wide as the field
7035 (which we know to be the width of a basic mode), then
7036 storing into memory, and changing the mode to BLKmode.
7037 If we ultimately want the address (EXPAND_CONST_ADDRESS or
7038 EXPAND_INITIALIZER), then we must not copy to a temporary. */
7039 if (mode1 == VOIDmode
7040 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
7041 || (modifier != EXPAND_CONST_ADDRESS
7042 && modifier != EXPAND_INITIALIZER
7043 && ((mode1 != BLKmode && ! direct_load[(int) mode1]
7044 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7045 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
7046 /* If the field isn't aligned enough to fetch as a memref,
7047 fetch it as a bit field. */
7048 || (mode1 != BLKmode
7049 && SLOW_UNALIGNED_ACCESS (mode1, alignment)
7050 && ((TYPE_ALIGN (TREE_TYPE (tem))
7051 < GET_MODE_ALIGNMENT (mode))
7052 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)))
7053 /* If the type and the field are a constant size and the
7054 size of the type isn't the same size as the bitfield,
7055 we must use bitfield operations. */
7057 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (exp)))
7059 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7061 || (modifier != EXPAND_CONST_ADDRESS
7062 && modifier != EXPAND_INITIALIZER
7064 && SLOW_UNALIGNED_ACCESS (mode, alignment)
7065 && (TYPE_ALIGN (type) > alignment
7066 || bitpos % TYPE_ALIGN (type) != 0)))
7068 enum machine_mode ext_mode = mode;
7070 if (ext_mode == BLKmode
7071 && ! (target != 0 && GET_CODE (op0) == MEM
7072 && GET_CODE (target) == MEM
7073 && bitpos % BITS_PER_UNIT == 0))
7074 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7076 if (ext_mode == BLKmode)
7078 /* In this case, BITPOS must start at a byte boundary and
7079 TARGET, if specified, must be a MEM. */
7080 if (GET_CODE (op0) != MEM
7081 || (target != 0 && GET_CODE (target) != MEM)
7082 || bitpos % BITS_PER_UNIT != 0)
7085 op0 = change_address (op0, VOIDmode,
7086 plus_constant (XEXP (op0, 0),
7087 bitpos / BITS_PER_UNIT));
7089 target = assign_temp (type, 0, 1, 1);
7091 emit_block_move (target, op0,
7092 bitsize == -1 ? expr_size (exp)
7093 : GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7100 op0 = validize_mem (op0);
7102 if (GET_CODE (op0) == MEM && GET_CODE (XEXP (op0, 0)) == REG)
7103 mark_reg_pointer (XEXP (op0, 0), alignment);
7105 op0 = extract_bit_field (op0, bitsize, bitpos,
7106 unsignedp, target, ext_mode, ext_mode,
7108 int_size_in_bytes (TREE_TYPE (tem)));
7110 /* If the result is a record type and BITSIZE is narrower than
7111 the mode of OP0, an integral mode, and this is a big endian
7112 machine, we must put the field into the high-order bits. */
7113 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7114 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7115 && bitsize < GET_MODE_BITSIZE (GET_MODE (op0)))
7116 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7117 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7121 if (mode == BLKmode)
7123 tree nt = build_qualified_type (type_for_mode (ext_mode, 0),
7125 rtx new = assign_temp (nt, 0, 1, 1);
7127 emit_move_insn (new, op0);
7128 op0 = copy_rtx (new);
7129 PUT_MODE (op0, BLKmode);
7135 /* If the result is BLKmode, use that to access the object
7137 if (mode == BLKmode)
7140 /* Get a reference to just this component. */
7141 if (modifier == EXPAND_CONST_ADDRESS
7142 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7144 rtx new = gen_rtx_MEM (mode1,
7145 plus_constant (XEXP (op0, 0),
7146 (bitpos / BITS_PER_UNIT)));
7148 MEM_COPY_ATTRIBUTES (new, op0);
7152 op0 = change_address (op0, mode1,
7153 plus_constant (XEXP (op0, 0),
7154 (bitpos / BITS_PER_UNIT)));
7156 set_mem_attributes (op0, exp, 0);
7157 if (GET_CODE (XEXP (op0, 0)) == REG)
7158 mark_reg_pointer (XEXP (op0, 0), alignment);
7160 MEM_VOLATILE_P (op0) |= volatilep;
7161 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7162 || modifier == EXPAND_CONST_ADDRESS
7163 || modifier == EXPAND_INITIALIZER)
7165 else if (target == 0)
7166 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7168 convert_move (target, op0, unsignedp);
7172 /* Intended for a reference to a buffer of a file-object in Pascal.
7173 But it's not certain that a special tree code will really be
7174 necessary for these. INDIRECT_REF might work for them. */
7180 /* Pascal set IN expression.
7183 rlo = set_low - (set_low%bits_per_word);
7184 the_word = set [ (index - rlo)/bits_per_word ];
7185 bit_index = index % bits_per_word;
7186 bitmask = 1 << bit_index;
7187 return !!(the_word & bitmask); */
7189 tree set = TREE_OPERAND (exp, 0);
7190 tree index = TREE_OPERAND (exp, 1);
7191 int iunsignedp = TREE_UNSIGNED (TREE_TYPE (index));
7192 tree set_type = TREE_TYPE (set);
7193 tree set_low_bound = TYPE_MIN_VALUE (TYPE_DOMAIN (set_type));
7194 tree set_high_bound = TYPE_MAX_VALUE (TYPE_DOMAIN (set_type));
7195 rtx index_val = expand_expr (index, 0, VOIDmode, 0);
7196 rtx lo_r = expand_expr (set_low_bound, 0, VOIDmode, 0);
7197 rtx hi_r = expand_expr (set_high_bound, 0, VOIDmode, 0);
7198 rtx setval = expand_expr (set, 0, VOIDmode, 0);
7199 rtx setaddr = XEXP (setval, 0);
7200 enum machine_mode index_mode = TYPE_MODE (TREE_TYPE (index));
7202 rtx diff, quo, rem, addr, bit, result;
7204 /* If domain is empty, answer is no. Likewise if index is constant
7205 and out of bounds. */
7206 if (((TREE_CODE (set_high_bound) == INTEGER_CST
7207 && TREE_CODE (set_low_bound) == INTEGER_CST
7208 && tree_int_cst_lt (set_high_bound, set_low_bound))
7209 || (TREE_CODE (index) == INTEGER_CST
7210 && TREE_CODE (set_low_bound) == INTEGER_CST
7211 && tree_int_cst_lt (index, set_low_bound))
7212 || (TREE_CODE (set_high_bound) == INTEGER_CST
7213 && TREE_CODE (index) == INTEGER_CST
7214 && tree_int_cst_lt (set_high_bound, index))))
7218 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7220 /* If we get here, we have to generate the code for both cases
7221 (in range and out of range). */
7223 op0 = gen_label_rtx ();
7224 op1 = gen_label_rtx ();
7226 if (! (GET_CODE (index_val) == CONST_INT
7227 && GET_CODE (lo_r) == CONST_INT))
7229 emit_cmp_and_jump_insns (index_val, lo_r, LT, NULL_RTX,
7230 GET_MODE (index_val), iunsignedp, 0, op1);
7233 if (! (GET_CODE (index_val) == CONST_INT
7234 && GET_CODE (hi_r) == CONST_INT))
7236 emit_cmp_and_jump_insns (index_val, hi_r, GT, NULL_RTX,
7237 GET_MODE (index_val), iunsignedp, 0, op1);
7240 /* Calculate the element number of bit zero in the first word
7242 if (GET_CODE (lo_r) == CONST_INT)
7243 rlow = GEN_INT (INTVAL (lo_r)
7244 & ~((HOST_WIDE_INT) 1 << BITS_PER_UNIT));
7246 rlow = expand_binop (index_mode, and_optab, lo_r,
7247 GEN_INT (~((HOST_WIDE_INT) 1 << BITS_PER_UNIT)),
7248 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7250 diff = expand_binop (index_mode, sub_optab, index_val, rlow,
7251 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7253 quo = expand_divmod (0, TRUNC_DIV_EXPR, index_mode, diff,
7254 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7255 rem = expand_divmod (1, TRUNC_MOD_EXPR, index_mode, index_val,
7256 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7258 addr = memory_address (byte_mode,
7259 expand_binop (index_mode, add_optab, diff,
7260 setaddr, NULL_RTX, iunsignedp,
7263 /* Extract the bit we want to examine. */
7264 bit = expand_shift (RSHIFT_EXPR, byte_mode,
7265 gen_rtx_MEM (byte_mode, addr),
7266 make_tree (TREE_TYPE (index), rem),
7268 result = expand_binop (byte_mode, and_optab, bit, const1_rtx,
7269 GET_MODE (target) == byte_mode ? target : 0,
7270 1, OPTAB_LIB_WIDEN);
7272 if (result != target)
7273 convert_move (target, result, 1);
7275 /* Output the code to handle the out-of-range case. */
7278 emit_move_insn (target, const0_rtx);
7283 case WITH_CLEANUP_EXPR:
7284 if (RTL_EXPR_RTL (exp) == 0)
7287 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, ro_modifier);
7288 expand_decl_cleanup (NULL_TREE, TREE_OPERAND (exp, 2));
7290 /* That's it for this cleanup. */
7291 TREE_OPERAND (exp, 2) = 0;
7293 return RTL_EXPR_RTL (exp);
7295 case CLEANUP_POINT_EXPR:
7297 /* Start a new binding layer that will keep track of all cleanup
7298 actions to be performed. */
7299 expand_start_bindings (2);
7301 target_temp_slot_level = temp_slot_level;
7303 op0 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, ro_modifier);
7304 /* If we're going to use this value, load it up now. */
7306 op0 = force_not_mem (op0);
7307 preserve_temp_slots (op0);
7308 expand_end_bindings (NULL_TREE, 0, 0);
7313 /* Check for a built-in function. */
7314 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7315 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7317 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7319 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7320 == BUILT_IN_FRONTEND)
7321 return (*lang_expand_expr) (exp, original_target, tmode, modifier);
7323 return expand_builtin (exp, target, subtarget, tmode, ignore);
7326 return expand_call (exp, target, ignore);
7328 case NON_LVALUE_EXPR:
7331 case REFERENCE_EXPR:
7332 if (TREE_OPERAND (exp, 0) == error_mark_node)
7335 if (TREE_CODE (type) == UNION_TYPE)
7337 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7339 /* If both input and output are BLKmode, this conversion
7340 isn't actually doing anything unless we need to make the
7341 alignment stricter. */
7342 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode
7343 && (TYPE_ALIGN (type) <= TYPE_ALIGN (valtype)
7344 || TYPE_ALIGN (type) >= BIGGEST_ALIGNMENT))
7345 return expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7349 target = assign_temp (type, 0, 1, 1);
7351 if (GET_CODE (target) == MEM)
7352 /* Store data into beginning of memory target. */
7353 store_expr (TREE_OPERAND (exp, 0),
7354 change_address (target, TYPE_MODE (valtype), 0), 0);
7356 else if (GET_CODE (target) == REG)
7357 /* Store this field into a union of the proper type. */
7358 store_field (target,
7359 MIN ((int_size_in_bytes (TREE_TYPE
7360 (TREE_OPERAND (exp, 0)))
7362 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7363 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7364 VOIDmode, 0, BITS_PER_UNIT,
7365 int_size_in_bytes (type), 0);
7369 /* Return the entire union. */
7373 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7375 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7378 /* If the signedness of the conversion differs and OP0 is
7379 a promoted SUBREG, clear that indication since we now
7380 have to do the proper extension. */
7381 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7382 && GET_CODE (op0) == SUBREG)
7383 SUBREG_PROMOTED_VAR_P (op0) = 0;
7388 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, 0);
7389 if (GET_MODE (op0) == mode)
7392 /* If OP0 is a constant, just convert it into the proper mode. */
7393 if (CONSTANT_P (op0))
7395 convert_modes (mode, TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7396 op0, TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7398 if (modifier == EXPAND_INITIALIZER)
7399 return gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7403 convert_to_mode (mode, op0,
7404 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7406 convert_move (target, op0,
7407 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7411 /* We come here from MINUS_EXPR when the second operand is a
7414 this_optab = ! unsignedp && flag_trapv
7415 && (GET_MODE_CLASS(mode) == MODE_INT)
7416 ? addv_optab : add_optab;
7418 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
7419 something else, make sure we add the register to the constant and
7420 then to the other thing. This case can occur during strength
7421 reduction and doing it this way will produce better code if the
7422 frame pointer or argument pointer is eliminated.
7424 fold-const.c will ensure that the constant is always in the inner
7425 PLUS_EXPR, so the only case we need to do anything about is if
7426 sp, ap, or fp is our second argument, in which case we must swap
7427 the innermost first argument and our second argument. */
7429 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7430 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7431 && TREE_CODE (TREE_OPERAND (exp, 1)) == RTL_EXPR
7432 && (RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7433 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7434 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7436 tree t = TREE_OPERAND (exp, 1);
7438 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7439 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7442 /* If the result is to be ptr_mode and we are adding an integer to
7443 something, we might be forming a constant. So try to use
7444 plus_constant. If it produces a sum and we can't accept it,
7445 use force_operand. This allows P = &ARR[const] to generate
7446 efficient code on machines where a SYMBOL_REF is not a valid
7449 If this is an EXPAND_SUM call, always return the sum. */
7450 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7451 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7453 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7454 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7455 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7459 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7461 /* Use immed_double_const to ensure that the constant is
7462 truncated according to the mode of OP1, then sign extended
7463 to a HOST_WIDE_INT. Using the constant directly can result
7464 in non-canonical RTL in a 64x32 cross compile. */
7466 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7468 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7469 op1 = plus_constant (op1, INTVAL (constant_part));
7470 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7471 op1 = force_operand (op1, target);
7475 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7476 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7477 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7481 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7483 if (! CONSTANT_P (op0))
7485 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7486 VOIDmode, modifier);
7487 /* Don't go to both_summands if modifier
7488 says it's not right to return a PLUS. */
7489 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7493 /* Use immed_double_const to ensure that the constant is
7494 truncated according to the mode of OP1, then sign extended
7495 to a HOST_WIDE_INT. Using the constant directly can result
7496 in non-canonical RTL in a 64x32 cross compile. */
7498 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7500 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7501 op0 = plus_constant (op0, INTVAL (constant_part));
7502 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7503 op0 = force_operand (op0, target);
7508 /* No sense saving up arithmetic to be done
7509 if it's all in the wrong mode to form part of an address.
7510 And force_operand won't know whether to sign-extend or
7512 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7513 || mode != ptr_mode)
7516 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7519 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, ro_modifier);
7520 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, ro_modifier);
7523 /* Make sure any term that's a sum with a constant comes last. */
7524 if (GET_CODE (op0) == PLUS
7525 && CONSTANT_P (XEXP (op0, 1)))
7531 /* If adding to a sum including a constant,
7532 associate it to put the constant outside. */
7533 if (GET_CODE (op1) == PLUS
7534 && CONSTANT_P (XEXP (op1, 1)))
7536 rtx constant_term = const0_rtx;
7538 temp = simplify_binary_operation (PLUS, mode, XEXP (op1, 0), op0);
7541 /* Ensure that MULT comes first if there is one. */
7542 else if (GET_CODE (op0) == MULT)
7543 op0 = gen_rtx_PLUS (mode, op0, XEXP (op1, 0));
7545 op0 = gen_rtx_PLUS (mode, XEXP (op1, 0), op0);
7547 /* Let's also eliminate constants from op0 if possible. */
7548 op0 = eliminate_constant_term (op0, &constant_term);
7550 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
7551 their sum should be a constant. Form it into OP1, since the
7552 result we want will then be OP0 + OP1. */
7554 temp = simplify_binary_operation (PLUS, mode, constant_term,
7559 op1 = gen_rtx_PLUS (mode, constant_term, XEXP (op1, 1));
7562 /* Put a constant term last and put a multiplication first. */
7563 if (CONSTANT_P (op0) || GET_CODE (op1) == MULT)
7564 temp = op1, op1 = op0, op0 = temp;
7566 temp = simplify_binary_operation (PLUS, mode, op0, op1);
7567 return temp ? temp : gen_rtx_PLUS (mode, op0, op1);
7570 /* For initializers, we are allowed to return a MINUS of two
7571 symbolic constants. Here we handle all cases when both operands
7573 /* Handle difference of two symbolic constants,
7574 for the sake of an initializer. */
7575 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7576 && really_constant_p (TREE_OPERAND (exp, 0))
7577 && really_constant_p (TREE_OPERAND (exp, 1)))
7579 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX,
7580 VOIDmode, ro_modifier);
7581 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7582 VOIDmode, ro_modifier);
7584 /* If the last operand is a CONST_INT, use plus_constant of
7585 the negated constant. Else make the MINUS. */
7586 if (GET_CODE (op1) == CONST_INT)
7587 return plus_constant (op0, - INTVAL (op1));
7589 return gen_rtx_MINUS (mode, op0, op1);
7591 /* Convert A - const to A + (-const). */
7592 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7594 tree negated = fold (build1 (NEGATE_EXPR, type,
7595 TREE_OPERAND (exp, 1)));
7597 if (TREE_UNSIGNED (type) || TREE_OVERFLOW (negated))
7598 /* If we can't negate the constant in TYPE, leave it alone and
7599 expand_binop will negate it for us. We used to try to do it
7600 here in the signed version of TYPE, but that doesn't work
7601 on POINTER_TYPEs. */;
7604 exp = build (PLUS_EXPR, type, TREE_OPERAND (exp, 0), negated);
7608 this_optab = ! unsignedp && flag_trapv
7609 && (GET_MODE_CLASS(mode) == MODE_INT)
7610 ? subv_optab : sub_optab;
7614 /* If first operand is constant, swap them.
7615 Thus the following special case checks need only
7616 check the second operand. */
7617 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7619 register tree t1 = TREE_OPERAND (exp, 0);
7620 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7621 TREE_OPERAND (exp, 1) = t1;
7624 /* Attempt to return something suitable for generating an
7625 indexed address, for machines that support that. */
7627 if (modifier == EXPAND_SUM && mode == ptr_mode
7628 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7629 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
7631 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7634 /* Apply distributive law if OP0 is x+c. */
7635 if (GET_CODE (op0) == PLUS
7636 && GET_CODE (XEXP (op0, 1)) == CONST_INT)
7641 (mode, XEXP (op0, 0),
7642 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)))),
7643 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))
7644 * INTVAL (XEXP (op0, 1))));
7646 if (GET_CODE (op0) != REG)
7647 op0 = force_operand (op0, NULL_RTX);
7648 if (GET_CODE (op0) != REG)
7649 op0 = copy_to_mode_reg (mode, op0);
7652 gen_rtx_MULT (mode, op0,
7653 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))));
7656 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7659 /* Check for multiplying things that have been extended
7660 from a narrower type. If this machine supports multiplying
7661 in that narrower type with a result in the desired type,
7662 do it that way, and avoid the explicit type-conversion. */
7663 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7664 && TREE_CODE (type) == INTEGER_TYPE
7665 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7666 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7667 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7668 && int_fits_type_p (TREE_OPERAND (exp, 1),
7669 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7670 /* Don't use a widening multiply if a shift will do. */
7671 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7672 > HOST_BITS_PER_WIDE_INT)
7673 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7675 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7676 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7678 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
7679 /* If both operands are extended, they must either both
7680 be zero-extended or both be sign-extended. */
7681 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7683 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))))))
7685 enum machine_mode innermode
7686 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)));
7687 optab other_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7688 ? smul_widen_optab : umul_widen_optab);
7689 this_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7690 ? umul_widen_optab : smul_widen_optab);
7691 if (mode == GET_MODE_WIDER_MODE (innermode))
7693 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7695 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7696 NULL_RTX, VOIDmode, 0);
7697 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7698 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7701 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7702 NULL_RTX, VOIDmode, 0);
7705 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7706 && innermode == word_mode)
7709 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7710 NULL_RTX, VOIDmode, 0);
7711 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7712 op1 = convert_modes (innermode, mode,
7713 expand_expr (TREE_OPERAND (exp, 1),
7714 NULL_RTX, VOIDmode, 0),
7717 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7718 NULL_RTX, VOIDmode, 0);
7719 temp = expand_binop (mode, other_optab, op0, op1, target,
7720 unsignedp, OPTAB_LIB_WIDEN);
7721 htem = expand_mult_highpart_adjust (innermode,
7722 gen_highpart (innermode, temp),
7724 gen_highpart (innermode, temp),
7726 emit_move_insn (gen_highpart (innermode, temp), htem);
7731 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7732 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7733 return expand_mult (mode, op0, op1, target, unsignedp);
7735 case TRUNC_DIV_EXPR:
7736 case FLOOR_DIV_EXPR:
7738 case ROUND_DIV_EXPR:
7739 case EXACT_DIV_EXPR:
7740 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7742 /* Possible optimization: compute the dividend with EXPAND_SUM
7743 then if the divisor is constant can optimize the case
7744 where some terms of the dividend have coeffs divisible by it. */
7745 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7746 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7747 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7750 this_optab = flodiv_optab;
7753 case TRUNC_MOD_EXPR:
7754 case FLOOR_MOD_EXPR:
7756 case ROUND_MOD_EXPR:
7757 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7759 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7760 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7761 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7763 case FIX_ROUND_EXPR:
7764 case FIX_FLOOR_EXPR:
7766 abort (); /* Not used for C. */
7768 case FIX_TRUNC_EXPR:
7769 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7771 target = gen_reg_rtx (mode);
7772 expand_fix (target, op0, unsignedp);
7776 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7778 target = gen_reg_rtx (mode);
7779 /* expand_float can't figure out what to do if FROM has VOIDmode.
7780 So give it the correct mode. With -O, cse will optimize this. */
7781 if (GET_MODE (op0) == VOIDmode)
7782 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7784 expand_float (target, op0,
7785 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7789 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7790 temp = expand_unop (mode,
7791 ! unsignedp && flag_trapv
7792 && (GET_MODE_CLASS(mode) == MODE_INT)
7793 ? negv_optab : neg_optab, op0, target, 0);
7799 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7801 /* Handle complex values specially. */
7802 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_INT
7803 || GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
7804 return expand_complex_abs (mode, op0, target, unsignedp);
7806 /* Unsigned abs is simply the operand. Testing here means we don't
7807 risk generating incorrect code below. */
7808 if (TREE_UNSIGNED (type))
7811 return expand_abs (mode, op0, target, unsignedp,
7812 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7816 target = original_target;
7817 if (target == 0 || ! safe_from_p (target, TREE_OPERAND (exp, 1), 1)
7818 || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
7819 || GET_MODE (target) != mode
7820 || (GET_CODE (target) == REG
7821 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7822 target = gen_reg_rtx (mode);
7823 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7824 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7826 /* First try to do it with a special MIN or MAX instruction.
7827 If that does not win, use a conditional jump to select the proper
7829 this_optab = (TREE_UNSIGNED (type)
7830 ? (code == MIN_EXPR ? umin_optab : umax_optab)
7831 : (code == MIN_EXPR ? smin_optab : smax_optab));
7833 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7838 /* At this point, a MEM target is no longer useful; we will get better
7841 if (GET_CODE (target) == MEM)
7842 target = gen_reg_rtx (mode);
7845 emit_move_insn (target, op0);
7847 op0 = gen_label_rtx ();
7849 /* If this mode is an integer too wide to compare properly,
7850 compare word by word. Rely on cse to optimize constant cases. */
7851 if (GET_MODE_CLASS (mode) == MODE_INT
7852 && ! can_compare_p (GE, mode, ccp_jump))
7854 if (code == MAX_EXPR)
7855 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7856 target, op1, NULL_RTX, op0);
7858 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7859 op1, target, NULL_RTX, op0);
7863 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)));
7864 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
7865 unsignedp, mode, NULL_RTX, 0, NULL_RTX,
7868 emit_move_insn (target, op1);
7873 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7874 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
7880 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7881 temp = expand_unop (mode, ffs_optab, op0, target, 1);
7886 /* ??? Can optimize bitwise operations with one arg constant.
7887 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7888 and (a bitwise1 b) bitwise2 b (etc)
7889 but that is probably not worth while. */
7891 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7892 boolean values when we want in all cases to compute both of them. In
7893 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7894 as actual zero-or-1 values and then bitwise anding. In cases where
7895 there cannot be any side effects, better code would be made by
7896 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7897 how to recognize those cases. */
7899 case TRUTH_AND_EXPR:
7901 this_optab = and_optab;
7906 this_optab = ior_optab;
7909 case TRUTH_XOR_EXPR:
7911 this_optab = xor_optab;
7918 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7920 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7921 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
7924 /* Could determine the answer when only additive constants differ. Also,
7925 the addition of one can be handled by changing the condition. */
7932 case UNORDERED_EXPR:
7939 temp = do_store_flag (exp, target, tmode != VOIDmode ? tmode : mode, 0);
7943 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
7944 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
7946 && GET_CODE (original_target) == REG
7947 && (GET_MODE (original_target)
7948 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
7950 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
7953 if (temp != original_target)
7954 temp = copy_to_reg (temp);
7956 op1 = gen_label_rtx ();
7957 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
7958 GET_MODE (temp), unsignedp, 0, op1);
7959 emit_move_insn (temp, const1_rtx);
7964 /* If no set-flag instruction, must generate a conditional
7965 store into a temporary variable. Drop through
7966 and handle this like && and ||. */
7968 case TRUTH_ANDIF_EXPR:
7969 case TRUTH_ORIF_EXPR:
7971 && (target == 0 || ! safe_from_p (target, exp, 1)
7972 /* Make sure we don't have a hard reg (such as function's return
7973 value) live across basic blocks, if not optimizing. */
7974 || (!optimize && GET_CODE (target) == REG
7975 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
7976 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7979 emit_clr_insn (target);
7981 op1 = gen_label_rtx ();
7982 jumpifnot (exp, op1);
7985 emit_0_to_1_insn (target);
7988 return ignore ? const0_rtx : target;
7990 case TRUTH_NOT_EXPR:
7991 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7992 /* The parser is careful to generate TRUTH_NOT_EXPR
7993 only with operands that are always zero or one. */
7994 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
7995 target, 1, OPTAB_LIB_WIDEN);
8001 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
8003 return expand_expr (TREE_OPERAND (exp, 1),
8004 (ignore ? const0_rtx : target),
8008 /* If we would have a "singleton" (see below) were it not for a
8009 conversion in each arm, bring that conversion back out. */
8010 if (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
8011 && TREE_CODE (TREE_OPERAND (exp, 2)) == NOP_EXPR
8012 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0))
8013 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 2), 0))))
8015 tree iftrue = TREE_OPERAND (TREE_OPERAND (exp, 1), 0);
8016 tree iffalse = TREE_OPERAND (TREE_OPERAND (exp, 2), 0);
8018 if ((TREE_CODE_CLASS (TREE_CODE (iftrue)) == '2'
8019 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8020 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '2'
8021 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0))
8022 || (TREE_CODE_CLASS (TREE_CODE (iftrue)) == '1'
8023 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8024 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '1'
8025 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0)))
8026 return expand_expr (build1 (NOP_EXPR, type,
8027 build (COND_EXPR, TREE_TYPE (iftrue),
8028 TREE_OPERAND (exp, 0),
8030 target, tmode, modifier);
8034 /* Note that COND_EXPRs whose type is a structure or union
8035 are required to be constructed to contain assignments of
8036 a temporary variable, so that we can evaluate them here
8037 for side effect only. If type is void, we must do likewise. */
8039 /* If an arm of the branch requires a cleanup,
8040 only that cleanup is performed. */
8043 tree binary_op = 0, unary_op = 0;
8045 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
8046 convert it to our mode, if necessary. */
8047 if (integer_onep (TREE_OPERAND (exp, 1))
8048 && integer_zerop (TREE_OPERAND (exp, 2))
8049 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8053 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
8058 op0 = expand_expr (TREE_OPERAND (exp, 0), target, mode, ro_modifier);
8059 if (GET_MODE (op0) == mode)
8063 target = gen_reg_rtx (mode);
8064 convert_move (target, op0, unsignedp);
8068 /* Check for X ? A + B : A. If we have this, we can copy A to the
8069 output and conditionally add B. Similarly for unary operations.
8070 Don't do this if X has side-effects because those side effects
8071 might affect A or B and the "?" operation is a sequence point in
8072 ANSI. (operand_equal_p tests for side effects.) */
8074 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '2'
8075 && operand_equal_p (TREE_OPERAND (exp, 2),
8076 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8077 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
8078 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '2'
8079 && operand_equal_p (TREE_OPERAND (exp, 1),
8080 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8081 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
8082 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '1'
8083 && operand_equal_p (TREE_OPERAND (exp, 2),
8084 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8085 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
8086 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '1'
8087 && operand_equal_p (TREE_OPERAND (exp, 1),
8088 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8089 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
8091 /* If we are not to produce a result, we have no target. Otherwise,
8092 if a target was specified use it; it will not be used as an
8093 intermediate target unless it is safe. If no target, use a
8098 else if (original_target
8099 && (safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8100 || (singleton && GET_CODE (original_target) == REG
8101 && REGNO (original_target) >= FIRST_PSEUDO_REGISTER
8102 && original_target == var_rtx (singleton)))
8103 && GET_MODE (original_target) == mode
8104 #ifdef HAVE_conditional_move
8105 && (! can_conditionally_move_p (mode)
8106 || GET_CODE (original_target) == REG
8107 || TREE_ADDRESSABLE (type))
8109 && ! (GET_CODE (original_target) == MEM
8110 && MEM_VOLATILE_P (original_target)))
8111 temp = original_target;
8112 else if (TREE_ADDRESSABLE (type))
8115 temp = assign_temp (type, 0, 0, 1);
8117 /* If we had X ? A + C : A, with C a constant power of 2, and we can
8118 do the test of X as a store-flag operation, do this as
8119 A + ((X != 0) << log C). Similarly for other simple binary
8120 operators. Only do for C == 1 if BRANCH_COST is low. */
8121 if (temp && singleton && binary_op
8122 && (TREE_CODE (binary_op) == PLUS_EXPR
8123 || TREE_CODE (binary_op) == MINUS_EXPR
8124 || TREE_CODE (binary_op) == BIT_IOR_EXPR
8125 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
8126 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
8127 : integer_onep (TREE_OPERAND (binary_op, 1)))
8128 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8131 optab boptab = (TREE_CODE (binary_op) == PLUS_EXPR
8132 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8133 ? addv_optab : add_optab)
8134 : TREE_CODE (binary_op) == MINUS_EXPR
8135 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8136 ? subv_optab : sub_optab)
8137 : TREE_CODE (binary_op) == BIT_IOR_EXPR ? ior_optab
8140 /* If we had X ? A : A + 1, do this as A + (X == 0).
8142 We have to invert the truth value here and then put it
8143 back later if do_store_flag fails. We cannot simply copy
8144 TREE_OPERAND (exp, 0) to another variable and modify that
8145 because invert_truthvalue can modify the tree pointed to
8147 if (singleton == TREE_OPERAND (exp, 1))
8148 TREE_OPERAND (exp, 0)
8149 = invert_truthvalue (TREE_OPERAND (exp, 0));
8151 result = do_store_flag (TREE_OPERAND (exp, 0),
8152 (safe_from_p (temp, singleton, 1)
8154 mode, BRANCH_COST <= 1);
8156 if (result != 0 && ! integer_onep (TREE_OPERAND (binary_op, 1)))
8157 result = expand_shift (LSHIFT_EXPR, mode, result,
8158 build_int_2 (tree_log2
8162 (safe_from_p (temp, singleton, 1)
8163 ? temp : NULL_RTX), 0);
8167 op1 = expand_expr (singleton, NULL_RTX, VOIDmode, 0);
8168 return expand_binop (mode, boptab, op1, result, temp,
8169 unsignedp, OPTAB_LIB_WIDEN);
8171 else if (singleton == TREE_OPERAND (exp, 1))
8172 TREE_OPERAND (exp, 0)
8173 = invert_truthvalue (TREE_OPERAND (exp, 0));
8176 do_pending_stack_adjust ();
8178 op0 = gen_label_rtx ();
8180 if (singleton && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0)))
8184 /* If the target conflicts with the other operand of the
8185 binary op, we can't use it. Also, we can't use the target
8186 if it is a hard register, because evaluating the condition
8187 might clobber it. */
8189 && ! safe_from_p (temp, TREE_OPERAND (binary_op, 1), 1))
8190 || (GET_CODE (temp) == REG
8191 && REGNO (temp) < FIRST_PSEUDO_REGISTER))
8192 temp = gen_reg_rtx (mode);
8193 store_expr (singleton, temp, 0);
8196 expand_expr (singleton,
8197 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8198 if (singleton == TREE_OPERAND (exp, 1))
8199 jumpif (TREE_OPERAND (exp, 0), op0);
8201 jumpifnot (TREE_OPERAND (exp, 0), op0);
8203 start_cleanup_deferral ();
8204 if (binary_op && temp == 0)
8205 /* Just touch the other operand. */
8206 expand_expr (TREE_OPERAND (binary_op, 1),
8207 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8209 store_expr (build (TREE_CODE (binary_op), type,
8210 make_tree (type, temp),
8211 TREE_OPERAND (binary_op, 1)),
8214 store_expr (build1 (TREE_CODE (unary_op), type,
8215 make_tree (type, temp)),
8219 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
8220 comparison operator. If we have one of these cases, set the
8221 output to A, branch on A (cse will merge these two references),
8222 then set the output to FOO. */
8224 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8225 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8226 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8227 TREE_OPERAND (exp, 1), 0)
8228 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8229 || TREE_CODE (TREE_OPERAND (exp, 1)) == SAVE_EXPR)
8230 && safe_from_p (temp, TREE_OPERAND (exp, 2), 1))
8232 if (GET_CODE (temp) == REG
8233 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8234 temp = gen_reg_rtx (mode);
8235 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8236 jumpif (TREE_OPERAND (exp, 0), op0);
8238 start_cleanup_deferral ();
8239 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8243 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8244 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8245 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8246 TREE_OPERAND (exp, 2), 0)
8247 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8248 || TREE_CODE (TREE_OPERAND (exp, 2)) == SAVE_EXPR)
8249 && safe_from_p (temp, TREE_OPERAND (exp, 1), 1))
8251 if (GET_CODE (temp) == REG
8252 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8253 temp = gen_reg_rtx (mode);
8254 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8255 jumpifnot (TREE_OPERAND (exp, 0), op0);
8257 start_cleanup_deferral ();
8258 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8263 op1 = gen_label_rtx ();
8264 jumpifnot (TREE_OPERAND (exp, 0), op0);
8266 start_cleanup_deferral ();
8268 /* One branch of the cond can be void, if it never returns. For
8269 example A ? throw : E */
8271 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node)
8272 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8274 expand_expr (TREE_OPERAND (exp, 1),
8275 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8276 end_cleanup_deferral ();
8278 emit_jump_insn (gen_jump (op1));
8281 start_cleanup_deferral ();
8283 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node)
8284 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8286 expand_expr (TREE_OPERAND (exp, 2),
8287 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8290 end_cleanup_deferral ();
8301 /* Something needs to be initialized, but we didn't know
8302 where that thing was when building the tree. For example,
8303 it could be the return value of a function, or a parameter
8304 to a function which lays down in the stack, or a temporary
8305 variable which must be passed by reference.
8307 We guarantee that the expression will either be constructed
8308 or copied into our original target. */
8310 tree slot = TREE_OPERAND (exp, 0);
8311 tree cleanups = NULL_TREE;
8314 if (TREE_CODE (slot) != VAR_DECL)
8318 target = original_target;
8320 /* Set this here so that if we get a target that refers to a
8321 register variable that's already been used, put_reg_into_stack
8322 knows that it should fix up those uses. */
8323 TREE_USED (slot) = 1;
8327 if (DECL_RTL (slot) != 0)
8329 target = DECL_RTL (slot);
8330 /* If we have already expanded the slot, so don't do
8332 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8337 target = assign_temp (type, 2, 0, 1);
8338 /* All temp slots at this level must not conflict. */
8339 preserve_temp_slots (target);
8340 DECL_RTL (slot) = target;
8341 if (TREE_ADDRESSABLE (slot))
8342 put_var_into_stack (slot);
8344 /* Since SLOT is not known to the called function
8345 to belong to its stack frame, we must build an explicit
8346 cleanup. This case occurs when we must build up a reference
8347 to pass the reference as an argument. In this case,
8348 it is very likely that such a reference need not be
8351 if (TREE_OPERAND (exp, 2) == 0)
8352 TREE_OPERAND (exp, 2) = maybe_build_cleanup (slot);
8353 cleanups = TREE_OPERAND (exp, 2);
8358 /* This case does occur, when expanding a parameter which
8359 needs to be constructed on the stack. The target
8360 is the actual stack address that we want to initialize.
8361 The function we call will perform the cleanup in this case. */
8363 /* If we have already assigned it space, use that space,
8364 not target that we were passed in, as our target
8365 parameter is only a hint. */
8366 if (DECL_RTL (slot) != 0)
8368 target = DECL_RTL (slot);
8369 /* If we have already expanded the slot, so don't do
8371 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8376 DECL_RTL (slot) = target;
8377 /* If we must have an addressable slot, then make sure that
8378 the RTL that we just stored in slot is OK. */
8379 if (TREE_ADDRESSABLE (slot))
8380 put_var_into_stack (slot);
8384 exp1 = TREE_OPERAND (exp, 3) = TREE_OPERAND (exp, 1);
8385 /* Mark it as expanded. */
8386 TREE_OPERAND (exp, 1) = NULL_TREE;
8388 store_expr (exp1, target, 0);
8390 expand_decl_cleanup (NULL_TREE, cleanups);
8397 tree lhs = TREE_OPERAND (exp, 0);
8398 tree rhs = TREE_OPERAND (exp, 1);
8399 tree noncopied_parts = 0;
8400 tree lhs_type = TREE_TYPE (lhs);
8402 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8403 if (TYPE_NONCOPIED_PARTS (lhs_type) != 0 && !fixed_type_p (rhs))
8404 noncopied_parts = init_noncopied_parts (stabilize_reference (lhs),
8405 TYPE_NONCOPIED_PARTS (lhs_type));
8406 while (noncopied_parts != 0)
8408 expand_assignment (TREE_VALUE (noncopied_parts),
8409 TREE_PURPOSE (noncopied_parts), 0, 0);
8410 noncopied_parts = TREE_CHAIN (noncopied_parts);
8417 /* If lhs is complex, expand calls in rhs before computing it.
8418 That's so we don't compute a pointer and save it over a call.
8419 If lhs is simple, compute it first so we can give it as a
8420 target if the rhs is just a call. This avoids an extra temp and copy
8421 and that prevents a partial-subsumption which makes bad code.
8422 Actually we could treat component_ref's of vars like vars. */
8424 tree lhs = TREE_OPERAND (exp, 0);
8425 tree rhs = TREE_OPERAND (exp, 1);
8426 tree noncopied_parts = 0;
8427 tree lhs_type = TREE_TYPE (lhs);
8431 /* Check for |= or &= of a bitfield of size one into another bitfield
8432 of size 1. In this case, (unless we need the result of the
8433 assignment) we can do this more efficiently with a
8434 test followed by an assignment, if necessary.
8436 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8437 things change so we do, this code should be enhanced to
8440 && TREE_CODE (lhs) == COMPONENT_REF
8441 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8442 || TREE_CODE (rhs) == BIT_AND_EXPR)
8443 && TREE_OPERAND (rhs, 0) == lhs
8444 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8445 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8446 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8448 rtx label = gen_label_rtx ();
8450 do_jump (TREE_OPERAND (rhs, 1),
8451 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8452 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8453 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8454 (TREE_CODE (rhs) == BIT_IOR_EXPR
8456 : integer_zero_node)),
8458 do_pending_stack_adjust ();
8463 if (TYPE_NONCOPIED_PARTS (lhs_type) != 0
8464 && ! (fixed_type_p (lhs) && fixed_type_p (rhs)))
8465 noncopied_parts = save_noncopied_parts (stabilize_reference (lhs),
8466 TYPE_NONCOPIED_PARTS (lhs_type));
8468 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8469 while (noncopied_parts != 0)
8471 expand_assignment (TREE_PURPOSE (noncopied_parts),
8472 TREE_VALUE (noncopied_parts), 0, 0);
8473 noncopied_parts = TREE_CHAIN (noncopied_parts);
8479 if (!TREE_OPERAND (exp, 0))
8480 expand_null_return ();
8482 expand_return (TREE_OPERAND (exp, 0));
8485 case PREINCREMENT_EXPR:
8486 case PREDECREMENT_EXPR:
8487 return expand_increment (exp, 0, ignore);
8489 case POSTINCREMENT_EXPR:
8490 case POSTDECREMENT_EXPR:
8491 /* Faster to treat as pre-increment if result is not used. */
8492 return expand_increment (exp, ! ignore, ignore);
8495 /* If nonzero, TEMP will be set to the address of something that might
8496 be a MEM corresponding to a stack slot. */
8499 /* Are we taking the address of a nested function? */
8500 if (TREE_CODE (TREE_OPERAND (exp, 0)) == FUNCTION_DECL
8501 && decl_function_context (TREE_OPERAND (exp, 0)) != 0
8502 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp, 0))
8503 && ! TREE_STATIC (exp))
8505 op0 = trampoline_address (TREE_OPERAND (exp, 0));
8506 op0 = force_operand (op0, target);
8508 /* If we are taking the address of something erroneous, just
8510 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
8514 /* We make sure to pass const0_rtx down if we came in with
8515 ignore set, to avoid doing the cleanups twice for something. */
8516 op0 = expand_expr (TREE_OPERAND (exp, 0),
8517 ignore ? const0_rtx : NULL_RTX, VOIDmode,
8518 (modifier == EXPAND_INITIALIZER
8519 ? modifier : EXPAND_CONST_ADDRESS));
8521 /* If we are going to ignore the result, OP0 will have been set
8522 to const0_rtx, so just return it. Don't get confused and
8523 think we are taking the address of the constant. */
8527 op0 = protect_from_queue (op0, 0);
8529 /* We would like the object in memory. If it is a constant, we can
8530 have it be statically allocated into memory. For a non-constant,
8531 we need to allocate some memory and store the value into it. */
8533 if (CONSTANT_P (op0))
8534 op0 = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8536 else if (GET_CODE (op0) == MEM)
8538 mark_temp_addr_taken (op0);
8539 temp = XEXP (op0, 0);
8542 else if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8543 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF
8544 || GET_CODE (op0) == PARALLEL)
8546 /* If this object is in a register, it must be not
8548 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8549 tree nt = build_qualified_type (inner_type,
8550 (TYPE_QUALS (inner_type)
8551 | TYPE_QUAL_CONST));
8552 rtx memloc = assign_temp (nt, 1, 1, 1);
8554 mark_temp_addr_taken (memloc);
8555 if (GET_CODE (op0) == PARALLEL)
8556 /* Handle calls that pass values in multiple non-contiguous
8557 locations. The Irix 6 ABI has examples of this. */
8558 emit_group_store (memloc, op0,
8559 int_size_in_bytes (inner_type),
8560 TYPE_ALIGN (inner_type));
8562 emit_move_insn (memloc, op0);
8566 if (GET_CODE (op0) != MEM)
8569 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8571 temp = XEXP (op0, 0);
8572 #ifdef POINTERS_EXTEND_UNSIGNED
8573 if (GET_MODE (temp) == Pmode && GET_MODE (temp) != mode
8574 && mode == ptr_mode)
8575 temp = convert_memory_address (ptr_mode, temp);
8580 op0 = force_operand (XEXP (op0, 0), target);
8583 if (flag_force_addr && GET_CODE (op0) != REG)
8584 op0 = force_reg (Pmode, op0);
8586 if (GET_CODE (op0) == REG
8587 && ! REG_USERVAR_P (op0))
8588 mark_reg_pointer (op0, TYPE_ALIGN (TREE_TYPE (type)));
8590 /* If we might have had a temp slot, add an equivalent address
8593 update_temp_slot_address (temp, op0);
8595 #ifdef POINTERS_EXTEND_UNSIGNED
8596 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8597 && mode == ptr_mode)
8598 op0 = convert_memory_address (ptr_mode, op0);
8603 case ENTRY_VALUE_EXPR:
8606 /* COMPLEX type for Extended Pascal & Fortran */
8609 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8612 /* Get the rtx code of the operands. */
8613 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8614 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8617 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8621 /* Move the real (op0) and imaginary (op1) parts to their location. */
8622 emit_move_insn (gen_realpart (mode, target), op0);
8623 emit_move_insn (gen_imagpart (mode, target), op1);
8625 insns = get_insns ();
8628 /* Complex construction should appear as a single unit. */
8629 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
8630 each with a separate pseudo as destination.
8631 It's not correct for flow to treat them as a unit. */
8632 if (GET_CODE (target) != CONCAT)
8633 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
8641 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8642 return gen_realpart (mode, op0);
8645 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8646 return gen_imagpart (mode, op0);
8650 enum machine_mode partmode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8654 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8657 target = gen_reg_rtx (mode);
8661 /* Store the realpart and the negated imagpart to target. */
8662 emit_move_insn (gen_realpart (partmode, target),
8663 gen_realpart (partmode, op0));
8665 imag_t = gen_imagpart (partmode, target);
8666 temp = expand_unop (partmode,
8667 ! unsignedp && flag_trapv
8668 && (GET_MODE_CLASS(partmode) == MODE_INT)
8669 ? negv_optab : neg_optab,
8670 gen_imagpart (partmode, op0), imag_t, 0);
8672 emit_move_insn (imag_t, temp);
8674 insns = get_insns ();
8677 /* Conjugate should appear as a single unit
8678 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
8679 each with a separate pseudo as destination.
8680 It's not correct for flow to treat them as a unit. */
8681 if (GET_CODE (target) != CONCAT)
8682 emit_no_conflict_block (insns, target, op0, NULL_RTX, NULL_RTX);
8689 case TRY_CATCH_EXPR:
8691 tree handler = TREE_OPERAND (exp, 1);
8693 expand_eh_region_start ();
8695 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8697 expand_eh_region_end (handler);
8702 case TRY_FINALLY_EXPR:
8704 tree try_block = TREE_OPERAND (exp, 0);
8705 tree finally_block = TREE_OPERAND (exp, 1);
8706 rtx finally_label = gen_label_rtx ();
8707 rtx done_label = gen_label_rtx ();
8708 rtx return_link = gen_reg_rtx (Pmode);
8709 tree cleanup = build (GOTO_SUBROUTINE_EXPR, void_type_node,
8710 (tree) finally_label, (tree) return_link);
8711 TREE_SIDE_EFFECTS (cleanup) = 1;
8713 /* Start a new binding layer that will keep track of all cleanup
8714 actions to be performed. */
8715 expand_start_bindings (2);
8717 target_temp_slot_level = temp_slot_level;
8719 expand_decl_cleanup (NULL_TREE, cleanup);
8720 op0 = expand_expr (try_block, target, tmode, modifier);
8722 preserve_temp_slots (op0);
8723 expand_end_bindings (NULL_TREE, 0, 0);
8724 emit_jump (done_label);
8725 emit_label (finally_label);
8726 expand_expr (finally_block, const0_rtx, VOIDmode, 0);
8727 emit_indirect_jump (return_link);
8728 emit_label (done_label);
8732 case GOTO_SUBROUTINE_EXPR:
8734 rtx subr = (rtx) TREE_OPERAND (exp, 0);
8735 rtx return_link = *(rtx *) &TREE_OPERAND (exp, 1);
8736 rtx return_address = gen_label_rtx ();
8737 emit_move_insn (return_link,
8738 gen_rtx_LABEL_REF (Pmode, return_address));
8740 emit_label (return_address);
8746 rtx dcc = get_dynamic_cleanup_chain ();
8747 emit_move_insn (dcc, validize_mem (gen_rtx_MEM (Pmode, dcc)));
8753 rtx dhc = get_dynamic_handler_chain ();
8754 emit_move_insn (dhc, validize_mem (gen_rtx_MEM (Pmode, dhc)));
8759 return expand_builtin_va_arg (TREE_OPERAND (exp, 0), type);
8762 return (*lang_expand_expr) (exp, original_target, tmode, modifier);
8765 /* Here to do an ordinary binary operator, generating an instruction
8766 from the optab already placed in `this_optab'. */
8768 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8770 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8771 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8773 temp = expand_binop (mode, this_optab, op0, op1, target,
8774 unsignedp, OPTAB_LIB_WIDEN);
8780 /* Similar to expand_expr, except that we don't specify a target, target
8781 mode, or modifier and we return the alignment of the inner type. This is
8782 used in cases where it is not necessary to align the result to the
8783 alignment of its type as long as we know the alignment of the result, for
8784 example for comparisons of BLKmode values. */
8787 expand_expr_unaligned (exp, palign)
8789 unsigned int *palign;
8792 tree type = TREE_TYPE (exp);
8793 register enum machine_mode mode = TYPE_MODE (type);
8795 /* Default the alignment we return to that of the type. */
8796 *palign = TYPE_ALIGN (type);
8798 /* The only cases in which we do anything special is if the resulting mode
8800 if (mode != BLKmode)
8801 return expand_expr (exp, NULL_RTX, VOIDmode, EXPAND_NORMAL);
8803 switch (TREE_CODE (exp))
8807 case NON_LVALUE_EXPR:
8808 /* Conversions between BLKmode values don't change the underlying
8809 alignment or value. */
8810 if (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == BLKmode)
8811 return expand_expr_unaligned (TREE_OPERAND (exp, 0), palign);
8815 /* Much of the code for this case is copied directly from expand_expr.
8816 We need to duplicate it here because we will do something different
8817 in the fall-through case, so we need to handle the same exceptions
8820 tree array = TREE_OPERAND (exp, 0);
8821 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
8822 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
8823 tree index = convert (sizetype, TREE_OPERAND (exp, 1));
8826 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
8829 /* Optimize the special-case of a zero lower bound.
8831 We convert the low_bound to sizetype to avoid some problems
8832 with constant folding. (E.g. suppose the lower bound is 1,
8833 and its mode is QI. Without the conversion, (ARRAY
8834 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8835 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
8837 if (! integer_zerop (low_bound))
8838 index = size_diffop (index, convert (sizetype, low_bound));
8840 /* If this is a constant index into a constant array,
8841 just get the value from the array. Handle both the cases when
8842 we have an explicit constructor and when our operand is a variable
8843 that was declared const. */
8845 if (TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array)
8846 && host_integerp (index, 0)
8847 && 0 > compare_tree_int (index,
8848 list_length (CONSTRUCTOR_ELTS
8849 (TREE_OPERAND (exp, 0)))))
8853 for (elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)),
8854 i = tree_low_cst (index, 0);
8855 elem != 0 && i != 0; i--, elem = TREE_CHAIN (elem))
8859 return expand_expr_unaligned (fold (TREE_VALUE (elem)), palign);
8862 else if (optimize >= 1
8863 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8864 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8865 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
8867 if (TREE_CODE (index) == INTEGER_CST)
8869 tree init = DECL_INITIAL (array);
8871 if (TREE_CODE (init) == CONSTRUCTOR)
8875 for (elem = CONSTRUCTOR_ELTS (init);
8876 ! tree_int_cst_equal (TREE_PURPOSE (elem), index);
8877 elem = TREE_CHAIN (elem))
8881 return expand_expr_unaligned (fold (TREE_VALUE (elem)),
8891 /* If the operand is a CONSTRUCTOR, we can just extract the
8892 appropriate field if it is present. Don't do this if we have
8893 already written the data since we want to refer to that copy
8894 and varasm.c assumes that's what we'll do. */
8895 if (TREE_CODE (exp) != ARRAY_REF
8896 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
8897 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
8901 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
8902 elt = TREE_CHAIN (elt))
8903 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1))
8904 /* Note that unlike the case in expand_expr, we know this is
8905 BLKmode and hence not an integer. */
8906 return expand_expr_unaligned (TREE_VALUE (elt), palign);
8910 enum machine_mode mode1;
8911 HOST_WIDE_INT bitsize, bitpos;
8914 unsigned int alignment;
8916 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
8917 &mode1, &unsignedp, &volatilep,
8920 /* If we got back the original object, something is wrong. Perhaps
8921 we are evaluating an expression too early. In any event, don't
8922 infinitely recurse. */
8926 op0 = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_NORMAL);
8928 /* If this is a constant, put it into a register if it is a
8929 legitimate constant and OFFSET is 0 and memory if it isn't. */
8930 if (CONSTANT_P (op0))
8932 enum machine_mode inner_mode = TYPE_MODE (TREE_TYPE (tem));
8934 if (inner_mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
8936 op0 = force_reg (inner_mode, op0);
8938 op0 = validize_mem (force_const_mem (inner_mode, op0));
8943 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
8945 /* If this object is in a register, put it into memory.
8946 This case can't occur in C, but can in Ada if we have
8947 unchecked conversion of an expression from a scalar type to
8948 an array or record type. */
8949 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8950 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
8952 tree nt = build_qualified_type (TREE_TYPE (tem),
8953 (TYPE_QUALS (TREE_TYPE (tem))
8954 | TYPE_QUAL_CONST));
8955 rtx memloc = assign_temp (nt, 1, 1, 1);
8957 mark_temp_addr_taken (memloc);
8958 emit_move_insn (memloc, op0);
8962 if (GET_CODE (op0) != MEM)
8965 if (GET_MODE (offset_rtx) != ptr_mode)
8967 #ifdef POINTERS_EXTEND_UNSIGNED
8968 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
8970 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
8974 op0 = change_address (op0, VOIDmode,
8975 gen_rtx_PLUS (ptr_mode, XEXP (op0, 0),
8976 force_reg (ptr_mode,
8980 /* Don't forget about volatility even if this is a bitfield. */
8981 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
8983 op0 = copy_rtx (op0);
8984 MEM_VOLATILE_P (op0) = 1;
8987 /* Check the access. */
8988 if (current_function_check_memory_usage && GET_CODE (op0) == MEM)
8993 to = plus_constant (XEXP (op0, 0), (bitpos / BITS_PER_UNIT));
8994 size = (bitpos % BITS_PER_UNIT) + bitsize + BITS_PER_UNIT - 1;
8996 /* Check the access right of the pointer. */
8997 in_check_memory_usage = 1;
8998 if (size > BITS_PER_UNIT)
8999 emit_library_call (chkr_check_addr_libfunc,
9000 LCT_CONST_MAKE_BLOCK, VOIDmode, 3,
9001 to, ptr_mode, GEN_INT (size / BITS_PER_UNIT),
9002 TYPE_MODE (sizetype),
9003 GEN_INT (MEMORY_USE_RO),
9004 TYPE_MODE (integer_type_node));
9005 in_check_memory_usage = 0;
9008 /* In cases where an aligned union has an unaligned object
9009 as a field, we might be extracting a BLKmode value from
9010 an integer-mode (e.g., SImode) object. Handle this case
9011 by doing the extract into an object as wide as the field
9012 (which we know to be the width of a basic mode), then
9013 storing into memory, and changing the mode to BLKmode.
9014 If we ultimately want the address (EXPAND_CONST_ADDRESS or
9015 EXPAND_INITIALIZER), then we must not copy to a temporary. */
9016 if (mode1 == VOIDmode
9017 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
9018 || (SLOW_UNALIGNED_ACCESS (mode1, alignment)
9019 && (TYPE_ALIGN (type) > alignment
9020 || bitpos % TYPE_ALIGN (type) != 0)))
9022 enum machine_mode ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9024 if (ext_mode == BLKmode)
9026 /* In this case, BITPOS must start at a byte boundary. */
9027 if (GET_CODE (op0) != MEM
9028 || bitpos % BITS_PER_UNIT != 0)
9031 op0 = change_address (op0, VOIDmode,
9032 plus_constant (XEXP (op0, 0),
9033 bitpos / BITS_PER_UNIT));
9037 tree nt = build_qualified_type (type_for_mode (ext_mode, 0),
9039 rtx new = assign_temp (nt, 0, 1, 1);
9041 op0 = extract_bit_field (validize_mem (op0), bitsize, bitpos,
9042 unsignedp, NULL_RTX, ext_mode,
9043 ext_mode, alignment,
9044 int_size_in_bytes (TREE_TYPE (tem)));
9046 /* If the result is a record type and BITSIZE is narrower than
9047 the mode of OP0, an integral mode, and this is a big endian
9048 machine, we must put the field into the high-order bits. */
9049 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9050 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9051 && bitsize < GET_MODE_BITSIZE (GET_MODE (op0)))
9052 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9053 size_int (GET_MODE_BITSIZE
9058 emit_move_insn (new, op0);
9059 op0 = copy_rtx (new);
9060 PUT_MODE (op0, BLKmode);
9064 /* Get a reference to just this component. */
9065 op0 = change_address (op0, mode1,
9066 plus_constant (XEXP (op0, 0),
9067 (bitpos / BITS_PER_UNIT)));
9069 MEM_ALIAS_SET (op0) = get_alias_set (exp);
9071 /* Adjust the alignment in case the bit position is not
9072 a multiple of the alignment of the inner object. */
9073 while (bitpos % alignment != 0)
9076 if (GET_CODE (XEXP (op0, 0)) == REG)
9077 mark_reg_pointer (XEXP (op0, 0), alignment);
9079 MEM_IN_STRUCT_P (op0) = 1;
9080 MEM_VOLATILE_P (op0) |= volatilep;
9082 *palign = alignment;
9091 return expand_expr (exp, NULL_RTX, VOIDmode, EXPAND_NORMAL);
9094 /* Return the tree node if a ARG corresponds to a string constant or zero
9095 if it doesn't. If we return non-zero, set *PTR_OFFSET to the offset
9096 in bytes within the string that ARG is accessing. The type of the
9097 offset will be `sizetype'. */
9100 string_constant (arg, ptr_offset)
9106 if (TREE_CODE (arg) == ADDR_EXPR
9107 && TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9109 *ptr_offset = size_zero_node;
9110 return TREE_OPERAND (arg, 0);
9112 else if (TREE_CODE (arg) == PLUS_EXPR)
9114 tree arg0 = TREE_OPERAND (arg, 0);
9115 tree arg1 = TREE_OPERAND (arg, 1);
9120 if (TREE_CODE (arg0) == ADDR_EXPR
9121 && TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST)
9123 *ptr_offset = convert (sizetype, arg1);
9124 return TREE_OPERAND (arg0, 0);
9126 else if (TREE_CODE (arg1) == ADDR_EXPR
9127 && TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST)
9129 *ptr_offset = convert (sizetype, arg0);
9130 return TREE_OPERAND (arg1, 0);
9137 /* Expand code for a post- or pre- increment or decrement
9138 and return the RTX for the result.
9139 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
9142 expand_increment (exp, post, ignore)
9146 register rtx op0, op1;
9147 register rtx temp, value;
9148 register tree incremented = TREE_OPERAND (exp, 0);
9149 optab this_optab = add_optab;
9151 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
9152 int op0_is_copy = 0;
9153 int single_insn = 0;
9154 /* 1 means we can't store into OP0 directly,
9155 because it is a subreg narrower than a word,
9156 and we don't dare clobber the rest of the word. */
9159 /* Stabilize any component ref that might need to be
9160 evaluated more than once below. */
9162 || TREE_CODE (incremented) == BIT_FIELD_REF
9163 || (TREE_CODE (incremented) == COMPONENT_REF
9164 && (TREE_CODE (TREE_OPERAND (incremented, 0)) != INDIRECT_REF
9165 || DECL_BIT_FIELD (TREE_OPERAND (incremented, 1)))))
9166 incremented = stabilize_reference (incremented);
9167 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
9168 ones into save exprs so that they don't accidentally get evaluated
9169 more than once by the code below. */
9170 if (TREE_CODE (incremented) == PREINCREMENT_EXPR
9171 || TREE_CODE (incremented) == PREDECREMENT_EXPR)
9172 incremented = save_expr (incremented);
9174 /* Compute the operands as RTX.
9175 Note whether OP0 is the actual lvalue or a copy of it:
9176 I believe it is a copy iff it is a register or subreg
9177 and insns were generated in computing it. */
9179 temp = get_last_insn ();
9180 op0 = expand_expr (incremented, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_RW);
9182 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
9183 in place but instead must do sign- or zero-extension during assignment,
9184 so we copy it into a new register and let the code below use it as
9187 Note that we can safely modify this SUBREG since it is know not to be
9188 shared (it was made by the expand_expr call above). */
9190 if (GET_CODE (op0) == SUBREG && SUBREG_PROMOTED_VAR_P (op0))
9193 SUBREG_REG (op0) = copy_to_reg (SUBREG_REG (op0));
9197 else if (GET_CODE (op0) == SUBREG
9198 && GET_MODE_BITSIZE (GET_MODE (op0)) < BITS_PER_WORD)
9200 /* We cannot increment this SUBREG in place. If we are
9201 post-incrementing, get a copy of the old value. Otherwise,
9202 just mark that we cannot increment in place. */
9204 op0 = copy_to_reg (op0);
9209 op0_is_copy = ((GET_CODE (op0) == SUBREG || GET_CODE (op0) == REG)
9210 && temp != get_last_insn ());
9211 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode,
9212 EXPAND_MEMORY_USE_BAD);
9214 /* Decide whether incrementing or decrementing. */
9215 if (TREE_CODE (exp) == POSTDECREMENT_EXPR
9216 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9217 this_optab = sub_optab;
9219 /* Convert decrement by a constant into a negative increment. */
9220 if (this_optab == sub_optab
9221 && GET_CODE (op1) == CONST_INT)
9223 op1 = GEN_INT (-INTVAL (op1));
9224 this_optab = add_optab;
9227 if (TYPE_TRAP_SIGNED (TREE_TYPE (exp)))
9228 this_optab = this_optab == add_optab ? addv_optab : subv_optab;
9230 /* For a preincrement, see if we can do this with a single instruction. */
9233 icode = (int) this_optab->handlers[(int) mode].insn_code;
9234 if (icode != (int) CODE_FOR_nothing
9235 /* Make sure that OP0 is valid for operands 0 and 1
9236 of the insn we want to queue. */
9237 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9238 && (*insn_data[icode].operand[1].predicate) (op0, mode)
9239 && (*insn_data[icode].operand[2].predicate) (op1, mode))
9243 /* If OP0 is not the actual lvalue, but rather a copy in a register,
9244 then we cannot just increment OP0. We must therefore contrive to
9245 increment the original value. Then, for postincrement, we can return
9246 OP0 since it is a copy of the old value. For preincrement, expand here
9247 unless we can do it with a single insn.
9249 Likewise if storing directly into OP0 would clobber high bits
9250 we need to preserve (bad_subreg). */
9251 if (op0_is_copy || (!post && !single_insn) || bad_subreg)
9253 /* This is the easiest way to increment the value wherever it is.
9254 Problems with multiple evaluation of INCREMENTED are prevented
9255 because either (1) it is a component_ref or preincrement,
9256 in which case it was stabilized above, or (2) it is an array_ref
9257 with constant index in an array in a register, which is
9258 safe to reevaluate. */
9259 tree newexp = build (((TREE_CODE (exp) == POSTDECREMENT_EXPR
9260 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9261 ? MINUS_EXPR : PLUS_EXPR),
9264 TREE_OPERAND (exp, 1));
9266 while (TREE_CODE (incremented) == NOP_EXPR
9267 || TREE_CODE (incremented) == CONVERT_EXPR)
9269 newexp = convert (TREE_TYPE (incremented), newexp);
9270 incremented = TREE_OPERAND (incremented, 0);
9273 temp = expand_assignment (incremented, newexp, ! post && ! ignore , 0);
9274 return post ? op0 : temp;
9279 /* We have a true reference to the value in OP0.
9280 If there is an insn to add or subtract in this mode, queue it.
9281 Queueing the increment insn avoids the register shuffling
9282 that often results if we must increment now and first save
9283 the old value for subsequent use. */
9285 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
9286 op0 = stabilize (op0);
9289 icode = (int) this_optab->handlers[(int) mode].insn_code;
9290 if (icode != (int) CODE_FOR_nothing
9291 /* Make sure that OP0 is valid for operands 0 and 1
9292 of the insn we want to queue. */
9293 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9294 && (*insn_data[icode].operand[1].predicate) (op0, mode))
9296 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9297 op1 = force_reg (mode, op1);
9299 return enqueue_insn (op0, GEN_FCN (icode) (op0, op0, op1));
9301 if (icode != (int) CODE_FOR_nothing && GET_CODE (op0) == MEM)
9303 rtx addr = (general_operand (XEXP (op0, 0), mode)
9304 ? force_reg (Pmode, XEXP (op0, 0))
9305 : copy_to_reg (XEXP (op0, 0)));
9308 op0 = change_address (op0, VOIDmode, addr);
9309 temp = force_reg (GET_MODE (op0), op0);
9310 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9311 op1 = force_reg (mode, op1);
9313 /* The increment queue is LIFO, thus we have to `queue'
9314 the instructions in reverse order. */
9315 enqueue_insn (op0, gen_move_insn (op0, temp));
9316 result = enqueue_insn (temp, GEN_FCN (icode) (temp, temp, op1));
9321 /* Preincrement, or we can't increment with one simple insn. */
9323 /* Save a copy of the value before inc or dec, to return it later. */
9324 temp = value = copy_to_reg (op0);
9326 /* Arrange to return the incremented value. */
9327 /* Copy the rtx because expand_binop will protect from the queue,
9328 and the results of that would be invalid for us to return
9329 if our caller does emit_queue before using our result. */
9330 temp = copy_rtx (value = op0);
9332 /* Increment however we can. */
9333 op1 = expand_binop (mode, this_optab, value, op1,
9334 current_function_check_memory_usage ? NULL_RTX : op0,
9335 TREE_UNSIGNED (TREE_TYPE (exp)), OPTAB_LIB_WIDEN);
9336 /* Make sure the value is stored into OP0. */
9338 emit_move_insn (op0, op1);
9343 /* At the start of a function, record that we have no previously-pushed
9344 arguments waiting to be popped. */
9347 init_pending_stack_adjust ()
9349 pending_stack_adjust = 0;
9352 /* When exiting from function, if safe, clear out any pending stack adjust
9353 so the adjustment won't get done.
9355 Note, if the current function calls alloca, then it must have a
9356 frame pointer regardless of the value of flag_omit_frame_pointer. */
9359 clear_pending_stack_adjust ()
9361 #ifdef EXIT_IGNORE_STACK
9363 && (! flag_omit_frame_pointer || current_function_calls_alloca)
9364 && EXIT_IGNORE_STACK
9365 && ! (DECL_INLINE (current_function_decl) && ! flag_no_inline)
9366 && ! flag_inline_functions)
9368 stack_pointer_delta -= pending_stack_adjust,
9369 pending_stack_adjust = 0;
9374 /* Pop any previously-pushed arguments that have not been popped yet. */
9377 do_pending_stack_adjust ()
9379 if (inhibit_defer_pop == 0)
9381 if (pending_stack_adjust != 0)
9382 adjust_stack (GEN_INT (pending_stack_adjust));
9383 pending_stack_adjust = 0;
9387 /* Expand conditional expressions. */
9389 /* Generate code to evaluate EXP and jump to LABEL if the value is zero.
9390 LABEL is an rtx of code CODE_LABEL, in this function and all the
9394 jumpifnot (exp, label)
9398 do_jump (exp, label, NULL_RTX);
9401 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
9408 do_jump (exp, NULL_RTX, label);
9411 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
9412 the result is zero, or IF_TRUE_LABEL if the result is one.
9413 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
9414 meaning fall through in that case.
9416 do_jump always does any pending stack adjust except when it does not
9417 actually perform a jump. An example where there is no jump
9418 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null.
9420 This function is responsible for optimizing cases such as
9421 &&, || and comparison operators in EXP. */
9424 do_jump (exp, if_false_label, if_true_label)
9426 rtx if_false_label, if_true_label;
9428 register enum tree_code code = TREE_CODE (exp);
9429 /* Some cases need to create a label to jump to
9430 in order to properly fall through.
9431 These cases set DROP_THROUGH_LABEL nonzero. */
9432 rtx drop_through_label = 0;
9436 enum machine_mode mode;
9438 #ifdef MAX_INTEGER_COMPUTATION_MODE
9439 check_max_integer_computation_mode (exp);
9450 temp = integer_zerop (exp) ? if_false_label : if_true_label;
9456 /* This is not true with #pragma weak */
9458 /* The address of something can never be zero. */
9460 emit_jump (if_true_label);
9465 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
9466 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
9467 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF)
9470 /* If we are narrowing the operand, we have to do the compare in the
9472 if ((TYPE_PRECISION (TREE_TYPE (exp))
9473 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
9475 case NON_LVALUE_EXPR:
9476 case REFERENCE_EXPR:
9481 /* These cannot change zero->non-zero or vice versa. */
9482 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9485 case WITH_RECORD_EXPR:
9486 /* Put the object on the placeholder list, recurse through our first
9487 operand, and pop the list. */
9488 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
9490 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9491 placeholder_list = TREE_CHAIN (placeholder_list);
9495 /* This is never less insns than evaluating the PLUS_EXPR followed by
9496 a test and can be longer if the test is eliminated. */
9498 /* Reduce to minus. */
9499 exp = build (MINUS_EXPR, TREE_TYPE (exp),
9500 TREE_OPERAND (exp, 0),
9501 fold (build1 (NEGATE_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
9502 TREE_OPERAND (exp, 1))));
9503 /* Process as MINUS. */
9507 /* Non-zero iff operands of minus differ. */
9508 do_compare_and_jump (build (NE_EXPR, TREE_TYPE (exp),
9509 TREE_OPERAND (exp, 0),
9510 TREE_OPERAND (exp, 1)),
9511 NE, NE, if_false_label, if_true_label);
9515 /* If we are AND'ing with a small constant, do this comparison in the
9516 smallest type that fits. If the machine doesn't have comparisons
9517 that small, it will be converted back to the wider comparison.
9518 This helps if we are testing the sign bit of a narrower object.
9519 combine can't do this for us because it can't know whether a
9520 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
9522 if (! SLOW_BYTE_ACCESS
9523 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
9524 && TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
9525 && (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0
9526 && (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
9527 && (type = type_for_mode (mode, 1)) != 0
9528 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9529 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9530 != CODE_FOR_nothing))
9532 do_jump (convert (type, exp), if_false_label, if_true_label);
9537 case TRUTH_NOT_EXPR:
9538 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9541 case TRUTH_ANDIF_EXPR:
9542 if (if_false_label == 0)
9543 if_false_label = drop_through_label = gen_label_rtx ();
9544 do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
9545 start_cleanup_deferral ();
9546 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9547 end_cleanup_deferral ();
9550 case TRUTH_ORIF_EXPR:
9551 if (if_true_label == 0)
9552 if_true_label = drop_through_label = gen_label_rtx ();
9553 do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
9554 start_cleanup_deferral ();
9555 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9556 end_cleanup_deferral ();
9561 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
9562 preserve_temp_slots (NULL_RTX);
9566 do_pending_stack_adjust ();
9567 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9574 HOST_WIDE_INT bitsize, bitpos;
9576 enum machine_mode mode;
9580 unsigned int alignment;
9582 /* Get description of this reference. We don't actually care
9583 about the underlying object here. */
9584 get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
9585 &unsignedp, &volatilep, &alignment);
9587 type = type_for_size (bitsize, unsignedp);
9588 if (! SLOW_BYTE_ACCESS
9589 && type != 0 && bitsize >= 0
9590 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9591 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9592 != CODE_FOR_nothing))
9594 do_jump (convert (type, exp), if_false_label, if_true_label);
9601 /* Do (a ? 1 : 0) and (a ? 0 : 1) as special cases. */
9602 if (integer_onep (TREE_OPERAND (exp, 1))
9603 && integer_zerop (TREE_OPERAND (exp, 2)))
9604 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9606 else if (integer_zerop (TREE_OPERAND (exp, 1))
9607 && integer_onep (TREE_OPERAND (exp, 2)))
9608 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9612 register rtx label1 = gen_label_rtx ();
9613 drop_through_label = gen_label_rtx ();
9615 do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
9617 start_cleanup_deferral ();
9618 /* Now the THEN-expression. */
9619 do_jump (TREE_OPERAND (exp, 1),
9620 if_false_label ? if_false_label : drop_through_label,
9621 if_true_label ? if_true_label : drop_through_label);
9622 /* In case the do_jump just above never jumps. */
9623 do_pending_stack_adjust ();
9624 emit_label (label1);
9626 /* Now the ELSE-expression. */
9627 do_jump (TREE_OPERAND (exp, 2),
9628 if_false_label ? if_false_label : drop_through_label,
9629 if_true_label ? if_true_label : drop_through_label);
9630 end_cleanup_deferral ();
9636 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9638 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9639 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9641 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9642 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9645 (build (TRUTH_ANDIF_EXPR, TREE_TYPE (exp),
9646 fold (build (EQ_EXPR, TREE_TYPE (exp),
9647 fold (build1 (REALPART_EXPR,
9648 TREE_TYPE (inner_type),
9650 fold (build1 (REALPART_EXPR,
9651 TREE_TYPE (inner_type),
9653 fold (build (EQ_EXPR, TREE_TYPE (exp),
9654 fold (build1 (IMAGPART_EXPR,
9655 TREE_TYPE (inner_type),
9657 fold (build1 (IMAGPART_EXPR,
9658 TREE_TYPE (inner_type),
9660 if_false_label, if_true_label);
9663 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9664 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9666 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9667 && !can_compare_p (EQ, TYPE_MODE (inner_type), ccp_jump))
9668 do_jump_by_parts_equality (exp, if_false_label, if_true_label);
9670 do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
9676 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9678 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9679 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9681 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9682 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9685 (build (TRUTH_ORIF_EXPR, TREE_TYPE (exp),
9686 fold (build (NE_EXPR, TREE_TYPE (exp),
9687 fold (build1 (REALPART_EXPR,
9688 TREE_TYPE (inner_type),
9690 fold (build1 (REALPART_EXPR,
9691 TREE_TYPE (inner_type),
9693 fold (build (NE_EXPR, TREE_TYPE (exp),
9694 fold (build1 (IMAGPART_EXPR,
9695 TREE_TYPE (inner_type),
9697 fold (build1 (IMAGPART_EXPR,
9698 TREE_TYPE (inner_type),
9700 if_false_label, if_true_label);
9703 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9704 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9706 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9707 && !can_compare_p (NE, TYPE_MODE (inner_type), ccp_jump))
9708 do_jump_by_parts_equality (exp, if_true_label, if_false_label);
9710 do_compare_and_jump (exp, NE, NE, if_false_label, if_true_label);
9715 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9716 if (GET_MODE_CLASS (mode) == MODE_INT
9717 && ! can_compare_p (LT, mode, ccp_jump))
9718 do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
9720 do_compare_and_jump (exp, LT, LTU, if_false_label, if_true_label);
9724 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9725 if (GET_MODE_CLASS (mode) == MODE_INT
9726 && ! can_compare_p (LE, mode, ccp_jump))
9727 do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
9729 do_compare_and_jump (exp, LE, LEU, if_false_label, if_true_label);
9733 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9734 if (GET_MODE_CLASS (mode) == MODE_INT
9735 && ! can_compare_p (GT, mode, ccp_jump))
9736 do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
9738 do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
9742 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9743 if (GET_MODE_CLASS (mode) == MODE_INT
9744 && ! can_compare_p (GE, mode, ccp_jump))
9745 do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
9747 do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
9750 case UNORDERED_EXPR:
9753 enum rtx_code cmp, rcmp;
9756 if (code == UNORDERED_EXPR)
9757 cmp = UNORDERED, rcmp = ORDERED;
9759 cmp = ORDERED, rcmp = UNORDERED;
9760 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9763 if (! can_compare_p (cmp, mode, ccp_jump)
9764 && (can_compare_p (rcmp, mode, ccp_jump)
9765 /* If the target doesn't provide either UNORDERED or ORDERED
9766 comparisons, canonicalize on UNORDERED for the library. */
9767 || rcmp == UNORDERED))
9771 do_compare_and_jump (exp, cmp, cmp, if_false_label, if_true_label);
9773 do_compare_and_jump (exp, rcmp, rcmp, if_true_label, if_false_label);
9778 enum rtx_code rcode1;
9779 enum tree_code tcode2;
9803 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9804 if (can_compare_p (rcode1, mode, ccp_jump))
9805 do_compare_and_jump (exp, rcode1, rcode1, if_false_label,
9809 tree op0 = save_expr (TREE_OPERAND (exp, 0));
9810 tree op1 = save_expr (TREE_OPERAND (exp, 1));
9813 /* If the target doesn't support combined unordered
9814 compares, decompose into UNORDERED + comparison. */
9815 cmp0 = fold (build (UNORDERED_EXPR, TREE_TYPE (exp), op0, op1));
9816 cmp1 = fold (build (tcode2, TREE_TYPE (exp), op0, op1));
9817 exp = build (TRUTH_ORIF_EXPR, TREE_TYPE (exp), cmp0, cmp1);
9818 do_jump (exp, if_false_label, if_true_label);
9825 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
9827 /* This is not needed any more and causes poor code since it causes
9828 comparisons and tests from non-SI objects to have different code
9830 /* Copy to register to avoid generating bad insns by cse
9831 from (set (mem ...) (arithop)) (set (cc0) (mem ...)). */
9832 if (!cse_not_expected && GET_CODE (temp) == MEM)
9833 temp = copy_to_reg (temp);
9835 do_pending_stack_adjust ();
9836 /* Do any postincrements in the expression that was tested. */
9839 if (GET_CODE (temp) == CONST_INT
9840 || (GET_CODE (temp) == CONST_DOUBLE && GET_MODE (temp) == VOIDmode)
9841 || GET_CODE (temp) == LABEL_REF)
9843 rtx target = temp == const0_rtx ? if_false_label : if_true_label;
9847 else if (GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
9848 && ! can_compare_p (NE, GET_MODE (temp), ccp_jump))
9849 /* Note swapping the labels gives us not-equal. */
9850 do_jump_by_parts_equality_rtx (temp, if_true_label, if_false_label);
9851 else if (GET_MODE (temp) != VOIDmode)
9852 do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
9853 NE, TREE_UNSIGNED (TREE_TYPE (exp)),
9854 GET_MODE (temp), NULL_RTX, 0,
9855 if_false_label, if_true_label);
9860 if (drop_through_label)
9862 /* If do_jump produces code that might be jumped around,
9863 do any stack adjusts from that code, before the place
9864 where control merges in. */
9865 do_pending_stack_adjust ();
9866 emit_label (drop_through_label);
9870 /* Given a comparison expression EXP for values too wide to be compared
9871 with one insn, test the comparison and jump to the appropriate label.
9872 The code of EXP is ignored; we always test GT if SWAP is 0,
9873 and LT if SWAP is 1. */
9876 do_jump_by_parts_greater (exp, swap, if_false_label, if_true_label)
9879 rtx if_false_label, if_true_label;
9881 rtx op0 = expand_expr (TREE_OPERAND (exp, swap), NULL_RTX, VOIDmode, 0);
9882 rtx op1 = expand_expr (TREE_OPERAND (exp, !swap), NULL_RTX, VOIDmode, 0);
9883 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9884 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
9886 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label);
9889 /* Compare OP0 with OP1, word at a time, in mode MODE.
9890 UNSIGNEDP says to do unsigned comparison.
9891 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
9894 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label)
9895 enum machine_mode mode;
9898 rtx if_false_label, if_true_label;
9900 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9901 rtx drop_through_label = 0;
9904 if (! if_true_label || ! if_false_label)
9905 drop_through_label = gen_label_rtx ();
9906 if (! if_true_label)
9907 if_true_label = drop_through_label;
9908 if (! if_false_label)
9909 if_false_label = drop_through_label;
9911 /* Compare a word at a time, high order first. */
9912 for (i = 0; i < nwords; i++)
9914 rtx op0_word, op1_word;
9916 if (WORDS_BIG_ENDIAN)
9918 op0_word = operand_subword_force (op0, i, mode);
9919 op1_word = operand_subword_force (op1, i, mode);
9923 op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
9924 op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
9927 /* All but high-order word must be compared as unsigned. */
9928 do_compare_rtx_and_jump (op0_word, op1_word, GT,
9929 (unsignedp || i > 0), word_mode, NULL_RTX, 0,
9930 NULL_RTX, if_true_label);
9932 /* Consider lower words only if these are equal. */
9933 do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
9934 NULL_RTX, 0, NULL_RTX, if_false_label);
9938 emit_jump (if_false_label);
9939 if (drop_through_label)
9940 emit_label (drop_through_label);
9943 /* Given an EQ_EXPR expression EXP for values too wide to be compared
9944 with one insn, test the comparison and jump to the appropriate label. */
9947 do_jump_by_parts_equality (exp, if_false_label, if_true_label)
9949 rtx if_false_label, if_true_label;
9951 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
9952 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9953 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9954 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9956 rtx drop_through_label = 0;
9958 if (! if_false_label)
9959 drop_through_label = if_false_label = gen_label_rtx ();
9961 for (i = 0; i < nwords; i++)
9962 do_compare_rtx_and_jump (operand_subword_force (op0, i, mode),
9963 operand_subword_force (op1, i, mode),
9964 EQ, TREE_UNSIGNED (TREE_TYPE (exp)),
9965 word_mode, NULL_RTX, 0, if_false_label,
9969 emit_jump (if_true_label);
9970 if (drop_through_label)
9971 emit_label (drop_through_label);
9974 /* Jump according to whether OP0 is 0.
9975 We assume that OP0 has an integer mode that is too wide
9976 for the available compare insns. */
9979 do_jump_by_parts_equality_rtx (op0, if_false_label, if_true_label)
9981 rtx if_false_label, if_true_label;
9983 int nwords = GET_MODE_SIZE (GET_MODE (op0)) / UNITS_PER_WORD;
9986 rtx drop_through_label = 0;
9988 /* The fastest way of doing this comparison on almost any machine is to
9989 "or" all the words and compare the result. If all have to be loaded
9990 from memory and this is a very wide item, it's possible this may
9991 be slower, but that's highly unlikely. */
9993 part = gen_reg_rtx (word_mode);
9994 emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
9995 for (i = 1; i < nwords && part != 0; i++)
9996 part = expand_binop (word_mode, ior_optab, part,
9997 operand_subword_force (op0, i, GET_MODE (op0)),
9998 part, 1, OPTAB_WIDEN);
10002 do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
10003 NULL_RTX, 0, if_false_label, if_true_label);
10008 /* If we couldn't do the "or" simply, do this with a series of compares. */
10009 if (! if_false_label)
10010 drop_through_label = if_false_label = gen_label_rtx ();
10012 for (i = 0; i < nwords; i++)
10013 do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
10014 const0_rtx, EQ, 1, word_mode, NULL_RTX, 0,
10015 if_false_label, NULL_RTX);
10018 emit_jump (if_true_label);
10020 if (drop_through_label)
10021 emit_label (drop_through_label);
10024 /* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
10025 (including code to compute the values to be compared)
10026 and set (CC0) according to the result.
10027 The decision as to signed or unsigned comparison must be made by the caller.
10029 We force a stack adjustment unless there are currently
10030 things pushed on the stack that aren't yet used.
10032 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
10035 If ALIGN is non-zero, it is the alignment of this type; if zero, the
10036 size of MODE should be used. */
10039 compare_from_rtx (op0, op1, code, unsignedp, mode, size, align)
10040 register rtx op0, op1;
10041 enum rtx_code code;
10043 enum machine_mode mode;
10045 unsigned int align;
10049 /* If one operand is constant, make it the second one. Only do this
10050 if the other operand is not constant as well. */
10052 if ((CONSTANT_P (op0) && ! CONSTANT_P (op1))
10053 || (GET_CODE (op0) == CONST_INT && GET_CODE (op1) != CONST_INT))
10058 code = swap_condition (code);
10061 if (flag_force_mem)
10063 op0 = force_not_mem (op0);
10064 op1 = force_not_mem (op1);
10067 do_pending_stack_adjust ();
10069 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
10070 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
10074 /* There's no need to do this now that combine.c can eliminate lots of
10075 sign extensions. This can be less efficient in certain cases on other
10078 /* If this is a signed equality comparison, we can do it as an
10079 unsigned comparison since zero-extension is cheaper than sign
10080 extension and comparisons with zero are done as unsigned. This is
10081 the case even on machines that can do fast sign extension, since
10082 zero-extension is easier to combine with other operations than
10083 sign-extension is. If we are comparing against a constant, we must
10084 convert it to what it would look like unsigned. */
10085 if ((code == EQ || code == NE) && ! unsignedp
10086 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
10088 if (GET_CODE (op1) == CONST_INT
10089 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
10090 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
10095 emit_cmp_insn (op0, op1, code, size, mode, unsignedp, align);
10097 return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
10100 /* Like do_compare_and_jump but expects the values to compare as two rtx's.
10101 The decision as to signed or unsigned comparison must be made by the caller.
10103 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
10106 If ALIGN is non-zero, it is the alignment of this type; if zero, the
10107 size of MODE should be used. */
10110 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, size, align,
10111 if_false_label, if_true_label)
10112 register rtx op0, op1;
10113 enum rtx_code code;
10115 enum machine_mode mode;
10117 unsigned int align;
10118 rtx if_false_label, if_true_label;
10121 int dummy_true_label = 0;
10123 /* Reverse the comparison if that is safe and we want to jump if it is
10125 if (! if_true_label && ! FLOAT_MODE_P (mode))
10127 if_true_label = if_false_label;
10128 if_false_label = 0;
10129 code = reverse_condition (code);
10132 /* If one operand is constant, make it the second one. Only do this
10133 if the other operand is not constant as well. */
10135 if ((CONSTANT_P (op0) && ! CONSTANT_P (op1))
10136 || (GET_CODE (op0) == CONST_INT && GET_CODE (op1) != CONST_INT))
10141 code = swap_condition (code);
10144 if (flag_force_mem)
10146 op0 = force_not_mem (op0);
10147 op1 = force_not_mem (op1);
10150 do_pending_stack_adjust ();
10152 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
10153 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
10155 if (tem == const_true_rtx)
10158 emit_jump (if_true_label);
10162 if (if_false_label)
10163 emit_jump (if_false_label);
10169 /* There's no need to do this now that combine.c can eliminate lots of
10170 sign extensions. This can be less efficient in certain cases on other
10173 /* If this is a signed equality comparison, we can do it as an
10174 unsigned comparison since zero-extension is cheaper than sign
10175 extension and comparisons with zero are done as unsigned. This is
10176 the case even on machines that can do fast sign extension, since
10177 zero-extension is easier to combine with other operations than
10178 sign-extension is. If we are comparing against a constant, we must
10179 convert it to what it would look like unsigned. */
10180 if ((code == EQ || code == NE) && ! unsignedp
10181 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
10183 if (GET_CODE (op1) == CONST_INT
10184 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
10185 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
10190 if (! if_true_label)
10192 dummy_true_label = 1;
10193 if_true_label = gen_label_rtx ();
10196 emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp, align,
10199 if (if_false_label)
10200 emit_jump (if_false_label);
10201 if (dummy_true_label)
10202 emit_label (if_true_label);
10205 /* Generate code for a comparison expression EXP (including code to compute
10206 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
10207 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
10208 generated code will drop through.
10209 SIGNED_CODE should be the rtx operation for this comparison for
10210 signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
10212 We force a stack adjustment unless there are currently
10213 things pushed on the stack that aren't yet used. */
10216 do_compare_and_jump (exp, signed_code, unsigned_code, if_false_label,
10219 enum rtx_code signed_code, unsigned_code;
10220 rtx if_false_label, if_true_label;
10222 unsigned int align0, align1;
10223 register rtx op0, op1;
10224 register tree type;
10225 register enum machine_mode mode;
10227 enum rtx_code code;
10229 /* Don't crash if the comparison was erroneous. */
10230 op0 = expand_expr_unaligned (TREE_OPERAND (exp, 0), &align0);
10231 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
10234 op1 = expand_expr_unaligned (TREE_OPERAND (exp, 1), &align1);
10235 if (TREE_CODE (TREE_OPERAND (exp, 1)) == ERROR_MARK)
10238 type = TREE_TYPE (TREE_OPERAND (exp, 0));
10239 mode = TYPE_MODE (type);
10240 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
10241 && (TREE_CODE (TREE_OPERAND (exp, 1)) != INTEGER_CST
10242 || (GET_MODE_BITSIZE (mode)
10243 > GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp,
10246 /* op0 might have been replaced by promoted constant, in which
10247 case the type of second argument should be used. */
10248 type = TREE_TYPE (TREE_OPERAND (exp, 1));
10249 mode = TYPE_MODE (type);
10251 unsignedp = TREE_UNSIGNED (type);
10252 code = unsignedp ? unsigned_code : signed_code;
10254 #ifdef HAVE_canonicalize_funcptr_for_compare
10255 /* If function pointers need to be "canonicalized" before they can
10256 be reliably compared, then canonicalize them. */
10257 if (HAVE_canonicalize_funcptr_for_compare
10258 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
10259 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
10262 rtx new_op0 = gen_reg_rtx (mode);
10264 emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
10268 if (HAVE_canonicalize_funcptr_for_compare
10269 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
10270 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
10273 rtx new_op1 = gen_reg_rtx (mode);
10275 emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
10280 /* Do any postincrements in the expression that was tested. */
10283 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
10285 ? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
10286 MIN (align0, align1),
10287 if_false_label, if_true_label);
10290 /* Generate code to calculate EXP using a store-flag instruction
10291 and return an rtx for the result. EXP is either a comparison
10292 or a TRUTH_NOT_EXPR whose operand is a comparison.
10294 If TARGET is nonzero, store the result there if convenient.
10296 If ONLY_CHEAP is non-zero, only do this if it is likely to be very
10299 Return zero if there is no suitable set-flag instruction
10300 available on this machine.
10302 Once expand_expr has been called on the arguments of the comparison,
10303 we are committed to doing the store flag, since it is not safe to
10304 re-evaluate the expression. We emit the store-flag insn by calling
10305 emit_store_flag, but only expand the arguments if we have a reason
10306 to believe that emit_store_flag will be successful. If we think that
10307 it will, but it isn't, we have to simulate the store-flag with a
10308 set/jump/set sequence. */
10311 do_store_flag (exp, target, mode, only_cheap)
10314 enum machine_mode mode;
10317 enum rtx_code code;
10318 tree arg0, arg1, type;
10320 enum machine_mode operand_mode;
10324 enum insn_code icode;
10325 rtx subtarget = target;
10328 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
10329 result at the end. We can't simply invert the test since it would
10330 have already been inverted if it were valid. This case occurs for
10331 some floating-point comparisons. */
10333 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
10334 invert = 1, exp = TREE_OPERAND (exp, 0);
10336 arg0 = TREE_OPERAND (exp, 0);
10337 arg1 = TREE_OPERAND (exp, 1);
10339 /* Don't crash if the comparison was erroneous. */
10340 if (arg0 == error_mark_node || arg1 == error_mark_node)
10343 type = TREE_TYPE (arg0);
10344 operand_mode = TYPE_MODE (type);
10345 unsignedp = TREE_UNSIGNED (type);
10347 /* We won't bother with BLKmode store-flag operations because it would mean
10348 passing a lot of information to emit_store_flag. */
10349 if (operand_mode == BLKmode)
10352 /* We won't bother with store-flag operations involving function pointers
10353 when function pointers must be canonicalized before comparisons. */
10354 #ifdef HAVE_canonicalize_funcptr_for_compare
10355 if (HAVE_canonicalize_funcptr_for_compare
10356 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
10357 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
10359 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
10360 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
10361 == FUNCTION_TYPE))))
10368 /* Get the rtx comparison code to use. We know that EXP is a comparison
10369 operation of some type. Some comparisons against 1 and -1 can be
10370 converted to comparisons with zero. Do so here so that the tests
10371 below will be aware that we have a comparison with zero. These
10372 tests will not catch constants in the first operand, but constants
10373 are rarely passed as the first operand. */
10375 switch (TREE_CODE (exp))
10384 if (integer_onep (arg1))
10385 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10387 code = unsignedp ? LTU : LT;
10390 if (! unsignedp && integer_all_onesp (arg1))
10391 arg1 = integer_zero_node, code = LT;
10393 code = unsignedp ? LEU : LE;
10396 if (! unsignedp && integer_all_onesp (arg1))
10397 arg1 = integer_zero_node, code = GE;
10399 code = unsignedp ? GTU : GT;
10402 if (integer_onep (arg1))
10403 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10405 code = unsignedp ? GEU : GE;
10408 case UNORDERED_EXPR:
10434 /* Put a constant second. */
10435 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
10437 tem = arg0; arg0 = arg1; arg1 = tem;
10438 code = swap_condition (code);
10441 /* If this is an equality or inequality test of a single bit, we can
10442 do this by shifting the bit being tested to the low-order bit and
10443 masking the result with the constant 1. If the condition was EQ,
10444 we xor it with 1. This does not require an scc insn and is faster
10445 than an scc insn even if we have it. */
10447 if ((code == NE || code == EQ)
10448 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10449 && integer_pow2p (TREE_OPERAND (arg0, 1)))
10451 tree inner = TREE_OPERAND (arg0, 0);
10452 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
10455 /* If INNER is a right shift of a constant and it plus BITNUM does
10456 not overflow, adjust BITNUM and INNER. */
10458 if (TREE_CODE (inner) == RSHIFT_EXPR
10459 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
10460 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
10461 && bitnum < TYPE_PRECISION (type)
10462 && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
10463 bitnum - TYPE_PRECISION (type)))
10465 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
10466 inner = TREE_OPERAND (inner, 0);
10469 /* If we are going to be able to omit the AND below, we must do our
10470 operations as unsigned. If we must use the AND, we have a choice.
10471 Normally unsigned is faster, but for some machines signed is. */
10472 ops_unsignedp = (bitnum == TYPE_PRECISION (type) - 1 ? 1
10473 #ifdef LOAD_EXTEND_OP
10474 : (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND ? 0 : 1)
10480 if (! get_subtarget (subtarget)
10481 || GET_MODE (subtarget) != operand_mode
10482 || ! safe_from_p (subtarget, inner, 1))
10485 op0 = expand_expr (inner, subtarget, VOIDmode, 0);
10488 op0 = expand_shift (RSHIFT_EXPR, operand_mode, op0,
10489 size_int (bitnum), subtarget, ops_unsignedp);
10491 if (GET_MODE (op0) != mode)
10492 op0 = convert_to_mode (mode, op0, ops_unsignedp);
10494 if ((code == EQ && ! invert) || (code == NE && invert))
10495 op0 = expand_binop (mode, xor_optab, op0, const1_rtx, subtarget,
10496 ops_unsignedp, OPTAB_LIB_WIDEN);
10498 /* Put the AND last so it can combine with more things. */
10499 if (bitnum != TYPE_PRECISION (type) - 1)
10500 op0 = expand_and (op0, const1_rtx, subtarget);
10505 /* Now see if we are likely to be able to do this. Return if not. */
10506 if (! can_compare_p (code, operand_mode, ccp_store_flag))
10509 icode = setcc_gen_code[(int) code];
10510 if (icode == CODE_FOR_nothing
10511 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
10513 /* We can only do this if it is one of the special cases that
10514 can be handled without an scc insn. */
10515 if ((code == LT && integer_zerop (arg1))
10516 || (! only_cheap && code == GE && integer_zerop (arg1)))
10518 else if (BRANCH_COST >= 0
10519 && ! only_cheap && (code == NE || code == EQ)
10520 && TREE_CODE (type) != REAL_TYPE
10521 && ((abs_optab->handlers[(int) operand_mode].insn_code
10522 != CODE_FOR_nothing)
10523 || (ffs_optab->handlers[(int) operand_mode].insn_code
10524 != CODE_FOR_nothing)))
10530 if (! get_subtarget (target)
10531 || GET_MODE (subtarget) != operand_mode
10532 || ! safe_from_p (subtarget, arg1, 1))
10535 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
10536 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
10539 target = gen_reg_rtx (mode);
10541 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10542 because, if the emit_store_flag does anything it will succeed and
10543 OP0 and OP1 will not be used subsequently. */
10545 result = emit_store_flag (target, code,
10546 queued_subexp_p (op0) ? copy_rtx (op0) : op0,
10547 queued_subexp_p (op1) ? copy_rtx (op1) : op1,
10548 operand_mode, unsignedp, 1);
10553 result = expand_binop (mode, xor_optab, result, const1_rtx,
10554 result, 0, OPTAB_LIB_WIDEN);
10558 /* If this failed, we have to do this with set/compare/jump/set code. */
10559 if (GET_CODE (target) != REG
10560 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
10561 target = gen_reg_rtx (GET_MODE (target));
10563 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
10564 result = compare_from_rtx (op0, op1, code, unsignedp,
10565 operand_mode, NULL_RTX, 0);
10566 if (GET_CODE (result) == CONST_INT)
10567 return (((result == const0_rtx && ! invert)
10568 || (result != const0_rtx && invert))
10569 ? const0_rtx : const1_rtx);
10571 label = gen_label_rtx ();
10572 if (bcc_gen_fctn[(int) code] == 0)
10575 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
10576 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
10577 emit_label (label);
10582 /* Generate a tablejump instruction (used for switch statements). */
10584 #ifdef HAVE_tablejump
10586 /* INDEX is the value being switched on, with the lowest value
10587 in the table already subtracted.
10588 MODE is its expected mode (needed if INDEX is constant).
10589 RANGE is the length of the jump table.
10590 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10592 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10593 index value is out of range. */
10596 do_tablejump (index, mode, range, table_label, default_label)
10597 rtx index, range, table_label, default_label;
10598 enum machine_mode mode;
10600 register rtx temp, vector;
10602 /* Do an unsigned comparison (in the proper mode) between the index
10603 expression and the value which represents the length of the range.
10604 Since we just finished subtracting the lower bound of the range
10605 from the index expression, this comparison allows us to simultaneously
10606 check that the original index expression value is both greater than
10607 or equal to the minimum value of the range and less than or equal to
10608 the maximum value of the range. */
10610 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10613 /* If index is in range, it must fit in Pmode.
10614 Convert to Pmode so we can index with it. */
10616 index = convert_to_mode (Pmode, index, 1);
10618 /* Don't let a MEM slip thru, because then INDEX that comes
10619 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10620 and break_out_memory_refs will go to work on it and mess it up. */
10621 #ifdef PIC_CASE_VECTOR_ADDRESS
10622 if (flag_pic && GET_CODE (index) != REG)
10623 index = copy_to_mode_reg (Pmode, index);
10626 /* If flag_force_addr were to affect this address
10627 it could interfere with the tricky assumptions made
10628 about addresses that contain label-refs,
10629 which may be valid only very near the tablejump itself. */
10630 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10631 GET_MODE_SIZE, because this indicates how large insns are. The other
10632 uses should all be Pmode, because they are addresses. This code
10633 could fail if addresses and insns are not the same size. */
10634 index = gen_rtx_PLUS (Pmode,
10635 gen_rtx_MULT (Pmode, index,
10636 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10637 gen_rtx_LABEL_REF (Pmode, table_label));
10638 #ifdef PIC_CASE_VECTOR_ADDRESS
10640 index = PIC_CASE_VECTOR_ADDRESS (index);
10643 index = memory_address_noforce (CASE_VECTOR_MODE, index);
10644 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10645 vector = gen_rtx_MEM (CASE_VECTOR_MODE, index);
10646 RTX_UNCHANGING_P (vector) = 1;
10647 convert_move (temp, vector, 0);
10649 emit_jump_insn (gen_tablejump (temp, table_label));
10651 /* If we are generating PIC code or if the table is PC-relative, the
10652 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10653 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10657 #endif /* HAVE_tablejump */