1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
31 #include "hard-reg-set.h"
34 #include "insn-config.h"
35 #include "insn-attr.h"
36 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
43 #include "typeclass.h"
46 #include "langhooks.h"
50 /* Decide whether a function's arguments should be processed
51 from first to last or from last to first.
53 They should if the stack and args grow in opposite directions, but
54 only if we have push insns. */
58 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
59 #define PUSH_ARGS_REVERSED /* If it's last to first. */
64 #ifndef STACK_PUSH_CODE
65 #ifdef STACK_GROWS_DOWNWARD
66 #define STACK_PUSH_CODE PRE_DEC
68 #define STACK_PUSH_CODE PRE_INC
72 /* Assume that case vectors are not pc-relative. */
73 #ifndef CASE_VECTOR_PC_RELATIVE
74 #define CASE_VECTOR_PC_RELATIVE 0
77 /* If this is nonzero, we do not bother generating VOLATILE
78 around volatile memory references, and we are willing to
79 output indirect addresses. If cse is to follow, we reject
80 indirect addresses so a useful potential cse is generated;
81 if it is used only once, instruction combination will produce
82 the same indirect address eventually. */
85 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
86 static tree placeholder_list = 0;
88 /* This structure is used by move_by_pieces to describe the move to
99 int explicit_inc_from;
100 unsigned HOST_WIDE_INT len;
101 HOST_WIDE_INT offset;
105 /* This structure is used by store_by_pieces to describe the clear to
108 struct store_by_pieces
114 unsigned HOST_WIDE_INT len;
115 HOST_WIDE_INT offset;
116 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
121 extern struct obstack permanent_obstack;
123 static rtx enqueue_insn PARAMS ((rtx, rtx));
124 static unsigned HOST_WIDE_INT move_by_pieces_ninsns
125 PARAMS ((unsigned HOST_WIDE_INT,
127 static void move_by_pieces_1 PARAMS ((rtx (*) (rtx, ...), enum machine_mode,
128 struct move_by_pieces *));
129 static rtx clear_by_pieces_1 PARAMS ((PTR, HOST_WIDE_INT,
131 static void clear_by_pieces PARAMS ((rtx, unsigned HOST_WIDE_INT,
133 static void store_by_pieces_1 PARAMS ((struct store_by_pieces *,
135 static void store_by_pieces_2 PARAMS ((rtx (*) (rtx, ...),
137 struct store_by_pieces *));
138 static rtx compress_float_constant PARAMS ((rtx, rtx));
139 static rtx get_subtarget PARAMS ((rtx));
140 static int is_zeros_p PARAMS ((tree));
141 static int mostly_zeros_p PARAMS ((tree));
142 static void store_constructor_field PARAMS ((rtx, unsigned HOST_WIDE_INT,
143 HOST_WIDE_INT, enum machine_mode,
144 tree, tree, int, int));
145 static void store_constructor PARAMS ((tree, rtx, int, HOST_WIDE_INT));
146 static rtx store_field PARAMS ((rtx, HOST_WIDE_INT,
147 HOST_WIDE_INT, enum machine_mode,
148 tree, enum machine_mode, int, tree,
150 static rtx var_rtx PARAMS ((tree));
151 static HOST_WIDE_INT highest_pow2_factor PARAMS ((tree));
152 static HOST_WIDE_INT highest_pow2_factor_for_type PARAMS ((tree, tree));
153 static int is_aligning_offset PARAMS ((tree, tree));
154 static rtx expand_increment PARAMS ((tree, int, int));
155 static void do_jump_by_parts_greater PARAMS ((tree, int, rtx, rtx));
156 static void do_jump_by_parts_equality PARAMS ((tree, rtx, rtx));
157 static void do_compare_and_jump PARAMS ((tree, enum rtx_code, enum rtx_code,
159 static rtx do_store_flag PARAMS ((tree, rtx, enum machine_mode, int));
161 static void emit_single_push_insn PARAMS ((enum machine_mode, rtx, tree));
163 static void do_tablejump PARAMS ((rtx, enum machine_mode, rtx, rtx, rtx));
165 /* Record for each mode whether we can move a register directly to or
166 from an object of that mode in memory. If we can't, we won't try
167 to use that mode directly when accessing a field of that mode. */
169 static char direct_load[NUM_MACHINE_MODES];
170 static char direct_store[NUM_MACHINE_MODES];
172 /* Record for each mode whether we can float-extend from memory. */
174 static bool float_extend_from_mem[NUM_MACHINE_MODES][NUM_MACHINE_MODES];
176 /* If a memory-to-memory move would take MOVE_RATIO or more simple
177 move-instruction sequences, we will do a movstr or libcall instead. */
180 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
183 /* If we are optimizing for space (-Os), cut down the default move ratio. */
184 #define MOVE_RATIO (optimize_size ? 3 : 15)
188 /* This macro is used to determine whether move_by_pieces should be called
189 to perform a structure copy. */
190 #ifndef MOVE_BY_PIECES_P
191 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
192 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) MOVE_RATIO)
195 /* If a clear memory operation would take CLEAR_RATIO or more simple
196 move-instruction sequences, we will do a clrstr or libcall instead. */
199 #if defined (HAVE_clrstrqi) || defined (HAVE_clrstrhi) || defined (HAVE_clrstrsi) || defined (HAVE_clrstrdi) || defined (HAVE_clrstrti)
200 #define CLEAR_RATIO 2
202 /* If we are optimizing for space, cut down the default clear ratio. */
203 #define CLEAR_RATIO (optimize_size ? 3 : 15)
207 /* This macro is used to determine whether clear_by_pieces should be
208 called to clear storage. */
209 #ifndef CLEAR_BY_PIECES_P
210 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
211 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) CLEAR_RATIO)
214 /* This array records the insn_code of insns to perform block moves. */
215 enum insn_code movstr_optab[NUM_MACHINE_MODES];
217 /* This array records the insn_code of insns to perform block clears. */
218 enum insn_code clrstr_optab[NUM_MACHINE_MODES];
220 /* SLOW_UNALIGNED_ACCESS is non-zero if unaligned accesses are very slow. */
222 #ifndef SLOW_UNALIGNED_ACCESS
223 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
226 /* This is run once per compilation to set up which modes can be used
227 directly in memory and to initialize the block move optab. */
233 enum machine_mode mode;
238 /* Try indexing by frame ptr and try by stack ptr.
239 It is known that on the Convex the stack ptr isn't a valid index.
240 With luck, one or the other is valid on any machine. */
241 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
242 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
244 /* A scratch register we can modify in-place below to avoid
245 useless RTL allocations. */
246 reg = gen_rtx_REG (VOIDmode, -1);
248 insn = rtx_alloc (INSN);
249 pat = gen_rtx_SET (0, NULL_RTX, NULL_RTX);
250 PATTERN (insn) = pat;
252 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
253 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);
260 PUT_MODE (reg, mode);
262 /* See if there is some register that can be used in this mode and
263 directly loaded or stored from memory. */
265 if (mode != VOIDmode && mode != BLKmode)
266 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
267 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
270 if (! HARD_REGNO_MODE_OK (regno, mode))
276 SET_DEST (pat) = reg;
277 if (recog (pat, insn, &num_clobbers) >= 0)
278 direct_load[(int) mode] = 1;
280 SET_SRC (pat) = mem1;
281 SET_DEST (pat) = reg;
282 if (recog (pat, insn, &num_clobbers) >= 0)
283 direct_load[(int) mode] = 1;
286 SET_DEST (pat) = mem;
287 if (recog (pat, insn, &num_clobbers) >= 0)
288 direct_store[(int) mode] = 1;
291 SET_DEST (pat) = mem1;
292 if (recog (pat, insn, &num_clobbers) >= 0)
293 direct_store[(int) mode] = 1;
297 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
299 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
300 mode = GET_MODE_WIDER_MODE (mode))
302 enum machine_mode srcmode;
303 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
304 srcmode = GET_MODE_WIDER_MODE (srcmode))
308 ic = can_extend_p (mode, srcmode, 0);
309 if (ic == CODE_FOR_nothing)
312 PUT_MODE (mem, srcmode);
314 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
315 float_extend_from_mem[mode][srcmode] = true;
320 /* This is run at the start of compiling a function. */
325 cfun->expr = (struct expr_status *) ggc_alloc (sizeof (struct expr_status));
328 pending_stack_adjust = 0;
329 stack_pointer_delta = 0;
330 inhibit_defer_pop = 0;
332 apply_args_value = 0;
336 /* Small sanity check that the queue is empty at the end of a function. */
339 finish_expr_for_function ()
345 /* Manage the queue of increment instructions to be output
346 for POSTINCREMENT_EXPR expressions, etc. */
348 /* Queue up to increment (or change) VAR later. BODY says how:
349 BODY should be the same thing you would pass to emit_insn
350 to increment right away. It will go to emit_insn later on.
352 The value is a QUEUED expression to be used in place of VAR
353 where you want to guarantee the pre-incrementation value of VAR. */
356 enqueue_insn (var, body)
359 pending_chain = gen_rtx_QUEUED (GET_MODE (var), var, NULL_RTX, NULL_RTX,
360 body, pending_chain);
361 return pending_chain;
364 /* Use protect_from_queue to convert a QUEUED expression
365 into something that you can put immediately into an instruction.
366 If the queued incrementation has not happened yet,
367 protect_from_queue returns the variable itself.
368 If the incrementation has happened, protect_from_queue returns a temp
369 that contains a copy of the old value of the variable.
371 Any time an rtx which might possibly be a QUEUED is to be put
372 into an instruction, it must be passed through protect_from_queue first.
373 QUEUED expressions are not meaningful in instructions.
375 Do not pass a value through protect_from_queue and then hold
376 on to it for a while before putting it in an instruction!
377 If the queue is flushed in between, incorrect code will result. */
380 protect_from_queue (x, modify)
384 RTX_CODE code = GET_CODE (x);
386 #if 0 /* A QUEUED can hang around after the queue is forced out. */
387 /* Shortcut for most common case. */
388 if (pending_chain == 0)
394 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
395 use of autoincrement. Make a copy of the contents of the memory
396 location rather than a copy of the address, but not if the value is
397 of mode BLKmode. Don't modify X in place since it might be
399 if (code == MEM && GET_MODE (x) != BLKmode
400 && GET_CODE (XEXP (x, 0)) == QUEUED && !modify)
403 rtx new = replace_equiv_address_nv (x, QUEUED_VAR (y));
407 rtx temp = gen_reg_rtx (GET_MODE (x));
409 emit_insn_before (gen_move_insn (temp, new),
414 /* Copy the address into a pseudo, so that the returned value
415 remains correct across calls to emit_queue. */
416 return replace_equiv_address (new, copy_to_reg (XEXP (new, 0)));
419 /* Otherwise, recursively protect the subexpressions of all
420 the kinds of rtx's that can contain a QUEUED. */
423 rtx tem = protect_from_queue (XEXP (x, 0), 0);
424 if (tem != XEXP (x, 0))
430 else if (code == PLUS || code == MULT)
432 rtx new0 = protect_from_queue (XEXP (x, 0), 0);
433 rtx new1 = protect_from_queue (XEXP (x, 1), 0);
434 if (new0 != XEXP (x, 0) || new1 != XEXP (x, 1))
443 /* If the increment has not happened, use the variable itself. Copy it
444 into a new pseudo so that the value remains correct across calls to
446 if (QUEUED_INSN (x) == 0)
447 return copy_to_reg (QUEUED_VAR (x));
448 /* If the increment has happened and a pre-increment copy exists,
450 if (QUEUED_COPY (x) != 0)
451 return QUEUED_COPY (x);
452 /* The increment has happened but we haven't set up a pre-increment copy.
453 Set one up now, and use it. */
454 QUEUED_COPY (x) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x)));
455 emit_insn_before (gen_move_insn (QUEUED_COPY (x), QUEUED_VAR (x)),
457 return QUEUED_COPY (x);
460 /* Return nonzero if X contains a QUEUED expression:
461 if it contains anything that will be altered by a queued increment.
462 We handle only combinations of MEM, PLUS, MINUS and MULT operators
463 since memory addresses generally contain only those. */
469 enum rtx_code code = GET_CODE (x);
475 return queued_subexp_p (XEXP (x, 0));
479 return (queued_subexp_p (XEXP (x, 0))
480 || queued_subexp_p (XEXP (x, 1)));
486 /* Perform all the pending incrementations. */
492 while ((p = pending_chain))
494 rtx body = QUEUED_BODY (p);
496 switch (GET_CODE (body))
504 QUEUED_INSN (p) = body;
508 #ifdef ENABLE_CHECKING
515 QUEUED_INSN (p) = emit_insn (body);
519 pending_chain = QUEUED_NEXT (p);
523 /* Copy data from FROM to TO, where the machine modes are not the same.
524 Both modes may be integer, or both may be floating.
525 UNSIGNEDP should be nonzero if FROM is an unsigned type.
526 This causes zero-extension instead of sign-extension. */
529 convert_move (to, from, unsignedp)
533 enum machine_mode to_mode = GET_MODE (to);
534 enum machine_mode from_mode = GET_MODE (from);
535 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
536 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
540 /* rtx code for making an equivalent value. */
541 enum rtx_code equiv_code = (unsignedp ? ZERO_EXTEND : SIGN_EXTEND);
543 to = protect_from_queue (to, 1);
544 from = protect_from_queue (from, 0);
546 if (to_real != from_real)
549 /* If FROM is a SUBREG that indicates that we have already done at least
550 the required extension, strip it. We don't handle such SUBREGs as
553 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
554 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
555 >= GET_MODE_SIZE (to_mode))
556 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
557 from = gen_lowpart (to_mode, from), from_mode = to_mode;
559 if (GET_CODE (to) == SUBREG && SUBREG_PROMOTED_VAR_P (to))
562 if (to_mode == from_mode
563 || (from_mode == VOIDmode && CONSTANT_P (from)))
565 emit_move_insn (to, from);
569 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
571 if (GET_MODE_BITSIZE (from_mode) != GET_MODE_BITSIZE (to_mode))
574 if (VECTOR_MODE_P (to_mode))
575 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
577 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
579 emit_move_insn (to, from);
583 if (to_real != from_real)
590 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode))
592 /* Try converting directly if the insn is supported. */
593 if ((code = can_extend_p (to_mode, from_mode, 0))
596 emit_unop_insn (code, to, from, UNKNOWN);
601 #ifdef HAVE_trunchfqf2
602 if (HAVE_trunchfqf2 && from_mode == HFmode && to_mode == QFmode)
604 emit_unop_insn (CODE_FOR_trunchfqf2, to, from, UNKNOWN);
608 #ifdef HAVE_trunctqfqf2
609 if (HAVE_trunctqfqf2 && from_mode == TQFmode && to_mode == QFmode)
611 emit_unop_insn (CODE_FOR_trunctqfqf2, to, from, UNKNOWN);
615 #ifdef HAVE_truncsfqf2
616 if (HAVE_truncsfqf2 && from_mode == SFmode && to_mode == QFmode)
618 emit_unop_insn (CODE_FOR_truncsfqf2, to, from, UNKNOWN);
622 #ifdef HAVE_truncdfqf2
623 if (HAVE_truncdfqf2 && from_mode == DFmode && to_mode == QFmode)
625 emit_unop_insn (CODE_FOR_truncdfqf2, to, from, UNKNOWN);
629 #ifdef HAVE_truncxfqf2
630 if (HAVE_truncxfqf2 && from_mode == XFmode && to_mode == QFmode)
632 emit_unop_insn (CODE_FOR_truncxfqf2, to, from, UNKNOWN);
636 #ifdef HAVE_trunctfqf2
637 if (HAVE_trunctfqf2 && from_mode == TFmode && to_mode == QFmode)
639 emit_unop_insn (CODE_FOR_trunctfqf2, to, from, UNKNOWN);
644 #ifdef HAVE_trunctqfhf2
645 if (HAVE_trunctqfhf2 && from_mode == TQFmode && to_mode == HFmode)
647 emit_unop_insn (CODE_FOR_trunctqfhf2, to, from, UNKNOWN);
651 #ifdef HAVE_truncsfhf2
652 if (HAVE_truncsfhf2 && from_mode == SFmode && to_mode == HFmode)
654 emit_unop_insn (CODE_FOR_truncsfhf2, to, from, UNKNOWN);
658 #ifdef HAVE_truncdfhf2
659 if (HAVE_truncdfhf2 && from_mode == DFmode && to_mode == HFmode)
661 emit_unop_insn (CODE_FOR_truncdfhf2, to, from, UNKNOWN);
665 #ifdef HAVE_truncxfhf2
666 if (HAVE_truncxfhf2 && from_mode == XFmode && to_mode == HFmode)
668 emit_unop_insn (CODE_FOR_truncxfhf2, to, from, UNKNOWN);
672 #ifdef HAVE_trunctfhf2
673 if (HAVE_trunctfhf2 && from_mode == TFmode && to_mode == HFmode)
675 emit_unop_insn (CODE_FOR_trunctfhf2, to, from, UNKNOWN);
680 #ifdef HAVE_truncsftqf2
681 if (HAVE_truncsftqf2 && from_mode == SFmode && to_mode == TQFmode)
683 emit_unop_insn (CODE_FOR_truncsftqf2, to, from, UNKNOWN);
687 #ifdef HAVE_truncdftqf2
688 if (HAVE_truncdftqf2 && from_mode == DFmode && to_mode == TQFmode)
690 emit_unop_insn (CODE_FOR_truncdftqf2, to, from, UNKNOWN);
694 #ifdef HAVE_truncxftqf2
695 if (HAVE_truncxftqf2 && from_mode == XFmode && to_mode == TQFmode)
697 emit_unop_insn (CODE_FOR_truncxftqf2, to, from, UNKNOWN);
701 #ifdef HAVE_trunctftqf2
702 if (HAVE_trunctftqf2 && from_mode == TFmode && to_mode == TQFmode)
704 emit_unop_insn (CODE_FOR_trunctftqf2, to, from, UNKNOWN);
709 #ifdef HAVE_truncdfsf2
710 if (HAVE_truncdfsf2 && from_mode == DFmode && to_mode == SFmode)
712 emit_unop_insn (CODE_FOR_truncdfsf2, to, from, UNKNOWN);
716 #ifdef HAVE_truncxfsf2
717 if (HAVE_truncxfsf2 && from_mode == XFmode && to_mode == SFmode)
719 emit_unop_insn (CODE_FOR_truncxfsf2, to, from, UNKNOWN);
723 #ifdef HAVE_trunctfsf2
724 if (HAVE_trunctfsf2 && from_mode == TFmode && to_mode == SFmode)
726 emit_unop_insn (CODE_FOR_trunctfsf2, to, from, UNKNOWN);
730 #ifdef HAVE_truncxfdf2
731 if (HAVE_truncxfdf2 && from_mode == XFmode && to_mode == DFmode)
733 emit_unop_insn (CODE_FOR_truncxfdf2, to, from, UNKNOWN);
737 #ifdef HAVE_trunctfdf2
738 if (HAVE_trunctfdf2 && from_mode == TFmode && to_mode == DFmode)
740 emit_unop_insn (CODE_FOR_trunctfdf2, to, from, UNKNOWN);
752 libcall = extendsfdf2_libfunc;
756 libcall = extendsfxf2_libfunc;
760 libcall = extendsftf2_libfunc;
772 libcall = truncdfsf2_libfunc;
776 libcall = extenddfxf2_libfunc;
780 libcall = extenddftf2_libfunc;
792 libcall = truncxfsf2_libfunc;
796 libcall = truncxfdf2_libfunc;
808 libcall = trunctfsf2_libfunc;
812 libcall = trunctfdf2_libfunc;
824 if (libcall == (rtx) 0)
825 /* This conversion is not implemented yet. */
829 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
831 insns = get_insns ();
833 emit_libcall_block (insns, to, value, gen_rtx_FLOAT_TRUNCATE (to_mode,
838 /* Now both modes are integers. */
840 /* Handle expanding beyond a word. */
841 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
842 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
849 enum machine_mode lowpart_mode;
850 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
852 /* Try converting directly if the insn is supported. */
853 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
856 /* If FROM is a SUBREG, put it into a register. Do this
857 so that we always generate the same set of insns for
858 better cse'ing; if an intermediate assignment occurred,
859 we won't be doing the operation directly on the SUBREG. */
860 if (optimize > 0 && GET_CODE (from) == SUBREG)
861 from = force_reg (from_mode, from);
862 emit_unop_insn (code, to, from, equiv_code);
865 /* Next, try converting via full word. */
866 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
867 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
868 != CODE_FOR_nothing))
870 if (GET_CODE (to) == REG)
871 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
872 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
873 emit_unop_insn (code, to,
874 gen_lowpart (word_mode, to), equiv_code);
878 /* No special multiword conversion insn; do it by hand. */
881 /* Since we will turn this into a no conflict block, we must ensure
882 that the source does not overlap the target. */
884 if (reg_overlap_mentioned_p (to, from))
885 from = force_reg (from_mode, from);
887 /* Get a copy of FROM widened to a word, if necessary. */
888 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
889 lowpart_mode = word_mode;
891 lowpart_mode = from_mode;
893 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
895 lowpart = gen_lowpart (lowpart_mode, to);
896 emit_move_insn (lowpart, lowfrom);
898 /* Compute the value to put in each remaining word. */
900 fill_value = const0_rtx;
905 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
906 && STORE_FLAG_VALUE == -1)
908 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
910 fill_value = gen_reg_rtx (word_mode);
911 emit_insn (gen_slt (fill_value));
917 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
918 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
920 fill_value = convert_to_mode (word_mode, fill_value, 1);
924 /* Fill the remaining words. */
925 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
927 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
928 rtx subword = operand_subword (to, index, 1, to_mode);
933 if (fill_value != subword)
934 emit_move_insn (subword, fill_value);
937 insns = get_insns ();
940 emit_no_conflict_block (insns, to, from, NULL_RTX,
941 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
945 /* Truncating multi-word to a word or less. */
946 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
947 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
949 if (!((GET_CODE (from) == MEM
950 && ! MEM_VOLATILE_P (from)
951 && direct_load[(int) to_mode]
952 && ! mode_dependent_address_p (XEXP (from, 0)))
953 || GET_CODE (from) == REG
954 || GET_CODE (from) == SUBREG))
955 from = force_reg (from_mode, from);
956 convert_move (to, gen_lowpart (word_mode, from), 0);
960 /* Handle pointer conversion. */ /* SPEE 900220. */
961 if (to_mode == PQImode)
963 if (from_mode != QImode)
964 from = convert_to_mode (QImode, from, unsignedp);
966 #ifdef HAVE_truncqipqi2
967 if (HAVE_truncqipqi2)
969 emit_unop_insn (CODE_FOR_truncqipqi2, to, from, UNKNOWN);
972 #endif /* HAVE_truncqipqi2 */
976 if (from_mode == PQImode)
978 if (to_mode != QImode)
980 from = convert_to_mode (QImode, from, unsignedp);
985 #ifdef HAVE_extendpqiqi2
986 if (HAVE_extendpqiqi2)
988 emit_unop_insn (CODE_FOR_extendpqiqi2, to, from, UNKNOWN);
991 #endif /* HAVE_extendpqiqi2 */
996 if (to_mode == PSImode)
998 if (from_mode != SImode)
999 from = convert_to_mode (SImode, from, unsignedp);
1001 #ifdef HAVE_truncsipsi2
1002 if (HAVE_truncsipsi2)
1004 emit_unop_insn (CODE_FOR_truncsipsi2, to, from, UNKNOWN);
1007 #endif /* HAVE_truncsipsi2 */
1011 if (from_mode == PSImode)
1013 if (to_mode != SImode)
1015 from = convert_to_mode (SImode, from, unsignedp);
1020 #ifdef HAVE_extendpsisi2
1021 if (! unsignedp && HAVE_extendpsisi2)
1023 emit_unop_insn (CODE_FOR_extendpsisi2, to, from, UNKNOWN);
1026 #endif /* HAVE_extendpsisi2 */
1027 #ifdef HAVE_zero_extendpsisi2
1028 if (unsignedp && HAVE_zero_extendpsisi2)
1030 emit_unop_insn (CODE_FOR_zero_extendpsisi2, to, from, UNKNOWN);
1033 #endif /* HAVE_zero_extendpsisi2 */
1038 if (to_mode == PDImode)
1040 if (from_mode != DImode)
1041 from = convert_to_mode (DImode, from, unsignedp);
1043 #ifdef HAVE_truncdipdi2
1044 if (HAVE_truncdipdi2)
1046 emit_unop_insn (CODE_FOR_truncdipdi2, to, from, UNKNOWN);
1049 #endif /* HAVE_truncdipdi2 */
1053 if (from_mode == PDImode)
1055 if (to_mode != DImode)
1057 from = convert_to_mode (DImode, from, unsignedp);
1062 #ifdef HAVE_extendpdidi2
1063 if (HAVE_extendpdidi2)
1065 emit_unop_insn (CODE_FOR_extendpdidi2, to, from, UNKNOWN);
1068 #endif /* HAVE_extendpdidi2 */
1073 /* Now follow all the conversions between integers
1074 no more than a word long. */
1076 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1077 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
1078 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1079 GET_MODE_BITSIZE (from_mode)))
1081 if (!((GET_CODE (from) == MEM
1082 && ! MEM_VOLATILE_P (from)
1083 && direct_load[(int) to_mode]
1084 && ! mode_dependent_address_p (XEXP (from, 0)))
1085 || GET_CODE (from) == REG
1086 || GET_CODE (from) == SUBREG))
1087 from = force_reg (from_mode, from);
1088 if (GET_CODE (from) == REG && REGNO (from) < FIRST_PSEUDO_REGISTER
1089 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
1090 from = copy_to_reg (from);
1091 emit_move_insn (to, gen_lowpart (to_mode, from));
1095 /* Handle extension. */
1096 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
1098 /* Convert directly if that works. */
1099 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
1100 != CODE_FOR_nothing)
1103 from = force_not_mem (from);
1105 emit_unop_insn (code, to, from, equiv_code);
1110 enum machine_mode intermediate;
1114 /* Search for a mode to convert via. */
1115 for (intermediate = from_mode; intermediate != VOIDmode;
1116 intermediate = GET_MODE_WIDER_MODE (intermediate))
1117 if (((can_extend_p (to_mode, intermediate, unsignedp)
1118 != CODE_FOR_nothing)
1119 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
1120 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1121 GET_MODE_BITSIZE (intermediate))))
1122 && (can_extend_p (intermediate, from_mode, unsignedp)
1123 != CODE_FOR_nothing))
1125 convert_move (to, convert_to_mode (intermediate, from,
1126 unsignedp), unsignedp);
1130 /* No suitable intermediate mode.
1131 Generate what we need with shifts. */
1132 shift_amount = build_int_2 (GET_MODE_BITSIZE (to_mode)
1133 - GET_MODE_BITSIZE (from_mode), 0);
1134 from = gen_lowpart (to_mode, force_reg (from_mode, from));
1135 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
1137 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
1140 emit_move_insn (to, tmp);
1145 /* Support special truncate insns for certain modes. */
1147 if (from_mode == DImode && to_mode == SImode)
1149 #ifdef HAVE_truncdisi2
1150 if (HAVE_truncdisi2)
1152 emit_unop_insn (CODE_FOR_truncdisi2, to, from, UNKNOWN);
1156 convert_move (to, force_reg (from_mode, from), unsignedp);
1160 if (from_mode == DImode && to_mode == HImode)
1162 #ifdef HAVE_truncdihi2
1163 if (HAVE_truncdihi2)
1165 emit_unop_insn (CODE_FOR_truncdihi2, to, from, UNKNOWN);
1169 convert_move (to, force_reg (from_mode, from), unsignedp);
1173 if (from_mode == DImode && to_mode == QImode)
1175 #ifdef HAVE_truncdiqi2
1176 if (HAVE_truncdiqi2)
1178 emit_unop_insn (CODE_FOR_truncdiqi2, to, from, UNKNOWN);
1182 convert_move (to, force_reg (from_mode, from), unsignedp);
1186 if (from_mode == SImode && to_mode == HImode)
1188 #ifdef HAVE_truncsihi2
1189 if (HAVE_truncsihi2)
1191 emit_unop_insn (CODE_FOR_truncsihi2, to, from, UNKNOWN);
1195 convert_move (to, force_reg (from_mode, from), unsignedp);
1199 if (from_mode == SImode && to_mode == QImode)
1201 #ifdef HAVE_truncsiqi2
1202 if (HAVE_truncsiqi2)
1204 emit_unop_insn (CODE_FOR_truncsiqi2, to, from, UNKNOWN);
1208 convert_move (to, force_reg (from_mode, from), unsignedp);
1212 if (from_mode == HImode && to_mode == QImode)
1214 #ifdef HAVE_trunchiqi2
1215 if (HAVE_trunchiqi2)
1217 emit_unop_insn (CODE_FOR_trunchiqi2, to, from, UNKNOWN);
1221 convert_move (to, force_reg (from_mode, from), unsignedp);
1225 if (from_mode == TImode && to_mode == DImode)
1227 #ifdef HAVE_trunctidi2
1228 if (HAVE_trunctidi2)
1230 emit_unop_insn (CODE_FOR_trunctidi2, to, from, UNKNOWN);
1234 convert_move (to, force_reg (from_mode, from), unsignedp);
1238 if (from_mode == TImode && to_mode == SImode)
1240 #ifdef HAVE_trunctisi2
1241 if (HAVE_trunctisi2)
1243 emit_unop_insn (CODE_FOR_trunctisi2, to, from, UNKNOWN);
1247 convert_move (to, force_reg (from_mode, from), unsignedp);
1251 if (from_mode == TImode && to_mode == HImode)
1253 #ifdef HAVE_trunctihi2
1254 if (HAVE_trunctihi2)
1256 emit_unop_insn (CODE_FOR_trunctihi2, to, from, UNKNOWN);
1260 convert_move (to, force_reg (from_mode, from), unsignedp);
1264 if (from_mode == TImode && to_mode == QImode)
1266 #ifdef HAVE_trunctiqi2
1267 if (HAVE_trunctiqi2)
1269 emit_unop_insn (CODE_FOR_trunctiqi2, to, from, UNKNOWN);
1273 convert_move (to, force_reg (from_mode, from), unsignedp);
1277 /* Handle truncation of volatile memrefs, and so on;
1278 the things that couldn't be truncated directly,
1279 and for which there was no special instruction. */
1280 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
1282 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
1283 emit_move_insn (to, temp);
1287 /* Mode combination is not recognized. */
1291 /* Return an rtx for a value that would result
1292 from converting X to mode MODE.
1293 Both X and MODE may be floating, or both integer.
1294 UNSIGNEDP is nonzero if X is an unsigned value.
1295 This can be done by referring to a part of X in place
1296 or by copying to a new temporary with conversion.
1298 This function *must not* call protect_from_queue
1299 except when putting X into an insn (in which case convert_move does it). */
1302 convert_to_mode (mode, x, unsignedp)
1303 enum machine_mode mode;
1307 return convert_modes (mode, VOIDmode, x, unsignedp);
1310 /* Return an rtx for a value that would result
1311 from converting X from mode OLDMODE to mode MODE.
1312 Both modes may be floating, or both integer.
1313 UNSIGNEDP is nonzero if X is an unsigned value.
1315 This can be done by referring to a part of X in place
1316 or by copying to a new temporary with conversion.
1318 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1320 This function *must not* call protect_from_queue
1321 except when putting X into an insn (in which case convert_move does it). */
1324 convert_modes (mode, oldmode, x, unsignedp)
1325 enum machine_mode mode, oldmode;
1331 /* If FROM is a SUBREG that indicates that we have already done at least
1332 the required extension, strip it. */
1334 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
1335 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
1336 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
1337 x = gen_lowpart (mode, x);
1339 if (GET_MODE (x) != VOIDmode)
1340 oldmode = GET_MODE (x);
1342 if (mode == oldmode)
1345 /* There is one case that we must handle specially: If we are converting
1346 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1347 we are to interpret the constant as unsigned, gen_lowpart will do
1348 the wrong if the constant appears negative. What we want to do is
1349 make the high-order word of the constant zero, not all ones. */
1351 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
1352 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
1353 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
1355 HOST_WIDE_INT val = INTVAL (x);
1357 if (oldmode != VOIDmode
1358 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
1360 int width = GET_MODE_BITSIZE (oldmode);
1362 /* We need to zero extend VAL. */
1363 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1366 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
1369 /* We can do this with a gen_lowpart if both desired and current modes
1370 are integer, and this is either a constant integer, a register, or a
1371 non-volatile MEM. Except for the constant case where MODE is no
1372 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1374 if ((GET_CODE (x) == CONST_INT
1375 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
1376 || (GET_MODE_CLASS (mode) == MODE_INT
1377 && GET_MODE_CLASS (oldmode) == MODE_INT
1378 && (GET_CODE (x) == CONST_DOUBLE
1379 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
1380 && ((GET_CODE (x) == MEM && ! MEM_VOLATILE_P (x)
1381 && direct_load[(int) mode])
1382 || (GET_CODE (x) == REG
1383 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1384 GET_MODE_BITSIZE (GET_MODE (x)))))))))
1386 /* ?? If we don't know OLDMODE, we have to assume here that
1387 X does not need sign- or zero-extension. This may not be
1388 the case, but it's the best we can do. */
1389 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
1390 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
1392 HOST_WIDE_INT val = INTVAL (x);
1393 int width = GET_MODE_BITSIZE (oldmode);
1395 /* We must sign or zero-extend in this case. Start by
1396 zero-extending, then sign extend if we need to. */
1397 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1399 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
1400 val |= (HOST_WIDE_INT) (-1) << width;
1402 return gen_int_mode (val, mode);
1405 return gen_lowpart (mode, x);
1408 temp = gen_reg_rtx (mode);
1409 convert_move (temp, x, unsignedp);
1413 /* This macro is used to determine what the largest unit size that
1414 move_by_pieces can use is. */
1416 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1417 move efficiently, as opposed to MOVE_MAX which is the maximum
1418 number of bytes we can move with a single instruction. */
1420 #ifndef MOVE_MAX_PIECES
1421 #define MOVE_MAX_PIECES MOVE_MAX
1424 /* STORE_MAX_PIECES is the number of bytes at a time that we can
1425 store efficiently. Due to internal GCC limitations, this is
1426 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
1427 for an immediate constant. */
1429 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
1431 /* Generate several move instructions to copy LEN bytes from block FROM to
1432 block TO. (These are MEM rtx's with BLKmode). The caller must pass FROM
1433 and TO through protect_from_queue before calling.
1435 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
1436 used to push FROM to the stack.
1438 ALIGN is maximum alignment we can assume. */
1441 move_by_pieces (to, from, len, align)
1443 unsigned HOST_WIDE_INT len;
1446 struct move_by_pieces data;
1447 rtx to_addr, from_addr = XEXP (from, 0);
1448 unsigned int max_size = MOVE_MAX_PIECES + 1;
1449 enum machine_mode mode = VOIDmode, tmode;
1450 enum insn_code icode;
1453 data.from_addr = from_addr;
1456 to_addr = XEXP (to, 0);
1459 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
1460 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
1462 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
1469 #ifdef STACK_GROWS_DOWNWARD
1475 data.to_addr = to_addr;
1478 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
1479 || GET_CODE (from_addr) == POST_INC
1480 || GET_CODE (from_addr) == POST_DEC);
1482 data.explicit_inc_from = 0;
1483 data.explicit_inc_to = 0;
1484 if (data.reverse) data.offset = len;
1487 /* If copying requires more than two move insns,
1488 copy addresses to registers (to make displacements shorter)
1489 and use post-increment if available. */
1490 if (!(data.autinc_from && data.autinc_to)
1491 && move_by_pieces_ninsns (len, align) > 2)
1493 /* Find the mode of the largest move... */
1494 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1495 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1496 if (GET_MODE_SIZE (tmode) < max_size)
1499 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
1501 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
1502 data.autinc_from = 1;
1503 data.explicit_inc_from = -1;
1505 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
1507 data.from_addr = copy_addr_to_reg (from_addr);
1508 data.autinc_from = 1;
1509 data.explicit_inc_from = 1;
1511 if (!data.autinc_from && CONSTANT_P (from_addr))
1512 data.from_addr = copy_addr_to_reg (from_addr);
1513 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
1515 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
1517 data.explicit_inc_to = -1;
1519 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
1521 data.to_addr = copy_addr_to_reg (to_addr);
1523 data.explicit_inc_to = 1;
1525 if (!data.autinc_to && CONSTANT_P (to_addr))
1526 data.to_addr = copy_addr_to_reg (to_addr);
1529 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1530 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1531 align = MOVE_MAX * BITS_PER_UNIT;
1533 /* First move what we can in the largest integer mode, then go to
1534 successively smaller modes. */
1536 while (max_size > 1)
1538 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1539 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1540 if (GET_MODE_SIZE (tmode) < max_size)
1543 if (mode == VOIDmode)
1546 icode = mov_optab->handlers[(int) mode].insn_code;
1547 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1548 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1550 max_size = GET_MODE_SIZE (mode);
1553 /* The code above should have handled everything. */
1558 /* Return number of insns required to move L bytes by pieces.
1559 ALIGN (in bits) is maximum alignment we can assume. */
1561 static unsigned HOST_WIDE_INT
1562 move_by_pieces_ninsns (l, align)
1563 unsigned HOST_WIDE_INT l;
1566 unsigned HOST_WIDE_INT n_insns = 0;
1567 unsigned HOST_WIDE_INT max_size = MOVE_MAX + 1;
1569 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1570 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1571 align = MOVE_MAX * BITS_PER_UNIT;
1573 while (max_size > 1)
1575 enum machine_mode mode = VOIDmode, tmode;
1576 enum insn_code icode;
1578 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1579 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1580 if (GET_MODE_SIZE (tmode) < max_size)
1583 if (mode == VOIDmode)
1586 icode = mov_optab->handlers[(int) mode].insn_code;
1587 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1588 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1590 max_size = GET_MODE_SIZE (mode);
1598 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1599 with move instructions for mode MODE. GENFUN is the gen_... function
1600 to make a move insn for that mode. DATA has all the other info. */
1603 move_by_pieces_1 (genfun, mode, data)
1604 rtx (*genfun) PARAMS ((rtx, ...));
1605 enum machine_mode mode;
1606 struct move_by_pieces *data;
1608 unsigned int size = GET_MODE_SIZE (mode);
1609 rtx to1 = NULL_RTX, from1;
1611 while (data->len >= size)
1614 data->offset -= size;
1618 if (data->autinc_to)
1619 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1622 to1 = adjust_address (data->to, mode, data->offset);
1625 if (data->autinc_from)
1626 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1629 from1 = adjust_address (data->from, mode, data->offset);
1631 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1632 emit_insn (gen_add2_insn (data->to_addr,
1633 GEN_INT (-(HOST_WIDE_INT)size)));
1634 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1635 emit_insn (gen_add2_insn (data->from_addr,
1636 GEN_INT (-(HOST_WIDE_INT)size)));
1639 emit_insn ((*genfun) (to1, from1));
1642 #ifdef PUSH_ROUNDING
1643 emit_single_push_insn (mode, from1, NULL);
1649 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1650 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1651 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1652 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1654 if (! data->reverse)
1655 data->offset += size;
1661 /* Emit code to move a block Y to a block X.
1662 This may be done with string-move instructions,
1663 with multiple scalar move instructions, or with a library call.
1665 Both X and Y must be MEM rtx's (perhaps inside VOLATILE)
1667 SIZE is an rtx that says how long they are.
1668 ALIGN is the maximum alignment we can assume they have.
1670 Return the address of the new block, if memcpy is called and returns it,
1673 static GTY(()) tree block_move_fn;
1675 emit_block_move (x, y, size)
1680 #ifdef TARGET_MEM_FUNCTIONS
1681 tree call_expr, arg_list;
1683 unsigned int align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1685 if (GET_MODE (x) != BLKmode)
1688 if (GET_MODE (y) != BLKmode)
1691 x = protect_from_queue (x, 1);
1692 y = protect_from_queue (y, 0);
1693 size = protect_from_queue (size, 0);
1695 if (GET_CODE (x) != MEM)
1697 if (GET_CODE (y) != MEM)
1702 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1703 move_by_pieces (x, y, INTVAL (size), align);
1706 /* Try the most limited insn first, because there's no point
1707 including more than one in the machine description unless
1708 the more limited one has some advantage. */
1710 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1711 enum machine_mode mode;
1713 /* Since this is a move insn, we don't care about volatility. */
1716 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1717 mode = GET_MODE_WIDER_MODE (mode))
1719 enum insn_code code = movstr_optab[(int) mode];
1720 insn_operand_predicate_fn pred;
1722 if (code != CODE_FOR_nothing
1723 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1724 here because if SIZE is less than the mode mask, as it is
1725 returned by the macro, it will definitely be less than the
1726 actual mode mask. */
1727 && ((GET_CODE (size) == CONST_INT
1728 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1729 <= (GET_MODE_MASK (mode) >> 1)))
1730 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1731 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1732 || (*pred) (x, BLKmode))
1733 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1734 || (*pred) (y, BLKmode))
1735 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1736 || (*pred) (opalign, VOIDmode)))
1739 rtx last = get_last_insn ();
1742 op2 = convert_to_mode (mode, size, 1);
1743 pred = insn_data[(int) code].operand[2].predicate;
1744 if (pred != 0 && ! (*pred) (op2, mode))
1745 op2 = copy_to_mode_reg (mode, op2);
1747 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1755 delete_insns_since (last);
1761 /* X, Y, or SIZE may have been passed through protect_from_queue.
1763 It is unsafe to save the value generated by protect_from_queue
1764 and reuse it later. Consider what happens if emit_queue is
1765 called before the return value from protect_from_queue is used.
1767 Expansion of the CALL_EXPR below will call emit_queue before
1768 we are finished emitting RTL for argument setup. So if we are
1769 not careful we could get the wrong value for an argument.
1771 To avoid this problem we go ahead and emit code to copy X, Y &
1772 SIZE into new pseudos. We can then place those new pseudos
1773 into an RTL_EXPR and use them later, even after a call to
1776 Note this is not strictly needed for library calls since they
1777 do not call emit_queue before loading their arguments. However,
1778 we may need to have library calls call emit_queue in the future
1779 since failing to do so could cause problems for targets which
1780 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1781 x = copy_to_mode_reg (Pmode, XEXP (x, 0));
1782 y = copy_to_mode_reg (Pmode, XEXP (y, 0));
1784 #ifdef TARGET_MEM_FUNCTIONS
1785 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
1787 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
1788 TREE_UNSIGNED (integer_type_node));
1789 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
1792 #ifdef TARGET_MEM_FUNCTIONS
1793 /* It is incorrect to use the libcall calling conventions to call
1794 memcpy in this context.
1796 This could be a user call to memcpy and the user may wish to
1797 examine the return value from memcpy.
1799 For targets where libcalls and normal calls have different conventions
1800 for returning pointers, we could end up generating incorrect code.
1802 So instead of using a libcall sequence we build up a suitable
1803 CALL_EXPR and expand the call in the normal fashion. */
1804 if (block_move_fn == NULL_TREE)
1808 /* This was copied from except.c, I don't know if all this is
1809 necessary in this context or not. */
1810 block_move_fn = get_identifier ("memcpy");
1811 fntype = build_pointer_type (void_type_node);
1812 fntype = build_function_type (fntype, NULL_TREE);
1813 block_move_fn = build_decl (FUNCTION_DECL, block_move_fn, fntype);
1814 DECL_EXTERNAL (block_move_fn) = 1;
1815 TREE_PUBLIC (block_move_fn) = 1;
1816 DECL_ARTIFICIAL (block_move_fn) = 1;
1817 TREE_NOTHROW (block_move_fn) = 1;
1818 make_decl_rtl (block_move_fn, NULL);
1819 assemble_external (block_move_fn);
1822 /* We need to make an argument list for the function call.
1824 memcpy has three arguments, the first two are void * addresses and
1825 the last is a size_t byte count for the copy. */
1827 = build_tree_list (NULL_TREE,
1828 make_tree (build_pointer_type (void_type_node), x));
1829 TREE_CHAIN (arg_list)
1830 = build_tree_list (NULL_TREE,
1831 make_tree (build_pointer_type (void_type_node), y));
1832 TREE_CHAIN (TREE_CHAIN (arg_list))
1833 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
1834 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
1836 /* Now we have to build up the CALL_EXPR itself. */
1837 call_expr = build1 (ADDR_EXPR,
1838 build_pointer_type (TREE_TYPE (block_move_fn)),
1840 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (block_move_fn)),
1841 call_expr, arg_list, NULL_TREE);
1842 TREE_SIDE_EFFECTS (call_expr) = 1;
1844 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1846 emit_library_call (bcopy_libfunc, LCT_NORMAL,
1847 VOIDmode, 3, y, Pmode, x, Pmode,
1848 convert_to_mode (TYPE_MODE (integer_type_node), size,
1849 TREE_UNSIGNED (integer_type_node)),
1850 TYPE_MODE (integer_type_node));
1853 /* If we are initializing a readonly value, show the above call
1854 clobbered it. Otherwise, a load from it may erroneously be hoisted
1856 if (RTX_UNCHANGING_P (x))
1857 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
1863 /* Copy all or part of a value X into registers starting at REGNO.
1864 The number of registers to be filled is NREGS. */
1867 move_block_to_reg (regno, x, nregs, mode)
1871 enum machine_mode mode;
1874 #ifdef HAVE_load_multiple
1882 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1883 x = validize_mem (force_const_mem (mode, x));
1885 /* See if the machine can do this with a load multiple insn. */
1886 #ifdef HAVE_load_multiple
1887 if (HAVE_load_multiple)
1889 last = get_last_insn ();
1890 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1898 delete_insns_since (last);
1902 for (i = 0; i < nregs; i++)
1903 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1904 operand_subword_force (x, i, mode));
1907 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1908 The number of registers to be filled is NREGS. SIZE indicates the number
1909 of bytes in the object X. */
1912 move_block_from_reg (regno, x, nregs, size)
1919 #ifdef HAVE_store_multiple
1923 enum machine_mode mode;
1928 /* If SIZE is that of a mode no bigger than a word, just use that
1929 mode's store operation. */
1930 if (size <= UNITS_PER_WORD
1931 && (mode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0)) != BLKmode
1932 && !FUNCTION_ARG_REG_LITTLE_ENDIAN)
1934 emit_move_insn (adjust_address (x, mode, 0), gen_rtx_REG (mode, regno));
1938 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
1939 to the left before storing to memory. Note that the previous test
1940 doesn't handle all cases (e.g. SIZE == 3). */
1941 if (size < UNITS_PER_WORD
1943 && !FUNCTION_ARG_REG_LITTLE_ENDIAN)
1945 rtx tem = operand_subword (x, 0, 1, BLKmode);
1951 shift = expand_shift (LSHIFT_EXPR, word_mode,
1952 gen_rtx_REG (word_mode, regno),
1953 build_int_2 ((UNITS_PER_WORD - size)
1954 * BITS_PER_UNIT, 0), NULL_RTX, 0);
1955 emit_move_insn (tem, shift);
1959 /* See if the machine can do this with a store multiple insn. */
1960 #ifdef HAVE_store_multiple
1961 if (HAVE_store_multiple)
1963 last = get_last_insn ();
1964 pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1972 delete_insns_since (last);
1976 for (i = 0; i < nregs; i++)
1978 rtx tem = operand_subword (x, i, 1, BLKmode);
1983 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1987 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
1988 registers represented by a PARALLEL. SSIZE represents the total size of
1989 block SRC in bytes, or -1 if not known. */
1990 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatant assumption that
1991 the balance will be in what would be the low-order memory addresses, i.e.
1992 left justified for big endian, right justified for little endian. This
1993 happens to be true for the targets currently using this support. If this
1994 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
1998 emit_group_load (dst, orig_src, ssize)
2005 if (GET_CODE (dst) != PARALLEL)
2008 /* Check for a NULL entry, used to indicate that the parameter goes
2009 both on the stack and in registers. */
2010 if (XEXP (XVECEXP (dst, 0, 0), 0))
2015 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (dst, 0));
2017 /* Process the pieces. */
2018 for (i = start; i < XVECLEN (dst, 0); i++)
2020 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
2021 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
2022 unsigned int bytelen = GET_MODE_SIZE (mode);
2025 /* Handle trailing fragments that run over the size of the struct. */
2026 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2028 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2029 bytelen = ssize - bytepos;
2034 /* If we won't be loading directly from memory, protect the real source
2035 from strange tricks we might play; but make sure that the source can
2036 be loaded directly into the destination. */
2038 if (GET_CODE (orig_src) != MEM
2039 && (!CONSTANT_P (orig_src)
2040 || (GET_MODE (orig_src) != mode
2041 && GET_MODE (orig_src) != VOIDmode)))
2043 if (GET_MODE (orig_src) == VOIDmode)
2044 src = gen_reg_rtx (mode);
2046 src = gen_reg_rtx (GET_MODE (orig_src));
2048 emit_move_insn (src, orig_src);
2051 /* Optimize the access just a bit. */
2052 if (GET_CODE (src) == MEM
2053 && MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode)
2054 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2055 && bytelen == GET_MODE_SIZE (mode))
2057 tmps[i] = gen_reg_rtx (mode);
2058 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
2060 else if (GET_CODE (src) == CONCAT)
2063 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 0))))
2064 || (bytepos == (HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (XEXP (src, 0)))
2065 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 1)))))
2067 tmps[i] = XEXP (src, bytepos != 0);
2068 if (! CONSTANT_P (tmps[i])
2069 && (GET_CODE (tmps[i]) != REG || GET_MODE (tmps[i]) != mode))
2070 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
2071 0, 1, NULL_RTX, mode, mode, ssize);
2073 else if (bytepos == 0)
2075 rtx mem = assign_stack_temp (GET_MODE (src),
2076 GET_MODE_SIZE (GET_MODE (src)), 0);
2077 emit_move_insn (mem, src);
2078 tmps[i] = adjust_address (mem, mode, 0);
2083 else if (CONSTANT_P (src)
2084 || (GET_CODE (src) == REG && GET_MODE (src) == mode))
2087 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
2088 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
2091 if (BYTES_BIG_ENDIAN && shift)
2092 expand_binop (mode, ashl_optab, tmps[i], GEN_INT (shift),
2093 tmps[i], 0, OPTAB_WIDEN);
2098 /* Copy the extracted pieces into the proper (probable) hard regs. */
2099 for (i = start; i < XVECLEN (dst, 0); i++)
2100 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0), tmps[i]);
2103 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
2104 registers represented by a PARALLEL. SSIZE represents the total size of
2105 block DST, or -1 if not known. */
2108 emit_group_store (orig_dst, src, ssize)
2115 if (GET_CODE (src) != PARALLEL)
2118 /* Check for a NULL entry, used to indicate that the parameter goes
2119 both on the stack and in registers. */
2120 if (XEXP (XVECEXP (src, 0, 0), 0))
2125 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (src, 0));
2127 /* Copy the (probable) hard regs into pseudos. */
2128 for (i = start; i < XVECLEN (src, 0); i++)
2130 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
2131 tmps[i] = gen_reg_rtx (GET_MODE (reg));
2132 emit_move_insn (tmps[i], reg);
2136 /* If we won't be storing directly into memory, protect the real destination
2137 from strange tricks we might play. */
2139 if (GET_CODE (dst) == PARALLEL)
2143 /* We can get a PARALLEL dst if there is a conditional expression in
2144 a return statement. In that case, the dst and src are the same,
2145 so no action is necessary. */
2146 if (rtx_equal_p (dst, src))
2149 /* It is unclear if we can ever reach here, but we may as well handle
2150 it. Allocate a temporary, and split this into a store/load to/from
2153 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
2154 emit_group_store (temp, src, ssize);
2155 emit_group_load (dst, temp, ssize);
2158 else if (GET_CODE (dst) != MEM && GET_CODE (dst) != CONCAT)
2160 dst = gen_reg_rtx (GET_MODE (orig_dst));
2161 /* Make life a bit easier for combine. */
2162 emit_move_insn (dst, const0_rtx);
2165 /* Process the pieces. */
2166 for (i = start; i < XVECLEN (src, 0); i++)
2168 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2169 enum machine_mode mode = GET_MODE (tmps[i]);
2170 unsigned int bytelen = GET_MODE_SIZE (mode);
2173 /* Handle trailing fragments that run over the size of the struct. */
2174 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2176 if (BYTES_BIG_ENDIAN)
2178 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2179 expand_binop (mode, ashr_optab, tmps[i], GEN_INT (shift),
2180 tmps[i], 0, OPTAB_WIDEN);
2182 bytelen = ssize - bytepos;
2185 if (GET_CODE (dst) == CONCAT)
2187 if (bytepos + bytelen <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2188 dest = XEXP (dst, 0);
2189 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2191 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2192 dest = XEXP (dst, 1);
2198 /* Optimize the access just a bit. */
2199 if (GET_CODE (dest) == MEM
2200 && MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode)
2201 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2202 && bytelen == GET_MODE_SIZE (mode))
2203 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2205 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2206 mode, tmps[i], ssize);
2211 /* Copy from the pseudo into the (probable) hard reg. */
2212 if (GET_CODE (dst) == REG)
2213 emit_move_insn (orig_dst, dst);
2216 /* Generate code to copy a BLKmode object of TYPE out of a
2217 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2218 is null, a stack temporary is created. TGTBLK is returned.
2220 The primary purpose of this routine is to handle functions
2221 that return BLKmode structures in registers. Some machines
2222 (the PA for example) want to return all small structures
2223 in registers regardless of the structure's alignment. */
2226 copy_blkmode_from_reg (tgtblk, srcreg, type)
2231 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2232 rtx src = NULL, dst = NULL;
2233 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2234 unsigned HOST_WIDE_INT bitpos, xbitpos, big_endian_correction = 0;
2238 tgtblk = assign_temp (build_qualified_type (type,
2240 | TYPE_QUAL_CONST)),
2242 preserve_temp_slots (tgtblk);
2245 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2246 into a new pseudo which is a full word.
2248 If FUNCTION_ARG_REG_LITTLE_ENDIAN is set and convert_to_mode does a copy,
2249 the wrong part of the register gets copied so we fake a type conversion
2251 if (GET_MODE (srcreg) != BLKmode
2252 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2254 if (FUNCTION_ARG_REG_LITTLE_ENDIAN)
2255 srcreg = simplify_gen_subreg (word_mode, srcreg, GET_MODE (srcreg), 0);
2257 srcreg = convert_to_mode (word_mode, srcreg, TREE_UNSIGNED (type));
2260 /* Structures whose size is not a multiple of a word are aligned
2261 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2262 machine, this means we must skip the empty high order bytes when
2263 calculating the bit offset. */
2264 if (BYTES_BIG_ENDIAN
2265 && !FUNCTION_ARG_REG_LITTLE_ENDIAN
2266 && bytes % UNITS_PER_WORD)
2267 big_endian_correction
2268 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2270 /* Copy the structure BITSIZE bites at a time.
2272 We could probably emit more efficient code for machines which do not use
2273 strict alignment, but it doesn't seem worth the effort at the current
2275 for (bitpos = 0, xbitpos = big_endian_correction;
2276 bitpos < bytes * BITS_PER_UNIT;
2277 bitpos += bitsize, xbitpos += bitsize)
2279 /* We need a new source operand each time xbitpos is on a
2280 word boundary and when xbitpos == big_endian_correction
2281 (the first time through). */
2282 if (xbitpos % BITS_PER_WORD == 0
2283 || xbitpos == big_endian_correction)
2284 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2287 /* We need a new destination operand each time bitpos is on
2289 if (bitpos % BITS_PER_WORD == 0)
2290 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2292 /* Use xbitpos for the source extraction (right justified) and
2293 xbitpos for the destination store (left justified). */
2294 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2295 extract_bit_field (src, bitsize,
2296 xbitpos % BITS_PER_WORD, 1,
2297 NULL_RTX, word_mode, word_mode,
2305 /* Add a USE expression for REG to the (possibly empty) list pointed
2306 to by CALL_FUSAGE. REG must denote a hard register. */
2309 use_reg (call_fusage, reg)
2310 rtx *call_fusage, reg;
2312 if (GET_CODE (reg) != REG
2313 || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
2317 = gen_rtx_EXPR_LIST (VOIDmode,
2318 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2321 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2322 starting at REGNO. All of these registers must be hard registers. */
2325 use_regs (call_fusage, regno, nregs)
2332 if (regno + nregs > FIRST_PSEUDO_REGISTER)
2335 for (i = 0; i < nregs; i++)
2336 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2339 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2340 PARALLEL REGS. This is for calls that pass values in multiple
2341 non-contiguous locations. The Irix 6 ABI has examples of this. */
2344 use_group_regs (call_fusage, regs)
2350 for (i = 0; i < XVECLEN (regs, 0); i++)
2352 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2354 /* A NULL entry means the parameter goes both on the stack and in
2355 registers. This can also be a MEM for targets that pass values
2356 partially on the stack and partially in registers. */
2357 if (reg != 0 && GET_CODE (reg) == REG)
2358 use_reg (call_fusage, reg);
2363 /* Determine whether the LEN bytes generated by CONSTFUN can be
2364 stored to memory using several move instructions. CONSTFUNDATA is
2365 a pointer which will be passed as argument in every CONSTFUN call.
2366 ALIGN is maximum alignment we can assume. Return nonzero if a
2367 call to store_by_pieces should succeed. */
2370 can_store_by_pieces (len, constfun, constfundata, align)
2371 unsigned HOST_WIDE_INT len;
2372 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2376 unsigned HOST_WIDE_INT max_size, l;
2377 HOST_WIDE_INT offset = 0;
2378 enum machine_mode mode, tmode;
2379 enum insn_code icode;
2383 if (! MOVE_BY_PIECES_P (len, align))
2386 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2387 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2388 align = MOVE_MAX * BITS_PER_UNIT;
2390 /* We would first store what we can in the largest integer mode, then go to
2391 successively smaller modes. */
2394 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2399 max_size = STORE_MAX_PIECES + 1;
2400 while (max_size > 1)
2402 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2403 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2404 if (GET_MODE_SIZE (tmode) < max_size)
2407 if (mode == VOIDmode)
2410 icode = mov_optab->handlers[(int) mode].insn_code;
2411 if (icode != CODE_FOR_nothing
2412 && align >= GET_MODE_ALIGNMENT (mode))
2414 unsigned int size = GET_MODE_SIZE (mode);
2421 cst = (*constfun) (constfundata, offset, mode);
2422 if (!LEGITIMATE_CONSTANT_P (cst))
2432 max_size = GET_MODE_SIZE (mode);
2435 /* The code above should have handled everything. */
2443 /* Generate several move instructions to store LEN bytes generated by
2444 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2445 pointer which will be passed as argument in every CONSTFUN call.
2446 ALIGN is maximum alignment we can assume. */
2449 store_by_pieces (to, len, constfun, constfundata, align)
2451 unsigned HOST_WIDE_INT len;
2452 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2456 struct store_by_pieces data;
2458 if (! MOVE_BY_PIECES_P (len, align))
2460 to = protect_from_queue (to, 1);
2461 data.constfun = constfun;
2462 data.constfundata = constfundata;
2465 store_by_pieces_1 (&data, align);
2468 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2469 rtx with BLKmode). The caller must pass TO through protect_from_queue
2470 before calling. ALIGN is maximum alignment we can assume. */
2473 clear_by_pieces (to, len, align)
2475 unsigned HOST_WIDE_INT len;
2478 struct store_by_pieces data;
2480 data.constfun = clear_by_pieces_1;
2481 data.constfundata = NULL;
2484 store_by_pieces_1 (&data, align);
2487 /* Callback routine for clear_by_pieces.
2488 Return const0_rtx unconditionally. */
2491 clear_by_pieces_1 (data, offset, mode)
2492 PTR data ATTRIBUTE_UNUSED;
2493 HOST_WIDE_INT offset ATTRIBUTE_UNUSED;
2494 enum machine_mode mode ATTRIBUTE_UNUSED;
2499 /* Subroutine of clear_by_pieces and store_by_pieces.
2500 Generate several move instructions to store LEN bytes of block TO. (A MEM
2501 rtx with BLKmode). The caller must pass TO through protect_from_queue
2502 before calling. ALIGN is maximum alignment we can assume. */
2505 store_by_pieces_1 (data, align)
2506 struct store_by_pieces *data;
2509 rtx to_addr = XEXP (data->to, 0);
2510 unsigned HOST_WIDE_INT max_size = STORE_MAX_PIECES + 1;
2511 enum machine_mode mode = VOIDmode, tmode;
2512 enum insn_code icode;
2515 data->to_addr = to_addr;
2517 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2518 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2520 data->explicit_inc_to = 0;
2522 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2524 data->offset = data->len;
2526 /* If storing requires more than two move insns,
2527 copy addresses to registers (to make displacements shorter)
2528 and use post-increment if available. */
2529 if (!data->autinc_to
2530 && move_by_pieces_ninsns (data->len, align) > 2)
2532 /* Determine the main mode we'll be using. */
2533 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2534 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2535 if (GET_MODE_SIZE (tmode) < max_size)
2538 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2540 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2541 data->autinc_to = 1;
2542 data->explicit_inc_to = -1;
2545 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2546 && ! data->autinc_to)
2548 data->to_addr = copy_addr_to_reg (to_addr);
2549 data->autinc_to = 1;
2550 data->explicit_inc_to = 1;
2553 if ( !data->autinc_to && CONSTANT_P (to_addr))
2554 data->to_addr = copy_addr_to_reg (to_addr);
2557 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2558 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2559 align = MOVE_MAX * BITS_PER_UNIT;
2561 /* First store what we can in the largest integer mode, then go to
2562 successively smaller modes. */
2564 while (max_size > 1)
2566 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2567 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2568 if (GET_MODE_SIZE (tmode) < max_size)
2571 if (mode == VOIDmode)
2574 icode = mov_optab->handlers[(int) mode].insn_code;
2575 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2576 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2578 max_size = GET_MODE_SIZE (mode);
2581 /* The code above should have handled everything. */
2586 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2587 with move instructions for mode MODE. GENFUN is the gen_... function
2588 to make a move insn for that mode. DATA has all the other info. */
2591 store_by_pieces_2 (genfun, mode, data)
2592 rtx (*genfun) PARAMS ((rtx, ...));
2593 enum machine_mode mode;
2594 struct store_by_pieces *data;
2596 unsigned int size = GET_MODE_SIZE (mode);
2599 while (data->len >= size)
2602 data->offset -= size;
2604 if (data->autinc_to)
2605 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2608 to1 = adjust_address (data->to, mode, data->offset);
2610 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2611 emit_insn (gen_add2_insn (data->to_addr,
2612 GEN_INT (-(HOST_WIDE_INT) size)));
2614 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2615 emit_insn ((*genfun) (to1, cst));
2617 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2618 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2620 if (! data->reverse)
2621 data->offset += size;
2627 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2628 its length in bytes. */
2630 static GTY(()) tree block_clear_fn;
2632 clear_storage (object, size)
2636 #ifdef TARGET_MEM_FUNCTIONS
2637 tree call_expr, arg_list;
2640 unsigned int align = (GET_CODE (object) == MEM ? MEM_ALIGN (object)
2641 : GET_MODE_ALIGNMENT (GET_MODE (object)));
2643 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2644 just move a zero. Otherwise, do this a piece at a time. */
2645 if (GET_MODE (object) != BLKmode
2646 && GET_CODE (size) == CONST_INT
2647 && GET_MODE_SIZE (GET_MODE (object)) == (unsigned int) INTVAL (size))
2648 emit_move_insn (object, CONST0_RTX (GET_MODE (object)));
2651 object = protect_from_queue (object, 1);
2652 size = protect_from_queue (size, 0);
2654 if (GET_CODE (size) == CONST_INT
2655 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2656 clear_by_pieces (object, INTVAL (size), align);
2659 /* Try the most limited insn first, because there's no point
2660 including more than one in the machine description unless
2661 the more limited one has some advantage. */
2663 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2664 enum machine_mode mode;
2666 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2667 mode = GET_MODE_WIDER_MODE (mode))
2669 enum insn_code code = clrstr_optab[(int) mode];
2670 insn_operand_predicate_fn pred;
2672 if (code != CODE_FOR_nothing
2673 /* We don't need MODE to be narrower than
2674 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2675 the mode mask, as it is returned by the macro, it will
2676 definitely be less than the actual mode mask. */
2677 && ((GET_CODE (size) == CONST_INT
2678 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2679 <= (GET_MODE_MASK (mode) >> 1)))
2680 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2681 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2682 || (*pred) (object, BLKmode))
2683 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2684 || (*pred) (opalign, VOIDmode)))
2687 rtx last = get_last_insn ();
2690 op1 = convert_to_mode (mode, size, 1);
2691 pred = insn_data[(int) code].operand[1].predicate;
2692 if (pred != 0 && ! (*pred) (op1, mode))
2693 op1 = copy_to_mode_reg (mode, op1);
2695 pat = GEN_FCN ((int) code) (object, op1, opalign);
2702 delete_insns_since (last);
2706 /* OBJECT or SIZE may have been passed through protect_from_queue.
2708 It is unsafe to save the value generated by protect_from_queue
2709 and reuse it later. Consider what happens if emit_queue is
2710 called before the return value from protect_from_queue is used.
2712 Expansion of the CALL_EXPR below will call emit_queue before
2713 we are finished emitting RTL for argument setup. So if we are
2714 not careful we could get the wrong value for an argument.
2716 To avoid this problem we go ahead and emit code to copy OBJECT
2717 and SIZE into new pseudos. We can then place those new pseudos
2718 into an RTL_EXPR and use them later, even after a call to
2721 Note this is not strictly needed for library calls since they
2722 do not call emit_queue before loading their arguments. However,
2723 we may need to have library calls call emit_queue in the future
2724 since failing to do so could cause problems for targets which
2725 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
2726 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2728 #ifdef TARGET_MEM_FUNCTIONS
2729 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
2731 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
2732 TREE_UNSIGNED (integer_type_node));
2733 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
2736 #ifdef TARGET_MEM_FUNCTIONS
2737 /* It is incorrect to use the libcall calling conventions to call
2738 memset in this context.
2740 This could be a user call to memset and the user may wish to
2741 examine the return value from memset.
2743 For targets where libcalls and normal calls have different
2744 conventions for returning pointers, we could end up generating
2747 So instead of using a libcall sequence we build up a suitable
2748 CALL_EXPR and expand the call in the normal fashion. */
2749 if (block_clear_fn == NULL_TREE)
2753 /* This was copied from except.c, I don't know if all this is
2754 necessary in this context or not. */
2755 block_clear_fn = get_identifier ("memset");
2756 fntype = build_pointer_type (void_type_node);
2757 fntype = build_function_type (fntype, NULL_TREE);
2758 block_clear_fn = build_decl (FUNCTION_DECL, block_clear_fn,
2760 DECL_EXTERNAL (block_clear_fn) = 1;
2761 TREE_PUBLIC (block_clear_fn) = 1;
2762 DECL_ARTIFICIAL (block_clear_fn) = 1;
2763 TREE_NOTHROW (block_clear_fn) = 1;
2764 make_decl_rtl (block_clear_fn, NULL);
2765 assemble_external (block_clear_fn);
2768 /* We need to make an argument list for the function call.
2770 memset has three arguments, the first is a void * addresses, the
2771 second an integer with the initialization value, the last is a
2772 size_t byte count for the copy. */
2774 = build_tree_list (NULL_TREE,
2775 make_tree (build_pointer_type (void_type_node),
2777 TREE_CHAIN (arg_list)
2778 = build_tree_list (NULL_TREE,
2779 make_tree (integer_type_node, const0_rtx));
2780 TREE_CHAIN (TREE_CHAIN (arg_list))
2781 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
2782 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
2784 /* Now we have to build up the CALL_EXPR itself. */
2785 call_expr = build1 (ADDR_EXPR,
2786 build_pointer_type (TREE_TYPE (block_clear_fn)),
2788 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (block_clear_fn)),
2789 call_expr, arg_list, NULL_TREE);
2790 TREE_SIDE_EFFECTS (call_expr) = 1;
2792 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2794 emit_library_call (bzero_libfunc, LCT_NORMAL,
2795 VOIDmode, 2, object, Pmode, size,
2796 TYPE_MODE (integer_type_node));
2799 /* If we are initializing a readonly value, show the above call
2800 clobbered it. Otherwise, a load from it may erroneously be
2801 hoisted from a loop. */
2802 if (RTX_UNCHANGING_P (object))
2803 emit_insn (gen_rtx_CLOBBER (VOIDmode, object));
2810 /* Generate code to copy Y into X.
2811 Both Y and X must have the same mode, except that
2812 Y can be a constant with VOIDmode.
2813 This mode cannot be BLKmode; use emit_block_move for that.
2815 Return the last instruction emitted. */
2818 emit_move_insn (x, y)
2821 enum machine_mode mode = GET_MODE (x);
2822 rtx y_cst = NULL_RTX;
2825 x = protect_from_queue (x, 1);
2826 y = protect_from_queue (y, 0);
2828 if (mode == BLKmode || (GET_MODE (y) != mode && GET_MODE (y) != VOIDmode))
2831 /* Never force constant_p_rtx to memory. */
2832 if (GET_CODE (y) == CONSTANT_P_RTX)
2834 else if (CONSTANT_P (y))
2837 && FLOAT_MODE_P (GET_MODE (x))
2838 && (last_insn = compress_float_constant (x, y)))
2841 if (!LEGITIMATE_CONSTANT_P (y))
2844 y = force_const_mem (mode, y);
2848 /* If X or Y are memory references, verify that their addresses are valid
2850 if (GET_CODE (x) == MEM
2851 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
2852 && ! push_operand (x, GET_MODE (x)))
2854 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
2855 x = validize_mem (x);
2857 if (GET_CODE (y) == MEM
2858 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
2860 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
2861 y = validize_mem (y);
2863 if (mode == BLKmode)
2866 last_insn = emit_move_insn_1 (x, y);
2868 if (y_cst && GET_CODE (x) == REG)
2869 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
2874 /* Low level part of emit_move_insn.
2875 Called just like emit_move_insn, but assumes X and Y
2876 are basically valid. */
2879 emit_move_insn_1 (x, y)
2882 enum machine_mode mode = GET_MODE (x);
2883 enum machine_mode submode;
2884 enum mode_class class = GET_MODE_CLASS (mode);
2886 if ((unsigned int) mode >= (unsigned int) MAX_MACHINE_MODE)
2889 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2891 emit_insn (GEN_FCN (mov_optab->handlers[(int) mode].insn_code) (x, y));
2893 /* Expand complex moves by moving real part and imag part, if possible. */
2894 else if ((class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)
2895 && BLKmode != (submode = mode_for_size ((GET_MODE_UNIT_SIZE (mode)
2897 (class == MODE_COMPLEX_INT
2898 ? MODE_INT : MODE_FLOAT),
2900 && (mov_optab->handlers[(int) submode].insn_code
2901 != CODE_FOR_nothing))
2903 /* Don't split destination if it is a stack push. */
2904 int stack = push_operand (x, GET_MODE (x));
2906 #ifdef PUSH_ROUNDING
2907 /* In case we output to the stack, but the size is smaller machine can
2908 push exactly, we need to use move instructions. */
2910 && (PUSH_ROUNDING (GET_MODE_SIZE (submode))
2911 != GET_MODE_SIZE (submode)))
2914 HOST_WIDE_INT offset1, offset2;
2916 /* Do not use anti_adjust_stack, since we don't want to update
2917 stack_pointer_delta. */
2918 temp = expand_binop (Pmode,
2919 #ifdef STACK_GROWS_DOWNWARD
2927 (GET_MODE_SIZE (GET_MODE (x)))),
2928 stack_pointer_rtx, 0, OPTAB_LIB_WIDEN);
2930 if (temp != stack_pointer_rtx)
2931 emit_move_insn (stack_pointer_rtx, temp);
2933 #ifdef STACK_GROWS_DOWNWARD
2935 offset2 = GET_MODE_SIZE (submode);
2937 offset1 = -PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)));
2938 offset2 = (-PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))
2939 + GET_MODE_SIZE (submode));
2942 emit_move_insn (change_address (x, submode,
2943 gen_rtx_PLUS (Pmode,
2945 GEN_INT (offset1))),
2946 gen_realpart (submode, y));
2947 emit_move_insn (change_address (x, submode,
2948 gen_rtx_PLUS (Pmode,
2950 GEN_INT (offset2))),
2951 gen_imagpart (submode, y));
2955 /* If this is a stack, push the highpart first, so it
2956 will be in the argument order.
2958 In that case, change_address is used only to convert
2959 the mode, not to change the address. */
2962 /* Note that the real part always precedes the imag part in memory
2963 regardless of machine's endianness. */
2964 #ifdef STACK_GROWS_DOWNWARD
2965 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2966 (gen_rtx_MEM (submode, XEXP (x, 0)),
2967 gen_imagpart (submode, y)));
2968 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2969 (gen_rtx_MEM (submode, XEXP (x, 0)),
2970 gen_realpart (submode, y)));
2972 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2973 (gen_rtx_MEM (submode, XEXP (x, 0)),
2974 gen_realpart (submode, y)));
2975 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2976 (gen_rtx_MEM (submode, XEXP (x, 0)),
2977 gen_imagpart (submode, y)));
2982 rtx realpart_x, realpart_y;
2983 rtx imagpart_x, imagpart_y;
2985 /* If this is a complex value with each part being smaller than a
2986 word, the usual calling sequence will likely pack the pieces into
2987 a single register. Unfortunately, SUBREG of hard registers only
2988 deals in terms of words, so we have a problem converting input
2989 arguments to the CONCAT of two registers that is used elsewhere
2990 for complex values. If this is before reload, we can copy it into
2991 memory and reload. FIXME, we should see about using extract and
2992 insert on integer registers, but complex short and complex char
2993 variables should be rarely used. */
2994 if (GET_MODE_BITSIZE (mode) < 2 * BITS_PER_WORD
2995 && (reload_in_progress | reload_completed) == 0)
2998 = (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER);
3000 = (REG_P (y) && REGNO (y) < FIRST_PSEUDO_REGISTER);
3002 if (packed_dest_p || packed_src_p)
3004 enum mode_class reg_class = ((class == MODE_COMPLEX_FLOAT)
3005 ? MODE_FLOAT : MODE_INT);
3007 enum machine_mode reg_mode
3008 = mode_for_size (GET_MODE_BITSIZE (mode), reg_class, 1);
3010 if (reg_mode != BLKmode)
3012 rtx mem = assign_stack_temp (reg_mode,
3013 GET_MODE_SIZE (mode), 0);
3014 rtx cmem = adjust_address (mem, mode, 0);
3017 = N_("function using short complex types cannot be inline");
3021 rtx sreg = gen_rtx_SUBREG (reg_mode, x, 0);
3023 emit_move_insn_1 (cmem, y);
3024 return emit_move_insn_1 (sreg, mem);
3028 rtx sreg = gen_rtx_SUBREG (reg_mode, y, 0);
3030 emit_move_insn_1 (mem, sreg);
3031 return emit_move_insn_1 (x, cmem);
3037 realpart_x = gen_realpart (submode, x);
3038 realpart_y = gen_realpart (submode, y);
3039 imagpart_x = gen_imagpart (submode, x);
3040 imagpart_y = gen_imagpart (submode, y);
3042 /* Show the output dies here. This is necessary for SUBREGs
3043 of pseudos since we cannot track their lifetimes correctly;
3044 hard regs shouldn't appear here except as return values.
3045 We never want to emit such a clobber after reload. */
3047 && ! (reload_in_progress || reload_completed)
3048 && (GET_CODE (realpart_x) == SUBREG
3049 || GET_CODE (imagpart_x) == SUBREG))
3050 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3052 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3053 (realpart_x, realpart_y));
3054 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
3055 (imagpart_x, imagpart_y));
3058 return get_last_insn ();
3061 /* This will handle any multi-word or full-word mode that lacks a move_insn
3062 pattern. However, you will get better code if you define such patterns,
3063 even if they must turn into multiple assembler instructions. */
3064 else if (GET_MODE_SIZE (mode) >= UNITS_PER_WORD)
3071 #ifdef PUSH_ROUNDING
3073 /* If X is a push on the stack, do the push now and replace
3074 X with a reference to the stack pointer. */
3075 if (push_operand (x, GET_MODE (x)))
3080 /* Do not use anti_adjust_stack, since we don't want to update
3081 stack_pointer_delta. */
3082 temp = expand_binop (Pmode,
3083 #ifdef STACK_GROWS_DOWNWARD
3091 (GET_MODE_SIZE (GET_MODE (x)))),
3092 stack_pointer_rtx, 0, OPTAB_LIB_WIDEN);
3094 if (temp != stack_pointer_rtx)
3095 emit_move_insn (stack_pointer_rtx, temp);
3097 code = GET_CODE (XEXP (x, 0));
3099 /* Just hope that small offsets off SP are OK. */
3100 if (code == POST_INC)
3101 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3102 GEN_INT (-((HOST_WIDE_INT)
3103 GET_MODE_SIZE (GET_MODE (x)))));
3104 else if (code == POST_DEC)
3105 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3106 GEN_INT (GET_MODE_SIZE (GET_MODE (x))));
3108 temp = stack_pointer_rtx;
3110 x = change_address (x, VOIDmode, temp);
3114 /* If we are in reload, see if either operand is a MEM whose address
3115 is scheduled for replacement. */
3116 if (reload_in_progress && GET_CODE (x) == MEM
3117 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3118 x = replace_equiv_address_nv (x, inner);
3119 if (reload_in_progress && GET_CODE (y) == MEM
3120 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3121 y = replace_equiv_address_nv (y, inner);
3127 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3130 rtx xpart = operand_subword (x, i, 1, mode);
3131 rtx ypart = operand_subword (y, i, 1, mode);
3133 /* If we can't get a part of Y, put Y into memory if it is a
3134 constant. Otherwise, force it into a register. If we still
3135 can't get a part of Y, abort. */
3136 if (ypart == 0 && CONSTANT_P (y))
3138 y = force_const_mem (mode, y);
3139 ypart = operand_subword (y, i, 1, mode);
3141 else if (ypart == 0)
3142 ypart = operand_subword_force (y, i, mode);
3144 if (xpart == 0 || ypart == 0)
3147 need_clobber |= (GET_CODE (xpart) == SUBREG);
3149 last_insn = emit_move_insn (xpart, ypart);
3155 /* Show the output dies here. This is necessary for SUBREGs
3156 of pseudos since we cannot track their lifetimes correctly;
3157 hard regs shouldn't appear here except as return values.
3158 We never want to emit such a clobber after reload. */
3160 && ! (reload_in_progress || reload_completed)
3161 && need_clobber != 0)
3162 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3172 /* If Y is representable exactly in a narrower mode, and the target can
3173 perform the extension directly from constant or memory, then emit the
3174 move as an extension. */
3177 compress_float_constant (x, y)
3180 enum machine_mode dstmode = GET_MODE (x);
3181 enum machine_mode orig_srcmode = GET_MODE (y);
3182 enum machine_mode srcmode;
3185 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3187 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3188 srcmode != orig_srcmode;
3189 srcmode = GET_MODE_WIDER_MODE (srcmode))
3192 rtx trunc_y, last_insn;
3194 /* Skip if the target can't extend this way. */
3195 ic = can_extend_p (dstmode, srcmode, 0);
3196 if (ic == CODE_FOR_nothing)
3199 /* Skip if the narrowed value isn't exact. */
3200 if (! exact_real_truncate (srcmode, &r))
3203 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3205 if (LEGITIMATE_CONSTANT_P (trunc_y))
3207 /* Skip if the target needs extra instructions to perform
3209 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3212 else if (float_extend_from_mem[dstmode][srcmode])
3213 trunc_y = validize_mem (force_const_mem (srcmode, trunc_y));
3217 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3218 last_insn = get_last_insn ();
3220 if (GET_CODE (x) == REG)
3221 REG_NOTES (last_insn)
3222 = gen_rtx_EXPR_LIST (REG_EQUAL, y, REG_NOTES (last_insn));
3230 /* Pushing data onto the stack. */
3232 /* Push a block of length SIZE (perhaps variable)
3233 and return an rtx to address the beginning of the block.
3234 Note that it is not possible for the value returned to be a QUEUED.
3235 The value may be virtual_outgoing_args_rtx.
3237 EXTRA is the number of bytes of padding to push in addition to SIZE.
3238 BELOW nonzero means this padding comes at low addresses;
3239 otherwise, the padding comes at high addresses. */
3242 push_block (size, extra, below)
3248 size = convert_modes (Pmode, ptr_mode, size, 1);
3249 if (CONSTANT_P (size))
3250 anti_adjust_stack (plus_constant (size, extra));
3251 else if (GET_CODE (size) == REG && extra == 0)
3252 anti_adjust_stack (size);
3255 temp = copy_to_mode_reg (Pmode, size);
3257 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3258 temp, 0, OPTAB_LIB_WIDEN);
3259 anti_adjust_stack (temp);
3262 #ifndef STACK_GROWS_DOWNWARD
3268 temp = virtual_outgoing_args_rtx;
3269 if (extra != 0 && below)
3270 temp = plus_constant (temp, extra);
3274 if (GET_CODE (size) == CONST_INT)
3275 temp = plus_constant (virtual_outgoing_args_rtx,
3276 -INTVAL (size) - (below ? 0 : extra));
3277 else if (extra != 0 && !below)
3278 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3279 negate_rtx (Pmode, plus_constant (size, extra)));
3281 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3282 negate_rtx (Pmode, size));
3285 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3288 #ifdef PUSH_ROUNDING
3290 /* Emit single push insn. */
3293 emit_single_push_insn (mode, x, type)
3295 enum machine_mode mode;
3299 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3301 enum insn_code icode;
3302 insn_operand_predicate_fn pred;
3304 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3305 /* If there is push pattern, use it. Otherwise try old way of throwing
3306 MEM representing push operation to move expander. */
3307 icode = push_optab->handlers[(int) mode].insn_code;
3308 if (icode != CODE_FOR_nothing)
3310 if (((pred = insn_data[(int) icode].operand[0].predicate)
3311 && !((*pred) (x, mode))))
3312 x = force_reg (mode, x);
3313 emit_insn (GEN_FCN (icode) (x));
3316 if (GET_MODE_SIZE (mode) == rounded_size)
3317 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3320 #ifdef STACK_GROWS_DOWNWARD
3321 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3322 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3324 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3325 GEN_INT (rounded_size));
3327 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3330 dest = gen_rtx_MEM (mode, dest_addr);
3334 set_mem_attributes (dest, type, 1);
3336 if (flag_optimize_sibling_calls)
3337 /* Function incoming arguments may overlap with sibling call
3338 outgoing arguments and we cannot allow reordering of reads
3339 from function arguments with stores to outgoing arguments
3340 of sibling calls. */
3341 set_mem_alias_set (dest, 0);
3343 emit_move_insn (dest, x);
3347 /* Generate code to push X onto the stack, assuming it has mode MODE and
3349 MODE is redundant except when X is a CONST_INT (since they don't
3351 SIZE is an rtx for the size of data to be copied (in bytes),
3352 needed only if X is BLKmode.
3354 ALIGN (in bits) is maximum alignment we can assume.
3356 If PARTIAL and REG are both nonzero, then copy that many of the first
3357 words of X into registers starting with REG, and push the rest of X.
3358 The amount of space pushed is decreased by PARTIAL words,
3359 rounded *down* to a multiple of PARM_BOUNDARY.
3360 REG must be a hard register in this case.
3361 If REG is zero but PARTIAL is not, take any all others actions for an
3362 argument partially in registers, but do not actually load any
3365 EXTRA is the amount in bytes of extra space to leave next to this arg.
3366 This is ignored if an argument block has already been allocated.
3368 On a machine that lacks real push insns, ARGS_ADDR is the address of
3369 the bottom of the argument block for this call. We use indexing off there
3370 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3371 argument block has not been preallocated.
3373 ARGS_SO_FAR is the size of args previously pushed for this call.
3375 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3376 for arguments passed in registers. If nonzero, it will be the number
3377 of bytes required. */
3380 emit_push_insn (x, mode, type, size, align, partial, reg, extra,
3381 args_addr, args_so_far, reg_parm_stack_space,
3384 enum machine_mode mode;
3393 int reg_parm_stack_space;
3397 enum direction stack_direction
3398 #ifdef STACK_GROWS_DOWNWARD
3404 /* Decide where to pad the argument: `downward' for below,
3405 `upward' for above, or `none' for don't pad it.
3406 Default is below for small data on big-endian machines; else above. */
3407 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3409 /* Invert direction if stack is post-decrement.
3411 if (STACK_PUSH_CODE == POST_DEC)
3412 if (where_pad != none)
3413 where_pad = (where_pad == downward ? upward : downward);
3415 xinner = x = protect_from_queue (x, 0);
3417 if (mode == BLKmode)
3419 /* Copy a block into the stack, entirely or partially. */
3422 int used = partial * UNITS_PER_WORD;
3423 int offset = used % (PARM_BOUNDARY / BITS_PER_UNIT);
3431 /* USED is now the # of bytes we need not copy to the stack
3432 because registers will take care of them. */
3435 xinner = adjust_address (xinner, BLKmode, used);
3437 /* If the partial register-part of the arg counts in its stack size,
3438 skip the part of stack space corresponding to the registers.
3439 Otherwise, start copying to the beginning of the stack space,
3440 by setting SKIP to 0. */
3441 skip = (reg_parm_stack_space == 0) ? 0 : used;
3443 #ifdef PUSH_ROUNDING
3444 /* Do it with several push insns if that doesn't take lots of insns
3445 and if there is no difficulty with push insns that skip bytes
3446 on the stack for alignment purposes. */
3449 && GET_CODE (size) == CONST_INT
3451 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3452 /* Here we avoid the case of a structure whose weak alignment
3453 forces many pushes of a small amount of data,
3454 and such small pushes do rounding that causes trouble. */
3455 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3456 || align >= BIGGEST_ALIGNMENT
3457 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3458 == (align / BITS_PER_UNIT)))
3459 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3461 /* Push padding now if padding above and stack grows down,
3462 or if padding below and stack grows up.
3463 But if space already allocated, this has already been done. */
3464 if (extra && args_addr == 0
3465 && where_pad != none && where_pad != stack_direction)
3466 anti_adjust_stack (GEN_INT (extra));
3468 move_by_pieces (NULL, xinner, INTVAL (size) - used, align);
3471 #endif /* PUSH_ROUNDING */
3475 /* Otherwise make space on the stack and copy the data
3476 to the address of that space. */
3478 /* Deduct words put into registers from the size we must copy. */
3481 if (GET_CODE (size) == CONST_INT)
3482 size = GEN_INT (INTVAL (size) - used);
3484 size = expand_binop (GET_MODE (size), sub_optab, size,
3485 GEN_INT (used), NULL_RTX, 0,
3489 /* Get the address of the stack space.
3490 In this case, we do not deal with EXTRA separately.
3491 A single stack adjust will do. */
3494 temp = push_block (size, extra, where_pad == downward);
3497 else if (GET_CODE (args_so_far) == CONST_INT)
3498 temp = memory_address (BLKmode,
3499 plus_constant (args_addr,
3500 skip + INTVAL (args_so_far)));
3502 temp = memory_address (BLKmode,
3503 plus_constant (gen_rtx_PLUS (Pmode,
3507 target = gen_rtx_MEM (BLKmode, temp);
3511 set_mem_attributes (target, type, 1);
3512 /* Function incoming arguments may overlap with sibling call
3513 outgoing arguments and we cannot allow reordering of reads
3514 from function arguments with stores to outgoing arguments
3515 of sibling calls. */
3516 set_mem_alias_set (target, 0);
3519 set_mem_align (target, align);
3521 /* TEMP is the address of the block. Copy the data there. */
3522 if (GET_CODE (size) == CONST_INT
3523 && MOVE_BY_PIECES_P ((unsigned) INTVAL (size), align))
3525 move_by_pieces (target, xinner, INTVAL (size), align);
3530 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
3531 enum machine_mode mode;
3533 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3535 mode = GET_MODE_WIDER_MODE (mode))
3537 enum insn_code code = movstr_optab[(int) mode];
3538 insn_operand_predicate_fn pred;
3540 if (code != CODE_FOR_nothing
3541 && ((GET_CODE (size) == CONST_INT
3542 && ((unsigned HOST_WIDE_INT) INTVAL (size)
3543 <= (GET_MODE_MASK (mode) >> 1)))
3544 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
3545 && (!(pred = insn_data[(int) code].operand[0].predicate)
3546 || ((*pred) (target, BLKmode)))
3547 && (!(pred = insn_data[(int) code].operand[1].predicate)
3548 || ((*pred) (xinner, BLKmode)))
3549 && (!(pred = insn_data[(int) code].operand[3].predicate)
3550 || ((*pred) (opalign, VOIDmode))))
3552 rtx op2 = convert_to_mode (mode, size, 1);
3553 rtx last = get_last_insn ();
3556 pred = insn_data[(int) code].operand[2].predicate;
3557 if (pred != 0 && ! (*pred) (op2, mode))
3558 op2 = copy_to_mode_reg (mode, op2);
3560 pat = GEN_FCN ((int) code) (target, xinner,
3568 delete_insns_since (last);
3573 if (!ACCUMULATE_OUTGOING_ARGS)
3575 /* If the source is referenced relative to the stack pointer,
3576 copy it to another register to stabilize it. We do not need
3577 to do this if we know that we won't be changing sp. */
3579 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3580 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3581 temp = copy_to_reg (temp);
3584 /* Make inhibit_defer_pop nonzero around the library call
3585 to force it to pop the bcopy-arguments right away. */
3587 #ifdef TARGET_MEM_FUNCTIONS
3588 emit_library_call (memcpy_libfunc, LCT_NORMAL,
3589 VOIDmode, 3, temp, Pmode, XEXP (xinner, 0), Pmode,
3590 convert_to_mode (TYPE_MODE (sizetype),
3591 size, TREE_UNSIGNED (sizetype)),
3592 TYPE_MODE (sizetype));
3594 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3595 VOIDmode, 3, XEXP (xinner, 0), Pmode, temp, Pmode,
3596 convert_to_mode (TYPE_MODE (integer_type_node),
3598 TREE_UNSIGNED (integer_type_node)),
3599 TYPE_MODE (integer_type_node));
3604 else if (partial > 0)
3606 /* Scalar partly in registers. */
3608 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3611 /* # words of start of argument
3612 that we must make space for but need not store. */
3613 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3614 int args_offset = INTVAL (args_so_far);
3617 /* Push padding now if padding above and stack grows down,
3618 or if padding below and stack grows up.
3619 But if space already allocated, this has already been done. */
3620 if (extra && args_addr == 0
3621 && where_pad != none && where_pad != stack_direction)
3622 anti_adjust_stack (GEN_INT (extra));
3624 /* If we make space by pushing it, we might as well push
3625 the real data. Otherwise, we can leave OFFSET nonzero
3626 and leave the space uninitialized. */
3630 /* Now NOT_STACK gets the number of words that we don't need to
3631 allocate on the stack. */
3632 not_stack = partial - offset;
3634 /* If the partial register-part of the arg counts in its stack size,
3635 skip the part of stack space corresponding to the registers.
3636 Otherwise, start copying to the beginning of the stack space,
3637 by setting SKIP to 0. */
3638 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3640 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3641 x = validize_mem (force_const_mem (mode, x));
3643 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3644 SUBREGs of such registers are not allowed. */
3645 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER
3646 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3647 x = copy_to_reg (x);
3649 /* Loop over all the words allocated on the stack for this arg. */
3650 /* We can do it by words, because any scalar bigger than a word
3651 has a size a multiple of a word. */
3652 #ifndef PUSH_ARGS_REVERSED
3653 for (i = not_stack; i < size; i++)
3655 for (i = size - 1; i >= not_stack; i--)
3657 if (i >= not_stack + offset)
3658 emit_push_insn (operand_subword_force (x, i, mode),
3659 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3661 GEN_INT (args_offset + ((i - not_stack + skip)
3663 reg_parm_stack_space, alignment_pad);
3668 rtx target = NULL_RTX;
3671 /* Push padding now if padding above and stack grows down,
3672 or if padding below and stack grows up.
3673 But if space already allocated, this has already been done. */
3674 if (extra && args_addr == 0
3675 && where_pad != none && where_pad != stack_direction)
3676 anti_adjust_stack (GEN_INT (extra));
3678 #ifdef PUSH_ROUNDING
3679 if (args_addr == 0 && PUSH_ARGS)
3680 emit_single_push_insn (mode, x, type);
3684 if (GET_CODE (args_so_far) == CONST_INT)
3686 = memory_address (mode,
3687 plus_constant (args_addr,
3688 INTVAL (args_so_far)));
3690 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3693 dest = gen_rtx_MEM (mode, addr);
3696 set_mem_attributes (dest, type, 1);
3697 /* Function incoming arguments may overlap with sibling call
3698 outgoing arguments and we cannot allow reordering of reads
3699 from function arguments with stores to outgoing arguments
3700 of sibling calls. */
3701 set_mem_alias_set (dest, 0);
3704 emit_move_insn (dest, x);
3710 /* If part should go in registers, copy that part
3711 into the appropriate registers. Do this now, at the end,
3712 since mem-to-mem copies above may do function calls. */
3713 if (partial > 0 && reg != 0)
3715 /* Handle calls that pass values in multiple non-contiguous locations.
3716 The Irix 6 ABI has examples of this. */
3717 if (GET_CODE (reg) == PARALLEL)
3718 emit_group_load (reg, x, -1); /* ??? size? */
3720 move_block_to_reg (REGNO (reg), x, partial, mode);
3723 if (extra && args_addr == 0 && where_pad == stack_direction)
3724 anti_adjust_stack (GEN_INT (extra));
3726 if (alignment_pad && args_addr == 0)
3727 anti_adjust_stack (alignment_pad);
3730 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3738 /* Only registers can be subtargets. */
3739 || GET_CODE (x) != REG
3740 /* If the register is readonly, it can't be set more than once. */
3741 || RTX_UNCHANGING_P (x)
3742 /* Don't use hard regs to avoid extending their life. */
3743 || REGNO (x) < FIRST_PSEUDO_REGISTER
3744 /* Avoid subtargets inside loops,
3745 since they hide some invariant expressions. */
3746 || preserve_subexpressions_p ())
3750 /* Expand an assignment that stores the value of FROM into TO.
3751 If WANT_VALUE is nonzero, return an rtx for the value of TO.
3752 (This may contain a QUEUED rtx;
3753 if the value is constant, this rtx is a constant.)
3754 Otherwise, the returned value is NULL_RTX.
3756 SUGGEST_REG is no longer actually used.
3757 It used to mean, copy the value through a register
3758 and return that register, if that is possible.
3759 We now use WANT_VALUE to decide whether to do this. */
3762 expand_assignment (to, from, want_value, suggest_reg)
3765 int suggest_reg ATTRIBUTE_UNUSED;
3770 /* Don't crash if the lhs of the assignment was erroneous. */
3772 if (TREE_CODE (to) == ERROR_MARK)
3774 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3775 return want_value ? result : NULL_RTX;
3778 /* Assignment of a structure component needs special treatment
3779 if the structure component's rtx is not simply a MEM.
3780 Assignment of an array element at a constant index, and assignment of
3781 an array element in an unaligned packed structure field, has the same
3784 if (TREE_CODE (to) == COMPONENT_REF || TREE_CODE (to) == BIT_FIELD_REF
3785 || TREE_CODE (to) == ARRAY_REF || TREE_CODE (to) == ARRAY_RANGE_REF)
3787 enum machine_mode mode1;
3788 HOST_WIDE_INT bitsize, bitpos;
3796 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3797 &unsignedp, &volatilep);
3799 /* If we are going to use store_bit_field and extract_bit_field,
3800 make sure to_rtx will be safe for multiple use. */
3802 if (mode1 == VOIDmode && want_value)
3803 tem = stabilize_reference (tem);
3805 orig_to_rtx = to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
3809 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
3811 if (GET_CODE (to_rtx) != MEM)
3814 #ifdef POINTERS_EXTEND_UNSIGNED
3815 if (GET_MODE (offset_rtx) != Pmode)
3816 offset_rtx = convert_memory_address (Pmode, offset_rtx);
3818 if (GET_MODE (offset_rtx) != ptr_mode)
3819 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3822 /* A constant address in TO_RTX can have VOIDmode, we must not try
3823 to call force_reg for that case. Avoid that case. */
3824 if (GET_CODE (to_rtx) == MEM
3825 && GET_MODE (to_rtx) == BLKmode
3826 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3828 && (bitpos % bitsize) == 0
3829 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3830 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
3832 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
3836 to_rtx = offset_address (to_rtx, offset_rtx,
3837 highest_pow2_factor_for_type (TREE_TYPE (to),
3841 if (GET_CODE (to_rtx) == MEM)
3843 tree old_expr = MEM_EXPR (to_rtx);
3845 /* If the field is at offset zero, we could have been given the
3846 DECL_RTX of the parent struct. Don't munge it. */
3847 to_rtx = shallow_copy_rtx (to_rtx);
3849 set_mem_attributes (to_rtx, to, 0);
3851 /* If we changed MEM_EXPR, that means we're now referencing
3852 the COMPONENT_REF, which means that MEM_OFFSET must be
3853 relative to that field. But we've not yet reflected BITPOS
3854 in TO_RTX. This will be done in store_field. Adjust for
3855 that by biasing MEM_OFFSET by -bitpos. */
3856 if (MEM_EXPR (to_rtx) != old_expr && MEM_OFFSET (to_rtx)
3857 && (bitpos / BITS_PER_UNIT) != 0)
3858 set_mem_offset (to_rtx, GEN_INT (INTVAL (MEM_OFFSET (to_rtx))
3859 - (bitpos / BITS_PER_UNIT)));
3862 /* Deal with volatile and readonly fields. The former is only done
3863 for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
3864 if (volatilep && GET_CODE (to_rtx) == MEM)
3866 if (to_rtx == orig_to_rtx)
3867 to_rtx = copy_rtx (to_rtx);
3868 MEM_VOLATILE_P (to_rtx) = 1;
3871 if (TREE_CODE (to) == COMPONENT_REF
3872 && TREE_READONLY (TREE_OPERAND (to, 1)))
3874 if (to_rtx == orig_to_rtx)
3875 to_rtx = copy_rtx (to_rtx);
3876 RTX_UNCHANGING_P (to_rtx) = 1;
3879 if (GET_CODE (to_rtx) == MEM && ! can_address_p (to))
3881 if (to_rtx == orig_to_rtx)
3882 to_rtx = copy_rtx (to_rtx);
3883 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
3886 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3888 /* Spurious cast for HPUX compiler. */
3889 ? ((enum machine_mode)
3890 TYPE_MODE (TREE_TYPE (to)))
3892 unsignedp, TREE_TYPE (tem), get_alias_set (to));
3894 preserve_temp_slots (result);
3898 /* If the value is meaningful, convert RESULT to the proper mode.
3899 Otherwise, return nothing. */
3900 return (want_value ? convert_modes (TYPE_MODE (TREE_TYPE (to)),
3901 TYPE_MODE (TREE_TYPE (from)),
3903 TREE_UNSIGNED (TREE_TYPE (to)))
3907 /* If the rhs is a function call and its value is not an aggregate,
3908 call the function before we start to compute the lhs.
3909 This is needed for correct code for cases such as
3910 val = setjmp (buf) on machines where reference to val
3911 requires loading up part of an address in a separate insn.
3913 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3914 since it might be a promoted variable where the zero- or sign- extension
3915 needs to be done. Handling this in the normal way is safe because no
3916 computation is done before the call. */
3917 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from)
3918 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3919 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3920 && GET_CODE (DECL_RTL (to)) == REG))
3925 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3927 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3929 /* Handle calls that return values in multiple non-contiguous locations.
3930 The Irix 6 ABI has examples of this. */
3931 if (GET_CODE (to_rtx) == PARALLEL)
3932 emit_group_load (to_rtx, value, int_size_in_bytes (TREE_TYPE (from)));
3933 else if (GET_MODE (to_rtx) == BLKmode)
3934 emit_block_move (to_rtx, value, expr_size (from));
3937 #ifdef POINTERS_EXTEND_UNSIGNED
3938 if (POINTER_TYPE_P (TREE_TYPE (to))
3939 && GET_MODE (to_rtx) != GET_MODE (value))
3940 value = convert_memory_address (GET_MODE (to_rtx), value);
3942 emit_move_insn (to_rtx, value);
3944 preserve_temp_slots (to_rtx);
3947 return want_value ? to_rtx : NULL_RTX;
3950 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3951 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3954 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3956 /* Don't move directly into a return register. */
3957 if (TREE_CODE (to) == RESULT_DECL
3958 && (GET_CODE (to_rtx) == REG || GET_CODE (to_rtx) == PARALLEL))
3963 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3965 if (GET_CODE (to_rtx) == PARALLEL)
3966 emit_group_load (to_rtx, temp, int_size_in_bytes (TREE_TYPE (from)));
3968 emit_move_insn (to_rtx, temp);
3970 preserve_temp_slots (to_rtx);
3973 return want_value ? to_rtx : NULL_RTX;
3976 /* In case we are returning the contents of an object which overlaps
3977 the place the value is being stored, use a safe function when copying
3978 a value through a pointer into a structure value return block. */
3979 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3980 && current_function_returns_struct
3981 && !current_function_returns_pcc_struct)
3986 size = expr_size (from);
3987 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
3989 #ifdef TARGET_MEM_FUNCTIONS
3990 emit_library_call (memmove_libfunc, LCT_NORMAL,
3991 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3992 XEXP (from_rtx, 0), Pmode,
3993 convert_to_mode (TYPE_MODE (sizetype),
3994 size, TREE_UNSIGNED (sizetype)),
3995 TYPE_MODE (sizetype));
3997 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3998 VOIDmode, 3, XEXP (from_rtx, 0), Pmode,
3999 XEXP (to_rtx, 0), Pmode,
4000 convert_to_mode (TYPE_MODE (integer_type_node),
4001 size, TREE_UNSIGNED (integer_type_node)),
4002 TYPE_MODE (integer_type_node));
4005 preserve_temp_slots (to_rtx);
4008 return want_value ? to_rtx : NULL_RTX;
4011 /* Compute FROM and store the value in the rtx we got. */
4014 result = store_expr (from, to_rtx, want_value);
4015 preserve_temp_slots (result);
4018 return want_value ? result : NULL_RTX;
4021 /* Generate code for computing expression EXP,
4022 and storing the value into TARGET.
4023 TARGET may contain a QUEUED rtx.
4025 If WANT_VALUE is nonzero, return a copy of the value
4026 not in TARGET, so that we can be sure to use the proper
4027 value in a containing expression even if TARGET has something
4028 else stored in it. If possible, we copy the value through a pseudo
4029 and return that pseudo. Or, if the value is constant, we try to
4030 return the constant. In some cases, we return a pseudo
4031 copied *from* TARGET.
4033 If the mode is BLKmode then we may return TARGET itself.
4034 It turns out that in BLKmode it doesn't cause a problem.
4035 because C has no operators that could combine two different
4036 assignments into the same BLKmode object with different values
4037 with no sequence point. Will other languages need this to
4040 If WANT_VALUE is 0, we return NULL, to make sure
4041 to catch quickly any cases where the caller uses the value
4042 and fails to set WANT_VALUE. */
4045 store_expr (exp, target, want_value)
4051 int dont_return_target = 0;
4052 int dont_store_target = 0;
4054 if (TREE_CODE (exp) == COMPOUND_EXPR)
4056 /* Perform first part of compound expression, then assign from second
4058 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
4060 return store_expr (TREE_OPERAND (exp, 1), target, want_value);
4062 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4064 /* For conditional expression, get safe form of the target. Then
4065 test the condition, doing the appropriate assignment on either
4066 side. This avoids the creation of unnecessary temporaries.
4067 For non-BLKmode, it is more efficient not to do this. */
4069 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4072 target = protect_from_queue (target, 1);
4074 do_pending_stack_adjust ();
4076 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4077 start_cleanup_deferral ();
4078 store_expr (TREE_OPERAND (exp, 1), target, 0);
4079 end_cleanup_deferral ();
4081 emit_jump_insn (gen_jump (lab2));
4084 start_cleanup_deferral ();
4085 store_expr (TREE_OPERAND (exp, 2), target, 0);
4086 end_cleanup_deferral ();
4091 return want_value ? target : NULL_RTX;
4093 else if (queued_subexp_p (target))
4094 /* If target contains a postincrement, let's not risk
4095 using it as the place to generate the rhs. */
4097 if (GET_MODE (target) != BLKmode && GET_MODE (target) != VOIDmode)
4099 /* Expand EXP into a new pseudo. */
4100 temp = gen_reg_rtx (GET_MODE (target));
4101 temp = expand_expr (exp, temp, GET_MODE (target), 0);
4104 temp = expand_expr (exp, NULL_RTX, GET_MODE (target), 0);
4106 /* If target is volatile, ANSI requires accessing the value
4107 *from* the target, if it is accessed. So make that happen.
4108 In no case return the target itself. */
4109 if (! MEM_VOLATILE_P (target) && want_value)
4110 dont_return_target = 1;
4112 else if (want_value && GET_CODE (target) == MEM && ! MEM_VOLATILE_P (target)
4113 && GET_MODE (target) != BLKmode)
4114 /* If target is in memory and caller wants value in a register instead,
4115 arrange that. Pass TARGET as target for expand_expr so that,
4116 if EXP is another assignment, WANT_VALUE will be nonzero for it.
4117 We know expand_expr will not use the target in that case.
4118 Don't do this if TARGET is volatile because we are supposed
4119 to write it and then read it. */
4121 temp = expand_expr (exp, target, GET_MODE (target), 0);
4122 if (GET_MODE (temp) != BLKmode && GET_MODE (temp) != VOIDmode)
4124 /* If TEMP is already in the desired TARGET, only copy it from
4125 memory and don't store it there again. */
4127 || (rtx_equal_p (temp, target)
4128 && ! side_effects_p (temp) && ! side_effects_p (target)))
4129 dont_store_target = 1;
4130 temp = copy_to_reg (temp);
4132 dont_return_target = 1;
4134 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4135 /* If this is an scalar in a register that is stored in a wider mode
4136 than the declared mode, compute the result into its declared mode
4137 and then convert to the wider mode. Our value is the computed
4140 rtx inner_target = 0;
4142 /* If we don't want a value, we can do the conversion inside EXP,
4143 which will often result in some optimizations. Do the conversion
4144 in two steps: first change the signedness, if needed, then
4145 the extend. But don't do this if the type of EXP is a subtype
4146 of something else since then the conversion might involve
4147 more than just converting modes. */
4148 if (! want_value && INTEGRAL_TYPE_P (TREE_TYPE (exp))
4149 && TREE_TYPE (TREE_TYPE (exp)) == 0)
4151 if (TREE_UNSIGNED (TREE_TYPE (exp))
4152 != SUBREG_PROMOTED_UNSIGNED_P (target))
4154 ((*lang_hooks.types.signed_or_unsigned_type)
4155 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)), exp);
4157 exp = convert ((*lang_hooks.types.type_for_mode)
4158 (GET_MODE (SUBREG_REG (target)),
4159 SUBREG_PROMOTED_UNSIGNED_P (target)),
4162 inner_target = SUBREG_REG (target);
4165 temp = expand_expr (exp, inner_target, VOIDmode, 0);
4167 /* If TEMP is a volatile MEM and we want a result value, make
4168 the access now so it gets done only once. Likewise if
4169 it contains TARGET. */
4170 if (GET_CODE (temp) == MEM && want_value
4171 && (MEM_VOLATILE_P (temp)
4172 || reg_mentioned_p (SUBREG_REG (target), XEXP (temp, 0))))
4173 temp = copy_to_reg (temp);
4175 /* If TEMP is a VOIDmode constant, use convert_modes to make
4176 sure that we properly convert it. */
4177 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4179 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4180 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4181 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4182 GET_MODE (target), temp,
4183 SUBREG_PROMOTED_UNSIGNED_P (target));
4186 convert_move (SUBREG_REG (target), temp,
4187 SUBREG_PROMOTED_UNSIGNED_P (target));
4189 /* If we promoted a constant, change the mode back down to match
4190 target. Otherwise, the caller might get confused by a result whose
4191 mode is larger than expected. */
4193 if (want_value && GET_MODE (temp) != GET_MODE (target))
4195 if (GET_MODE (temp) != VOIDmode)
4197 temp = gen_lowpart_SUBREG (GET_MODE (target), temp);
4198 SUBREG_PROMOTED_VAR_P (temp) = 1;
4199 SUBREG_PROMOTED_UNSIGNED_SET (temp,
4200 SUBREG_PROMOTED_UNSIGNED_P (target));
4203 temp = convert_modes (GET_MODE (target),
4204 GET_MODE (SUBREG_REG (target)),
4205 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4208 return want_value ? temp : NULL_RTX;
4212 temp = expand_expr (exp, target, GET_MODE (target), 0);
4213 /* Return TARGET if it's a specified hardware register.
4214 If TARGET is a volatile mem ref, either return TARGET
4215 or return a reg copied *from* TARGET; ANSI requires this.
4217 Otherwise, if TEMP is not TARGET, return TEMP
4218 if it is constant (for efficiency),
4219 or if we really want the correct value. */
4220 if (!(target && GET_CODE (target) == REG
4221 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4222 && !(GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
4223 && ! rtx_equal_p (temp, target)
4224 && (CONSTANT_P (temp) || want_value))
4225 dont_return_target = 1;
4228 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4229 the same as that of TARGET, adjust the constant. This is needed, for
4230 example, in case it is a CONST_DOUBLE and we want only a word-sized
4232 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4233 && TREE_CODE (exp) != ERROR_MARK
4234 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4235 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4236 temp, TREE_UNSIGNED (TREE_TYPE (exp)));
4238 /* If value was not generated in the target, store it there.
4239 Convert the value to TARGET's type first if necessary.
4240 If TEMP and TARGET compare equal according to rtx_equal_p, but
4241 one or both of them are volatile memory refs, we have to distinguish
4243 - expand_expr has used TARGET. In this case, we must not generate
4244 another copy. This can be detected by TARGET being equal according
4246 - expand_expr has not used TARGET - that means that the source just
4247 happens to have the same RTX form. Since temp will have been created
4248 by expand_expr, it will compare unequal according to == .
4249 We must generate a copy in this case, to reach the correct number
4250 of volatile memory references. */
4252 if ((! rtx_equal_p (temp, target)
4253 || (temp != target && (side_effects_p (temp)
4254 || side_effects_p (target))))
4255 && TREE_CODE (exp) != ERROR_MARK
4256 && ! dont_store_target
4257 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4258 but TARGET is not valid memory reference, TEMP will differ
4259 from TARGET although it is really the same location. */
4260 && (TREE_CODE_CLASS (TREE_CODE (exp)) != 'd'
4261 || target != DECL_RTL_IF_SET (exp)))
4263 target = protect_from_queue (target, 1);
4264 if (GET_MODE (temp) != GET_MODE (target)
4265 && GET_MODE (temp) != VOIDmode)
4267 int unsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
4268 if (dont_return_target)
4270 /* In this case, we will return TEMP,
4271 so make sure it has the proper mode.
4272 But don't forget to store the value into TARGET. */
4273 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4274 emit_move_insn (target, temp);
4277 convert_move (target, temp, unsignedp);
4280 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4282 /* Handle copying a string constant into an array. The string
4283 constant may be shorter than the array. So copy just the string's
4284 actual length, and clear the rest. First get the size of the data
4285 type of the string, which is actually the size of the target. */
4286 rtx size = expr_size (exp);
4288 if (GET_CODE (size) == CONST_INT
4289 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4290 emit_block_move (target, temp, size);
4293 /* Compute the size of the data to copy from the string. */
4295 = size_binop (MIN_EXPR,
4296 make_tree (sizetype, size),
4297 size_int (TREE_STRING_LENGTH (exp)));
4298 rtx copy_size_rtx = expand_expr (copy_size, NULL_RTX,
4302 /* Copy that much. */
4303 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx, 0);
4304 emit_block_move (target, temp, copy_size_rtx);
4306 /* Figure out how much is left in TARGET that we have to clear.
4307 Do all calculations in ptr_mode. */
4308 if (GET_CODE (copy_size_rtx) == CONST_INT)
4310 size = plus_constant (size, -INTVAL (copy_size_rtx));
4311 target = adjust_address (target, BLKmode,
4312 INTVAL (copy_size_rtx));
4316 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4317 copy_size_rtx, NULL_RTX, 0,
4320 #ifdef POINTERS_EXTEND_UNSIGNED
4321 if (GET_MODE (copy_size_rtx) != Pmode)
4322 copy_size_rtx = convert_memory_address (Pmode,
4326 target = offset_address (target, copy_size_rtx,
4327 highest_pow2_factor (copy_size));
4328 label = gen_label_rtx ();
4329 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4330 GET_MODE (size), 0, label);
4333 if (size != const0_rtx)
4334 clear_storage (target, size);
4340 /* Handle calls that return values in multiple non-contiguous locations.
4341 The Irix 6 ABI has examples of this. */
4342 else if (GET_CODE (target) == PARALLEL)
4343 emit_group_load (target, temp, int_size_in_bytes (TREE_TYPE (exp)));
4344 else if (GET_MODE (temp) == BLKmode)
4345 emit_block_move (target, temp, expr_size (exp));
4347 emit_move_insn (target, temp);
4350 /* If we don't want a value, return NULL_RTX. */
4354 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
4355 ??? The latter test doesn't seem to make sense. */
4356 else if (dont_return_target && GET_CODE (temp) != MEM)
4359 /* Return TARGET itself if it is a hard register. */
4360 else if (want_value && GET_MODE (target) != BLKmode
4361 && ! (GET_CODE (target) == REG
4362 && REGNO (target) < FIRST_PSEUDO_REGISTER))
4363 return copy_to_reg (target);
4369 /* Return 1 if EXP just contains zeros. */
4377 switch (TREE_CODE (exp))
4381 case NON_LVALUE_EXPR:
4382 case VIEW_CONVERT_EXPR:
4383 return is_zeros_p (TREE_OPERAND (exp, 0));
4386 return integer_zerop (exp);
4390 is_zeros_p (TREE_REALPART (exp)) && is_zeros_p (TREE_IMAGPART (exp));
4393 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp), dconst0);
4396 for (elt = TREE_VECTOR_CST_ELTS (exp); elt;
4397 elt = TREE_CHAIN (elt))
4398 if (!is_zeros_p (TREE_VALUE (elt)))
4404 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4405 return CONSTRUCTOR_ELTS (exp) == NULL_TREE;
4406 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4407 if (! is_zeros_p (TREE_VALUE (elt)))
4417 /* Return 1 if EXP contains mostly (3/4) zeros. */
4420 mostly_zeros_p (exp)
4423 if (TREE_CODE (exp) == CONSTRUCTOR)
4425 int elts = 0, zeros = 0;
4426 tree elt = CONSTRUCTOR_ELTS (exp);
4427 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4429 /* If there are no ranges of true bits, it is all zero. */
4430 return elt == NULL_TREE;
4432 for (; elt; elt = TREE_CHAIN (elt))
4434 /* We do not handle the case where the index is a RANGE_EXPR,
4435 so the statistic will be somewhat inaccurate.
4436 We do make a more accurate count in store_constructor itself,
4437 so since this function is only used for nested array elements,
4438 this should be close enough. */
4439 if (mostly_zeros_p (TREE_VALUE (elt)))
4444 return 4 * zeros >= 3 * elts;
4447 return is_zeros_p (exp);
4450 /* Helper function for store_constructor.
4451 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4452 TYPE is the type of the CONSTRUCTOR, not the element type.
4453 CLEARED is as for store_constructor.
4454 ALIAS_SET is the alias set to use for any stores.
4456 This provides a recursive shortcut back to store_constructor when it isn't
4457 necessary to go through store_field. This is so that we can pass through
4458 the cleared field to let store_constructor know that we may not have to
4459 clear a substructure if the outer structure has already been cleared. */
4462 store_constructor_field (target, bitsize, bitpos, mode, exp, type, cleared,
4465 unsigned HOST_WIDE_INT bitsize;
4466 HOST_WIDE_INT bitpos;
4467 enum machine_mode mode;
4472 if (TREE_CODE (exp) == CONSTRUCTOR
4473 && bitpos % BITS_PER_UNIT == 0
4474 /* If we have a non-zero bitpos for a register target, then we just
4475 let store_field do the bitfield handling. This is unlikely to
4476 generate unnecessary clear instructions anyways. */
4477 && (bitpos == 0 || GET_CODE (target) == MEM))
4479 if (GET_CODE (target) == MEM)
4481 = adjust_address (target,
4482 GET_MODE (target) == BLKmode
4484 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4485 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4488 /* Update the alias set, if required. */
4489 if (GET_CODE (target) == MEM && ! MEM_KEEP_ALIAS_SET_P (target)
4490 && MEM_ALIAS_SET (target) != 0)
4492 target = copy_rtx (target);
4493 set_mem_alias_set (target, alias_set);
4496 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4499 store_field (target, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
4503 /* Store the value of constructor EXP into the rtx TARGET.
4504 TARGET is either a REG or a MEM; we know it cannot conflict, since
4505 safe_from_p has been called.
4506 CLEARED is true if TARGET is known to have been zero'd.
4507 SIZE is the number of bytes of TARGET we are allowed to modify: this
4508 may not be the same as the size of EXP if we are assigning to a field
4509 which has been packed to exclude padding bits. */
4512 store_constructor (exp, target, cleared, size)
4518 tree type = TREE_TYPE (exp);
4519 #ifdef WORD_REGISTER_OPERATIONS
4520 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4523 if (TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4524 || TREE_CODE (type) == QUAL_UNION_TYPE)
4528 /* We either clear the aggregate or indicate the value is dead. */
4529 if ((TREE_CODE (type) == UNION_TYPE
4530 || TREE_CODE (type) == QUAL_UNION_TYPE)
4532 && ! CONSTRUCTOR_ELTS (exp))
4533 /* If the constructor is empty, clear the union. */
4535 clear_storage (target, expr_size (exp));
4539 /* If we are building a static constructor into a register,
4540 set the initial value as zero so we can fold the value into
4541 a constant. But if more than one register is involved,
4542 this probably loses. */
4543 else if (! cleared && GET_CODE (target) == REG && TREE_STATIC (exp)
4544 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4546 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4550 /* If the constructor has fewer fields than the structure
4551 or if we are initializing the structure to mostly zeros,
4552 clear the whole structure first. Don't do this if TARGET is a
4553 register whose mode size isn't equal to SIZE since clear_storage
4554 can't handle this case. */
4555 else if (! cleared && size > 0
4556 && ((list_length (CONSTRUCTOR_ELTS (exp))
4557 != fields_length (type))
4558 || mostly_zeros_p (exp))
4559 && (GET_CODE (target) != REG
4560 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4563 clear_storage (target, GEN_INT (size));
4568 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4570 /* Store each element of the constructor into
4571 the corresponding field of TARGET. */
4573 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4575 tree field = TREE_PURPOSE (elt);
4576 tree value = TREE_VALUE (elt);
4577 enum machine_mode mode;
4578 HOST_WIDE_INT bitsize;
4579 HOST_WIDE_INT bitpos = 0;
4582 rtx to_rtx = target;
4584 /* Just ignore missing fields.
4585 We cleared the whole structure, above,
4586 if any fields are missing. */
4590 if (cleared && is_zeros_p (value))
4593 if (host_integerp (DECL_SIZE (field), 1))
4594 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4598 unsignedp = TREE_UNSIGNED (field);
4599 mode = DECL_MODE (field);
4600 if (DECL_BIT_FIELD (field))
4603 offset = DECL_FIELD_OFFSET (field);
4604 if (host_integerp (offset, 0)
4605 && host_integerp (bit_position (field), 0))
4607 bitpos = int_bit_position (field);
4611 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4617 if (contains_placeholder_p (offset))
4618 offset = build (WITH_RECORD_EXPR, sizetype,
4619 offset, make_tree (TREE_TYPE (exp), target));
4621 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4622 if (GET_CODE (to_rtx) != MEM)
4625 #ifdef POINTERS_EXTEND_UNSIGNED
4626 if (GET_MODE (offset_rtx) != Pmode)
4627 offset_rtx = convert_memory_address (Pmode, offset_rtx);
4629 if (GET_MODE (offset_rtx) != ptr_mode)
4630 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4633 to_rtx = offset_address (to_rtx, offset_rtx,
4634 highest_pow2_factor (offset));
4637 if (TREE_READONLY (field))
4639 if (GET_CODE (to_rtx) == MEM)
4640 to_rtx = copy_rtx (to_rtx);
4642 RTX_UNCHANGING_P (to_rtx) = 1;
4645 #ifdef WORD_REGISTER_OPERATIONS
4646 /* If this initializes a field that is smaller than a word, at the
4647 start of a word, try to widen it to a full word.
4648 This special case allows us to output C++ member function
4649 initializations in a form that the optimizers can understand. */
4650 if (GET_CODE (target) == REG
4651 && bitsize < BITS_PER_WORD
4652 && bitpos % BITS_PER_WORD == 0
4653 && GET_MODE_CLASS (mode) == MODE_INT
4654 && TREE_CODE (value) == INTEGER_CST
4656 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4658 tree type = TREE_TYPE (value);
4660 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4662 type = (*lang_hooks.types.type_for_size)
4663 (BITS_PER_WORD, TREE_UNSIGNED (type));
4664 value = convert (type, value);
4667 if (BYTES_BIG_ENDIAN)
4669 = fold (build (LSHIFT_EXPR, type, value,
4670 build_int_2 (BITS_PER_WORD - bitsize, 0)));
4671 bitsize = BITS_PER_WORD;
4676 if (GET_CODE (to_rtx) == MEM && !MEM_KEEP_ALIAS_SET_P (to_rtx)
4677 && DECL_NONADDRESSABLE_P (field))
4679 to_rtx = copy_rtx (to_rtx);
4680 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4683 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4684 value, type, cleared,
4685 get_alias_set (TREE_TYPE (field)));
4688 else if (TREE_CODE (type) == ARRAY_TYPE
4689 || TREE_CODE (type) == VECTOR_TYPE)
4694 tree domain = TYPE_DOMAIN (type);
4695 tree elttype = TREE_TYPE (type);
4697 HOST_WIDE_INT minelt = 0;
4698 HOST_WIDE_INT maxelt = 0;
4700 /* Vectors are like arrays, but the domain is stored via an array
4702 if (TREE_CODE (type) == VECTOR_TYPE)
4704 /* Note that although TYPE_DEBUG_REPRESENTATION_TYPE uses
4705 the same field as TYPE_DOMAIN, we are not guaranteed that
4707 domain = TYPE_DEBUG_REPRESENTATION_TYPE (type);
4708 domain = TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (domain)));
4711 const_bounds_p = (TYPE_MIN_VALUE (domain)
4712 && TYPE_MAX_VALUE (domain)
4713 && host_integerp (TYPE_MIN_VALUE (domain), 0)
4714 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4716 /* If we have constant bounds for the range of the type, get them. */
4719 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4720 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4723 /* If the constructor has fewer elements than the array,
4724 clear the whole array first. Similarly if this is
4725 static constructor of a non-BLKmode object. */
4726 if (cleared || (GET_CODE (target) == REG && TREE_STATIC (exp)))
4730 HOST_WIDE_INT count = 0, zero_count = 0;
4731 need_to_clear = ! const_bounds_p;
4733 /* This loop is a more accurate version of the loop in
4734 mostly_zeros_p (it handles RANGE_EXPR in an index).
4735 It is also needed to check for missing elements. */
4736 for (elt = CONSTRUCTOR_ELTS (exp);
4737 elt != NULL_TREE && ! need_to_clear;
4738 elt = TREE_CHAIN (elt))
4740 tree index = TREE_PURPOSE (elt);
4741 HOST_WIDE_INT this_node_count;
4743 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4745 tree lo_index = TREE_OPERAND (index, 0);
4746 tree hi_index = TREE_OPERAND (index, 1);
4748 if (! host_integerp (lo_index, 1)
4749 || ! host_integerp (hi_index, 1))
4755 this_node_count = (tree_low_cst (hi_index, 1)
4756 - tree_low_cst (lo_index, 1) + 1);
4759 this_node_count = 1;
4761 count += this_node_count;
4762 if (mostly_zeros_p (TREE_VALUE (elt)))
4763 zero_count += this_node_count;
4766 /* Clear the entire array first if there are any missing elements,
4767 or if the incidence of zero elements is >= 75%. */
4769 && (count < maxelt - minelt + 1 || 4 * zero_count >= 3 * count))
4773 if (need_to_clear && size > 0)
4778 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4780 clear_storage (target, GEN_INT (size));
4784 else if (REG_P (target))
4785 /* Inform later passes that the old value is dead. */
4786 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4788 /* Store each element of the constructor into
4789 the corresponding element of TARGET, determined
4790 by counting the elements. */
4791 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4793 elt = TREE_CHAIN (elt), i++)
4795 enum machine_mode mode;
4796 HOST_WIDE_INT bitsize;
4797 HOST_WIDE_INT bitpos;
4799 tree value = TREE_VALUE (elt);
4800 tree index = TREE_PURPOSE (elt);
4801 rtx xtarget = target;
4803 if (cleared && is_zeros_p (value))
4806 unsignedp = TREE_UNSIGNED (elttype);
4807 mode = TYPE_MODE (elttype);
4808 if (mode == BLKmode)
4809 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4810 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4813 bitsize = GET_MODE_BITSIZE (mode);
4815 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4817 tree lo_index = TREE_OPERAND (index, 0);
4818 tree hi_index = TREE_OPERAND (index, 1);
4819 rtx index_r, pos_rtx, hi_r, loop_top, loop_end;
4820 struct nesting *loop;
4821 HOST_WIDE_INT lo, hi, count;
4824 /* If the range is constant and "small", unroll the loop. */
4826 && host_integerp (lo_index, 0)
4827 && host_integerp (hi_index, 0)
4828 && (lo = tree_low_cst (lo_index, 0),
4829 hi = tree_low_cst (hi_index, 0),
4830 count = hi - lo + 1,
4831 (GET_CODE (target) != MEM
4833 || (host_integerp (TYPE_SIZE (elttype), 1)
4834 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4837 lo -= minelt; hi -= minelt;
4838 for (; lo <= hi; lo++)
4840 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4842 if (GET_CODE (target) == MEM
4843 && !MEM_KEEP_ALIAS_SET_P (target)
4844 && TREE_CODE (type) == ARRAY_TYPE
4845 && TYPE_NONALIASED_COMPONENT (type))
4847 target = copy_rtx (target);
4848 MEM_KEEP_ALIAS_SET_P (target) = 1;
4851 store_constructor_field
4852 (target, bitsize, bitpos, mode, value, type, cleared,
4853 get_alias_set (elttype));
4858 hi_r = expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4859 loop_top = gen_label_rtx ();
4860 loop_end = gen_label_rtx ();
4862 unsignedp = TREE_UNSIGNED (domain);
4864 index = build_decl (VAR_DECL, NULL_TREE, domain);
4867 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4869 SET_DECL_RTL (index, index_r);
4870 if (TREE_CODE (value) == SAVE_EXPR
4871 && SAVE_EXPR_RTL (value) == 0)
4873 /* Make sure value gets expanded once before the
4875 expand_expr (value, const0_rtx, VOIDmode, 0);
4878 store_expr (lo_index, index_r, 0);
4879 loop = expand_start_loop (0);
4881 /* Assign value to element index. */
4883 = convert (ssizetype,
4884 fold (build (MINUS_EXPR, TREE_TYPE (index),
4885 index, TYPE_MIN_VALUE (domain))));
4886 position = size_binop (MULT_EXPR, position,
4888 TYPE_SIZE_UNIT (elttype)));
4890 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4891 xtarget = offset_address (target, pos_rtx,
4892 highest_pow2_factor (position));
4893 xtarget = adjust_address (xtarget, mode, 0);
4894 if (TREE_CODE (value) == CONSTRUCTOR)
4895 store_constructor (value, xtarget, cleared,
4896 bitsize / BITS_PER_UNIT);
4898 store_expr (value, xtarget, 0);
4900 expand_exit_loop_if_false (loop,
4901 build (LT_EXPR, integer_type_node,
4904 expand_increment (build (PREINCREMENT_EXPR,
4906 index, integer_one_node), 0, 0);
4908 emit_label (loop_end);
4911 else if ((index != 0 && ! host_integerp (index, 0))
4912 || ! host_integerp (TYPE_SIZE (elttype), 1))
4917 index = ssize_int (1);
4920 index = convert (ssizetype,
4921 fold (build (MINUS_EXPR, index,
4922 TYPE_MIN_VALUE (domain))));
4924 position = size_binop (MULT_EXPR, index,
4926 TYPE_SIZE_UNIT (elttype)));
4927 xtarget = offset_address (target,
4928 expand_expr (position, 0, VOIDmode, 0),
4929 highest_pow2_factor (position));
4930 xtarget = adjust_address (xtarget, mode, 0);
4931 store_expr (value, xtarget, 0);
4936 bitpos = ((tree_low_cst (index, 0) - minelt)
4937 * tree_low_cst (TYPE_SIZE (elttype), 1));
4939 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
4941 if (GET_CODE (target) == MEM && !MEM_KEEP_ALIAS_SET_P (target)
4942 && TREE_CODE (type) == ARRAY_TYPE
4943 && TYPE_NONALIASED_COMPONENT (type))
4945 target = copy_rtx (target);
4946 MEM_KEEP_ALIAS_SET_P (target) = 1;
4949 store_constructor_field (target, bitsize, bitpos, mode, value,
4950 type, cleared, get_alias_set (elttype));
4956 /* Set constructor assignments. */
4957 else if (TREE_CODE (type) == SET_TYPE)
4959 tree elt = CONSTRUCTOR_ELTS (exp);
4960 unsigned HOST_WIDE_INT nbytes = int_size_in_bytes (type), nbits;
4961 tree domain = TYPE_DOMAIN (type);
4962 tree domain_min, domain_max, bitlength;
4964 /* The default implementation strategy is to extract the constant
4965 parts of the constructor, use that to initialize the target,
4966 and then "or" in whatever non-constant ranges we need in addition.
4968 If a large set is all zero or all ones, it is
4969 probably better to set it using memset (if available) or bzero.
4970 Also, if a large set has just a single range, it may also be
4971 better to first clear all the first clear the set (using
4972 bzero/memset), and set the bits we want. */
4974 /* Check for all zeros. */
4975 if (elt == NULL_TREE && size > 0)
4978 clear_storage (target, GEN_INT (size));
4982 domain_min = convert (sizetype, TYPE_MIN_VALUE (domain));
4983 domain_max = convert (sizetype, TYPE_MAX_VALUE (domain));
4984 bitlength = size_binop (PLUS_EXPR,
4985 size_diffop (domain_max, domain_min),
4988 nbits = tree_low_cst (bitlength, 1);
4990 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
4991 are "complicated" (more than one range), initialize (the
4992 constant parts) by copying from a constant. */
4993 if (GET_MODE (target) != BLKmode || nbits <= 2 * BITS_PER_WORD
4994 || (nbytes <= 32 && TREE_CHAIN (elt) != NULL_TREE))
4996 unsigned int set_word_size = TYPE_ALIGN (TREE_TYPE (exp));
4997 enum machine_mode mode = mode_for_size (set_word_size, MODE_INT, 1);
4998 char *bit_buffer = (char *) alloca (nbits);
4999 HOST_WIDE_INT word = 0;
5000 unsigned int bit_pos = 0;
5001 unsigned int ibit = 0;
5002 unsigned int offset = 0; /* In bytes from beginning of set. */
5004 elt = get_set_constructor_bits (exp, bit_buffer, nbits);
5007 if (bit_buffer[ibit])
5009 if (BYTES_BIG_ENDIAN)
5010 word |= (1 << (set_word_size - 1 - bit_pos));
5012 word |= 1 << bit_pos;
5016 if (bit_pos >= set_word_size || ibit == nbits)
5018 if (word != 0 || ! cleared)
5020 rtx datum = GEN_INT (word);
5023 /* The assumption here is that it is safe to use
5024 XEXP if the set is multi-word, but not if
5025 it's single-word. */
5026 if (GET_CODE (target) == MEM)
5027 to_rtx = adjust_address (target, mode, offset);
5028 else if (offset == 0)
5032 emit_move_insn (to_rtx, datum);
5039 offset += set_word_size / BITS_PER_UNIT;
5044 /* Don't bother clearing storage if the set is all ones. */
5045 if (TREE_CHAIN (elt) != NULL_TREE
5046 || (TREE_PURPOSE (elt) == NULL_TREE
5048 : ( ! host_integerp (TREE_VALUE (elt), 0)
5049 || ! host_integerp (TREE_PURPOSE (elt), 0)
5050 || (tree_low_cst (TREE_VALUE (elt), 0)
5051 - tree_low_cst (TREE_PURPOSE (elt), 0) + 1
5052 != (HOST_WIDE_INT) nbits))))
5053 clear_storage (target, expr_size (exp));
5055 for (; elt != NULL_TREE; elt = TREE_CHAIN (elt))
5057 /* Start of range of element or NULL. */
5058 tree startbit = TREE_PURPOSE (elt);
5059 /* End of range of element, or element value. */
5060 tree endbit = TREE_VALUE (elt);
5061 #ifdef TARGET_MEM_FUNCTIONS
5062 HOST_WIDE_INT startb, endb;
5064 rtx bitlength_rtx, startbit_rtx, endbit_rtx, targetx;
5066 bitlength_rtx = expand_expr (bitlength,
5067 NULL_RTX, MEM, EXPAND_CONST_ADDRESS);
5069 /* Handle non-range tuple element like [ expr ]. */
5070 if (startbit == NULL_TREE)
5072 startbit = save_expr (endbit);
5076 startbit = convert (sizetype, startbit);
5077 endbit = convert (sizetype, endbit);
5078 if (! integer_zerop (domain_min))
5080 startbit = size_binop (MINUS_EXPR, startbit, domain_min);
5081 endbit = size_binop (MINUS_EXPR, endbit, domain_min);
5083 startbit_rtx = expand_expr (startbit, NULL_RTX, MEM,
5084 EXPAND_CONST_ADDRESS);
5085 endbit_rtx = expand_expr (endbit, NULL_RTX, MEM,
5086 EXPAND_CONST_ADDRESS);
5092 ((build_qualified_type ((*lang_hooks.types.type_for_mode)
5093 (GET_MODE (target), 0),
5096 emit_move_insn (targetx, target);
5099 else if (GET_CODE (target) == MEM)
5104 #ifdef TARGET_MEM_FUNCTIONS
5105 /* Optimization: If startbit and endbit are
5106 constants divisible by BITS_PER_UNIT,
5107 call memset instead. */
5108 if (TREE_CODE (startbit) == INTEGER_CST
5109 && TREE_CODE (endbit) == INTEGER_CST
5110 && (startb = TREE_INT_CST_LOW (startbit)) % BITS_PER_UNIT == 0
5111 && (endb = TREE_INT_CST_LOW (endbit) + 1) % BITS_PER_UNIT == 0)
5113 emit_library_call (memset_libfunc, LCT_NORMAL,
5115 plus_constant (XEXP (targetx, 0),
5116 startb / BITS_PER_UNIT),
5118 constm1_rtx, TYPE_MODE (integer_type_node),
5119 GEN_INT ((endb - startb) / BITS_PER_UNIT),
5120 TYPE_MODE (sizetype));
5124 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__setbits"),
5125 LCT_NORMAL, VOIDmode, 4, XEXP (targetx, 0),
5126 Pmode, bitlength_rtx, TYPE_MODE (sizetype),
5127 startbit_rtx, TYPE_MODE (sizetype),
5128 endbit_rtx, TYPE_MODE (sizetype));
5131 emit_move_insn (target, targetx);
5139 /* Store the value of EXP (an expression tree)
5140 into a subfield of TARGET which has mode MODE and occupies
5141 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5142 If MODE is VOIDmode, it means that we are storing into a bit-field.
5144 If VALUE_MODE is VOIDmode, return nothing in particular.
5145 UNSIGNEDP is not used in this case.
5147 Otherwise, return an rtx for the value stored. This rtx
5148 has mode VALUE_MODE if that is convenient to do.
5149 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
5151 TYPE is the type of the underlying object,
5153 ALIAS_SET is the alias set for the destination. This value will
5154 (in general) be different from that for TARGET, since TARGET is a
5155 reference to the containing structure. */
5158 store_field (target, bitsize, bitpos, mode, exp, value_mode, unsignedp, type,
5161 HOST_WIDE_INT bitsize;
5162 HOST_WIDE_INT bitpos;
5163 enum machine_mode mode;
5165 enum machine_mode value_mode;
5170 HOST_WIDE_INT width_mask = 0;
5172 if (TREE_CODE (exp) == ERROR_MARK)
5175 /* If we have nothing to store, do nothing unless the expression has
5178 return expand_expr (exp, const0_rtx, VOIDmode, 0);
5179 else if (bitsize >=0 && bitsize < HOST_BITS_PER_WIDE_INT)
5180 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5182 /* If we are storing into an unaligned field of an aligned union that is
5183 in a register, we may have the mode of TARGET being an integer mode but
5184 MODE == BLKmode. In that case, get an aligned object whose size and
5185 alignment are the same as TARGET and store TARGET into it (we can avoid
5186 the store if the field being stored is the entire width of TARGET). Then
5187 call ourselves recursively to store the field into a BLKmode version of
5188 that object. Finally, load from the object into TARGET. This is not
5189 very efficient in general, but should only be slightly more expensive
5190 than the otherwise-required unaligned accesses. Perhaps this can be
5191 cleaned up later. */
5194 && (GET_CODE (target) == REG || GET_CODE (target) == SUBREG))
5198 (build_qualified_type (type, TYPE_QUALS (type) | TYPE_QUAL_CONST),
5200 rtx blk_object = adjust_address (object, BLKmode, 0);
5202 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5203 emit_move_insn (object, target);
5205 store_field (blk_object, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
5208 emit_move_insn (target, object);
5210 /* We want to return the BLKmode version of the data. */
5214 if (GET_CODE (target) == CONCAT)
5216 /* We're storing into a struct containing a single __complex. */
5220 return store_expr (exp, target, 0);
5223 /* If the structure is in a register or if the component
5224 is a bit field, we cannot use addressing to access it.
5225 Use bit-field techniques or SUBREG to store in it. */
5227 if (mode == VOIDmode
5228 || (mode != BLKmode && ! direct_store[(int) mode]
5229 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5230 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5231 || GET_CODE (target) == REG
5232 || GET_CODE (target) == SUBREG
5233 /* If the field isn't aligned enough to store as an ordinary memref,
5234 store it as a bit field. */
5235 || (mode != BLKmode && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target))
5236 && (MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode)
5237 || bitpos % GET_MODE_ALIGNMENT (mode)))
5238 /* If the RHS and field are a constant size and the size of the
5239 RHS isn't the same size as the bitfield, we must use bitfield
5242 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5243 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5245 rtx temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5247 /* If BITSIZE is narrower than the size of the type of EXP
5248 we will be narrowing TEMP. Normally, what's wanted are the
5249 low-order bits. However, if EXP's type is a record and this is
5250 big-endian machine, we want the upper BITSIZE bits. */
5251 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5252 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5253 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5254 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5255 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5259 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5261 if (mode != VOIDmode && mode != BLKmode
5262 && mode != TYPE_MODE (TREE_TYPE (exp)))
5263 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5265 /* If the modes of TARGET and TEMP are both BLKmode, both
5266 must be in memory and BITPOS must be aligned on a byte
5267 boundary. If so, we simply do a block copy. */
5268 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5270 if (GET_CODE (target) != MEM || GET_CODE (temp) != MEM
5271 || bitpos % BITS_PER_UNIT != 0)
5274 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5275 emit_block_move (target, temp,
5276 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5279 return value_mode == VOIDmode ? const0_rtx : target;
5282 /* Store the value in the bitfield. */
5283 store_bit_field (target, bitsize, bitpos, mode, temp,
5284 int_size_in_bytes (type));
5286 if (value_mode != VOIDmode)
5288 /* The caller wants an rtx for the value.
5289 If possible, avoid refetching from the bitfield itself. */
5291 && ! (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)))
5294 enum machine_mode tmode;
5296 tmode = GET_MODE (temp);
5297 if (tmode == VOIDmode)
5301 return expand_and (tmode, temp,
5302 gen_int_mode (width_mask, tmode),
5305 count = build_int_2 (GET_MODE_BITSIZE (tmode) - bitsize, 0);
5306 temp = expand_shift (LSHIFT_EXPR, tmode, temp, count, 0, 0);
5307 return expand_shift (RSHIFT_EXPR, tmode, temp, count, 0, 0);
5310 return extract_bit_field (target, bitsize, bitpos, unsignedp,
5311 NULL_RTX, value_mode, VOIDmode,
5312 int_size_in_bytes (type));
5318 rtx addr = XEXP (target, 0);
5319 rtx to_rtx = target;
5321 /* If a value is wanted, it must be the lhs;
5322 so make the address stable for multiple use. */
5324 if (value_mode != VOIDmode && GET_CODE (addr) != REG
5325 && ! CONSTANT_ADDRESS_P (addr)
5326 /* A frame-pointer reference is already stable. */
5327 && ! (GET_CODE (addr) == PLUS
5328 && GET_CODE (XEXP (addr, 1)) == CONST_INT
5329 && (XEXP (addr, 0) == virtual_incoming_args_rtx
5330 || XEXP (addr, 0) == virtual_stack_vars_rtx)))
5331 to_rtx = replace_equiv_address (to_rtx, copy_to_reg (addr));
5333 /* Now build a reference to just the desired component. */
5335 to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5337 if (to_rtx == target)
5338 to_rtx = copy_rtx (to_rtx);
5340 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5341 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5342 set_mem_alias_set (to_rtx, alias_set);
5344 return store_expr (exp, to_rtx, value_mode != VOIDmode);
5348 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5349 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5350 codes and find the ultimate containing object, which we return.
5352 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5353 bit position, and *PUNSIGNEDP to the signedness of the field.
5354 If the position of the field is variable, we store a tree
5355 giving the variable offset (in units) in *POFFSET.
5356 This offset is in addition to the bit position.
5357 If the position is not variable, we store 0 in *POFFSET.
5359 If any of the extraction expressions is volatile,
5360 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5362 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5363 is a mode that can be used to access the field. In that case, *PBITSIZE
5366 If the field describes a variable-sized object, *PMODE is set to
5367 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5368 this case, but the address of the object can be found. */
5371 get_inner_reference (exp, pbitsize, pbitpos, poffset, pmode,
5372 punsignedp, pvolatilep)
5374 HOST_WIDE_INT *pbitsize;
5375 HOST_WIDE_INT *pbitpos;
5377 enum machine_mode *pmode;
5382 enum machine_mode mode = VOIDmode;
5383 tree offset = size_zero_node;
5384 tree bit_offset = bitsize_zero_node;
5385 tree placeholder_ptr = 0;
5388 /* First get the mode, signedness, and size. We do this from just the
5389 outermost expression. */
5390 if (TREE_CODE (exp) == COMPONENT_REF)
5392 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5393 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5394 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5396 *punsignedp = TREE_UNSIGNED (TREE_OPERAND (exp, 1));
5398 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5400 size_tree = TREE_OPERAND (exp, 1);
5401 *punsignedp = TREE_UNSIGNED (exp);
5405 mode = TYPE_MODE (TREE_TYPE (exp));
5406 *punsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
5408 if (mode == BLKmode)
5409 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5411 *pbitsize = GET_MODE_BITSIZE (mode);
5416 if (! host_integerp (size_tree, 1))
5417 mode = BLKmode, *pbitsize = -1;
5419 *pbitsize = tree_low_cst (size_tree, 1);
5422 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5423 and find the ultimate containing object. */
5426 if (TREE_CODE (exp) == BIT_FIELD_REF)
5427 bit_offset = size_binop (PLUS_EXPR, bit_offset, TREE_OPERAND (exp, 2));
5428 else if (TREE_CODE (exp) == COMPONENT_REF)
5430 tree field = TREE_OPERAND (exp, 1);
5431 tree this_offset = DECL_FIELD_OFFSET (field);
5433 /* If this field hasn't been filled in yet, don't go
5434 past it. This should only happen when folding expressions
5435 made during type construction. */
5436 if (this_offset == 0)
5438 else if (! TREE_CONSTANT (this_offset)
5439 && contains_placeholder_p (this_offset))
5440 this_offset = build (WITH_RECORD_EXPR, sizetype, this_offset, exp);
5442 offset = size_binop (PLUS_EXPR, offset, this_offset);
5443 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5444 DECL_FIELD_BIT_OFFSET (field));
5446 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5449 else if (TREE_CODE (exp) == ARRAY_REF
5450 || TREE_CODE (exp) == ARRAY_RANGE_REF)
5452 tree index = TREE_OPERAND (exp, 1);
5453 tree array = TREE_OPERAND (exp, 0);
5454 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
5455 tree low_bound = (domain ? TYPE_MIN_VALUE (domain) : 0);
5456 tree unit_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (array)));
5458 /* We assume all arrays have sizes that are a multiple of a byte.
5459 First subtract the lower bound, if any, in the type of the
5460 index, then convert to sizetype and multiply by the size of the
5462 if (low_bound != 0 && ! integer_zerop (low_bound))
5463 index = fold (build (MINUS_EXPR, TREE_TYPE (index),
5466 /* If the index has a self-referential type, pass it to a
5467 WITH_RECORD_EXPR; if the component size is, pass our
5468 component to one. */
5469 if (! TREE_CONSTANT (index)
5470 && contains_placeholder_p (index))
5471 index = build (WITH_RECORD_EXPR, TREE_TYPE (index), index, exp);
5472 if (! TREE_CONSTANT (unit_size)
5473 && contains_placeholder_p (unit_size))
5474 unit_size = build (WITH_RECORD_EXPR, sizetype, unit_size, array);
5476 offset = size_binop (PLUS_EXPR, offset,
5477 size_binop (MULT_EXPR,
5478 convert (sizetype, index),
5482 else if (TREE_CODE (exp) == PLACEHOLDER_EXPR)
5484 tree new = find_placeholder (exp, &placeholder_ptr);
5486 /* If we couldn't find the replacement, return the PLACEHOLDER_EXPR.
5487 We might have been called from tree optimization where we
5488 haven't set up an object yet. */
5496 else if (TREE_CODE (exp) != NON_LVALUE_EXPR
5497 && TREE_CODE (exp) != VIEW_CONVERT_EXPR
5498 && ! ((TREE_CODE (exp) == NOP_EXPR
5499 || TREE_CODE (exp) == CONVERT_EXPR)
5500 && (TYPE_MODE (TREE_TYPE (exp))
5501 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
5504 /* If any reference in the chain is volatile, the effect is volatile. */
5505 if (TREE_THIS_VOLATILE (exp))
5508 exp = TREE_OPERAND (exp, 0);
5511 /* If OFFSET is constant, see if we can return the whole thing as a
5512 constant bit position. Otherwise, split it up. */
5513 if (host_integerp (offset, 0)
5514 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5516 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5517 && host_integerp (tem, 0))
5518 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5520 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5526 /* Return 1 if T is an expression that get_inner_reference handles. */
5529 handled_component_p (t)
5532 switch (TREE_CODE (t))
5537 case ARRAY_RANGE_REF:
5538 case NON_LVALUE_EXPR:
5539 case VIEW_CONVERT_EXPR:
5544 return (TYPE_MODE (TREE_TYPE (t))
5545 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (t, 0))));
5552 /* Given an rtx VALUE that may contain additions and multiplications, return
5553 an equivalent value that just refers to a register, memory, or constant.
5554 This is done by generating instructions to perform the arithmetic and
5555 returning a pseudo-register containing the value.
5557 The returned value may be a REG, SUBREG, MEM or constant. */
5560 force_operand (value, target)
5564 /* Use subtarget as the target for operand 0 of a binary operation. */
5565 rtx subtarget = get_subtarget (target);
5566 enum rtx_code code = GET_CODE (value);
5568 /* Check for a PIC address load. */
5569 if ((code == PLUS || code == MINUS)
5570 && XEXP (value, 0) == pic_offset_table_rtx
5571 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5572 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5573 || GET_CODE (XEXP (value, 1)) == CONST))
5576 subtarget = gen_reg_rtx (GET_MODE (value));
5577 emit_move_insn (subtarget, value);
5581 if (code == ZERO_EXTEND || code == SIGN_EXTEND)
5584 target = gen_reg_rtx (GET_MODE (value));
5585 convert_move (target, force_operand (XEXP (value, 0), NULL),
5586 code == ZERO_EXTEND);
5590 if (GET_RTX_CLASS (code) == '2' || GET_RTX_CLASS (code) == 'c')
5592 op2 = XEXP (value, 1);
5593 if (!CONSTANT_P (op2) && !(GET_CODE (op2) == REG && op2 != subtarget))
5595 if (code == MINUS && GET_CODE (op2) == CONST_INT)
5598 op2 = negate_rtx (GET_MODE (value), op2);
5601 /* Check for an addition with OP2 a constant integer and our first
5602 operand a PLUS of a virtual register and something else. In that
5603 case, we want to emit the sum of the virtual register and the
5604 constant first and then add the other value. This allows virtual
5605 register instantiation to simply modify the constant rather than
5606 creating another one around this addition. */
5607 if (code == PLUS && GET_CODE (op2) == CONST_INT
5608 && GET_CODE (XEXP (value, 0)) == PLUS
5609 && GET_CODE (XEXP (XEXP (value, 0), 0)) == REG
5610 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5611 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5613 rtx temp = expand_simple_binop (GET_MODE (value), code,
5614 XEXP (XEXP (value, 0), 0), op2,
5615 subtarget, 0, OPTAB_LIB_WIDEN);
5616 return expand_simple_binop (GET_MODE (value), code, temp,
5617 force_operand (XEXP (XEXP (value,
5619 target, 0, OPTAB_LIB_WIDEN);
5622 op1 = force_operand (XEXP (value, 0), subtarget);
5623 op2 = force_operand (op2, NULL_RTX);
5627 return expand_mult (GET_MODE (value), op1, op2, target, 1);
5629 if (!INTEGRAL_MODE_P (GET_MODE (value)))
5630 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5631 target, 1, OPTAB_LIB_WIDEN);
5633 return expand_divmod (0,
5634 FLOAT_MODE_P (GET_MODE (value))
5635 ? RDIV_EXPR : TRUNC_DIV_EXPR,
5636 GET_MODE (value), op1, op2, target, 0);
5639 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5643 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
5647 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5651 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5652 target, 0, OPTAB_LIB_WIDEN);
5655 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5656 target, 1, OPTAB_LIB_WIDEN);
5659 if (GET_RTX_CLASS (code) == '1')
5661 op1 = force_operand (XEXP (value, 0), NULL_RTX);
5662 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
5665 #ifdef INSN_SCHEDULING
5666 /* On machines that have insn scheduling, we want all memory reference to be
5667 explicit, so we need to deal with such paradoxical SUBREGs. */
5668 if (GET_CODE (value) == SUBREG && GET_CODE (SUBREG_REG (value)) == MEM
5669 && (GET_MODE_SIZE (GET_MODE (value))
5670 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
5672 = simplify_gen_subreg (GET_MODE (value),
5673 force_reg (GET_MODE (SUBREG_REG (value)),
5674 force_operand (SUBREG_REG (value),
5676 GET_MODE (SUBREG_REG (value)),
5677 SUBREG_BYTE (value));
5683 /* Subroutine of expand_expr: return nonzero iff there is no way that
5684 EXP can reference X, which is being modified. TOP_P is nonzero if this
5685 call is going to be used to determine whether we need a temporary
5686 for EXP, as opposed to a recursive call to this function.
5688 It is always safe for this routine to return zero since it merely
5689 searches for optimization opportunities. */
5692 safe_from_p (x, exp, top_p)
5699 static tree save_expr_list;
5702 /* If EXP has varying size, we MUST use a target since we currently
5703 have no way of allocating temporaries of variable size
5704 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5705 So we assume here that something at a higher level has prevented a
5706 clash. This is somewhat bogus, but the best we can do. Only
5707 do this when X is BLKmode and when we are at the top level. */
5708 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5709 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5710 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5711 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5712 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5714 && GET_MODE (x) == BLKmode)
5715 /* If X is in the outgoing argument area, it is always safe. */
5716 || (GET_CODE (x) == MEM
5717 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5718 || (GET_CODE (XEXP (x, 0)) == PLUS
5719 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5722 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5723 find the underlying pseudo. */
5724 if (GET_CODE (x) == SUBREG)
5727 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5731 /* A SAVE_EXPR might appear many times in the expression passed to the
5732 top-level safe_from_p call, and if it has a complex subexpression,
5733 examining it multiple times could result in a combinatorial explosion.
5734 E.g. on an Alpha running at least 200MHz, a Fortran test case compiled
5735 with optimization took about 28 minutes to compile -- even though it was
5736 only a few lines long. So we mark each SAVE_EXPR we see with TREE_PRIVATE
5737 and turn that off when we are done. We keep a list of the SAVE_EXPRs
5738 we have processed. Note that the only test of top_p was above. */
5747 rtn = safe_from_p (x, exp, 0);
5749 for (t = save_expr_list; t != 0; t = TREE_CHAIN (t))
5750 TREE_PRIVATE (TREE_PURPOSE (t)) = 0;
5755 /* Now look at our tree code and possibly recurse. */
5756 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5759 exp_rtl = DECL_RTL_IF_SET (exp);
5766 if (TREE_CODE (exp) == TREE_LIST)
5767 return ((TREE_VALUE (exp) == 0
5768 || safe_from_p (x, TREE_VALUE (exp), 0))
5769 && (TREE_CHAIN (exp) == 0
5770 || safe_from_p (x, TREE_CHAIN (exp), 0)));
5771 else if (TREE_CODE (exp) == ERROR_MARK)
5772 return 1; /* An already-visited SAVE_EXPR? */
5777 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5781 return (safe_from_p (x, TREE_OPERAND (exp, 0), 0)
5782 && safe_from_p (x, TREE_OPERAND (exp, 1), 0));
5786 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5787 the expression. If it is set, we conflict iff we are that rtx or
5788 both are in memory. Otherwise, we check all operands of the
5789 expression recursively. */
5791 switch (TREE_CODE (exp))
5794 /* If the operand is static or we are static, we can't conflict.
5795 Likewise if we don't conflict with the operand at all. */
5796 if (staticp (TREE_OPERAND (exp, 0))
5797 || TREE_STATIC (exp)
5798 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5801 /* Otherwise, the only way this can conflict is if we are taking
5802 the address of a DECL a that address if part of X, which is
5804 exp = TREE_OPERAND (exp, 0);
5807 if (!DECL_RTL_SET_P (exp)
5808 || GET_CODE (DECL_RTL (exp)) != MEM)
5811 exp_rtl = XEXP (DECL_RTL (exp), 0);
5816 if (GET_CODE (x) == MEM
5817 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5818 get_alias_set (exp)))
5823 /* Assume that the call will clobber all hard registers and
5825 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5826 || GET_CODE (x) == MEM)
5831 /* If a sequence exists, we would have to scan every instruction
5832 in the sequence to see if it was safe. This is probably not
5834 if (RTL_EXPR_SEQUENCE (exp))
5837 exp_rtl = RTL_EXPR_RTL (exp);
5840 case WITH_CLEANUP_EXPR:
5841 exp_rtl = WITH_CLEANUP_EXPR_RTL (exp);
5844 case CLEANUP_POINT_EXPR:
5845 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5848 exp_rtl = SAVE_EXPR_RTL (exp);
5852 /* If we've already scanned this, don't do it again. Otherwise,
5853 show we've scanned it and record for clearing the flag if we're
5855 if (TREE_PRIVATE (exp))
5858 TREE_PRIVATE (exp) = 1;
5859 if (! safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5861 TREE_PRIVATE (exp) = 0;
5865 save_expr_list = tree_cons (exp, NULL_TREE, save_expr_list);
5869 /* The only operand we look at is operand 1. The rest aren't
5870 part of the expression. */
5871 return safe_from_p (x, TREE_OPERAND (exp, 1), 0);
5873 case METHOD_CALL_EXPR:
5874 /* This takes an rtx argument, but shouldn't appear here. */
5881 /* If we have an rtx, we do not need to scan our operands. */
5885 nops = first_rtl_op (TREE_CODE (exp));
5886 for (i = 0; i < nops; i++)
5887 if (TREE_OPERAND (exp, i) != 0
5888 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5891 /* If this is a language-specific tree code, it may require
5892 special handling. */
5893 if ((unsigned int) TREE_CODE (exp)
5894 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5895 && !(*lang_hooks.safe_from_p) (x, exp))
5899 /* If we have an rtl, find any enclosed object. Then see if we conflict
5903 if (GET_CODE (exp_rtl) == SUBREG)
5905 exp_rtl = SUBREG_REG (exp_rtl);
5906 if (GET_CODE (exp_rtl) == REG
5907 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5911 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5912 are memory and they conflict. */
5913 return ! (rtx_equal_p (x, exp_rtl)
5914 || (GET_CODE (x) == MEM && GET_CODE (exp_rtl) == MEM
5915 && true_dependence (exp_rtl, VOIDmode, x,
5916 rtx_addr_varies_p)));
5919 /* If we reach here, it is safe. */
5923 /* Subroutine of expand_expr: return rtx if EXP is a
5924 variable or parameter; else return 0. */
5931 switch (TREE_CODE (exp))
5935 return DECL_RTL (exp);
5941 #ifdef MAX_INTEGER_COMPUTATION_MODE
5944 check_max_integer_computation_mode (exp)
5947 enum tree_code code;
5948 enum machine_mode mode;
5950 /* Strip any NOPs that don't change the mode. */
5952 code = TREE_CODE (exp);
5954 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
5955 if (code == NOP_EXPR
5956 && TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
5959 /* First check the type of the overall operation. We need only look at
5960 unary, binary and relational operations. */
5961 if (TREE_CODE_CLASS (code) == '1'
5962 || TREE_CODE_CLASS (code) == '2'
5963 || TREE_CODE_CLASS (code) == '<')
5965 mode = TYPE_MODE (TREE_TYPE (exp));
5966 if (GET_MODE_CLASS (mode) == MODE_INT
5967 && mode > MAX_INTEGER_COMPUTATION_MODE)
5968 internal_error ("unsupported wide integer operation");
5971 /* Check operand of a unary op. */
5972 if (TREE_CODE_CLASS (code) == '1')
5974 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5975 if (GET_MODE_CLASS (mode) == MODE_INT
5976 && mode > MAX_INTEGER_COMPUTATION_MODE)
5977 internal_error ("unsupported wide integer operation");
5980 /* Check operands of a binary/comparison op. */
5981 if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<')
5983 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5984 if (GET_MODE_CLASS (mode) == MODE_INT
5985 && mode > MAX_INTEGER_COMPUTATION_MODE)
5986 internal_error ("unsupported wide integer operation");
5988 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1)));
5989 if (GET_MODE_CLASS (mode) == MODE_INT
5990 && mode > MAX_INTEGER_COMPUTATION_MODE)
5991 internal_error ("unsupported wide integer operation");
5996 /* Return the highest power of two that EXP is known to be a multiple of.
5997 This is used in updating alignment of MEMs in array references. */
5999 static HOST_WIDE_INT
6000 highest_pow2_factor (exp)
6003 HOST_WIDE_INT c0, c1;
6005 switch (TREE_CODE (exp))
6008 /* We can find the lowest bit that's a one. If the low
6009 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6010 We need to handle this case since we can find it in a COND_EXPR,
6011 a MIN_EXPR, or a MAX_EXPR. If the constant overlows, we have an
6012 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6014 if (TREE_CONSTANT_OVERFLOW (exp))
6015 return BIGGEST_ALIGNMENT;
6018 /* Note: tree_low_cst is intentionally not used here,
6019 we don't care about the upper bits. */
6020 c0 = TREE_INT_CST_LOW (exp);
6022 return c0 ? c0 : BIGGEST_ALIGNMENT;
6026 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6027 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6028 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6029 return MIN (c0, c1);
6032 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6033 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6036 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6038 if (integer_pow2p (TREE_OPERAND (exp, 1))
6039 && host_integerp (TREE_OPERAND (exp, 1), 1))
6041 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6042 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6043 return MAX (1, c0 / c1);
6047 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
6048 case SAVE_EXPR: case WITH_RECORD_EXPR:
6049 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6052 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6055 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6056 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6057 return MIN (c0, c1);
6066 /* Similar, except that it is known that the expression must be a multiple
6067 of the alignment of TYPE. */
6069 static HOST_WIDE_INT
6070 highest_pow2_factor_for_type (type, exp)
6074 HOST_WIDE_INT type_align, factor;
6076 factor = highest_pow2_factor (exp);
6077 type_align = TYPE_ALIGN (type) / BITS_PER_UNIT;
6078 return MAX (factor, type_align);
6081 /* Return an object on the placeholder list that matches EXP, a
6082 PLACEHOLDER_EXPR. An object "matches" if it is of the type of the
6083 PLACEHOLDER_EXPR or a pointer type to it. For further information, see
6084 tree.def. If no such object is found, return 0. If PLIST is nonzero, it
6085 is a location which initially points to a starting location in the
6086 placeholder list (zero means start of the list) and where a pointer into
6087 the placeholder list at which the object is found is placed. */
6090 find_placeholder (exp, plist)
6094 tree type = TREE_TYPE (exp);
6095 tree placeholder_expr;
6097 for (placeholder_expr
6098 = plist && *plist ? TREE_CHAIN (*plist) : placeholder_list;
6099 placeholder_expr != 0;
6100 placeholder_expr = TREE_CHAIN (placeholder_expr))
6102 tree need_type = TYPE_MAIN_VARIANT (type);
6105 /* Find the outermost reference that is of the type we want. If none,
6106 see if any object has a type that is a pointer to the type we
6108 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
6109 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
6110 || TREE_CODE (elt) == COND_EXPR)
6111 ? TREE_OPERAND (elt, 1)
6112 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6113 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6114 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6115 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6116 ? TREE_OPERAND (elt, 0) : 0))
6117 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
6120 *plist = placeholder_expr;
6124 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
6126 = ((TREE_CODE (elt) == COMPOUND_EXPR
6127 || TREE_CODE (elt) == COND_EXPR)
6128 ? TREE_OPERAND (elt, 1)
6129 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6130 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6131 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6132 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6133 ? TREE_OPERAND (elt, 0) : 0))
6134 if (POINTER_TYPE_P (TREE_TYPE (elt))
6135 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
6139 *plist = placeholder_expr;
6140 return build1 (INDIRECT_REF, need_type, elt);
6147 /* expand_expr: generate code for computing expression EXP.
6148 An rtx for the computed value is returned. The value is never null.
6149 In the case of a void EXP, const0_rtx is returned.
6151 The value may be stored in TARGET if TARGET is nonzero.
6152 TARGET is just a suggestion; callers must assume that
6153 the rtx returned may not be the same as TARGET.
6155 If TARGET is CONST0_RTX, it means that the value will be ignored.
6157 If TMODE is not VOIDmode, it suggests generating the
6158 result in mode TMODE. But this is done only when convenient.
6159 Otherwise, TMODE is ignored and the value generated in its natural mode.
6160 TMODE is just a suggestion; callers must assume that
6161 the rtx returned may not have mode TMODE.
6163 Note that TARGET may have neither TMODE nor MODE. In that case, it
6164 probably will not be used.
6166 If MODIFIER is EXPAND_SUM then when EXP is an addition
6167 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6168 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6169 products as above, or REG or MEM, or constant.
6170 Ordinarily in such cases we would output mul or add instructions
6171 and then return a pseudo reg containing the sum.
6173 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6174 it also marks a label as absolutely required (it can't be dead).
6175 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6176 This is used for outputting expressions used in initializers.
6178 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6179 with a constant address even if that address is not normally legitimate.
6180 EXPAND_INITIALIZER and EXPAND_SUM also have this effect. */
6183 expand_expr (exp, target, tmode, modifier)
6186 enum machine_mode tmode;
6187 enum expand_modifier modifier;
6190 tree type = TREE_TYPE (exp);
6191 int unsignedp = TREE_UNSIGNED (type);
6192 enum machine_mode mode;
6193 enum tree_code code = TREE_CODE (exp);
6195 rtx subtarget, original_target;
6199 /* Handle ERROR_MARK before anybody tries to access its type. */
6200 if (TREE_CODE (exp) == ERROR_MARK || TREE_CODE (type) == ERROR_MARK)
6202 op0 = CONST0_RTX (tmode);
6208 mode = TYPE_MODE (type);
6209 /* Use subtarget as the target for operand 0 of a binary operation. */
6210 subtarget = get_subtarget (target);
6211 original_target = target;
6212 ignore = (target == const0_rtx
6213 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6214 || code == CONVERT_EXPR || code == REFERENCE_EXPR
6215 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
6216 && TREE_CODE (type) == VOID_TYPE));
6218 /* If we are going to ignore this result, we need only do something
6219 if there is a side-effect somewhere in the expression. If there
6220 is, short-circuit the most common cases here. Note that we must
6221 not call expand_expr with anything but const0_rtx in case this
6222 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6226 if (! TREE_SIDE_EFFECTS (exp))
6229 /* Ensure we reference a volatile object even if value is ignored, but
6230 don't do this if all we are doing is taking its address. */
6231 if (TREE_THIS_VOLATILE (exp)
6232 && TREE_CODE (exp) != FUNCTION_DECL
6233 && mode != VOIDmode && mode != BLKmode
6234 && modifier != EXPAND_CONST_ADDRESS)
6236 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6237 if (GET_CODE (temp) == MEM)
6238 temp = copy_to_reg (temp);
6242 if (TREE_CODE_CLASS (code) == '1' || code == COMPONENT_REF
6243 || code == INDIRECT_REF || code == BUFFER_REF)
6244 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6247 else if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<'
6248 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6250 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6251 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6254 else if ((code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6255 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
6256 /* If the second operand has no side effects, just evaluate
6258 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6260 else if (code == BIT_FIELD_REF)
6262 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6263 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6264 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6271 #ifdef MAX_INTEGER_COMPUTATION_MODE
6272 /* Only check stuff here if the mode we want is different from the mode
6273 of the expression; if it's the same, check_max_integer_computiation_mode
6274 will handle it. Do we really need to check this stuff at all? */
6277 && GET_MODE (target) != mode
6278 && TREE_CODE (exp) != INTEGER_CST
6279 && TREE_CODE (exp) != PARM_DECL
6280 && TREE_CODE (exp) != ARRAY_REF
6281 && TREE_CODE (exp) != ARRAY_RANGE_REF
6282 && TREE_CODE (exp) != COMPONENT_REF
6283 && TREE_CODE (exp) != BIT_FIELD_REF
6284 && TREE_CODE (exp) != INDIRECT_REF
6285 && TREE_CODE (exp) != CALL_EXPR
6286 && TREE_CODE (exp) != VAR_DECL
6287 && TREE_CODE (exp) != RTL_EXPR)
6289 enum machine_mode mode = GET_MODE (target);
6291 if (GET_MODE_CLASS (mode) == MODE_INT
6292 && mode > MAX_INTEGER_COMPUTATION_MODE)
6293 internal_error ("unsupported wide integer operation");
6297 && TREE_CODE (exp) != INTEGER_CST
6298 && TREE_CODE (exp) != PARM_DECL
6299 && TREE_CODE (exp) != ARRAY_REF
6300 && TREE_CODE (exp) != ARRAY_RANGE_REF
6301 && TREE_CODE (exp) != COMPONENT_REF
6302 && TREE_CODE (exp) != BIT_FIELD_REF
6303 && TREE_CODE (exp) != INDIRECT_REF
6304 && TREE_CODE (exp) != VAR_DECL
6305 && TREE_CODE (exp) != CALL_EXPR
6306 && TREE_CODE (exp) != RTL_EXPR
6307 && GET_MODE_CLASS (tmode) == MODE_INT
6308 && tmode > MAX_INTEGER_COMPUTATION_MODE)
6309 internal_error ("unsupported wide integer operation");
6311 check_max_integer_computation_mode (exp);
6314 /* If will do cse, generate all results into pseudo registers
6315 since 1) that allows cse to find more things
6316 and 2) otherwise cse could produce an insn the machine
6317 cannot support. And exception is a CONSTRUCTOR into a multi-word
6318 MEM: that's much more likely to be most efficient into the MEM. */
6320 if (! cse_not_expected && mode != BLKmode && target
6321 && (GET_CODE (target) != REG || REGNO (target) < FIRST_PSEUDO_REGISTER)
6322 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD))
6329 tree function = decl_function_context (exp);
6330 /* Handle using a label in a containing function. */
6331 if (function != current_function_decl
6332 && function != inline_function_decl && function != 0)
6334 struct function *p = find_function_data (function);
6335 p->expr->x_forced_labels
6336 = gen_rtx_EXPR_LIST (VOIDmode, label_rtx (exp),
6337 p->expr->x_forced_labels);
6341 if (modifier == EXPAND_INITIALIZER)
6342 forced_labels = gen_rtx_EXPR_LIST (VOIDmode,
6347 temp = gen_rtx_MEM (FUNCTION_MODE,
6348 gen_rtx_LABEL_REF (Pmode, label_rtx (exp)));
6349 if (function != current_function_decl
6350 && function != inline_function_decl && function != 0)
6351 LABEL_REF_NONLOCAL_P (XEXP (temp, 0)) = 1;
6356 if (DECL_RTL (exp) == 0)
6358 error_with_decl (exp, "prior parameter's size depends on `%s'");
6359 return CONST0_RTX (mode);
6362 /* ... fall through ... */
6365 /* If a static var's type was incomplete when the decl was written,
6366 but the type is complete now, lay out the decl now. */
6367 if (DECL_SIZE (exp) == 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6368 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6370 rtx value = DECL_RTL_IF_SET (exp);
6372 layout_decl (exp, 0);
6374 /* If the RTL was already set, update its mode and memory
6378 PUT_MODE (value, DECL_MODE (exp));
6379 SET_DECL_RTL (exp, 0);
6380 set_mem_attributes (value, exp, 1);
6381 SET_DECL_RTL (exp, value);
6385 /* ... fall through ... */
6389 if (DECL_RTL (exp) == 0)
6392 /* Ensure variable marked as used even if it doesn't go through
6393 a parser. If it hasn't be used yet, write out an external
6395 if (! TREE_USED (exp))
6397 assemble_external (exp);
6398 TREE_USED (exp) = 1;
6401 /* Show we haven't gotten RTL for this yet. */
6404 /* Handle variables inherited from containing functions. */
6405 context = decl_function_context (exp);
6407 /* We treat inline_function_decl as an alias for the current function
6408 because that is the inline function whose vars, types, etc.
6409 are being merged into the current function.
6410 See expand_inline_function. */
6412 if (context != 0 && context != current_function_decl
6413 && context != inline_function_decl
6414 /* If var is static, we don't need a static chain to access it. */
6415 && ! (GET_CODE (DECL_RTL (exp)) == MEM
6416 && CONSTANT_P (XEXP (DECL_RTL (exp), 0))))
6420 /* Mark as non-local and addressable. */
6421 DECL_NONLOCAL (exp) = 1;
6422 if (DECL_NO_STATIC_CHAIN (current_function_decl))
6424 (*lang_hooks.mark_addressable) (exp);
6425 if (GET_CODE (DECL_RTL (exp)) != MEM)
6427 addr = XEXP (DECL_RTL (exp), 0);
6428 if (GET_CODE (addr) == MEM)
6430 = replace_equiv_address (addr,
6431 fix_lexical_addr (XEXP (addr, 0), exp));
6433 addr = fix_lexical_addr (addr, exp);
6435 temp = replace_equiv_address (DECL_RTL (exp), addr);
6438 /* This is the case of an array whose size is to be determined
6439 from its initializer, while the initializer is still being parsed.
6442 else if (GET_CODE (DECL_RTL (exp)) == MEM
6443 && GET_CODE (XEXP (DECL_RTL (exp), 0)) == REG)
6444 temp = validize_mem (DECL_RTL (exp));
6446 /* If DECL_RTL is memory, we are in the normal case and either
6447 the address is not valid or it is not a register and -fforce-addr
6448 is specified, get the address into a register. */
6450 else if (GET_CODE (DECL_RTL (exp)) == MEM
6451 && modifier != EXPAND_CONST_ADDRESS
6452 && modifier != EXPAND_SUM
6453 && modifier != EXPAND_INITIALIZER
6454 && (! memory_address_p (DECL_MODE (exp),
6455 XEXP (DECL_RTL (exp), 0))
6457 && GET_CODE (XEXP (DECL_RTL (exp), 0)) != REG)))
6458 temp = replace_equiv_address (DECL_RTL (exp),
6459 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6461 /* If we got something, return it. But first, set the alignment
6462 if the address is a register. */
6465 if (GET_CODE (temp) == MEM && GET_CODE (XEXP (temp, 0)) == REG)
6466 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6471 /* If the mode of DECL_RTL does not match that of the decl, it
6472 must be a promoted value. We return a SUBREG of the wanted mode,
6473 but mark it so that we know that it was already extended. */
6475 if (GET_CODE (DECL_RTL (exp)) == REG
6476 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6478 /* Get the signedness used for this variable. Ensure we get the
6479 same mode we got when the variable was declared. */
6480 if (GET_MODE (DECL_RTL (exp))
6481 != promote_mode (type, DECL_MODE (exp), &unsignedp,
6482 (TREE_CODE (exp) == RESULT_DECL ? 1 : 0)))
6485 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6486 SUBREG_PROMOTED_VAR_P (temp) = 1;
6487 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6491 return DECL_RTL (exp);
6494 temp = immed_double_const (TREE_INT_CST_LOW (exp),
6495 TREE_INT_CST_HIGH (exp), mode);
6497 /* ??? If overflow is set, fold will have done an incomplete job,
6498 which can result in (plus xx (const_int 0)), which can get
6499 simplified by validate_replace_rtx during virtual register
6500 instantiation, which can result in unrecognizable insns.
6501 Avoid this by forcing all overflows into registers. */
6502 if (TREE_CONSTANT_OVERFLOW (exp)
6503 && modifier != EXPAND_INITIALIZER)
6504 temp = force_reg (mode, temp);
6509 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, 0);
6512 /* If optimized, generate immediate CONST_DOUBLE
6513 which will be turned into memory by reload if necessary.
6515 We used to force a register so that loop.c could see it. But
6516 this does not allow gen_* patterns to perform optimizations with
6517 the constants. It also produces two insns in cases like "x = 1.0;".
6518 On most machines, floating-point constants are not permitted in
6519 many insns, so we'd end up copying it to a register in any case.
6521 Now, we do the copying in expand_binop, if appropriate. */
6522 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
6523 TYPE_MODE (TREE_TYPE (exp)));
6527 if (! TREE_CST_RTL (exp))
6528 output_constant_def (exp, 1);
6530 /* TREE_CST_RTL probably contains a constant address.
6531 On RISC machines where a constant address isn't valid,
6532 make some insns to get that address into a register. */
6533 if (GET_CODE (TREE_CST_RTL (exp)) == MEM
6534 && modifier != EXPAND_CONST_ADDRESS
6535 && modifier != EXPAND_INITIALIZER
6536 && modifier != EXPAND_SUM
6537 && (! memory_address_p (mode, XEXP (TREE_CST_RTL (exp), 0))
6539 && GET_CODE (XEXP (TREE_CST_RTL (exp), 0)) != REG)))
6540 return replace_equiv_address (TREE_CST_RTL (exp),
6541 copy_rtx (XEXP (TREE_CST_RTL (exp), 0)));
6542 return TREE_CST_RTL (exp);
6544 case EXPR_WITH_FILE_LOCATION:
6547 const char *saved_input_filename = input_filename;
6548 int saved_lineno = lineno;
6549 input_filename = EXPR_WFL_FILENAME (exp);
6550 lineno = EXPR_WFL_LINENO (exp);
6551 if (EXPR_WFL_EMIT_LINE_NOTE (exp))
6552 emit_line_note (input_filename, lineno);
6553 /* Possibly avoid switching back and forth here. */
6554 to_return = expand_expr (EXPR_WFL_NODE (exp), target, tmode, modifier);
6555 input_filename = saved_input_filename;
6556 lineno = saved_lineno;
6561 context = decl_function_context (exp);
6563 /* If this SAVE_EXPR was at global context, assume we are an
6564 initialization function and move it into our context. */
6566 SAVE_EXPR_CONTEXT (exp) = current_function_decl;
6568 /* We treat inline_function_decl as an alias for the current function
6569 because that is the inline function whose vars, types, etc.
6570 are being merged into the current function.
6571 See expand_inline_function. */
6572 if (context == current_function_decl || context == inline_function_decl)
6575 /* If this is non-local, handle it. */
6578 /* The following call just exists to abort if the context is
6579 not of a containing function. */
6580 find_function_data (context);
6582 temp = SAVE_EXPR_RTL (exp);
6583 if (temp && GET_CODE (temp) == REG)
6585 put_var_into_stack (exp);
6586 temp = SAVE_EXPR_RTL (exp);
6588 if (temp == 0 || GET_CODE (temp) != MEM)
6591 replace_equiv_address (temp,
6592 fix_lexical_addr (XEXP (temp, 0), exp));
6594 if (SAVE_EXPR_RTL (exp) == 0)
6596 if (mode == VOIDmode)
6599 temp = assign_temp (build_qualified_type (type,
6601 | TYPE_QUAL_CONST)),
6604 SAVE_EXPR_RTL (exp) = temp;
6605 if (!optimize && GET_CODE (temp) == REG)
6606 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, temp,
6609 /* If the mode of TEMP does not match that of the expression, it
6610 must be a promoted value. We pass store_expr a SUBREG of the
6611 wanted mode but mark it so that we know that it was already
6612 extended. Note that `unsignedp' was modified above in
6615 if (GET_CODE (temp) == REG && GET_MODE (temp) != mode)
6617 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
6618 SUBREG_PROMOTED_VAR_P (temp) = 1;
6619 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6622 if (temp == const0_rtx)
6623 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
6625 store_expr (TREE_OPERAND (exp, 0), temp, 0);
6627 TREE_USED (exp) = 1;
6630 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
6631 must be a promoted value. We return a SUBREG of the wanted mode,
6632 but mark it so that we know that it was already extended. */
6634 if (GET_CODE (SAVE_EXPR_RTL (exp)) == REG
6635 && GET_MODE (SAVE_EXPR_RTL (exp)) != mode)
6637 /* Compute the signedness and make the proper SUBREG. */
6638 promote_mode (type, mode, &unsignedp, 0);
6639 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
6640 SUBREG_PROMOTED_VAR_P (temp) = 1;
6641 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6645 return SAVE_EXPR_RTL (exp);
6650 temp = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6651 TREE_OPERAND (exp, 0)
6652 = (*lang_hooks.unsave_expr_now) (TREE_OPERAND (exp, 0));
6656 case PLACEHOLDER_EXPR:
6658 tree old_list = placeholder_list;
6659 tree placeholder_expr = 0;
6661 exp = find_placeholder (exp, &placeholder_expr);
6665 placeholder_list = TREE_CHAIN (placeholder_expr);
6666 temp = expand_expr (exp, original_target, tmode, modifier);
6667 placeholder_list = old_list;
6671 /* We can't find the object or there was a missing WITH_RECORD_EXPR. */
6674 case WITH_RECORD_EXPR:
6675 /* Put the object on the placeholder list, expand our first operand,
6676 and pop the list. */
6677 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
6679 target = expand_expr (TREE_OPERAND (exp, 0), original_target, tmode,
6681 placeholder_list = TREE_CHAIN (placeholder_list);
6685 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6686 expand_goto (TREE_OPERAND (exp, 0));
6688 expand_computed_goto (TREE_OPERAND (exp, 0));
6692 expand_exit_loop_if_false (NULL,
6693 invert_truthvalue (TREE_OPERAND (exp, 0)));
6696 case LABELED_BLOCK_EXPR:
6697 if (LABELED_BLOCK_BODY (exp))
6698 expand_expr_stmt_value (LABELED_BLOCK_BODY (exp), 0, 1);
6699 /* Should perhaps use expand_label, but this is simpler and safer. */
6700 do_pending_stack_adjust ();
6701 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp)));
6704 case EXIT_BLOCK_EXPR:
6705 if (EXIT_BLOCK_RETURN (exp))
6706 sorry ("returned value in block_exit_expr");
6707 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp)));
6712 expand_start_loop (1);
6713 expand_expr_stmt_value (TREE_OPERAND (exp, 0), 0, 1);
6721 tree vars = TREE_OPERAND (exp, 0);
6722 int vars_need_expansion = 0;
6724 /* Need to open a binding contour here because
6725 if there are any cleanups they must be contained here. */
6726 expand_start_bindings (2);
6728 /* Mark the corresponding BLOCK for output in its proper place. */
6729 if (TREE_OPERAND (exp, 2) != 0
6730 && ! TREE_USED (TREE_OPERAND (exp, 2)))
6731 (*lang_hooks.decls.insert_block) (TREE_OPERAND (exp, 2));
6733 /* If VARS have not yet been expanded, expand them now. */
6736 if (!DECL_RTL_SET_P (vars))
6738 vars_need_expansion = 1;
6741 expand_decl_init (vars);
6742 vars = TREE_CHAIN (vars);
6745 temp = expand_expr (TREE_OPERAND (exp, 1), target, tmode, modifier);
6747 expand_end_bindings (TREE_OPERAND (exp, 0), 0, 0);
6753 if (RTL_EXPR_SEQUENCE (exp))
6755 if (RTL_EXPR_SEQUENCE (exp) == const0_rtx)
6757 emit_insn (RTL_EXPR_SEQUENCE (exp));
6758 RTL_EXPR_SEQUENCE (exp) = const0_rtx;
6760 preserve_rtl_expr_result (RTL_EXPR_RTL (exp));
6761 free_temps_for_rtl_expr (exp);
6762 return RTL_EXPR_RTL (exp);
6765 /* If we don't need the result, just ensure we evaluate any
6771 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6772 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
6777 /* All elts simple constants => refer to a constant in memory. But
6778 if this is a non-BLKmode mode, let it store a field at a time
6779 since that should make a CONST_INT or CONST_DOUBLE when we
6780 fold. Likewise, if we have a target we can use, it is best to
6781 store directly into the target unless the type is large enough
6782 that memcpy will be used. If we are making an initializer and
6783 all operands are constant, put it in memory as well.
6785 FIXME: Avoid trying to fill vector constructors piece-meal.
6786 Output them with output_constant_def below unless we're sure
6787 they're zeros. This should go away when vector initializers
6788 are treated like VECTOR_CST instead of arrays.
6790 else if ((TREE_STATIC (exp)
6791 && ((mode == BLKmode
6792 && ! (target != 0 && safe_from_p (target, exp, 1)))
6793 || TREE_ADDRESSABLE (exp)
6794 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6795 && (! MOVE_BY_PIECES_P
6796 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6798 && ((TREE_CODE (type) == VECTOR_TYPE
6799 && !is_zeros_p (exp))
6800 || ! mostly_zeros_p (exp)))))
6801 || (modifier == EXPAND_INITIALIZER && TREE_CONSTANT (exp)))
6803 rtx constructor = output_constant_def (exp, 1);
6805 if (modifier != EXPAND_CONST_ADDRESS
6806 && modifier != EXPAND_INITIALIZER
6807 && modifier != EXPAND_SUM)
6808 constructor = validize_mem (constructor);
6814 /* Handle calls that pass values in multiple non-contiguous
6815 locations. The Irix 6 ABI has examples of this. */
6816 if (target == 0 || ! safe_from_p (target, exp, 1)
6817 || GET_CODE (target) == PARALLEL)
6819 = assign_temp (build_qualified_type (type,
6821 | (TREE_READONLY (exp)
6822 * TYPE_QUAL_CONST))),
6823 0, TREE_ADDRESSABLE (exp), 1);
6825 store_constructor (exp, target, 0,
6826 int_size_in_bytes (TREE_TYPE (exp)));
6832 tree exp1 = TREE_OPERAND (exp, 0);
6834 tree string = string_constant (exp1, &index);
6836 /* Try to optimize reads from const strings. */
6838 && TREE_CODE (string) == STRING_CST
6839 && TREE_CODE (index) == INTEGER_CST
6840 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0
6841 && GET_MODE_CLASS (mode) == MODE_INT
6842 && GET_MODE_SIZE (mode) == 1
6843 && modifier != EXPAND_WRITE)
6844 return gen_int_mode (TREE_STRING_POINTER (string)
6845 [TREE_INT_CST_LOW (index)], mode);
6847 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6848 op0 = memory_address (mode, op0);
6849 temp = gen_rtx_MEM (mode, op0);
6850 set_mem_attributes (temp, exp, 0);
6852 /* If we are writing to this object and its type is a record with
6853 readonly fields, we must mark it as readonly so it will
6854 conflict with readonly references to those fields. */
6855 if (modifier == EXPAND_WRITE && readonly_fields_p (type))
6856 RTX_UNCHANGING_P (temp) = 1;
6862 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
6866 tree array = TREE_OPERAND (exp, 0);
6867 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
6868 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
6869 tree index = convert (sizetype, TREE_OPERAND (exp, 1));
6872 /* Optimize the special-case of a zero lower bound.
6874 We convert the low_bound to sizetype to avoid some problems
6875 with constant folding. (E.g. suppose the lower bound is 1,
6876 and its mode is QI. Without the conversion, (ARRAY
6877 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
6878 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
6880 if (! integer_zerop (low_bound))
6881 index = size_diffop (index, convert (sizetype, low_bound));
6883 /* Fold an expression like: "foo"[2].
6884 This is not done in fold so it won't happen inside &.
6885 Don't fold if this is for wide characters since it's too
6886 difficult to do correctly and this is a very rare case. */
6888 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
6889 && TREE_CODE (array) == STRING_CST
6890 && TREE_CODE (index) == INTEGER_CST
6891 && compare_tree_int (index, TREE_STRING_LENGTH (array)) < 0
6892 && GET_MODE_CLASS (mode) == MODE_INT
6893 && GET_MODE_SIZE (mode) == 1)
6894 return gen_int_mode (TREE_STRING_POINTER (array)
6895 [TREE_INT_CST_LOW (index)], mode);
6897 /* If this is a constant index into a constant array,
6898 just get the value from the array. Handle both the cases when
6899 we have an explicit constructor and when our operand is a variable
6900 that was declared const. */
6902 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
6903 && TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array)
6904 && TREE_CODE (index) == INTEGER_CST
6905 && 0 > compare_tree_int (index,
6906 list_length (CONSTRUCTOR_ELTS
6907 (TREE_OPERAND (exp, 0)))))
6911 for (elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)),
6912 i = TREE_INT_CST_LOW (index);
6913 elem != 0 && i != 0; i--, elem = TREE_CHAIN (elem))
6917 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
6921 else if (optimize >= 1
6922 && modifier != EXPAND_CONST_ADDRESS
6923 && modifier != EXPAND_INITIALIZER
6924 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6925 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6926 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
6928 if (TREE_CODE (index) == INTEGER_CST)
6930 tree init = DECL_INITIAL (array);
6932 if (TREE_CODE (init) == CONSTRUCTOR)
6936 for (elem = CONSTRUCTOR_ELTS (init);
6938 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6939 elem = TREE_CHAIN (elem))
6942 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6943 return expand_expr (fold (TREE_VALUE (elem)), target,
6946 else if (TREE_CODE (init) == STRING_CST
6947 && 0 > compare_tree_int (index,
6948 TREE_STRING_LENGTH (init)))
6950 tree type = TREE_TYPE (TREE_TYPE (init));
6951 enum machine_mode mode = TYPE_MODE (type);
6953 if (GET_MODE_CLASS (mode) == MODE_INT
6954 && GET_MODE_SIZE (mode) == 1)
6955 return gen_int_mode (TREE_STRING_POINTER (init)
6956 [TREE_INT_CST_LOW (index)], mode);
6965 case ARRAY_RANGE_REF:
6966 /* If the operand is a CONSTRUCTOR, we can just extract the
6967 appropriate field if it is present. Don't do this if we have
6968 already written the data since we want to refer to that copy
6969 and varasm.c assumes that's what we'll do. */
6970 if (code == COMPONENT_REF
6971 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
6972 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
6976 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6977 elt = TREE_CHAIN (elt))
6978 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6979 /* We can normally use the value of the field in the
6980 CONSTRUCTOR. However, if this is a bitfield in
6981 an integral mode that we can fit in a HOST_WIDE_INT,
6982 we must mask only the number of bits in the bitfield,
6983 since this is done implicitly by the constructor. If
6984 the bitfield does not meet either of those conditions,
6985 we can't do this optimization. */
6986 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6987 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6989 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6990 <= HOST_BITS_PER_WIDE_INT))))
6992 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6993 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6995 HOST_WIDE_INT bitsize
6996 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
6997 enum machine_mode imode
6998 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
7000 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
7002 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
7003 op0 = expand_and (imode, op0, op1, target);
7008 = build_int_2 (GET_MODE_BITSIZE (imode) - bitsize,
7011 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
7013 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
7023 enum machine_mode mode1;
7024 HOST_WIDE_INT bitsize, bitpos;
7027 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7028 &mode1, &unsignedp, &volatilep);
7031 /* If we got back the original object, something is wrong. Perhaps
7032 we are evaluating an expression too early. In any event, don't
7033 infinitely recurse. */
7037 /* If TEM's type is a union of variable size, pass TARGET to the inner
7038 computation, since it will need a temporary and TARGET is known
7039 to have to do. This occurs in unchecked conversion in Ada. */
7043 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
7044 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
7046 ? target : NULL_RTX),
7048 (modifier == EXPAND_INITIALIZER
7049 || modifier == EXPAND_CONST_ADDRESS)
7050 ? modifier : EXPAND_NORMAL);
7052 /* If this is a constant, put it into a register if it is a
7053 legitimate constant and OFFSET is 0 and memory if it isn't. */
7054 if (CONSTANT_P (op0))
7056 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
7057 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
7059 op0 = force_reg (mode, op0);
7061 op0 = validize_mem (force_const_mem (mode, op0));
7066 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
7068 /* If this object is in a register, put it into memory.
7069 This case can't occur in C, but can in Ada if we have
7070 unchecked conversion of an expression from a scalar type to
7071 an array or record type. */
7072 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
7073 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
7075 /* If the operand is a SAVE_EXPR, we can deal with this by
7076 forcing the SAVE_EXPR into memory. */
7077 if (TREE_CODE (TREE_OPERAND (exp, 0)) == SAVE_EXPR)
7079 put_var_into_stack (TREE_OPERAND (exp, 0));
7080 op0 = SAVE_EXPR_RTL (TREE_OPERAND (exp, 0));
7085 = build_qualified_type (TREE_TYPE (tem),
7086 (TYPE_QUALS (TREE_TYPE (tem))
7087 | TYPE_QUAL_CONST));
7088 rtx memloc = assign_temp (nt, 1, 1, 1);
7090 emit_move_insn (memloc, op0);
7095 if (GET_CODE (op0) != MEM)
7098 #ifdef POINTERS_EXTEND_UNSIGNED
7099 if (GET_MODE (offset_rtx) != Pmode)
7100 offset_rtx = convert_memory_address (Pmode, offset_rtx);
7102 if (GET_MODE (offset_rtx) != ptr_mode)
7103 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
7106 /* A constant address in OP0 can have VOIDmode, we must not try
7107 to call force_reg for that case. Avoid that case. */
7108 if (GET_CODE (op0) == MEM
7109 && GET_MODE (op0) == BLKmode
7110 && GET_MODE (XEXP (op0, 0)) != VOIDmode
7112 && (bitpos % bitsize) == 0
7113 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
7114 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
7116 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7120 op0 = offset_address (op0, offset_rtx,
7121 highest_pow2_factor (offset));
7124 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7125 record its alignment as BIGGEST_ALIGNMENT. */
7126 if (GET_CODE (op0) == MEM && bitpos == 0 && offset != 0
7127 && is_aligning_offset (offset, tem))
7128 set_mem_align (op0, BIGGEST_ALIGNMENT);
7130 /* Don't forget about volatility even if this is a bitfield. */
7131 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
7133 if (op0 == orig_op0)
7134 op0 = copy_rtx (op0);
7136 MEM_VOLATILE_P (op0) = 1;
7139 /* The following code doesn't handle CONCAT.
7140 Assume only bitpos == 0 can be used for CONCAT, due to
7141 one element arrays having the same mode as its element. */
7142 if (GET_CODE (op0) == CONCAT)
7144 if (bitpos != 0 || bitsize != GET_MODE_BITSIZE (GET_MODE (op0)))
7149 /* In cases where an aligned union has an unaligned object
7150 as a field, we might be extracting a BLKmode value from
7151 an integer-mode (e.g., SImode) object. Handle this case
7152 by doing the extract into an object as wide as the field
7153 (which we know to be the width of a basic mode), then
7154 storing into memory, and changing the mode to BLKmode. */
7155 if (mode1 == VOIDmode
7156 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
7157 || (mode1 != BLKmode && ! direct_load[(int) mode1]
7158 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7159 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
7160 && modifier != EXPAND_CONST_ADDRESS
7161 && modifier != EXPAND_INITIALIZER)
7162 /* If the field isn't aligned enough to fetch as a memref,
7163 fetch it as a bit field. */
7164 || (mode1 != BLKmode
7165 && SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))
7166 && ((TYPE_ALIGN (TREE_TYPE (tem))
7167 < GET_MODE_ALIGNMENT (mode))
7168 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)))
7169 /* If the type and the field are a constant size and the
7170 size of the type isn't the same size as the bitfield,
7171 we must use bitfield operations. */
7173 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (exp)))
7175 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7178 enum machine_mode ext_mode = mode;
7180 if (ext_mode == BLKmode
7181 && ! (target != 0 && GET_CODE (op0) == MEM
7182 && GET_CODE (target) == MEM
7183 && bitpos % BITS_PER_UNIT == 0))
7184 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7186 if (ext_mode == BLKmode)
7188 /* In this case, BITPOS must start at a byte boundary and
7189 TARGET, if specified, must be a MEM. */
7190 if (GET_CODE (op0) != MEM
7191 || (target != 0 && GET_CODE (target) != MEM)
7192 || bitpos % BITS_PER_UNIT != 0)
7195 op0 = adjust_address (op0, VOIDmode, bitpos / BITS_PER_UNIT);
7197 target = assign_temp (type, 0, 1, 1);
7199 emit_block_move (target, op0,
7200 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7206 op0 = validize_mem (op0);
7208 if (GET_CODE (op0) == MEM && GET_CODE (XEXP (op0, 0)) == REG)
7209 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7211 op0 = extract_bit_field (op0, bitsize, bitpos,
7212 unsignedp, target, ext_mode, ext_mode,
7213 int_size_in_bytes (TREE_TYPE (tem)));
7215 /* If the result is a record type and BITSIZE is narrower than
7216 the mode of OP0, an integral mode, and this is a big endian
7217 machine, we must put the field into the high-order bits. */
7218 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7219 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7220 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
7221 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7222 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7226 if (mode == BLKmode)
7228 rtx new = assign_temp (build_qualified_type
7229 ((*lang_hooks.types.type_for_mode)
7231 TYPE_QUAL_CONST), 0, 1, 1);
7233 emit_move_insn (new, op0);
7234 op0 = copy_rtx (new);
7235 PUT_MODE (op0, BLKmode);
7236 set_mem_attributes (op0, exp, 1);
7242 /* If the result is BLKmode, use that to access the object
7244 if (mode == BLKmode)
7247 /* Get a reference to just this component. */
7248 if (modifier == EXPAND_CONST_ADDRESS
7249 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7250 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
7252 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7254 if (op0 == orig_op0)
7255 op0 = copy_rtx (op0);
7257 set_mem_attributes (op0, exp, 0);
7258 if (GET_CODE (XEXP (op0, 0)) == REG)
7259 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7261 MEM_VOLATILE_P (op0) |= volatilep;
7262 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7263 || modifier == EXPAND_CONST_ADDRESS
7264 || modifier == EXPAND_INITIALIZER)
7266 else if (target == 0)
7267 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7269 convert_move (target, op0, unsignedp);
7275 rtx insn, before = get_last_insn (), vtbl_ref;
7277 /* Evaluate the interior expression. */
7278 subtarget = expand_expr (TREE_OPERAND (exp, 0), target,
7281 /* Get or create an instruction off which to hang a note. */
7282 if (REG_P (subtarget))
7285 insn = get_last_insn ();
7288 if (! INSN_P (insn))
7289 insn = prev_nonnote_insn (insn);
7293 target = gen_reg_rtx (GET_MODE (subtarget));
7294 insn = emit_move_insn (target, subtarget);
7297 /* Collect the data for the note. */
7298 vtbl_ref = XEXP (DECL_RTL (TREE_OPERAND (exp, 1)), 0);
7299 vtbl_ref = plus_constant (vtbl_ref,
7300 tree_low_cst (TREE_OPERAND (exp, 2), 0));
7301 /* Discard the initial CONST that was added. */
7302 vtbl_ref = XEXP (vtbl_ref, 0);
7305 = gen_rtx_EXPR_LIST (REG_VTABLE_REF, vtbl_ref, REG_NOTES (insn));
7310 /* Intended for a reference to a buffer of a file-object in Pascal.
7311 But it's not certain that a special tree code will really be
7312 necessary for these. INDIRECT_REF might work for them. */
7318 /* Pascal set IN expression.
7321 rlo = set_low - (set_low%bits_per_word);
7322 the_word = set [ (index - rlo)/bits_per_word ];
7323 bit_index = index % bits_per_word;
7324 bitmask = 1 << bit_index;
7325 return !!(the_word & bitmask); */
7327 tree set = TREE_OPERAND (exp, 0);
7328 tree index = TREE_OPERAND (exp, 1);
7329 int iunsignedp = TREE_UNSIGNED (TREE_TYPE (index));
7330 tree set_type = TREE_TYPE (set);
7331 tree set_low_bound = TYPE_MIN_VALUE (TYPE_DOMAIN (set_type));
7332 tree set_high_bound = TYPE_MAX_VALUE (TYPE_DOMAIN (set_type));
7333 rtx index_val = expand_expr (index, 0, VOIDmode, 0);
7334 rtx lo_r = expand_expr (set_low_bound, 0, VOIDmode, 0);
7335 rtx hi_r = expand_expr (set_high_bound, 0, VOIDmode, 0);
7336 rtx setval = expand_expr (set, 0, VOIDmode, 0);
7337 rtx setaddr = XEXP (setval, 0);
7338 enum machine_mode index_mode = TYPE_MODE (TREE_TYPE (index));
7340 rtx diff, quo, rem, addr, bit, result;
7342 /* If domain is empty, answer is no. Likewise if index is constant
7343 and out of bounds. */
7344 if (((TREE_CODE (set_high_bound) == INTEGER_CST
7345 && TREE_CODE (set_low_bound) == INTEGER_CST
7346 && tree_int_cst_lt (set_high_bound, set_low_bound))
7347 || (TREE_CODE (index) == INTEGER_CST
7348 && TREE_CODE (set_low_bound) == INTEGER_CST
7349 && tree_int_cst_lt (index, set_low_bound))
7350 || (TREE_CODE (set_high_bound) == INTEGER_CST
7351 && TREE_CODE (index) == INTEGER_CST
7352 && tree_int_cst_lt (set_high_bound, index))))
7356 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7358 /* If we get here, we have to generate the code for both cases
7359 (in range and out of range). */
7361 op0 = gen_label_rtx ();
7362 op1 = gen_label_rtx ();
7364 if (! (GET_CODE (index_val) == CONST_INT
7365 && GET_CODE (lo_r) == CONST_INT))
7366 emit_cmp_and_jump_insns (index_val, lo_r, LT, NULL_RTX,
7367 GET_MODE (index_val), iunsignedp, op1);
7369 if (! (GET_CODE (index_val) == CONST_INT
7370 && GET_CODE (hi_r) == CONST_INT))
7371 emit_cmp_and_jump_insns (index_val, hi_r, GT, NULL_RTX,
7372 GET_MODE (index_val), iunsignedp, op1);
7374 /* Calculate the element number of bit zero in the first word
7376 if (GET_CODE (lo_r) == CONST_INT)
7377 rlow = GEN_INT (INTVAL (lo_r)
7378 & ~((HOST_WIDE_INT) 1 << BITS_PER_UNIT));
7380 rlow = expand_binop (index_mode, and_optab, lo_r,
7381 GEN_INT (~((HOST_WIDE_INT) 1 << BITS_PER_UNIT)),
7382 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7384 diff = expand_binop (index_mode, sub_optab, index_val, rlow,
7385 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7387 quo = expand_divmod (0, TRUNC_DIV_EXPR, index_mode, diff,
7388 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7389 rem = expand_divmod (1, TRUNC_MOD_EXPR, index_mode, index_val,
7390 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7392 addr = memory_address (byte_mode,
7393 expand_binop (index_mode, add_optab, diff,
7394 setaddr, NULL_RTX, iunsignedp,
7397 /* Extract the bit we want to examine. */
7398 bit = expand_shift (RSHIFT_EXPR, byte_mode,
7399 gen_rtx_MEM (byte_mode, addr),
7400 make_tree (TREE_TYPE (index), rem),
7402 result = expand_binop (byte_mode, and_optab, bit, const1_rtx,
7403 GET_MODE (target) == byte_mode ? target : 0,
7404 1, OPTAB_LIB_WIDEN);
7406 if (result != target)
7407 convert_move (target, result, 1);
7409 /* Output the code to handle the out-of-range case. */
7412 emit_move_insn (target, const0_rtx);
7417 case WITH_CLEANUP_EXPR:
7418 if (WITH_CLEANUP_EXPR_RTL (exp) == 0)
7420 WITH_CLEANUP_EXPR_RTL (exp)
7421 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7422 expand_decl_cleanup_eh (NULL_TREE, TREE_OPERAND (exp, 1),
7423 CLEANUP_EH_ONLY (exp));
7425 /* That's it for this cleanup. */
7426 TREE_OPERAND (exp, 1) = 0;
7428 return WITH_CLEANUP_EXPR_RTL (exp);
7430 case CLEANUP_POINT_EXPR:
7432 /* Start a new binding layer that will keep track of all cleanup
7433 actions to be performed. */
7434 expand_start_bindings (2);
7436 target_temp_slot_level = temp_slot_level;
7438 op0 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7439 /* If we're going to use this value, load it up now. */
7441 op0 = force_not_mem (op0);
7442 preserve_temp_slots (op0);
7443 expand_end_bindings (NULL_TREE, 0, 0);
7448 /* Check for a built-in function. */
7449 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7450 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7452 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7454 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7455 == BUILT_IN_FRONTEND)
7456 return (*lang_hooks.expand_expr)
7457 (exp, original_target, tmode, modifier);
7459 return expand_builtin (exp, target, subtarget, tmode, ignore);
7462 return expand_call (exp, target, ignore);
7464 case NON_LVALUE_EXPR:
7467 case REFERENCE_EXPR:
7468 if (TREE_OPERAND (exp, 0) == error_mark_node)
7471 if (TREE_CODE (type) == UNION_TYPE)
7473 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7475 /* If both input and output are BLKmode, this conversion isn't doing
7476 anything except possibly changing memory attribute. */
7477 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7479 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7482 result = copy_rtx (result);
7483 set_mem_attributes (result, exp, 0);
7488 target = assign_temp (type, 0, 1, 1);
7490 if (GET_CODE (target) == MEM)
7491 /* Store data into beginning of memory target. */
7492 store_expr (TREE_OPERAND (exp, 0),
7493 adjust_address (target, TYPE_MODE (valtype), 0), 0);
7495 else if (GET_CODE (target) == REG)
7496 /* Store this field into a union of the proper type. */
7497 store_field (target,
7498 MIN ((int_size_in_bytes (TREE_TYPE
7499 (TREE_OPERAND (exp, 0)))
7501 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7502 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7503 VOIDmode, 0, type, 0);
7507 /* Return the entire union. */
7511 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7513 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7516 /* If the signedness of the conversion differs and OP0 is
7517 a promoted SUBREG, clear that indication since we now
7518 have to do the proper extension. */
7519 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7520 && GET_CODE (op0) == SUBREG)
7521 SUBREG_PROMOTED_VAR_P (op0) = 0;
7526 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7527 if (GET_MODE (op0) == mode)
7530 /* If OP0 is a constant, just convert it into the proper mode. */
7531 if (CONSTANT_P (op0))
7533 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7534 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7536 if (modifier == EXPAND_INITIALIZER)
7537 return simplify_gen_subreg (mode, op0, inner_mode,
7538 subreg_lowpart_offset (mode,
7541 return convert_modes (mode, inner_mode, op0,
7542 TREE_UNSIGNED (inner_type));
7545 if (modifier == EXPAND_INITIALIZER)
7546 return gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7550 convert_to_mode (mode, op0,
7551 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7553 convert_move (target, op0,
7554 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7557 case VIEW_CONVERT_EXPR:
7558 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7560 /* If the input and output modes are both the same, we are done.
7561 Otherwise, if neither mode is BLKmode and both are within a word, we
7562 can use gen_lowpart. If neither is true, make sure the operand is
7563 in memory and convert the MEM to the new mode. */
7564 if (TYPE_MODE (type) == GET_MODE (op0))
7566 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7567 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7568 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7569 op0 = gen_lowpart (TYPE_MODE (type), op0);
7570 else if (GET_CODE (op0) != MEM)
7572 /* If the operand is not a MEM, force it into memory. Since we
7573 are going to be be changing the mode of the MEM, don't call
7574 force_const_mem for constants because we don't allow pool
7575 constants to change mode. */
7576 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7578 if (TREE_ADDRESSABLE (exp))
7581 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7583 = assign_stack_temp_for_type
7584 (TYPE_MODE (inner_type),
7585 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7587 emit_move_insn (target, op0);
7591 /* At this point, OP0 is in the correct mode. If the output type is such
7592 that the operand is known to be aligned, indicate that it is.
7593 Otherwise, we need only be concerned about alignment for non-BLKmode
7595 if (GET_CODE (op0) == MEM)
7597 op0 = copy_rtx (op0);
7599 if (TYPE_ALIGN_OK (type))
7600 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7601 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7602 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7604 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7605 HOST_WIDE_INT temp_size
7606 = MAX (int_size_in_bytes (inner_type),
7607 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7608 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7609 temp_size, 0, type);
7610 rtx new_with_op0_mode = adjust_address (new, GET_MODE (op0), 0);
7612 if (TREE_ADDRESSABLE (exp))
7615 if (GET_MODE (op0) == BLKmode)
7616 emit_block_move (new_with_op0_mode, op0,
7617 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))));
7619 emit_move_insn (new_with_op0_mode, op0);
7624 op0 = adjust_address (op0, TYPE_MODE (type), 0);
7630 /* We come here from MINUS_EXPR when the second operand is a
7633 this_optab = ! unsignedp && flag_trapv
7634 && (GET_MODE_CLASS (mode) == MODE_INT)
7635 ? addv_optab : add_optab;
7637 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
7638 something else, make sure we add the register to the constant and
7639 then to the other thing. This case can occur during strength
7640 reduction and doing it this way will produce better code if the
7641 frame pointer or argument pointer is eliminated.
7643 fold-const.c will ensure that the constant is always in the inner
7644 PLUS_EXPR, so the only case we need to do anything about is if
7645 sp, ap, or fp is our second argument, in which case we must swap
7646 the innermost first argument and our second argument. */
7648 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7649 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7650 && TREE_CODE (TREE_OPERAND (exp, 1)) == RTL_EXPR
7651 && (RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7652 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7653 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7655 tree t = TREE_OPERAND (exp, 1);
7657 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7658 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7661 /* If the result is to be ptr_mode and we are adding an integer to
7662 something, we might be forming a constant. So try to use
7663 plus_constant. If it produces a sum and we can't accept it,
7664 use force_operand. This allows P = &ARR[const] to generate
7665 efficient code on machines where a SYMBOL_REF is not a valid
7668 If this is an EXPAND_SUM call, always return the sum. */
7669 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7670 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7672 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7673 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7674 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7678 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7680 /* Use immed_double_const to ensure that the constant is
7681 truncated according to the mode of OP1, then sign extended
7682 to a HOST_WIDE_INT. Using the constant directly can result
7683 in non-canonical RTL in a 64x32 cross compile. */
7685 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7687 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7688 op1 = plus_constant (op1, INTVAL (constant_part));
7689 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7690 op1 = force_operand (op1, target);
7694 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7695 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7696 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7700 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7701 (modifier == EXPAND_INITIALIZER
7702 ? EXPAND_INITIALIZER : EXPAND_SUM));
7703 if (! CONSTANT_P (op0))
7705 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7706 VOIDmode, modifier);
7707 /* Don't go to both_summands if modifier
7708 says it's not right to return a PLUS. */
7709 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7713 /* Use immed_double_const to ensure that the constant is
7714 truncated according to the mode of OP1, then sign extended
7715 to a HOST_WIDE_INT. Using the constant directly can result
7716 in non-canonical RTL in a 64x32 cross compile. */
7718 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7720 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7721 op0 = plus_constant (op0, INTVAL (constant_part));
7722 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7723 op0 = force_operand (op0, target);
7728 /* No sense saving up arithmetic to be done
7729 if it's all in the wrong mode to form part of an address.
7730 And force_operand won't know whether to sign-extend or
7732 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7733 || mode != ptr_mode)
7736 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7739 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, modifier);
7740 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, modifier);
7743 /* Make sure any term that's a sum with a constant comes last. */
7744 if (GET_CODE (op0) == PLUS
7745 && CONSTANT_P (XEXP (op0, 1)))
7751 /* If adding to a sum including a constant,
7752 associate it to put the constant outside. */
7753 if (GET_CODE (op1) == PLUS
7754 && CONSTANT_P (XEXP (op1, 1)))
7756 rtx constant_term = const0_rtx;
7758 temp = simplify_binary_operation (PLUS, mode, XEXP (op1, 0), op0);
7761 /* Ensure that MULT comes first if there is one. */
7762 else if (GET_CODE (op0) == MULT)
7763 op0 = gen_rtx_PLUS (mode, op0, XEXP (op1, 0));
7765 op0 = gen_rtx_PLUS (mode, XEXP (op1, 0), op0);
7767 /* Let's also eliminate constants from op0 if possible. */
7768 op0 = eliminate_constant_term (op0, &constant_term);
7770 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
7771 their sum should be a constant. Form it into OP1, since the
7772 result we want will then be OP0 + OP1. */
7774 temp = simplify_binary_operation (PLUS, mode, constant_term,
7779 op1 = gen_rtx_PLUS (mode, constant_term, XEXP (op1, 1));
7782 /* Put a constant term last and put a multiplication first. */
7783 if (CONSTANT_P (op0) || GET_CODE (op1) == MULT)
7784 temp = op1, op1 = op0, op0 = temp;
7786 temp = simplify_binary_operation (PLUS, mode, op0, op1);
7787 return temp ? temp : gen_rtx_PLUS (mode, op0, op1);
7790 /* For initializers, we are allowed to return a MINUS of two
7791 symbolic constants. Here we handle all cases when both operands
7793 /* Handle difference of two symbolic constants,
7794 for the sake of an initializer. */
7795 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7796 && really_constant_p (TREE_OPERAND (exp, 0))
7797 && really_constant_p (TREE_OPERAND (exp, 1)))
7799 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode,
7801 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode,
7804 /* If the last operand is a CONST_INT, use plus_constant of
7805 the negated constant. Else make the MINUS. */
7806 if (GET_CODE (op1) == CONST_INT)
7807 return plus_constant (op0, - INTVAL (op1));
7809 return gen_rtx_MINUS (mode, op0, op1);
7811 /* Convert A - const to A + (-const). */
7812 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7814 tree negated = fold (build1 (NEGATE_EXPR, type,
7815 TREE_OPERAND (exp, 1)));
7817 if (TREE_UNSIGNED (type) || TREE_OVERFLOW (negated))
7818 /* If we can't negate the constant in TYPE, leave it alone and
7819 expand_binop will negate it for us. We used to try to do it
7820 here in the signed version of TYPE, but that doesn't work
7821 on POINTER_TYPEs. */;
7824 exp = build (PLUS_EXPR, type, TREE_OPERAND (exp, 0), negated);
7828 this_optab = ! unsignedp && flag_trapv
7829 && (GET_MODE_CLASS(mode) == MODE_INT)
7830 ? subv_optab : sub_optab;
7834 /* If first operand is constant, swap them.
7835 Thus the following special case checks need only
7836 check the second operand. */
7837 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7839 tree t1 = TREE_OPERAND (exp, 0);
7840 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7841 TREE_OPERAND (exp, 1) = t1;
7844 /* Attempt to return something suitable for generating an
7845 indexed address, for machines that support that. */
7847 if (modifier == EXPAND_SUM && mode == ptr_mode
7848 && host_integerp (TREE_OPERAND (exp, 1), 0))
7850 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7853 /* If we knew for certain that this is arithmetic for an array
7854 reference, and we knew the bounds of the array, then we could
7855 apply the distributive law across (PLUS X C) for constant C.
7856 Without such knowledge, we risk overflowing the computation
7857 when both X and C are large, but X+C isn't. */
7858 /* ??? Could perhaps special-case EXP being unsigned and C being
7859 positive. In that case we are certain that X+C is no smaller
7860 than X and so the transformed expression will overflow iff the
7861 original would have. */
7863 if (GET_CODE (op0) != REG)
7864 op0 = force_operand (op0, NULL_RTX);
7865 if (GET_CODE (op0) != REG)
7866 op0 = copy_to_mode_reg (mode, op0);
7869 gen_rtx_MULT (mode, op0,
7870 GEN_INT (tree_low_cst (TREE_OPERAND (exp, 1), 0)));
7873 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7876 /* Check for multiplying things that have been extended
7877 from a narrower type. If this machine supports multiplying
7878 in that narrower type with a result in the desired type,
7879 do it that way, and avoid the explicit type-conversion. */
7880 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7881 && TREE_CODE (type) == INTEGER_TYPE
7882 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7883 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7884 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7885 && int_fits_type_p (TREE_OPERAND (exp, 1),
7886 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7887 /* Don't use a widening multiply if a shift will do. */
7888 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7889 > HOST_BITS_PER_WIDE_INT)
7890 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7892 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7893 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7895 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
7896 /* If both operands are extended, they must either both
7897 be zero-extended or both be sign-extended. */
7898 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7900 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))))))
7902 enum machine_mode innermode
7903 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)));
7904 optab other_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7905 ? smul_widen_optab : umul_widen_optab);
7906 this_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7907 ? umul_widen_optab : smul_widen_optab);
7908 if (mode == GET_MODE_WIDER_MODE (innermode))
7910 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7912 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7913 NULL_RTX, VOIDmode, 0);
7914 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7915 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7918 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7919 NULL_RTX, VOIDmode, 0);
7922 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7923 && innermode == word_mode)
7926 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7927 NULL_RTX, VOIDmode, 0);
7928 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7929 op1 = convert_modes (innermode, mode,
7930 expand_expr (TREE_OPERAND (exp, 1),
7931 NULL_RTX, VOIDmode, 0),
7934 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7935 NULL_RTX, VOIDmode, 0);
7936 temp = expand_binop (mode, other_optab, op0, op1, target,
7937 unsignedp, OPTAB_LIB_WIDEN);
7938 htem = expand_mult_highpart_adjust (innermode,
7939 gen_highpart (innermode, temp),
7941 gen_highpart (innermode, temp),
7943 emit_move_insn (gen_highpart (innermode, temp), htem);
7948 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7949 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7950 return expand_mult (mode, op0, op1, target, unsignedp);
7952 case TRUNC_DIV_EXPR:
7953 case FLOOR_DIV_EXPR:
7955 case ROUND_DIV_EXPR:
7956 case EXACT_DIV_EXPR:
7957 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7959 /* Possible optimization: compute the dividend with EXPAND_SUM
7960 then if the divisor is constant can optimize the case
7961 where some terms of the dividend have coeffs divisible by it. */
7962 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7963 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7964 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7967 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
7968 expensive divide. If not, combine will rebuild the original
7970 if (flag_unsafe_math_optimizations && optimize && !optimize_size
7971 && TREE_CODE (type) == REAL_TYPE
7972 && !real_onep (TREE_OPERAND (exp, 0)))
7973 return expand_expr (build (MULT_EXPR, type, TREE_OPERAND (exp, 0),
7974 build (RDIV_EXPR, type,
7975 build_real (type, dconst1),
7976 TREE_OPERAND (exp, 1))),
7977 target, tmode, unsignedp);
7978 this_optab = sdiv_optab;
7981 case TRUNC_MOD_EXPR:
7982 case FLOOR_MOD_EXPR:
7984 case ROUND_MOD_EXPR:
7985 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7987 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7988 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7989 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7991 case FIX_ROUND_EXPR:
7992 case FIX_FLOOR_EXPR:
7994 abort (); /* Not used for C. */
7996 case FIX_TRUNC_EXPR:
7997 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7999 target = gen_reg_rtx (mode);
8000 expand_fix (target, op0, unsignedp);
8004 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
8006 target = gen_reg_rtx (mode);
8007 /* expand_float can't figure out what to do if FROM has VOIDmode.
8008 So give it the correct mode. With -O, cse will optimize this. */
8009 if (GET_MODE (op0) == VOIDmode)
8010 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8012 expand_float (target, op0,
8013 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
8017 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8018 temp = expand_unop (mode,
8019 ! unsignedp && flag_trapv
8020 && (GET_MODE_CLASS(mode) == MODE_INT)
8021 ? negv_optab : neg_optab, op0, target, 0);
8027 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8029 /* Handle complex values specially. */
8030 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_INT
8031 || GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
8032 return expand_complex_abs (mode, op0, target, unsignedp);
8034 /* Unsigned abs is simply the operand. Testing here means we don't
8035 risk generating incorrect code below. */
8036 if (TREE_UNSIGNED (type))
8039 return expand_abs (mode, op0, target, unsignedp,
8040 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
8044 target = original_target;
8045 if (target == 0 || ! safe_from_p (target, TREE_OPERAND (exp, 1), 1)
8046 || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
8047 || GET_MODE (target) != mode
8048 || (GET_CODE (target) == REG
8049 && REGNO (target) < FIRST_PSEUDO_REGISTER))
8050 target = gen_reg_rtx (mode);
8051 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8052 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8054 /* First try to do it with a special MIN or MAX instruction.
8055 If that does not win, use a conditional jump to select the proper
8057 this_optab = (TREE_UNSIGNED (type)
8058 ? (code == MIN_EXPR ? umin_optab : umax_optab)
8059 : (code == MIN_EXPR ? smin_optab : smax_optab));
8061 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8066 /* At this point, a MEM target is no longer useful; we will get better
8069 if (GET_CODE (target) == MEM)
8070 target = gen_reg_rtx (mode);
8073 emit_move_insn (target, op0);
8075 op0 = gen_label_rtx ();
8077 /* If this mode is an integer too wide to compare properly,
8078 compare word by word. Rely on cse to optimize constant cases. */
8079 if (GET_MODE_CLASS (mode) == MODE_INT
8080 && ! can_compare_p (GE, mode, ccp_jump))
8082 if (code == MAX_EXPR)
8083 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
8084 target, op1, NULL_RTX, op0);
8086 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
8087 op1, target, NULL_RTX, op0);
8091 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)));
8092 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
8093 unsignedp, mode, NULL_RTX, NULL_RTX,
8096 emit_move_insn (target, op1);
8101 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8102 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8108 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8109 temp = expand_unop (mode, ffs_optab, op0, target, 1);
8114 /* ??? Can optimize bitwise operations with one arg constant.
8115 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8116 and (a bitwise1 b) bitwise2 b (etc)
8117 but that is probably not worth while. */
8119 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8120 boolean values when we want in all cases to compute both of them. In
8121 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8122 as actual zero-or-1 values and then bitwise anding. In cases where
8123 there cannot be any side effects, better code would be made by
8124 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8125 how to recognize those cases. */
8127 case TRUTH_AND_EXPR:
8129 this_optab = and_optab;
8134 this_optab = ior_optab;
8137 case TRUTH_XOR_EXPR:
8139 this_optab = xor_optab;
8146 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8148 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8149 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
8152 /* Could determine the answer when only additive constants differ. Also,
8153 the addition of one can be handled by changing the condition. */
8160 case UNORDERED_EXPR:
8167 temp = do_store_flag (exp, target, tmode != VOIDmode ? tmode : mode, 0);
8171 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8172 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
8174 && GET_CODE (original_target) == REG
8175 && (GET_MODE (original_target)
8176 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
8178 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
8181 /* If temp is constant, we can just compute the result. */
8182 if (GET_CODE (temp) == CONST_INT)
8184 if (INTVAL (temp) != 0)
8185 emit_move_insn (target, const1_rtx);
8187 emit_move_insn (target, const0_rtx);
8192 if (temp != original_target)
8194 enum machine_mode mode1 = GET_MODE (temp);
8195 if (mode1 == VOIDmode)
8196 mode1 = tmode != VOIDmode ? tmode : mode;
8198 temp = copy_to_mode_reg (mode1, temp);
8201 op1 = gen_label_rtx ();
8202 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
8203 GET_MODE (temp), unsignedp, op1);
8204 emit_move_insn (temp, const1_rtx);
8209 /* If no set-flag instruction, must generate a conditional
8210 store into a temporary variable. Drop through
8211 and handle this like && and ||. */
8213 case TRUTH_ANDIF_EXPR:
8214 case TRUTH_ORIF_EXPR:
8216 && (target == 0 || ! safe_from_p (target, exp, 1)
8217 /* Make sure we don't have a hard reg (such as function's return
8218 value) live across basic blocks, if not optimizing. */
8219 || (!optimize && GET_CODE (target) == REG
8220 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8221 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8224 emit_clr_insn (target);
8226 op1 = gen_label_rtx ();
8227 jumpifnot (exp, op1);
8230 emit_0_to_1_insn (target);
8233 return ignore ? const0_rtx : target;
8235 case TRUTH_NOT_EXPR:
8236 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8237 /* The parser is careful to generate TRUTH_NOT_EXPR
8238 only with operands that are always zero or one. */
8239 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8240 target, 1, OPTAB_LIB_WIDEN);
8246 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
8248 return expand_expr (TREE_OPERAND (exp, 1),
8249 (ignore ? const0_rtx : target),
8253 /* If we would have a "singleton" (see below) were it not for a
8254 conversion in each arm, bring that conversion back out. */
8255 if (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
8256 && TREE_CODE (TREE_OPERAND (exp, 2)) == NOP_EXPR
8257 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0))
8258 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 2), 0))))
8260 tree iftrue = TREE_OPERAND (TREE_OPERAND (exp, 1), 0);
8261 tree iffalse = TREE_OPERAND (TREE_OPERAND (exp, 2), 0);
8263 if ((TREE_CODE_CLASS (TREE_CODE (iftrue)) == '2'
8264 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8265 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '2'
8266 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0))
8267 || (TREE_CODE_CLASS (TREE_CODE (iftrue)) == '1'
8268 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
8269 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '1'
8270 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0)))
8271 return expand_expr (build1 (NOP_EXPR, type,
8272 build (COND_EXPR, TREE_TYPE (iftrue),
8273 TREE_OPERAND (exp, 0),
8275 target, tmode, modifier);
8279 /* Note that COND_EXPRs whose type is a structure or union
8280 are required to be constructed to contain assignments of
8281 a temporary variable, so that we can evaluate them here
8282 for side effect only. If type is void, we must do likewise. */
8284 /* If an arm of the branch requires a cleanup,
8285 only that cleanup is performed. */
8288 tree binary_op = 0, unary_op = 0;
8290 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
8291 convert it to our mode, if necessary. */
8292 if (integer_onep (TREE_OPERAND (exp, 1))
8293 && integer_zerop (TREE_OPERAND (exp, 2))
8294 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8298 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
8303 op0 = expand_expr (TREE_OPERAND (exp, 0), target, mode, modifier);
8304 if (GET_MODE (op0) == mode)
8308 target = gen_reg_rtx (mode);
8309 convert_move (target, op0, unsignedp);
8313 /* Check for X ? A + B : A. If we have this, we can copy A to the
8314 output and conditionally add B. Similarly for unary operations.
8315 Don't do this if X has side-effects because those side effects
8316 might affect A or B and the "?" operation is a sequence point in
8317 ANSI. (operand_equal_p tests for side effects.) */
8319 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '2'
8320 && operand_equal_p (TREE_OPERAND (exp, 2),
8321 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8322 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
8323 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '2'
8324 && operand_equal_p (TREE_OPERAND (exp, 1),
8325 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8326 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
8327 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '1'
8328 && operand_equal_p (TREE_OPERAND (exp, 2),
8329 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8330 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
8331 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '1'
8332 && operand_equal_p (TREE_OPERAND (exp, 1),
8333 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8334 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
8336 /* If we are not to produce a result, we have no target. Otherwise,
8337 if a target was specified use it; it will not be used as an
8338 intermediate target unless it is safe. If no target, use a
8343 else if (original_target
8344 && (safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8345 || (singleton && GET_CODE (original_target) == REG
8346 && REGNO (original_target) >= FIRST_PSEUDO_REGISTER
8347 && original_target == var_rtx (singleton)))
8348 && GET_MODE (original_target) == mode
8349 #ifdef HAVE_conditional_move
8350 && (! can_conditionally_move_p (mode)
8351 || GET_CODE (original_target) == REG
8352 || TREE_ADDRESSABLE (type))
8354 && (GET_CODE (original_target) != MEM
8355 || TREE_ADDRESSABLE (type)))
8356 temp = original_target;
8357 else if (TREE_ADDRESSABLE (type))
8360 temp = assign_temp (type, 0, 0, 1);
8362 /* If we had X ? A + C : A, with C a constant power of 2, and we can
8363 do the test of X as a store-flag operation, do this as
8364 A + ((X != 0) << log C). Similarly for other simple binary
8365 operators. Only do for C == 1 if BRANCH_COST is low. */
8366 if (temp && singleton && binary_op
8367 && (TREE_CODE (binary_op) == PLUS_EXPR
8368 || TREE_CODE (binary_op) == MINUS_EXPR
8369 || TREE_CODE (binary_op) == BIT_IOR_EXPR
8370 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
8371 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
8372 : integer_onep (TREE_OPERAND (binary_op, 1)))
8373 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8376 optab boptab = (TREE_CODE (binary_op) == PLUS_EXPR
8377 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8378 ? addv_optab : add_optab)
8379 : TREE_CODE (binary_op) == MINUS_EXPR
8380 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8381 ? subv_optab : sub_optab)
8382 : TREE_CODE (binary_op) == BIT_IOR_EXPR ? ior_optab
8385 /* If we had X ? A : A + 1, do this as A + (X == 0).
8387 We have to invert the truth value here and then put it
8388 back later if do_store_flag fails. We cannot simply copy
8389 TREE_OPERAND (exp, 0) to another variable and modify that
8390 because invert_truthvalue can modify the tree pointed to
8392 if (singleton == TREE_OPERAND (exp, 1))
8393 TREE_OPERAND (exp, 0)
8394 = invert_truthvalue (TREE_OPERAND (exp, 0));
8396 result = do_store_flag (TREE_OPERAND (exp, 0),
8397 (safe_from_p (temp, singleton, 1)
8399 mode, BRANCH_COST <= 1);
8401 if (result != 0 && ! integer_onep (TREE_OPERAND (binary_op, 1)))
8402 result = expand_shift (LSHIFT_EXPR, mode, result,
8403 build_int_2 (tree_log2
8407 (safe_from_p (temp, singleton, 1)
8408 ? temp : NULL_RTX), 0);
8412 op1 = expand_expr (singleton, NULL_RTX, VOIDmode, 0);
8413 return expand_binop (mode, boptab, op1, result, temp,
8414 unsignedp, OPTAB_LIB_WIDEN);
8416 else if (singleton == TREE_OPERAND (exp, 1))
8417 TREE_OPERAND (exp, 0)
8418 = invert_truthvalue (TREE_OPERAND (exp, 0));
8421 do_pending_stack_adjust ();
8423 op0 = gen_label_rtx ();
8425 if (singleton && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0)))
8429 /* If the target conflicts with the other operand of the
8430 binary op, we can't use it. Also, we can't use the target
8431 if it is a hard register, because evaluating the condition
8432 might clobber it. */
8434 && ! safe_from_p (temp, TREE_OPERAND (binary_op, 1), 1))
8435 || (GET_CODE (temp) == REG
8436 && REGNO (temp) < FIRST_PSEUDO_REGISTER))
8437 temp = gen_reg_rtx (mode);
8438 store_expr (singleton, temp, 0);
8441 expand_expr (singleton,
8442 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8443 if (singleton == TREE_OPERAND (exp, 1))
8444 jumpif (TREE_OPERAND (exp, 0), op0);
8446 jumpifnot (TREE_OPERAND (exp, 0), op0);
8448 start_cleanup_deferral ();
8449 if (binary_op && temp == 0)
8450 /* Just touch the other operand. */
8451 expand_expr (TREE_OPERAND (binary_op, 1),
8452 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8454 store_expr (build (TREE_CODE (binary_op), type,
8455 make_tree (type, temp),
8456 TREE_OPERAND (binary_op, 1)),
8459 store_expr (build1 (TREE_CODE (unary_op), type,
8460 make_tree (type, temp)),
8464 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
8465 comparison operator. If we have one of these cases, set the
8466 output to A, branch on A (cse will merge these two references),
8467 then set the output to FOO. */
8469 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8470 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8471 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8472 TREE_OPERAND (exp, 1), 0)
8473 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8474 || TREE_CODE (TREE_OPERAND (exp, 1)) == SAVE_EXPR)
8475 && safe_from_p (temp, TREE_OPERAND (exp, 2), 1))
8477 if (GET_CODE (temp) == REG
8478 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8479 temp = gen_reg_rtx (mode);
8480 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8481 jumpif (TREE_OPERAND (exp, 0), op0);
8483 start_cleanup_deferral ();
8484 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8488 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8489 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8490 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8491 TREE_OPERAND (exp, 2), 0)
8492 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8493 || TREE_CODE (TREE_OPERAND (exp, 2)) == SAVE_EXPR)
8494 && safe_from_p (temp, TREE_OPERAND (exp, 1), 1))
8496 if (GET_CODE (temp) == REG
8497 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8498 temp = gen_reg_rtx (mode);
8499 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8500 jumpifnot (TREE_OPERAND (exp, 0), op0);
8502 start_cleanup_deferral ();
8503 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8508 op1 = gen_label_rtx ();
8509 jumpifnot (TREE_OPERAND (exp, 0), op0);
8511 start_cleanup_deferral ();
8513 /* One branch of the cond can be void, if it never returns. For
8514 example A ? throw : E */
8516 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node)
8517 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8519 expand_expr (TREE_OPERAND (exp, 1),
8520 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8521 end_cleanup_deferral ();
8523 emit_jump_insn (gen_jump (op1));
8526 start_cleanup_deferral ();
8528 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node)
8529 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8531 expand_expr (TREE_OPERAND (exp, 2),
8532 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8535 end_cleanup_deferral ();
8546 /* Something needs to be initialized, but we didn't know
8547 where that thing was when building the tree. For example,
8548 it could be the return value of a function, or a parameter
8549 to a function which lays down in the stack, or a temporary
8550 variable which must be passed by reference.
8552 We guarantee that the expression will either be constructed
8553 or copied into our original target. */
8555 tree slot = TREE_OPERAND (exp, 0);
8556 tree cleanups = NULL_TREE;
8559 if (TREE_CODE (slot) != VAR_DECL)
8563 target = original_target;
8565 /* Set this here so that if we get a target that refers to a
8566 register variable that's already been used, put_reg_into_stack
8567 knows that it should fix up those uses. */
8568 TREE_USED (slot) = 1;
8572 if (DECL_RTL_SET_P (slot))
8574 target = DECL_RTL (slot);
8575 /* If we have already expanded the slot, so don't do
8577 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8582 target = assign_temp (type, 2, 0, 1);
8583 /* All temp slots at this level must not conflict. */
8584 preserve_temp_slots (target);
8585 SET_DECL_RTL (slot, target);
8586 if (TREE_ADDRESSABLE (slot))
8587 put_var_into_stack (slot);
8589 /* Since SLOT is not known to the called function
8590 to belong to its stack frame, we must build an explicit
8591 cleanup. This case occurs when we must build up a reference
8592 to pass the reference as an argument. In this case,
8593 it is very likely that such a reference need not be
8596 if (TREE_OPERAND (exp, 2) == 0)
8597 TREE_OPERAND (exp, 2)
8598 = (*lang_hooks.maybe_build_cleanup) (slot);
8599 cleanups = TREE_OPERAND (exp, 2);
8604 /* This case does occur, when expanding a parameter which
8605 needs to be constructed on the stack. The target
8606 is the actual stack address that we want to initialize.
8607 The function we call will perform the cleanup in this case. */
8609 /* If we have already assigned it space, use that space,
8610 not target that we were passed in, as our target
8611 parameter is only a hint. */
8612 if (DECL_RTL_SET_P (slot))
8614 target = DECL_RTL (slot);
8615 /* If we have already expanded the slot, so don't do
8617 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8622 SET_DECL_RTL (slot, target);
8623 /* If we must have an addressable slot, then make sure that
8624 the RTL that we just stored in slot is OK. */
8625 if (TREE_ADDRESSABLE (slot))
8626 put_var_into_stack (slot);
8630 exp1 = TREE_OPERAND (exp, 3) = TREE_OPERAND (exp, 1);
8631 /* Mark it as expanded. */
8632 TREE_OPERAND (exp, 1) = NULL_TREE;
8634 store_expr (exp1, target, 0);
8636 expand_decl_cleanup_eh (NULL_TREE, cleanups, CLEANUP_EH_ONLY (exp));
8643 tree lhs = TREE_OPERAND (exp, 0);
8644 tree rhs = TREE_OPERAND (exp, 1);
8646 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8652 /* If lhs is complex, expand calls in rhs before computing it.
8653 That's so we don't compute a pointer and save it over a
8654 call. If lhs is simple, compute it first so we can give it
8655 as a target if the rhs is just a call. This avoids an
8656 extra temp and copy and that prevents a partial-subsumption
8657 which makes bad code. Actually we could treat
8658 component_ref's of vars like vars. */
8660 tree lhs = TREE_OPERAND (exp, 0);
8661 tree rhs = TREE_OPERAND (exp, 1);
8665 /* Check for |= or &= of a bitfield of size one into another bitfield
8666 of size 1. In this case, (unless we need the result of the
8667 assignment) we can do this more efficiently with a
8668 test followed by an assignment, if necessary.
8670 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8671 things change so we do, this code should be enhanced to
8674 && TREE_CODE (lhs) == COMPONENT_REF
8675 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8676 || TREE_CODE (rhs) == BIT_AND_EXPR)
8677 && TREE_OPERAND (rhs, 0) == lhs
8678 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8679 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8680 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8682 rtx label = gen_label_rtx ();
8684 do_jump (TREE_OPERAND (rhs, 1),
8685 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8686 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8687 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8688 (TREE_CODE (rhs) == BIT_IOR_EXPR
8690 : integer_zero_node)),
8692 do_pending_stack_adjust ();
8697 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8703 if (!TREE_OPERAND (exp, 0))
8704 expand_null_return ();
8706 expand_return (TREE_OPERAND (exp, 0));
8709 case PREINCREMENT_EXPR:
8710 case PREDECREMENT_EXPR:
8711 return expand_increment (exp, 0, ignore);
8713 case POSTINCREMENT_EXPR:
8714 case POSTDECREMENT_EXPR:
8715 /* Faster to treat as pre-increment if result is not used. */
8716 return expand_increment (exp, ! ignore, ignore);
8719 /* Are we taking the address of a nested function? */
8720 if (TREE_CODE (TREE_OPERAND (exp, 0)) == FUNCTION_DECL
8721 && decl_function_context (TREE_OPERAND (exp, 0)) != 0
8722 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp, 0))
8723 && ! TREE_STATIC (exp))
8725 op0 = trampoline_address (TREE_OPERAND (exp, 0));
8726 op0 = force_operand (op0, target);
8728 /* If we are taking the address of something erroneous, just
8730 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
8732 /* If we are taking the address of a constant and are at the
8733 top level, we have to use output_constant_def since we can't
8734 call force_const_mem at top level. */
8736 && (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
8737 || (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0)))
8739 op0 = XEXP (output_constant_def (TREE_OPERAND (exp, 0), 0), 0);
8742 /* We make sure to pass const0_rtx down if we came in with
8743 ignore set, to avoid doing the cleanups twice for something. */
8744 op0 = expand_expr (TREE_OPERAND (exp, 0),
8745 ignore ? const0_rtx : NULL_RTX, VOIDmode,
8746 (modifier == EXPAND_INITIALIZER
8747 ? modifier : EXPAND_CONST_ADDRESS));
8749 /* If we are going to ignore the result, OP0 will have been set
8750 to const0_rtx, so just return it. Don't get confused and
8751 think we are taking the address of the constant. */
8755 /* Pass 1 for MODIFY, so that protect_from_queue doesn't get
8756 clever and returns a REG when given a MEM. */
8757 op0 = protect_from_queue (op0, 1);
8759 /* We would like the object in memory. If it is a constant, we can
8760 have it be statically allocated into memory. For a non-constant,
8761 we need to allocate some memory and store the value into it. */
8763 if (CONSTANT_P (op0))
8764 op0 = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8766 else if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8767 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF
8768 || GET_CODE (op0) == PARALLEL)
8770 /* If the operand is a SAVE_EXPR, we can deal with this by
8771 forcing the SAVE_EXPR into memory. */
8772 if (TREE_CODE (TREE_OPERAND (exp, 0)) == SAVE_EXPR)
8774 put_var_into_stack (TREE_OPERAND (exp, 0));
8775 op0 = SAVE_EXPR_RTL (TREE_OPERAND (exp, 0));
8779 /* If this object is in a register, it can't be BLKmode. */
8780 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8781 rtx memloc = assign_temp (inner_type, 1, 1, 1);
8783 if (GET_CODE (op0) == PARALLEL)
8784 /* Handle calls that pass values in multiple
8785 non-contiguous locations. The Irix 6 ABI has examples
8787 emit_group_store (memloc, op0,
8788 int_size_in_bytes (inner_type));
8790 emit_move_insn (memloc, op0);
8796 if (GET_CODE (op0) != MEM)
8799 mark_temp_addr_taken (op0);
8800 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8802 op0 = XEXP (op0, 0);
8803 #ifdef POINTERS_EXTEND_UNSIGNED
8804 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8805 && mode == ptr_mode)
8806 op0 = convert_memory_address (ptr_mode, op0);
8811 /* If OP0 is not aligned as least as much as the type requires, we
8812 need to make a temporary, copy OP0 to it, and take the address of
8813 the temporary. We want to use the alignment of the type, not of
8814 the operand. Note that this is incorrect for FUNCTION_TYPE, but
8815 the test for BLKmode means that can't happen. The test for
8816 BLKmode is because we never make mis-aligned MEMs with
8819 We don't need to do this at all if the machine doesn't have
8820 strict alignment. */
8821 if (STRICT_ALIGNMENT && GET_MODE (op0) == BLKmode
8822 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
8824 && MEM_ALIGN (op0) < BIGGEST_ALIGNMENT)
8826 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8828 = assign_stack_temp_for_type
8829 (TYPE_MODE (inner_type),
8830 MEM_SIZE (op0) ? INTVAL (MEM_SIZE (op0))
8831 : int_size_in_bytes (inner_type),
8832 1, build_qualified_type (inner_type,
8833 (TYPE_QUALS (inner_type)
8834 | TYPE_QUAL_CONST)));
8836 if (TYPE_ALIGN_OK (inner_type))
8839 emit_block_move (new, op0, expr_size (TREE_OPERAND (exp, 0)));
8843 op0 = force_operand (XEXP (op0, 0), target);
8847 && GET_CODE (op0) != REG
8848 && modifier != EXPAND_CONST_ADDRESS
8849 && modifier != EXPAND_INITIALIZER
8850 && modifier != EXPAND_SUM)
8851 op0 = force_reg (Pmode, op0);
8853 if (GET_CODE (op0) == REG
8854 && ! REG_USERVAR_P (op0))
8855 mark_reg_pointer (op0, TYPE_ALIGN (TREE_TYPE (type)));
8857 #ifdef POINTERS_EXTEND_UNSIGNED
8858 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8859 && mode == ptr_mode)
8860 op0 = convert_memory_address (ptr_mode, op0);
8865 case ENTRY_VALUE_EXPR:
8868 /* COMPLEX type for Extended Pascal & Fortran */
8871 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8874 /* Get the rtx code of the operands. */
8875 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8876 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8879 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8883 /* Move the real (op0) and imaginary (op1) parts to their location. */
8884 emit_move_insn (gen_realpart (mode, target), op0);
8885 emit_move_insn (gen_imagpart (mode, target), op1);
8887 insns = get_insns ();
8890 /* Complex construction should appear as a single unit. */
8891 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
8892 each with a separate pseudo as destination.
8893 It's not correct for flow to treat them as a unit. */
8894 if (GET_CODE (target) != CONCAT)
8895 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
8903 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8904 return gen_realpart (mode, op0);
8907 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8908 return gen_imagpart (mode, op0);
8912 enum machine_mode partmode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8916 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8919 target = gen_reg_rtx (mode);
8923 /* Store the realpart and the negated imagpart to target. */
8924 emit_move_insn (gen_realpart (partmode, target),
8925 gen_realpart (partmode, op0));
8927 imag_t = gen_imagpart (partmode, target);
8928 temp = expand_unop (partmode,
8929 ! unsignedp && flag_trapv
8930 && (GET_MODE_CLASS(partmode) == MODE_INT)
8931 ? negv_optab : neg_optab,
8932 gen_imagpart (partmode, op0), imag_t, 0);
8934 emit_move_insn (imag_t, temp);
8936 insns = get_insns ();
8939 /* Conjugate should appear as a single unit
8940 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
8941 each with a separate pseudo as destination.
8942 It's not correct for flow to treat them as a unit. */
8943 if (GET_CODE (target) != CONCAT)
8944 emit_no_conflict_block (insns, target, op0, NULL_RTX, NULL_RTX);
8951 case TRY_CATCH_EXPR:
8953 tree handler = TREE_OPERAND (exp, 1);
8955 expand_eh_region_start ();
8957 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8959 expand_eh_region_end_cleanup (handler);
8964 case TRY_FINALLY_EXPR:
8966 tree try_block = TREE_OPERAND (exp, 0);
8967 tree finally_block = TREE_OPERAND (exp, 1);
8969 if (!optimize || unsafe_for_reeval (finally_block) > 1)
8971 /* In this case, wrapping FINALLY_BLOCK in an UNSAVE_EXPR
8972 is not sufficient, so we cannot expand the block twice.
8973 So we play games with GOTO_SUBROUTINE_EXPR to let us
8974 expand the thing only once. */
8975 /* When not optimizing, we go ahead with this form since
8976 (1) user breakpoints operate more predictably without
8977 code duplication, and
8978 (2) we're not running any of the global optimizers
8979 that would explode in time/space with the highly
8980 connected CFG created by the indirect branching. */
8982 rtx finally_label = gen_label_rtx ();
8983 rtx done_label = gen_label_rtx ();
8984 rtx return_link = gen_reg_rtx (Pmode);
8985 tree cleanup = build (GOTO_SUBROUTINE_EXPR, void_type_node,
8986 (tree) finally_label, (tree) return_link);
8987 TREE_SIDE_EFFECTS (cleanup) = 1;
8989 /* Start a new binding layer that will keep track of all cleanup
8990 actions to be performed. */
8991 expand_start_bindings (2);
8992 target_temp_slot_level = temp_slot_level;
8994 expand_decl_cleanup (NULL_TREE, cleanup);
8995 op0 = expand_expr (try_block, target, tmode, modifier);
8997 preserve_temp_slots (op0);
8998 expand_end_bindings (NULL_TREE, 0, 0);
8999 emit_jump (done_label);
9000 emit_label (finally_label);
9001 expand_expr (finally_block, const0_rtx, VOIDmode, 0);
9002 emit_indirect_jump (return_link);
9003 emit_label (done_label);
9007 expand_start_bindings (2);
9008 target_temp_slot_level = temp_slot_level;
9010 expand_decl_cleanup (NULL_TREE, finally_block);
9011 op0 = expand_expr (try_block, target, tmode, modifier);
9013 preserve_temp_slots (op0);
9014 expand_end_bindings (NULL_TREE, 0, 0);
9020 case GOTO_SUBROUTINE_EXPR:
9022 rtx subr = (rtx) TREE_OPERAND (exp, 0);
9023 rtx return_link = *(rtx *) &TREE_OPERAND (exp, 1);
9024 rtx return_address = gen_label_rtx ();
9025 emit_move_insn (return_link,
9026 gen_rtx_LABEL_REF (Pmode, return_address));
9028 emit_label (return_address);
9033 return expand_builtin_va_arg (TREE_OPERAND (exp, 0), type);
9036 return get_exception_pointer (cfun);
9039 /* Function descriptors are not valid except for as
9040 initialization constants, and should not be expanded. */
9044 return (*lang_hooks.expand_expr) (exp, original_target, tmode, modifier);
9047 /* Here to do an ordinary binary operator, generating an instruction
9048 from the optab already placed in `this_optab'. */
9050 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
9052 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
9053 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9055 temp = expand_binop (mode, this_optab, op0, op1, target,
9056 unsignedp, OPTAB_LIB_WIDEN);
9062 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9063 when applied to the address of EXP produces an address known to be
9064 aligned more than BIGGEST_ALIGNMENT. */
9067 is_aligning_offset (offset, exp)
9071 /* Strip off any conversions and WITH_RECORD_EXPR nodes. */
9072 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9073 || TREE_CODE (offset) == NOP_EXPR
9074 || TREE_CODE (offset) == CONVERT_EXPR
9075 || TREE_CODE (offset) == WITH_RECORD_EXPR)
9076 offset = TREE_OPERAND (offset, 0);
9078 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9079 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9080 if (TREE_CODE (offset) != BIT_AND_EXPR
9081 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9082 || compare_tree_int (TREE_OPERAND (offset, 1), BIGGEST_ALIGNMENT) <= 0
9083 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9086 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9087 It must be NEGATE_EXPR. Then strip any more conversions. */
9088 offset = TREE_OPERAND (offset, 0);
9089 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9090 || TREE_CODE (offset) == NOP_EXPR
9091 || TREE_CODE (offset) == CONVERT_EXPR)
9092 offset = TREE_OPERAND (offset, 0);
9094 if (TREE_CODE (offset) != NEGATE_EXPR)
9097 offset = TREE_OPERAND (offset, 0);
9098 while (TREE_CODE (offset) == NON_LVALUE_EXPR
9099 || TREE_CODE (offset) == NOP_EXPR
9100 || TREE_CODE (offset) == CONVERT_EXPR)
9101 offset = TREE_OPERAND (offset, 0);
9103 /* This must now be the address either of EXP or of a PLACEHOLDER_EXPR
9104 whose type is the same as EXP. */
9105 return (TREE_CODE (offset) == ADDR_EXPR
9106 && (TREE_OPERAND (offset, 0) == exp
9107 || (TREE_CODE (TREE_OPERAND (offset, 0)) == PLACEHOLDER_EXPR
9108 && (TREE_TYPE (TREE_OPERAND (offset, 0))
9109 == TREE_TYPE (exp)))));
9112 /* Return the tree node if an ARG corresponds to a string constant or zero
9113 if it doesn't. If we return non-zero, set *PTR_OFFSET to the offset
9114 in bytes within the string that ARG is accessing. The type of the
9115 offset will be `sizetype'. */
9118 string_constant (arg, ptr_offset)
9124 if (TREE_CODE (arg) == ADDR_EXPR
9125 && TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9127 *ptr_offset = size_zero_node;
9128 return TREE_OPERAND (arg, 0);
9130 else if (TREE_CODE (arg) == PLUS_EXPR)
9132 tree arg0 = TREE_OPERAND (arg, 0);
9133 tree arg1 = TREE_OPERAND (arg, 1);
9138 if (TREE_CODE (arg0) == ADDR_EXPR
9139 && TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST)
9141 *ptr_offset = convert (sizetype, arg1);
9142 return TREE_OPERAND (arg0, 0);
9144 else if (TREE_CODE (arg1) == ADDR_EXPR
9145 && TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST)
9147 *ptr_offset = convert (sizetype, arg0);
9148 return TREE_OPERAND (arg1, 0);
9155 /* Expand code for a post- or pre- increment or decrement
9156 and return the RTX for the result.
9157 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
9160 expand_increment (exp, post, ignore)
9166 tree incremented = TREE_OPERAND (exp, 0);
9167 optab this_optab = add_optab;
9169 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
9170 int op0_is_copy = 0;
9171 int single_insn = 0;
9172 /* 1 means we can't store into OP0 directly,
9173 because it is a subreg narrower than a word,
9174 and we don't dare clobber the rest of the word. */
9177 /* Stabilize any component ref that might need to be
9178 evaluated more than once below. */
9180 || TREE_CODE (incremented) == BIT_FIELD_REF
9181 || (TREE_CODE (incremented) == COMPONENT_REF
9182 && (TREE_CODE (TREE_OPERAND (incremented, 0)) != INDIRECT_REF
9183 || DECL_BIT_FIELD (TREE_OPERAND (incremented, 1)))))
9184 incremented = stabilize_reference (incremented);
9185 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
9186 ones into save exprs so that they don't accidentally get evaluated
9187 more than once by the code below. */
9188 if (TREE_CODE (incremented) == PREINCREMENT_EXPR
9189 || TREE_CODE (incremented) == PREDECREMENT_EXPR)
9190 incremented = save_expr (incremented);
9192 /* Compute the operands as RTX.
9193 Note whether OP0 is the actual lvalue or a copy of it:
9194 I believe it is a copy iff it is a register or subreg
9195 and insns were generated in computing it. */
9197 temp = get_last_insn ();
9198 op0 = expand_expr (incremented, NULL_RTX, VOIDmode, 0);
9200 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
9201 in place but instead must do sign- or zero-extension during assignment,
9202 so we copy it into a new register and let the code below use it as
9205 Note that we can safely modify this SUBREG since it is know not to be
9206 shared (it was made by the expand_expr call above). */
9208 if (GET_CODE (op0) == SUBREG && SUBREG_PROMOTED_VAR_P (op0))
9211 SUBREG_REG (op0) = copy_to_reg (SUBREG_REG (op0));
9215 else if (GET_CODE (op0) == SUBREG
9216 && GET_MODE_BITSIZE (GET_MODE (op0)) < BITS_PER_WORD)
9218 /* We cannot increment this SUBREG in place. If we are
9219 post-incrementing, get a copy of the old value. Otherwise,
9220 just mark that we cannot increment in place. */
9222 op0 = copy_to_reg (op0);
9227 op0_is_copy = ((GET_CODE (op0) == SUBREG || GET_CODE (op0) == REG)
9228 && temp != get_last_insn ());
9229 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9231 /* Decide whether incrementing or decrementing. */
9232 if (TREE_CODE (exp) == POSTDECREMENT_EXPR
9233 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9234 this_optab = sub_optab;
9236 /* Convert decrement by a constant into a negative increment. */
9237 if (this_optab == sub_optab
9238 && GET_CODE (op1) == CONST_INT)
9240 op1 = GEN_INT (-INTVAL (op1));
9241 this_optab = add_optab;
9244 if (TYPE_TRAP_SIGNED (TREE_TYPE (exp)))
9245 this_optab = this_optab == add_optab ? addv_optab : subv_optab;
9247 /* For a preincrement, see if we can do this with a single instruction. */
9250 icode = (int) this_optab->handlers[(int) mode].insn_code;
9251 if (icode != (int) CODE_FOR_nothing
9252 /* Make sure that OP0 is valid for operands 0 and 1
9253 of the insn we want to queue. */
9254 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9255 && (*insn_data[icode].operand[1].predicate) (op0, mode)
9256 && (*insn_data[icode].operand[2].predicate) (op1, mode))
9260 /* If OP0 is not the actual lvalue, but rather a copy in a register,
9261 then we cannot just increment OP0. We must therefore contrive to
9262 increment the original value. Then, for postincrement, we can return
9263 OP0 since it is a copy of the old value. For preincrement, expand here
9264 unless we can do it with a single insn.
9266 Likewise if storing directly into OP0 would clobber high bits
9267 we need to preserve (bad_subreg). */
9268 if (op0_is_copy || (!post && !single_insn) || bad_subreg)
9270 /* This is the easiest way to increment the value wherever it is.
9271 Problems with multiple evaluation of INCREMENTED are prevented
9272 because either (1) it is a component_ref or preincrement,
9273 in which case it was stabilized above, or (2) it is an array_ref
9274 with constant index in an array in a register, which is
9275 safe to reevaluate. */
9276 tree newexp = build (((TREE_CODE (exp) == POSTDECREMENT_EXPR
9277 || TREE_CODE (exp) == PREDECREMENT_EXPR)
9278 ? MINUS_EXPR : PLUS_EXPR),
9281 TREE_OPERAND (exp, 1));
9283 while (TREE_CODE (incremented) == NOP_EXPR
9284 || TREE_CODE (incremented) == CONVERT_EXPR)
9286 newexp = convert (TREE_TYPE (incremented), newexp);
9287 incremented = TREE_OPERAND (incremented, 0);
9290 temp = expand_assignment (incremented, newexp, ! post && ! ignore , 0);
9291 return post ? op0 : temp;
9296 /* We have a true reference to the value in OP0.
9297 If there is an insn to add or subtract in this mode, queue it.
9298 Queueing the increment insn avoids the register shuffling
9299 that often results if we must increment now and first save
9300 the old value for subsequent use. */
9302 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
9303 op0 = stabilize (op0);
9306 icode = (int) this_optab->handlers[(int) mode].insn_code;
9307 if (icode != (int) CODE_FOR_nothing
9308 /* Make sure that OP0 is valid for operands 0 and 1
9309 of the insn we want to queue. */
9310 && (*insn_data[icode].operand[0].predicate) (op0, mode)
9311 && (*insn_data[icode].operand[1].predicate) (op0, mode))
9313 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9314 op1 = force_reg (mode, op1);
9316 return enqueue_insn (op0, GEN_FCN (icode) (op0, op0, op1));
9318 if (icode != (int) CODE_FOR_nothing && GET_CODE (op0) == MEM)
9320 rtx addr = (general_operand (XEXP (op0, 0), mode)
9321 ? force_reg (Pmode, XEXP (op0, 0))
9322 : copy_to_reg (XEXP (op0, 0)));
9325 op0 = replace_equiv_address (op0, addr);
9326 temp = force_reg (GET_MODE (op0), op0);
9327 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
9328 op1 = force_reg (mode, op1);
9330 /* The increment queue is LIFO, thus we have to `queue'
9331 the instructions in reverse order. */
9332 enqueue_insn (op0, gen_move_insn (op0, temp));
9333 result = enqueue_insn (temp, GEN_FCN (icode) (temp, temp, op1));
9338 /* Preincrement, or we can't increment with one simple insn. */
9340 /* Save a copy of the value before inc or dec, to return it later. */
9341 temp = value = copy_to_reg (op0);
9343 /* Arrange to return the incremented value. */
9344 /* Copy the rtx because expand_binop will protect from the queue,
9345 and the results of that would be invalid for us to return
9346 if our caller does emit_queue before using our result. */
9347 temp = copy_rtx (value = op0);
9349 /* Increment however we can. */
9350 op1 = expand_binop (mode, this_optab, value, op1, op0,
9351 TREE_UNSIGNED (TREE_TYPE (exp)), OPTAB_LIB_WIDEN);
9353 /* Make sure the value is stored into OP0. */
9355 emit_move_insn (op0, op1);
9360 /* At the start of a function, record that we have no previously-pushed
9361 arguments waiting to be popped. */
9364 init_pending_stack_adjust ()
9366 pending_stack_adjust = 0;
9369 /* When exiting from function, if safe, clear out any pending stack adjust
9370 so the adjustment won't get done.
9372 Note, if the current function calls alloca, then it must have a
9373 frame pointer regardless of the value of flag_omit_frame_pointer. */
9376 clear_pending_stack_adjust ()
9378 #ifdef EXIT_IGNORE_STACK
9380 && (! flag_omit_frame_pointer || current_function_calls_alloca)
9381 && EXIT_IGNORE_STACK
9382 && ! (DECL_INLINE (current_function_decl) && ! flag_no_inline)
9383 && ! flag_inline_functions)
9385 stack_pointer_delta -= pending_stack_adjust,
9386 pending_stack_adjust = 0;
9391 /* Pop any previously-pushed arguments that have not been popped yet. */
9394 do_pending_stack_adjust ()
9396 if (inhibit_defer_pop == 0)
9398 if (pending_stack_adjust != 0)
9399 adjust_stack (GEN_INT (pending_stack_adjust));
9400 pending_stack_adjust = 0;
9404 /* Expand conditional expressions. */
9406 /* Generate code to evaluate EXP and jump to LABEL if the value is zero.
9407 LABEL is an rtx of code CODE_LABEL, in this function and all the
9411 jumpifnot (exp, label)
9415 do_jump (exp, label, NULL_RTX);
9418 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
9425 do_jump (exp, NULL_RTX, label);
9428 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
9429 the result is zero, or IF_TRUE_LABEL if the result is one.
9430 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
9431 meaning fall through in that case.
9433 do_jump always does any pending stack adjust except when it does not
9434 actually perform a jump. An example where there is no jump
9435 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null.
9437 This function is responsible for optimizing cases such as
9438 &&, || and comparison operators in EXP. */
9441 do_jump (exp, if_false_label, if_true_label)
9443 rtx if_false_label, if_true_label;
9445 enum tree_code code = TREE_CODE (exp);
9446 /* Some cases need to create a label to jump to
9447 in order to properly fall through.
9448 These cases set DROP_THROUGH_LABEL nonzero. */
9449 rtx drop_through_label = 0;
9453 enum machine_mode mode;
9455 #ifdef MAX_INTEGER_COMPUTATION_MODE
9456 check_max_integer_computation_mode (exp);
9467 temp = integer_zerop (exp) ? if_false_label : if_true_label;
9473 /* This is not true with #pragma weak */
9475 /* The address of something can never be zero. */
9477 emit_jump (if_true_label);
9482 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
9483 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
9484 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF
9485 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_RANGE_REF)
9488 /* If we are narrowing the operand, we have to do the compare in the
9490 if ((TYPE_PRECISION (TREE_TYPE (exp))
9491 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
9493 case NON_LVALUE_EXPR:
9494 case REFERENCE_EXPR:
9499 /* These cannot change zero->non-zero or vice versa. */
9500 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9503 case WITH_RECORD_EXPR:
9504 /* Put the object on the placeholder list, recurse through our first
9505 operand, and pop the list. */
9506 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
9508 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9509 placeholder_list = TREE_CHAIN (placeholder_list);
9513 /* This is never less insns than evaluating the PLUS_EXPR followed by
9514 a test and can be longer if the test is eliminated. */
9516 /* Reduce to minus. */
9517 exp = build (MINUS_EXPR, TREE_TYPE (exp),
9518 TREE_OPERAND (exp, 0),
9519 fold (build1 (NEGATE_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
9520 TREE_OPERAND (exp, 1))));
9521 /* Process as MINUS. */
9525 /* Non-zero iff operands of minus differ. */
9526 do_compare_and_jump (build (NE_EXPR, TREE_TYPE (exp),
9527 TREE_OPERAND (exp, 0),
9528 TREE_OPERAND (exp, 1)),
9529 NE, NE, if_false_label, if_true_label);
9533 /* If we are AND'ing with a small constant, do this comparison in the
9534 smallest type that fits. If the machine doesn't have comparisons
9535 that small, it will be converted back to the wider comparison.
9536 This helps if we are testing the sign bit of a narrower object.
9537 combine can't do this for us because it can't know whether a
9538 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
9540 if (! SLOW_BYTE_ACCESS
9541 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
9542 && TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
9543 && (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0
9544 && (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
9545 && (type = (*lang_hooks.types.type_for_mode) (mode, 1)) != 0
9546 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9547 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9548 != CODE_FOR_nothing))
9550 do_jump (convert (type, exp), if_false_label, if_true_label);
9555 case TRUTH_NOT_EXPR:
9556 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9559 case TRUTH_ANDIF_EXPR:
9560 if (if_false_label == 0)
9561 if_false_label = drop_through_label = gen_label_rtx ();
9562 do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
9563 start_cleanup_deferral ();
9564 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9565 end_cleanup_deferral ();
9568 case TRUTH_ORIF_EXPR:
9569 if (if_true_label == 0)
9570 if_true_label = drop_through_label = gen_label_rtx ();
9571 do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
9572 start_cleanup_deferral ();
9573 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9574 end_cleanup_deferral ();
9579 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
9580 preserve_temp_slots (NULL_RTX);
9584 do_pending_stack_adjust ();
9585 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9591 case ARRAY_RANGE_REF:
9593 HOST_WIDE_INT bitsize, bitpos;
9595 enum machine_mode mode;
9600 /* Get description of this reference. We don't actually care
9601 about the underlying object here. */
9602 get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
9603 &unsignedp, &volatilep);
9605 type = (*lang_hooks.types.type_for_size) (bitsize, unsignedp);
9606 if (! SLOW_BYTE_ACCESS
9607 && type != 0 && bitsize >= 0
9608 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9609 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9610 != CODE_FOR_nothing))
9612 do_jump (convert (type, exp), if_false_label, if_true_label);
9619 /* Do (a ? 1 : 0) and (a ? 0 : 1) as special cases. */
9620 if (integer_onep (TREE_OPERAND (exp, 1))
9621 && integer_zerop (TREE_OPERAND (exp, 2)))
9622 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9624 else if (integer_zerop (TREE_OPERAND (exp, 1))
9625 && integer_onep (TREE_OPERAND (exp, 2)))
9626 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9630 rtx label1 = gen_label_rtx ();
9631 drop_through_label = gen_label_rtx ();
9633 do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
9635 start_cleanup_deferral ();
9636 /* Now the THEN-expression. */
9637 do_jump (TREE_OPERAND (exp, 1),
9638 if_false_label ? if_false_label : drop_through_label,
9639 if_true_label ? if_true_label : drop_through_label);
9640 /* In case the do_jump just above never jumps. */
9641 do_pending_stack_adjust ();
9642 emit_label (label1);
9644 /* Now the ELSE-expression. */
9645 do_jump (TREE_OPERAND (exp, 2),
9646 if_false_label ? if_false_label : drop_through_label,
9647 if_true_label ? if_true_label : drop_through_label);
9648 end_cleanup_deferral ();
9654 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9656 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9657 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9659 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9660 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9663 (build (TRUTH_ANDIF_EXPR, TREE_TYPE (exp),
9664 fold (build (EQ_EXPR, TREE_TYPE (exp),
9665 fold (build1 (REALPART_EXPR,
9666 TREE_TYPE (inner_type),
9668 fold (build1 (REALPART_EXPR,
9669 TREE_TYPE (inner_type),
9671 fold (build (EQ_EXPR, TREE_TYPE (exp),
9672 fold (build1 (IMAGPART_EXPR,
9673 TREE_TYPE (inner_type),
9675 fold (build1 (IMAGPART_EXPR,
9676 TREE_TYPE (inner_type),
9678 if_false_label, if_true_label);
9681 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9682 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9684 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9685 && !can_compare_p (EQ, TYPE_MODE (inner_type), ccp_jump))
9686 do_jump_by_parts_equality (exp, if_false_label, if_true_label);
9688 do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
9694 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9696 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9697 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9699 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9700 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9703 (build (TRUTH_ORIF_EXPR, TREE_TYPE (exp),
9704 fold (build (NE_EXPR, TREE_TYPE (exp),
9705 fold (build1 (REALPART_EXPR,
9706 TREE_TYPE (inner_type),
9708 fold (build1 (REALPART_EXPR,
9709 TREE_TYPE (inner_type),
9711 fold (build (NE_EXPR, TREE_TYPE (exp),
9712 fold (build1 (IMAGPART_EXPR,
9713 TREE_TYPE (inner_type),
9715 fold (build1 (IMAGPART_EXPR,
9716 TREE_TYPE (inner_type),
9718 if_false_label, if_true_label);
9721 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9722 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9724 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9725 && !can_compare_p (NE, TYPE_MODE (inner_type), ccp_jump))
9726 do_jump_by_parts_equality (exp, if_true_label, if_false_label);
9728 do_compare_and_jump (exp, NE, NE, 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 (LT, mode, ccp_jump))
9736 do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
9738 do_compare_and_jump (exp, LT, LTU, 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 (LE, mode, ccp_jump))
9745 do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
9747 do_compare_and_jump (exp, LE, LEU, if_false_label, if_true_label);
9751 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9752 if (GET_MODE_CLASS (mode) == MODE_INT
9753 && ! can_compare_p (GT, mode, ccp_jump))
9754 do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
9756 do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
9760 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9761 if (GET_MODE_CLASS (mode) == MODE_INT
9762 && ! can_compare_p (GE, mode, ccp_jump))
9763 do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
9765 do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
9768 case UNORDERED_EXPR:
9771 enum rtx_code cmp, rcmp;
9774 if (code == UNORDERED_EXPR)
9775 cmp = UNORDERED, rcmp = ORDERED;
9777 cmp = ORDERED, rcmp = UNORDERED;
9778 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9781 if (! can_compare_p (cmp, mode, ccp_jump)
9782 && (can_compare_p (rcmp, mode, ccp_jump)
9783 /* If the target doesn't provide either UNORDERED or ORDERED
9784 comparisons, canonicalize on UNORDERED for the library. */
9785 || rcmp == UNORDERED))
9789 do_compare_and_jump (exp, cmp, cmp, if_false_label, if_true_label);
9791 do_compare_and_jump (exp, rcmp, rcmp, if_true_label, if_false_label);
9796 enum rtx_code rcode1;
9797 enum tree_code tcode2;
9821 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9822 if (can_compare_p (rcode1, mode, ccp_jump))
9823 do_compare_and_jump (exp, rcode1, rcode1, if_false_label,
9827 tree op0 = save_expr (TREE_OPERAND (exp, 0));
9828 tree op1 = save_expr (TREE_OPERAND (exp, 1));
9831 /* If the target doesn't support combined unordered
9832 compares, decompose into UNORDERED + comparison. */
9833 cmp0 = fold (build (UNORDERED_EXPR, TREE_TYPE (exp), op0, op1));
9834 cmp1 = fold (build (tcode2, TREE_TYPE (exp), op0, op1));
9835 exp = build (TRUTH_ORIF_EXPR, TREE_TYPE (exp), cmp0, cmp1);
9836 do_jump (exp, if_false_label, if_true_label);
9842 __builtin_expect (<test>, 0) and
9843 __builtin_expect (<test>, 1)
9845 We need to do this here, so that <test> is not converted to a SCC
9846 operation on machines that use condition code registers and COMPARE
9847 like the PowerPC, and then the jump is done based on whether the SCC
9848 operation produced a 1 or 0. */
9850 /* Check for a built-in function. */
9851 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
9853 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
9854 tree arglist = TREE_OPERAND (exp, 1);
9856 if (TREE_CODE (fndecl) == FUNCTION_DECL
9857 && DECL_BUILT_IN (fndecl)
9858 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT
9859 && arglist != NULL_TREE
9860 && TREE_CHAIN (arglist) != NULL_TREE)
9862 rtx seq = expand_builtin_expect_jump (exp, if_false_label,
9865 if (seq != NULL_RTX)
9872 /* fall through and generate the normal code. */
9876 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
9878 /* This is not needed any more and causes poor code since it causes
9879 comparisons and tests from non-SI objects to have different code
9881 /* Copy to register to avoid generating bad insns by cse
9882 from (set (mem ...) (arithop)) (set (cc0) (mem ...)). */
9883 if (!cse_not_expected && GET_CODE (temp) == MEM)
9884 temp = copy_to_reg (temp);
9886 do_pending_stack_adjust ();
9887 /* Do any postincrements in the expression that was tested. */
9890 if (GET_CODE (temp) == CONST_INT
9891 || (GET_CODE (temp) == CONST_DOUBLE && GET_MODE (temp) == VOIDmode)
9892 || GET_CODE (temp) == LABEL_REF)
9894 rtx target = temp == const0_rtx ? if_false_label : if_true_label;
9898 else if (GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
9899 && ! can_compare_p (NE, GET_MODE (temp), ccp_jump))
9900 /* Note swapping the labels gives us not-equal. */
9901 do_jump_by_parts_equality_rtx (temp, if_true_label, if_false_label);
9902 else if (GET_MODE (temp) != VOIDmode)
9903 do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
9904 NE, TREE_UNSIGNED (TREE_TYPE (exp)),
9905 GET_MODE (temp), NULL_RTX,
9906 if_false_label, if_true_label);
9911 if (drop_through_label)
9913 /* If do_jump produces code that might be jumped around,
9914 do any stack adjusts from that code, before the place
9915 where control merges in. */
9916 do_pending_stack_adjust ();
9917 emit_label (drop_through_label);
9921 /* Given a comparison expression EXP for values too wide to be compared
9922 with one insn, test the comparison and jump to the appropriate label.
9923 The code of EXP is ignored; we always test GT if SWAP is 0,
9924 and LT if SWAP is 1. */
9927 do_jump_by_parts_greater (exp, swap, if_false_label, if_true_label)
9930 rtx if_false_label, if_true_label;
9932 rtx op0 = expand_expr (TREE_OPERAND (exp, swap), NULL_RTX, VOIDmode, 0);
9933 rtx op1 = expand_expr (TREE_OPERAND (exp, !swap), NULL_RTX, VOIDmode, 0);
9934 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9935 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
9937 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label);
9940 /* Compare OP0 with OP1, word at a time, in mode MODE.
9941 UNSIGNEDP says to do unsigned comparison.
9942 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
9945 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label)
9946 enum machine_mode mode;
9949 rtx if_false_label, if_true_label;
9951 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9952 rtx drop_through_label = 0;
9955 if (! if_true_label || ! if_false_label)
9956 drop_through_label = gen_label_rtx ();
9957 if (! if_true_label)
9958 if_true_label = drop_through_label;
9959 if (! if_false_label)
9960 if_false_label = drop_through_label;
9962 /* Compare a word at a time, high order first. */
9963 for (i = 0; i < nwords; i++)
9965 rtx op0_word, op1_word;
9967 if (WORDS_BIG_ENDIAN)
9969 op0_word = operand_subword_force (op0, i, mode);
9970 op1_word = operand_subword_force (op1, i, mode);
9974 op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
9975 op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
9978 /* All but high-order word must be compared as unsigned. */
9979 do_compare_rtx_and_jump (op0_word, op1_word, GT,
9980 (unsignedp || i > 0), word_mode, NULL_RTX,
9981 NULL_RTX, if_true_label);
9983 /* Consider lower words only if these are equal. */
9984 do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
9985 NULL_RTX, NULL_RTX, if_false_label);
9989 emit_jump (if_false_label);
9990 if (drop_through_label)
9991 emit_label (drop_through_label);
9994 /* Given an EQ_EXPR expression EXP for values too wide to be compared
9995 with one insn, test the comparison and jump to the appropriate label. */
9998 do_jump_by_parts_equality (exp, if_false_label, if_true_label)
10000 rtx if_false_label, if_true_label;
10002 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
10003 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
10004 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
10005 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
10007 rtx drop_through_label = 0;
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, mode),
10014 operand_subword_force (op1, i, mode),
10015 EQ, TREE_UNSIGNED (TREE_TYPE (exp)),
10016 word_mode, NULL_RTX, if_false_label, NULL_RTX);
10019 emit_jump (if_true_label);
10020 if (drop_through_label)
10021 emit_label (drop_through_label);
10024 /* Jump according to whether OP0 is 0.
10025 We assume that OP0 has an integer mode that is too wide
10026 for the available compare insns. */
10029 do_jump_by_parts_equality_rtx (op0, if_false_label, if_true_label)
10031 rtx if_false_label, if_true_label;
10033 int nwords = GET_MODE_SIZE (GET_MODE (op0)) / UNITS_PER_WORD;
10036 rtx drop_through_label = 0;
10038 /* The fastest way of doing this comparison on almost any machine is to
10039 "or" all the words and compare the result. If all have to be loaded
10040 from memory and this is a very wide item, it's possible this may
10041 be slower, but that's highly unlikely. */
10043 part = gen_reg_rtx (word_mode);
10044 emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
10045 for (i = 1; i < nwords && part != 0; i++)
10046 part = expand_binop (word_mode, ior_optab, part,
10047 operand_subword_force (op0, i, GET_MODE (op0)),
10048 part, 1, OPTAB_WIDEN);
10052 do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
10053 NULL_RTX, if_false_label, if_true_label);
10058 /* If we couldn't do the "or" simply, do this with a series of compares. */
10059 if (! if_false_label)
10060 drop_through_label = if_false_label = gen_label_rtx ();
10062 for (i = 0; i < nwords; i++)
10063 do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
10064 const0_rtx, EQ, 1, word_mode, NULL_RTX,
10065 if_false_label, NULL_RTX);
10068 emit_jump (if_true_label);
10070 if (drop_through_label)
10071 emit_label (drop_through_label);
10074 /* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
10075 (including code to compute the values to be compared)
10076 and set (CC0) according to the result.
10077 The decision as to signed or unsigned comparison must be made by the caller.
10079 We force a stack adjustment unless there are currently
10080 things pushed on the stack that aren't yet used.
10082 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
10086 compare_from_rtx (op0, op1, code, unsignedp, mode, size)
10088 enum rtx_code code;
10090 enum machine_mode mode;
10093 enum rtx_code ucode;
10096 /* If one operand is constant, make it the second one. Only do this
10097 if the other operand is not constant as well. */
10099 if (swap_commutative_operands_p (op0, op1))
10104 code = swap_condition (code);
10107 if (flag_force_mem)
10109 op0 = force_not_mem (op0);
10110 op1 = force_not_mem (op1);
10113 do_pending_stack_adjust ();
10115 ucode = unsignedp ? unsigned_condition (code) : code;
10116 if ((tem = simplify_relational_operation (ucode, mode, op0, op1)) != 0)
10120 /* There's no need to do this now that combine.c can eliminate lots of
10121 sign extensions. This can be less efficient in certain cases on other
10124 /* If this is a signed equality comparison, we can do it as an
10125 unsigned comparison since zero-extension is cheaper than sign
10126 extension and comparisons with zero are done as unsigned. This is
10127 the case even on machines that can do fast sign extension, since
10128 zero-extension is easier to combine with other operations than
10129 sign-extension is. If we are comparing against a constant, we must
10130 convert it to what it would look like unsigned. */
10131 if ((code == EQ || code == NE) && ! unsignedp
10132 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
10134 if (GET_CODE (op1) == CONST_INT
10135 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
10136 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
10141 emit_cmp_insn (op0, op1, code, size, mode, unsignedp);
10144 return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
10146 return gen_rtx_fmt_ee (code, VOIDmode, op0, op1);
10150 /* Like do_compare_and_jump but expects the values to compare as two rtx's.
10151 The decision as to signed or unsigned comparison must be made by the caller.
10153 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
10157 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, size,
10158 if_false_label, if_true_label)
10160 enum rtx_code code;
10162 enum machine_mode mode;
10164 rtx if_false_label, if_true_label;
10166 enum rtx_code ucode;
10168 int dummy_true_label = 0;
10170 /* Reverse the comparison if that is safe and we want to jump if it is
10172 if (! if_true_label && ! FLOAT_MODE_P (mode))
10174 if_true_label = if_false_label;
10175 if_false_label = 0;
10176 code = reverse_condition (code);
10179 /* If one operand is constant, make it the second one. Only do this
10180 if the other operand is not constant as well. */
10182 if (swap_commutative_operands_p (op0, op1))
10187 code = swap_condition (code);
10190 if (flag_force_mem)
10192 op0 = force_not_mem (op0);
10193 op1 = force_not_mem (op1);
10196 do_pending_stack_adjust ();
10198 ucode = unsignedp ? unsigned_condition (code) : code;
10199 if ((tem = simplify_relational_operation (ucode, mode, op0, op1)) != 0)
10201 if (tem == const_true_rtx)
10204 emit_jump (if_true_label);
10208 if (if_false_label)
10209 emit_jump (if_false_label);
10215 /* There's no need to do this now that combine.c can eliminate lots of
10216 sign extensions. This can be less efficient in certain cases on other
10219 /* If this is a signed equality comparison, we can do it as an
10220 unsigned comparison since zero-extension is cheaper than sign
10221 extension and comparisons with zero are done as unsigned. This is
10222 the case even on machines that can do fast sign extension, since
10223 zero-extension is easier to combine with other operations than
10224 sign-extension is. If we are comparing against a constant, we must
10225 convert it to what it would look like unsigned. */
10226 if ((code == EQ || code == NE) && ! unsignedp
10227 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
10229 if (GET_CODE (op1) == CONST_INT
10230 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
10231 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
10236 if (! if_true_label)
10238 dummy_true_label = 1;
10239 if_true_label = gen_label_rtx ();
10242 emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp,
10245 if (if_false_label)
10246 emit_jump (if_false_label);
10247 if (dummy_true_label)
10248 emit_label (if_true_label);
10251 /* Generate code for a comparison expression EXP (including code to compute
10252 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
10253 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
10254 generated code will drop through.
10255 SIGNED_CODE should be the rtx operation for this comparison for
10256 signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
10258 We force a stack adjustment unless there are currently
10259 things pushed on the stack that aren't yet used. */
10262 do_compare_and_jump (exp, signed_code, unsigned_code, if_false_label,
10265 enum rtx_code signed_code, unsigned_code;
10266 rtx if_false_label, if_true_label;
10270 enum machine_mode mode;
10272 enum rtx_code code;
10274 /* Don't crash if the comparison was erroneous. */
10275 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
10276 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
10279 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
10280 if (TREE_CODE (TREE_OPERAND (exp, 1)) == ERROR_MARK)
10283 type = TREE_TYPE (TREE_OPERAND (exp, 0));
10284 mode = TYPE_MODE (type);
10285 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
10286 && (TREE_CODE (TREE_OPERAND (exp, 1)) != INTEGER_CST
10287 || (GET_MODE_BITSIZE (mode)
10288 > GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp,
10291 /* op0 might have been replaced by promoted constant, in which
10292 case the type of second argument should be used. */
10293 type = TREE_TYPE (TREE_OPERAND (exp, 1));
10294 mode = TYPE_MODE (type);
10296 unsignedp = TREE_UNSIGNED (type);
10297 code = unsignedp ? unsigned_code : signed_code;
10299 #ifdef HAVE_canonicalize_funcptr_for_compare
10300 /* If function pointers need to be "canonicalized" before they can
10301 be reliably compared, then canonicalize them. */
10302 if (HAVE_canonicalize_funcptr_for_compare
10303 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
10304 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
10307 rtx new_op0 = gen_reg_rtx (mode);
10309 emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
10313 if (HAVE_canonicalize_funcptr_for_compare
10314 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
10315 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
10318 rtx new_op1 = gen_reg_rtx (mode);
10320 emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
10325 /* Do any postincrements in the expression that was tested. */
10328 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
10330 ? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
10331 if_false_label, if_true_label);
10334 /* Generate code to calculate EXP using a store-flag instruction
10335 and return an rtx for the result. EXP is either a comparison
10336 or a TRUTH_NOT_EXPR whose operand is a comparison.
10338 If TARGET is nonzero, store the result there if convenient.
10340 If ONLY_CHEAP is non-zero, only do this if it is likely to be very
10343 Return zero if there is no suitable set-flag instruction
10344 available on this machine.
10346 Once expand_expr has been called on the arguments of the comparison,
10347 we are committed to doing the store flag, since it is not safe to
10348 re-evaluate the expression. We emit the store-flag insn by calling
10349 emit_store_flag, but only expand the arguments if we have a reason
10350 to believe that emit_store_flag will be successful. If we think that
10351 it will, but it isn't, we have to simulate the store-flag with a
10352 set/jump/set sequence. */
10355 do_store_flag (exp, target, mode, only_cheap)
10358 enum machine_mode mode;
10361 enum rtx_code code;
10362 tree arg0, arg1, type;
10364 enum machine_mode operand_mode;
10368 enum insn_code icode;
10369 rtx subtarget = target;
10372 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
10373 result at the end. We can't simply invert the test since it would
10374 have already been inverted if it were valid. This case occurs for
10375 some floating-point comparisons. */
10377 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
10378 invert = 1, exp = TREE_OPERAND (exp, 0);
10380 arg0 = TREE_OPERAND (exp, 0);
10381 arg1 = TREE_OPERAND (exp, 1);
10383 /* Don't crash if the comparison was erroneous. */
10384 if (arg0 == error_mark_node || arg1 == error_mark_node)
10387 type = TREE_TYPE (arg0);
10388 operand_mode = TYPE_MODE (type);
10389 unsignedp = TREE_UNSIGNED (type);
10391 /* We won't bother with BLKmode store-flag operations because it would mean
10392 passing a lot of information to emit_store_flag. */
10393 if (operand_mode == BLKmode)
10396 /* We won't bother with store-flag operations involving function pointers
10397 when function pointers must be canonicalized before comparisons. */
10398 #ifdef HAVE_canonicalize_funcptr_for_compare
10399 if (HAVE_canonicalize_funcptr_for_compare
10400 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
10401 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
10403 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
10404 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
10405 == FUNCTION_TYPE))))
10412 /* Get the rtx comparison code to use. We know that EXP is a comparison
10413 operation of some type. Some comparisons against 1 and -1 can be
10414 converted to comparisons with zero. Do so here so that the tests
10415 below will be aware that we have a comparison with zero. These
10416 tests will not catch constants in the first operand, but constants
10417 are rarely passed as the first operand. */
10419 switch (TREE_CODE (exp))
10428 if (integer_onep (arg1))
10429 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10431 code = unsignedp ? LTU : LT;
10434 if (! unsignedp && integer_all_onesp (arg1))
10435 arg1 = integer_zero_node, code = LT;
10437 code = unsignedp ? LEU : LE;
10440 if (! unsignedp && integer_all_onesp (arg1))
10441 arg1 = integer_zero_node, code = GE;
10443 code = unsignedp ? GTU : GT;
10446 if (integer_onep (arg1))
10447 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10449 code = unsignedp ? GEU : GE;
10452 case UNORDERED_EXPR:
10478 /* Put a constant second. */
10479 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
10481 tem = arg0; arg0 = arg1; arg1 = tem;
10482 code = swap_condition (code);
10485 /* If this is an equality or inequality test of a single bit, we can
10486 do this by shifting the bit being tested to the low-order bit and
10487 masking the result with the constant 1. If the condition was EQ,
10488 we xor it with 1. This does not require an scc insn and is faster
10489 than an scc insn even if we have it. */
10491 if ((code == NE || code == EQ)
10492 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10493 && integer_pow2p (TREE_OPERAND (arg0, 1)))
10495 tree inner = TREE_OPERAND (arg0, 0);
10496 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
10499 /* If INNER is a right shift of a constant and it plus BITNUM does
10500 not overflow, adjust BITNUM and INNER. */
10502 if (TREE_CODE (inner) == RSHIFT_EXPR
10503 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
10504 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
10505 && bitnum < TYPE_PRECISION (type)
10506 && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
10507 bitnum - TYPE_PRECISION (type)))
10509 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
10510 inner = TREE_OPERAND (inner, 0);
10513 /* If we are going to be able to omit the AND below, we must do our
10514 operations as unsigned. If we must use the AND, we have a choice.
10515 Normally unsigned is faster, but for some machines signed is. */
10516 ops_unsignedp = (bitnum == TYPE_PRECISION (type) - 1 ? 1
10517 #ifdef LOAD_EXTEND_OP
10518 : (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND ? 0 : 1)
10524 if (! get_subtarget (subtarget)
10525 || GET_MODE (subtarget) != operand_mode
10526 || ! safe_from_p (subtarget, inner, 1))
10529 op0 = expand_expr (inner, subtarget, VOIDmode, 0);
10532 op0 = expand_shift (RSHIFT_EXPR, operand_mode, op0,
10533 size_int (bitnum), subtarget, ops_unsignedp);
10535 if (GET_MODE (op0) != mode)
10536 op0 = convert_to_mode (mode, op0, ops_unsignedp);
10538 if ((code == EQ && ! invert) || (code == NE && invert))
10539 op0 = expand_binop (mode, xor_optab, op0, const1_rtx, subtarget,
10540 ops_unsignedp, OPTAB_LIB_WIDEN);
10542 /* Put the AND last so it can combine with more things. */
10543 if (bitnum != TYPE_PRECISION (type) - 1)
10544 op0 = expand_and (mode, op0, const1_rtx, subtarget);
10549 /* Now see if we are likely to be able to do this. Return if not. */
10550 if (! can_compare_p (code, operand_mode, ccp_store_flag))
10553 icode = setcc_gen_code[(int) code];
10554 if (icode == CODE_FOR_nothing
10555 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
10557 /* We can only do this if it is one of the special cases that
10558 can be handled without an scc insn. */
10559 if ((code == LT && integer_zerop (arg1))
10560 || (! only_cheap && code == GE && integer_zerop (arg1)))
10562 else if (BRANCH_COST >= 0
10563 && ! only_cheap && (code == NE || code == EQ)
10564 && TREE_CODE (type) != REAL_TYPE
10565 && ((abs_optab->handlers[(int) operand_mode].insn_code
10566 != CODE_FOR_nothing)
10567 || (ffs_optab->handlers[(int) operand_mode].insn_code
10568 != CODE_FOR_nothing)))
10574 if (! get_subtarget (target)
10575 || GET_MODE (subtarget) != operand_mode
10576 || ! safe_from_p (subtarget, arg1, 1))
10579 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
10580 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
10583 target = gen_reg_rtx (mode);
10585 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10586 because, if the emit_store_flag does anything it will succeed and
10587 OP0 and OP1 will not be used subsequently. */
10589 result = emit_store_flag (target, code,
10590 queued_subexp_p (op0) ? copy_rtx (op0) : op0,
10591 queued_subexp_p (op1) ? copy_rtx (op1) : op1,
10592 operand_mode, unsignedp, 1);
10597 result = expand_binop (mode, xor_optab, result, const1_rtx,
10598 result, 0, OPTAB_LIB_WIDEN);
10602 /* If this failed, we have to do this with set/compare/jump/set code. */
10603 if (GET_CODE (target) != REG
10604 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
10605 target = gen_reg_rtx (GET_MODE (target));
10607 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
10608 result = compare_from_rtx (op0, op1, code, unsignedp,
10609 operand_mode, NULL_RTX);
10610 if (GET_CODE (result) == CONST_INT)
10611 return (((result == const0_rtx && ! invert)
10612 || (result != const0_rtx && invert))
10613 ? const0_rtx : const1_rtx);
10615 /* The code of RESULT may not match CODE if compare_from_rtx
10616 decided to swap its operands and reverse the original code.
10618 We know that compare_from_rtx returns either a CONST_INT or
10619 a new comparison code, so it is safe to just extract the
10620 code from RESULT. */
10621 code = GET_CODE (result);
10623 label = gen_label_rtx ();
10624 if (bcc_gen_fctn[(int) code] == 0)
10627 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
10628 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
10629 emit_label (label);
10635 /* Stubs in case we haven't got a casesi insn. */
10636 #ifndef HAVE_casesi
10637 # define HAVE_casesi 0
10638 # define gen_casesi(a, b, c, d, e) (0)
10639 # define CODE_FOR_casesi CODE_FOR_nothing
10642 /* If the machine does not have a case insn that compares the bounds,
10643 this means extra overhead for dispatch tables, which raises the
10644 threshold for using them. */
10645 #ifndef CASE_VALUES_THRESHOLD
10646 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
10647 #endif /* CASE_VALUES_THRESHOLD */
10650 case_values_threshold ()
10652 return CASE_VALUES_THRESHOLD;
10655 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10656 0 otherwise (i.e. if there is no casesi instruction). */
10658 try_casesi (index_type, index_expr, minval, range,
10659 table_label, default_label)
10660 tree index_type, index_expr, minval, range;
10661 rtx table_label ATTRIBUTE_UNUSED;
10664 enum machine_mode index_mode = SImode;
10665 int index_bits = GET_MODE_BITSIZE (index_mode);
10666 rtx op1, op2, index;
10667 enum machine_mode op_mode;
10672 /* Convert the index to SImode. */
10673 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10675 enum machine_mode omode = TYPE_MODE (index_type);
10676 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
10678 /* We must handle the endpoints in the original mode. */
10679 index_expr = build (MINUS_EXPR, index_type,
10680 index_expr, minval);
10681 minval = integer_zero_node;
10682 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10683 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10684 omode, 1, default_label);
10685 /* Now we can safely truncate. */
10686 index = convert_to_mode (index_mode, index, 0);
10690 if (TYPE_MODE (index_type) != index_mode)
10692 index_expr = convert ((*lang_hooks.types.type_for_size)
10693 (index_bits, 0), index_expr);
10694 index_type = TREE_TYPE (index_expr);
10697 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10700 index = protect_from_queue (index, 0);
10701 do_pending_stack_adjust ();
10703 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10704 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10706 index = copy_to_mode_reg (op_mode, index);
10708 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
10710 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10711 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10712 op1, TREE_UNSIGNED (TREE_TYPE (minval)));
10713 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10715 op1 = copy_to_mode_reg (op_mode, op1);
10717 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
10719 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10720 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10721 op2, TREE_UNSIGNED (TREE_TYPE (range)));
10722 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10724 op2 = copy_to_mode_reg (op_mode, op2);
10726 emit_jump_insn (gen_casesi (index, op1, op2,
10727 table_label, default_label));
10731 /* Attempt to generate a tablejump instruction; same concept. */
10732 #ifndef HAVE_tablejump
10733 #define HAVE_tablejump 0
10734 #define gen_tablejump(x, y) (0)
10737 /* Subroutine of the next function.
10739 INDEX is the value being switched on, with the lowest value
10740 in the table already subtracted.
10741 MODE is its expected mode (needed if INDEX is constant).
10742 RANGE is the length of the jump table.
10743 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10745 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10746 index value is out of range. */
10749 do_tablejump (index, mode, range, table_label, default_label)
10750 rtx index, range, table_label, default_label;
10751 enum machine_mode mode;
10755 /* Do an unsigned comparison (in the proper mode) between the index
10756 expression and the value which represents the length of the range.
10757 Since we just finished subtracting the lower bound of the range
10758 from the index expression, this comparison allows us to simultaneously
10759 check that the original index expression value is both greater than
10760 or equal to the minimum value of the range and less than or equal to
10761 the maximum value of the range. */
10763 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10766 /* If index is in range, it must fit in Pmode.
10767 Convert to Pmode so we can index with it. */
10769 index = convert_to_mode (Pmode, index, 1);
10771 /* Don't let a MEM slip thru, because then INDEX that comes
10772 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10773 and break_out_memory_refs will go to work on it and mess it up. */
10774 #ifdef PIC_CASE_VECTOR_ADDRESS
10775 if (flag_pic && GET_CODE (index) != REG)
10776 index = copy_to_mode_reg (Pmode, index);
10779 /* If flag_force_addr were to affect this address
10780 it could interfere with the tricky assumptions made
10781 about addresses that contain label-refs,
10782 which may be valid only very near the tablejump itself. */
10783 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10784 GET_MODE_SIZE, because this indicates how large insns are. The other
10785 uses should all be Pmode, because they are addresses. This code
10786 could fail if addresses and insns are not the same size. */
10787 index = gen_rtx_PLUS (Pmode,
10788 gen_rtx_MULT (Pmode, index,
10789 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10790 gen_rtx_LABEL_REF (Pmode, table_label));
10791 #ifdef PIC_CASE_VECTOR_ADDRESS
10793 index = PIC_CASE_VECTOR_ADDRESS (index);
10796 index = memory_address_noforce (CASE_VECTOR_MODE, index);
10797 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10798 vector = gen_rtx_MEM (CASE_VECTOR_MODE, index);
10799 RTX_UNCHANGING_P (vector) = 1;
10800 convert_move (temp, vector, 0);
10802 emit_jump_insn (gen_tablejump (temp, table_label));
10804 /* If we are generating PIC code or if the table is PC-relative, the
10805 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10806 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10811 try_tablejump (index_type, index_expr, minval, range,
10812 table_label, default_label)
10813 tree index_type, index_expr, minval, range;
10814 rtx table_label, default_label;
10818 if (! HAVE_tablejump)
10821 index_expr = fold (build (MINUS_EXPR, index_type,
10822 convert (index_type, index_expr),
10823 convert (index_type, minval)));
10824 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10826 index = protect_from_queue (index, 0);
10827 do_pending_stack_adjust ();
10829 do_tablejump (index, TYPE_MODE (index_type),
10830 convert_modes (TYPE_MODE (index_type),
10831 TYPE_MODE (TREE_TYPE (range)),
10832 expand_expr (range, NULL_RTX,
10834 TREE_UNSIGNED (TREE_TYPE (range))),
10835 table_label, default_label);
10839 /* Nonzero if the mode is a valid vector mode for this architecture.
10840 This returns nonzero even if there is no hardware support for the
10841 vector mode, but we can emulate with narrower modes. */
10844 vector_mode_valid_p (mode)
10845 enum machine_mode mode;
10847 enum mode_class class = GET_MODE_CLASS (mode);
10848 enum machine_mode innermode;
10850 /* Doh! What's going on? */
10851 if (class != MODE_VECTOR_INT
10852 && class != MODE_VECTOR_FLOAT)
10855 /* Hardware support. Woo hoo! */
10856 if (VECTOR_MODE_SUPPORTED_P (mode))
10859 innermode = GET_MODE_INNER (mode);
10861 /* We should probably return 1 if requesting V4DI and we have no DI,
10862 but we have V2DI, but this is probably very unlikely. */
10864 /* If we have support for the inner mode, we can safely emulate it.
10865 We may not have V2DI, but me can emulate with a pair of DIs. */
10866 return mov_optab->handlers[innermode].insn_code != CODE_FOR_nothing;
10869 #include "gt-expr.h"