1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001 Free Software Foundation, Inc.
5 This file is part of 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
30 #include "hard-reg-set.h"
33 #include "insn-config.h"
34 #include "insn-attr.h"
35 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
42 #include "typeclass.h"
45 #include "langhooks.h"
49 /* Decide whether a function's arguments should be processed
50 from first to last or from last to first.
52 They should if the stack and args grow in opposite directions, but
53 only if we have push insns. */
57 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
58 #define PUSH_ARGS_REVERSED /* If it's last to first. */
63 #ifndef STACK_PUSH_CODE
64 #ifdef STACK_GROWS_DOWNWARD
65 #define STACK_PUSH_CODE PRE_DEC
67 #define STACK_PUSH_CODE PRE_INC
71 /* Assume that case vectors are not pc-relative. */
72 #ifndef CASE_VECTOR_PC_RELATIVE
73 #define CASE_VECTOR_PC_RELATIVE 0
76 /* If this is nonzero, we do not bother generating VOLATILE
77 around volatile memory references, and we are willing to
78 output indirect addresses. If cse is to follow, we reject
79 indirect addresses so a useful potential cse is generated;
80 if it is used only once, instruction combination will produce
81 the same indirect address eventually. */
84 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
85 static tree placeholder_list = 0;
87 /* This structure is used by move_by_pieces to describe the move to
98 int explicit_inc_from;
99 unsigned HOST_WIDE_INT len;
100 HOST_WIDE_INT offset;
104 /* This structure is used by store_by_pieces to describe the clear to
107 struct store_by_pieces
113 unsigned HOST_WIDE_INT len;
114 HOST_WIDE_INT offset;
115 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
120 extern struct obstack permanent_obstack;
122 static rtx enqueue_insn PARAMS ((rtx, rtx));
123 static unsigned HOST_WIDE_INT move_by_pieces_ninsns
124 PARAMS ((unsigned HOST_WIDE_INT,
126 static void move_by_pieces_1 PARAMS ((rtx (*) (rtx, ...), enum machine_mode,
127 struct move_by_pieces *));
128 static rtx clear_by_pieces_1 PARAMS ((PTR, HOST_WIDE_INT,
130 static void clear_by_pieces PARAMS ((rtx, unsigned HOST_WIDE_INT,
132 static void store_by_pieces_1 PARAMS ((struct store_by_pieces *,
134 static void store_by_pieces_2 PARAMS ((rtx (*) (rtx, ...),
136 struct store_by_pieces *));
137 static rtx get_subtarget PARAMS ((rtx));
138 static int is_zeros_p PARAMS ((tree));
139 static int mostly_zeros_p PARAMS ((tree));
140 static void store_constructor_field PARAMS ((rtx, unsigned HOST_WIDE_INT,
141 HOST_WIDE_INT, enum machine_mode,
142 tree, tree, int, int));
143 static void store_constructor PARAMS ((tree, rtx, int, HOST_WIDE_INT));
144 static rtx store_field PARAMS ((rtx, HOST_WIDE_INT,
145 HOST_WIDE_INT, enum machine_mode,
146 tree, enum machine_mode, int, tree,
148 static rtx var_rtx PARAMS ((tree));
149 static HOST_WIDE_INT highest_pow2_factor PARAMS ((tree));
150 static rtx expand_increment PARAMS ((tree, int, int));
151 static void do_jump_by_parts_greater PARAMS ((tree, int, rtx, rtx));
152 static void do_jump_by_parts_equality PARAMS ((tree, rtx, rtx));
153 static void do_compare_and_jump PARAMS ((tree, enum rtx_code, enum rtx_code,
155 static rtx do_store_flag PARAMS ((tree, rtx, enum machine_mode, int));
157 static void emit_single_push_insn PARAMS ((enum machine_mode, rtx, tree));
159 static void do_tablejump PARAMS ((rtx, enum machine_mode, rtx, rtx, rtx));
161 /* Record for each mode whether we can move a register directly to or
162 from an object of that mode in memory. If we can't, we won't try
163 to use that mode directly when accessing a field of that mode. */
165 static char direct_load[NUM_MACHINE_MODES];
166 static char direct_store[NUM_MACHINE_MODES];
168 /* If a memory-to-memory move would take MOVE_RATIO or more simple
169 move-instruction sequences, we will do a movstr or libcall instead. */
172 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
175 /* If we are optimizing for space (-Os), cut down the default move ratio. */
176 #define MOVE_RATIO (optimize_size ? 3 : 15)
180 /* This macro is used to determine whether move_by_pieces should be called
181 to perform a structure copy. */
182 #ifndef MOVE_BY_PIECES_P
183 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
184 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) MOVE_RATIO)
187 /* This array records the insn_code of insns to perform block moves. */
188 enum insn_code movstr_optab[NUM_MACHINE_MODES];
190 /* This array records the insn_code of insns to perform block clears. */
191 enum insn_code clrstr_optab[NUM_MACHINE_MODES];
193 /* SLOW_UNALIGNED_ACCESS is non-zero if unaligned accesses are very slow. */
195 #ifndef SLOW_UNALIGNED_ACCESS
196 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
199 /* This is run once per compilation to set up which modes can be used
200 directly in memory and to initialize the block move optab. */
206 enum machine_mode mode;
212 /* Try indexing by frame ptr and try by stack ptr.
213 It is known that on the Convex the stack ptr isn't a valid index.
214 With luck, one or the other is valid on any machine. */
215 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
216 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
218 insn = emit_insn (gen_rtx_SET (0, NULL_RTX, NULL_RTX));
219 pat = PATTERN (insn);
221 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
222 mode = (enum machine_mode) ((int) mode + 1))
227 direct_load[(int) mode] = direct_store[(int) mode] = 0;
228 PUT_MODE (mem, mode);
229 PUT_MODE (mem1, mode);
231 /* See if there is some register that can be used in this mode and
232 directly loaded or stored from memory. */
234 if (mode != VOIDmode && mode != BLKmode)
235 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
236 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
239 if (! HARD_REGNO_MODE_OK (regno, mode))
242 reg = gen_rtx_REG (mode, regno);
245 SET_DEST (pat) = reg;
246 if (recog (pat, insn, &num_clobbers) >= 0)
247 direct_load[(int) mode] = 1;
249 SET_SRC (pat) = mem1;
250 SET_DEST (pat) = reg;
251 if (recog (pat, insn, &num_clobbers) >= 0)
252 direct_load[(int) mode] = 1;
255 SET_DEST (pat) = mem;
256 if (recog (pat, insn, &num_clobbers) >= 0)
257 direct_store[(int) mode] = 1;
260 SET_DEST (pat) = mem1;
261 if (recog (pat, insn, &num_clobbers) >= 0)
262 direct_store[(int) mode] = 1;
269 /* This is run at the start of compiling a function. */
274 cfun->expr = (struct expr_status *) xmalloc (sizeof (struct expr_status));
277 pending_stack_adjust = 0;
278 stack_pointer_delta = 0;
279 inhibit_defer_pop = 0;
281 apply_args_value = 0;
287 struct expr_status *p;
292 ggc_mark_rtx (p->x_saveregs_value);
293 ggc_mark_rtx (p->x_apply_args_value);
294 ggc_mark_rtx (p->x_forced_labels);
305 /* Small sanity check that the queue is empty at the end of a function. */
308 finish_expr_for_function ()
314 /* Manage the queue of increment instructions to be output
315 for POSTINCREMENT_EXPR expressions, etc. */
317 /* Queue up to increment (or change) VAR later. BODY says how:
318 BODY should be the same thing you would pass to emit_insn
319 to increment right away. It will go to emit_insn later on.
321 The value is a QUEUED expression to be used in place of VAR
322 where you want to guarantee the pre-incrementation value of VAR. */
325 enqueue_insn (var, body)
328 pending_chain = gen_rtx_QUEUED (GET_MODE (var), var, NULL_RTX, NULL_RTX,
329 body, pending_chain);
330 return pending_chain;
333 /* Use protect_from_queue to convert a QUEUED expression
334 into something that you can put immediately into an instruction.
335 If the queued incrementation has not happened yet,
336 protect_from_queue returns the variable itself.
337 If the incrementation has happened, protect_from_queue returns a temp
338 that contains a copy of the old value of the variable.
340 Any time an rtx which might possibly be a QUEUED is to be put
341 into an instruction, it must be passed through protect_from_queue first.
342 QUEUED expressions are not meaningful in instructions.
344 Do not pass a value through protect_from_queue and then hold
345 on to it for a while before putting it in an instruction!
346 If the queue is flushed in between, incorrect code will result. */
349 protect_from_queue (x, modify)
353 RTX_CODE code = GET_CODE (x);
355 #if 0 /* A QUEUED can hang around after the queue is forced out. */
356 /* Shortcut for most common case. */
357 if (pending_chain == 0)
363 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
364 use of autoincrement. Make a copy of the contents of the memory
365 location rather than a copy of the address, but not if the value is
366 of mode BLKmode. Don't modify X in place since it might be
368 if (code == MEM && GET_MODE (x) != BLKmode
369 && GET_CODE (XEXP (x, 0)) == QUEUED && !modify)
372 rtx new = replace_equiv_address_nv (x, QUEUED_VAR (y));
376 rtx temp = gen_reg_rtx (GET_MODE (x));
378 emit_insn_before (gen_move_insn (temp, new),
383 /* Copy the address into a pseudo, so that the returned value
384 remains correct across calls to emit_queue. */
385 return replace_equiv_address (new, copy_to_reg (XEXP (new, 0)));
388 /* Otherwise, recursively protect the subexpressions of all
389 the kinds of rtx's that can contain a QUEUED. */
392 rtx tem = protect_from_queue (XEXP (x, 0), 0);
393 if (tem != XEXP (x, 0))
399 else if (code == PLUS || code == MULT)
401 rtx new0 = protect_from_queue (XEXP (x, 0), 0);
402 rtx new1 = protect_from_queue (XEXP (x, 1), 0);
403 if (new0 != XEXP (x, 0) || new1 != XEXP (x, 1))
412 /* If the increment has not happened, use the variable itself. Copy it
413 into a new pseudo so that the value remains correct across calls to
415 if (QUEUED_INSN (x) == 0)
416 return copy_to_reg (QUEUED_VAR (x));
417 /* If the increment has happened and a pre-increment copy exists,
419 if (QUEUED_COPY (x) != 0)
420 return QUEUED_COPY (x);
421 /* The increment has happened but we haven't set up a pre-increment copy.
422 Set one up now, and use it. */
423 QUEUED_COPY (x) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x)));
424 emit_insn_before (gen_move_insn (QUEUED_COPY (x), QUEUED_VAR (x)),
426 return QUEUED_COPY (x);
429 /* Return nonzero if X contains a QUEUED expression:
430 if it contains anything that will be altered by a queued increment.
431 We handle only combinations of MEM, PLUS, MINUS and MULT operators
432 since memory addresses generally contain only those. */
438 enum rtx_code code = GET_CODE (x);
444 return queued_subexp_p (XEXP (x, 0));
448 return (queued_subexp_p (XEXP (x, 0))
449 || queued_subexp_p (XEXP (x, 1)));
455 /* Perform all the pending incrementations. */
461 while ((p = pending_chain))
463 rtx body = QUEUED_BODY (p);
465 if (GET_CODE (body) == SEQUENCE)
467 QUEUED_INSN (p) = XVECEXP (QUEUED_BODY (p), 0, 0);
468 emit_insn (QUEUED_BODY (p));
471 QUEUED_INSN (p) = emit_insn (QUEUED_BODY (p));
472 pending_chain = QUEUED_NEXT (p);
476 /* Copy data from FROM to TO, where the machine modes are not the same.
477 Both modes may be integer, or both may be floating.
478 UNSIGNEDP should be nonzero if FROM is an unsigned type.
479 This causes zero-extension instead of sign-extension. */
482 convert_move (to, from, unsignedp)
486 enum machine_mode to_mode = GET_MODE (to);
487 enum machine_mode from_mode = GET_MODE (from);
488 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
489 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
493 /* rtx code for making an equivalent value. */
494 enum rtx_code equiv_code = (unsignedp ? ZERO_EXTEND : SIGN_EXTEND);
496 to = protect_from_queue (to, 1);
497 from = protect_from_queue (from, 0);
499 if (to_real != from_real)
502 /* If FROM is a SUBREG that indicates that we have already done at least
503 the required extension, strip it. We don't handle such SUBREGs as
506 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
507 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
508 >= GET_MODE_SIZE (to_mode))
509 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
510 from = gen_lowpart (to_mode, from), from_mode = to_mode;
512 if (GET_CODE (to) == SUBREG && SUBREG_PROMOTED_VAR_P (to))
515 if (to_mode == from_mode
516 || (from_mode == VOIDmode && CONSTANT_P (from)))
518 emit_move_insn (to, from);
522 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
524 if (GET_MODE_BITSIZE (from_mode) != GET_MODE_BITSIZE (to_mode))
527 if (VECTOR_MODE_P (to_mode))
528 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
530 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
532 emit_move_insn (to, from);
536 if (to_real != from_real)
543 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode))
545 /* Try converting directly if the insn is supported. */
546 if ((code = can_extend_p (to_mode, from_mode, 0))
549 emit_unop_insn (code, to, from, UNKNOWN);
554 #ifdef HAVE_trunchfqf2
555 if (HAVE_trunchfqf2 && from_mode == HFmode && to_mode == QFmode)
557 emit_unop_insn (CODE_FOR_trunchfqf2, to, from, UNKNOWN);
561 #ifdef HAVE_trunctqfqf2
562 if (HAVE_trunctqfqf2 && from_mode == TQFmode && to_mode == QFmode)
564 emit_unop_insn (CODE_FOR_trunctqfqf2, to, from, UNKNOWN);
568 #ifdef HAVE_truncsfqf2
569 if (HAVE_truncsfqf2 && from_mode == SFmode && to_mode == QFmode)
571 emit_unop_insn (CODE_FOR_truncsfqf2, to, from, UNKNOWN);
575 #ifdef HAVE_truncdfqf2
576 if (HAVE_truncdfqf2 && from_mode == DFmode && to_mode == QFmode)
578 emit_unop_insn (CODE_FOR_truncdfqf2, to, from, UNKNOWN);
582 #ifdef HAVE_truncxfqf2
583 if (HAVE_truncxfqf2 && from_mode == XFmode && to_mode == QFmode)
585 emit_unop_insn (CODE_FOR_truncxfqf2, to, from, UNKNOWN);
589 #ifdef HAVE_trunctfqf2
590 if (HAVE_trunctfqf2 && from_mode == TFmode && to_mode == QFmode)
592 emit_unop_insn (CODE_FOR_trunctfqf2, to, from, UNKNOWN);
597 #ifdef HAVE_trunctqfhf2
598 if (HAVE_trunctqfhf2 && from_mode == TQFmode && to_mode == HFmode)
600 emit_unop_insn (CODE_FOR_trunctqfhf2, to, from, UNKNOWN);
604 #ifdef HAVE_truncsfhf2
605 if (HAVE_truncsfhf2 && from_mode == SFmode && to_mode == HFmode)
607 emit_unop_insn (CODE_FOR_truncsfhf2, to, from, UNKNOWN);
611 #ifdef HAVE_truncdfhf2
612 if (HAVE_truncdfhf2 && from_mode == DFmode && to_mode == HFmode)
614 emit_unop_insn (CODE_FOR_truncdfhf2, to, from, UNKNOWN);
618 #ifdef HAVE_truncxfhf2
619 if (HAVE_truncxfhf2 && from_mode == XFmode && to_mode == HFmode)
621 emit_unop_insn (CODE_FOR_truncxfhf2, to, from, UNKNOWN);
625 #ifdef HAVE_trunctfhf2
626 if (HAVE_trunctfhf2 && from_mode == TFmode && to_mode == HFmode)
628 emit_unop_insn (CODE_FOR_trunctfhf2, to, from, UNKNOWN);
633 #ifdef HAVE_truncsftqf2
634 if (HAVE_truncsftqf2 && from_mode == SFmode && to_mode == TQFmode)
636 emit_unop_insn (CODE_FOR_truncsftqf2, to, from, UNKNOWN);
640 #ifdef HAVE_truncdftqf2
641 if (HAVE_truncdftqf2 && from_mode == DFmode && to_mode == TQFmode)
643 emit_unop_insn (CODE_FOR_truncdftqf2, to, from, UNKNOWN);
647 #ifdef HAVE_truncxftqf2
648 if (HAVE_truncxftqf2 && from_mode == XFmode && to_mode == TQFmode)
650 emit_unop_insn (CODE_FOR_truncxftqf2, to, from, UNKNOWN);
654 #ifdef HAVE_trunctftqf2
655 if (HAVE_trunctftqf2 && from_mode == TFmode && to_mode == TQFmode)
657 emit_unop_insn (CODE_FOR_trunctftqf2, to, from, UNKNOWN);
662 #ifdef HAVE_truncdfsf2
663 if (HAVE_truncdfsf2 && from_mode == DFmode && to_mode == SFmode)
665 emit_unop_insn (CODE_FOR_truncdfsf2, to, from, UNKNOWN);
669 #ifdef HAVE_truncxfsf2
670 if (HAVE_truncxfsf2 && from_mode == XFmode && to_mode == SFmode)
672 emit_unop_insn (CODE_FOR_truncxfsf2, to, from, UNKNOWN);
676 #ifdef HAVE_trunctfsf2
677 if (HAVE_trunctfsf2 && from_mode == TFmode && to_mode == SFmode)
679 emit_unop_insn (CODE_FOR_trunctfsf2, to, from, UNKNOWN);
683 #ifdef HAVE_truncxfdf2
684 if (HAVE_truncxfdf2 && from_mode == XFmode && to_mode == DFmode)
686 emit_unop_insn (CODE_FOR_truncxfdf2, to, from, UNKNOWN);
690 #ifdef HAVE_trunctfdf2
691 if (HAVE_trunctfdf2 && from_mode == TFmode && to_mode == DFmode)
693 emit_unop_insn (CODE_FOR_trunctfdf2, to, from, UNKNOWN);
705 libcall = extendsfdf2_libfunc;
709 libcall = extendsfxf2_libfunc;
713 libcall = extendsftf2_libfunc;
725 libcall = truncdfsf2_libfunc;
729 libcall = extenddfxf2_libfunc;
733 libcall = extenddftf2_libfunc;
745 libcall = truncxfsf2_libfunc;
749 libcall = truncxfdf2_libfunc;
761 libcall = trunctfsf2_libfunc;
765 libcall = trunctfdf2_libfunc;
777 if (libcall == (rtx) 0)
778 /* This conversion is not implemented yet. */
782 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
784 insns = get_insns ();
786 emit_libcall_block (insns, to, value, gen_rtx_FLOAT_TRUNCATE (to_mode,
791 /* Now both modes are integers. */
793 /* Handle expanding beyond a word. */
794 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
795 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
802 enum machine_mode lowpart_mode;
803 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
805 /* Try converting directly if the insn is supported. */
806 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
809 /* If FROM is a SUBREG, put it into a register. Do this
810 so that we always generate the same set of insns for
811 better cse'ing; if an intermediate assignment occurred,
812 we won't be doing the operation directly on the SUBREG. */
813 if (optimize > 0 && GET_CODE (from) == SUBREG)
814 from = force_reg (from_mode, from);
815 emit_unop_insn (code, to, from, equiv_code);
818 /* Next, try converting via full word. */
819 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
820 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
821 != CODE_FOR_nothing))
823 if (GET_CODE (to) == REG)
824 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
825 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
826 emit_unop_insn (code, to,
827 gen_lowpart (word_mode, to), equiv_code);
831 /* No special multiword conversion insn; do it by hand. */
834 /* Since we will turn this into a no conflict block, we must ensure
835 that the source does not overlap the target. */
837 if (reg_overlap_mentioned_p (to, from))
838 from = force_reg (from_mode, from);
840 /* Get a copy of FROM widened to a word, if necessary. */
841 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
842 lowpart_mode = word_mode;
844 lowpart_mode = from_mode;
846 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
848 lowpart = gen_lowpart (lowpart_mode, to);
849 emit_move_insn (lowpart, lowfrom);
851 /* Compute the value to put in each remaining word. */
853 fill_value = const0_rtx;
858 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
859 && STORE_FLAG_VALUE == -1)
861 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
863 fill_value = gen_reg_rtx (word_mode);
864 emit_insn (gen_slt (fill_value));
870 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
871 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
873 fill_value = convert_to_mode (word_mode, fill_value, 1);
877 /* Fill the remaining words. */
878 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
880 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
881 rtx subword = operand_subword (to, index, 1, to_mode);
886 if (fill_value != subword)
887 emit_move_insn (subword, fill_value);
890 insns = get_insns ();
893 emit_no_conflict_block (insns, to, from, NULL_RTX,
894 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
898 /* Truncating multi-word to a word or less. */
899 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
900 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
902 if (!((GET_CODE (from) == MEM
903 && ! MEM_VOLATILE_P (from)
904 && direct_load[(int) to_mode]
905 && ! mode_dependent_address_p (XEXP (from, 0)))
906 || GET_CODE (from) == REG
907 || GET_CODE (from) == SUBREG))
908 from = force_reg (from_mode, from);
909 convert_move (to, gen_lowpart (word_mode, from), 0);
913 /* Handle pointer conversion. */ /* SPEE 900220. */
914 if (to_mode == PQImode)
916 if (from_mode != QImode)
917 from = convert_to_mode (QImode, from, unsignedp);
919 #ifdef HAVE_truncqipqi2
920 if (HAVE_truncqipqi2)
922 emit_unop_insn (CODE_FOR_truncqipqi2, to, from, UNKNOWN);
925 #endif /* HAVE_truncqipqi2 */
929 if (from_mode == PQImode)
931 if (to_mode != QImode)
933 from = convert_to_mode (QImode, from, unsignedp);
938 #ifdef HAVE_extendpqiqi2
939 if (HAVE_extendpqiqi2)
941 emit_unop_insn (CODE_FOR_extendpqiqi2, to, from, UNKNOWN);
944 #endif /* HAVE_extendpqiqi2 */
949 if (to_mode == PSImode)
951 if (from_mode != SImode)
952 from = convert_to_mode (SImode, from, unsignedp);
954 #ifdef HAVE_truncsipsi2
955 if (HAVE_truncsipsi2)
957 emit_unop_insn (CODE_FOR_truncsipsi2, to, from, UNKNOWN);
960 #endif /* HAVE_truncsipsi2 */
964 if (from_mode == PSImode)
966 if (to_mode != SImode)
968 from = convert_to_mode (SImode, from, unsignedp);
973 #ifdef HAVE_extendpsisi2
974 if (! unsignedp && HAVE_extendpsisi2)
976 emit_unop_insn (CODE_FOR_extendpsisi2, to, from, UNKNOWN);
979 #endif /* HAVE_extendpsisi2 */
980 #ifdef HAVE_zero_extendpsisi2
981 if (unsignedp && HAVE_zero_extendpsisi2)
983 emit_unop_insn (CODE_FOR_zero_extendpsisi2, to, from, UNKNOWN);
986 #endif /* HAVE_zero_extendpsisi2 */
991 if (to_mode == PDImode)
993 if (from_mode != DImode)
994 from = convert_to_mode (DImode, from, unsignedp);
996 #ifdef HAVE_truncdipdi2
997 if (HAVE_truncdipdi2)
999 emit_unop_insn (CODE_FOR_truncdipdi2, to, from, UNKNOWN);
1002 #endif /* HAVE_truncdipdi2 */
1006 if (from_mode == PDImode)
1008 if (to_mode != DImode)
1010 from = convert_to_mode (DImode, from, unsignedp);
1015 #ifdef HAVE_extendpdidi2
1016 if (HAVE_extendpdidi2)
1018 emit_unop_insn (CODE_FOR_extendpdidi2, to, from, UNKNOWN);
1021 #endif /* HAVE_extendpdidi2 */
1026 /* Now follow all the conversions between integers
1027 no more than a word long. */
1029 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1030 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
1031 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1032 GET_MODE_BITSIZE (from_mode)))
1034 if (!((GET_CODE (from) == MEM
1035 && ! MEM_VOLATILE_P (from)
1036 && direct_load[(int) to_mode]
1037 && ! mode_dependent_address_p (XEXP (from, 0)))
1038 || GET_CODE (from) == REG
1039 || GET_CODE (from) == SUBREG))
1040 from = force_reg (from_mode, from);
1041 if (GET_CODE (from) == REG && REGNO (from) < FIRST_PSEUDO_REGISTER
1042 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
1043 from = copy_to_reg (from);
1044 emit_move_insn (to, gen_lowpart (to_mode, from));
1048 /* Handle extension. */
1049 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
1051 /* Convert directly if that works. */
1052 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
1053 != CODE_FOR_nothing)
1055 emit_unop_insn (code, to, from, equiv_code);
1060 enum machine_mode intermediate;
1064 /* Search for a mode to convert via. */
1065 for (intermediate = from_mode; intermediate != VOIDmode;
1066 intermediate = GET_MODE_WIDER_MODE (intermediate))
1067 if (((can_extend_p (to_mode, intermediate, unsignedp)
1068 != CODE_FOR_nothing)
1069 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
1070 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1071 GET_MODE_BITSIZE (intermediate))))
1072 && (can_extend_p (intermediate, from_mode, unsignedp)
1073 != CODE_FOR_nothing))
1075 convert_move (to, convert_to_mode (intermediate, from,
1076 unsignedp), unsignedp);
1080 /* No suitable intermediate mode.
1081 Generate what we need with shifts. */
1082 shift_amount = build_int_2 (GET_MODE_BITSIZE (to_mode)
1083 - GET_MODE_BITSIZE (from_mode), 0);
1084 from = gen_lowpart (to_mode, force_reg (from_mode, from));
1085 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
1087 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
1090 emit_move_insn (to, tmp);
1095 /* Support special truncate insns for certain modes. */
1097 if (from_mode == DImode && to_mode == SImode)
1099 #ifdef HAVE_truncdisi2
1100 if (HAVE_truncdisi2)
1102 emit_unop_insn (CODE_FOR_truncdisi2, to, from, UNKNOWN);
1106 convert_move (to, force_reg (from_mode, from), unsignedp);
1110 if (from_mode == DImode && to_mode == HImode)
1112 #ifdef HAVE_truncdihi2
1113 if (HAVE_truncdihi2)
1115 emit_unop_insn (CODE_FOR_truncdihi2, to, from, UNKNOWN);
1119 convert_move (to, force_reg (from_mode, from), unsignedp);
1123 if (from_mode == DImode && to_mode == QImode)
1125 #ifdef HAVE_truncdiqi2
1126 if (HAVE_truncdiqi2)
1128 emit_unop_insn (CODE_FOR_truncdiqi2, to, from, UNKNOWN);
1132 convert_move (to, force_reg (from_mode, from), unsignedp);
1136 if (from_mode == SImode && to_mode == HImode)
1138 #ifdef HAVE_truncsihi2
1139 if (HAVE_truncsihi2)
1141 emit_unop_insn (CODE_FOR_truncsihi2, to, from, UNKNOWN);
1145 convert_move (to, force_reg (from_mode, from), unsignedp);
1149 if (from_mode == SImode && to_mode == QImode)
1151 #ifdef HAVE_truncsiqi2
1152 if (HAVE_truncsiqi2)
1154 emit_unop_insn (CODE_FOR_truncsiqi2, to, from, UNKNOWN);
1158 convert_move (to, force_reg (from_mode, from), unsignedp);
1162 if (from_mode == HImode && to_mode == QImode)
1164 #ifdef HAVE_trunchiqi2
1165 if (HAVE_trunchiqi2)
1167 emit_unop_insn (CODE_FOR_trunchiqi2, to, from, UNKNOWN);
1171 convert_move (to, force_reg (from_mode, from), unsignedp);
1175 if (from_mode == TImode && to_mode == DImode)
1177 #ifdef HAVE_trunctidi2
1178 if (HAVE_trunctidi2)
1180 emit_unop_insn (CODE_FOR_trunctidi2, to, from, UNKNOWN);
1184 convert_move (to, force_reg (from_mode, from), unsignedp);
1188 if (from_mode == TImode && to_mode == SImode)
1190 #ifdef HAVE_trunctisi2
1191 if (HAVE_trunctisi2)
1193 emit_unop_insn (CODE_FOR_trunctisi2, to, from, UNKNOWN);
1197 convert_move (to, force_reg (from_mode, from), unsignedp);
1201 if (from_mode == TImode && to_mode == HImode)
1203 #ifdef HAVE_trunctihi2
1204 if (HAVE_trunctihi2)
1206 emit_unop_insn (CODE_FOR_trunctihi2, to, from, UNKNOWN);
1210 convert_move (to, force_reg (from_mode, from), unsignedp);
1214 if (from_mode == TImode && to_mode == QImode)
1216 #ifdef HAVE_trunctiqi2
1217 if (HAVE_trunctiqi2)
1219 emit_unop_insn (CODE_FOR_trunctiqi2, to, from, UNKNOWN);
1223 convert_move (to, force_reg (from_mode, from), unsignedp);
1227 /* Handle truncation of volatile memrefs, and so on;
1228 the things that couldn't be truncated directly,
1229 and for which there was no special instruction. */
1230 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
1232 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
1233 emit_move_insn (to, temp);
1237 /* Mode combination is not recognized. */
1241 /* Return an rtx for a value that would result
1242 from converting X to mode MODE.
1243 Both X and MODE may be floating, or both integer.
1244 UNSIGNEDP is nonzero if X is an unsigned value.
1245 This can be done by referring to a part of X in place
1246 or by copying to a new temporary with conversion.
1248 This function *must not* call protect_from_queue
1249 except when putting X into an insn (in which case convert_move does it). */
1252 convert_to_mode (mode, x, unsignedp)
1253 enum machine_mode mode;
1257 return convert_modes (mode, VOIDmode, x, unsignedp);
1260 /* Return an rtx for a value that would result
1261 from converting X from mode OLDMODE to mode MODE.
1262 Both modes may be floating, or both integer.
1263 UNSIGNEDP is nonzero if X is an unsigned value.
1265 This can be done by referring to a part of X in place
1266 or by copying to a new temporary with conversion.
1268 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1270 This function *must not* call protect_from_queue
1271 except when putting X into an insn (in which case convert_move does it). */
1274 convert_modes (mode, oldmode, x, unsignedp)
1275 enum machine_mode mode, oldmode;
1281 /* If FROM is a SUBREG that indicates that we have already done at least
1282 the required extension, strip it. */
1284 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
1285 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
1286 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
1287 x = gen_lowpart (mode, x);
1289 if (GET_MODE (x) != VOIDmode)
1290 oldmode = GET_MODE (x);
1292 if (mode == oldmode)
1295 /* There is one case that we must handle specially: If we are converting
1296 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1297 we are to interpret the constant as unsigned, gen_lowpart will do
1298 the wrong if the constant appears negative. What we want to do is
1299 make the high-order word of the constant zero, not all ones. */
1301 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
1302 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
1303 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
1305 HOST_WIDE_INT val = INTVAL (x);
1307 if (oldmode != VOIDmode
1308 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
1310 int width = GET_MODE_BITSIZE (oldmode);
1312 /* We need to zero extend VAL. */
1313 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1316 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
1319 /* We can do this with a gen_lowpart if both desired and current modes
1320 are integer, and this is either a constant integer, a register, or a
1321 non-volatile MEM. Except for the constant case where MODE is no
1322 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1324 if ((GET_CODE (x) == CONST_INT
1325 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
1326 || (GET_MODE_CLASS (mode) == MODE_INT
1327 && GET_MODE_CLASS (oldmode) == MODE_INT
1328 && (GET_CODE (x) == CONST_DOUBLE
1329 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
1330 && ((GET_CODE (x) == MEM && ! MEM_VOLATILE_P (x)
1331 && direct_load[(int) mode])
1332 || (GET_CODE (x) == REG
1333 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1334 GET_MODE_BITSIZE (GET_MODE (x)))))))))
1336 /* ?? If we don't know OLDMODE, we have to assume here that
1337 X does not need sign- or zero-extension. This may not be
1338 the case, but it's the best we can do. */
1339 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
1340 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
1342 HOST_WIDE_INT val = INTVAL (x);
1343 int width = GET_MODE_BITSIZE (oldmode);
1345 /* We must sign or zero-extend in this case. Start by
1346 zero-extending, then sign extend if we need to. */
1347 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1349 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
1350 val |= (HOST_WIDE_INT) (-1) << width;
1352 return GEN_INT (trunc_int_for_mode (val, mode));
1355 return gen_lowpart (mode, x);
1358 temp = gen_reg_rtx (mode);
1359 convert_move (temp, x, unsignedp);
1363 /* This macro is used to determine what the largest unit size that
1364 move_by_pieces can use is. */
1366 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1367 move efficiently, as opposed to MOVE_MAX which is the maximum
1368 number of bytes we can move with a single instruction. */
1370 #ifndef MOVE_MAX_PIECES
1371 #define MOVE_MAX_PIECES MOVE_MAX
1374 /* Generate several move instructions to copy LEN bytes from block FROM to
1375 block TO. (These are MEM rtx's with BLKmode). The caller must pass FROM
1376 and TO through protect_from_queue before calling.
1378 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
1379 used to push FROM to the stack.
1381 ALIGN is maximum alignment we can assume. */
1384 move_by_pieces (to, from, len, align)
1386 unsigned HOST_WIDE_INT len;
1389 struct move_by_pieces data;
1390 rtx to_addr, from_addr = XEXP (from, 0);
1391 unsigned int max_size = MOVE_MAX_PIECES + 1;
1392 enum machine_mode mode = VOIDmode, tmode;
1393 enum insn_code icode;
1396 data.from_addr = from_addr;
1399 to_addr = XEXP (to, 0);
1402 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
1403 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
1405 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
1412 #ifdef STACK_GROWS_DOWNWARD
1418 data.to_addr = to_addr;
1421 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
1422 || GET_CODE (from_addr) == POST_INC
1423 || GET_CODE (from_addr) == POST_DEC);
1425 data.explicit_inc_from = 0;
1426 data.explicit_inc_to = 0;
1427 if (data.reverse) data.offset = len;
1430 /* If copying requires more than two move insns,
1431 copy addresses to registers (to make displacements shorter)
1432 and use post-increment if available. */
1433 if (!(data.autinc_from && data.autinc_to)
1434 && move_by_pieces_ninsns (len, align) > 2)
1436 /* Find the mode of the largest move... */
1437 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1438 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1439 if (GET_MODE_SIZE (tmode) < max_size)
1442 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
1444 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
1445 data.autinc_from = 1;
1446 data.explicit_inc_from = -1;
1448 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
1450 data.from_addr = copy_addr_to_reg (from_addr);
1451 data.autinc_from = 1;
1452 data.explicit_inc_from = 1;
1454 if (!data.autinc_from && CONSTANT_P (from_addr))
1455 data.from_addr = copy_addr_to_reg (from_addr);
1456 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
1458 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
1460 data.explicit_inc_to = -1;
1462 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
1464 data.to_addr = copy_addr_to_reg (to_addr);
1466 data.explicit_inc_to = 1;
1468 if (!data.autinc_to && CONSTANT_P (to_addr))
1469 data.to_addr = copy_addr_to_reg (to_addr);
1472 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1473 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1474 align = MOVE_MAX * BITS_PER_UNIT;
1476 /* First move what we can in the largest integer mode, then go to
1477 successively smaller modes. */
1479 while (max_size > 1)
1481 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1482 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1483 if (GET_MODE_SIZE (tmode) < max_size)
1486 if (mode == VOIDmode)
1489 icode = mov_optab->handlers[(int) mode].insn_code;
1490 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1491 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1493 max_size = GET_MODE_SIZE (mode);
1496 /* The code above should have handled everything. */
1501 /* Return number of insns required to move L bytes by pieces.
1502 ALIGN (in bits) is maximum alignment we can assume. */
1504 static unsigned HOST_WIDE_INT
1505 move_by_pieces_ninsns (l, align)
1506 unsigned HOST_WIDE_INT l;
1509 unsigned HOST_WIDE_INT n_insns = 0;
1510 unsigned HOST_WIDE_INT max_size = MOVE_MAX + 1;
1512 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
1513 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
1514 align = MOVE_MAX * BITS_PER_UNIT;
1516 while (max_size > 1)
1518 enum machine_mode mode = VOIDmode, tmode;
1519 enum insn_code icode;
1521 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1522 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1523 if (GET_MODE_SIZE (tmode) < max_size)
1526 if (mode == VOIDmode)
1529 icode = mov_optab->handlers[(int) mode].insn_code;
1530 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1531 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1533 max_size = GET_MODE_SIZE (mode);
1541 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1542 with move instructions for mode MODE. GENFUN is the gen_... function
1543 to make a move insn for that mode. DATA has all the other info. */
1546 move_by_pieces_1 (genfun, mode, data)
1547 rtx (*genfun) PARAMS ((rtx, ...));
1548 enum machine_mode mode;
1549 struct move_by_pieces *data;
1551 unsigned int size = GET_MODE_SIZE (mode);
1552 rtx to1 = NULL_RTX, from1;
1554 while (data->len >= size)
1557 data->offset -= size;
1561 if (data->autinc_to)
1562 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1565 to1 = adjust_address (data->to, mode, data->offset);
1568 if (data->autinc_from)
1569 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1572 from1 = adjust_address (data->from, mode, data->offset);
1574 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1575 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (-size)));
1576 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1577 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (-size)));
1580 emit_insn ((*genfun) (to1, from1));
1583 #ifdef PUSH_ROUNDING
1584 emit_single_push_insn (mode, from1, NULL);
1590 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1591 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1592 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1593 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1595 if (! data->reverse)
1596 data->offset += size;
1602 /* Emit code to move a block Y to a block X.
1603 This may be done with string-move instructions,
1604 with multiple scalar move instructions, or with a library call.
1606 Both X and Y must be MEM rtx's (perhaps inside VOLATILE)
1608 SIZE is an rtx that says how long they are.
1609 ALIGN is the maximum alignment we can assume they have.
1611 Return the address of the new block, if memcpy is called and returns it,
1615 emit_block_move (x, y, size)
1620 #ifdef TARGET_MEM_FUNCTIONS
1622 tree call_expr, arg_list;
1624 unsigned int align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1626 if (GET_MODE (x) != BLKmode)
1629 if (GET_MODE (y) != BLKmode)
1632 x = protect_from_queue (x, 1);
1633 y = protect_from_queue (y, 0);
1634 size = protect_from_queue (size, 0);
1636 if (GET_CODE (x) != MEM)
1638 if (GET_CODE (y) != MEM)
1643 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1644 move_by_pieces (x, y, INTVAL (size), align);
1647 /* Try the most limited insn first, because there's no point
1648 including more than one in the machine description unless
1649 the more limited one has some advantage. */
1651 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1652 enum machine_mode mode;
1654 /* Since this is a move insn, we don't care about volatility. */
1657 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1658 mode = GET_MODE_WIDER_MODE (mode))
1660 enum insn_code code = movstr_optab[(int) mode];
1661 insn_operand_predicate_fn pred;
1663 if (code != CODE_FOR_nothing
1664 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1665 here because if SIZE is less than the mode mask, as it is
1666 returned by the macro, it will definitely be less than the
1667 actual mode mask. */
1668 && ((GET_CODE (size) == CONST_INT
1669 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1670 <= (GET_MODE_MASK (mode) >> 1)))
1671 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1672 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1673 || (*pred) (x, BLKmode))
1674 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1675 || (*pred) (y, BLKmode))
1676 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1677 || (*pred) (opalign, VOIDmode)))
1680 rtx last = get_last_insn ();
1683 op2 = convert_to_mode (mode, size, 1);
1684 pred = insn_data[(int) code].operand[2].predicate;
1685 if (pred != 0 && ! (*pred) (op2, mode))
1686 op2 = copy_to_mode_reg (mode, op2);
1688 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1696 delete_insns_since (last);
1702 /* X, Y, or SIZE may have been passed through protect_from_queue.
1704 It is unsafe to save the value generated by protect_from_queue
1705 and reuse it later. Consider what happens if emit_queue is
1706 called before the return value from protect_from_queue is used.
1708 Expansion of the CALL_EXPR below will call emit_queue before
1709 we are finished emitting RTL for argument setup. So if we are
1710 not careful we could get the wrong value for an argument.
1712 To avoid this problem we go ahead and emit code to copy X, Y &
1713 SIZE into new pseudos. We can then place those new pseudos
1714 into an RTL_EXPR and use them later, even after a call to
1717 Note this is not strictly needed for library calls since they
1718 do not call emit_queue before loading their arguments. However,
1719 we may need to have library calls call emit_queue in the future
1720 since failing to do so could cause problems for targets which
1721 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1722 x = copy_to_mode_reg (Pmode, XEXP (x, 0));
1723 y = copy_to_mode_reg (Pmode, XEXP (y, 0));
1725 #ifdef TARGET_MEM_FUNCTIONS
1726 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
1728 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
1729 TREE_UNSIGNED (integer_type_node));
1730 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
1733 #ifdef TARGET_MEM_FUNCTIONS
1734 /* It is incorrect to use the libcall calling conventions to call
1735 memcpy in this context.
1737 This could be a user call to memcpy and the user may wish to
1738 examine the return value from memcpy.
1740 For targets where libcalls and normal calls have different conventions
1741 for returning pointers, we could end up generating incorrect code.
1743 So instead of using a libcall sequence we build up a suitable
1744 CALL_EXPR and expand the call in the normal fashion. */
1745 if (fn == NULL_TREE)
1749 /* This was copied from except.c, I don't know if all this is
1750 necessary in this context or not. */
1751 fn = get_identifier ("memcpy");
1752 fntype = build_pointer_type (void_type_node);
1753 fntype = build_function_type (fntype, NULL_TREE);
1754 fn = build_decl (FUNCTION_DECL, fn, fntype);
1755 ggc_add_tree_root (&fn, 1);
1756 DECL_EXTERNAL (fn) = 1;
1757 TREE_PUBLIC (fn) = 1;
1758 DECL_ARTIFICIAL (fn) = 1;
1759 TREE_NOTHROW (fn) = 1;
1760 make_decl_rtl (fn, NULL);
1761 assemble_external (fn);
1764 /* We need to make an argument list for the function call.
1766 memcpy has three arguments, the first two are void * addresses and
1767 the last is a size_t byte count for the copy. */
1769 = build_tree_list (NULL_TREE,
1770 make_tree (build_pointer_type (void_type_node), x));
1771 TREE_CHAIN (arg_list)
1772 = build_tree_list (NULL_TREE,
1773 make_tree (build_pointer_type (void_type_node), y));
1774 TREE_CHAIN (TREE_CHAIN (arg_list))
1775 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
1776 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
1778 /* Now we have to build up the CALL_EXPR itself. */
1779 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1780 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1781 call_expr, arg_list, NULL_TREE);
1782 TREE_SIDE_EFFECTS (call_expr) = 1;
1784 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1786 emit_library_call (bcopy_libfunc, LCT_NORMAL,
1787 VOIDmode, 3, y, Pmode, x, Pmode,
1788 convert_to_mode (TYPE_MODE (integer_type_node), size,
1789 TREE_UNSIGNED (integer_type_node)),
1790 TYPE_MODE (integer_type_node));
1793 /* If we are initializing a readonly value, show the above call
1794 clobbered it. Otherwise, a load from it may erroneously be hoisted
1796 if (RTX_UNCHANGING_P (x))
1797 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
1803 /* Copy all or part of a value X into registers starting at REGNO.
1804 The number of registers to be filled is NREGS. */
1807 move_block_to_reg (regno, x, nregs, mode)
1811 enum machine_mode mode;
1814 #ifdef HAVE_load_multiple
1822 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1823 x = validize_mem (force_const_mem (mode, x));
1825 /* See if the machine can do this with a load multiple insn. */
1826 #ifdef HAVE_load_multiple
1827 if (HAVE_load_multiple)
1829 last = get_last_insn ();
1830 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1838 delete_insns_since (last);
1842 for (i = 0; i < nregs; i++)
1843 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1844 operand_subword_force (x, i, mode));
1847 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1848 The number of registers to be filled is NREGS. SIZE indicates the number
1849 of bytes in the object X. */
1852 move_block_from_reg (regno, x, nregs, size)
1859 #ifdef HAVE_store_multiple
1863 enum machine_mode mode;
1868 /* If SIZE is that of a mode no bigger than a word, just use that
1869 mode's store operation. */
1870 if (size <= UNITS_PER_WORD
1871 && (mode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0)) != BLKmode
1872 && !FUNCTION_ARG_REG_LITTLE_ENDIAN)
1874 emit_move_insn (adjust_address (x, mode, 0), gen_rtx_REG (mode, regno));
1878 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
1879 to the left before storing to memory. Note that the previous test
1880 doesn't handle all cases (e.g. SIZE == 3). */
1881 if (size < UNITS_PER_WORD
1883 && !FUNCTION_ARG_REG_LITTLE_ENDIAN)
1885 rtx tem = operand_subword (x, 0, 1, BLKmode);
1891 shift = expand_shift (LSHIFT_EXPR, word_mode,
1892 gen_rtx_REG (word_mode, regno),
1893 build_int_2 ((UNITS_PER_WORD - size)
1894 * BITS_PER_UNIT, 0), NULL_RTX, 0);
1895 emit_move_insn (tem, shift);
1899 /* See if the machine can do this with a store multiple insn. */
1900 #ifdef HAVE_store_multiple
1901 if (HAVE_store_multiple)
1903 last = get_last_insn ();
1904 pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1912 delete_insns_since (last);
1916 for (i = 0; i < nregs; i++)
1918 rtx tem = operand_subword (x, i, 1, BLKmode);
1923 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1927 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
1928 registers represented by a PARALLEL. SSIZE represents the total size of
1929 block SRC in bytes, or -1 if not known. */
1930 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatant assumption that
1931 the balance will be in what would be the low-order memory addresses, i.e.
1932 left justified for big endian, right justified for little endian. This
1933 happens to be true for the targets currently using this support. If this
1934 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
1938 emit_group_load (dst, orig_src, ssize)
1945 if (GET_CODE (dst) != PARALLEL)
1948 /* Check for a NULL entry, used to indicate that the parameter goes
1949 both on the stack and in registers. */
1950 if (XEXP (XVECEXP (dst, 0, 0), 0))
1955 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (dst, 0));
1957 /* Process the pieces. */
1958 for (i = start; i < XVECLEN (dst, 0); i++)
1960 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1961 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1962 unsigned int bytelen = GET_MODE_SIZE (mode);
1965 /* Handle trailing fragments that run over the size of the struct. */
1966 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1968 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1969 bytelen = ssize - bytepos;
1974 /* If we won't be loading directly from memory, protect the real source
1975 from strange tricks we might play; but make sure that the source can
1976 be loaded directly into the destination. */
1978 if (GET_CODE (orig_src) != MEM
1979 && (!CONSTANT_P (orig_src)
1980 || (GET_MODE (orig_src) != mode
1981 && GET_MODE (orig_src) != VOIDmode)))
1983 if (GET_MODE (orig_src) == VOIDmode)
1984 src = gen_reg_rtx (mode);
1986 src = gen_reg_rtx (GET_MODE (orig_src));
1988 emit_move_insn (src, orig_src);
1991 /* Optimize the access just a bit. */
1992 if (GET_CODE (src) == MEM
1993 && MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode)
1994 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1995 && bytelen == GET_MODE_SIZE (mode))
1997 tmps[i] = gen_reg_rtx (mode);
1998 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
2000 else if (GET_CODE (src) == CONCAT)
2003 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 0))))
2004 tmps[i] = XEXP (src, 0);
2005 else if (bytepos == (HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (XEXP (src, 0)))
2006 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 1))))
2007 tmps[i] = XEXP (src, 1);
2008 else if (bytepos == 0)
2010 rtx mem = assign_stack_temp (GET_MODE (src),
2011 GET_MODE_SIZE (GET_MODE (src)), 0);
2012 emit_move_insn (mem, src);
2013 tmps[i] = adjust_address (mem, mode, 0);
2018 else if (CONSTANT_P (src)
2019 || (GET_CODE (src) == REG && GET_MODE (src) == mode))
2022 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
2023 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
2026 if (BYTES_BIG_ENDIAN && shift)
2027 expand_binop (mode, ashl_optab, tmps[i], GEN_INT (shift),
2028 tmps[i], 0, OPTAB_WIDEN);
2033 /* Copy the extracted pieces into the proper (probable) hard regs. */
2034 for (i = start; i < XVECLEN (dst, 0); i++)
2035 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0), tmps[i]);
2038 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
2039 registers represented by a PARALLEL. SSIZE represents the total size of
2040 block DST, or -1 if not known. */
2043 emit_group_store (orig_dst, src, ssize)
2050 if (GET_CODE (src) != PARALLEL)
2053 /* Check for a NULL entry, used to indicate that the parameter goes
2054 both on the stack and in registers. */
2055 if (XEXP (XVECEXP (src, 0, 0), 0))
2060 tmps = (rtx *) alloca (sizeof (rtx) * XVECLEN (src, 0));
2062 /* Copy the (probable) hard regs into pseudos. */
2063 for (i = start; i < XVECLEN (src, 0); i++)
2065 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
2066 tmps[i] = gen_reg_rtx (GET_MODE (reg));
2067 emit_move_insn (tmps[i], reg);
2071 /* If we won't be storing directly into memory, protect the real destination
2072 from strange tricks we might play. */
2074 if (GET_CODE (dst) == PARALLEL)
2078 /* We can get a PARALLEL dst if there is a conditional expression in
2079 a return statement. In that case, the dst and src are the same,
2080 so no action is necessary. */
2081 if (rtx_equal_p (dst, src))
2084 /* It is unclear if we can ever reach here, but we may as well handle
2085 it. Allocate a temporary, and split this into a store/load to/from
2088 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
2089 emit_group_store (temp, src, ssize);
2090 emit_group_load (dst, temp, ssize);
2093 else if (GET_CODE (dst) != MEM)
2095 dst = gen_reg_rtx (GET_MODE (orig_dst));
2096 /* Make life a bit easier for combine. */
2097 emit_move_insn (dst, const0_rtx);
2100 /* Process the pieces. */
2101 for (i = start; i < XVECLEN (src, 0); i++)
2103 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2104 enum machine_mode mode = GET_MODE (tmps[i]);
2105 unsigned int bytelen = GET_MODE_SIZE (mode);
2107 /* Handle trailing fragments that run over the size of the struct. */
2108 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2110 if (BYTES_BIG_ENDIAN)
2112 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2113 expand_binop (mode, ashr_optab, tmps[i], GEN_INT (shift),
2114 tmps[i], 0, OPTAB_WIDEN);
2116 bytelen = ssize - bytepos;
2119 /* Optimize the access just a bit. */
2120 if (GET_CODE (dst) == MEM
2121 && MEM_ALIGN (dst) >= GET_MODE_ALIGNMENT (mode)
2122 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2123 && bytelen == GET_MODE_SIZE (mode))
2124 emit_move_insn (adjust_address (dst, mode, bytepos), tmps[i]);
2126 store_bit_field (dst, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2127 mode, tmps[i], ssize);
2132 /* Copy from the pseudo into the (probable) hard reg. */
2133 if (GET_CODE (dst) == REG)
2134 emit_move_insn (orig_dst, dst);
2137 /* Generate code to copy a BLKmode object of TYPE out of a
2138 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2139 is null, a stack temporary is created. TGTBLK is returned.
2141 The primary purpose of this routine is to handle functions
2142 that return BLKmode structures in registers. Some machines
2143 (the PA for example) want to return all small structures
2144 in registers regardless of the structure's alignment. */
2147 copy_blkmode_from_reg (tgtblk, srcreg, type)
2152 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2153 rtx src = NULL, dst = NULL;
2154 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2155 unsigned HOST_WIDE_INT bitpos, xbitpos, big_endian_correction = 0;
2159 tgtblk = assign_temp (build_qualified_type (type,
2161 | TYPE_QUAL_CONST)),
2163 preserve_temp_slots (tgtblk);
2166 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2167 into a new pseudo which is a full word.
2169 If FUNCTION_ARG_REG_LITTLE_ENDIAN is set and convert_to_mode does a copy,
2170 the wrong part of the register gets copied so we fake a type conversion
2172 if (GET_MODE (srcreg) != BLKmode
2173 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2175 if (FUNCTION_ARG_REG_LITTLE_ENDIAN)
2176 srcreg = simplify_gen_subreg (word_mode, srcreg, GET_MODE (srcreg), 0);
2178 srcreg = convert_to_mode (word_mode, srcreg, TREE_UNSIGNED (type));
2181 /* Structures whose size is not a multiple of a word are aligned
2182 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2183 machine, this means we must skip the empty high order bytes when
2184 calculating the bit offset. */
2185 if (BYTES_BIG_ENDIAN
2186 && !FUNCTION_ARG_REG_LITTLE_ENDIAN
2187 && bytes % UNITS_PER_WORD)
2188 big_endian_correction
2189 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2191 /* Copy the structure BITSIZE bites at a time.
2193 We could probably emit more efficient code for machines which do not use
2194 strict alignment, but it doesn't seem worth the effort at the current
2196 for (bitpos = 0, xbitpos = big_endian_correction;
2197 bitpos < bytes * BITS_PER_UNIT;
2198 bitpos += bitsize, xbitpos += bitsize)
2200 /* We need a new source operand each time xbitpos is on a
2201 word boundary and when xbitpos == big_endian_correction
2202 (the first time through). */
2203 if (xbitpos % BITS_PER_WORD == 0
2204 || xbitpos == big_endian_correction)
2205 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2208 /* We need a new destination operand each time bitpos is on
2210 if (bitpos % BITS_PER_WORD == 0)
2211 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2213 /* Use xbitpos for the source extraction (right justified) and
2214 xbitpos for the destination store (left justified). */
2215 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2216 extract_bit_field (src, bitsize,
2217 xbitpos % BITS_PER_WORD, 1,
2218 NULL_RTX, word_mode, word_mode,
2226 /* Add a USE expression for REG to the (possibly empty) list pointed
2227 to by CALL_FUSAGE. REG must denote a hard register. */
2230 use_reg (call_fusage, reg)
2231 rtx *call_fusage, reg;
2233 if (GET_CODE (reg) != REG
2234 || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
2238 = gen_rtx_EXPR_LIST (VOIDmode,
2239 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2242 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2243 starting at REGNO. All of these registers must be hard registers. */
2246 use_regs (call_fusage, regno, nregs)
2253 if (regno + nregs > FIRST_PSEUDO_REGISTER)
2256 for (i = 0; i < nregs; i++)
2257 use_reg (call_fusage, gen_rtx_REG (reg_raw_mode[regno + i], regno + i));
2260 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2261 PARALLEL REGS. This is for calls that pass values in multiple
2262 non-contiguous locations. The Irix 6 ABI has examples of this. */
2265 use_group_regs (call_fusage, regs)
2271 for (i = 0; i < XVECLEN (regs, 0); i++)
2273 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2275 /* A NULL entry means the parameter goes both on the stack and in
2276 registers. This can also be a MEM for targets that pass values
2277 partially on the stack and partially in registers. */
2278 if (reg != 0 && GET_CODE (reg) == REG)
2279 use_reg (call_fusage, reg);
2285 can_store_by_pieces (len, constfun, constfundata, align)
2286 unsigned HOST_WIDE_INT len;
2287 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2291 unsigned HOST_WIDE_INT max_size, l;
2292 HOST_WIDE_INT offset = 0;
2293 enum machine_mode mode, tmode;
2294 enum insn_code icode;
2298 if (! MOVE_BY_PIECES_P (len, align))
2301 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2302 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2303 align = MOVE_MAX * BITS_PER_UNIT;
2305 /* We would first store what we can in the largest integer mode, then go to
2306 successively smaller modes. */
2309 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2314 max_size = MOVE_MAX_PIECES + 1;
2315 while (max_size > 1)
2317 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2318 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2319 if (GET_MODE_SIZE (tmode) < max_size)
2322 if (mode == VOIDmode)
2325 icode = mov_optab->handlers[(int) mode].insn_code;
2326 if (icode != CODE_FOR_nothing
2327 && align >= GET_MODE_ALIGNMENT (mode))
2329 unsigned int size = GET_MODE_SIZE (mode);
2336 cst = (*constfun) (constfundata, offset, mode);
2337 if (!LEGITIMATE_CONSTANT_P (cst))
2347 max_size = GET_MODE_SIZE (mode);
2350 /* The code above should have handled everything. */
2358 /* Generate several move instructions to store LEN bytes generated by
2359 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2360 pointer which will be passed as argument in every CONSTFUN call.
2361 ALIGN is maximum alignment we can assume. */
2364 store_by_pieces (to, len, constfun, constfundata, align)
2366 unsigned HOST_WIDE_INT len;
2367 rtx (*constfun) PARAMS ((PTR, HOST_WIDE_INT, enum machine_mode));
2371 struct store_by_pieces data;
2373 if (! MOVE_BY_PIECES_P (len, align))
2375 to = protect_from_queue (to, 1);
2376 data.constfun = constfun;
2377 data.constfundata = constfundata;
2380 store_by_pieces_1 (&data, align);
2383 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2384 rtx with BLKmode). The caller must pass TO through protect_from_queue
2385 before calling. ALIGN is maximum alignment we can assume. */
2388 clear_by_pieces (to, len, align)
2390 unsigned HOST_WIDE_INT len;
2393 struct store_by_pieces data;
2395 data.constfun = clear_by_pieces_1;
2396 data.constfundata = NULL;
2399 store_by_pieces_1 (&data, align);
2402 /* Callback routine for clear_by_pieces.
2403 Return const0_rtx unconditionally. */
2406 clear_by_pieces_1 (data, offset, mode)
2407 PTR data ATTRIBUTE_UNUSED;
2408 HOST_WIDE_INT offset ATTRIBUTE_UNUSED;
2409 enum machine_mode mode ATTRIBUTE_UNUSED;
2414 /* Subroutine of clear_by_pieces and store_by_pieces.
2415 Generate several move instructions to store LEN bytes of block TO. (A MEM
2416 rtx with BLKmode). The caller must pass TO through protect_from_queue
2417 before calling. ALIGN is maximum alignment we can assume. */
2420 store_by_pieces_1 (data, align)
2421 struct store_by_pieces *data;
2424 rtx to_addr = XEXP (data->to, 0);
2425 unsigned HOST_WIDE_INT max_size = MOVE_MAX_PIECES + 1;
2426 enum machine_mode mode = VOIDmode, tmode;
2427 enum insn_code icode;
2430 data->to_addr = to_addr;
2432 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2433 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2435 data->explicit_inc_to = 0;
2437 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2439 data->offset = data->len;
2441 /* If storing requires more than two move insns,
2442 copy addresses to registers (to make displacements shorter)
2443 and use post-increment if available. */
2444 if (!data->autinc_to
2445 && move_by_pieces_ninsns (data->len, align) > 2)
2447 /* Determine the main mode we'll be using. */
2448 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2449 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2450 if (GET_MODE_SIZE (tmode) < max_size)
2453 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2455 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2456 data->autinc_to = 1;
2457 data->explicit_inc_to = -1;
2460 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2461 && ! data->autinc_to)
2463 data->to_addr = copy_addr_to_reg (to_addr);
2464 data->autinc_to = 1;
2465 data->explicit_inc_to = 1;
2468 if ( !data->autinc_to && CONSTANT_P (to_addr))
2469 data->to_addr = copy_addr_to_reg (to_addr);
2472 if (! SLOW_UNALIGNED_ACCESS (word_mode, align)
2473 || align > MOVE_MAX * BITS_PER_UNIT || align >= BIGGEST_ALIGNMENT)
2474 align = MOVE_MAX * BITS_PER_UNIT;
2476 /* First store what we can in the largest integer mode, then go to
2477 successively smaller modes. */
2479 while (max_size > 1)
2481 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2482 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2483 if (GET_MODE_SIZE (tmode) < max_size)
2486 if (mode == VOIDmode)
2489 icode = mov_optab->handlers[(int) mode].insn_code;
2490 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2491 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2493 max_size = GET_MODE_SIZE (mode);
2496 /* The code above should have handled everything. */
2501 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2502 with move instructions for mode MODE. GENFUN is the gen_... function
2503 to make a move insn for that mode. DATA has all the other info. */
2506 store_by_pieces_2 (genfun, mode, data)
2507 rtx (*genfun) PARAMS ((rtx, ...));
2508 enum machine_mode mode;
2509 struct store_by_pieces *data;
2511 unsigned int size = GET_MODE_SIZE (mode);
2514 while (data->len >= size)
2517 data->offset -= size;
2519 if (data->autinc_to)
2520 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2523 to1 = adjust_address (data->to, mode, data->offset);
2525 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2526 emit_insn (gen_add2_insn (data->to_addr,
2527 GEN_INT (-(HOST_WIDE_INT) size)));
2529 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2530 emit_insn ((*genfun) (to1, cst));
2532 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2533 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2535 if (! data->reverse)
2536 data->offset += size;
2542 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2543 its length in bytes. */
2546 clear_storage (object, size)
2550 #ifdef TARGET_MEM_FUNCTIONS
2552 tree call_expr, arg_list;
2555 unsigned int align = (GET_CODE (object) == MEM ? MEM_ALIGN (object)
2556 : GET_MODE_ALIGNMENT (GET_MODE (object)));
2558 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2559 just move a zero. Otherwise, do this a piece at a time. */
2560 if (GET_MODE (object) != BLKmode
2561 && GET_CODE (size) == CONST_INT
2562 && GET_MODE_SIZE (GET_MODE (object)) == (unsigned int) INTVAL (size))
2563 emit_move_insn (object, CONST0_RTX (GET_MODE (object)));
2566 object = protect_from_queue (object, 1);
2567 size = protect_from_queue (size, 0);
2569 if (GET_CODE (size) == CONST_INT
2570 && MOVE_BY_PIECES_P (INTVAL (size), align))
2571 clear_by_pieces (object, INTVAL (size), align);
2574 /* Try the most limited insn first, because there's no point
2575 including more than one in the machine description unless
2576 the more limited one has some advantage. */
2578 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2579 enum machine_mode mode;
2581 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2582 mode = GET_MODE_WIDER_MODE (mode))
2584 enum insn_code code = clrstr_optab[(int) mode];
2585 insn_operand_predicate_fn pred;
2587 if (code != CODE_FOR_nothing
2588 /* We don't need MODE to be narrower than
2589 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2590 the mode mask, as it is returned by the macro, it will
2591 definitely be less than the actual mode mask. */
2592 && ((GET_CODE (size) == CONST_INT
2593 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2594 <= (GET_MODE_MASK (mode) >> 1)))
2595 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2596 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2597 || (*pred) (object, BLKmode))
2598 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2599 || (*pred) (opalign, VOIDmode)))
2602 rtx last = get_last_insn ();
2605 op1 = convert_to_mode (mode, size, 1);
2606 pred = insn_data[(int) code].operand[1].predicate;
2607 if (pred != 0 && ! (*pred) (op1, mode))
2608 op1 = copy_to_mode_reg (mode, op1);
2610 pat = GEN_FCN ((int) code) (object, op1, opalign);
2617 delete_insns_since (last);
2621 /* OBJECT or SIZE may have been passed through protect_from_queue.
2623 It is unsafe to save the value generated by protect_from_queue
2624 and reuse it later. Consider what happens if emit_queue is
2625 called before the return value from protect_from_queue is used.
2627 Expansion of the CALL_EXPR below will call emit_queue before
2628 we are finished emitting RTL for argument setup. So if we are
2629 not careful we could get the wrong value for an argument.
2631 To avoid this problem we go ahead and emit code to copy OBJECT
2632 and SIZE into new pseudos. We can then place those new pseudos
2633 into an RTL_EXPR and use them later, even after a call to
2636 Note this is not strictly needed for library calls since they
2637 do not call emit_queue before loading their arguments. However,
2638 we may need to have library calls call emit_queue in the future
2639 since failing to do so could cause problems for targets which
2640 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
2641 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2643 #ifdef TARGET_MEM_FUNCTIONS
2644 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
2646 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
2647 TREE_UNSIGNED (integer_type_node));
2648 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
2651 #ifdef TARGET_MEM_FUNCTIONS
2652 /* It is incorrect to use the libcall calling conventions to call
2653 memset in this context.
2655 This could be a user call to memset and the user may wish to
2656 examine the return value from memset.
2658 For targets where libcalls and normal calls have different
2659 conventions for returning pointers, we could end up generating
2662 So instead of using a libcall sequence we build up a suitable
2663 CALL_EXPR and expand the call in the normal fashion. */
2664 if (fn == NULL_TREE)
2668 /* This was copied from except.c, I don't know if all this is
2669 necessary in this context or not. */
2670 fn = get_identifier ("memset");
2671 fntype = build_pointer_type (void_type_node);
2672 fntype = build_function_type (fntype, NULL_TREE);
2673 fn = build_decl (FUNCTION_DECL, fn, fntype);
2674 ggc_add_tree_root (&fn, 1);
2675 DECL_EXTERNAL (fn) = 1;
2676 TREE_PUBLIC (fn) = 1;
2677 DECL_ARTIFICIAL (fn) = 1;
2678 TREE_NOTHROW (fn) = 1;
2679 make_decl_rtl (fn, NULL);
2680 assemble_external (fn);
2683 /* We need to make an argument list for the function call.
2685 memset has three arguments, the first is a void * addresses, the
2686 second an integer with the initialization value, the last is a
2687 size_t byte count for the copy. */
2689 = build_tree_list (NULL_TREE,
2690 make_tree (build_pointer_type (void_type_node),
2692 TREE_CHAIN (arg_list)
2693 = build_tree_list (NULL_TREE,
2694 make_tree (integer_type_node, const0_rtx));
2695 TREE_CHAIN (TREE_CHAIN (arg_list))
2696 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
2697 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
2699 /* Now we have to build up the CALL_EXPR itself. */
2700 call_expr = build1 (ADDR_EXPR,
2701 build_pointer_type (TREE_TYPE (fn)), fn);
2702 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2703 call_expr, arg_list, NULL_TREE);
2704 TREE_SIDE_EFFECTS (call_expr) = 1;
2706 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2708 emit_library_call (bzero_libfunc, LCT_NORMAL,
2709 VOIDmode, 2, object, Pmode, size,
2710 TYPE_MODE (integer_type_node));
2713 /* If we are initializing a readonly value, show the above call
2714 clobbered it. Otherwise, a load from it may erroneously be
2715 hoisted from a loop. */
2716 if (RTX_UNCHANGING_P (object))
2717 emit_insn (gen_rtx_CLOBBER (VOIDmode, object));
2724 /* Generate code to copy Y into X.
2725 Both Y and X must have the same mode, except that
2726 Y can be a constant with VOIDmode.
2727 This mode cannot be BLKmode; use emit_block_move for that.
2729 Return the last instruction emitted. */
2732 emit_move_insn (x, y)
2735 enum machine_mode mode = GET_MODE (x);
2736 rtx y_cst = NULL_RTX;
2739 x = protect_from_queue (x, 1);
2740 y = protect_from_queue (y, 0);
2742 if (mode == BLKmode || (GET_MODE (y) != mode && GET_MODE (y) != VOIDmode))
2745 /* Never force constant_p_rtx to memory. */
2746 if (GET_CODE (y) == CONSTANT_P_RTX)
2748 else if (CONSTANT_P (y) && ! LEGITIMATE_CONSTANT_P (y))
2751 y = force_const_mem (mode, y);
2754 /* If X or Y are memory references, verify that their addresses are valid
2756 if (GET_CODE (x) == MEM
2757 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
2758 && ! push_operand (x, GET_MODE (x)))
2760 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
2761 x = validize_mem (x);
2763 if (GET_CODE (y) == MEM
2764 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
2766 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
2767 y = validize_mem (y);
2769 if (mode == BLKmode)
2772 last_insn = emit_move_insn_1 (x, y);
2774 if (y_cst && GET_CODE (x) == REG)
2775 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
2780 /* Low level part of emit_move_insn.
2781 Called just like emit_move_insn, but assumes X and Y
2782 are basically valid. */
2785 emit_move_insn_1 (x, y)
2788 enum machine_mode mode = GET_MODE (x);
2789 enum machine_mode submode;
2790 enum mode_class class = GET_MODE_CLASS (mode);
2793 if ((unsigned int) mode >= (unsigned int) MAX_MACHINE_MODE)
2796 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2798 emit_insn (GEN_FCN (mov_optab->handlers[(int) mode].insn_code) (x, y));
2800 /* Expand complex moves by moving real part and imag part, if possible. */
2801 else if ((class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)
2802 && BLKmode != (submode = mode_for_size ((GET_MODE_UNIT_SIZE (mode)
2804 (class == MODE_COMPLEX_INT
2805 ? MODE_INT : MODE_FLOAT),
2807 && (mov_optab->handlers[(int) submode].insn_code
2808 != CODE_FOR_nothing))
2810 /* Don't split destination if it is a stack push. */
2811 int stack = push_operand (x, GET_MODE (x));
2813 #ifdef PUSH_ROUNDING
2814 /* In case we output to the stack, but the size is smaller machine can
2815 push exactly, we need to use move instructions. */
2817 && PUSH_ROUNDING (GET_MODE_SIZE (submode)) != GET_MODE_SIZE (submode))
2820 int offset1, offset2;
2822 /* Do not use anti_adjust_stack, since we don't want to update
2823 stack_pointer_delta. */
2824 temp = expand_binop (Pmode,
2825 #ifdef STACK_GROWS_DOWNWARD
2832 (PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))),
2836 if (temp != stack_pointer_rtx)
2837 emit_move_insn (stack_pointer_rtx, temp);
2838 #ifdef STACK_GROWS_DOWNWARD
2840 offset2 = GET_MODE_SIZE (submode);
2842 offset1 = -PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)));
2843 offset2 = (-PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))
2844 + GET_MODE_SIZE (submode));
2846 emit_move_insn (change_address (x, submode,
2847 gen_rtx_PLUS (Pmode,
2849 GEN_INT (offset1))),
2850 gen_realpart (submode, y));
2851 emit_move_insn (change_address (x, submode,
2852 gen_rtx_PLUS (Pmode,
2854 GEN_INT (offset2))),
2855 gen_imagpart (submode, y));
2859 /* If this is a stack, push the highpart first, so it
2860 will be in the argument order.
2862 In that case, change_address is used only to convert
2863 the mode, not to change the address. */
2866 /* Note that the real part always precedes the imag part in memory
2867 regardless of machine's endianness. */
2868 #ifdef STACK_GROWS_DOWNWARD
2869 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2870 (gen_rtx_MEM (submode, XEXP (x, 0)),
2871 gen_imagpart (submode, y)));
2872 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2873 (gen_rtx_MEM (submode, XEXP (x, 0)),
2874 gen_realpart (submode, y)));
2876 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2877 (gen_rtx_MEM (submode, XEXP (x, 0)),
2878 gen_realpart (submode, y)));
2879 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2880 (gen_rtx_MEM (submode, XEXP (x, 0)),
2881 gen_imagpart (submode, y)));
2886 rtx realpart_x, realpart_y;
2887 rtx imagpart_x, imagpart_y;
2889 /* If this is a complex value with each part being smaller than a
2890 word, the usual calling sequence will likely pack the pieces into
2891 a single register. Unfortunately, SUBREG of hard registers only
2892 deals in terms of words, so we have a problem converting input
2893 arguments to the CONCAT of two registers that is used elsewhere
2894 for complex values. If this is before reload, we can copy it into
2895 memory and reload. FIXME, we should see about using extract and
2896 insert on integer registers, but complex short and complex char
2897 variables should be rarely used. */
2898 if (GET_MODE_BITSIZE (mode) < 2 * BITS_PER_WORD
2899 && (reload_in_progress | reload_completed) == 0)
2901 int packed_dest_p = (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER);
2902 int packed_src_p = (REG_P (y) && REGNO (y) < FIRST_PSEUDO_REGISTER);
2904 if (packed_dest_p || packed_src_p)
2906 enum mode_class reg_class = ((class == MODE_COMPLEX_FLOAT)
2907 ? MODE_FLOAT : MODE_INT);
2909 enum machine_mode reg_mode
2910 = mode_for_size (GET_MODE_BITSIZE (mode), reg_class, 1);
2912 if (reg_mode != BLKmode)
2914 rtx mem = assign_stack_temp (reg_mode,
2915 GET_MODE_SIZE (mode), 0);
2916 rtx cmem = adjust_address (mem, mode, 0);
2919 = N_("function using short complex types cannot be inline");
2923 rtx sreg = gen_rtx_SUBREG (reg_mode, x, 0);
2924 emit_move_insn_1 (cmem, y);
2925 return emit_move_insn_1 (sreg, mem);
2929 rtx sreg = gen_rtx_SUBREG (reg_mode, y, 0);
2930 emit_move_insn_1 (mem, sreg);
2931 return emit_move_insn_1 (x, cmem);
2937 realpart_x = gen_realpart (submode, x);
2938 realpart_y = gen_realpart (submode, y);
2939 imagpart_x = gen_imagpart (submode, x);
2940 imagpart_y = gen_imagpart (submode, y);
2942 /* Show the output dies here. This is necessary for SUBREGs
2943 of pseudos since we cannot track their lifetimes correctly;
2944 hard regs shouldn't appear here except as return values.
2945 We never want to emit such a clobber after reload. */
2947 && ! (reload_in_progress || reload_completed)
2948 && (GET_CODE (realpart_x) == SUBREG
2949 || GET_CODE (imagpart_x) == SUBREG))
2951 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2954 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2955 (realpart_x, realpart_y));
2956 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2957 (imagpart_x, imagpart_y));
2960 return get_last_insn ();
2963 /* This will handle any multi-word mode that lacks a move_insn pattern.
2964 However, you will get better code if you define such patterns,
2965 even if they must turn into multiple assembler instructions. */
2966 else if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)
2972 #ifdef PUSH_ROUNDING
2974 /* If X is a push on the stack, do the push now and replace
2975 X with a reference to the stack pointer. */
2976 if (push_operand (x, GET_MODE (x)))
2981 /* Do not use anti_adjust_stack, since we don't want to update
2982 stack_pointer_delta. */
2983 temp = expand_binop (Pmode,
2984 #ifdef STACK_GROWS_DOWNWARD
2991 (PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x)))),
2995 if (temp != stack_pointer_rtx)
2996 emit_move_insn (stack_pointer_rtx, temp);
2998 code = GET_CODE (XEXP (x, 0));
2999 /* Just hope that small offsets off SP are OK. */
3000 if (code == POST_INC)
3001 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3002 GEN_INT (-(HOST_WIDE_INT)
3003 GET_MODE_SIZE (GET_MODE (x))));
3004 else if (code == POST_DEC)
3005 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3006 GEN_INT (GET_MODE_SIZE (GET_MODE (x))));
3008 temp = stack_pointer_rtx;
3010 x = change_address (x, VOIDmode, temp);
3014 /* If we are in reload, see if either operand is a MEM whose address
3015 is scheduled for replacement. */
3016 if (reload_in_progress && GET_CODE (x) == MEM
3017 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3018 x = replace_equiv_address_nv (x, inner);
3019 if (reload_in_progress && GET_CODE (y) == MEM
3020 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3021 y = replace_equiv_address_nv (y, inner);
3027 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3030 rtx xpart = operand_subword (x, i, 1, mode);
3031 rtx ypart = operand_subword (y, i, 1, mode);
3033 /* If we can't get a part of Y, put Y into memory if it is a
3034 constant. Otherwise, force it into a register. If we still
3035 can't get a part of Y, abort. */
3036 if (ypart == 0 && CONSTANT_P (y))
3038 y = force_const_mem (mode, y);
3039 ypart = operand_subword (y, i, 1, mode);
3041 else if (ypart == 0)
3042 ypart = operand_subword_force (y, i, mode);
3044 if (xpart == 0 || ypart == 0)
3047 need_clobber |= (GET_CODE (xpart) == SUBREG);
3049 last_insn = emit_move_insn (xpart, ypart);
3052 seq = gen_sequence ();
3055 /* Show the output dies here. This is necessary for SUBREGs
3056 of pseudos since we cannot track their lifetimes correctly;
3057 hard regs shouldn't appear here except as return values.
3058 We never want to emit such a clobber after reload. */
3060 && ! (reload_in_progress || reload_completed)
3061 && need_clobber != 0)
3063 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3074 /* Pushing data onto the stack. */
3076 /* Push a block of length SIZE (perhaps variable)
3077 and return an rtx to address the beginning of the block.
3078 Note that it is not possible for the value returned to be a QUEUED.
3079 The value may be virtual_outgoing_args_rtx.
3081 EXTRA is the number of bytes of padding to push in addition to SIZE.
3082 BELOW nonzero means this padding comes at low addresses;
3083 otherwise, the padding comes at high addresses. */
3086 push_block (size, extra, below)
3092 size = convert_modes (Pmode, ptr_mode, size, 1);
3093 if (CONSTANT_P (size))
3094 anti_adjust_stack (plus_constant (size, extra));
3095 else if (GET_CODE (size) == REG && extra == 0)
3096 anti_adjust_stack (size);
3099 temp = copy_to_mode_reg (Pmode, size);
3101 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3102 temp, 0, OPTAB_LIB_WIDEN);
3103 anti_adjust_stack (temp);
3106 #ifndef STACK_GROWS_DOWNWARD
3112 temp = virtual_outgoing_args_rtx;
3113 if (extra != 0 && below)
3114 temp = plus_constant (temp, extra);
3118 if (GET_CODE (size) == CONST_INT)
3119 temp = plus_constant (virtual_outgoing_args_rtx,
3120 -INTVAL (size) - (below ? 0 : extra));
3121 else if (extra != 0 && !below)
3122 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3123 negate_rtx (Pmode, plus_constant (size, extra)));
3125 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3126 negate_rtx (Pmode, size));
3129 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3132 #ifdef PUSH_ROUNDING
3134 /* Emit single push insn. */
3137 emit_single_push_insn (mode, x, type)
3139 enum machine_mode mode;
3143 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3145 enum insn_code icode;
3146 insn_operand_predicate_fn pred;
3148 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3149 /* If there is push pattern, use it. Otherwise try old way of throwing
3150 MEM representing push operation to move expander. */
3151 icode = push_optab->handlers[(int) mode].insn_code;
3152 if (icode != CODE_FOR_nothing)
3154 if (((pred = insn_data[(int) icode].operand[0].predicate)
3155 && !((*pred) (x, mode))))
3156 x = force_reg (mode, x);
3157 emit_insn (GEN_FCN (icode) (x));
3160 if (GET_MODE_SIZE (mode) == rounded_size)
3161 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3164 #ifdef STACK_GROWS_DOWNWARD
3165 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3166 GEN_INT (-(HOST_WIDE_INT)rounded_size));
3168 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3169 GEN_INT (rounded_size));
3171 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3174 dest = gen_rtx_MEM (mode, dest_addr);
3178 set_mem_attributes (dest, type, 1);
3180 if (flag_optimize_sibling_calls)
3181 /* Function incoming arguments may overlap with sibling call
3182 outgoing arguments and we cannot allow reordering of reads
3183 from function arguments with stores to outgoing arguments
3184 of sibling calls. */
3185 set_mem_alias_set (dest, 0);
3187 emit_move_insn (dest, x);
3191 /* Generate code to push X onto the stack, assuming it has mode MODE and
3193 MODE is redundant except when X is a CONST_INT (since they don't
3195 SIZE is an rtx for the size of data to be copied (in bytes),
3196 needed only if X is BLKmode.
3198 ALIGN (in bits) is maximum alignment we can assume.
3200 If PARTIAL and REG are both nonzero, then copy that many of the first
3201 words of X into registers starting with REG, and push the rest of X.
3202 The amount of space pushed is decreased by PARTIAL words,
3203 rounded *down* to a multiple of PARM_BOUNDARY.
3204 REG must be a hard register in this case.
3205 If REG is zero but PARTIAL is not, take any all others actions for an
3206 argument partially in registers, but do not actually load any
3209 EXTRA is the amount in bytes of extra space to leave next to this arg.
3210 This is ignored if an argument block has already been allocated.
3212 On a machine that lacks real push insns, ARGS_ADDR is the address of
3213 the bottom of the argument block for this call. We use indexing off there
3214 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3215 argument block has not been preallocated.
3217 ARGS_SO_FAR is the size of args previously pushed for this call.
3219 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3220 for arguments passed in registers. If nonzero, it will be the number
3221 of bytes required. */
3224 emit_push_insn (x, mode, type, size, align, partial, reg, extra,
3225 args_addr, args_so_far, reg_parm_stack_space,
3228 enum machine_mode mode;
3237 int reg_parm_stack_space;
3241 enum direction stack_direction
3242 #ifdef STACK_GROWS_DOWNWARD
3248 /* Decide where to pad the argument: `downward' for below,
3249 `upward' for above, or `none' for don't pad it.
3250 Default is below for small data on big-endian machines; else above. */
3251 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3253 /* Invert direction if stack is post-decrement.
3255 if (STACK_PUSH_CODE == POST_DEC)
3256 if (where_pad != none)
3257 where_pad = (where_pad == downward ? upward : downward);
3259 xinner = x = protect_from_queue (x, 0);
3261 if (mode == BLKmode)
3263 /* Copy a block into the stack, entirely or partially. */
3266 int used = partial * UNITS_PER_WORD;
3267 int offset = used % (PARM_BOUNDARY / BITS_PER_UNIT);
3275 /* USED is now the # of bytes we need not copy to the stack
3276 because registers will take care of them. */
3279 xinner = adjust_address (xinner, BLKmode, used);
3281 /* If the partial register-part of the arg counts in its stack size,
3282 skip the part of stack space corresponding to the registers.
3283 Otherwise, start copying to the beginning of the stack space,
3284 by setting SKIP to 0. */
3285 skip = (reg_parm_stack_space == 0) ? 0 : used;
3287 #ifdef PUSH_ROUNDING
3288 /* Do it with several push insns if that doesn't take lots of insns
3289 and if there is no difficulty with push insns that skip bytes
3290 on the stack for alignment purposes. */
3293 && GET_CODE (size) == CONST_INT
3295 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3296 /* Here we avoid the case of a structure whose weak alignment
3297 forces many pushes of a small amount of data,
3298 and such small pushes do rounding that causes trouble. */
3299 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3300 || align >= BIGGEST_ALIGNMENT
3301 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3302 == (align / BITS_PER_UNIT)))
3303 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3305 /* Push padding now if padding above and stack grows down,
3306 or if padding below and stack grows up.
3307 But if space already allocated, this has already been done. */
3308 if (extra && args_addr == 0
3309 && where_pad != none && where_pad != stack_direction)
3310 anti_adjust_stack (GEN_INT (extra));
3312 move_by_pieces (NULL, xinner, INTVAL (size) - used, align);
3315 #endif /* PUSH_ROUNDING */
3319 /* Otherwise make space on the stack and copy the data
3320 to the address of that space. */
3322 /* Deduct words put into registers from the size we must copy. */
3325 if (GET_CODE (size) == CONST_INT)
3326 size = GEN_INT (INTVAL (size) - used);
3328 size = expand_binop (GET_MODE (size), sub_optab, size,
3329 GEN_INT (used), NULL_RTX, 0,
3333 /* Get the address of the stack space.
3334 In this case, we do not deal with EXTRA separately.
3335 A single stack adjust will do. */
3338 temp = push_block (size, extra, where_pad == downward);
3341 else if (GET_CODE (args_so_far) == CONST_INT)
3342 temp = memory_address (BLKmode,
3343 plus_constant (args_addr,
3344 skip + INTVAL (args_so_far)));
3346 temp = memory_address (BLKmode,
3347 plus_constant (gen_rtx_PLUS (Pmode,
3351 target = gen_rtx_MEM (BLKmode, temp);
3355 set_mem_attributes (target, type, 1);
3356 /* Function incoming arguments may overlap with sibling call
3357 outgoing arguments and we cannot allow reordering of reads
3358 from function arguments with stores to outgoing arguments
3359 of sibling calls. */
3360 set_mem_alias_set (target, 0);
3363 set_mem_align (target, align);
3365 /* TEMP is the address of the block. Copy the data there. */
3366 if (GET_CODE (size) == CONST_INT
3367 && MOVE_BY_PIECES_P ((unsigned) INTVAL (size), align))
3369 move_by_pieces (target, xinner, INTVAL (size), align);
3374 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
3375 enum machine_mode mode;
3377 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3379 mode = GET_MODE_WIDER_MODE (mode))
3381 enum insn_code code = movstr_optab[(int) mode];
3382 insn_operand_predicate_fn pred;
3384 if (code != CODE_FOR_nothing
3385 && ((GET_CODE (size) == CONST_INT
3386 && ((unsigned HOST_WIDE_INT) INTVAL (size)
3387 <= (GET_MODE_MASK (mode) >> 1)))
3388 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
3389 && (!(pred = insn_data[(int) code].operand[0].predicate)
3390 || ((*pred) (target, BLKmode)))
3391 && (!(pred = insn_data[(int) code].operand[1].predicate)
3392 || ((*pred) (xinner, BLKmode)))
3393 && (!(pred = insn_data[(int) code].operand[3].predicate)
3394 || ((*pred) (opalign, VOIDmode))))
3396 rtx op2 = convert_to_mode (mode, size, 1);
3397 rtx last = get_last_insn ();
3400 pred = insn_data[(int) code].operand[2].predicate;
3401 if (pred != 0 && ! (*pred) (op2, mode))
3402 op2 = copy_to_mode_reg (mode, op2);
3404 pat = GEN_FCN ((int) code) (target, xinner,
3412 delete_insns_since (last);
3417 if (!ACCUMULATE_OUTGOING_ARGS)
3419 /* If the source is referenced relative to the stack pointer,
3420 copy it to another register to stabilize it. We do not need
3421 to do this if we know that we won't be changing sp. */
3423 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3424 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3425 temp = copy_to_reg (temp);
3428 /* Make inhibit_defer_pop nonzero around the library call
3429 to force it to pop the bcopy-arguments right away. */
3431 #ifdef TARGET_MEM_FUNCTIONS
3432 emit_library_call (memcpy_libfunc, LCT_NORMAL,
3433 VOIDmode, 3, temp, Pmode, XEXP (xinner, 0), Pmode,
3434 convert_to_mode (TYPE_MODE (sizetype),
3435 size, TREE_UNSIGNED (sizetype)),
3436 TYPE_MODE (sizetype));
3438 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3439 VOIDmode, 3, XEXP (xinner, 0), Pmode, temp, Pmode,
3440 convert_to_mode (TYPE_MODE (integer_type_node),
3442 TREE_UNSIGNED (integer_type_node)),
3443 TYPE_MODE (integer_type_node));
3448 else if (partial > 0)
3450 /* Scalar partly in registers. */
3452 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3455 /* # words of start of argument
3456 that we must make space for but need not store. */
3457 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3458 int args_offset = INTVAL (args_so_far);
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 /* If we make space by pushing it, we might as well push
3469 the real data. Otherwise, we can leave OFFSET nonzero
3470 and leave the space uninitialized. */
3474 /* Now NOT_STACK gets the number of words that we don't need to
3475 allocate on the stack. */
3476 not_stack = partial - offset;
3478 /* If the partial register-part of the arg counts in its stack size,
3479 skip the part of stack space corresponding to the registers.
3480 Otherwise, start copying to the beginning of the stack space,
3481 by setting SKIP to 0. */
3482 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3484 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3485 x = validize_mem (force_const_mem (mode, x));
3487 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3488 SUBREGs of such registers are not allowed. */
3489 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER
3490 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3491 x = copy_to_reg (x);
3493 /* Loop over all the words allocated on the stack for this arg. */
3494 /* We can do it by words, because any scalar bigger than a word
3495 has a size a multiple of a word. */
3496 #ifndef PUSH_ARGS_REVERSED
3497 for (i = not_stack; i < size; i++)
3499 for (i = size - 1; i >= not_stack; i--)
3501 if (i >= not_stack + offset)
3502 emit_push_insn (operand_subword_force (x, i, mode),
3503 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3505 GEN_INT (args_offset + ((i - not_stack + skip)
3507 reg_parm_stack_space, alignment_pad);
3512 rtx target = NULL_RTX;
3515 /* Push padding now if padding above and stack grows down,
3516 or if padding below and stack grows up.
3517 But if space already allocated, this has already been done. */
3518 if (extra && args_addr == 0
3519 && where_pad != none && where_pad != stack_direction)
3520 anti_adjust_stack (GEN_INT (extra));
3522 #ifdef PUSH_ROUNDING
3523 if (args_addr == 0 && PUSH_ARGS)
3524 emit_single_push_insn (mode, x, type);
3528 if (GET_CODE (args_so_far) == CONST_INT)
3530 = memory_address (mode,
3531 plus_constant (args_addr,
3532 INTVAL (args_so_far)));
3534 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3537 dest = gen_rtx_MEM (mode, addr);
3540 set_mem_attributes (dest, type, 1);
3541 /* Function incoming arguments may overlap with sibling call
3542 outgoing arguments and we cannot allow reordering of reads
3543 from function arguments with stores to outgoing arguments
3544 of sibling calls. */
3545 set_mem_alias_set (dest, 0);
3548 emit_move_insn (dest, x);
3554 /* If part should go in registers, copy that part
3555 into the appropriate registers. Do this now, at the end,
3556 since mem-to-mem copies above may do function calls. */
3557 if (partial > 0 && reg != 0)
3559 /* Handle calls that pass values in multiple non-contiguous locations.
3560 The Irix 6 ABI has examples of this. */
3561 if (GET_CODE (reg) == PARALLEL)
3562 emit_group_load (reg, x, -1); /* ??? size? */
3564 move_block_to_reg (REGNO (reg), x, partial, mode);
3567 if (extra && args_addr == 0 && where_pad == stack_direction)
3568 anti_adjust_stack (GEN_INT (extra));
3570 if (alignment_pad && args_addr == 0)
3571 anti_adjust_stack (alignment_pad);
3574 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3582 /* Only registers can be subtargets. */
3583 || GET_CODE (x) != REG
3584 /* If the register is readonly, it can't be set more than once. */
3585 || RTX_UNCHANGING_P (x)
3586 /* Don't use hard regs to avoid extending their life. */
3587 || REGNO (x) < FIRST_PSEUDO_REGISTER
3588 /* Avoid subtargets inside loops,
3589 since they hide some invariant expressions. */
3590 || preserve_subexpressions_p ())
3594 /* Expand an assignment that stores the value of FROM into TO.
3595 If WANT_VALUE is nonzero, return an rtx for the value of TO.
3596 (This may contain a QUEUED rtx;
3597 if the value is constant, this rtx is a constant.)
3598 Otherwise, the returned value is NULL_RTX.
3600 SUGGEST_REG is no longer actually used.
3601 It used to mean, copy the value through a register
3602 and return that register, if that is possible.
3603 We now use WANT_VALUE to decide whether to do this. */
3606 expand_assignment (to, from, want_value, suggest_reg)
3609 int suggest_reg ATTRIBUTE_UNUSED;
3614 /* Don't crash if the lhs of the assignment was erroneous. */
3616 if (TREE_CODE (to) == ERROR_MARK)
3618 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3619 return want_value ? result : NULL_RTX;
3622 /* Assignment of a structure component needs special treatment
3623 if the structure component's rtx is not simply a MEM.
3624 Assignment of an array element at a constant index, and assignment of
3625 an array element in an unaligned packed structure field, has the same
3628 if (TREE_CODE (to) == COMPONENT_REF || TREE_CODE (to) == BIT_FIELD_REF
3629 || TREE_CODE (to) == ARRAY_REF || TREE_CODE (to) == ARRAY_RANGE_REF)
3631 enum machine_mode mode1;
3632 HOST_WIDE_INT bitsize, bitpos;
3640 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3641 &unsignedp, &volatilep);
3643 /* If we are going to use store_bit_field and extract_bit_field,
3644 make sure to_rtx will be safe for multiple use. */
3646 if (mode1 == VOIDmode && want_value)
3647 tem = stabilize_reference (tem);
3649 orig_to_rtx = to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
3653 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
3655 if (GET_CODE (to_rtx) != MEM)
3658 if (GET_MODE (offset_rtx) != ptr_mode)
3659 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3661 #ifdef POINTERS_EXTEND_UNSIGNED
3662 if (GET_MODE (offset_rtx) != Pmode)
3663 offset_rtx = convert_memory_address (Pmode, offset_rtx);
3666 /* A constant address in TO_RTX can have VOIDmode, we must not try
3667 to call force_reg for that case. Avoid that case. */
3668 if (GET_CODE (to_rtx) == MEM
3669 && GET_MODE (to_rtx) == BLKmode
3670 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3672 && (bitpos % bitsize) == 0
3673 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3674 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
3677 = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
3679 if (GET_CODE (XEXP (temp, 0)) == REG)
3682 to_rtx = (replace_equiv_address
3683 (to_rtx, force_reg (GET_MODE (XEXP (temp, 0)),
3688 to_rtx = offset_address (to_rtx, offset_rtx,
3689 highest_pow2_factor (offset));
3692 if (GET_CODE (to_rtx) == MEM)
3694 tree old_expr = MEM_EXPR (to_rtx);
3696 /* If the field is at offset zero, we could have been given the
3697 DECL_RTX of the parent struct. Don't munge it. */
3698 to_rtx = shallow_copy_rtx (to_rtx);
3700 set_mem_attributes (to_rtx, to, 0);
3702 /* If we changed MEM_EXPR, that means we're now referencing
3703 the COMPONENT_REF, which means that MEM_OFFSET must be
3704 relative to that field. But we've not yet reflected BITPOS
3705 in TO_RTX. This will be done in store_field. Adjust for
3706 that by biasing MEM_OFFSET by -bitpos. */
3707 if (MEM_EXPR (to_rtx) != old_expr && MEM_OFFSET (to_rtx)
3708 && (bitpos / BITS_PER_UNIT) != 0)
3709 set_mem_offset (to_rtx, GEN_INT (INTVAL (MEM_OFFSET (to_rtx))
3710 - (bitpos / BITS_PER_UNIT)));
3713 /* Deal with volatile and readonly fields. The former is only done
3714 for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
3715 if (volatilep && GET_CODE (to_rtx) == MEM)
3717 if (to_rtx == orig_to_rtx)
3718 to_rtx = copy_rtx (to_rtx);
3719 MEM_VOLATILE_P (to_rtx) = 1;
3722 if (TREE_CODE (to) == COMPONENT_REF
3723 && TREE_READONLY (TREE_OPERAND (to, 1)))
3725 if (to_rtx == orig_to_rtx)
3726 to_rtx = copy_rtx (to_rtx);
3727 RTX_UNCHANGING_P (to_rtx) = 1;
3730 if (! can_address_p (to))
3732 if (to_rtx == orig_to_rtx)
3733 to_rtx = copy_rtx (to_rtx);
3734 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
3737 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3739 /* Spurious cast for HPUX compiler. */
3740 ? ((enum machine_mode)
3741 TYPE_MODE (TREE_TYPE (to)))
3743 unsignedp, TREE_TYPE (tem), get_alias_set (to));
3745 preserve_temp_slots (result);
3749 /* If the value is meaningful, convert RESULT to the proper mode.
3750 Otherwise, return nothing. */
3751 return (want_value ? convert_modes (TYPE_MODE (TREE_TYPE (to)),
3752 TYPE_MODE (TREE_TYPE (from)),
3754 TREE_UNSIGNED (TREE_TYPE (to)))
3758 /* If the rhs is a function call and its value is not an aggregate,
3759 call the function before we start to compute the lhs.
3760 This is needed for correct code for cases such as
3761 val = setjmp (buf) on machines where reference to val
3762 requires loading up part of an address in a separate insn.
3764 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3765 since it might be a promoted variable where the zero- or sign- extension
3766 needs to be done. Handling this in the normal way is safe because no
3767 computation is done before the call. */
3768 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from)
3769 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3770 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3771 && GET_CODE (DECL_RTL (to)) == REG))
3776 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3778 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3780 /* Handle calls that return values in multiple non-contiguous locations.
3781 The Irix 6 ABI has examples of this. */
3782 if (GET_CODE (to_rtx) == PARALLEL)
3783 emit_group_load (to_rtx, value, int_size_in_bytes (TREE_TYPE (from)));
3784 else if (GET_MODE (to_rtx) == BLKmode)
3785 emit_block_move (to_rtx, value, expr_size (from));
3788 #ifdef POINTERS_EXTEND_UNSIGNED
3789 if (POINTER_TYPE_P (TREE_TYPE (to))
3790 && GET_MODE (to_rtx) != GET_MODE (value))
3791 value = convert_memory_address (GET_MODE (to_rtx), value);
3793 emit_move_insn (to_rtx, value);
3795 preserve_temp_slots (to_rtx);
3798 return want_value ? to_rtx : NULL_RTX;
3801 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3802 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3805 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3807 /* Don't move directly into a return register. */
3808 if (TREE_CODE (to) == RESULT_DECL
3809 && (GET_CODE (to_rtx) == REG || GET_CODE (to_rtx) == PARALLEL))
3814 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3816 if (GET_CODE (to_rtx) == PARALLEL)
3817 emit_group_load (to_rtx, temp, int_size_in_bytes (TREE_TYPE (from)));
3819 emit_move_insn (to_rtx, temp);
3821 preserve_temp_slots (to_rtx);
3824 return want_value ? to_rtx : NULL_RTX;
3827 /* In case we are returning the contents of an object which overlaps
3828 the place the value is being stored, use a safe function when copying
3829 a value through a pointer into a structure value return block. */
3830 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3831 && current_function_returns_struct
3832 && !current_function_returns_pcc_struct)
3837 size = expr_size (from);
3838 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
3840 #ifdef TARGET_MEM_FUNCTIONS
3841 emit_library_call (memmove_libfunc, LCT_NORMAL,
3842 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3843 XEXP (from_rtx, 0), Pmode,
3844 convert_to_mode (TYPE_MODE (sizetype),
3845 size, TREE_UNSIGNED (sizetype)),
3846 TYPE_MODE (sizetype));
3848 emit_library_call (bcopy_libfunc, LCT_NORMAL,
3849 VOIDmode, 3, XEXP (from_rtx, 0), Pmode,
3850 XEXP (to_rtx, 0), Pmode,
3851 convert_to_mode (TYPE_MODE (integer_type_node),
3852 size, TREE_UNSIGNED (integer_type_node)),
3853 TYPE_MODE (integer_type_node));
3856 preserve_temp_slots (to_rtx);
3859 return want_value ? to_rtx : NULL_RTX;
3862 /* Compute FROM and store the value in the rtx we got. */
3865 result = store_expr (from, to_rtx, want_value);
3866 preserve_temp_slots (result);
3869 return want_value ? result : NULL_RTX;
3872 /* Generate code for computing expression EXP,
3873 and storing the value into TARGET.
3874 TARGET may contain a QUEUED rtx.
3876 If WANT_VALUE is nonzero, return a copy of the value
3877 not in TARGET, so that we can be sure to use the proper
3878 value in a containing expression even if TARGET has something
3879 else stored in it. If possible, we copy the value through a pseudo
3880 and return that pseudo. Or, if the value is constant, we try to
3881 return the constant. In some cases, we return a pseudo
3882 copied *from* TARGET.
3884 If the mode is BLKmode then we may return TARGET itself.
3885 It turns out that in BLKmode it doesn't cause a problem.
3886 because C has no operators that could combine two different
3887 assignments into the same BLKmode object with different values
3888 with no sequence point. Will other languages need this to
3891 If WANT_VALUE is 0, we return NULL, to make sure
3892 to catch quickly any cases where the caller uses the value
3893 and fails to set WANT_VALUE. */
3896 store_expr (exp, target, want_value)
3902 int dont_return_target = 0;
3903 int dont_store_target = 0;
3905 if (TREE_CODE (exp) == COMPOUND_EXPR)
3907 /* Perform first part of compound expression, then assign from second
3909 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
3911 return store_expr (TREE_OPERAND (exp, 1), target, want_value);
3913 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
3915 /* For conditional expression, get safe form of the target. Then
3916 test the condition, doing the appropriate assignment on either
3917 side. This avoids the creation of unnecessary temporaries.
3918 For non-BLKmode, it is more efficient not to do this. */
3920 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
3923 target = protect_from_queue (target, 1);
3925 do_pending_stack_adjust ();
3927 jumpifnot (TREE_OPERAND (exp, 0), lab1);
3928 start_cleanup_deferral ();
3929 store_expr (TREE_OPERAND (exp, 1), target, 0);
3930 end_cleanup_deferral ();
3932 emit_jump_insn (gen_jump (lab2));
3935 start_cleanup_deferral ();
3936 store_expr (TREE_OPERAND (exp, 2), target, 0);
3937 end_cleanup_deferral ();
3942 return want_value ? target : NULL_RTX;
3944 else if (queued_subexp_p (target))
3945 /* If target contains a postincrement, let's not risk
3946 using it as the place to generate the rhs. */
3948 if (GET_MODE (target) != BLKmode && GET_MODE (target) != VOIDmode)
3950 /* Expand EXP into a new pseudo. */
3951 temp = gen_reg_rtx (GET_MODE (target));
3952 temp = expand_expr (exp, temp, GET_MODE (target), 0);
3955 temp = expand_expr (exp, NULL_RTX, GET_MODE (target), 0);
3957 /* If target is volatile, ANSI requires accessing the value
3958 *from* the target, if it is accessed. So make that happen.
3959 In no case return the target itself. */
3960 if (! MEM_VOLATILE_P (target) && want_value)
3961 dont_return_target = 1;
3963 else if (want_value && GET_CODE (target) == MEM && ! MEM_VOLATILE_P (target)
3964 && GET_MODE (target) != BLKmode)
3965 /* If target is in memory and caller wants value in a register instead,
3966 arrange that. Pass TARGET as target for expand_expr so that,
3967 if EXP is another assignment, WANT_VALUE will be nonzero for it.
3968 We know expand_expr will not use the target in that case.
3969 Don't do this if TARGET is volatile because we are supposed
3970 to write it and then read it. */
3972 temp = expand_expr (exp, target, GET_MODE (target), 0);
3973 if (GET_MODE (temp) != BLKmode && GET_MODE (temp) != VOIDmode)
3975 /* If TEMP is already in the desired TARGET, only copy it from
3976 memory and don't store it there again. */
3978 || (rtx_equal_p (temp, target)
3979 && ! side_effects_p (temp) && ! side_effects_p (target)))
3980 dont_store_target = 1;
3981 temp = copy_to_reg (temp);
3983 dont_return_target = 1;
3985 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
3986 /* If this is an scalar in a register that is stored in a wider mode
3987 than the declared mode, compute the result into its declared mode
3988 and then convert to the wider mode. Our value is the computed
3991 /* If we don't want a value, we can do the conversion inside EXP,
3992 which will often result in some optimizations. Do the conversion
3993 in two steps: first change the signedness, if needed, then
3994 the extend. But don't do this if the type of EXP is a subtype
3995 of something else since then the conversion might involve
3996 more than just converting modes. */
3997 if (! want_value && INTEGRAL_TYPE_P (TREE_TYPE (exp))
3998 && TREE_TYPE (TREE_TYPE (exp)) == 0)
4000 if (TREE_UNSIGNED (TREE_TYPE (exp))
4001 != SUBREG_PROMOTED_UNSIGNED_P (target))
4004 (signed_or_unsigned_type (SUBREG_PROMOTED_UNSIGNED_P (target),
4008 exp = convert (type_for_mode (GET_MODE (SUBREG_REG (target)),
4009 SUBREG_PROMOTED_UNSIGNED_P (target)),
4013 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
4015 /* If TEMP is a volatile MEM and we want a result value, make
4016 the access now so it gets done only once. Likewise if
4017 it contains TARGET. */
4018 if (GET_CODE (temp) == MEM && want_value
4019 && (MEM_VOLATILE_P (temp)
4020 || reg_mentioned_p (SUBREG_REG (target), XEXP (temp, 0))))
4021 temp = copy_to_reg (temp);
4023 /* If TEMP is a VOIDmode constant, use convert_modes to make
4024 sure that we properly convert it. */
4025 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4027 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4028 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4029 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4030 GET_MODE (target), temp,
4031 SUBREG_PROMOTED_UNSIGNED_P (target));
4034 convert_move (SUBREG_REG (target), temp,
4035 SUBREG_PROMOTED_UNSIGNED_P (target));
4037 /* If we promoted a constant, change the mode back down to match
4038 target. Otherwise, the caller might get confused by a result whose
4039 mode is larger than expected. */
4041 if (want_value && GET_MODE (temp) != GET_MODE (target)
4042 && GET_MODE (temp) != VOIDmode)
4044 temp = gen_lowpart_SUBREG (GET_MODE (target), temp);
4045 SUBREG_PROMOTED_VAR_P (temp) = 1;
4046 SUBREG_PROMOTED_UNSIGNED_P (temp)
4047 = SUBREG_PROMOTED_UNSIGNED_P (target);
4050 return want_value ? temp : NULL_RTX;
4054 temp = expand_expr (exp, target, GET_MODE (target), 0);
4055 /* Return TARGET if it's a specified hardware register.
4056 If TARGET is a volatile mem ref, either return TARGET
4057 or return a reg copied *from* TARGET; ANSI requires this.
4059 Otherwise, if TEMP is not TARGET, return TEMP
4060 if it is constant (for efficiency),
4061 or if we really want the correct value. */
4062 if (!(target && GET_CODE (target) == REG
4063 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4064 && !(GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
4065 && ! rtx_equal_p (temp, target)
4066 && (CONSTANT_P (temp) || want_value))
4067 dont_return_target = 1;
4070 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4071 the same as that of TARGET, adjust the constant. This is needed, for
4072 example, in case it is a CONST_DOUBLE and we want only a word-sized
4074 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4075 && TREE_CODE (exp) != ERROR_MARK
4076 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4077 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4078 temp, TREE_UNSIGNED (TREE_TYPE (exp)));
4080 /* If value was not generated in the target, store it there.
4081 Convert the value to TARGET's type first if necessary.
4082 If TEMP and TARGET compare equal according to rtx_equal_p, but
4083 one or both of them are volatile memory refs, we have to distinguish
4085 - expand_expr has used TARGET. In this case, we must not generate
4086 another copy. This can be detected by TARGET being equal according
4088 - expand_expr has not used TARGET - that means that the source just
4089 happens to have the same RTX form. Since temp will have been created
4090 by expand_expr, it will compare unequal according to == .
4091 We must generate a copy in this case, to reach the correct number
4092 of volatile memory references. */
4094 if ((! rtx_equal_p (temp, target)
4095 || (temp != target && (side_effects_p (temp)
4096 || side_effects_p (target))))
4097 && TREE_CODE (exp) != ERROR_MARK
4098 && ! dont_store_target)
4100 target = protect_from_queue (target, 1);
4101 if (GET_MODE (temp) != GET_MODE (target)
4102 && GET_MODE (temp) != VOIDmode)
4104 int unsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
4105 if (dont_return_target)
4107 /* In this case, we will return TEMP,
4108 so make sure it has the proper mode.
4109 But don't forget to store the value into TARGET. */
4110 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4111 emit_move_insn (target, temp);
4114 convert_move (target, temp, unsignedp);
4117 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4119 /* Handle copying a string constant into an array. The string
4120 constant may be shorter than the array. So copy just the string's
4121 actual length, and clear the rest. First get the size of the data
4122 type of the string, which is actually the size of the target. */
4123 rtx size = expr_size (exp);
4125 if (GET_CODE (size) == CONST_INT
4126 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4127 emit_block_move (target, temp, size);
4130 /* Compute the size of the data to copy from the string. */
4132 = size_binop (MIN_EXPR,
4133 make_tree (sizetype, size),
4134 size_int (TREE_STRING_LENGTH (exp)));
4135 rtx copy_size_rtx = expand_expr (copy_size, NULL_RTX,
4139 /* Copy that much. */
4140 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx, 0);
4141 emit_block_move (target, temp, copy_size_rtx);
4143 /* Figure out how much is left in TARGET that we have to clear.
4144 Do all calculations in ptr_mode. */
4145 if (GET_CODE (copy_size_rtx) == CONST_INT)
4147 size = plus_constant (size, -INTVAL (copy_size_rtx));
4148 target = adjust_address (target, BLKmode,
4149 INTVAL (copy_size_rtx));
4153 size = expand_binop (ptr_mode, sub_optab, size,
4154 copy_size_rtx, NULL_RTX, 0,
4157 #ifdef POINTERS_EXTEND_UNSIGNED
4158 if (GET_MODE (copy_size_rtx) != Pmode)
4159 copy_size_rtx = convert_memory_address (Pmode,
4163 target = offset_address (target, copy_size_rtx,
4164 highest_pow2_factor (copy_size));
4165 label = gen_label_rtx ();
4166 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4167 GET_MODE (size), 0, label);
4170 if (size != const0_rtx)
4171 clear_storage (target, size);
4177 /* Handle calls that return values in multiple non-contiguous locations.
4178 The Irix 6 ABI has examples of this. */
4179 else if (GET_CODE (target) == PARALLEL)
4180 emit_group_load (target, temp, int_size_in_bytes (TREE_TYPE (exp)));
4181 else if (GET_MODE (temp) == BLKmode)
4182 emit_block_move (target, temp, expr_size (exp));
4184 emit_move_insn (target, temp);
4187 /* If we don't want a value, return NULL_RTX. */
4191 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
4192 ??? The latter test doesn't seem to make sense. */
4193 else if (dont_return_target && GET_CODE (temp) != MEM)
4196 /* Return TARGET itself if it is a hard register. */
4197 else if (want_value && GET_MODE (target) != BLKmode
4198 && ! (GET_CODE (target) == REG
4199 && REGNO (target) < FIRST_PSEUDO_REGISTER))
4200 return copy_to_reg (target);
4206 /* Return 1 if EXP just contains zeros. */
4214 switch (TREE_CODE (exp))
4218 case NON_LVALUE_EXPR:
4219 case VIEW_CONVERT_EXPR:
4220 return is_zeros_p (TREE_OPERAND (exp, 0));
4223 return integer_zerop (exp);
4227 is_zeros_p (TREE_REALPART (exp)) && is_zeros_p (TREE_IMAGPART (exp));
4230 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp), dconst0);
4233 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4234 return CONSTRUCTOR_ELTS (exp) == NULL_TREE;
4235 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4236 if (! is_zeros_p (TREE_VALUE (elt)))
4246 /* Return 1 if EXP contains mostly (3/4) zeros. */
4249 mostly_zeros_p (exp)
4252 if (TREE_CODE (exp) == CONSTRUCTOR)
4254 int elts = 0, zeros = 0;
4255 tree elt = CONSTRUCTOR_ELTS (exp);
4256 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
4258 /* If there are no ranges of true bits, it is all zero. */
4259 return elt == NULL_TREE;
4261 for (; elt; elt = TREE_CHAIN (elt))
4263 /* We do not handle the case where the index is a RANGE_EXPR,
4264 so the statistic will be somewhat inaccurate.
4265 We do make a more accurate count in store_constructor itself,
4266 so since this function is only used for nested array elements,
4267 this should be close enough. */
4268 if (mostly_zeros_p (TREE_VALUE (elt)))
4273 return 4 * zeros >= 3 * elts;
4276 return is_zeros_p (exp);
4279 /* Helper function for store_constructor.
4280 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4281 TYPE is the type of the CONSTRUCTOR, not the element type.
4282 CLEARED is as for store_constructor.
4283 ALIAS_SET is the alias set to use for any stores.
4285 This provides a recursive shortcut back to store_constructor when it isn't
4286 necessary to go through store_field. This is so that we can pass through
4287 the cleared field to let store_constructor know that we may not have to
4288 clear a substructure if the outer structure has already been cleared. */
4291 store_constructor_field (target, bitsize, bitpos, mode, exp, type, cleared,
4294 unsigned HOST_WIDE_INT bitsize;
4295 HOST_WIDE_INT bitpos;
4296 enum machine_mode mode;
4301 if (TREE_CODE (exp) == CONSTRUCTOR
4302 && bitpos % BITS_PER_UNIT == 0
4303 /* If we have a non-zero bitpos for a register target, then we just
4304 let store_field do the bitfield handling. This is unlikely to
4305 generate unnecessary clear instructions anyways. */
4306 && (bitpos == 0 || GET_CODE (target) == MEM))
4308 if (GET_CODE (target) == MEM)
4310 = adjust_address (target,
4311 GET_MODE (target) == BLKmode
4313 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4314 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4317 /* Update the alias set, if required. */
4318 if (GET_CODE (target) == MEM && ! MEM_KEEP_ALIAS_SET_P (target)
4319 && MEM_ALIAS_SET (target) != 0)
4321 target = copy_rtx (target);
4322 set_mem_alias_set (target, alias_set);
4325 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4328 store_field (target, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
4332 /* Store the value of constructor EXP into the rtx TARGET.
4333 TARGET is either a REG or a MEM; we know it cannot conflict, since
4334 safe_from_p has been called.
4335 CLEARED is true if TARGET is known to have been zero'd.
4336 SIZE is the number of bytes of TARGET we are allowed to modify: this
4337 may not be the same as the size of EXP if we are assigning to a field
4338 which has been packed to exclude padding bits. */
4341 store_constructor (exp, target, cleared, size)
4347 tree type = TREE_TYPE (exp);
4348 #ifdef WORD_REGISTER_OPERATIONS
4349 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4352 if (TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4353 || TREE_CODE (type) == QUAL_UNION_TYPE)
4357 /* We either clear the aggregate or indicate the value is dead. */
4358 if ((TREE_CODE (type) == UNION_TYPE
4359 || TREE_CODE (type) == QUAL_UNION_TYPE)
4361 && ! CONSTRUCTOR_ELTS (exp))
4362 /* If the constructor is empty, clear the union. */
4364 clear_storage (target, expr_size (exp));
4368 /* If we are building a static constructor into a register,
4369 set the initial value as zero so we can fold the value into
4370 a constant. But if more than one register is involved,
4371 this probably loses. */
4372 else if (! cleared && GET_CODE (target) == REG && TREE_STATIC (exp)
4373 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4375 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4379 /* If the constructor has fewer fields than the structure
4380 or if we are initializing the structure to mostly zeros,
4381 clear the whole structure first. Don't do this if TARGET is a
4382 register whose mode size isn't equal to SIZE since clear_storage
4383 can't handle this case. */
4384 else if (! cleared && size > 0
4385 && ((list_length (CONSTRUCTOR_ELTS (exp))
4386 != fields_length (type))
4387 || mostly_zeros_p (exp))
4388 && (GET_CODE (target) != REG
4389 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4392 clear_storage (target, GEN_INT (size));
4397 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4399 /* Store each element of the constructor into
4400 the corresponding field of TARGET. */
4402 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4404 tree field = TREE_PURPOSE (elt);
4405 tree value = TREE_VALUE (elt);
4406 enum machine_mode mode;
4407 HOST_WIDE_INT bitsize;
4408 HOST_WIDE_INT bitpos = 0;
4411 rtx to_rtx = target;
4413 /* Just ignore missing fields.
4414 We cleared the whole structure, above,
4415 if any fields are missing. */
4419 if (cleared && is_zeros_p (value))
4422 if (host_integerp (DECL_SIZE (field), 1))
4423 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4427 unsignedp = TREE_UNSIGNED (field);
4428 mode = DECL_MODE (field);
4429 if (DECL_BIT_FIELD (field))
4432 offset = DECL_FIELD_OFFSET (field);
4433 if (host_integerp (offset, 0)
4434 && host_integerp (bit_position (field), 0))
4436 bitpos = int_bit_position (field);
4440 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4446 if (contains_placeholder_p (offset))
4447 offset = build (WITH_RECORD_EXPR, sizetype,
4448 offset, make_tree (TREE_TYPE (exp), target));
4450 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4451 if (GET_CODE (to_rtx) != MEM)
4454 if (GET_MODE (offset_rtx) != ptr_mode)
4455 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4457 #ifdef POINTERS_EXTEND_UNSIGNED
4458 if (GET_MODE (offset_rtx) != Pmode)
4459 offset_rtx = convert_memory_address (Pmode, offset_rtx);
4462 to_rtx = offset_address (to_rtx, offset_rtx,
4463 highest_pow2_factor (offset));
4466 if (TREE_READONLY (field))
4468 if (GET_CODE (to_rtx) == MEM)
4469 to_rtx = copy_rtx (to_rtx);
4471 RTX_UNCHANGING_P (to_rtx) = 1;
4474 #ifdef WORD_REGISTER_OPERATIONS
4475 /* If this initializes a field that is smaller than a word, at the
4476 start of a word, try to widen it to a full word.
4477 This special case allows us to output C++ member function
4478 initializations in a form that the optimizers can understand. */
4479 if (GET_CODE (target) == REG
4480 && bitsize < BITS_PER_WORD
4481 && bitpos % BITS_PER_WORD == 0
4482 && GET_MODE_CLASS (mode) == MODE_INT
4483 && TREE_CODE (value) == INTEGER_CST
4485 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4487 tree type = TREE_TYPE (value);
4489 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4491 type = type_for_size (BITS_PER_WORD, TREE_UNSIGNED (type));
4492 value = convert (type, value);
4495 if (BYTES_BIG_ENDIAN)
4497 = fold (build (LSHIFT_EXPR, type, value,
4498 build_int_2 (BITS_PER_WORD - bitsize, 0)));
4499 bitsize = BITS_PER_WORD;
4504 if (GET_CODE (to_rtx) == MEM && !MEM_KEEP_ALIAS_SET_P (to_rtx)
4505 && DECL_NONADDRESSABLE_P (field))
4507 to_rtx = copy_rtx (to_rtx);
4508 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4511 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4512 value, type, cleared,
4513 get_alias_set (TREE_TYPE (field)));
4516 else if (TREE_CODE (type) == ARRAY_TYPE)
4521 tree domain = TYPE_DOMAIN (type);
4522 tree elttype = TREE_TYPE (type);
4523 int const_bounds_p = (TYPE_MIN_VALUE (domain)
4524 && TYPE_MAX_VALUE (domain)
4525 && host_integerp (TYPE_MIN_VALUE (domain), 0)
4526 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4527 HOST_WIDE_INT minelt = 0;
4528 HOST_WIDE_INT maxelt = 0;
4530 /* If we have constant bounds for the range of the type, get them. */
4533 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4534 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4537 /* If the constructor has fewer elements than the array,
4538 clear the whole array first. Similarly if this is
4539 static constructor of a non-BLKmode object. */
4540 if (cleared || (GET_CODE (target) == REG && TREE_STATIC (exp)))
4544 HOST_WIDE_INT count = 0, zero_count = 0;
4545 need_to_clear = ! const_bounds_p;
4547 /* This loop is a more accurate version of the loop in
4548 mostly_zeros_p (it handles RANGE_EXPR in an index).
4549 It is also needed to check for missing elements. */
4550 for (elt = CONSTRUCTOR_ELTS (exp);
4551 elt != NULL_TREE && ! need_to_clear;
4552 elt = TREE_CHAIN (elt))
4554 tree index = TREE_PURPOSE (elt);
4555 HOST_WIDE_INT this_node_count;
4557 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4559 tree lo_index = TREE_OPERAND (index, 0);
4560 tree hi_index = TREE_OPERAND (index, 1);
4562 if (! host_integerp (lo_index, 1)
4563 || ! host_integerp (hi_index, 1))
4569 this_node_count = (tree_low_cst (hi_index, 1)
4570 - tree_low_cst (lo_index, 1) + 1);
4573 this_node_count = 1;
4575 count += this_node_count;
4576 if (mostly_zeros_p (TREE_VALUE (elt)))
4577 zero_count += this_node_count;
4580 /* Clear the entire array first if there are any missing elements,
4581 or if the incidence of zero elements is >= 75%. */
4583 && (count < maxelt - minelt + 1 || 4 * zero_count >= 3 * count))
4587 if (need_to_clear && size > 0)
4590 clear_storage (target, GEN_INT (size));
4593 else if (REG_P (target))
4594 /* Inform later passes that the old value is dead. */
4595 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4597 /* Store each element of the constructor into
4598 the corresponding element of TARGET, determined
4599 by counting the elements. */
4600 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4602 elt = TREE_CHAIN (elt), i++)
4604 enum machine_mode mode;
4605 HOST_WIDE_INT bitsize;
4606 HOST_WIDE_INT bitpos;
4608 tree value = TREE_VALUE (elt);
4609 tree index = TREE_PURPOSE (elt);
4610 rtx xtarget = target;
4612 if (cleared && is_zeros_p (value))
4615 unsignedp = TREE_UNSIGNED (elttype);
4616 mode = TYPE_MODE (elttype);
4617 if (mode == BLKmode)
4618 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4619 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4622 bitsize = GET_MODE_BITSIZE (mode);
4624 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4626 tree lo_index = TREE_OPERAND (index, 0);
4627 tree hi_index = TREE_OPERAND (index, 1);
4628 rtx index_r, pos_rtx, hi_r, loop_top, loop_end;
4629 struct nesting *loop;
4630 HOST_WIDE_INT lo, hi, count;
4633 /* If the range is constant and "small", unroll the loop. */
4635 && host_integerp (lo_index, 0)
4636 && host_integerp (hi_index, 0)
4637 && (lo = tree_low_cst (lo_index, 0),
4638 hi = tree_low_cst (hi_index, 0),
4639 count = hi - lo + 1,
4640 (GET_CODE (target) != MEM
4642 || (host_integerp (TYPE_SIZE (elttype), 1)
4643 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4646 lo -= minelt; hi -= minelt;
4647 for (; lo <= hi; lo++)
4649 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4651 if (GET_CODE (target) == MEM
4652 && !MEM_KEEP_ALIAS_SET_P (target)
4653 && TYPE_NONALIASED_COMPONENT (type))
4655 target = copy_rtx (target);
4656 MEM_KEEP_ALIAS_SET_P (target) = 1;
4659 store_constructor_field
4660 (target, bitsize, bitpos, mode, value, type, cleared,
4661 get_alias_set (elttype));
4666 hi_r = expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4667 loop_top = gen_label_rtx ();
4668 loop_end = gen_label_rtx ();
4670 unsignedp = TREE_UNSIGNED (domain);
4672 index = build_decl (VAR_DECL, NULL_TREE, domain);
4675 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4677 SET_DECL_RTL (index, index_r);
4678 if (TREE_CODE (value) == SAVE_EXPR
4679 && SAVE_EXPR_RTL (value) == 0)
4681 /* Make sure value gets expanded once before the
4683 expand_expr (value, const0_rtx, VOIDmode, 0);
4686 store_expr (lo_index, index_r, 0);
4687 loop = expand_start_loop (0);
4689 /* Assign value to element index. */
4691 = convert (ssizetype,
4692 fold (build (MINUS_EXPR, TREE_TYPE (index),
4693 index, TYPE_MIN_VALUE (domain))));
4694 position = size_binop (MULT_EXPR, position,
4696 TYPE_SIZE_UNIT (elttype)));
4698 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4699 xtarget = offset_address (target, pos_rtx,
4700 highest_pow2_factor (position));
4701 xtarget = adjust_address (xtarget, mode, 0);
4702 if (TREE_CODE (value) == CONSTRUCTOR)
4703 store_constructor (value, xtarget, cleared,
4704 bitsize / BITS_PER_UNIT);
4706 store_expr (value, xtarget, 0);
4708 expand_exit_loop_if_false (loop,
4709 build (LT_EXPR, integer_type_node,
4712 expand_increment (build (PREINCREMENT_EXPR,
4714 index, integer_one_node), 0, 0);
4716 emit_label (loop_end);
4719 else if ((index != 0 && ! host_integerp (index, 0))
4720 || ! host_integerp (TYPE_SIZE (elttype), 1))
4725 index = ssize_int (1);
4728 index = convert (ssizetype,
4729 fold (build (MINUS_EXPR, index,
4730 TYPE_MIN_VALUE (domain))));
4732 position = size_binop (MULT_EXPR, index,
4734 TYPE_SIZE_UNIT (elttype)));
4735 xtarget = offset_address (target,
4736 expand_expr (position, 0, VOIDmode, 0),
4737 highest_pow2_factor (position));
4738 xtarget = adjust_address (xtarget, mode, 0);
4739 store_expr (value, xtarget, 0);
4744 bitpos = ((tree_low_cst (index, 0) - minelt)
4745 * tree_low_cst (TYPE_SIZE (elttype), 1));
4747 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
4749 if (GET_CODE (target) == MEM && !MEM_KEEP_ALIAS_SET_P (target)
4750 && TYPE_NONALIASED_COMPONENT (type))
4752 target = copy_rtx (target);
4753 MEM_KEEP_ALIAS_SET_P (target) = 1;
4756 store_constructor_field (target, bitsize, bitpos, mode, value,
4757 type, cleared, get_alias_set (elttype));
4763 /* Set constructor assignments. */
4764 else if (TREE_CODE (type) == SET_TYPE)
4766 tree elt = CONSTRUCTOR_ELTS (exp);
4767 unsigned HOST_WIDE_INT nbytes = int_size_in_bytes (type), nbits;
4768 tree domain = TYPE_DOMAIN (type);
4769 tree domain_min, domain_max, bitlength;
4771 /* The default implementation strategy is to extract the constant
4772 parts of the constructor, use that to initialize the target,
4773 and then "or" in whatever non-constant ranges we need in addition.
4775 If a large set is all zero or all ones, it is
4776 probably better to set it using memset (if available) or bzero.
4777 Also, if a large set has just a single range, it may also be
4778 better to first clear all the first clear the set (using
4779 bzero/memset), and set the bits we want. */
4781 /* Check for all zeros. */
4782 if (elt == NULL_TREE && size > 0)
4785 clear_storage (target, GEN_INT (size));
4789 domain_min = convert (sizetype, TYPE_MIN_VALUE (domain));
4790 domain_max = convert (sizetype, TYPE_MAX_VALUE (domain));
4791 bitlength = size_binop (PLUS_EXPR,
4792 size_diffop (domain_max, domain_min),
4795 nbits = tree_low_cst (bitlength, 1);
4797 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
4798 are "complicated" (more than one range), initialize (the
4799 constant parts) by copying from a constant. */
4800 if (GET_MODE (target) != BLKmode || nbits <= 2 * BITS_PER_WORD
4801 || (nbytes <= 32 && TREE_CHAIN (elt) != NULL_TREE))
4803 unsigned int set_word_size = TYPE_ALIGN (TREE_TYPE (exp));
4804 enum machine_mode mode = mode_for_size (set_word_size, MODE_INT, 1);
4805 char *bit_buffer = (char *) alloca (nbits);
4806 HOST_WIDE_INT word = 0;
4807 unsigned int bit_pos = 0;
4808 unsigned int ibit = 0;
4809 unsigned int offset = 0; /* In bytes from beginning of set. */
4811 elt = get_set_constructor_bits (exp, bit_buffer, nbits);
4814 if (bit_buffer[ibit])
4816 if (BYTES_BIG_ENDIAN)
4817 word |= (1 << (set_word_size - 1 - bit_pos));
4819 word |= 1 << bit_pos;
4823 if (bit_pos >= set_word_size || ibit == nbits)
4825 if (word != 0 || ! cleared)
4827 rtx datum = GEN_INT (word);
4830 /* The assumption here is that it is safe to use
4831 XEXP if the set is multi-word, but not if
4832 it's single-word. */
4833 if (GET_CODE (target) == MEM)
4834 to_rtx = adjust_address (target, mode, offset);
4835 else if (offset == 0)
4839 emit_move_insn (to_rtx, datum);
4846 offset += set_word_size / BITS_PER_UNIT;
4851 /* Don't bother clearing storage if the set is all ones. */
4852 if (TREE_CHAIN (elt) != NULL_TREE
4853 || (TREE_PURPOSE (elt) == NULL_TREE
4855 : ( ! host_integerp (TREE_VALUE (elt), 0)
4856 || ! host_integerp (TREE_PURPOSE (elt), 0)
4857 || (tree_low_cst (TREE_VALUE (elt), 0)
4858 - tree_low_cst (TREE_PURPOSE (elt), 0) + 1
4859 != (HOST_WIDE_INT) nbits))))
4860 clear_storage (target, expr_size (exp));
4862 for (; elt != NULL_TREE; elt = TREE_CHAIN (elt))
4864 /* Start of range of element or NULL. */
4865 tree startbit = TREE_PURPOSE (elt);
4866 /* End of range of element, or element value. */
4867 tree endbit = TREE_VALUE (elt);
4868 #ifdef TARGET_MEM_FUNCTIONS
4869 HOST_WIDE_INT startb, endb;
4871 rtx bitlength_rtx, startbit_rtx, endbit_rtx, targetx;
4873 bitlength_rtx = expand_expr (bitlength,
4874 NULL_RTX, MEM, EXPAND_CONST_ADDRESS);
4876 /* Handle non-range tuple element like [ expr ]. */
4877 if (startbit == NULL_TREE)
4879 startbit = save_expr (endbit);
4883 startbit = convert (sizetype, startbit);
4884 endbit = convert (sizetype, endbit);
4885 if (! integer_zerop (domain_min))
4887 startbit = size_binop (MINUS_EXPR, startbit, domain_min);
4888 endbit = size_binop (MINUS_EXPR, endbit, domain_min);
4890 startbit_rtx = expand_expr (startbit, NULL_RTX, MEM,
4891 EXPAND_CONST_ADDRESS);
4892 endbit_rtx = expand_expr (endbit, NULL_RTX, MEM,
4893 EXPAND_CONST_ADDRESS);
4899 ((build_qualified_type (type_for_mode (GET_MODE (target), 0),
4902 emit_move_insn (targetx, target);
4905 else if (GET_CODE (target) == MEM)
4910 #ifdef TARGET_MEM_FUNCTIONS
4911 /* Optimization: If startbit and endbit are
4912 constants divisible by BITS_PER_UNIT,
4913 call memset instead. */
4914 if (TREE_CODE (startbit) == INTEGER_CST
4915 && TREE_CODE (endbit) == INTEGER_CST
4916 && (startb = TREE_INT_CST_LOW (startbit)) % BITS_PER_UNIT == 0
4917 && (endb = TREE_INT_CST_LOW (endbit) + 1) % BITS_PER_UNIT == 0)
4919 emit_library_call (memset_libfunc, LCT_NORMAL,
4921 plus_constant (XEXP (targetx, 0),
4922 startb / BITS_PER_UNIT),
4924 constm1_rtx, TYPE_MODE (integer_type_node),
4925 GEN_INT ((endb - startb) / BITS_PER_UNIT),
4926 TYPE_MODE (sizetype));
4930 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__setbits"),
4931 LCT_NORMAL, VOIDmode, 4, XEXP (targetx, 0),
4932 Pmode, bitlength_rtx, TYPE_MODE (sizetype),
4933 startbit_rtx, TYPE_MODE (sizetype),
4934 endbit_rtx, TYPE_MODE (sizetype));
4937 emit_move_insn (target, targetx);
4945 /* Store the value of EXP (an expression tree)
4946 into a subfield of TARGET which has mode MODE and occupies
4947 BITSIZE bits, starting BITPOS bits from the start of TARGET.
4948 If MODE is VOIDmode, it means that we are storing into a bit-field.
4950 If VALUE_MODE is VOIDmode, return nothing in particular.
4951 UNSIGNEDP is not used in this case.
4953 Otherwise, return an rtx for the value stored. This rtx
4954 has mode VALUE_MODE if that is convenient to do.
4955 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
4957 TYPE is the type of the underlying object,
4959 ALIAS_SET is the alias set for the destination. This value will
4960 (in general) be different from that for TARGET, since TARGET is a
4961 reference to the containing structure. */
4964 store_field (target, bitsize, bitpos, mode, exp, value_mode, unsignedp, type,
4967 HOST_WIDE_INT bitsize;
4968 HOST_WIDE_INT bitpos;
4969 enum machine_mode mode;
4971 enum machine_mode value_mode;
4976 HOST_WIDE_INT width_mask = 0;
4978 if (TREE_CODE (exp) == ERROR_MARK)
4981 /* If we have nothing to store, do nothing unless the expression has
4984 return expand_expr (exp, const0_rtx, VOIDmode, 0);
4985 else if (bitsize >=0 && bitsize < HOST_BITS_PER_WIDE_INT)
4986 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
4988 /* If we are storing into an unaligned field of an aligned union that is
4989 in a register, we may have the mode of TARGET being an integer mode but
4990 MODE == BLKmode. In that case, get an aligned object whose size and
4991 alignment are the same as TARGET and store TARGET into it (we can avoid
4992 the store if the field being stored is the entire width of TARGET). Then
4993 call ourselves recursively to store the field into a BLKmode version of
4994 that object. Finally, load from the object into TARGET. This is not
4995 very efficient in general, but should only be slightly more expensive
4996 than the otherwise-required unaligned accesses. Perhaps this can be
4997 cleaned up later. */
5000 && (GET_CODE (target) == REG || GET_CODE (target) == SUBREG))
5004 (build_qualified_type (type, TYPE_QUALS (type) | TYPE_QUAL_CONST),
5006 rtx blk_object = copy_rtx (object);
5008 PUT_MODE (blk_object, BLKmode);
5010 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5011 emit_move_insn (object, target);
5013 store_field (blk_object, bitsize, bitpos, mode, exp, VOIDmode, 0, type,
5016 emit_move_insn (target, object);
5018 /* We want to return the BLKmode version of the data. */
5022 if (GET_CODE (target) == CONCAT)
5024 /* We're storing into a struct containing a single __complex. */
5028 return store_expr (exp, target, 0);
5031 /* If the structure is in a register or if the component
5032 is a bit field, we cannot use addressing to access it.
5033 Use bit-field techniques or SUBREG to store in it. */
5035 if (mode == VOIDmode
5036 || (mode != BLKmode && ! direct_store[(int) mode]
5037 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5038 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5039 || GET_CODE (target) == REG
5040 || GET_CODE (target) == SUBREG
5041 /* If the field isn't aligned enough to store as an ordinary memref,
5042 store it as a bit field. */
5043 || (mode != BLKmode && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target))
5044 && (MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode)
5045 || bitpos % GET_MODE_ALIGNMENT (mode)))
5046 /* If the RHS and field are a constant size and the size of the
5047 RHS isn't the same size as the bitfield, we must use bitfield
5050 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5051 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5053 rtx temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5055 /* If BITSIZE is narrower than the size of the type of EXP
5056 we will be narrowing TEMP. Normally, what's wanted are the
5057 low-order bits. However, if EXP's type is a record and this is
5058 big-endian machine, we want the upper BITSIZE bits. */
5059 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5060 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5061 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5062 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5063 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5067 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5069 if (mode != VOIDmode && mode != BLKmode
5070 && mode != TYPE_MODE (TREE_TYPE (exp)))
5071 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5073 /* If the modes of TARGET and TEMP are both BLKmode, both
5074 must be in memory and BITPOS must be aligned on a byte
5075 boundary. If so, we simply do a block copy. */
5076 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5078 if (GET_CODE (target) != MEM || GET_CODE (temp) != MEM
5079 || bitpos % BITS_PER_UNIT != 0)
5082 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5083 emit_block_move (target, temp,
5084 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5087 return value_mode == VOIDmode ? const0_rtx : target;
5090 /* Store the value in the bitfield. */
5091 store_bit_field (target, bitsize, bitpos, mode, temp,
5092 int_size_in_bytes (type));
5094 if (value_mode != VOIDmode)
5096 /* The caller wants an rtx for the value.
5097 If possible, avoid refetching from the bitfield itself. */
5099 && ! (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)))
5102 enum machine_mode tmode;
5105 return expand_and (temp,
5109 GET_MODE (temp) == VOIDmode
5111 : GET_MODE (temp))), NULL_RTX);
5113 tmode = GET_MODE (temp);
5114 if (tmode == VOIDmode)
5116 count = build_int_2 (GET_MODE_BITSIZE (tmode) - bitsize, 0);
5117 temp = expand_shift (LSHIFT_EXPR, tmode, temp, count, 0, 0);
5118 return expand_shift (RSHIFT_EXPR, tmode, temp, count, 0, 0);
5121 return extract_bit_field (target, bitsize, bitpos, unsignedp,
5122 NULL_RTX, value_mode, VOIDmode,
5123 int_size_in_bytes (type));
5129 rtx addr = XEXP (target, 0);
5130 rtx to_rtx = target;
5132 /* If a value is wanted, it must be the lhs;
5133 so make the address stable for multiple use. */
5135 if (value_mode != VOIDmode && GET_CODE (addr) != REG
5136 && ! CONSTANT_ADDRESS_P (addr)
5137 /* A frame-pointer reference is already stable. */
5138 && ! (GET_CODE (addr) == PLUS
5139 && GET_CODE (XEXP (addr, 1)) == CONST_INT
5140 && (XEXP (addr, 0) == virtual_incoming_args_rtx
5141 || XEXP (addr, 0) == virtual_stack_vars_rtx)))
5142 to_rtx = replace_equiv_address (to_rtx, copy_to_reg (addr));
5144 /* Now build a reference to just the desired component. */
5146 to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5148 if (to_rtx == target)
5149 to_rtx = copy_rtx (to_rtx);
5151 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5152 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5153 set_mem_alias_set (to_rtx, alias_set);
5155 return store_expr (exp, to_rtx, value_mode != VOIDmode);
5159 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5160 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5161 codes and find the ultimate containing object, which we return.
5163 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5164 bit position, and *PUNSIGNEDP to the signedness of the field.
5165 If the position of the field is variable, we store a tree
5166 giving the variable offset (in units) in *POFFSET.
5167 This offset is in addition to the bit position.
5168 If the position is not variable, we store 0 in *POFFSET.
5170 If any of the extraction expressions is volatile,
5171 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5173 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5174 is a mode that can be used to access the field. In that case, *PBITSIZE
5177 If the field describes a variable-sized object, *PMODE is set to
5178 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5179 this case, but the address of the object can be found. */
5182 get_inner_reference (exp, pbitsize, pbitpos, poffset, pmode,
5183 punsignedp, pvolatilep)
5185 HOST_WIDE_INT *pbitsize;
5186 HOST_WIDE_INT *pbitpos;
5188 enum machine_mode *pmode;
5193 enum machine_mode mode = VOIDmode;
5194 tree offset = size_zero_node;
5195 tree bit_offset = bitsize_zero_node;
5196 tree placeholder_ptr = 0;
5199 /* First get the mode, signedness, and size. We do this from just the
5200 outermost expression. */
5201 if (TREE_CODE (exp) == COMPONENT_REF)
5203 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5204 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5205 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5207 *punsignedp = TREE_UNSIGNED (TREE_OPERAND (exp, 1));
5209 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5211 size_tree = TREE_OPERAND (exp, 1);
5212 *punsignedp = TREE_UNSIGNED (exp);
5216 mode = TYPE_MODE (TREE_TYPE (exp));
5217 *punsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
5219 if (mode == BLKmode)
5220 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5222 *pbitsize = GET_MODE_BITSIZE (mode);
5227 if (! host_integerp (size_tree, 1))
5228 mode = BLKmode, *pbitsize = -1;
5230 *pbitsize = tree_low_cst (size_tree, 1);
5233 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5234 and find the ultimate containing object. */
5237 if (TREE_CODE (exp) == BIT_FIELD_REF)
5238 bit_offset = size_binop (PLUS_EXPR, bit_offset, TREE_OPERAND (exp, 2));
5239 else if (TREE_CODE (exp) == COMPONENT_REF)
5241 tree field = TREE_OPERAND (exp, 1);
5242 tree this_offset = DECL_FIELD_OFFSET (field);
5244 /* If this field hasn't been filled in yet, don't go
5245 past it. This should only happen when folding expressions
5246 made during type construction. */
5247 if (this_offset == 0)
5249 else if (! TREE_CONSTANT (this_offset)
5250 && contains_placeholder_p (this_offset))
5251 this_offset = build (WITH_RECORD_EXPR, sizetype, this_offset, exp);
5253 offset = size_binop (PLUS_EXPR, offset, this_offset);
5254 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5255 DECL_FIELD_BIT_OFFSET (field));
5257 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5260 else if (TREE_CODE (exp) == ARRAY_REF
5261 || TREE_CODE (exp) == ARRAY_RANGE_REF)
5263 tree index = TREE_OPERAND (exp, 1);
5264 tree array = TREE_OPERAND (exp, 0);
5265 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
5266 tree low_bound = (domain ? TYPE_MIN_VALUE (domain) : 0);
5267 tree unit_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (array)));
5269 /* We assume all arrays have sizes that are a multiple of a byte.
5270 First subtract the lower bound, if any, in the type of the
5271 index, then convert to sizetype and multiply by the size of the
5273 if (low_bound != 0 && ! integer_zerop (low_bound))
5274 index = fold (build (MINUS_EXPR, TREE_TYPE (index),
5277 /* If the index has a self-referential type, pass it to a
5278 WITH_RECORD_EXPR; if the component size is, pass our
5279 component to one. */
5280 if (! TREE_CONSTANT (index)
5281 && contains_placeholder_p (index))
5282 index = build (WITH_RECORD_EXPR, TREE_TYPE (index), index, exp);
5283 if (! TREE_CONSTANT (unit_size)
5284 && contains_placeholder_p (unit_size))
5285 unit_size = build (WITH_RECORD_EXPR, sizetype, unit_size, array);
5287 offset = size_binop (PLUS_EXPR, offset,
5288 size_binop (MULT_EXPR,
5289 convert (sizetype, index),
5293 else if (TREE_CODE (exp) == PLACEHOLDER_EXPR)
5295 tree new = find_placeholder (exp, &placeholder_ptr);
5297 /* If we couldn't find the replacement, return the PLACEHOLDER_EXPR.
5298 We might have been called from tree optimization where we
5299 haven't set up an object yet. */
5307 else if (TREE_CODE (exp) != NON_LVALUE_EXPR
5308 && TREE_CODE (exp) != VIEW_CONVERT_EXPR
5309 && ! ((TREE_CODE (exp) == NOP_EXPR
5310 || TREE_CODE (exp) == CONVERT_EXPR)
5311 && (TYPE_MODE (TREE_TYPE (exp))
5312 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
5315 /* If any reference in the chain is volatile, the effect is volatile. */
5316 if (TREE_THIS_VOLATILE (exp))
5319 exp = TREE_OPERAND (exp, 0);
5322 /* If OFFSET is constant, see if we can return the whole thing as a
5323 constant bit position. Otherwise, split it up. */
5324 if (host_integerp (offset, 0)
5325 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5327 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5328 && host_integerp (tem, 0))
5329 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5331 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5337 /* Return 1 if T is an expression that get_inner_reference handles. */
5340 handled_component_p (t)
5343 switch (TREE_CODE (t))
5348 case ARRAY_RANGE_REF:
5349 case NON_LVALUE_EXPR:
5350 case VIEW_CONVERT_EXPR:
5355 return (TYPE_MODE (TREE_TYPE (t))
5356 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (t, 0))));
5363 /* Given an rtx VALUE that may contain additions and multiplications, return
5364 an equivalent value that just refers to a register, memory, or constant.
5365 This is done by generating instructions to perform the arithmetic and
5366 returning a pseudo-register containing the value.
5368 The returned value may be a REG, SUBREG, MEM or constant. */
5371 force_operand (value, target)
5375 /* Use a temporary to force order of execution of calls to
5379 /* Use subtarget as the target for operand 0 of a binary operation. */
5380 rtx subtarget = get_subtarget (target);
5382 /* Check for a PIC address load. */
5384 && (GET_CODE (value) == PLUS || GET_CODE (value) == MINUS)
5385 && XEXP (value, 0) == pic_offset_table_rtx
5386 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5387 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5388 || GET_CODE (XEXP (value, 1)) == CONST))
5391 subtarget = gen_reg_rtx (GET_MODE (value));
5392 emit_move_insn (subtarget, value);
5396 if (GET_CODE (value) == PLUS)
5397 binoptab = add_optab;
5398 else if (GET_CODE (value) == MINUS)
5399 binoptab = sub_optab;
5400 else if (GET_CODE (value) == MULT)
5402 op2 = XEXP (value, 1);
5403 if (!CONSTANT_P (op2)
5404 && !(GET_CODE (op2) == REG && op2 != subtarget))
5406 tmp = force_operand (XEXP (value, 0), subtarget);
5407 return expand_mult (GET_MODE (value), tmp,
5408 force_operand (op2, NULL_RTX),
5414 op2 = XEXP (value, 1);
5415 if (!CONSTANT_P (op2)
5416 && !(GET_CODE (op2) == REG && op2 != subtarget))
5418 if (binoptab == sub_optab && GET_CODE (op2) == CONST_INT)
5420 binoptab = add_optab;
5421 op2 = negate_rtx (GET_MODE (value), op2);
5424 /* Check for an addition with OP2 a constant integer and our first
5425 operand a PLUS of a virtual register and something else. In that
5426 case, we want to emit the sum of the virtual register and the
5427 constant first and then add the other value. This allows virtual
5428 register instantiation to simply modify the constant rather than
5429 creating another one around this addition. */
5430 if (binoptab == add_optab && GET_CODE (op2) == CONST_INT
5431 && GET_CODE (XEXP (value, 0)) == PLUS
5432 && GET_CODE (XEXP (XEXP (value, 0), 0)) == REG
5433 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5434 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5436 rtx temp = expand_binop (GET_MODE (value), binoptab,
5437 XEXP (XEXP (value, 0), 0), op2,
5438 subtarget, 0, OPTAB_LIB_WIDEN);
5439 return expand_binop (GET_MODE (value), binoptab, temp,
5440 force_operand (XEXP (XEXP (value, 0), 1), 0),
5441 target, 0, OPTAB_LIB_WIDEN);
5444 tmp = force_operand (XEXP (value, 0), subtarget);
5445 return expand_binop (GET_MODE (value), binoptab, tmp,
5446 force_operand (op2, NULL_RTX),
5447 target, 0, OPTAB_LIB_WIDEN);
5448 /* We give UNSIGNEDP = 0 to expand_binop
5449 because the only operations we are expanding here are signed ones. */
5452 #ifdef INSN_SCHEDULING
5453 /* On machines that have insn scheduling, we want all memory reference to be
5454 explicit, so we need to deal with such paradoxical SUBREGs. */
5455 if (GET_CODE (value) == SUBREG && GET_CODE (SUBREG_REG (value)) == MEM
5456 && (GET_MODE_SIZE (GET_MODE (value))
5457 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
5459 = simplify_gen_subreg (GET_MODE (value),
5460 force_reg (GET_MODE (SUBREG_REG (value)),
5461 force_operand (SUBREG_REG (value),
5463 GET_MODE (SUBREG_REG (value)),
5464 SUBREG_BYTE (value));
5470 /* Subroutine of expand_expr: return nonzero iff there is no way that
5471 EXP can reference X, which is being modified. TOP_P is nonzero if this
5472 call is going to be used to determine whether we need a temporary
5473 for EXP, as opposed to a recursive call to this function.
5475 It is always safe for this routine to return zero since it merely
5476 searches for optimization opportunities. */
5479 safe_from_p (x, exp, top_p)
5486 static tree save_expr_list;
5489 /* If EXP has varying size, we MUST use a target since we currently
5490 have no way of allocating temporaries of variable size
5491 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5492 So we assume here that something at a higher level has prevented a
5493 clash. This is somewhat bogus, but the best we can do. Only
5494 do this when X is BLKmode and when we are at the top level. */
5495 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5496 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5497 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5498 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5499 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5501 && GET_MODE (x) == BLKmode)
5502 /* If X is in the outgoing argument area, it is always safe. */
5503 || (GET_CODE (x) == MEM
5504 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5505 || (GET_CODE (XEXP (x, 0)) == PLUS
5506 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5509 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5510 find the underlying pseudo. */
5511 if (GET_CODE (x) == SUBREG)
5514 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5518 /* A SAVE_EXPR might appear many times in the expression passed to the
5519 top-level safe_from_p call, and if it has a complex subexpression,
5520 examining it multiple times could result in a combinatorial explosion.
5521 E.g. on an Alpha running at least 200MHz, a Fortran test case compiled
5522 with optimization took about 28 minutes to compile -- even though it was
5523 only a few lines long. So we mark each SAVE_EXPR we see with TREE_PRIVATE
5524 and turn that off when we are done. We keep a list of the SAVE_EXPRs
5525 we have processed. Note that the only test of top_p was above. */
5534 rtn = safe_from_p (x, exp, 0);
5536 for (t = save_expr_list; t != 0; t = TREE_CHAIN (t))
5537 TREE_PRIVATE (TREE_PURPOSE (t)) = 0;
5542 /* Now look at our tree code and possibly recurse. */
5543 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5546 exp_rtl = DECL_RTL_SET_P (exp) ? DECL_RTL (exp) : NULL_RTX;
5553 if (TREE_CODE (exp) == TREE_LIST)
5554 return ((TREE_VALUE (exp) == 0
5555 || safe_from_p (x, TREE_VALUE (exp), 0))
5556 && (TREE_CHAIN (exp) == 0
5557 || safe_from_p (x, TREE_CHAIN (exp), 0)));
5558 else if (TREE_CODE (exp) == ERROR_MARK)
5559 return 1; /* An already-visited SAVE_EXPR? */
5564 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5568 return (safe_from_p (x, TREE_OPERAND (exp, 0), 0)
5569 && safe_from_p (x, TREE_OPERAND (exp, 1), 0));
5573 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5574 the expression. If it is set, we conflict iff we are that rtx or
5575 both are in memory. Otherwise, we check all operands of the
5576 expression recursively. */
5578 switch (TREE_CODE (exp))
5581 /* If the operand is static or we are static, we can't conflict.
5582 Likewise if we don't conflict with the operand at all. */
5583 if (staticp (TREE_OPERAND (exp, 0))
5584 || TREE_STATIC (exp)
5585 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5588 /* Otherwise, the only way this can conflict is if we are taking
5589 the address of a DECL a that address if part of X, which is
5591 exp = TREE_OPERAND (exp, 0);
5594 if (!DECL_RTL_SET_P (exp)
5595 || GET_CODE (DECL_RTL (exp)) != MEM)
5598 exp_rtl = XEXP (DECL_RTL (exp), 0);
5603 if (GET_CODE (x) == MEM
5604 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5605 get_alias_set (exp)))
5610 /* Assume that the call will clobber all hard registers and
5612 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5613 || GET_CODE (x) == MEM)
5618 /* If a sequence exists, we would have to scan every instruction
5619 in the sequence to see if it was safe. This is probably not
5621 if (RTL_EXPR_SEQUENCE (exp))
5624 exp_rtl = RTL_EXPR_RTL (exp);
5627 case WITH_CLEANUP_EXPR:
5628 exp_rtl = WITH_CLEANUP_EXPR_RTL (exp);
5631 case CLEANUP_POINT_EXPR:
5632 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5635 exp_rtl = SAVE_EXPR_RTL (exp);
5639 /* If we've already scanned this, don't do it again. Otherwise,
5640 show we've scanned it and record for clearing the flag if we're
5642 if (TREE_PRIVATE (exp))
5645 TREE_PRIVATE (exp) = 1;
5646 if (! safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5648 TREE_PRIVATE (exp) = 0;
5652 save_expr_list = tree_cons (exp, NULL_TREE, save_expr_list);
5656 /* The only operand we look at is operand 1. The rest aren't
5657 part of the expression. */
5658 return safe_from_p (x, TREE_OPERAND (exp, 1), 0);
5660 case METHOD_CALL_EXPR:
5661 /* This takes an rtx argument, but shouldn't appear here. */
5668 /* If we have an rtx, we do not need to scan our operands. */
5672 nops = first_rtl_op (TREE_CODE (exp));
5673 for (i = 0; i < nops; i++)
5674 if (TREE_OPERAND (exp, i) != 0
5675 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5678 /* If this is a language-specific tree code, it may require
5679 special handling. */
5680 if ((unsigned int) TREE_CODE (exp)
5681 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5682 && !(*lang_hooks.safe_from_p) (x, exp))
5686 /* If we have an rtl, find any enclosed object. Then see if we conflict
5690 if (GET_CODE (exp_rtl) == SUBREG)
5692 exp_rtl = SUBREG_REG (exp_rtl);
5693 if (GET_CODE (exp_rtl) == REG
5694 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5698 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5699 are memory and they conflict. */
5700 return ! (rtx_equal_p (x, exp_rtl)
5701 || (GET_CODE (x) == MEM && GET_CODE (exp_rtl) == MEM
5702 && true_dependence (exp_rtl, GET_MODE (x), x,
5703 rtx_addr_varies_p)));
5706 /* If we reach here, it is safe. */
5710 /* Subroutine of expand_expr: return rtx if EXP is a
5711 variable or parameter; else return 0. */
5718 switch (TREE_CODE (exp))
5722 return DECL_RTL (exp);
5728 #ifdef MAX_INTEGER_COMPUTATION_MODE
5731 check_max_integer_computation_mode (exp)
5734 enum tree_code code;
5735 enum machine_mode mode;
5737 /* Strip any NOPs that don't change the mode. */
5739 code = TREE_CODE (exp);
5741 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
5742 if (code == NOP_EXPR
5743 && TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
5746 /* First check the type of the overall operation. We need only look at
5747 unary, binary and relational operations. */
5748 if (TREE_CODE_CLASS (code) == '1'
5749 || TREE_CODE_CLASS (code) == '2'
5750 || TREE_CODE_CLASS (code) == '<')
5752 mode = TYPE_MODE (TREE_TYPE (exp));
5753 if (GET_MODE_CLASS (mode) == MODE_INT
5754 && mode > MAX_INTEGER_COMPUTATION_MODE)
5755 internal_error ("unsupported wide integer operation");
5758 /* Check operand of a unary op. */
5759 if (TREE_CODE_CLASS (code) == '1')
5761 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5762 if (GET_MODE_CLASS (mode) == MODE_INT
5763 && mode > MAX_INTEGER_COMPUTATION_MODE)
5764 internal_error ("unsupported wide integer operation");
5767 /* Check operands of a binary/comparison op. */
5768 if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<')
5770 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5771 if (GET_MODE_CLASS (mode) == MODE_INT
5772 && mode > MAX_INTEGER_COMPUTATION_MODE)
5773 internal_error ("unsupported wide integer operation");
5775 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1)));
5776 if (GET_MODE_CLASS (mode) == MODE_INT
5777 && mode > MAX_INTEGER_COMPUTATION_MODE)
5778 internal_error ("unsupported wide integer operation");
5783 /* Return the highest power of two that EXP is known to be a multiple of.
5784 This is used in updating alignment of MEMs in array references. */
5786 static HOST_WIDE_INT
5787 highest_pow2_factor (exp)
5790 HOST_WIDE_INT c0, c1;
5792 switch (TREE_CODE (exp))
5795 /* If the integer is expressable in a HOST_WIDE_INT, we can find the
5796 lowest bit that's a one. If the result is zero, pessimize by
5797 returning 1. This is overly-conservative, but such things should not
5798 happen in the offset expressions that we are called with. If
5799 the constant overlows, we some erroneous program, so return
5800 BIGGEST_ALIGNMENT to avoid any later ICE. */
5801 if (TREE_CONSTANT_OVERFLOW (exp))
5802 return BIGGEST_ALIGNMENT;
5803 else if (host_integerp (exp, 0))
5805 c0 = tree_low_cst (exp, 0);
5806 c0 = c0 < 0 ? - c0 : c0;
5807 return c0 != 0 ? c0 & -c0 : 1;
5811 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
5812 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5813 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
5814 return MIN (c0, c1);
5817 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5818 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
5821 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
5823 if (integer_pow2p (TREE_OPERAND (exp, 1))
5824 && host_integerp (TREE_OPERAND (exp, 1), 1))
5826 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5827 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
5828 return MAX (1, c0 / c1);
5832 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
5833 case SAVE_EXPR: case WITH_RECORD_EXPR:
5834 return highest_pow2_factor (TREE_OPERAND (exp, 0));
5837 return highest_pow2_factor (TREE_OPERAND (exp, 1));
5840 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
5841 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
5842 return MIN (c0, c1);
5851 /* Return an object on the placeholder list that matches EXP, a
5852 PLACEHOLDER_EXPR. An object "matches" if it is of the type of the
5853 PLACEHOLDER_EXPR or a pointer type to it. For further information, see
5854 tree.def. If no such object is found, return 0. If PLIST is nonzero, it
5855 is a location which initially points to a starting location in the
5856 placeholder list (zero means start of the list) and where a pointer into
5857 the placeholder list at which the object is found is placed. */
5860 find_placeholder (exp, plist)
5864 tree type = TREE_TYPE (exp);
5865 tree placeholder_expr;
5867 for (placeholder_expr
5868 = plist && *plist ? TREE_CHAIN (*plist) : placeholder_list;
5869 placeholder_expr != 0;
5870 placeholder_expr = TREE_CHAIN (placeholder_expr))
5872 tree need_type = TYPE_MAIN_VARIANT (type);
5875 /* Find the outermost reference that is of the type we want. If none,
5876 see if any object has a type that is a pointer to the type we
5878 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
5879 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
5880 || TREE_CODE (elt) == COND_EXPR)
5881 ? TREE_OPERAND (elt, 1)
5882 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
5883 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
5884 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
5885 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
5886 ? TREE_OPERAND (elt, 0) : 0))
5887 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
5890 *plist = placeholder_expr;
5894 for (elt = TREE_PURPOSE (placeholder_expr); elt != 0;
5896 = ((TREE_CODE (elt) == COMPOUND_EXPR
5897 || TREE_CODE (elt) == COND_EXPR)
5898 ? TREE_OPERAND (elt, 1)
5899 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
5900 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
5901 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
5902 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
5903 ? TREE_OPERAND (elt, 0) : 0))
5904 if (POINTER_TYPE_P (TREE_TYPE (elt))
5905 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
5909 *plist = placeholder_expr;
5910 return build1 (INDIRECT_REF, need_type, elt);
5917 /* expand_expr: generate code for computing expression EXP.
5918 An rtx for the computed value is returned. The value is never null.
5919 In the case of a void EXP, const0_rtx is returned.
5921 The value may be stored in TARGET if TARGET is nonzero.
5922 TARGET is just a suggestion; callers must assume that
5923 the rtx returned may not be the same as TARGET.
5925 If TARGET is CONST0_RTX, it means that the value will be ignored.
5927 If TMODE is not VOIDmode, it suggests generating the
5928 result in mode TMODE. But this is done only when convenient.
5929 Otherwise, TMODE is ignored and the value generated in its natural mode.
5930 TMODE is just a suggestion; callers must assume that
5931 the rtx returned may not have mode TMODE.
5933 Note that TARGET may have neither TMODE nor MODE. In that case, it
5934 probably will not be used.
5936 If MODIFIER is EXPAND_SUM then when EXP is an addition
5937 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
5938 or a nest of (PLUS ...) and (MINUS ...) where the terms are
5939 products as above, or REG or MEM, or constant.
5940 Ordinarily in such cases we would output mul or add instructions
5941 and then return a pseudo reg containing the sum.
5943 EXPAND_INITIALIZER is much like EXPAND_SUM except that
5944 it also marks a label as absolutely required (it can't be dead).
5945 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
5946 This is used for outputting expressions used in initializers.
5948 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
5949 with a constant address even if that address is not normally legitimate.
5950 EXPAND_INITIALIZER and EXPAND_SUM also have this effect. */
5953 expand_expr (exp, target, tmode, modifier)
5956 enum machine_mode tmode;
5957 enum expand_modifier modifier;
5960 tree type = TREE_TYPE (exp);
5961 int unsignedp = TREE_UNSIGNED (type);
5962 enum machine_mode mode;
5963 enum tree_code code = TREE_CODE (exp);
5965 rtx subtarget, original_target;
5969 /* Handle ERROR_MARK before anybody tries to access its type. */
5970 if (TREE_CODE (exp) == ERROR_MARK || TREE_CODE (type) == ERROR_MARK)
5972 op0 = CONST0_RTX (tmode);
5978 mode = TYPE_MODE (type);
5979 /* Use subtarget as the target for operand 0 of a binary operation. */
5980 subtarget = get_subtarget (target);
5981 original_target = target;
5982 ignore = (target == const0_rtx
5983 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
5984 || code == CONVERT_EXPR || code == REFERENCE_EXPR
5985 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
5986 && TREE_CODE (type) == VOID_TYPE));
5988 /* If we are going to ignore this result, we need only do something
5989 if there is a side-effect somewhere in the expression. If there
5990 is, short-circuit the most common cases here. Note that we must
5991 not call expand_expr with anything but const0_rtx in case this
5992 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
5996 if (! TREE_SIDE_EFFECTS (exp))
5999 /* Ensure we reference a volatile object even if value is ignored, but
6000 don't do this if all we are doing is taking its address. */
6001 if (TREE_THIS_VOLATILE (exp)
6002 && TREE_CODE (exp) != FUNCTION_DECL
6003 && mode != VOIDmode && mode != BLKmode
6004 && modifier != EXPAND_CONST_ADDRESS)
6006 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6007 if (GET_CODE (temp) == MEM)
6008 temp = copy_to_reg (temp);
6012 if (TREE_CODE_CLASS (code) == '1' || code == COMPONENT_REF
6013 || code == INDIRECT_REF || code == BUFFER_REF)
6014 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6017 else if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<'
6018 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6020 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6021 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6024 else if ((code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
6025 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
6026 /* If the second operand has no side effects, just evaluate
6028 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6030 else if (code == BIT_FIELD_REF)
6032 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6033 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6034 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6041 #ifdef MAX_INTEGER_COMPUTATION_MODE
6042 /* Only check stuff here if the mode we want is different from the mode
6043 of the expression; if it's the same, check_max_integer_computiation_mode
6044 will handle it. Do we really need to check this stuff at all? */
6047 && GET_MODE (target) != mode
6048 && TREE_CODE (exp) != INTEGER_CST
6049 && TREE_CODE (exp) != PARM_DECL
6050 && TREE_CODE (exp) != ARRAY_REF
6051 && TREE_CODE (exp) != ARRAY_RANGE_REF
6052 && TREE_CODE (exp) != COMPONENT_REF
6053 && TREE_CODE (exp) != BIT_FIELD_REF
6054 && TREE_CODE (exp) != INDIRECT_REF
6055 && TREE_CODE (exp) != CALL_EXPR
6056 && TREE_CODE (exp) != VAR_DECL
6057 && TREE_CODE (exp) != RTL_EXPR)
6059 enum machine_mode mode = GET_MODE (target);
6061 if (GET_MODE_CLASS (mode) == MODE_INT
6062 && mode > MAX_INTEGER_COMPUTATION_MODE)
6063 internal_error ("unsupported wide integer operation");
6067 && TREE_CODE (exp) != INTEGER_CST
6068 && TREE_CODE (exp) != PARM_DECL
6069 && TREE_CODE (exp) != ARRAY_REF
6070 && TREE_CODE (exp) != ARRAY_RANGE_REF
6071 && TREE_CODE (exp) != COMPONENT_REF
6072 && TREE_CODE (exp) != BIT_FIELD_REF
6073 && TREE_CODE (exp) != INDIRECT_REF
6074 && TREE_CODE (exp) != VAR_DECL
6075 && TREE_CODE (exp) != CALL_EXPR
6076 && TREE_CODE (exp) != RTL_EXPR
6077 && GET_MODE_CLASS (tmode) == MODE_INT
6078 && tmode > MAX_INTEGER_COMPUTATION_MODE)
6079 internal_error ("unsupported wide integer operation");
6081 check_max_integer_computation_mode (exp);
6084 /* If will do cse, generate all results into pseudo registers
6085 since 1) that allows cse to find more things
6086 and 2) otherwise cse could produce an insn the machine
6087 cannot support. And exception is a CONSTRUCTOR into a multi-word
6088 MEM: that's much more likely to be most efficient into the MEM. */
6090 if (! cse_not_expected && mode != BLKmode && target
6091 && (GET_CODE (target) != REG || REGNO (target) < FIRST_PSEUDO_REGISTER)
6092 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD))
6099 tree function = decl_function_context (exp);
6100 /* Handle using a label in a containing function. */
6101 if (function != current_function_decl
6102 && function != inline_function_decl && function != 0)
6104 struct function *p = find_function_data (function);
6105 p->expr->x_forced_labels
6106 = gen_rtx_EXPR_LIST (VOIDmode, label_rtx (exp),
6107 p->expr->x_forced_labels);
6111 if (modifier == EXPAND_INITIALIZER)
6112 forced_labels = gen_rtx_EXPR_LIST (VOIDmode,
6117 temp = gen_rtx_MEM (FUNCTION_MODE,
6118 gen_rtx_LABEL_REF (Pmode, label_rtx (exp)));
6119 if (function != current_function_decl
6120 && function != inline_function_decl && function != 0)
6121 LABEL_REF_NONLOCAL_P (XEXP (temp, 0)) = 1;
6126 if (DECL_RTL (exp) == 0)
6128 error_with_decl (exp, "prior parameter's size depends on `%s'");
6129 return CONST0_RTX (mode);
6132 /* ... fall through ... */
6135 /* If a static var's type was incomplete when the decl was written,
6136 but the type is complete now, lay out the decl now. */
6137 if (DECL_SIZE (exp) == 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6138 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6140 rtx value = DECL_RTL_IF_SET (exp);
6142 layout_decl (exp, 0);
6144 /* If the RTL was already set, update its mode and memory
6148 PUT_MODE (value, DECL_MODE (exp));
6149 SET_DECL_RTL (exp, 0);
6150 set_mem_attributes (value, exp, 1);
6151 SET_DECL_RTL (exp, value);
6155 /* ... fall through ... */
6159 if (DECL_RTL (exp) == 0)
6162 /* Ensure variable marked as used even if it doesn't go through
6163 a parser. If it hasn't be used yet, write out an external
6165 if (! TREE_USED (exp))
6167 assemble_external (exp);
6168 TREE_USED (exp) = 1;
6171 /* Show we haven't gotten RTL for this yet. */
6174 /* Handle variables inherited from containing functions. */
6175 context = decl_function_context (exp);
6177 /* We treat inline_function_decl as an alias for the current function
6178 because that is the inline function whose vars, types, etc.
6179 are being merged into the current function.
6180 See expand_inline_function. */
6182 if (context != 0 && context != current_function_decl
6183 && context != inline_function_decl
6184 /* If var is static, we don't need a static chain to access it. */
6185 && ! (GET_CODE (DECL_RTL (exp)) == MEM
6186 && CONSTANT_P (XEXP (DECL_RTL (exp), 0))))
6190 /* Mark as non-local and addressable. */
6191 DECL_NONLOCAL (exp) = 1;
6192 if (DECL_NO_STATIC_CHAIN (current_function_decl))
6194 mark_addressable (exp);
6195 if (GET_CODE (DECL_RTL (exp)) != MEM)
6197 addr = XEXP (DECL_RTL (exp), 0);
6198 if (GET_CODE (addr) == MEM)
6200 = replace_equiv_address (addr,
6201 fix_lexical_addr (XEXP (addr, 0), exp));
6203 addr = fix_lexical_addr (addr, exp);
6205 temp = replace_equiv_address (DECL_RTL (exp), addr);
6208 /* This is the case of an array whose size is to be determined
6209 from its initializer, while the initializer is still being parsed.
6212 else if (GET_CODE (DECL_RTL (exp)) == MEM
6213 && GET_CODE (XEXP (DECL_RTL (exp), 0)) == REG)
6214 temp = validize_mem (DECL_RTL (exp));
6216 /* If DECL_RTL is memory, we are in the normal case and either
6217 the address is not valid or it is not a register and -fforce-addr
6218 is specified, get the address into a register. */
6220 else if (GET_CODE (DECL_RTL (exp)) == MEM
6221 && modifier != EXPAND_CONST_ADDRESS
6222 && modifier != EXPAND_SUM
6223 && modifier != EXPAND_INITIALIZER
6224 && (! memory_address_p (DECL_MODE (exp),
6225 XEXP (DECL_RTL (exp), 0))
6227 && GET_CODE (XEXP (DECL_RTL (exp), 0)) != REG)))
6228 temp = replace_equiv_address (DECL_RTL (exp),
6229 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6231 /* If we got something, return it. But first, set the alignment
6232 if the address is a register. */
6235 if (GET_CODE (temp) == MEM && GET_CODE (XEXP (temp, 0)) == REG)
6236 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6241 /* If the mode of DECL_RTL does not match that of the decl, it
6242 must be a promoted value. We return a SUBREG of the wanted mode,
6243 but mark it so that we know that it was already extended. */
6245 if (GET_CODE (DECL_RTL (exp)) == REG
6246 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6248 /* Get the signedness used for this variable. Ensure we get the
6249 same mode we got when the variable was declared. */
6250 if (GET_MODE (DECL_RTL (exp))
6251 != promote_mode (type, DECL_MODE (exp), &unsignedp, 0))
6254 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6255 SUBREG_PROMOTED_VAR_P (temp) = 1;
6256 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6260 return DECL_RTL (exp);
6263 return immed_double_const (TREE_INT_CST_LOW (exp),
6264 TREE_INT_CST_HIGH (exp), mode);
6267 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, 0);
6270 /* If optimized, generate immediate CONST_DOUBLE
6271 which will be turned into memory by reload if necessary.
6273 We used to force a register so that loop.c could see it. But
6274 this does not allow gen_* patterns to perform optimizations with
6275 the constants. It also produces two insns in cases like "x = 1.0;".
6276 On most machines, floating-point constants are not permitted in
6277 many insns, so we'd end up copying it to a register in any case.
6279 Now, we do the copying in expand_binop, if appropriate. */
6280 return immed_real_const (exp);
6284 if (! TREE_CST_RTL (exp))
6285 output_constant_def (exp, 1);
6287 /* TREE_CST_RTL probably contains a constant address.
6288 On RISC machines where a constant address isn't valid,
6289 make some insns to get that address into a register. */
6290 if (GET_CODE (TREE_CST_RTL (exp)) == MEM
6291 && modifier != EXPAND_CONST_ADDRESS
6292 && modifier != EXPAND_INITIALIZER
6293 && modifier != EXPAND_SUM
6294 && (! memory_address_p (mode, XEXP (TREE_CST_RTL (exp), 0))
6296 && GET_CODE (XEXP (TREE_CST_RTL (exp), 0)) != REG)))
6297 return replace_equiv_address (TREE_CST_RTL (exp),
6298 copy_rtx (XEXP (TREE_CST_RTL (exp), 0)));
6299 return TREE_CST_RTL (exp);
6301 case EXPR_WITH_FILE_LOCATION:
6304 const char *saved_input_filename = input_filename;
6305 int saved_lineno = lineno;
6306 input_filename = EXPR_WFL_FILENAME (exp);
6307 lineno = EXPR_WFL_LINENO (exp);
6308 if (EXPR_WFL_EMIT_LINE_NOTE (exp))
6309 emit_line_note (input_filename, lineno);
6310 /* Possibly avoid switching back and forth here. */
6311 to_return = expand_expr (EXPR_WFL_NODE (exp), target, tmode, modifier);
6312 input_filename = saved_input_filename;
6313 lineno = saved_lineno;
6318 context = decl_function_context (exp);
6320 /* If this SAVE_EXPR was at global context, assume we are an
6321 initialization function and move it into our context. */
6323 SAVE_EXPR_CONTEXT (exp) = current_function_decl;
6325 /* We treat inline_function_decl as an alias for the current function
6326 because that is the inline function whose vars, types, etc.
6327 are being merged into the current function.
6328 See expand_inline_function. */
6329 if (context == current_function_decl || context == inline_function_decl)
6332 /* If this is non-local, handle it. */
6335 /* The following call just exists to abort if the context is
6336 not of a containing function. */
6337 find_function_data (context);
6339 temp = SAVE_EXPR_RTL (exp);
6340 if (temp && GET_CODE (temp) == REG)
6342 put_var_into_stack (exp);
6343 temp = SAVE_EXPR_RTL (exp);
6345 if (temp == 0 || GET_CODE (temp) != MEM)
6348 replace_equiv_address (temp,
6349 fix_lexical_addr (XEXP (temp, 0), exp));
6351 if (SAVE_EXPR_RTL (exp) == 0)
6353 if (mode == VOIDmode)
6356 temp = assign_temp (build_qualified_type (type,
6358 | TYPE_QUAL_CONST)),
6361 SAVE_EXPR_RTL (exp) = temp;
6362 if (!optimize && GET_CODE (temp) == REG)
6363 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, temp,
6366 /* If the mode of TEMP does not match that of the expression, it
6367 must be a promoted value. We pass store_expr a SUBREG of the
6368 wanted mode but mark it so that we know that it was already
6369 extended. Note that `unsignedp' was modified above in
6372 if (GET_CODE (temp) == REG && GET_MODE (temp) != mode)
6374 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
6375 SUBREG_PROMOTED_VAR_P (temp) = 1;
6376 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6379 if (temp == const0_rtx)
6380 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
6382 store_expr (TREE_OPERAND (exp, 0), temp, 0);
6384 TREE_USED (exp) = 1;
6387 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
6388 must be a promoted value. We return a SUBREG of the wanted mode,
6389 but mark it so that we know that it was already extended. */
6391 if (GET_CODE (SAVE_EXPR_RTL (exp)) == REG
6392 && GET_MODE (SAVE_EXPR_RTL (exp)) != mode)
6394 /* Compute the signedness and make the proper SUBREG. */
6395 promote_mode (type, mode, &unsignedp, 0);
6396 temp = gen_lowpart_SUBREG (mode, SAVE_EXPR_RTL (exp));
6397 SUBREG_PROMOTED_VAR_P (temp) = 1;
6398 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6402 return SAVE_EXPR_RTL (exp);
6407 temp = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6408 TREE_OPERAND (exp, 0) = unsave_expr_now (TREE_OPERAND (exp, 0));
6412 case PLACEHOLDER_EXPR:
6414 tree old_list = placeholder_list;
6415 tree placeholder_expr = 0;
6417 exp = find_placeholder (exp, &placeholder_expr);
6421 placeholder_list = TREE_CHAIN (placeholder_expr);
6422 temp = expand_expr (exp, original_target, tmode, modifier);
6423 placeholder_list = old_list;
6427 /* We can't find the object or there was a missing WITH_RECORD_EXPR. */
6430 case WITH_RECORD_EXPR:
6431 /* Put the object on the placeholder list, expand our first operand,
6432 and pop the list. */
6433 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
6435 target = expand_expr (TREE_OPERAND (exp, 0), original_target, tmode,
6437 placeholder_list = TREE_CHAIN (placeholder_list);
6441 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6442 expand_goto (TREE_OPERAND (exp, 0));
6444 expand_computed_goto (TREE_OPERAND (exp, 0));
6448 expand_exit_loop_if_false (NULL,
6449 invert_truthvalue (TREE_OPERAND (exp, 0)));
6452 case LABELED_BLOCK_EXPR:
6453 if (LABELED_BLOCK_BODY (exp))
6454 expand_expr_stmt (LABELED_BLOCK_BODY (exp));
6455 /* Should perhaps use expand_label, but this is simpler and safer. */
6456 do_pending_stack_adjust ();
6457 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp)));
6460 case EXIT_BLOCK_EXPR:
6461 if (EXIT_BLOCK_RETURN (exp))
6462 sorry ("returned value in block_exit_expr");
6463 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp)));
6468 expand_start_loop (1);
6469 expand_expr_stmt (TREE_OPERAND (exp, 0));
6477 tree vars = TREE_OPERAND (exp, 0);
6478 int vars_need_expansion = 0;
6480 /* Need to open a binding contour here because
6481 if there are any cleanups they must be contained here. */
6482 expand_start_bindings (2);
6484 /* Mark the corresponding BLOCK for output in its proper place. */
6485 if (TREE_OPERAND (exp, 2) != 0
6486 && ! TREE_USED (TREE_OPERAND (exp, 2)))
6487 insert_block (TREE_OPERAND (exp, 2));
6489 /* If VARS have not yet been expanded, expand them now. */
6492 if (!DECL_RTL_SET_P (vars))
6494 vars_need_expansion = 1;
6497 expand_decl_init (vars);
6498 vars = TREE_CHAIN (vars);
6501 temp = expand_expr (TREE_OPERAND (exp, 1), target, tmode, modifier);
6503 expand_end_bindings (TREE_OPERAND (exp, 0), 0, 0);
6509 if (RTL_EXPR_SEQUENCE (exp))
6511 if (RTL_EXPR_SEQUENCE (exp) == const0_rtx)
6513 emit_insns (RTL_EXPR_SEQUENCE (exp));
6514 RTL_EXPR_SEQUENCE (exp) = const0_rtx;
6516 preserve_rtl_expr_result (RTL_EXPR_RTL (exp));
6517 free_temps_for_rtl_expr (exp);
6518 return RTL_EXPR_RTL (exp);
6521 /* If we don't need the result, just ensure we evaluate any
6527 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6528 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
6533 /* All elts simple constants => refer to a constant in memory. But
6534 if this is a non-BLKmode mode, let it store a field at a time
6535 since that should make a CONST_INT or CONST_DOUBLE when we
6536 fold. Likewise, if we have a target we can use, it is best to
6537 store directly into the target unless the type is large enough
6538 that memcpy will be used. If we are making an initializer and
6539 all operands are constant, put it in memory as well. */
6540 else if ((TREE_STATIC (exp)
6541 && ((mode == BLKmode
6542 && ! (target != 0 && safe_from_p (target, exp, 1)))
6543 || TREE_ADDRESSABLE (exp)
6544 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6545 && (! MOVE_BY_PIECES_P
6546 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6548 && ! mostly_zeros_p (exp))))
6549 || (modifier == EXPAND_INITIALIZER && TREE_CONSTANT (exp)))
6551 rtx constructor = output_constant_def (exp, 1);
6553 if (modifier != EXPAND_CONST_ADDRESS
6554 && modifier != EXPAND_INITIALIZER
6555 && modifier != EXPAND_SUM)
6556 constructor = validize_mem (constructor);
6562 /* Handle calls that pass values in multiple non-contiguous
6563 locations. The Irix 6 ABI has examples of this. */
6564 if (target == 0 || ! safe_from_p (target, exp, 1)
6565 || GET_CODE (target) == PARALLEL)
6567 = assign_temp (build_qualified_type (type,
6569 | (TREE_READONLY (exp)
6570 * TYPE_QUAL_CONST))),
6571 0, TREE_ADDRESSABLE (exp), 1);
6573 store_constructor (exp, target, 0,
6574 int_size_in_bytes (TREE_TYPE (exp)));
6580 tree exp1 = TREE_OPERAND (exp, 0);
6582 tree string = string_constant (exp1, &index);
6584 /* Try to optimize reads from const strings. */
6586 && TREE_CODE (string) == STRING_CST
6587 && TREE_CODE (index) == INTEGER_CST
6588 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0
6589 && GET_MODE_CLASS (mode) == MODE_INT
6590 && GET_MODE_SIZE (mode) == 1
6591 && modifier != EXPAND_WRITE)
6593 GEN_INT (TREE_STRING_POINTER (string)[TREE_INT_CST_LOW (index)]);
6595 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6596 op0 = memory_address (mode, op0);
6597 temp = gen_rtx_MEM (mode, op0);
6598 set_mem_attributes (temp, exp, 0);
6600 /* If we are writing to this object and its type is a record with
6601 readonly fields, we must mark it as readonly so it will
6602 conflict with readonly references to those fields. */
6603 if (modifier == EXPAND_WRITE && readonly_fields_p (type))
6604 RTX_UNCHANGING_P (temp) = 1;
6610 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
6614 tree array = TREE_OPERAND (exp, 0);
6615 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
6616 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
6617 tree index = convert (sizetype, TREE_OPERAND (exp, 1));
6620 /* Optimize the special-case of a zero lower bound.
6622 We convert the low_bound to sizetype to avoid some problems
6623 with constant folding. (E.g. suppose the lower bound is 1,
6624 and its mode is QI. Without the conversion, (ARRAY
6625 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
6626 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
6628 if (! integer_zerop (low_bound))
6629 index = size_diffop (index, convert (sizetype, low_bound));
6631 /* Fold an expression like: "foo"[2].
6632 This is not done in fold so it won't happen inside &.
6633 Don't fold if this is for wide characters since it's too
6634 difficult to do correctly and this is a very rare case. */
6636 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
6637 && TREE_CODE (array) == STRING_CST
6638 && TREE_CODE (index) == INTEGER_CST
6639 && compare_tree_int (index, TREE_STRING_LENGTH (array)) < 0
6640 && GET_MODE_CLASS (mode) == MODE_INT
6641 && GET_MODE_SIZE (mode) == 1)
6643 GEN_INT (TREE_STRING_POINTER (array)[TREE_INT_CST_LOW (index)]);
6645 /* If this is a constant index into a constant array,
6646 just get the value from the array. Handle both the cases when
6647 we have an explicit constructor and when our operand is a variable
6648 that was declared const. */
6650 if (modifier != EXPAND_CONST_ADDRESS && modifier != EXPAND_INITIALIZER
6651 && TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array)
6652 && TREE_CODE (index) == INTEGER_CST
6653 && 0 > compare_tree_int (index,
6654 list_length (CONSTRUCTOR_ELTS
6655 (TREE_OPERAND (exp, 0)))))
6659 for (elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)),
6660 i = TREE_INT_CST_LOW (index);
6661 elem != 0 && i != 0; i--, elem = TREE_CHAIN (elem))
6665 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
6669 else if (optimize >= 1
6670 && modifier != EXPAND_CONST_ADDRESS
6671 && modifier != EXPAND_INITIALIZER
6672 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6673 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6674 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
6676 if (TREE_CODE (index) == INTEGER_CST)
6678 tree init = DECL_INITIAL (array);
6680 if (TREE_CODE (init) == CONSTRUCTOR)
6684 for (elem = CONSTRUCTOR_ELTS (init);
6686 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6687 elem = TREE_CHAIN (elem))
6690 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6691 return expand_expr (fold (TREE_VALUE (elem)), target,
6694 else if (TREE_CODE (init) == STRING_CST
6695 && 0 > compare_tree_int (index,
6696 TREE_STRING_LENGTH (init)))
6698 tree type = TREE_TYPE (TREE_TYPE (init));
6699 enum machine_mode mode = TYPE_MODE (type);
6701 if (GET_MODE_CLASS (mode) == MODE_INT
6702 && GET_MODE_SIZE (mode) == 1)
6704 (TREE_STRING_POINTER
6705 (init)[TREE_INT_CST_LOW (index)]));
6714 case ARRAY_RANGE_REF:
6715 /* If the operand is a CONSTRUCTOR, we can just extract the
6716 appropriate field if it is present. Don't do this if we have
6717 already written the data since we want to refer to that copy
6718 and varasm.c assumes that's what we'll do. */
6719 if (code == COMPONENT_REF
6720 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
6721 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
6725 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6726 elt = TREE_CHAIN (elt))
6727 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6728 /* We can normally use the value of the field in the
6729 CONSTRUCTOR. However, if this is a bitfield in
6730 an integral mode that we can fit in a HOST_WIDE_INT,
6731 we must mask only the number of bits in the bitfield,
6732 since this is done implicitly by the constructor. If
6733 the bitfield does not meet either of those conditions,
6734 we can't do this optimization. */
6735 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6736 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6738 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6739 <= HOST_BITS_PER_WIDE_INT))))
6741 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6742 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6744 HOST_WIDE_INT bitsize
6745 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
6747 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
6749 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
6750 op0 = expand_and (op0, op1, target);
6754 enum machine_mode imode
6755 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
6757 = build_int_2 (GET_MODE_BITSIZE (imode) - bitsize,
6760 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
6762 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
6772 enum machine_mode mode1;
6773 HOST_WIDE_INT bitsize, bitpos;
6776 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6777 &mode1, &unsignedp, &volatilep);
6780 /* If we got back the original object, something is wrong. Perhaps
6781 we are evaluating an expression too early. In any event, don't
6782 infinitely recurse. */
6786 /* If TEM's type is a union of variable size, pass TARGET to the inner
6787 computation, since it will need a temporary and TARGET is known
6788 to have to do. This occurs in unchecked conversion in Ada. */
6792 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
6793 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
6795 ? target : NULL_RTX),
6797 (modifier == EXPAND_INITIALIZER
6798 || modifier == EXPAND_CONST_ADDRESS)
6799 ? modifier : EXPAND_NORMAL);
6801 /* If this is a constant, put it into a register if it is a
6802 legitimate constant and OFFSET is 0 and memory if it isn't. */
6803 if (CONSTANT_P (op0))
6805 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
6806 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
6808 op0 = force_reg (mode, op0);
6810 op0 = validize_mem (force_const_mem (mode, op0));
6815 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
6817 /* If this object is in a register, put it into memory.
6818 This case can't occur in C, but can in Ada if we have
6819 unchecked conversion of an expression from a scalar type to
6820 an array or record type. */
6821 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
6822 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
6824 /* If the operand is a SAVE_EXPR, we can deal with this by
6825 forcing the SAVE_EXPR into memory. */
6826 if (TREE_CODE (TREE_OPERAND (exp, 0)) == SAVE_EXPR)
6828 put_var_into_stack (TREE_OPERAND (exp, 0));
6829 op0 = SAVE_EXPR_RTL (TREE_OPERAND (exp, 0));
6834 = build_qualified_type (TREE_TYPE (tem),
6835 (TYPE_QUALS (TREE_TYPE (tem))
6836 | TYPE_QUAL_CONST));
6837 rtx memloc = assign_temp (nt, 1, 1, 1);
6839 emit_move_insn (memloc, op0);
6844 if (GET_CODE (op0) != MEM)
6847 if (GET_MODE (offset_rtx) != ptr_mode)
6848 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
6850 #ifdef POINTERS_EXTEND_UNSIGNED
6851 if (GET_MODE (offset_rtx) != Pmode)
6852 offset_rtx = convert_memory_address (Pmode, offset_rtx);
6855 /* A constant address in OP0 can have VOIDmode, we must not try
6856 to call force_reg for that case. Avoid that case. */
6857 if (GET_CODE (op0) == MEM
6858 && GET_MODE (op0) == BLKmode
6859 && GET_MODE (XEXP (op0, 0)) != VOIDmode
6861 && (bitpos % bitsize) == 0
6862 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
6863 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
6865 rtx temp = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
6867 if (GET_CODE (XEXP (temp, 0)) == REG)
6870 op0 = (replace_equiv_address
6872 force_reg (GET_MODE (XEXP (temp, 0)),
6877 op0 = offset_address (op0, offset_rtx,
6878 highest_pow2_factor (offset));
6881 /* Don't forget about volatility even if this is a bitfield. */
6882 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
6884 if (op0 == orig_op0)
6885 op0 = copy_rtx (op0);
6887 MEM_VOLATILE_P (op0) = 1;
6890 /* In cases where an aligned union has an unaligned object
6891 as a field, we might be extracting a BLKmode value from
6892 an integer-mode (e.g., SImode) object. Handle this case
6893 by doing the extract into an object as wide as the field
6894 (which we know to be the width of a basic mode), then
6895 storing into memory, and changing the mode to BLKmode. */
6896 if (mode1 == VOIDmode
6897 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
6898 || (mode1 != BLKmode && ! direct_load[(int) mode1]
6899 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
6900 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
6901 && modifier != EXPAND_CONST_ADDRESS
6902 && modifier != EXPAND_INITIALIZER)
6903 /* If the field isn't aligned enough to fetch as a memref,
6904 fetch it as a bit field. */
6905 || (mode1 != BLKmode
6906 && SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))
6907 && ((TYPE_ALIGN (TREE_TYPE (tem))
6908 < GET_MODE_ALIGNMENT (mode))
6909 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)))
6910 /* If the type and the field are a constant size and the
6911 size of the type isn't the same size as the bitfield,
6912 we must use bitfield operations. */
6914 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (exp)))
6916 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
6919 enum machine_mode ext_mode = mode;
6921 if (ext_mode == BLKmode
6922 && ! (target != 0 && GET_CODE (op0) == MEM
6923 && GET_CODE (target) == MEM
6924 && bitpos % BITS_PER_UNIT == 0))
6925 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
6927 if (ext_mode == BLKmode)
6929 /* In this case, BITPOS must start at a byte boundary and
6930 TARGET, if specified, must be a MEM. */
6931 if (GET_CODE (op0) != MEM
6932 || (target != 0 && GET_CODE (target) != MEM)
6933 || bitpos % BITS_PER_UNIT != 0)
6936 op0 = adjust_address (op0, VOIDmode, bitpos / BITS_PER_UNIT);
6938 target = assign_temp (type, 0, 1, 1);
6940 emit_block_move (target, op0,
6941 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
6947 op0 = validize_mem (op0);
6949 if (GET_CODE (op0) == MEM && GET_CODE (XEXP (op0, 0)) == REG)
6950 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
6952 op0 = extract_bit_field (op0, bitsize, bitpos,
6953 unsignedp, target, ext_mode, ext_mode,
6954 int_size_in_bytes (TREE_TYPE (tem)));
6956 /* If the result is a record type and BITSIZE is narrower than
6957 the mode of OP0, an integral mode, and this is a big endian
6958 machine, we must put the field into the high-order bits. */
6959 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
6960 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
6961 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
6962 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
6963 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
6967 if (mode == BLKmode)
6969 rtx new = assign_temp (build_qualified_type
6970 (type_for_mode (ext_mode, 0),
6971 TYPE_QUAL_CONST), 0, 1, 1);
6973 emit_move_insn (new, op0);
6974 op0 = copy_rtx (new);
6975 PUT_MODE (op0, BLKmode);
6976 set_mem_attributes (op0, exp, 1);
6982 /* If the result is BLKmode, use that to access the object
6984 if (mode == BLKmode)
6987 /* Get a reference to just this component. */
6988 if (modifier == EXPAND_CONST_ADDRESS
6989 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6990 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
6992 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
6994 if (op0 == orig_op0)
6995 op0 = copy_rtx (op0);
6997 set_mem_attributes (op0, exp, 0);
6998 if (GET_CODE (XEXP (op0, 0)) == REG)
6999 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7001 MEM_VOLATILE_P (op0) |= volatilep;
7002 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7003 || modifier == EXPAND_CONST_ADDRESS
7004 || modifier == EXPAND_INITIALIZER)
7006 else if (target == 0)
7007 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7009 convert_move (target, op0, unsignedp);
7015 rtx insn, before = get_last_insn (), vtbl_ref;
7017 /* Evaluate the interior expression. */
7018 subtarget = expand_expr (TREE_OPERAND (exp, 0), target,
7021 /* Get or create an instruction off which to hang a note. */
7022 if (REG_P (subtarget))
7025 insn = get_last_insn ();
7028 if (! INSN_P (insn))
7029 insn = prev_nonnote_insn (insn);
7033 target = gen_reg_rtx (GET_MODE (subtarget));
7034 insn = emit_move_insn (target, subtarget);
7037 /* Collect the data for the note. */
7038 vtbl_ref = XEXP (DECL_RTL (TREE_OPERAND (exp, 1)), 0);
7039 vtbl_ref = plus_constant (vtbl_ref,
7040 tree_low_cst (TREE_OPERAND (exp, 2), 0));
7041 /* Discard the initial CONST that was added. */
7042 vtbl_ref = XEXP (vtbl_ref, 0);
7045 = gen_rtx_EXPR_LIST (REG_VTABLE_REF, vtbl_ref, REG_NOTES (insn));
7050 /* Intended for a reference to a buffer of a file-object in Pascal.
7051 But it's not certain that a special tree code will really be
7052 necessary for these. INDIRECT_REF might work for them. */
7058 /* Pascal set IN expression.
7061 rlo = set_low - (set_low%bits_per_word);
7062 the_word = set [ (index - rlo)/bits_per_word ];
7063 bit_index = index % bits_per_word;
7064 bitmask = 1 << bit_index;
7065 return !!(the_word & bitmask); */
7067 tree set = TREE_OPERAND (exp, 0);
7068 tree index = TREE_OPERAND (exp, 1);
7069 int iunsignedp = TREE_UNSIGNED (TREE_TYPE (index));
7070 tree set_type = TREE_TYPE (set);
7071 tree set_low_bound = TYPE_MIN_VALUE (TYPE_DOMAIN (set_type));
7072 tree set_high_bound = TYPE_MAX_VALUE (TYPE_DOMAIN (set_type));
7073 rtx index_val = expand_expr (index, 0, VOIDmode, 0);
7074 rtx lo_r = expand_expr (set_low_bound, 0, VOIDmode, 0);
7075 rtx hi_r = expand_expr (set_high_bound, 0, VOIDmode, 0);
7076 rtx setval = expand_expr (set, 0, VOIDmode, 0);
7077 rtx setaddr = XEXP (setval, 0);
7078 enum machine_mode index_mode = TYPE_MODE (TREE_TYPE (index));
7080 rtx diff, quo, rem, addr, bit, result;
7082 /* If domain is empty, answer is no. Likewise if index is constant
7083 and out of bounds. */
7084 if (((TREE_CODE (set_high_bound) == INTEGER_CST
7085 && TREE_CODE (set_low_bound) == INTEGER_CST
7086 && tree_int_cst_lt (set_high_bound, set_low_bound))
7087 || (TREE_CODE (index) == INTEGER_CST
7088 && TREE_CODE (set_low_bound) == INTEGER_CST
7089 && tree_int_cst_lt (index, set_low_bound))
7090 || (TREE_CODE (set_high_bound) == INTEGER_CST
7091 && TREE_CODE (index) == INTEGER_CST
7092 && tree_int_cst_lt (set_high_bound, index))))
7096 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7098 /* If we get here, we have to generate the code for both cases
7099 (in range and out of range). */
7101 op0 = gen_label_rtx ();
7102 op1 = gen_label_rtx ();
7104 if (! (GET_CODE (index_val) == CONST_INT
7105 && GET_CODE (lo_r) == CONST_INT))
7106 emit_cmp_and_jump_insns (index_val, lo_r, LT, NULL_RTX,
7107 GET_MODE (index_val), iunsignedp, op1);
7109 if (! (GET_CODE (index_val) == CONST_INT
7110 && GET_CODE (hi_r) == CONST_INT))
7111 emit_cmp_and_jump_insns (index_val, hi_r, GT, NULL_RTX,
7112 GET_MODE (index_val), iunsignedp, op1);
7114 /* Calculate the element number of bit zero in the first word
7116 if (GET_CODE (lo_r) == CONST_INT)
7117 rlow = GEN_INT (INTVAL (lo_r)
7118 & ~((HOST_WIDE_INT) 1 << BITS_PER_UNIT));
7120 rlow = expand_binop (index_mode, and_optab, lo_r,
7121 GEN_INT (~((HOST_WIDE_INT) 1 << BITS_PER_UNIT)),
7122 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7124 diff = expand_binop (index_mode, sub_optab, index_val, rlow,
7125 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
7127 quo = expand_divmod (0, TRUNC_DIV_EXPR, index_mode, diff,
7128 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7129 rem = expand_divmod (1, TRUNC_MOD_EXPR, index_mode, index_val,
7130 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
7132 addr = memory_address (byte_mode,
7133 expand_binop (index_mode, add_optab, diff,
7134 setaddr, NULL_RTX, iunsignedp,
7137 /* Extract the bit we want to examine. */
7138 bit = expand_shift (RSHIFT_EXPR, byte_mode,
7139 gen_rtx_MEM (byte_mode, addr),
7140 make_tree (TREE_TYPE (index), rem),
7142 result = expand_binop (byte_mode, and_optab, bit, const1_rtx,
7143 GET_MODE (target) == byte_mode ? target : 0,
7144 1, OPTAB_LIB_WIDEN);
7146 if (result != target)
7147 convert_move (target, result, 1);
7149 /* Output the code to handle the out-of-range case. */
7152 emit_move_insn (target, const0_rtx);
7157 case WITH_CLEANUP_EXPR:
7158 if (WITH_CLEANUP_EXPR_RTL (exp) == 0)
7160 WITH_CLEANUP_EXPR_RTL (exp)
7161 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7162 expand_decl_cleanup (NULL_TREE, TREE_OPERAND (exp, 1));
7164 /* That's it for this cleanup. */
7165 TREE_OPERAND (exp, 1) = 0;
7167 return WITH_CLEANUP_EXPR_RTL (exp);
7169 case CLEANUP_POINT_EXPR:
7171 /* Start a new binding layer that will keep track of all cleanup
7172 actions to be performed. */
7173 expand_start_bindings (2);
7175 target_temp_slot_level = temp_slot_level;
7177 op0 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7178 /* If we're going to use this value, load it up now. */
7180 op0 = force_not_mem (op0);
7181 preserve_temp_slots (op0);
7182 expand_end_bindings (NULL_TREE, 0, 0);
7187 /* Check for a built-in function. */
7188 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7189 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7191 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7193 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7194 == BUILT_IN_FRONTEND)
7195 return (*lang_expand_expr) (exp, original_target, tmode, modifier);
7197 return expand_builtin (exp, target, subtarget, tmode, ignore);
7200 return expand_call (exp, target, ignore);
7202 case NON_LVALUE_EXPR:
7205 case REFERENCE_EXPR:
7206 if (TREE_OPERAND (exp, 0) == error_mark_node)
7209 if (TREE_CODE (type) == UNION_TYPE)
7211 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7213 /* If both input and output are BLKmode, this conversion isn't doing
7214 anything except possibly changing memory attribute. */
7215 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7217 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7220 result = copy_rtx (result);
7221 set_mem_attributes (result, exp, 0);
7226 target = assign_temp (type, 0, 1, 1);
7228 if (GET_CODE (target) == MEM)
7229 /* Store data into beginning of memory target. */
7230 store_expr (TREE_OPERAND (exp, 0),
7231 adjust_address (target, TYPE_MODE (valtype), 0), 0);
7233 else if (GET_CODE (target) == REG)
7234 /* Store this field into a union of the proper type. */
7235 store_field (target,
7236 MIN ((int_size_in_bytes (TREE_TYPE
7237 (TREE_OPERAND (exp, 0)))
7239 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7240 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7241 VOIDmode, 0, type, 0);
7245 /* Return the entire union. */
7249 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7251 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7254 /* If the signedness of the conversion differs and OP0 is
7255 a promoted SUBREG, clear that indication since we now
7256 have to do the proper extension. */
7257 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7258 && GET_CODE (op0) == SUBREG)
7259 SUBREG_PROMOTED_VAR_P (op0) = 0;
7264 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, 0);
7265 if (GET_MODE (op0) == mode)
7268 /* If OP0 is a constant, just convert it into the proper mode. */
7269 if (CONSTANT_P (op0))
7271 convert_modes (mode, TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7272 op0, TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7274 if (modifier == EXPAND_INITIALIZER)
7275 return gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7279 convert_to_mode (mode, op0,
7280 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7282 convert_move (target, op0,
7283 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7286 case VIEW_CONVERT_EXPR:
7287 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7289 /* If the input and output modes are both the same, we are done.
7290 Otherwise, if neither mode is BLKmode and both are within a word, we
7291 can use gen_lowpart. If neither is true, make sure the operand is
7292 in memory and convert the MEM to the new mode. */
7293 if (TYPE_MODE (type) == GET_MODE (op0))
7295 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7296 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7297 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7298 op0 = gen_lowpart (TYPE_MODE (type), op0);
7299 else if (GET_CODE (op0) != MEM)
7301 /* If the operand is not a MEM, force it into memory. Since we
7302 are going to be be changing the mode of the MEM, don't call
7303 force_const_mem for constants because we don't allow pool
7304 constants to change mode. */
7305 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7307 if (TREE_ADDRESSABLE (exp))
7310 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7312 = assign_stack_temp_for_type
7313 (TYPE_MODE (inner_type),
7314 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7316 emit_move_insn (target, op0);
7320 /* At this point, OP0 is in the correct mode. If the output type is such
7321 that the operand is known to be aligned, indicate that it is.
7322 Otherwise, we need only be concerned about alignment for non-BLKmode
7324 if (GET_CODE (op0) == MEM)
7326 op0 = copy_rtx (op0);
7328 if (TYPE_ALIGN_OK (type))
7329 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7330 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7331 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7333 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7334 HOST_WIDE_INT temp_size
7335 = MAX (int_size_in_bytes (inner_type),
7336 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7337 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7338 temp_size, 0, type);
7339 rtx new_with_op0_mode = copy_rtx (new);
7341 if (TREE_ADDRESSABLE (exp))
7344 PUT_MODE (new_with_op0_mode, GET_MODE (op0));
7345 if (GET_MODE (op0) == BLKmode)
7346 emit_block_move (new_with_op0_mode, op0,
7347 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))));
7349 emit_move_insn (new_with_op0_mode, op0);
7354 PUT_MODE (op0, TYPE_MODE (type));
7360 /* We come here from MINUS_EXPR when the second operand is a
7363 this_optab = ! unsignedp && flag_trapv
7364 && (GET_MODE_CLASS (mode) == MODE_INT)
7365 ? addv_optab : add_optab;
7367 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
7368 something else, make sure we add the register to the constant and
7369 then to the other thing. This case can occur during strength
7370 reduction and doing it this way will produce better code if the
7371 frame pointer or argument pointer is eliminated.
7373 fold-const.c will ensure that the constant is always in the inner
7374 PLUS_EXPR, so the only case we need to do anything about is if
7375 sp, ap, or fp is our second argument, in which case we must swap
7376 the innermost first argument and our second argument. */
7378 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7379 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7380 && TREE_CODE (TREE_OPERAND (exp, 1)) == RTL_EXPR
7381 && (RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7382 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7383 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7385 tree t = TREE_OPERAND (exp, 1);
7387 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7388 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7391 /* If the result is to be ptr_mode and we are adding an integer to
7392 something, we might be forming a constant. So try to use
7393 plus_constant. If it produces a sum and we can't accept it,
7394 use force_operand. This allows P = &ARR[const] to generate
7395 efficient code on machines where a SYMBOL_REF is not a valid
7398 If this is an EXPAND_SUM call, always return the sum. */
7399 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7400 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7402 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7403 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7404 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7408 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7410 /* Use immed_double_const to ensure that the constant is
7411 truncated according to the mode of OP1, then sign extended
7412 to a HOST_WIDE_INT. Using the constant directly can result
7413 in non-canonical RTL in a 64x32 cross compile. */
7415 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7417 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7418 op1 = plus_constant (op1, INTVAL (constant_part));
7419 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7420 op1 = force_operand (op1, target);
7424 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7425 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7426 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7430 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7432 if (! CONSTANT_P (op0))
7434 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7435 VOIDmode, modifier);
7436 /* Don't go to both_summands if modifier
7437 says it's not right to return a PLUS. */
7438 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7442 /* Use immed_double_const to ensure that the constant is
7443 truncated according to the mode of OP1, then sign extended
7444 to a HOST_WIDE_INT. Using the constant directly can result
7445 in non-canonical RTL in a 64x32 cross compile. */
7447 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7449 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7450 op0 = plus_constant (op0, INTVAL (constant_part));
7451 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7452 op0 = force_operand (op0, target);
7457 /* No sense saving up arithmetic to be done
7458 if it's all in the wrong mode to form part of an address.
7459 And force_operand won't know whether to sign-extend or
7461 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7462 || mode != ptr_mode)
7465 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7468 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, modifier);
7469 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, modifier);
7472 /* Make sure any term that's a sum with a constant comes last. */
7473 if (GET_CODE (op0) == PLUS
7474 && CONSTANT_P (XEXP (op0, 1)))
7480 /* If adding to a sum including a constant,
7481 associate it to put the constant outside. */
7482 if (GET_CODE (op1) == PLUS
7483 && CONSTANT_P (XEXP (op1, 1)))
7485 rtx constant_term = const0_rtx;
7487 temp = simplify_binary_operation (PLUS, mode, XEXP (op1, 0), op0);
7490 /* Ensure that MULT comes first if there is one. */
7491 else if (GET_CODE (op0) == MULT)
7492 op0 = gen_rtx_PLUS (mode, op0, XEXP (op1, 0));
7494 op0 = gen_rtx_PLUS (mode, XEXP (op1, 0), op0);
7496 /* Let's also eliminate constants from op0 if possible. */
7497 op0 = eliminate_constant_term (op0, &constant_term);
7499 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
7500 their sum should be a constant. Form it into OP1, since the
7501 result we want will then be OP0 + OP1. */
7503 temp = simplify_binary_operation (PLUS, mode, constant_term,
7508 op1 = gen_rtx_PLUS (mode, constant_term, XEXP (op1, 1));
7511 /* Put a constant term last and put a multiplication first. */
7512 if (CONSTANT_P (op0) || GET_CODE (op1) == MULT)
7513 temp = op1, op1 = op0, op0 = temp;
7515 temp = simplify_binary_operation (PLUS, mode, op0, op1);
7516 return temp ? temp : gen_rtx_PLUS (mode, op0, op1);
7519 /* For initializers, we are allowed to return a MINUS of two
7520 symbolic constants. Here we handle all cases when both operands
7522 /* Handle difference of two symbolic constants,
7523 for the sake of an initializer. */
7524 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7525 && really_constant_p (TREE_OPERAND (exp, 0))
7526 && really_constant_p (TREE_OPERAND (exp, 1)))
7528 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode,
7530 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode,
7533 /* If the last operand is a CONST_INT, use plus_constant of
7534 the negated constant. Else make the MINUS. */
7535 if (GET_CODE (op1) == CONST_INT)
7536 return plus_constant (op0, - INTVAL (op1));
7538 return gen_rtx_MINUS (mode, op0, op1);
7540 /* Convert A - const to A + (-const). */
7541 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7543 tree negated = fold (build1 (NEGATE_EXPR, type,
7544 TREE_OPERAND (exp, 1)));
7546 if (TREE_UNSIGNED (type) || TREE_OVERFLOW (negated))
7547 /* If we can't negate the constant in TYPE, leave it alone and
7548 expand_binop will negate it for us. We used to try to do it
7549 here in the signed version of TYPE, but that doesn't work
7550 on POINTER_TYPEs. */;
7553 exp = build (PLUS_EXPR, type, TREE_OPERAND (exp, 0), negated);
7557 this_optab = ! unsignedp && flag_trapv
7558 && (GET_MODE_CLASS(mode) == MODE_INT)
7559 ? subv_optab : sub_optab;
7563 /* If first operand is constant, swap them.
7564 Thus the following special case checks need only
7565 check the second operand. */
7566 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7568 tree t1 = TREE_OPERAND (exp, 0);
7569 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7570 TREE_OPERAND (exp, 1) = t1;
7573 /* Attempt to return something suitable for generating an
7574 indexed address, for machines that support that. */
7576 if (modifier == EXPAND_SUM && mode == ptr_mode
7577 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7578 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
7580 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7583 /* Apply distributive law if OP0 is x+c. */
7584 if (GET_CODE (op0) == PLUS
7585 && GET_CODE (XEXP (op0, 1)) == CONST_INT)
7590 (mode, XEXP (op0, 0),
7591 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)))),
7592 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))
7593 * INTVAL (XEXP (op0, 1))));
7595 if (GET_CODE (op0) != REG)
7596 op0 = force_operand (op0, NULL_RTX);
7597 if (GET_CODE (op0) != REG)
7598 op0 = copy_to_mode_reg (mode, op0);
7601 gen_rtx_MULT (mode, op0,
7602 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))));
7605 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7608 /* Check for multiplying things that have been extended
7609 from a narrower type. If this machine supports multiplying
7610 in that narrower type with a result in the desired type,
7611 do it that way, and avoid the explicit type-conversion. */
7612 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7613 && TREE_CODE (type) == INTEGER_TYPE
7614 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7615 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7616 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7617 && int_fits_type_p (TREE_OPERAND (exp, 1),
7618 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7619 /* Don't use a widening multiply if a shift will do. */
7620 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7621 > HOST_BITS_PER_WIDE_INT)
7622 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7624 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7625 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7627 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
7628 /* If both operands are extended, they must either both
7629 be zero-extended or both be sign-extended. */
7630 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7632 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))))))
7634 enum machine_mode innermode
7635 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)));
7636 optab other_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7637 ? smul_widen_optab : umul_widen_optab);
7638 this_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7639 ? umul_widen_optab : smul_widen_optab);
7640 if (mode == GET_MODE_WIDER_MODE (innermode))
7642 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7644 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7645 NULL_RTX, VOIDmode, 0);
7646 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7647 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7650 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7651 NULL_RTX, VOIDmode, 0);
7654 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7655 && innermode == word_mode)
7658 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7659 NULL_RTX, VOIDmode, 0);
7660 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7661 op1 = convert_modes (innermode, mode,
7662 expand_expr (TREE_OPERAND (exp, 1),
7663 NULL_RTX, VOIDmode, 0),
7666 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7667 NULL_RTX, VOIDmode, 0);
7668 temp = expand_binop (mode, other_optab, op0, op1, target,
7669 unsignedp, OPTAB_LIB_WIDEN);
7670 htem = expand_mult_highpart_adjust (innermode,
7671 gen_highpart (innermode, temp),
7673 gen_highpart (innermode, temp),
7675 emit_move_insn (gen_highpart (innermode, temp), htem);
7680 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7681 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7682 return expand_mult (mode, op0, op1, target, unsignedp);
7684 case TRUNC_DIV_EXPR:
7685 case FLOOR_DIV_EXPR:
7687 case ROUND_DIV_EXPR:
7688 case EXACT_DIV_EXPR:
7689 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7691 /* Possible optimization: compute the dividend with EXPAND_SUM
7692 then if the divisor is constant can optimize the case
7693 where some terms of the dividend have coeffs divisible by it. */
7694 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7695 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7696 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7699 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
7700 expensive divide. If not, combine will rebuild the original
7702 if (flag_unsafe_math_optimizations && optimize && !optimize_size
7703 && !real_onep (TREE_OPERAND (exp, 0)))
7704 return expand_expr (build (MULT_EXPR, type, TREE_OPERAND (exp, 0),
7705 build (RDIV_EXPR, type,
7706 build_real (type, dconst1),
7707 TREE_OPERAND (exp, 1))),
7708 target, tmode, unsignedp);
7709 this_optab = sdiv_optab;
7712 case TRUNC_MOD_EXPR:
7713 case FLOOR_MOD_EXPR:
7715 case ROUND_MOD_EXPR:
7716 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7718 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7719 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7720 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7722 case FIX_ROUND_EXPR:
7723 case FIX_FLOOR_EXPR:
7725 abort (); /* Not used for C. */
7727 case FIX_TRUNC_EXPR:
7728 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7730 target = gen_reg_rtx (mode);
7731 expand_fix (target, op0, unsignedp);
7735 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7737 target = gen_reg_rtx (mode);
7738 /* expand_float can't figure out what to do if FROM has VOIDmode.
7739 So give it the correct mode. With -O, cse will optimize this. */
7740 if (GET_MODE (op0) == VOIDmode)
7741 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7743 expand_float (target, op0,
7744 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7748 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7749 temp = expand_unop (mode,
7750 ! unsignedp && flag_trapv
7751 && (GET_MODE_CLASS(mode) == MODE_INT)
7752 ? negv_optab : neg_optab, op0, target, 0);
7758 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7760 /* Handle complex values specially. */
7761 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_INT
7762 || GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
7763 return expand_complex_abs (mode, op0, target, unsignedp);
7765 /* Unsigned abs is simply the operand. Testing here means we don't
7766 risk generating incorrect code below. */
7767 if (TREE_UNSIGNED (type))
7770 return expand_abs (mode, op0, target, unsignedp,
7771 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7775 target = original_target;
7776 if (target == 0 || ! safe_from_p (target, TREE_OPERAND (exp, 1), 1)
7777 || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
7778 || GET_MODE (target) != mode
7779 || (GET_CODE (target) == REG
7780 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7781 target = gen_reg_rtx (mode);
7782 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7783 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7785 /* First try to do it with a special MIN or MAX instruction.
7786 If that does not win, use a conditional jump to select the proper
7788 this_optab = (TREE_UNSIGNED (type)
7789 ? (code == MIN_EXPR ? umin_optab : umax_optab)
7790 : (code == MIN_EXPR ? smin_optab : smax_optab));
7792 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7797 /* At this point, a MEM target is no longer useful; we will get better
7800 if (GET_CODE (target) == MEM)
7801 target = gen_reg_rtx (mode);
7804 emit_move_insn (target, op0);
7806 op0 = gen_label_rtx ();
7808 /* If this mode is an integer too wide to compare properly,
7809 compare word by word. Rely on cse to optimize constant cases. */
7810 if (GET_MODE_CLASS (mode) == MODE_INT
7811 && ! can_compare_p (GE, mode, ccp_jump))
7813 if (code == MAX_EXPR)
7814 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7815 target, op1, NULL_RTX, op0);
7817 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7818 op1, target, NULL_RTX, op0);
7822 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)));
7823 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
7824 unsignedp, mode, NULL_RTX, NULL_RTX,
7827 emit_move_insn (target, op1);
7832 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7833 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
7839 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7840 temp = expand_unop (mode, ffs_optab, op0, target, 1);
7845 /* ??? Can optimize bitwise operations with one arg constant.
7846 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7847 and (a bitwise1 b) bitwise2 b (etc)
7848 but that is probably not worth while. */
7850 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7851 boolean values when we want in all cases to compute both of them. In
7852 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7853 as actual zero-or-1 values and then bitwise anding. In cases where
7854 there cannot be any side effects, better code would be made by
7855 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7856 how to recognize those cases. */
7858 case TRUTH_AND_EXPR:
7860 this_optab = and_optab;
7865 this_optab = ior_optab;
7868 case TRUTH_XOR_EXPR:
7870 this_optab = xor_optab;
7877 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7879 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7880 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
7883 /* Could determine the answer when only additive constants differ. Also,
7884 the addition of one can be handled by changing the condition. */
7891 case UNORDERED_EXPR:
7898 temp = do_store_flag (exp, target, tmode != VOIDmode ? tmode : mode, 0);
7902 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
7903 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
7905 && GET_CODE (original_target) == REG
7906 && (GET_MODE (original_target)
7907 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
7909 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
7912 if (temp != original_target)
7913 temp = copy_to_reg (temp);
7915 op1 = gen_label_rtx ();
7916 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
7917 GET_MODE (temp), unsignedp, op1);
7918 emit_move_insn (temp, const1_rtx);
7923 /* If no set-flag instruction, must generate a conditional
7924 store into a temporary variable. Drop through
7925 and handle this like && and ||. */
7927 case TRUTH_ANDIF_EXPR:
7928 case TRUTH_ORIF_EXPR:
7930 && (target == 0 || ! safe_from_p (target, exp, 1)
7931 /* Make sure we don't have a hard reg (such as function's return
7932 value) live across basic blocks, if not optimizing. */
7933 || (!optimize && GET_CODE (target) == REG
7934 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
7935 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7938 emit_clr_insn (target);
7940 op1 = gen_label_rtx ();
7941 jumpifnot (exp, op1);
7944 emit_0_to_1_insn (target);
7947 return ignore ? const0_rtx : target;
7949 case TRUTH_NOT_EXPR:
7950 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7951 /* The parser is careful to generate TRUTH_NOT_EXPR
7952 only with operands that are always zero or one. */
7953 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
7954 target, 1, OPTAB_LIB_WIDEN);
7960 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
7962 return expand_expr (TREE_OPERAND (exp, 1),
7963 (ignore ? const0_rtx : target),
7967 /* If we would have a "singleton" (see below) were it not for a
7968 conversion in each arm, bring that conversion back out. */
7969 if (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7970 && TREE_CODE (TREE_OPERAND (exp, 2)) == NOP_EXPR
7971 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0))
7972 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 2), 0))))
7974 tree iftrue = TREE_OPERAND (TREE_OPERAND (exp, 1), 0);
7975 tree iffalse = TREE_OPERAND (TREE_OPERAND (exp, 2), 0);
7977 if ((TREE_CODE_CLASS (TREE_CODE (iftrue)) == '2'
7978 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
7979 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '2'
7980 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0))
7981 || (TREE_CODE_CLASS (TREE_CODE (iftrue)) == '1'
7982 && operand_equal_p (iffalse, TREE_OPERAND (iftrue, 0), 0))
7983 || (TREE_CODE_CLASS (TREE_CODE (iffalse)) == '1'
7984 && operand_equal_p (iftrue, TREE_OPERAND (iffalse, 0), 0)))
7985 return expand_expr (build1 (NOP_EXPR, type,
7986 build (COND_EXPR, TREE_TYPE (iftrue),
7987 TREE_OPERAND (exp, 0),
7989 target, tmode, modifier);
7993 /* Note that COND_EXPRs whose type is a structure or union
7994 are required to be constructed to contain assignments of
7995 a temporary variable, so that we can evaluate them here
7996 for side effect only. If type is void, we must do likewise. */
7998 /* If an arm of the branch requires a cleanup,
7999 only that cleanup is performed. */
8002 tree binary_op = 0, unary_op = 0;
8004 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
8005 convert it to our mode, if necessary. */
8006 if (integer_onep (TREE_OPERAND (exp, 1))
8007 && integer_zerop (TREE_OPERAND (exp, 2))
8008 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8012 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
8017 op0 = expand_expr (TREE_OPERAND (exp, 0), target, mode, modifier);
8018 if (GET_MODE (op0) == mode)
8022 target = gen_reg_rtx (mode);
8023 convert_move (target, op0, unsignedp);
8027 /* Check for X ? A + B : A. If we have this, we can copy A to the
8028 output and conditionally add B. Similarly for unary operations.
8029 Don't do this if X has side-effects because those side effects
8030 might affect A or B and the "?" operation is a sequence point in
8031 ANSI. (operand_equal_p tests for side effects.) */
8033 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '2'
8034 && operand_equal_p (TREE_OPERAND (exp, 2),
8035 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8036 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
8037 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '2'
8038 && operand_equal_p (TREE_OPERAND (exp, 1),
8039 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8040 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
8041 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '1'
8042 && operand_equal_p (TREE_OPERAND (exp, 2),
8043 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
8044 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
8045 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '1'
8046 && operand_equal_p (TREE_OPERAND (exp, 1),
8047 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
8048 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
8050 /* If we are not to produce a result, we have no target. Otherwise,
8051 if a target was specified use it; it will not be used as an
8052 intermediate target unless it is safe. If no target, use a
8057 else if (original_target
8058 && (safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8059 || (singleton && GET_CODE (original_target) == REG
8060 && REGNO (original_target) >= FIRST_PSEUDO_REGISTER
8061 && original_target == var_rtx (singleton)))
8062 && GET_MODE (original_target) == mode
8063 #ifdef HAVE_conditional_move
8064 && (! can_conditionally_move_p (mode)
8065 || GET_CODE (original_target) == REG
8066 || TREE_ADDRESSABLE (type))
8068 && (GET_CODE (original_target) != MEM
8069 || TREE_ADDRESSABLE (type)))
8070 temp = original_target;
8071 else if (TREE_ADDRESSABLE (type))
8074 temp = assign_temp (type, 0, 0, 1);
8076 /* If we had X ? A + C : A, with C a constant power of 2, and we can
8077 do the test of X as a store-flag operation, do this as
8078 A + ((X != 0) << log C). Similarly for other simple binary
8079 operators. Only do for C == 1 if BRANCH_COST is low. */
8080 if (temp && singleton && binary_op
8081 && (TREE_CODE (binary_op) == PLUS_EXPR
8082 || TREE_CODE (binary_op) == MINUS_EXPR
8083 || TREE_CODE (binary_op) == BIT_IOR_EXPR
8084 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
8085 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
8086 : integer_onep (TREE_OPERAND (binary_op, 1)))
8087 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
8090 optab boptab = (TREE_CODE (binary_op) == PLUS_EXPR
8091 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8092 ? addv_optab : add_optab)
8093 : TREE_CODE (binary_op) == MINUS_EXPR
8094 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op))
8095 ? subv_optab : sub_optab)
8096 : TREE_CODE (binary_op) == BIT_IOR_EXPR ? ior_optab
8099 /* If we had X ? A : A + 1, do this as A + (X == 0).
8101 We have to invert the truth value here and then put it
8102 back later if do_store_flag fails. We cannot simply copy
8103 TREE_OPERAND (exp, 0) to another variable and modify that
8104 because invert_truthvalue can modify the tree pointed to
8106 if (singleton == TREE_OPERAND (exp, 1))
8107 TREE_OPERAND (exp, 0)
8108 = invert_truthvalue (TREE_OPERAND (exp, 0));
8110 result = do_store_flag (TREE_OPERAND (exp, 0),
8111 (safe_from_p (temp, singleton, 1)
8113 mode, BRANCH_COST <= 1);
8115 if (result != 0 && ! integer_onep (TREE_OPERAND (binary_op, 1)))
8116 result = expand_shift (LSHIFT_EXPR, mode, result,
8117 build_int_2 (tree_log2
8121 (safe_from_p (temp, singleton, 1)
8122 ? temp : NULL_RTX), 0);
8126 op1 = expand_expr (singleton, NULL_RTX, VOIDmode, 0);
8127 return expand_binop (mode, boptab, op1, result, temp,
8128 unsignedp, OPTAB_LIB_WIDEN);
8130 else if (singleton == TREE_OPERAND (exp, 1))
8131 TREE_OPERAND (exp, 0)
8132 = invert_truthvalue (TREE_OPERAND (exp, 0));
8135 do_pending_stack_adjust ();
8137 op0 = gen_label_rtx ();
8139 if (singleton && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0)))
8143 /* If the target conflicts with the other operand of the
8144 binary op, we can't use it. Also, we can't use the target
8145 if it is a hard register, because evaluating the condition
8146 might clobber it. */
8148 && ! safe_from_p (temp, TREE_OPERAND (binary_op, 1), 1))
8149 || (GET_CODE (temp) == REG
8150 && REGNO (temp) < FIRST_PSEUDO_REGISTER))
8151 temp = gen_reg_rtx (mode);
8152 store_expr (singleton, temp, 0);
8155 expand_expr (singleton,
8156 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8157 if (singleton == TREE_OPERAND (exp, 1))
8158 jumpif (TREE_OPERAND (exp, 0), op0);
8160 jumpifnot (TREE_OPERAND (exp, 0), op0);
8162 start_cleanup_deferral ();
8163 if (binary_op && temp == 0)
8164 /* Just touch the other operand. */
8165 expand_expr (TREE_OPERAND (binary_op, 1),
8166 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8168 store_expr (build (TREE_CODE (binary_op), type,
8169 make_tree (type, temp),
8170 TREE_OPERAND (binary_op, 1)),
8173 store_expr (build1 (TREE_CODE (unary_op), type,
8174 make_tree (type, temp)),
8178 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
8179 comparison operator. If we have one of these cases, set the
8180 output to A, branch on A (cse will merge these two references),
8181 then set the output to FOO. */
8183 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8184 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8185 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8186 TREE_OPERAND (exp, 1), 0)
8187 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8188 || TREE_CODE (TREE_OPERAND (exp, 1)) == SAVE_EXPR)
8189 && safe_from_p (temp, TREE_OPERAND (exp, 2), 1))
8191 if (GET_CODE (temp) == REG
8192 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8193 temp = gen_reg_rtx (mode);
8194 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8195 jumpif (TREE_OPERAND (exp, 0), op0);
8197 start_cleanup_deferral ();
8198 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8202 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
8203 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
8204 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
8205 TREE_OPERAND (exp, 2), 0)
8206 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
8207 || TREE_CODE (TREE_OPERAND (exp, 2)) == SAVE_EXPR)
8208 && safe_from_p (temp, TREE_OPERAND (exp, 1), 1))
8210 if (GET_CODE (temp) == REG
8211 && REGNO (temp) < FIRST_PSEUDO_REGISTER)
8212 temp = gen_reg_rtx (mode);
8213 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8214 jumpifnot (TREE_OPERAND (exp, 0), op0);
8216 start_cleanup_deferral ();
8217 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8222 op1 = gen_label_rtx ();
8223 jumpifnot (TREE_OPERAND (exp, 0), op0);
8225 start_cleanup_deferral ();
8227 /* One branch of the cond can be void, if it never returns. For
8228 example A ? throw : E */
8230 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node)
8231 store_expr (TREE_OPERAND (exp, 1), temp, 0);
8233 expand_expr (TREE_OPERAND (exp, 1),
8234 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8235 end_cleanup_deferral ();
8237 emit_jump_insn (gen_jump (op1));
8240 start_cleanup_deferral ();
8242 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node)
8243 store_expr (TREE_OPERAND (exp, 2), temp, 0);
8245 expand_expr (TREE_OPERAND (exp, 2),
8246 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
8249 end_cleanup_deferral ();
8260 /* Something needs to be initialized, but we didn't know
8261 where that thing was when building the tree. For example,
8262 it could be the return value of a function, or a parameter
8263 to a function which lays down in the stack, or a temporary
8264 variable which must be passed by reference.
8266 We guarantee that the expression will either be constructed
8267 or copied into our original target. */
8269 tree slot = TREE_OPERAND (exp, 0);
8270 tree cleanups = NULL_TREE;
8273 if (TREE_CODE (slot) != VAR_DECL)
8277 target = original_target;
8279 /* Set this here so that if we get a target that refers to a
8280 register variable that's already been used, put_reg_into_stack
8281 knows that it should fix up those uses. */
8282 TREE_USED (slot) = 1;
8286 if (DECL_RTL_SET_P (slot))
8288 target = DECL_RTL (slot);
8289 /* If we have already expanded the slot, so don't do
8291 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8296 target = assign_temp (type, 2, 0, 1);
8297 /* All temp slots at this level must not conflict. */
8298 preserve_temp_slots (target);
8299 SET_DECL_RTL (slot, target);
8300 if (TREE_ADDRESSABLE (slot))
8301 put_var_into_stack (slot);
8303 /* Since SLOT is not known to the called function
8304 to belong to its stack frame, we must build an explicit
8305 cleanup. This case occurs when we must build up a reference
8306 to pass the reference as an argument. In this case,
8307 it is very likely that such a reference need not be
8310 if (TREE_OPERAND (exp, 2) == 0)
8311 TREE_OPERAND (exp, 2) = maybe_build_cleanup (slot);
8312 cleanups = TREE_OPERAND (exp, 2);
8317 /* This case does occur, when expanding a parameter which
8318 needs to be constructed on the stack. The target
8319 is the actual stack address that we want to initialize.
8320 The function we call will perform the cleanup in this case. */
8322 /* If we have already assigned it space, use that space,
8323 not target that we were passed in, as our target
8324 parameter is only a hint. */
8325 if (DECL_RTL_SET_P (slot))
8327 target = DECL_RTL (slot);
8328 /* If we have already expanded the slot, so don't do
8330 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8335 SET_DECL_RTL (slot, target);
8336 /* If we must have an addressable slot, then make sure that
8337 the RTL that we just stored in slot is OK. */
8338 if (TREE_ADDRESSABLE (slot))
8339 put_var_into_stack (slot);
8343 exp1 = TREE_OPERAND (exp, 3) = TREE_OPERAND (exp, 1);
8344 /* Mark it as expanded. */
8345 TREE_OPERAND (exp, 1) = NULL_TREE;
8347 store_expr (exp1, target, 0);
8349 expand_decl_cleanup (NULL_TREE, cleanups);
8356 tree lhs = TREE_OPERAND (exp, 0);
8357 tree rhs = TREE_OPERAND (exp, 1);
8359 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8365 /* If lhs is complex, expand calls in rhs before computing it.
8366 That's so we don't compute a pointer and save it over a
8367 call. If lhs is simple, compute it first so we can give it
8368 as a target if the rhs is just a call. This avoids an
8369 extra temp and copy and that prevents a partial-subsumption
8370 which makes bad code. Actually we could treat
8371 component_ref's of vars like vars. */
8373 tree lhs = TREE_OPERAND (exp, 0);
8374 tree rhs = TREE_OPERAND (exp, 1);
8378 /* Check for |= or &= of a bitfield of size one into another bitfield
8379 of size 1. In this case, (unless we need the result of the
8380 assignment) we can do this more efficiently with a
8381 test followed by an assignment, if necessary.
8383 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8384 things change so we do, this code should be enhanced to
8387 && TREE_CODE (lhs) == COMPONENT_REF
8388 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8389 || TREE_CODE (rhs) == BIT_AND_EXPR)
8390 && TREE_OPERAND (rhs, 0) == lhs
8391 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8392 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8393 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8395 rtx label = gen_label_rtx ();
8397 do_jump (TREE_OPERAND (rhs, 1),
8398 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8399 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8400 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8401 (TREE_CODE (rhs) == BIT_IOR_EXPR
8403 : integer_zero_node)),
8405 do_pending_stack_adjust ();
8410 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8416 if (!TREE_OPERAND (exp, 0))
8417 expand_null_return ();
8419 expand_return (TREE_OPERAND (exp, 0));
8422 case PREINCREMENT_EXPR:
8423 case PREDECREMENT_EXPR:
8424 return expand_increment (exp, 0, ignore);
8426 case POSTINCREMENT_EXPR:
8427 case POSTDECREMENT_EXPR:
8428 /* Faster to treat as pre-increment if result is not used. */
8429 return expand_increment (exp, ! ignore, ignore);
8432 /* Are we taking the address of a nested function? */
8433 if (TREE_CODE (TREE_OPERAND (exp, 0)) == FUNCTION_DECL
8434 && decl_function_context (TREE_OPERAND (exp, 0)) != 0
8435 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp, 0))
8436 && ! TREE_STATIC (exp))
8438 op0 = trampoline_address (TREE_OPERAND (exp, 0));
8439 op0 = force_operand (op0, target);
8441 /* If we are taking the address of something erroneous, just
8443 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
8445 /* If we are taking the address of a constant and are at the
8446 top level, we have to use output_constant_def since we can't
8447 call force_const_mem at top level. */
8449 && (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
8450 || (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0)))
8452 op0 = XEXP (output_constant_def (TREE_OPERAND (exp, 0), 0), 0);
8455 /* We make sure to pass const0_rtx down if we came in with
8456 ignore set, to avoid doing the cleanups twice for something. */
8457 op0 = expand_expr (TREE_OPERAND (exp, 0),
8458 ignore ? const0_rtx : NULL_RTX, VOIDmode,
8459 (modifier == EXPAND_INITIALIZER
8460 ? modifier : EXPAND_CONST_ADDRESS));
8462 /* If we are going to ignore the result, OP0 will have been set
8463 to const0_rtx, so just return it. Don't get confused and
8464 think we are taking the address of the constant. */
8468 /* Pass 1 for MODIFY, so that protect_from_queue doesn't get
8469 clever and returns a REG when given a MEM. */
8470 op0 = protect_from_queue (op0, 1);
8472 /* We would like the object in memory. If it is a constant, we can
8473 have it be statically allocated into memory. For a non-constant,
8474 we need to allocate some memory and store the value into it. */
8476 if (CONSTANT_P (op0))
8477 op0 = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8479 else if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8480 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF
8481 || GET_CODE (op0) == PARALLEL)
8483 /* If this object is in a register, it must can't be BLKmode. */
8484 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8485 tree nt = build_qualified_type (inner_type,
8486 (TYPE_QUALS (inner_type)
8487 | TYPE_QUAL_CONST));
8488 rtx memloc = assign_temp (nt, 1, 1, 1);
8490 if (GET_CODE (op0) == PARALLEL)
8491 /* Handle calls that pass values in multiple non-contiguous
8492 locations. The Irix 6 ABI has examples of this. */
8493 emit_group_store (memloc, op0, int_size_in_bytes (inner_type));
8495 emit_move_insn (memloc, op0);
8500 if (GET_CODE (op0) != MEM)
8503 mark_temp_addr_taken (op0);
8504 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8506 op0 = XEXP (op0, 0);
8507 #ifdef POINTERS_EXTEND_UNSIGNED
8508 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8509 && mode == ptr_mode)
8510 op0 = convert_memory_address (ptr_mode, op0);
8515 /* If OP0 is not aligned as least as much as the type requires, we
8516 need to make a temporary, copy OP0 to it, and take the address of
8517 the temporary. We want to use the alignment of the type, not of
8518 the operand. Note that this is incorrect for FUNCTION_TYPE, but
8519 the test for BLKmode means that can't happen. The test for
8520 BLKmode is because we never make mis-aligned MEMs with
8523 We don't need to do this at all if the machine doesn't have
8524 strict alignment. */
8525 if (STRICT_ALIGNMENT && GET_MODE (op0) == BLKmode
8526 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
8528 && MEM_ALIGN (op0) < BIGGEST_ALIGNMENT)
8530 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8532 = assign_stack_temp_for_type
8533 (TYPE_MODE (inner_type),
8534 MEM_SIZE (op0) ? INTVAL (MEM_SIZE (op0))
8535 : int_size_in_bytes (inner_type),
8536 1, build_qualified_type (inner_type,
8537 (TYPE_QUALS (inner_type)
8538 | TYPE_QUAL_CONST)));
8540 if (TYPE_ALIGN_OK (inner_type))
8543 emit_block_move (new, op0, expr_size (TREE_OPERAND (exp, 0)));
8547 op0 = force_operand (XEXP (op0, 0), target);
8551 && GET_CODE (op0) != REG
8552 && modifier != EXPAND_CONST_ADDRESS
8553 && modifier != EXPAND_INITIALIZER
8554 && modifier != EXPAND_SUM)
8555 op0 = force_reg (Pmode, op0);
8557 if (GET_CODE (op0) == REG
8558 && ! REG_USERVAR_P (op0))
8559 mark_reg_pointer (op0, TYPE_ALIGN (TREE_TYPE (type)));
8561 #ifdef POINTERS_EXTEND_UNSIGNED
8562 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8563 && mode == ptr_mode)
8564 op0 = convert_memory_address (ptr_mode, op0);
8569 case ENTRY_VALUE_EXPR:
8572 /* COMPLEX type for Extended Pascal & Fortran */
8575 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8578 /* Get the rtx code of the operands. */
8579 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8580 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8583 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8587 /* Move the real (op0) and imaginary (op1) parts to their location. */
8588 emit_move_insn (gen_realpart (mode, target), op0);
8589 emit_move_insn (gen_imagpart (mode, target), op1);
8591 insns = get_insns ();
8594 /* Complex construction should appear as a single unit. */
8595 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
8596 each with a separate pseudo as destination.
8597 It's not correct for flow to treat them as a unit. */
8598 if (GET_CODE (target) != CONCAT)
8599 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
8607 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8608 return gen_realpart (mode, op0);
8611 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8612 return gen_imagpart (mode, op0);
8616 enum machine_mode partmode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8620 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8623 target = gen_reg_rtx (mode);
8627 /* Store the realpart and the negated imagpart to target. */
8628 emit_move_insn (gen_realpart (partmode, target),
8629 gen_realpart (partmode, op0));
8631 imag_t = gen_imagpart (partmode, target);
8632 temp = expand_unop (partmode,
8633 ! unsignedp && flag_trapv
8634 && (GET_MODE_CLASS(partmode) == MODE_INT)
8635 ? negv_optab : neg_optab,
8636 gen_imagpart (partmode, op0), imag_t, 0);
8638 emit_move_insn (imag_t, temp);
8640 insns = get_insns ();
8643 /* Conjugate should appear as a single unit
8644 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
8645 each with a separate pseudo as destination.
8646 It's not correct for flow to treat them as a unit. */
8647 if (GET_CODE (target) != CONCAT)
8648 emit_no_conflict_block (insns, target, op0, NULL_RTX, NULL_RTX);
8655 case TRY_CATCH_EXPR:
8657 tree handler = TREE_OPERAND (exp, 1);
8659 expand_eh_region_start ();
8661 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8663 expand_eh_region_end_cleanup (handler);
8668 case TRY_FINALLY_EXPR:
8670 tree try_block = TREE_OPERAND (exp, 0);
8671 tree finally_block = TREE_OPERAND (exp, 1);
8672 rtx finally_label = gen_label_rtx ();
8673 rtx done_label = gen_label_rtx ();
8674 rtx return_link = gen_reg_rtx (Pmode);
8675 tree cleanup = build (GOTO_SUBROUTINE_EXPR, void_type_node,
8676 (tree) finally_label, (tree) return_link);
8677 TREE_SIDE_EFFECTS (cleanup) = 1;
8679 /* Start a new binding layer that will keep track of all cleanup
8680 actions to be performed. */
8681 expand_start_bindings (2);
8683 target_temp_slot_level = temp_slot_level;
8685 expand_decl_cleanup (NULL_TREE, cleanup);
8686 op0 = expand_expr (try_block, target, tmode, modifier);
8688 preserve_temp_slots (op0);
8689 expand_end_bindings (NULL_TREE, 0, 0);
8690 emit_jump (done_label);
8691 emit_label (finally_label);
8692 expand_expr (finally_block, const0_rtx, VOIDmode, 0);
8693 emit_indirect_jump (return_link);
8694 emit_label (done_label);
8698 case GOTO_SUBROUTINE_EXPR:
8700 rtx subr = (rtx) TREE_OPERAND (exp, 0);
8701 rtx return_link = *(rtx *) &TREE_OPERAND (exp, 1);
8702 rtx return_address = gen_label_rtx ();
8703 emit_move_insn (return_link,
8704 gen_rtx_LABEL_REF (Pmode, return_address));
8706 emit_label (return_address);
8711 return expand_builtin_va_arg (TREE_OPERAND (exp, 0), type);
8714 return get_exception_pointer (cfun);
8717 /* Function descriptors are not valid except for as
8718 initialization constants, and should not be expanded. */
8722 return (*lang_expand_expr) (exp, original_target, tmode, modifier);
8725 /* Here to do an ordinary binary operator, generating an instruction
8726 from the optab already placed in `this_optab'. */
8728 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8730 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8731 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8733 temp = expand_binop (mode, this_optab, op0, op1, target,
8734 unsignedp, OPTAB_LIB_WIDEN);
8740 /* Return the tree node if a ARG corresponds to a string constant or zero
8741 if it doesn't. If we return non-zero, set *PTR_OFFSET to the offset
8742 in bytes within the string that ARG is accessing. The type of the
8743 offset will be `sizetype'. */
8746 string_constant (arg, ptr_offset)
8752 if (TREE_CODE (arg) == ADDR_EXPR
8753 && TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
8755 *ptr_offset = size_zero_node;
8756 return TREE_OPERAND (arg, 0);
8758 else if (TREE_CODE (arg) == PLUS_EXPR)
8760 tree arg0 = TREE_OPERAND (arg, 0);
8761 tree arg1 = TREE_OPERAND (arg, 1);
8766 if (TREE_CODE (arg0) == ADDR_EXPR
8767 && TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST)
8769 *ptr_offset = convert (sizetype, arg1);
8770 return TREE_OPERAND (arg0, 0);
8772 else if (TREE_CODE (arg1) == ADDR_EXPR
8773 && TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST)
8775 *ptr_offset = convert (sizetype, arg0);
8776 return TREE_OPERAND (arg1, 0);
8783 /* Expand code for a post- or pre- increment or decrement
8784 and return the RTX for the result.
8785 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
8788 expand_increment (exp, post, ignore)
8794 tree incremented = TREE_OPERAND (exp, 0);
8795 optab this_optab = add_optab;
8797 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
8798 int op0_is_copy = 0;
8799 int single_insn = 0;
8800 /* 1 means we can't store into OP0 directly,
8801 because it is a subreg narrower than a word,
8802 and we don't dare clobber the rest of the word. */
8805 /* Stabilize any component ref that might need to be
8806 evaluated more than once below. */
8808 || TREE_CODE (incremented) == BIT_FIELD_REF
8809 || (TREE_CODE (incremented) == COMPONENT_REF
8810 && (TREE_CODE (TREE_OPERAND (incremented, 0)) != INDIRECT_REF
8811 || DECL_BIT_FIELD (TREE_OPERAND (incremented, 1)))))
8812 incremented = stabilize_reference (incremented);
8813 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
8814 ones into save exprs so that they don't accidentally get evaluated
8815 more than once by the code below. */
8816 if (TREE_CODE (incremented) == PREINCREMENT_EXPR
8817 || TREE_CODE (incremented) == PREDECREMENT_EXPR)
8818 incremented = save_expr (incremented);
8820 /* Compute the operands as RTX.
8821 Note whether OP0 is the actual lvalue or a copy of it:
8822 I believe it is a copy iff it is a register or subreg
8823 and insns were generated in computing it. */
8825 temp = get_last_insn ();
8826 op0 = expand_expr (incremented, NULL_RTX, VOIDmode, 0);
8828 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
8829 in place but instead must do sign- or zero-extension during assignment,
8830 so we copy it into a new register and let the code below use it as
8833 Note that we can safely modify this SUBREG since it is know not to be
8834 shared (it was made by the expand_expr call above). */
8836 if (GET_CODE (op0) == SUBREG && SUBREG_PROMOTED_VAR_P (op0))
8839 SUBREG_REG (op0) = copy_to_reg (SUBREG_REG (op0));
8843 else if (GET_CODE (op0) == SUBREG
8844 && GET_MODE_BITSIZE (GET_MODE (op0)) < BITS_PER_WORD)
8846 /* We cannot increment this SUBREG in place. If we are
8847 post-incrementing, get a copy of the old value. Otherwise,
8848 just mark that we cannot increment in place. */
8850 op0 = copy_to_reg (op0);
8855 op0_is_copy = ((GET_CODE (op0) == SUBREG || GET_CODE (op0) == REG)
8856 && temp != get_last_insn ());
8857 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8859 /* Decide whether incrementing or decrementing. */
8860 if (TREE_CODE (exp) == POSTDECREMENT_EXPR
8861 || TREE_CODE (exp) == PREDECREMENT_EXPR)
8862 this_optab = sub_optab;
8864 /* Convert decrement by a constant into a negative increment. */
8865 if (this_optab == sub_optab
8866 && GET_CODE (op1) == CONST_INT)
8868 op1 = GEN_INT (-INTVAL (op1));
8869 this_optab = add_optab;
8872 if (TYPE_TRAP_SIGNED (TREE_TYPE (exp)))
8873 this_optab = this_optab == add_optab ? addv_optab : subv_optab;
8875 /* For a preincrement, see if we can do this with a single instruction. */
8878 icode = (int) this_optab->handlers[(int) mode].insn_code;
8879 if (icode != (int) CODE_FOR_nothing
8880 /* Make sure that OP0 is valid for operands 0 and 1
8881 of the insn we want to queue. */
8882 && (*insn_data[icode].operand[0].predicate) (op0, mode)
8883 && (*insn_data[icode].operand[1].predicate) (op0, mode)
8884 && (*insn_data[icode].operand[2].predicate) (op1, mode))
8888 /* If OP0 is not the actual lvalue, but rather a copy in a register,
8889 then we cannot just increment OP0. We must therefore contrive to
8890 increment the original value. Then, for postincrement, we can return
8891 OP0 since it is a copy of the old value. For preincrement, expand here
8892 unless we can do it with a single insn.
8894 Likewise if storing directly into OP0 would clobber high bits
8895 we need to preserve (bad_subreg). */
8896 if (op0_is_copy || (!post && !single_insn) || bad_subreg)
8898 /* This is the easiest way to increment the value wherever it is.
8899 Problems with multiple evaluation of INCREMENTED are prevented
8900 because either (1) it is a component_ref or preincrement,
8901 in which case it was stabilized above, or (2) it is an array_ref
8902 with constant index in an array in a register, which is
8903 safe to reevaluate. */
8904 tree newexp = build (((TREE_CODE (exp) == POSTDECREMENT_EXPR
8905 || TREE_CODE (exp) == PREDECREMENT_EXPR)
8906 ? MINUS_EXPR : PLUS_EXPR),
8909 TREE_OPERAND (exp, 1));
8911 while (TREE_CODE (incremented) == NOP_EXPR
8912 || TREE_CODE (incremented) == CONVERT_EXPR)
8914 newexp = convert (TREE_TYPE (incremented), newexp);
8915 incremented = TREE_OPERAND (incremented, 0);
8918 temp = expand_assignment (incremented, newexp, ! post && ! ignore , 0);
8919 return post ? op0 : temp;
8924 /* We have a true reference to the value in OP0.
8925 If there is an insn to add or subtract in this mode, queue it.
8926 Queueing the increment insn avoids the register shuffling
8927 that often results if we must increment now and first save
8928 the old value for subsequent use. */
8930 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
8931 op0 = stabilize (op0);
8934 icode = (int) this_optab->handlers[(int) mode].insn_code;
8935 if (icode != (int) CODE_FOR_nothing
8936 /* Make sure that OP0 is valid for operands 0 and 1
8937 of the insn we want to queue. */
8938 && (*insn_data[icode].operand[0].predicate) (op0, mode)
8939 && (*insn_data[icode].operand[1].predicate) (op0, mode))
8941 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
8942 op1 = force_reg (mode, op1);
8944 return enqueue_insn (op0, GEN_FCN (icode) (op0, op0, op1));
8946 if (icode != (int) CODE_FOR_nothing && GET_CODE (op0) == MEM)
8948 rtx addr = (general_operand (XEXP (op0, 0), mode)
8949 ? force_reg (Pmode, XEXP (op0, 0))
8950 : copy_to_reg (XEXP (op0, 0)));
8953 op0 = replace_equiv_address (op0, addr);
8954 temp = force_reg (GET_MODE (op0), op0);
8955 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
8956 op1 = force_reg (mode, op1);
8958 /* The increment queue is LIFO, thus we have to `queue'
8959 the instructions in reverse order. */
8960 enqueue_insn (op0, gen_move_insn (op0, temp));
8961 result = enqueue_insn (temp, GEN_FCN (icode) (temp, temp, op1));
8966 /* Preincrement, or we can't increment with one simple insn. */
8968 /* Save a copy of the value before inc or dec, to return it later. */
8969 temp = value = copy_to_reg (op0);
8971 /* Arrange to return the incremented value. */
8972 /* Copy the rtx because expand_binop will protect from the queue,
8973 and the results of that would be invalid for us to return
8974 if our caller does emit_queue before using our result. */
8975 temp = copy_rtx (value = op0);
8977 /* Increment however we can. */
8978 op1 = expand_binop (mode, this_optab, value, op1, op0,
8979 TREE_UNSIGNED (TREE_TYPE (exp)), OPTAB_LIB_WIDEN);
8981 /* Make sure the value is stored into OP0. */
8983 emit_move_insn (op0, op1);
8988 /* At the start of a function, record that we have no previously-pushed
8989 arguments waiting to be popped. */
8992 init_pending_stack_adjust ()
8994 pending_stack_adjust = 0;
8997 /* When exiting from function, if safe, clear out any pending stack adjust
8998 so the adjustment won't get done.
9000 Note, if the current function calls alloca, then it must have a
9001 frame pointer regardless of the value of flag_omit_frame_pointer. */
9004 clear_pending_stack_adjust ()
9006 #ifdef EXIT_IGNORE_STACK
9008 && (! flag_omit_frame_pointer || current_function_calls_alloca)
9009 && EXIT_IGNORE_STACK
9010 && ! (DECL_INLINE (current_function_decl) && ! flag_no_inline)
9011 && ! flag_inline_functions)
9013 stack_pointer_delta -= pending_stack_adjust,
9014 pending_stack_adjust = 0;
9019 /* Pop any previously-pushed arguments that have not been popped yet. */
9022 do_pending_stack_adjust ()
9024 if (inhibit_defer_pop == 0)
9026 if (pending_stack_adjust != 0)
9027 adjust_stack (GEN_INT (pending_stack_adjust));
9028 pending_stack_adjust = 0;
9032 /* Expand conditional expressions. */
9034 /* Generate code to evaluate EXP and jump to LABEL if the value is zero.
9035 LABEL is an rtx of code CODE_LABEL, in this function and all the
9039 jumpifnot (exp, label)
9043 do_jump (exp, label, NULL_RTX);
9046 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
9053 do_jump (exp, NULL_RTX, label);
9056 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
9057 the result is zero, or IF_TRUE_LABEL if the result is one.
9058 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
9059 meaning fall through in that case.
9061 do_jump always does any pending stack adjust except when it does not
9062 actually perform a jump. An example where there is no jump
9063 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null.
9065 This function is responsible for optimizing cases such as
9066 &&, || and comparison operators in EXP. */
9069 do_jump (exp, if_false_label, if_true_label)
9071 rtx if_false_label, if_true_label;
9073 enum tree_code code = TREE_CODE (exp);
9074 /* Some cases need to create a label to jump to
9075 in order to properly fall through.
9076 These cases set DROP_THROUGH_LABEL nonzero. */
9077 rtx drop_through_label = 0;
9081 enum machine_mode mode;
9083 #ifdef MAX_INTEGER_COMPUTATION_MODE
9084 check_max_integer_computation_mode (exp);
9095 temp = integer_zerop (exp) ? if_false_label : if_true_label;
9101 /* This is not true with #pragma weak */
9103 /* The address of something can never be zero. */
9105 emit_jump (if_true_label);
9110 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
9111 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
9112 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF
9113 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_RANGE_REF)
9116 /* If we are narrowing the operand, we have to do the compare in the
9118 if ((TYPE_PRECISION (TREE_TYPE (exp))
9119 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
9121 case NON_LVALUE_EXPR:
9122 case REFERENCE_EXPR:
9127 /* These cannot change zero->non-zero or vice versa. */
9128 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9131 case WITH_RECORD_EXPR:
9132 /* Put the object on the placeholder list, recurse through our first
9133 operand, and pop the list. */
9134 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
9136 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9137 placeholder_list = TREE_CHAIN (placeholder_list);
9141 /* This is never less insns than evaluating the PLUS_EXPR followed by
9142 a test and can be longer if the test is eliminated. */
9144 /* Reduce to minus. */
9145 exp = build (MINUS_EXPR, TREE_TYPE (exp),
9146 TREE_OPERAND (exp, 0),
9147 fold (build1 (NEGATE_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
9148 TREE_OPERAND (exp, 1))));
9149 /* Process as MINUS. */
9153 /* Non-zero iff operands of minus differ. */
9154 do_compare_and_jump (build (NE_EXPR, TREE_TYPE (exp),
9155 TREE_OPERAND (exp, 0),
9156 TREE_OPERAND (exp, 1)),
9157 NE, NE, if_false_label, if_true_label);
9161 /* If we are AND'ing with a small constant, do this comparison in the
9162 smallest type that fits. If the machine doesn't have comparisons
9163 that small, it will be converted back to the wider comparison.
9164 This helps if we are testing the sign bit of a narrower object.
9165 combine can't do this for us because it can't know whether a
9166 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
9168 if (! SLOW_BYTE_ACCESS
9169 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
9170 && TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
9171 && (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0
9172 && (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
9173 && (type = type_for_mode (mode, 1)) != 0
9174 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9175 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9176 != CODE_FOR_nothing))
9178 do_jump (convert (type, exp), if_false_label, if_true_label);
9183 case TRUTH_NOT_EXPR:
9184 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9187 case TRUTH_ANDIF_EXPR:
9188 if (if_false_label == 0)
9189 if_false_label = drop_through_label = gen_label_rtx ();
9190 do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
9191 start_cleanup_deferral ();
9192 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9193 end_cleanup_deferral ();
9196 case TRUTH_ORIF_EXPR:
9197 if (if_true_label == 0)
9198 if_true_label = drop_through_label = gen_label_rtx ();
9199 do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
9200 start_cleanup_deferral ();
9201 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9202 end_cleanup_deferral ();
9207 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
9208 preserve_temp_slots (NULL_RTX);
9212 do_pending_stack_adjust ();
9213 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9219 case ARRAY_RANGE_REF:
9221 HOST_WIDE_INT bitsize, bitpos;
9223 enum machine_mode mode;
9228 /* Get description of this reference. We don't actually care
9229 about the underlying object here. */
9230 get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
9231 &unsignedp, &volatilep);
9233 type = type_for_size (bitsize, unsignedp);
9234 if (! SLOW_BYTE_ACCESS
9235 && type != 0 && bitsize >= 0
9236 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9237 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9238 != CODE_FOR_nothing))
9240 do_jump (convert (type, exp), if_false_label, if_true_label);
9247 /* Do (a ? 1 : 0) and (a ? 0 : 1) as special cases. */
9248 if (integer_onep (TREE_OPERAND (exp, 1))
9249 && integer_zerop (TREE_OPERAND (exp, 2)))
9250 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9252 else if (integer_zerop (TREE_OPERAND (exp, 1))
9253 && integer_onep (TREE_OPERAND (exp, 2)))
9254 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9258 rtx label1 = gen_label_rtx ();
9259 drop_through_label = gen_label_rtx ();
9261 do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
9263 start_cleanup_deferral ();
9264 /* Now the THEN-expression. */
9265 do_jump (TREE_OPERAND (exp, 1),
9266 if_false_label ? if_false_label : drop_through_label,
9267 if_true_label ? if_true_label : drop_through_label);
9268 /* In case the do_jump just above never jumps. */
9269 do_pending_stack_adjust ();
9270 emit_label (label1);
9272 /* Now the ELSE-expression. */
9273 do_jump (TREE_OPERAND (exp, 2),
9274 if_false_label ? if_false_label : drop_through_label,
9275 if_true_label ? if_true_label : drop_through_label);
9276 end_cleanup_deferral ();
9282 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9284 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9285 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9287 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9288 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9291 (build (TRUTH_ANDIF_EXPR, TREE_TYPE (exp),
9292 fold (build (EQ_EXPR, TREE_TYPE (exp),
9293 fold (build1 (REALPART_EXPR,
9294 TREE_TYPE (inner_type),
9296 fold (build1 (REALPART_EXPR,
9297 TREE_TYPE (inner_type),
9299 fold (build (EQ_EXPR, TREE_TYPE (exp),
9300 fold (build1 (IMAGPART_EXPR,
9301 TREE_TYPE (inner_type),
9303 fold (build1 (IMAGPART_EXPR,
9304 TREE_TYPE (inner_type),
9306 if_false_label, if_true_label);
9309 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9310 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9312 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9313 && !can_compare_p (EQ, TYPE_MODE (inner_type), ccp_jump))
9314 do_jump_by_parts_equality (exp, if_false_label, if_true_label);
9316 do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
9322 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9324 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9325 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9327 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9328 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9331 (build (TRUTH_ORIF_EXPR, TREE_TYPE (exp),
9332 fold (build (NE_EXPR, TREE_TYPE (exp),
9333 fold (build1 (REALPART_EXPR,
9334 TREE_TYPE (inner_type),
9336 fold (build1 (REALPART_EXPR,
9337 TREE_TYPE (inner_type),
9339 fold (build (NE_EXPR, TREE_TYPE (exp),
9340 fold (build1 (IMAGPART_EXPR,
9341 TREE_TYPE (inner_type),
9343 fold (build1 (IMAGPART_EXPR,
9344 TREE_TYPE (inner_type),
9346 if_false_label, if_true_label);
9349 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9350 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9352 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9353 && !can_compare_p (NE, TYPE_MODE (inner_type), ccp_jump))
9354 do_jump_by_parts_equality (exp, if_true_label, if_false_label);
9356 do_compare_and_jump (exp, NE, NE, if_false_label, if_true_label);
9361 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9362 if (GET_MODE_CLASS (mode) == MODE_INT
9363 && ! can_compare_p (LT, mode, ccp_jump))
9364 do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
9366 do_compare_and_jump (exp, LT, LTU, if_false_label, if_true_label);
9370 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9371 if (GET_MODE_CLASS (mode) == MODE_INT
9372 && ! can_compare_p (LE, mode, ccp_jump))
9373 do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
9375 do_compare_and_jump (exp, LE, LEU, if_false_label, if_true_label);
9379 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9380 if (GET_MODE_CLASS (mode) == MODE_INT
9381 && ! can_compare_p (GT, mode, ccp_jump))
9382 do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
9384 do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
9388 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9389 if (GET_MODE_CLASS (mode) == MODE_INT
9390 && ! can_compare_p (GE, mode, ccp_jump))
9391 do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
9393 do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
9396 case UNORDERED_EXPR:
9399 enum rtx_code cmp, rcmp;
9402 if (code == UNORDERED_EXPR)
9403 cmp = UNORDERED, rcmp = ORDERED;
9405 cmp = ORDERED, rcmp = UNORDERED;
9406 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9409 if (! can_compare_p (cmp, mode, ccp_jump)
9410 && (can_compare_p (rcmp, mode, ccp_jump)
9411 /* If the target doesn't provide either UNORDERED or ORDERED
9412 comparisons, canonicalize on UNORDERED for the library. */
9413 || rcmp == UNORDERED))
9417 do_compare_and_jump (exp, cmp, cmp, if_false_label, if_true_label);
9419 do_compare_and_jump (exp, rcmp, rcmp, if_true_label, if_false_label);
9424 enum rtx_code rcode1;
9425 enum tree_code tcode2;
9449 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9450 if (can_compare_p (rcode1, mode, ccp_jump))
9451 do_compare_and_jump (exp, rcode1, rcode1, if_false_label,
9455 tree op0 = save_expr (TREE_OPERAND (exp, 0));
9456 tree op1 = save_expr (TREE_OPERAND (exp, 1));
9459 /* If the target doesn't support combined unordered
9460 compares, decompose into UNORDERED + comparison. */
9461 cmp0 = fold (build (UNORDERED_EXPR, TREE_TYPE (exp), op0, op1));
9462 cmp1 = fold (build (tcode2, TREE_TYPE (exp), op0, op1));
9463 exp = build (TRUTH_ORIF_EXPR, TREE_TYPE (exp), cmp0, cmp1);
9464 do_jump (exp, if_false_label, if_true_label);
9470 __builtin_expect (<test>, 0) and
9471 __builtin_expect (<test>, 1)
9473 We need to do this here, so that <test> is not converted to a SCC
9474 operation on machines that use condition code registers and COMPARE
9475 like the PowerPC, and then the jump is done based on whether the SCC
9476 operation produced a 1 or 0. */
9478 /* Check for a built-in function. */
9479 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
9481 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
9482 tree arglist = TREE_OPERAND (exp, 1);
9484 if (TREE_CODE (fndecl) == FUNCTION_DECL
9485 && DECL_BUILT_IN (fndecl)
9486 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT
9487 && arglist != NULL_TREE
9488 && TREE_CHAIN (arglist) != NULL_TREE)
9490 rtx seq = expand_builtin_expect_jump (exp, if_false_label,
9493 if (seq != NULL_RTX)
9500 /* fall through and generate the normal code. */
9504 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
9506 /* This is not needed any more and causes poor code since it causes
9507 comparisons and tests from non-SI objects to have different code
9509 /* Copy to register to avoid generating bad insns by cse
9510 from (set (mem ...) (arithop)) (set (cc0) (mem ...)). */
9511 if (!cse_not_expected && GET_CODE (temp) == MEM)
9512 temp = copy_to_reg (temp);
9514 do_pending_stack_adjust ();
9515 /* Do any postincrements in the expression that was tested. */
9518 if (GET_CODE (temp) == CONST_INT
9519 || (GET_CODE (temp) == CONST_DOUBLE && GET_MODE (temp) == VOIDmode)
9520 || GET_CODE (temp) == LABEL_REF)
9522 rtx target = temp == const0_rtx ? if_false_label : if_true_label;
9526 else if (GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
9527 && ! can_compare_p (NE, GET_MODE (temp), ccp_jump))
9528 /* Note swapping the labels gives us not-equal. */
9529 do_jump_by_parts_equality_rtx (temp, if_true_label, if_false_label);
9530 else if (GET_MODE (temp) != VOIDmode)
9531 do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
9532 NE, TREE_UNSIGNED (TREE_TYPE (exp)),
9533 GET_MODE (temp), NULL_RTX,
9534 if_false_label, if_true_label);
9539 if (drop_through_label)
9541 /* If do_jump produces code that might be jumped around,
9542 do any stack adjusts from that code, before the place
9543 where control merges in. */
9544 do_pending_stack_adjust ();
9545 emit_label (drop_through_label);
9549 /* Given a comparison expression EXP for values too wide to be compared
9550 with one insn, test the comparison and jump to the appropriate label.
9551 The code of EXP is ignored; we always test GT if SWAP is 0,
9552 and LT if SWAP is 1. */
9555 do_jump_by_parts_greater (exp, swap, if_false_label, if_true_label)
9558 rtx if_false_label, if_true_label;
9560 rtx op0 = expand_expr (TREE_OPERAND (exp, swap), NULL_RTX, VOIDmode, 0);
9561 rtx op1 = expand_expr (TREE_OPERAND (exp, !swap), NULL_RTX, VOIDmode, 0);
9562 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9563 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
9565 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label);
9568 /* Compare OP0 with OP1, word at a time, in mode MODE.
9569 UNSIGNEDP says to do unsigned comparison.
9570 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
9573 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label)
9574 enum machine_mode mode;
9577 rtx if_false_label, if_true_label;
9579 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9580 rtx drop_through_label = 0;
9583 if (! if_true_label || ! if_false_label)
9584 drop_through_label = gen_label_rtx ();
9585 if (! if_true_label)
9586 if_true_label = drop_through_label;
9587 if (! if_false_label)
9588 if_false_label = drop_through_label;
9590 /* Compare a word at a time, high order first. */
9591 for (i = 0; i < nwords; i++)
9593 rtx op0_word, op1_word;
9595 if (WORDS_BIG_ENDIAN)
9597 op0_word = operand_subword_force (op0, i, mode);
9598 op1_word = operand_subword_force (op1, i, mode);
9602 op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
9603 op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
9606 /* All but high-order word must be compared as unsigned. */
9607 do_compare_rtx_and_jump (op0_word, op1_word, GT,
9608 (unsignedp || i > 0), word_mode, NULL_RTX,
9609 NULL_RTX, if_true_label);
9611 /* Consider lower words only if these are equal. */
9612 do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
9613 NULL_RTX, NULL_RTX, if_false_label);
9617 emit_jump (if_false_label);
9618 if (drop_through_label)
9619 emit_label (drop_through_label);
9622 /* Given an EQ_EXPR expression EXP for values too wide to be compared
9623 with one insn, test the comparison and jump to the appropriate label. */
9626 do_jump_by_parts_equality (exp, if_false_label, if_true_label)
9628 rtx if_false_label, if_true_label;
9630 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
9631 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9632 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9633 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9635 rtx drop_through_label = 0;
9637 if (! if_false_label)
9638 drop_through_label = if_false_label = gen_label_rtx ();
9640 for (i = 0; i < nwords; i++)
9641 do_compare_rtx_and_jump (operand_subword_force (op0, i, mode),
9642 operand_subword_force (op1, i, mode),
9643 EQ, TREE_UNSIGNED (TREE_TYPE (exp)),
9644 word_mode, NULL_RTX, if_false_label, NULL_RTX);
9647 emit_jump (if_true_label);
9648 if (drop_through_label)
9649 emit_label (drop_through_label);
9652 /* Jump according to whether OP0 is 0.
9653 We assume that OP0 has an integer mode that is too wide
9654 for the available compare insns. */
9657 do_jump_by_parts_equality_rtx (op0, if_false_label, if_true_label)
9659 rtx if_false_label, if_true_label;
9661 int nwords = GET_MODE_SIZE (GET_MODE (op0)) / UNITS_PER_WORD;
9664 rtx drop_through_label = 0;
9666 /* The fastest way of doing this comparison on almost any machine is to
9667 "or" all the words and compare the result. If all have to be loaded
9668 from memory and this is a very wide item, it's possible this may
9669 be slower, but that's highly unlikely. */
9671 part = gen_reg_rtx (word_mode);
9672 emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
9673 for (i = 1; i < nwords && part != 0; i++)
9674 part = expand_binop (word_mode, ior_optab, part,
9675 operand_subword_force (op0, i, GET_MODE (op0)),
9676 part, 1, OPTAB_WIDEN);
9680 do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
9681 NULL_RTX, if_false_label, if_true_label);
9686 /* If we couldn't do the "or" simply, do this with a series of compares. */
9687 if (! if_false_label)
9688 drop_through_label = if_false_label = gen_label_rtx ();
9690 for (i = 0; i < nwords; i++)
9691 do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
9692 const0_rtx, EQ, 1, word_mode, NULL_RTX,
9693 if_false_label, NULL_RTX);
9696 emit_jump (if_true_label);
9698 if (drop_through_label)
9699 emit_label (drop_through_label);
9702 /* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
9703 (including code to compute the values to be compared)
9704 and set (CC0) according to the result.
9705 The decision as to signed or unsigned comparison must be made by the caller.
9707 We force a stack adjustment unless there are currently
9708 things pushed on the stack that aren't yet used.
9710 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9714 compare_from_rtx (op0, op1, code, unsignedp, mode, size)
9718 enum machine_mode mode;
9723 /* If one operand is constant, make it the second one. Only do this
9724 if the other operand is not constant as well. */
9726 if (swap_commutative_operands_p (op0, op1))
9731 code = swap_condition (code);
9736 op0 = force_not_mem (op0);
9737 op1 = force_not_mem (op1);
9740 do_pending_stack_adjust ();
9742 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
9743 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
9747 /* There's no need to do this now that combine.c can eliminate lots of
9748 sign extensions. This can be less efficient in certain cases on other
9751 /* If this is a signed equality comparison, we can do it as an
9752 unsigned comparison since zero-extension is cheaper than sign
9753 extension and comparisons with zero are done as unsigned. This is
9754 the case even on machines that can do fast sign extension, since
9755 zero-extension is easier to combine with other operations than
9756 sign-extension is. If we are comparing against a constant, we must
9757 convert it to what it would look like unsigned. */
9758 if ((code == EQ || code == NE) && ! unsignedp
9759 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
9761 if (GET_CODE (op1) == CONST_INT
9762 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
9763 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
9768 emit_cmp_insn (op0, op1, code, size, mode, unsignedp);
9770 return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
9773 /* Like do_compare_and_jump but expects the values to compare as two rtx's.
9774 The decision as to signed or unsigned comparison must be made by the caller.
9776 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9780 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, size,
9781 if_false_label, if_true_label)
9785 enum machine_mode mode;
9787 rtx if_false_label, if_true_label;
9790 int dummy_true_label = 0;
9792 /* Reverse the comparison if that is safe and we want to jump if it is
9794 if (! if_true_label && ! FLOAT_MODE_P (mode))
9796 if_true_label = if_false_label;
9798 code = reverse_condition (code);
9801 /* If one operand is constant, make it the second one. Only do this
9802 if the other operand is not constant as well. */
9804 if (swap_commutative_operands_p (op0, op1))
9809 code = swap_condition (code);
9814 op0 = force_not_mem (op0);
9815 op1 = force_not_mem (op1);
9818 do_pending_stack_adjust ();
9820 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
9821 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
9823 if (tem == const_true_rtx)
9826 emit_jump (if_true_label);
9831 emit_jump (if_false_label);
9837 /* There's no need to do this now that combine.c can eliminate lots of
9838 sign extensions. This can be less efficient in certain cases on other
9841 /* If this is a signed equality comparison, we can do it as an
9842 unsigned comparison since zero-extension is cheaper than sign
9843 extension and comparisons with zero are done as unsigned. This is
9844 the case even on machines that can do fast sign extension, since
9845 zero-extension is easier to combine with other operations than
9846 sign-extension is. If we are comparing against a constant, we must
9847 convert it to what it would look like unsigned. */
9848 if ((code == EQ || code == NE) && ! unsignedp
9849 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
9851 if (GET_CODE (op1) == CONST_INT
9852 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
9853 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
9858 if (! if_true_label)
9860 dummy_true_label = 1;
9861 if_true_label = gen_label_rtx ();
9864 emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp,
9868 emit_jump (if_false_label);
9869 if (dummy_true_label)
9870 emit_label (if_true_label);
9873 /* Generate code for a comparison expression EXP (including code to compute
9874 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
9875 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
9876 generated code will drop through.
9877 SIGNED_CODE should be the rtx operation for this comparison for
9878 signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
9880 We force a stack adjustment unless there are currently
9881 things pushed on the stack that aren't yet used. */
9884 do_compare_and_jump (exp, signed_code, unsigned_code, if_false_label,
9887 enum rtx_code signed_code, unsigned_code;
9888 rtx if_false_label, if_true_label;
9892 enum machine_mode mode;
9896 /* Don't crash if the comparison was erroneous. */
9897 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
9898 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
9901 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9902 if (TREE_CODE (TREE_OPERAND (exp, 1)) == ERROR_MARK)
9905 type = TREE_TYPE (TREE_OPERAND (exp, 0));
9906 mode = TYPE_MODE (type);
9907 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
9908 && (TREE_CODE (TREE_OPERAND (exp, 1)) != INTEGER_CST
9909 || (GET_MODE_BITSIZE (mode)
9910 > GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp,
9913 /* op0 might have been replaced by promoted constant, in which
9914 case the type of second argument should be used. */
9915 type = TREE_TYPE (TREE_OPERAND (exp, 1));
9916 mode = TYPE_MODE (type);
9918 unsignedp = TREE_UNSIGNED (type);
9919 code = unsignedp ? unsigned_code : signed_code;
9921 #ifdef HAVE_canonicalize_funcptr_for_compare
9922 /* If function pointers need to be "canonicalized" before they can
9923 be reliably compared, then canonicalize them. */
9924 if (HAVE_canonicalize_funcptr_for_compare
9925 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
9926 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
9929 rtx new_op0 = gen_reg_rtx (mode);
9931 emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
9935 if (HAVE_canonicalize_funcptr_for_compare
9936 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
9937 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
9940 rtx new_op1 = gen_reg_rtx (mode);
9942 emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
9947 /* Do any postincrements in the expression that was tested. */
9950 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
9952 ? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
9953 if_false_label, if_true_label);
9956 /* Generate code to calculate EXP using a store-flag instruction
9957 and return an rtx for the result. EXP is either a comparison
9958 or a TRUTH_NOT_EXPR whose operand is a comparison.
9960 If TARGET is nonzero, store the result there if convenient.
9962 If ONLY_CHEAP is non-zero, only do this if it is likely to be very
9965 Return zero if there is no suitable set-flag instruction
9966 available on this machine.
9968 Once expand_expr has been called on the arguments of the comparison,
9969 we are committed to doing the store flag, since it is not safe to
9970 re-evaluate the expression. We emit the store-flag insn by calling
9971 emit_store_flag, but only expand the arguments if we have a reason
9972 to believe that emit_store_flag will be successful. If we think that
9973 it will, but it isn't, we have to simulate the store-flag with a
9974 set/jump/set sequence. */
9977 do_store_flag (exp, target, mode, only_cheap)
9980 enum machine_mode mode;
9984 tree arg0, arg1, type;
9986 enum machine_mode operand_mode;
9990 enum insn_code icode;
9991 rtx subtarget = target;
9994 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9995 result at the end. We can't simply invert the test since it would
9996 have already been inverted if it were valid. This case occurs for
9997 some floating-point comparisons. */
9999 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
10000 invert = 1, exp = TREE_OPERAND (exp, 0);
10002 arg0 = TREE_OPERAND (exp, 0);
10003 arg1 = TREE_OPERAND (exp, 1);
10005 /* Don't crash if the comparison was erroneous. */
10006 if (arg0 == error_mark_node || arg1 == error_mark_node)
10009 type = TREE_TYPE (arg0);
10010 operand_mode = TYPE_MODE (type);
10011 unsignedp = TREE_UNSIGNED (type);
10013 /* We won't bother with BLKmode store-flag operations because it would mean
10014 passing a lot of information to emit_store_flag. */
10015 if (operand_mode == BLKmode)
10018 /* We won't bother with store-flag operations involving function pointers
10019 when function pointers must be canonicalized before comparisons. */
10020 #ifdef HAVE_canonicalize_funcptr_for_compare
10021 if (HAVE_canonicalize_funcptr_for_compare
10022 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
10023 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
10025 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
10026 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
10027 == FUNCTION_TYPE))))
10034 /* Get the rtx comparison code to use. We know that EXP is a comparison
10035 operation of some type. Some comparisons against 1 and -1 can be
10036 converted to comparisons with zero. Do so here so that the tests
10037 below will be aware that we have a comparison with zero. These
10038 tests will not catch constants in the first operand, but constants
10039 are rarely passed as the first operand. */
10041 switch (TREE_CODE (exp))
10050 if (integer_onep (arg1))
10051 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10053 code = unsignedp ? LTU : LT;
10056 if (! unsignedp && integer_all_onesp (arg1))
10057 arg1 = integer_zero_node, code = LT;
10059 code = unsignedp ? LEU : LE;
10062 if (! unsignedp && integer_all_onesp (arg1))
10063 arg1 = integer_zero_node, code = GE;
10065 code = unsignedp ? GTU : GT;
10068 if (integer_onep (arg1))
10069 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10071 code = unsignedp ? GEU : GE;
10074 case UNORDERED_EXPR:
10100 /* Put a constant second. */
10101 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
10103 tem = arg0; arg0 = arg1; arg1 = tem;
10104 code = swap_condition (code);
10107 /* If this is an equality or inequality test of a single bit, we can
10108 do this by shifting the bit being tested to the low-order bit and
10109 masking the result with the constant 1. If the condition was EQ,
10110 we xor it with 1. This does not require an scc insn and is faster
10111 than an scc insn even if we have it. */
10113 if ((code == NE || code == EQ)
10114 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10115 && integer_pow2p (TREE_OPERAND (arg0, 1)))
10117 tree inner = TREE_OPERAND (arg0, 0);
10118 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
10121 /* If INNER is a right shift of a constant and it plus BITNUM does
10122 not overflow, adjust BITNUM and INNER. */
10124 if (TREE_CODE (inner) == RSHIFT_EXPR
10125 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
10126 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
10127 && bitnum < TYPE_PRECISION (type)
10128 && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
10129 bitnum - TYPE_PRECISION (type)))
10131 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
10132 inner = TREE_OPERAND (inner, 0);
10135 /* If we are going to be able to omit the AND below, we must do our
10136 operations as unsigned. If we must use the AND, we have a choice.
10137 Normally unsigned is faster, but for some machines signed is. */
10138 ops_unsignedp = (bitnum == TYPE_PRECISION (type) - 1 ? 1
10139 #ifdef LOAD_EXTEND_OP
10140 : (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND ? 0 : 1)
10146 if (! get_subtarget (subtarget)
10147 || GET_MODE (subtarget) != operand_mode
10148 || ! safe_from_p (subtarget, inner, 1))
10151 op0 = expand_expr (inner, subtarget, VOIDmode, 0);
10154 op0 = expand_shift (RSHIFT_EXPR, operand_mode, op0,
10155 size_int (bitnum), subtarget, ops_unsignedp);
10157 if (GET_MODE (op0) != mode)
10158 op0 = convert_to_mode (mode, op0, ops_unsignedp);
10160 if ((code == EQ && ! invert) || (code == NE && invert))
10161 op0 = expand_binop (mode, xor_optab, op0, const1_rtx, subtarget,
10162 ops_unsignedp, OPTAB_LIB_WIDEN);
10164 /* Put the AND last so it can combine with more things. */
10165 if (bitnum != TYPE_PRECISION (type) - 1)
10166 op0 = expand_and (op0, const1_rtx, subtarget);
10171 /* Now see if we are likely to be able to do this. Return if not. */
10172 if (! can_compare_p (code, operand_mode, ccp_store_flag))
10175 icode = setcc_gen_code[(int) code];
10176 if (icode == CODE_FOR_nothing
10177 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
10179 /* We can only do this if it is one of the special cases that
10180 can be handled without an scc insn. */
10181 if ((code == LT && integer_zerop (arg1))
10182 || (! only_cheap && code == GE && integer_zerop (arg1)))
10184 else if (BRANCH_COST >= 0
10185 && ! only_cheap && (code == NE || code == EQ)
10186 && TREE_CODE (type) != REAL_TYPE
10187 && ((abs_optab->handlers[(int) operand_mode].insn_code
10188 != CODE_FOR_nothing)
10189 || (ffs_optab->handlers[(int) operand_mode].insn_code
10190 != CODE_FOR_nothing)))
10196 if (! get_subtarget (target)
10197 || GET_MODE (subtarget) != operand_mode
10198 || ! safe_from_p (subtarget, arg1, 1))
10201 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
10202 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
10205 target = gen_reg_rtx (mode);
10207 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10208 because, if the emit_store_flag does anything it will succeed and
10209 OP0 and OP1 will not be used subsequently. */
10211 result = emit_store_flag (target, code,
10212 queued_subexp_p (op0) ? copy_rtx (op0) : op0,
10213 queued_subexp_p (op1) ? copy_rtx (op1) : op1,
10214 operand_mode, unsignedp, 1);
10219 result = expand_binop (mode, xor_optab, result, const1_rtx,
10220 result, 0, OPTAB_LIB_WIDEN);
10224 /* If this failed, we have to do this with set/compare/jump/set code. */
10225 if (GET_CODE (target) != REG
10226 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
10227 target = gen_reg_rtx (GET_MODE (target));
10229 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
10230 result = compare_from_rtx (op0, op1, code, unsignedp,
10231 operand_mode, NULL_RTX);
10232 if (GET_CODE (result) == CONST_INT)
10233 return (((result == const0_rtx && ! invert)
10234 || (result != const0_rtx && invert))
10235 ? const0_rtx : const1_rtx);
10237 label = gen_label_rtx ();
10238 if (bcc_gen_fctn[(int) code] == 0)
10241 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
10242 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
10243 emit_label (label);
10249 /* Stubs in case we haven't got a casesi insn. */
10250 #ifndef HAVE_casesi
10251 # define HAVE_casesi 0
10252 # define gen_casesi(a, b, c, d, e) (0)
10253 # define CODE_FOR_casesi CODE_FOR_nothing
10256 /* If the machine does not have a case insn that compares the bounds,
10257 this means extra overhead for dispatch tables, which raises the
10258 threshold for using them. */
10259 #ifndef CASE_VALUES_THRESHOLD
10260 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
10261 #endif /* CASE_VALUES_THRESHOLD */
10264 case_values_threshold ()
10266 return CASE_VALUES_THRESHOLD;
10269 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10270 0 otherwise (i.e. if there is no casesi instruction). */
10272 try_casesi (index_type, index_expr, minval, range,
10273 table_label, default_label)
10274 tree index_type, index_expr, minval, range;
10275 rtx table_label ATTRIBUTE_UNUSED;
10278 enum machine_mode index_mode = SImode;
10279 int index_bits = GET_MODE_BITSIZE (index_mode);
10280 rtx op1, op2, index;
10281 enum machine_mode op_mode;
10286 /* Convert the index to SImode. */
10287 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10289 enum machine_mode omode = TYPE_MODE (index_type);
10290 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
10292 /* We must handle the endpoints in the original mode. */
10293 index_expr = build (MINUS_EXPR, index_type,
10294 index_expr, minval);
10295 minval = integer_zero_node;
10296 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10297 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10298 omode, 1, default_label);
10299 /* Now we can safely truncate. */
10300 index = convert_to_mode (index_mode, index, 0);
10304 if (TYPE_MODE (index_type) != index_mode)
10306 index_expr = convert (type_for_size (index_bits, 0),
10308 index_type = TREE_TYPE (index_expr);
10311 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10314 index = protect_from_queue (index, 0);
10315 do_pending_stack_adjust ();
10317 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10318 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10320 index = copy_to_mode_reg (op_mode, index);
10322 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
10324 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10325 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10326 op1, TREE_UNSIGNED (TREE_TYPE (minval)));
10327 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10329 op1 = copy_to_mode_reg (op_mode, op1);
10331 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
10333 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10334 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10335 op2, TREE_UNSIGNED (TREE_TYPE (range)));
10336 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10338 op2 = copy_to_mode_reg (op_mode, op2);
10340 emit_jump_insn (gen_casesi (index, op1, op2,
10341 table_label, default_label));
10345 /* Attempt to generate a tablejump instruction; same concept. */
10346 #ifndef HAVE_tablejump
10347 #define HAVE_tablejump 0
10348 #define gen_tablejump(x, y) (0)
10351 /* Subroutine of the next function.
10353 INDEX is the value being switched on, with the lowest value
10354 in the table already subtracted.
10355 MODE is its expected mode (needed if INDEX is constant).
10356 RANGE is the length of the jump table.
10357 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10359 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10360 index value is out of range. */
10363 do_tablejump (index, mode, range, table_label, default_label)
10364 rtx index, range, table_label, default_label;
10365 enum machine_mode mode;
10369 /* Do an unsigned comparison (in the proper mode) between the index
10370 expression and the value which represents the length of the range.
10371 Since we just finished subtracting the lower bound of the range
10372 from the index expression, this comparison allows us to simultaneously
10373 check that the original index expression value is both greater than
10374 or equal to the minimum value of the range and less than or equal to
10375 the maximum value of the range. */
10377 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10380 /* If index is in range, it must fit in Pmode.
10381 Convert to Pmode so we can index with it. */
10383 index = convert_to_mode (Pmode, index, 1);
10385 /* Don't let a MEM slip thru, because then INDEX that comes
10386 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10387 and break_out_memory_refs will go to work on it and mess it up. */
10388 #ifdef PIC_CASE_VECTOR_ADDRESS
10389 if (flag_pic && GET_CODE (index) != REG)
10390 index = copy_to_mode_reg (Pmode, index);
10393 /* If flag_force_addr were to affect this address
10394 it could interfere with the tricky assumptions made
10395 about addresses that contain label-refs,
10396 which may be valid only very near the tablejump itself. */
10397 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10398 GET_MODE_SIZE, because this indicates how large insns are. The other
10399 uses should all be Pmode, because they are addresses. This code
10400 could fail if addresses and insns are not the same size. */
10401 index = gen_rtx_PLUS (Pmode,
10402 gen_rtx_MULT (Pmode, index,
10403 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10404 gen_rtx_LABEL_REF (Pmode, table_label));
10405 #ifdef PIC_CASE_VECTOR_ADDRESS
10407 index = PIC_CASE_VECTOR_ADDRESS (index);
10410 index = memory_address_noforce (CASE_VECTOR_MODE, index);
10411 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10412 vector = gen_rtx_MEM (CASE_VECTOR_MODE, index);
10413 RTX_UNCHANGING_P (vector) = 1;
10414 convert_move (temp, vector, 0);
10416 emit_jump_insn (gen_tablejump (temp, table_label));
10418 /* If we are generating PIC code or if the table is PC-relative, the
10419 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10420 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10425 try_tablejump (index_type, index_expr, minval, range,
10426 table_label, default_label)
10427 tree index_type, index_expr, minval, range;
10428 rtx table_label, default_label;
10432 if (! HAVE_tablejump)
10435 index_expr = fold (build (MINUS_EXPR, index_type,
10436 convert (index_type, index_expr),
10437 convert (index_type, minval)));
10438 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
10440 index = protect_from_queue (index, 0);
10441 do_pending_stack_adjust ();
10443 do_tablejump (index, TYPE_MODE (index_type),
10444 convert_modes (TYPE_MODE (index_type),
10445 TYPE_MODE (TREE_TYPE (range)),
10446 expand_expr (range, NULL_RTX,
10448 TREE_UNSIGNED (TREE_TYPE (range))),
10449 table_label, default_label);