1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
30 #include "hard-reg-set.h"
33 #include "insn-flags.h"
34 #include "insn-codes.h"
35 #include "insn-config.h"
36 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
40 #include "typeclass.h"
46 #define CEIL(x,y) (((x) + (y) - 1) / (y))
48 /* Decide whether a function's arguments should be processed
49 from first to last or from last to first.
51 They should if the stack and args grow in opposite directions, but
52 only if we have push insns. */
56 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
57 #define PUSH_ARGS_REVERSED /* If it's last to first */
62 #ifndef STACK_PUSH_CODE
63 #ifdef STACK_GROWS_DOWNWARD
64 #define STACK_PUSH_CODE PRE_DEC
66 #define STACK_PUSH_CODE PRE_INC
70 /* Assume that case vectors are not pc-relative. */
71 #ifndef CASE_VECTOR_PC_RELATIVE
72 #define CASE_VECTOR_PC_RELATIVE 0
75 /* If this is nonzero, we do not bother generating VOLATILE
76 around volatile memory references, and we are willing to
77 output indirect addresses. If cse is to follow, we reject
78 indirect addresses so a useful potential cse is generated;
79 if it is used only once, instruction combination will produce
80 the same indirect address eventually. */
83 /* Nonzero to generate code for all the subroutines within an
84 expression before generating the upper levels of the expression.
85 Nowadays this is never zero. */
86 int do_preexpand_calls = 1;
88 /* Don't check memory usage, since code is being emitted to check a memory
89 usage. Used when current_function_check_memory_usage is true, to avoid
90 infinite recursion. */
91 static int in_check_memory_usage;
93 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
94 static tree placeholder_list = 0;
96 /* This structure is used by move_by_pieces to describe the move to
109 int explicit_inc_from;
117 /* This structure is used by clear_by_pieces to describe the clear to
120 struct clear_by_pieces
132 extern struct obstack permanent_obstack;
134 static rtx get_push_address PROTO ((int));
136 static rtx enqueue_insn PROTO((rtx, rtx));
137 static int move_by_pieces_ninsns PROTO((unsigned int, int));
138 static void move_by_pieces_1 PROTO((rtx (*) (rtx, ...), enum machine_mode,
139 struct move_by_pieces *));
140 static void clear_by_pieces PROTO((rtx, int, int));
141 static void clear_by_pieces_1 PROTO((rtx (*) (rtx, ...),
143 struct clear_by_pieces *));
144 static int is_zeros_p PROTO((tree));
145 static int mostly_zeros_p PROTO((tree));
146 static void store_constructor_field PROTO((rtx, int, int, enum machine_mode,
147 tree, tree, int, int));
148 static void store_constructor PROTO((tree, rtx, int, int));
149 static rtx store_field PROTO((rtx, int, int, enum machine_mode, tree,
150 enum machine_mode, int, int,
152 static enum memory_use_mode
153 get_memory_usage_from_modifier PROTO((enum expand_modifier));
154 static tree save_noncopied_parts PROTO((tree, tree));
155 static tree init_noncopied_parts PROTO((tree, tree));
156 static int safe_from_p PROTO((rtx, tree, int));
157 static int fixed_type_p PROTO((tree));
158 static rtx var_rtx PROTO((tree));
159 static int readonly_fields_p PROTO((tree));
160 static rtx expand_expr_unaligned PROTO((tree, int *));
161 static rtx expand_increment PROTO((tree, int, int));
162 static void preexpand_calls PROTO((tree));
163 static void do_jump_by_parts_greater PROTO((tree, int, rtx, rtx));
164 static void do_jump_by_parts_equality PROTO((tree, rtx, rtx));
165 static void do_compare_and_jump PROTO((tree, enum rtx_code, enum rtx_code, rtx, rtx));
166 static rtx do_store_flag PROTO((tree, rtx, enum machine_mode, int));
168 /* Record for each mode whether we can move a register directly to or
169 from an object of that mode in memory. If we can't, we won't try
170 to use that mode directly when accessing a field of that mode. */
172 static char direct_load[NUM_MACHINE_MODES];
173 static char direct_store[NUM_MACHINE_MODES];
175 /* If a memory-to-memory move would take MOVE_RATIO or more simple
176 move-instruction sequences, we will do a movstr or libcall instead. */
179 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
182 /* If we are optimizing for space (-Os), cut down the default move ratio */
183 #define MOVE_RATIO (optimize_size ? 3 : 15)
187 /* This macro is used to determine whether move_by_pieces should be called
188 to perform a structure copy. */
189 #ifndef MOVE_BY_PIECES_P
190 #define MOVE_BY_PIECES_P(SIZE, ALIGN) (move_by_pieces_ninsns \
191 (SIZE, ALIGN) < MOVE_RATIO)
194 /* This array records the insn_code of insns to perform block moves. */
195 enum insn_code movstr_optab[NUM_MACHINE_MODES];
197 /* This array records the insn_code of insns to perform block clears. */
198 enum insn_code clrstr_optab[NUM_MACHINE_MODES];
200 /* SLOW_UNALIGNED_ACCESS is non-zero if unaligned accesses are very slow. */
202 #ifndef SLOW_UNALIGNED_ACCESS
203 #define SLOW_UNALIGNED_ACCESS STRICT_ALIGNMENT
206 /* This is run once per compilation to set up which modes can be used
207 directly in memory and to initialize the block move optab. */
213 enum machine_mode mode;
220 /* Since we are on the permanent obstack, we must be sure we save this
221 spot AFTER we call start_sequence, since it will reuse the rtl it
223 free_point = (char *) oballoc (0);
225 /* Try indexing by frame ptr and try by stack ptr.
226 It is known that on the Convex the stack ptr isn't a valid index.
227 With luck, one or the other is valid on any machine. */
228 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
229 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
231 insn = emit_insn (gen_rtx_SET (0, NULL_RTX, NULL_RTX));
232 pat = PATTERN (insn);
234 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
235 mode = (enum machine_mode) ((int) mode + 1))
240 direct_load[(int) mode] = direct_store[(int) mode] = 0;
241 PUT_MODE (mem, mode);
242 PUT_MODE (mem1, mode);
244 /* See if there is some register that can be used in this mode and
245 directly loaded or stored from memory. */
247 if (mode != VOIDmode && mode != BLKmode)
248 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
249 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
252 if (! HARD_REGNO_MODE_OK (regno, mode))
255 reg = gen_rtx_REG (mode, regno);
258 SET_DEST (pat) = reg;
259 if (recog (pat, insn, &num_clobbers) >= 0)
260 direct_load[(int) mode] = 1;
262 SET_SRC (pat) = mem1;
263 SET_DEST (pat) = reg;
264 if (recog (pat, insn, &num_clobbers) >= 0)
265 direct_load[(int) mode] = 1;
268 SET_DEST (pat) = mem;
269 if (recog (pat, insn, &num_clobbers) >= 0)
270 direct_store[(int) mode] = 1;
273 SET_DEST (pat) = mem1;
274 if (recog (pat, insn, &num_clobbers) >= 0)
275 direct_store[(int) mode] = 1;
283 /* This is run at the start of compiling a function. */
288 current_function->expr
289 = (struct expr_status *) xmalloc (sizeof (struct expr_status));
292 pending_stack_adjust = 0;
293 inhibit_defer_pop = 0;
295 apply_args_value = 0;
301 struct expr_status *p;
306 ggc_mark_rtx (p->x_saveregs_value);
307 ggc_mark_rtx (p->x_apply_args_value);
308 ggc_mark_rtx (p->x_forced_labels);
319 /* Small sanity check that the queue is empty at the end of a function. */
321 finish_expr_for_function ()
327 /* Manage the queue of increment instructions to be output
328 for POSTINCREMENT_EXPR expressions, etc. */
330 /* Queue up to increment (or change) VAR later. BODY says how:
331 BODY should be the same thing you would pass to emit_insn
332 to increment right away. It will go to emit_insn later on.
334 The value is a QUEUED expression to be used in place of VAR
335 where you want to guarantee the pre-incrementation value of VAR. */
338 enqueue_insn (var, body)
341 pending_chain = gen_rtx_QUEUED (GET_MODE (var), var, NULL_RTX, NULL_RTX,
342 body, pending_chain);
343 return pending_chain;
346 /* Use protect_from_queue to convert a QUEUED expression
347 into something that you can put immediately into an instruction.
348 If the queued incrementation has not happened yet,
349 protect_from_queue returns the variable itself.
350 If the incrementation has happened, protect_from_queue returns a temp
351 that contains a copy of the old value of the variable.
353 Any time an rtx which might possibly be a QUEUED is to be put
354 into an instruction, it must be passed through protect_from_queue first.
355 QUEUED expressions are not meaningful in instructions.
357 Do not pass a value through protect_from_queue and then hold
358 on to it for a while before putting it in an instruction!
359 If the queue is flushed in between, incorrect code will result. */
362 protect_from_queue (x, modify)
366 register RTX_CODE code = GET_CODE (x);
368 #if 0 /* A QUEUED can hang around after the queue is forced out. */
369 /* Shortcut for most common case. */
370 if (pending_chain == 0)
376 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
377 use of autoincrement. Make a copy of the contents of the memory
378 location rather than a copy of the address, but not if the value is
379 of mode BLKmode. Don't modify X in place since it might be
381 if (code == MEM && GET_MODE (x) != BLKmode
382 && GET_CODE (XEXP (x, 0)) == QUEUED && !modify)
384 register rtx y = XEXP (x, 0);
385 register rtx new = gen_rtx_MEM (GET_MODE (x), QUEUED_VAR (y));
387 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (x);
388 MEM_COPY_ATTRIBUTES (new, x);
389 MEM_ALIAS_SET (new) = MEM_ALIAS_SET (x);
393 register rtx temp = gen_reg_rtx (GET_MODE (new));
394 emit_insn_before (gen_move_insn (temp, new),
400 /* Otherwise, recursively protect the subexpressions of all
401 the kinds of rtx's that can contain a QUEUED. */
404 rtx tem = protect_from_queue (XEXP (x, 0), 0);
405 if (tem != XEXP (x, 0))
411 else if (code == PLUS || code == MULT)
413 rtx new0 = protect_from_queue (XEXP (x, 0), 0);
414 rtx new1 = protect_from_queue (XEXP (x, 1), 0);
415 if (new0 != XEXP (x, 0) || new1 != XEXP (x, 1))
424 /* If the increment has not happened, use the variable itself. */
425 if (QUEUED_INSN (x) == 0)
426 return QUEUED_VAR (x);
427 /* If the increment has happened and a pre-increment copy exists,
429 if (QUEUED_COPY (x) != 0)
430 return QUEUED_COPY (x);
431 /* The increment has happened but we haven't set up a pre-increment copy.
432 Set one up now, and use it. */
433 QUEUED_COPY (x) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x)));
434 emit_insn_before (gen_move_insn (QUEUED_COPY (x), QUEUED_VAR (x)),
436 return QUEUED_COPY (x);
439 /* Return nonzero if X contains a QUEUED expression:
440 if it contains anything that will be altered by a queued increment.
441 We handle only combinations of MEM, PLUS, MINUS and MULT operators
442 since memory addresses generally contain only those. */
448 register enum rtx_code code = GET_CODE (x);
454 return queued_subexp_p (XEXP (x, 0));
458 return (queued_subexp_p (XEXP (x, 0))
459 || queued_subexp_p (XEXP (x, 1)));
465 /* Perform all the pending incrementations. */
471 while ((p = pending_chain))
473 rtx body = QUEUED_BODY (p);
475 if (GET_CODE (body) == SEQUENCE)
477 QUEUED_INSN (p) = XVECEXP (QUEUED_BODY (p), 0, 0);
478 emit_insn (QUEUED_BODY (p));
481 QUEUED_INSN (p) = emit_insn (QUEUED_BODY (p));
482 pending_chain = QUEUED_NEXT (p);
486 /* Copy data from FROM to TO, where the machine modes are not the same.
487 Both modes may be integer, or both may be floating.
488 UNSIGNEDP should be nonzero if FROM is an unsigned type.
489 This causes zero-extension instead of sign-extension. */
492 convert_move (to, from, unsignedp)
493 register rtx to, from;
496 enum machine_mode to_mode = GET_MODE (to);
497 enum machine_mode from_mode = GET_MODE (from);
498 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
499 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
503 /* rtx code for making an equivalent value. */
504 enum rtx_code equiv_code = (unsignedp ? ZERO_EXTEND : SIGN_EXTEND);
506 to = protect_from_queue (to, 1);
507 from = protect_from_queue (from, 0);
509 if (to_real != from_real)
512 /* If FROM is a SUBREG that indicates that we have already done at least
513 the required extension, strip it. We don't handle such SUBREGs as
516 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
517 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
518 >= GET_MODE_SIZE (to_mode))
519 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
520 from = gen_lowpart (to_mode, from), from_mode = to_mode;
522 if (GET_CODE (to) == SUBREG && SUBREG_PROMOTED_VAR_P (to))
525 if (to_mode == from_mode
526 || (from_mode == VOIDmode && CONSTANT_P (from)))
528 emit_move_insn (to, from);
536 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode))
538 /* Try converting directly if the insn is supported. */
539 if ((code = can_extend_p (to_mode, from_mode, 0))
542 emit_unop_insn (code, to, from, UNKNOWN);
547 #ifdef HAVE_trunchfqf2
548 if (HAVE_trunchfqf2 && from_mode == HFmode && to_mode == QFmode)
550 emit_unop_insn (CODE_FOR_trunchfqf2, to, from, UNKNOWN);
554 #ifdef HAVE_trunctqfqf2
555 if (HAVE_trunctqfqf2 && from_mode == TQFmode && to_mode == QFmode)
557 emit_unop_insn (CODE_FOR_trunctqfqf2, to, from, UNKNOWN);
561 #ifdef HAVE_truncsfqf2
562 if (HAVE_truncsfqf2 && from_mode == SFmode && to_mode == QFmode)
564 emit_unop_insn (CODE_FOR_truncsfqf2, to, from, UNKNOWN);
568 #ifdef HAVE_truncdfqf2
569 if (HAVE_truncdfqf2 && from_mode == DFmode && to_mode == QFmode)
571 emit_unop_insn (CODE_FOR_truncdfqf2, to, from, UNKNOWN);
575 #ifdef HAVE_truncxfqf2
576 if (HAVE_truncxfqf2 && from_mode == XFmode && to_mode == QFmode)
578 emit_unop_insn (CODE_FOR_truncxfqf2, to, from, UNKNOWN);
582 #ifdef HAVE_trunctfqf2
583 if (HAVE_trunctfqf2 && from_mode == TFmode && to_mode == QFmode)
585 emit_unop_insn (CODE_FOR_trunctfqf2, to, from, UNKNOWN);
590 #ifdef HAVE_trunctqfhf2
591 if (HAVE_trunctqfhf2 && from_mode == TQFmode && to_mode == HFmode)
593 emit_unop_insn (CODE_FOR_trunctqfhf2, to, from, UNKNOWN);
597 #ifdef HAVE_truncsfhf2
598 if (HAVE_truncsfhf2 && from_mode == SFmode && to_mode == HFmode)
600 emit_unop_insn (CODE_FOR_truncsfhf2, to, from, UNKNOWN);
604 #ifdef HAVE_truncdfhf2
605 if (HAVE_truncdfhf2 && from_mode == DFmode && to_mode == HFmode)
607 emit_unop_insn (CODE_FOR_truncdfhf2, to, from, UNKNOWN);
611 #ifdef HAVE_truncxfhf2
612 if (HAVE_truncxfhf2 && from_mode == XFmode && to_mode == HFmode)
614 emit_unop_insn (CODE_FOR_truncxfhf2, to, from, UNKNOWN);
618 #ifdef HAVE_trunctfhf2
619 if (HAVE_trunctfhf2 && from_mode == TFmode && to_mode == HFmode)
621 emit_unop_insn (CODE_FOR_trunctfhf2, to, from, UNKNOWN);
626 #ifdef HAVE_truncsftqf2
627 if (HAVE_truncsftqf2 && from_mode == SFmode && to_mode == TQFmode)
629 emit_unop_insn (CODE_FOR_truncsftqf2, to, from, UNKNOWN);
633 #ifdef HAVE_truncdftqf2
634 if (HAVE_truncdftqf2 && from_mode == DFmode && to_mode == TQFmode)
636 emit_unop_insn (CODE_FOR_truncdftqf2, to, from, UNKNOWN);
640 #ifdef HAVE_truncxftqf2
641 if (HAVE_truncxftqf2 && from_mode == XFmode && to_mode == TQFmode)
643 emit_unop_insn (CODE_FOR_truncxftqf2, to, from, UNKNOWN);
647 #ifdef HAVE_trunctftqf2
648 if (HAVE_trunctftqf2 && from_mode == TFmode && to_mode == TQFmode)
650 emit_unop_insn (CODE_FOR_trunctftqf2, to, from, UNKNOWN);
655 #ifdef HAVE_truncdfsf2
656 if (HAVE_truncdfsf2 && from_mode == DFmode && to_mode == SFmode)
658 emit_unop_insn (CODE_FOR_truncdfsf2, to, from, UNKNOWN);
662 #ifdef HAVE_truncxfsf2
663 if (HAVE_truncxfsf2 && from_mode == XFmode && to_mode == SFmode)
665 emit_unop_insn (CODE_FOR_truncxfsf2, to, from, UNKNOWN);
669 #ifdef HAVE_trunctfsf2
670 if (HAVE_trunctfsf2 && from_mode == TFmode && to_mode == SFmode)
672 emit_unop_insn (CODE_FOR_trunctfsf2, to, from, UNKNOWN);
676 #ifdef HAVE_truncxfdf2
677 if (HAVE_truncxfdf2 && from_mode == XFmode && to_mode == DFmode)
679 emit_unop_insn (CODE_FOR_truncxfdf2, to, from, UNKNOWN);
683 #ifdef HAVE_trunctfdf2
684 if (HAVE_trunctfdf2 && from_mode == TFmode && to_mode == DFmode)
686 emit_unop_insn (CODE_FOR_trunctfdf2, to, from, UNKNOWN);
698 libcall = extendsfdf2_libfunc;
702 libcall = extendsfxf2_libfunc;
706 libcall = extendsftf2_libfunc;
718 libcall = truncdfsf2_libfunc;
722 libcall = extenddfxf2_libfunc;
726 libcall = extenddftf2_libfunc;
738 libcall = truncxfsf2_libfunc;
742 libcall = truncxfdf2_libfunc;
754 libcall = trunctfsf2_libfunc;
758 libcall = trunctfdf2_libfunc;
770 if (libcall == (rtx) 0)
771 /* This conversion is not implemented yet. */
774 value = emit_library_call_value (libcall, NULL_RTX, 1, to_mode,
776 emit_move_insn (to, value);
780 /* Now both modes are integers. */
782 /* Handle expanding beyond a word. */
783 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
784 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
791 enum machine_mode lowpart_mode;
792 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
794 /* Try converting directly if the insn is supported. */
795 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
798 /* If FROM is a SUBREG, put it into a register. Do this
799 so that we always generate the same set of insns for
800 better cse'ing; if an intermediate assignment occurred,
801 we won't be doing the operation directly on the SUBREG. */
802 if (optimize > 0 && GET_CODE (from) == SUBREG)
803 from = force_reg (from_mode, from);
804 emit_unop_insn (code, to, from, equiv_code);
807 /* Next, try converting via full word. */
808 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
809 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
810 != CODE_FOR_nothing))
812 if (GET_CODE (to) == REG)
813 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
814 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
815 emit_unop_insn (code, to,
816 gen_lowpart (word_mode, to), equiv_code);
820 /* No special multiword conversion insn; do it by hand. */
823 /* Since we will turn this into a no conflict block, we must ensure
824 that the source does not overlap the target. */
826 if (reg_overlap_mentioned_p (to, from))
827 from = force_reg (from_mode, from);
829 /* Get a copy of FROM widened to a word, if necessary. */
830 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
831 lowpart_mode = word_mode;
833 lowpart_mode = from_mode;
835 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
837 lowpart = gen_lowpart (lowpart_mode, to);
838 emit_move_insn (lowpart, lowfrom);
840 /* Compute the value to put in each remaining word. */
842 fill_value = const0_rtx;
847 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
848 && STORE_FLAG_VALUE == -1)
850 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
852 fill_value = gen_reg_rtx (word_mode);
853 emit_insn (gen_slt (fill_value));
859 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
860 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
862 fill_value = convert_to_mode (word_mode, fill_value, 1);
866 /* Fill the remaining words. */
867 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
869 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
870 rtx subword = operand_subword (to, index, 1, to_mode);
875 if (fill_value != subword)
876 emit_move_insn (subword, fill_value);
879 insns = get_insns ();
882 emit_no_conflict_block (insns, to, from, NULL_RTX,
883 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
887 /* Truncating multi-word to a word or less. */
888 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
889 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
891 if (!((GET_CODE (from) == MEM
892 && ! MEM_VOLATILE_P (from)
893 && direct_load[(int) to_mode]
894 && ! mode_dependent_address_p (XEXP (from, 0)))
895 || GET_CODE (from) == REG
896 || GET_CODE (from) == SUBREG))
897 from = force_reg (from_mode, from);
898 convert_move (to, gen_lowpart (word_mode, from), 0);
902 /* Handle pointer conversion */ /* SPEE 900220 */
903 if (to_mode == PQImode)
905 if (from_mode != QImode)
906 from = convert_to_mode (QImode, from, unsignedp);
908 #ifdef HAVE_truncqipqi2
909 if (HAVE_truncqipqi2)
911 emit_unop_insn (CODE_FOR_truncqipqi2, to, from, UNKNOWN);
914 #endif /* HAVE_truncqipqi2 */
918 if (from_mode == PQImode)
920 if (to_mode != QImode)
922 from = convert_to_mode (QImode, from, unsignedp);
927 #ifdef HAVE_extendpqiqi2
928 if (HAVE_extendpqiqi2)
930 emit_unop_insn (CODE_FOR_extendpqiqi2, to, from, UNKNOWN);
933 #endif /* HAVE_extendpqiqi2 */
938 if (to_mode == PSImode)
940 if (from_mode != SImode)
941 from = convert_to_mode (SImode, from, unsignedp);
943 #ifdef HAVE_truncsipsi2
944 if (HAVE_truncsipsi2)
946 emit_unop_insn (CODE_FOR_truncsipsi2, to, from, UNKNOWN);
949 #endif /* HAVE_truncsipsi2 */
953 if (from_mode == PSImode)
955 if (to_mode != SImode)
957 from = convert_to_mode (SImode, from, unsignedp);
962 #ifdef HAVE_extendpsisi2
963 if (HAVE_extendpsisi2)
965 emit_unop_insn (CODE_FOR_extendpsisi2, to, from, UNKNOWN);
968 #endif /* HAVE_extendpsisi2 */
973 if (to_mode == PDImode)
975 if (from_mode != DImode)
976 from = convert_to_mode (DImode, from, unsignedp);
978 #ifdef HAVE_truncdipdi2
979 if (HAVE_truncdipdi2)
981 emit_unop_insn (CODE_FOR_truncdipdi2, to, from, UNKNOWN);
984 #endif /* HAVE_truncdipdi2 */
988 if (from_mode == PDImode)
990 if (to_mode != DImode)
992 from = convert_to_mode (DImode, from, unsignedp);
997 #ifdef HAVE_extendpdidi2
998 if (HAVE_extendpdidi2)
1000 emit_unop_insn (CODE_FOR_extendpdidi2, to, from, UNKNOWN);
1003 #endif /* HAVE_extendpdidi2 */
1008 /* Now follow all the conversions between integers
1009 no more than a word long. */
1011 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1012 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
1013 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1014 GET_MODE_BITSIZE (from_mode)))
1016 if (!((GET_CODE (from) == MEM
1017 && ! MEM_VOLATILE_P (from)
1018 && direct_load[(int) to_mode]
1019 && ! mode_dependent_address_p (XEXP (from, 0)))
1020 || GET_CODE (from) == REG
1021 || GET_CODE (from) == SUBREG))
1022 from = force_reg (from_mode, from);
1023 if (GET_CODE (from) == REG && REGNO (from) < FIRST_PSEUDO_REGISTER
1024 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
1025 from = copy_to_reg (from);
1026 emit_move_insn (to, gen_lowpart (to_mode, from));
1030 /* Handle extension. */
1031 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
1033 /* Convert directly if that works. */
1034 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
1035 != CODE_FOR_nothing)
1037 emit_unop_insn (code, to, from, equiv_code);
1042 enum machine_mode intermediate;
1046 /* Search for a mode to convert via. */
1047 for (intermediate = from_mode; intermediate != VOIDmode;
1048 intermediate = GET_MODE_WIDER_MODE (intermediate))
1049 if (((can_extend_p (to_mode, intermediate, unsignedp)
1050 != CODE_FOR_nothing)
1051 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
1052 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
1053 GET_MODE_BITSIZE (intermediate))))
1054 && (can_extend_p (intermediate, from_mode, unsignedp)
1055 != CODE_FOR_nothing))
1057 convert_move (to, convert_to_mode (intermediate, from,
1058 unsignedp), unsignedp);
1062 /* No suitable intermediate mode.
1063 Generate what we need with shifts. */
1064 shift_amount = build_int_2 (GET_MODE_BITSIZE (to_mode)
1065 - GET_MODE_BITSIZE (from_mode), 0);
1066 from = gen_lowpart (to_mode, force_reg (from_mode, from));
1067 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
1069 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
1072 emit_move_insn (to, tmp);
1077 /* Support special truncate insns for certain modes. */
1079 if (from_mode == DImode && to_mode == SImode)
1081 #ifdef HAVE_truncdisi2
1082 if (HAVE_truncdisi2)
1084 emit_unop_insn (CODE_FOR_truncdisi2, to, from, UNKNOWN);
1088 convert_move (to, force_reg (from_mode, from), unsignedp);
1092 if (from_mode == DImode && to_mode == HImode)
1094 #ifdef HAVE_truncdihi2
1095 if (HAVE_truncdihi2)
1097 emit_unop_insn (CODE_FOR_truncdihi2, to, from, UNKNOWN);
1101 convert_move (to, force_reg (from_mode, from), unsignedp);
1105 if (from_mode == DImode && to_mode == QImode)
1107 #ifdef HAVE_truncdiqi2
1108 if (HAVE_truncdiqi2)
1110 emit_unop_insn (CODE_FOR_truncdiqi2, to, from, UNKNOWN);
1114 convert_move (to, force_reg (from_mode, from), unsignedp);
1118 if (from_mode == SImode && to_mode == HImode)
1120 #ifdef HAVE_truncsihi2
1121 if (HAVE_truncsihi2)
1123 emit_unop_insn (CODE_FOR_truncsihi2, to, from, UNKNOWN);
1127 convert_move (to, force_reg (from_mode, from), unsignedp);
1131 if (from_mode == SImode && to_mode == QImode)
1133 #ifdef HAVE_truncsiqi2
1134 if (HAVE_truncsiqi2)
1136 emit_unop_insn (CODE_FOR_truncsiqi2, to, from, UNKNOWN);
1140 convert_move (to, force_reg (from_mode, from), unsignedp);
1144 if (from_mode == HImode && to_mode == QImode)
1146 #ifdef HAVE_trunchiqi2
1147 if (HAVE_trunchiqi2)
1149 emit_unop_insn (CODE_FOR_trunchiqi2, to, from, UNKNOWN);
1153 convert_move (to, force_reg (from_mode, from), unsignedp);
1157 if (from_mode == TImode && to_mode == DImode)
1159 #ifdef HAVE_trunctidi2
1160 if (HAVE_trunctidi2)
1162 emit_unop_insn (CODE_FOR_trunctidi2, to, from, UNKNOWN);
1166 convert_move (to, force_reg (from_mode, from), unsignedp);
1170 if (from_mode == TImode && to_mode == SImode)
1172 #ifdef HAVE_trunctisi2
1173 if (HAVE_trunctisi2)
1175 emit_unop_insn (CODE_FOR_trunctisi2, to, from, UNKNOWN);
1179 convert_move (to, force_reg (from_mode, from), unsignedp);
1183 if (from_mode == TImode && to_mode == HImode)
1185 #ifdef HAVE_trunctihi2
1186 if (HAVE_trunctihi2)
1188 emit_unop_insn (CODE_FOR_trunctihi2, to, from, UNKNOWN);
1192 convert_move (to, force_reg (from_mode, from), unsignedp);
1196 if (from_mode == TImode && to_mode == QImode)
1198 #ifdef HAVE_trunctiqi2
1199 if (HAVE_trunctiqi2)
1201 emit_unop_insn (CODE_FOR_trunctiqi2, to, from, UNKNOWN);
1205 convert_move (to, force_reg (from_mode, from), unsignedp);
1209 /* Handle truncation of volatile memrefs, and so on;
1210 the things that couldn't be truncated directly,
1211 and for which there was no special instruction. */
1212 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
1214 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
1215 emit_move_insn (to, temp);
1219 /* Mode combination is not recognized. */
1223 /* Return an rtx for a value that would result
1224 from converting X to mode MODE.
1225 Both X and MODE may be floating, or both integer.
1226 UNSIGNEDP is nonzero if X is an unsigned value.
1227 This can be done by referring to a part of X in place
1228 or by copying to a new temporary with conversion.
1230 This function *must not* call protect_from_queue
1231 except when putting X into an insn (in which case convert_move does it). */
1234 convert_to_mode (mode, x, unsignedp)
1235 enum machine_mode mode;
1239 return convert_modes (mode, VOIDmode, x, unsignedp);
1242 /* Return an rtx for a value that would result
1243 from converting X from mode OLDMODE to mode MODE.
1244 Both modes may be floating, or both integer.
1245 UNSIGNEDP is nonzero if X is an unsigned value.
1247 This can be done by referring to a part of X in place
1248 or by copying to a new temporary with conversion.
1250 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1252 This function *must not* call protect_from_queue
1253 except when putting X into an insn (in which case convert_move does it). */
1256 convert_modes (mode, oldmode, x, unsignedp)
1257 enum machine_mode mode, oldmode;
1263 /* If FROM is a SUBREG that indicates that we have already done at least
1264 the required extension, strip it. */
1266 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
1267 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
1268 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
1269 x = gen_lowpart (mode, x);
1271 if (GET_MODE (x) != VOIDmode)
1272 oldmode = GET_MODE (x);
1274 if (mode == oldmode)
1277 /* There is one case that we must handle specially: If we are converting
1278 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1279 we are to interpret the constant as unsigned, gen_lowpart will do
1280 the wrong if the constant appears negative. What we want to do is
1281 make the high-order word of the constant zero, not all ones. */
1283 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
1284 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
1285 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
1287 HOST_WIDE_INT val = INTVAL (x);
1289 if (oldmode != VOIDmode
1290 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
1292 int width = GET_MODE_BITSIZE (oldmode);
1294 /* We need to zero extend VAL. */
1295 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1298 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
1301 /* We can do this with a gen_lowpart if both desired and current modes
1302 are integer, and this is either a constant integer, a register, or a
1303 non-volatile MEM. Except for the constant case where MODE is no
1304 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1306 if ((GET_CODE (x) == CONST_INT
1307 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
1308 || (GET_MODE_CLASS (mode) == MODE_INT
1309 && GET_MODE_CLASS (oldmode) == MODE_INT
1310 && (GET_CODE (x) == CONST_DOUBLE
1311 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
1312 && ((GET_CODE (x) == MEM && ! MEM_VOLATILE_P (x)
1313 && direct_load[(int) mode])
1314 || (GET_CODE (x) == REG
1315 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1316 GET_MODE_BITSIZE (GET_MODE (x)))))))))
1318 /* ?? If we don't know OLDMODE, we have to assume here that
1319 X does not need sign- or zero-extension. This may not be
1320 the case, but it's the best we can do. */
1321 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
1322 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
1324 HOST_WIDE_INT val = INTVAL (x);
1325 int width = GET_MODE_BITSIZE (oldmode);
1327 /* We must sign or zero-extend in this case. Start by
1328 zero-extending, then sign extend if we need to. */
1329 val &= ((HOST_WIDE_INT) 1 << width) - 1;
1331 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
1332 val |= (HOST_WIDE_INT) (-1) << width;
1334 return GEN_INT (val);
1337 return gen_lowpart (mode, x);
1340 temp = gen_reg_rtx (mode);
1341 convert_move (temp, x, unsignedp);
1346 /* This macro is used to determine what the largest unit size that
1347 move_by_pieces can use is. */
1349 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1350 move efficiently, as opposed to MOVE_MAX which is the maximum
1351 number of bhytes we can move with a single instruction. */
1353 #ifndef MOVE_MAX_PIECES
1354 #define MOVE_MAX_PIECES MOVE_MAX
1357 /* Generate several move instructions to copy LEN bytes
1358 from block FROM to block TO. (These are MEM rtx's with BLKmode).
1359 The caller must pass FROM and TO
1360 through protect_from_queue before calling.
1361 ALIGN (in bytes) is maximum alignment we can assume. */
1364 move_by_pieces (to, from, len, align)
1368 struct move_by_pieces data;
1369 rtx to_addr = XEXP (to, 0), from_addr = XEXP (from, 0);
1370 int max_size = MOVE_MAX_PIECES + 1;
1371 enum machine_mode mode = VOIDmode, tmode;
1372 enum insn_code icode;
1375 data.to_addr = to_addr;
1376 data.from_addr = from_addr;
1380 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
1381 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
1383 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
1384 || GET_CODE (from_addr) == POST_INC
1385 || GET_CODE (from_addr) == POST_DEC);
1387 data.explicit_inc_from = 0;
1388 data.explicit_inc_to = 0;
1390 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
1391 if (data.reverse) data.offset = len;
1394 data.to_struct = MEM_IN_STRUCT_P (to);
1395 data.from_struct = MEM_IN_STRUCT_P (from);
1396 data.to_readonly = RTX_UNCHANGING_P (to);
1397 data.from_readonly = RTX_UNCHANGING_P (from);
1399 /* If copying requires more than two move insns,
1400 copy addresses to registers (to make displacements shorter)
1401 and use post-increment if available. */
1402 if (!(data.autinc_from && data.autinc_to)
1403 && move_by_pieces_ninsns (len, align) > 2)
1405 /* Find the mode of the largest move... */
1406 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1407 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1408 if (GET_MODE_SIZE (tmode) < max_size)
1411 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
1413 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
1414 data.autinc_from = 1;
1415 data.explicit_inc_from = -1;
1417 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
1419 data.from_addr = copy_addr_to_reg (from_addr);
1420 data.autinc_from = 1;
1421 data.explicit_inc_from = 1;
1423 if (!data.autinc_from && CONSTANT_P (from_addr))
1424 data.from_addr = copy_addr_to_reg (from_addr);
1425 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
1427 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
1429 data.explicit_inc_to = -1;
1431 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
1433 data.to_addr = copy_addr_to_reg (to_addr);
1435 data.explicit_inc_to = 1;
1437 if (!data.autinc_to && CONSTANT_P (to_addr))
1438 data.to_addr = copy_addr_to_reg (to_addr);
1441 if (! SLOW_UNALIGNED_ACCESS
1442 || align > MOVE_MAX || align >= BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1445 /* First move what we can in the largest integer mode, then go to
1446 successively smaller modes. */
1448 while (max_size > 1)
1450 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1451 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1452 if (GET_MODE_SIZE (tmode) < max_size)
1455 if (mode == VOIDmode)
1458 icode = mov_optab->handlers[(int) mode].insn_code;
1459 if (icode != CODE_FOR_nothing
1460 && align >= MIN (BIGGEST_ALIGNMENT / BITS_PER_UNIT,
1461 GET_MODE_SIZE (mode)))
1462 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1464 max_size = GET_MODE_SIZE (mode);
1467 /* The code above should have handled everything. */
1472 /* Return number of insns required to move L bytes by pieces.
1473 ALIGN (in bytes) is maximum alignment we can assume. */
1476 move_by_pieces_ninsns (l, align)
1480 register int n_insns = 0;
1481 int max_size = MOVE_MAX + 1;
1483 if (! SLOW_UNALIGNED_ACCESS
1484 || align > MOVE_MAX || align >= BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1487 while (max_size > 1)
1489 enum machine_mode mode = VOIDmode, tmode;
1490 enum insn_code icode;
1492 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1493 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1494 if (GET_MODE_SIZE (tmode) < max_size)
1497 if (mode == VOIDmode)
1500 icode = mov_optab->handlers[(int) mode].insn_code;
1501 if (icode != CODE_FOR_nothing
1502 && align >= MIN (BIGGEST_ALIGNMENT / BITS_PER_UNIT,
1503 GET_MODE_SIZE (mode)))
1504 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1506 max_size = GET_MODE_SIZE (mode);
1512 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1513 with move instructions for mode MODE. GENFUN is the gen_... function
1514 to make a move insn for that mode. DATA has all the other info. */
1517 move_by_pieces_1 (genfun, mode, data)
1518 rtx (*genfun) PROTO ((rtx, ...));
1519 enum machine_mode mode;
1520 struct move_by_pieces *data;
1522 register int size = GET_MODE_SIZE (mode);
1523 register rtx to1, from1;
1525 while (data->len >= size)
1527 if (data->reverse) data->offset -= size;
1529 to1 = (data->autinc_to
1530 ? gen_rtx_MEM (mode, data->to_addr)
1531 : copy_rtx (change_address (data->to, mode,
1532 plus_constant (data->to_addr,
1534 MEM_IN_STRUCT_P (to1) = data->to_struct;
1535 RTX_UNCHANGING_P (to1) = data->to_readonly;
1538 = (data->autinc_from
1539 ? gen_rtx_MEM (mode, data->from_addr)
1540 : copy_rtx (change_address (data->from, mode,
1541 plus_constant (data->from_addr,
1543 MEM_IN_STRUCT_P (from1) = data->from_struct;
1544 RTX_UNCHANGING_P (from1) = data->from_readonly;
1546 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1547 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (-size)));
1548 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1549 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (-size)));
1551 emit_insn ((*genfun) (to1, from1));
1552 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1553 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1554 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1555 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1557 if (! data->reverse) data->offset += size;
1563 /* Emit code to move a block Y to a block X.
1564 This may be done with string-move instructions,
1565 with multiple scalar move instructions, or with a library call.
1567 Both X and Y must be MEM rtx's (perhaps inside VOLATILE)
1569 SIZE is an rtx that says how long they are.
1570 ALIGN is the maximum alignment we can assume they have,
1573 Return the address of the new block, if memcpy is called and returns it,
1577 emit_block_move (x, y, size, align)
1583 #ifdef TARGET_MEM_FUNCTIONS
1585 tree call_expr, arg_list;
1588 if (GET_MODE (x) != BLKmode)
1591 if (GET_MODE (y) != BLKmode)
1594 x = protect_from_queue (x, 1);
1595 y = protect_from_queue (y, 0);
1596 size = protect_from_queue (size, 0);
1598 if (GET_CODE (x) != MEM)
1600 if (GET_CODE (y) != MEM)
1605 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1606 move_by_pieces (x, y, INTVAL (size), align);
1609 /* Try the most limited insn first, because there's no point
1610 including more than one in the machine description unless
1611 the more limited one has some advantage. */
1613 rtx opalign = GEN_INT (align);
1614 enum machine_mode mode;
1616 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1617 mode = GET_MODE_WIDER_MODE (mode))
1619 enum insn_code code = movstr_optab[(int) mode];
1620 insn_operand_predicate_fn pred;
1622 if (code != CODE_FOR_nothing
1623 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1624 here because if SIZE is less than the mode mask, as it is
1625 returned by the macro, it will definitely be less than the
1626 actual mode mask. */
1627 && ((GET_CODE (size) == CONST_INT
1628 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1629 <= (GET_MODE_MASK (mode) >> 1)))
1630 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1631 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1632 || (*pred) (x, BLKmode))
1633 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1634 || (*pred) (y, BLKmode))
1635 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1636 || (*pred) (opalign, VOIDmode)))
1639 rtx last = get_last_insn ();
1642 op2 = convert_to_mode (mode, size, 1);
1643 pred = insn_data[(int) code].operand[2].predicate;
1644 if (pred != 0 && ! (*pred) (op2, mode))
1645 op2 = copy_to_mode_reg (mode, op2);
1647 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1654 delete_insns_since (last);
1658 /* X, Y, or SIZE may have been passed through protect_from_queue.
1660 It is unsafe to save the value generated by protect_from_queue
1661 and reuse it later. Consider what happens if emit_queue is
1662 called before the return value from protect_from_queue is used.
1664 Expansion of the CALL_EXPR below will call emit_queue before
1665 we are finished emitting RTL for argument setup. So if we are
1666 not careful we could get the wrong value for an argument.
1668 To avoid this problem we go ahead and emit code to copy X, Y &
1669 SIZE into new pseudos. We can then place those new pseudos
1670 into an RTL_EXPR and use them later, even after a call to
1673 Note this is not strictly needed for library calls since they
1674 do not call emit_queue before loading their arguments. However,
1675 we may need to have library calls call emit_queue in the future
1676 since failing to do so could cause problems for targets which
1677 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1678 x = copy_to_mode_reg (Pmode, XEXP (x, 0));
1679 y = copy_to_mode_reg (Pmode, XEXP (y, 0));
1681 #ifdef TARGET_MEM_FUNCTIONS
1682 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
1684 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
1685 TREE_UNSIGNED (integer_type_node));
1686 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
1689 #ifdef TARGET_MEM_FUNCTIONS
1690 /* It is incorrect to use the libcall calling conventions to call
1691 memcpy in this context.
1693 This could be a user call to memcpy and the user may wish to
1694 examine the return value from memcpy.
1696 For targets where libcalls and normal calls have different conventions
1697 for returning pointers, we could end up generating incorrect code.
1699 So instead of using a libcall sequence we build up a suitable
1700 CALL_EXPR and expand the call in the normal fashion. */
1701 if (fn == NULL_TREE)
1705 /* This was copied from except.c, I don't know if all this is
1706 necessary in this context or not. */
1707 fn = get_identifier ("memcpy");
1708 push_obstacks_nochange ();
1709 end_temporary_allocation ();
1710 fntype = build_pointer_type (void_type_node);
1711 fntype = build_function_type (fntype, NULL_TREE);
1712 fn = build_decl (FUNCTION_DECL, fn, fntype);
1713 ggc_add_tree_root (&fn, 1);
1714 DECL_EXTERNAL (fn) = 1;
1715 TREE_PUBLIC (fn) = 1;
1716 DECL_ARTIFICIAL (fn) = 1;
1717 make_decl_rtl (fn, NULL_PTR, 1);
1718 assemble_external (fn);
1722 /* We need to make an argument list for the function call.
1724 memcpy has three arguments, the first two are void * addresses and
1725 the last is a size_t byte count for the copy. */
1727 = build_tree_list (NULL_TREE,
1728 make_tree (build_pointer_type (void_type_node), x));
1729 TREE_CHAIN (arg_list)
1730 = build_tree_list (NULL_TREE,
1731 make_tree (build_pointer_type (void_type_node), y));
1732 TREE_CHAIN (TREE_CHAIN (arg_list))
1733 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
1734 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
1736 /* Now we have to build up the CALL_EXPR itself. */
1737 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1738 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1739 call_expr, arg_list, NULL_TREE);
1740 TREE_SIDE_EFFECTS (call_expr) = 1;
1742 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1744 emit_library_call (bcopy_libfunc, 0,
1745 VOIDmode, 3, y, Pmode, x, Pmode,
1746 convert_to_mode (TYPE_MODE (integer_type_node), size,
1747 TREE_UNSIGNED (integer_type_node)),
1748 TYPE_MODE (integer_type_node));
1755 /* Copy all or part of a value X into registers starting at REGNO.
1756 The number of registers to be filled is NREGS. */
1759 move_block_to_reg (regno, x, nregs, mode)
1763 enum machine_mode mode;
1766 #ifdef HAVE_load_multiple
1774 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1775 x = validize_mem (force_const_mem (mode, x));
1777 /* See if the machine can do this with a load multiple insn. */
1778 #ifdef HAVE_load_multiple
1779 if (HAVE_load_multiple)
1781 last = get_last_insn ();
1782 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1790 delete_insns_since (last);
1794 for (i = 0; i < nregs; i++)
1795 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1796 operand_subword_force (x, i, mode));
1799 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1800 The number of registers to be filled is NREGS. SIZE indicates the number
1801 of bytes in the object X. */
1805 move_block_from_reg (regno, x, nregs, size)
1812 #ifdef HAVE_store_multiple
1816 enum machine_mode mode;
1818 /* If SIZE is that of a mode no bigger than a word, just use that
1819 mode's store operation. */
1820 if (size <= UNITS_PER_WORD
1821 && (mode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0)) != BLKmode)
1823 emit_move_insn (change_address (x, mode, NULL),
1824 gen_rtx_REG (mode, regno));
1828 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
1829 to the left before storing to memory. Note that the previous test
1830 doesn't handle all cases (e.g. SIZE == 3). */
1831 if (size < UNITS_PER_WORD && BYTES_BIG_ENDIAN)
1833 rtx tem = operand_subword (x, 0, 1, BLKmode);
1839 shift = expand_shift (LSHIFT_EXPR, word_mode,
1840 gen_rtx_REG (word_mode, regno),
1841 build_int_2 ((UNITS_PER_WORD - size)
1842 * BITS_PER_UNIT, 0), NULL_RTX, 0);
1843 emit_move_insn (tem, shift);
1847 /* See if the machine can do this with a store multiple insn. */
1848 #ifdef HAVE_store_multiple
1849 if (HAVE_store_multiple)
1851 last = get_last_insn ();
1852 pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1860 delete_insns_since (last);
1864 for (i = 0; i < nregs; i++)
1866 rtx tem = operand_subword (x, i, 1, BLKmode);
1871 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1875 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
1876 registers represented by a PARALLEL. SSIZE represents the total size of
1877 block SRC in bytes, or -1 if not known. ALIGN is the known alignment of
1879 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatent assumption that
1880 the balance will be in what would be the low-order memory addresses, i.e.
1881 left justified for big endian, right justified for little endian. This
1882 happens to be true for the targets currently using this support. If this
1883 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
1887 emit_group_load (dst, orig_src, ssize, align)
1894 if (GET_CODE (dst) != PARALLEL)
1897 /* Check for a NULL entry, used to indicate that the parameter goes
1898 both on the stack and in registers. */
1899 if (XEXP (XVECEXP (dst, 0, 0), 0))
1904 tmps = (rtx *) alloca (sizeof(rtx) * XVECLEN (dst, 0));
1906 /* If we won't be loading directly from memory, protect the real source
1907 from strange tricks we might play. */
1909 if (GET_CODE (src) != MEM)
1911 src = gen_reg_rtx (GET_MODE (orig_src));
1912 emit_move_insn (src, orig_src);
1915 /* Process the pieces. */
1916 for (i = start; i < XVECLEN (dst, 0); i++)
1918 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1919 int bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1920 int bytelen = GET_MODE_SIZE (mode);
1923 /* Handle trailing fragments that run over the size of the struct. */
1924 if (ssize >= 0 && bytepos + bytelen > ssize)
1926 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1927 bytelen = ssize - bytepos;
1932 /* Optimize the access just a bit. */
1933 if (GET_CODE (src) == MEM
1934 && align*BITS_PER_UNIT >= GET_MODE_ALIGNMENT (mode)
1935 && bytepos*BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1936 && bytelen == GET_MODE_SIZE (mode))
1938 tmps[i] = gen_reg_rtx (mode);
1939 emit_move_insn (tmps[i],
1940 change_address (src, mode,
1941 plus_constant (XEXP (src, 0),
1944 else if (GET_CODE (src) == CONCAT)
1947 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 0))))
1948 tmps[i] = XEXP (src, 0);
1949 else if (bytepos == GET_MODE_SIZE (GET_MODE (XEXP (src, 0)))
1950 && bytelen == GET_MODE_SIZE (GET_MODE (XEXP (src, 1))))
1951 tmps[i] = XEXP (src, 1);
1957 tmps[i] = extract_bit_field (src, bytelen*BITS_PER_UNIT,
1958 bytepos*BITS_PER_UNIT, 1, NULL_RTX,
1959 mode, mode, align, ssize);
1962 if (BYTES_BIG_ENDIAN && shift)
1964 expand_binop (mode, ashl_optab, tmps[i], GEN_INT (shift),
1965 tmps[i], 0, OPTAB_WIDEN);
1970 /* Copy the extracted pieces into the proper (probable) hard regs. */
1971 for (i = start; i < XVECLEN (dst, 0); i++)
1972 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0), tmps[i]);
1975 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
1976 registers represented by a PARALLEL. SSIZE represents the total size of
1977 block DST, or -1 if not known. ALIGN is the known alignment of DST. */
1980 emit_group_store (orig_dst, src, ssize, align)
1987 if (GET_CODE (src) != PARALLEL)
1990 /* Check for a NULL entry, used to indicate that the parameter goes
1991 both on the stack and in registers. */
1992 if (XEXP (XVECEXP (src, 0, 0), 0))
1997 tmps = (rtx *) alloca (sizeof(rtx) * XVECLEN (src, 0));
1999 /* Copy the (probable) hard regs into pseudos. */
2000 for (i = start; i < XVECLEN (src, 0); i++)
2002 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
2003 tmps[i] = gen_reg_rtx (GET_MODE (reg));
2004 emit_move_insn (tmps[i], reg);
2008 /* If we won't be storing directly into memory, protect the real destination
2009 from strange tricks we might play. */
2011 if (GET_CODE (dst) == PARALLEL)
2015 /* We can get a PARALLEL dst if there is a conditional expression in
2016 a return statement. In that case, the dst and src are the same,
2017 so no action is necessary. */
2018 if (rtx_equal_p (dst, src))
2021 /* It is unclear if we can ever reach here, but we may as well handle
2022 it. Allocate a temporary, and split this into a store/load to/from
2025 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
2026 emit_group_store (temp, src, ssize, align);
2027 emit_group_load (dst, temp, ssize, align);
2030 else if (GET_CODE (dst) != MEM)
2032 dst = gen_reg_rtx (GET_MODE (orig_dst));
2033 /* Make life a bit easier for combine. */
2034 emit_move_insn (dst, const0_rtx);
2036 else if (! MEM_IN_STRUCT_P (dst))
2038 /* store_bit_field requires that memory operations have
2039 mem_in_struct_p set; we might not. */
2041 dst = copy_rtx (orig_dst);
2042 MEM_SET_IN_STRUCT_P (dst, 1);
2045 /* Process the pieces. */
2046 for (i = start; i < XVECLEN (src, 0); i++)
2048 int bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2049 enum machine_mode mode = GET_MODE (tmps[i]);
2050 int bytelen = GET_MODE_SIZE (mode);
2052 /* Handle trailing fragments that run over the size of the struct. */
2053 if (ssize >= 0 && bytepos + bytelen > ssize)
2055 if (BYTES_BIG_ENDIAN)
2057 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2058 expand_binop (mode, ashr_optab, tmps[i], GEN_INT (shift),
2059 tmps[i], 0, OPTAB_WIDEN);
2061 bytelen = ssize - bytepos;
2064 /* Optimize the access just a bit. */
2065 if (GET_CODE (dst) == MEM
2066 && align*BITS_PER_UNIT >= GET_MODE_ALIGNMENT (mode)
2067 && bytepos*BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2068 && bytelen == GET_MODE_SIZE (mode))
2070 emit_move_insn (change_address (dst, mode,
2071 plus_constant (XEXP (dst, 0),
2077 store_bit_field (dst, bytelen*BITS_PER_UNIT, bytepos*BITS_PER_UNIT,
2078 mode, tmps[i], align, ssize);
2083 /* Copy from the pseudo into the (probable) hard reg. */
2084 if (GET_CODE (dst) == REG)
2085 emit_move_insn (orig_dst, dst);
2088 /* Generate code to copy a BLKmode object of TYPE out of a
2089 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2090 is null, a stack temporary is created. TGTBLK is returned.
2092 The primary purpose of this routine is to handle functions
2093 that return BLKmode structures in registers. Some machines
2094 (the PA for example) want to return all small structures
2095 in registers regardless of the structure's alignment.
2099 copy_blkmode_from_reg(tgtblk,srcreg,type)
2104 int bytes = int_size_in_bytes (type);
2105 rtx src = NULL, dst = NULL;
2106 int bitsize = MIN (TYPE_ALIGN (type), (unsigned int) BITS_PER_WORD);
2107 int bitpos, xbitpos, big_endian_correction = 0;
2111 tgtblk = assign_stack_temp (BLKmode, bytes, 0);
2112 MEM_SET_IN_STRUCT_P (tgtblk, AGGREGATE_TYPE_P (type));
2113 preserve_temp_slots (tgtblk);
2116 /* This code assumes srcreg is at least a full word. If it isn't,
2117 copy it into a new pseudo which is a full word. */
2118 if (GET_MODE (srcreg) != BLKmode
2119 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2120 srcreg = convert_to_mode (word_mode, srcreg,
2121 TREE_UNSIGNED (type));
2123 /* Structures whose size is not a multiple of a word are aligned
2124 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2125 machine, this means we must skip the empty high order bytes when
2126 calculating the bit offset. */
2127 if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD)
2128 big_endian_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2131 /* Copy the structure BITSIZE bites at a time.
2133 We could probably emit more efficient code for machines
2134 which do not use strict alignment, but it doesn't seem
2135 worth the effort at the current time. */
2136 for (bitpos = 0, xbitpos = big_endian_correction;
2137 bitpos < bytes * BITS_PER_UNIT;
2138 bitpos += bitsize, xbitpos += bitsize)
2141 /* We need a new source operand each time xbitpos is on a
2142 word boundary and when xbitpos == big_endian_correction
2143 (the first time through). */
2144 if (xbitpos % BITS_PER_WORD == 0
2145 || xbitpos == big_endian_correction)
2146 src = operand_subword_force (srcreg,
2147 xbitpos / BITS_PER_WORD,
2150 /* We need a new destination operand each time bitpos is on
2152 if (bitpos % BITS_PER_WORD == 0)
2153 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2155 /* Use xbitpos for the source extraction (right justified) and
2156 xbitpos for the destination store (left justified). */
2157 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2158 extract_bit_field (src, bitsize,
2159 xbitpos % BITS_PER_WORD, 1,
2160 NULL_RTX, word_mode,
2162 bitsize / BITS_PER_UNIT,
2164 bitsize / BITS_PER_UNIT, BITS_PER_WORD);
2170 /* Add a USE expression for REG to the (possibly empty) list pointed
2171 to by CALL_FUSAGE. REG must denote a hard register. */
2174 use_reg (call_fusage, reg)
2175 rtx *call_fusage, reg;
2177 if (GET_CODE (reg) != REG
2178 || REGNO (reg) >= FIRST_PSEUDO_REGISTER)
2182 = gen_rtx_EXPR_LIST (VOIDmode,
2183 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2186 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2187 starting at REGNO. All of these registers must be hard registers. */
2190 use_regs (call_fusage, regno, nregs)
2197 if (regno + nregs > FIRST_PSEUDO_REGISTER)
2200 for (i = 0; i < nregs; i++)
2201 use_reg (call_fusage, gen_rtx_REG (reg_raw_mode[regno + i], regno + i));
2204 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2205 PARALLEL REGS. This is for calls that pass values in multiple
2206 non-contiguous locations. The Irix 6 ABI has examples of this. */
2209 use_group_regs (call_fusage, regs)
2215 for (i = 0; i < XVECLEN (regs, 0); i++)
2217 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2219 /* A NULL entry means the parameter goes both on the stack and in
2220 registers. This can also be a MEM for targets that pass values
2221 partially on the stack and partially in registers. */
2222 if (reg != 0 && GET_CODE (reg) == REG)
2223 use_reg (call_fusage, reg);
2227 /* Generate several move instructions to clear LEN bytes of block TO.
2228 (A MEM rtx with BLKmode). The caller must pass TO through
2229 protect_from_queue before calling. ALIGN (in bytes) is maximum alignment
2233 clear_by_pieces (to, len, align)
2237 struct clear_by_pieces data;
2238 rtx to_addr = XEXP (to, 0);
2239 int max_size = MOVE_MAX_PIECES + 1;
2240 enum machine_mode mode = VOIDmode, tmode;
2241 enum insn_code icode;
2244 data.to_addr = to_addr;
2247 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2248 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2250 data.explicit_inc_to = 0;
2252 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2253 if (data.reverse) data.offset = len;
2256 data.to_struct = MEM_IN_STRUCT_P (to);
2258 /* If copying requires more than two move insns,
2259 copy addresses to registers (to make displacements shorter)
2260 and use post-increment if available. */
2262 && move_by_pieces_ninsns (len, align) > 2)
2264 /* Determine the main mode we'll be using */
2265 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2266 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2267 if (GET_MODE_SIZE (tmode) < max_size)
2270 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
2272 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
2274 data.explicit_inc_to = -1;
2276 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
2278 data.to_addr = copy_addr_to_reg (to_addr);
2280 data.explicit_inc_to = 1;
2282 if (!data.autinc_to && CONSTANT_P (to_addr))
2283 data.to_addr = copy_addr_to_reg (to_addr);
2286 if (! SLOW_UNALIGNED_ACCESS
2287 || align > MOVE_MAX || align >= BIGGEST_ALIGNMENT / BITS_PER_UNIT)
2290 /* First move what we can in the largest integer mode, then go to
2291 successively smaller modes. */
2293 while (max_size > 1)
2295 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2296 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2297 if (GET_MODE_SIZE (tmode) < max_size)
2300 if (mode == VOIDmode)
2303 icode = mov_optab->handlers[(int) mode].insn_code;
2304 if (icode != CODE_FOR_nothing
2305 && align >= MIN (BIGGEST_ALIGNMENT / BITS_PER_UNIT,
2306 GET_MODE_SIZE (mode)))
2307 clear_by_pieces_1 (GEN_FCN (icode), mode, &data);
2309 max_size = GET_MODE_SIZE (mode);
2312 /* The code above should have handled everything. */
2317 /* Subroutine of clear_by_pieces. Clear as many bytes as appropriate
2318 with move instructions for mode MODE. GENFUN is the gen_... function
2319 to make a move insn for that mode. DATA has all the other info. */
2322 clear_by_pieces_1 (genfun, mode, data)
2323 rtx (*genfun) PROTO ((rtx, ...));
2324 enum machine_mode mode;
2325 struct clear_by_pieces *data;
2327 register int size = GET_MODE_SIZE (mode);
2330 while (data->len >= size)
2332 if (data->reverse) data->offset -= size;
2334 to1 = (data->autinc_to
2335 ? gen_rtx_MEM (mode, data->to_addr)
2336 : copy_rtx (change_address (data->to, mode,
2337 plus_constant (data->to_addr,
2339 MEM_IN_STRUCT_P (to1) = data->to_struct;
2341 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2342 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (-size)));
2344 emit_insn ((*genfun) (to1, const0_rtx));
2345 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2346 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2348 if (! data->reverse) data->offset += size;
2354 /* Write zeros through the storage of OBJECT.
2355 If OBJECT has BLKmode, SIZE is its length in bytes and ALIGN is
2356 the maximum alignment we can is has, measured in bytes.
2358 If we call a function that returns the length of the block, return it. */
2361 clear_storage (object, size, align)
2366 #ifdef TARGET_MEM_FUNCTIONS
2368 tree call_expr, arg_list;
2372 if (GET_MODE (object) == BLKmode)
2374 object = protect_from_queue (object, 1);
2375 size = protect_from_queue (size, 0);
2377 if (GET_CODE (size) == CONST_INT
2378 && MOVE_BY_PIECES_P (INTVAL (size), align))
2379 clear_by_pieces (object, INTVAL (size), align);
2383 /* Try the most limited insn first, because there's no point
2384 including more than one in the machine description unless
2385 the more limited one has some advantage. */
2387 rtx opalign = GEN_INT (align);
2388 enum machine_mode mode;
2390 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2391 mode = GET_MODE_WIDER_MODE (mode))
2393 enum insn_code code = clrstr_optab[(int) mode];
2394 insn_operand_predicate_fn pred;
2396 if (code != CODE_FOR_nothing
2397 /* We don't need MODE to be narrower than
2398 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2399 the mode mask, as it is returned by the macro, it will
2400 definitely be less than the actual mode mask. */
2401 && ((GET_CODE (size) == CONST_INT
2402 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2403 <= (GET_MODE_MASK (mode) >> 1)))
2404 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2405 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2406 || (*pred) (object, BLKmode))
2407 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2408 || (*pred) (opalign, VOIDmode)))
2411 rtx last = get_last_insn ();
2414 op1 = convert_to_mode (mode, size, 1);
2415 pred = insn_data[(int) code].operand[1].predicate;
2416 if (pred != 0 && ! (*pred) (op1, mode))
2417 op1 = copy_to_mode_reg (mode, op1);
2419 pat = GEN_FCN ((int) code) (object, op1, opalign);
2426 delete_insns_since (last);
2430 /* OBJECT or SIZE may have been passed through protect_from_queue.
2432 It is unsafe to save the value generated by protect_from_queue
2433 and reuse it later. Consider what happens if emit_queue is
2434 called before the return value from protect_from_queue is used.
2436 Expansion of the CALL_EXPR below will call emit_queue before
2437 we are finished emitting RTL for argument setup. So if we are
2438 not careful we could get the wrong value for an argument.
2440 To avoid this problem we go ahead and emit code to copy OBJECT
2441 and SIZE into new pseudos. We can then place those new pseudos
2442 into an RTL_EXPR and use them later, even after a call to
2445 Note this is not strictly needed for library calls since they
2446 do not call emit_queue before loading their arguments. However,
2447 we may need to have library calls call emit_queue in the future
2448 since failing to do so could cause problems for targets which
2449 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
2450 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2452 #ifdef TARGET_MEM_FUNCTIONS
2453 size = copy_to_mode_reg (TYPE_MODE (sizetype), size);
2455 size = convert_to_mode (TYPE_MODE (integer_type_node), size,
2456 TREE_UNSIGNED (integer_type_node));
2457 size = copy_to_mode_reg (TYPE_MODE (integer_type_node), size);
2461 #ifdef TARGET_MEM_FUNCTIONS
2462 /* It is incorrect to use the libcall calling conventions to call
2463 memset in this context.
2465 This could be a user call to memset and the user may wish to
2466 examine the return value from memset.
2468 For targets where libcalls and normal calls have different
2469 conventions for returning pointers, we could end up generating
2472 So instead of using a libcall sequence we build up a suitable
2473 CALL_EXPR and expand the call in the normal fashion. */
2474 if (fn == NULL_TREE)
2478 /* This was copied from except.c, I don't know if all this is
2479 necessary in this context or not. */
2480 fn = get_identifier ("memset");
2481 push_obstacks_nochange ();
2482 end_temporary_allocation ();
2483 fntype = build_pointer_type (void_type_node);
2484 fntype = build_function_type (fntype, NULL_TREE);
2485 fn = build_decl (FUNCTION_DECL, fn, fntype);
2486 ggc_add_tree_root (&fn, 1);
2487 DECL_EXTERNAL (fn) = 1;
2488 TREE_PUBLIC (fn) = 1;
2489 DECL_ARTIFICIAL (fn) = 1;
2490 make_decl_rtl (fn, NULL_PTR, 1);
2491 assemble_external (fn);
2495 /* We need to make an argument list for the function call.
2497 memset has three arguments, the first is a void * addresses, the
2498 second a integer with the initialization value, the last is a
2499 size_t byte count for the copy. */
2501 = build_tree_list (NULL_TREE,
2502 make_tree (build_pointer_type (void_type_node),
2504 TREE_CHAIN (arg_list)
2505 = build_tree_list (NULL_TREE,
2506 make_tree (integer_type_node, const0_rtx));
2507 TREE_CHAIN (TREE_CHAIN (arg_list))
2508 = build_tree_list (NULL_TREE, make_tree (sizetype, size));
2509 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list))) = NULL_TREE;
2511 /* Now we have to build up the CALL_EXPR itself. */
2512 call_expr = build1 (ADDR_EXPR,
2513 build_pointer_type (TREE_TYPE (fn)), fn);
2514 call_expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2515 call_expr, arg_list, NULL_TREE);
2516 TREE_SIDE_EFFECTS (call_expr) = 1;
2518 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2520 emit_library_call (bzero_libfunc, 0,
2521 VOIDmode, 2, object, Pmode, size,
2522 TYPE_MODE (integer_type_node));
2527 emit_move_insn (object, CONST0_RTX (GET_MODE (object)));
2532 /* Generate code to copy Y into X.
2533 Both Y and X must have the same mode, except that
2534 Y can be a constant with VOIDmode.
2535 This mode cannot be BLKmode; use emit_block_move for that.
2537 Return the last instruction emitted. */
2540 emit_move_insn (x, y)
2543 enum machine_mode mode = GET_MODE (x);
2545 x = protect_from_queue (x, 1);
2546 y = protect_from_queue (y, 0);
2548 if (mode == BLKmode || (GET_MODE (y) != mode && GET_MODE (y) != VOIDmode))
2551 /* Never force constant_p_rtx to memory. */
2552 if (GET_CODE (y) == CONSTANT_P_RTX)
2554 else if (CONSTANT_P (y) && ! LEGITIMATE_CONSTANT_P (y))
2555 y = force_const_mem (mode, y);
2557 /* If X or Y are memory references, verify that their addresses are valid
2559 if (GET_CODE (x) == MEM
2560 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
2561 && ! push_operand (x, GET_MODE (x)))
2563 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
2564 x = change_address (x, VOIDmode, XEXP (x, 0));
2566 if (GET_CODE (y) == MEM
2567 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
2569 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
2570 y = change_address (y, VOIDmode, XEXP (y, 0));
2572 if (mode == BLKmode)
2575 return emit_move_insn_1 (x, y);
2578 /* Low level part of emit_move_insn.
2579 Called just like emit_move_insn, but assumes X and Y
2580 are basically valid. */
2583 emit_move_insn_1 (x, y)
2586 enum machine_mode mode = GET_MODE (x);
2587 enum machine_mode submode;
2588 enum mode_class class = GET_MODE_CLASS (mode);
2591 if (mode >= MAX_MACHINE_MODE)
2594 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2596 emit_insn (GEN_FCN (mov_optab->handlers[(int) mode].insn_code) (x, y));
2598 /* Expand complex moves by moving real part and imag part, if possible. */
2599 else if ((class == MODE_COMPLEX_FLOAT || class == MODE_COMPLEX_INT)
2600 && BLKmode != (submode = mode_for_size ((GET_MODE_UNIT_SIZE (mode)
2602 (class == MODE_COMPLEX_INT
2603 ? MODE_INT : MODE_FLOAT),
2605 && (mov_optab->handlers[(int) submode].insn_code
2606 != CODE_FOR_nothing))
2608 /* Don't split destination if it is a stack push. */
2609 int stack = push_operand (x, GET_MODE (x));
2611 /* If this is a stack, push the highpart first, so it
2612 will be in the argument order.
2614 In that case, change_address is used only to convert
2615 the mode, not to change the address. */
2618 /* Note that the real part always precedes the imag part in memory
2619 regardless of machine's endianness. */
2620 #ifdef STACK_GROWS_DOWNWARD
2621 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2622 (gen_rtx_MEM (submode, (XEXP (x, 0))),
2623 gen_imagpart (submode, y)));
2624 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2625 (gen_rtx_MEM (submode, (XEXP (x, 0))),
2626 gen_realpart (submode, y)));
2628 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2629 (gen_rtx_MEM (submode, (XEXP (x, 0))),
2630 gen_realpart (submode, y)));
2631 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2632 (gen_rtx_MEM (submode, (XEXP (x, 0))),
2633 gen_imagpart (submode, y)));
2638 /* If this is a complex value with each part being smaller than a
2639 word, the usual calling sequence will likely pack the pieces into
2640 a single register. Unfortunately, SUBREG of hard registers only
2641 deals in terms of words, so we have a problem converting input
2642 arguments to the CONCAT of two registers that is used elsewhere
2643 for complex values. If this is before reload, we can copy it into
2644 memory and reload. FIXME, we should see about using extract and
2645 insert on integer registers, but complex short and complex char
2646 variables should be rarely used. */
2647 if (GET_MODE_BITSIZE (mode) < 2*BITS_PER_WORD
2648 && (reload_in_progress | reload_completed) == 0)
2650 int packed_dest_p = (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER);
2651 int packed_src_p = (REG_P (y) && REGNO (y) < FIRST_PSEUDO_REGISTER);
2653 if (packed_dest_p || packed_src_p)
2655 enum mode_class reg_class = ((class == MODE_COMPLEX_FLOAT)
2656 ? MODE_FLOAT : MODE_INT);
2658 enum machine_mode reg_mode =
2659 mode_for_size (GET_MODE_BITSIZE (mode), reg_class, 1);
2661 if (reg_mode != BLKmode)
2663 rtx mem = assign_stack_temp (reg_mode,
2664 GET_MODE_SIZE (mode), 0);
2666 rtx cmem = change_address (mem, mode, NULL_RTX);
2668 current_function->cannot_inline
2669 = "function uses short complex types";
2673 rtx sreg = gen_rtx_SUBREG (reg_mode, x, 0);
2674 emit_move_insn_1 (cmem, y);
2675 return emit_move_insn_1 (sreg, mem);
2679 rtx sreg = gen_rtx_SUBREG (reg_mode, y, 0);
2680 emit_move_insn_1 (mem, sreg);
2681 return emit_move_insn_1 (x, cmem);
2687 /* Show the output dies here. This is necessary for pseudos;
2688 hard regs shouldn't appear here except as return values.
2689 We never want to emit such a clobber after reload. */
2691 && ! (reload_in_progress || reload_completed))
2693 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2696 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2697 (gen_realpart (submode, x), gen_realpart (submode, y)));
2698 emit_insn (GEN_FCN (mov_optab->handlers[(int) submode].insn_code)
2699 (gen_imagpart (submode, x), gen_imagpart (submode, y)));
2702 return get_last_insn ();
2705 /* This will handle any multi-word mode that lacks a move_insn pattern.
2706 However, you will get better code if you define such patterns,
2707 even if they must turn into multiple assembler instructions. */
2708 else if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)
2712 #ifdef PUSH_ROUNDING
2714 /* If X is a push on the stack, do the push now and replace
2715 X with a reference to the stack pointer. */
2716 if (push_operand (x, GET_MODE (x)))
2718 anti_adjust_stack (GEN_INT (GET_MODE_SIZE (GET_MODE (x))));
2719 x = change_address (x, VOIDmode, stack_pointer_rtx);
2723 /* Show the output dies here. This is necessary for pseudos;
2724 hard regs shouldn't appear here except as return values.
2725 We never want to emit such a clobber after reload. */
2727 && ! (reload_in_progress || reload_completed))
2729 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2733 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
2736 rtx xpart = operand_subword (x, i, 1, mode);
2737 rtx ypart = operand_subword (y, i, 1, mode);
2739 /* If we can't get a part of Y, put Y into memory if it is a
2740 constant. Otherwise, force it into a register. If we still
2741 can't get a part of Y, abort. */
2742 if (ypart == 0 && CONSTANT_P (y))
2744 y = force_const_mem (mode, y);
2745 ypart = operand_subword (y, i, 1, mode);
2747 else if (ypart == 0)
2748 ypart = operand_subword_force (y, i, mode);
2750 if (xpart == 0 || ypart == 0)
2753 last_insn = emit_move_insn (xpart, ypart);
2762 /* Pushing data onto the stack. */
2764 /* Push a block of length SIZE (perhaps variable)
2765 and return an rtx to address the beginning of the block.
2766 Note that it is not possible for the value returned to be a QUEUED.
2767 The value may be virtual_outgoing_args_rtx.
2769 EXTRA is the number of bytes of padding to push in addition to SIZE.
2770 BELOW nonzero means this padding comes at low addresses;
2771 otherwise, the padding comes at high addresses. */
2774 push_block (size, extra, below)
2780 size = convert_modes (Pmode, ptr_mode, size, 1);
2781 if (CONSTANT_P (size))
2782 anti_adjust_stack (plus_constant (size, extra));
2783 else if (GET_CODE (size) == REG && extra == 0)
2784 anti_adjust_stack (size);
2787 rtx temp = copy_to_mode_reg (Pmode, size);
2789 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
2790 temp, 0, OPTAB_LIB_WIDEN);
2791 anti_adjust_stack (temp);
2794 #if defined (STACK_GROWS_DOWNWARD) \
2795 || (defined (ARGS_GROW_DOWNWARD) \
2796 && !defined (ACCUMULATE_OUTGOING_ARGS))
2798 /* Return the lowest stack address when STACK or ARGS grow downward and
2799 we are not aaccumulating outgoing arguments (the c4x port uses such
2801 temp = virtual_outgoing_args_rtx;
2802 if (extra != 0 && below)
2803 temp = plus_constant (temp, extra);
2805 if (GET_CODE (size) == CONST_INT)
2806 temp = plus_constant (virtual_outgoing_args_rtx,
2807 - INTVAL (size) - (below ? 0 : extra));
2808 else if (extra != 0 && !below)
2809 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
2810 negate_rtx (Pmode, plus_constant (size, extra)));
2812 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
2813 negate_rtx (Pmode, size));
2816 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
2822 return gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
2825 /* Return an rtx for the address of the beginning of a as-if-it-was-pushed
2826 block of SIZE bytes. */
2829 get_push_address (size)
2834 if (STACK_PUSH_CODE == POST_DEC)
2835 temp = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (size));
2836 else if (STACK_PUSH_CODE == POST_INC)
2837 temp = gen_rtx_MINUS (Pmode, stack_pointer_rtx, GEN_INT (size));
2839 temp = stack_pointer_rtx;
2841 return copy_to_reg (temp);
2844 /* Generate code to push X onto the stack, assuming it has mode MODE and
2846 MODE is redundant except when X is a CONST_INT (since they don't
2848 SIZE is an rtx for the size of data to be copied (in bytes),
2849 needed only if X is BLKmode.
2851 ALIGN (in bytes) is maximum alignment we can assume.
2853 If PARTIAL and REG are both nonzero, then copy that many of the first
2854 words of X into registers starting with REG, and push the rest of X.
2855 The amount of space pushed is decreased by PARTIAL words,
2856 rounded *down* to a multiple of PARM_BOUNDARY.
2857 REG must be a hard register in this case.
2858 If REG is zero but PARTIAL is not, take any all others actions for an
2859 argument partially in registers, but do not actually load any
2862 EXTRA is the amount in bytes of extra space to leave next to this arg.
2863 This is ignored if an argument block has already been allocated.
2865 On a machine that lacks real push insns, ARGS_ADDR is the address of
2866 the bottom of the argument block for this call. We use indexing off there
2867 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
2868 argument block has not been preallocated.
2870 ARGS_SO_FAR is the size of args previously pushed for this call.
2872 REG_PARM_STACK_SPACE is nonzero if functions require stack space
2873 for arguments passed in registers. If nonzero, it will be the number
2874 of bytes required. */
2877 emit_push_insn (x, mode, type, size, align, partial, reg, extra,
2878 args_addr, args_so_far, reg_parm_stack_space,
2881 enum machine_mode mode;
2890 int reg_parm_stack_space;
2894 enum direction stack_direction
2895 #ifdef STACK_GROWS_DOWNWARD
2901 /* Decide where to pad the argument: `downward' for below,
2902 `upward' for above, or `none' for don't pad it.
2903 Default is below for small data on big-endian machines; else above. */
2904 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
2906 /* Invert direction if stack is post-update. */
2907 if (STACK_PUSH_CODE == POST_INC || STACK_PUSH_CODE == POST_DEC)
2908 if (where_pad != none)
2909 where_pad = (where_pad == downward ? upward : downward);
2911 xinner = x = protect_from_queue (x, 0);
2913 if (mode == BLKmode)
2915 /* Copy a block into the stack, entirely or partially. */
2918 int used = partial * UNITS_PER_WORD;
2919 int offset = used % (PARM_BOUNDARY / BITS_PER_UNIT);
2927 /* USED is now the # of bytes we need not copy to the stack
2928 because registers will take care of them. */
2931 xinner = change_address (xinner, BLKmode,
2932 plus_constant (XEXP (xinner, 0), used));
2934 /* If the partial register-part of the arg counts in its stack size,
2935 skip the part of stack space corresponding to the registers.
2936 Otherwise, start copying to the beginning of the stack space,
2937 by setting SKIP to 0. */
2938 skip = (reg_parm_stack_space == 0) ? 0 : used;
2940 #ifdef PUSH_ROUNDING
2941 /* Do it with several push insns if that doesn't take lots of insns
2942 and if there is no difficulty with push insns that skip bytes
2943 on the stack for alignment purposes. */
2945 && GET_CODE (size) == CONST_INT
2947 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
2948 /* Here we avoid the case of a structure whose weak alignment
2949 forces many pushes of a small amount of data,
2950 and such small pushes do rounding that causes trouble. */
2951 && ((! SLOW_UNALIGNED_ACCESS)
2952 || align >= BIGGEST_ALIGNMENT / BITS_PER_UNIT
2953 || PUSH_ROUNDING (align) == align)
2954 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
2956 /* Push padding now if padding above and stack grows down,
2957 or if padding below and stack grows up.
2958 But if space already allocated, this has already been done. */
2959 if (extra && args_addr == 0
2960 && where_pad != none && where_pad != stack_direction)
2961 anti_adjust_stack (GEN_INT (extra));
2963 move_by_pieces (gen_rtx_MEM (BLKmode, gen_push_operand ()), xinner,
2964 INTVAL (size) - used, align);
2966 if (current_function_check_memory_usage && ! in_check_memory_usage)
2970 in_check_memory_usage = 1;
2971 temp = get_push_address (INTVAL(size) - used);
2972 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
2973 emit_library_call (chkr_copy_bitmap_libfunc, 1, VOIDmode, 3,
2975 XEXP (xinner, 0), Pmode,
2976 GEN_INT (INTVAL(size) - used),
2977 TYPE_MODE (sizetype));
2979 emit_library_call (chkr_set_right_libfunc, 1, VOIDmode, 3,
2981 GEN_INT (INTVAL(size) - used),
2982 TYPE_MODE (sizetype),
2983 GEN_INT (MEMORY_USE_RW),
2984 TYPE_MODE (integer_type_node));
2985 in_check_memory_usage = 0;
2989 #endif /* PUSH_ROUNDING */
2991 /* Otherwise make space on the stack and copy the data
2992 to the address of that space. */
2994 /* Deduct words put into registers from the size we must copy. */
2997 if (GET_CODE (size) == CONST_INT)
2998 size = GEN_INT (INTVAL (size) - used);
3000 size = expand_binop (GET_MODE (size), sub_optab, size,
3001 GEN_INT (used), NULL_RTX, 0,
3005 /* Get the address of the stack space.
3006 In this case, we do not deal with EXTRA separately.
3007 A single stack adjust will do. */
3010 temp = push_block (size, extra, where_pad == downward);
3013 else if (GET_CODE (args_so_far) == CONST_INT)
3014 temp = memory_address (BLKmode,
3015 plus_constant (args_addr,
3016 skip + INTVAL (args_so_far)));
3018 temp = memory_address (BLKmode,
3019 plus_constant (gen_rtx_PLUS (Pmode,
3023 if (current_function_check_memory_usage && ! in_check_memory_usage)
3027 in_check_memory_usage = 1;
3028 target = copy_to_reg (temp);
3029 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
3030 emit_library_call (chkr_copy_bitmap_libfunc, 1, VOIDmode, 3,
3032 XEXP (xinner, 0), Pmode,
3033 size, TYPE_MODE (sizetype));
3035 emit_library_call (chkr_set_right_libfunc, 1, VOIDmode, 3,
3037 size, TYPE_MODE (sizetype),
3038 GEN_INT (MEMORY_USE_RW),
3039 TYPE_MODE (integer_type_node));
3040 in_check_memory_usage = 0;
3043 /* TEMP is the address of the block. Copy the data there. */
3044 if (GET_CODE (size) == CONST_INT
3045 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size), align)))
3047 move_by_pieces (gen_rtx_MEM (BLKmode, temp), xinner,
3048 INTVAL (size), align);
3053 rtx opalign = GEN_INT (align);
3054 enum machine_mode mode;
3055 rtx target = gen_rtx_MEM (BLKmode, temp);
3057 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3059 mode = GET_MODE_WIDER_MODE (mode))
3061 enum insn_code code = movstr_optab[(int) mode];
3062 insn_operand_predicate_fn pred;
3064 if (code != CODE_FOR_nothing
3065 && ((GET_CODE (size) == CONST_INT
3066 && ((unsigned HOST_WIDE_INT) INTVAL (size)
3067 <= (GET_MODE_MASK (mode) >> 1)))
3068 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
3069 && (!(pred = insn_data[(int) code].operand[0].predicate)
3070 || ((*pred) (target, BLKmode)))
3071 && (!(pred = insn_data[(int) code].operand[1].predicate)
3072 || ((*pred) (xinner, BLKmode)))
3073 && (!(pred = insn_data[(int) code].operand[3].predicate)
3074 || ((*pred) (opalign, VOIDmode))))
3076 rtx op2 = convert_to_mode (mode, size, 1);
3077 rtx last = get_last_insn ();
3080 pred = insn_data[(int) code].operand[2].predicate;
3081 if (pred != 0 && ! (*pred) (op2, mode))
3082 op2 = copy_to_mode_reg (mode, op2);
3084 pat = GEN_FCN ((int) code) (target, xinner,
3092 delete_insns_since (last);
3097 #ifndef ACCUMULATE_OUTGOING_ARGS
3098 /* If the source is referenced relative to the stack pointer,
3099 copy it to another register to stabilize it. We do not need
3100 to do this if we know that we won't be changing sp. */
3102 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3103 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3104 temp = copy_to_reg (temp);
3107 /* Make inhibit_defer_pop nonzero around the library call
3108 to force it to pop the bcopy-arguments right away. */
3110 #ifdef TARGET_MEM_FUNCTIONS
3111 emit_library_call (memcpy_libfunc, 0,
3112 VOIDmode, 3, temp, Pmode, XEXP (xinner, 0), Pmode,
3113 convert_to_mode (TYPE_MODE (sizetype),
3114 size, TREE_UNSIGNED (sizetype)),
3115 TYPE_MODE (sizetype));
3117 emit_library_call (bcopy_libfunc, 0,
3118 VOIDmode, 3, XEXP (xinner, 0), Pmode, temp, Pmode,
3119 convert_to_mode (TYPE_MODE (integer_type_node),
3121 TREE_UNSIGNED (integer_type_node)),
3122 TYPE_MODE (integer_type_node));
3127 else if (partial > 0)
3129 /* Scalar partly in registers. */
3131 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3134 /* # words of start of argument
3135 that we must make space for but need not store. */
3136 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3137 int args_offset = INTVAL (args_so_far);
3140 /* Push padding now if padding above and stack grows down,
3141 or if padding below and stack grows up.
3142 But if space already allocated, this has already been done. */
3143 if (extra && args_addr == 0
3144 && where_pad != none && where_pad != stack_direction)
3145 anti_adjust_stack (GEN_INT (extra));
3147 /* If we make space by pushing it, we might as well push
3148 the real data. Otherwise, we can leave OFFSET nonzero
3149 and leave the space uninitialized. */
3153 /* Now NOT_STACK gets the number of words that we don't need to
3154 allocate on the stack. */
3155 not_stack = partial - offset;
3157 /* If the partial register-part of the arg counts in its stack size,
3158 skip the part of stack space corresponding to the registers.
3159 Otherwise, start copying to the beginning of the stack space,
3160 by setting SKIP to 0. */
3161 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3163 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3164 x = validize_mem (force_const_mem (mode, x));
3166 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3167 SUBREGs of such registers are not allowed. */
3168 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER
3169 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3170 x = copy_to_reg (x);
3172 /* Loop over all the words allocated on the stack for this arg. */
3173 /* We can do it by words, because any scalar bigger than a word
3174 has a size a multiple of a word. */
3175 #ifndef PUSH_ARGS_REVERSED
3176 for (i = not_stack; i < size; i++)
3178 for (i = size - 1; i >= not_stack; i--)
3180 if (i >= not_stack + offset)
3181 emit_push_insn (operand_subword_force (x, i, mode),
3182 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3184 GEN_INT (args_offset + ((i - not_stack + skip)
3186 reg_parm_stack_space, alignment_pad);
3191 rtx target = NULL_RTX;
3193 /* Push padding now if padding above and stack grows down,
3194 or if padding below and stack grows up.
3195 But if space already allocated, this has already been done. */
3196 if (extra && args_addr == 0
3197 && where_pad != none && where_pad != stack_direction)
3198 anti_adjust_stack (GEN_INT (extra));
3200 #ifdef PUSH_ROUNDING
3202 addr = gen_push_operand ();
3206 if (GET_CODE (args_so_far) == CONST_INT)
3208 = memory_address (mode,
3209 plus_constant (args_addr,
3210 INTVAL (args_so_far)));
3212 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3217 emit_move_insn (gen_rtx_MEM (mode, addr), x);
3219 if (current_function_check_memory_usage && ! in_check_memory_usage)
3221 in_check_memory_usage = 1;
3223 target = get_push_address (GET_MODE_SIZE (mode));
3225 if (GET_CODE (x) == MEM && type && AGGREGATE_TYPE_P (type))
3226 emit_library_call (chkr_copy_bitmap_libfunc, 1, VOIDmode, 3,
3229 GEN_INT (GET_MODE_SIZE (mode)),
3230 TYPE_MODE (sizetype));
3232 emit_library_call (chkr_set_right_libfunc, 1, VOIDmode, 3,
3234 GEN_INT (GET_MODE_SIZE (mode)),
3235 TYPE_MODE (sizetype),
3236 GEN_INT (MEMORY_USE_RW),
3237 TYPE_MODE (integer_type_node));
3238 in_check_memory_usage = 0;
3243 /* If part should go in registers, copy that part
3244 into the appropriate registers. Do this now, at the end,
3245 since mem-to-mem copies above may do function calls. */
3246 if (partial > 0 && reg != 0)
3248 /* Handle calls that pass values in multiple non-contiguous locations.
3249 The Irix 6 ABI has examples of this. */
3250 if (GET_CODE (reg) == PARALLEL)
3251 emit_group_load (reg, x, -1, align); /* ??? size? */
3253 move_block_to_reg (REGNO (reg), x, partial, mode);
3256 if (extra && args_addr == 0 && where_pad == stack_direction)
3257 anti_adjust_stack (GEN_INT (extra));
3260 anti_adjust_stack (alignment_pad);
3263 /* Expand an assignment that stores the value of FROM into TO.
3264 If WANT_VALUE is nonzero, return an rtx for the value of TO.
3265 (This may contain a QUEUED rtx;
3266 if the value is constant, this rtx is a constant.)
3267 Otherwise, the returned value is NULL_RTX.
3269 SUGGEST_REG is no longer actually used.
3270 It used to mean, copy the value through a register
3271 and return that register, if that is possible.
3272 We now use WANT_VALUE to decide whether to do this. */
3275 expand_assignment (to, from, want_value, suggest_reg)
3278 int suggest_reg ATTRIBUTE_UNUSED;
3280 register rtx to_rtx = 0;
3283 /* Don't crash if the lhs of the assignment was erroneous. */
3285 if (TREE_CODE (to) == ERROR_MARK)
3287 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3288 return want_value ? result : NULL_RTX;
3291 /* Assignment of a structure component needs special treatment
3292 if the structure component's rtx is not simply a MEM.
3293 Assignment of an array element at a constant index, and assignment of
3294 an array element in an unaligned packed structure field, has the same
3297 if (TREE_CODE (to) == COMPONENT_REF || TREE_CODE (to) == BIT_FIELD_REF
3298 || TREE_CODE (to) == ARRAY_REF)
3300 enum machine_mode mode1;
3310 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3311 &unsignedp, &volatilep, &alignment);
3313 /* If we are going to use store_bit_field and extract_bit_field,
3314 make sure to_rtx will be safe for multiple use. */
3316 if (mode1 == VOIDmode && want_value)
3317 tem = stabilize_reference (tem);
3319 to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_DONT);
3322 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
3324 if (GET_CODE (to_rtx) != MEM)
3327 if (GET_MODE (offset_rtx) != ptr_mode)
3329 #ifdef POINTERS_EXTEND_UNSIGNED
3330 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
3332 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3336 /* A constant address in TO_RTX can have VOIDmode, we must not try
3337 to call force_reg for that case. Avoid that case. */
3338 if (GET_CODE (to_rtx) == MEM
3339 && GET_MODE (to_rtx) == BLKmode
3340 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3342 && (bitpos % bitsize) == 0
3343 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3344 && (alignment * BITS_PER_UNIT) == GET_MODE_ALIGNMENT (mode1))
3346 rtx temp = change_address (to_rtx, mode1,
3347 plus_constant (XEXP (to_rtx, 0),
3350 if (GET_CODE (XEXP (temp, 0)) == REG)
3353 to_rtx = change_address (to_rtx, mode1,
3354 force_reg (GET_MODE (XEXP (temp, 0)),
3359 to_rtx = change_address (to_rtx, VOIDmode,
3360 gen_rtx_PLUS (ptr_mode, XEXP (to_rtx, 0),
3361 force_reg (ptr_mode,
3367 if (GET_CODE (to_rtx) == MEM)
3369 /* When the offset is zero, to_rtx is the address of the
3370 structure we are storing into, and hence may be shared.
3371 We must make a new MEM before setting the volatile bit. */
3373 to_rtx = copy_rtx (to_rtx);
3375 MEM_VOLATILE_P (to_rtx) = 1;
3377 #if 0 /* This was turned off because, when a field is volatile
3378 in an object which is not volatile, the object may be in a register,
3379 and then we would abort over here. */
3385 if (TREE_CODE (to) == COMPONENT_REF
3386 && TREE_READONLY (TREE_OPERAND (to, 1)))
3389 to_rtx = copy_rtx (to_rtx);
3391 RTX_UNCHANGING_P (to_rtx) = 1;
3394 /* Check the access. */
3395 if (current_function_check_memory_usage && GET_CODE (to_rtx) == MEM)
3400 enum machine_mode best_mode;
3402 best_mode = get_best_mode (bitsize, bitpos,
3403 TYPE_ALIGN (TREE_TYPE (tem)),
3405 if (best_mode == VOIDmode)
3408 best_mode_size = GET_MODE_BITSIZE (best_mode);
3409 to_addr = plus_constant (XEXP (to_rtx, 0), (bitpos / BITS_PER_UNIT));
3410 size = CEIL ((bitpos % best_mode_size) + bitsize, best_mode_size);
3411 size *= GET_MODE_SIZE (best_mode);
3413 /* Check the access right of the pointer. */
3415 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
3417 GEN_INT (size), TYPE_MODE (sizetype),
3418 GEN_INT (MEMORY_USE_WO),
3419 TYPE_MODE (integer_type_node));
3422 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3424 /* Spurious cast makes HPUX compiler happy. */
3425 ? (enum machine_mode) TYPE_MODE (TREE_TYPE (to))
3428 /* Required alignment of containing datum. */
3430 int_size_in_bytes (TREE_TYPE (tem)),
3431 get_alias_set (to));
3432 preserve_temp_slots (result);
3436 /* If the value is meaningful, convert RESULT to the proper mode.
3437 Otherwise, return nothing. */
3438 return (want_value ? convert_modes (TYPE_MODE (TREE_TYPE (to)),
3439 TYPE_MODE (TREE_TYPE (from)),
3441 TREE_UNSIGNED (TREE_TYPE (to)))
3445 /* If the rhs is a function call and its value is not an aggregate,
3446 call the function before we start to compute the lhs.
3447 This is needed for correct code for cases such as
3448 val = setjmp (buf) on machines where reference to val
3449 requires loading up part of an address in a separate insn.
3451 Don't do this if TO is a VAR_DECL whose DECL_RTL is REG since it might be
3452 a promoted variable where the zero- or sign- extension needs to be done.
3453 Handling this in the normal way is safe because no computation is done
3455 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from)
3456 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3457 && ! (TREE_CODE (to) == VAR_DECL && GET_CODE (DECL_RTL (to)) == REG))
3462 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3464 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_WO);
3466 /* Handle calls that return values in multiple non-contiguous locations.
3467 The Irix 6 ABI has examples of this. */
3468 if (GET_CODE (to_rtx) == PARALLEL)
3469 emit_group_load (to_rtx, value, int_size_in_bytes (TREE_TYPE (from)),
3470 TYPE_ALIGN (TREE_TYPE (from)) / BITS_PER_UNIT);
3471 else if (GET_MODE (to_rtx) == BLKmode)
3472 emit_block_move (to_rtx, value, expr_size (from),
3473 TYPE_ALIGN (TREE_TYPE (from)) / BITS_PER_UNIT);
3476 #ifdef POINTERS_EXTEND_UNSIGNED
3477 if (TREE_CODE (TREE_TYPE (to)) == REFERENCE_TYPE
3478 || TREE_CODE (TREE_TYPE (to)) == POINTER_TYPE)
3479 value = convert_memory_address (GET_MODE (to_rtx), value);
3481 emit_move_insn (to_rtx, value);
3483 preserve_temp_slots (to_rtx);
3486 return want_value ? to_rtx : NULL_RTX;
3489 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3490 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3494 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_WO);
3495 if (GET_CODE (to_rtx) == MEM)
3496 MEM_ALIAS_SET (to_rtx) = get_alias_set (to);
3499 /* Don't move directly into a return register. */
3500 if (TREE_CODE (to) == RESULT_DECL
3501 && (GET_CODE (to_rtx) == REG || GET_CODE (to_rtx) == PARALLEL))
3506 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3508 if (GET_CODE (to_rtx) == PARALLEL)
3509 emit_group_load (to_rtx, temp, int_size_in_bytes (TREE_TYPE (from)),
3510 TYPE_ALIGN (TREE_TYPE (from)) / BITS_PER_UNIT);
3512 emit_move_insn (to_rtx, temp);
3514 preserve_temp_slots (to_rtx);
3517 return want_value ? to_rtx : NULL_RTX;
3520 /* In case we are returning the contents of an object which overlaps
3521 the place the value is being stored, use a safe function when copying
3522 a value through a pointer into a structure value return block. */
3523 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3524 && current_function_returns_struct
3525 && !current_function_returns_pcc_struct)
3530 size = expr_size (from);
3531 from_rtx = expand_expr (from, NULL_RTX, VOIDmode,
3532 EXPAND_MEMORY_USE_DONT);
3534 /* Copy the rights of the bitmap. */
3535 if (current_function_check_memory_usage)
3536 emit_library_call (chkr_copy_bitmap_libfunc, 1, VOIDmode, 3,
3537 XEXP (to_rtx, 0), Pmode,
3538 XEXP (from_rtx, 0), Pmode,
3539 convert_to_mode (TYPE_MODE (sizetype),
3540 size, TREE_UNSIGNED (sizetype)),
3541 TYPE_MODE (sizetype));
3543 #ifdef TARGET_MEM_FUNCTIONS
3544 emit_library_call (memcpy_libfunc, 0,
3545 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3546 XEXP (from_rtx, 0), Pmode,
3547 convert_to_mode (TYPE_MODE (sizetype),
3548 size, TREE_UNSIGNED (sizetype)),
3549 TYPE_MODE (sizetype));
3551 emit_library_call (bcopy_libfunc, 0,
3552 VOIDmode, 3, XEXP (from_rtx, 0), Pmode,
3553 XEXP (to_rtx, 0), Pmode,
3554 convert_to_mode (TYPE_MODE (integer_type_node),
3555 size, TREE_UNSIGNED (integer_type_node)),
3556 TYPE_MODE (integer_type_node));
3559 preserve_temp_slots (to_rtx);
3562 return want_value ? to_rtx : NULL_RTX;
3565 /* Compute FROM and store the value in the rtx we got. */
3568 result = store_expr (from, to_rtx, want_value);
3569 preserve_temp_slots (result);
3572 return want_value ? result : NULL_RTX;
3575 /* Generate code for computing expression EXP,
3576 and storing the value into TARGET.
3577 TARGET may contain a QUEUED rtx.
3579 If WANT_VALUE is nonzero, return a copy of the value
3580 not in TARGET, so that we can be sure to use the proper
3581 value in a containing expression even if TARGET has something
3582 else stored in it. If possible, we copy the value through a pseudo
3583 and return that pseudo. Or, if the value is constant, we try to
3584 return the constant. In some cases, we return a pseudo
3585 copied *from* TARGET.
3587 If the mode is BLKmode then we may return TARGET itself.
3588 It turns out that in BLKmode it doesn't cause a problem.
3589 because C has no operators that could combine two different
3590 assignments into the same BLKmode object with different values
3591 with no sequence point. Will other languages need this to
3594 If WANT_VALUE is 0, we return NULL, to make sure
3595 to catch quickly any cases where the caller uses the value
3596 and fails to set WANT_VALUE. */
3599 store_expr (exp, target, want_value)
3601 register rtx target;
3605 int dont_return_target = 0;
3607 if (TREE_CODE (exp) == COMPOUND_EXPR)
3609 /* Perform first part of compound expression, then assign from second
3611 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
3613 return store_expr (TREE_OPERAND (exp, 1), target, want_value);
3615 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
3617 /* For conditional expression, get safe form of the target. Then
3618 test the condition, doing the appropriate assignment on either
3619 side. This avoids the creation of unnecessary temporaries.
3620 For non-BLKmode, it is more efficient not to do this. */
3622 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
3625 target = protect_from_queue (target, 1);
3627 do_pending_stack_adjust ();
3629 jumpifnot (TREE_OPERAND (exp, 0), lab1);
3630 start_cleanup_deferral ();
3631 store_expr (TREE_OPERAND (exp, 1), target, 0);
3632 end_cleanup_deferral ();
3634 emit_jump_insn (gen_jump (lab2));
3637 start_cleanup_deferral ();
3638 store_expr (TREE_OPERAND (exp, 2), target, 0);
3639 end_cleanup_deferral ();
3644 return want_value ? target : NULL_RTX;
3646 else if (queued_subexp_p (target))
3647 /* If target contains a postincrement, let's not risk
3648 using it as the place to generate the rhs. */
3650 if (GET_MODE (target) != BLKmode && GET_MODE (target) != VOIDmode)
3652 /* Expand EXP into a new pseudo. */
3653 temp = gen_reg_rtx (GET_MODE (target));
3654 temp = expand_expr (exp, temp, GET_MODE (target), 0);
3657 temp = expand_expr (exp, NULL_RTX, GET_MODE (target), 0);
3659 /* If target is volatile, ANSI requires accessing the value
3660 *from* the target, if it is accessed. So make that happen.
3661 In no case return the target itself. */
3662 if (! MEM_VOLATILE_P (target) && want_value)
3663 dont_return_target = 1;
3665 else if (want_value && GET_CODE (target) == MEM && ! MEM_VOLATILE_P (target)
3666 && GET_MODE (target) != BLKmode)
3667 /* If target is in memory and caller wants value in a register instead,
3668 arrange that. Pass TARGET as target for expand_expr so that,
3669 if EXP is another assignment, WANT_VALUE will be nonzero for it.
3670 We know expand_expr will not use the target in that case.
3671 Don't do this if TARGET is volatile because we are supposed
3672 to write it and then read it. */
3674 temp = expand_expr (exp, target, GET_MODE (target), 0);
3675 if (GET_MODE (temp) != BLKmode && GET_MODE (temp) != VOIDmode)
3676 temp = copy_to_reg (temp);
3677 dont_return_target = 1;
3679 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
3680 /* If this is an scalar in a register that is stored in a wider mode
3681 than the declared mode, compute the result into its declared mode
3682 and then convert to the wider mode. Our value is the computed
3685 /* If we don't want a value, we can do the conversion inside EXP,
3686 which will often result in some optimizations. Do the conversion
3687 in two steps: first change the signedness, if needed, then
3688 the extend. But don't do this if the type of EXP is a subtype
3689 of something else since then the conversion might involve
3690 more than just converting modes. */
3691 if (! want_value && INTEGRAL_TYPE_P (TREE_TYPE (exp))
3692 && TREE_TYPE (TREE_TYPE (exp)) == 0)
3694 if (TREE_UNSIGNED (TREE_TYPE (exp))
3695 != SUBREG_PROMOTED_UNSIGNED_P (target))
3698 (signed_or_unsigned_type (SUBREG_PROMOTED_UNSIGNED_P (target),
3702 exp = convert (type_for_mode (GET_MODE (SUBREG_REG (target)),
3703 SUBREG_PROMOTED_UNSIGNED_P (target)),
3707 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
3709 /* If TEMP is a volatile MEM and we want a result value, make
3710 the access now so it gets done only once. Likewise if
3711 it contains TARGET. */
3712 if (GET_CODE (temp) == MEM && want_value
3713 && (MEM_VOLATILE_P (temp)
3714 || reg_mentioned_p (SUBREG_REG (target), XEXP (temp, 0))))
3715 temp = copy_to_reg (temp);
3717 /* If TEMP is a VOIDmode constant, use convert_modes to make
3718 sure that we properly convert it. */
3719 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
3720 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
3721 TYPE_MODE (TREE_TYPE (exp)), temp,
3722 SUBREG_PROMOTED_UNSIGNED_P (target));
3724 convert_move (SUBREG_REG (target), temp,
3725 SUBREG_PROMOTED_UNSIGNED_P (target));
3727 /* If we promoted a constant, change the mode back down to match
3728 target. Otherwise, the caller might get confused by a result whose
3729 mode is larger than expected. */
3731 if (want_value && GET_MODE (temp) != GET_MODE (target)
3732 && GET_MODE (temp) != VOIDmode)
3734 temp = gen_rtx_SUBREG (GET_MODE (target), temp, 0);
3735 SUBREG_PROMOTED_VAR_P (temp) = 1;
3736 SUBREG_PROMOTED_UNSIGNED_P (temp)
3737 = SUBREG_PROMOTED_UNSIGNED_P (target);
3740 return want_value ? temp : NULL_RTX;
3744 temp = expand_expr (exp, target, GET_MODE (target), 0);
3745 /* Return TARGET if it's a specified hardware register.
3746 If TARGET is a volatile mem ref, either return TARGET
3747 or return a reg copied *from* TARGET; ANSI requires this.
3749 Otherwise, if TEMP is not TARGET, return TEMP
3750 if it is constant (for efficiency),
3751 or if we really want the correct value. */
3752 if (!(target && GET_CODE (target) == REG
3753 && REGNO (target) < FIRST_PSEUDO_REGISTER)
3754 && !(GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
3755 && ! rtx_equal_p (temp, target)
3756 && (CONSTANT_P (temp) || want_value))
3757 dont_return_target = 1;
3760 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
3761 the same as that of TARGET, adjust the constant. This is needed, for
3762 example, in case it is a CONST_DOUBLE and we want only a word-sized
3764 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
3765 && TREE_CODE (exp) != ERROR_MARK
3766 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
3767 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
3768 temp, TREE_UNSIGNED (TREE_TYPE (exp)));
3770 if (current_function_check_memory_usage
3771 && GET_CODE (target) == MEM
3772 && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
3774 if (GET_CODE (temp) == MEM)
3775 emit_library_call (chkr_copy_bitmap_libfunc, 1, VOIDmode, 3,
3776 XEXP (target, 0), Pmode,
3777 XEXP (temp, 0), Pmode,
3778 expr_size (exp), TYPE_MODE (sizetype));
3780 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
3781 XEXP (target, 0), Pmode,
3782 expr_size (exp), TYPE_MODE (sizetype),
3783 GEN_INT (MEMORY_USE_WO),
3784 TYPE_MODE (integer_type_node));
3787 /* If value was not generated in the target, store it there.
3788 Convert the value to TARGET's type first if nec. */
3789 /* If TEMP and TARGET compare equal according to rtx_equal_p, but
3790 one or both of them are volatile memory refs, we have to distinguish
3792 - expand_expr has used TARGET. In this case, we must not generate
3793 another copy. This can be detected by TARGET being equal according
3795 - expand_expr has not used TARGET - that means that the source just
3796 happens to have the same RTX form. Since temp will have been created
3797 by expand_expr, it will compare unequal according to == .
3798 We must generate a copy in this case, to reach the correct number
3799 of volatile memory references. */
3801 if ((! rtx_equal_p (temp, target)
3802 || (temp != target && (side_effects_p (temp)
3803 || side_effects_p (target))))
3804 && TREE_CODE (exp) != ERROR_MARK)
3806 target = protect_from_queue (target, 1);
3807 if (GET_MODE (temp) != GET_MODE (target)
3808 && GET_MODE (temp) != VOIDmode)
3810 int unsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
3811 if (dont_return_target)
3813 /* In this case, we will return TEMP,
3814 so make sure it has the proper mode.
3815 But don't forget to store the value into TARGET. */
3816 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
3817 emit_move_insn (target, temp);
3820 convert_move (target, temp, unsignedp);
3823 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
3825 /* Handle copying a string constant into an array.
3826 The string constant may be shorter than the array.
3827 So copy just the string's actual length, and clear the rest. */
3831 /* Get the size of the data type of the string,
3832 which is actually the size of the target. */
3833 size = expr_size (exp);
3834 if (GET_CODE (size) == CONST_INT
3835 && INTVAL (size) < TREE_STRING_LENGTH (exp))
3836 emit_block_move (target, temp, size,
3837 TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT);
3840 /* Compute the size of the data to copy from the string. */
3842 = size_binop (MIN_EXPR,
3843 make_tree (sizetype, size),
3845 build_int_2 (TREE_STRING_LENGTH (exp), 0)));
3846 rtx copy_size_rtx = expand_expr (copy_size, NULL_RTX,
3850 /* Copy that much. */
3851 emit_block_move (target, temp, copy_size_rtx,
3852 TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT);
3854 /* Figure out how much is left in TARGET that we have to clear.
3855 Do all calculations in ptr_mode. */
3857 addr = XEXP (target, 0);
3858 addr = convert_modes (ptr_mode, Pmode, addr, 1);
3860 if (GET_CODE (copy_size_rtx) == CONST_INT)
3862 addr = plus_constant (addr, TREE_STRING_LENGTH (exp));
3863 size = plus_constant (size, - TREE_STRING_LENGTH (exp));
3867 addr = force_reg (ptr_mode, addr);
3868 addr = expand_binop (ptr_mode, add_optab, addr,
3869 copy_size_rtx, NULL_RTX, 0,
3872 size = expand_binop (ptr_mode, sub_optab, size,
3873 copy_size_rtx, NULL_RTX, 0,
3876 label = gen_label_rtx ();
3877 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
3878 GET_MODE (size), 0, 0, label);
3881 if (size != const0_rtx)
3883 /* Be sure we can write on ADDR. */
3884 if (current_function_check_memory_usage)
3885 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
3887 size, TYPE_MODE (sizetype),
3888 GEN_INT (MEMORY_USE_WO),
3889 TYPE_MODE (integer_type_node));
3890 #ifdef TARGET_MEM_FUNCTIONS
3891 emit_library_call (memset_libfunc, 0, VOIDmode, 3,
3893 const0_rtx, TYPE_MODE (integer_type_node),
3894 convert_to_mode (TYPE_MODE (sizetype),
3896 TREE_UNSIGNED (sizetype)),
3897 TYPE_MODE (sizetype));
3899 emit_library_call (bzero_libfunc, 0, VOIDmode, 2,
3901 convert_to_mode (TYPE_MODE (integer_type_node),
3903 TREE_UNSIGNED (integer_type_node)),
3904 TYPE_MODE (integer_type_node));
3912 /* Handle calls that return values in multiple non-contiguous locations.
3913 The Irix 6 ABI has examples of this. */
3914 else if (GET_CODE (target) == PARALLEL)
3915 emit_group_load (target, temp, int_size_in_bytes (TREE_TYPE (exp)),
3916 TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT);
3917 else if (GET_MODE (temp) == BLKmode)
3918 emit_block_move (target, temp, expr_size (exp),
3919 TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT);
3921 emit_move_insn (target, temp);
3924 /* If we don't want a value, return NULL_RTX. */
3928 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
3929 ??? The latter test doesn't seem to make sense. */
3930 else if (dont_return_target && GET_CODE (temp) != MEM)
3933 /* Return TARGET itself if it is a hard register. */
3934 else if (want_value && GET_MODE (target) != BLKmode
3935 && ! (GET_CODE (target) == REG
3936 && REGNO (target) < FIRST_PSEUDO_REGISTER))
3937 return copy_to_reg (target);
3943 /* Return 1 if EXP just contains zeros. */
3951 switch (TREE_CODE (exp))
3955 case NON_LVALUE_EXPR:
3956 return is_zeros_p (TREE_OPERAND (exp, 0));
3959 return TREE_INT_CST_LOW (exp) == 0 && TREE_INT_CST_HIGH (exp) == 0;
3963 is_zeros_p (TREE_REALPART (exp)) && is_zeros_p (TREE_IMAGPART (exp));
3966 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp), dconst0);
3969 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
3970 return CONSTRUCTOR_ELTS (exp) == NULL_TREE;
3971 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
3972 if (! is_zeros_p (TREE_VALUE (elt)))
3982 /* Return 1 if EXP contains mostly (3/4) zeros. */
3985 mostly_zeros_p (exp)
3988 if (TREE_CODE (exp) == CONSTRUCTOR)
3990 int elts = 0, zeros = 0;
3991 tree elt = CONSTRUCTOR_ELTS (exp);
3992 if (TREE_TYPE (exp) && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE)
3994 /* If there are no ranges of true bits, it is all zero. */
3995 return elt == NULL_TREE;
3997 for (; elt; elt = TREE_CHAIN (elt))
3999 /* We do not handle the case where the index is a RANGE_EXPR,
4000 so the statistic will be somewhat inaccurate.
4001 We do make a more accurate count in store_constructor itself,
4002 so since this function is only used for nested array elements,
4003 this should be close enough. */
4004 if (mostly_zeros_p (TREE_VALUE (elt)))
4009 return 4 * zeros >= 3 * elts;
4012 return is_zeros_p (exp);
4015 /* Helper function for store_constructor.
4016 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4017 TYPE is the type of the CONSTRUCTOR, not the element type.
4018 ALIGN and CLEARED are as for store_constructor.
4020 This provides a recursive shortcut back to store_constructor when it isn't
4021 necessary to go through store_field. This is so that we can pass through
4022 the cleared field to let store_constructor know that we may not have to
4023 clear a substructure if the outer structure has already been cleared. */
4026 store_constructor_field (target, bitsize, bitpos,
4027 mode, exp, type, align, cleared)
4029 int bitsize, bitpos;
4030 enum machine_mode mode;
4035 if (TREE_CODE (exp) == CONSTRUCTOR
4036 && bitpos % BITS_PER_UNIT == 0
4037 /* If we have a non-zero bitpos for a register target, then we just
4038 let store_field do the bitfield handling. This is unlikely to
4039 generate unnecessary clear instructions anyways. */
4040 && (bitpos == 0 || GET_CODE (target) == MEM))
4043 target = change_address (target, VOIDmode,
4044 plus_constant (XEXP (target, 0),
4045 bitpos / BITS_PER_UNIT));
4046 store_constructor (exp, target, align, cleared);
4049 store_field (target, bitsize, bitpos, mode, exp, VOIDmode, 0,
4050 (align + BITS_PER_UNIT - 1) / BITS_PER_UNIT,
4051 int_size_in_bytes (type), cleared);
4054 /* Store the value of constructor EXP into the rtx TARGET.
4055 TARGET is either a REG or a MEM.
4056 ALIGN is the maximum known alignment for TARGET, in bits.
4057 CLEARED is true if TARGET is known to have been zero'd. */
4060 store_constructor (exp, target, align, cleared)
4066 tree type = TREE_TYPE (exp);
4067 #ifdef WORD_REGISTER_OPERATIONS
4068 rtx exp_size = expr_size (exp);
4071 /* We know our target cannot conflict, since safe_from_p has been called. */
4073 /* Don't try copying piece by piece into a hard register
4074 since that is vulnerable to being clobbered by EXP.
4075 Instead, construct in a pseudo register and then copy it all. */
4076 if (GET_CODE (target) == REG && REGNO (target) < FIRST_PSEUDO_REGISTER)
4078 rtx temp = gen_reg_rtx (GET_MODE (target));
4079 store_constructor (exp, temp, 0);
4080 emit_move_insn (target, temp);
4085 if (TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
4086 || TREE_CODE (type) == QUAL_UNION_TYPE)
4090 /* Inform later passes that the whole union value is dead. */
4091 if (TREE_CODE (type) == UNION_TYPE
4092 || TREE_CODE (type) == QUAL_UNION_TYPE)
4094 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4096 /* If the constructor is empty, clear the union. */
4097 if (! CONSTRUCTOR_ELTS (exp) && ! cleared)
4098 clear_storage (target, expr_size (exp),
4099 TYPE_ALIGN (type) / BITS_PER_UNIT);
4102 /* If we are building a static constructor into a register,
4103 set the initial value as zero so we can fold the value into
4104 a constant. But if more than one register is involved,
4105 this probably loses. */
4106 else if (GET_CODE (target) == REG && TREE_STATIC (exp)
4107 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4110 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4115 /* If the constructor has fewer fields than the structure
4116 or if we are initializing the structure to mostly zeros,
4117 clear the whole structure first. */
4118 else if ((list_length (CONSTRUCTOR_ELTS (exp))
4119 != list_length (TYPE_FIELDS (type)))
4120 || mostly_zeros_p (exp))
4123 clear_storage (target, expr_size (exp),
4124 (align + BITS_PER_UNIT - 1) / BITS_PER_UNIT);
4129 /* Inform later passes that the old value is dead. */
4130 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4132 /* Store each element of the constructor into
4133 the corresponding field of TARGET. */
4135 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4137 register tree field = TREE_PURPOSE (elt);
4138 #ifdef WORD_REGISTER_OPERATIONS
4139 tree value = TREE_VALUE (elt);
4141 register enum machine_mode mode;
4145 tree pos, constant = 0, offset = 0;
4146 rtx to_rtx = target;
4148 /* Just ignore missing fields.
4149 We cleared the whole structure, above,
4150 if any fields are missing. */
4154 if (cleared && is_zeros_p (TREE_VALUE (elt)))
4157 if (TREE_CODE (DECL_SIZE (field)) == INTEGER_CST)
4158 bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
4162 unsignedp = TREE_UNSIGNED (field);
4163 mode = DECL_MODE (field);
4164 if (DECL_BIT_FIELD (field))
4167 pos = DECL_FIELD_BITPOS (field);
4168 if (TREE_CODE (pos) == INTEGER_CST)
4170 else if (TREE_CODE (pos) == PLUS_EXPR
4171 && TREE_CODE (TREE_OPERAND (pos, 1)) == INTEGER_CST)
4172 constant = TREE_OPERAND (pos, 1), offset = TREE_OPERAND (pos, 0);
4177 bitpos = TREE_INT_CST_LOW (constant);
4183 if (contains_placeholder_p (offset))
4184 offset = build (WITH_RECORD_EXPR, sizetype,
4185 offset, make_tree (TREE_TYPE (exp), target));
4187 offset = size_binop (FLOOR_DIV_EXPR, offset,
4188 size_int (BITS_PER_UNIT));
4190 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4191 if (GET_CODE (to_rtx) != MEM)
4194 if (GET_MODE (offset_rtx) != ptr_mode)
4196 #ifdef POINTERS_EXTEND_UNSIGNED
4197 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
4199 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4204 = change_address (to_rtx, VOIDmode,
4205 gen_rtx_PLUS (ptr_mode, XEXP (to_rtx, 0),
4206 force_reg (ptr_mode,
4210 if (TREE_READONLY (field))
4212 if (GET_CODE (to_rtx) == MEM)
4213 to_rtx = copy_rtx (to_rtx);
4215 RTX_UNCHANGING_P (to_rtx) = 1;
4218 #ifdef WORD_REGISTER_OPERATIONS
4219 /* If this initializes a field that is smaller than a word, at the
4220 start of a word, try to widen it to a full word.
4221 This special case allows us to output C++ member function
4222 initializations in a form that the optimizers can understand. */
4224 && GET_CODE (target) == REG
4225 && bitsize < BITS_PER_WORD
4226 && bitpos % BITS_PER_WORD == 0
4227 && GET_MODE_CLASS (mode) == MODE_INT
4228 && TREE_CODE (value) == INTEGER_CST
4229 && GET_CODE (exp_size) == CONST_INT
4230 && bitpos + BITS_PER_WORD <= INTVAL (exp_size) * BITS_PER_UNIT)
4232 tree type = TREE_TYPE (value);
4233 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4235 type = type_for_size (BITS_PER_WORD, TREE_UNSIGNED (type));
4236 value = convert (type, value);
4238 if (BYTES_BIG_ENDIAN)
4240 = fold (build (LSHIFT_EXPR, type, value,
4241 build_int_2 (BITS_PER_WORD - bitsize, 0)));
4242 bitsize = BITS_PER_WORD;
4246 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4247 TREE_VALUE (elt), type,
4249 DECL_ALIGN (TREE_PURPOSE (elt))),
4253 else if (TREE_CODE (type) == ARRAY_TYPE)
4258 tree domain = TYPE_DOMAIN (type);
4259 HOST_WIDE_INT minelt = TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain));
4260 HOST_WIDE_INT maxelt = TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain));
4261 tree elttype = TREE_TYPE (type);
4263 /* If the constructor has fewer elements than the array,
4264 clear the whole array first. Similarly if this is
4265 static constructor of a non-BLKmode object. */
4266 if (cleared || (GET_CODE (target) == REG && TREE_STATIC (exp)))
4270 HOST_WIDE_INT count = 0, zero_count = 0;
4272 /* This loop is a more accurate version of the loop in
4273 mostly_zeros_p (it handles RANGE_EXPR in an index).
4274 It is also needed to check for missing elements. */
4275 for (elt = CONSTRUCTOR_ELTS (exp);
4277 elt = TREE_CHAIN (elt))
4279 tree index = TREE_PURPOSE (elt);
4280 HOST_WIDE_INT this_node_count;
4281 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4283 tree lo_index = TREE_OPERAND (index, 0);
4284 tree hi_index = TREE_OPERAND (index, 1);
4285 if (TREE_CODE (lo_index) != INTEGER_CST
4286 || TREE_CODE (hi_index) != INTEGER_CST)
4291 this_node_count = TREE_INT_CST_LOW (hi_index)
4292 - TREE_INT_CST_LOW (lo_index) + 1;
4295 this_node_count = 1;
4296 count += this_node_count;
4297 if (mostly_zeros_p (TREE_VALUE (elt)))
4298 zero_count += this_node_count;
4300 /* Clear the entire array first if there are any missing elements,
4301 or if the incidence of zero elements is >= 75%. */
4302 if (count < maxelt - minelt + 1
4303 || 4 * zero_count >= 3 * count)
4309 clear_storage (target, expr_size (exp),
4310 (align + BITS_PER_UNIT - 1) / BITS_PER_UNIT);
4314 /* Inform later passes that the old value is dead. */
4315 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4317 /* Store each element of the constructor into
4318 the corresponding element of TARGET, determined
4319 by counting the elements. */
4320 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4322 elt = TREE_CHAIN (elt), i++)
4324 register enum machine_mode mode;
4328 tree value = TREE_VALUE (elt);
4329 int align = TYPE_ALIGN (TREE_TYPE (value));
4330 tree index = TREE_PURPOSE (elt);
4331 rtx xtarget = target;
4333 if (cleared && is_zeros_p (value))
4336 unsignedp = TREE_UNSIGNED (elttype);
4337 mode = TYPE_MODE (elttype);
4338 if (mode == BLKmode)
4340 if (TREE_CODE (TYPE_SIZE (elttype)) == INTEGER_CST
4341 && TREE_INT_CST_HIGH (TYPE_SIZE (elttype)) == 0)
4342 bitsize = TREE_INT_CST_LOW (TYPE_SIZE (elttype));
4347 bitsize = GET_MODE_BITSIZE (mode);
4349 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4351 tree lo_index = TREE_OPERAND (index, 0);
4352 tree hi_index = TREE_OPERAND (index, 1);
4353 rtx index_r, pos_rtx, addr, hi_r, loop_top, loop_end;
4354 struct nesting *loop;
4355 HOST_WIDE_INT lo, hi, count;
4358 /* If the range is constant and "small", unroll the loop. */
4359 if (TREE_CODE (lo_index) == INTEGER_CST
4360 && TREE_CODE (hi_index) == INTEGER_CST
4361 && (lo = TREE_INT_CST_LOW (lo_index),
4362 hi = TREE_INT_CST_LOW (hi_index),
4363 count = hi - lo + 1,
4364 (GET_CODE (target) != MEM
4366 || (TREE_CODE (TYPE_SIZE (elttype)) == INTEGER_CST
4367 && TREE_INT_CST_LOW (TYPE_SIZE (elttype)) * count
4370 lo -= minelt; hi -= minelt;
4371 for (; lo <= hi; lo++)
4373 bitpos = lo * TREE_INT_CST_LOW (TYPE_SIZE (elttype));
4374 store_constructor_field (target, bitsize, bitpos, mode,
4375 value, type, align, cleared);
4380 hi_r = expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4381 loop_top = gen_label_rtx ();
4382 loop_end = gen_label_rtx ();
4384 unsignedp = TREE_UNSIGNED (domain);
4386 index = build_decl (VAR_DECL, NULL_TREE, domain);
4388 DECL_RTL (index) = index_r
4389 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4392 if (TREE_CODE (value) == SAVE_EXPR
4393 && SAVE_EXPR_RTL (value) == 0)
4395 /* Make sure value gets expanded once before the
4397 expand_expr (value, const0_rtx, VOIDmode, 0);
4400 store_expr (lo_index, index_r, 0);
4401 loop = expand_start_loop (0);
4403 /* Assign value to element index. */
4404 position = size_binop (EXACT_DIV_EXPR, TYPE_SIZE (elttype),
4405 size_int (BITS_PER_UNIT));
4406 position = size_binop (MULT_EXPR,
4407 size_binop (MINUS_EXPR, index,
4408 TYPE_MIN_VALUE (domain)),
4410 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4411 addr = gen_rtx_PLUS (Pmode, XEXP (target, 0), pos_rtx);
4412 xtarget = change_address (target, mode, addr);
4413 if (TREE_CODE (value) == CONSTRUCTOR)
4414 store_constructor (value, xtarget, align, cleared);
4416 store_expr (value, xtarget, 0);
4418 expand_exit_loop_if_false (loop,
4419 build (LT_EXPR, integer_type_node,
4422 expand_increment (build (PREINCREMENT_EXPR,
4424 index, integer_one_node), 0, 0);
4426 emit_label (loop_end);
4428 /* Needed by stupid register allocation. to extend the
4429 lifetime of pseudo-regs used by target past the end
4431 emit_insn (gen_rtx_USE (GET_MODE (target), target));
4434 else if ((index != 0 && TREE_CODE (index) != INTEGER_CST)
4435 || TREE_CODE (TYPE_SIZE (elttype)) != INTEGER_CST)
4441 index = size_int (i);
4444 index = size_binop (MINUS_EXPR, index,
4445 TYPE_MIN_VALUE (domain));
4446 position = size_binop (EXACT_DIV_EXPR, TYPE_SIZE (elttype),
4447 size_int (BITS_PER_UNIT));
4448 position = size_binop (MULT_EXPR, index, position);
4449 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4450 addr = gen_rtx_PLUS (Pmode, XEXP (target, 0), pos_rtx);
4451 xtarget = change_address (target, mode, addr);
4452 store_expr (value, xtarget, 0);
4457 bitpos = ((TREE_INT_CST_LOW (index) - minelt)
4458 * TREE_INT_CST_LOW (TYPE_SIZE (elttype)));
4460 bitpos = (i * TREE_INT_CST_LOW (TYPE_SIZE (elttype)));
4461 store_constructor_field (target, bitsize, bitpos, mode, value,
4462 type, align, cleared);
4466 /* set constructor assignments */
4467 else if (TREE_CODE (type) == SET_TYPE)
4469 tree elt = CONSTRUCTOR_ELTS (exp);
4470 int nbytes = int_size_in_bytes (type), nbits;
4471 tree domain = TYPE_DOMAIN (type);
4472 tree domain_min, domain_max, bitlength;
4474 /* The default implementation strategy is to extract the constant
4475 parts of the constructor, use that to initialize the target,
4476 and then "or" in whatever non-constant ranges we need in addition.
4478 If a large set is all zero or all ones, it is
4479 probably better to set it using memset (if available) or bzero.
4480 Also, if a large set has just a single range, it may also be
4481 better to first clear all the first clear the set (using
4482 bzero/memset), and set the bits we want. */
4484 /* Check for all zeros. */
4485 if (elt == NULL_TREE)
4488 clear_storage (target, expr_size (exp),
4489 TYPE_ALIGN (type) / BITS_PER_UNIT);
4493 domain_min = convert (sizetype, TYPE_MIN_VALUE (domain));
4494 domain_max = convert (sizetype, TYPE_MAX_VALUE (domain));
4495 bitlength = size_binop (PLUS_EXPR,
4496 size_binop (MINUS_EXPR, domain_max, domain_min),
4499 if (nbytes < 0 || TREE_CODE (bitlength) != INTEGER_CST)
4501 nbits = TREE_INT_CST_LOW (bitlength);
4503 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
4504 are "complicated" (more than one range), initialize (the
4505 constant parts) by copying from a constant. */
4506 if (GET_MODE (target) != BLKmode || nbits <= 2 * BITS_PER_WORD
4507 || (nbytes <= 32 && TREE_CHAIN (elt) != NULL_TREE))
4509 int set_word_size = TYPE_ALIGN (TREE_TYPE (exp));
4510 enum machine_mode mode = mode_for_size (set_word_size, MODE_INT, 1);
4511 char *bit_buffer = (char *) alloca (nbits);
4512 HOST_WIDE_INT word = 0;
4515 int offset = 0; /* In bytes from beginning of set. */
4516 elt = get_set_constructor_bits (exp, bit_buffer, nbits);
4519 if (bit_buffer[ibit])
4521 if (BYTES_BIG_ENDIAN)
4522 word |= (1 << (set_word_size - 1 - bit_pos));
4524 word |= 1 << bit_pos;
4527 if (bit_pos >= set_word_size || ibit == nbits)
4529 if (word != 0 || ! cleared)
4531 rtx datum = GEN_INT (word);
4533 /* The assumption here is that it is safe to use
4534 XEXP if the set is multi-word, but not if
4535 it's single-word. */
4536 if (GET_CODE (target) == MEM)
4538 to_rtx = plus_constant (XEXP (target, 0), offset);
4539 to_rtx = change_address (target, mode, to_rtx);
4541 else if (offset == 0)
4545 emit_move_insn (to_rtx, datum);
4551 offset += set_word_size / BITS_PER_UNIT;
4557 /* Don't bother clearing storage if the set is all ones. */
4558 if (TREE_CHAIN (elt) != NULL_TREE
4559 || (TREE_PURPOSE (elt) == NULL_TREE
4561 : (TREE_CODE (TREE_VALUE (elt)) != INTEGER_CST
4562 || TREE_CODE (TREE_PURPOSE (elt)) != INTEGER_CST
4563 || (TREE_INT_CST_LOW (TREE_VALUE (elt))
4564 - TREE_INT_CST_LOW (TREE_PURPOSE (elt)) + 1
4566 clear_storage (target, expr_size (exp),
4567 TYPE_ALIGN (type) / BITS_PER_UNIT);
4570 for (; elt != NULL_TREE; elt = TREE_CHAIN (elt))
4572 /* start of range of element or NULL */
4573 tree startbit = TREE_PURPOSE (elt);
4574 /* end of range of element, or element value */
4575 tree endbit = TREE_VALUE (elt);
4576 #ifdef TARGET_MEM_FUNCTIONS
4577 HOST_WIDE_INT startb, endb;
4579 rtx bitlength_rtx, startbit_rtx, endbit_rtx, targetx;
4581 bitlength_rtx = expand_expr (bitlength,
4582 NULL_RTX, MEM, EXPAND_CONST_ADDRESS);
4584 /* handle non-range tuple element like [ expr ] */
4585 if (startbit == NULL_TREE)
4587 startbit = save_expr (endbit);
4590 startbit = convert (sizetype, startbit);
4591 endbit = convert (sizetype, endbit);
4592 if (! integer_zerop (domain_min))
4594 startbit = size_binop (MINUS_EXPR, startbit, domain_min);
4595 endbit = size_binop (MINUS_EXPR, endbit, domain_min);
4597 startbit_rtx = expand_expr (startbit, NULL_RTX, MEM,
4598 EXPAND_CONST_ADDRESS);
4599 endbit_rtx = expand_expr (endbit, NULL_RTX, MEM,
4600 EXPAND_CONST_ADDRESS);
4604 targetx = assign_stack_temp (GET_MODE (target),
4605 GET_MODE_SIZE (GET_MODE (target)),
4607 emit_move_insn (targetx, target);
4609 else if (GET_CODE (target) == MEM)
4614 #ifdef TARGET_MEM_FUNCTIONS
4615 /* Optimization: If startbit and endbit are
4616 constants divisible by BITS_PER_UNIT,
4617 call memset instead. */
4618 if (TREE_CODE (startbit) == INTEGER_CST
4619 && TREE_CODE (endbit) == INTEGER_CST
4620 && (startb = TREE_INT_CST_LOW (startbit)) % BITS_PER_UNIT == 0
4621 && (endb = TREE_INT_CST_LOW (endbit) + 1) % BITS_PER_UNIT == 0)
4623 emit_library_call (memset_libfunc, 0,
4625 plus_constant (XEXP (targetx, 0),
4626 startb / BITS_PER_UNIT),
4628 constm1_rtx, TYPE_MODE (integer_type_node),
4629 GEN_INT ((endb - startb) / BITS_PER_UNIT),
4630 TYPE_MODE (sizetype));
4635 emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "__setbits"),
4636 0, VOIDmode, 4, XEXP (targetx, 0), Pmode,
4637 bitlength_rtx, TYPE_MODE (sizetype),
4638 startbit_rtx, TYPE_MODE (sizetype),
4639 endbit_rtx, TYPE_MODE (sizetype));
4642 emit_move_insn (target, targetx);
4650 /* Store the value of EXP (an expression tree)
4651 into a subfield of TARGET which has mode MODE and occupies
4652 BITSIZE bits, starting BITPOS bits from the start of TARGET.
4653 If MODE is VOIDmode, it means that we are storing into a bit-field.
4655 If VALUE_MODE is VOIDmode, return nothing in particular.
4656 UNSIGNEDP is not used in this case.
4658 Otherwise, return an rtx for the value stored. This rtx
4659 has mode VALUE_MODE if that is convenient to do.
4660 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
4662 ALIGN is the alignment that TARGET is known to have, measured in bytes.
4663 TOTAL_SIZE is the size in bytes of the structure, or -1 if varying.
4665 ALIAS_SET is the alias set for the destination. This value will
4666 (in general) be different from that for TARGET, since TARGET is a
4667 reference to the containing structure. */
4670 store_field (target, bitsize, bitpos, mode, exp, value_mode,
4671 unsignedp, align, total_size, alias_set)
4673 int bitsize, bitpos;
4674 enum machine_mode mode;
4676 enum machine_mode value_mode;
4682 HOST_WIDE_INT width_mask = 0;
4684 if (TREE_CODE (exp) == ERROR_MARK)
4687 if (bitsize < HOST_BITS_PER_WIDE_INT)
4688 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
4690 /* If we are storing into an unaligned field of an aligned union that is
4691 in a register, we may have the mode of TARGET being an integer mode but
4692 MODE == BLKmode. In that case, get an aligned object whose size and
4693 alignment are the same as TARGET and store TARGET into it (we can avoid
4694 the store if the field being stored is the entire width of TARGET). Then
4695 call ourselves recursively to store the field into a BLKmode version of
4696 that object. Finally, load from the object into TARGET. This is not
4697 very efficient in general, but should only be slightly more expensive
4698 than the otherwise-required unaligned accesses. Perhaps this can be
4699 cleaned up later. */
4702 && (GET_CODE (target) == REG || GET_CODE (target) == SUBREG))
4704 rtx object = assign_stack_temp (GET_MODE (target),
4705 GET_MODE_SIZE (GET_MODE (target)), 0);
4706 rtx blk_object = copy_rtx (object);
4708 MEM_SET_IN_STRUCT_P (object, 1);
4709 MEM_SET_IN_STRUCT_P (blk_object, 1);
4710 PUT_MODE (blk_object, BLKmode);
4712 if (bitsize != GET_MODE_BITSIZE (GET_MODE (target)))
4713 emit_move_insn (object, target);
4715 store_field (blk_object, bitsize, bitpos, mode, exp, VOIDmode, 0,
4716 align, total_size, alias_set);
4718 /* Even though we aren't returning target, we need to
4719 give it the updated value. */
4720 emit_move_insn (target, object);
4725 /* If the structure is in a register or if the component
4726 is a bit field, we cannot use addressing to access it.
4727 Use bit-field techniques or SUBREG to store in it. */
4729 if (mode == VOIDmode
4730 || (mode != BLKmode && ! direct_store[(int) mode]
4731 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
4732 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
4733 || GET_CODE (target) == REG
4734 || GET_CODE (target) == SUBREG
4735 /* If the field isn't aligned enough to store as an ordinary memref,
4736 store it as a bit field. */
4737 || (mode != BLKmode && SLOW_UNALIGNED_ACCESS
4738 && (align * BITS_PER_UNIT < GET_MODE_ALIGNMENT (mode)
4739 || bitpos % GET_MODE_ALIGNMENT (mode)))
4740 || (mode == BLKmode && SLOW_UNALIGNED_ACCESS
4741 && (TYPE_ALIGN (TREE_TYPE (exp)) > align * BITS_PER_UNIT
4742 || bitpos % TYPE_ALIGN (TREE_TYPE (exp)) != 0))
4743 /* If the RHS and field are a constant size and the size of the
4744 RHS isn't the same size as the bitfield, we must use bitfield
4747 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST)
4748 && (TREE_INT_CST_HIGH (TYPE_SIZE (TREE_TYPE (exp))) != 0
4749 || TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp))) != bitsize)))
4751 rtx temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
4753 /* If BITSIZE is narrower than the size of the type of EXP
4754 we will be narrowing TEMP. Normally, what's wanted are the
4755 low-order bits. However, if EXP's type is a record and this is
4756 big-endian machine, we want the upper BITSIZE bits. */
4757 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
4758 && bitsize < GET_MODE_BITSIZE (GET_MODE (temp))
4759 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
4760 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
4761 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
4765 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
4767 if (mode != VOIDmode && mode != BLKmode
4768 && mode != TYPE_MODE (TREE_TYPE (exp)))
4769 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
4771 /* If the modes of TARGET and TEMP are both BLKmode, both
4772 must be in memory and BITPOS must be aligned on a byte
4773 boundary. If so, we simply do a block copy. */
4774 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
4776 if (GET_CODE (target) != MEM || GET_CODE (temp) != MEM
4777 || bitpos % BITS_PER_UNIT != 0)
4780 target = change_address (target, VOIDmode,
4781 plus_constant (XEXP (target, 0),
4782 bitpos / BITS_PER_UNIT));
4784 /* Find an alignment that is consistent with the bit position. */
4785 while ((bitpos % (align * BITS_PER_UNIT)) != 0)
4788 emit_block_move (target, temp,
4789 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
4793 return value_mode == VOIDmode ? const0_rtx : target;
4796 /* Store the value in the bitfield. */
4797 store_bit_field (target, bitsize, bitpos, mode, temp, align, total_size);
4798 if (value_mode != VOIDmode)
4800 /* The caller wants an rtx for the value. */
4801 /* If possible, avoid refetching from the bitfield itself. */
4803 && ! (GET_CODE (target) == MEM && MEM_VOLATILE_P (target)))
4806 enum machine_mode tmode;
4809 return expand_and (temp, GEN_INT (width_mask), NULL_RTX);
4810 tmode = GET_MODE (temp);
4811 if (tmode == VOIDmode)
4813 count = build_int_2 (GET_MODE_BITSIZE (tmode) - bitsize, 0);
4814 temp = expand_shift (LSHIFT_EXPR, tmode, temp, count, 0, 0);
4815 return expand_shift (RSHIFT_EXPR, tmode, temp, count, 0, 0);
4817 return extract_bit_field (target, bitsize, bitpos, unsignedp,
4818 NULL_RTX, value_mode, 0, align,
4825 rtx addr = XEXP (target, 0);
4828 /* If a value is wanted, it must be the lhs;
4829 so make the address stable for multiple use. */
4831 if (value_mode != VOIDmode && GET_CODE (addr) != REG
4832 && ! CONSTANT_ADDRESS_P (addr)
4833 /* A frame-pointer reference is already stable. */
4834 && ! (GET_CODE (addr) == PLUS
4835 && GET_CODE (XEXP (addr, 1)) == CONST_INT
4836 && (XEXP (addr, 0) == virtual_incoming_args_rtx
4837 || XEXP (addr, 0) == virtual_stack_vars_rtx)))
4838 addr = copy_to_reg (addr);
4840 /* Now build a reference to just the desired component. */
4842 to_rtx = copy_rtx (change_address (target, mode,
4843 plus_constant (addr,
4845 / BITS_PER_UNIT))));
4846 MEM_SET_IN_STRUCT_P (to_rtx, 1);
4847 MEM_ALIAS_SET (to_rtx) = alias_set;
4849 return store_expr (exp, to_rtx, value_mode != VOIDmode);
4853 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
4854 or an ARRAY_REF, look for nested COMPONENT_REFs, BIT_FIELD_REFs, or
4855 ARRAY_REFs and find the ultimate containing object, which we return.
4857 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
4858 bit position, and *PUNSIGNEDP to the signedness of the field.
4859 If the position of the field is variable, we store a tree
4860 giving the variable offset (in units) in *POFFSET.
4861 This offset is in addition to the bit position.
4862 If the position is not variable, we store 0 in *POFFSET.
4863 We set *PALIGNMENT to the alignment in bytes of the address that will be
4864 computed. This is the alignment of the thing we return if *POFFSET
4865 is zero, but can be more less strictly aligned if *POFFSET is nonzero.
4867 If any of the extraction expressions is volatile,
4868 we store 1 in *PVOLATILEP. Otherwise we don't change that.
4870 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
4871 is a mode that can be used to access the field. In that case, *PBITSIZE
4874 If the field describes a variable-sized object, *PMODE is set to
4875 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
4876 this case, but the address of the object can be found. */
4879 get_inner_reference (exp, pbitsize, pbitpos, poffset, pmode,
4880 punsignedp, pvolatilep, palignment)
4885 enum machine_mode *pmode;
4890 tree orig_exp = exp;
4892 enum machine_mode mode = VOIDmode;
4893 tree offset = integer_zero_node;
4894 unsigned int alignment = BIGGEST_ALIGNMENT;
4896 if (TREE_CODE (exp) == COMPONENT_REF)
4898 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
4899 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
4900 mode = DECL_MODE (TREE_OPERAND (exp, 1));
4901 *punsignedp = TREE_UNSIGNED (TREE_OPERAND (exp, 1));
4903 else if (TREE_CODE (exp) == BIT_FIELD_REF)
4905 size_tree = TREE_OPERAND (exp, 1);
4906 *punsignedp = TREE_UNSIGNED (exp);
4910 mode = TYPE_MODE (TREE_TYPE (exp));
4911 if (mode == BLKmode)
4912 size_tree = TYPE_SIZE (TREE_TYPE (exp));
4914 *pbitsize = GET_MODE_BITSIZE (mode);
4915 *punsignedp = TREE_UNSIGNED (TREE_TYPE (exp));
4920 if (TREE_CODE (size_tree) != INTEGER_CST)
4921 mode = BLKmode, *pbitsize = -1;
4923 *pbitsize = TREE_INT_CST_LOW (size_tree);
4926 /* Compute cumulative bit-offset for nested component-refs and array-refs,
4927 and find the ultimate containing object. */
4933 if (TREE_CODE (exp) == COMPONENT_REF || TREE_CODE (exp) == BIT_FIELD_REF)
4935 tree pos = (TREE_CODE (exp) == COMPONENT_REF
4936 ? DECL_FIELD_BITPOS (TREE_OPERAND (exp, 1))
4937 : TREE_OPERAND (exp, 2));
4938 tree constant = integer_zero_node, var = pos;
4940 /* If this field hasn't been filled in yet, don't go
4941 past it. This should only happen when folding expressions
4942 made during type construction. */
4946 /* Assume here that the offset is a multiple of a unit.
4947 If not, there should be an explicitly added constant. */
4948 if (TREE_CODE (pos) == PLUS_EXPR
4949 && TREE_CODE (TREE_OPERAND (pos, 1)) == INTEGER_CST)
4950 constant = TREE_OPERAND (pos, 1), var = TREE_OPERAND (pos, 0);
4951 else if (TREE_CODE (pos) == INTEGER_CST)
4952 constant = pos, var = integer_zero_node;
4954 *pbitpos += TREE_INT_CST_LOW (constant);
4955 offset = size_binop (PLUS_EXPR, offset,
4956 size_binop (EXACT_DIV_EXPR, var,
4957 size_int (BITS_PER_UNIT)));
4960 else if (TREE_CODE (exp) == ARRAY_REF)
4962 /* This code is based on the code in case ARRAY_REF in expand_expr
4963 below. We assume here that the size of an array element is
4964 always an integral multiple of BITS_PER_UNIT. */
4966 tree index = TREE_OPERAND (exp, 1);
4967 tree domain = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
4969 = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
4970 tree index_type = TREE_TYPE (index);
4973 if (TYPE_PRECISION (index_type) != TYPE_PRECISION (sizetype))
4975 index = convert (type_for_size (TYPE_PRECISION (sizetype), 0),
4977 index_type = TREE_TYPE (index);
4980 /* Optimize the special-case of a zero lower bound.
4982 We convert the low_bound to sizetype to avoid some problems
4983 with constant folding. (E.g. suppose the lower bound is 1,
4984 and its mode is QI. Without the conversion, (ARRAY
4985 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
4986 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
4988 But sizetype isn't quite right either (especially if
4989 the lowbound is negative). FIXME */
4991 if (! integer_zerop (low_bound))
4992 index = fold (build (MINUS_EXPR, index_type, index,
4993 convert (sizetype, low_bound)));
4995 if (TREE_CODE (index) == INTEGER_CST)
4997 index = convert (sbitsizetype, index);
4998 index_type = TREE_TYPE (index);
5001 xindex = fold (build (MULT_EXPR, sbitsizetype, index,
5002 convert (sbitsizetype,
5003 TYPE_SIZE (TREE_TYPE (exp)))));
5005 if (TREE_CODE (xindex) == INTEGER_CST
5006 && TREE_INT_CST_HIGH (xindex) == 0)
5007 *pbitpos += TREE_INT_CST_LOW (xindex);
5010 /* Either the bit offset calculated above is not constant, or
5011 it overflowed. In either case, redo the multiplication
5012 against the size in units. This is especially important
5013 in the non-constant case to avoid a division at runtime. */
5014 xindex = fold (build (MULT_EXPR, ssizetype, index,
5016 TYPE_SIZE_UNIT (TREE_TYPE (exp)))));
5018 if (contains_placeholder_p (xindex))
5019 xindex = build (WITH_RECORD_EXPR, sizetype, xindex, exp);
5021 offset = size_binop (PLUS_EXPR, offset, xindex);
5024 else if (TREE_CODE (exp) != NON_LVALUE_EXPR
5025 && ! ((TREE_CODE (exp) == NOP_EXPR
5026 || TREE_CODE (exp) == CONVERT_EXPR)
5027 && (TYPE_MODE (TREE_TYPE (exp))
5028 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))))
5031 /* If any reference in the chain is volatile, the effect is volatile. */
5032 if (TREE_THIS_VOLATILE (exp))
5035 /* If the offset is non-constant already, then we can't assume any
5036 alignment more than the alignment here. */
5037 if (! integer_zerop (offset))
5038 alignment = MIN (alignment, TYPE_ALIGN (TREE_TYPE (exp)));
5040 exp = TREE_OPERAND (exp, 0);
5043 if (TREE_CODE_CLASS (TREE_CODE (exp)) == 'd')
5044 alignment = MIN (alignment, DECL_ALIGN (exp));
5045 else if (TREE_TYPE (exp) != 0)
5046 alignment = MIN (alignment, TYPE_ALIGN (TREE_TYPE (exp)));
5048 if (integer_zerop (offset))
5051 if (offset != 0 && contains_placeholder_p (offset))
5052 offset = build (WITH_RECORD_EXPR, sizetype, offset, orig_exp);
5056 *palignment = alignment / BITS_PER_UNIT;
5060 /* Subroutine of expand_exp: compute memory_usage from modifier. */
5061 static enum memory_use_mode
5062 get_memory_usage_from_modifier (modifier)
5063 enum expand_modifier modifier;
5069 return MEMORY_USE_RO;
5071 case EXPAND_MEMORY_USE_WO:
5072 return MEMORY_USE_WO;
5074 case EXPAND_MEMORY_USE_RW:
5075 return MEMORY_USE_RW;
5077 case EXPAND_MEMORY_USE_DONT:
5078 /* EXPAND_CONST_ADDRESS and EXPAND_INITIALIZER are converted into
5079 MEMORY_USE_DONT, because they are modifiers to a call of
5080 expand_expr in the ADDR_EXPR case of expand_expr. */
5081 case EXPAND_CONST_ADDRESS:
5082 case EXPAND_INITIALIZER:
5083 return MEMORY_USE_DONT;
5084 case EXPAND_MEMORY_USE_BAD:
5090 /* Given an rtx VALUE that may contain additions and multiplications,
5091 return an equivalent value that just refers to a register or memory.
5092 This is done by generating instructions to perform the arithmetic
5093 and returning a pseudo-register containing the value.
5095 The returned value may be a REG, SUBREG, MEM or constant. */
5098 force_operand (value, target)
5101 register optab binoptab = 0;
5102 /* Use a temporary to force order of execution of calls to
5106 /* Use subtarget as the target for operand 0 of a binary operation. */
5107 register rtx subtarget = (target != 0 && GET_CODE (target) == REG ? target : 0);
5109 /* Check for a PIC address load. */
5111 && (GET_CODE (value) == PLUS || GET_CODE (value) == MINUS)
5112 && XEXP (value, 0) == pic_offset_table_rtx
5113 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5114 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5115 || GET_CODE (XEXP (value, 1)) == CONST))
5118 subtarget = gen_reg_rtx (GET_MODE (value));
5119 emit_move_insn (subtarget, value);
5123 if (GET_CODE (value) == PLUS)
5124 binoptab = add_optab;
5125 else if (GET_CODE (value) == MINUS)
5126 binoptab = sub_optab;
5127 else if (GET_CODE (value) == MULT)
5129 op2 = XEXP (value, 1);
5130 if (!CONSTANT_P (op2)
5131 && !(GET_CODE (op2) == REG && op2 != subtarget))
5133 tmp = force_operand (XEXP (value, 0), subtarget);
5134 return expand_mult (GET_MODE (value), tmp,
5135 force_operand (op2, NULL_RTX),
5141 op2 = XEXP (value, 1);
5142 if (!CONSTANT_P (op2)
5143 && !(GET_CODE (op2) == REG && op2 != subtarget))
5145 if (binoptab == sub_optab && GET_CODE (op2) == CONST_INT)
5147 binoptab = add_optab;
5148 op2 = negate_rtx (GET_MODE (value), op2);
5151 /* Check for an addition with OP2 a constant integer and our first
5152 operand a PLUS of a virtual register and something else. In that
5153 case, we want to emit the sum of the virtual register and the
5154 constant first and then add the other value. This allows virtual
5155 register instantiation to simply modify the constant rather than
5156 creating another one around this addition. */
5157 if (binoptab == add_optab && GET_CODE (op2) == CONST_INT
5158 && GET_CODE (XEXP (value, 0)) == PLUS
5159 && GET_CODE (XEXP (XEXP (value, 0), 0)) == REG
5160 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5161 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5163 rtx temp = expand_binop (GET_MODE (value), binoptab,
5164 XEXP (XEXP (value, 0), 0), op2,
5165 subtarget, 0, OPTAB_LIB_WIDEN);
5166 return expand_binop (GET_MODE (value), binoptab, temp,
5167 force_operand (XEXP (XEXP (value, 0), 1), 0),
5168 target, 0, OPTAB_LIB_WIDEN);
5171 tmp = force_operand (XEXP (value, 0), subtarget);
5172 return expand_binop (GET_MODE (value), binoptab, tmp,
5173 force_operand (op2, NULL_RTX),
5174 target, 0, OPTAB_LIB_WIDEN);
5175 /* We give UNSIGNEDP = 0 to expand_binop
5176 because the only operations we are expanding here are signed ones. */
5181 /* Subroutine of expand_expr:
5182 save the non-copied parts (LIST) of an expr (LHS), and return a list
5183 which can restore these values to their previous values,
5184 should something modify their storage. */
5187 save_noncopied_parts (lhs, list)
5194 for (tail = list; tail; tail = TREE_CHAIN (tail))
5195 if (TREE_CODE (TREE_VALUE (tail)) == TREE_LIST)
5196 parts = chainon (parts, save_noncopied_parts (lhs, TREE_VALUE (tail)));
5199 tree part = TREE_VALUE (tail);
5200 tree part_type = TREE_TYPE (part);
5201 tree to_be_saved = build (COMPONENT_REF, part_type, lhs, part);
5202 rtx target = assign_temp (part_type, 0, 1, 1);
5203 if (! memory_address_p (TYPE_MODE (part_type), XEXP (target, 0)))
5204 target = change_address (target, TYPE_MODE (part_type), NULL_RTX);
5205 parts = tree_cons (to_be_saved,
5206 build (RTL_EXPR, part_type, NULL_TREE,
5209 store_expr (TREE_PURPOSE (parts), RTL_EXPR_RTL (TREE_VALUE (parts)), 0);
5214 /* Subroutine of expand_expr:
5215 record the non-copied parts (LIST) of an expr (LHS), and return a list
5216 which specifies the initial values of these parts. */
5219 init_noncopied_parts (lhs, list)
5226 for (tail = list; tail; tail = TREE_CHAIN (tail))
5227 if (TREE_CODE (TREE_VALUE (tail)) == TREE_LIST)
5228 parts = chainon (parts, init_noncopied_parts (lhs, TREE_VALUE (tail)));
5229 else if (TREE_PURPOSE (tail))
5231 tree part = TREE_VALUE (tail);
5232 tree part_type = TREE_TYPE (part);
5233 tree to_be_initialized = build (COMPONENT_REF, part_type, lhs, part);
5234 parts = tree_cons (TREE_PURPOSE (tail), to_be_initialized, parts);
5239 /* Subroutine of expand_expr: return nonzero iff there is no way that
5240 EXP can reference X, which is being modified. TOP_P is nonzero if this
5241 call is going to be used to determine whether we need a temporary
5242 for EXP, as opposed to a recursive call to this function.
5244 It is always safe for this routine to return zero since it merely
5245 searches for optimization opportunities. */
5248 safe_from_p (x, exp, top_p)
5255 static int save_expr_count;
5256 static int save_expr_size = 0;
5257 static tree *save_expr_rewritten;
5258 static tree save_expr_trees[256];
5261 /* If EXP has varying size, we MUST use a target since we currently
5262 have no way of allocating temporaries of variable size
5263 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5264 So we assume here that something at a higher level has prevented a
5265 clash. This is somewhat bogus, but the best we can do. Only
5266 do this when X is BLKmode and when we are at the top level. */
5267 || (top_p && TREE_TYPE (exp) != 0 && TYPE_SIZE (TREE_TYPE (exp)) != 0
5268 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5269 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5270 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5271 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5273 && GET_MODE (x) == BLKmode))
5276 if (top_p && save_expr_size == 0)
5280 save_expr_count = 0;
5281 save_expr_size = sizeof (save_expr_trees) / sizeof (save_expr_trees[0]);
5282 save_expr_rewritten = &save_expr_trees[0];
5284 rtn = safe_from_p (x, exp, 1);
5286 for (i = 0; i < save_expr_count; ++i)
5288 if (TREE_CODE (save_expr_trees[i]) != ERROR_MARK)
5290 TREE_SET_CODE (save_expr_trees[i], SAVE_EXPR);
5298 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5299 find the underlying pseudo. */
5300 if (GET_CODE (x) == SUBREG)
5303 if (GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5307 /* If X is a location in the outgoing argument area, it is always safe. */
5308 if (GET_CODE (x) == MEM
5309 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5310 || (GET_CODE (XEXP (x, 0)) == PLUS
5311 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx)))
5314 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5317 exp_rtl = DECL_RTL (exp);
5324 if (TREE_CODE (exp) == TREE_LIST)
5325 return ((TREE_VALUE (exp) == 0
5326 || safe_from_p (x, TREE_VALUE (exp), 0))
5327 && (TREE_CHAIN (exp) == 0
5328 || safe_from_p (x, TREE_CHAIN (exp), 0)));
5329 else if (TREE_CODE (exp) == ERROR_MARK)
5330 return 1; /* An already-visited SAVE_EXPR? */
5335 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5339 return (safe_from_p (x, TREE_OPERAND (exp, 0), 0)
5340 && safe_from_p (x, TREE_OPERAND (exp, 1), 0));
5344 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5345 the expression. If it is set, we conflict iff we are that rtx or
5346 both are in memory. Otherwise, we check all operands of the
5347 expression recursively. */
5349 switch (TREE_CODE (exp))
5352 return (staticp (TREE_OPERAND (exp, 0))
5353 || safe_from_p (x, TREE_OPERAND (exp, 0), 0)
5354 || TREE_STATIC (exp));
5357 if (GET_CODE (x) == MEM)
5362 exp_rtl = CALL_EXPR_RTL (exp);
5365 /* Assume that the call will clobber all hard registers and
5367 if ((GET_CODE (x) == REG && REGNO (x) < FIRST_PSEUDO_REGISTER)
5368 || GET_CODE (x) == MEM)
5375 /* If a sequence exists, we would have to scan every instruction
5376 in the sequence to see if it was safe. This is probably not
5378 if (RTL_EXPR_SEQUENCE (exp))
5381 exp_rtl = RTL_EXPR_RTL (exp);
5384 case WITH_CLEANUP_EXPR:
5385 exp_rtl = RTL_EXPR_RTL (exp);
5388 case CLEANUP_POINT_EXPR:
5389 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5392 exp_rtl = SAVE_EXPR_RTL (exp);
5396 /* This SAVE_EXPR might appear many times in the top-level
5397 safe_from_p() expression, and if it has a complex
5398 subexpression, examining it multiple times could result
5399 in a combinatorial explosion. E.g. on an Alpha
5400 running at least 200MHz, a Fortran test case compiled with
5401 optimization took about 28 minutes to compile -- even though
5402 it was only a few lines long, and the complicated line causing
5403 so much time to be spent in the earlier version of safe_from_p()
5404 had only 293 or so unique nodes.
5406 So, turn this SAVE_EXPR into an ERROR_MARK for now, but remember
5407 where it is so we can turn it back in the top-level safe_from_p()
5410 /* For now, don't bother re-sizing the array. */
5411 if (save_expr_count >= save_expr_size)
5413 save_expr_rewritten[save_expr_count++] = exp;
5415 nops = tree_code_length[(int) SAVE_EXPR];
5416 for (i = 0; i < nops; i++)
5418 tree operand = TREE_OPERAND (exp, i);
5419 if (operand == NULL_TREE)
5421 TREE_SET_CODE (exp, ERROR_MARK);
5422 if (!safe_from_p (x, operand, 0))
5424 TREE_SET_CODE (exp, SAVE_EXPR);
5426 TREE_SET_CODE (exp, ERROR_MARK);
5430 /* The only operand we look at is operand 1. The rest aren't
5431 part of the expression. */
5432 return safe_from_p (x, TREE_OPERAND (exp, 1), 0);
5434 case METHOD_CALL_EXPR:
5435 /* This takes a rtx argument, but shouldn't appear here. */
5442 /* If we have an rtx, we do not need to scan our operands. */
5446 nops = tree_code_length[(int) TREE_CODE (exp)];
5447 for (i = 0; i < nops; i++)
5448 if (TREE_OPERAND (exp, i) != 0
5449 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5453 /* If we have an rtl, find any enclosed object. Then see if we conflict
5457 if (GET_CODE (exp_rtl) == SUBREG)
5459 exp_rtl = SUBREG_REG (exp_rtl);
5460 if (GET_CODE (exp_rtl) == REG
5461 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5465 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5466 are memory and EXP is not readonly. */
5467 return ! (rtx_equal_p (x, exp_rtl)
5468 || (GET_CODE (x) == MEM && GET_CODE (exp_rtl) == MEM
5469 && ! TREE_READONLY (exp)));
5472 /* If we reach here, it is safe. */
5476 /* Subroutine of expand_expr: return nonzero iff EXP is an
5477 expression whose type is statically determinable. */
5483 if (TREE_CODE (exp) == PARM_DECL
5484 || TREE_CODE (exp) == VAR_DECL
5485 || TREE_CODE (exp) == CALL_EXPR || TREE_CODE (exp) == TARGET_EXPR
5486 || TREE_CODE (exp) == COMPONENT_REF
5487 || TREE_CODE (exp) == ARRAY_REF)
5492 /* Subroutine of expand_expr: return rtx if EXP is a
5493 variable or parameter; else return 0. */
5500 switch (TREE_CODE (exp))
5504 return DECL_RTL (exp);
5510 #ifdef MAX_INTEGER_COMPUTATION_MODE
5512 check_max_integer_computation_mode (exp)
5515 enum tree_code code;
5516 enum machine_mode mode;
5518 /* Strip any NOPs that don't change the mode. */
5520 code = TREE_CODE (exp);
5522 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
5523 if (code == NOP_EXPR
5524 && TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
5527 /* First check the type of the overall operation. We need only look at
5528 unary, binary and relational operations. */
5529 if (TREE_CODE_CLASS (code) == '1'
5530 || TREE_CODE_CLASS (code) == '2'
5531 || TREE_CODE_CLASS (code) == '<')
5533 mode = TYPE_MODE (TREE_TYPE (exp));
5534 if (GET_MODE_CLASS (mode) == MODE_INT
5535 && mode > MAX_INTEGER_COMPUTATION_MODE)
5536 fatal ("unsupported wide integer operation");
5539 /* Check operand of a unary op. */
5540 if (TREE_CODE_CLASS (code) == '1')
5542 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5543 if (GET_MODE_CLASS (mode) == MODE_INT
5544 && mode > MAX_INTEGER_COMPUTATION_MODE)
5545 fatal ("unsupported wide integer operation");
5548 /* Check operands of a binary/comparison op. */
5549 if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<')
5551 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5552 if (GET_MODE_CLASS (mode) == MODE_INT
5553 && mode > MAX_INTEGER_COMPUTATION_MODE)
5554 fatal ("unsupported wide integer operation");
5556 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1)));
5557 if (GET_MODE_CLASS (mode) == MODE_INT
5558 && mode > MAX_INTEGER_COMPUTATION_MODE)
5559 fatal ("unsupported wide integer operation");
5565 /* Utility function used by expand_expr to see if TYPE, a RECORD_TYPE,
5566 has any readonly fields. If any of the fields have types that
5567 contain readonly fields, return true as well. */
5570 readonly_fields_p (type)
5575 for (field = TYPE_FIELDS (type); field != 0; field = TREE_CHAIN (field))
5576 if (TREE_CODE (field) == FIELD_DECL
5577 && (TREE_READONLY (field)
5578 || (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
5579 && readonly_fields_p (TREE_TYPE (field)))))
5585 /* expand_expr: generate code for computing expression EXP.
5586 An rtx for the computed value is returned. The value is never null.
5587 In the case of a void EXP, const0_rtx is returned.
5589 The value may be stored in TARGET if TARGET is nonzero.
5590 TARGET is just a suggestion; callers must assume that
5591 the rtx returned may not be the same as TARGET.
5593 If TARGET is CONST0_RTX, it means that the value will be ignored.
5595 If TMODE is not VOIDmode, it suggests generating the
5596 result in mode TMODE. But this is done only when convenient.
5597 Otherwise, TMODE is ignored and the value generated in its natural mode.
5598 TMODE is just a suggestion; callers must assume that
5599 the rtx returned may not have mode TMODE.
5601 Note that TARGET may have neither TMODE nor MODE. In that case, it
5602 probably will not be used.
5604 If MODIFIER is EXPAND_SUM then when EXP is an addition
5605 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
5606 or a nest of (PLUS ...) and (MINUS ...) where the terms are
5607 products as above, or REG or MEM, or constant.
5608 Ordinarily in such cases we would output mul or add instructions
5609 and then return a pseudo reg containing the sum.
5611 EXPAND_INITIALIZER is much like EXPAND_SUM except that
5612 it also marks a label as absolutely required (it can't be dead).
5613 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
5614 This is used for outputting expressions used in initializers.
5616 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
5617 with a constant address even if that address is not normally legitimate.
5618 EXPAND_INITIALIZER and EXPAND_SUM also have this effect. */
5621 expand_expr (exp, target, tmode, modifier)
5624 enum machine_mode tmode;
5625 enum expand_modifier modifier;
5627 register rtx op0, op1, temp;
5628 tree type = TREE_TYPE (exp);
5629 int unsignedp = TREE_UNSIGNED (type);
5630 register enum machine_mode mode;
5631 register enum tree_code code = TREE_CODE (exp);
5633 rtx subtarget, original_target;
5636 /* Used by check-memory-usage to make modifier read only. */
5637 enum expand_modifier ro_modifier;
5639 /* Handle ERROR_MARK before anybody tries to access its type. */
5640 if (TREE_CODE (exp) == ERROR_MARK)
5642 op0 = CONST0_RTX (tmode);
5648 mode = TYPE_MODE (type);
5649 /* Use subtarget as the target for operand 0 of a binary operation. */
5650 subtarget = (target != 0 && GET_CODE (target) == REG ? target : 0);
5651 original_target = target;
5652 ignore = (target == const0_rtx
5653 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
5654 || code == CONVERT_EXPR || code == REFERENCE_EXPR
5655 || code == COND_EXPR)
5656 && TREE_CODE (type) == VOID_TYPE));
5658 /* Make a read-only version of the modifier. */
5659 if (modifier == EXPAND_NORMAL || modifier == EXPAND_SUM
5660 || modifier == EXPAND_CONST_ADDRESS || modifier == EXPAND_INITIALIZER)
5661 ro_modifier = modifier;
5663 ro_modifier = EXPAND_NORMAL;
5665 /* Don't use hard regs as subtargets, because the combiner
5666 can only handle pseudo regs. */
5667 if (subtarget && REGNO (subtarget) < FIRST_PSEUDO_REGISTER)
5669 /* Avoid subtargets inside loops,
5670 since they hide some invariant expressions. */
5671 if (preserve_subexpressions_p ())
5674 /* If we are going to ignore this result, we need only do something
5675 if there is a side-effect somewhere in the expression. If there
5676 is, short-circuit the most common cases here. Note that we must
5677 not call expand_expr with anything but const0_rtx in case this
5678 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
5682 if (! TREE_SIDE_EFFECTS (exp))
5685 /* Ensure we reference a volatile object even if value is ignored, but
5686 don't do this if all we are doing is taking its address. */
5687 if (TREE_THIS_VOLATILE (exp)
5688 && TREE_CODE (exp) != FUNCTION_DECL
5689 && mode != VOIDmode && mode != BLKmode
5690 && modifier != EXPAND_CONST_ADDRESS)
5692 temp = expand_expr (exp, NULL_RTX, VOIDmode, ro_modifier);
5693 if (GET_CODE (temp) == MEM)
5694 temp = copy_to_reg (temp);
5698 if (TREE_CODE_CLASS (code) == '1' || code == COMPONENT_REF
5699 || code == INDIRECT_REF || code == BUFFER_REF)
5700 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx,
5701 VOIDmode, ro_modifier);
5702 else if (TREE_CODE_CLASS (code) == '2' || TREE_CODE_CLASS (code) == '<'
5703 || code == ARRAY_REF)
5705 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, ro_modifier);
5706 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, ro_modifier);
5709 else if ((code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
5710 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1)))
5711 /* If the second operand has no side effects, just evaluate
5713 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx,
5714 VOIDmode, ro_modifier);
5715 else if (code == BIT_FIELD_REF)
5717 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, ro_modifier);
5718 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, ro_modifier);
5719 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, ro_modifier);
5726 #ifdef MAX_INTEGER_COMPUTATION_MODE
5727 /* Only check stuff here if the mode we want is different from the mode
5728 of the expression; if it's the same, check_max_integer_computiation_mode
5729 will handle it. Do we really need to check this stuff at all? */
5732 && GET_MODE (target) != mode
5733 && TREE_CODE (exp) != INTEGER_CST
5734 && TREE_CODE (exp) != PARM_DECL
5735 && TREE_CODE (exp) != ARRAY_REF
5736 && TREE_CODE (exp) != COMPONENT_REF
5737 && TREE_CODE (exp) != BIT_FIELD_REF
5738 && TREE_CODE (exp) != INDIRECT_REF
5739 && TREE_CODE (exp) != CALL_EXPR
5740 && TREE_CODE (exp) != VAR_DECL
5741 && TREE_CODE (exp) != RTL_EXPR)
5743 enum machine_mode mode = GET_MODE (target);
5745 if (GET_MODE_CLASS (mode) == MODE_INT
5746 && mode > MAX_INTEGER_COMPUTATION_MODE)
5747 fatal ("unsupported wide integer operation");
5751 && TREE_CODE (exp) != INTEGER_CST
5752 && TREE_CODE (exp) != PARM_DECL
5753 && TREE_CODE (exp) != ARRAY_REF
5754 && TREE_CODE (exp) != COMPONENT_REF
5755 && TREE_CODE (exp) != BIT_FIELD_REF
5756 && TREE_CODE (exp) != INDIRECT_REF
5757 && TREE_CODE (exp) != VAR_DECL
5758 && TREE_CODE (exp) != CALL_EXPR
5759 && TREE_CODE (exp) != RTL_EXPR
5760 && GET_MODE_CLASS (tmode) == MODE_INT
5761 && tmode > MAX_INTEGER_COMPUTATION_MODE)
5762 fatal ("unsupported wide integer operation");
5764 check_max_integer_computation_mode (exp);
5767 /* If will do cse, generate all results into pseudo registers
5768 since 1) that allows cse to find more things
5769 and 2) otherwise cse could produce an insn the machine
5772 if (! cse_not_expected && mode != BLKmode && target
5773 && (GET_CODE (target) != REG || REGNO (target) < FIRST_PSEUDO_REGISTER))
5780 tree function = decl_function_context (exp);
5781 /* Handle using a label in a containing function. */
5782 if (function != current_function_decl
5783 && function != inline_function_decl && function != 0)
5785 struct function *p = find_function_data (function);
5786 /* Allocate in the memory associated with the function
5787 that the label is in. */
5788 push_obstacks (p->function_obstack,
5789 p->function_maybepermanent_obstack);
5791 p->expr->x_forced_labels
5792 = gen_rtx_EXPR_LIST (VOIDmode, label_rtx (exp),
5793 p->expr->x_forced_labels);
5798 if (modifier == EXPAND_INITIALIZER)
5799 forced_labels = gen_rtx_EXPR_LIST (VOIDmode,
5804 temp = gen_rtx_MEM (FUNCTION_MODE,
5805 gen_rtx_LABEL_REF (Pmode, label_rtx (exp)));
5806 if (function != current_function_decl
5807 && function != inline_function_decl && function != 0)
5808 LABEL_REF_NONLOCAL_P (XEXP (temp, 0)) = 1;
5813 if (DECL_RTL (exp) == 0)
5815 error_with_decl (exp, "prior parameter's size depends on `%s'");
5816 return CONST0_RTX (mode);
5819 /* ... fall through ... */
5822 /* If a static var's type was incomplete when the decl was written,
5823 but the type is complete now, lay out the decl now. */
5824 if (DECL_SIZE (exp) == 0 && TYPE_SIZE (TREE_TYPE (exp)) != 0
5825 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
5827 push_obstacks_nochange ();
5828 end_temporary_allocation ();
5829 layout_decl (exp, 0);
5830 PUT_MODE (DECL_RTL (exp), DECL_MODE (exp));
5834 /* Although static-storage variables start off initialized, according to
5835 ANSI C, a memcpy could overwrite them with uninitialized values. So
5836 we check them too. This also lets us check for read-only variables
5837 accessed via a non-const declaration, in case it won't be detected
5838 any other way (e.g., in an embedded system or OS kernel without
5841 Aggregates are not checked here; they're handled elsewhere. */
5842 if (current_function && current_function_check_memory_usage
5844 && GET_CODE (DECL_RTL (exp)) == MEM
5845 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp)))
5847 enum memory_use_mode memory_usage;
5848 memory_usage = get_memory_usage_from_modifier (modifier);
5850 if (memory_usage != MEMORY_USE_DONT)
5851 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
5852 XEXP (DECL_RTL (exp), 0), Pmode,
5853 GEN_INT (int_size_in_bytes (type)),
5854 TYPE_MODE (sizetype),
5855 GEN_INT (memory_usage),
5856 TYPE_MODE (integer_type_node));
5859 /* ... fall through ... */
5863 if (DECL_RTL (exp) == 0)
5866 /* Ensure variable marked as used even if it doesn't go through
5867 a parser. If it hasn't be used yet, write out an external
5869 if (! TREE_USED (exp))
5871 assemble_external (exp);
5872 TREE_USED (exp) = 1;
5875 /* Show we haven't gotten RTL for this yet. */
5878 /* Handle variables inherited from containing functions. */
5879 context = decl_function_context (exp);
5881 /* We treat inline_function_decl as an alias for the current function
5882 because that is the inline function whose vars, types, etc.
5883 are being merged into the current function.
5884 See expand_inline_function. */
5886 if (context != 0 && context != current_function_decl
5887 && context != inline_function_decl
5888 /* If var is static, we don't need a static chain to access it. */
5889 && ! (GET_CODE (DECL_RTL (exp)) == MEM
5890 && CONSTANT_P (XEXP (DECL_RTL (exp), 0))))
5894 /* Mark as non-local and addressable. */
5895 DECL_NONLOCAL (exp) = 1;
5896 if (DECL_NO_STATIC_CHAIN (current_function_decl))
5898 mark_addressable (exp);
5899 if (GET_CODE (DECL_RTL (exp)) != MEM)
5901 addr = XEXP (DECL_RTL (exp), 0);
5902 if (GET_CODE (addr) == MEM)
5903 addr = gen_rtx_MEM (Pmode,
5904 fix_lexical_addr (XEXP (addr, 0), exp));
5906 addr = fix_lexical_addr (addr, exp);
5907 temp = change_address (DECL_RTL (exp), mode, addr);
5910 /* This is the case of an array whose size is to be determined
5911 from its initializer, while the initializer is still being parsed.
5914 else if (GET_CODE (DECL_RTL (exp)) == MEM
5915 && GET_CODE (XEXP (DECL_RTL (exp), 0)) == REG)
5916 temp = change_address (DECL_RTL (exp), GET_MODE (DECL_RTL (exp)),
5917 XEXP (DECL_RTL (exp), 0));
5919 /* If DECL_RTL is memory, we are in the normal case and either
5920 the address is not valid or it is not a register and -fforce-addr
5921 is specified, get the address into a register. */
5923 else if (GET_CODE (DECL_RTL (exp)) == MEM
5924 && modifier != EXPAND_CONST_ADDRESS
5925 && modifier != EXPAND_SUM
5926 && modifier != EXPAND_INITIALIZER
5927 && (! memory_address_p (DECL_MODE (exp),
5928 XEXP (DECL_RTL (exp), 0))
5930 && GET_CODE (XEXP (DECL_RTL (exp), 0)) != REG)))
5931 temp = change_address (DECL_RTL (exp), VOIDmode,
5932 copy_rtx (XEXP (DECL_RTL (exp), 0)));
5934 /* If we got something, return it. But first, set the alignment
5935 the address is a register. */
5938 if (GET_CODE (temp) == MEM && GET_CODE (XEXP (temp, 0)) == REG)
5939 mark_reg_pointer (XEXP (temp, 0),
5940 DECL_ALIGN (exp) / BITS_PER_UNIT);
5945 /* If the mode of DECL_RTL does not match that of the decl, it
5946 must be a promoted value. We return a SUBREG of the wanted mode,
5947 but mark it so that we know that it was already extended. */
5949 if (GET_CODE (DECL_RTL (exp)) == REG
5950 && GET_MODE (DECL_RTL (exp)) != mode)
5952 /* Get the signedness used for this variable. Ensure we get the
5953 same mode we got when the variable was declared. */
5954 if (GET_MODE (DECL_RTL (exp))
5955 != promote_mode (type, DECL_MODE (exp), &unsignedp, 0))
5958 temp = gen_rtx_SUBREG (mode, DECL_RTL (exp), 0);
5959 SUBREG_PROMOTED_VAR_P (temp) = 1;
5960 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
5964 return DECL_RTL (exp);
5967 return immed_double_const (TREE_INT_CST_LOW (exp),
5968 TREE_INT_CST_HIGH (exp),
5972 return expand_expr (DECL_INITIAL (exp), target, VOIDmode,
5973 EXPAND_MEMORY_USE_BAD);
5976 /* If optimized, generate immediate CONST_DOUBLE
5977 which will be turned into memory by reload if necessary.
5979 We used to force a register so that loop.c could see it. But
5980 this does not allow gen_* patterns to perform optimizations with
5981 the constants. It also produces two insns in cases like "x = 1.0;".
5982 On most machines, floating-point constants are not permitted in
5983 many insns, so we'd end up copying it to a register in any case.
5985 Now, we do the copying in expand_binop, if appropriate. */
5986 return immed_real_const (exp);
5990 if (! TREE_CST_RTL (exp))
5991 output_constant_def (exp);
5993 /* TREE_CST_RTL probably contains a constant address.
5994 On RISC machines where a constant address isn't valid,
5995 make some insns to get that address into a register. */
5996 if (GET_CODE (TREE_CST_RTL (exp)) == MEM
5997 && modifier != EXPAND_CONST_ADDRESS
5998 && modifier != EXPAND_INITIALIZER
5999 && modifier != EXPAND_SUM
6000 && (! memory_address_p (mode, XEXP (TREE_CST_RTL (exp), 0))
6002 && GET_CODE (XEXP (TREE_CST_RTL (exp), 0)) != REG)))
6003 return change_address (TREE_CST_RTL (exp), VOIDmode,
6004 copy_rtx (XEXP (TREE_CST_RTL (exp), 0)));
6005 return TREE_CST_RTL (exp);
6007 case EXPR_WITH_FILE_LOCATION:
6010 char *saved_input_filename = input_filename;
6011 int saved_lineno = lineno;
6012 input_filename = EXPR_WFL_FILENAME (exp);
6013 lineno = EXPR_WFL_LINENO (exp);
6014 if (EXPR_WFL_EMIT_LINE_NOTE (exp))
6015 emit_line_note (input_filename, lineno);
6016 /* Possibly avoid switching back and force here */
6017 to_return = expand_expr (EXPR_WFL_NODE (exp), target, tmode, modifier);
6018 input_filename = saved_input_filename;
6019 lineno = saved_lineno;
6024 context = decl_function_context (exp);
6026 /* If this SAVE_EXPR was at global context, assume we are an
6027 initialization function and move it into our context. */
6029 SAVE_EXPR_CONTEXT (exp) = current_function_decl;
6031 /* We treat inline_function_decl as an alias for the current function
6032 because that is the inline function whose vars, types, etc.
6033 are being merged into the current function.
6034 See expand_inline_function. */
6035 if (context == current_function_decl || context == inline_function_decl)
6038 /* If this is non-local, handle it. */
6041 /* The following call just exists to abort if the context is
6042 not of a containing function. */
6043 find_function_data (context);
6045 temp = SAVE_EXPR_RTL (exp);
6046 if (temp && GET_CODE (temp) == REG)
6048 put_var_into_stack (exp);
6049 temp = SAVE_EXPR_RTL (exp);
6051 if (temp == 0 || GET_CODE (temp) != MEM)
6053 return change_address (temp, mode,
6054 fix_lexical_addr (XEXP (temp, 0), exp));
6056 if (SAVE_EXPR_RTL (exp) == 0)
6058 if (mode == VOIDmode)
6061 temp = assign_temp (type, 3, 0, 0);
6063 SAVE_EXPR_RTL (exp) = temp;
6064 if (!optimize && GET_CODE (temp) == REG)
6065 save_expr_regs = gen_rtx_EXPR_LIST (VOIDmode, temp,
6068 /* If the mode of TEMP does not match that of the expression, it
6069 must be a promoted value. We pass store_expr a SUBREG of the
6070 wanted mode but mark it so that we know that it was already
6071 extended. Note that `unsignedp' was modified above in
6074 if (GET_CODE (temp) == REG && GET_MODE (temp) != mode)
6076 temp = gen_rtx_SUBREG (mode, SAVE_EXPR_RTL (exp), 0);
6077 SUBREG_PROMOTED_VAR_P (temp) = 1;
6078 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6081 if (temp == const0_rtx)
6082 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6083 EXPAND_MEMORY_USE_BAD);
6085 store_expr (TREE_OPERAND (exp, 0), temp, 0);
6087 TREE_USED (exp) = 1;
6090 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
6091 must be a promoted value. We return a SUBREG of the wanted mode,
6092 but mark it so that we know that it was already extended. */
6094 if (GET_CODE (SAVE_EXPR_RTL (exp)) == REG
6095 && GET_MODE (SAVE_EXPR_RTL (exp)) != mode)
6097 /* Compute the signedness and make the proper SUBREG. */
6098 promote_mode (type, mode, &unsignedp, 0);
6099 temp = gen_rtx_SUBREG (mode, SAVE_EXPR_RTL (exp), 0);
6100 SUBREG_PROMOTED_VAR_P (temp) = 1;
6101 SUBREG_PROMOTED_UNSIGNED_P (temp) = unsignedp;
6105 return SAVE_EXPR_RTL (exp);
6110 temp = expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6111 TREE_OPERAND (exp, 0) = unsave_expr_now (TREE_OPERAND (exp, 0));
6115 case PLACEHOLDER_EXPR:
6117 tree placeholder_expr;
6119 /* If there is an object on the head of the placeholder list,
6120 see if some object in it of type TYPE or a pointer to it. For
6121 further information, see tree.def. */
6122 for (placeholder_expr = placeholder_list;
6123 placeholder_expr != 0;
6124 placeholder_expr = TREE_CHAIN (placeholder_expr))
6126 tree need_type = TYPE_MAIN_VARIANT (type);
6128 tree old_list = placeholder_list;
6131 /* Find the outermost reference that is of the type we want.
6132 If none, see if any object has a type that is a pointer to
6133 the type we want. */
6134 for (elt = TREE_PURPOSE (placeholder_expr);
6135 elt != 0 && object == 0;
6137 = ((TREE_CODE (elt) == COMPOUND_EXPR
6138 || TREE_CODE (elt) == COND_EXPR)
6139 ? TREE_OPERAND (elt, 1)
6140 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6141 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6142 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6143 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6144 ? TREE_OPERAND (elt, 0) : 0))
6145 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
6148 for (elt = TREE_PURPOSE (placeholder_expr);
6149 elt != 0 && object == 0;
6151 = ((TREE_CODE (elt) == COMPOUND_EXPR
6152 || TREE_CODE (elt) == COND_EXPR)
6153 ? TREE_OPERAND (elt, 1)
6154 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
6155 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
6156 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
6157 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
6158 ? TREE_OPERAND (elt, 0) : 0))
6159 if (POINTER_TYPE_P (TREE_TYPE (elt))
6160 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
6162 object = build1 (INDIRECT_REF, need_type, elt);
6166 /* Expand this object skipping the list entries before
6167 it was found in case it is also a PLACEHOLDER_EXPR.
6168 In that case, we want to translate it using subsequent
6170 placeholder_list = TREE_CHAIN (placeholder_expr);
6171 temp = expand_expr (object, original_target, tmode,
6173 placeholder_list = old_list;
6179 /* We can't find the object or there was a missing WITH_RECORD_EXPR. */
6182 case WITH_RECORD_EXPR:
6183 /* Put the object on the placeholder list, expand our first operand,
6184 and pop the list. */
6185 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
6187 target = expand_expr (TREE_OPERAND (exp, 0), original_target,
6188 tmode, ro_modifier);
6189 placeholder_list = TREE_CHAIN (placeholder_list);
6193 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6194 expand_goto (TREE_OPERAND (exp, 0));
6196 expand_computed_goto (TREE_OPERAND (exp, 0));
6200 expand_exit_loop_if_false (NULL_PTR,
6201 invert_truthvalue (TREE_OPERAND (exp, 0)));
6204 case LABELED_BLOCK_EXPR:
6205 if (LABELED_BLOCK_BODY (exp))
6206 expand_expr_stmt (LABELED_BLOCK_BODY (exp));
6207 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp)));
6210 case EXIT_BLOCK_EXPR:
6211 if (EXIT_BLOCK_RETURN (exp))
6212 sorry ("returned value in block_exit_expr");
6213 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp)));
6218 expand_start_loop (1);
6219 expand_expr_stmt (TREE_OPERAND (exp, 0));
6227 tree vars = TREE_OPERAND (exp, 0);
6228 int vars_need_expansion = 0;
6230 /* Need to open a binding contour here because
6231 if there are any cleanups they must be contained here. */
6232 expand_start_bindings (2);
6234 /* Mark the corresponding BLOCK for output in its proper place. */
6235 if (TREE_OPERAND (exp, 2) != 0
6236 && ! TREE_USED (TREE_OPERAND (exp, 2)))
6237 insert_block (TREE_OPERAND (exp, 2));
6239 /* If VARS have not yet been expanded, expand them now. */
6242 if (DECL_RTL (vars) == 0)
6244 vars_need_expansion = 1;
6247 expand_decl_init (vars);
6248 vars = TREE_CHAIN (vars);
6251 temp = expand_expr (TREE_OPERAND (exp, 1), target, tmode, ro_modifier);
6253 expand_end_bindings (TREE_OPERAND (exp, 0), 0, 0);
6259 if (RTL_EXPR_SEQUENCE (exp))
6261 if (RTL_EXPR_SEQUENCE (exp) == const0_rtx)
6263 emit_insns (RTL_EXPR_SEQUENCE (exp));
6264 RTL_EXPR_SEQUENCE (exp) = const0_rtx;
6266 preserve_rtl_expr_result (RTL_EXPR_RTL (exp));
6267 free_temps_for_rtl_expr (exp);
6268 return RTL_EXPR_RTL (exp);
6271 /* If we don't need the result, just ensure we evaluate any
6276 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6277 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode,
6278 EXPAND_MEMORY_USE_BAD);
6282 /* All elts simple constants => refer to a constant in memory. But
6283 if this is a non-BLKmode mode, let it store a field at a time
6284 since that should make a CONST_INT or CONST_DOUBLE when we
6285 fold. Likewise, if we have a target we can use, it is best to
6286 store directly into the target unless the type is large enough
6287 that memcpy will be used. If we are making an initializer and
6288 all operands are constant, put it in memory as well. */
6289 else if ((TREE_STATIC (exp)
6290 && ((mode == BLKmode
6291 && ! (target != 0 && safe_from_p (target, exp, 1)))
6292 || TREE_ADDRESSABLE (exp)
6293 || (TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
6294 && (!MOVE_BY_PIECES_P
6295 (TREE_INT_CST_LOW (TYPE_SIZE (type))/BITS_PER_UNIT,
6296 TYPE_ALIGN (type) / BITS_PER_UNIT))
6297 && ! mostly_zeros_p (exp))))
6298 || (modifier == EXPAND_INITIALIZER && TREE_CONSTANT (exp)))
6300 rtx constructor = output_constant_def (exp);
6301 if (modifier != EXPAND_CONST_ADDRESS
6302 && modifier != EXPAND_INITIALIZER
6303 && modifier != EXPAND_SUM
6304 && (! memory_address_p (GET_MODE (constructor),
6305 XEXP (constructor, 0))
6307 && GET_CODE (XEXP (constructor, 0)) != REG)))
6308 constructor = change_address (constructor, VOIDmode,
6309 XEXP (constructor, 0));
6315 /* Handle calls that pass values in multiple non-contiguous
6316 locations. The Irix 6 ABI has examples of this. */
6317 if (target == 0 || ! safe_from_p (target, exp, 1)
6318 || GET_CODE (target) == PARALLEL)
6320 if (mode != BLKmode && ! TREE_ADDRESSABLE (exp))
6321 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
6323 target = assign_temp (type, 0, 1, 1);
6326 if (TREE_READONLY (exp))
6328 if (GET_CODE (target) == MEM)
6329 target = copy_rtx (target);
6331 RTX_UNCHANGING_P (target) = 1;
6334 store_constructor (exp, target, TYPE_ALIGN (TREE_TYPE (exp)), 0);
6340 tree exp1 = TREE_OPERAND (exp, 0);
6343 tree string = string_constant (exp1, &index);
6346 /* Try to optimize reads from const strings. */
6348 && TREE_CODE (string) == STRING_CST
6349 && TREE_CODE (index) == INTEGER_CST
6350 && !TREE_INT_CST_HIGH (index)
6351 && (i = TREE_INT_CST_LOW (index)) < TREE_STRING_LENGTH (string)
6352 && GET_MODE_CLASS (mode) == MODE_INT
6353 && GET_MODE_SIZE (mode) == 1
6354 && modifier != EXPAND_MEMORY_USE_WO)
6355 return GEN_INT (TREE_STRING_POINTER (string)[i]);
6357 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6358 op0 = memory_address (mode, op0);
6360 if (current_function && current_function_check_memory_usage
6361 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp)))
6363 enum memory_use_mode memory_usage;
6364 memory_usage = get_memory_usage_from_modifier (modifier);
6366 if (memory_usage != MEMORY_USE_DONT)
6368 in_check_memory_usage = 1;
6369 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
6371 GEN_INT (int_size_in_bytes (type)),
6372 TYPE_MODE (sizetype),
6373 GEN_INT (memory_usage),
6374 TYPE_MODE (integer_type_node));
6375 in_check_memory_usage = 0;
6379 temp = gen_rtx_MEM (mode, op0);
6380 /* If address was computed by addition,
6381 mark this as an element of an aggregate. */
6382 if (TREE_CODE (exp1) == PLUS_EXPR
6383 || (TREE_CODE (exp1) == SAVE_EXPR
6384 && TREE_CODE (TREE_OPERAND (exp1, 0)) == PLUS_EXPR)
6385 || AGGREGATE_TYPE_P (TREE_TYPE (exp))
6386 || (TREE_CODE (exp1) == ADDR_EXPR
6387 && (exp2 = TREE_OPERAND (exp1, 0))
6388 && AGGREGATE_TYPE_P (TREE_TYPE (exp2))))
6389 MEM_SET_IN_STRUCT_P (temp, 1);
6391 MEM_VOLATILE_P (temp) = TREE_THIS_VOLATILE (exp) | flag_volatile;
6392 MEM_ALIAS_SET (temp) = get_alias_set (exp);
6394 /* It is incorrect to set RTX_UNCHANGING_P from TREE_READONLY
6395 here, because, in C and C++, the fact that a location is accessed
6396 through a pointer to const does not mean that the value there can
6397 never change. Languages where it can never change should
6398 also set TREE_STATIC. */
6399 RTX_UNCHANGING_P (temp) = TREE_READONLY (exp) & TREE_STATIC (exp);
6401 /* If we are writing to this object and its type is a record with
6402 readonly fields, we must mark it as readonly so it will
6403 conflict with readonly references to those fields. */
6404 if (modifier == EXPAND_MEMORY_USE_WO
6405 && TREE_CODE (type) == RECORD_TYPE && readonly_fields_p (type))
6406 RTX_UNCHANGING_P (temp) = 1;
6412 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
6416 tree array = TREE_OPERAND (exp, 0);
6417 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
6418 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
6419 tree index = TREE_OPERAND (exp, 1);
6420 tree index_type = TREE_TYPE (index);
6423 /* Optimize the special-case of a zero lower bound.
6425 We convert the low_bound to sizetype to avoid some problems
6426 with constant folding. (E.g. suppose the lower bound is 1,
6427 and its mode is QI. Without the conversion, (ARRAY
6428 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
6429 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
6431 But sizetype isn't quite right either (especially if
6432 the lowbound is negative). FIXME */
6434 if (! integer_zerop (low_bound))
6435 index = fold (build (MINUS_EXPR, index_type, index,
6436 convert (sizetype, low_bound)));
6438 /* Fold an expression like: "foo"[2].
6439 This is not done in fold so it won't happen inside &.
6440 Don't fold if this is for wide characters since it's too
6441 difficult to do correctly and this is a very rare case. */
6443 if (TREE_CODE (array) == STRING_CST
6444 && TREE_CODE (index) == INTEGER_CST
6445 && !TREE_INT_CST_HIGH (index)
6446 && (i = TREE_INT_CST_LOW (index)) < TREE_STRING_LENGTH (array)
6447 && GET_MODE_CLASS (mode) == MODE_INT
6448 && GET_MODE_SIZE (mode) == 1)
6449 return GEN_INT (TREE_STRING_POINTER (array)[i]);
6451 /* If this is a constant index into a constant array,
6452 just get the value from the array. Handle both the cases when
6453 we have an explicit constructor and when our operand is a variable
6454 that was declared const. */
6456 if (TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array))
6458 if (TREE_CODE (index) == INTEGER_CST
6459 && TREE_INT_CST_HIGH (index) == 0)
6461 tree elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0));
6463 i = TREE_INT_CST_LOW (index);
6465 elem = TREE_CHAIN (elem);
6467 return expand_expr (fold (TREE_VALUE (elem)), target,
6468 tmode, ro_modifier);
6472 else if (optimize >= 1
6473 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6474 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6475 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
6477 if (TREE_CODE (index) == INTEGER_CST)
6479 tree init = DECL_INITIAL (array);
6481 i = TREE_INT_CST_LOW (index);
6482 if (TREE_CODE (init) == CONSTRUCTOR)
6484 tree elem = CONSTRUCTOR_ELTS (init);
6487 && !tree_int_cst_equal (TREE_PURPOSE (elem), index))
6488 elem = TREE_CHAIN (elem);
6490 return expand_expr (fold (TREE_VALUE (elem)), target,
6491 tmode, ro_modifier);
6493 else if (TREE_CODE (init) == STRING_CST
6494 && TREE_INT_CST_HIGH (index) == 0
6495 && (TREE_INT_CST_LOW (index)
6496 < TREE_STRING_LENGTH (init)))
6498 (TREE_STRING_POINTER
6499 (init)[TREE_INT_CST_LOW (index)]));
6504 /* ... fall through ... */
6508 /* If the operand is a CONSTRUCTOR, we can just extract the
6509 appropriate field if it is present. Don't do this if we have
6510 already written the data since we want to refer to that copy
6511 and varasm.c assumes that's what we'll do. */
6512 if (code != ARRAY_REF
6513 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
6514 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
6518 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6519 elt = TREE_CHAIN (elt))
6520 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6521 /* We can normally use the value of the field in the
6522 CONSTRUCTOR. However, if this is a bitfield in
6523 an integral mode that we can fit in a HOST_WIDE_INT,
6524 we must mask only the number of bits in the bitfield,
6525 since this is done implicitly by the constructor. If
6526 the bitfield does not meet either of those conditions,
6527 we can't do this optimization. */
6528 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6529 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6531 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6532 <= HOST_BITS_PER_WIDE_INT))))
6534 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6535 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6537 int bitsize = DECL_FIELD_SIZE (TREE_PURPOSE (elt));
6539 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
6541 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
6542 op0 = expand_and (op0, op1, target);
6546 enum machine_mode imode
6547 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
6549 = build_int_2 (GET_MODE_BITSIZE (imode) - bitsize,
6552 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
6554 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
6564 enum machine_mode mode1;
6570 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6571 &mode1, &unsignedp, &volatilep,
6574 /* If we got back the original object, something is wrong. Perhaps
6575 we are evaluating an expression too early. In any event, don't
6576 infinitely recurse. */
6580 /* If TEM's type is a union of variable size, pass TARGET to the inner
6581 computation, since it will need a temporary and TARGET is known
6582 to have to do. This occurs in unchecked conversion in Ada. */
6584 op0 = expand_expr (tem,
6585 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
6586 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
6588 ? target : NULL_RTX),
6590 (modifier == EXPAND_INITIALIZER
6591 || modifier == EXPAND_CONST_ADDRESS)
6592 ? modifier : EXPAND_NORMAL);
6594 /* If this is a constant, put it into a register if it is a
6595 legitimate constant and OFFSET is 0 and memory if it isn't. */
6596 if (CONSTANT_P (op0))
6598 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
6599 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
6601 op0 = force_reg (mode, op0);
6603 op0 = validize_mem (force_const_mem (mode, op0));
6608 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
6610 /* If this object is in memory, put it into a register.
6611 This case can't occur in C, but can in Ada if we have
6612 unchecked conversion of an expression from a scalar type to
6613 an array or record type. */
6614 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
6615 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
6617 rtx memloc = assign_temp (TREE_TYPE (tem), 1, 1, 1);
6619 mark_temp_addr_taken (memloc);
6620 emit_move_insn (memloc, op0);
6624 if (GET_CODE (op0) != MEM)
6627 if (GET_MODE (offset_rtx) != ptr_mode)
6629 #ifdef POINTERS_EXTEND_UNSIGNED
6630 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
6632 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
6636 /* A constant address in OP0 can have VOIDmode, we must not try
6637 to call force_reg for that case. Avoid that case. */
6638 if (GET_CODE (op0) == MEM
6639 && GET_MODE (op0) == BLKmode
6640 && GET_MODE (XEXP (op0, 0)) != VOIDmode
6642 && (bitpos % bitsize) == 0
6643 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
6644 && (alignment * BITS_PER_UNIT) == GET_MODE_ALIGNMENT (mode1))
6646 rtx temp = change_address (op0, mode1,
6647 plus_constant (XEXP (op0, 0),
6650 if (GET_CODE (XEXP (temp, 0)) == REG)
6653 op0 = change_address (op0, mode1,
6654 force_reg (GET_MODE (XEXP (temp, 0)),
6660 op0 = change_address (op0, VOIDmode,
6661 gen_rtx_PLUS (ptr_mode, XEXP (op0, 0),
6662 force_reg (ptr_mode,
6666 /* Don't forget about volatility even if this is a bitfield. */
6667 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
6669 op0 = copy_rtx (op0);
6670 MEM_VOLATILE_P (op0) = 1;
6673 /* Check the access. */
6674 if (current_function_check_memory_usage && GET_CODE (op0) == MEM)
6676 enum memory_use_mode memory_usage;
6677 memory_usage = get_memory_usage_from_modifier (modifier);
6679 if (memory_usage != MEMORY_USE_DONT)
6684 to = plus_constant (XEXP (op0, 0), (bitpos / BITS_PER_UNIT));
6685 size = (bitpos % BITS_PER_UNIT) + bitsize + BITS_PER_UNIT - 1;
6687 /* Check the access right of the pointer. */
6688 if (size > BITS_PER_UNIT)
6689 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
6691 GEN_INT (size / BITS_PER_UNIT),
6692 TYPE_MODE (sizetype),
6693 GEN_INT (memory_usage),
6694 TYPE_MODE (integer_type_node));
6698 /* In cases where an aligned union has an unaligned object
6699 as a field, we might be extracting a BLKmode value from
6700 an integer-mode (e.g., SImode) object. Handle this case
6701 by doing the extract into an object as wide as the field
6702 (which we know to be the width of a basic mode), then
6703 storing into memory, and changing the mode to BLKmode.
6704 If we ultimately want the address (EXPAND_CONST_ADDRESS or
6705 EXPAND_INITIALIZER), then we must not copy to a temporary. */
6706 if (mode1 == VOIDmode
6707 || GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
6708 || (modifier != EXPAND_CONST_ADDRESS
6709 && modifier != EXPAND_INITIALIZER
6710 && ((mode1 != BLKmode && ! direct_load[(int) mode1]
6711 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
6712 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
6713 /* If the field isn't aligned enough to fetch as a memref,
6714 fetch it as a bit field. */
6715 || (mode1 != BLKmode && SLOW_UNALIGNED_ACCESS
6716 && ((TYPE_ALIGN (TREE_TYPE (tem))
6717 < (unsigned int) GET_MODE_ALIGNMENT (mode))
6718 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)))))
6719 || (modifier != EXPAND_CONST_ADDRESS
6720 && modifier != EXPAND_INITIALIZER
6722 && SLOW_UNALIGNED_ACCESS
6723 && (TYPE_ALIGN (type) > alignment * BITS_PER_UNIT
6724 || bitpos % TYPE_ALIGN (type) != 0)))
6726 enum machine_mode ext_mode = mode;
6728 if (ext_mode == BLKmode
6729 && ! (target != 0 && GET_CODE (op0) == MEM
6730 && GET_CODE (target) == MEM
6731 && bitpos % BITS_PER_UNIT == 0))
6732 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
6734 if (ext_mode == BLKmode)
6736 /* In this case, BITPOS must start at a byte boundary and
6737 TARGET, if specified, must be a MEM. */
6738 if (GET_CODE (op0) != MEM
6739 || (target != 0 && GET_CODE (target) != MEM)
6740 || bitpos % BITS_PER_UNIT != 0)
6743 op0 = change_address (op0, VOIDmode,
6744 plus_constant (XEXP (op0, 0),
6745 bitpos / BITS_PER_UNIT));
6747 target = assign_temp (type, 0, 1, 1);
6749 emit_block_move (target, op0,
6750 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
6757 op0 = validize_mem (op0);
6759 if (GET_CODE (op0) == MEM && GET_CODE (XEXP (op0, 0)) == REG)
6760 mark_reg_pointer (XEXP (op0, 0), alignment);
6762 op0 = extract_bit_field (op0, bitsize, bitpos,
6763 unsignedp, target, ext_mode, ext_mode,
6765 int_size_in_bytes (TREE_TYPE (tem)));
6767 /* If the result is a record type and BITSIZE is narrower than
6768 the mode of OP0, an integral mode, and this is a big endian
6769 machine, we must put the field into the high-order bits. */
6770 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
6771 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
6772 && bitsize < GET_MODE_BITSIZE (GET_MODE (op0)))
6773 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
6774 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
6778 if (mode == BLKmode)
6780 rtx new = assign_stack_temp (ext_mode,
6781 bitsize / BITS_PER_UNIT, 0);
6783 emit_move_insn (new, op0);
6784 op0 = copy_rtx (new);
6785 PUT_MODE (op0, BLKmode);
6786 MEM_SET_IN_STRUCT_P (op0, 1);
6792 /* If the result is BLKmode, use that to access the object
6794 if (mode == BLKmode)
6797 /* Get a reference to just this component. */
6798 if (modifier == EXPAND_CONST_ADDRESS
6799 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6800 op0 = gen_rtx_MEM (mode1, plus_constant (XEXP (op0, 0),
6801 (bitpos / BITS_PER_UNIT)));
6803 op0 = change_address (op0, mode1,
6804 plus_constant (XEXP (op0, 0),
6805 (bitpos / BITS_PER_UNIT)));
6807 if (GET_CODE (op0) == MEM)
6808 MEM_ALIAS_SET (op0) = get_alias_set (exp);
6810 if (GET_CODE (XEXP (op0, 0)) == REG)
6811 mark_reg_pointer (XEXP (op0, 0), alignment);
6813 MEM_SET_IN_STRUCT_P (op0, 1);
6814 MEM_VOLATILE_P (op0) |= volatilep;
6815 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
6816 || modifier == EXPAND_CONST_ADDRESS
6817 || modifier == EXPAND_INITIALIZER)
6819 else if (target == 0)
6820 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
6822 convert_move (target, op0, unsignedp);
6826 /* Intended for a reference to a buffer of a file-object in Pascal.
6827 But it's not certain that a special tree code will really be
6828 necessary for these. INDIRECT_REF might work for them. */
6834 /* Pascal set IN expression.
6837 rlo = set_low - (set_low%bits_per_word);
6838 the_word = set [ (index - rlo)/bits_per_word ];
6839 bit_index = index % bits_per_word;
6840 bitmask = 1 << bit_index;
6841 return !!(the_word & bitmask); */
6843 tree set = TREE_OPERAND (exp, 0);
6844 tree index = TREE_OPERAND (exp, 1);
6845 int iunsignedp = TREE_UNSIGNED (TREE_TYPE (index));
6846 tree set_type = TREE_TYPE (set);
6847 tree set_low_bound = TYPE_MIN_VALUE (TYPE_DOMAIN (set_type));
6848 tree set_high_bound = TYPE_MAX_VALUE (TYPE_DOMAIN (set_type));
6849 rtx index_val = expand_expr (index, 0, VOIDmode, 0);
6850 rtx lo_r = expand_expr (set_low_bound, 0, VOIDmode, 0);
6851 rtx hi_r = expand_expr (set_high_bound, 0, VOIDmode, 0);
6852 rtx setval = expand_expr (set, 0, VOIDmode, 0);
6853 rtx setaddr = XEXP (setval, 0);
6854 enum machine_mode index_mode = TYPE_MODE (TREE_TYPE (index));
6856 rtx diff, quo, rem, addr, bit, result;
6858 preexpand_calls (exp);
6860 /* If domain is empty, answer is no. Likewise if index is constant
6861 and out of bounds. */
6862 if (((TREE_CODE (set_high_bound) == INTEGER_CST
6863 && TREE_CODE (set_low_bound) == INTEGER_CST
6864 && tree_int_cst_lt (set_high_bound, set_low_bound))
6865 || (TREE_CODE (index) == INTEGER_CST
6866 && TREE_CODE (set_low_bound) == INTEGER_CST
6867 && tree_int_cst_lt (index, set_low_bound))
6868 || (TREE_CODE (set_high_bound) == INTEGER_CST
6869 && TREE_CODE (index) == INTEGER_CST
6870 && tree_int_cst_lt (set_high_bound, index))))
6874 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
6876 /* If we get here, we have to generate the code for both cases
6877 (in range and out of range). */
6879 op0 = gen_label_rtx ();
6880 op1 = gen_label_rtx ();
6882 if (! (GET_CODE (index_val) == CONST_INT
6883 && GET_CODE (lo_r) == CONST_INT))
6885 emit_cmp_and_jump_insns (index_val, lo_r, LT, NULL_RTX,
6886 GET_MODE (index_val), iunsignedp, 0, op1);
6889 if (! (GET_CODE (index_val) == CONST_INT
6890 && GET_CODE (hi_r) == CONST_INT))
6892 emit_cmp_and_jump_insns (index_val, hi_r, GT, NULL_RTX,
6893 GET_MODE (index_val), iunsignedp, 0, op1);
6896 /* Calculate the element number of bit zero in the first word
6898 if (GET_CODE (lo_r) == CONST_INT)
6899 rlow = GEN_INT (INTVAL (lo_r)
6900 & ~ ((HOST_WIDE_INT) 1 << BITS_PER_UNIT));
6902 rlow = expand_binop (index_mode, and_optab, lo_r,
6903 GEN_INT (~((HOST_WIDE_INT) 1 << BITS_PER_UNIT)),
6904 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
6906 diff = expand_binop (index_mode, sub_optab, index_val, rlow,
6907 NULL_RTX, iunsignedp, OPTAB_LIB_WIDEN);
6909 quo = expand_divmod (0, TRUNC_DIV_EXPR, index_mode, diff,
6910 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
6911 rem = expand_divmod (1, TRUNC_MOD_EXPR, index_mode, index_val,
6912 GEN_INT (BITS_PER_UNIT), NULL_RTX, iunsignedp);
6914 addr = memory_address (byte_mode,
6915 expand_binop (index_mode, add_optab, diff,
6916 setaddr, NULL_RTX, iunsignedp,
6919 /* Extract the bit we want to examine */
6920 bit = expand_shift (RSHIFT_EXPR, byte_mode,
6921 gen_rtx_MEM (byte_mode, addr),
6922 make_tree (TREE_TYPE (index), rem),
6924 result = expand_binop (byte_mode, and_optab, bit, const1_rtx,
6925 GET_MODE (target) == byte_mode ? target : 0,
6926 1, OPTAB_LIB_WIDEN);
6928 if (result != target)
6929 convert_move (target, result, 1);
6931 /* Output the code to handle the out-of-range case. */
6934 emit_move_insn (target, const0_rtx);
6939 case WITH_CLEANUP_EXPR:
6940 if (RTL_EXPR_RTL (exp) == 0)
6943 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, ro_modifier);
6944 expand_decl_cleanup (NULL_TREE, TREE_OPERAND (exp, 2));
6946 /* That's it for this cleanup. */
6947 TREE_OPERAND (exp, 2) = 0;
6949 return RTL_EXPR_RTL (exp);
6951 case CLEANUP_POINT_EXPR:
6953 /* Start a new binding layer that will keep track of all cleanup
6954 actions to be performed. */
6955 expand_start_bindings (2);
6957 target_temp_slot_level = temp_slot_level;
6959 op0 = expand_expr (TREE_OPERAND (exp, 0), target, tmode, ro_modifier);
6960 /* If we're going to use this value, load it up now. */
6962 op0 = force_not_mem (op0);
6963 preserve_temp_slots (op0);
6964 expand_end_bindings (NULL_TREE, 0, 0);
6969 /* Check for a built-in function. */
6970 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
6971 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
6973 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
6974 return expand_builtin (exp, target, subtarget, tmode, ignore);
6976 /* If this call was expanded already by preexpand_calls,
6977 just return the result we got. */
6978 if (CALL_EXPR_RTL (exp) != 0)
6979 return CALL_EXPR_RTL (exp);
6981 return expand_call (exp, target, ignore);
6983 case NON_LVALUE_EXPR:
6986 case REFERENCE_EXPR:
6987 if (TREE_CODE (type) == UNION_TYPE)
6989 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
6991 /* If both input and output are BLKmode, this conversion
6992 isn't actually doing anything unless we need to make the
6993 alignment stricter. */
6994 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode
6995 && (TYPE_ALIGN (type) <= TYPE_ALIGN (valtype)
6996 || TYPE_ALIGN (type) >= BIGGEST_ALIGNMENT))
6997 return expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7002 if (mode != BLKmode)
7003 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7005 target = assign_temp (type, 0, 1, 1);
7008 if (GET_CODE (target) == MEM)
7009 /* Store data into beginning of memory target. */
7010 store_expr (TREE_OPERAND (exp, 0),
7011 change_address (target, TYPE_MODE (valtype), 0), 0);
7013 else if (GET_CODE (target) == REG)
7014 /* Store this field into a union of the proper type. */
7015 store_field (target,
7016 MIN ((int_size_in_bytes (TREE_TYPE
7017 (TREE_OPERAND (exp, 0)))
7019 GET_MODE_BITSIZE (mode)),
7020 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7021 VOIDmode, 0, 1, int_size_in_bytes (type), 0);
7025 /* Return the entire union. */
7029 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7031 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7034 /* If the signedness of the conversion differs and OP0 is
7035 a promoted SUBREG, clear that indication since we now
7036 have to do the proper extension. */
7037 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7038 && GET_CODE (op0) == SUBREG)
7039 SUBREG_PROMOTED_VAR_P (op0) = 0;
7044 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, 0);
7045 if (GET_MODE (op0) == mode)
7048 /* If OP0 is a constant, just convert it into the proper mode. */
7049 if (CONSTANT_P (op0))
7051 convert_modes (mode, TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7052 op0, TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7054 if (modifier == EXPAND_INITIALIZER)
7055 return gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7059 convert_to_mode (mode, op0,
7060 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7062 convert_move (target, op0,
7063 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7067 /* We come here from MINUS_EXPR when the second operand is a
7070 this_optab = add_optab;
7072 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
7073 something else, make sure we add the register to the constant and
7074 then to the other thing. This case can occur during strength
7075 reduction and doing it this way will produce better code if the
7076 frame pointer or argument pointer is eliminated.
7078 fold-const.c will ensure that the constant is always in the inner
7079 PLUS_EXPR, so the only case we need to do anything about is if
7080 sp, ap, or fp is our second argument, in which case we must swap
7081 the innermost first argument and our second argument. */
7083 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7084 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7085 && TREE_CODE (TREE_OPERAND (exp, 1)) == RTL_EXPR
7086 && (RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7087 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7088 || RTL_EXPR_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7090 tree t = TREE_OPERAND (exp, 1);
7092 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7093 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7096 /* If the result is to be ptr_mode and we are adding an integer to
7097 something, we might be forming a constant. So try to use
7098 plus_constant. If it produces a sum and we can't accept it,
7099 use force_operand. This allows P = &ARR[const] to generate
7100 efficient code on machines where a SYMBOL_REF is not a valid
7103 If this is an EXPAND_SUM call, always return the sum. */
7104 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7105 || mode == ptr_mode)
7107 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7108 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7109 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7113 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7115 /* Use immed_double_const to ensure that the constant is
7116 truncated according to the mode of OP1, then sign extended
7117 to a HOST_WIDE_INT. Using the constant directly can result
7118 in non-canonical RTL in a 64x32 cross compile. */
7120 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7122 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7123 op1 = plus_constant (op1, INTVAL (constant_part));
7124 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7125 op1 = force_operand (op1, target);
7129 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7130 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7131 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7135 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7137 if (! CONSTANT_P (op0))
7139 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7140 VOIDmode, modifier);
7141 /* Don't go to both_summands if modifier
7142 says it's not right to return a PLUS. */
7143 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7147 /* Use immed_double_const to ensure that the constant is
7148 truncated according to the mode of OP1, then sign extended
7149 to a HOST_WIDE_INT. Using the constant directly can result
7150 in non-canonical RTL in a 64x32 cross compile. */
7152 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7154 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7155 op0 = plus_constant (op0, INTVAL (constant_part));
7156 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7157 op0 = force_operand (op0, target);
7162 /* No sense saving up arithmetic to be done
7163 if it's all in the wrong mode to form part of an address.
7164 And force_operand won't know whether to sign-extend or
7166 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7167 || mode != ptr_mode)
7170 preexpand_calls (exp);
7171 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7174 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, ro_modifier);
7175 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, ro_modifier);
7178 /* Make sure any term that's a sum with a constant comes last. */
7179 if (GET_CODE (op0) == PLUS
7180 && CONSTANT_P (XEXP (op0, 1)))
7186 /* If adding to a sum including a constant,
7187 associate it to put the constant outside. */
7188 if (GET_CODE (op1) == PLUS
7189 && CONSTANT_P (XEXP (op1, 1)))
7191 rtx constant_term = const0_rtx;
7193 temp = simplify_binary_operation (PLUS, mode, XEXP (op1, 0), op0);
7196 /* Ensure that MULT comes first if there is one. */
7197 else if (GET_CODE (op0) == MULT)
7198 op0 = gen_rtx_PLUS (mode, op0, XEXP (op1, 0));
7200 op0 = gen_rtx_PLUS (mode, XEXP (op1, 0), op0);
7202 /* Let's also eliminate constants from op0 if possible. */
7203 op0 = eliminate_constant_term (op0, &constant_term);
7205 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
7206 their sum should be a constant. Form it into OP1, since the
7207 result we want will then be OP0 + OP1. */
7209 temp = simplify_binary_operation (PLUS, mode, constant_term,
7214 op1 = gen_rtx_PLUS (mode, constant_term, XEXP (op1, 1));
7217 /* Put a constant term last and put a multiplication first. */
7218 if (CONSTANT_P (op0) || GET_CODE (op1) == MULT)
7219 temp = op1, op1 = op0, op0 = temp;
7221 temp = simplify_binary_operation (PLUS, mode, op0, op1);
7222 return temp ? temp : gen_rtx_PLUS (mode, op0, op1);
7225 /* For initializers, we are allowed to return a MINUS of two
7226 symbolic constants. Here we handle all cases when both operands
7228 /* Handle difference of two symbolic constants,
7229 for the sake of an initializer. */
7230 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7231 && really_constant_p (TREE_OPERAND (exp, 0))
7232 && really_constant_p (TREE_OPERAND (exp, 1)))
7234 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX,
7235 VOIDmode, ro_modifier);
7236 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7237 VOIDmode, ro_modifier);
7239 /* If the last operand is a CONST_INT, use plus_constant of
7240 the negated constant. Else make the MINUS. */
7241 if (GET_CODE (op1) == CONST_INT)
7242 return plus_constant (op0, - INTVAL (op1));
7244 return gen_rtx_MINUS (mode, op0, op1);
7246 /* Convert A - const to A + (-const). */
7247 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7249 tree negated = fold (build1 (NEGATE_EXPR, type,
7250 TREE_OPERAND (exp, 1)));
7252 if (TREE_UNSIGNED (type) || TREE_OVERFLOW (negated))
7253 /* If we can't negate the constant in TYPE, leave it alone and
7254 expand_binop will negate it for us. We used to try to do it
7255 here in the signed version of TYPE, but that doesn't work
7256 on POINTER_TYPEs. */;
7259 exp = build (PLUS_EXPR, type, TREE_OPERAND (exp, 0), negated);
7263 this_optab = sub_optab;
7267 preexpand_calls (exp);
7268 /* If first operand is constant, swap them.
7269 Thus the following special case checks need only
7270 check the second operand. */
7271 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7273 register tree t1 = TREE_OPERAND (exp, 0);
7274 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7275 TREE_OPERAND (exp, 1) = t1;
7278 /* Attempt to return something suitable for generating an
7279 indexed address, for machines that support that. */
7281 if (modifier == EXPAND_SUM && mode == ptr_mode
7282 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7283 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
7285 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7288 /* Apply distributive law if OP0 is x+c. */
7289 if (GET_CODE (op0) == PLUS
7290 && GET_CODE (XEXP (op0, 1)) == CONST_INT)
7295 (mode, XEXP (op0, 0),
7296 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)))),
7297 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))
7298 * INTVAL (XEXP (op0, 1))));
7300 if (GET_CODE (op0) != REG)
7301 op0 = force_operand (op0, NULL_RTX);
7302 if (GET_CODE (op0) != REG)
7303 op0 = copy_to_mode_reg (mode, op0);
7306 gen_rtx_MULT (mode, op0,
7307 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))));
7310 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7313 /* Check for multiplying things that have been extended
7314 from a narrower type. If this machine supports multiplying
7315 in that narrower type with a result in the desired type,
7316 do it that way, and avoid the explicit type-conversion. */
7317 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7318 && TREE_CODE (type) == INTEGER_TYPE
7319 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7320 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7321 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7322 && int_fits_type_p (TREE_OPERAND (exp, 1),
7323 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7324 /* Don't use a widening multiply if a shift will do. */
7325 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7326 > HOST_BITS_PER_WIDE_INT)
7327 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7329 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7330 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7332 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
7333 /* If both operands are extended, they must either both
7334 be zero-extended or both be sign-extended. */
7335 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7337 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))))))
7339 enum machine_mode innermode
7340 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)));
7341 optab other_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7342 ? smul_widen_optab : umul_widen_optab);
7343 this_optab = (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7344 ? umul_widen_optab : smul_widen_optab);
7345 if (mode == GET_MODE_WIDER_MODE (innermode))
7347 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7349 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7350 NULL_RTX, VOIDmode, 0);
7351 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7352 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7355 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7356 NULL_RTX, VOIDmode, 0);
7359 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7360 && innermode == word_mode)
7363 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7364 NULL_RTX, VOIDmode, 0);
7365 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7366 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7369 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7370 NULL_RTX, VOIDmode, 0);
7371 temp = expand_binop (mode, other_optab, op0, op1, target,
7372 unsignedp, OPTAB_LIB_WIDEN);
7373 htem = expand_mult_highpart_adjust (innermode,
7374 gen_highpart (innermode, temp),
7376 gen_highpart (innermode, temp),
7378 emit_move_insn (gen_highpart (innermode, temp), htem);
7383 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7384 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7385 return expand_mult (mode, op0, op1, target, unsignedp);
7387 case TRUNC_DIV_EXPR:
7388 case FLOOR_DIV_EXPR:
7390 case ROUND_DIV_EXPR:
7391 case EXACT_DIV_EXPR:
7392 preexpand_calls (exp);
7393 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7395 /* Possible optimization: compute the dividend with EXPAND_SUM
7396 then if the divisor is constant can optimize the case
7397 where some terms of the dividend have coeffs divisible by it. */
7398 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7399 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7400 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7403 this_optab = flodiv_optab;
7406 case TRUNC_MOD_EXPR:
7407 case FLOOR_MOD_EXPR:
7409 case ROUND_MOD_EXPR:
7410 preexpand_calls (exp);
7411 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7413 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7414 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7415 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7417 case FIX_ROUND_EXPR:
7418 case FIX_FLOOR_EXPR:
7420 abort (); /* Not used for C. */
7422 case FIX_TRUNC_EXPR:
7423 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7425 target = gen_reg_rtx (mode);
7426 expand_fix (target, op0, unsignedp);
7430 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7432 target = gen_reg_rtx (mode);
7433 /* expand_float can't figure out what to do if FROM has VOIDmode.
7434 So give it the correct mode. With -O, cse will optimize this. */
7435 if (GET_MODE (op0) == VOIDmode)
7436 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7438 expand_float (target, op0,
7439 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7443 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7444 temp = expand_unop (mode, neg_optab, op0, target, 0);
7450 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7452 /* Handle complex values specially. */
7453 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_INT
7454 || GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
7455 return expand_complex_abs (mode, op0, target, unsignedp);
7457 /* Unsigned abs is simply the operand. Testing here means we don't
7458 risk generating incorrect code below. */
7459 if (TREE_UNSIGNED (type))
7462 return expand_abs (mode, op0, target,
7463 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7467 target = original_target;
7468 if (target == 0 || ! safe_from_p (target, TREE_OPERAND (exp, 1), 1)
7469 || (GET_CODE (target) == MEM && MEM_VOLATILE_P (target))
7470 || GET_MODE (target) != mode
7471 || (GET_CODE (target) == REG
7472 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7473 target = gen_reg_rtx (mode);
7474 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
7475 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7477 /* First try to do it with a special MIN or MAX instruction.
7478 If that does not win, use a conditional jump to select the proper
7480 this_optab = (TREE_UNSIGNED (type)
7481 ? (code == MIN_EXPR ? umin_optab : umax_optab)
7482 : (code == MIN_EXPR ? smin_optab : smax_optab));
7484 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7489 /* At this point, a MEM target is no longer useful; we will get better
7492 if (GET_CODE (target) == MEM)
7493 target = gen_reg_rtx (mode);
7496 emit_move_insn (target, op0);
7498 op0 = gen_label_rtx ();
7500 /* If this mode is an integer too wide to compare properly,
7501 compare word by word. Rely on cse to optimize constant cases. */
7502 if (GET_MODE_CLASS (mode) == MODE_INT && ! can_compare_p (mode, ccp_jump))
7504 if (code == MAX_EXPR)
7505 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7506 target, op1, NULL_RTX, op0);
7508 do_jump_by_parts_greater_rtx (mode, TREE_UNSIGNED (type),
7509 op1, target, NULL_RTX, op0);
7513 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 1)));
7514 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
7515 unsignedp, mode, NULL_RTX, 0, NULL_RTX,
7518 emit_move_insn (target, op1);
7523 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7524 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
7530 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7531 temp = expand_unop (mode, ffs_optab, op0, target, 1);
7536 /* ??? Can optimize bitwise operations with one arg constant.
7537 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7538 and (a bitwise1 b) bitwise2 b (etc)
7539 but that is probably not worth while. */
7541 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7542 boolean values when we want in all cases to compute both of them. In
7543 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7544 as actual zero-or-1 values and then bitwise anding. In cases where
7545 there cannot be any side effects, better code would be made by
7546 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7547 how to recognize those cases. */
7549 case TRUTH_AND_EXPR:
7551 this_optab = and_optab;
7556 this_optab = ior_optab;
7559 case TRUTH_XOR_EXPR:
7561 this_optab = xor_optab;
7568 preexpand_calls (exp);
7569 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7571 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7572 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
7575 /* Could determine the answer when only additive constants differ. Also,
7576 the addition of one can be handled by changing the condition. */
7583 preexpand_calls (exp);
7584 temp = do_store_flag (exp, target, tmode != VOIDmode ? tmode : mode, 0);
7588 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
7589 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
7591 && GET_CODE (original_target) == REG
7592 && (GET_MODE (original_target)
7593 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
7595 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
7598 if (temp != original_target)
7599 temp = copy_to_reg (temp);
7601 op1 = gen_label_rtx ();
7602 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
7603 GET_MODE (temp), unsignedp, 0, op1);
7604 emit_move_insn (temp, const1_rtx);
7609 /* If no set-flag instruction, must generate a conditional
7610 store into a temporary variable. Drop through
7611 and handle this like && and ||. */
7613 case TRUTH_ANDIF_EXPR:
7614 case TRUTH_ORIF_EXPR:
7616 && (target == 0 || ! safe_from_p (target, exp, 1)
7617 /* Make sure we don't have a hard reg (such as function's return
7618 value) live across basic blocks, if not optimizing. */
7619 || (!optimize && GET_CODE (target) == REG
7620 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
7621 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7624 emit_clr_insn (target);
7626 op1 = gen_label_rtx ();
7627 jumpifnot (exp, op1);
7630 emit_0_to_1_insn (target);
7633 return ignore ? const0_rtx : target;
7635 case TRUTH_NOT_EXPR:
7636 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
7637 /* The parser is careful to generate TRUTH_NOT_EXPR
7638 only with operands that are always zero or one. */
7639 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
7640 target, 1, OPTAB_LIB_WIDEN);
7646 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
7648 return expand_expr (TREE_OPERAND (exp, 1),
7649 (ignore ? const0_rtx : target),
7653 /* If we would have a "singleton" (see below) were it not for a
7654 conversion in each arm, bring that conversion back out. */
7655 if (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7656 && TREE_CODE (TREE_OPERAND (exp, 2)) == NOP_EXPR
7657 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 1), 0))
7658 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 2), 0))))
7660 tree true = TREE_OPERAND (TREE_OPERAND (exp, 1), 0);
7661 tree false = TREE_OPERAND (TREE_OPERAND (exp, 2), 0);
7663 if ((TREE_CODE_CLASS (TREE_CODE (true)) == '2'
7664 && operand_equal_p (false, TREE_OPERAND (true, 0), 0))
7665 || (TREE_CODE_CLASS (TREE_CODE (false)) == '2'
7666 && operand_equal_p (true, TREE_OPERAND (false, 0), 0))
7667 || (TREE_CODE_CLASS (TREE_CODE (true)) == '1'
7668 && operand_equal_p (false, TREE_OPERAND (true, 0), 0))
7669 || (TREE_CODE_CLASS (TREE_CODE (false)) == '1'
7670 && operand_equal_p (true, TREE_OPERAND (false, 0), 0)))
7671 return expand_expr (build1 (NOP_EXPR, type,
7672 build (COND_EXPR, TREE_TYPE (true),
7673 TREE_OPERAND (exp, 0),
7675 target, tmode, modifier);
7679 /* Note that COND_EXPRs whose type is a structure or union
7680 are required to be constructed to contain assignments of
7681 a temporary variable, so that we can evaluate them here
7682 for side effect only. If type is void, we must do likewise. */
7684 /* If an arm of the branch requires a cleanup,
7685 only that cleanup is performed. */
7688 tree binary_op = 0, unary_op = 0;
7690 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
7691 convert it to our mode, if necessary. */
7692 if (integer_onep (TREE_OPERAND (exp, 1))
7693 && integer_zerop (TREE_OPERAND (exp, 2))
7694 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
7698 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
7703 op0 = expand_expr (TREE_OPERAND (exp, 0), target, mode, ro_modifier);
7704 if (GET_MODE (op0) == mode)
7708 target = gen_reg_rtx (mode);
7709 convert_move (target, op0, unsignedp);
7713 /* Check for X ? A + B : A. If we have this, we can copy A to the
7714 output and conditionally add B. Similarly for unary operations.
7715 Don't do this if X has side-effects because those side effects
7716 might affect A or B and the "?" operation is a sequence point in
7717 ANSI. (operand_equal_p tests for side effects.) */
7719 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '2'
7720 && operand_equal_p (TREE_OPERAND (exp, 2),
7721 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
7722 singleton = TREE_OPERAND (exp, 2), binary_op = TREE_OPERAND (exp, 1);
7723 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '2'
7724 && operand_equal_p (TREE_OPERAND (exp, 1),
7725 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
7726 singleton = TREE_OPERAND (exp, 1), binary_op = TREE_OPERAND (exp, 2);
7727 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 1))) == '1'
7728 && operand_equal_p (TREE_OPERAND (exp, 2),
7729 TREE_OPERAND (TREE_OPERAND (exp, 1), 0), 0))
7730 singleton = TREE_OPERAND (exp, 2), unary_op = TREE_OPERAND (exp, 1);
7731 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 2))) == '1'
7732 && operand_equal_p (TREE_OPERAND (exp, 1),
7733 TREE_OPERAND (TREE_OPERAND (exp, 2), 0), 0))
7734 singleton = TREE_OPERAND (exp, 1), unary_op = TREE_OPERAND (exp, 2);
7736 /* If we are not to produce a result, we have no target. Otherwise,
7737 if a target was specified use it; it will not be used as an
7738 intermediate target unless it is safe. If no target, use a
7743 else if (original_target
7744 && (safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
7745 || (singleton && GET_CODE (original_target) == REG
7746 && REGNO (original_target) >= FIRST_PSEUDO_REGISTER
7747 && original_target == var_rtx (singleton)))
7748 && GET_MODE (original_target) == mode
7749 #ifdef HAVE_conditional_move
7750 && (! can_conditionally_move_p (mode)
7751 || GET_CODE (original_target) == REG
7752 || TREE_ADDRESSABLE (type))
7754 && ! (GET_CODE (original_target) == MEM
7755 && MEM_VOLATILE_P (original_target)))
7756 temp = original_target;
7757 else if (TREE_ADDRESSABLE (type))
7760 temp = assign_temp (type, 0, 0, 1);
7762 /* If we had X ? A + C : A, with C a constant power of 2, and we can
7763 do the test of X as a store-flag operation, do this as
7764 A + ((X != 0) << log C). Similarly for other simple binary
7765 operators. Only do for C == 1 if BRANCH_COST is low. */
7766 if (temp && singleton && binary_op
7767 && (TREE_CODE (binary_op) == PLUS_EXPR
7768 || TREE_CODE (binary_op) == MINUS_EXPR
7769 || TREE_CODE (binary_op) == BIT_IOR_EXPR
7770 || TREE_CODE (binary_op) == BIT_XOR_EXPR)
7771 && (BRANCH_COST >= 3 ? integer_pow2p (TREE_OPERAND (binary_op, 1))
7772 : integer_onep (TREE_OPERAND (binary_op, 1)))
7773 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<')
7776 optab boptab = (TREE_CODE (binary_op) == PLUS_EXPR ? add_optab
7777 : TREE_CODE (binary_op) == MINUS_EXPR ? sub_optab
7778 : TREE_CODE (binary_op) == BIT_IOR_EXPR ? ior_optab
7781 /* If we had X ? A : A + 1, do this as A + (X == 0).
7783 We have to invert the truth value here and then put it
7784 back later if do_store_flag fails. We cannot simply copy
7785 TREE_OPERAND (exp, 0) to another variable and modify that
7786 because invert_truthvalue can modify the tree pointed to
7788 if (singleton == TREE_OPERAND (exp, 1))
7789 TREE_OPERAND (exp, 0)
7790 = invert_truthvalue (TREE_OPERAND (exp, 0));
7792 result = do_store_flag (TREE_OPERAND (exp, 0),
7793 (safe_from_p (temp, singleton, 1)
7795 mode, BRANCH_COST <= 1);
7797 if (result != 0 && ! integer_onep (TREE_OPERAND (binary_op, 1)))
7798 result = expand_shift (LSHIFT_EXPR, mode, result,
7799 build_int_2 (tree_log2
7803 (safe_from_p (temp, singleton, 1)
7804 ? temp : NULL_RTX), 0);
7808 op1 = expand_expr (singleton, NULL_RTX, VOIDmode, 0);
7809 return expand_binop (mode, boptab, op1, result, temp,
7810 unsignedp, OPTAB_LIB_WIDEN);
7812 else if (singleton == TREE_OPERAND (exp, 1))
7813 TREE_OPERAND (exp, 0)
7814 = invert_truthvalue (TREE_OPERAND (exp, 0));
7817 do_pending_stack_adjust ();
7819 op0 = gen_label_rtx ();
7821 if (singleton && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0)))
7825 /* If the target conflicts with the other operand of the
7826 binary op, we can't use it. Also, we can't use the target
7827 if it is a hard register, because evaluating the condition
7828 might clobber it. */
7830 && ! safe_from_p (temp, TREE_OPERAND (binary_op, 1), 1))
7831 || (GET_CODE (temp) == REG
7832 && REGNO (temp) < FIRST_PSEUDO_REGISTER))
7833 temp = gen_reg_rtx (mode);
7834 store_expr (singleton, temp, 0);
7837 expand_expr (singleton,
7838 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
7839 if (singleton == TREE_OPERAND (exp, 1))
7840 jumpif (TREE_OPERAND (exp, 0), op0);
7842 jumpifnot (TREE_OPERAND (exp, 0), op0);
7844 start_cleanup_deferral ();
7845 if (binary_op && temp == 0)
7846 /* Just touch the other operand. */
7847 expand_expr (TREE_OPERAND (binary_op, 1),
7848 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
7850 store_expr (build (TREE_CODE (binary_op), type,
7851 make_tree (type, temp),
7852 TREE_OPERAND (binary_op, 1)),
7855 store_expr (build1 (TREE_CODE (unary_op), type,
7856 make_tree (type, temp)),
7860 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
7861 comparison operator. If we have one of these cases, set the
7862 output to A, branch on A (cse will merge these two references),
7863 then set the output to FOO. */
7865 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
7866 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
7867 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7868 TREE_OPERAND (exp, 1), 0)
7869 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
7870 || TREE_CODE (TREE_OPERAND (exp, 1)) == SAVE_EXPR)
7871 && safe_from_p (temp, TREE_OPERAND (exp, 2), 1))
7873 if (GET_CODE (temp) == REG && REGNO (temp) < FIRST_PSEUDO_REGISTER)
7874 temp = gen_reg_rtx (mode);
7875 store_expr (TREE_OPERAND (exp, 1), temp, 0);
7876 jumpif (TREE_OPERAND (exp, 0), op0);
7878 start_cleanup_deferral ();
7879 store_expr (TREE_OPERAND (exp, 2), temp, 0);
7883 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, 0))) == '<'
7884 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp, 0), 1))
7885 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7886 TREE_OPERAND (exp, 2), 0)
7887 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 0))
7888 || TREE_CODE (TREE_OPERAND (exp, 2)) == SAVE_EXPR)
7889 && safe_from_p (temp, TREE_OPERAND (exp, 1), 1))
7891 if (GET_CODE (temp) == REG && REGNO (temp) < FIRST_PSEUDO_REGISTER)
7892 temp = gen_reg_rtx (mode);
7893 store_expr (TREE_OPERAND (exp, 2), temp, 0);
7894 jumpifnot (TREE_OPERAND (exp, 0), op0);
7896 start_cleanup_deferral ();
7897 store_expr (TREE_OPERAND (exp, 1), temp, 0);
7902 op1 = gen_label_rtx ();
7903 jumpifnot (TREE_OPERAND (exp, 0), op0);
7905 start_cleanup_deferral ();
7907 /* One branch of the cond can be void, if it never returns. For
7908 example A ? throw : E */
7910 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node)
7911 store_expr (TREE_OPERAND (exp, 1), temp, 0);
7913 expand_expr (TREE_OPERAND (exp, 1),
7914 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
7915 end_cleanup_deferral ();
7917 emit_jump_insn (gen_jump (op1));
7920 start_cleanup_deferral ();
7922 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node)
7923 store_expr (TREE_OPERAND (exp, 2), temp, 0);
7925 expand_expr (TREE_OPERAND (exp, 2),
7926 ignore ? const0_rtx : NULL_RTX, VOIDmode, 0);
7929 end_cleanup_deferral ();
7940 /* Something needs to be initialized, but we didn't know
7941 where that thing was when building the tree. For example,
7942 it could be the return value of a function, or a parameter
7943 to a function which lays down in the stack, or a temporary
7944 variable which must be passed by reference.
7946 We guarantee that the expression will either be constructed
7947 or copied into our original target. */
7949 tree slot = TREE_OPERAND (exp, 0);
7950 tree cleanups = NULL_TREE;
7953 if (TREE_CODE (slot) != VAR_DECL)
7957 target = original_target;
7959 /* Set this here so that if we get a target that refers to a
7960 register variable that's already been used, put_reg_into_stack
7961 knows that it should fix up those uses. */
7962 TREE_USED (slot) = 1;
7966 if (DECL_RTL (slot) != 0)
7968 target = DECL_RTL (slot);
7969 /* If we have already expanded the slot, so don't do
7971 if (TREE_OPERAND (exp, 1) == NULL_TREE)
7976 target = assign_temp (type, 2, 0, 1);
7977 /* All temp slots at this level must not conflict. */
7978 preserve_temp_slots (target);
7979 DECL_RTL (slot) = target;
7980 if (TREE_ADDRESSABLE (slot))
7982 TREE_ADDRESSABLE (slot) = 0;
7983 mark_addressable (slot);
7986 /* Since SLOT is not known to the called function
7987 to belong to its stack frame, we must build an explicit
7988 cleanup. This case occurs when we must build up a reference
7989 to pass the reference as an argument. In this case,
7990 it is very likely that such a reference need not be
7993 if (TREE_OPERAND (exp, 2) == 0)
7994 TREE_OPERAND (exp, 2) = maybe_build_cleanup (slot);
7995 cleanups = TREE_OPERAND (exp, 2);
8000 /* This case does occur, when expanding a parameter which
8001 needs to be constructed on the stack. The target
8002 is the actual stack address that we want to initialize.
8003 The function we call will perform the cleanup in this case. */
8005 /* If we have already assigned it space, use that space,
8006 not target that we were passed in, as our target
8007 parameter is only a hint. */
8008 if (DECL_RTL (slot) != 0)
8010 target = DECL_RTL (slot);
8011 /* If we have already expanded the slot, so don't do
8013 if (TREE_OPERAND (exp, 1) == NULL_TREE)
8018 DECL_RTL (slot) = target;
8019 /* If we must have an addressable slot, then make sure that
8020 the RTL that we just stored in slot is OK. */
8021 if (TREE_ADDRESSABLE (slot))
8023 TREE_ADDRESSABLE (slot) = 0;
8024 mark_addressable (slot);
8029 exp1 = TREE_OPERAND (exp, 3) = TREE_OPERAND (exp, 1);
8030 /* Mark it as expanded. */
8031 TREE_OPERAND (exp, 1) = NULL_TREE;
8033 store_expr (exp1, target, 0);
8035 expand_decl_cleanup (NULL_TREE, cleanups);
8042 tree lhs = TREE_OPERAND (exp, 0);
8043 tree rhs = TREE_OPERAND (exp, 1);
8044 tree noncopied_parts = 0;
8045 tree lhs_type = TREE_TYPE (lhs);
8047 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8048 if (TYPE_NONCOPIED_PARTS (lhs_type) != 0 && !fixed_type_p (rhs))
8049 noncopied_parts = init_noncopied_parts (stabilize_reference (lhs),
8050 TYPE_NONCOPIED_PARTS (lhs_type));
8051 while (noncopied_parts != 0)
8053 expand_assignment (TREE_VALUE (noncopied_parts),
8054 TREE_PURPOSE (noncopied_parts), 0, 0);
8055 noncopied_parts = TREE_CHAIN (noncopied_parts);
8062 /* If lhs is complex, expand calls in rhs before computing it.
8063 That's so we don't compute a pointer and save it over a call.
8064 If lhs is simple, compute it first so we can give it as a
8065 target if the rhs is just a call. This avoids an extra temp and copy
8066 and that prevents a partial-subsumption which makes bad code.
8067 Actually we could treat component_ref's of vars like vars. */
8069 tree lhs = TREE_OPERAND (exp, 0);
8070 tree rhs = TREE_OPERAND (exp, 1);
8071 tree noncopied_parts = 0;
8072 tree lhs_type = TREE_TYPE (lhs);
8076 if (TREE_CODE (lhs) != VAR_DECL
8077 && TREE_CODE (lhs) != RESULT_DECL
8078 && TREE_CODE (lhs) != PARM_DECL
8079 && ! (TREE_CODE (lhs) == INDIRECT_REF
8080 && TYPE_READONLY (TREE_TYPE (TREE_OPERAND (lhs, 0)))))
8081 preexpand_calls (exp);
8083 /* Check for |= or &= of a bitfield of size one into another bitfield
8084 of size 1. In this case, (unless we need the result of the
8085 assignment) we can do this more efficiently with a
8086 test followed by an assignment, if necessary.
8088 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8089 things change so we do, this code should be enhanced to
8092 && TREE_CODE (lhs) == COMPONENT_REF
8093 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8094 || TREE_CODE (rhs) == BIT_AND_EXPR)
8095 && TREE_OPERAND (rhs, 0) == lhs
8096 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8097 && TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (lhs, 1))) == 1
8098 && TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))) == 1)
8100 rtx label = gen_label_rtx ();
8102 do_jump (TREE_OPERAND (rhs, 1),
8103 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8104 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8105 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8106 (TREE_CODE (rhs) == BIT_IOR_EXPR
8108 : integer_zero_node)),
8110 do_pending_stack_adjust ();
8115 if (TYPE_NONCOPIED_PARTS (lhs_type) != 0
8116 && ! (fixed_type_p (lhs) && fixed_type_p (rhs)))
8117 noncopied_parts = save_noncopied_parts (stabilize_reference (lhs),
8118 TYPE_NONCOPIED_PARTS (lhs_type));
8120 temp = expand_assignment (lhs, rhs, ! ignore, original_target != 0);
8121 while (noncopied_parts != 0)
8123 expand_assignment (TREE_PURPOSE (noncopied_parts),
8124 TREE_VALUE (noncopied_parts), 0, 0);
8125 noncopied_parts = TREE_CHAIN (noncopied_parts);
8131 if (!TREE_OPERAND (exp, 0))
8132 expand_null_return ();
8134 expand_return (TREE_OPERAND (exp, 0));
8137 case PREINCREMENT_EXPR:
8138 case PREDECREMENT_EXPR:
8139 return expand_increment (exp, 0, ignore);
8141 case POSTINCREMENT_EXPR:
8142 case POSTDECREMENT_EXPR:
8143 /* Faster to treat as pre-increment if result is not used. */
8144 return expand_increment (exp, ! ignore, ignore);
8147 /* If nonzero, TEMP will be set to the address of something that might
8148 be a MEM corresponding to a stack slot. */
8151 /* Are we taking the address of a nested function? */
8152 if (TREE_CODE (TREE_OPERAND (exp, 0)) == FUNCTION_DECL
8153 && decl_function_context (TREE_OPERAND (exp, 0)) != 0
8154 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp, 0))
8155 && ! TREE_STATIC (exp))
8157 op0 = trampoline_address (TREE_OPERAND (exp, 0));
8158 op0 = force_operand (op0, target);
8160 /* If we are taking the address of something erroneous, just
8162 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
8166 /* We make sure to pass const0_rtx down if we came in with
8167 ignore set, to avoid doing the cleanups twice for something. */
8168 op0 = expand_expr (TREE_OPERAND (exp, 0),
8169 ignore ? const0_rtx : NULL_RTX, VOIDmode,
8170 (modifier == EXPAND_INITIALIZER
8171 ? modifier : EXPAND_CONST_ADDRESS));
8173 /* If we are going to ignore the result, OP0 will have been set
8174 to const0_rtx, so just return it. Don't get confused and
8175 think we are taking the address of the constant. */
8179 op0 = protect_from_queue (op0, 0);
8181 /* We would like the object in memory. If it is a constant, we can
8182 have it be statically allocated into memory. For a non-constant,
8183 we need to allocate some memory and store the value into it. */
8185 if (CONSTANT_P (op0))
8186 op0 = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
8188 else if (GET_CODE (op0) == MEM)
8190 mark_temp_addr_taken (op0);
8191 temp = XEXP (op0, 0);
8194 else if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8195 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
8197 /* If this object is in a register, it must be not
8199 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
8200 rtx memloc = assign_temp (inner_type, 1, 1, 1);
8202 mark_temp_addr_taken (memloc);
8203 emit_move_insn (memloc, op0);
8207 if (GET_CODE (op0) != MEM)
8210 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8212 temp = XEXP (op0, 0);
8213 #ifdef POINTERS_EXTEND_UNSIGNED
8214 if (GET_MODE (temp) == Pmode && GET_MODE (temp) != mode
8215 && mode == ptr_mode)
8216 temp = convert_memory_address (ptr_mode, temp);
8221 op0 = force_operand (XEXP (op0, 0), target);
8224 if (flag_force_addr && GET_CODE (op0) != REG)
8225 op0 = force_reg (Pmode, op0);
8227 if (GET_CODE (op0) == REG
8228 && ! REG_USERVAR_P (op0))
8229 mark_reg_pointer (op0, TYPE_ALIGN (TREE_TYPE (type)) / BITS_PER_UNIT);
8231 /* If we might have had a temp slot, add an equivalent address
8234 update_temp_slot_address (temp, op0);
8236 #ifdef POINTERS_EXTEND_UNSIGNED
8237 if (GET_MODE (op0) == Pmode && GET_MODE (op0) != mode
8238 && mode == ptr_mode)
8239 op0 = convert_memory_address (ptr_mode, op0);
8244 case ENTRY_VALUE_EXPR:
8247 /* COMPLEX type for Extended Pascal & Fortran */
8250 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8253 /* Get the rtx code of the operands. */
8254 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8255 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8258 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8262 /* Move the real (op0) and imaginary (op1) parts to their location. */
8263 emit_move_insn (gen_realpart (mode, target), op0);
8264 emit_move_insn (gen_imagpart (mode, target), op1);
8266 insns = get_insns ();
8269 /* Complex construction should appear as a single unit. */
8270 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
8271 each with a separate pseudo as destination.
8272 It's not correct for flow to treat them as a unit. */
8273 if (GET_CODE (target) != CONCAT)
8274 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
8282 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8283 return gen_realpart (mode, op0);
8286 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8287 return gen_imagpart (mode, op0);
8291 enum machine_mode partmode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8295 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8298 target = gen_reg_rtx (mode);
8302 /* Store the realpart and the negated imagpart to target. */
8303 emit_move_insn (gen_realpart (partmode, target),
8304 gen_realpart (partmode, op0));
8306 imag_t = gen_imagpart (partmode, target);
8307 temp = expand_unop (partmode, neg_optab,
8308 gen_imagpart (partmode, op0), imag_t, 0);
8310 emit_move_insn (imag_t, temp);
8312 insns = get_insns ();
8315 /* Conjugate should appear as a single unit
8316 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
8317 each with a separate pseudo as destination.
8318 It's not correct for flow to treat them as a unit. */
8319 if (GET_CODE (target) != CONCAT)
8320 emit_no_conflict_block (insns, target, op0, NULL_RTX, NULL_RTX);
8327 case TRY_CATCH_EXPR:
8329 tree handler = TREE_OPERAND (exp, 1);
8331 expand_eh_region_start ();
8333 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8335 expand_eh_region_end (handler);
8340 case TRY_FINALLY_EXPR:
8342 tree try_block = TREE_OPERAND (exp, 0);
8343 tree finally_block = TREE_OPERAND (exp, 1);
8344 rtx finally_label = gen_label_rtx ();
8345 rtx done_label = gen_label_rtx ();
8346 rtx return_link = gen_reg_rtx (Pmode);
8347 tree cleanup = build (GOTO_SUBROUTINE_EXPR, void_type_node,
8348 (tree) finally_label, (tree) return_link);
8349 TREE_SIDE_EFFECTS (cleanup) = 1;
8351 /* Start a new binding layer that will keep track of all cleanup
8352 actions to be performed. */
8353 expand_start_bindings (2);
8355 target_temp_slot_level = temp_slot_level;
8357 expand_decl_cleanup (NULL_TREE, cleanup);
8358 op0 = expand_expr (try_block, target, tmode, modifier);
8360 preserve_temp_slots (op0);
8361 expand_end_bindings (NULL_TREE, 0, 0);
8362 emit_jump (done_label);
8363 emit_label (finally_label);
8364 expand_expr (finally_block, const0_rtx, VOIDmode, 0);
8365 emit_indirect_jump (return_link);
8366 emit_label (done_label);
8370 case GOTO_SUBROUTINE_EXPR:
8372 rtx subr = (rtx) TREE_OPERAND (exp, 0);
8373 rtx return_link = *(rtx *) &TREE_OPERAND (exp, 1);
8374 rtx return_address = gen_label_rtx ();
8375 emit_move_insn (return_link, gen_rtx_LABEL_REF (Pmode, return_address));
8377 emit_label (return_address);
8383 rtx dcc = get_dynamic_cleanup_chain ();
8384 emit_move_insn (dcc, validize_mem (gen_rtx_MEM (Pmode, dcc)));
8390 rtx dhc = get_dynamic_handler_chain ();
8391 emit_move_insn (dhc, validize_mem (gen_rtx_MEM (Pmode, dhc)));
8396 return expand_builtin_va_arg (TREE_OPERAND (exp, 0), type);
8399 return (*lang_expand_expr) (exp, original_target, tmode, modifier);
8402 /* Here to do an ordinary binary operator, generating an instruction
8403 from the optab already placed in `this_optab'. */
8405 preexpand_calls (exp);
8406 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8408 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8409 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
8411 temp = expand_binop (mode, this_optab, op0, op1, target,
8412 unsignedp, OPTAB_LIB_WIDEN);
8418 /* Similar to expand_expr, except that we don't specify a target, target
8419 mode, or modifier and we return the alignment of the inner type. This is
8420 used in cases where it is not necessary to align the result to the
8421 alignment of its type as long as we know the alignment of the result, for
8422 example for comparisons of BLKmode values. */
8425 expand_expr_unaligned (exp, palign)
8430 tree type = TREE_TYPE (exp);
8431 register enum machine_mode mode = TYPE_MODE (type);
8433 /* Default the alignment we return to that of the type. */
8434 *palign = TYPE_ALIGN (type);
8436 /* The only cases in which we do anything special is if the resulting mode
8438 if (mode != BLKmode)
8439 return expand_expr (exp, NULL_RTX, VOIDmode, EXPAND_NORMAL);
8441 switch (TREE_CODE (exp))
8445 case NON_LVALUE_EXPR:
8446 /* Conversions between BLKmode values don't change the underlying
8447 alignment or value. */
8448 if (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == BLKmode)
8449 return expand_expr_unaligned (TREE_OPERAND (exp, 0), palign);
8453 /* Much of the code for this case is copied directly from expand_expr.
8454 We need to duplicate it here because we will do something different
8455 in the fall-through case, so we need to handle the same exceptions
8458 tree array = TREE_OPERAND (exp, 0);
8459 tree domain = TYPE_DOMAIN (TREE_TYPE (array));
8460 tree low_bound = domain ? TYPE_MIN_VALUE (domain) : integer_zero_node;
8461 tree index = TREE_OPERAND (exp, 1);
8462 tree index_type = TREE_TYPE (index);
8465 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) != ARRAY_TYPE)
8468 /* Optimize the special-case of a zero lower bound.
8470 We convert the low_bound to sizetype to avoid some problems
8471 with constant folding. (E.g. suppose the lower bound is 1,
8472 and its mode is QI. Without the conversion, (ARRAY
8473 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8474 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
8476 But sizetype isn't quite right either (especially if
8477 the lowbound is negative). FIXME */
8479 if (! integer_zerop (low_bound))
8480 index = fold (build (MINUS_EXPR, index_type, index,
8481 convert (sizetype, low_bound)));
8483 /* If this is a constant index into a constant array,
8484 just get the value from the array. Handle both the cases when
8485 we have an explicit constructor and when our operand is a variable
8486 that was declared const. */
8488 if (TREE_CODE (array) == CONSTRUCTOR && ! TREE_SIDE_EFFECTS (array))
8490 if (TREE_CODE (index) == INTEGER_CST
8491 && TREE_INT_CST_HIGH (index) == 0)
8493 tree elem = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0));
8495 i = TREE_INT_CST_LOW (index);
8497 elem = TREE_CHAIN (elem);
8499 return expand_expr_unaligned (fold (TREE_VALUE (elem)),
8504 else if (optimize >= 1
8505 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8506 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8507 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK)
8509 if (TREE_CODE (index) == INTEGER_CST)
8511 tree init = DECL_INITIAL (array);
8513 i = TREE_INT_CST_LOW (index);
8514 if (TREE_CODE (init) == CONSTRUCTOR)
8516 tree elem = CONSTRUCTOR_ELTS (init);
8519 && !tree_int_cst_equal (TREE_PURPOSE (elem), index))
8520 elem = TREE_CHAIN (elem);
8522 return expand_expr_unaligned (fold (TREE_VALUE (elem)),
8529 /* ... fall through ... */
8533 /* If the operand is a CONSTRUCTOR, we can just extract the
8534 appropriate field if it is present. Don't do this if we have
8535 already written the data since we want to refer to that copy
8536 and varasm.c assumes that's what we'll do. */
8537 if (TREE_CODE (exp) != ARRAY_REF
8538 && TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR
8539 && TREE_CST_RTL (TREE_OPERAND (exp, 0)) == 0)
8543 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
8544 elt = TREE_CHAIN (elt))
8545 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1))
8546 /* Note that unlike the case in expand_expr, we know this is
8547 BLKmode and hence not an integer. */
8548 return expand_expr_unaligned (TREE_VALUE (elt), palign);
8552 enum machine_mode mode1;
8559 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
8560 &mode1, &unsignedp, &volatilep,
8563 /* If we got back the original object, something is wrong. Perhaps
8564 we are evaluating an expression too early. In any event, don't
8565 infinitely recurse. */
8569 op0 = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_NORMAL);
8571 /* If this is a constant, put it into a register if it is a
8572 legitimate constant and OFFSET is 0 and memory if it isn't. */
8573 if (CONSTANT_P (op0))
8575 enum machine_mode inner_mode = TYPE_MODE (TREE_TYPE (tem));
8577 if (inner_mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
8579 op0 = force_reg (inner_mode, op0);
8581 op0 = validize_mem (force_const_mem (inner_mode, op0));
8586 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
8588 /* If this object is in a register, put it into memory.
8589 This case can't occur in C, but can in Ada if we have
8590 unchecked conversion of an expression from a scalar type to
8591 an array or record type. */
8592 if (GET_CODE (op0) == REG || GET_CODE (op0) == SUBREG
8593 || GET_CODE (op0) == CONCAT || GET_CODE (op0) == ADDRESSOF)
8595 rtx memloc = assign_temp (TREE_TYPE (tem), 1, 1, 1);
8597 mark_temp_addr_taken (memloc);
8598 emit_move_insn (memloc, op0);
8602 if (GET_CODE (op0) != MEM)
8605 if (GET_MODE (offset_rtx) != ptr_mode)
8607 #ifdef POINTERS_EXTEND_UNSIGNED
8608 offset_rtx = convert_memory_address (ptr_mode, offset_rtx);
8610 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
8614 op0 = change_address (op0, VOIDmode,
8615 gen_rtx_PLUS (ptr_mode, XEXP (op0, 0),
8616 force_reg (ptr_mode,
8620 /* Don't forget about volatility even if this is a bitfield. */
8621 if (GET_CODE (op0) == MEM && volatilep && ! MEM_VOLATILE_P (op0))
8623 op0 = copy_rtx (op0);
8624 MEM_VOLATILE_P (op0) = 1;
8627 /* Check the access. */
8628 if (current_function_check_memory_usage && GET_CODE (op0) == MEM)
8633 to = plus_constant (XEXP (op0, 0), (bitpos / BITS_PER_UNIT));
8634 size = (bitpos % BITS_PER_UNIT) + bitsize + BITS_PER_UNIT - 1;
8636 /* Check the access right of the pointer. */
8637 if (size > BITS_PER_UNIT)
8638 emit_library_call (chkr_check_addr_libfunc, 1, VOIDmode, 3,
8639 to, ptr_mode, GEN_INT (size / BITS_PER_UNIT),
8640 TYPE_MODE (sizetype),
8641 GEN_INT (MEMORY_USE_RO),
8642 TYPE_MODE (integer_type_node));
8645 /* Get a reference to just this component. */
8646 op0 = change_address (op0, mode1,
8647 plus_constant (XEXP (op0, 0),
8648 (bitpos / BITS_PER_UNIT)));
8650 MEM_ALIAS_SET (op0) = get_alias_set (exp);
8652 /* Adjust the alignment in case the bit position is not
8653 a multiple of the alignment of the inner object. */
8654 while (bitpos % alignment != 0)
8657 if (GET_CODE (XEXP (op0, 0)) == REG)
8658 mark_reg_pointer (XEXP (op0, 0), alignment);
8660 MEM_IN_STRUCT_P (op0) = 1;
8661 MEM_VOLATILE_P (op0) |= volatilep;
8663 *palign = alignment;
8672 return expand_expr (exp, NULL_RTX, VOIDmode, EXPAND_NORMAL);
8675 /* Return the tree node and offset if a given argument corresponds to
8676 a string constant. */
8679 string_constant (arg, ptr_offset)
8685 if (TREE_CODE (arg) == ADDR_EXPR
8686 && TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
8688 *ptr_offset = integer_zero_node;
8689 return TREE_OPERAND (arg, 0);
8691 else if (TREE_CODE (arg) == PLUS_EXPR)
8693 tree arg0 = TREE_OPERAND (arg, 0);
8694 tree arg1 = TREE_OPERAND (arg, 1);
8699 if (TREE_CODE (arg0) == ADDR_EXPR
8700 && TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST)
8703 return TREE_OPERAND (arg0, 0);
8705 else if (TREE_CODE (arg1) == ADDR_EXPR
8706 && TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST)
8709 return TREE_OPERAND (arg1, 0);
8716 /* Expand code for a post- or pre- increment or decrement
8717 and return the RTX for the result.
8718 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
8721 expand_increment (exp, post, ignore)
8725 register rtx op0, op1;
8726 register rtx temp, value;
8727 register tree incremented = TREE_OPERAND (exp, 0);
8728 optab this_optab = add_optab;
8730 enum machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
8731 int op0_is_copy = 0;
8732 int single_insn = 0;
8733 /* 1 means we can't store into OP0 directly,
8734 because it is a subreg narrower than a word,
8735 and we don't dare clobber the rest of the word. */
8738 /* Stabilize any component ref that might need to be
8739 evaluated more than once below. */
8741 || TREE_CODE (incremented) == BIT_FIELD_REF
8742 || (TREE_CODE (incremented) == COMPONENT_REF
8743 && (TREE_CODE (TREE_OPERAND (incremented, 0)) != INDIRECT_REF
8744 || DECL_BIT_FIELD (TREE_OPERAND (incremented, 1)))))
8745 incremented = stabilize_reference (incremented);
8746 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
8747 ones into save exprs so that they don't accidentally get evaluated
8748 more than once by the code below. */
8749 if (TREE_CODE (incremented) == PREINCREMENT_EXPR
8750 || TREE_CODE (incremented) == PREDECREMENT_EXPR)
8751 incremented = save_expr (incremented);
8753 /* Compute the operands as RTX.
8754 Note whether OP0 is the actual lvalue or a copy of it:
8755 I believe it is a copy iff it is a register or subreg
8756 and insns were generated in computing it. */
8758 temp = get_last_insn ();
8759 op0 = expand_expr (incremented, NULL_RTX, VOIDmode, EXPAND_MEMORY_USE_RW);
8761 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
8762 in place but instead must do sign- or zero-extension during assignment,
8763 so we copy it into a new register and let the code below use it as
8766 Note that we can safely modify this SUBREG since it is know not to be
8767 shared (it was made by the expand_expr call above). */
8769 if (GET_CODE (op0) == SUBREG && SUBREG_PROMOTED_VAR_P (op0))
8772 SUBREG_REG (op0) = copy_to_reg (SUBREG_REG (op0));
8776 else if (GET_CODE (op0) == SUBREG
8777 && GET_MODE_BITSIZE (GET_MODE (op0)) < BITS_PER_WORD)
8779 /* We cannot increment this SUBREG in place. If we are
8780 post-incrementing, get a copy of the old value. Otherwise,
8781 just mark that we cannot increment in place. */
8783 op0 = copy_to_reg (op0);
8788 op0_is_copy = ((GET_CODE (op0) == SUBREG || GET_CODE (op0) == REG)
8789 && temp != get_last_insn ());
8790 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode,
8791 EXPAND_MEMORY_USE_BAD);
8793 /* Decide whether incrementing or decrementing. */
8794 if (TREE_CODE (exp) == POSTDECREMENT_EXPR
8795 || TREE_CODE (exp) == PREDECREMENT_EXPR)
8796 this_optab = sub_optab;
8798 /* Convert decrement by a constant into a negative increment. */
8799 if (this_optab == sub_optab
8800 && GET_CODE (op1) == CONST_INT)
8802 op1 = GEN_INT (- INTVAL (op1));
8803 this_optab = add_optab;
8806 /* For a preincrement, see if we can do this with a single instruction. */
8809 icode = (int) this_optab->handlers[(int) mode].insn_code;
8810 if (icode != (int) CODE_FOR_nothing
8811 /* Make sure that OP0 is valid for operands 0 and 1
8812 of the insn we want to queue. */
8813 && (*insn_data[icode].operand[0].predicate) (op0, mode)
8814 && (*insn_data[icode].operand[1].predicate) (op0, mode)
8815 && (*insn_data[icode].operand[2].predicate) (op1, mode))
8819 /* If OP0 is not the actual lvalue, but rather a copy in a register,
8820 then we cannot just increment OP0. We must therefore contrive to
8821 increment the original value. Then, for postincrement, we can return
8822 OP0 since it is a copy of the old value. For preincrement, expand here
8823 unless we can do it with a single insn.
8825 Likewise if storing directly into OP0 would clobber high bits
8826 we need to preserve (bad_subreg). */
8827 if (op0_is_copy || (!post && !single_insn) || bad_subreg)
8829 /* This is the easiest way to increment the value wherever it is.
8830 Problems with multiple evaluation of INCREMENTED are prevented
8831 because either (1) it is a component_ref or preincrement,
8832 in which case it was stabilized above, or (2) it is an array_ref
8833 with constant index in an array in a register, which is
8834 safe to reevaluate. */
8835 tree newexp = build (((TREE_CODE (exp) == POSTDECREMENT_EXPR
8836 || TREE_CODE (exp) == PREDECREMENT_EXPR)
8837 ? MINUS_EXPR : PLUS_EXPR),
8840 TREE_OPERAND (exp, 1));
8842 while (TREE_CODE (incremented) == NOP_EXPR
8843 || TREE_CODE (incremented) == CONVERT_EXPR)
8845 newexp = convert (TREE_TYPE (incremented), newexp);
8846 incremented = TREE_OPERAND (incremented, 0);
8849 temp = expand_assignment (incremented, newexp, ! post && ! ignore , 0);
8850 return post ? op0 : temp;
8855 /* We have a true reference to the value in OP0.
8856 If there is an insn to add or subtract in this mode, queue it.
8857 Queueing the increment insn avoids the register shuffling
8858 that often results if we must increment now and first save
8859 the old value for subsequent use. */
8861 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
8862 op0 = stabilize (op0);
8865 icode = (int) this_optab->handlers[(int) mode].insn_code;
8866 if (icode != (int) CODE_FOR_nothing
8867 /* Make sure that OP0 is valid for operands 0 and 1
8868 of the insn we want to queue. */
8869 && (*insn_data[icode].operand[0].predicate) (op0, mode)
8870 && (*insn_data[icode].operand[1].predicate) (op0, mode))
8872 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
8873 op1 = force_reg (mode, op1);
8875 return enqueue_insn (op0, GEN_FCN (icode) (op0, op0, op1));
8877 if (icode != (int) CODE_FOR_nothing && GET_CODE (op0) == MEM)
8879 rtx addr = (general_operand (XEXP (op0, 0), mode)
8880 ? force_reg (Pmode, XEXP (op0, 0))
8881 : copy_to_reg (XEXP (op0, 0)));
8884 op0 = change_address (op0, VOIDmode, addr);
8885 temp = force_reg (GET_MODE (op0), op0);
8886 if (! (*insn_data[icode].operand[2].predicate) (op1, mode))
8887 op1 = force_reg (mode, op1);
8889 /* The increment queue is LIFO, thus we have to `queue'
8890 the instructions in reverse order. */
8891 enqueue_insn (op0, gen_move_insn (op0, temp));
8892 result = enqueue_insn (temp, GEN_FCN (icode) (temp, temp, op1));
8897 /* Preincrement, or we can't increment with one simple insn. */
8899 /* Save a copy of the value before inc or dec, to return it later. */
8900 temp = value = copy_to_reg (op0);
8902 /* Arrange to return the incremented value. */
8903 /* Copy the rtx because expand_binop will protect from the queue,
8904 and the results of that would be invalid for us to return
8905 if our caller does emit_queue before using our result. */
8906 temp = copy_rtx (value = op0);
8908 /* Increment however we can. */
8909 op1 = expand_binop (mode, this_optab, value, op1,
8910 current_function_check_memory_usage ? NULL_RTX : op0,
8911 TREE_UNSIGNED (TREE_TYPE (exp)), OPTAB_LIB_WIDEN);
8912 /* Make sure the value is stored into OP0. */
8914 emit_move_insn (op0, op1);
8919 /* Expand all function calls contained within EXP, innermost ones first.
8920 But don't look within expressions that have sequence points.
8921 For each CALL_EXPR, record the rtx for its value
8922 in the CALL_EXPR_RTL field. */
8925 preexpand_calls (exp)
8928 register int nops, i;
8929 int type = TREE_CODE_CLASS (TREE_CODE (exp));
8931 if (! do_preexpand_calls)
8934 /* Only expressions and references can contain calls. */
8936 if (type != 'e' && type != '<' && type != '1' && type != '2' && type != 'r')
8939 switch (TREE_CODE (exp))
8942 /* Do nothing if already expanded. */
8943 if (CALL_EXPR_RTL (exp) != 0
8944 /* Do nothing if the call returns a variable-sized object. */
8945 || TREE_CODE (TYPE_SIZE (TREE_TYPE(exp))) != INTEGER_CST
8946 /* Do nothing to built-in functions. */
8947 || (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
8948 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
8950 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))))
8953 CALL_EXPR_RTL (exp) = expand_call (exp, NULL_RTX, 0);
8958 case TRUTH_ANDIF_EXPR:
8959 case TRUTH_ORIF_EXPR:
8960 /* If we find one of these, then we can be sure
8961 the adjust will be done for it (since it makes jumps).
8962 Do it now, so that if this is inside an argument
8963 of a function, we don't get the stack adjustment
8964 after some other args have already been pushed. */
8965 do_pending_stack_adjust ();
8970 case WITH_CLEANUP_EXPR:
8971 case CLEANUP_POINT_EXPR:
8972 case TRY_CATCH_EXPR:
8976 if (SAVE_EXPR_RTL (exp) != 0)
8983 nops = tree_code_length[(int) TREE_CODE (exp)];
8984 for (i = 0; i < nops; i++)
8985 if (TREE_OPERAND (exp, i) != 0)
8987 if (TREE_CODE (exp) == TARGET_EXPR && i == 2)
8988 /* We don't need to preexpand the cleanup for a TARGET_EXPR.
8989 It doesn't happen before the call is made. */
8993 type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
8994 if (type == 'e' || type == '<' || type == '1' || type == '2'
8996 preexpand_calls (TREE_OPERAND (exp, i));
9001 /* At the start of a function, record that we have no previously-pushed
9002 arguments waiting to be popped. */
9005 init_pending_stack_adjust ()
9007 pending_stack_adjust = 0;
9010 /* When exiting from function, if safe, clear out any pending stack adjust
9011 so the adjustment won't get done.
9013 Note, if the current function calls alloca, then it must have a
9014 frame pointer regardless of the value of flag_omit_frame_pointer. */
9017 clear_pending_stack_adjust ()
9019 #ifdef EXIT_IGNORE_STACK
9021 && (! flag_omit_frame_pointer || current_function_calls_alloca)
9022 && EXIT_IGNORE_STACK
9023 && ! (DECL_INLINE (current_function_decl) && ! flag_no_inline)
9024 && ! flag_inline_functions)
9025 pending_stack_adjust = 0;
9029 /* Pop any previously-pushed arguments that have not been popped yet. */
9032 do_pending_stack_adjust ()
9034 if (inhibit_defer_pop == 0)
9036 if (pending_stack_adjust != 0)
9037 adjust_stack (GEN_INT (pending_stack_adjust));
9038 pending_stack_adjust = 0;
9042 /* Expand conditional expressions. */
9044 /* Generate code to evaluate EXP and jump to LABEL if the value is zero.
9045 LABEL is an rtx of code CODE_LABEL, in this function and all the
9049 jumpifnot (exp, label)
9053 do_jump (exp, label, NULL_RTX);
9056 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
9063 do_jump (exp, NULL_RTX, label);
9066 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
9067 the result is zero, or IF_TRUE_LABEL if the result is one.
9068 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
9069 meaning fall through in that case.
9071 do_jump always does any pending stack adjust except when it does not
9072 actually perform a jump. An example where there is no jump
9073 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null.
9075 This function is responsible for optimizing cases such as
9076 &&, || and comparison operators in EXP. */
9079 do_jump (exp, if_false_label, if_true_label)
9081 rtx if_false_label, if_true_label;
9083 register enum tree_code code = TREE_CODE (exp);
9084 /* Some cases need to create a label to jump to
9085 in order to properly fall through.
9086 These cases set DROP_THROUGH_LABEL nonzero. */
9087 rtx drop_through_label = 0;
9091 enum machine_mode mode;
9093 #ifdef MAX_INTEGER_COMPUTATION_MODE
9094 check_max_integer_computation_mode (exp);
9105 temp = integer_zerop (exp) ? if_false_label : if_true_label;
9111 /* This is not true with #pragma weak */
9113 /* The address of something can never be zero. */
9115 emit_jump (if_true_label);
9120 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
9121 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
9122 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF)
9125 /* If we are narrowing the operand, we have to do the compare in the
9127 if ((TYPE_PRECISION (TREE_TYPE (exp))
9128 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0)))))
9130 case NON_LVALUE_EXPR:
9131 case REFERENCE_EXPR:
9136 /* These cannot change zero->non-zero or vice versa. */
9137 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9140 case WITH_RECORD_EXPR:
9141 /* Put the object on the placeholder list, recurse through our first
9142 operand, and pop the list. */
9143 placeholder_list = tree_cons (TREE_OPERAND (exp, 1), NULL_TREE,
9145 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9146 placeholder_list = TREE_CHAIN (placeholder_list);
9150 /* This is never less insns than evaluating the PLUS_EXPR followed by
9151 a test and can be longer if the test is eliminated. */
9153 /* Reduce to minus. */
9154 exp = build (MINUS_EXPR, TREE_TYPE (exp),
9155 TREE_OPERAND (exp, 0),
9156 fold (build1 (NEGATE_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
9157 TREE_OPERAND (exp, 1))));
9158 /* Process as MINUS. */
9162 /* Non-zero iff operands of minus differ. */
9163 do_compare_and_jump (build (NE_EXPR, TREE_TYPE (exp),
9164 TREE_OPERAND (exp, 0),
9165 TREE_OPERAND (exp, 1)),
9166 NE, NE, if_false_label, if_true_label);
9170 /* If we are AND'ing with a small constant, do this comparison in the
9171 smallest type that fits. If the machine doesn't have comparisons
9172 that small, it will be converted back to the wider comparison.
9173 This helps if we are testing the sign bit of a narrower object.
9174 combine can't do this for us because it can't know whether a
9175 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
9177 if (! SLOW_BYTE_ACCESS
9178 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
9179 && TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT
9180 && (i = floor_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)))) >= 0
9181 && (mode = mode_for_size (i + 1, MODE_INT, 0)) != BLKmode
9182 && (type = type_for_mode (mode, 1)) != 0
9183 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9184 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9185 != CODE_FOR_nothing))
9187 do_jump (convert (type, exp), if_false_label, if_true_label);
9192 case TRUTH_NOT_EXPR:
9193 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9196 case TRUTH_ANDIF_EXPR:
9197 if (if_false_label == 0)
9198 if_false_label = drop_through_label = gen_label_rtx ();
9199 do_jump (TREE_OPERAND (exp, 0), if_false_label, NULL_RTX);
9200 start_cleanup_deferral ();
9201 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9202 end_cleanup_deferral ();
9205 case TRUTH_ORIF_EXPR:
9206 if (if_true_label == 0)
9207 if_true_label = drop_through_label = gen_label_rtx ();
9208 do_jump (TREE_OPERAND (exp, 0), NULL_RTX, if_true_label);
9209 start_cleanup_deferral ();
9210 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9211 end_cleanup_deferral ();
9216 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, 0);
9217 preserve_temp_slots (NULL_RTX);
9221 do_pending_stack_adjust ();
9222 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label);
9229 int bitsize, bitpos, unsignedp;
9230 enum machine_mode mode;
9236 /* Get description of this reference. We don't actually care
9237 about the underlying object here. */
9238 get_inner_reference (exp, &bitsize, &bitpos, &offset,
9239 &mode, &unsignedp, &volatilep,
9242 type = type_for_size (bitsize, unsignedp);
9243 if (! SLOW_BYTE_ACCESS
9244 && type != 0 && bitsize >= 0
9245 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp))
9246 && (cmp_optab->handlers[(int) TYPE_MODE (type)].insn_code
9247 != CODE_FOR_nothing))
9249 do_jump (convert (type, exp), if_false_label, if_true_label);
9256 /* Do (a ? 1 : 0) and (a ? 0 : 1) as special cases. */
9257 if (integer_onep (TREE_OPERAND (exp, 1))
9258 && integer_zerop (TREE_OPERAND (exp, 2)))
9259 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9261 else if (integer_zerop (TREE_OPERAND (exp, 1))
9262 && integer_onep (TREE_OPERAND (exp, 2)))
9263 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9267 register rtx label1 = gen_label_rtx ();
9268 drop_through_label = gen_label_rtx ();
9270 do_jump (TREE_OPERAND (exp, 0), label1, NULL_RTX);
9272 start_cleanup_deferral ();
9273 /* Now the THEN-expression. */
9274 do_jump (TREE_OPERAND (exp, 1),
9275 if_false_label ? if_false_label : drop_through_label,
9276 if_true_label ? if_true_label : drop_through_label);
9277 /* In case the do_jump just above never jumps. */
9278 do_pending_stack_adjust ();
9279 emit_label (label1);
9281 /* Now the ELSE-expression. */
9282 do_jump (TREE_OPERAND (exp, 2),
9283 if_false_label ? if_false_label : drop_through_label,
9284 if_true_label ? if_true_label : drop_through_label);
9285 end_cleanup_deferral ();
9291 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9293 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9294 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9296 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9297 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9300 (build (TRUTH_ANDIF_EXPR, TREE_TYPE (exp),
9301 fold (build (EQ_EXPR, TREE_TYPE (exp),
9302 fold (build1 (REALPART_EXPR,
9303 TREE_TYPE (inner_type),
9305 fold (build1 (REALPART_EXPR,
9306 TREE_TYPE (inner_type),
9308 fold (build (EQ_EXPR, TREE_TYPE (exp),
9309 fold (build1 (IMAGPART_EXPR,
9310 TREE_TYPE (inner_type),
9312 fold (build1 (IMAGPART_EXPR,
9313 TREE_TYPE (inner_type),
9315 if_false_label, if_true_label);
9318 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9319 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label);
9321 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9322 && !can_compare_p (TYPE_MODE (inner_type), ccp_jump))
9323 do_jump_by_parts_equality (exp, if_false_label, if_true_label);
9325 do_compare_and_jump (exp, EQ, EQ, if_false_label, if_true_label);
9331 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9333 if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_FLOAT
9334 || GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_COMPLEX_INT)
9336 tree exp0 = save_expr (TREE_OPERAND (exp, 0));
9337 tree exp1 = save_expr (TREE_OPERAND (exp, 1));
9340 (build (TRUTH_ORIF_EXPR, TREE_TYPE (exp),
9341 fold (build (NE_EXPR, TREE_TYPE (exp),
9342 fold (build1 (REALPART_EXPR,
9343 TREE_TYPE (inner_type),
9345 fold (build1 (REALPART_EXPR,
9346 TREE_TYPE (inner_type),
9348 fold (build (NE_EXPR, TREE_TYPE (exp),
9349 fold (build1 (IMAGPART_EXPR,
9350 TREE_TYPE (inner_type),
9352 fold (build1 (IMAGPART_EXPR,
9353 TREE_TYPE (inner_type),
9355 if_false_label, if_true_label);
9358 else if (integer_zerop (TREE_OPERAND (exp, 1)))
9359 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label);
9361 else if (GET_MODE_CLASS (TYPE_MODE (inner_type)) == MODE_INT
9362 && !can_compare_p (TYPE_MODE (inner_type), ccp_jump))
9363 do_jump_by_parts_equality (exp, if_true_label, if_false_label);
9365 do_compare_and_jump (exp, NE, NE, 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 (mode, ccp_jump))
9373 do_jump_by_parts_greater (exp, 1, if_false_label, if_true_label);
9375 do_compare_and_jump (exp, LT, LTU, 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 (mode, ccp_jump))
9382 do_jump_by_parts_greater (exp, 0, if_true_label, if_false_label);
9384 do_compare_and_jump (exp, LE, LEU, 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 (mode, ccp_jump))
9391 do_jump_by_parts_greater (exp, 0, if_false_label, if_true_label);
9393 do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label);
9397 mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9398 if (GET_MODE_CLASS (mode) == MODE_INT
9399 && ! can_compare_p (mode, ccp_jump))
9400 do_jump_by_parts_greater (exp, 1, if_true_label, if_false_label);
9402 do_compare_and_jump (exp, GE, GEU, if_false_label, if_true_label);
9407 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
9409 /* This is not needed any more and causes poor code since it causes
9410 comparisons and tests from non-SI objects to have different code
9412 /* Copy to register to avoid generating bad insns by cse
9413 from (set (mem ...) (arithop)) (set (cc0) (mem ...)). */
9414 if (!cse_not_expected && GET_CODE (temp) == MEM)
9415 temp = copy_to_reg (temp);
9417 do_pending_stack_adjust ();
9418 /* Do any postincrements in the expression that was tested. */
9421 if (GET_CODE (temp) == CONST_INT || GET_CODE (temp) == LABEL_REF)
9423 rtx target = temp == const0_rtx ? if_false_label : if_true_label;
9427 else if (GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
9428 && ! can_compare_p (GET_MODE (temp), ccp_jump))
9429 /* Note swapping the labels gives us not-equal. */
9430 do_jump_by_parts_equality_rtx (temp, if_true_label, if_false_label);
9431 else if (GET_MODE (temp) != VOIDmode)
9432 do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)),
9433 NE, TREE_UNSIGNED (TREE_TYPE (exp)),
9434 GET_MODE (temp), NULL_RTX, 0,
9435 if_false_label, if_true_label);
9440 if (drop_through_label)
9442 /* If do_jump produces code that might be jumped around,
9443 do any stack adjusts from that code, before the place
9444 where control merges in. */
9445 do_pending_stack_adjust ();
9446 emit_label (drop_through_label);
9450 /* Given a comparison expression EXP for values too wide to be compared
9451 with one insn, test the comparison and jump to the appropriate label.
9452 The code of EXP is ignored; we always test GT if SWAP is 0,
9453 and LT if SWAP is 1. */
9456 do_jump_by_parts_greater (exp, swap, if_false_label, if_true_label)
9459 rtx if_false_label, if_true_label;
9461 rtx op0 = expand_expr (TREE_OPERAND (exp, swap), NULL_RTX, VOIDmode, 0);
9462 rtx op1 = expand_expr (TREE_OPERAND (exp, !swap), NULL_RTX, VOIDmode, 0);
9463 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9464 int unsignedp = TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0)));
9466 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label);
9469 /* Compare OP0 with OP1, word at a time, in mode MODE.
9470 UNSIGNEDP says to do unsigned comparison.
9471 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
9474 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, if_true_label)
9475 enum machine_mode mode;
9478 rtx if_false_label, if_true_label;
9480 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9481 rtx drop_through_label = 0;
9484 if (! if_true_label || ! if_false_label)
9485 drop_through_label = gen_label_rtx ();
9486 if (! if_true_label)
9487 if_true_label = drop_through_label;
9488 if (! if_false_label)
9489 if_false_label = drop_through_label;
9491 /* Compare a word at a time, high order first. */
9492 for (i = 0; i < nwords; i++)
9494 rtx op0_word, op1_word;
9496 if (WORDS_BIG_ENDIAN)
9498 op0_word = operand_subword_force (op0, i, mode);
9499 op1_word = operand_subword_force (op1, i, mode);
9503 op0_word = operand_subword_force (op0, nwords - 1 - i, mode);
9504 op1_word = operand_subword_force (op1, nwords - 1 - i, mode);
9507 /* All but high-order word must be compared as unsigned. */
9508 do_compare_rtx_and_jump (op0_word, op1_word, GT,
9509 (unsignedp || i > 0), word_mode, NULL_RTX, 0,
9510 NULL_RTX, if_true_label);
9512 /* Consider lower words only if these are equal. */
9513 do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode,
9514 NULL_RTX, 0, NULL_RTX, if_false_label);
9518 emit_jump (if_false_label);
9519 if (drop_through_label)
9520 emit_label (drop_through_label);
9523 /* Given an EQ_EXPR expression EXP for values too wide to be compared
9524 with one insn, test the comparison and jump to the appropriate label. */
9527 do_jump_by_parts_equality (exp, if_false_label, if_true_label)
9529 rtx if_false_label, if_true_label;
9531 rtx op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
9532 rtx op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX, VOIDmode, 0);
9533 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)));
9534 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD);
9536 rtx drop_through_label = 0;
9538 if (! if_false_label)
9539 drop_through_label = if_false_label = gen_label_rtx ();
9541 for (i = 0; i < nwords; i++)
9542 do_compare_rtx_and_jump (operand_subword_force (op0, i, mode),
9543 operand_subword_force (op1, i, mode),
9544 EQ, TREE_UNSIGNED (TREE_TYPE (exp)),
9545 word_mode, NULL_RTX, 0, if_false_label,
9549 emit_jump (if_true_label);
9550 if (drop_through_label)
9551 emit_label (drop_through_label);
9554 /* Jump according to whether OP0 is 0.
9555 We assume that OP0 has an integer mode that is too wide
9556 for the available compare insns. */
9559 do_jump_by_parts_equality_rtx (op0, if_false_label, if_true_label)
9561 rtx if_false_label, if_true_label;
9563 int nwords = GET_MODE_SIZE (GET_MODE (op0)) / UNITS_PER_WORD;
9566 rtx drop_through_label = 0;
9568 /* The fastest way of doing this comparison on almost any machine is to
9569 "or" all the words and compare the result. If all have to be loaded
9570 from memory and this is a very wide item, it's possible this may
9571 be slower, but that's highly unlikely. */
9573 part = gen_reg_rtx (word_mode);
9574 emit_move_insn (part, operand_subword_force (op0, 0, GET_MODE (op0)));
9575 for (i = 1; i < nwords && part != 0; i++)
9576 part = expand_binop (word_mode, ior_optab, part,
9577 operand_subword_force (op0, i, GET_MODE (op0)),
9578 part, 1, OPTAB_WIDEN);
9582 do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode,
9583 NULL_RTX, 0, if_false_label, if_true_label);
9588 /* If we couldn't do the "or" simply, do this with a series of compares. */
9589 if (! if_false_label)
9590 drop_through_label = if_false_label = gen_label_rtx ();
9592 for (i = 0; i < nwords; i++)
9593 do_compare_rtx_and_jump (operand_subword_force (op0, i, GET_MODE (op0)),
9594 const0_rtx, EQ, 1, word_mode, NULL_RTX, 0,
9595 if_false_label, NULL_RTX);
9598 emit_jump (if_true_label);
9600 if (drop_through_label)
9601 emit_label (drop_through_label);
9604 /* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
9605 (including code to compute the values to be compared)
9606 and set (CC0) according to the result.
9607 The decision as to signed or unsigned comparison must be made by the caller.
9609 We force a stack adjustment unless there are currently
9610 things pushed on the stack that aren't yet used.
9612 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9615 If ALIGN is non-zero, it is the alignment of this type; if zero, the
9616 size of MODE should be used. */
9619 compare_from_rtx (op0, op1, code, unsignedp, mode, size, align)
9620 register rtx op0, op1;
9623 enum machine_mode mode;
9629 /* If one operand is constant, make it the second one. Only do this
9630 if the other operand is not constant as well. */
9632 if ((CONSTANT_P (op0) && ! CONSTANT_P (op1))
9633 || (GET_CODE (op0) == CONST_INT && GET_CODE (op1) != CONST_INT))
9638 code = swap_condition (code);
9643 op0 = force_not_mem (op0);
9644 op1 = force_not_mem (op1);
9647 do_pending_stack_adjust ();
9649 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
9650 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
9654 /* There's no need to do this now that combine.c can eliminate lots of
9655 sign extensions. This can be less efficient in certain cases on other
9658 /* If this is a signed equality comparison, we can do it as an
9659 unsigned comparison since zero-extension is cheaper than sign
9660 extension and comparisons with zero are done as unsigned. This is
9661 the case even on machines that can do fast sign extension, since
9662 zero-extension is easier to combine with other operations than
9663 sign-extension is. If we are comparing against a constant, we must
9664 convert it to what it would look like unsigned. */
9665 if ((code == EQ || code == NE) && ! unsignedp
9666 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
9668 if (GET_CODE (op1) == CONST_INT
9669 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
9670 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
9675 emit_cmp_insn (op0, op1, code, size, mode, unsignedp, align);
9677 return gen_rtx_fmt_ee (code, VOIDmode, cc0_rtx, const0_rtx);
9680 /* Like do_compare_and_jump but expects the values to compare as two rtx's.
9681 The decision as to signed or unsigned comparison must be made by the caller.
9683 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9686 If ALIGN is non-zero, it is the alignment of this type; if zero, the
9687 size of MODE should be used. */
9690 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, size, align,
9691 if_false_label, if_true_label)
9692 register rtx op0, op1;
9695 enum machine_mode mode;
9698 rtx if_false_label, if_true_label;
9701 int dummy_true_label = 0;
9703 /* Reverse the comparison if that is safe and we want to jump if it is
9705 if (! if_true_label && ! FLOAT_MODE_P (mode))
9707 if_true_label = if_false_label;
9709 code = reverse_condition (code);
9712 /* If one operand is constant, make it the second one. Only do this
9713 if the other operand is not constant as well. */
9715 if ((CONSTANT_P (op0) && ! CONSTANT_P (op1))
9716 || (GET_CODE (op0) == CONST_INT && GET_CODE (op1) != CONST_INT))
9721 code = swap_condition (code);
9726 op0 = force_not_mem (op0);
9727 op1 = force_not_mem (op1);
9730 do_pending_stack_adjust ();
9732 if (GET_CODE (op0) == CONST_INT && GET_CODE (op1) == CONST_INT
9733 && (tem = simplify_relational_operation (code, mode, op0, op1)) != 0)
9735 if (tem == const_true_rtx)
9738 emit_jump (if_true_label);
9743 emit_jump (if_false_label);
9749 /* There's no need to do this now that combine.c can eliminate lots of
9750 sign extensions. This can be less efficient in certain cases on other
9753 /* If this is a signed equality comparison, we can do it as an
9754 unsigned comparison since zero-extension is cheaper than sign
9755 extension and comparisons with zero are done as unsigned. This is
9756 the case even on machines that can do fast sign extension, since
9757 zero-extension is easier to combine with other operations than
9758 sign-extension is. If we are comparing against a constant, we must
9759 convert it to what it would look like unsigned. */
9760 if ((code == EQ || code == NE) && ! unsignedp
9761 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
9763 if (GET_CODE (op1) == CONST_INT
9764 && (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0))) != INTVAL (op1))
9765 op1 = GEN_INT (INTVAL (op1) & GET_MODE_MASK (GET_MODE (op0)));
9770 if (! if_true_label)
9772 dummy_true_label = 1;
9773 if_true_label = gen_label_rtx ();
9776 emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp, align,
9780 emit_jump (if_false_label);
9781 if (dummy_true_label)
9782 emit_label (if_true_label);
9785 /* Generate code for a comparison expression EXP (including code to compute
9786 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
9787 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
9788 generated code will drop through.
9789 SIGNED_CODE should be the rtx operation for this comparison for
9790 signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
9792 We force a stack adjustment unless there are currently
9793 things pushed on the stack that aren't yet used. */
9796 do_compare_and_jump (exp, signed_code, unsigned_code, if_false_label,
9799 enum rtx_code signed_code, unsigned_code;
9800 rtx if_false_label, if_true_label;
9803 register rtx op0, op1;
9805 register enum machine_mode mode;
9809 /* Don't crash if the comparison was erroneous. */
9810 op0 = expand_expr_unaligned (TREE_OPERAND (exp, 0), &align0);
9811 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ERROR_MARK)
9814 op1 = expand_expr_unaligned (TREE_OPERAND (exp, 1), &align1);
9815 type = TREE_TYPE (TREE_OPERAND (exp, 0));
9816 mode = TYPE_MODE (type);
9817 unsignedp = TREE_UNSIGNED (type);
9818 code = unsignedp ? unsigned_code : signed_code;
9820 #ifdef HAVE_canonicalize_funcptr_for_compare
9821 /* If function pointers need to be "canonicalized" before they can
9822 be reliably compared, then canonicalize them. */
9823 if (HAVE_canonicalize_funcptr_for_compare
9824 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
9825 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
9828 rtx new_op0 = gen_reg_rtx (mode);
9830 emit_insn (gen_canonicalize_funcptr_for_compare (new_op0, op0));
9834 if (HAVE_canonicalize_funcptr_for_compare
9835 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
9836 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
9839 rtx new_op1 = gen_reg_rtx (mode);
9841 emit_insn (gen_canonicalize_funcptr_for_compare (new_op1, op1));
9846 /* Do any postincrements in the expression that was tested. */
9849 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode,
9851 ? expr_size (TREE_OPERAND (exp, 0)) : NULL_RTX),
9852 MIN (align0, align1) / BITS_PER_UNIT,
9853 if_false_label, if_true_label);
9856 /* Generate code to calculate EXP using a store-flag instruction
9857 and return an rtx for the result. EXP is either a comparison
9858 or a TRUTH_NOT_EXPR whose operand is a comparison.
9860 If TARGET is nonzero, store the result there if convenient.
9862 If ONLY_CHEAP is non-zero, only do this if it is likely to be very
9865 Return zero if there is no suitable set-flag instruction
9866 available on this machine.
9868 Once expand_expr has been called on the arguments of the comparison,
9869 we are committed to doing the store flag, since it is not safe to
9870 re-evaluate the expression. We emit the store-flag insn by calling
9871 emit_store_flag, but only expand the arguments if we have a reason
9872 to believe that emit_store_flag will be successful. If we think that
9873 it will, but it isn't, we have to simulate the store-flag with a
9874 set/jump/set sequence. */
9877 do_store_flag (exp, target, mode, only_cheap)
9880 enum machine_mode mode;
9884 tree arg0, arg1, type;
9886 enum machine_mode operand_mode;
9890 enum insn_code icode;
9891 rtx subtarget = target;
9894 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9895 result at the end. We can't simply invert the test since it would
9896 have already been inverted if it were valid. This case occurs for
9897 some floating-point comparisons. */
9899 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
9900 invert = 1, exp = TREE_OPERAND (exp, 0);
9902 arg0 = TREE_OPERAND (exp, 0);
9903 arg1 = TREE_OPERAND (exp, 1);
9904 type = TREE_TYPE (arg0);
9905 operand_mode = TYPE_MODE (type);
9906 unsignedp = TREE_UNSIGNED (type);
9908 /* We won't bother with BLKmode store-flag operations because it would mean
9909 passing a lot of information to emit_store_flag. */
9910 if (operand_mode == BLKmode)
9913 /* We won't bother with store-flag operations involving function pointers
9914 when function pointers must be canonicalized before comparisons. */
9915 #ifdef HAVE_canonicalize_funcptr_for_compare
9916 if (HAVE_canonicalize_funcptr_for_compare
9917 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
9918 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
9920 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
9921 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
9922 == FUNCTION_TYPE))))
9929 /* Get the rtx comparison code to use. We know that EXP is a comparison
9930 operation of some type. Some comparisons against 1 and -1 can be
9931 converted to comparisons with zero. Do so here so that the tests
9932 below will be aware that we have a comparison with zero. These
9933 tests will not catch constants in the first operand, but constants
9934 are rarely passed as the first operand. */
9936 switch (TREE_CODE (exp))
9945 if (integer_onep (arg1))
9946 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9948 code = unsignedp ? LTU : LT;
9951 if (! unsignedp && integer_all_onesp (arg1))
9952 arg1 = integer_zero_node, code = LT;
9954 code = unsignedp ? LEU : LE;
9957 if (! unsignedp && integer_all_onesp (arg1))
9958 arg1 = integer_zero_node, code = GE;
9960 code = unsignedp ? GTU : GT;
9963 if (integer_onep (arg1))
9964 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
9966 code = unsignedp ? GEU : GE;
9972 /* Put a constant second. */
9973 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
9975 tem = arg0; arg0 = arg1; arg1 = tem;
9976 code = swap_condition (code);
9979 /* If this is an equality or inequality test of a single bit, we can
9980 do this by shifting the bit being tested to the low-order bit and
9981 masking the result with the constant 1. If the condition was EQ,
9982 we xor it with 1. This does not require an scc insn and is faster
9983 than an scc insn even if we have it. */
9985 if ((code == NE || code == EQ)
9986 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
9987 && integer_pow2p (TREE_OPERAND (arg0, 1)))
9989 tree inner = TREE_OPERAND (arg0, 0);
9990 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
9993 /* If INNER is a right shift of a constant and it plus BITNUM does
9994 not overflow, adjust BITNUM and INNER. */
9996 if (TREE_CODE (inner) == RSHIFT_EXPR
9997 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
9998 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
9999 && (bitnum + TREE_INT_CST_LOW (TREE_OPERAND (inner, 1))
10000 < TYPE_PRECISION (type)))
10002 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
10003 inner = TREE_OPERAND (inner, 0);
10006 /* If we are going to be able to omit the AND below, we must do our
10007 operations as unsigned. If we must use the AND, we have a choice.
10008 Normally unsigned is faster, but for some machines signed is. */
10009 ops_unsignedp = (bitnum == TYPE_PRECISION (type) - 1 ? 1
10010 #ifdef LOAD_EXTEND_OP
10011 : (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND ? 0 : 1)
10017 if (subtarget == 0 || GET_CODE (subtarget) != REG
10018 || GET_MODE (subtarget) != operand_mode
10019 || ! safe_from_p (subtarget, inner, 1))
10022 op0 = expand_expr (inner, subtarget, VOIDmode, 0);
10025 op0 = expand_shift (RSHIFT_EXPR, GET_MODE (op0), op0,
10026 size_int (bitnum), subtarget, ops_unsignedp);
10028 if (GET_MODE (op0) != mode)
10029 op0 = convert_to_mode (mode, op0, ops_unsignedp);
10031 if ((code == EQ && ! invert) || (code == NE && invert))
10032 op0 = expand_binop (mode, xor_optab, op0, const1_rtx, subtarget,
10033 ops_unsignedp, OPTAB_LIB_WIDEN);
10035 /* Put the AND last so it can combine with more things. */
10036 if (bitnum != TYPE_PRECISION (type) - 1)
10037 op0 = expand_and (op0, const1_rtx, subtarget);
10042 /* Now see if we are likely to be able to do this. Return if not. */
10043 if (! can_compare_p (operand_mode, ccp_store_flag))
10045 icode = setcc_gen_code[(int) code];
10046 if (icode == CODE_FOR_nothing
10047 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
10049 /* We can only do this if it is one of the special cases that
10050 can be handled without an scc insn. */
10051 if ((code == LT && integer_zerop (arg1))
10052 || (! only_cheap && code == GE && integer_zerop (arg1)))
10054 else if (BRANCH_COST >= 0
10055 && ! only_cheap && (code == NE || code == EQ)
10056 && TREE_CODE (type) != REAL_TYPE
10057 && ((abs_optab->handlers[(int) operand_mode].insn_code
10058 != CODE_FOR_nothing)
10059 || (ffs_optab->handlers[(int) operand_mode].insn_code
10060 != CODE_FOR_nothing)))
10066 preexpand_calls (exp);
10067 if (subtarget == 0 || GET_CODE (subtarget) != REG
10068 || GET_MODE (subtarget) != operand_mode
10069 || ! safe_from_p (subtarget, arg1, 1))
10072 op0 = expand_expr (arg0, subtarget, VOIDmode, 0);
10073 op1 = expand_expr (arg1, NULL_RTX, VOIDmode, 0);
10076 target = gen_reg_rtx (mode);
10078 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10079 because, if the emit_store_flag does anything it will succeed and
10080 OP0 and OP1 will not be used subsequently. */
10082 result = emit_store_flag (target, code,
10083 queued_subexp_p (op0) ? copy_rtx (op0) : op0,
10084 queued_subexp_p (op1) ? copy_rtx (op1) : op1,
10085 operand_mode, unsignedp, 1);
10090 result = expand_binop (mode, xor_optab, result, const1_rtx,
10091 result, 0, OPTAB_LIB_WIDEN);
10095 /* If this failed, we have to do this with set/compare/jump/set code. */
10096 if (GET_CODE (target) != REG
10097 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
10098 target = gen_reg_rtx (GET_MODE (target));
10100 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
10101 result = compare_from_rtx (op0, op1, code, unsignedp,
10102 operand_mode, NULL_RTX, 0);
10103 if (GET_CODE (result) == CONST_INT)
10104 return (((result == const0_rtx && ! invert)
10105 || (result != const0_rtx && invert))
10106 ? const0_rtx : const1_rtx);
10108 label = gen_label_rtx ();
10109 if (bcc_gen_fctn[(int) code] == 0)
10112 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
10113 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
10114 emit_label (label);
10119 /* Generate a tablejump instruction (used for switch statements). */
10121 #ifdef HAVE_tablejump
10123 /* INDEX is the value being switched on, with the lowest value
10124 in the table already subtracted.
10125 MODE is its expected mode (needed if INDEX is constant).
10126 RANGE is the length of the jump table.
10127 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10129 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10130 index value is out of range. */
10133 do_tablejump (index, mode, range, table_label, default_label)
10134 rtx index, range, table_label, default_label;
10135 enum machine_mode mode;
10137 register rtx temp, vector;
10139 /* Do an unsigned comparison (in the proper mode) between the index
10140 expression and the value which represents the length of the range.
10141 Since we just finished subtracting the lower bound of the range
10142 from the index expression, this comparison allows us to simultaneously
10143 check that the original index expression value is both greater than
10144 or equal to the minimum value of the range and less than or equal to
10145 the maximum value of the range. */
10147 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10150 /* If index is in range, it must fit in Pmode.
10151 Convert to Pmode so we can index with it. */
10153 index = convert_to_mode (Pmode, index, 1);
10155 /* Don't let a MEM slip thru, because then INDEX that comes
10156 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10157 and break_out_memory_refs will go to work on it and mess it up. */
10158 #ifdef PIC_CASE_VECTOR_ADDRESS
10159 if (flag_pic && GET_CODE (index) != REG)
10160 index = copy_to_mode_reg (Pmode, index);
10163 /* If flag_force_addr were to affect this address
10164 it could interfere with the tricky assumptions made
10165 about addresses that contain label-refs,
10166 which may be valid only very near the tablejump itself. */
10167 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10168 GET_MODE_SIZE, because this indicates how large insns are. The other
10169 uses should all be Pmode, because they are addresses. This code
10170 could fail if addresses and insns are not the same size. */
10171 index = gen_rtx_PLUS (Pmode,
10172 gen_rtx_MULT (Pmode, index,
10173 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10174 gen_rtx_LABEL_REF (Pmode, table_label));
10175 #ifdef PIC_CASE_VECTOR_ADDRESS
10177 index = PIC_CASE_VECTOR_ADDRESS (index);
10180 index = memory_address_noforce (CASE_VECTOR_MODE, index);
10181 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10182 vector = gen_rtx_MEM (CASE_VECTOR_MODE, index);
10183 RTX_UNCHANGING_P (vector) = 1;
10184 convert_move (temp, vector, 0);
10186 emit_jump_insn (gen_tablejump (temp, table_label));
10188 /* If we are generating PIC code or if the table is PC-relative, the
10189 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10190 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10194 #endif /* HAVE_tablejump */