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 cfun
->expr
= (struct expr_status
*) xmalloc (sizeof (struct expr_status
));
291 pending_stack_adjust
= 0;
292 inhibit_defer_pop
= 0;
294 apply_args_value
= 0;
300 struct expr_status
*p
;
305 ggc_mark_rtx (p
->x_saveregs_value
);
306 ggc_mark_rtx (p
->x_apply_args_value
);
307 ggc_mark_rtx (p
->x_forced_labels
);
318 /* Small sanity check that the queue is empty at the end of a function. */
320 finish_expr_for_function ()
326 /* Manage the queue of increment instructions to be output
327 for POSTINCREMENT_EXPR expressions, etc. */
329 /* Queue up to increment (or change) VAR later. BODY says how:
330 BODY should be the same thing you would pass to emit_insn
331 to increment right away. It will go to emit_insn later on.
333 The value is a QUEUED expression to be used in place of VAR
334 where you want to guarantee the pre-incrementation value of VAR. */
337 enqueue_insn (var
, body
)
340 pending_chain
= gen_rtx_QUEUED (GET_MODE (var
), var
, NULL_RTX
, NULL_RTX
,
341 body
, pending_chain
);
342 return pending_chain
;
345 /* Use protect_from_queue to convert a QUEUED expression
346 into something that you can put immediately into an instruction.
347 If the queued incrementation has not happened yet,
348 protect_from_queue returns the variable itself.
349 If the incrementation has happened, protect_from_queue returns a temp
350 that contains a copy of the old value of the variable.
352 Any time an rtx which might possibly be a QUEUED is to be put
353 into an instruction, it must be passed through protect_from_queue first.
354 QUEUED expressions are not meaningful in instructions.
356 Do not pass a value through protect_from_queue and then hold
357 on to it for a while before putting it in an instruction!
358 If the queue is flushed in between, incorrect code will result. */
361 protect_from_queue (x
, modify
)
365 register RTX_CODE code
= GET_CODE (x
);
367 #if 0 /* A QUEUED can hang around after the queue is forced out. */
368 /* Shortcut for most common case. */
369 if (pending_chain
== 0)
375 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
376 use of autoincrement. Make a copy of the contents of the memory
377 location rather than a copy of the address, but not if the value is
378 of mode BLKmode. Don't modify X in place since it might be
380 if (code
== MEM
&& GET_MODE (x
) != BLKmode
381 && GET_CODE (XEXP (x
, 0)) == QUEUED
&& !modify
)
383 register rtx y
= XEXP (x
, 0);
384 register rtx
new = gen_rtx_MEM (GET_MODE (x
), QUEUED_VAR (y
));
386 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (x
);
387 MEM_COPY_ATTRIBUTES (new, x
);
388 MEM_ALIAS_SET (new) = MEM_ALIAS_SET (x
);
392 register rtx temp
= gen_reg_rtx (GET_MODE (new));
393 emit_insn_before (gen_move_insn (temp
, new),
399 /* Otherwise, recursively protect the subexpressions of all
400 the kinds of rtx's that can contain a QUEUED. */
403 rtx tem
= protect_from_queue (XEXP (x
, 0), 0);
404 if (tem
!= XEXP (x
, 0))
410 else if (code
== PLUS
|| code
== MULT
)
412 rtx new0
= protect_from_queue (XEXP (x
, 0), 0);
413 rtx new1
= protect_from_queue (XEXP (x
, 1), 0);
414 if (new0
!= XEXP (x
, 0) || new1
!= XEXP (x
, 1))
423 /* If the increment has not happened, use the variable itself. */
424 if (QUEUED_INSN (x
) == 0)
425 return QUEUED_VAR (x
);
426 /* If the increment has happened and a pre-increment copy exists,
428 if (QUEUED_COPY (x
) != 0)
429 return QUEUED_COPY (x
);
430 /* The increment has happened but we haven't set up a pre-increment copy.
431 Set one up now, and use it. */
432 QUEUED_COPY (x
) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x
)));
433 emit_insn_before (gen_move_insn (QUEUED_COPY (x
), QUEUED_VAR (x
)),
435 return QUEUED_COPY (x
);
438 /* Return nonzero if X contains a QUEUED expression:
439 if it contains anything that will be altered by a queued increment.
440 We handle only combinations of MEM, PLUS, MINUS and MULT operators
441 since memory addresses generally contain only those. */
447 register enum rtx_code code
= GET_CODE (x
);
453 return queued_subexp_p (XEXP (x
, 0));
457 return (queued_subexp_p (XEXP (x
, 0))
458 || queued_subexp_p (XEXP (x
, 1)));
464 /* Perform all the pending incrementations. */
470 while ((p
= pending_chain
))
472 rtx body
= QUEUED_BODY (p
);
474 if (GET_CODE (body
) == SEQUENCE
)
476 QUEUED_INSN (p
) = XVECEXP (QUEUED_BODY (p
), 0, 0);
477 emit_insn (QUEUED_BODY (p
));
480 QUEUED_INSN (p
) = emit_insn (QUEUED_BODY (p
));
481 pending_chain
= QUEUED_NEXT (p
);
485 /* Copy data from FROM to TO, where the machine modes are not the same.
486 Both modes may be integer, or both may be floating.
487 UNSIGNEDP should be nonzero if FROM is an unsigned type.
488 This causes zero-extension instead of sign-extension. */
491 convert_move (to
, from
, unsignedp
)
492 register rtx to
, from
;
495 enum machine_mode to_mode
= GET_MODE (to
);
496 enum machine_mode from_mode
= GET_MODE (from
);
497 int to_real
= GET_MODE_CLASS (to_mode
) == MODE_FLOAT
;
498 int from_real
= GET_MODE_CLASS (from_mode
) == MODE_FLOAT
;
502 /* rtx code for making an equivalent value. */
503 enum rtx_code equiv_code
= (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
);
505 to
= protect_from_queue (to
, 1);
506 from
= protect_from_queue (from
, 0);
508 if (to_real
!= from_real
)
511 /* If FROM is a SUBREG that indicates that we have already done at least
512 the required extension, strip it. We don't handle such SUBREGs as
515 if (GET_CODE (from
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (from
)
516 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from
)))
517 >= GET_MODE_SIZE (to_mode
))
518 && SUBREG_PROMOTED_UNSIGNED_P (from
) == unsignedp
)
519 from
= gen_lowpart (to_mode
, from
), from_mode
= to_mode
;
521 if (GET_CODE (to
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (to
))
524 if (to_mode
== from_mode
525 || (from_mode
== VOIDmode
&& CONSTANT_P (from
)))
527 emit_move_insn (to
, from
);
535 if (GET_MODE_BITSIZE (from_mode
) < GET_MODE_BITSIZE (to_mode
))
537 /* Try converting directly if the insn is supported. */
538 if ((code
= can_extend_p (to_mode
, from_mode
, 0))
541 emit_unop_insn (code
, to
, from
, UNKNOWN
);
546 #ifdef HAVE_trunchfqf2
547 if (HAVE_trunchfqf2
&& from_mode
== HFmode
&& to_mode
== QFmode
)
549 emit_unop_insn (CODE_FOR_trunchfqf2
, to
, from
, UNKNOWN
);
553 #ifdef HAVE_trunctqfqf2
554 if (HAVE_trunctqfqf2
&& from_mode
== TQFmode
&& to_mode
== QFmode
)
556 emit_unop_insn (CODE_FOR_trunctqfqf2
, to
, from
, UNKNOWN
);
560 #ifdef HAVE_truncsfqf2
561 if (HAVE_truncsfqf2
&& from_mode
== SFmode
&& to_mode
== QFmode
)
563 emit_unop_insn (CODE_FOR_truncsfqf2
, to
, from
, UNKNOWN
);
567 #ifdef HAVE_truncdfqf2
568 if (HAVE_truncdfqf2
&& from_mode
== DFmode
&& to_mode
== QFmode
)
570 emit_unop_insn (CODE_FOR_truncdfqf2
, to
, from
, UNKNOWN
);
574 #ifdef HAVE_truncxfqf2
575 if (HAVE_truncxfqf2
&& from_mode
== XFmode
&& to_mode
== QFmode
)
577 emit_unop_insn (CODE_FOR_truncxfqf2
, to
, from
, UNKNOWN
);
581 #ifdef HAVE_trunctfqf2
582 if (HAVE_trunctfqf2
&& from_mode
== TFmode
&& to_mode
== QFmode
)
584 emit_unop_insn (CODE_FOR_trunctfqf2
, to
, from
, UNKNOWN
);
589 #ifdef HAVE_trunctqfhf2
590 if (HAVE_trunctqfhf2
&& from_mode
== TQFmode
&& to_mode
== HFmode
)
592 emit_unop_insn (CODE_FOR_trunctqfhf2
, to
, from
, UNKNOWN
);
596 #ifdef HAVE_truncsfhf2
597 if (HAVE_truncsfhf2
&& from_mode
== SFmode
&& to_mode
== HFmode
)
599 emit_unop_insn (CODE_FOR_truncsfhf2
, to
, from
, UNKNOWN
);
603 #ifdef HAVE_truncdfhf2
604 if (HAVE_truncdfhf2
&& from_mode
== DFmode
&& to_mode
== HFmode
)
606 emit_unop_insn (CODE_FOR_truncdfhf2
, to
, from
, UNKNOWN
);
610 #ifdef HAVE_truncxfhf2
611 if (HAVE_truncxfhf2
&& from_mode
== XFmode
&& to_mode
== HFmode
)
613 emit_unop_insn (CODE_FOR_truncxfhf2
, to
, from
, UNKNOWN
);
617 #ifdef HAVE_trunctfhf2
618 if (HAVE_trunctfhf2
&& from_mode
== TFmode
&& to_mode
== HFmode
)
620 emit_unop_insn (CODE_FOR_trunctfhf2
, to
, from
, UNKNOWN
);
625 #ifdef HAVE_truncsftqf2
626 if (HAVE_truncsftqf2
&& from_mode
== SFmode
&& to_mode
== TQFmode
)
628 emit_unop_insn (CODE_FOR_truncsftqf2
, to
, from
, UNKNOWN
);
632 #ifdef HAVE_truncdftqf2
633 if (HAVE_truncdftqf2
&& from_mode
== DFmode
&& to_mode
== TQFmode
)
635 emit_unop_insn (CODE_FOR_truncdftqf2
, to
, from
, UNKNOWN
);
639 #ifdef HAVE_truncxftqf2
640 if (HAVE_truncxftqf2
&& from_mode
== XFmode
&& to_mode
== TQFmode
)
642 emit_unop_insn (CODE_FOR_truncxftqf2
, to
, from
, UNKNOWN
);
646 #ifdef HAVE_trunctftqf2
647 if (HAVE_trunctftqf2
&& from_mode
== TFmode
&& to_mode
== TQFmode
)
649 emit_unop_insn (CODE_FOR_trunctftqf2
, to
, from
, UNKNOWN
);
654 #ifdef HAVE_truncdfsf2
655 if (HAVE_truncdfsf2
&& from_mode
== DFmode
&& to_mode
== SFmode
)
657 emit_unop_insn (CODE_FOR_truncdfsf2
, to
, from
, UNKNOWN
);
661 #ifdef HAVE_truncxfsf2
662 if (HAVE_truncxfsf2
&& from_mode
== XFmode
&& to_mode
== SFmode
)
664 emit_unop_insn (CODE_FOR_truncxfsf2
, to
, from
, UNKNOWN
);
668 #ifdef HAVE_trunctfsf2
669 if (HAVE_trunctfsf2
&& from_mode
== TFmode
&& to_mode
== SFmode
)
671 emit_unop_insn (CODE_FOR_trunctfsf2
, to
, from
, UNKNOWN
);
675 #ifdef HAVE_truncxfdf2
676 if (HAVE_truncxfdf2
&& from_mode
== XFmode
&& to_mode
== DFmode
)
678 emit_unop_insn (CODE_FOR_truncxfdf2
, to
, from
, UNKNOWN
);
682 #ifdef HAVE_trunctfdf2
683 if (HAVE_trunctfdf2
&& from_mode
== TFmode
&& to_mode
== DFmode
)
685 emit_unop_insn (CODE_FOR_trunctfdf2
, to
, from
, UNKNOWN
);
697 libcall
= extendsfdf2_libfunc
;
701 libcall
= extendsfxf2_libfunc
;
705 libcall
= extendsftf2_libfunc
;
717 libcall
= truncdfsf2_libfunc
;
721 libcall
= extenddfxf2_libfunc
;
725 libcall
= extenddftf2_libfunc
;
737 libcall
= truncxfsf2_libfunc
;
741 libcall
= truncxfdf2_libfunc
;
753 libcall
= trunctfsf2_libfunc
;
757 libcall
= trunctfdf2_libfunc
;
769 if (libcall
== (rtx
) 0)
770 /* This conversion is not implemented yet. */
773 value
= emit_library_call_value (libcall
, NULL_RTX
, 1, to_mode
,
775 emit_move_insn (to
, value
);
779 /* Now both modes are integers. */
781 /* Handle expanding beyond a word. */
782 if (GET_MODE_BITSIZE (from_mode
) < GET_MODE_BITSIZE (to_mode
)
783 && GET_MODE_BITSIZE (to_mode
) > BITS_PER_WORD
)
790 enum machine_mode lowpart_mode
;
791 int nwords
= CEIL (GET_MODE_SIZE (to_mode
), UNITS_PER_WORD
);
793 /* Try converting directly if the insn is supported. */
794 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
797 /* If FROM is a SUBREG, put it into a register. Do this
798 so that we always generate the same set of insns for
799 better cse'ing; if an intermediate assignment occurred,
800 we won't be doing the operation directly on the SUBREG. */
801 if (optimize
> 0 && GET_CODE (from
) == SUBREG
)
802 from
= force_reg (from_mode
, from
);
803 emit_unop_insn (code
, to
, from
, equiv_code
);
806 /* Next, try converting via full word. */
807 else if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
808 && ((code
= can_extend_p (to_mode
, word_mode
, unsignedp
))
809 != CODE_FOR_nothing
))
811 if (GET_CODE (to
) == REG
)
812 emit_insn (gen_rtx_CLOBBER (VOIDmode
, to
));
813 convert_move (gen_lowpart (word_mode
, to
), from
, unsignedp
);
814 emit_unop_insn (code
, to
,
815 gen_lowpart (word_mode
, to
), equiv_code
);
819 /* No special multiword conversion insn; do it by hand. */
822 /* Since we will turn this into a no conflict block, we must ensure
823 that the source does not overlap the target. */
825 if (reg_overlap_mentioned_p (to
, from
))
826 from
= force_reg (from_mode
, from
);
828 /* Get a copy of FROM widened to a word, if necessary. */
829 if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
)
830 lowpart_mode
= word_mode
;
832 lowpart_mode
= from_mode
;
834 lowfrom
= convert_to_mode (lowpart_mode
, from
, unsignedp
);
836 lowpart
= gen_lowpart (lowpart_mode
, to
);
837 emit_move_insn (lowpart
, lowfrom
);
839 /* Compute the value to put in each remaining word. */
841 fill_value
= const0_rtx
;
846 && insn_data
[(int) CODE_FOR_slt
].operand
[0].mode
== word_mode
847 && STORE_FLAG_VALUE
== -1)
849 emit_cmp_insn (lowfrom
, const0_rtx
, NE
, NULL_RTX
,
851 fill_value
= gen_reg_rtx (word_mode
);
852 emit_insn (gen_slt (fill_value
));
858 = expand_shift (RSHIFT_EXPR
, lowpart_mode
, lowfrom
,
859 size_int (GET_MODE_BITSIZE (lowpart_mode
) - 1),
861 fill_value
= convert_to_mode (word_mode
, fill_value
, 1);
865 /* Fill the remaining words. */
866 for (i
= GET_MODE_SIZE (lowpart_mode
) / UNITS_PER_WORD
; i
< nwords
; i
++)
868 int index
= (WORDS_BIG_ENDIAN
? nwords
- i
- 1 : i
);
869 rtx subword
= operand_subword (to
, index
, 1, to_mode
);
874 if (fill_value
!= subword
)
875 emit_move_insn (subword
, fill_value
);
878 insns
= get_insns ();
881 emit_no_conflict_block (insns
, to
, from
, NULL_RTX
,
882 gen_rtx_fmt_e (equiv_code
, to_mode
, copy_rtx (from
)));
886 /* Truncating multi-word to a word or less. */
887 if (GET_MODE_BITSIZE (from_mode
) > BITS_PER_WORD
888 && GET_MODE_BITSIZE (to_mode
) <= BITS_PER_WORD
)
890 if (!((GET_CODE (from
) == MEM
891 && ! MEM_VOLATILE_P (from
)
892 && direct_load
[(int) to_mode
]
893 && ! mode_dependent_address_p (XEXP (from
, 0)))
894 || GET_CODE (from
) == REG
895 || GET_CODE (from
) == SUBREG
))
896 from
= force_reg (from_mode
, from
);
897 convert_move (to
, gen_lowpart (word_mode
, from
), 0);
901 /* Handle pointer conversion */ /* SPEE 900220 */
902 if (to_mode
== PQImode
)
904 if (from_mode
!= QImode
)
905 from
= convert_to_mode (QImode
, from
, unsignedp
);
907 #ifdef HAVE_truncqipqi2
908 if (HAVE_truncqipqi2
)
910 emit_unop_insn (CODE_FOR_truncqipqi2
, to
, from
, UNKNOWN
);
913 #endif /* HAVE_truncqipqi2 */
917 if (from_mode
== PQImode
)
919 if (to_mode
!= QImode
)
921 from
= convert_to_mode (QImode
, from
, unsignedp
);
926 #ifdef HAVE_extendpqiqi2
927 if (HAVE_extendpqiqi2
)
929 emit_unop_insn (CODE_FOR_extendpqiqi2
, to
, from
, UNKNOWN
);
932 #endif /* HAVE_extendpqiqi2 */
937 if (to_mode
== PSImode
)
939 if (from_mode
!= SImode
)
940 from
= convert_to_mode (SImode
, from
, unsignedp
);
942 #ifdef HAVE_truncsipsi2
943 if (HAVE_truncsipsi2
)
945 emit_unop_insn (CODE_FOR_truncsipsi2
, to
, from
, UNKNOWN
);
948 #endif /* HAVE_truncsipsi2 */
952 if (from_mode
== PSImode
)
954 if (to_mode
!= SImode
)
956 from
= convert_to_mode (SImode
, from
, unsignedp
);
961 #ifdef HAVE_extendpsisi2
962 if (HAVE_extendpsisi2
)
964 emit_unop_insn (CODE_FOR_extendpsisi2
, to
, from
, UNKNOWN
);
967 #endif /* HAVE_extendpsisi2 */
972 if (to_mode
== PDImode
)
974 if (from_mode
!= DImode
)
975 from
= convert_to_mode (DImode
, from
, unsignedp
);
977 #ifdef HAVE_truncdipdi2
978 if (HAVE_truncdipdi2
)
980 emit_unop_insn (CODE_FOR_truncdipdi2
, to
, from
, UNKNOWN
);
983 #endif /* HAVE_truncdipdi2 */
987 if (from_mode
== PDImode
)
989 if (to_mode
!= DImode
)
991 from
= convert_to_mode (DImode
, from
, unsignedp
);
996 #ifdef HAVE_extendpdidi2
997 if (HAVE_extendpdidi2
)
999 emit_unop_insn (CODE_FOR_extendpdidi2
, to
, from
, UNKNOWN
);
1002 #endif /* HAVE_extendpdidi2 */
1007 /* Now follow all the conversions between integers
1008 no more than a word long. */
1010 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1011 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
)
1012 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
1013 GET_MODE_BITSIZE (from_mode
)))
1015 if (!((GET_CODE (from
) == MEM
1016 && ! MEM_VOLATILE_P (from
)
1017 && direct_load
[(int) to_mode
]
1018 && ! mode_dependent_address_p (XEXP (from
, 0)))
1019 || GET_CODE (from
) == REG
1020 || GET_CODE (from
) == SUBREG
))
1021 from
= force_reg (from_mode
, from
);
1022 if (GET_CODE (from
) == REG
&& REGNO (from
) < FIRST_PSEUDO_REGISTER
1023 && ! HARD_REGNO_MODE_OK (REGNO (from
), to_mode
))
1024 from
= copy_to_reg (from
);
1025 emit_move_insn (to
, gen_lowpart (to_mode
, from
));
1029 /* Handle extension. */
1030 if (GET_MODE_BITSIZE (to_mode
) > GET_MODE_BITSIZE (from_mode
))
1032 /* Convert directly if that works. */
1033 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
1034 != CODE_FOR_nothing
)
1036 emit_unop_insn (code
, to
, from
, equiv_code
);
1041 enum machine_mode intermediate
;
1045 /* Search for a mode to convert via. */
1046 for (intermediate
= from_mode
; intermediate
!= VOIDmode
;
1047 intermediate
= GET_MODE_WIDER_MODE (intermediate
))
1048 if (((can_extend_p (to_mode
, intermediate
, unsignedp
)
1049 != CODE_FOR_nothing
)
1050 || (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (intermediate
)
1051 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
1052 GET_MODE_BITSIZE (intermediate
))))
1053 && (can_extend_p (intermediate
, from_mode
, unsignedp
)
1054 != CODE_FOR_nothing
))
1056 convert_move (to
, convert_to_mode (intermediate
, from
,
1057 unsignedp
), unsignedp
);
1061 /* No suitable intermediate mode.
1062 Generate what we need with shifts. */
1063 shift_amount
= build_int_2 (GET_MODE_BITSIZE (to_mode
)
1064 - GET_MODE_BITSIZE (from_mode
), 0);
1065 from
= gen_lowpart (to_mode
, force_reg (from_mode
, from
));
1066 tmp
= expand_shift (LSHIFT_EXPR
, to_mode
, from
, shift_amount
,
1068 tmp
= expand_shift (RSHIFT_EXPR
, to_mode
, tmp
, shift_amount
,
1071 emit_move_insn (to
, tmp
);
1076 /* Support special truncate insns for certain modes. */
1078 if (from_mode
== DImode
&& to_mode
== SImode
)
1080 #ifdef HAVE_truncdisi2
1081 if (HAVE_truncdisi2
)
1083 emit_unop_insn (CODE_FOR_truncdisi2
, to
, from
, UNKNOWN
);
1087 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1091 if (from_mode
== DImode
&& to_mode
== HImode
)
1093 #ifdef HAVE_truncdihi2
1094 if (HAVE_truncdihi2
)
1096 emit_unop_insn (CODE_FOR_truncdihi2
, to
, from
, UNKNOWN
);
1100 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1104 if (from_mode
== DImode
&& to_mode
== QImode
)
1106 #ifdef HAVE_truncdiqi2
1107 if (HAVE_truncdiqi2
)
1109 emit_unop_insn (CODE_FOR_truncdiqi2
, to
, from
, UNKNOWN
);
1113 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1117 if (from_mode
== SImode
&& to_mode
== HImode
)
1119 #ifdef HAVE_truncsihi2
1120 if (HAVE_truncsihi2
)
1122 emit_unop_insn (CODE_FOR_truncsihi2
, to
, from
, UNKNOWN
);
1126 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1130 if (from_mode
== SImode
&& to_mode
== QImode
)
1132 #ifdef HAVE_truncsiqi2
1133 if (HAVE_truncsiqi2
)
1135 emit_unop_insn (CODE_FOR_truncsiqi2
, to
, from
, UNKNOWN
);
1139 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1143 if (from_mode
== HImode
&& to_mode
== QImode
)
1145 #ifdef HAVE_trunchiqi2
1146 if (HAVE_trunchiqi2
)
1148 emit_unop_insn (CODE_FOR_trunchiqi2
, to
, from
, UNKNOWN
);
1152 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1156 if (from_mode
== TImode
&& to_mode
== DImode
)
1158 #ifdef HAVE_trunctidi2
1159 if (HAVE_trunctidi2
)
1161 emit_unop_insn (CODE_FOR_trunctidi2
, to
, from
, UNKNOWN
);
1165 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1169 if (from_mode
== TImode
&& to_mode
== SImode
)
1171 #ifdef HAVE_trunctisi2
1172 if (HAVE_trunctisi2
)
1174 emit_unop_insn (CODE_FOR_trunctisi2
, to
, from
, UNKNOWN
);
1178 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1182 if (from_mode
== TImode
&& to_mode
== HImode
)
1184 #ifdef HAVE_trunctihi2
1185 if (HAVE_trunctihi2
)
1187 emit_unop_insn (CODE_FOR_trunctihi2
, to
, from
, UNKNOWN
);
1191 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1195 if (from_mode
== TImode
&& to_mode
== QImode
)
1197 #ifdef HAVE_trunctiqi2
1198 if (HAVE_trunctiqi2
)
1200 emit_unop_insn (CODE_FOR_trunctiqi2
, to
, from
, UNKNOWN
);
1204 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1208 /* Handle truncation of volatile memrefs, and so on;
1209 the things that couldn't be truncated directly,
1210 and for which there was no special instruction. */
1211 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
))
1213 rtx temp
= force_reg (to_mode
, gen_lowpart (to_mode
, from
));
1214 emit_move_insn (to
, temp
);
1218 /* Mode combination is not recognized. */
1222 /* Return an rtx for a value that would result
1223 from converting X to mode MODE.
1224 Both X and MODE may be floating, or both integer.
1225 UNSIGNEDP is nonzero if X is an unsigned value.
1226 This can be done by referring to a part of X in place
1227 or by copying to a new temporary with conversion.
1229 This function *must not* call protect_from_queue
1230 except when putting X into an insn (in which case convert_move does it). */
1233 convert_to_mode (mode
, x
, unsignedp
)
1234 enum machine_mode mode
;
1238 return convert_modes (mode
, VOIDmode
, x
, unsignedp
);
1241 /* Return an rtx for a value that would result
1242 from converting X from mode OLDMODE to mode MODE.
1243 Both modes may be floating, or both integer.
1244 UNSIGNEDP is nonzero if X is an unsigned value.
1246 This can be done by referring to a part of X in place
1247 or by copying to a new temporary with conversion.
1249 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1251 This function *must not* call protect_from_queue
1252 except when putting X into an insn (in which case convert_move does it). */
1255 convert_modes (mode
, oldmode
, x
, unsignedp
)
1256 enum machine_mode mode
, oldmode
;
1262 /* If FROM is a SUBREG that indicates that we have already done at least
1263 the required extension, strip it. */
1265 if (GET_CODE (x
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (x
)
1266 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))) >= GET_MODE_SIZE (mode
)
1267 && SUBREG_PROMOTED_UNSIGNED_P (x
) == unsignedp
)
1268 x
= gen_lowpart (mode
, x
);
1270 if (GET_MODE (x
) != VOIDmode
)
1271 oldmode
= GET_MODE (x
);
1273 if (mode
== oldmode
)
1276 /* There is one case that we must handle specially: If we are converting
1277 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1278 we are to interpret the constant as unsigned, gen_lowpart will do
1279 the wrong if the constant appears negative. What we want to do is
1280 make the high-order word of the constant zero, not all ones. */
1282 if (unsignedp
&& GET_MODE_CLASS (mode
) == MODE_INT
1283 && GET_MODE_BITSIZE (mode
) == 2 * HOST_BITS_PER_WIDE_INT
1284 && GET_CODE (x
) == CONST_INT
&& INTVAL (x
) < 0)
1286 HOST_WIDE_INT val
= INTVAL (x
);
1288 if (oldmode
!= VOIDmode
1289 && HOST_BITS_PER_WIDE_INT
> GET_MODE_BITSIZE (oldmode
))
1291 int width
= GET_MODE_BITSIZE (oldmode
);
1293 /* We need to zero extend VAL. */
1294 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
1297 return immed_double_const (val
, (HOST_WIDE_INT
) 0, mode
);
1300 /* We can do this with a gen_lowpart if both desired and current modes
1301 are integer, and this is either a constant integer, a register, or a
1302 non-volatile MEM. Except for the constant case where MODE is no
1303 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1305 if ((GET_CODE (x
) == CONST_INT
1306 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
1307 || (GET_MODE_CLASS (mode
) == MODE_INT
1308 && GET_MODE_CLASS (oldmode
) == MODE_INT
1309 && (GET_CODE (x
) == CONST_DOUBLE
1310 || (GET_MODE_SIZE (mode
) <= GET_MODE_SIZE (oldmode
)
1311 && ((GET_CODE (x
) == MEM
&& ! MEM_VOLATILE_P (x
)
1312 && direct_load
[(int) mode
])
1313 || (GET_CODE (x
) == REG
1314 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode
),
1315 GET_MODE_BITSIZE (GET_MODE (x
)))))))))
1317 /* ?? If we don't know OLDMODE, we have to assume here that
1318 X does not need sign- or zero-extension. This may not be
1319 the case, but it's the best we can do. */
1320 if (GET_CODE (x
) == CONST_INT
&& oldmode
!= VOIDmode
1321 && GET_MODE_SIZE (mode
) > GET_MODE_SIZE (oldmode
))
1323 HOST_WIDE_INT val
= INTVAL (x
);
1324 int width
= GET_MODE_BITSIZE (oldmode
);
1326 /* We must sign or zero-extend in this case. Start by
1327 zero-extending, then sign extend if we need to. */
1328 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
1330 && (val
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1331 val
|= (HOST_WIDE_INT
) (-1) << width
;
1333 return GEN_INT (val
);
1336 return gen_lowpart (mode
, x
);
1339 temp
= gen_reg_rtx (mode
);
1340 convert_move (temp
, x
, unsignedp
);
1345 /* This macro is used to determine what the largest unit size that
1346 move_by_pieces can use is. */
1348 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1349 move efficiently, as opposed to MOVE_MAX which is the maximum
1350 number of bhytes we can move with a single instruction. */
1352 #ifndef MOVE_MAX_PIECES
1353 #define MOVE_MAX_PIECES MOVE_MAX
1356 /* Generate several move instructions to copy LEN bytes
1357 from block FROM to block TO. (These are MEM rtx's with BLKmode).
1358 The caller must pass FROM and TO
1359 through protect_from_queue before calling.
1360 ALIGN (in bytes) is maximum alignment we can assume. */
1363 move_by_pieces (to
, from
, len
, align
)
1367 struct move_by_pieces data
;
1368 rtx to_addr
= XEXP (to
, 0), from_addr
= XEXP (from
, 0);
1369 int max_size
= MOVE_MAX_PIECES
+ 1;
1370 enum machine_mode mode
= VOIDmode
, tmode
;
1371 enum insn_code icode
;
1374 data
.to_addr
= to_addr
;
1375 data
.from_addr
= from_addr
;
1379 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
1380 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
1382 = (GET_CODE (from_addr
) == PRE_INC
|| GET_CODE (from_addr
) == PRE_DEC
1383 || GET_CODE (from_addr
) == POST_INC
1384 || GET_CODE (from_addr
) == POST_DEC
);
1386 data
.explicit_inc_from
= 0;
1387 data
.explicit_inc_to
= 0;
1389 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
1390 if (data
.reverse
) data
.offset
= len
;
1393 data
.to_struct
= MEM_IN_STRUCT_P (to
);
1394 data
.from_struct
= MEM_IN_STRUCT_P (from
);
1395 data
.to_readonly
= RTX_UNCHANGING_P (to
);
1396 data
.from_readonly
= RTX_UNCHANGING_P (from
);
1398 /* If copying requires more than two move insns,
1399 copy addresses to registers (to make displacements shorter)
1400 and use post-increment if available. */
1401 if (!(data
.autinc_from
&& data
.autinc_to
)
1402 && move_by_pieces_ninsns (len
, align
) > 2)
1404 /* Find the mode of the largest move... */
1405 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1406 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1407 if (GET_MODE_SIZE (tmode
) < max_size
)
1410 if (USE_LOAD_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_from
)
1412 data
.from_addr
= copy_addr_to_reg (plus_constant (from_addr
, len
));
1413 data
.autinc_from
= 1;
1414 data
.explicit_inc_from
= -1;
1416 if (USE_LOAD_POST_INCREMENT (mode
) && ! data
.autinc_from
)
1418 data
.from_addr
= copy_addr_to_reg (from_addr
);
1419 data
.autinc_from
= 1;
1420 data
.explicit_inc_from
= 1;
1422 if (!data
.autinc_from
&& CONSTANT_P (from_addr
))
1423 data
.from_addr
= copy_addr_to_reg (from_addr
);
1424 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
1426 data
.to_addr
= copy_addr_to_reg (plus_constant (to_addr
, len
));
1428 data
.explicit_inc_to
= -1;
1430 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
1432 data
.to_addr
= copy_addr_to_reg (to_addr
);
1434 data
.explicit_inc_to
= 1;
1436 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
1437 data
.to_addr
= copy_addr_to_reg (to_addr
);
1440 if (! SLOW_UNALIGNED_ACCESS
1441 || align
> MOVE_MAX
|| align
>= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1444 /* First move what we can in the largest integer mode, then go to
1445 successively smaller modes. */
1447 while (max_size
> 1)
1449 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1450 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1451 if (GET_MODE_SIZE (tmode
) < max_size
)
1454 if (mode
== VOIDmode
)
1457 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
1458 if (icode
!= CODE_FOR_nothing
1459 && align
>= MIN (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
,
1460 GET_MODE_SIZE (mode
)))
1461 move_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
1463 max_size
= GET_MODE_SIZE (mode
);
1466 /* The code above should have handled everything. */
1471 /* Return number of insns required to move L bytes by pieces.
1472 ALIGN (in bytes) is maximum alignment we can assume. */
1475 move_by_pieces_ninsns (l
, align
)
1479 register int n_insns
= 0;
1480 int max_size
= MOVE_MAX
+ 1;
1482 if (! SLOW_UNALIGNED_ACCESS
1483 || align
> MOVE_MAX
|| align
>= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1486 while (max_size
> 1)
1488 enum machine_mode mode
= VOIDmode
, tmode
;
1489 enum insn_code icode
;
1491 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1492 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1493 if (GET_MODE_SIZE (tmode
) < max_size
)
1496 if (mode
== VOIDmode
)
1499 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
1500 if (icode
!= CODE_FOR_nothing
1501 && align
>= MIN (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
,
1502 GET_MODE_SIZE (mode
)))
1503 n_insns
+= l
/ GET_MODE_SIZE (mode
), l
%= GET_MODE_SIZE (mode
);
1505 max_size
= GET_MODE_SIZE (mode
);
1511 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1512 with move instructions for mode MODE. GENFUN is the gen_... function
1513 to make a move insn for that mode. DATA has all the other info. */
1516 move_by_pieces_1 (genfun
, mode
, data
)
1517 rtx (*genfun
) PROTO ((rtx
, ...));
1518 enum machine_mode mode
;
1519 struct move_by_pieces
*data
;
1521 register int size
= GET_MODE_SIZE (mode
);
1522 register rtx to1
, from1
;
1524 while (data
->len
>= size
)
1526 if (data
->reverse
) data
->offset
-= size
;
1528 to1
= (data
->autinc_to
1529 ? gen_rtx_MEM (mode
, data
->to_addr
)
1530 : copy_rtx (change_address (data
->to
, mode
,
1531 plus_constant (data
->to_addr
,
1533 MEM_IN_STRUCT_P (to1
) = data
->to_struct
;
1534 RTX_UNCHANGING_P (to1
) = data
->to_readonly
;
1537 = (data
->autinc_from
1538 ? gen_rtx_MEM (mode
, data
->from_addr
)
1539 : copy_rtx (change_address (data
->from
, mode
,
1540 plus_constant (data
->from_addr
,
1542 MEM_IN_STRUCT_P (from1
) = data
->from_struct
;
1543 RTX_UNCHANGING_P (from1
) = data
->from_readonly
;
1545 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
1546 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (-size
)));
1547 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_from
< 0)
1548 emit_insn (gen_add2_insn (data
->from_addr
, GEN_INT (-size
)));
1550 emit_insn ((*genfun
) (to1
, from1
));
1551 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
1552 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
1553 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_from
> 0)
1554 emit_insn (gen_add2_insn (data
->from_addr
, GEN_INT (size
)));
1556 if (! data
->reverse
) data
->offset
+= size
;
1562 /* Emit code to move a block Y to a block X.
1563 This may be done with string-move instructions,
1564 with multiple scalar move instructions, or with a library call.
1566 Both X and Y must be MEM rtx's (perhaps inside VOLATILE)
1568 SIZE is an rtx that says how long they are.
1569 ALIGN is the maximum alignment we can assume they have,
1572 Return the address of the new block, if memcpy is called and returns it,
1576 emit_block_move (x
, y
, size
, align
)
1582 #ifdef TARGET_MEM_FUNCTIONS
1584 tree call_expr
, arg_list
;
1587 if (GET_MODE (x
) != BLKmode
)
1590 if (GET_MODE (y
) != BLKmode
)
1593 x
= protect_from_queue (x
, 1);
1594 y
= protect_from_queue (y
, 0);
1595 size
= protect_from_queue (size
, 0);
1597 if (GET_CODE (x
) != MEM
)
1599 if (GET_CODE (y
) != MEM
)
1604 if (GET_CODE (size
) == CONST_INT
&& MOVE_BY_PIECES_P (INTVAL (size
), align
))
1605 move_by_pieces (x
, y
, INTVAL (size
), align
);
1608 /* Try the most limited insn first, because there's no point
1609 including more than one in the machine description unless
1610 the more limited one has some advantage. */
1612 rtx opalign
= GEN_INT (align
);
1613 enum machine_mode mode
;
1615 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
1616 mode
= GET_MODE_WIDER_MODE (mode
))
1618 enum insn_code code
= movstr_optab
[(int) mode
];
1619 insn_operand_predicate_fn pred
;
1621 if (code
!= CODE_FOR_nothing
1622 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1623 here because if SIZE is less than the mode mask, as it is
1624 returned by the macro, it will definitely be less than the
1625 actual mode mask. */
1626 && ((GET_CODE (size
) == CONST_INT
1627 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
1628 <= (GET_MODE_MASK (mode
) >> 1)))
1629 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
1630 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
1631 || (*pred
) (x
, BLKmode
))
1632 && ((pred
= insn_data
[(int) code
].operand
[1].predicate
) == 0
1633 || (*pred
) (y
, BLKmode
))
1634 && ((pred
= insn_data
[(int) code
].operand
[3].predicate
) == 0
1635 || (*pred
) (opalign
, VOIDmode
)))
1638 rtx last
= get_last_insn ();
1641 op2
= convert_to_mode (mode
, size
, 1);
1642 pred
= insn_data
[(int) code
].operand
[2].predicate
;
1643 if (pred
!= 0 && ! (*pred
) (op2
, mode
))
1644 op2
= copy_to_mode_reg (mode
, op2
);
1646 pat
= GEN_FCN ((int) code
) (x
, y
, op2
, opalign
);
1653 delete_insns_since (last
);
1657 /* X, Y, or SIZE may have been passed through protect_from_queue.
1659 It is unsafe to save the value generated by protect_from_queue
1660 and reuse it later. Consider what happens if emit_queue is
1661 called before the return value from protect_from_queue is used.
1663 Expansion of the CALL_EXPR below will call emit_queue before
1664 we are finished emitting RTL for argument setup. So if we are
1665 not careful we could get the wrong value for an argument.
1667 To avoid this problem we go ahead and emit code to copy X, Y &
1668 SIZE into new pseudos. We can then place those new pseudos
1669 into an RTL_EXPR and use them later, even after a call to
1672 Note this is not strictly needed for library calls since they
1673 do not call emit_queue before loading their arguments. However,
1674 we may need to have library calls call emit_queue in the future
1675 since failing to do so could cause problems for targets which
1676 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1677 x
= copy_to_mode_reg (Pmode
, XEXP (x
, 0));
1678 y
= copy_to_mode_reg (Pmode
, XEXP (y
, 0));
1680 #ifdef TARGET_MEM_FUNCTIONS
1681 size
= copy_to_mode_reg (TYPE_MODE (sizetype
), size
);
1683 size
= convert_to_mode (TYPE_MODE (integer_type_node
), size
,
1684 TREE_UNSIGNED (integer_type_node
));
1685 size
= copy_to_mode_reg (TYPE_MODE (integer_type_node
), size
);
1688 #ifdef TARGET_MEM_FUNCTIONS
1689 /* It is incorrect to use the libcall calling conventions to call
1690 memcpy in this context.
1692 This could be a user call to memcpy and the user may wish to
1693 examine the return value from memcpy.
1695 For targets where libcalls and normal calls have different conventions
1696 for returning pointers, we could end up generating incorrect code.
1698 So instead of using a libcall sequence we build up a suitable
1699 CALL_EXPR and expand the call in the normal fashion. */
1700 if (fn
== NULL_TREE
)
1704 /* This was copied from except.c, I don't know if all this is
1705 necessary in this context or not. */
1706 fn
= get_identifier ("memcpy");
1707 push_obstacks_nochange ();
1708 end_temporary_allocation ();
1709 fntype
= build_pointer_type (void_type_node
);
1710 fntype
= build_function_type (fntype
, NULL_TREE
);
1711 fn
= build_decl (FUNCTION_DECL
, fn
, fntype
);
1712 ggc_add_tree_root (&fn
, 1);
1713 DECL_EXTERNAL (fn
) = 1;
1714 TREE_PUBLIC (fn
) = 1;
1715 DECL_ARTIFICIAL (fn
) = 1;
1716 make_decl_rtl (fn
, NULL_PTR
, 1);
1717 assemble_external (fn
);
1721 /* We need to make an argument list for the function call.
1723 memcpy has three arguments, the first two are void * addresses and
1724 the last is a size_t byte count for the copy. */
1726 = build_tree_list (NULL_TREE
,
1727 make_tree (build_pointer_type (void_type_node
), x
));
1728 TREE_CHAIN (arg_list
)
1729 = build_tree_list (NULL_TREE
,
1730 make_tree (build_pointer_type (void_type_node
), y
));
1731 TREE_CHAIN (TREE_CHAIN (arg_list
))
1732 = build_tree_list (NULL_TREE
, make_tree (sizetype
, size
));
1733 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list
))) = NULL_TREE
;
1735 /* Now we have to build up the CALL_EXPR itself. */
1736 call_expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
1737 call_expr
= build (CALL_EXPR
, TREE_TYPE (TREE_TYPE (fn
)),
1738 call_expr
, arg_list
, NULL_TREE
);
1739 TREE_SIDE_EFFECTS (call_expr
) = 1;
1741 retval
= expand_expr (call_expr
, NULL_RTX
, VOIDmode
, 0);
1743 emit_library_call (bcopy_libfunc
, 0,
1744 VOIDmode
, 3, y
, Pmode
, x
, Pmode
,
1745 convert_to_mode (TYPE_MODE (integer_type_node
), size
,
1746 TREE_UNSIGNED (integer_type_node
)),
1747 TYPE_MODE (integer_type_node
));
1754 /* Copy all or part of a value X into registers starting at REGNO.
1755 The number of registers to be filled is NREGS. */
1758 move_block_to_reg (regno
, x
, nregs
, mode
)
1762 enum machine_mode mode
;
1765 #ifdef HAVE_load_multiple
1773 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
1774 x
= validize_mem (force_const_mem (mode
, x
));
1776 /* See if the machine can do this with a load multiple insn. */
1777 #ifdef HAVE_load_multiple
1778 if (HAVE_load_multiple
)
1780 last
= get_last_insn ();
1781 pat
= gen_load_multiple (gen_rtx_REG (word_mode
, regno
), x
,
1789 delete_insns_since (last
);
1793 for (i
= 0; i
< nregs
; i
++)
1794 emit_move_insn (gen_rtx_REG (word_mode
, regno
+ i
),
1795 operand_subword_force (x
, i
, mode
));
1798 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1799 The number of registers to be filled is NREGS. SIZE indicates the number
1800 of bytes in the object X. */
1804 move_block_from_reg (regno
, x
, nregs
, size
)
1811 #ifdef HAVE_store_multiple
1815 enum machine_mode mode
;
1817 /* If SIZE is that of a mode no bigger than a word, just use that
1818 mode's store operation. */
1819 if (size
<= UNITS_PER_WORD
1820 && (mode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0)) != BLKmode
)
1822 emit_move_insn (change_address (x
, mode
, NULL
),
1823 gen_rtx_REG (mode
, regno
));
1827 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
1828 to the left before storing to memory. Note that the previous test
1829 doesn't handle all cases (e.g. SIZE == 3). */
1830 if (size
< UNITS_PER_WORD
&& BYTES_BIG_ENDIAN
)
1832 rtx tem
= operand_subword (x
, 0, 1, BLKmode
);
1838 shift
= expand_shift (LSHIFT_EXPR
, word_mode
,
1839 gen_rtx_REG (word_mode
, regno
),
1840 build_int_2 ((UNITS_PER_WORD
- size
)
1841 * BITS_PER_UNIT
, 0), NULL_RTX
, 0);
1842 emit_move_insn (tem
, shift
);
1846 /* See if the machine can do this with a store multiple insn. */
1847 #ifdef HAVE_store_multiple
1848 if (HAVE_store_multiple
)
1850 last
= get_last_insn ();
1851 pat
= gen_store_multiple (x
, gen_rtx_REG (word_mode
, regno
),
1859 delete_insns_since (last
);
1863 for (i
= 0; i
< nregs
; i
++)
1865 rtx tem
= operand_subword (x
, i
, 1, BLKmode
);
1870 emit_move_insn (tem
, gen_rtx_REG (word_mode
, regno
+ i
));
1874 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
1875 registers represented by a PARALLEL. SSIZE represents the total size of
1876 block SRC in bytes, or -1 if not known. ALIGN is the known alignment of
1878 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatent assumption that
1879 the balance will be in what would be the low-order memory addresses, i.e.
1880 left justified for big endian, right justified for little endian. This
1881 happens to be true for the targets currently using this support. If this
1882 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
1886 emit_group_load (dst
, orig_src
, ssize
, align
)
1893 if (GET_CODE (dst
) != PARALLEL
)
1896 /* Check for a NULL entry, used to indicate that the parameter goes
1897 both on the stack and in registers. */
1898 if (XEXP (XVECEXP (dst
, 0, 0), 0))
1903 tmps
= (rtx
*) alloca (sizeof(rtx
) * XVECLEN (dst
, 0));
1905 /* If we won't be loading directly from memory, protect the real source
1906 from strange tricks we might play. */
1908 if (GET_CODE (src
) != MEM
)
1910 if (GET_CODE (src
) == VOIDmode
)
1911 src
= gen_reg_rtx (GET_MODE (dst
));
1913 src
= gen_reg_rtx (GET_MODE (orig_src
));
1914 emit_move_insn (src
, orig_src
);
1917 /* Process the pieces. */
1918 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
1920 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (dst
, 0, i
), 0));
1921 int bytepos
= INTVAL (XEXP (XVECEXP (dst
, 0, i
), 1));
1922 int bytelen
= GET_MODE_SIZE (mode
);
1925 /* Handle trailing fragments that run over the size of the struct. */
1926 if (ssize
>= 0 && bytepos
+ bytelen
> ssize
)
1928 shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
1929 bytelen
= ssize
- bytepos
;
1934 /* Optimize the access just a bit. */
1935 if (GET_CODE (src
) == MEM
1936 && align
*BITS_PER_UNIT
>= GET_MODE_ALIGNMENT (mode
)
1937 && bytepos
*BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
1938 && bytelen
== GET_MODE_SIZE (mode
))
1940 tmps
[i
] = gen_reg_rtx (mode
);
1941 emit_move_insn (tmps
[i
],
1942 change_address (src
, mode
,
1943 plus_constant (XEXP (src
, 0),
1946 else if (GET_CODE (src
) == CONCAT
)
1949 && bytelen
== GET_MODE_SIZE (GET_MODE (XEXP (src
, 0))))
1950 tmps
[i
] = XEXP (src
, 0);
1951 else if (bytepos
== GET_MODE_SIZE (GET_MODE (XEXP (src
, 0)))
1952 && bytelen
== GET_MODE_SIZE (GET_MODE (XEXP (src
, 1))))
1953 tmps
[i
] = XEXP (src
, 1);
1959 tmps
[i
] = extract_bit_field (src
, bytelen
*BITS_PER_UNIT
,
1960 bytepos
*BITS_PER_UNIT
, 1, NULL_RTX
,
1961 mode
, mode
, align
, ssize
);
1964 if (BYTES_BIG_ENDIAN
&& shift
)
1966 expand_binop (mode
, ashl_optab
, tmps
[i
], GEN_INT (shift
),
1967 tmps
[i
], 0, OPTAB_WIDEN
);
1972 /* Copy the extracted pieces into the proper (probable) hard regs. */
1973 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
1974 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0), tmps
[i
]);
1977 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
1978 registers represented by a PARALLEL. SSIZE represents the total size of
1979 block DST, or -1 if not known. ALIGN is the known alignment of DST. */
1982 emit_group_store (orig_dst
, src
, ssize
, align
)
1989 if (GET_CODE (src
) != PARALLEL
)
1992 /* Check for a NULL entry, used to indicate that the parameter goes
1993 both on the stack and in registers. */
1994 if (XEXP (XVECEXP (src
, 0, 0), 0))
1999 tmps
= (rtx
*) alloca (sizeof(rtx
) * XVECLEN (src
, 0));
2001 /* Copy the (probable) hard regs into pseudos. */
2002 for (i
= start
; i
< XVECLEN (src
, 0); i
++)
2004 rtx reg
= XEXP (XVECEXP (src
, 0, i
), 0);
2005 tmps
[i
] = gen_reg_rtx (GET_MODE (reg
));
2006 emit_move_insn (tmps
[i
], reg
);
2010 /* If we won't be storing directly into memory, protect the real destination
2011 from strange tricks we might play. */
2013 if (GET_CODE (dst
) == PARALLEL
)
2017 /* We can get a PARALLEL dst if there is a conditional expression in
2018 a return statement. In that case, the dst and src are the same,
2019 so no action is necessary. */
2020 if (rtx_equal_p (dst
, src
))
2023 /* It is unclear if we can ever reach here, but we may as well handle
2024 it. Allocate a temporary, and split this into a store/load to/from
2027 temp
= assign_stack_temp (GET_MODE (dst
), ssize
, 0);
2028 emit_group_store (temp
, src
, ssize
, align
);
2029 emit_group_load (dst
, temp
, ssize
, align
);
2032 else if (GET_CODE (dst
) != MEM
)
2034 dst
= gen_reg_rtx (GET_MODE (orig_dst
));
2035 /* Make life a bit easier for combine. */
2036 emit_move_insn (dst
, const0_rtx
);
2038 else if (! MEM_IN_STRUCT_P (dst
))
2040 /* store_bit_field requires that memory operations have
2041 mem_in_struct_p set; we might not. */
2043 dst
= copy_rtx (orig_dst
);
2044 MEM_SET_IN_STRUCT_P (dst
, 1);
2047 /* Process the pieces. */
2048 for (i
= start
; i
< XVECLEN (src
, 0); i
++)
2050 int bytepos
= INTVAL (XEXP (XVECEXP (src
, 0, i
), 1));
2051 enum machine_mode mode
= GET_MODE (tmps
[i
]);
2052 int bytelen
= GET_MODE_SIZE (mode
);
2054 /* Handle trailing fragments that run over the size of the struct. */
2055 if (ssize
>= 0 && bytepos
+ bytelen
> ssize
)
2057 if (BYTES_BIG_ENDIAN
)
2059 int shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2060 expand_binop (mode
, ashr_optab
, tmps
[i
], GEN_INT (shift
),
2061 tmps
[i
], 0, OPTAB_WIDEN
);
2063 bytelen
= ssize
- bytepos
;
2066 /* Optimize the access just a bit. */
2067 if (GET_CODE (dst
) == MEM
2068 && align
*BITS_PER_UNIT
>= GET_MODE_ALIGNMENT (mode
)
2069 && bytepos
*BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2070 && bytelen
== GET_MODE_SIZE (mode
))
2072 emit_move_insn (change_address (dst
, mode
,
2073 plus_constant (XEXP (dst
, 0),
2079 store_bit_field (dst
, bytelen
*BITS_PER_UNIT
, bytepos
*BITS_PER_UNIT
,
2080 mode
, tmps
[i
], align
, ssize
);
2085 /* Copy from the pseudo into the (probable) hard reg. */
2086 if (GET_CODE (dst
) == REG
)
2087 emit_move_insn (orig_dst
, dst
);
2090 /* Generate code to copy a BLKmode object of TYPE out of a
2091 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2092 is null, a stack temporary is created. TGTBLK is returned.
2094 The primary purpose of this routine is to handle functions
2095 that return BLKmode structures in registers. Some machines
2096 (the PA for example) want to return all small structures
2097 in registers regardless of the structure's alignment.
2101 copy_blkmode_from_reg(tgtblk
,srcreg
,type
)
2106 int bytes
= int_size_in_bytes (type
);
2107 rtx src
= NULL
, dst
= NULL
;
2108 int bitsize
= MIN (TYPE_ALIGN (type
), (unsigned int) BITS_PER_WORD
);
2109 int bitpos
, xbitpos
, big_endian_correction
= 0;
2113 tgtblk
= assign_stack_temp (BLKmode
, bytes
, 0);
2114 MEM_SET_IN_STRUCT_P (tgtblk
, AGGREGATE_TYPE_P (type
));
2115 preserve_temp_slots (tgtblk
);
2118 /* This code assumes srcreg is at least a full word. If it isn't,
2119 copy it into a new pseudo which is a full word. */
2120 if (GET_MODE (srcreg
) != BLKmode
2121 && GET_MODE_SIZE (GET_MODE (srcreg
)) < UNITS_PER_WORD
)
2122 srcreg
= convert_to_mode (word_mode
, srcreg
,
2123 TREE_UNSIGNED (type
));
2125 /* Structures whose size is not a multiple of a word are aligned
2126 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2127 machine, this means we must skip the empty high order bytes when
2128 calculating the bit offset. */
2129 if (BYTES_BIG_ENDIAN
&& bytes
% UNITS_PER_WORD
)
2130 big_endian_correction
= (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
)
2133 /* Copy the structure BITSIZE bites at a time.
2135 We could probably emit more efficient code for machines
2136 which do not use strict alignment, but it doesn't seem
2137 worth the effort at the current time. */
2138 for (bitpos
= 0, xbitpos
= big_endian_correction
;
2139 bitpos
< bytes
* BITS_PER_UNIT
;
2140 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2143 /* We need a new source operand each time xbitpos is on a
2144 word boundary and when xbitpos == big_endian_correction
2145 (the first time through). */
2146 if (xbitpos
% BITS_PER_WORD
== 0
2147 || xbitpos
== big_endian_correction
)
2148 src
= operand_subword_force (srcreg
,
2149 xbitpos
/ BITS_PER_WORD
,
2152 /* We need a new destination operand each time bitpos is on
2154 if (bitpos
% BITS_PER_WORD
== 0)
2155 dst
= operand_subword (tgtblk
, bitpos
/ BITS_PER_WORD
, 1, BLKmode
);
2157 /* Use xbitpos for the source extraction (right justified) and
2158 xbitpos for the destination store (left justified). */
2159 store_bit_field (dst
, bitsize
, bitpos
% BITS_PER_WORD
, word_mode
,
2160 extract_bit_field (src
, bitsize
,
2161 xbitpos
% BITS_PER_WORD
, 1,
2162 NULL_RTX
, word_mode
,
2164 bitsize
/ BITS_PER_UNIT
,
2166 bitsize
/ BITS_PER_UNIT
, BITS_PER_WORD
);
2172 /* Add a USE expression for REG to the (possibly empty) list pointed
2173 to by CALL_FUSAGE. REG must denote a hard register. */
2176 use_reg (call_fusage
, reg
)
2177 rtx
*call_fusage
, reg
;
2179 if (GET_CODE (reg
) != REG
2180 || REGNO (reg
) >= FIRST_PSEUDO_REGISTER
)
2184 = gen_rtx_EXPR_LIST (VOIDmode
,
2185 gen_rtx_USE (VOIDmode
, reg
), *call_fusage
);
2188 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2189 starting at REGNO. All of these registers must be hard registers. */
2192 use_regs (call_fusage
, regno
, nregs
)
2199 if (regno
+ nregs
> FIRST_PSEUDO_REGISTER
)
2202 for (i
= 0; i
< nregs
; i
++)
2203 use_reg (call_fusage
, gen_rtx_REG (reg_raw_mode
[regno
+ i
], regno
+ i
));
2206 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2207 PARALLEL REGS. This is for calls that pass values in multiple
2208 non-contiguous locations. The Irix 6 ABI has examples of this. */
2211 use_group_regs (call_fusage
, regs
)
2217 for (i
= 0; i
< XVECLEN (regs
, 0); i
++)
2219 rtx reg
= XEXP (XVECEXP (regs
, 0, i
), 0);
2221 /* A NULL entry means the parameter goes both on the stack and in
2222 registers. This can also be a MEM for targets that pass values
2223 partially on the stack and partially in registers. */
2224 if (reg
!= 0 && GET_CODE (reg
) == REG
)
2225 use_reg (call_fusage
, reg
);
2229 /* Generate several move instructions to clear LEN bytes of block TO.
2230 (A MEM rtx with BLKmode). The caller must pass TO through
2231 protect_from_queue before calling. ALIGN (in bytes) is maximum alignment
2235 clear_by_pieces (to
, len
, align
)
2239 struct clear_by_pieces data
;
2240 rtx to_addr
= XEXP (to
, 0);
2241 int max_size
= MOVE_MAX_PIECES
+ 1;
2242 enum machine_mode mode
= VOIDmode
, tmode
;
2243 enum insn_code icode
;
2246 data
.to_addr
= to_addr
;
2249 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
2250 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
2252 data
.explicit_inc_to
= 0;
2254 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
2255 if (data
.reverse
) data
.offset
= len
;
2258 data
.to_struct
= MEM_IN_STRUCT_P (to
);
2260 /* If copying requires more than two move insns,
2261 copy addresses to registers (to make displacements shorter)
2262 and use post-increment if available. */
2264 && move_by_pieces_ninsns (len
, align
) > 2)
2266 /* Determine the main mode we'll be using */
2267 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2268 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2269 if (GET_MODE_SIZE (tmode
) < max_size
)
2272 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
2274 data
.to_addr
= copy_addr_to_reg (plus_constant (to_addr
, len
));
2276 data
.explicit_inc_to
= -1;
2278 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
2280 data
.to_addr
= copy_addr_to_reg (to_addr
);
2282 data
.explicit_inc_to
= 1;
2284 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
2285 data
.to_addr
= copy_addr_to_reg (to_addr
);
2288 if (! SLOW_UNALIGNED_ACCESS
2289 || align
> MOVE_MAX
|| align
>= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
2292 /* First move what we can in the largest integer mode, then go to
2293 successively smaller modes. */
2295 while (max_size
> 1)
2297 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2298 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2299 if (GET_MODE_SIZE (tmode
) < max_size
)
2302 if (mode
== VOIDmode
)
2305 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
2306 if (icode
!= CODE_FOR_nothing
2307 && align
>= MIN (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
,
2308 GET_MODE_SIZE (mode
)))
2309 clear_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
2311 max_size
= GET_MODE_SIZE (mode
);
2314 /* The code above should have handled everything. */
2319 /* Subroutine of clear_by_pieces. Clear as many bytes as appropriate
2320 with move instructions for mode MODE. GENFUN is the gen_... function
2321 to make a move insn for that mode. DATA has all the other info. */
2324 clear_by_pieces_1 (genfun
, mode
, data
)
2325 rtx (*genfun
) PROTO ((rtx
, ...));
2326 enum machine_mode mode
;
2327 struct clear_by_pieces
*data
;
2329 register int size
= GET_MODE_SIZE (mode
);
2332 while (data
->len
>= size
)
2334 if (data
->reverse
) data
->offset
-= size
;
2336 to1
= (data
->autinc_to
2337 ? gen_rtx_MEM (mode
, data
->to_addr
)
2338 : copy_rtx (change_address (data
->to
, mode
,
2339 plus_constant (data
->to_addr
,
2341 MEM_IN_STRUCT_P (to1
) = data
->to_struct
;
2343 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
2344 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (-size
)));
2346 emit_insn ((*genfun
) (to1
, const0_rtx
));
2347 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
2348 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
2350 if (! data
->reverse
) data
->offset
+= size
;
2356 /* Write zeros through the storage of OBJECT.
2357 If OBJECT has BLKmode, SIZE is its length in bytes and ALIGN is
2358 the maximum alignment we can is has, measured in bytes.
2360 If we call a function that returns the length of the block, return it. */
2363 clear_storage (object
, size
, align
)
2368 #ifdef TARGET_MEM_FUNCTIONS
2370 tree call_expr
, arg_list
;
2374 if (GET_MODE (object
) == BLKmode
)
2376 object
= protect_from_queue (object
, 1);
2377 size
= protect_from_queue (size
, 0);
2379 if (GET_CODE (size
) == CONST_INT
2380 && MOVE_BY_PIECES_P (INTVAL (size
), align
))
2381 clear_by_pieces (object
, INTVAL (size
), align
);
2385 /* Try the most limited insn first, because there's no point
2386 including more than one in the machine description unless
2387 the more limited one has some advantage. */
2389 rtx opalign
= GEN_INT (align
);
2390 enum machine_mode mode
;
2392 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
2393 mode
= GET_MODE_WIDER_MODE (mode
))
2395 enum insn_code code
= clrstr_optab
[(int) mode
];
2396 insn_operand_predicate_fn pred
;
2398 if (code
!= CODE_FOR_nothing
2399 /* We don't need MODE to be narrower than
2400 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2401 the mode mask, as it is returned by the macro, it will
2402 definitely be less than the actual mode mask. */
2403 && ((GET_CODE (size
) == CONST_INT
2404 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
2405 <= (GET_MODE_MASK (mode
) >> 1)))
2406 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
2407 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
2408 || (*pred
) (object
, BLKmode
))
2409 && ((pred
= insn_data
[(int) code
].operand
[2].predicate
) == 0
2410 || (*pred
) (opalign
, VOIDmode
)))
2413 rtx last
= get_last_insn ();
2416 op1
= convert_to_mode (mode
, size
, 1);
2417 pred
= insn_data
[(int) code
].operand
[1].predicate
;
2418 if (pred
!= 0 && ! (*pred
) (op1
, mode
))
2419 op1
= copy_to_mode_reg (mode
, op1
);
2421 pat
= GEN_FCN ((int) code
) (object
, op1
, opalign
);
2428 delete_insns_since (last
);
2432 /* OBJECT or SIZE may have been passed through protect_from_queue.
2434 It is unsafe to save the value generated by protect_from_queue
2435 and reuse it later. Consider what happens if emit_queue is
2436 called before the return value from protect_from_queue is used.
2438 Expansion of the CALL_EXPR below will call emit_queue before
2439 we are finished emitting RTL for argument setup. So if we are
2440 not careful we could get the wrong value for an argument.
2442 To avoid this problem we go ahead and emit code to copy OBJECT
2443 and SIZE into new pseudos. We can then place those new pseudos
2444 into an RTL_EXPR and use them later, even after a call to
2447 Note this is not strictly needed for library calls since they
2448 do not call emit_queue before loading their arguments. However,
2449 we may need to have library calls call emit_queue in the future
2450 since failing to do so could cause problems for targets which
2451 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
2452 object
= copy_to_mode_reg (Pmode
, XEXP (object
, 0));
2454 #ifdef TARGET_MEM_FUNCTIONS
2455 size
= copy_to_mode_reg (TYPE_MODE (sizetype
), size
);
2457 size
= convert_to_mode (TYPE_MODE (integer_type_node
), size
,
2458 TREE_UNSIGNED (integer_type_node
));
2459 size
= copy_to_mode_reg (TYPE_MODE (integer_type_node
), size
);
2463 #ifdef TARGET_MEM_FUNCTIONS
2464 /* It is incorrect to use the libcall calling conventions to call
2465 memset in this context.
2467 This could be a user call to memset and the user may wish to
2468 examine the return value from memset.
2470 For targets where libcalls and normal calls have different
2471 conventions for returning pointers, we could end up generating
2474 So instead of using a libcall sequence we build up a suitable
2475 CALL_EXPR and expand the call in the normal fashion. */
2476 if (fn
== NULL_TREE
)
2480 /* This was copied from except.c, I don't know if all this is
2481 necessary in this context or not. */
2482 fn
= get_identifier ("memset");
2483 push_obstacks_nochange ();
2484 end_temporary_allocation ();
2485 fntype
= build_pointer_type (void_type_node
);
2486 fntype
= build_function_type (fntype
, NULL_TREE
);
2487 fn
= build_decl (FUNCTION_DECL
, fn
, fntype
);
2488 ggc_add_tree_root (&fn
, 1);
2489 DECL_EXTERNAL (fn
) = 1;
2490 TREE_PUBLIC (fn
) = 1;
2491 DECL_ARTIFICIAL (fn
) = 1;
2492 make_decl_rtl (fn
, NULL_PTR
, 1);
2493 assemble_external (fn
);
2497 /* We need to make an argument list for the function call.
2499 memset has three arguments, the first is a void * addresses, the
2500 second a integer with the initialization value, the last is a
2501 size_t byte count for the copy. */
2503 = build_tree_list (NULL_TREE
,
2504 make_tree (build_pointer_type (void_type_node
),
2506 TREE_CHAIN (arg_list
)
2507 = build_tree_list (NULL_TREE
,
2508 make_tree (integer_type_node
, const0_rtx
));
2509 TREE_CHAIN (TREE_CHAIN (arg_list
))
2510 = build_tree_list (NULL_TREE
, make_tree (sizetype
, size
));
2511 TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (arg_list
))) = NULL_TREE
;
2513 /* Now we have to build up the CALL_EXPR itself. */
2514 call_expr
= build1 (ADDR_EXPR
,
2515 build_pointer_type (TREE_TYPE (fn
)), fn
);
2516 call_expr
= build (CALL_EXPR
, TREE_TYPE (TREE_TYPE (fn
)),
2517 call_expr
, arg_list
, NULL_TREE
);
2518 TREE_SIDE_EFFECTS (call_expr
) = 1;
2520 retval
= expand_expr (call_expr
, NULL_RTX
, VOIDmode
, 0);
2522 emit_library_call (bzero_libfunc
, 0,
2523 VOIDmode
, 2, object
, Pmode
, size
,
2524 TYPE_MODE (integer_type_node
));
2529 emit_move_insn (object
, CONST0_RTX (GET_MODE (object
)));
2534 /* Generate code to copy Y into X.
2535 Both Y and X must have the same mode, except that
2536 Y can be a constant with VOIDmode.
2537 This mode cannot be BLKmode; use emit_block_move for that.
2539 Return the last instruction emitted. */
2542 emit_move_insn (x
, y
)
2545 enum machine_mode mode
= GET_MODE (x
);
2547 x
= protect_from_queue (x
, 1);
2548 y
= protect_from_queue (y
, 0);
2550 if (mode
== BLKmode
|| (GET_MODE (y
) != mode
&& GET_MODE (y
) != VOIDmode
))
2553 /* Never force constant_p_rtx to memory. */
2554 if (GET_CODE (y
) == CONSTANT_P_RTX
)
2556 else if (CONSTANT_P (y
) && ! LEGITIMATE_CONSTANT_P (y
))
2557 y
= force_const_mem (mode
, y
);
2559 /* If X or Y are memory references, verify that their addresses are valid
2561 if (GET_CODE (x
) == MEM
2562 && ((! memory_address_p (GET_MODE (x
), XEXP (x
, 0))
2563 && ! push_operand (x
, GET_MODE (x
)))
2565 && CONSTANT_ADDRESS_P (XEXP (x
, 0)))))
2566 x
= change_address (x
, VOIDmode
, XEXP (x
, 0));
2568 if (GET_CODE (y
) == MEM
2569 && (! memory_address_p (GET_MODE (y
), XEXP (y
, 0))
2571 && CONSTANT_ADDRESS_P (XEXP (y
, 0)))))
2572 y
= change_address (y
, VOIDmode
, XEXP (y
, 0));
2574 if (mode
== BLKmode
)
2577 return emit_move_insn_1 (x
, y
);
2580 /* Low level part of emit_move_insn.
2581 Called just like emit_move_insn, but assumes X and Y
2582 are basically valid. */
2585 emit_move_insn_1 (x
, y
)
2588 enum machine_mode mode
= GET_MODE (x
);
2589 enum machine_mode submode
;
2590 enum mode_class
class = GET_MODE_CLASS (mode
);
2593 if (mode
>= MAX_MACHINE_MODE
)
2596 if (mov_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
2598 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) mode
].insn_code
) (x
, y
));
2600 /* Expand complex moves by moving real part and imag part, if possible. */
2601 else if ((class == MODE_COMPLEX_FLOAT
|| class == MODE_COMPLEX_INT
)
2602 && BLKmode
!= (submode
= mode_for_size ((GET_MODE_UNIT_SIZE (mode
)
2604 (class == MODE_COMPLEX_INT
2605 ? MODE_INT
: MODE_FLOAT
),
2607 && (mov_optab
->handlers
[(int) submode
].insn_code
2608 != CODE_FOR_nothing
))
2610 /* Don't split destination if it is a stack push. */
2611 int stack
= push_operand (x
, GET_MODE (x
));
2613 /* If this is a stack, push the highpart first, so it
2614 will be in the argument order.
2616 In that case, change_address is used only to convert
2617 the mode, not to change the address. */
2620 /* Note that the real part always precedes the imag part in memory
2621 regardless of machine's endianness. */
2622 #ifdef STACK_GROWS_DOWNWARD
2623 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2624 (gen_rtx_MEM (submode
, (XEXP (x
, 0))),
2625 gen_imagpart (submode
, y
)));
2626 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2627 (gen_rtx_MEM (submode
, (XEXP (x
, 0))),
2628 gen_realpart (submode
, y
)));
2630 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2631 (gen_rtx_MEM (submode
, (XEXP (x
, 0))),
2632 gen_realpart (submode
, y
)));
2633 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2634 (gen_rtx_MEM (submode
, (XEXP (x
, 0))),
2635 gen_imagpart (submode
, y
)));
2640 rtx realpart_x
, realpart_y
;
2641 rtx imagpart_x
, imagpart_y
;
2643 /* If this is a complex value with each part being smaller than a
2644 word, the usual calling sequence will likely pack the pieces into
2645 a single register. Unfortunately, SUBREG of hard registers only
2646 deals in terms of words, so we have a problem converting input
2647 arguments to the CONCAT of two registers that is used elsewhere
2648 for complex values. If this is before reload, we can copy it into
2649 memory and reload. FIXME, we should see about using extract and
2650 insert on integer registers, but complex short and complex char
2651 variables should be rarely used. */
2652 if (GET_MODE_BITSIZE (mode
) < 2*BITS_PER_WORD
2653 && (reload_in_progress
| reload_completed
) == 0)
2655 int packed_dest_p
= (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
);
2656 int packed_src_p
= (REG_P (y
) && REGNO (y
) < FIRST_PSEUDO_REGISTER
);
2658 if (packed_dest_p
|| packed_src_p
)
2660 enum mode_class reg_class
= ((class == MODE_COMPLEX_FLOAT
)
2661 ? MODE_FLOAT
: MODE_INT
);
2663 enum machine_mode reg_mode
=
2664 mode_for_size (GET_MODE_BITSIZE (mode
), reg_class
, 1);
2666 if (reg_mode
!= BLKmode
)
2668 rtx mem
= assign_stack_temp (reg_mode
,
2669 GET_MODE_SIZE (mode
), 0);
2671 rtx cmem
= change_address (mem
, mode
, NULL_RTX
);
2673 cfun
->cannot_inline
= "function uses short complex types";
2677 rtx sreg
= gen_rtx_SUBREG (reg_mode
, x
, 0);
2678 emit_move_insn_1 (cmem
, y
);
2679 return emit_move_insn_1 (sreg
, mem
);
2683 rtx sreg
= gen_rtx_SUBREG (reg_mode
, y
, 0);
2684 emit_move_insn_1 (mem
, sreg
);
2685 return emit_move_insn_1 (x
, cmem
);
2691 realpart_x
= gen_realpart (submode
, x
);
2692 realpart_y
= gen_realpart (submode
, y
);
2693 imagpart_x
= gen_imagpart (submode
, x
);
2694 imagpart_y
= gen_imagpart (submode
, y
);
2696 /* Show the output dies here. This is necessary for SUBREGs
2697 of pseudos since we cannot track their lifetimes correctly;
2698 hard regs shouldn't appear here except as return values.
2699 We never want to emit such a clobber after reload. */
2701 && ! (reload_in_progress
|| reload_completed
)
2702 && (GET_CODE (realpart_x
) == SUBREG
2703 || GET_CODE (imagpart_x
) == SUBREG
))
2705 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
2708 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2709 (realpart_x
, realpart_y
));
2710 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
2711 (imagpart_x
, imagpart_y
));
2714 return get_last_insn ();
2717 /* This will handle any multi-word mode that lacks a move_insn pattern.
2718 However, you will get better code if you define such patterns,
2719 even if they must turn into multiple assembler instructions. */
2720 else if (GET_MODE_SIZE (mode
) > UNITS_PER_WORD
)
2726 #ifdef PUSH_ROUNDING
2728 /* If X is a push on the stack, do the push now and replace
2729 X with a reference to the stack pointer. */
2730 if (push_operand (x
, GET_MODE (x
)))
2732 anti_adjust_stack (GEN_INT (GET_MODE_SIZE (GET_MODE (x
))));
2733 x
= change_address (x
, VOIDmode
, stack_pointer_rtx
);
2741 i
< (GET_MODE_SIZE (mode
) + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
2744 rtx xpart
= operand_subword (x
, i
, 1, mode
);
2745 rtx ypart
= operand_subword (y
, i
, 1, mode
);
2747 /* If we can't get a part of Y, put Y into memory if it is a
2748 constant. Otherwise, force it into a register. If we still
2749 can't get a part of Y, abort. */
2750 if (ypart
== 0 && CONSTANT_P (y
))
2752 y
= force_const_mem (mode
, y
);
2753 ypart
= operand_subword (y
, i
, 1, mode
);
2755 else if (ypart
== 0)
2756 ypart
= operand_subword_force (y
, i
, mode
);
2758 if (xpart
== 0 || ypart
== 0)
2761 need_clobber
|= (GET_CODE (xpart
) == SUBREG
);
2763 last_insn
= emit_move_insn (xpart
, ypart
);
2766 seq
= gen_sequence ();
2769 /* Show the output dies here. This is necessary for SUBREGs
2770 of pseudos since we cannot track their lifetimes correctly;
2771 hard regs shouldn't appear here except as return values.
2772 We never want to emit such a clobber after reload. */
2774 && ! (reload_in_progress
|| reload_completed
)
2775 && need_clobber
!= 0)
2777 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
2788 /* Pushing data onto the stack. */
2790 /* Push a block of length SIZE (perhaps variable)
2791 and return an rtx to address the beginning of the block.
2792 Note that it is not possible for the value returned to be a QUEUED.
2793 The value may be virtual_outgoing_args_rtx.
2795 EXTRA is the number of bytes of padding to push in addition to SIZE.
2796 BELOW nonzero means this padding comes at low addresses;
2797 otherwise, the padding comes at high addresses. */
2800 push_block (size
, extra
, below
)
2806 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
2807 if (CONSTANT_P (size
))
2808 anti_adjust_stack (plus_constant (size
, extra
));
2809 else if (GET_CODE (size
) == REG
&& extra
== 0)
2810 anti_adjust_stack (size
);
2813 rtx temp
= copy_to_mode_reg (Pmode
, size
);
2815 temp
= expand_binop (Pmode
, add_optab
, temp
, GEN_INT (extra
),
2816 temp
, 0, OPTAB_LIB_WIDEN
);
2817 anti_adjust_stack (temp
);
2820 #if defined (STACK_GROWS_DOWNWARD) \
2821 || (defined (ARGS_GROW_DOWNWARD) \
2822 && !defined (ACCUMULATE_OUTGOING_ARGS))
2824 /* Return the lowest stack address when STACK or ARGS grow downward and
2825 we are not aaccumulating outgoing arguments (the c4x port uses such
2827 temp
= virtual_outgoing_args_rtx
;
2828 if (extra
!= 0 && below
)
2829 temp
= plus_constant (temp
, extra
);
2831 if (GET_CODE (size
) == CONST_INT
)
2832 temp
= plus_constant (virtual_outgoing_args_rtx
,
2833 - INTVAL (size
) - (below
? 0 : extra
));
2834 else if (extra
!= 0 && !below
)
2835 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
2836 negate_rtx (Pmode
, plus_constant (size
, extra
)));
2838 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
2839 negate_rtx (Pmode
, size
));
2842 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT
), temp
);
2848 return gen_rtx_fmt_e (STACK_PUSH_CODE
, Pmode
, stack_pointer_rtx
);
2851 /* Return an rtx for the address of the beginning of a as-if-it-was-pushed
2852 block of SIZE bytes. */
2855 get_push_address (size
)
2860 if (STACK_PUSH_CODE
== POST_DEC
)
2861 temp
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
, GEN_INT (size
));
2862 else if (STACK_PUSH_CODE
== POST_INC
)
2863 temp
= gen_rtx_MINUS (Pmode
, stack_pointer_rtx
, GEN_INT (size
));
2865 temp
= stack_pointer_rtx
;
2867 return copy_to_reg (temp
);
2870 /* Generate code to push X onto the stack, assuming it has mode MODE and
2872 MODE is redundant except when X is a CONST_INT (since they don't
2874 SIZE is an rtx for the size of data to be copied (in bytes),
2875 needed only if X is BLKmode.
2877 ALIGN (in bytes) is maximum alignment we can assume.
2879 If PARTIAL and REG are both nonzero, then copy that many of the first
2880 words of X into registers starting with REG, and push the rest of X.
2881 The amount of space pushed is decreased by PARTIAL words,
2882 rounded *down* to a multiple of PARM_BOUNDARY.
2883 REG must be a hard register in this case.
2884 If REG is zero but PARTIAL is not, take any all others actions for an
2885 argument partially in registers, but do not actually load any
2888 EXTRA is the amount in bytes of extra space to leave next to this arg.
2889 This is ignored if an argument block has already been allocated.
2891 On a machine that lacks real push insns, ARGS_ADDR is the address of
2892 the bottom of the argument block for this call. We use indexing off there
2893 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
2894 argument block has not been preallocated.
2896 ARGS_SO_FAR is the size of args previously pushed for this call.
2898 REG_PARM_STACK_SPACE is nonzero if functions require stack space
2899 for arguments passed in registers. If nonzero, it will be the number
2900 of bytes required. */
2903 emit_push_insn (x
, mode
, type
, size
, align
, partial
, reg
, extra
,
2904 args_addr
, args_so_far
, reg_parm_stack_space
,
2907 enum machine_mode mode
;
2916 int reg_parm_stack_space
;
2920 enum direction stack_direction
2921 #ifdef STACK_GROWS_DOWNWARD
2927 /* Decide where to pad the argument: `downward' for below,
2928 `upward' for above, or `none' for don't pad it.
2929 Default is below for small data on big-endian machines; else above. */
2930 enum direction where_pad
= FUNCTION_ARG_PADDING (mode
, type
);
2932 /* Invert direction if stack is post-update. */
2933 if (STACK_PUSH_CODE
== POST_INC
|| STACK_PUSH_CODE
== POST_DEC
)
2934 if (where_pad
!= none
)
2935 where_pad
= (where_pad
== downward
? upward
: downward
);
2937 xinner
= x
= protect_from_queue (x
, 0);
2939 if (mode
== BLKmode
)
2941 /* Copy a block into the stack, entirely or partially. */
2944 int used
= partial
* UNITS_PER_WORD
;
2945 int offset
= used
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
2953 /* USED is now the # of bytes we need not copy to the stack
2954 because registers will take care of them. */
2957 xinner
= change_address (xinner
, BLKmode
,
2958 plus_constant (XEXP (xinner
, 0), used
));
2960 /* If the partial register-part of the arg counts in its stack size,
2961 skip the part of stack space corresponding to the registers.
2962 Otherwise, start copying to the beginning of the stack space,
2963 by setting SKIP to 0. */
2964 skip
= (reg_parm_stack_space
== 0) ? 0 : used
;
2966 #ifdef PUSH_ROUNDING
2967 /* Do it with several push insns if that doesn't take lots of insns
2968 and if there is no difficulty with push insns that skip bytes
2969 on the stack for alignment purposes. */
2971 && GET_CODE (size
) == CONST_INT
2973 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
) - used
, align
))
2974 /* Here we avoid the case of a structure whose weak alignment
2975 forces many pushes of a small amount of data,
2976 and such small pushes do rounding that causes trouble. */
2977 && ((! SLOW_UNALIGNED_ACCESS
)
2978 || align
>= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
2979 || PUSH_ROUNDING (align
) == align
)
2980 && PUSH_ROUNDING (INTVAL (size
)) == INTVAL (size
))
2982 /* Push padding now if padding above and stack grows down,
2983 or if padding below and stack grows up.
2984 But if space already allocated, this has already been done. */
2985 if (extra
&& args_addr
== 0
2986 && where_pad
!= none
&& where_pad
!= stack_direction
)
2987 anti_adjust_stack (GEN_INT (extra
));
2989 move_by_pieces (gen_rtx_MEM (BLKmode
, gen_push_operand ()), xinner
,
2990 INTVAL (size
) - used
, align
);
2992 if (current_function_check_memory_usage
&& ! in_check_memory_usage
)
2996 in_check_memory_usage
= 1;
2997 temp
= get_push_address (INTVAL(size
) - used
);
2998 if (GET_CODE (x
) == MEM
&& type
&& AGGREGATE_TYPE_P (type
))
2999 emit_library_call (chkr_copy_bitmap_libfunc
, 1, VOIDmode
, 3,
3001 XEXP (xinner
, 0), Pmode
,
3002 GEN_INT (INTVAL(size
) - used
),
3003 TYPE_MODE (sizetype
));
3005 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
3007 GEN_INT (INTVAL(size
) - used
),
3008 TYPE_MODE (sizetype
),
3009 GEN_INT (MEMORY_USE_RW
),
3010 TYPE_MODE (integer_type_node
));
3011 in_check_memory_usage
= 0;
3015 #endif /* PUSH_ROUNDING */
3017 /* Otherwise make space on the stack and copy the data
3018 to the address of that space. */
3020 /* Deduct words put into registers from the size we must copy. */
3023 if (GET_CODE (size
) == CONST_INT
)
3024 size
= GEN_INT (INTVAL (size
) - used
);
3026 size
= expand_binop (GET_MODE (size
), sub_optab
, size
,
3027 GEN_INT (used
), NULL_RTX
, 0,
3031 /* Get the address of the stack space.
3032 In this case, we do not deal with EXTRA separately.
3033 A single stack adjust will do. */
3036 temp
= push_block (size
, extra
, where_pad
== downward
);
3039 else if (GET_CODE (args_so_far
) == CONST_INT
)
3040 temp
= memory_address (BLKmode
,
3041 plus_constant (args_addr
,
3042 skip
+ INTVAL (args_so_far
)));
3044 temp
= memory_address (BLKmode
,
3045 plus_constant (gen_rtx_PLUS (Pmode
,
3049 if (current_function_check_memory_usage
&& ! in_check_memory_usage
)
3053 in_check_memory_usage
= 1;
3054 target
= copy_to_reg (temp
);
3055 if (GET_CODE (x
) == MEM
&& type
&& AGGREGATE_TYPE_P (type
))
3056 emit_library_call (chkr_copy_bitmap_libfunc
, 1, VOIDmode
, 3,
3058 XEXP (xinner
, 0), Pmode
,
3059 size
, TYPE_MODE (sizetype
));
3061 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
3063 size
, TYPE_MODE (sizetype
),
3064 GEN_INT (MEMORY_USE_RW
),
3065 TYPE_MODE (integer_type_node
));
3066 in_check_memory_usage
= 0;
3069 /* TEMP is the address of the block. Copy the data there. */
3070 if (GET_CODE (size
) == CONST_INT
3071 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
), align
)))
3073 move_by_pieces (gen_rtx_MEM (BLKmode
, temp
), xinner
,
3074 INTVAL (size
), align
);
3079 rtx opalign
= GEN_INT (align
);
3080 enum machine_mode mode
;
3081 rtx target
= gen_rtx_MEM (BLKmode
, temp
);
3083 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
3085 mode
= GET_MODE_WIDER_MODE (mode
))
3087 enum insn_code code
= movstr_optab
[(int) mode
];
3088 insn_operand_predicate_fn pred
;
3090 if (code
!= CODE_FOR_nothing
3091 && ((GET_CODE (size
) == CONST_INT
3092 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
3093 <= (GET_MODE_MASK (mode
) >> 1)))
3094 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
3095 && (!(pred
= insn_data
[(int) code
].operand
[0].predicate
)
3096 || ((*pred
) (target
, BLKmode
)))
3097 && (!(pred
= insn_data
[(int) code
].operand
[1].predicate
)
3098 || ((*pred
) (xinner
, BLKmode
)))
3099 && (!(pred
= insn_data
[(int) code
].operand
[3].predicate
)
3100 || ((*pred
) (opalign
, VOIDmode
))))
3102 rtx op2
= convert_to_mode (mode
, size
, 1);
3103 rtx last
= get_last_insn ();
3106 pred
= insn_data
[(int) code
].operand
[2].predicate
;
3107 if (pred
!= 0 && ! (*pred
) (op2
, mode
))
3108 op2
= copy_to_mode_reg (mode
, op2
);
3110 pat
= GEN_FCN ((int) code
) (target
, xinner
,
3118 delete_insns_since (last
);
3123 #ifndef ACCUMULATE_OUTGOING_ARGS
3124 /* If the source is referenced relative to the stack pointer,
3125 copy it to another register to stabilize it. We do not need
3126 to do this if we know that we won't be changing sp. */
3128 if (reg_mentioned_p (virtual_stack_dynamic_rtx
, temp
)
3129 || reg_mentioned_p (virtual_outgoing_args_rtx
, temp
))
3130 temp
= copy_to_reg (temp
);
3133 /* Make inhibit_defer_pop nonzero around the library call
3134 to force it to pop the bcopy-arguments right away. */
3136 #ifdef TARGET_MEM_FUNCTIONS
3137 emit_library_call (memcpy_libfunc
, 0,
3138 VOIDmode
, 3, temp
, Pmode
, XEXP (xinner
, 0), Pmode
,
3139 convert_to_mode (TYPE_MODE (sizetype
),
3140 size
, TREE_UNSIGNED (sizetype
)),
3141 TYPE_MODE (sizetype
));
3143 emit_library_call (bcopy_libfunc
, 0,
3144 VOIDmode
, 3, XEXP (xinner
, 0), Pmode
, temp
, Pmode
,
3145 convert_to_mode (TYPE_MODE (integer_type_node
),
3147 TREE_UNSIGNED (integer_type_node
)),
3148 TYPE_MODE (integer_type_node
));
3153 else if (partial
> 0)
3155 /* Scalar partly in registers. */
3157 int size
= GET_MODE_SIZE (mode
) / UNITS_PER_WORD
;
3160 /* # words of start of argument
3161 that we must make space for but need not store. */
3162 int offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_WORD
);
3163 int args_offset
= INTVAL (args_so_far
);
3166 /* Push padding now if padding above and stack grows down,
3167 or if padding below and stack grows up.
3168 But if space already allocated, this has already been done. */
3169 if (extra
&& args_addr
== 0
3170 && where_pad
!= none
&& where_pad
!= stack_direction
)
3171 anti_adjust_stack (GEN_INT (extra
));
3173 /* If we make space by pushing it, we might as well push
3174 the real data. Otherwise, we can leave OFFSET nonzero
3175 and leave the space uninitialized. */
3179 /* Now NOT_STACK gets the number of words that we don't need to
3180 allocate on the stack. */
3181 not_stack
= partial
- offset
;
3183 /* If the partial register-part of the arg counts in its stack size,
3184 skip the part of stack space corresponding to the registers.
3185 Otherwise, start copying to the beginning of the stack space,
3186 by setting SKIP to 0. */
3187 skip
= (reg_parm_stack_space
== 0) ? 0 : not_stack
;
3189 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
3190 x
= validize_mem (force_const_mem (mode
, x
));
3192 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3193 SUBREGs of such registers are not allowed. */
3194 if ((GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
3195 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
))
3196 x
= copy_to_reg (x
);
3198 /* Loop over all the words allocated on the stack for this arg. */
3199 /* We can do it by words, because any scalar bigger than a word
3200 has a size a multiple of a word. */
3201 #ifndef PUSH_ARGS_REVERSED
3202 for (i
= not_stack
; i
< size
; i
++)
3204 for (i
= size
- 1; i
>= not_stack
; i
--)
3206 if (i
>= not_stack
+ offset
)
3207 emit_push_insn (operand_subword_force (x
, i
, mode
),
3208 word_mode
, NULL_TREE
, NULL_RTX
, align
, 0, NULL_RTX
,
3210 GEN_INT (args_offset
+ ((i
- not_stack
+ skip
)
3212 reg_parm_stack_space
, alignment_pad
);
3217 rtx target
= NULL_RTX
;
3219 /* Push padding now if padding above and stack grows down,
3220 or if padding below and stack grows up.
3221 But if space already allocated, this has already been done. */
3222 if (extra
&& args_addr
== 0
3223 && where_pad
!= none
&& where_pad
!= stack_direction
)
3224 anti_adjust_stack (GEN_INT (extra
));
3226 #ifdef PUSH_ROUNDING
3228 addr
= gen_push_operand ();
3232 if (GET_CODE (args_so_far
) == CONST_INT
)
3234 = memory_address (mode
,
3235 plus_constant (args_addr
,
3236 INTVAL (args_so_far
)));
3238 addr
= memory_address (mode
, gen_rtx_PLUS (Pmode
, args_addr
,
3243 emit_move_insn (gen_rtx_MEM (mode
, addr
), x
);
3245 if (current_function_check_memory_usage
&& ! in_check_memory_usage
)
3247 in_check_memory_usage
= 1;
3249 target
= get_push_address (GET_MODE_SIZE (mode
));
3251 if (GET_CODE (x
) == MEM
&& type
&& AGGREGATE_TYPE_P (type
))
3252 emit_library_call (chkr_copy_bitmap_libfunc
, 1, VOIDmode
, 3,
3255 GEN_INT (GET_MODE_SIZE (mode
)),
3256 TYPE_MODE (sizetype
));
3258 emit_library_call (chkr_set_right_libfunc
, 1, VOIDmode
, 3,
3260 GEN_INT (GET_MODE_SIZE (mode
)),
3261 TYPE_MODE (sizetype
),
3262 GEN_INT (MEMORY_USE_RW
),
3263 TYPE_MODE (integer_type_node
));
3264 in_check_memory_usage
= 0;
3269 /* If part should go in registers, copy that part
3270 into the appropriate registers. Do this now, at the end,
3271 since mem-to-mem copies above may do function calls. */
3272 if (partial
> 0 && reg
!= 0)
3274 /* Handle calls that pass values in multiple non-contiguous locations.
3275 The Irix 6 ABI has examples of this. */
3276 if (GET_CODE (reg
) == PARALLEL
)
3277 emit_group_load (reg
, x
, -1, align
); /* ??? size? */
3279 move_block_to_reg (REGNO (reg
), x
, partial
, mode
);
3282 if (extra
&& args_addr
== 0 && where_pad
== stack_direction
)
3283 anti_adjust_stack (GEN_INT (extra
));
3286 anti_adjust_stack (alignment_pad
);
3289 /* Expand an assignment that stores the value of FROM into TO.
3290 If WANT_VALUE is nonzero, return an rtx for the value of TO.
3291 (This may contain a QUEUED rtx;
3292 if the value is constant, this rtx is a constant.)
3293 Otherwise, the returned value is NULL_RTX.
3295 SUGGEST_REG is no longer actually used.
3296 It used to mean, copy the value through a register
3297 and return that register, if that is possible.
3298 We now use WANT_VALUE to decide whether to do this. */
3301 expand_assignment (to
, from
, want_value
, suggest_reg
)
3304 int suggest_reg ATTRIBUTE_UNUSED
;
3306 register rtx to_rtx
= 0;
3309 /* Don't crash if the lhs of the assignment was erroneous. */
3311 if (TREE_CODE (to
) == ERROR_MARK
)
3313 result
= expand_expr (from
, NULL_RTX
, VOIDmode
, 0);
3314 return want_value
? result
: NULL_RTX
;
3317 /* Assignment of a structure component needs special treatment
3318 if the structure component's rtx is not simply a MEM.
3319 Assignment of an array element at a constant index, and assignment of
3320 an array element in an unaligned packed structure field, has the same
3323 if (TREE_CODE (to
) == COMPONENT_REF
|| TREE_CODE (to
) == BIT_FIELD_REF
3324 || TREE_CODE (to
) == ARRAY_REF
)
3326 enum machine_mode mode1
;
3336 tem
= get_inner_reference (to
, &bitsize
, &bitpos
, &offset
, &mode1
,
3337 &unsignedp
, &volatilep
, &alignment
);
3339 /* If we are going to use store_bit_field and extract_bit_field,
3340 make sure to_rtx will be safe for multiple use. */
3342 if (mode1
== VOIDmode
&& want_value
)
3343 tem
= stabilize_reference (tem
);
3345 to_rtx
= expand_expr (tem
, NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_DONT
);
3348 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, 0);
3350 if (GET_CODE (to_rtx
) != MEM
)
3353 if (GET_MODE (offset_rtx
) != ptr_mode
)
3355 #ifdef POINTERS_EXTEND_UNSIGNED
3356 offset_rtx
= convert_memory_address (ptr_mode
, offset_rtx
);
3358 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
3362 /* A constant address in TO_RTX can have VOIDmode, we must not try
3363 to call force_reg for that case. Avoid that case. */
3364 if (GET_CODE (to_rtx
) == MEM
3365 && GET_MODE (to_rtx
) == BLKmode
3366 && GET_MODE (XEXP (to_rtx
, 0)) != VOIDmode
3368 && (bitpos
% bitsize
) == 0
3369 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
3370 && (alignment
* BITS_PER_UNIT
) == GET_MODE_ALIGNMENT (mode1
))
3372 rtx temp
= change_address (to_rtx
, mode1
,
3373 plus_constant (XEXP (to_rtx
, 0),
3376 if (GET_CODE (XEXP (temp
, 0)) == REG
)
3379 to_rtx
= change_address (to_rtx
, mode1
,
3380 force_reg (GET_MODE (XEXP (temp
, 0)),
3385 to_rtx
= change_address (to_rtx
, VOIDmode
,
3386 gen_rtx_PLUS (ptr_mode
, XEXP (to_rtx
, 0),
3387 force_reg (ptr_mode
,
3393 if (GET_CODE (to_rtx
) == MEM
)
3395 /* When the offset is zero, to_rtx is the address of the
3396 structure we are storing into, and hence may be shared.
3397 We must make a new MEM before setting the volatile bit. */
3399 to_rtx
= copy_rtx (to_rtx
);
3401 MEM_VOLATILE_P (to_rtx
) = 1;
3403 #if 0 /* This was turned off because, when a field is volatile
3404 in an object which is not volatile, the object may be in a register,
3405 and then we would abort over here. */
3411 if (TREE_CODE (to
) == COMPONENT_REF
3412 && TREE_READONLY (TREE_OPERAND (to
, 1)))
3415 to_rtx
= copy_rtx (to_rtx
);
3417 RTX_UNCHANGING_P (to_rtx
) = 1;
3420 /* Check the access. */
3421 if (current_function_check_memory_usage
&& GET_CODE (to_rtx
) == MEM
)
3426 enum machine_mode best_mode
;
3428 best_mode
= get_best_mode (bitsize
, bitpos
,
3429 TYPE_ALIGN (TREE_TYPE (tem
)),
3431 if (best_mode
== VOIDmode
)
3434 best_mode_size
= GET_MODE_BITSIZE (best_mode
);
3435 to_addr
= plus_constant (XEXP (to_rtx
, 0), (bitpos
/ BITS_PER_UNIT
));
3436 size
= CEIL ((bitpos
% best_mode_size
) + bitsize
, best_mode_size
);
3437 size
*= GET_MODE_SIZE (best_mode
);
3439 /* Check the access right of the pointer. */
3441 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
3443 GEN_INT (size
), TYPE_MODE (sizetype
),
3444 GEN_INT (MEMORY_USE_WO
),
3445 TYPE_MODE (integer_type_node
));
3448 result
= store_field (to_rtx
, bitsize
, bitpos
, mode1
, from
,
3450 /* Spurious cast makes HPUX compiler happy. */
3451 ? (enum machine_mode
) TYPE_MODE (TREE_TYPE (to
))
3454 /* Required alignment of containing datum. */
3456 int_size_in_bytes (TREE_TYPE (tem
)),
3457 get_alias_set (to
));
3458 preserve_temp_slots (result
);
3462 /* If the value is meaningful, convert RESULT to the proper mode.
3463 Otherwise, return nothing. */
3464 return (want_value
? convert_modes (TYPE_MODE (TREE_TYPE (to
)),
3465 TYPE_MODE (TREE_TYPE (from
)),
3467 TREE_UNSIGNED (TREE_TYPE (to
)))
3471 /* If the rhs is a function call and its value is not an aggregate,
3472 call the function before we start to compute the lhs.
3473 This is needed for correct code for cases such as
3474 val = setjmp (buf) on machines where reference to val
3475 requires loading up part of an address in a separate insn.
3477 Don't do this if TO is a VAR_DECL whose DECL_RTL is REG since it might be
3478 a promoted variable where the zero- or sign- extension needs to be done.
3479 Handling this in the normal way is safe because no computation is done
3481 if (TREE_CODE (from
) == CALL_EXPR
&& ! aggregate_value_p (from
)
3482 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from
))) == INTEGER_CST
3483 && ! (TREE_CODE (to
) == VAR_DECL
&& GET_CODE (DECL_RTL (to
)) == REG
))
3488 value
= expand_expr (from
, NULL_RTX
, VOIDmode
, 0);
3490 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_WO
);
3492 /* Handle calls that return values in multiple non-contiguous locations.
3493 The Irix 6 ABI has examples of this. */
3494 if (GET_CODE (to_rtx
) == PARALLEL
)
3495 emit_group_load (to_rtx
, value
, int_size_in_bytes (TREE_TYPE (from
)),
3496 TYPE_ALIGN (TREE_TYPE (from
)) / BITS_PER_UNIT
);
3497 else if (GET_MODE (to_rtx
) == BLKmode
)
3498 emit_block_move (to_rtx
, value
, expr_size (from
),
3499 TYPE_ALIGN (TREE_TYPE (from
)) / BITS_PER_UNIT
);
3502 #ifdef POINTERS_EXTEND_UNSIGNED
3503 if (TREE_CODE (TREE_TYPE (to
)) == REFERENCE_TYPE
3504 || TREE_CODE (TREE_TYPE (to
)) == POINTER_TYPE
)
3505 value
= convert_memory_address (GET_MODE (to_rtx
), value
);
3507 emit_move_insn (to_rtx
, value
);
3509 preserve_temp_slots (to_rtx
);
3512 return want_value
? to_rtx
: NULL_RTX
;
3515 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3516 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3520 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_WO
);
3521 if (GET_CODE (to_rtx
) == MEM
)
3522 MEM_ALIAS_SET (to_rtx
) = get_alias_set (to
);
3525 /* Don't move directly into a return register. */
3526 if (TREE_CODE (to
) == RESULT_DECL
3527 && (GET_CODE (to_rtx
) == REG
|| GET_CODE (to_rtx
) == PARALLEL
))
3532 temp
= expand_expr (from
, 0, GET_MODE (to_rtx
), 0);
3534 if (GET_CODE (to_rtx
) == PARALLEL
)
3535 emit_group_load (to_rtx
, temp
, int_size_in_bytes (TREE_TYPE (from
)),
3536 TYPE_ALIGN (TREE_TYPE (from
)) / BITS_PER_UNIT
);
3538 emit_move_insn (to_rtx
, temp
);
3540 preserve_temp_slots (to_rtx
);
3543 return want_value
? to_rtx
: NULL_RTX
;
3546 /* In case we are returning the contents of an object which overlaps
3547 the place the value is being stored, use a safe function when copying
3548 a value through a pointer into a structure value return block. */
3549 if (TREE_CODE (to
) == RESULT_DECL
&& TREE_CODE (from
) == INDIRECT_REF
3550 && current_function_returns_struct
3551 && !current_function_returns_pcc_struct
)
3556 size
= expr_size (from
);
3557 from_rtx
= expand_expr (from
, NULL_RTX
, VOIDmode
,
3558 EXPAND_MEMORY_USE_DONT
);
3560 /* Copy the rights of the bitmap. */
3561 if (current_function_check_memory_usage
)
3562 emit_library_call (chkr_copy_bitmap_libfunc
, 1, VOIDmode
, 3,
3563 XEXP (to_rtx
, 0), Pmode
,
3564 XEXP (from_rtx
, 0), Pmode
,
3565 convert_to_mode (TYPE_MODE (sizetype
),
3566 size
, TREE_UNSIGNED (sizetype
)),
3567 TYPE_MODE (sizetype
));
3569 #ifdef TARGET_MEM_FUNCTIONS
3570 emit_library_call (memcpy_libfunc
, 0,
3571 VOIDmode
, 3, XEXP (to_rtx
, 0), Pmode
,
3572 XEXP (from_rtx
, 0), Pmode
,
3573 convert_to_mode (TYPE_MODE (sizetype
),
3574 size
, TREE_UNSIGNED (sizetype
)),
3575 TYPE_MODE (sizetype
));
3577 emit_library_call (bcopy_libfunc
, 0,
3578 VOIDmode
, 3, XEXP (from_rtx
, 0), Pmode
,
3579 XEXP (to_rtx
, 0), Pmode
,
3580 convert_to_mode (TYPE_MODE (integer_type_node
),
3581 size
, TREE_UNSIGNED (integer_type_node
)),
3582 TYPE_MODE (integer_type_node
));
3585 preserve_temp_slots (to_rtx
);
3588 return want_value
? to_rtx
: NULL_RTX
;
3591 /* Compute FROM and store the value in the rtx we got. */
3594 result
= store_expr (from
, to_rtx
, want_value
);
3595 preserve_temp_slots (result
);
3598 return want_value
? result
: NULL_RTX
;
3601 /* Generate code for computing expression EXP,
3602 and storing the value into TARGET.
3603 TARGET may contain a QUEUED rtx.
3605 If WANT_VALUE is nonzero, return a copy of the value
3606 not in TARGET, so that we can be sure to use the proper
3607 value in a containing expression even if TARGET has something
3608 else stored in it. If possible, we copy the value through a pseudo
3609 and return that pseudo. Or, if the value is constant, we try to
3610 return the constant. In some cases, we return a pseudo
3611 copied *from* TARGET.
3613 If the mode is BLKmode then we may return TARGET itself.
3614 It turns out that in BLKmode it doesn't cause a problem.
3615 because C has no operators that could combine two different
3616 assignments into the same BLKmode object with different values
3617 with no sequence point. Will other languages need this to
3620 If WANT_VALUE is 0, we return NULL, to make sure
3621 to catch quickly any cases where the caller uses the value
3622 and fails to set WANT_VALUE. */
3625 store_expr (exp
, target
, want_value
)
3627 register rtx target
;
3631 int dont_return_target
= 0;
3633 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
3635 /* Perform first part of compound expression, then assign from second
3637 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, 0);
3639 return store_expr (TREE_OPERAND (exp
, 1), target
, want_value
);
3641 else if (TREE_CODE (exp
) == COND_EXPR
&& GET_MODE (target
) == BLKmode
)
3643 /* For conditional expression, get safe form of the target. Then
3644 test the condition, doing the appropriate assignment on either
3645 side. This avoids the creation of unnecessary temporaries.
3646 For non-BLKmode, it is more efficient not to do this. */
3648 rtx lab1
= gen_label_rtx (), lab2
= gen_label_rtx ();
3651 target
= protect_from_queue (target
, 1);
3653 do_pending_stack_adjust ();
3655 jumpifnot (TREE_OPERAND (exp
, 0), lab1
);
3656 start_cleanup_deferral ();
3657 store_expr (TREE_OPERAND (exp
, 1), target
, 0);
3658 end_cleanup_deferral ();
3660 emit_jump_insn (gen_jump (lab2
));
3663 start_cleanup_deferral ();
3664 store_expr (TREE_OPERAND (exp
, 2), target
, 0);
3665 end_cleanup_deferral ();
3670 return want_value
? target
: NULL_RTX
;
3672 else if (queued_subexp_p (target
))
3673 /* If target contains a postincrement, let's not risk
3674 using it as the place to generate the rhs. */
3676 if (GET_MODE (target
) != BLKmode
&& GET_MODE (target
) != VOIDmode
)
3678 /* Expand EXP into a new pseudo. */
3679 temp
= gen_reg_rtx (GET_MODE (target
));
3680 temp
= expand_expr (exp
, temp
, GET_MODE (target
), 0);
3683 temp
= expand_expr (exp
, NULL_RTX
, GET_MODE (target
), 0);
3685 /* If target is volatile, ANSI requires accessing the value
3686 *from* the target, if it is accessed. So make that happen.
3687 In no case return the target itself. */
3688 if (! MEM_VOLATILE_P (target
) && want_value
)
3689 dont_return_target
= 1;
3691 else if (want_value
&& GET_CODE (target
) == MEM
&& ! MEM_VOLATILE_P (target
)
3692 && GET_MODE (target
) != BLKmode
)
3693 /* If target is in memory and caller wants value in a register instead,
3694 arrange that. Pass TARGET as target for expand_expr so that,
3695 if EXP is another assignment, WANT_VALUE will be nonzero for it.
3696 We know expand_expr will not use the target in that case.
3697 Don't do this if TARGET is volatile because we are supposed
3698 to write it and then read it. */
3700 temp
= expand_expr (exp
, target
, GET_MODE (target
), 0);
3701 if (GET_MODE (temp
) != BLKmode
&& GET_MODE (temp
) != VOIDmode
)
3702 temp
= copy_to_reg (temp
);
3703 dont_return_target
= 1;
3705 else if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
3706 /* If this is an scalar in a register that is stored in a wider mode
3707 than the declared mode, compute the result into its declared mode
3708 and then convert to the wider mode. Our value is the computed
3711 /* If we don't want a value, we can do the conversion inside EXP,
3712 which will often result in some optimizations. Do the conversion
3713 in two steps: first change the signedness, if needed, then
3714 the extend. But don't do this if the type of EXP is a subtype
3715 of something else since then the conversion might involve
3716 more than just converting modes. */
3717 if (! want_value
&& INTEGRAL_TYPE_P (TREE_TYPE (exp
))
3718 && TREE_TYPE (TREE_TYPE (exp
)) == 0)
3720 if (TREE_UNSIGNED (TREE_TYPE (exp
))
3721 != SUBREG_PROMOTED_UNSIGNED_P (target
))
3724 (signed_or_unsigned_type (SUBREG_PROMOTED_UNSIGNED_P (target
),
3728 exp
= convert (type_for_mode (GET_MODE (SUBREG_REG (target
)),
3729 SUBREG_PROMOTED_UNSIGNED_P (target
)),
3733 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, 0);
3735 /* If TEMP is a volatile MEM and we want a result value, make
3736 the access now so it gets done only once. Likewise if
3737 it contains TARGET. */
3738 if (GET_CODE (temp
) == MEM
&& want_value
3739 && (MEM_VOLATILE_P (temp
)
3740 || reg_mentioned_p (SUBREG_REG (target
), XEXP (temp
, 0))))
3741 temp
= copy_to_reg (temp
);
3743 /* If TEMP is a VOIDmode constant, use convert_modes to make
3744 sure that we properly convert it. */
3745 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
3746 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
3747 TYPE_MODE (TREE_TYPE (exp
)), temp
,
3748 SUBREG_PROMOTED_UNSIGNED_P (target
));
3750 convert_move (SUBREG_REG (target
), temp
,
3751 SUBREG_PROMOTED_UNSIGNED_P (target
));
3753 /* If we promoted a constant, change the mode back down to match
3754 target. Otherwise, the caller might get confused by a result whose
3755 mode is larger than expected. */
3757 if (want_value
&& GET_MODE (temp
) != GET_MODE (target
)
3758 && GET_MODE (temp
) != VOIDmode
)
3760 temp
= gen_rtx_SUBREG (GET_MODE (target
), temp
, 0);
3761 SUBREG_PROMOTED_VAR_P (temp
) = 1;
3762 SUBREG_PROMOTED_UNSIGNED_P (temp
)
3763 = SUBREG_PROMOTED_UNSIGNED_P (target
);
3766 return want_value
? temp
: NULL_RTX
;
3770 temp
= expand_expr (exp
, target
, GET_MODE (target
), 0);
3771 /* Return TARGET if it's a specified hardware register.
3772 If TARGET is a volatile mem ref, either return TARGET
3773 or return a reg copied *from* TARGET; ANSI requires this.
3775 Otherwise, if TEMP is not TARGET, return TEMP
3776 if it is constant (for efficiency),
3777 or if we really want the correct value. */
3778 if (!(target
&& GET_CODE (target
) == REG
3779 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
3780 && !(GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
))
3781 && ! rtx_equal_p (temp
, target
)
3782 && (CONSTANT_P (temp
) || want_value
))
3783 dont_return_target
= 1;
3786 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
3787 the same as that of TARGET, adjust the constant. This is needed, for
3788 example, in case it is a CONST_DOUBLE and we want only a word-sized
3790 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
3791 && TREE_CODE (exp
) != ERROR_MARK
3792 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
3793 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
3794 temp
, TREE_UNSIGNED (TREE_TYPE (exp
)));
3796 if (current_function_check_memory_usage
3797 && GET_CODE (target
) == MEM
3798 && AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
3800 if (GET_CODE (temp
) == MEM
)
3801 emit_library_call (chkr_copy_bitmap_libfunc
, 1, VOIDmode
, 3,
3802 XEXP (target
, 0), Pmode
,
3803 XEXP (temp
, 0), Pmode
,
3804 expr_size (exp
), TYPE_MODE (sizetype
));
3806 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
3807 XEXP (target
, 0), Pmode
,
3808 expr_size (exp
), TYPE_MODE (sizetype
),
3809 GEN_INT (MEMORY_USE_WO
),
3810 TYPE_MODE (integer_type_node
));
3813 /* If value was not generated in the target, store it there.
3814 Convert the value to TARGET's type first if nec. */
3815 /* If TEMP and TARGET compare equal according to rtx_equal_p, but
3816 one or both of them are volatile memory refs, we have to distinguish
3818 - expand_expr has used TARGET. In this case, we must not generate
3819 another copy. This can be detected by TARGET being equal according
3821 - expand_expr has not used TARGET - that means that the source just
3822 happens to have the same RTX form. Since temp will have been created
3823 by expand_expr, it will compare unequal according to == .
3824 We must generate a copy in this case, to reach the correct number
3825 of volatile memory references. */
3827 if ((! rtx_equal_p (temp
, target
)
3828 || (temp
!= target
&& (side_effects_p (temp
)
3829 || side_effects_p (target
))))
3830 && TREE_CODE (exp
) != ERROR_MARK
)
3832 target
= protect_from_queue (target
, 1);
3833 if (GET_MODE (temp
) != GET_MODE (target
)
3834 && GET_MODE (temp
) != VOIDmode
)
3836 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (exp
));
3837 if (dont_return_target
)
3839 /* In this case, we will return TEMP,
3840 so make sure it has the proper mode.
3841 But don't forget to store the value into TARGET. */
3842 temp
= convert_to_mode (GET_MODE (target
), temp
, unsignedp
);
3843 emit_move_insn (target
, temp
);
3846 convert_move (target
, temp
, unsignedp
);
3849 else if (GET_MODE (temp
) == BLKmode
&& TREE_CODE (exp
) == STRING_CST
)
3851 /* Handle copying a string constant into an array.
3852 The string constant may be shorter than the array.
3853 So copy just the string's actual length, and clear the rest. */
3857 /* Get the size of the data type of the string,
3858 which is actually the size of the target. */
3859 size
= expr_size (exp
);
3860 if (GET_CODE (size
) == CONST_INT
3861 && INTVAL (size
) < TREE_STRING_LENGTH (exp
))
3862 emit_block_move (target
, temp
, size
,
3863 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
3866 /* Compute the size of the data to copy from the string. */
3868 = size_binop (MIN_EXPR
,
3869 make_tree (sizetype
, size
),
3871 build_int_2 (TREE_STRING_LENGTH (exp
), 0)));
3872 rtx copy_size_rtx
= expand_expr (copy_size
, NULL_RTX
,
3876 /* Copy that much. */
3877 emit_block_move (target
, temp
, copy_size_rtx
,
3878 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
3880 /* Figure out how much is left in TARGET that we have to clear.
3881 Do all calculations in ptr_mode. */
3883 addr
= XEXP (target
, 0);
3884 addr
= convert_modes (ptr_mode
, Pmode
, addr
, 1);
3886 if (GET_CODE (copy_size_rtx
) == CONST_INT
)
3888 addr
= plus_constant (addr
, TREE_STRING_LENGTH (exp
));
3889 size
= plus_constant (size
, - TREE_STRING_LENGTH (exp
));
3893 addr
= force_reg (ptr_mode
, addr
);
3894 addr
= expand_binop (ptr_mode
, add_optab
, addr
,
3895 copy_size_rtx
, NULL_RTX
, 0,
3898 size
= expand_binop (ptr_mode
, sub_optab
, size
,
3899 copy_size_rtx
, NULL_RTX
, 0,
3902 label
= gen_label_rtx ();
3903 emit_cmp_and_jump_insns (size
, const0_rtx
, LT
, NULL_RTX
,
3904 GET_MODE (size
), 0, 0, label
);
3907 if (size
!= const0_rtx
)
3909 /* Be sure we can write on ADDR. */
3910 if (current_function_check_memory_usage
)
3911 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
3913 size
, TYPE_MODE (sizetype
),
3914 GEN_INT (MEMORY_USE_WO
),
3915 TYPE_MODE (integer_type_node
));
3916 #ifdef TARGET_MEM_FUNCTIONS
3917 emit_library_call (memset_libfunc
, 0, VOIDmode
, 3,
3919 const0_rtx
, TYPE_MODE (integer_type_node
),
3920 convert_to_mode (TYPE_MODE (sizetype
),
3922 TREE_UNSIGNED (sizetype
)),
3923 TYPE_MODE (sizetype
));
3925 emit_library_call (bzero_libfunc
, 0, VOIDmode
, 2,
3927 convert_to_mode (TYPE_MODE (integer_type_node
),
3929 TREE_UNSIGNED (integer_type_node
)),
3930 TYPE_MODE (integer_type_node
));
3938 /* Handle calls that return values in multiple non-contiguous locations.
3939 The Irix 6 ABI has examples of this. */
3940 else if (GET_CODE (target
) == PARALLEL
)
3941 emit_group_load (target
, temp
, int_size_in_bytes (TREE_TYPE (exp
)),
3942 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
3943 else if (GET_MODE (temp
) == BLKmode
)
3944 emit_block_move (target
, temp
, expr_size (exp
),
3945 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
3947 emit_move_insn (target
, temp
);
3950 /* If we don't want a value, return NULL_RTX. */
3954 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
3955 ??? The latter test doesn't seem to make sense. */
3956 else if (dont_return_target
&& GET_CODE (temp
) != MEM
)
3959 /* Return TARGET itself if it is a hard register. */
3960 else if (want_value
&& GET_MODE (target
) != BLKmode
3961 && ! (GET_CODE (target
) == REG
3962 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
3963 return copy_to_reg (target
);
3969 /* Return 1 if EXP just contains zeros. */
3977 switch (TREE_CODE (exp
))
3981 case NON_LVALUE_EXPR
:
3982 return is_zeros_p (TREE_OPERAND (exp
, 0));
3985 return TREE_INT_CST_LOW (exp
) == 0 && TREE_INT_CST_HIGH (exp
) == 0;
3989 is_zeros_p (TREE_REALPART (exp
)) && is_zeros_p (TREE_IMAGPART (exp
));
3992 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp
), dconst0
);
3995 if (TREE_TYPE (exp
) && TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
3996 return CONSTRUCTOR_ELTS (exp
) == NULL_TREE
;
3997 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
3998 if (! is_zeros_p (TREE_VALUE (elt
)))
4008 /* Return 1 if EXP contains mostly (3/4) zeros. */
4011 mostly_zeros_p (exp
)
4014 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4016 int elts
= 0, zeros
= 0;
4017 tree elt
= CONSTRUCTOR_ELTS (exp
);
4018 if (TREE_TYPE (exp
) && TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
4020 /* If there are no ranges of true bits, it is all zero. */
4021 return elt
== NULL_TREE
;
4023 for (; elt
; elt
= TREE_CHAIN (elt
))
4025 /* We do not handle the case where the index is a RANGE_EXPR,
4026 so the statistic will be somewhat inaccurate.
4027 We do make a more accurate count in store_constructor itself,
4028 so since this function is only used for nested array elements,
4029 this should be close enough. */
4030 if (mostly_zeros_p (TREE_VALUE (elt
)))
4035 return 4 * zeros
>= 3 * elts
;
4038 return is_zeros_p (exp
);
4041 /* Helper function for store_constructor.
4042 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4043 TYPE is the type of the CONSTRUCTOR, not the element type.
4044 ALIGN and CLEARED are as for store_constructor.
4046 This provides a recursive shortcut back to store_constructor when it isn't
4047 necessary to go through store_field. This is so that we can pass through
4048 the cleared field to let store_constructor know that we may not have to
4049 clear a substructure if the outer structure has already been cleared. */
4052 store_constructor_field (target
, bitsize
, bitpos
,
4053 mode
, exp
, type
, align
, cleared
)
4055 int bitsize
, bitpos
;
4056 enum machine_mode mode
;
4061 if (TREE_CODE (exp
) == CONSTRUCTOR
4062 && bitpos
% BITS_PER_UNIT
== 0
4063 /* If we have a non-zero bitpos for a register target, then we just
4064 let store_field do the bitfield handling. This is unlikely to
4065 generate unnecessary clear instructions anyways. */
4066 && (bitpos
== 0 || GET_CODE (target
) == MEM
))
4070 = change_address (target
,
4071 GET_MODE (target
) == BLKmode
4073 % GET_MODE_ALIGNMENT (GET_MODE (target
)))
4074 ? BLKmode
: VOIDmode
,
4075 plus_constant (XEXP (target
, 0),
4076 bitpos
/ BITS_PER_UNIT
));
4077 store_constructor (exp
, target
, align
, cleared
);
4080 store_field (target
, bitsize
, bitpos
, mode
, exp
, VOIDmode
, 0,
4081 (align
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
,
4082 int_size_in_bytes (type
), cleared
);
4085 /* Store the value of constructor EXP into the rtx TARGET.
4086 TARGET is either a REG or a MEM.
4087 ALIGN is the maximum known alignment for TARGET, in bits.
4088 CLEARED is true if TARGET is known to have been zero'd. */
4091 store_constructor (exp
, target
, align
, cleared
)
4097 tree type
= TREE_TYPE (exp
);
4098 #ifdef WORD_REGISTER_OPERATIONS
4099 rtx exp_size
= expr_size (exp
);
4102 /* We know our target cannot conflict, since safe_from_p has been called. */
4104 /* Don't try copying piece by piece into a hard register
4105 since that is vulnerable to being clobbered by EXP.
4106 Instead, construct in a pseudo register and then copy it all. */
4107 if (GET_CODE (target
) == REG
&& REGNO (target
) < FIRST_PSEUDO_REGISTER
)
4109 rtx temp
= gen_reg_rtx (GET_MODE (target
));
4110 store_constructor (exp
, temp
, 0);
4111 emit_move_insn (target
, temp
);
4116 if (TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4117 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4121 /* Inform later passes that the whole union value is dead. */
4122 if ((TREE_CODE (type
) == UNION_TYPE
4123 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4126 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
4128 /* If the constructor is empty, clear the union. */
4129 if (! CONSTRUCTOR_ELTS (exp
) && ! cleared
)
4130 clear_storage (target
, expr_size (exp
),
4131 TYPE_ALIGN (type
) / BITS_PER_UNIT
);
4134 /* If we are building a static constructor into a register,
4135 set the initial value as zero so we can fold the value into
4136 a constant. But if more than one register is involved,
4137 this probably loses. */
4138 else if (GET_CODE (target
) == REG
&& TREE_STATIC (exp
)
4139 && GET_MODE_SIZE (GET_MODE (target
)) <= UNITS_PER_WORD
)
4142 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
4147 /* If the constructor has fewer fields than the structure
4148 or if we are initializing the structure to mostly zeros,
4149 clear the whole structure first. */
4150 else if ((list_length (CONSTRUCTOR_ELTS (exp
))
4151 != list_length (TYPE_FIELDS (type
)))
4152 || mostly_zeros_p (exp
))
4155 clear_storage (target
, expr_size (exp
),
4156 (align
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
);
4161 /* Inform later passes that the old value is dead. */
4162 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
4164 /* Store each element of the constructor into
4165 the corresponding field of TARGET. */
4167 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
4169 register tree field
= TREE_PURPOSE (elt
);
4170 #ifdef WORD_REGISTER_OPERATIONS
4171 tree value
= TREE_VALUE (elt
);
4173 register enum machine_mode mode
;
4177 tree pos
, constant
= 0, offset
= 0;
4178 rtx to_rtx
= target
;
4180 /* Just ignore missing fields.
4181 We cleared the whole structure, above,
4182 if any fields are missing. */
4186 if (cleared
&& is_zeros_p (TREE_VALUE (elt
)))
4189 if (TREE_CODE (DECL_SIZE (field
)) == INTEGER_CST
)
4190 bitsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
4194 unsignedp
= TREE_UNSIGNED (field
);
4195 mode
= DECL_MODE (field
);
4196 if (DECL_BIT_FIELD (field
))
4199 pos
= DECL_FIELD_BITPOS (field
);
4200 if (TREE_CODE (pos
) == INTEGER_CST
)
4202 else if (TREE_CODE (pos
) == PLUS_EXPR
4203 && TREE_CODE (TREE_OPERAND (pos
, 1)) == INTEGER_CST
)
4204 constant
= TREE_OPERAND (pos
, 1), offset
= TREE_OPERAND (pos
, 0);
4209 bitpos
= TREE_INT_CST_LOW (constant
);
4215 if (contains_placeholder_p (offset
))
4216 offset
= build (WITH_RECORD_EXPR
, sizetype
,
4217 offset
, make_tree (TREE_TYPE (exp
), target
));
4219 offset
= size_binop (EXACT_DIV_EXPR
, offset
,
4220 size_int (BITS_PER_UNIT
));
4222 offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, 0);
4223 if (GET_CODE (to_rtx
) != MEM
)
4226 if (GET_MODE (offset_rtx
) != ptr_mode
)
4228 #ifdef POINTERS_EXTEND_UNSIGNED
4229 offset_rtx
= convert_memory_address (ptr_mode
, offset_rtx
);
4231 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
4236 = change_address (to_rtx
, VOIDmode
,
4237 gen_rtx_PLUS (ptr_mode
, XEXP (to_rtx
, 0),
4238 force_reg (ptr_mode
,
4242 if (TREE_READONLY (field
))
4244 if (GET_CODE (to_rtx
) == MEM
)
4245 to_rtx
= copy_rtx (to_rtx
);
4247 RTX_UNCHANGING_P (to_rtx
) = 1;
4250 #ifdef WORD_REGISTER_OPERATIONS
4251 /* If this initializes a field that is smaller than a word, at the
4252 start of a word, try to widen it to a full word.
4253 This special case allows us to output C++ member function
4254 initializations in a form that the optimizers can understand. */
4256 && GET_CODE (target
) == REG
4257 && bitsize
< BITS_PER_WORD
4258 && bitpos
% BITS_PER_WORD
== 0
4259 && GET_MODE_CLASS (mode
) == MODE_INT
4260 && TREE_CODE (value
) == INTEGER_CST
4261 && GET_CODE (exp_size
) == CONST_INT
4262 && bitpos
+ BITS_PER_WORD
<= INTVAL (exp_size
) * BITS_PER_UNIT
)
4264 tree type
= TREE_TYPE (value
);
4265 if (TYPE_PRECISION (type
) < BITS_PER_WORD
)
4267 type
= type_for_size (BITS_PER_WORD
, TREE_UNSIGNED (type
));
4268 value
= convert (type
, value
);
4270 if (BYTES_BIG_ENDIAN
)
4272 = fold (build (LSHIFT_EXPR
, type
, value
,
4273 build_int_2 (BITS_PER_WORD
- bitsize
, 0)));
4274 bitsize
= BITS_PER_WORD
;
4278 store_constructor_field (to_rtx
, bitsize
, bitpos
, mode
,
4279 TREE_VALUE (elt
), type
,
4281 DECL_ALIGN (TREE_PURPOSE (elt
))),
4285 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4290 tree domain
= TYPE_DOMAIN (type
);
4291 HOST_WIDE_INT minelt
= TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain
));
4292 HOST_WIDE_INT maxelt
= TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain
));
4293 tree elttype
= TREE_TYPE (type
);
4295 /* If the constructor has fewer elements than the array,
4296 clear the whole array first. Similarly if this is
4297 static constructor of a non-BLKmode object. */
4298 if (cleared
|| (GET_CODE (target
) == REG
&& TREE_STATIC (exp
)))
4302 HOST_WIDE_INT count
= 0, zero_count
= 0;
4304 /* This loop is a more accurate version of the loop in
4305 mostly_zeros_p (it handles RANGE_EXPR in an index).
4306 It is also needed to check for missing elements. */
4307 for (elt
= CONSTRUCTOR_ELTS (exp
);
4309 elt
= TREE_CHAIN (elt
))
4311 tree index
= TREE_PURPOSE (elt
);
4312 HOST_WIDE_INT this_node_count
;
4313 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
4315 tree lo_index
= TREE_OPERAND (index
, 0);
4316 tree hi_index
= TREE_OPERAND (index
, 1);
4317 if (TREE_CODE (lo_index
) != INTEGER_CST
4318 || TREE_CODE (hi_index
) != INTEGER_CST
)
4323 this_node_count
= TREE_INT_CST_LOW (hi_index
)
4324 - TREE_INT_CST_LOW (lo_index
) + 1;
4327 this_node_count
= 1;
4328 count
+= this_node_count
;
4329 if (mostly_zeros_p (TREE_VALUE (elt
)))
4330 zero_count
+= this_node_count
;
4332 /* Clear the entire array first if there are any missing elements,
4333 or if the incidence of zero elements is >= 75%. */
4334 if (count
< maxelt
- minelt
+ 1
4335 || 4 * zero_count
>= 3 * count
)
4341 clear_storage (target
, expr_size (exp
),
4342 (align
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
);
4346 /* Inform later passes that the old value is dead. */
4347 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
4349 /* Store each element of the constructor into
4350 the corresponding element of TARGET, determined
4351 by counting the elements. */
4352 for (elt
= CONSTRUCTOR_ELTS (exp
), i
= 0;
4354 elt
= TREE_CHAIN (elt
), i
++)
4356 register enum machine_mode mode
;
4360 tree value
= TREE_VALUE (elt
);
4361 int align
= TYPE_ALIGN (TREE_TYPE (value
));
4362 tree index
= TREE_PURPOSE (elt
);
4363 rtx xtarget
= target
;
4365 if (cleared
&& is_zeros_p (value
))
4368 unsignedp
= TREE_UNSIGNED (elttype
);
4369 mode
= TYPE_MODE (elttype
);
4370 if (mode
== BLKmode
)
4372 if (TREE_CODE (TYPE_SIZE (elttype
)) == INTEGER_CST
4373 && TREE_INT_CST_HIGH (TYPE_SIZE (elttype
)) == 0)
4374 bitsize
= TREE_INT_CST_LOW (TYPE_SIZE (elttype
));
4379 bitsize
= GET_MODE_BITSIZE (mode
);
4381 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
4383 tree lo_index
= TREE_OPERAND (index
, 0);
4384 tree hi_index
= TREE_OPERAND (index
, 1);
4385 rtx index_r
, pos_rtx
, addr
, hi_r
, loop_top
, loop_end
;
4386 struct nesting
*loop
;
4387 HOST_WIDE_INT lo
, hi
, count
;
4390 /* If the range is constant and "small", unroll the loop. */
4391 if (TREE_CODE (lo_index
) == INTEGER_CST
4392 && TREE_CODE (hi_index
) == INTEGER_CST
4393 && (lo
= TREE_INT_CST_LOW (lo_index
),
4394 hi
= TREE_INT_CST_LOW (hi_index
),
4395 count
= hi
- lo
+ 1,
4396 (GET_CODE (target
) != MEM
4398 || (TREE_CODE (TYPE_SIZE (elttype
)) == INTEGER_CST
4399 && TREE_INT_CST_LOW (TYPE_SIZE (elttype
)) * count
4402 lo
-= minelt
; hi
-= minelt
;
4403 for (; lo
<= hi
; lo
++)
4405 bitpos
= lo
* TREE_INT_CST_LOW (TYPE_SIZE (elttype
));
4406 store_constructor_field (target
, bitsize
, bitpos
, mode
,
4407 value
, type
, align
, cleared
);
4412 hi_r
= expand_expr (hi_index
, NULL_RTX
, VOIDmode
, 0);
4413 loop_top
= gen_label_rtx ();
4414 loop_end
= gen_label_rtx ();
4416 unsignedp
= TREE_UNSIGNED (domain
);
4418 index
= build_decl (VAR_DECL
, NULL_TREE
, domain
);
4420 DECL_RTL (index
) = index_r
4421 = gen_reg_rtx (promote_mode (domain
, DECL_MODE (index
),
4424 if (TREE_CODE (value
) == SAVE_EXPR
4425 && SAVE_EXPR_RTL (value
) == 0)
4427 /* Make sure value gets expanded once before the
4429 expand_expr (value
, const0_rtx
, VOIDmode
, 0);
4432 store_expr (lo_index
, index_r
, 0);
4433 loop
= expand_start_loop (0);
4435 /* Assign value to element index. */
4436 position
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE (elttype
),
4437 size_int (BITS_PER_UNIT
));
4438 position
= size_binop (MULT_EXPR
,
4439 size_binop (MINUS_EXPR
, index
,
4440 TYPE_MIN_VALUE (domain
)),
4442 pos_rtx
= expand_expr (position
, 0, VOIDmode
, 0);
4443 addr
= gen_rtx_PLUS (Pmode
, XEXP (target
, 0), pos_rtx
);
4444 xtarget
= change_address (target
, mode
, addr
);
4445 if (TREE_CODE (value
) == CONSTRUCTOR
)
4446 store_constructor (value
, xtarget
, align
, cleared
);
4448 store_expr (value
, xtarget
, 0);
4450 expand_exit_loop_if_false (loop
,
4451 build (LT_EXPR
, integer_type_node
,
4454 expand_increment (build (PREINCREMENT_EXPR
,
4456 index
, integer_one_node
), 0, 0);
4458 emit_label (loop_end
);
4460 /* Needed by stupid register allocation. to extend the
4461 lifetime of pseudo-regs used by target past the end
4463 emit_insn (gen_rtx_USE (GET_MODE (target
), target
));
4466 else if ((index
!= 0 && TREE_CODE (index
) != INTEGER_CST
)
4467 || TREE_CODE (TYPE_SIZE (elttype
)) != INTEGER_CST
)
4473 index
= size_int (i
);
4476 index
= size_binop (MINUS_EXPR
, index
,
4477 TYPE_MIN_VALUE (domain
));
4478 position
= size_binop (EXACT_DIV_EXPR
, TYPE_SIZE (elttype
),
4479 size_int (BITS_PER_UNIT
));
4480 position
= size_binop (MULT_EXPR
, index
, position
);
4481 pos_rtx
= expand_expr (position
, 0, VOIDmode
, 0);
4482 addr
= gen_rtx_PLUS (Pmode
, XEXP (target
, 0), pos_rtx
);
4483 xtarget
= change_address (target
, mode
, addr
);
4484 store_expr (value
, xtarget
, 0);
4489 bitpos
= ((TREE_INT_CST_LOW (index
) - minelt
)
4490 * TREE_INT_CST_LOW (TYPE_SIZE (elttype
)));
4492 bitpos
= (i
* TREE_INT_CST_LOW (TYPE_SIZE (elttype
)));
4493 store_constructor_field (target
, bitsize
, bitpos
, mode
, value
,
4494 type
, align
, cleared
);
4498 /* set constructor assignments */
4499 else if (TREE_CODE (type
) == SET_TYPE
)
4501 tree elt
= CONSTRUCTOR_ELTS (exp
);
4502 int nbytes
= int_size_in_bytes (type
), nbits
;
4503 tree domain
= TYPE_DOMAIN (type
);
4504 tree domain_min
, domain_max
, bitlength
;
4506 /* The default implementation strategy is to extract the constant
4507 parts of the constructor, use that to initialize the target,
4508 and then "or" in whatever non-constant ranges we need in addition.
4510 If a large set is all zero or all ones, it is
4511 probably better to set it using memset (if available) or bzero.
4512 Also, if a large set has just a single range, it may also be
4513 better to first clear all the first clear the set (using
4514 bzero/memset), and set the bits we want. */
4516 /* Check for all zeros. */
4517 if (elt
== NULL_TREE
)
4520 clear_storage (target
, expr_size (exp
),
4521 TYPE_ALIGN (type
) / BITS_PER_UNIT
);
4525 domain_min
= convert (sizetype
, TYPE_MIN_VALUE (domain
));
4526 domain_max
= convert (sizetype
, TYPE_MAX_VALUE (domain
));
4527 bitlength
= size_binop (PLUS_EXPR
,
4528 size_binop (MINUS_EXPR
, domain_max
, domain_min
),
4531 if (nbytes
< 0 || TREE_CODE (bitlength
) != INTEGER_CST
)
4533 nbits
= TREE_INT_CST_LOW (bitlength
);
4535 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
4536 are "complicated" (more than one range), initialize (the
4537 constant parts) by copying from a constant. */
4538 if (GET_MODE (target
) != BLKmode
|| nbits
<= 2 * BITS_PER_WORD
4539 || (nbytes
<= 32 && TREE_CHAIN (elt
) != NULL_TREE
))
4541 int set_word_size
= TYPE_ALIGN (TREE_TYPE (exp
));
4542 enum machine_mode mode
= mode_for_size (set_word_size
, MODE_INT
, 1);
4543 char *bit_buffer
= (char *) alloca (nbits
);
4544 HOST_WIDE_INT word
= 0;
4547 int offset
= 0; /* In bytes from beginning of set. */
4548 elt
= get_set_constructor_bits (exp
, bit_buffer
, nbits
);
4551 if (bit_buffer
[ibit
])
4553 if (BYTES_BIG_ENDIAN
)
4554 word
|= (1 << (set_word_size
- 1 - bit_pos
));
4556 word
|= 1 << bit_pos
;
4559 if (bit_pos
>= set_word_size
|| ibit
== nbits
)
4561 if (word
!= 0 || ! cleared
)
4563 rtx datum
= GEN_INT (word
);
4565 /* The assumption here is that it is safe to use
4566 XEXP if the set is multi-word, but not if
4567 it's single-word. */
4568 if (GET_CODE (target
) == MEM
)
4570 to_rtx
= plus_constant (XEXP (target
, 0), offset
);
4571 to_rtx
= change_address (target
, mode
, to_rtx
);
4573 else if (offset
== 0)
4577 emit_move_insn (to_rtx
, datum
);
4583 offset
+= set_word_size
/ BITS_PER_UNIT
;
4589 /* Don't bother clearing storage if the set is all ones. */
4590 if (TREE_CHAIN (elt
) != NULL_TREE
4591 || (TREE_PURPOSE (elt
) == NULL_TREE
4593 : (TREE_CODE (TREE_VALUE (elt
)) != INTEGER_CST
4594 || TREE_CODE (TREE_PURPOSE (elt
)) != INTEGER_CST
4595 || (TREE_INT_CST_LOW (TREE_VALUE (elt
))
4596 - TREE_INT_CST_LOW (TREE_PURPOSE (elt
)) + 1
4598 clear_storage (target
, expr_size (exp
),
4599 TYPE_ALIGN (type
) / BITS_PER_UNIT
);
4602 for (; elt
!= NULL_TREE
; elt
= TREE_CHAIN (elt
))
4604 /* start of range of element or NULL */
4605 tree startbit
= TREE_PURPOSE (elt
);
4606 /* end of range of element, or element value */
4607 tree endbit
= TREE_VALUE (elt
);
4608 #ifdef TARGET_MEM_FUNCTIONS
4609 HOST_WIDE_INT startb
, endb
;
4611 rtx bitlength_rtx
, startbit_rtx
, endbit_rtx
, targetx
;
4613 bitlength_rtx
= expand_expr (bitlength
,
4614 NULL_RTX
, MEM
, EXPAND_CONST_ADDRESS
);
4616 /* handle non-range tuple element like [ expr ] */
4617 if (startbit
== NULL_TREE
)
4619 startbit
= save_expr (endbit
);
4622 startbit
= convert (sizetype
, startbit
);
4623 endbit
= convert (sizetype
, endbit
);
4624 if (! integer_zerop (domain_min
))
4626 startbit
= size_binop (MINUS_EXPR
, startbit
, domain_min
);
4627 endbit
= size_binop (MINUS_EXPR
, endbit
, domain_min
);
4629 startbit_rtx
= expand_expr (startbit
, NULL_RTX
, MEM
,
4630 EXPAND_CONST_ADDRESS
);
4631 endbit_rtx
= expand_expr (endbit
, NULL_RTX
, MEM
,
4632 EXPAND_CONST_ADDRESS
);
4636 targetx
= assign_stack_temp (GET_MODE (target
),
4637 GET_MODE_SIZE (GET_MODE (target
)),
4639 emit_move_insn (targetx
, target
);
4641 else if (GET_CODE (target
) == MEM
)
4646 #ifdef TARGET_MEM_FUNCTIONS
4647 /* Optimization: If startbit and endbit are
4648 constants divisible by BITS_PER_UNIT,
4649 call memset instead. */
4650 if (TREE_CODE (startbit
) == INTEGER_CST
4651 && TREE_CODE (endbit
) == INTEGER_CST
4652 && (startb
= TREE_INT_CST_LOW (startbit
)) % BITS_PER_UNIT
== 0
4653 && (endb
= TREE_INT_CST_LOW (endbit
) + 1) % BITS_PER_UNIT
== 0)
4655 emit_library_call (memset_libfunc
, 0,
4657 plus_constant (XEXP (targetx
, 0),
4658 startb
/ BITS_PER_UNIT
),
4660 constm1_rtx
, TYPE_MODE (integer_type_node
),
4661 GEN_INT ((endb
- startb
) / BITS_PER_UNIT
),
4662 TYPE_MODE (sizetype
));
4667 emit_library_call (gen_rtx_SYMBOL_REF (Pmode
, "__setbits"),
4668 0, VOIDmode
, 4, XEXP (targetx
, 0), Pmode
,
4669 bitlength_rtx
, TYPE_MODE (sizetype
),
4670 startbit_rtx
, TYPE_MODE (sizetype
),
4671 endbit_rtx
, TYPE_MODE (sizetype
));
4674 emit_move_insn (target
, targetx
);
4682 /* Store the value of EXP (an expression tree)
4683 into a subfield of TARGET which has mode MODE and occupies
4684 BITSIZE bits, starting BITPOS bits from the start of TARGET.
4685 If MODE is VOIDmode, it means that we are storing into a bit-field.
4687 If VALUE_MODE is VOIDmode, return nothing in particular.
4688 UNSIGNEDP is not used in this case.
4690 Otherwise, return an rtx for the value stored. This rtx
4691 has mode VALUE_MODE if that is convenient to do.
4692 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
4694 ALIGN is the alignment that TARGET is known to have, measured in bytes.
4695 TOTAL_SIZE is the size in bytes of the structure, or -1 if varying.
4697 ALIAS_SET is the alias set for the destination. This value will
4698 (in general) be different from that for TARGET, since TARGET is a
4699 reference to the containing structure. */
4702 store_field (target
, bitsize
, bitpos
, mode
, exp
, value_mode
,
4703 unsignedp
, align
, total_size
, alias_set
)
4705 int bitsize
, bitpos
;
4706 enum machine_mode mode
;
4708 enum machine_mode value_mode
;
4714 HOST_WIDE_INT width_mask
= 0;
4716 if (TREE_CODE (exp
) == ERROR_MARK
)
4719 if (bitsize
< HOST_BITS_PER_WIDE_INT
)
4720 width_mask
= ((HOST_WIDE_INT
) 1 << bitsize
) - 1;
4722 /* If we are storing into an unaligned field of an aligned union that is
4723 in a register, we may have the mode of TARGET being an integer mode but
4724 MODE == BLKmode. In that case, get an aligned object whose size and
4725 alignment are the same as TARGET and store TARGET into it (we can avoid
4726 the store if the field being stored is the entire width of TARGET). Then
4727 call ourselves recursively to store the field into a BLKmode version of
4728 that object. Finally, load from the object into TARGET. This is not
4729 very efficient in general, but should only be slightly more expensive
4730 than the otherwise-required unaligned accesses. Perhaps this can be
4731 cleaned up later. */
4734 && (GET_CODE (target
) == REG
|| GET_CODE (target
) == SUBREG
))
4736 rtx object
= assign_stack_temp (GET_MODE (target
),
4737 GET_MODE_SIZE (GET_MODE (target
)), 0);
4738 rtx blk_object
= copy_rtx (object
);
4740 MEM_SET_IN_STRUCT_P (object
, 1);
4741 MEM_SET_IN_STRUCT_P (blk_object
, 1);
4742 PUT_MODE (blk_object
, BLKmode
);
4744 if (bitsize
!= GET_MODE_BITSIZE (GET_MODE (target
)))
4745 emit_move_insn (object
, target
);
4747 store_field (blk_object
, bitsize
, bitpos
, mode
, exp
, VOIDmode
, 0,
4748 align
, total_size
, alias_set
);
4750 /* Even though we aren't returning target, we need to
4751 give it the updated value. */
4752 emit_move_insn (target
, object
);
4757 /* If the structure is in a register or if the component
4758 is a bit field, we cannot use addressing to access it.
4759 Use bit-field techniques or SUBREG to store in it. */
4761 if (mode
== VOIDmode
4762 || (mode
!= BLKmode
&& ! direct_store
[(int) mode
]
4763 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
4764 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
4765 || GET_CODE (target
) == REG
4766 || GET_CODE (target
) == SUBREG
4767 /* If the field isn't aligned enough to store as an ordinary memref,
4768 store it as a bit field. */
4769 || (mode
!= BLKmode
&& SLOW_UNALIGNED_ACCESS
4770 && (align
* BITS_PER_UNIT
< GET_MODE_ALIGNMENT (mode
)
4771 || bitpos
% GET_MODE_ALIGNMENT (mode
)))
4772 || (mode
== BLKmode
&& SLOW_UNALIGNED_ACCESS
4773 && (TYPE_ALIGN (TREE_TYPE (exp
)) > align
* BITS_PER_UNIT
4774 || bitpos
% TYPE_ALIGN (TREE_TYPE (exp
)) != 0))
4775 /* If the RHS and field are a constant size and the size of the
4776 RHS isn't the same size as the bitfield, we must use bitfield
4779 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
)
4780 && (TREE_INT_CST_HIGH (TYPE_SIZE (TREE_TYPE (exp
))) != 0
4781 || TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp
))) != bitsize
)))
4783 rtx temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, 0);
4785 /* If BITSIZE is narrower than the size of the type of EXP
4786 we will be narrowing TEMP. Normally, what's wanted are the
4787 low-order bits. However, if EXP's type is a record and this is
4788 big-endian machine, we want the upper BITSIZE bits. */
4789 if (BYTES_BIG_ENDIAN
&& GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
4790 && bitsize
< GET_MODE_BITSIZE (GET_MODE (temp
))
4791 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
4792 temp
= expand_shift (RSHIFT_EXPR
, GET_MODE (temp
), temp
,
4793 size_int (GET_MODE_BITSIZE (GET_MODE (temp
))
4797 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
4799 if (mode
!= VOIDmode
&& mode
!= BLKmode
4800 && mode
!= TYPE_MODE (TREE_TYPE (exp
)))
4801 temp
= convert_modes (mode
, TYPE_MODE (TREE_TYPE (exp
)), temp
, 1);
4803 /* If the modes of TARGET and TEMP are both BLKmode, both
4804 must be in memory and BITPOS must be aligned on a byte
4805 boundary. If so, we simply do a block copy. */
4806 if (GET_MODE (target
) == BLKmode
&& GET_MODE (temp
) == BLKmode
)
4808 if (GET_CODE (target
) != MEM
|| GET_CODE (temp
) != MEM
4809 || bitpos
% BITS_PER_UNIT
!= 0)
4812 target
= change_address (target
, VOIDmode
,
4813 plus_constant (XEXP (target
, 0),
4814 bitpos
/ BITS_PER_UNIT
));
4816 /* Find an alignment that is consistent with the bit position. */
4817 while ((bitpos
% (align
* BITS_PER_UNIT
)) != 0)
4820 emit_block_move (target
, temp
,
4821 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
4825 return value_mode
== VOIDmode
? const0_rtx
: target
;
4828 /* Store the value in the bitfield. */
4829 store_bit_field (target
, bitsize
, bitpos
, mode
, temp
, align
, total_size
);
4830 if (value_mode
!= VOIDmode
)
4832 /* The caller wants an rtx for the value. */
4833 /* If possible, avoid refetching from the bitfield itself. */
4835 && ! (GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
)))
4838 enum machine_mode tmode
;
4841 return expand_and (temp
, GEN_INT (width_mask
), NULL_RTX
);
4842 tmode
= GET_MODE (temp
);
4843 if (tmode
== VOIDmode
)
4845 count
= build_int_2 (GET_MODE_BITSIZE (tmode
) - bitsize
, 0);
4846 temp
= expand_shift (LSHIFT_EXPR
, tmode
, temp
, count
, 0, 0);
4847 return expand_shift (RSHIFT_EXPR
, tmode
, temp
, count
, 0, 0);
4849 return extract_bit_field (target
, bitsize
, bitpos
, unsignedp
,
4850 NULL_RTX
, value_mode
, 0, align
,
4857 rtx addr
= XEXP (target
, 0);
4860 /* If a value is wanted, it must be the lhs;
4861 so make the address stable for multiple use. */
4863 if (value_mode
!= VOIDmode
&& GET_CODE (addr
) != REG
4864 && ! CONSTANT_ADDRESS_P (addr
)
4865 /* A frame-pointer reference is already stable. */
4866 && ! (GET_CODE (addr
) == PLUS
4867 && GET_CODE (XEXP (addr
, 1)) == CONST_INT
4868 && (XEXP (addr
, 0) == virtual_incoming_args_rtx
4869 || XEXP (addr
, 0) == virtual_stack_vars_rtx
)))
4870 addr
= copy_to_reg (addr
);
4872 /* Now build a reference to just the desired component. */
4874 to_rtx
= copy_rtx (change_address (target
, mode
,
4875 plus_constant (addr
,
4877 / BITS_PER_UNIT
))));
4878 MEM_SET_IN_STRUCT_P (to_rtx
, 1);
4879 MEM_ALIAS_SET (to_rtx
) = alias_set
;
4881 return store_expr (exp
, to_rtx
, value_mode
!= VOIDmode
);
4885 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
4886 or an ARRAY_REF, look for nested COMPONENT_REFs, BIT_FIELD_REFs, or
4887 ARRAY_REFs and find the ultimate containing object, which we return.
4889 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
4890 bit position, and *PUNSIGNEDP to the signedness of the field.
4891 If the position of the field is variable, we store a tree
4892 giving the variable offset (in units) in *POFFSET.
4893 This offset is in addition to the bit position.
4894 If the position is not variable, we store 0 in *POFFSET.
4895 We set *PALIGNMENT to the alignment in bytes of the address that will be
4896 computed. This is the alignment of the thing we return if *POFFSET
4897 is zero, but can be more less strictly aligned if *POFFSET is nonzero.
4899 If any of the extraction expressions is volatile,
4900 we store 1 in *PVOLATILEP. Otherwise we don't change that.
4902 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
4903 is a mode that can be used to access the field. In that case, *PBITSIZE
4906 If the field describes a variable-sized object, *PMODE is set to
4907 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
4908 this case, but the address of the object can be found. */
4911 get_inner_reference (exp
, pbitsize
, pbitpos
, poffset
, pmode
,
4912 punsignedp
, pvolatilep
, palignment
)
4917 enum machine_mode
*pmode
;
4922 tree orig_exp
= exp
;
4924 enum machine_mode mode
= VOIDmode
;
4925 tree offset
= integer_zero_node
;
4926 unsigned int alignment
= BIGGEST_ALIGNMENT
;
4928 if (TREE_CODE (exp
) == COMPONENT_REF
)
4930 size_tree
= DECL_SIZE (TREE_OPERAND (exp
, 1));
4931 if (! DECL_BIT_FIELD (TREE_OPERAND (exp
, 1)))
4932 mode
= DECL_MODE (TREE_OPERAND (exp
, 1));
4933 *punsignedp
= TREE_UNSIGNED (TREE_OPERAND (exp
, 1));
4935 else if (TREE_CODE (exp
) == BIT_FIELD_REF
)
4937 size_tree
= TREE_OPERAND (exp
, 1);
4938 *punsignedp
= TREE_UNSIGNED (exp
);
4942 mode
= TYPE_MODE (TREE_TYPE (exp
));
4943 if (mode
== BLKmode
)
4944 size_tree
= TYPE_SIZE (TREE_TYPE (exp
));
4946 *pbitsize
= GET_MODE_BITSIZE (mode
);
4947 *punsignedp
= TREE_UNSIGNED (TREE_TYPE (exp
));
4952 if (TREE_CODE (size_tree
) != INTEGER_CST
)
4953 mode
= BLKmode
, *pbitsize
= -1;
4955 *pbitsize
= TREE_INT_CST_LOW (size_tree
);
4958 /* Compute cumulative bit-offset for nested component-refs and array-refs,
4959 and find the ultimate containing object. */
4965 if (TREE_CODE (exp
) == COMPONENT_REF
|| TREE_CODE (exp
) == BIT_FIELD_REF
)
4967 tree pos
= (TREE_CODE (exp
) == COMPONENT_REF
4968 ? DECL_FIELD_BITPOS (TREE_OPERAND (exp
, 1))
4969 : TREE_OPERAND (exp
, 2));
4970 tree constant
= integer_zero_node
, var
= pos
;
4972 /* If this field hasn't been filled in yet, don't go
4973 past it. This should only happen when folding expressions
4974 made during type construction. */
4978 /* Assume here that the offset is a multiple of a unit.
4979 If not, there should be an explicitly added constant. */
4980 if (TREE_CODE (pos
) == PLUS_EXPR
4981 && TREE_CODE (TREE_OPERAND (pos
, 1)) == INTEGER_CST
)
4982 constant
= TREE_OPERAND (pos
, 1), var
= TREE_OPERAND (pos
, 0);
4983 else if (TREE_CODE (pos
) == INTEGER_CST
)
4984 constant
= pos
, var
= integer_zero_node
;
4986 *pbitpos
+= TREE_INT_CST_LOW (constant
);
4987 offset
= size_binop (PLUS_EXPR
, offset
,
4988 size_binop (EXACT_DIV_EXPR
, var
,
4989 size_int (BITS_PER_UNIT
)));
4992 else if (TREE_CODE (exp
) == ARRAY_REF
)
4994 /* This code is based on the code in case ARRAY_REF in expand_expr
4995 below. We assume here that the size of an array element is
4996 always an integral multiple of BITS_PER_UNIT. */
4998 tree index
= TREE_OPERAND (exp
, 1);
4999 tree domain
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
5001 = domain
? TYPE_MIN_VALUE (domain
) : integer_zero_node
;
5002 tree index_type
= TREE_TYPE (index
);
5005 if (TYPE_PRECISION (index_type
) != TYPE_PRECISION (sizetype
))
5007 index
= convert (type_for_size (TYPE_PRECISION (sizetype
), 0),
5009 index_type
= TREE_TYPE (index
);
5012 /* Optimize the special-case of a zero lower bound.
5014 We convert the low_bound to sizetype to avoid some problems
5015 with constant folding. (E.g. suppose the lower bound is 1,
5016 and its mode is QI. Without the conversion, (ARRAY
5017 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
5018 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
5020 But sizetype isn't quite right either (especially if
5021 the lowbound is negative). FIXME */
5023 if (! integer_zerop (low_bound
))
5024 index
= fold (build (MINUS_EXPR
, index_type
, index
,
5025 convert (sizetype
, low_bound
)));
5027 if (TREE_CODE (index
) == INTEGER_CST
)
5029 index
= convert (sbitsizetype
, index
);
5030 index_type
= TREE_TYPE (index
);
5033 xindex
= fold (build (MULT_EXPR
, sbitsizetype
, index
,
5034 convert (sbitsizetype
,
5035 TYPE_SIZE (TREE_TYPE (exp
)))));
5037 if (TREE_CODE (xindex
) == INTEGER_CST
5038 && TREE_INT_CST_HIGH (xindex
) == 0)
5039 *pbitpos
+= TREE_INT_CST_LOW (xindex
);
5042 /* Either the bit offset calculated above is not constant, or
5043 it overflowed. In either case, redo the multiplication
5044 against the size in units. This is especially important
5045 in the non-constant case to avoid a division at runtime. */
5046 xindex
= fold (build (MULT_EXPR
, ssizetype
, index
,
5048 TYPE_SIZE_UNIT (TREE_TYPE (exp
)))));
5050 if (contains_placeholder_p (xindex
))
5051 xindex
= build (WITH_RECORD_EXPR
, sizetype
, xindex
, exp
);
5053 offset
= size_binop (PLUS_EXPR
, offset
, xindex
);
5056 else if (TREE_CODE (exp
) != NON_LVALUE_EXPR
5057 && ! ((TREE_CODE (exp
) == NOP_EXPR
5058 || TREE_CODE (exp
) == CONVERT_EXPR
)
5059 && (TYPE_MODE (TREE_TYPE (exp
))
5060 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))))))
5063 /* If any reference in the chain is volatile, the effect is volatile. */
5064 if (TREE_THIS_VOLATILE (exp
))
5067 /* If the offset is non-constant already, then we can't assume any
5068 alignment more than the alignment here. */
5069 if (! integer_zerop (offset
))
5070 alignment
= MIN (alignment
, TYPE_ALIGN (TREE_TYPE (exp
)));
5072 exp
= TREE_OPERAND (exp
, 0);
5075 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'd')
5076 alignment
= MIN (alignment
, DECL_ALIGN (exp
));
5077 else if (TREE_TYPE (exp
) != 0)
5078 alignment
= MIN (alignment
, TYPE_ALIGN (TREE_TYPE (exp
)));
5080 if (integer_zerop (offset
))
5083 if (offset
!= 0 && contains_placeholder_p (offset
))
5084 offset
= build (WITH_RECORD_EXPR
, sizetype
, offset
, orig_exp
);
5088 *palignment
= alignment
/ BITS_PER_UNIT
;
5092 /* Subroutine of expand_exp: compute memory_usage from modifier. */
5093 static enum memory_use_mode
5094 get_memory_usage_from_modifier (modifier
)
5095 enum expand_modifier modifier
;
5101 return MEMORY_USE_RO
;
5103 case EXPAND_MEMORY_USE_WO
:
5104 return MEMORY_USE_WO
;
5106 case EXPAND_MEMORY_USE_RW
:
5107 return MEMORY_USE_RW
;
5109 case EXPAND_MEMORY_USE_DONT
:
5110 /* EXPAND_CONST_ADDRESS and EXPAND_INITIALIZER are converted into
5111 MEMORY_USE_DONT, because they are modifiers to a call of
5112 expand_expr in the ADDR_EXPR case of expand_expr. */
5113 case EXPAND_CONST_ADDRESS
:
5114 case EXPAND_INITIALIZER
:
5115 return MEMORY_USE_DONT
;
5116 case EXPAND_MEMORY_USE_BAD
:
5122 /* Given an rtx VALUE that may contain additions and multiplications,
5123 return an equivalent value that just refers to a register or memory.
5124 This is done by generating instructions to perform the arithmetic
5125 and returning a pseudo-register containing the value.
5127 The returned value may be a REG, SUBREG, MEM or constant. */
5130 force_operand (value
, target
)
5133 register optab binoptab
= 0;
5134 /* Use a temporary to force order of execution of calls to
5138 /* Use subtarget as the target for operand 0 of a binary operation. */
5139 register rtx subtarget
= (target
!= 0 && GET_CODE (target
) == REG
? target
: 0);
5141 /* Check for a PIC address load. */
5143 && (GET_CODE (value
) == PLUS
|| GET_CODE (value
) == MINUS
)
5144 && XEXP (value
, 0) == pic_offset_table_rtx
5145 && (GET_CODE (XEXP (value
, 1)) == SYMBOL_REF
5146 || GET_CODE (XEXP (value
, 1)) == LABEL_REF
5147 || GET_CODE (XEXP (value
, 1)) == CONST
))
5150 subtarget
= gen_reg_rtx (GET_MODE (value
));
5151 emit_move_insn (subtarget
, value
);
5155 if (GET_CODE (value
) == PLUS
)
5156 binoptab
= add_optab
;
5157 else if (GET_CODE (value
) == MINUS
)
5158 binoptab
= sub_optab
;
5159 else if (GET_CODE (value
) == MULT
)
5161 op2
= XEXP (value
, 1);
5162 if (!CONSTANT_P (op2
)
5163 && !(GET_CODE (op2
) == REG
&& op2
!= subtarget
))
5165 tmp
= force_operand (XEXP (value
, 0), subtarget
);
5166 return expand_mult (GET_MODE (value
), tmp
,
5167 force_operand (op2
, NULL_RTX
),
5173 op2
= XEXP (value
, 1);
5174 if (!CONSTANT_P (op2
)
5175 && !(GET_CODE (op2
) == REG
&& op2
!= subtarget
))
5177 if (binoptab
== sub_optab
&& GET_CODE (op2
) == CONST_INT
)
5179 binoptab
= add_optab
;
5180 op2
= negate_rtx (GET_MODE (value
), op2
);
5183 /* Check for an addition with OP2 a constant integer and our first
5184 operand a PLUS of a virtual register and something else. In that
5185 case, we want to emit the sum of the virtual register and the
5186 constant first and then add the other value. This allows virtual
5187 register instantiation to simply modify the constant rather than
5188 creating another one around this addition. */
5189 if (binoptab
== add_optab
&& GET_CODE (op2
) == CONST_INT
5190 && GET_CODE (XEXP (value
, 0)) == PLUS
5191 && GET_CODE (XEXP (XEXP (value
, 0), 0)) == REG
5192 && REGNO (XEXP (XEXP (value
, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5193 && REGNO (XEXP (XEXP (value
, 0), 0)) <= LAST_VIRTUAL_REGISTER
)
5195 rtx temp
= expand_binop (GET_MODE (value
), binoptab
,
5196 XEXP (XEXP (value
, 0), 0), op2
,
5197 subtarget
, 0, OPTAB_LIB_WIDEN
);
5198 return expand_binop (GET_MODE (value
), binoptab
, temp
,
5199 force_operand (XEXP (XEXP (value
, 0), 1), 0),
5200 target
, 0, OPTAB_LIB_WIDEN
);
5203 tmp
= force_operand (XEXP (value
, 0), subtarget
);
5204 return expand_binop (GET_MODE (value
), binoptab
, tmp
,
5205 force_operand (op2
, NULL_RTX
),
5206 target
, 0, OPTAB_LIB_WIDEN
);
5207 /* We give UNSIGNEDP = 0 to expand_binop
5208 because the only operations we are expanding here are signed ones. */
5213 /* Subroutine of expand_expr:
5214 save the non-copied parts (LIST) of an expr (LHS), and return a list
5215 which can restore these values to their previous values,
5216 should something modify their storage. */
5219 save_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
, save_noncopied_parts (lhs
, TREE_VALUE (tail
)));
5231 tree part
= TREE_VALUE (tail
);
5232 tree part_type
= TREE_TYPE (part
);
5233 tree to_be_saved
= build (COMPONENT_REF
, part_type
, lhs
, part
);
5234 rtx target
= assign_temp (part_type
, 0, 1, 1);
5235 if (! memory_address_p (TYPE_MODE (part_type
), XEXP (target
, 0)))
5236 target
= change_address (target
, TYPE_MODE (part_type
), NULL_RTX
);
5237 parts
= tree_cons (to_be_saved
,
5238 build (RTL_EXPR
, part_type
, NULL_TREE
,
5241 store_expr (TREE_PURPOSE (parts
), RTL_EXPR_RTL (TREE_VALUE (parts
)), 0);
5246 /* Subroutine of expand_expr:
5247 record the non-copied parts (LIST) of an expr (LHS), and return a list
5248 which specifies the initial values of these parts. */
5251 init_noncopied_parts (lhs
, list
)
5258 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5259 if (TREE_CODE (TREE_VALUE (tail
)) == TREE_LIST
)
5260 parts
= chainon (parts
, init_noncopied_parts (lhs
, TREE_VALUE (tail
)));
5261 else if (TREE_PURPOSE (tail
))
5263 tree part
= TREE_VALUE (tail
);
5264 tree part_type
= TREE_TYPE (part
);
5265 tree to_be_initialized
= build (COMPONENT_REF
, part_type
, lhs
, part
);
5266 parts
= tree_cons (TREE_PURPOSE (tail
), to_be_initialized
, parts
);
5271 /* Subroutine of expand_expr: return nonzero iff there is no way that
5272 EXP can reference X, which is being modified. TOP_P is nonzero if this
5273 call is going to be used to determine whether we need a temporary
5274 for EXP, as opposed to a recursive call to this function.
5276 It is always safe for this routine to return zero since it merely
5277 searches for optimization opportunities. */
5280 safe_from_p (x
, exp
, top_p
)
5287 static int save_expr_count
;
5288 static int save_expr_size
= 0;
5289 static tree
*save_expr_rewritten
;
5290 static tree save_expr_trees
[256];
5293 /* If EXP has varying size, we MUST use a target since we currently
5294 have no way of allocating temporaries of variable size
5295 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5296 So we assume here that something at a higher level has prevented a
5297 clash. This is somewhat bogus, but the best we can do. Only
5298 do this when X is BLKmode and when we are at the top level. */
5299 || (top_p
&& TREE_TYPE (exp
) != 0 && TYPE_SIZE (TREE_TYPE (exp
)) != 0
5300 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) != INTEGER_CST
5301 && (TREE_CODE (TREE_TYPE (exp
)) != ARRAY_TYPE
5302 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)) == NULL_TREE
5303 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)))
5305 && GET_MODE (x
) == BLKmode
))
5308 if (top_p
&& save_expr_size
== 0)
5312 save_expr_count
= 0;
5313 save_expr_size
= sizeof (save_expr_trees
) / sizeof (save_expr_trees
[0]);
5314 save_expr_rewritten
= &save_expr_trees
[0];
5316 rtn
= safe_from_p (x
, exp
, 1);
5318 for (i
= 0; i
< save_expr_count
; ++i
)
5320 if (TREE_CODE (save_expr_trees
[i
]) != ERROR_MARK
)
5322 TREE_SET_CODE (save_expr_trees
[i
], SAVE_EXPR
);
5330 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5331 find the underlying pseudo. */
5332 if (GET_CODE (x
) == SUBREG
)
5335 if (GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
5339 /* If X is a location in the outgoing argument area, it is always safe. */
5340 if (GET_CODE (x
) == MEM
5341 && (XEXP (x
, 0) == virtual_outgoing_args_rtx
5342 || (GET_CODE (XEXP (x
, 0)) == PLUS
5343 && XEXP (XEXP (x
, 0), 0) == virtual_outgoing_args_rtx
)))
5346 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
5349 exp_rtl
= DECL_RTL (exp
);
5356 if (TREE_CODE (exp
) == TREE_LIST
)
5357 return ((TREE_VALUE (exp
) == 0
5358 || safe_from_p (x
, TREE_VALUE (exp
), 0))
5359 && (TREE_CHAIN (exp
) == 0
5360 || safe_from_p (x
, TREE_CHAIN (exp
), 0)));
5361 else if (TREE_CODE (exp
) == ERROR_MARK
)
5362 return 1; /* An already-visited SAVE_EXPR? */
5367 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
5371 return (safe_from_p (x
, TREE_OPERAND (exp
, 0), 0)
5372 && safe_from_p (x
, TREE_OPERAND (exp
, 1), 0));
5376 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5377 the expression. If it is set, we conflict iff we are that rtx or
5378 both are in memory. Otherwise, we check all operands of the
5379 expression recursively. */
5381 switch (TREE_CODE (exp
))
5384 return (staticp (TREE_OPERAND (exp
, 0))
5385 || safe_from_p (x
, TREE_OPERAND (exp
, 0), 0)
5386 || TREE_STATIC (exp
));
5389 if (GET_CODE (x
) == MEM
)
5394 exp_rtl
= CALL_EXPR_RTL (exp
);
5397 /* Assume that the call will clobber all hard registers and
5399 if ((GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
5400 || GET_CODE (x
) == MEM
)
5407 /* If a sequence exists, we would have to scan every instruction
5408 in the sequence to see if it was safe. This is probably not
5410 if (RTL_EXPR_SEQUENCE (exp
))
5413 exp_rtl
= RTL_EXPR_RTL (exp
);
5416 case WITH_CLEANUP_EXPR
:
5417 exp_rtl
= RTL_EXPR_RTL (exp
);
5420 case CLEANUP_POINT_EXPR
:
5421 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
5424 exp_rtl
= SAVE_EXPR_RTL (exp
);
5428 /* This SAVE_EXPR might appear many times in the top-level
5429 safe_from_p() expression, and if it has a complex
5430 subexpression, examining it multiple times could result
5431 in a combinatorial explosion. E.g. on an Alpha
5432 running at least 200MHz, a Fortran test case compiled with
5433 optimization took about 28 minutes to compile -- even though
5434 it was only a few lines long, and the complicated line causing
5435 so much time to be spent in the earlier version of safe_from_p()
5436 had only 293 or so unique nodes.
5438 So, turn this SAVE_EXPR into an ERROR_MARK for now, but remember
5439 where it is so we can turn it back in the top-level safe_from_p()
5442 /* For now, don't bother re-sizing the array. */
5443 if (save_expr_count
>= save_expr_size
)
5445 save_expr_rewritten
[save_expr_count
++] = exp
;
5447 nops
= tree_code_length
[(int) SAVE_EXPR
];
5448 for (i
= 0; i
< nops
; i
++)
5450 tree operand
= TREE_OPERAND (exp
, i
);
5451 if (operand
== NULL_TREE
)
5453 TREE_SET_CODE (exp
, ERROR_MARK
);
5454 if (!safe_from_p (x
, operand
, 0))
5456 TREE_SET_CODE (exp
, SAVE_EXPR
);
5458 TREE_SET_CODE (exp
, ERROR_MARK
);
5462 /* The only operand we look at is operand 1. The rest aren't
5463 part of the expression. */
5464 return safe_from_p (x
, TREE_OPERAND (exp
, 1), 0);
5466 case METHOD_CALL_EXPR
:
5467 /* This takes a rtx argument, but shouldn't appear here. */
5474 /* If we have an rtx, we do not need to scan our operands. */
5478 nops
= tree_code_length
[(int) TREE_CODE (exp
)];
5479 for (i
= 0; i
< nops
; i
++)
5480 if (TREE_OPERAND (exp
, i
) != 0
5481 && ! safe_from_p (x
, TREE_OPERAND (exp
, i
), 0))
5485 /* If we have an rtl, find any enclosed object. Then see if we conflict
5489 if (GET_CODE (exp_rtl
) == SUBREG
)
5491 exp_rtl
= SUBREG_REG (exp_rtl
);
5492 if (GET_CODE (exp_rtl
) == REG
5493 && REGNO (exp_rtl
) < FIRST_PSEUDO_REGISTER
)
5497 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5498 are memory and EXP is not readonly. */
5499 return ! (rtx_equal_p (x
, exp_rtl
)
5500 || (GET_CODE (x
) == MEM
&& GET_CODE (exp_rtl
) == MEM
5501 && ! TREE_READONLY (exp
)));
5504 /* If we reach here, it is safe. */
5508 /* Subroutine of expand_expr: return nonzero iff EXP is an
5509 expression whose type is statically determinable. */
5515 if (TREE_CODE (exp
) == PARM_DECL
5516 || TREE_CODE (exp
) == VAR_DECL
5517 || TREE_CODE (exp
) == CALL_EXPR
|| TREE_CODE (exp
) == TARGET_EXPR
5518 || TREE_CODE (exp
) == COMPONENT_REF
5519 || TREE_CODE (exp
) == ARRAY_REF
)
5524 /* Subroutine of expand_expr: return rtx if EXP is a
5525 variable or parameter; else return 0. */
5532 switch (TREE_CODE (exp
))
5536 return DECL_RTL (exp
);
5542 #ifdef MAX_INTEGER_COMPUTATION_MODE
5544 check_max_integer_computation_mode (exp
)
5547 enum tree_code code
;
5548 enum machine_mode mode
;
5550 /* Strip any NOPs that don't change the mode. */
5552 code
= TREE_CODE (exp
);
5554 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
5555 if (code
== NOP_EXPR
5556 && TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
)
5559 /* First check the type of the overall operation. We need only look at
5560 unary, binary and relational operations. */
5561 if (TREE_CODE_CLASS (code
) == '1'
5562 || TREE_CODE_CLASS (code
) == '2'
5563 || TREE_CODE_CLASS (code
) == '<')
5565 mode
= TYPE_MODE (TREE_TYPE (exp
));
5566 if (GET_MODE_CLASS (mode
) == MODE_INT
5567 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
5568 fatal ("unsupported wide integer operation");
5571 /* Check operand of a unary op. */
5572 if (TREE_CODE_CLASS (code
) == '1')
5574 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
5575 if (GET_MODE_CLASS (mode
) == MODE_INT
5576 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
5577 fatal ("unsupported wide integer operation");
5580 /* Check operands of a binary/comparison op. */
5581 if (TREE_CODE_CLASS (code
) == '2' || TREE_CODE_CLASS (code
) == '<')
5583 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
5584 if (GET_MODE_CLASS (mode
) == MODE_INT
5585 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
5586 fatal ("unsupported wide integer operation");
5588 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1)));
5589 if (GET_MODE_CLASS (mode
) == MODE_INT
5590 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
5591 fatal ("unsupported wide integer operation");
5597 /* Utility function used by expand_expr to see if TYPE, a RECORD_TYPE,
5598 has any readonly fields. If any of the fields have types that
5599 contain readonly fields, return true as well. */
5602 readonly_fields_p (type
)
5607 for (field
= TYPE_FIELDS (type
); field
!= 0; field
= TREE_CHAIN (field
))
5608 if (TREE_CODE (field
) == FIELD_DECL
5609 && (TREE_READONLY (field
)
5610 || (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
5611 && readonly_fields_p (TREE_TYPE (field
)))))
5617 /* expand_expr: generate code for computing expression EXP.
5618 An rtx for the computed value is returned. The value is never null.
5619 In the case of a void EXP, const0_rtx is returned.
5621 The value may be stored in TARGET if TARGET is nonzero.
5622 TARGET is just a suggestion; callers must assume that
5623 the rtx returned may not be the same as TARGET.
5625 If TARGET is CONST0_RTX, it means that the value will be ignored.
5627 If TMODE is not VOIDmode, it suggests generating the
5628 result in mode TMODE. But this is done only when convenient.
5629 Otherwise, TMODE is ignored and the value generated in its natural mode.
5630 TMODE is just a suggestion; callers must assume that
5631 the rtx returned may not have mode TMODE.
5633 Note that TARGET may have neither TMODE nor MODE. In that case, it
5634 probably will not be used.
5636 If MODIFIER is EXPAND_SUM then when EXP is an addition
5637 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
5638 or a nest of (PLUS ...) and (MINUS ...) where the terms are
5639 products as above, or REG or MEM, or constant.
5640 Ordinarily in such cases we would output mul or add instructions
5641 and then return a pseudo reg containing the sum.
5643 EXPAND_INITIALIZER is much like EXPAND_SUM except that
5644 it also marks a label as absolutely required (it can't be dead).
5645 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
5646 This is used for outputting expressions used in initializers.
5648 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
5649 with a constant address even if that address is not normally legitimate.
5650 EXPAND_INITIALIZER and EXPAND_SUM also have this effect. */
5653 expand_expr (exp
, target
, tmode
, modifier
)
5656 enum machine_mode tmode
;
5657 enum expand_modifier modifier
;
5659 register rtx op0
, op1
, temp
;
5660 tree type
= TREE_TYPE (exp
);
5661 int unsignedp
= TREE_UNSIGNED (type
);
5662 register enum machine_mode mode
;
5663 register enum tree_code code
= TREE_CODE (exp
);
5665 rtx subtarget
, original_target
;
5668 /* Used by check-memory-usage to make modifier read only. */
5669 enum expand_modifier ro_modifier
;
5671 /* Handle ERROR_MARK before anybody tries to access its type. */
5672 if (TREE_CODE (exp
) == ERROR_MARK
)
5674 op0
= CONST0_RTX (tmode
);
5680 mode
= TYPE_MODE (type
);
5681 /* Use subtarget as the target for operand 0 of a binary operation. */
5682 subtarget
= (target
!= 0 && GET_CODE (target
) == REG
? target
: 0);
5683 original_target
= target
;
5684 ignore
= (target
== const0_rtx
5685 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
5686 || code
== CONVERT_EXPR
|| code
== REFERENCE_EXPR
5687 || code
== COND_EXPR
)
5688 && TREE_CODE (type
) == VOID_TYPE
));
5690 /* Make a read-only version of the modifier. */
5691 if (modifier
== EXPAND_NORMAL
|| modifier
== EXPAND_SUM
5692 || modifier
== EXPAND_CONST_ADDRESS
|| modifier
== EXPAND_INITIALIZER
)
5693 ro_modifier
= modifier
;
5695 ro_modifier
= EXPAND_NORMAL
;
5697 /* Don't use hard regs as subtargets, because the combiner
5698 can only handle pseudo regs. */
5699 if (subtarget
&& REGNO (subtarget
) < FIRST_PSEUDO_REGISTER
)
5701 /* Avoid subtargets inside loops,
5702 since they hide some invariant expressions. */
5703 if (preserve_subexpressions_p ())
5706 /* If we are going to ignore this result, we need only do something
5707 if there is a side-effect somewhere in the expression. If there
5708 is, short-circuit the most common cases here. Note that we must
5709 not call expand_expr with anything but const0_rtx in case this
5710 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
5714 if (! TREE_SIDE_EFFECTS (exp
))
5717 /* Ensure we reference a volatile object even if value is ignored, but
5718 don't do this if all we are doing is taking its address. */
5719 if (TREE_THIS_VOLATILE (exp
)
5720 && TREE_CODE (exp
) != FUNCTION_DECL
5721 && mode
!= VOIDmode
&& mode
!= BLKmode
5722 && modifier
!= EXPAND_CONST_ADDRESS
)
5724 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, ro_modifier
);
5725 if (GET_CODE (temp
) == MEM
)
5726 temp
= copy_to_reg (temp
);
5730 if (TREE_CODE_CLASS (code
) == '1' || code
== COMPONENT_REF
5731 || code
== INDIRECT_REF
|| code
== BUFFER_REF
)
5732 return expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
,
5733 VOIDmode
, ro_modifier
);
5734 else if (TREE_CODE_CLASS (code
) == '2' || TREE_CODE_CLASS (code
) == '<'
5735 || code
== ARRAY_REF
)
5737 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, ro_modifier
);
5738 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, ro_modifier
);
5741 else if ((code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
5742 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 1)))
5743 /* If the second operand has no side effects, just evaluate
5745 return expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
,
5746 VOIDmode
, ro_modifier
);
5747 else if (code
== BIT_FIELD_REF
)
5749 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, ro_modifier
);
5750 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, ro_modifier
);
5751 expand_expr (TREE_OPERAND (exp
, 2), const0_rtx
, VOIDmode
, ro_modifier
);
5758 #ifdef MAX_INTEGER_COMPUTATION_MODE
5759 /* Only check stuff here if the mode we want is different from the mode
5760 of the expression; if it's the same, check_max_integer_computiation_mode
5761 will handle it. Do we really need to check this stuff at all? */
5764 && GET_MODE (target
) != mode
5765 && TREE_CODE (exp
) != INTEGER_CST
5766 && TREE_CODE (exp
) != PARM_DECL
5767 && TREE_CODE (exp
) != ARRAY_REF
5768 && TREE_CODE (exp
) != COMPONENT_REF
5769 && TREE_CODE (exp
) != BIT_FIELD_REF
5770 && TREE_CODE (exp
) != INDIRECT_REF
5771 && TREE_CODE (exp
) != CALL_EXPR
5772 && TREE_CODE (exp
) != VAR_DECL
5773 && TREE_CODE (exp
) != RTL_EXPR
)
5775 enum machine_mode mode
= GET_MODE (target
);
5777 if (GET_MODE_CLASS (mode
) == MODE_INT
5778 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
5779 fatal ("unsupported wide integer operation");
5783 && TREE_CODE (exp
) != INTEGER_CST
5784 && TREE_CODE (exp
) != PARM_DECL
5785 && TREE_CODE (exp
) != ARRAY_REF
5786 && TREE_CODE (exp
) != COMPONENT_REF
5787 && TREE_CODE (exp
) != BIT_FIELD_REF
5788 && TREE_CODE (exp
) != INDIRECT_REF
5789 && TREE_CODE (exp
) != VAR_DECL
5790 && TREE_CODE (exp
) != CALL_EXPR
5791 && TREE_CODE (exp
) != RTL_EXPR
5792 && GET_MODE_CLASS (tmode
) == MODE_INT
5793 && tmode
> MAX_INTEGER_COMPUTATION_MODE
)
5794 fatal ("unsupported wide integer operation");
5796 check_max_integer_computation_mode (exp
);
5799 /* If will do cse, generate all results into pseudo registers
5800 since 1) that allows cse to find more things
5801 and 2) otherwise cse could produce an insn the machine
5804 if (! cse_not_expected
&& mode
!= BLKmode
&& target
5805 && (GET_CODE (target
) != REG
|| REGNO (target
) < FIRST_PSEUDO_REGISTER
))
5812 tree function
= decl_function_context (exp
);
5813 /* Handle using a label in a containing function. */
5814 if (function
!= current_function_decl
5815 && function
!= inline_function_decl
&& function
!= 0)
5817 struct function
*p
= find_function_data (function
);
5818 /* Allocate in the memory associated with the function
5819 that the label is in. */
5820 push_obstacks (p
->function_obstack
,
5821 p
->function_maybepermanent_obstack
);
5823 p
->expr
->x_forced_labels
5824 = gen_rtx_EXPR_LIST (VOIDmode
, label_rtx (exp
),
5825 p
->expr
->x_forced_labels
);
5830 if (modifier
== EXPAND_INITIALIZER
)
5831 forced_labels
= gen_rtx_EXPR_LIST (VOIDmode
,
5836 temp
= gen_rtx_MEM (FUNCTION_MODE
,
5837 gen_rtx_LABEL_REF (Pmode
, label_rtx (exp
)));
5838 if (function
!= current_function_decl
5839 && function
!= inline_function_decl
&& function
!= 0)
5840 LABEL_REF_NONLOCAL_P (XEXP (temp
, 0)) = 1;
5845 if (DECL_RTL (exp
) == 0)
5847 error_with_decl (exp
, "prior parameter's size depends on `%s'");
5848 return CONST0_RTX (mode
);
5851 /* ... fall through ... */
5854 /* If a static var's type was incomplete when the decl was written,
5855 but the type is complete now, lay out the decl now. */
5856 if (DECL_SIZE (exp
) == 0 && TYPE_SIZE (TREE_TYPE (exp
)) != 0
5857 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
5859 push_obstacks_nochange ();
5860 end_temporary_allocation ();
5861 layout_decl (exp
, 0);
5862 PUT_MODE (DECL_RTL (exp
), DECL_MODE (exp
));
5866 /* Although static-storage variables start off initialized, according to
5867 ANSI C, a memcpy could overwrite them with uninitialized values. So
5868 we check them too. This also lets us check for read-only variables
5869 accessed via a non-const declaration, in case it won't be detected
5870 any other way (e.g., in an embedded system or OS kernel without
5873 Aggregates are not checked here; they're handled elsewhere. */
5874 if (cfun
&& current_function_check_memory_usage
5876 && GET_CODE (DECL_RTL (exp
)) == MEM
5877 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
5879 enum memory_use_mode memory_usage
;
5880 memory_usage
= get_memory_usage_from_modifier (modifier
);
5882 if (memory_usage
!= MEMORY_USE_DONT
)
5883 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
5884 XEXP (DECL_RTL (exp
), 0), Pmode
,
5885 GEN_INT (int_size_in_bytes (type
)),
5886 TYPE_MODE (sizetype
),
5887 GEN_INT (memory_usage
),
5888 TYPE_MODE (integer_type_node
));
5891 /* ... fall through ... */
5895 if (DECL_RTL (exp
) == 0)
5898 /* Ensure variable marked as used even if it doesn't go through
5899 a parser. If it hasn't be used yet, write out an external
5901 if (! TREE_USED (exp
))
5903 assemble_external (exp
);
5904 TREE_USED (exp
) = 1;
5907 /* Show we haven't gotten RTL for this yet. */
5910 /* Handle variables inherited from containing functions. */
5911 context
= decl_function_context (exp
);
5913 /* We treat inline_function_decl as an alias for the current function
5914 because that is the inline function whose vars, types, etc.
5915 are being merged into the current function.
5916 See expand_inline_function. */
5918 if (context
!= 0 && context
!= current_function_decl
5919 && context
!= inline_function_decl
5920 /* If var is static, we don't need a static chain to access it. */
5921 && ! (GET_CODE (DECL_RTL (exp
)) == MEM
5922 && CONSTANT_P (XEXP (DECL_RTL (exp
), 0))))
5926 /* Mark as non-local and addressable. */
5927 DECL_NONLOCAL (exp
) = 1;
5928 if (DECL_NO_STATIC_CHAIN (current_function_decl
))
5930 mark_addressable (exp
);
5931 if (GET_CODE (DECL_RTL (exp
)) != MEM
)
5933 addr
= XEXP (DECL_RTL (exp
), 0);
5934 if (GET_CODE (addr
) == MEM
)
5935 addr
= gen_rtx_MEM (Pmode
,
5936 fix_lexical_addr (XEXP (addr
, 0), exp
));
5938 addr
= fix_lexical_addr (addr
, exp
);
5939 temp
= change_address (DECL_RTL (exp
), mode
, addr
);
5942 /* This is the case of an array whose size is to be determined
5943 from its initializer, while the initializer is still being parsed.
5946 else if (GET_CODE (DECL_RTL (exp
)) == MEM
5947 && GET_CODE (XEXP (DECL_RTL (exp
), 0)) == REG
)
5948 temp
= change_address (DECL_RTL (exp
), GET_MODE (DECL_RTL (exp
)),
5949 XEXP (DECL_RTL (exp
), 0));
5951 /* If DECL_RTL is memory, we are in the normal case and either
5952 the address is not valid or it is not a register and -fforce-addr
5953 is specified, get the address into a register. */
5955 else if (GET_CODE (DECL_RTL (exp
)) == MEM
5956 && modifier
!= EXPAND_CONST_ADDRESS
5957 && modifier
!= EXPAND_SUM
5958 && modifier
!= EXPAND_INITIALIZER
5959 && (! memory_address_p (DECL_MODE (exp
),
5960 XEXP (DECL_RTL (exp
), 0))
5962 && GET_CODE (XEXP (DECL_RTL (exp
), 0)) != REG
)))
5963 temp
= change_address (DECL_RTL (exp
), VOIDmode
,
5964 copy_rtx (XEXP (DECL_RTL (exp
), 0)));
5966 /* If we got something, return it. But first, set the alignment
5967 the address is a register. */
5970 if (GET_CODE (temp
) == MEM
&& GET_CODE (XEXP (temp
, 0)) == REG
)
5971 mark_reg_pointer (XEXP (temp
, 0),
5972 DECL_ALIGN (exp
) / BITS_PER_UNIT
);
5977 /* If the mode of DECL_RTL does not match that of the decl, it
5978 must be a promoted value. We return a SUBREG of the wanted mode,
5979 but mark it so that we know that it was already extended. */
5981 if (GET_CODE (DECL_RTL (exp
)) == REG
5982 && GET_MODE (DECL_RTL (exp
)) != mode
)
5984 /* Get the signedness used for this variable. Ensure we get the
5985 same mode we got when the variable was declared. */
5986 if (GET_MODE (DECL_RTL (exp
))
5987 != promote_mode (type
, DECL_MODE (exp
), &unsignedp
, 0))
5990 temp
= gen_rtx_SUBREG (mode
, DECL_RTL (exp
), 0);
5991 SUBREG_PROMOTED_VAR_P (temp
) = 1;
5992 SUBREG_PROMOTED_UNSIGNED_P (temp
) = unsignedp
;
5996 return DECL_RTL (exp
);
5999 return immed_double_const (TREE_INT_CST_LOW (exp
),
6000 TREE_INT_CST_HIGH (exp
),
6004 return expand_expr (DECL_INITIAL (exp
), target
, VOIDmode
,
6005 EXPAND_MEMORY_USE_BAD
);
6008 /* If optimized, generate immediate CONST_DOUBLE
6009 which will be turned into memory by reload if necessary.
6011 We used to force a register so that loop.c could see it. But
6012 this does not allow gen_* patterns to perform optimizations with
6013 the constants. It also produces two insns in cases like "x = 1.0;".
6014 On most machines, floating-point constants are not permitted in
6015 many insns, so we'd end up copying it to a register in any case.
6017 Now, we do the copying in expand_binop, if appropriate. */
6018 return immed_real_const (exp
);
6022 if (! TREE_CST_RTL (exp
))
6023 output_constant_def (exp
);
6025 /* TREE_CST_RTL probably contains a constant address.
6026 On RISC machines where a constant address isn't valid,
6027 make some insns to get that address into a register. */
6028 if (GET_CODE (TREE_CST_RTL (exp
)) == MEM
6029 && modifier
!= EXPAND_CONST_ADDRESS
6030 && modifier
!= EXPAND_INITIALIZER
6031 && modifier
!= EXPAND_SUM
6032 && (! memory_address_p (mode
, XEXP (TREE_CST_RTL (exp
), 0))
6034 && GET_CODE (XEXP (TREE_CST_RTL (exp
), 0)) != REG
)))
6035 return change_address (TREE_CST_RTL (exp
), VOIDmode
,
6036 copy_rtx (XEXP (TREE_CST_RTL (exp
), 0)));
6037 return TREE_CST_RTL (exp
);
6039 case EXPR_WITH_FILE_LOCATION
:
6042 char *saved_input_filename
= input_filename
;
6043 int saved_lineno
= lineno
;
6044 input_filename
= EXPR_WFL_FILENAME (exp
);
6045 lineno
= EXPR_WFL_LINENO (exp
);
6046 if (EXPR_WFL_EMIT_LINE_NOTE (exp
))
6047 emit_line_note (input_filename
, lineno
);
6048 /* Possibly avoid switching back and force here */
6049 to_return
= expand_expr (EXPR_WFL_NODE (exp
), target
, tmode
, modifier
);
6050 input_filename
= saved_input_filename
;
6051 lineno
= saved_lineno
;
6056 context
= decl_function_context (exp
);
6058 /* If this SAVE_EXPR was at global context, assume we are an
6059 initialization function and move it into our context. */
6061 SAVE_EXPR_CONTEXT (exp
) = current_function_decl
;
6063 /* We treat inline_function_decl as an alias for the current function
6064 because that is the inline function whose vars, types, etc.
6065 are being merged into the current function.
6066 See expand_inline_function. */
6067 if (context
== current_function_decl
|| context
== inline_function_decl
)
6070 /* If this is non-local, handle it. */
6073 /* The following call just exists to abort if the context is
6074 not of a containing function. */
6075 find_function_data (context
);
6077 temp
= SAVE_EXPR_RTL (exp
);
6078 if (temp
&& GET_CODE (temp
) == REG
)
6080 put_var_into_stack (exp
);
6081 temp
= SAVE_EXPR_RTL (exp
);
6083 if (temp
== 0 || GET_CODE (temp
) != MEM
)
6085 return change_address (temp
, mode
,
6086 fix_lexical_addr (XEXP (temp
, 0), exp
));
6088 if (SAVE_EXPR_RTL (exp
) == 0)
6090 if (mode
== VOIDmode
)
6093 temp
= assign_temp (type
, 3, 0, 0);
6095 SAVE_EXPR_RTL (exp
) = temp
;
6096 if (!optimize
&& GET_CODE (temp
) == REG
)
6097 save_expr_regs
= gen_rtx_EXPR_LIST (VOIDmode
, temp
,
6100 /* If the mode of TEMP does not match that of the expression, it
6101 must be a promoted value. We pass store_expr a SUBREG of the
6102 wanted mode but mark it so that we know that it was already
6103 extended. Note that `unsignedp' was modified above in
6106 if (GET_CODE (temp
) == REG
&& GET_MODE (temp
) != mode
)
6108 temp
= gen_rtx_SUBREG (mode
, SAVE_EXPR_RTL (exp
), 0);
6109 SUBREG_PROMOTED_VAR_P (temp
) = 1;
6110 SUBREG_PROMOTED_UNSIGNED_P (temp
) = unsignedp
;
6113 if (temp
== const0_rtx
)
6114 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
6115 EXPAND_MEMORY_USE_BAD
);
6117 store_expr (TREE_OPERAND (exp
, 0), temp
, 0);
6119 TREE_USED (exp
) = 1;
6122 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
6123 must be a promoted value. We return a SUBREG of the wanted mode,
6124 but mark it so that we know that it was already extended. */
6126 if (GET_CODE (SAVE_EXPR_RTL (exp
)) == REG
6127 && GET_MODE (SAVE_EXPR_RTL (exp
)) != mode
)
6129 /* Compute the signedness and make the proper SUBREG. */
6130 promote_mode (type
, mode
, &unsignedp
, 0);
6131 temp
= gen_rtx_SUBREG (mode
, SAVE_EXPR_RTL (exp
), 0);
6132 SUBREG_PROMOTED_VAR_P (temp
) = 1;
6133 SUBREG_PROMOTED_UNSIGNED_P (temp
) = unsignedp
;
6137 return SAVE_EXPR_RTL (exp
);
6142 temp
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
6143 TREE_OPERAND (exp
, 0) = unsave_expr_now (TREE_OPERAND (exp
, 0));
6147 case PLACEHOLDER_EXPR
:
6149 tree placeholder_expr
;
6151 /* If there is an object on the head of the placeholder list,
6152 see if some object in it of type TYPE or a pointer to it. For
6153 further information, see tree.def. */
6154 for (placeholder_expr
= placeholder_list
;
6155 placeholder_expr
!= 0;
6156 placeholder_expr
= TREE_CHAIN (placeholder_expr
))
6158 tree need_type
= TYPE_MAIN_VARIANT (type
);
6160 tree old_list
= placeholder_list
;
6163 /* Find the outermost reference that is of the type we want.
6164 If none, see if any object has a type that is a pointer to
6165 the type we want. */
6166 for (elt
= TREE_PURPOSE (placeholder_expr
);
6167 elt
!= 0 && object
== 0;
6169 = ((TREE_CODE (elt
) == COMPOUND_EXPR
6170 || TREE_CODE (elt
) == COND_EXPR
)
6171 ? TREE_OPERAND (elt
, 1)
6172 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
6173 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
6174 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
6175 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
6176 ? TREE_OPERAND (elt
, 0) : 0))
6177 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
6180 for (elt
= TREE_PURPOSE (placeholder_expr
);
6181 elt
!= 0 && object
== 0;
6183 = ((TREE_CODE (elt
) == COMPOUND_EXPR
6184 || TREE_CODE (elt
) == COND_EXPR
)
6185 ? TREE_OPERAND (elt
, 1)
6186 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
6187 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
6188 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
6189 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
6190 ? TREE_OPERAND (elt
, 0) : 0))
6191 if (POINTER_TYPE_P (TREE_TYPE (elt
))
6192 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
6194 object
= build1 (INDIRECT_REF
, need_type
, elt
);
6198 /* Expand this object skipping the list entries before
6199 it was found in case it is also a PLACEHOLDER_EXPR.
6200 In that case, we want to translate it using subsequent
6202 placeholder_list
= TREE_CHAIN (placeholder_expr
);
6203 temp
= expand_expr (object
, original_target
, tmode
,
6205 placeholder_list
= old_list
;
6211 /* We can't find the object or there was a missing WITH_RECORD_EXPR. */
6214 case WITH_RECORD_EXPR
:
6215 /* Put the object on the placeholder list, expand our first operand,
6216 and pop the list. */
6217 placeholder_list
= tree_cons (TREE_OPERAND (exp
, 1), NULL_TREE
,
6219 target
= expand_expr (TREE_OPERAND (exp
, 0), original_target
,
6220 tmode
, ro_modifier
);
6221 placeholder_list
= TREE_CHAIN (placeholder_list
);
6225 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == LABEL_DECL
)
6226 expand_goto (TREE_OPERAND (exp
, 0));
6228 expand_computed_goto (TREE_OPERAND (exp
, 0));
6232 expand_exit_loop_if_false (NULL_PTR
,
6233 invert_truthvalue (TREE_OPERAND (exp
, 0)));
6236 case LABELED_BLOCK_EXPR
:
6237 if (LABELED_BLOCK_BODY (exp
))
6238 expand_expr_stmt (LABELED_BLOCK_BODY (exp
));
6239 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp
)));
6242 case EXIT_BLOCK_EXPR
:
6243 if (EXIT_BLOCK_RETURN (exp
))
6244 sorry ("returned value in block_exit_expr");
6245 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp
)));
6250 expand_start_loop (1);
6251 expand_expr_stmt (TREE_OPERAND (exp
, 0));
6259 tree vars
= TREE_OPERAND (exp
, 0);
6260 int vars_need_expansion
= 0;
6262 /* Need to open a binding contour here because
6263 if there are any cleanups they must be contained here. */
6264 expand_start_bindings (2);
6266 /* Mark the corresponding BLOCK for output in its proper place. */
6267 if (TREE_OPERAND (exp
, 2) != 0
6268 && ! TREE_USED (TREE_OPERAND (exp
, 2)))
6269 insert_block (TREE_OPERAND (exp
, 2));
6271 /* If VARS have not yet been expanded, expand them now. */
6274 if (DECL_RTL (vars
) == 0)
6276 vars_need_expansion
= 1;
6279 expand_decl_init (vars
);
6280 vars
= TREE_CHAIN (vars
);
6283 temp
= expand_expr (TREE_OPERAND (exp
, 1), target
, tmode
, ro_modifier
);
6285 expand_end_bindings (TREE_OPERAND (exp
, 0), 0, 0);
6291 if (RTL_EXPR_SEQUENCE (exp
))
6293 if (RTL_EXPR_SEQUENCE (exp
) == const0_rtx
)
6295 emit_insns (RTL_EXPR_SEQUENCE (exp
));
6296 RTL_EXPR_SEQUENCE (exp
) = const0_rtx
;
6298 preserve_rtl_expr_result (RTL_EXPR_RTL (exp
));
6299 free_temps_for_rtl_expr (exp
);
6300 return RTL_EXPR_RTL (exp
);
6303 /* If we don't need the result, just ensure we evaluate any
6308 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
6309 expand_expr (TREE_VALUE (elt
), const0_rtx
, VOIDmode
,
6310 EXPAND_MEMORY_USE_BAD
);
6314 /* All elts simple constants => refer to a constant in memory. But
6315 if this is a non-BLKmode mode, let it store a field at a time
6316 since that should make a CONST_INT or CONST_DOUBLE when we
6317 fold. Likewise, if we have a target we can use, it is best to
6318 store directly into the target unless the type is large enough
6319 that memcpy will be used. If we are making an initializer and
6320 all operands are constant, put it in memory as well. */
6321 else if ((TREE_STATIC (exp
)
6322 && ((mode
== BLKmode
6323 && ! (target
!= 0 && safe_from_p (target
, exp
, 1)))
6324 || TREE_ADDRESSABLE (exp
)
6325 || (TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
6326 && (!MOVE_BY_PIECES_P
6327 (TREE_INT_CST_LOW (TYPE_SIZE (type
))/BITS_PER_UNIT
,
6328 TYPE_ALIGN (type
) / BITS_PER_UNIT
))
6329 && ! mostly_zeros_p (exp
))))
6330 || (modifier
== EXPAND_INITIALIZER
&& TREE_CONSTANT (exp
)))
6332 rtx constructor
= output_constant_def (exp
);
6333 if (modifier
!= EXPAND_CONST_ADDRESS
6334 && modifier
!= EXPAND_INITIALIZER
6335 && modifier
!= EXPAND_SUM
6336 && (! memory_address_p (GET_MODE (constructor
),
6337 XEXP (constructor
, 0))
6339 && GET_CODE (XEXP (constructor
, 0)) != REG
)))
6340 constructor
= change_address (constructor
, VOIDmode
,
6341 XEXP (constructor
, 0));
6347 /* Handle calls that pass values in multiple non-contiguous
6348 locations. The Irix 6 ABI has examples of this. */
6349 if (target
== 0 || ! safe_from_p (target
, exp
, 1)
6350 || GET_CODE (target
) == PARALLEL
)
6352 if (mode
!= BLKmode
&& ! TREE_ADDRESSABLE (exp
))
6353 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
6355 target
= assign_temp (type
, 0, 1, 1);
6358 if (TREE_READONLY (exp
))
6360 if (GET_CODE (target
) == MEM
)
6361 target
= copy_rtx (target
);
6363 RTX_UNCHANGING_P (target
) = 1;
6366 store_constructor (exp
, target
, TYPE_ALIGN (TREE_TYPE (exp
)), 0);
6372 tree exp1
= TREE_OPERAND (exp
, 0);
6375 tree string
= string_constant (exp1
, &index
);
6378 /* Try to optimize reads from const strings. */
6380 && TREE_CODE (string
) == STRING_CST
6381 && TREE_CODE (index
) == INTEGER_CST
6382 && !TREE_INT_CST_HIGH (index
)
6383 && (i
= TREE_INT_CST_LOW (index
)) < TREE_STRING_LENGTH (string
)
6384 && GET_MODE_CLASS (mode
) == MODE_INT
6385 && GET_MODE_SIZE (mode
) == 1
6386 && modifier
!= EXPAND_MEMORY_USE_WO
)
6387 return GEN_INT (TREE_STRING_POINTER (string
)[i
]);
6389 op0
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
6390 op0
= memory_address (mode
, op0
);
6392 if (cfun
&& current_function_check_memory_usage
6393 && ! AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
6395 enum memory_use_mode memory_usage
;
6396 memory_usage
= get_memory_usage_from_modifier (modifier
);
6398 if (memory_usage
!= MEMORY_USE_DONT
)
6400 in_check_memory_usage
= 1;
6401 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
6403 GEN_INT (int_size_in_bytes (type
)),
6404 TYPE_MODE (sizetype
),
6405 GEN_INT (memory_usage
),
6406 TYPE_MODE (integer_type_node
));
6407 in_check_memory_usage
= 0;
6411 temp
= gen_rtx_MEM (mode
, op0
);
6412 /* If address was computed by addition,
6413 mark this as an element of an aggregate. */
6414 if (TREE_CODE (exp1
) == PLUS_EXPR
6415 || (TREE_CODE (exp1
) == SAVE_EXPR
6416 && TREE_CODE (TREE_OPERAND (exp1
, 0)) == PLUS_EXPR
)
6417 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))
6418 || (TREE_CODE (exp1
) == ADDR_EXPR
6419 && (exp2
= TREE_OPERAND (exp1
, 0))
6420 && AGGREGATE_TYPE_P (TREE_TYPE (exp2
))))
6421 MEM_SET_IN_STRUCT_P (temp
, 1);
6423 MEM_VOLATILE_P (temp
) = TREE_THIS_VOLATILE (exp
) | flag_volatile
;
6424 MEM_ALIAS_SET (temp
) = get_alias_set (exp
);
6426 /* It is incorrect to set RTX_UNCHANGING_P from TREE_READONLY
6427 here, because, in C and C++, the fact that a location is accessed
6428 through a pointer to const does not mean that the value there can
6429 never change. Languages where it can never change should
6430 also set TREE_STATIC. */
6431 RTX_UNCHANGING_P (temp
) = TREE_READONLY (exp
) & TREE_STATIC (exp
);
6433 /* If we are writing to this object and its type is a record with
6434 readonly fields, we must mark it as readonly so it will
6435 conflict with readonly references to those fields. */
6436 if (modifier
== EXPAND_MEMORY_USE_WO
6437 && TREE_CODE (type
) == RECORD_TYPE
&& readonly_fields_p (type
))
6438 RTX_UNCHANGING_P (temp
) = 1;
6444 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) != ARRAY_TYPE
)
6448 tree array
= TREE_OPERAND (exp
, 0);
6449 tree domain
= TYPE_DOMAIN (TREE_TYPE (array
));
6450 tree low_bound
= domain
? TYPE_MIN_VALUE (domain
) : integer_zero_node
;
6451 tree index
= TREE_OPERAND (exp
, 1);
6452 tree index_type
= TREE_TYPE (index
);
6455 /* Optimize the special-case of a zero lower bound.
6457 We convert the low_bound to sizetype to avoid some problems
6458 with constant folding. (E.g. suppose the lower bound is 1,
6459 and its mode is QI. Without the conversion, (ARRAY
6460 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
6461 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
6463 But sizetype isn't quite right either (especially if
6464 the lowbound is negative). FIXME */
6466 if (! integer_zerop (low_bound
))
6467 index
= fold (build (MINUS_EXPR
, index_type
, index
,
6468 convert (sizetype
, low_bound
)));
6470 /* Fold an expression like: "foo"[2].
6471 This is not done in fold so it won't happen inside &.
6472 Don't fold if this is for wide characters since it's too
6473 difficult to do correctly and this is a very rare case. */
6475 if (TREE_CODE (array
) == STRING_CST
6476 && TREE_CODE (index
) == INTEGER_CST
6477 && !TREE_INT_CST_HIGH (index
)
6478 && (i
= TREE_INT_CST_LOW (index
)) < TREE_STRING_LENGTH (array
)
6479 && GET_MODE_CLASS (mode
) == MODE_INT
6480 && GET_MODE_SIZE (mode
) == 1)
6481 return GEN_INT (TREE_STRING_POINTER (array
)[i
]);
6483 /* If this is a constant index into a constant array,
6484 just get the value from the array. Handle both the cases when
6485 we have an explicit constructor and when our operand is a variable
6486 that was declared const. */
6488 if (TREE_CODE (array
) == CONSTRUCTOR
&& ! TREE_SIDE_EFFECTS (array
))
6490 if (TREE_CODE (index
) == INTEGER_CST
6491 && TREE_INT_CST_HIGH (index
) == 0)
6493 tree elem
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0));
6495 i
= TREE_INT_CST_LOW (index
);
6497 elem
= TREE_CHAIN (elem
);
6499 return expand_expr (fold (TREE_VALUE (elem
)), target
,
6500 tmode
, ro_modifier
);
6504 else if (optimize
>= 1
6505 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
6506 && TREE_CODE (array
) == VAR_DECL
&& DECL_INITIAL (array
)
6507 && TREE_CODE (DECL_INITIAL (array
)) != ERROR_MARK
)
6509 if (TREE_CODE (index
) == INTEGER_CST
)
6511 tree init
= DECL_INITIAL (array
);
6513 i
= TREE_INT_CST_LOW (index
);
6514 if (TREE_CODE (init
) == CONSTRUCTOR
)
6516 tree elem
= CONSTRUCTOR_ELTS (init
);
6519 && !tree_int_cst_equal (TREE_PURPOSE (elem
), index
))
6520 elem
= TREE_CHAIN (elem
);
6522 return expand_expr (fold (TREE_VALUE (elem
)), target
,
6523 tmode
, ro_modifier
);
6525 else if (TREE_CODE (init
) == STRING_CST
6526 && TREE_INT_CST_HIGH (index
) == 0
6527 && (TREE_INT_CST_LOW (index
)
6528 < TREE_STRING_LENGTH (init
)))
6530 (TREE_STRING_POINTER
6531 (init
)[TREE_INT_CST_LOW (index
)]));
6536 /* ... fall through ... */
6540 /* If the operand is a CONSTRUCTOR, we can just extract the
6541 appropriate field if it is present. Don't do this if we have
6542 already written the data since we want to refer to that copy
6543 and varasm.c assumes that's what we'll do. */
6544 if (code
!= ARRAY_REF
6545 && TREE_CODE (TREE_OPERAND (exp
, 0)) == CONSTRUCTOR
6546 && TREE_CST_RTL (TREE_OPERAND (exp
, 0)) == 0)
6550 for (elt
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0)); elt
;
6551 elt
= TREE_CHAIN (elt
))
6552 if (TREE_PURPOSE (elt
) == TREE_OPERAND (exp
, 1)
6553 /* We can normally use the value of the field in the
6554 CONSTRUCTOR. However, if this is a bitfield in
6555 an integral mode that we can fit in a HOST_WIDE_INT,
6556 we must mask only the number of bits in the bitfield,
6557 since this is done implicitly by the constructor. If
6558 the bitfield does not meet either of those conditions,
6559 we can't do this optimization. */
6560 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt
))
6561 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt
)))
6563 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt
)))
6564 <= HOST_BITS_PER_WIDE_INT
))))
6566 op0
= expand_expr (TREE_VALUE (elt
), target
, tmode
, modifier
);
6567 if (DECL_BIT_FIELD (TREE_PURPOSE (elt
)))
6569 int bitsize
= DECL_FIELD_SIZE (TREE_PURPOSE (elt
));
6571 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt
))))
6573 op1
= GEN_INT (((HOST_WIDE_INT
) 1 << bitsize
) - 1);
6574 op0
= expand_and (op0
, op1
, target
);
6578 enum machine_mode imode
6579 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt
)));
6581 = build_int_2 (GET_MODE_BITSIZE (imode
) - bitsize
,
6584 op0
= expand_shift (LSHIFT_EXPR
, imode
, op0
, count
,
6586 op0
= expand_shift (RSHIFT_EXPR
, imode
, op0
, count
,
6596 enum machine_mode mode1
;
6602 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
6603 &mode1
, &unsignedp
, &volatilep
,
6606 /* If we got back the original object, something is wrong. Perhaps
6607 we are evaluating an expression too early. In any event, don't
6608 infinitely recurse. */
6612 /* If TEM's type is a union of variable size, pass TARGET to the inner
6613 computation, since it will need a temporary and TARGET is known
6614 to have to do. This occurs in unchecked conversion in Ada. */
6616 op0
= expand_expr (tem
,
6617 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
6618 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
6620 ? target
: NULL_RTX
),
6622 (modifier
== EXPAND_INITIALIZER
6623 || modifier
== EXPAND_CONST_ADDRESS
)
6624 ? modifier
: EXPAND_NORMAL
);
6626 /* If this is a constant, put it into a register if it is a
6627 legitimate constant and OFFSET is 0 and memory if it isn't. */
6628 if (CONSTANT_P (op0
))
6630 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (tem
));
6631 if (mode
!= BLKmode
&& LEGITIMATE_CONSTANT_P (op0
)
6633 op0
= force_reg (mode
, op0
);
6635 op0
= validize_mem (force_const_mem (mode
, op0
));
6640 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, 0);
6642 /* If this object is in memory, put it into a register.
6643 This case can't occur in C, but can in Ada if we have
6644 unchecked conversion of an expression from a scalar type to
6645 an array or record type. */
6646 if (GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
6647 || GET_CODE (op0
) == CONCAT
|| GET_CODE (op0
) == ADDRESSOF
)
6649 rtx memloc
= assign_temp (TREE_TYPE (tem
), 1, 1, 1);
6651 mark_temp_addr_taken (memloc
);
6652 emit_move_insn (memloc
, op0
);
6656 if (GET_CODE (op0
) != MEM
)
6659 if (GET_MODE (offset_rtx
) != ptr_mode
)
6661 #ifdef POINTERS_EXTEND_UNSIGNED
6662 offset_rtx
= convert_memory_address (ptr_mode
, offset_rtx
);
6664 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
6668 /* A constant address in OP0 can have VOIDmode, we must not try
6669 to call force_reg for that case. Avoid that case. */
6670 if (GET_CODE (op0
) == MEM
6671 && GET_MODE (op0
) == BLKmode
6672 && GET_MODE (XEXP (op0
, 0)) != VOIDmode
6674 && (bitpos
% bitsize
) == 0
6675 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
6676 && (alignment
* BITS_PER_UNIT
) == GET_MODE_ALIGNMENT (mode1
))
6678 rtx temp
= change_address (op0
, mode1
,
6679 plus_constant (XEXP (op0
, 0),
6682 if (GET_CODE (XEXP (temp
, 0)) == REG
)
6685 op0
= change_address (op0
, mode1
,
6686 force_reg (GET_MODE (XEXP (temp
, 0)),
6692 op0
= change_address (op0
, VOIDmode
,
6693 gen_rtx_PLUS (ptr_mode
, XEXP (op0
, 0),
6694 force_reg (ptr_mode
,
6698 /* Don't forget about volatility even if this is a bitfield. */
6699 if (GET_CODE (op0
) == MEM
&& volatilep
&& ! MEM_VOLATILE_P (op0
))
6701 op0
= copy_rtx (op0
);
6702 MEM_VOLATILE_P (op0
) = 1;
6705 /* Check the access. */
6706 if (current_function_check_memory_usage
&& GET_CODE (op0
) == MEM
)
6708 enum memory_use_mode memory_usage
;
6709 memory_usage
= get_memory_usage_from_modifier (modifier
);
6711 if (memory_usage
!= MEMORY_USE_DONT
)
6716 to
= plus_constant (XEXP (op0
, 0), (bitpos
/ BITS_PER_UNIT
));
6717 size
= (bitpos
% BITS_PER_UNIT
) + bitsize
+ BITS_PER_UNIT
- 1;
6719 /* Check the access right of the pointer. */
6720 if (size
> BITS_PER_UNIT
)
6721 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
6723 GEN_INT (size
/ BITS_PER_UNIT
),
6724 TYPE_MODE (sizetype
),
6725 GEN_INT (memory_usage
),
6726 TYPE_MODE (integer_type_node
));
6730 /* In cases where an aligned union has an unaligned object
6731 as a field, we might be extracting a BLKmode value from
6732 an integer-mode (e.g., SImode) object. Handle this case
6733 by doing the extract into an object as wide as the field
6734 (which we know to be the width of a basic mode), then
6735 storing into memory, and changing the mode to BLKmode.
6736 If we ultimately want the address (EXPAND_CONST_ADDRESS or
6737 EXPAND_INITIALIZER), then we must not copy to a temporary. */
6738 if (mode1
== VOIDmode
6739 || GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
6740 || (modifier
!= EXPAND_CONST_ADDRESS
6741 && modifier
!= EXPAND_INITIALIZER
6742 && ((mode1
!= BLKmode
&& ! direct_load
[(int) mode1
]
6743 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
6744 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
6745 /* If the field isn't aligned enough to fetch as a memref,
6746 fetch it as a bit field. */
6747 || (mode1
!= BLKmode
&& SLOW_UNALIGNED_ACCESS
6748 && ((TYPE_ALIGN (TREE_TYPE (tem
))
6749 < (unsigned int) GET_MODE_ALIGNMENT (mode
))
6750 || (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0)))))
6751 || (modifier
!= EXPAND_CONST_ADDRESS
6752 && modifier
!= EXPAND_INITIALIZER
6754 && SLOW_UNALIGNED_ACCESS
6755 && (TYPE_ALIGN (type
) > alignment
* BITS_PER_UNIT
6756 || bitpos
% TYPE_ALIGN (type
) != 0)))
6758 enum machine_mode ext_mode
= mode
;
6760 if (ext_mode
== BLKmode
6761 && ! (target
!= 0 && GET_CODE (op0
) == MEM
6762 && GET_CODE (target
) == MEM
6763 && bitpos
% BITS_PER_UNIT
== 0))
6764 ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
6766 if (ext_mode
== BLKmode
)
6768 /* In this case, BITPOS must start at a byte boundary and
6769 TARGET, if specified, must be a MEM. */
6770 if (GET_CODE (op0
) != MEM
6771 || (target
!= 0 && GET_CODE (target
) != MEM
)
6772 || bitpos
% BITS_PER_UNIT
!= 0)
6775 op0
= change_address (op0
, VOIDmode
,
6776 plus_constant (XEXP (op0
, 0),
6777 bitpos
/ BITS_PER_UNIT
));
6779 target
= assign_temp (type
, 0, 1, 1);
6781 emit_block_move (target
, op0
,
6782 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
6789 op0
= validize_mem (op0
);
6791 if (GET_CODE (op0
) == MEM
&& GET_CODE (XEXP (op0
, 0)) == REG
)
6792 mark_reg_pointer (XEXP (op0
, 0), alignment
);
6794 op0
= extract_bit_field (op0
, bitsize
, bitpos
,
6795 unsignedp
, target
, ext_mode
, ext_mode
,
6797 int_size_in_bytes (TREE_TYPE (tem
)));
6799 /* If the result is a record type and BITSIZE is narrower than
6800 the mode of OP0, an integral mode, and this is a big endian
6801 machine, we must put the field into the high-order bits. */
6802 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
6803 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
6804 && bitsize
< GET_MODE_BITSIZE (GET_MODE (op0
)))
6805 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
6806 size_int (GET_MODE_BITSIZE (GET_MODE (op0
))
6810 if (mode
== BLKmode
)
6812 rtx
new = assign_stack_temp (ext_mode
,
6813 bitsize
/ BITS_PER_UNIT
, 0);
6815 emit_move_insn (new, op0
);
6816 op0
= copy_rtx (new);
6817 PUT_MODE (op0
, BLKmode
);
6818 MEM_SET_IN_STRUCT_P (op0
, 1);
6824 /* If the result is BLKmode, use that to access the object
6826 if (mode
== BLKmode
)
6829 /* Get a reference to just this component. */
6830 if (modifier
== EXPAND_CONST_ADDRESS
6831 || modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
6832 op0
= gen_rtx_MEM (mode1
, plus_constant (XEXP (op0
, 0),
6833 (bitpos
/ BITS_PER_UNIT
)));
6835 op0
= change_address (op0
, mode1
,
6836 plus_constant (XEXP (op0
, 0),
6837 (bitpos
/ BITS_PER_UNIT
)));
6839 if (GET_CODE (op0
) == MEM
)
6840 MEM_ALIAS_SET (op0
) = get_alias_set (exp
);
6842 if (GET_CODE (XEXP (op0
, 0)) == REG
)
6843 mark_reg_pointer (XEXP (op0
, 0), alignment
);
6845 MEM_SET_IN_STRUCT_P (op0
, 1);
6846 MEM_VOLATILE_P (op0
) |= volatilep
;
6847 if (mode
== mode1
|| mode1
== BLKmode
|| mode1
== tmode
6848 || modifier
== EXPAND_CONST_ADDRESS
6849 || modifier
== EXPAND_INITIALIZER
)
6851 else if (target
== 0)
6852 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
6854 convert_move (target
, op0
, unsignedp
);
6858 /* Intended for a reference to a buffer of a file-object in Pascal.
6859 But it's not certain that a special tree code will really be
6860 necessary for these. INDIRECT_REF might work for them. */
6866 /* Pascal set IN expression.
6869 rlo = set_low - (set_low%bits_per_word);
6870 the_word = set [ (index - rlo)/bits_per_word ];
6871 bit_index = index % bits_per_word;
6872 bitmask = 1 << bit_index;
6873 return !!(the_word & bitmask); */
6875 tree set
= TREE_OPERAND (exp
, 0);
6876 tree index
= TREE_OPERAND (exp
, 1);
6877 int iunsignedp
= TREE_UNSIGNED (TREE_TYPE (index
));
6878 tree set_type
= TREE_TYPE (set
);
6879 tree set_low_bound
= TYPE_MIN_VALUE (TYPE_DOMAIN (set_type
));
6880 tree set_high_bound
= TYPE_MAX_VALUE (TYPE_DOMAIN (set_type
));
6881 rtx index_val
= expand_expr (index
, 0, VOIDmode
, 0);
6882 rtx lo_r
= expand_expr (set_low_bound
, 0, VOIDmode
, 0);
6883 rtx hi_r
= expand_expr (set_high_bound
, 0, VOIDmode
, 0);
6884 rtx setval
= expand_expr (set
, 0, VOIDmode
, 0);
6885 rtx setaddr
= XEXP (setval
, 0);
6886 enum machine_mode index_mode
= TYPE_MODE (TREE_TYPE (index
));
6888 rtx diff
, quo
, rem
, addr
, bit
, result
;
6890 preexpand_calls (exp
);
6892 /* If domain is empty, answer is no. Likewise if index is constant
6893 and out of bounds. */
6894 if (((TREE_CODE (set_high_bound
) == INTEGER_CST
6895 && TREE_CODE (set_low_bound
) == INTEGER_CST
6896 && tree_int_cst_lt (set_high_bound
, set_low_bound
))
6897 || (TREE_CODE (index
) == INTEGER_CST
6898 && TREE_CODE (set_low_bound
) == INTEGER_CST
6899 && tree_int_cst_lt (index
, set_low_bound
))
6900 || (TREE_CODE (set_high_bound
) == INTEGER_CST
6901 && TREE_CODE (index
) == INTEGER_CST
6902 && tree_int_cst_lt (set_high_bound
, index
))))
6906 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
6908 /* If we get here, we have to generate the code for both cases
6909 (in range and out of range). */
6911 op0
= gen_label_rtx ();
6912 op1
= gen_label_rtx ();
6914 if (! (GET_CODE (index_val
) == CONST_INT
6915 && GET_CODE (lo_r
) == CONST_INT
))
6917 emit_cmp_and_jump_insns (index_val
, lo_r
, LT
, NULL_RTX
,
6918 GET_MODE (index_val
), iunsignedp
, 0, op1
);
6921 if (! (GET_CODE (index_val
) == CONST_INT
6922 && GET_CODE (hi_r
) == CONST_INT
))
6924 emit_cmp_and_jump_insns (index_val
, hi_r
, GT
, NULL_RTX
,
6925 GET_MODE (index_val
), iunsignedp
, 0, op1
);
6928 /* Calculate the element number of bit zero in the first word
6930 if (GET_CODE (lo_r
) == CONST_INT
)
6931 rlow
= GEN_INT (INTVAL (lo_r
)
6932 & ~ ((HOST_WIDE_INT
) 1 << BITS_PER_UNIT
));
6934 rlow
= expand_binop (index_mode
, and_optab
, lo_r
,
6935 GEN_INT (~((HOST_WIDE_INT
) 1 << BITS_PER_UNIT
)),
6936 NULL_RTX
, iunsignedp
, OPTAB_LIB_WIDEN
);
6938 diff
= expand_binop (index_mode
, sub_optab
, index_val
, rlow
,
6939 NULL_RTX
, iunsignedp
, OPTAB_LIB_WIDEN
);
6941 quo
= expand_divmod (0, TRUNC_DIV_EXPR
, index_mode
, diff
,
6942 GEN_INT (BITS_PER_UNIT
), NULL_RTX
, iunsignedp
);
6943 rem
= expand_divmod (1, TRUNC_MOD_EXPR
, index_mode
, index_val
,
6944 GEN_INT (BITS_PER_UNIT
), NULL_RTX
, iunsignedp
);
6946 addr
= memory_address (byte_mode
,
6947 expand_binop (index_mode
, add_optab
, diff
,
6948 setaddr
, NULL_RTX
, iunsignedp
,
6951 /* Extract the bit we want to examine */
6952 bit
= expand_shift (RSHIFT_EXPR
, byte_mode
,
6953 gen_rtx_MEM (byte_mode
, addr
),
6954 make_tree (TREE_TYPE (index
), rem
),
6956 result
= expand_binop (byte_mode
, and_optab
, bit
, const1_rtx
,
6957 GET_MODE (target
) == byte_mode
? target
: 0,
6958 1, OPTAB_LIB_WIDEN
);
6960 if (result
!= target
)
6961 convert_move (target
, result
, 1);
6963 /* Output the code to handle the out-of-range case. */
6966 emit_move_insn (target
, const0_rtx
);
6971 case WITH_CLEANUP_EXPR
:
6972 if (RTL_EXPR_RTL (exp
) == 0)
6975 = expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, ro_modifier
);
6976 expand_decl_cleanup (NULL_TREE
, TREE_OPERAND (exp
, 2));
6978 /* That's it for this cleanup. */
6979 TREE_OPERAND (exp
, 2) = 0;
6981 return RTL_EXPR_RTL (exp
);
6983 case CLEANUP_POINT_EXPR
:
6985 /* Start a new binding layer that will keep track of all cleanup
6986 actions to be performed. */
6987 expand_start_bindings (2);
6989 target_temp_slot_level
= temp_slot_level
;
6991 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, ro_modifier
);
6992 /* If we're going to use this value, load it up now. */
6994 op0
= force_not_mem (op0
);
6995 preserve_temp_slots (op0
);
6996 expand_end_bindings (NULL_TREE
, 0, 0);
7001 /* Check for a built-in function. */
7002 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
7003 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
7005 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7006 return expand_builtin (exp
, target
, subtarget
, tmode
, ignore
);
7008 /* If this call was expanded already by preexpand_calls,
7009 just return the result we got. */
7010 if (CALL_EXPR_RTL (exp
) != 0)
7011 return CALL_EXPR_RTL (exp
);
7013 return expand_call (exp
, target
, ignore
);
7015 case NON_LVALUE_EXPR
:
7018 case REFERENCE_EXPR
:
7019 if (TREE_CODE (type
) == UNION_TYPE
)
7021 tree valtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7023 /* If both input and output are BLKmode, this conversion
7024 isn't actually doing anything unless we need to make the
7025 alignment stricter. */
7026 if (mode
== BLKmode
&& TYPE_MODE (valtype
) == BLKmode
7027 && (TYPE_ALIGN (type
) <= TYPE_ALIGN (valtype
)
7028 || TYPE_ALIGN (type
) >= BIGGEST_ALIGNMENT
))
7029 return expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
,
7034 if (mode
!= BLKmode
)
7035 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
7037 target
= assign_temp (type
, 0, 1, 1);
7040 if (GET_CODE (target
) == MEM
)
7041 /* Store data into beginning of memory target. */
7042 store_expr (TREE_OPERAND (exp
, 0),
7043 change_address (target
, TYPE_MODE (valtype
), 0), 0);
7045 else if (GET_CODE (target
) == REG
)
7046 /* Store this field into a union of the proper type. */
7047 store_field (target
,
7048 MIN ((int_size_in_bytes (TREE_TYPE
7049 (TREE_OPERAND (exp
, 0)))
7051 GET_MODE_BITSIZE (mode
)),
7052 0, TYPE_MODE (valtype
), TREE_OPERAND (exp
, 0),
7053 VOIDmode
, 0, 1, int_size_in_bytes (type
), 0);
7057 /* Return the entire union. */
7061 if (mode
== TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
7063 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
,
7066 /* If the signedness of the conversion differs and OP0 is
7067 a promoted SUBREG, clear that indication since we now
7068 have to do the proper extension. */
7069 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))) != unsignedp
7070 && GET_CODE (op0
) == SUBREG
)
7071 SUBREG_PROMOTED_VAR_P (op0
) = 0;
7076 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, mode
, 0);
7077 if (GET_MODE (op0
) == mode
)
7080 /* If OP0 is a constant, just convert it into the proper mode. */
7081 if (CONSTANT_P (op0
))
7083 convert_modes (mode
, TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
7084 op0
, TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7086 if (modifier
== EXPAND_INITIALIZER
)
7087 return gen_rtx_fmt_e (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
);
7091 convert_to_mode (mode
, op0
,
7092 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7094 convert_move (target
, op0
,
7095 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7099 /* We come here from MINUS_EXPR when the second operand is a
7102 this_optab
= add_optab
;
7104 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
7105 something else, make sure we add the register to the constant and
7106 then to the other thing. This case can occur during strength
7107 reduction and doing it this way will produce better code if the
7108 frame pointer or argument pointer is eliminated.
7110 fold-const.c will ensure that the constant is always in the inner
7111 PLUS_EXPR, so the only case we need to do anything about is if
7112 sp, ap, or fp is our second argument, in which case we must swap
7113 the innermost first argument and our second argument. */
7115 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == PLUS_EXPR
7116 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1)) == INTEGER_CST
7117 && TREE_CODE (TREE_OPERAND (exp
, 1)) == RTL_EXPR
7118 && (RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == frame_pointer_rtx
7119 || RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == stack_pointer_rtx
7120 || RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == arg_pointer_rtx
))
7122 tree t
= TREE_OPERAND (exp
, 1);
7124 TREE_OPERAND (exp
, 1) = TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
7125 TREE_OPERAND (TREE_OPERAND (exp
, 0), 0) = t
;
7128 /* If the result is to be ptr_mode and we are adding an integer to
7129 something, we might be forming a constant. So try to use
7130 plus_constant. If it produces a sum and we can't accept it,
7131 use force_operand. This allows P = &ARR[const] to generate
7132 efficient code on machines where a SYMBOL_REF is not a valid
7135 If this is an EXPAND_SUM call, always return the sum. */
7136 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
7137 || mode
== ptr_mode
)
7139 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
7140 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
7141 && TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
7145 op1
= expand_expr (TREE_OPERAND (exp
, 1), subtarget
, VOIDmode
,
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
, 0)),
7154 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))));
7155 op1
= plus_constant (op1
, INTVAL (constant_part
));
7156 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
7157 op1
= force_operand (op1
, target
);
7161 else if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
7162 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_INT
7163 && TREE_CONSTANT (TREE_OPERAND (exp
, 0)))
7167 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
7169 if (! CONSTANT_P (op0
))
7171 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
7172 VOIDmode
, modifier
);
7173 /* Don't go to both_summands if modifier
7174 says it's not right to return a PLUS. */
7175 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
7179 /* Use immed_double_const to ensure that the constant is
7180 truncated according to the mode of OP1, then sign extended
7181 to a HOST_WIDE_INT. Using the constant directly can result
7182 in non-canonical RTL in a 64x32 cross compile. */
7184 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1)),
7186 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7187 op0
= plus_constant (op0
, INTVAL (constant_part
));
7188 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
7189 op0
= force_operand (op0
, target
);
7194 /* No sense saving up arithmetic to be done
7195 if it's all in the wrong mode to form part of an address.
7196 And force_operand won't know whether to sign-extend or
7198 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
7199 || mode
!= ptr_mode
)
7202 preexpand_calls (exp
);
7203 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
7206 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, ro_modifier
);
7207 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, ro_modifier
);
7210 /* Make sure any term that's a sum with a constant comes last. */
7211 if (GET_CODE (op0
) == PLUS
7212 && CONSTANT_P (XEXP (op0
, 1)))
7218 /* If adding to a sum including a constant,
7219 associate it to put the constant outside. */
7220 if (GET_CODE (op1
) == PLUS
7221 && CONSTANT_P (XEXP (op1
, 1)))
7223 rtx constant_term
= const0_rtx
;
7225 temp
= simplify_binary_operation (PLUS
, mode
, XEXP (op1
, 0), op0
);
7228 /* Ensure that MULT comes first if there is one. */
7229 else if (GET_CODE (op0
) == MULT
)
7230 op0
= gen_rtx_PLUS (mode
, op0
, XEXP (op1
, 0));
7232 op0
= gen_rtx_PLUS (mode
, XEXP (op1
, 0), op0
);
7234 /* Let's also eliminate constants from op0 if possible. */
7235 op0
= eliminate_constant_term (op0
, &constant_term
);
7237 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
7238 their sum should be a constant. Form it into OP1, since the
7239 result we want will then be OP0 + OP1. */
7241 temp
= simplify_binary_operation (PLUS
, mode
, constant_term
,
7246 op1
= gen_rtx_PLUS (mode
, constant_term
, XEXP (op1
, 1));
7249 /* Put a constant term last and put a multiplication first. */
7250 if (CONSTANT_P (op0
) || GET_CODE (op1
) == MULT
)
7251 temp
= op1
, op1
= op0
, op0
= temp
;
7253 temp
= simplify_binary_operation (PLUS
, mode
, op0
, op1
);
7254 return temp
? temp
: gen_rtx_PLUS (mode
, op0
, op1
);
7257 /* For initializers, we are allowed to return a MINUS of two
7258 symbolic constants. Here we handle all cases when both operands
7260 /* Handle difference of two symbolic constants,
7261 for the sake of an initializer. */
7262 if ((modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
7263 && really_constant_p (TREE_OPERAND (exp
, 0))
7264 && really_constant_p (TREE_OPERAND (exp
, 1)))
7266 rtx op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
,
7267 VOIDmode
, ro_modifier
);
7268 rtx op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
7269 VOIDmode
, ro_modifier
);
7271 /* If the last operand is a CONST_INT, use plus_constant of
7272 the negated constant. Else make the MINUS. */
7273 if (GET_CODE (op1
) == CONST_INT
)
7274 return plus_constant (op0
, - INTVAL (op1
));
7276 return gen_rtx_MINUS (mode
, op0
, op1
);
7278 /* Convert A - const to A + (-const). */
7279 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
7281 tree negated
= fold (build1 (NEGATE_EXPR
, type
,
7282 TREE_OPERAND (exp
, 1)));
7284 if (TREE_UNSIGNED (type
) || TREE_OVERFLOW (negated
))
7285 /* If we can't negate the constant in TYPE, leave it alone and
7286 expand_binop will negate it for us. We used to try to do it
7287 here in the signed version of TYPE, but that doesn't work
7288 on POINTER_TYPEs. */;
7291 exp
= build (PLUS_EXPR
, type
, TREE_OPERAND (exp
, 0), negated
);
7295 this_optab
= sub_optab
;
7299 preexpand_calls (exp
);
7300 /* If first operand is constant, swap them.
7301 Thus the following special case checks need only
7302 check the second operand. */
7303 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
)
7305 register tree t1
= TREE_OPERAND (exp
, 0);
7306 TREE_OPERAND (exp
, 0) = TREE_OPERAND (exp
, 1);
7307 TREE_OPERAND (exp
, 1) = t1
;
7310 /* Attempt to return something suitable for generating an
7311 indexed address, for machines that support that. */
7313 if (modifier
== EXPAND_SUM
&& mode
== ptr_mode
7314 && TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
7315 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
7317 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
7320 /* Apply distributive law if OP0 is x+c. */
7321 if (GET_CODE (op0
) == PLUS
7322 && GET_CODE (XEXP (op0
, 1)) == CONST_INT
)
7327 (mode
, XEXP (op0
, 0),
7328 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1)))),
7329 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1))
7330 * INTVAL (XEXP (op0
, 1))));
7332 if (GET_CODE (op0
) != REG
)
7333 op0
= force_operand (op0
, NULL_RTX
);
7334 if (GET_CODE (op0
) != REG
)
7335 op0
= copy_to_mode_reg (mode
, op0
);
7338 gen_rtx_MULT (mode
, op0
,
7339 GEN_INT (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1))));
7342 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
7345 /* Check for multiplying things that have been extended
7346 from a narrower type. If this machine supports multiplying
7347 in that narrower type with a result in the desired type,
7348 do it that way, and avoid the explicit type-conversion. */
7349 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == NOP_EXPR
7350 && TREE_CODE (type
) == INTEGER_TYPE
7351 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7352 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))))
7353 && ((TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
7354 && int_fits_type_p (TREE_OPERAND (exp
, 1),
7355 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7356 /* Don't use a widening multiply if a shift will do. */
7357 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
7358 > HOST_BITS_PER_WIDE_INT
)
7359 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1))) < 0))
7361 (TREE_CODE (TREE_OPERAND (exp
, 1)) == NOP_EXPR
7362 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
7364 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))))
7365 /* If both operands are extended, they must either both
7366 be zero-extended or both be sign-extended. */
7367 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
7369 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))))))
7371 enum machine_mode innermode
7372 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)));
7373 optab other_optab
= (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7374 ? smul_widen_optab
: umul_widen_optab
);
7375 this_optab
= (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7376 ? umul_widen_optab
: smul_widen_optab
);
7377 if (mode
== GET_MODE_WIDER_MODE (innermode
))
7379 if (this_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
7381 op0
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
7382 NULL_RTX
, VOIDmode
, 0);
7383 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
7384 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
7387 op1
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0),
7388 NULL_RTX
, VOIDmode
, 0);
7391 else if (other_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
7392 && innermode
== word_mode
)
7395 op0
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
7396 NULL_RTX
, VOIDmode
, 0);
7397 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
7398 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
7401 op1
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0),
7402 NULL_RTX
, VOIDmode
, 0);
7403 temp
= expand_binop (mode
, other_optab
, op0
, op1
, target
,
7404 unsignedp
, OPTAB_LIB_WIDEN
);
7405 htem
= expand_mult_highpart_adjust (innermode
,
7406 gen_highpart (innermode
, temp
),
7408 gen_highpart (innermode
, temp
),
7410 emit_move_insn (gen_highpart (innermode
, temp
), htem
);
7415 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7416 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
7417 return expand_mult (mode
, op0
, op1
, target
, unsignedp
);
7419 case TRUNC_DIV_EXPR
:
7420 case FLOOR_DIV_EXPR
:
7422 case ROUND_DIV_EXPR
:
7423 case EXACT_DIV_EXPR
:
7424 preexpand_calls (exp
);
7425 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
7427 /* Possible optimization: compute the dividend with EXPAND_SUM
7428 then if the divisor is constant can optimize the case
7429 where some terms of the dividend have coeffs divisible by it. */
7430 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7431 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
7432 return expand_divmod (0, code
, mode
, op0
, op1
, target
, unsignedp
);
7435 this_optab
= flodiv_optab
;
7438 case TRUNC_MOD_EXPR
:
7439 case FLOOR_MOD_EXPR
:
7441 case ROUND_MOD_EXPR
:
7442 preexpand_calls (exp
);
7443 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
7445 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7446 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
7447 return expand_divmod (1, code
, mode
, op0
, op1
, target
, unsignedp
);
7449 case FIX_ROUND_EXPR
:
7450 case FIX_FLOOR_EXPR
:
7452 abort (); /* Not used for C. */
7454 case FIX_TRUNC_EXPR
:
7455 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
7457 target
= gen_reg_rtx (mode
);
7458 expand_fix (target
, op0
, unsignedp
);
7462 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
7464 target
= gen_reg_rtx (mode
);
7465 /* expand_float can't figure out what to do if FROM has VOIDmode.
7466 So give it the correct mode. With -O, cse will optimize this. */
7467 if (GET_MODE (op0
) == VOIDmode
)
7468 op0
= copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
7470 expand_float (target
, op0
,
7471 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7475 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7476 temp
= expand_unop (mode
, neg_optab
, op0
, target
, 0);
7482 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7484 /* Handle complex values specially. */
7485 if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_INT
7486 || GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
7487 return expand_complex_abs (mode
, op0
, target
, unsignedp
);
7489 /* Unsigned abs is simply the operand. Testing here means we don't
7490 risk generating incorrect code below. */
7491 if (TREE_UNSIGNED (type
))
7494 return expand_abs (mode
, op0
, target
,
7495 safe_from_p (target
, TREE_OPERAND (exp
, 0), 1));
7499 target
= original_target
;
7500 if (target
== 0 || ! safe_from_p (target
, TREE_OPERAND (exp
, 1), 1)
7501 || (GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
))
7502 || GET_MODE (target
) != mode
7503 || (GET_CODE (target
) == REG
7504 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
7505 target
= gen_reg_rtx (mode
);
7506 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
7507 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
, 0);
7509 /* First try to do it with a special MIN or MAX instruction.
7510 If that does not win, use a conditional jump to select the proper
7512 this_optab
= (TREE_UNSIGNED (type
)
7513 ? (code
== MIN_EXPR
? umin_optab
: umax_optab
)
7514 : (code
== MIN_EXPR
? smin_optab
: smax_optab
));
7516 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
7521 /* At this point, a MEM target is no longer useful; we will get better
7524 if (GET_CODE (target
) == MEM
)
7525 target
= gen_reg_rtx (mode
);
7528 emit_move_insn (target
, op0
);
7530 op0
= gen_label_rtx ();
7532 /* If this mode is an integer too wide to compare properly,
7533 compare word by word. Rely on cse to optimize constant cases. */
7534 if (GET_MODE_CLASS (mode
) == MODE_INT
&& ! can_compare_p (mode
, ccp_jump
))
7536 if (code
== MAX_EXPR
)
7537 do_jump_by_parts_greater_rtx (mode
, TREE_UNSIGNED (type
),
7538 target
, op1
, NULL_RTX
, op0
);
7540 do_jump_by_parts_greater_rtx (mode
, TREE_UNSIGNED (type
),
7541 op1
, target
, NULL_RTX
, op0
);
7545 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 1)));
7546 do_compare_rtx_and_jump (target
, op1
, code
== MAX_EXPR
? GE
: LE
,
7547 unsignedp
, mode
, NULL_RTX
, 0, NULL_RTX
,
7550 emit_move_insn (target
, op1
);
7555 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7556 temp
= expand_unop (mode
, one_cmpl_optab
, op0
, target
, 1);
7562 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7563 temp
= expand_unop (mode
, ffs_optab
, op0
, target
, 1);
7568 /* ??? Can optimize bitwise operations with one arg constant.
7569 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7570 and (a bitwise1 b) bitwise2 b (etc)
7571 but that is probably not worth while. */
7573 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7574 boolean values when we want in all cases to compute both of them. In
7575 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7576 as actual zero-or-1 values and then bitwise anding. In cases where
7577 there cannot be any side effects, better code would be made by
7578 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7579 how to recognize those cases. */
7581 case TRUTH_AND_EXPR
:
7583 this_optab
= and_optab
;
7588 this_optab
= ior_optab
;
7591 case TRUTH_XOR_EXPR
:
7593 this_optab
= xor_optab
;
7600 preexpand_calls (exp
);
7601 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
7603 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
7604 return expand_shift (code
, mode
, op0
, TREE_OPERAND (exp
, 1), target
,
7607 /* Could determine the answer when only additive constants differ. Also,
7608 the addition of one can be handled by changing the condition. */
7615 preexpand_calls (exp
);
7616 temp
= do_store_flag (exp
, target
, tmode
!= VOIDmode
? tmode
: mode
, 0);
7620 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
7621 if (code
== NE_EXPR
&& integer_zerop (TREE_OPERAND (exp
, 1))
7623 && GET_CODE (original_target
) == REG
7624 && (GET_MODE (original_target
)
7625 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
7627 temp
= expand_expr (TREE_OPERAND (exp
, 0), original_target
,
7630 if (temp
!= original_target
)
7631 temp
= copy_to_reg (temp
);
7633 op1
= gen_label_rtx ();
7634 emit_cmp_and_jump_insns (temp
, const0_rtx
, EQ
, NULL_RTX
,
7635 GET_MODE (temp
), unsignedp
, 0, op1
);
7636 emit_move_insn (temp
, const1_rtx
);
7641 /* If no set-flag instruction, must generate a conditional
7642 store into a temporary variable. Drop through
7643 and handle this like && and ||. */
7645 case TRUTH_ANDIF_EXPR
:
7646 case TRUTH_ORIF_EXPR
:
7648 && (target
== 0 || ! safe_from_p (target
, exp
, 1)
7649 /* Make sure we don't have a hard reg (such as function's return
7650 value) live across basic blocks, if not optimizing. */
7651 || (!optimize
&& GET_CODE (target
) == REG
7652 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)))
7653 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
7656 emit_clr_insn (target
);
7658 op1
= gen_label_rtx ();
7659 jumpifnot (exp
, op1
);
7662 emit_0_to_1_insn (target
);
7665 return ignore
? const0_rtx
: target
;
7667 case TRUTH_NOT_EXPR
:
7668 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
, 0);
7669 /* The parser is careful to generate TRUTH_NOT_EXPR
7670 only with operands that are always zero or one. */
7671 temp
= expand_binop (mode
, xor_optab
, op0
, const1_rtx
,
7672 target
, 1, OPTAB_LIB_WIDEN
);
7678 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, 0);
7680 return expand_expr (TREE_OPERAND (exp
, 1),
7681 (ignore
? const0_rtx
: target
),
7685 /* If we would have a "singleton" (see below) were it not for a
7686 conversion in each arm, bring that conversion back out. */
7687 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == NOP_EXPR
7688 && TREE_CODE (TREE_OPERAND (exp
, 2)) == NOP_EXPR
7689 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0))
7690 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 2), 0))))
7692 tree
true = TREE_OPERAND (TREE_OPERAND (exp
, 1), 0);
7693 tree
false = TREE_OPERAND (TREE_OPERAND (exp
, 2), 0);
7695 if ((TREE_CODE_CLASS (TREE_CODE (true)) == '2'
7696 && operand_equal_p (false, TREE_OPERAND (true, 0), 0))
7697 || (TREE_CODE_CLASS (TREE_CODE (false)) == '2'
7698 && operand_equal_p (true, TREE_OPERAND (false, 0), 0))
7699 || (TREE_CODE_CLASS (TREE_CODE (true)) == '1'
7700 && operand_equal_p (false, TREE_OPERAND (true, 0), 0))
7701 || (TREE_CODE_CLASS (TREE_CODE (false)) == '1'
7702 && operand_equal_p (true, TREE_OPERAND (false, 0), 0)))
7703 return expand_expr (build1 (NOP_EXPR
, type
,
7704 build (COND_EXPR
, TREE_TYPE (true),
7705 TREE_OPERAND (exp
, 0),
7707 target
, tmode
, modifier
);
7711 /* Note that COND_EXPRs whose type is a structure or union
7712 are required to be constructed to contain assignments of
7713 a temporary variable, so that we can evaluate them here
7714 for side effect only. If type is void, we must do likewise. */
7716 /* If an arm of the branch requires a cleanup,
7717 only that cleanup is performed. */
7720 tree binary_op
= 0, unary_op
= 0;
7722 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
7723 convert it to our mode, if necessary. */
7724 if (integer_onep (TREE_OPERAND (exp
, 1))
7725 && integer_zerop (TREE_OPERAND (exp
, 2))
7726 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<')
7730 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
7735 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, mode
, ro_modifier
);
7736 if (GET_MODE (op0
) == mode
)
7740 target
= gen_reg_rtx (mode
);
7741 convert_move (target
, op0
, unsignedp
);
7745 /* Check for X ? A + B : A. If we have this, we can copy A to the
7746 output and conditionally add B. Similarly for unary operations.
7747 Don't do this if X has side-effects because those side effects
7748 might affect A or B and the "?" operation is a sequence point in
7749 ANSI. (operand_equal_p tests for side effects.) */
7751 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 1))) == '2'
7752 && operand_equal_p (TREE_OPERAND (exp
, 2),
7753 TREE_OPERAND (TREE_OPERAND (exp
, 1), 0), 0))
7754 singleton
= TREE_OPERAND (exp
, 2), binary_op
= TREE_OPERAND (exp
, 1);
7755 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 2))) == '2'
7756 && operand_equal_p (TREE_OPERAND (exp
, 1),
7757 TREE_OPERAND (TREE_OPERAND (exp
, 2), 0), 0))
7758 singleton
= TREE_OPERAND (exp
, 1), binary_op
= TREE_OPERAND (exp
, 2);
7759 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 1))) == '1'
7760 && operand_equal_p (TREE_OPERAND (exp
, 2),
7761 TREE_OPERAND (TREE_OPERAND (exp
, 1), 0), 0))
7762 singleton
= TREE_OPERAND (exp
, 2), unary_op
= TREE_OPERAND (exp
, 1);
7763 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 2))) == '1'
7764 && operand_equal_p (TREE_OPERAND (exp
, 1),
7765 TREE_OPERAND (TREE_OPERAND (exp
, 2), 0), 0))
7766 singleton
= TREE_OPERAND (exp
, 1), unary_op
= TREE_OPERAND (exp
, 2);
7768 /* If we are not to produce a result, we have no target. Otherwise,
7769 if a target was specified use it; it will not be used as an
7770 intermediate target unless it is safe. If no target, use a
7775 else if (original_target
7776 && (safe_from_p (original_target
, TREE_OPERAND (exp
, 0), 1)
7777 || (singleton
&& GET_CODE (original_target
) == REG
7778 && REGNO (original_target
) >= FIRST_PSEUDO_REGISTER
7779 && original_target
== var_rtx (singleton
)))
7780 && GET_MODE (original_target
) == mode
7781 #ifdef HAVE_conditional_move
7782 && (! can_conditionally_move_p (mode
)
7783 || GET_CODE (original_target
) == REG
7784 || TREE_ADDRESSABLE (type
))
7786 && ! (GET_CODE (original_target
) == MEM
7787 && MEM_VOLATILE_P (original_target
)))
7788 temp
= original_target
;
7789 else if (TREE_ADDRESSABLE (type
))
7792 temp
= assign_temp (type
, 0, 0, 1);
7794 /* If we had X ? A + C : A, with C a constant power of 2, and we can
7795 do the test of X as a store-flag operation, do this as
7796 A + ((X != 0) << log C). Similarly for other simple binary
7797 operators. Only do for C == 1 if BRANCH_COST is low. */
7798 if (temp
&& singleton
&& binary_op
7799 && (TREE_CODE (binary_op
) == PLUS_EXPR
7800 || TREE_CODE (binary_op
) == MINUS_EXPR
7801 || TREE_CODE (binary_op
) == BIT_IOR_EXPR
7802 || TREE_CODE (binary_op
) == BIT_XOR_EXPR
)
7803 && (BRANCH_COST
>= 3 ? integer_pow2p (TREE_OPERAND (binary_op
, 1))
7804 : integer_onep (TREE_OPERAND (binary_op
, 1)))
7805 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<')
7808 optab boptab
= (TREE_CODE (binary_op
) == PLUS_EXPR
? add_optab
7809 : TREE_CODE (binary_op
) == MINUS_EXPR
? sub_optab
7810 : TREE_CODE (binary_op
) == BIT_IOR_EXPR
? ior_optab
7813 /* If we had X ? A : A + 1, do this as A + (X == 0).
7815 We have to invert the truth value here and then put it
7816 back later if do_store_flag fails. We cannot simply copy
7817 TREE_OPERAND (exp, 0) to another variable and modify that
7818 because invert_truthvalue can modify the tree pointed to
7820 if (singleton
== TREE_OPERAND (exp
, 1))
7821 TREE_OPERAND (exp
, 0)
7822 = invert_truthvalue (TREE_OPERAND (exp
, 0));
7824 result
= do_store_flag (TREE_OPERAND (exp
, 0),
7825 (safe_from_p (temp
, singleton
, 1)
7827 mode
, BRANCH_COST
<= 1);
7829 if (result
!= 0 && ! integer_onep (TREE_OPERAND (binary_op
, 1)))
7830 result
= expand_shift (LSHIFT_EXPR
, mode
, result
,
7831 build_int_2 (tree_log2
7835 (safe_from_p (temp
, singleton
, 1)
7836 ? temp
: NULL_RTX
), 0);
7840 op1
= expand_expr (singleton
, NULL_RTX
, VOIDmode
, 0);
7841 return expand_binop (mode
, boptab
, op1
, result
, temp
,
7842 unsignedp
, OPTAB_LIB_WIDEN
);
7844 else if (singleton
== TREE_OPERAND (exp
, 1))
7845 TREE_OPERAND (exp
, 0)
7846 = invert_truthvalue (TREE_OPERAND (exp
, 0));
7849 do_pending_stack_adjust ();
7851 op0
= gen_label_rtx ();
7853 if (singleton
&& ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0)))
7857 /* If the target conflicts with the other operand of the
7858 binary op, we can't use it. Also, we can't use the target
7859 if it is a hard register, because evaluating the condition
7860 might clobber it. */
7862 && ! safe_from_p (temp
, TREE_OPERAND (binary_op
, 1), 1))
7863 || (GET_CODE (temp
) == REG
7864 && REGNO (temp
) < FIRST_PSEUDO_REGISTER
))
7865 temp
= gen_reg_rtx (mode
);
7866 store_expr (singleton
, temp
, 0);
7869 expand_expr (singleton
,
7870 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
7871 if (singleton
== TREE_OPERAND (exp
, 1))
7872 jumpif (TREE_OPERAND (exp
, 0), op0
);
7874 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
7876 start_cleanup_deferral ();
7877 if (binary_op
&& temp
== 0)
7878 /* Just touch the other operand. */
7879 expand_expr (TREE_OPERAND (binary_op
, 1),
7880 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
7882 store_expr (build (TREE_CODE (binary_op
), type
,
7883 make_tree (type
, temp
),
7884 TREE_OPERAND (binary_op
, 1)),
7887 store_expr (build1 (TREE_CODE (unary_op
), type
,
7888 make_tree (type
, temp
)),
7892 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
7893 comparison operator. If we have one of these cases, set the
7894 output to A, branch on A (cse will merge these two references),
7895 then set the output to FOO. */
7897 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<'
7898 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1))
7899 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
7900 TREE_OPERAND (exp
, 1), 0)
7901 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0))
7902 || TREE_CODE (TREE_OPERAND (exp
, 1)) == SAVE_EXPR
)
7903 && safe_from_p (temp
, TREE_OPERAND (exp
, 2), 1))
7905 if (GET_CODE (temp
) == REG
&& REGNO (temp
) < FIRST_PSEUDO_REGISTER
)
7906 temp
= gen_reg_rtx (mode
);
7907 store_expr (TREE_OPERAND (exp
, 1), temp
, 0);
7908 jumpif (TREE_OPERAND (exp
, 0), op0
);
7910 start_cleanup_deferral ();
7911 store_expr (TREE_OPERAND (exp
, 2), temp
, 0);
7915 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<'
7916 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1))
7917 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
7918 TREE_OPERAND (exp
, 2), 0)
7919 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0))
7920 || TREE_CODE (TREE_OPERAND (exp
, 2)) == SAVE_EXPR
)
7921 && safe_from_p (temp
, TREE_OPERAND (exp
, 1), 1))
7923 if (GET_CODE (temp
) == REG
&& REGNO (temp
) < FIRST_PSEUDO_REGISTER
)
7924 temp
= gen_reg_rtx (mode
);
7925 store_expr (TREE_OPERAND (exp
, 2), temp
, 0);
7926 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
7928 start_cleanup_deferral ();
7929 store_expr (TREE_OPERAND (exp
, 1), temp
, 0);
7934 op1
= gen_label_rtx ();
7935 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
7937 start_cleanup_deferral ();
7939 /* One branch of the cond can be void, if it never returns. For
7940 example A ? throw : E */
7942 && TREE_TYPE (TREE_OPERAND (exp
, 1)) != void_type_node
)
7943 store_expr (TREE_OPERAND (exp
, 1), temp
, 0);
7945 expand_expr (TREE_OPERAND (exp
, 1),
7946 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
7947 end_cleanup_deferral ();
7949 emit_jump_insn (gen_jump (op1
));
7952 start_cleanup_deferral ();
7954 && TREE_TYPE (TREE_OPERAND (exp
, 2)) != void_type_node
)
7955 store_expr (TREE_OPERAND (exp
, 2), temp
, 0);
7957 expand_expr (TREE_OPERAND (exp
, 2),
7958 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
7961 end_cleanup_deferral ();
7972 /* Something needs to be initialized, but we didn't know
7973 where that thing was when building the tree. For example,
7974 it could be the return value of a function, or a parameter
7975 to a function which lays down in the stack, or a temporary
7976 variable which must be passed by reference.
7978 We guarantee that the expression will either be constructed
7979 or copied into our original target. */
7981 tree slot
= TREE_OPERAND (exp
, 0);
7982 tree cleanups
= NULL_TREE
;
7985 if (TREE_CODE (slot
) != VAR_DECL
)
7989 target
= original_target
;
7991 /* Set this here so that if we get a target that refers to a
7992 register variable that's already been used, put_reg_into_stack
7993 knows that it should fix up those uses. */
7994 TREE_USED (slot
) = 1;
7998 if (DECL_RTL (slot
) != 0)
8000 target
= DECL_RTL (slot
);
8001 /* If we have already expanded the slot, so don't do
8003 if (TREE_OPERAND (exp
, 1) == NULL_TREE
)
8008 target
= assign_temp (type
, 2, 0, 1);
8009 /* All temp slots at this level must not conflict. */
8010 preserve_temp_slots (target
);
8011 DECL_RTL (slot
) = target
;
8012 if (TREE_ADDRESSABLE (slot
))
8014 TREE_ADDRESSABLE (slot
) = 0;
8015 mark_addressable (slot
);
8018 /* Since SLOT is not known to the called function
8019 to belong to its stack frame, we must build an explicit
8020 cleanup. This case occurs when we must build up a reference
8021 to pass the reference as an argument. In this case,
8022 it is very likely that such a reference need not be
8025 if (TREE_OPERAND (exp
, 2) == 0)
8026 TREE_OPERAND (exp
, 2) = maybe_build_cleanup (slot
);
8027 cleanups
= TREE_OPERAND (exp
, 2);
8032 /* This case does occur, when expanding a parameter which
8033 needs to be constructed on the stack. The target
8034 is the actual stack address that we want to initialize.
8035 The function we call will perform the cleanup in this case. */
8037 /* If we have already assigned it space, use that space,
8038 not target that we were passed in, as our target
8039 parameter is only a hint. */
8040 if (DECL_RTL (slot
) != 0)
8042 target
= DECL_RTL (slot
);
8043 /* If we have already expanded the slot, so don't do
8045 if (TREE_OPERAND (exp
, 1) == NULL_TREE
)
8050 DECL_RTL (slot
) = target
;
8051 /* If we must have an addressable slot, then make sure that
8052 the RTL that we just stored in slot is OK. */
8053 if (TREE_ADDRESSABLE (slot
))
8055 TREE_ADDRESSABLE (slot
) = 0;
8056 mark_addressable (slot
);
8061 exp1
= TREE_OPERAND (exp
, 3) = TREE_OPERAND (exp
, 1);
8062 /* Mark it as expanded. */
8063 TREE_OPERAND (exp
, 1) = NULL_TREE
;
8065 store_expr (exp1
, target
, 0);
8067 expand_decl_cleanup (NULL_TREE
, cleanups
);
8074 tree lhs
= TREE_OPERAND (exp
, 0);
8075 tree rhs
= TREE_OPERAND (exp
, 1);
8076 tree noncopied_parts
= 0;
8077 tree lhs_type
= TREE_TYPE (lhs
);
8079 temp
= expand_assignment (lhs
, rhs
, ! ignore
, original_target
!= 0);
8080 if (TYPE_NONCOPIED_PARTS (lhs_type
) != 0 && !fixed_type_p (rhs
))
8081 noncopied_parts
= init_noncopied_parts (stabilize_reference (lhs
),
8082 TYPE_NONCOPIED_PARTS (lhs_type
));
8083 while (noncopied_parts
!= 0)
8085 expand_assignment (TREE_VALUE (noncopied_parts
),
8086 TREE_PURPOSE (noncopied_parts
), 0, 0);
8087 noncopied_parts
= TREE_CHAIN (noncopied_parts
);
8094 /* If lhs is complex, expand calls in rhs before computing it.
8095 That's so we don't compute a pointer and save it over a call.
8096 If lhs is simple, compute it first so we can give it as a
8097 target if the rhs is just a call. This avoids an extra temp and copy
8098 and that prevents a partial-subsumption which makes bad code.
8099 Actually we could treat component_ref's of vars like vars. */
8101 tree lhs
= TREE_OPERAND (exp
, 0);
8102 tree rhs
= TREE_OPERAND (exp
, 1);
8103 tree noncopied_parts
= 0;
8104 tree lhs_type
= TREE_TYPE (lhs
);
8108 if (TREE_CODE (lhs
) != VAR_DECL
8109 && TREE_CODE (lhs
) != RESULT_DECL
8110 && TREE_CODE (lhs
) != PARM_DECL
8111 && ! (TREE_CODE (lhs
) == INDIRECT_REF
8112 && TYPE_READONLY (TREE_TYPE (TREE_OPERAND (lhs
, 0)))))
8113 preexpand_calls (exp
);
8115 /* Check for |= or &= of a bitfield of size one into another bitfield
8116 of size 1. In this case, (unless we need the result of the
8117 assignment) we can do this more efficiently with a
8118 test followed by an assignment, if necessary.
8120 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8121 things change so we do, this code should be enhanced to
8124 && TREE_CODE (lhs
) == COMPONENT_REF
8125 && (TREE_CODE (rhs
) == BIT_IOR_EXPR
8126 || TREE_CODE (rhs
) == BIT_AND_EXPR
)
8127 && TREE_OPERAND (rhs
, 0) == lhs
8128 && TREE_CODE (TREE_OPERAND (rhs
, 1)) == COMPONENT_REF
8129 && TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (lhs
, 1))) == 1
8130 && TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs
, 1), 1))) == 1)
8132 rtx label
= gen_label_rtx ();
8134 do_jump (TREE_OPERAND (rhs
, 1),
8135 TREE_CODE (rhs
) == BIT_IOR_EXPR
? label
: 0,
8136 TREE_CODE (rhs
) == BIT_AND_EXPR
? label
: 0);
8137 expand_assignment (lhs
, convert (TREE_TYPE (rhs
),
8138 (TREE_CODE (rhs
) == BIT_IOR_EXPR
8140 : integer_zero_node
)),
8142 do_pending_stack_adjust ();
8147 if (TYPE_NONCOPIED_PARTS (lhs_type
) != 0
8148 && ! (fixed_type_p (lhs
) && fixed_type_p (rhs
)))
8149 noncopied_parts
= save_noncopied_parts (stabilize_reference (lhs
),
8150 TYPE_NONCOPIED_PARTS (lhs_type
));
8152 temp
= expand_assignment (lhs
, rhs
, ! ignore
, original_target
!= 0);
8153 while (noncopied_parts
!= 0)
8155 expand_assignment (TREE_PURPOSE (noncopied_parts
),
8156 TREE_VALUE (noncopied_parts
), 0, 0);
8157 noncopied_parts
= TREE_CHAIN (noncopied_parts
);
8163 if (!TREE_OPERAND (exp
, 0))
8164 expand_null_return ();
8166 expand_return (TREE_OPERAND (exp
, 0));
8169 case PREINCREMENT_EXPR
:
8170 case PREDECREMENT_EXPR
:
8171 return expand_increment (exp
, 0, ignore
);
8173 case POSTINCREMENT_EXPR
:
8174 case POSTDECREMENT_EXPR
:
8175 /* Faster to treat as pre-increment if result is not used. */
8176 return expand_increment (exp
, ! ignore
, ignore
);
8179 /* If nonzero, TEMP will be set to the address of something that might
8180 be a MEM corresponding to a stack slot. */
8183 /* Are we taking the address of a nested function? */
8184 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == FUNCTION_DECL
8185 && decl_function_context (TREE_OPERAND (exp
, 0)) != 0
8186 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp
, 0))
8187 && ! TREE_STATIC (exp
))
8189 op0
= trampoline_address (TREE_OPERAND (exp
, 0));
8190 op0
= force_operand (op0
, target
);
8192 /* If we are taking the address of something erroneous, just
8194 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ERROR_MARK
)
8198 /* We make sure to pass const0_rtx down if we came in with
8199 ignore set, to avoid doing the cleanups twice for something. */
8200 op0
= expand_expr (TREE_OPERAND (exp
, 0),
8201 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
,
8202 (modifier
== EXPAND_INITIALIZER
8203 ? modifier
: EXPAND_CONST_ADDRESS
));
8205 /* If we are going to ignore the result, OP0 will have been set
8206 to const0_rtx, so just return it. Don't get confused and
8207 think we are taking the address of the constant. */
8211 op0
= protect_from_queue (op0
, 0);
8213 /* We would like the object in memory. If it is a constant, we can
8214 have it be statically allocated into memory. For a non-constant,
8215 we need to allocate some memory and store the value into it. */
8217 if (CONSTANT_P (op0
))
8218 op0
= force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
8220 else if (GET_CODE (op0
) == MEM
)
8222 mark_temp_addr_taken (op0
);
8223 temp
= XEXP (op0
, 0);
8226 else if (GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
8227 || GET_CODE (op0
) == CONCAT
|| GET_CODE (op0
) == ADDRESSOF
)
8229 /* If this object is in a register, it must be not
8231 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
8232 rtx memloc
= assign_temp (inner_type
, 1, 1, 1);
8234 mark_temp_addr_taken (memloc
);
8235 emit_move_insn (memloc
, op0
);
8239 if (GET_CODE (op0
) != MEM
)
8242 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
8244 temp
= XEXP (op0
, 0);
8245 #ifdef POINTERS_EXTEND_UNSIGNED
8246 if (GET_MODE (temp
) == Pmode
&& GET_MODE (temp
) != mode
8247 && mode
== ptr_mode
)
8248 temp
= convert_memory_address (ptr_mode
, temp
);
8253 op0
= force_operand (XEXP (op0
, 0), target
);
8256 if (flag_force_addr
&& GET_CODE (op0
) != REG
)
8257 op0
= force_reg (Pmode
, op0
);
8259 if (GET_CODE (op0
) == REG
8260 && ! REG_USERVAR_P (op0
))
8261 mark_reg_pointer (op0
, TYPE_ALIGN (TREE_TYPE (type
)) / BITS_PER_UNIT
);
8263 /* If we might have had a temp slot, add an equivalent address
8266 update_temp_slot_address (temp
, op0
);
8268 #ifdef POINTERS_EXTEND_UNSIGNED
8269 if (GET_MODE (op0
) == Pmode
&& GET_MODE (op0
) != mode
8270 && mode
== ptr_mode
)
8271 op0
= convert_memory_address (ptr_mode
, op0
);
8276 case ENTRY_VALUE_EXPR
:
8279 /* COMPLEX type for Extended Pascal & Fortran */
8282 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
8285 /* Get the rtx code of the operands. */
8286 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
8287 op1
= expand_expr (TREE_OPERAND (exp
, 1), 0, VOIDmode
, 0);
8290 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
8294 /* Move the real (op0) and imaginary (op1) parts to their location. */
8295 emit_move_insn (gen_realpart (mode
, target
), op0
);
8296 emit_move_insn (gen_imagpart (mode
, target
), op1
);
8298 insns
= get_insns ();
8301 /* Complex construction should appear as a single unit. */
8302 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
8303 each with a separate pseudo as destination.
8304 It's not correct for flow to treat them as a unit. */
8305 if (GET_CODE (target
) != CONCAT
)
8306 emit_no_conflict_block (insns
, target
, op0
, op1
, NULL_RTX
);
8314 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
8315 return gen_realpart (mode
, op0
);
8318 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
8319 return gen_imagpart (mode
, op0
);
8323 enum machine_mode partmode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
8327 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
8330 target
= gen_reg_rtx (mode
);
8334 /* Store the realpart and the negated imagpart to target. */
8335 emit_move_insn (gen_realpart (partmode
, target
),
8336 gen_realpart (partmode
, op0
));
8338 imag_t
= gen_imagpart (partmode
, target
);
8339 temp
= expand_unop (partmode
, neg_optab
,
8340 gen_imagpart (partmode
, op0
), imag_t
, 0);
8342 emit_move_insn (imag_t
, temp
);
8344 insns
= get_insns ();
8347 /* Conjugate should appear as a single unit
8348 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
8349 each with a separate pseudo as destination.
8350 It's not correct for flow to treat them as a unit. */
8351 if (GET_CODE (target
) != CONCAT
)
8352 emit_no_conflict_block (insns
, target
, op0
, NULL_RTX
, NULL_RTX
);
8359 case TRY_CATCH_EXPR
:
8361 tree handler
= TREE_OPERAND (exp
, 1);
8363 expand_eh_region_start ();
8365 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
8367 expand_eh_region_end (handler
);
8372 case TRY_FINALLY_EXPR
:
8374 tree try_block
= TREE_OPERAND (exp
, 0);
8375 tree finally_block
= TREE_OPERAND (exp
, 1);
8376 rtx finally_label
= gen_label_rtx ();
8377 rtx done_label
= gen_label_rtx ();
8378 rtx return_link
= gen_reg_rtx (Pmode
);
8379 tree cleanup
= build (GOTO_SUBROUTINE_EXPR
, void_type_node
,
8380 (tree
) finally_label
, (tree
) return_link
);
8381 TREE_SIDE_EFFECTS (cleanup
) = 1;
8383 /* Start a new binding layer that will keep track of all cleanup
8384 actions to be performed. */
8385 expand_start_bindings (2);
8387 target_temp_slot_level
= temp_slot_level
;
8389 expand_decl_cleanup (NULL_TREE
, cleanup
);
8390 op0
= expand_expr (try_block
, target
, tmode
, modifier
);
8392 preserve_temp_slots (op0
);
8393 expand_end_bindings (NULL_TREE
, 0, 0);
8394 emit_jump (done_label
);
8395 emit_label (finally_label
);
8396 expand_expr (finally_block
, const0_rtx
, VOIDmode
, 0);
8397 emit_indirect_jump (return_link
);
8398 emit_label (done_label
);
8402 case GOTO_SUBROUTINE_EXPR
:
8404 rtx subr
= (rtx
) TREE_OPERAND (exp
, 0);
8405 rtx return_link
= *(rtx
*) &TREE_OPERAND (exp
, 1);
8406 rtx return_address
= gen_label_rtx ();
8407 emit_move_insn (return_link
, gen_rtx_LABEL_REF (Pmode
, return_address
));
8409 emit_label (return_address
);
8415 rtx dcc
= get_dynamic_cleanup_chain ();
8416 emit_move_insn (dcc
, validize_mem (gen_rtx_MEM (Pmode
, dcc
)));
8422 rtx dhc
= get_dynamic_handler_chain ();
8423 emit_move_insn (dhc
, validize_mem (gen_rtx_MEM (Pmode
, dhc
)));
8428 return expand_builtin_va_arg (TREE_OPERAND (exp
, 0), type
);
8431 return (*lang_expand_expr
) (exp
, original_target
, tmode
, modifier
);
8434 /* Here to do an ordinary binary operator, generating an instruction
8435 from the optab already placed in `this_optab'. */
8437 preexpand_calls (exp
);
8438 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8440 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8441 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8443 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
,
8444 unsignedp
, OPTAB_LIB_WIDEN
);
8450 /* Similar to expand_expr, except that we don't specify a target, target
8451 mode, or modifier and we return the alignment of the inner type. This is
8452 used in cases where it is not necessary to align the result to the
8453 alignment of its type as long as we know the alignment of the result, for
8454 example for comparisons of BLKmode values. */
8457 expand_expr_unaligned (exp
, palign
)
8462 tree type
= TREE_TYPE (exp
);
8463 register enum machine_mode mode
= TYPE_MODE (type
);
8465 /* Default the alignment we return to that of the type. */
8466 *palign
= TYPE_ALIGN (type
);
8468 /* The only cases in which we do anything special is if the resulting mode
8470 if (mode
!= BLKmode
)
8471 return expand_expr (exp
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
8473 switch (TREE_CODE (exp
))
8477 case NON_LVALUE_EXPR
:
8478 /* Conversions between BLKmode values don't change the underlying
8479 alignment or value. */
8480 if (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == BLKmode
)
8481 return expand_expr_unaligned (TREE_OPERAND (exp
, 0), palign
);
8485 /* Much of the code for this case is copied directly from expand_expr.
8486 We need to duplicate it here because we will do something different
8487 in the fall-through case, so we need to handle the same exceptions
8490 tree array
= TREE_OPERAND (exp
, 0);
8491 tree domain
= TYPE_DOMAIN (TREE_TYPE (array
));
8492 tree low_bound
= domain
? TYPE_MIN_VALUE (domain
) : integer_zero_node
;
8493 tree index
= TREE_OPERAND (exp
, 1);
8494 tree index_type
= TREE_TYPE (index
);
8497 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) != ARRAY_TYPE
)
8500 /* Optimize the special-case of a zero lower bound.
8502 We convert the low_bound to sizetype to avoid some problems
8503 with constant folding. (E.g. suppose the lower bound is 1,
8504 and its mode is QI. Without the conversion, (ARRAY
8505 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8506 +INDEX), which becomes (ARRAY+255+INDEX). Oops!)
8508 But sizetype isn't quite right either (especially if
8509 the lowbound is negative). FIXME */
8511 if (! integer_zerop (low_bound
))
8512 index
= fold (build (MINUS_EXPR
, index_type
, index
,
8513 convert (sizetype
, low_bound
)));
8515 /* If this is a constant index into a constant array,
8516 just get the value from the array. Handle both the cases when
8517 we have an explicit constructor and when our operand is a variable
8518 that was declared const. */
8520 if (TREE_CODE (array
) == CONSTRUCTOR
&& ! TREE_SIDE_EFFECTS (array
))
8522 if (TREE_CODE (index
) == INTEGER_CST
8523 && TREE_INT_CST_HIGH (index
) == 0)
8525 tree elem
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0));
8527 i
= TREE_INT_CST_LOW (index
);
8529 elem
= TREE_CHAIN (elem
);
8531 return expand_expr_unaligned (fold (TREE_VALUE (elem
)),
8536 else if (optimize
>= 1
8537 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
8538 && TREE_CODE (array
) == VAR_DECL
&& DECL_INITIAL (array
)
8539 && TREE_CODE (DECL_INITIAL (array
)) != ERROR_MARK
)
8541 if (TREE_CODE (index
) == INTEGER_CST
)
8543 tree init
= DECL_INITIAL (array
);
8545 i
= TREE_INT_CST_LOW (index
);
8546 if (TREE_CODE (init
) == CONSTRUCTOR
)
8548 tree elem
= CONSTRUCTOR_ELTS (init
);
8551 && !tree_int_cst_equal (TREE_PURPOSE (elem
), index
))
8552 elem
= TREE_CHAIN (elem
);
8554 return expand_expr_unaligned (fold (TREE_VALUE (elem
)),
8561 /* ... fall through ... */
8565 /* If the operand is a CONSTRUCTOR, we can just extract the
8566 appropriate field if it is present. Don't do this if we have
8567 already written the data since we want to refer to that copy
8568 and varasm.c assumes that's what we'll do. */
8569 if (TREE_CODE (exp
) != ARRAY_REF
8570 && TREE_CODE (TREE_OPERAND (exp
, 0)) == CONSTRUCTOR
8571 && TREE_CST_RTL (TREE_OPERAND (exp
, 0)) == 0)
8575 for (elt
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0)); elt
;
8576 elt
= TREE_CHAIN (elt
))
8577 if (TREE_PURPOSE (elt
) == TREE_OPERAND (exp
, 1))
8578 /* Note that unlike the case in expand_expr, we know this is
8579 BLKmode and hence not an integer. */
8580 return expand_expr_unaligned (TREE_VALUE (elt
), palign
);
8584 enum machine_mode mode1
;
8591 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
8592 &mode1
, &unsignedp
, &volatilep
,
8595 /* If we got back the original object, something is wrong. Perhaps
8596 we are evaluating an expression too early. In any event, don't
8597 infinitely recurse. */
8601 op0
= expand_expr (tem
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
8603 /* If this is a constant, put it into a register if it is a
8604 legitimate constant and OFFSET is 0 and memory if it isn't. */
8605 if (CONSTANT_P (op0
))
8607 enum machine_mode inner_mode
= TYPE_MODE (TREE_TYPE (tem
));
8609 if (inner_mode
!= BLKmode
&& LEGITIMATE_CONSTANT_P (op0
)
8611 op0
= force_reg (inner_mode
, op0
);
8613 op0
= validize_mem (force_const_mem (inner_mode
, op0
));
8618 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, 0);
8620 /* If this object is in a register, put it into memory.
8621 This case can't occur in C, but can in Ada if we have
8622 unchecked conversion of an expression from a scalar type to
8623 an array or record type. */
8624 if (GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
8625 || GET_CODE (op0
) == CONCAT
|| GET_CODE (op0
) == ADDRESSOF
)
8627 rtx memloc
= assign_temp (TREE_TYPE (tem
), 1, 1, 1);
8629 mark_temp_addr_taken (memloc
);
8630 emit_move_insn (memloc
, op0
);
8634 if (GET_CODE (op0
) != MEM
)
8637 if (GET_MODE (offset_rtx
) != ptr_mode
)
8639 #ifdef POINTERS_EXTEND_UNSIGNED
8640 offset_rtx
= convert_memory_address (ptr_mode
, offset_rtx
);
8642 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
8646 op0
= change_address (op0
, VOIDmode
,
8647 gen_rtx_PLUS (ptr_mode
, XEXP (op0
, 0),
8648 force_reg (ptr_mode
,
8652 /* Don't forget about volatility even if this is a bitfield. */
8653 if (GET_CODE (op0
) == MEM
&& volatilep
&& ! MEM_VOLATILE_P (op0
))
8655 op0
= copy_rtx (op0
);
8656 MEM_VOLATILE_P (op0
) = 1;
8659 /* Check the access. */
8660 if (current_function_check_memory_usage
&& GET_CODE (op0
) == MEM
)
8665 to
= plus_constant (XEXP (op0
, 0), (bitpos
/ BITS_PER_UNIT
));
8666 size
= (bitpos
% BITS_PER_UNIT
) + bitsize
+ BITS_PER_UNIT
- 1;
8668 /* Check the access right of the pointer. */
8669 if (size
> BITS_PER_UNIT
)
8670 emit_library_call (chkr_check_addr_libfunc
, 1, VOIDmode
, 3,
8671 to
, ptr_mode
, GEN_INT (size
/ BITS_PER_UNIT
),
8672 TYPE_MODE (sizetype
),
8673 GEN_INT (MEMORY_USE_RO
),
8674 TYPE_MODE (integer_type_node
));
8677 /* In cases where an aligned union has an unaligned object
8678 as a field, we might be extracting a BLKmode value from
8679 an integer-mode (e.g., SImode) object. Handle this case
8680 by doing the extract into an object as wide as the field
8681 (which we know to be the width of a basic mode), then
8682 storing into memory, and changing the mode to BLKmode.
8683 If we ultimately want the address (EXPAND_CONST_ADDRESS or
8684 EXPAND_INITIALIZER), then we must not copy to a temporary. */
8685 if (mode1
== VOIDmode
8686 || GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
8687 || (SLOW_UNALIGNED_ACCESS
8688 && (TYPE_ALIGN (type
) > alignment
* BITS_PER_UNIT
8689 || bitpos
% TYPE_ALIGN (type
) != 0)))
8691 enum machine_mode ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
8693 if (ext_mode
== BLKmode
)
8695 /* In this case, BITPOS must start at a byte boundary. */
8696 if (GET_CODE (op0
) != MEM
8697 || bitpos
% BITS_PER_UNIT
!= 0)
8700 op0
= change_address (op0
, VOIDmode
,
8701 plus_constant (XEXP (op0
, 0),
8702 bitpos
/ BITS_PER_UNIT
));
8706 rtx
new = assign_stack_temp (ext_mode
,
8707 bitsize
/ BITS_PER_UNIT
, 0);
8709 op0
= extract_bit_field (validize_mem (op0
), bitsize
, bitpos
,
8710 unsignedp
, NULL_RTX
, ext_mode
,
8711 ext_mode
, alignment
,
8712 int_size_in_bytes (TREE_TYPE (tem
)));
8714 /* If the result is a record type and BITSIZE is narrower than
8715 the mode of OP0, an integral mode, and this is a big endian
8716 machine, we must put the field into the high-order bits. */
8717 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
8718 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
8719 && bitsize
< GET_MODE_BITSIZE (GET_MODE (op0
)))
8720 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
8721 size_int (GET_MODE_BITSIZE
8727 emit_move_insn (new, op0
);
8728 op0
= copy_rtx (new);
8729 PUT_MODE (op0
, BLKmode
);
8733 /* Get a reference to just this component. */
8734 op0
= change_address (op0
, mode1
,
8735 plus_constant (XEXP (op0
, 0),
8736 (bitpos
/ BITS_PER_UNIT
)));
8738 MEM_ALIAS_SET (op0
) = get_alias_set (exp
);
8740 /* Adjust the alignment in case the bit position is not
8741 a multiple of the alignment of the inner object. */
8742 while (bitpos
% alignment
!= 0)
8745 if (GET_CODE (XEXP (op0
, 0)) == REG
)
8746 mark_reg_pointer (XEXP (op0
, 0), alignment
);
8748 MEM_IN_STRUCT_P (op0
) = 1;
8749 MEM_VOLATILE_P (op0
) |= volatilep
;
8751 *palign
= alignment
;
8760 return expand_expr (exp
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
8763 /* Return the tree node and offset if a given argument corresponds to
8764 a string constant. */
8767 string_constant (arg
, ptr_offset
)
8773 if (TREE_CODE (arg
) == ADDR_EXPR
8774 && TREE_CODE (TREE_OPERAND (arg
, 0)) == STRING_CST
)
8776 *ptr_offset
= integer_zero_node
;
8777 return TREE_OPERAND (arg
, 0);
8779 else if (TREE_CODE (arg
) == PLUS_EXPR
)
8781 tree arg0
= TREE_OPERAND (arg
, 0);
8782 tree arg1
= TREE_OPERAND (arg
, 1);
8787 if (TREE_CODE (arg0
) == ADDR_EXPR
8788 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == STRING_CST
)
8791 return TREE_OPERAND (arg0
, 0);
8793 else if (TREE_CODE (arg1
) == ADDR_EXPR
8794 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == STRING_CST
)
8797 return TREE_OPERAND (arg1
, 0);
8804 /* Expand code for a post- or pre- increment or decrement
8805 and return the RTX for the result.
8806 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
8809 expand_increment (exp
, post
, ignore
)
8813 register rtx op0
, op1
;
8814 register rtx temp
, value
;
8815 register tree incremented
= TREE_OPERAND (exp
, 0);
8816 optab this_optab
= add_optab
;
8818 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
8819 int op0_is_copy
= 0;
8820 int single_insn
= 0;
8821 /* 1 means we can't store into OP0 directly,
8822 because it is a subreg narrower than a word,
8823 and we don't dare clobber the rest of the word. */
8826 /* Stabilize any component ref that might need to be
8827 evaluated more than once below. */
8829 || TREE_CODE (incremented
) == BIT_FIELD_REF
8830 || (TREE_CODE (incremented
) == COMPONENT_REF
8831 && (TREE_CODE (TREE_OPERAND (incremented
, 0)) != INDIRECT_REF
8832 || DECL_BIT_FIELD (TREE_OPERAND (incremented
, 1)))))
8833 incremented
= stabilize_reference (incremented
);
8834 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
8835 ones into save exprs so that they don't accidentally get evaluated
8836 more than once by the code below. */
8837 if (TREE_CODE (incremented
) == PREINCREMENT_EXPR
8838 || TREE_CODE (incremented
) == PREDECREMENT_EXPR
)
8839 incremented
= save_expr (incremented
);
8841 /* Compute the operands as RTX.
8842 Note whether OP0 is the actual lvalue or a copy of it:
8843 I believe it is a copy iff it is a register or subreg
8844 and insns were generated in computing it. */
8846 temp
= get_last_insn ();
8847 op0
= expand_expr (incremented
, NULL_RTX
, VOIDmode
, EXPAND_MEMORY_USE_RW
);
8849 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
8850 in place but instead must do sign- or zero-extension during assignment,
8851 so we copy it into a new register and let the code below use it as
8854 Note that we can safely modify this SUBREG since it is know not to be
8855 shared (it was made by the expand_expr call above). */
8857 if (GET_CODE (op0
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (op0
))
8860 SUBREG_REG (op0
) = copy_to_reg (SUBREG_REG (op0
));
8864 else if (GET_CODE (op0
) == SUBREG
8865 && GET_MODE_BITSIZE (GET_MODE (op0
)) < BITS_PER_WORD
)
8867 /* We cannot increment this SUBREG in place. If we are
8868 post-incrementing, get a copy of the old value. Otherwise,
8869 just mark that we cannot increment in place. */
8871 op0
= copy_to_reg (op0
);
8876 op0_is_copy
= ((GET_CODE (op0
) == SUBREG
|| GET_CODE (op0
) == REG
)
8877 && temp
!= get_last_insn ());
8878 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
,
8879 EXPAND_MEMORY_USE_BAD
);
8881 /* Decide whether incrementing or decrementing. */
8882 if (TREE_CODE (exp
) == POSTDECREMENT_EXPR
8883 || TREE_CODE (exp
) == PREDECREMENT_EXPR
)
8884 this_optab
= sub_optab
;
8886 /* Convert decrement by a constant into a negative increment. */
8887 if (this_optab
== sub_optab
8888 && GET_CODE (op1
) == CONST_INT
)
8890 op1
= GEN_INT (- INTVAL (op1
));
8891 this_optab
= add_optab
;
8894 /* For a preincrement, see if we can do this with a single instruction. */
8897 icode
= (int) this_optab
->handlers
[(int) mode
].insn_code
;
8898 if (icode
!= (int) CODE_FOR_nothing
8899 /* Make sure that OP0 is valid for operands 0 and 1
8900 of the insn we want to queue. */
8901 && (*insn_data
[icode
].operand
[0].predicate
) (op0
, mode
)
8902 && (*insn_data
[icode
].operand
[1].predicate
) (op0
, mode
)
8903 && (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
8907 /* If OP0 is not the actual lvalue, but rather a copy in a register,
8908 then we cannot just increment OP0. We must therefore contrive to
8909 increment the original value. Then, for postincrement, we can return
8910 OP0 since it is a copy of the old value. For preincrement, expand here
8911 unless we can do it with a single insn.
8913 Likewise if storing directly into OP0 would clobber high bits
8914 we need to preserve (bad_subreg). */
8915 if (op0_is_copy
|| (!post
&& !single_insn
) || bad_subreg
)
8917 /* This is the easiest way to increment the value wherever it is.
8918 Problems with multiple evaluation of INCREMENTED are prevented
8919 because either (1) it is a component_ref or preincrement,
8920 in which case it was stabilized above, or (2) it is an array_ref
8921 with constant index in an array in a register, which is
8922 safe to reevaluate. */
8923 tree newexp
= build (((TREE_CODE (exp
) == POSTDECREMENT_EXPR
8924 || TREE_CODE (exp
) == PREDECREMENT_EXPR
)
8925 ? MINUS_EXPR
: PLUS_EXPR
),
8928 TREE_OPERAND (exp
, 1));
8930 while (TREE_CODE (incremented
) == NOP_EXPR
8931 || TREE_CODE (incremented
) == CONVERT_EXPR
)
8933 newexp
= convert (TREE_TYPE (incremented
), newexp
);
8934 incremented
= TREE_OPERAND (incremented
, 0);
8937 temp
= expand_assignment (incremented
, newexp
, ! post
&& ! ignore
, 0);
8938 return post
? op0
: temp
;
8943 /* We have a true reference to the value in OP0.
8944 If there is an insn to add or subtract in this mode, queue it.
8945 Queueing the increment insn avoids the register shuffling
8946 that often results if we must increment now and first save
8947 the old value for subsequent use. */
8949 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
8950 op0
= stabilize (op0
);
8953 icode
= (int) this_optab
->handlers
[(int) mode
].insn_code
;
8954 if (icode
!= (int) CODE_FOR_nothing
8955 /* Make sure that OP0 is valid for operands 0 and 1
8956 of the insn we want to queue. */
8957 && (*insn_data
[icode
].operand
[0].predicate
) (op0
, mode
)
8958 && (*insn_data
[icode
].operand
[1].predicate
) (op0
, mode
))
8960 if (! (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
8961 op1
= force_reg (mode
, op1
);
8963 return enqueue_insn (op0
, GEN_FCN (icode
) (op0
, op0
, op1
));
8965 if (icode
!= (int) CODE_FOR_nothing
&& GET_CODE (op0
) == MEM
)
8967 rtx addr
= (general_operand (XEXP (op0
, 0), mode
)
8968 ? force_reg (Pmode
, XEXP (op0
, 0))
8969 : copy_to_reg (XEXP (op0
, 0)));
8972 op0
= change_address (op0
, VOIDmode
, addr
);
8973 temp
= force_reg (GET_MODE (op0
), op0
);
8974 if (! (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
8975 op1
= force_reg (mode
, op1
);
8977 /* The increment queue is LIFO, thus we have to `queue'
8978 the instructions in reverse order. */
8979 enqueue_insn (op0
, gen_move_insn (op0
, temp
));
8980 result
= enqueue_insn (temp
, GEN_FCN (icode
) (temp
, temp
, op1
));
8985 /* Preincrement, or we can't increment with one simple insn. */
8987 /* Save a copy of the value before inc or dec, to return it later. */
8988 temp
= value
= copy_to_reg (op0
);
8990 /* Arrange to return the incremented value. */
8991 /* Copy the rtx because expand_binop will protect from the queue,
8992 and the results of that would be invalid for us to return
8993 if our caller does emit_queue before using our result. */
8994 temp
= copy_rtx (value
= op0
);
8996 /* Increment however we can. */
8997 op1
= expand_binop (mode
, this_optab
, value
, op1
,
8998 current_function_check_memory_usage
? NULL_RTX
: op0
,
8999 TREE_UNSIGNED (TREE_TYPE (exp
)), OPTAB_LIB_WIDEN
);
9000 /* Make sure the value is stored into OP0. */
9002 emit_move_insn (op0
, op1
);
9007 /* Expand all function calls contained within EXP, innermost ones first.
9008 But don't look within expressions that have sequence points.
9009 For each CALL_EXPR, record the rtx for its value
9010 in the CALL_EXPR_RTL field. */
9013 preexpand_calls (exp
)
9016 register int nops
, i
;
9017 int type
= TREE_CODE_CLASS (TREE_CODE (exp
));
9019 if (! do_preexpand_calls
)
9022 /* Only expressions and references can contain calls. */
9024 if (type
!= 'e' && type
!= '<' && type
!= '1' && type
!= '2' && type
!= 'r')
9027 switch (TREE_CODE (exp
))
9030 /* Do nothing if already expanded. */
9031 if (CALL_EXPR_RTL (exp
) != 0
9032 /* Do nothing if the call returns a variable-sized object. */
9033 || TREE_CODE (TYPE_SIZE (TREE_TYPE(exp
))) != INTEGER_CST
9034 /* Do nothing to built-in functions. */
9035 || (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
9036 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
9038 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))))
9041 CALL_EXPR_RTL (exp
) = expand_call (exp
, NULL_RTX
, 0);
9046 case TRUTH_ANDIF_EXPR
:
9047 case TRUTH_ORIF_EXPR
:
9048 /* If we find one of these, then we can be sure
9049 the adjust will be done for it (since it makes jumps).
9050 Do it now, so that if this is inside an argument
9051 of a function, we don't get the stack adjustment
9052 after some other args have already been pushed. */
9053 do_pending_stack_adjust ();
9058 case WITH_CLEANUP_EXPR
:
9059 case CLEANUP_POINT_EXPR
:
9060 case TRY_CATCH_EXPR
:
9064 if (SAVE_EXPR_RTL (exp
) != 0)
9071 nops
= tree_code_length
[(int) TREE_CODE (exp
)];
9072 for (i
= 0; i
< nops
; i
++)
9073 if (TREE_OPERAND (exp
, i
) != 0)
9075 if (TREE_CODE (exp
) == TARGET_EXPR
&& i
== 2)
9076 /* We don't need to preexpand the cleanup for a TARGET_EXPR.
9077 It doesn't happen before the call is made. */
9081 type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
9082 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
9084 preexpand_calls (TREE_OPERAND (exp
, i
));
9089 /* At the start of a function, record that we have no previously-pushed
9090 arguments waiting to be popped. */
9093 init_pending_stack_adjust ()
9095 pending_stack_adjust
= 0;
9098 /* When exiting from function, if safe, clear out any pending stack adjust
9099 so the adjustment won't get done.
9101 Note, if the current function calls alloca, then it must have a
9102 frame pointer regardless of the value of flag_omit_frame_pointer. */
9105 clear_pending_stack_adjust ()
9107 #ifdef EXIT_IGNORE_STACK
9109 && (! flag_omit_frame_pointer
|| current_function_calls_alloca
)
9110 && EXIT_IGNORE_STACK
9111 && ! (DECL_INLINE (current_function_decl
) && ! flag_no_inline
)
9112 && ! flag_inline_functions
)
9113 pending_stack_adjust
= 0;
9117 /* Pop any previously-pushed arguments that have not been popped yet. */
9120 do_pending_stack_adjust ()
9122 if (inhibit_defer_pop
== 0)
9124 if (pending_stack_adjust
!= 0)
9125 adjust_stack (GEN_INT (pending_stack_adjust
));
9126 pending_stack_adjust
= 0;
9130 /* Expand conditional expressions. */
9132 /* Generate code to evaluate EXP and jump to LABEL if the value is zero.
9133 LABEL is an rtx of code CODE_LABEL, in this function and all the
9137 jumpifnot (exp
, label
)
9141 do_jump (exp
, label
, NULL_RTX
);
9144 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. */
9151 do_jump (exp
, NULL_RTX
, label
);
9154 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
9155 the result is zero, or IF_TRUE_LABEL if the result is one.
9156 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero,
9157 meaning fall through in that case.
9159 do_jump always does any pending stack adjust except when it does not
9160 actually perform a jump. An example where there is no jump
9161 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null.
9163 This function is responsible for optimizing cases such as
9164 &&, || and comparison operators in EXP. */
9167 do_jump (exp
, if_false_label
, if_true_label
)
9169 rtx if_false_label
, if_true_label
;
9171 register enum tree_code code
= TREE_CODE (exp
);
9172 /* Some cases need to create a label to jump to
9173 in order to properly fall through.
9174 These cases set DROP_THROUGH_LABEL nonzero. */
9175 rtx drop_through_label
= 0;
9179 enum machine_mode mode
;
9181 #ifdef MAX_INTEGER_COMPUTATION_MODE
9182 check_max_integer_computation_mode (exp
);
9193 temp
= integer_zerop (exp
) ? if_false_label
: if_true_label
;
9199 /* This is not true with #pragma weak */
9201 /* The address of something can never be zero. */
9203 emit_jump (if_true_label
);
9208 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == COMPONENT_REF
9209 || TREE_CODE (TREE_OPERAND (exp
, 0)) == BIT_FIELD_REF
9210 || TREE_CODE (TREE_OPERAND (exp
, 0)) == ARRAY_REF
)
9213 /* If we are narrowing the operand, we have to do the compare in the
9215 if ((TYPE_PRECISION (TREE_TYPE (exp
))
9216 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
9218 case NON_LVALUE_EXPR
:
9219 case REFERENCE_EXPR
:
9224 /* These cannot change zero->non-zero or vice versa. */
9225 do_jump (TREE_OPERAND (exp
, 0), if_false_label
, if_true_label
);
9228 case WITH_RECORD_EXPR
:
9229 /* Put the object on the placeholder list, recurse through our first
9230 operand, and pop the list. */
9231 placeholder_list
= tree_cons (TREE_OPERAND (exp
, 1), NULL_TREE
,
9233 do_jump (TREE_OPERAND (exp
, 0), if_false_label
, if_true_label
);
9234 placeholder_list
= TREE_CHAIN (placeholder_list
);
9238 /* This is never less insns than evaluating the PLUS_EXPR followed by
9239 a test and can be longer if the test is eliminated. */
9241 /* Reduce to minus. */
9242 exp
= build (MINUS_EXPR
, TREE_TYPE (exp
),
9243 TREE_OPERAND (exp
, 0),
9244 fold (build1 (NEGATE_EXPR
, TREE_TYPE (TREE_OPERAND (exp
, 1)),
9245 TREE_OPERAND (exp
, 1))));
9246 /* Process as MINUS. */
9250 /* Non-zero iff operands of minus differ. */
9251 do_compare_and_jump (build (NE_EXPR
, TREE_TYPE (exp
),
9252 TREE_OPERAND (exp
, 0),
9253 TREE_OPERAND (exp
, 1)),
9254 NE
, NE
, if_false_label
, if_true_label
);
9258 /* If we are AND'ing with a small constant, do this comparison in the
9259 smallest type that fits. If the machine doesn't have comparisons
9260 that small, it will be converted back to the wider comparison.
9261 This helps if we are testing the sign bit of a narrower object.
9262 combine can't do this for us because it can't know whether a
9263 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */
9265 if (! SLOW_BYTE_ACCESS
9266 && TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
9267 && TYPE_PRECISION (TREE_TYPE (exp
)) <= HOST_BITS_PER_WIDE_INT
9268 && (i
= floor_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1)))) >= 0
9269 && (mode
= mode_for_size (i
+ 1, MODE_INT
, 0)) != BLKmode
9270 && (type
= type_for_mode (mode
, 1)) != 0
9271 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (exp
))
9272 && (cmp_optab
->handlers
[(int) TYPE_MODE (type
)].insn_code
9273 != CODE_FOR_nothing
))
9275 do_jump (convert (type
, exp
), if_false_label
, if_true_label
);
9280 case TRUTH_NOT_EXPR
:
9281 do_jump (TREE_OPERAND (exp
, 0), if_true_label
, if_false_label
);
9284 case TRUTH_ANDIF_EXPR
:
9285 if (if_false_label
== 0)
9286 if_false_label
= drop_through_label
= gen_label_rtx ();
9287 do_jump (TREE_OPERAND (exp
, 0), if_false_label
, NULL_RTX
);
9288 start_cleanup_deferral ();
9289 do_jump (TREE_OPERAND (exp
, 1), if_false_label
, if_true_label
);
9290 end_cleanup_deferral ();
9293 case TRUTH_ORIF_EXPR
:
9294 if (if_true_label
== 0)
9295 if_true_label
= drop_through_label
= gen_label_rtx ();
9296 do_jump (TREE_OPERAND (exp
, 0), NULL_RTX
, if_true_label
);
9297 start_cleanup_deferral ();
9298 do_jump (TREE_OPERAND (exp
, 1), if_false_label
, if_true_label
);
9299 end_cleanup_deferral ();
9304 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, 0);
9305 preserve_temp_slots (NULL_RTX
);
9309 do_pending_stack_adjust ();
9310 do_jump (TREE_OPERAND (exp
, 1), if_false_label
, if_true_label
);
9317 int bitsize
, bitpos
, unsignedp
;
9318 enum machine_mode mode
;
9324 /* Get description of this reference. We don't actually care
9325 about the underlying object here. */
9326 get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
9327 &mode
, &unsignedp
, &volatilep
,
9330 type
= type_for_size (bitsize
, unsignedp
);
9331 if (! SLOW_BYTE_ACCESS
9332 && type
!= 0 && bitsize
>= 0
9333 && TYPE_PRECISION (type
) < TYPE_PRECISION (TREE_TYPE (exp
))
9334 && (cmp_optab
->handlers
[(int) TYPE_MODE (type
)].insn_code
9335 != CODE_FOR_nothing
))
9337 do_jump (convert (type
, exp
), if_false_label
, if_true_label
);
9344 /* Do (a ? 1 : 0) and (a ? 0 : 1) as special cases. */
9345 if (integer_onep (TREE_OPERAND (exp
, 1))
9346 && integer_zerop (TREE_OPERAND (exp
, 2)))
9347 do_jump (TREE_OPERAND (exp
, 0), if_false_label
, if_true_label
);
9349 else if (integer_zerop (TREE_OPERAND (exp
, 1))
9350 && integer_onep (TREE_OPERAND (exp
, 2)))
9351 do_jump (TREE_OPERAND (exp
, 0), if_true_label
, if_false_label
);
9355 register rtx label1
= gen_label_rtx ();
9356 drop_through_label
= gen_label_rtx ();
9358 do_jump (TREE_OPERAND (exp
, 0), label1
, NULL_RTX
);
9360 start_cleanup_deferral ();
9361 /* Now the THEN-expression. */
9362 do_jump (TREE_OPERAND (exp
, 1),
9363 if_false_label
? if_false_label
: drop_through_label
,
9364 if_true_label
? if_true_label
: drop_through_label
);
9365 /* In case the do_jump just above never jumps. */
9366 do_pending_stack_adjust ();
9367 emit_label (label1
);
9369 /* Now the ELSE-expression. */
9370 do_jump (TREE_OPERAND (exp
, 2),
9371 if_false_label
? if_false_label
: drop_through_label
,
9372 if_true_label
? if_true_label
: drop_through_label
);
9373 end_cleanup_deferral ();
9379 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
9381 if (GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_COMPLEX_FLOAT
9382 || GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_COMPLEX_INT
)
9384 tree exp0
= save_expr (TREE_OPERAND (exp
, 0));
9385 tree exp1
= save_expr (TREE_OPERAND (exp
, 1));
9388 (build (TRUTH_ANDIF_EXPR
, TREE_TYPE (exp
),
9389 fold (build (EQ_EXPR
, TREE_TYPE (exp
),
9390 fold (build1 (REALPART_EXPR
,
9391 TREE_TYPE (inner_type
),
9393 fold (build1 (REALPART_EXPR
,
9394 TREE_TYPE (inner_type
),
9396 fold (build (EQ_EXPR
, TREE_TYPE (exp
),
9397 fold (build1 (IMAGPART_EXPR
,
9398 TREE_TYPE (inner_type
),
9400 fold (build1 (IMAGPART_EXPR
,
9401 TREE_TYPE (inner_type
),
9403 if_false_label
, if_true_label
);
9406 else if (integer_zerop (TREE_OPERAND (exp
, 1)))
9407 do_jump (TREE_OPERAND (exp
, 0), if_true_label
, if_false_label
);
9409 else if (GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_INT
9410 && !can_compare_p (TYPE_MODE (inner_type
), ccp_jump
))
9411 do_jump_by_parts_equality (exp
, if_false_label
, if_true_label
);
9413 do_compare_and_jump (exp
, EQ
, EQ
, if_false_label
, if_true_label
);
9419 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
9421 if (GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_COMPLEX_FLOAT
9422 || GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_COMPLEX_INT
)
9424 tree exp0
= save_expr (TREE_OPERAND (exp
, 0));
9425 tree exp1
= save_expr (TREE_OPERAND (exp
, 1));
9428 (build (TRUTH_ORIF_EXPR
, TREE_TYPE (exp
),
9429 fold (build (NE_EXPR
, TREE_TYPE (exp
),
9430 fold (build1 (REALPART_EXPR
,
9431 TREE_TYPE (inner_type
),
9433 fold (build1 (REALPART_EXPR
,
9434 TREE_TYPE (inner_type
),
9436 fold (build (NE_EXPR
, TREE_TYPE (exp
),
9437 fold (build1 (IMAGPART_EXPR
,
9438 TREE_TYPE (inner_type
),
9440 fold (build1 (IMAGPART_EXPR
,
9441 TREE_TYPE (inner_type
),
9443 if_false_label
, if_true_label
);
9446 else if (integer_zerop (TREE_OPERAND (exp
, 1)))
9447 do_jump (TREE_OPERAND (exp
, 0), if_false_label
, if_true_label
);
9449 else if (GET_MODE_CLASS (TYPE_MODE (inner_type
)) == MODE_INT
9450 && !can_compare_p (TYPE_MODE (inner_type
), ccp_jump
))
9451 do_jump_by_parts_equality (exp
, if_true_label
, if_false_label
);
9453 do_compare_and_jump (exp
, NE
, NE
, if_false_label
, if_true_label
);
9458 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9459 if (GET_MODE_CLASS (mode
) == MODE_INT
9460 && ! can_compare_p (mode
, ccp_jump
))
9461 do_jump_by_parts_greater (exp
, 1, if_false_label
, if_true_label
);
9463 do_compare_and_jump (exp
, LT
, LTU
, if_false_label
, if_true_label
);
9467 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9468 if (GET_MODE_CLASS (mode
) == MODE_INT
9469 && ! can_compare_p (mode
, ccp_jump
))
9470 do_jump_by_parts_greater (exp
, 0, if_true_label
, if_false_label
);
9472 do_compare_and_jump (exp
, LE
, LEU
, if_false_label
, if_true_label
);
9476 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9477 if (GET_MODE_CLASS (mode
) == MODE_INT
9478 && ! can_compare_p (mode
, ccp_jump
))
9479 do_jump_by_parts_greater (exp
, 0, if_false_label
, if_true_label
);
9481 do_compare_and_jump (exp
, GT
, GTU
, if_false_label
, if_true_label
);
9485 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9486 if (GET_MODE_CLASS (mode
) == MODE_INT
9487 && ! can_compare_p (mode
, ccp_jump
))
9488 do_jump_by_parts_greater (exp
, 1, if_true_label
, if_false_label
);
9490 do_compare_and_jump (exp
, GE
, GEU
, if_false_label
, if_true_label
);
9495 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, 0);
9497 /* This is not needed any more and causes poor code since it causes
9498 comparisons and tests from non-SI objects to have different code
9500 /* Copy to register to avoid generating bad insns by cse
9501 from (set (mem ...) (arithop)) (set (cc0) (mem ...)). */
9502 if (!cse_not_expected
&& GET_CODE (temp
) == MEM
)
9503 temp
= copy_to_reg (temp
);
9505 do_pending_stack_adjust ();
9506 /* Do any postincrements in the expression that was tested. */
9509 if (GET_CODE (temp
) == CONST_INT
|| GET_CODE (temp
) == LABEL_REF
)
9511 rtx target
= temp
== const0_rtx
? if_false_label
: if_true_label
;
9515 else if (GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
9516 && ! can_compare_p (GET_MODE (temp
), ccp_jump
))
9517 /* Note swapping the labels gives us not-equal. */
9518 do_jump_by_parts_equality_rtx (temp
, if_true_label
, if_false_label
);
9519 else if (GET_MODE (temp
) != VOIDmode
)
9520 do_compare_rtx_and_jump (temp
, CONST0_RTX (GET_MODE (temp
)),
9521 NE
, TREE_UNSIGNED (TREE_TYPE (exp
)),
9522 GET_MODE (temp
), NULL_RTX
, 0,
9523 if_false_label
, if_true_label
);
9528 if (drop_through_label
)
9530 /* If do_jump produces code that might be jumped around,
9531 do any stack adjusts from that code, before the place
9532 where control merges in. */
9533 do_pending_stack_adjust ();
9534 emit_label (drop_through_label
);
9538 /* Given a comparison expression EXP for values too wide to be compared
9539 with one insn, test the comparison and jump to the appropriate label.
9540 The code of EXP is ignored; we always test GT if SWAP is 0,
9541 and LT if SWAP is 1. */
9544 do_jump_by_parts_greater (exp
, swap
, if_false_label
, if_true_label
)
9547 rtx if_false_label
, if_true_label
;
9549 rtx op0
= expand_expr (TREE_OPERAND (exp
, swap
), NULL_RTX
, VOIDmode
, 0);
9550 rtx op1
= expand_expr (TREE_OPERAND (exp
, !swap
), NULL_RTX
, VOIDmode
, 0);
9551 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9552 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9554 do_jump_by_parts_greater_rtx (mode
, unsignedp
, op0
, op1
, if_false_label
, if_true_label
);
9557 /* Compare OP0 with OP1, word at a time, in mode MODE.
9558 UNSIGNEDP says to do unsigned comparison.
9559 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */
9562 do_jump_by_parts_greater_rtx (mode
, unsignedp
, op0
, op1
, if_false_label
, if_true_label
)
9563 enum machine_mode mode
;
9566 rtx if_false_label
, if_true_label
;
9568 int nwords
= (GET_MODE_SIZE (mode
) / UNITS_PER_WORD
);
9569 rtx drop_through_label
= 0;
9572 if (! if_true_label
|| ! if_false_label
)
9573 drop_through_label
= gen_label_rtx ();
9574 if (! if_true_label
)
9575 if_true_label
= drop_through_label
;
9576 if (! if_false_label
)
9577 if_false_label
= drop_through_label
;
9579 /* Compare a word at a time, high order first. */
9580 for (i
= 0; i
< nwords
; i
++)
9582 rtx op0_word
, op1_word
;
9584 if (WORDS_BIG_ENDIAN
)
9586 op0_word
= operand_subword_force (op0
, i
, mode
);
9587 op1_word
= operand_subword_force (op1
, i
, mode
);
9591 op0_word
= operand_subword_force (op0
, nwords
- 1 - i
, mode
);
9592 op1_word
= operand_subword_force (op1
, nwords
- 1 - i
, mode
);
9595 /* All but high-order word must be compared as unsigned. */
9596 do_compare_rtx_and_jump (op0_word
, op1_word
, GT
,
9597 (unsignedp
|| i
> 0), word_mode
, NULL_RTX
, 0,
9598 NULL_RTX
, if_true_label
);
9600 /* Consider lower words only if these are equal. */
9601 do_compare_rtx_and_jump (op0_word
, op1_word
, NE
, unsignedp
, word_mode
,
9602 NULL_RTX
, 0, NULL_RTX
, if_false_label
);
9606 emit_jump (if_false_label
);
9607 if (drop_through_label
)
9608 emit_label (drop_through_label
);
9611 /* Given an EQ_EXPR expression EXP for values too wide to be compared
9612 with one insn, test the comparison and jump to the appropriate label. */
9615 do_jump_by_parts_equality (exp
, if_false_label
, if_true_label
)
9617 rtx if_false_label
, if_true_label
;
9619 rtx op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
9620 rtx op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
9621 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9622 int nwords
= (GET_MODE_SIZE (mode
) / UNITS_PER_WORD
);
9624 rtx drop_through_label
= 0;
9626 if (! if_false_label
)
9627 drop_through_label
= if_false_label
= gen_label_rtx ();
9629 for (i
= 0; i
< nwords
; i
++)
9630 do_compare_rtx_and_jump (operand_subword_force (op0
, i
, mode
),
9631 operand_subword_force (op1
, i
, mode
),
9632 EQ
, TREE_UNSIGNED (TREE_TYPE (exp
)),
9633 word_mode
, NULL_RTX
, 0, if_false_label
,
9637 emit_jump (if_true_label
);
9638 if (drop_through_label
)
9639 emit_label (drop_through_label
);
9642 /* Jump according to whether OP0 is 0.
9643 We assume that OP0 has an integer mode that is too wide
9644 for the available compare insns. */
9647 do_jump_by_parts_equality_rtx (op0
, if_false_label
, if_true_label
)
9649 rtx if_false_label
, if_true_label
;
9651 int nwords
= GET_MODE_SIZE (GET_MODE (op0
)) / UNITS_PER_WORD
;
9654 rtx drop_through_label
= 0;
9656 /* The fastest way of doing this comparison on almost any machine is to
9657 "or" all the words and compare the result. If all have to be loaded
9658 from memory and this is a very wide item, it's possible this may
9659 be slower, but that's highly unlikely. */
9661 part
= gen_reg_rtx (word_mode
);
9662 emit_move_insn (part
, operand_subword_force (op0
, 0, GET_MODE (op0
)));
9663 for (i
= 1; i
< nwords
&& part
!= 0; i
++)
9664 part
= expand_binop (word_mode
, ior_optab
, part
,
9665 operand_subword_force (op0
, i
, GET_MODE (op0
)),
9666 part
, 1, OPTAB_WIDEN
);
9670 do_compare_rtx_and_jump (part
, const0_rtx
, EQ
, 1, word_mode
,
9671 NULL_RTX
, 0, if_false_label
, if_true_label
);
9676 /* If we couldn't do the "or" simply, do this with a series of compares. */
9677 if (! if_false_label
)
9678 drop_through_label
= if_false_label
= gen_label_rtx ();
9680 for (i
= 0; i
< nwords
; i
++)
9681 do_compare_rtx_and_jump (operand_subword_force (op0
, i
, GET_MODE (op0
)),
9682 const0_rtx
, EQ
, 1, word_mode
, NULL_RTX
, 0,
9683 if_false_label
, NULL_RTX
);
9686 emit_jump (if_true_label
);
9688 if (drop_through_label
)
9689 emit_label (drop_through_label
);
9692 /* Generate code for a comparison of OP0 and OP1 with rtx code CODE.
9693 (including code to compute the values to be compared)
9694 and set (CC0) according to the result.
9695 The decision as to signed or unsigned comparison must be made by the caller.
9697 We force a stack adjustment unless there are currently
9698 things pushed on the stack that aren't yet used.
9700 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9703 If ALIGN is non-zero, it is the alignment of this type; if zero, the
9704 size of MODE should be used. */
9707 compare_from_rtx (op0
, op1
, code
, unsignedp
, mode
, size
, align
)
9708 register rtx op0
, op1
;
9711 enum machine_mode mode
;
9717 /* If one operand is constant, make it the second one. Only do this
9718 if the other operand is not constant as well. */
9720 if ((CONSTANT_P (op0
) && ! CONSTANT_P (op1
))
9721 || (GET_CODE (op0
) == CONST_INT
&& GET_CODE (op1
) != CONST_INT
))
9726 code
= swap_condition (code
);
9731 op0
= force_not_mem (op0
);
9732 op1
= force_not_mem (op1
);
9735 do_pending_stack_adjust ();
9737 if (GET_CODE (op0
) == CONST_INT
&& GET_CODE (op1
) == CONST_INT
9738 && (tem
= simplify_relational_operation (code
, mode
, op0
, op1
)) != 0)
9742 /* There's no need to do this now that combine.c can eliminate lots of
9743 sign extensions. This can be less efficient in certain cases on other
9746 /* If this is a signed equality comparison, we can do it as an
9747 unsigned comparison since zero-extension is cheaper than sign
9748 extension and comparisons with zero are done as unsigned. This is
9749 the case even on machines that can do fast sign extension, since
9750 zero-extension is easier to combine with other operations than
9751 sign-extension is. If we are comparing against a constant, we must
9752 convert it to what it would look like unsigned. */
9753 if ((code
== EQ
|| code
== NE
) && ! unsignedp
9754 && GET_MODE_BITSIZE (GET_MODE (op0
)) <= HOST_BITS_PER_WIDE_INT
)
9756 if (GET_CODE (op1
) == CONST_INT
9757 && (INTVAL (op1
) & GET_MODE_MASK (GET_MODE (op0
))) != INTVAL (op1
))
9758 op1
= GEN_INT (INTVAL (op1
) & GET_MODE_MASK (GET_MODE (op0
)));
9763 emit_cmp_insn (op0
, op1
, code
, size
, mode
, unsignedp
, align
);
9765 return gen_rtx_fmt_ee (code
, VOIDmode
, cc0_rtx
, const0_rtx
);
9768 /* Like do_compare_and_jump but expects the values to compare as two rtx's.
9769 The decision as to signed or unsigned comparison must be made by the caller.
9771 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being
9774 If ALIGN is non-zero, it is the alignment of this type; if zero, the
9775 size of MODE should be used. */
9778 do_compare_rtx_and_jump (op0
, op1
, code
, unsignedp
, mode
, size
, align
,
9779 if_false_label
, if_true_label
)
9780 register rtx op0
, op1
;
9783 enum machine_mode mode
;
9786 rtx if_false_label
, if_true_label
;
9789 int dummy_true_label
= 0;
9791 /* Reverse the comparison if that is safe and we want to jump if it is
9793 if (! if_true_label
&& ! FLOAT_MODE_P (mode
))
9795 if_true_label
= if_false_label
;
9797 code
= reverse_condition (code
);
9800 /* If one operand is constant, make it the second one. Only do this
9801 if the other operand is not constant as well. */
9803 if ((CONSTANT_P (op0
) && ! CONSTANT_P (op1
))
9804 || (GET_CODE (op0
) == CONST_INT
&& GET_CODE (op1
) != CONST_INT
))
9809 code
= swap_condition (code
);
9814 op0
= force_not_mem (op0
);
9815 op1
= force_not_mem (op1
);
9818 do_pending_stack_adjust ();
9820 if (GET_CODE (op0
) == CONST_INT
&& GET_CODE (op1
) == CONST_INT
9821 && (tem
= simplify_relational_operation (code
, mode
, op0
, op1
)) != 0)
9823 if (tem
== const_true_rtx
)
9826 emit_jump (if_true_label
);
9831 emit_jump (if_false_label
);
9837 /* There's no need to do this now that combine.c can eliminate lots of
9838 sign extensions. This can be less efficient in certain cases on other
9841 /* If this is a signed equality comparison, we can do it as an
9842 unsigned comparison since zero-extension is cheaper than sign
9843 extension and comparisons with zero are done as unsigned. This is
9844 the case even on machines that can do fast sign extension, since
9845 zero-extension is easier to combine with other operations than
9846 sign-extension is. If we are comparing against a constant, we must
9847 convert it to what it would look like unsigned. */
9848 if ((code
== EQ
|| code
== NE
) && ! unsignedp
9849 && GET_MODE_BITSIZE (GET_MODE (op0
)) <= HOST_BITS_PER_WIDE_INT
)
9851 if (GET_CODE (op1
) == CONST_INT
9852 && (INTVAL (op1
) & GET_MODE_MASK (GET_MODE (op0
))) != INTVAL (op1
))
9853 op1
= GEN_INT (INTVAL (op1
) & GET_MODE_MASK (GET_MODE (op0
)));
9858 if (! if_true_label
)
9860 dummy_true_label
= 1;
9861 if_true_label
= gen_label_rtx ();
9864 emit_cmp_and_jump_insns (op0
, op1
, code
, size
, mode
, unsignedp
, align
,
9868 emit_jump (if_false_label
);
9869 if (dummy_true_label
)
9870 emit_label (if_true_label
);
9873 /* Generate code for a comparison expression EXP (including code to compute
9874 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or
9875 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the
9876 generated code will drop through.
9877 SIGNED_CODE should be the rtx operation for this comparison for
9878 signed data; UNSIGNED_CODE, likewise for use if data is unsigned.
9880 We force a stack adjustment unless there are currently
9881 things pushed on the stack that aren't yet used. */
9884 do_compare_and_jump (exp
, signed_code
, unsigned_code
, if_false_label
,
9887 enum rtx_code signed_code
, unsigned_code
;
9888 rtx if_false_label
, if_true_label
;
9891 register rtx op0
, op1
;
9893 register enum machine_mode mode
;
9897 /* Don't crash if the comparison was erroneous. */
9898 op0
= expand_expr_unaligned (TREE_OPERAND (exp
, 0), &align0
);
9899 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ERROR_MARK
)
9902 op1
= expand_expr_unaligned (TREE_OPERAND (exp
, 1), &align1
);
9903 type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
9904 mode
= TYPE_MODE (type
);
9905 unsignedp
= TREE_UNSIGNED (type
);
9906 code
= unsignedp
? unsigned_code
: signed_code
;
9908 #ifdef HAVE_canonicalize_funcptr_for_compare
9909 /* If function pointers need to be "canonicalized" before they can
9910 be reliably compared, then canonicalize them. */
9911 if (HAVE_canonicalize_funcptr_for_compare
9912 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == POINTER_TYPE
9913 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
9916 rtx new_op0
= gen_reg_rtx (mode
);
9918 emit_insn (gen_canonicalize_funcptr_for_compare (new_op0
, op0
));
9922 if (HAVE_canonicalize_funcptr_for_compare
9923 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 1))) == POINTER_TYPE
9924 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
9927 rtx new_op1
= gen_reg_rtx (mode
);
9929 emit_insn (gen_canonicalize_funcptr_for_compare (new_op1
, op1
));
9934 /* Do any postincrements in the expression that was tested. */
9937 do_compare_rtx_and_jump (op0
, op1
, code
, unsignedp
, mode
,
9939 ? expr_size (TREE_OPERAND (exp
, 0)) : NULL_RTX
),
9940 MIN (align0
, align1
) / BITS_PER_UNIT
,
9941 if_false_label
, if_true_label
);
9944 /* Generate code to calculate EXP using a store-flag instruction
9945 and return an rtx for the result. EXP is either a comparison
9946 or a TRUTH_NOT_EXPR whose operand is a comparison.
9948 If TARGET is nonzero, store the result there if convenient.
9950 If ONLY_CHEAP is non-zero, only do this if it is likely to be very
9953 Return zero if there is no suitable set-flag instruction
9954 available on this machine.
9956 Once expand_expr has been called on the arguments of the comparison,
9957 we are committed to doing the store flag, since it is not safe to
9958 re-evaluate the expression. We emit the store-flag insn by calling
9959 emit_store_flag, but only expand the arguments if we have a reason
9960 to believe that emit_store_flag will be successful. If we think that
9961 it will, but it isn't, we have to simulate the store-flag with a
9962 set/jump/set sequence. */
9965 do_store_flag (exp
, target
, mode
, only_cheap
)
9968 enum machine_mode mode
;
9972 tree arg0
, arg1
, type
;
9974 enum machine_mode operand_mode
;
9978 enum insn_code icode
;
9979 rtx subtarget
= target
;
9982 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9983 result at the end. We can't simply invert the test since it would
9984 have already been inverted if it were valid. This case occurs for
9985 some floating-point comparisons. */
9987 if (TREE_CODE (exp
) == TRUTH_NOT_EXPR
)
9988 invert
= 1, exp
= TREE_OPERAND (exp
, 0);
9990 arg0
= TREE_OPERAND (exp
, 0);
9991 arg1
= TREE_OPERAND (exp
, 1);
9992 type
= TREE_TYPE (arg0
);
9993 operand_mode
= TYPE_MODE (type
);
9994 unsignedp
= TREE_UNSIGNED (type
);
9996 /* We won't bother with BLKmode store-flag operations because it would mean
9997 passing a lot of information to emit_store_flag. */
9998 if (operand_mode
== BLKmode
)
10001 /* We won't bother with store-flag operations involving function pointers
10002 when function pointers must be canonicalized before comparisons. */
10003 #ifdef HAVE_canonicalize_funcptr_for_compare
10004 if (HAVE_canonicalize_funcptr_for_compare
10005 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == POINTER_TYPE
10006 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
10008 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 1))) == POINTER_TYPE
10009 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
10010 == FUNCTION_TYPE
))))
10017 /* Get the rtx comparison code to use. We know that EXP is a comparison
10018 operation of some type. Some comparisons against 1 and -1 can be
10019 converted to comparisons with zero. Do so here so that the tests
10020 below will be aware that we have a comparison with zero. These
10021 tests will not catch constants in the first operand, but constants
10022 are rarely passed as the first operand. */
10024 switch (TREE_CODE (exp
))
10033 if (integer_onep (arg1
))
10034 arg1
= integer_zero_node
, code
= unsignedp
? LEU
: LE
;
10036 code
= unsignedp
? LTU
: LT
;
10039 if (! unsignedp
&& integer_all_onesp (arg1
))
10040 arg1
= integer_zero_node
, code
= LT
;
10042 code
= unsignedp
? LEU
: LE
;
10045 if (! unsignedp
&& integer_all_onesp (arg1
))
10046 arg1
= integer_zero_node
, code
= GE
;
10048 code
= unsignedp
? GTU
: GT
;
10051 if (integer_onep (arg1
))
10052 arg1
= integer_zero_node
, code
= unsignedp
? GTU
: GT
;
10054 code
= unsignedp
? GEU
: GE
;
10060 /* Put a constant second. */
10061 if (TREE_CODE (arg0
) == REAL_CST
|| TREE_CODE (arg0
) == INTEGER_CST
)
10063 tem
= arg0
; arg0
= arg1
; arg1
= tem
;
10064 code
= swap_condition (code
);
10067 /* If this is an equality or inequality test of a single bit, we can
10068 do this by shifting the bit being tested to the low-order bit and
10069 masking the result with the constant 1. If the condition was EQ,
10070 we xor it with 1. This does not require an scc insn and is faster
10071 than an scc insn even if we have it. */
10073 if ((code
== NE
|| code
== EQ
)
10074 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
10075 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10077 tree inner
= TREE_OPERAND (arg0
, 0);
10078 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
10081 /* If INNER is a right shift of a constant and it plus BITNUM does
10082 not overflow, adjust BITNUM and INNER. */
10084 if (TREE_CODE (inner
) == RSHIFT_EXPR
10085 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
10086 && TREE_INT_CST_HIGH (TREE_OPERAND (inner
, 1)) == 0
10087 && (bitnum
+ TREE_INT_CST_LOW (TREE_OPERAND (inner
, 1))
10088 < TYPE_PRECISION (type
)))
10090 bitnum
+= TREE_INT_CST_LOW (TREE_OPERAND (inner
, 1));
10091 inner
= TREE_OPERAND (inner
, 0);
10094 /* If we are going to be able to omit the AND below, we must do our
10095 operations as unsigned. If we must use the AND, we have a choice.
10096 Normally unsigned is faster, but for some machines signed is. */
10097 ops_unsignedp
= (bitnum
== TYPE_PRECISION (type
) - 1 ? 1
10098 #ifdef LOAD_EXTEND_OP
10099 : (LOAD_EXTEND_OP (operand_mode
) == SIGN_EXTEND
? 0 : 1)
10105 if (subtarget
== 0 || GET_CODE (subtarget
) != REG
10106 || GET_MODE (subtarget
) != operand_mode
10107 || ! safe_from_p (subtarget
, inner
, 1))
10110 op0
= expand_expr (inner
, subtarget
, VOIDmode
, 0);
10113 op0
= expand_shift (RSHIFT_EXPR
, GET_MODE (op0
), op0
,
10114 size_int (bitnum
), subtarget
, ops_unsignedp
);
10116 if (GET_MODE (op0
) != mode
)
10117 op0
= convert_to_mode (mode
, op0
, ops_unsignedp
);
10119 if ((code
== EQ
&& ! invert
) || (code
== NE
&& invert
))
10120 op0
= expand_binop (mode
, xor_optab
, op0
, const1_rtx
, subtarget
,
10121 ops_unsignedp
, OPTAB_LIB_WIDEN
);
10123 /* Put the AND last so it can combine with more things. */
10124 if (bitnum
!= TYPE_PRECISION (type
) - 1)
10125 op0
= expand_and (op0
, const1_rtx
, subtarget
);
10130 /* Now see if we are likely to be able to do this. Return if not. */
10131 if (! can_compare_p (operand_mode
, ccp_store_flag
))
10133 icode
= setcc_gen_code
[(int) code
];
10134 if (icode
== CODE_FOR_nothing
10135 || (only_cheap
&& insn_data
[(int) icode
].operand
[0].mode
!= mode
))
10137 /* We can only do this if it is one of the special cases that
10138 can be handled without an scc insn. */
10139 if ((code
== LT
&& integer_zerop (arg1
))
10140 || (! only_cheap
&& code
== GE
&& integer_zerop (arg1
)))
10142 else if (BRANCH_COST
>= 0
10143 && ! only_cheap
&& (code
== NE
|| code
== EQ
)
10144 && TREE_CODE (type
) != REAL_TYPE
10145 && ((abs_optab
->handlers
[(int) operand_mode
].insn_code
10146 != CODE_FOR_nothing
)
10147 || (ffs_optab
->handlers
[(int) operand_mode
].insn_code
10148 != CODE_FOR_nothing
)))
10154 preexpand_calls (exp
);
10155 if (subtarget
== 0 || GET_CODE (subtarget
) != REG
10156 || GET_MODE (subtarget
) != operand_mode
10157 || ! safe_from_p (subtarget
, arg1
, 1))
10160 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, 0);
10161 op1
= expand_expr (arg1
, NULL_RTX
, VOIDmode
, 0);
10164 target
= gen_reg_rtx (mode
);
10166 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10167 because, if the emit_store_flag does anything it will succeed and
10168 OP0 and OP1 will not be used subsequently. */
10170 result
= emit_store_flag (target
, code
,
10171 queued_subexp_p (op0
) ? copy_rtx (op0
) : op0
,
10172 queued_subexp_p (op1
) ? copy_rtx (op1
) : op1
,
10173 operand_mode
, unsignedp
, 1);
10178 result
= expand_binop (mode
, xor_optab
, result
, const1_rtx
,
10179 result
, 0, OPTAB_LIB_WIDEN
);
10183 /* If this failed, we have to do this with set/compare/jump/set code. */
10184 if (GET_CODE (target
) != REG
10185 || reg_mentioned_p (target
, op0
) || reg_mentioned_p (target
, op1
))
10186 target
= gen_reg_rtx (GET_MODE (target
));
10188 emit_move_insn (target
, invert
? const0_rtx
: const1_rtx
);
10189 result
= compare_from_rtx (op0
, op1
, code
, unsignedp
,
10190 operand_mode
, NULL_RTX
, 0);
10191 if (GET_CODE (result
) == CONST_INT
)
10192 return (((result
== const0_rtx
&& ! invert
)
10193 || (result
!= const0_rtx
&& invert
))
10194 ? const0_rtx
: const1_rtx
);
10196 label
= gen_label_rtx ();
10197 if (bcc_gen_fctn
[(int) code
] == 0)
10200 emit_jump_insn ((*bcc_gen_fctn
[(int) code
]) (label
));
10201 emit_move_insn (target
, invert
? const1_rtx
: const0_rtx
);
10202 emit_label (label
);
10207 /* Generate a tablejump instruction (used for switch statements). */
10209 #ifdef HAVE_tablejump
10211 /* INDEX is the value being switched on, with the lowest value
10212 in the table already subtracted.
10213 MODE is its expected mode (needed if INDEX is constant).
10214 RANGE is the length of the jump table.
10215 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10217 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10218 index value is out of range. */
10221 do_tablejump (index
, mode
, range
, table_label
, default_label
)
10222 rtx index
, range
, table_label
, default_label
;
10223 enum machine_mode mode
;
10225 register rtx temp
, vector
;
10227 /* Do an unsigned comparison (in the proper mode) between the index
10228 expression and the value which represents the length of the range.
10229 Since we just finished subtracting the lower bound of the range
10230 from the index expression, this comparison allows us to simultaneously
10231 check that the original index expression value is both greater than
10232 or equal to the minimum value of the range and less than or equal to
10233 the maximum value of the range. */
10235 emit_cmp_and_jump_insns (index
, range
, GTU
, NULL_RTX
, mode
, 1,
10238 /* If index is in range, it must fit in Pmode.
10239 Convert to Pmode so we can index with it. */
10241 index
= convert_to_mode (Pmode
, index
, 1);
10243 /* Don't let a MEM slip thru, because then INDEX that comes
10244 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10245 and break_out_memory_refs will go to work on it and mess it up. */
10246 #ifdef PIC_CASE_VECTOR_ADDRESS
10247 if (flag_pic
&& GET_CODE (index
) != REG
)
10248 index
= copy_to_mode_reg (Pmode
, index
);
10251 /* If flag_force_addr were to affect this address
10252 it could interfere with the tricky assumptions made
10253 about addresses that contain label-refs,
10254 which may be valid only very near the tablejump itself. */
10255 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10256 GET_MODE_SIZE, because this indicates how large insns are. The other
10257 uses should all be Pmode, because they are addresses. This code
10258 could fail if addresses and insns are not the same size. */
10259 index
= gen_rtx_PLUS (Pmode
,
10260 gen_rtx_MULT (Pmode
, index
,
10261 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE
))),
10262 gen_rtx_LABEL_REF (Pmode
, table_label
));
10263 #ifdef PIC_CASE_VECTOR_ADDRESS
10265 index
= PIC_CASE_VECTOR_ADDRESS (index
);
10268 index
= memory_address_noforce (CASE_VECTOR_MODE
, index
);
10269 temp
= gen_reg_rtx (CASE_VECTOR_MODE
);
10270 vector
= gen_rtx_MEM (CASE_VECTOR_MODE
, index
);
10271 RTX_UNCHANGING_P (vector
) = 1;
10272 convert_move (temp
, vector
, 0);
10274 emit_jump_insn (gen_tablejump (temp
, table_label
));
10276 /* If we are generating PIC code or if the table is PC-relative, the
10277 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10278 if (! CASE_VECTOR_PC_RELATIVE
&& ! flag_pic
)
10282 #endif /* HAVE_tablejump */