1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
36 #include "insn-attr.h"
37 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
47 #include "langhooks.h"
51 /* Decide whether a function's arguments should be processed
52 from first to last or from last to first.
54 They should if the stack and args grow in opposite directions, but
55 only if we have push insns. */
59 #ifndef PUSH_ARGS_REVERSED
60 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
61 #define PUSH_ARGS_REVERSED /* If it's last to first. */
67 #ifndef STACK_PUSH_CODE
68 #ifdef STACK_GROWS_DOWNWARD
69 #define STACK_PUSH_CODE PRE_DEC
71 #define STACK_PUSH_CODE PRE_INC
75 /* Assume that case vectors are not pc-relative. */
76 #ifndef CASE_VECTOR_PC_RELATIVE
77 #define CASE_VECTOR_PC_RELATIVE 0
80 /* Convert defined/undefined to boolean. */
81 #ifdef TARGET_MEM_FUNCTIONS
82 #undef TARGET_MEM_FUNCTIONS
83 #define TARGET_MEM_FUNCTIONS 1
85 #define TARGET_MEM_FUNCTIONS 0
89 /* If this is nonzero, we do not bother generating VOLATILE
90 around volatile memory references, and we are willing to
91 output indirect addresses. If cse is to follow, we reject
92 indirect addresses so a useful potential cse is generated;
93 if it is used only once, instruction combination will produce
94 the same indirect address eventually. */
97 /* Chain of pending expressions for PLACEHOLDER_EXPR to replace. */
98 tree placeholder_list
= 0;
100 /* This structure is used by move_by_pieces to describe the move to
102 struct move_by_pieces
111 int explicit_inc_from
;
112 unsigned HOST_WIDE_INT len
;
113 HOST_WIDE_INT offset
;
117 /* This structure is used by store_by_pieces to describe the clear to
120 struct store_by_pieces
126 unsigned HOST_WIDE_INT len
;
127 HOST_WIDE_INT offset
;
128 rtx (*constfun
) PARAMS ((PTR
, HOST_WIDE_INT
, enum machine_mode
));
133 static rtx enqueue_insn
PARAMS ((rtx
, rtx
));
134 static unsigned HOST_WIDE_INT move_by_pieces_ninsns
135 PARAMS ((unsigned HOST_WIDE_INT
,
137 static void move_by_pieces_1
PARAMS ((rtx (*) (rtx
, ...), enum machine_mode
,
138 struct move_by_pieces
*));
139 static bool block_move_libcall_safe_for_call_parm
PARAMS ((void));
140 static bool emit_block_move_via_movstr
PARAMS ((rtx
, rtx
, rtx
, unsigned));
141 static rtx emit_block_move_via_libcall
PARAMS ((rtx
, rtx
, rtx
));
142 static tree emit_block_move_libcall_fn
PARAMS ((int));
143 static void emit_block_move_via_loop
PARAMS ((rtx
, rtx
, rtx
, unsigned));
144 static rtx clear_by_pieces_1
PARAMS ((PTR
, HOST_WIDE_INT
,
146 static void clear_by_pieces
PARAMS ((rtx
, unsigned HOST_WIDE_INT
,
148 static void store_by_pieces_1
PARAMS ((struct store_by_pieces
*,
150 static void store_by_pieces_2
PARAMS ((rtx (*) (rtx
, ...),
152 struct store_by_pieces
*));
153 static bool clear_storage_via_clrstr
PARAMS ((rtx
, rtx
, unsigned));
154 static rtx clear_storage_via_libcall
PARAMS ((rtx
, rtx
));
155 static tree clear_storage_libcall_fn
PARAMS ((int));
156 static rtx compress_float_constant
PARAMS ((rtx
, rtx
));
157 static rtx get_subtarget
PARAMS ((rtx
));
158 static int is_zeros_p
PARAMS ((tree
));
159 static int mostly_zeros_p
PARAMS ((tree
));
160 static void store_constructor_field
PARAMS ((rtx
, unsigned HOST_WIDE_INT
,
161 HOST_WIDE_INT
, enum machine_mode
,
162 tree
, tree
, int, int));
163 static void store_constructor
PARAMS ((tree
, rtx
, int, HOST_WIDE_INT
));
164 static rtx store_field
PARAMS ((rtx
, HOST_WIDE_INT
,
165 HOST_WIDE_INT
, enum machine_mode
,
166 tree
, enum machine_mode
, int, tree
,
168 static rtx var_rtx
PARAMS ((tree
));
170 static unsigned HOST_WIDE_INT highest_pow2_factor
PARAMS ((tree
));
171 static unsigned HOST_WIDE_INT highest_pow2_factor_for_type
PARAMS ((tree
,
174 static int is_aligning_offset
PARAMS ((tree
, tree
));
175 static rtx expand_increment
PARAMS ((tree
, int, int));
176 static rtx do_store_flag
PARAMS ((tree
, rtx
, enum machine_mode
, int));
178 static void emit_single_push_insn
PARAMS ((enum machine_mode
, rtx
, tree
));
180 static void do_tablejump
PARAMS ((rtx
, enum machine_mode
, rtx
, rtx
, rtx
));
181 static rtx const_vector_from_tree
PARAMS ((tree
));
183 /* Record for each mode whether we can move a register directly to or
184 from an object of that mode in memory. If we can't, we won't try
185 to use that mode directly when accessing a field of that mode. */
187 static char direct_load
[NUM_MACHINE_MODES
];
188 static char direct_store
[NUM_MACHINE_MODES
];
190 /* Record for each mode whether we can float-extend from memory. */
192 static bool float_extend_from_mem
[NUM_MACHINE_MODES
][NUM_MACHINE_MODES
];
194 /* If a memory-to-memory move would take MOVE_RATIO or more simple
195 move-instruction sequences, we will do a movstr or libcall instead. */
198 #if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
201 /* If we are optimizing for space (-Os), cut down the default move ratio. */
202 #define MOVE_RATIO (optimize_size ? 3 : 15)
206 /* This macro is used to determine whether move_by_pieces should be called
207 to perform a structure copy. */
208 #ifndef MOVE_BY_PIECES_P
209 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
210 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) MOVE_RATIO)
213 /* If a clear memory operation would take CLEAR_RATIO or more simple
214 move-instruction sequences, we will do a clrstr or libcall instead. */
217 #if defined (HAVE_clrstrqi) || defined (HAVE_clrstrhi) || defined (HAVE_clrstrsi) || defined (HAVE_clrstrdi) || defined (HAVE_clrstrti)
218 #define CLEAR_RATIO 2
220 /* If we are optimizing for space, cut down the default clear ratio. */
221 #define CLEAR_RATIO (optimize_size ? 3 : 15)
225 /* This macro is used to determine whether clear_by_pieces should be
226 called to clear storage. */
227 #ifndef CLEAR_BY_PIECES_P
228 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
229 (move_by_pieces_ninsns (SIZE, ALIGN) < (unsigned int) CLEAR_RATIO)
232 /* This macro is used to determine whether store_by_pieces should be
233 called to "memset" storage with byte values other than zero, or
234 to "memcpy" storage when the source is a constant string. */
235 #ifndef STORE_BY_PIECES_P
236 #define STORE_BY_PIECES_P(SIZE, ALIGN) MOVE_BY_PIECES_P (SIZE, ALIGN)
239 /* This array records the insn_code of insns to perform block moves. */
240 enum insn_code movstr_optab
[NUM_MACHINE_MODES
];
242 /* This array records the insn_code of insns to perform block clears. */
243 enum insn_code clrstr_optab
[NUM_MACHINE_MODES
];
245 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
247 #ifndef SLOW_UNALIGNED_ACCESS
248 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
251 /* This is run once per compilation to set up which modes can be used
252 directly in memory and to initialize the block move optab. */
258 enum machine_mode mode
;
263 /* Try indexing by frame ptr and try by stack ptr.
264 It is known that on the Convex the stack ptr isn't a valid index.
265 With luck, one or the other is valid on any machine. */
266 mem
= gen_rtx_MEM (VOIDmode
, stack_pointer_rtx
);
267 mem1
= gen_rtx_MEM (VOIDmode
, frame_pointer_rtx
);
269 /* A scratch register we can modify in-place below to avoid
270 useless RTL allocations. */
271 reg
= gen_rtx_REG (VOIDmode
, -1);
273 insn
= rtx_alloc (INSN
);
274 pat
= gen_rtx_SET (0, NULL_RTX
, NULL_RTX
);
275 PATTERN (insn
) = pat
;
277 for (mode
= VOIDmode
; (int) mode
< NUM_MACHINE_MODES
;
278 mode
= (enum machine_mode
) ((int) mode
+ 1))
282 direct_load
[(int) mode
] = direct_store
[(int) mode
] = 0;
283 PUT_MODE (mem
, mode
);
284 PUT_MODE (mem1
, mode
);
285 PUT_MODE (reg
, mode
);
287 /* See if there is some register that can be used in this mode and
288 directly loaded or stored from memory. */
290 if (mode
!= VOIDmode
&& mode
!= BLKmode
)
291 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
292 && (direct_load
[(int) mode
] == 0 || direct_store
[(int) mode
] == 0);
295 if (! HARD_REGNO_MODE_OK (regno
, mode
))
301 SET_DEST (pat
) = reg
;
302 if (recog (pat
, insn
, &num_clobbers
) >= 0)
303 direct_load
[(int) mode
] = 1;
305 SET_SRC (pat
) = mem1
;
306 SET_DEST (pat
) = reg
;
307 if (recog (pat
, insn
, &num_clobbers
) >= 0)
308 direct_load
[(int) mode
] = 1;
311 SET_DEST (pat
) = mem
;
312 if (recog (pat
, insn
, &num_clobbers
) >= 0)
313 direct_store
[(int) mode
] = 1;
316 SET_DEST (pat
) = mem1
;
317 if (recog (pat
, insn
, &num_clobbers
) >= 0)
318 direct_store
[(int) mode
] = 1;
322 mem
= gen_rtx_MEM (VOIDmode
, gen_rtx_raw_REG (Pmode
, 10000));
324 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
325 mode
= GET_MODE_WIDER_MODE (mode
))
327 enum machine_mode srcmode
;
328 for (srcmode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); srcmode
!= mode
;
329 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
333 ic
= can_extend_p (mode
, srcmode
, 0);
334 if (ic
== CODE_FOR_nothing
)
337 PUT_MODE (mem
, srcmode
);
339 if ((*insn_data
[ic
].operand
[1].predicate
) (mem
, srcmode
))
340 float_extend_from_mem
[mode
][srcmode
] = true;
345 /* This is run at the start of compiling a function. */
350 cfun
->expr
= (struct expr_status
*) ggc_alloc (sizeof (struct expr_status
));
353 pending_stack_adjust
= 0;
354 stack_pointer_delta
= 0;
355 inhibit_defer_pop
= 0;
357 apply_args_value
= 0;
361 /* Small sanity check that the queue is empty at the end of a function. */
364 finish_expr_for_function ()
370 /* Manage the queue of increment instructions to be output
371 for POSTINCREMENT_EXPR expressions, etc. */
373 /* Queue up to increment (or change) VAR later. BODY says how:
374 BODY should be the same thing you would pass to emit_insn
375 to increment right away. It will go to emit_insn later on.
377 The value is a QUEUED expression to be used in place of VAR
378 where you want to guarantee the pre-incrementation value of VAR. */
381 enqueue_insn (var
, body
)
384 pending_chain
= gen_rtx_QUEUED (GET_MODE (var
), var
, NULL_RTX
, NULL_RTX
,
385 body
, pending_chain
);
386 return pending_chain
;
389 /* Use protect_from_queue to convert a QUEUED expression
390 into something that you can put immediately into an instruction.
391 If the queued incrementation has not happened yet,
392 protect_from_queue returns the variable itself.
393 If the incrementation has happened, protect_from_queue returns a temp
394 that contains a copy of the old value of the variable.
396 Any time an rtx which might possibly be a QUEUED is to be put
397 into an instruction, it must be passed through protect_from_queue first.
398 QUEUED expressions are not meaningful in instructions.
400 Do not pass a value through protect_from_queue and then hold
401 on to it for a while before putting it in an instruction!
402 If the queue is flushed in between, incorrect code will result. */
405 protect_from_queue (x
, modify
)
409 RTX_CODE code
= GET_CODE (x
);
411 #if 0 /* A QUEUED can hang around after the queue is forced out. */
412 /* Shortcut for most common case. */
413 if (pending_chain
== 0)
419 /* A special hack for read access to (MEM (QUEUED ...)) to facilitate
420 use of autoincrement. Make a copy of the contents of the memory
421 location rather than a copy of the address, but not if the value is
422 of mode BLKmode. Don't modify X in place since it might be
424 if (code
== MEM
&& GET_MODE (x
) != BLKmode
425 && GET_CODE (XEXP (x
, 0)) == QUEUED
&& !modify
)
428 rtx
new = replace_equiv_address_nv (x
, QUEUED_VAR (y
));
432 rtx temp
= gen_reg_rtx (GET_MODE (x
));
434 emit_insn_before (gen_move_insn (temp
, new),
439 /* Copy the address into a pseudo, so that the returned value
440 remains correct across calls to emit_queue. */
441 return replace_equiv_address (new, copy_to_reg (XEXP (new, 0)));
444 /* Otherwise, recursively protect the subexpressions of all
445 the kinds of rtx's that can contain a QUEUED. */
448 rtx tem
= protect_from_queue (XEXP (x
, 0), 0);
449 if (tem
!= XEXP (x
, 0))
455 else if (code
== PLUS
|| code
== MULT
)
457 rtx new0
= protect_from_queue (XEXP (x
, 0), 0);
458 rtx new1
= protect_from_queue (XEXP (x
, 1), 0);
459 if (new0
!= XEXP (x
, 0) || new1
!= XEXP (x
, 1))
468 /* If the increment has not happened, use the variable itself. Copy it
469 into a new pseudo so that the value remains correct across calls to
471 if (QUEUED_INSN (x
) == 0)
472 return copy_to_reg (QUEUED_VAR (x
));
473 /* If the increment has happened and a pre-increment copy exists,
475 if (QUEUED_COPY (x
) != 0)
476 return QUEUED_COPY (x
);
477 /* The increment has happened but we haven't set up a pre-increment copy.
478 Set one up now, and use it. */
479 QUEUED_COPY (x
) = gen_reg_rtx (GET_MODE (QUEUED_VAR (x
)));
480 emit_insn_before (gen_move_insn (QUEUED_COPY (x
), QUEUED_VAR (x
)),
482 return QUEUED_COPY (x
);
485 /* Return nonzero if X contains a QUEUED expression:
486 if it contains anything that will be altered by a queued increment.
487 We handle only combinations of MEM, PLUS, MINUS and MULT operators
488 since memory addresses generally contain only those. */
494 enum rtx_code code
= GET_CODE (x
);
500 return queued_subexp_p (XEXP (x
, 0));
504 return (queued_subexp_p (XEXP (x
, 0))
505 || queued_subexp_p (XEXP (x
, 1)));
511 /* Perform all the pending incrementations. */
517 while ((p
= pending_chain
))
519 rtx body
= QUEUED_BODY (p
);
521 switch (GET_CODE (body
))
529 QUEUED_INSN (p
) = body
;
533 #ifdef ENABLE_CHECKING
540 QUEUED_INSN (p
) = emit_insn (body
);
544 pending_chain
= QUEUED_NEXT (p
);
548 /* Copy data from FROM to TO, where the machine modes are not the same.
549 Both modes may be integer, or both may be floating.
550 UNSIGNEDP should be nonzero if FROM is an unsigned type.
551 This causes zero-extension instead of sign-extension. */
554 convert_move (to
, from
, unsignedp
)
558 enum machine_mode to_mode
= GET_MODE (to
);
559 enum machine_mode from_mode
= GET_MODE (from
);
560 int to_real
= GET_MODE_CLASS (to_mode
) == MODE_FLOAT
;
561 int from_real
= GET_MODE_CLASS (from_mode
) == MODE_FLOAT
;
565 /* rtx code for making an equivalent value. */
566 enum rtx_code equiv_code
= (unsignedp
< 0 ? UNKNOWN
567 : (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
));
569 to
= protect_from_queue (to
, 1);
570 from
= protect_from_queue (from
, 0);
572 if (to_real
!= from_real
)
575 /* If FROM is a SUBREG that indicates that we have already done at least
576 the required extension, strip it. We don't handle such SUBREGs as
579 if (GET_CODE (from
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (from
)
580 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from
)))
581 >= GET_MODE_SIZE (to_mode
))
582 && SUBREG_PROMOTED_UNSIGNED_P (from
) == unsignedp
)
583 from
= gen_lowpart (to_mode
, from
), from_mode
= to_mode
;
585 if (GET_CODE (to
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (to
))
588 if (to_mode
== from_mode
589 || (from_mode
== VOIDmode
&& CONSTANT_P (from
)))
591 emit_move_insn (to
, from
);
595 if (VECTOR_MODE_P (to_mode
) || VECTOR_MODE_P (from_mode
))
597 if (GET_MODE_BITSIZE (from_mode
) != GET_MODE_BITSIZE (to_mode
))
600 if (VECTOR_MODE_P (to_mode
))
601 from
= simplify_gen_subreg (to_mode
, from
, GET_MODE (from
), 0);
603 to
= simplify_gen_subreg (from_mode
, to
, GET_MODE (to
), 0);
605 emit_move_insn (to
, from
);
609 if (to_real
!= from_real
)
616 if (GET_MODE_BITSIZE (from_mode
) < GET_MODE_BITSIZE (to_mode
))
618 /* Try converting directly if the insn is supported. */
619 if ((code
= can_extend_p (to_mode
, from_mode
, 0))
622 emit_unop_insn (code
, to
, from
, UNKNOWN
);
627 #ifdef HAVE_trunchfqf2
628 if (HAVE_trunchfqf2
&& from_mode
== HFmode
&& to_mode
== QFmode
)
630 emit_unop_insn (CODE_FOR_trunchfqf2
, to
, from
, UNKNOWN
);
634 #ifdef HAVE_trunctqfqf2
635 if (HAVE_trunctqfqf2
&& from_mode
== TQFmode
&& to_mode
== QFmode
)
637 emit_unop_insn (CODE_FOR_trunctqfqf2
, to
, from
, UNKNOWN
);
641 #ifdef HAVE_truncsfqf2
642 if (HAVE_truncsfqf2
&& from_mode
== SFmode
&& to_mode
== QFmode
)
644 emit_unop_insn (CODE_FOR_truncsfqf2
, to
, from
, UNKNOWN
);
648 #ifdef HAVE_truncdfqf2
649 if (HAVE_truncdfqf2
&& from_mode
== DFmode
&& to_mode
== QFmode
)
651 emit_unop_insn (CODE_FOR_truncdfqf2
, to
, from
, UNKNOWN
);
655 #ifdef HAVE_truncxfqf2
656 if (HAVE_truncxfqf2
&& from_mode
== XFmode
&& to_mode
== QFmode
)
658 emit_unop_insn (CODE_FOR_truncxfqf2
, to
, from
, UNKNOWN
);
662 #ifdef HAVE_trunctfqf2
663 if (HAVE_trunctfqf2
&& from_mode
== TFmode
&& to_mode
== QFmode
)
665 emit_unop_insn (CODE_FOR_trunctfqf2
, to
, from
, UNKNOWN
);
670 #ifdef HAVE_trunctqfhf2
671 if (HAVE_trunctqfhf2
&& from_mode
== TQFmode
&& to_mode
== HFmode
)
673 emit_unop_insn (CODE_FOR_trunctqfhf2
, to
, from
, UNKNOWN
);
677 #ifdef HAVE_truncsfhf2
678 if (HAVE_truncsfhf2
&& from_mode
== SFmode
&& to_mode
== HFmode
)
680 emit_unop_insn (CODE_FOR_truncsfhf2
, to
, from
, UNKNOWN
);
684 #ifdef HAVE_truncdfhf2
685 if (HAVE_truncdfhf2
&& from_mode
== DFmode
&& to_mode
== HFmode
)
687 emit_unop_insn (CODE_FOR_truncdfhf2
, to
, from
, UNKNOWN
);
691 #ifdef HAVE_truncxfhf2
692 if (HAVE_truncxfhf2
&& from_mode
== XFmode
&& to_mode
== HFmode
)
694 emit_unop_insn (CODE_FOR_truncxfhf2
, to
, from
, UNKNOWN
);
698 #ifdef HAVE_trunctfhf2
699 if (HAVE_trunctfhf2
&& from_mode
== TFmode
&& to_mode
== HFmode
)
701 emit_unop_insn (CODE_FOR_trunctfhf2
, to
, from
, UNKNOWN
);
706 #ifdef HAVE_truncsftqf2
707 if (HAVE_truncsftqf2
&& from_mode
== SFmode
&& to_mode
== TQFmode
)
709 emit_unop_insn (CODE_FOR_truncsftqf2
, to
, from
, UNKNOWN
);
713 #ifdef HAVE_truncdftqf2
714 if (HAVE_truncdftqf2
&& from_mode
== DFmode
&& to_mode
== TQFmode
)
716 emit_unop_insn (CODE_FOR_truncdftqf2
, to
, from
, UNKNOWN
);
720 #ifdef HAVE_truncxftqf2
721 if (HAVE_truncxftqf2
&& from_mode
== XFmode
&& to_mode
== TQFmode
)
723 emit_unop_insn (CODE_FOR_truncxftqf2
, to
, from
, UNKNOWN
);
727 #ifdef HAVE_trunctftqf2
728 if (HAVE_trunctftqf2
&& from_mode
== TFmode
&& to_mode
== TQFmode
)
730 emit_unop_insn (CODE_FOR_trunctftqf2
, to
, from
, UNKNOWN
);
735 #ifdef HAVE_truncdfsf2
736 if (HAVE_truncdfsf2
&& from_mode
== DFmode
&& to_mode
== SFmode
)
738 emit_unop_insn (CODE_FOR_truncdfsf2
, to
, from
, UNKNOWN
);
742 #ifdef HAVE_truncxfsf2
743 if (HAVE_truncxfsf2
&& from_mode
== XFmode
&& to_mode
== SFmode
)
745 emit_unop_insn (CODE_FOR_truncxfsf2
, to
, from
, UNKNOWN
);
749 #ifdef HAVE_trunctfsf2
750 if (HAVE_trunctfsf2
&& from_mode
== TFmode
&& to_mode
== SFmode
)
752 emit_unop_insn (CODE_FOR_trunctfsf2
, to
, from
, UNKNOWN
);
756 #ifdef HAVE_truncxfdf2
757 if (HAVE_truncxfdf2
&& from_mode
== XFmode
&& to_mode
== DFmode
)
759 emit_unop_insn (CODE_FOR_truncxfdf2
, to
, from
, UNKNOWN
);
763 #ifdef HAVE_trunctfdf2
764 if (HAVE_trunctfdf2
&& from_mode
== TFmode
&& to_mode
== DFmode
)
766 emit_unop_insn (CODE_FOR_trunctfdf2
, to
, from
, UNKNOWN
);
778 libcall
= extendsfdf2_libfunc
;
782 libcall
= extendsfxf2_libfunc
;
786 libcall
= extendsftf2_libfunc
;
798 libcall
= truncdfsf2_libfunc
;
802 libcall
= extenddfxf2_libfunc
;
806 libcall
= extenddftf2_libfunc
;
818 libcall
= truncxfsf2_libfunc
;
822 libcall
= truncxfdf2_libfunc
;
834 libcall
= trunctfsf2_libfunc
;
838 libcall
= trunctfdf2_libfunc
;
850 if (libcall
== (rtx
) 0)
851 /* This conversion is not implemented yet. */
855 value
= emit_library_call_value (libcall
, NULL_RTX
, LCT_CONST
, to_mode
,
857 insns
= get_insns ();
859 emit_libcall_block (insns
, to
, value
, gen_rtx_FLOAT_TRUNCATE (to_mode
,
864 /* Now both modes are integers. */
866 /* Handle expanding beyond a word. */
867 if (GET_MODE_BITSIZE (from_mode
) < GET_MODE_BITSIZE (to_mode
)
868 && GET_MODE_BITSIZE (to_mode
) > BITS_PER_WORD
)
875 enum machine_mode lowpart_mode
;
876 int nwords
= CEIL (GET_MODE_SIZE (to_mode
), UNITS_PER_WORD
);
878 /* Try converting directly if the insn is supported. */
879 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
882 /* If FROM is a SUBREG, put it into a register. Do this
883 so that we always generate the same set of insns for
884 better cse'ing; if an intermediate assignment occurred,
885 we won't be doing the operation directly on the SUBREG. */
886 if (optimize
> 0 && GET_CODE (from
) == SUBREG
)
887 from
= force_reg (from_mode
, from
);
888 emit_unop_insn (code
, to
, from
, equiv_code
);
891 /* Next, try converting via full word. */
892 else if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
893 && ((code
= can_extend_p (to_mode
, word_mode
, unsignedp
))
894 != CODE_FOR_nothing
))
896 if (GET_CODE (to
) == REG
)
897 emit_insn (gen_rtx_CLOBBER (VOIDmode
, to
));
898 convert_move (gen_lowpart (word_mode
, to
), from
, unsignedp
);
899 emit_unop_insn (code
, to
,
900 gen_lowpart (word_mode
, to
), equiv_code
);
904 /* No special multiword conversion insn; do it by hand. */
907 /* Since we will turn this into a no conflict block, we must ensure
908 that the source does not overlap the target. */
910 if (reg_overlap_mentioned_p (to
, from
))
911 from
= force_reg (from_mode
, from
);
913 /* Get a copy of FROM widened to a word, if necessary. */
914 if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
)
915 lowpart_mode
= word_mode
;
917 lowpart_mode
= from_mode
;
919 lowfrom
= convert_to_mode (lowpart_mode
, from
, unsignedp
);
921 lowpart
= gen_lowpart (lowpart_mode
, to
);
922 emit_move_insn (lowpart
, lowfrom
);
924 /* Compute the value to put in each remaining word. */
926 fill_value
= const0_rtx
;
931 && insn_data
[(int) CODE_FOR_slt
].operand
[0].mode
== word_mode
932 && STORE_FLAG_VALUE
== -1)
934 emit_cmp_insn (lowfrom
, const0_rtx
, NE
, NULL_RTX
,
936 fill_value
= gen_reg_rtx (word_mode
);
937 emit_insn (gen_slt (fill_value
));
943 = expand_shift (RSHIFT_EXPR
, lowpart_mode
, lowfrom
,
944 size_int (GET_MODE_BITSIZE (lowpart_mode
) - 1),
946 fill_value
= convert_to_mode (word_mode
, fill_value
, 1);
950 /* Fill the remaining words. */
951 for (i
= GET_MODE_SIZE (lowpart_mode
) / UNITS_PER_WORD
; i
< nwords
; i
++)
953 int index
= (WORDS_BIG_ENDIAN
? nwords
- i
- 1 : i
);
954 rtx subword
= operand_subword (to
, index
, 1, to_mode
);
959 if (fill_value
!= subword
)
960 emit_move_insn (subword
, fill_value
);
963 insns
= get_insns ();
966 emit_no_conflict_block (insns
, to
, from
, NULL_RTX
,
967 gen_rtx_fmt_e (equiv_code
, to_mode
, copy_rtx (from
)));
971 /* Truncating multi-word to a word or less. */
972 if (GET_MODE_BITSIZE (from_mode
) > BITS_PER_WORD
973 && GET_MODE_BITSIZE (to_mode
) <= BITS_PER_WORD
)
975 if (!((GET_CODE (from
) == MEM
976 && ! MEM_VOLATILE_P (from
)
977 && direct_load
[(int) to_mode
]
978 && ! mode_dependent_address_p (XEXP (from
, 0)))
979 || GET_CODE (from
) == REG
980 || GET_CODE (from
) == SUBREG
))
981 from
= force_reg (from_mode
, from
);
982 convert_move (to
, gen_lowpart (word_mode
, from
), 0);
986 /* Handle pointer conversion. */ /* SPEE 900220. */
987 if (to_mode
== PQImode
)
989 if (from_mode
!= QImode
)
990 from
= convert_to_mode (QImode
, from
, unsignedp
);
992 #ifdef HAVE_truncqipqi2
993 if (HAVE_truncqipqi2
)
995 emit_unop_insn (CODE_FOR_truncqipqi2
, to
, from
, UNKNOWN
);
998 #endif /* HAVE_truncqipqi2 */
1002 if (from_mode
== PQImode
)
1004 if (to_mode
!= QImode
)
1006 from
= convert_to_mode (QImode
, from
, unsignedp
);
1011 #ifdef HAVE_extendpqiqi2
1012 if (HAVE_extendpqiqi2
)
1014 emit_unop_insn (CODE_FOR_extendpqiqi2
, to
, from
, UNKNOWN
);
1017 #endif /* HAVE_extendpqiqi2 */
1022 if (to_mode
== PSImode
)
1024 if (from_mode
!= SImode
)
1025 from
= convert_to_mode (SImode
, from
, unsignedp
);
1027 #ifdef HAVE_truncsipsi2
1028 if (HAVE_truncsipsi2
)
1030 emit_unop_insn (CODE_FOR_truncsipsi2
, to
, from
, UNKNOWN
);
1033 #endif /* HAVE_truncsipsi2 */
1037 if (from_mode
== PSImode
)
1039 if (to_mode
!= SImode
)
1041 from
= convert_to_mode (SImode
, from
, unsignedp
);
1046 #ifdef HAVE_extendpsisi2
1047 if (! unsignedp
&& HAVE_extendpsisi2
)
1049 emit_unop_insn (CODE_FOR_extendpsisi2
, to
, from
, UNKNOWN
);
1052 #endif /* HAVE_extendpsisi2 */
1053 #ifdef HAVE_zero_extendpsisi2
1054 if (unsignedp
&& HAVE_zero_extendpsisi2
)
1056 emit_unop_insn (CODE_FOR_zero_extendpsisi2
, to
, from
, UNKNOWN
);
1059 #endif /* HAVE_zero_extendpsisi2 */
1064 if (to_mode
== PDImode
)
1066 if (from_mode
!= DImode
)
1067 from
= convert_to_mode (DImode
, from
, unsignedp
);
1069 #ifdef HAVE_truncdipdi2
1070 if (HAVE_truncdipdi2
)
1072 emit_unop_insn (CODE_FOR_truncdipdi2
, to
, from
, UNKNOWN
);
1075 #endif /* HAVE_truncdipdi2 */
1079 if (from_mode
== PDImode
)
1081 if (to_mode
!= DImode
)
1083 from
= convert_to_mode (DImode
, from
, unsignedp
);
1088 #ifdef HAVE_extendpdidi2
1089 if (HAVE_extendpdidi2
)
1091 emit_unop_insn (CODE_FOR_extendpdidi2
, to
, from
, UNKNOWN
);
1094 #endif /* HAVE_extendpdidi2 */
1099 /* Now follow all the conversions between integers
1100 no more than a word long. */
1102 /* For truncation, usually we can just refer to FROM in a narrower mode. */
1103 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
)
1104 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
1105 GET_MODE_BITSIZE (from_mode
)))
1107 if (!((GET_CODE (from
) == MEM
1108 && ! MEM_VOLATILE_P (from
)
1109 && direct_load
[(int) to_mode
]
1110 && ! mode_dependent_address_p (XEXP (from
, 0)))
1111 || GET_CODE (from
) == REG
1112 || GET_CODE (from
) == SUBREG
))
1113 from
= force_reg (from_mode
, from
);
1114 if (GET_CODE (from
) == REG
&& REGNO (from
) < FIRST_PSEUDO_REGISTER
1115 && ! HARD_REGNO_MODE_OK (REGNO (from
), to_mode
))
1116 from
= copy_to_reg (from
);
1117 emit_move_insn (to
, gen_lowpart (to_mode
, from
));
1121 /* Handle extension. */
1122 if (GET_MODE_BITSIZE (to_mode
) > GET_MODE_BITSIZE (from_mode
))
1124 /* Convert directly if that works. */
1125 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
1126 != CODE_FOR_nothing
)
1129 from
= force_not_mem (from
);
1131 emit_unop_insn (code
, to
, from
, equiv_code
);
1136 enum machine_mode intermediate
;
1140 /* Search for a mode to convert via. */
1141 for (intermediate
= from_mode
; intermediate
!= VOIDmode
;
1142 intermediate
= GET_MODE_WIDER_MODE (intermediate
))
1143 if (((can_extend_p (to_mode
, intermediate
, unsignedp
)
1144 != CODE_FOR_nothing
)
1145 || (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (intermediate
)
1146 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
1147 GET_MODE_BITSIZE (intermediate
))))
1148 && (can_extend_p (intermediate
, from_mode
, unsignedp
)
1149 != CODE_FOR_nothing
))
1151 convert_move (to
, convert_to_mode (intermediate
, from
,
1152 unsignedp
), unsignedp
);
1156 /* No suitable intermediate mode.
1157 Generate what we need with shifts. */
1158 shift_amount
= build_int_2 (GET_MODE_BITSIZE (to_mode
)
1159 - GET_MODE_BITSIZE (from_mode
), 0);
1160 from
= gen_lowpart (to_mode
, force_reg (from_mode
, from
));
1161 tmp
= expand_shift (LSHIFT_EXPR
, to_mode
, from
, shift_amount
,
1163 tmp
= expand_shift (RSHIFT_EXPR
, to_mode
, tmp
, shift_amount
,
1166 emit_move_insn (to
, tmp
);
1171 /* Support special truncate insns for certain modes. */
1173 if (from_mode
== DImode
&& to_mode
== SImode
)
1175 #ifdef HAVE_truncdisi2
1176 if (HAVE_truncdisi2
)
1178 emit_unop_insn (CODE_FOR_truncdisi2
, to
, from
, UNKNOWN
);
1182 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1186 if (from_mode
== DImode
&& to_mode
== HImode
)
1188 #ifdef HAVE_truncdihi2
1189 if (HAVE_truncdihi2
)
1191 emit_unop_insn (CODE_FOR_truncdihi2
, to
, from
, UNKNOWN
);
1195 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1199 if (from_mode
== DImode
&& to_mode
== QImode
)
1201 #ifdef HAVE_truncdiqi2
1202 if (HAVE_truncdiqi2
)
1204 emit_unop_insn (CODE_FOR_truncdiqi2
, to
, from
, UNKNOWN
);
1208 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1212 if (from_mode
== SImode
&& to_mode
== HImode
)
1214 #ifdef HAVE_truncsihi2
1215 if (HAVE_truncsihi2
)
1217 emit_unop_insn (CODE_FOR_truncsihi2
, to
, from
, UNKNOWN
);
1221 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1225 if (from_mode
== SImode
&& to_mode
== QImode
)
1227 #ifdef HAVE_truncsiqi2
1228 if (HAVE_truncsiqi2
)
1230 emit_unop_insn (CODE_FOR_truncsiqi2
, to
, from
, UNKNOWN
);
1234 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1238 if (from_mode
== HImode
&& to_mode
== QImode
)
1240 #ifdef HAVE_trunchiqi2
1241 if (HAVE_trunchiqi2
)
1243 emit_unop_insn (CODE_FOR_trunchiqi2
, to
, from
, UNKNOWN
);
1247 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1251 if (from_mode
== TImode
&& to_mode
== DImode
)
1253 #ifdef HAVE_trunctidi2
1254 if (HAVE_trunctidi2
)
1256 emit_unop_insn (CODE_FOR_trunctidi2
, to
, from
, UNKNOWN
);
1260 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1264 if (from_mode
== TImode
&& to_mode
== SImode
)
1266 #ifdef HAVE_trunctisi2
1267 if (HAVE_trunctisi2
)
1269 emit_unop_insn (CODE_FOR_trunctisi2
, to
, from
, UNKNOWN
);
1273 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1277 if (from_mode
== TImode
&& to_mode
== HImode
)
1279 #ifdef HAVE_trunctihi2
1280 if (HAVE_trunctihi2
)
1282 emit_unop_insn (CODE_FOR_trunctihi2
, to
, from
, UNKNOWN
);
1286 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1290 if (from_mode
== TImode
&& to_mode
== QImode
)
1292 #ifdef HAVE_trunctiqi2
1293 if (HAVE_trunctiqi2
)
1295 emit_unop_insn (CODE_FOR_trunctiqi2
, to
, from
, UNKNOWN
);
1299 convert_move (to
, force_reg (from_mode
, from
), unsignedp
);
1303 /* Handle truncation of volatile memrefs, and so on;
1304 the things that couldn't be truncated directly,
1305 and for which there was no special instruction. */
1306 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
))
1308 rtx temp
= force_reg (to_mode
, gen_lowpart (to_mode
, from
));
1309 emit_move_insn (to
, temp
);
1313 /* Mode combination is not recognized. */
1317 /* Return an rtx for a value that would result
1318 from converting X to mode MODE.
1319 Both X and MODE may be floating, or both integer.
1320 UNSIGNEDP is nonzero if X is an unsigned value.
1321 This can be done by referring to a part of X in place
1322 or by copying to a new temporary with conversion.
1324 This function *must not* call protect_from_queue
1325 except when putting X into an insn (in which case convert_move does it). */
1328 convert_to_mode (mode
, x
, unsignedp
)
1329 enum machine_mode mode
;
1333 return convert_modes (mode
, VOIDmode
, x
, unsignedp
);
1336 /* Return an rtx for a value that would result
1337 from converting X from mode OLDMODE to mode MODE.
1338 Both modes may be floating, or both integer.
1339 UNSIGNEDP is nonzero if X is an unsigned value.
1341 This can be done by referring to a part of X in place
1342 or by copying to a new temporary with conversion.
1344 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode.
1346 This function *must not* call protect_from_queue
1347 except when putting X into an insn (in which case convert_move does it). */
1350 convert_modes (mode
, oldmode
, x
, unsignedp
)
1351 enum machine_mode mode
, oldmode
;
1357 /* If FROM is a SUBREG that indicates that we have already done at least
1358 the required extension, strip it. */
1360 if (GET_CODE (x
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (x
)
1361 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))) >= GET_MODE_SIZE (mode
)
1362 && SUBREG_PROMOTED_UNSIGNED_P (x
) == unsignedp
)
1363 x
= gen_lowpart (mode
, x
);
1365 if (GET_MODE (x
) != VOIDmode
)
1366 oldmode
= GET_MODE (x
);
1368 if (mode
== oldmode
)
1371 /* There is one case that we must handle specially: If we are converting
1372 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
1373 we are to interpret the constant as unsigned, gen_lowpart will do
1374 the wrong if the constant appears negative. What we want to do is
1375 make the high-order word of the constant zero, not all ones. */
1377 if (unsignedp
&& GET_MODE_CLASS (mode
) == MODE_INT
1378 && GET_MODE_BITSIZE (mode
) == 2 * HOST_BITS_PER_WIDE_INT
1379 && GET_CODE (x
) == CONST_INT
&& INTVAL (x
) < 0)
1381 HOST_WIDE_INT val
= INTVAL (x
);
1383 if (oldmode
!= VOIDmode
1384 && HOST_BITS_PER_WIDE_INT
> GET_MODE_BITSIZE (oldmode
))
1386 int width
= GET_MODE_BITSIZE (oldmode
);
1388 /* We need to zero extend VAL. */
1389 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
1392 return immed_double_const (val
, (HOST_WIDE_INT
) 0, mode
);
1395 /* We can do this with a gen_lowpart if both desired and current modes
1396 are integer, and this is either a constant integer, a register, or a
1397 non-volatile MEM. Except for the constant case where MODE is no
1398 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
1400 if ((GET_CODE (x
) == CONST_INT
1401 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
1402 || (GET_MODE_CLASS (mode
) == MODE_INT
1403 && GET_MODE_CLASS (oldmode
) == MODE_INT
1404 && (GET_CODE (x
) == CONST_DOUBLE
1405 || (GET_MODE_SIZE (mode
) <= GET_MODE_SIZE (oldmode
)
1406 && ((GET_CODE (x
) == MEM
&& ! MEM_VOLATILE_P (x
)
1407 && direct_load
[(int) mode
])
1408 || (GET_CODE (x
) == REG
1409 && (! HARD_REGISTER_P (x
)
1410 || HARD_REGNO_MODE_OK (REGNO (x
), mode
))
1411 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode
),
1412 GET_MODE_BITSIZE (GET_MODE (x
)))))))))
1414 /* ?? If we don't know OLDMODE, we have to assume here that
1415 X does not need sign- or zero-extension. This may not be
1416 the case, but it's the best we can do. */
1417 if (GET_CODE (x
) == CONST_INT
&& oldmode
!= VOIDmode
1418 && GET_MODE_SIZE (mode
) > GET_MODE_SIZE (oldmode
))
1420 HOST_WIDE_INT val
= INTVAL (x
);
1421 int width
= GET_MODE_BITSIZE (oldmode
);
1423 /* We must sign or zero-extend in this case. Start by
1424 zero-extending, then sign extend if we need to. */
1425 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
1427 && (val
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1428 val
|= (HOST_WIDE_INT
) (-1) << width
;
1430 return gen_int_mode (val
, mode
);
1433 return gen_lowpart (mode
, x
);
1436 temp
= gen_reg_rtx (mode
);
1437 convert_move (temp
, x
, unsignedp
);
1441 /* This macro is used to determine what the largest unit size that
1442 move_by_pieces can use is. */
1444 /* MOVE_MAX_PIECES is the number of bytes at a time which we can
1445 move efficiently, as opposed to MOVE_MAX which is the maximum
1446 number of bytes we can move with a single instruction. */
1448 #ifndef MOVE_MAX_PIECES
1449 #define MOVE_MAX_PIECES MOVE_MAX
1452 /* STORE_MAX_PIECES is the number of bytes at a time that we can
1453 store efficiently. Due to internal GCC limitations, this is
1454 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
1455 for an immediate constant. */
1457 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
1459 /* Generate several move instructions to copy LEN bytes from block FROM to
1460 block TO. (These are MEM rtx's with BLKmode). The caller must pass FROM
1461 and TO through protect_from_queue before calling.
1463 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
1464 used to push FROM to the stack.
1466 ALIGN is maximum alignment we can assume. */
1469 move_by_pieces (to
, from
, len
, align
)
1471 unsigned HOST_WIDE_INT len
;
1474 struct move_by_pieces data
;
1475 rtx to_addr
, from_addr
= XEXP (from
, 0);
1476 unsigned int max_size
= MOVE_MAX_PIECES
+ 1;
1477 enum machine_mode mode
= VOIDmode
, tmode
;
1478 enum insn_code icode
;
1481 data
.from_addr
= from_addr
;
1484 to_addr
= XEXP (to
, 0);
1487 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
1488 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
1490 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
1497 #ifdef STACK_GROWS_DOWNWARD
1503 data
.to_addr
= to_addr
;
1506 = (GET_CODE (from_addr
) == PRE_INC
|| GET_CODE (from_addr
) == PRE_DEC
1507 || GET_CODE (from_addr
) == POST_INC
1508 || GET_CODE (from_addr
) == POST_DEC
);
1510 data
.explicit_inc_from
= 0;
1511 data
.explicit_inc_to
= 0;
1512 if (data
.reverse
) data
.offset
= len
;
1515 /* If copying requires more than two move insns,
1516 copy addresses to registers (to make displacements shorter)
1517 and use post-increment if available. */
1518 if (!(data
.autinc_from
&& data
.autinc_to
)
1519 && move_by_pieces_ninsns (len
, align
) > 2)
1521 /* Find the mode of the largest move... */
1522 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1523 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1524 if (GET_MODE_SIZE (tmode
) < max_size
)
1527 if (USE_LOAD_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_from
)
1529 data
.from_addr
= copy_addr_to_reg (plus_constant (from_addr
, len
));
1530 data
.autinc_from
= 1;
1531 data
.explicit_inc_from
= -1;
1533 if (USE_LOAD_POST_INCREMENT (mode
) && ! data
.autinc_from
)
1535 data
.from_addr
= copy_addr_to_reg (from_addr
);
1536 data
.autinc_from
= 1;
1537 data
.explicit_inc_from
= 1;
1539 if (!data
.autinc_from
&& CONSTANT_P (from_addr
))
1540 data
.from_addr
= copy_addr_to_reg (from_addr
);
1541 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
1543 data
.to_addr
= copy_addr_to_reg (plus_constant (to_addr
, len
));
1545 data
.explicit_inc_to
= -1;
1547 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
1549 data
.to_addr
= copy_addr_to_reg (to_addr
);
1551 data
.explicit_inc_to
= 1;
1553 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
1554 data
.to_addr
= copy_addr_to_reg (to_addr
);
1557 if (! SLOW_UNALIGNED_ACCESS (word_mode
, align
)
1558 || align
> MOVE_MAX
* BITS_PER_UNIT
|| align
>= BIGGEST_ALIGNMENT
)
1559 align
= MOVE_MAX
* BITS_PER_UNIT
;
1561 /* First move what we can in the largest integer mode, then go to
1562 successively smaller modes. */
1564 while (max_size
> 1)
1566 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1567 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1568 if (GET_MODE_SIZE (tmode
) < max_size
)
1571 if (mode
== VOIDmode
)
1574 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
1575 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1576 move_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
1578 max_size
= GET_MODE_SIZE (mode
);
1581 /* The code above should have handled everything. */
1586 /* Return number of insns required to move L bytes by pieces.
1587 ALIGN (in bits) is maximum alignment we can assume. */
1589 static unsigned HOST_WIDE_INT
1590 move_by_pieces_ninsns (l
, align
)
1591 unsigned HOST_WIDE_INT l
;
1594 unsigned HOST_WIDE_INT n_insns
= 0;
1595 unsigned HOST_WIDE_INT max_size
= MOVE_MAX
+ 1;
1597 if (! SLOW_UNALIGNED_ACCESS (word_mode
, align
)
1598 || align
> MOVE_MAX
* BITS_PER_UNIT
|| align
>= BIGGEST_ALIGNMENT
)
1599 align
= MOVE_MAX
* BITS_PER_UNIT
;
1601 while (max_size
> 1)
1603 enum machine_mode mode
= VOIDmode
, tmode
;
1604 enum insn_code icode
;
1606 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1607 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1608 if (GET_MODE_SIZE (tmode
) < max_size
)
1611 if (mode
== VOIDmode
)
1614 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
1615 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1616 n_insns
+= l
/ GET_MODE_SIZE (mode
), l
%= GET_MODE_SIZE (mode
);
1618 max_size
= GET_MODE_SIZE (mode
);
1626 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1627 with move instructions for mode MODE. GENFUN is the gen_... function
1628 to make a move insn for that mode. DATA has all the other info. */
1631 move_by_pieces_1 (genfun
, mode
, data
)
1632 rtx (*genfun
) PARAMS ((rtx
, ...));
1633 enum machine_mode mode
;
1634 struct move_by_pieces
*data
;
1636 unsigned int size
= GET_MODE_SIZE (mode
);
1637 rtx to1
= NULL_RTX
, from1
;
1639 while (data
->len
>= size
)
1642 data
->offset
-= size
;
1646 if (data
->autinc_to
)
1647 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
1650 to1
= adjust_address (data
->to
, mode
, data
->offset
);
1653 if (data
->autinc_from
)
1654 from1
= adjust_automodify_address (data
->from
, mode
, data
->from_addr
,
1657 from1
= adjust_address (data
->from
, mode
, data
->offset
);
1659 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
1660 emit_insn (gen_add2_insn (data
->to_addr
,
1661 GEN_INT (-(HOST_WIDE_INT
)size
)));
1662 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_from
< 0)
1663 emit_insn (gen_add2_insn (data
->from_addr
,
1664 GEN_INT (-(HOST_WIDE_INT
)size
)));
1667 emit_insn ((*genfun
) (to1
, from1
));
1670 #ifdef PUSH_ROUNDING
1671 emit_single_push_insn (mode
, from1
, NULL
);
1677 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
1678 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
1679 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_from
> 0)
1680 emit_insn (gen_add2_insn (data
->from_addr
, GEN_INT (size
)));
1682 if (! data
->reverse
)
1683 data
->offset
+= size
;
1689 /* Emit code to move a block Y to a block X. This may be done with
1690 string-move instructions, with multiple scalar move instructions,
1691 or with a library call.
1693 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1694 SIZE is an rtx that says how long they are.
1695 ALIGN is the maximum alignment we can assume they have.
1696 METHOD describes what kind of copy this is, and what mechanisms may be used.
1698 Return the address of the new block, if memcpy is called and returns it,
1702 emit_block_move (x
, y
, size
, method
)
1704 enum block_op_methods method
;
1712 case BLOCK_OP_NORMAL
:
1713 may_use_call
= true;
1716 case BLOCK_OP_CALL_PARM
:
1717 may_use_call
= block_move_libcall_safe_for_call_parm ();
1719 /* Make inhibit_defer_pop nonzero around the library call
1720 to force it to pop the arguments right away. */
1724 case BLOCK_OP_NO_LIBCALL
:
1725 may_use_call
= false;
1732 align
= MIN (MEM_ALIGN (x
), MEM_ALIGN (y
));
1734 if (GET_MODE (x
) != BLKmode
)
1736 if (GET_MODE (y
) != BLKmode
)
1739 x
= protect_from_queue (x
, 1);
1740 y
= protect_from_queue (y
, 0);
1741 size
= protect_from_queue (size
, 0);
1743 if (GET_CODE (x
) != MEM
)
1745 if (GET_CODE (y
) != MEM
)
1750 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1751 can be incorrect is coming from __builtin_memcpy. */
1752 if (GET_CODE (size
) == CONST_INT
)
1754 x
= shallow_copy_rtx (x
);
1755 y
= shallow_copy_rtx (y
);
1756 set_mem_size (x
, size
);
1757 set_mem_size (y
, size
);
1760 if (GET_CODE (size
) == CONST_INT
&& MOVE_BY_PIECES_P (INTVAL (size
), align
))
1761 move_by_pieces (x
, y
, INTVAL (size
), align
);
1762 else if (emit_block_move_via_movstr (x
, y
, size
, align
))
1764 else if (may_use_call
)
1765 retval
= emit_block_move_via_libcall (x
, y
, size
);
1767 emit_block_move_via_loop (x
, y
, size
, align
);
1769 if (method
== BLOCK_OP_CALL_PARM
)
1775 /* A subroutine of emit_block_move. Returns true if calling the
1776 block move libcall will not clobber any parameters which may have
1777 already been placed on the stack. */
1780 block_move_libcall_safe_for_call_parm ()
1786 /* Check to see whether memcpy takes all register arguments. */
1788 takes_regs_uninit
, takes_regs_no
, takes_regs_yes
1789 } takes_regs
= takes_regs_uninit
;
1793 case takes_regs_uninit
:
1795 CUMULATIVE_ARGS args_so_far
;
1798 fn
= emit_block_move_libcall_fn (false);
1799 INIT_CUMULATIVE_ARGS (args_so_far
, TREE_TYPE (fn
), NULL_RTX
, 0);
1801 arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1802 for ( ; arg
!= void_list_node
; arg
= TREE_CHAIN (arg
))
1804 enum machine_mode mode
= TYPE_MODE (TREE_VALUE (arg
));
1805 rtx tmp
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
1806 if (!tmp
|| !REG_P (tmp
))
1807 goto fail_takes_regs
;
1808 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1809 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
,
1811 goto fail_takes_regs
;
1813 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, NULL_TREE
, 1);
1816 takes_regs
= takes_regs_yes
;
1819 case takes_regs_yes
:
1823 takes_regs
= takes_regs_no
;
1834 /* A subroutine of emit_block_move. Expand a movstr pattern;
1835 return true if successful. */
1838 emit_block_move_via_movstr (x
, y
, size
, align
)
1842 /* Try the most limited insn first, because there's no point
1843 including more than one in the machine description unless
1844 the more limited one has some advantage. */
1846 rtx opalign
= GEN_INT (align
/ BITS_PER_UNIT
);
1847 enum machine_mode mode
;
1849 /* Since this is a move insn, we don't care about volatility. */
1852 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
1853 mode
= GET_MODE_WIDER_MODE (mode
))
1855 enum insn_code code
= movstr_optab
[(int) mode
];
1856 insn_operand_predicate_fn pred
;
1858 if (code
!= CODE_FOR_nothing
1859 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1860 here because if SIZE is less than the mode mask, as it is
1861 returned by the macro, it will definitely be less than the
1862 actual mode mask. */
1863 && ((GET_CODE (size
) == CONST_INT
1864 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
1865 <= (GET_MODE_MASK (mode
) >> 1)))
1866 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
1867 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
1868 || (*pred
) (x
, BLKmode
))
1869 && ((pred
= insn_data
[(int) code
].operand
[1].predicate
) == 0
1870 || (*pred
) (y
, BLKmode
))
1871 && ((pred
= insn_data
[(int) code
].operand
[3].predicate
) == 0
1872 || (*pred
) (opalign
, VOIDmode
)))
1875 rtx last
= get_last_insn ();
1878 op2
= convert_to_mode (mode
, size
, 1);
1879 pred
= insn_data
[(int) code
].operand
[2].predicate
;
1880 if (pred
!= 0 && ! (*pred
) (op2
, mode
))
1881 op2
= copy_to_mode_reg (mode
, op2
);
1883 /* ??? When called via emit_block_move_for_call, it'd be
1884 nice if there were some way to inform the backend, so
1885 that it doesn't fail the expansion because it thinks
1886 emitting the libcall would be more efficient. */
1888 pat
= GEN_FCN ((int) code
) (x
, y
, op2
, opalign
);
1896 delete_insns_since (last
);
1904 /* A subroutine of emit_block_move. Expand a call to memcpy or bcopy.
1905 Return the return value from memcpy, 0 otherwise. */
1908 emit_block_move_via_libcall (dst
, src
, size
)
1911 tree call_expr
, arg_list
, fn
, src_tree
, dst_tree
, size_tree
;
1912 enum machine_mode size_mode
;
1915 /* DST, SRC, or SIZE may have been passed through protect_from_queue.
1917 It is unsafe to save the value generated by protect_from_queue
1918 and reuse it later. Consider what happens if emit_queue is
1919 called before the return value from protect_from_queue is used.
1921 Expansion of the CALL_EXPR below will call emit_queue before
1922 we are finished emitting RTL for argument setup. So if we are
1923 not careful we could get the wrong value for an argument.
1925 To avoid this problem we go ahead and emit code to copy X, Y &
1926 SIZE into new pseudos. We can then place those new pseudos
1927 into an RTL_EXPR and use them later, even after a call to
1930 Note this is not strictly needed for library calls since they
1931 do not call emit_queue before loading their arguments. However,
1932 we may need to have library calls call emit_queue in the future
1933 since failing to do so could cause problems for targets which
1934 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
1936 dst
= copy_to_mode_reg (Pmode
, XEXP (dst
, 0));
1937 src
= copy_to_mode_reg (Pmode
, XEXP (src
, 0));
1939 if (TARGET_MEM_FUNCTIONS
)
1940 size_mode
= TYPE_MODE (sizetype
);
1942 size_mode
= TYPE_MODE (unsigned_type_node
);
1943 size
= convert_to_mode (size_mode
, size
, 1);
1944 size
= copy_to_mode_reg (size_mode
, size
);
1946 /* It is incorrect to use the libcall calling conventions to call
1947 memcpy in this context. This could be a user call to memcpy and
1948 the user may wish to examine the return value from memcpy. For
1949 targets where libcalls and normal calls have different conventions
1950 for returning pointers, we could end up generating incorrect code.
1952 For convenience, we generate the call to bcopy this way as well. */
1954 dst_tree
= make_tree (ptr_type_node
, dst
);
1955 src_tree
= make_tree (ptr_type_node
, src
);
1956 if (TARGET_MEM_FUNCTIONS
)
1957 size_tree
= make_tree (sizetype
, size
);
1959 size_tree
= make_tree (unsigned_type_node
, size
);
1961 fn
= emit_block_move_libcall_fn (true);
1962 arg_list
= tree_cons (NULL_TREE
, size_tree
, NULL_TREE
);
1963 if (TARGET_MEM_FUNCTIONS
)
1965 arg_list
= tree_cons (NULL_TREE
, src_tree
, arg_list
);
1966 arg_list
= tree_cons (NULL_TREE
, dst_tree
, arg_list
);
1970 arg_list
= tree_cons (NULL_TREE
, dst_tree
, arg_list
);
1971 arg_list
= tree_cons (NULL_TREE
, src_tree
, arg_list
);
1974 /* Now we have to build up the CALL_EXPR itself. */
1975 call_expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
1976 call_expr
= build (CALL_EXPR
, TREE_TYPE (TREE_TYPE (fn
)),
1977 call_expr
, arg_list
, NULL_TREE
);
1978 TREE_SIDE_EFFECTS (call_expr
) = 1;
1980 retval
= expand_expr (call_expr
, NULL_RTX
, VOIDmode
, 0);
1982 /* If we are initializing a readonly value, show the above call
1983 clobbered it. Otherwise, a load from it may erroneously be
1984 hoisted from a loop. */
1985 if (RTX_UNCHANGING_P (dst
))
1986 emit_insn (gen_rtx_CLOBBER (VOIDmode
, dst
));
1988 return (TARGET_MEM_FUNCTIONS
? retval
: NULL_RTX
);
1991 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1992 for the function we use for block copies. The first time FOR_CALL
1993 is true, we call assemble_external. */
1995 static GTY(()) tree block_move_fn
;
1998 init_block_move_fn (asmspec
)
1999 const char *asmspec
;
2005 if (TARGET_MEM_FUNCTIONS
)
2007 fn
= get_identifier ("memcpy");
2008 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
2009 const_ptr_type_node
, sizetype
,
2014 fn
= get_identifier ("bcopy");
2015 args
= build_function_type_list (void_type_node
, const_ptr_type_node
,
2016 ptr_type_node
, unsigned_type_node
,
2020 fn
= build_decl (FUNCTION_DECL
, fn
, args
);
2021 DECL_EXTERNAL (fn
) = 1;
2022 TREE_PUBLIC (fn
) = 1;
2023 DECL_ARTIFICIAL (fn
) = 1;
2024 TREE_NOTHROW (fn
) = 1;
2031 SET_DECL_RTL (block_move_fn
, NULL_RTX
);
2032 SET_DECL_ASSEMBLER_NAME (block_move_fn
, get_identifier (asmspec
));
2037 emit_block_move_libcall_fn (for_call
)
2040 static bool emitted_extern
;
2043 init_block_move_fn (NULL
);
2045 if (for_call
&& !emitted_extern
)
2047 emitted_extern
= true;
2048 make_decl_rtl (block_move_fn
, NULL
);
2049 assemble_external (block_move_fn
);
2052 return block_move_fn
;
2055 /* A subroutine of emit_block_move. Copy the data via an explicit
2056 loop. This is used only when libcalls are forbidden. */
2057 /* ??? It'd be nice to copy in hunks larger than QImode. */
2060 emit_block_move_via_loop (x
, y
, size
, align
)
2062 unsigned int align ATTRIBUTE_UNUSED
;
2064 rtx cmp_label
, top_label
, iter
, x_addr
, y_addr
, tmp
;
2065 enum machine_mode iter_mode
;
2067 iter_mode
= GET_MODE (size
);
2068 if (iter_mode
== VOIDmode
)
2069 iter_mode
= word_mode
;
2071 top_label
= gen_label_rtx ();
2072 cmp_label
= gen_label_rtx ();
2073 iter
= gen_reg_rtx (iter_mode
);
2075 emit_move_insn (iter
, const0_rtx
);
2077 x_addr
= force_operand (XEXP (x
, 0), NULL_RTX
);
2078 y_addr
= force_operand (XEXP (y
, 0), NULL_RTX
);
2079 do_pending_stack_adjust ();
2081 emit_note (NULL
, NOTE_INSN_LOOP_BEG
);
2083 emit_jump (cmp_label
);
2084 emit_label (top_label
);
2086 tmp
= convert_modes (Pmode
, iter_mode
, iter
, true);
2087 x_addr
= gen_rtx_PLUS (Pmode
, x_addr
, tmp
);
2088 y_addr
= gen_rtx_PLUS (Pmode
, y_addr
, tmp
);
2089 x
= change_address (x
, QImode
, x_addr
);
2090 y
= change_address (y
, QImode
, y_addr
);
2092 emit_move_insn (x
, y
);
2094 tmp
= expand_simple_binop (iter_mode
, PLUS
, iter
, const1_rtx
, iter
,
2095 true, OPTAB_LIB_WIDEN
);
2097 emit_move_insn (iter
, tmp
);
2099 emit_note (NULL
, NOTE_INSN_LOOP_CONT
);
2100 emit_label (cmp_label
);
2102 emit_cmp_and_jump_insns (iter
, size
, LT
, NULL_RTX
, iter_mode
,
2105 emit_note (NULL
, NOTE_INSN_LOOP_END
);
2108 /* Copy all or part of a value X into registers starting at REGNO.
2109 The number of registers to be filled is NREGS. */
2112 move_block_to_reg (regno
, x
, nregs
, mode
)
2116 enum machine_mode mode
;
2119 #ifdef HAVE_load_multiple
2127 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
2128 x
= validize_mem (force_const_mem (mode
, x
));
2130 /* See if the machine can do this with a load multiple insn. */
2131 #ifdef HAVE_load_multiple
2132 if (HAVE_load_multiple
)
2134 last
= get_last_insn ();
2135 pat
= gen_load_multiple (gen_rtx_REG (word_mode
, regno
), x
,
2143 delete_insns_since (last
);
2147 for (i
= 0; i
< nregs
; i
++)
2148 emit_move_insn (gen_rtx_REG (word_mode
, regno
+ i
),
2149 operand_subword_force (x
, i
, mode
));
2152 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
2153 The number of registers to be filled is NREGS. SIZE indicates the number
2154 of bytes in the object X. */
2157 move_block_from_reg (regno
, x
, nregs
, size
)
2164 #ifdef HAVE_store_multiple
2168 enum machine_mode mode
;
2173 /* If SIZE is that of a mode no bigger than a word, just use that
2174 mode's store operation. */
2175 if (size
<= UNITS_PER_WORD
2176 && (mode
= mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0)) != BLKmode
)
2178 emit_move_insn (adjust_address (x
, mode
, 0), gen_rtx_REG (mode
, regno
));
2182 /* Blocks smaller than a word on a BYTES_BIG_ENDIAN machine must be aligned
2183 to the left before storing to memory. Note that the previous test
2184 doesn't handle all cases (e.g. SIZE == 3). */
2185 if (size
< UNITS_PER_WORD
&& BYTES_BIG_ENDIAN
)
2187 rtx tem
= operand_subword (x
, 0, 1, BLKmode
);
2193 shift
= expand_shift (LSHIFT_EXPR
, word_mode
,
2194 gen_rtx_REG (word_mode
, regno
),
2195 build_int_2 ((UNITS_PER_WORD
- size
)
2196 * BITS_PER_UNIT
, 0), NULL_RTX
, 0);
2197 emit_move_insn (tem
, shift
);
2201 /* See if the machine can do this with a store multiple insn. */
2202 #ifdef HAVE_store_multiple
2203 if (HAVE_store_multiple
)
2205 last
= get_last_insn ();
2206 pat
= gen_store_multiple (x
, gen_rtx_REG (word_mode
, regno
),
2214 delete_insns_since (last
);
2218 for (i
= 0; i
< nregs
; i
++)
2220 rtx tem
= operand_subword (x
, i
, 1, BLKmode
);
2225 emit_move_insn (tem
, gen_rtx_REG (word_mode
, regno
+ i
));
2229 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
2230 ORIG, where ORIG is a non-consecutive group of registers represented by
2231 a PARALLEL. The clone is identical to the original except in that the
2232 original set of registers is replaced by a new set of pseudo registers.
2233 The new set has the same modes as the original set. */
2236 gen_group_rtx (orig
)
2242 if (GET_CODE (orig
) != PARALLEL
)
2245 length
= XVECLEN (orig
, 0);
2246 tmps
= (rtx
*) alloca (sizeof (rtx
) * length
);
2248 /* Skip a NULL entry in first slot. */
2249 i
= XEXP (XVECEXP (orig
, 0, 0), 0) ? 0 : 1;
2254 for (; i
< length
; i
++)
2256 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (orig
, 0, i
), 0));
2257 rtx offset
= XEXP (XVECEXP (orig
, 0, i
), 1);
2259 tmps
[i
] = gen_rtx_EXPR_LIST (VOIDmode
, gen_reg_rtx (mode
), offset
);
2262 return gen_rtx_PARALLEL (GET_MODE (orig
), gen_rtvec_v (length
, tmps
));
2265 /* Emit code to move a block SRC to a block DST, where DST is non-consecutive
2266 registers represented by a PARALLEL. SSIZE represents the total size of
2267 block SRC in bytes, or -1 if not known. */
2268 /* ??? If SSIZE % UNITS_PER_WORD != 0, we make the blatant assumption that
2269 the balance will be in what would be the low-order memory addresses, i.e.
2270 left justified for big endian, right justified for little endian. This
2271 happens to be true for the targets currently using this support. If this
2272 ever changes, a new target macro along the lines of FUNCTION_ARG_PADDING
2276 emit_group_load (dst
, orig_src
, ssize
)
2283 if (GET_CODE (dst
) != PARALLEL
)
2286 /* Check for a NULL entry, used to indicate that the parameter goes
2287 both on the stack and in registers. */
2288 if (XEXP (XVECEXP (dst
, 0, 0), 0))
2293 tmps
= (rtx
*) alloca (sizeof (rtx
) * XVECLEN (dst
, 0));
2295 /* Process the pieces. */
2296 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
2298 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (dst
, 0, i
), 0));
2299 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (dst
, 0, i
), 1));
2300 unsigned int bytelen
= GET_MODE_SIZE (mode
);
2303 /* Handle trailing fragments that run over the size of the struct. */
2304 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2306 shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2307 bytelen
= ssize
- bytepos
;
2312 /* If we won't be loading directly from memory, protect the real source
2313 from strange tricks we might play; but make sure that the source can
2314 be loaded directly into the destination. */
2316 if (GET_CODE (orig_src
) != MEM
2317 && (!CONSTANT_P (orig_src
)
2318 || (GET_MODE (orig_src
) != mode
2319 && GET_MODE (orig_src
) != VOIDmode
)))
2321 if (GET_MODE (orig_src
) == VOIDmode
)
2322 src
= gen_reg_rtx (mode
);
2324 src
= gen_reg_rtx (GET_MODE (orig_src
));
2326 emit_move_insn (src
, orig_src
);
2329 /* Optimize the access just a bit. */
2330 if (GET_CODE (src
) == MEM
2331 && MEM_ALIGN (src
) >= GET_MODE_ALIGNMENT (mode
)
2332 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2333 && bytelen
== GET_MODE_SIZE (mode
))
2335 tmps
[i
] = gen_reg_rtx (mode
);
2336 emit_move_insn (tmps
[i
], adjust_address (src
, mode
, bytepos
));
2338 else if (GET_CODE (src
) == CONCAT
)
2340 unsigned int slen
= GET_MODE_SIZE (GET_MODE (src
));
2341 unsigned int slen0
= GET_MODE_SIZE (GET_MODE (XEXP (src
, 0)));
2343 if ((bytepos
== 0 && bytelen
== slen0
)
2344 || (bytepos
!= 0 && bytepos
+ bytelen
<= slen
))
2346 /* The following assumes that the concatenated objects all
2347 have the same size. In this case, a simple calculation
2348 can be used to determine the object and the bit field
2350 tmps
[i
] = XEXP (src
, bytepos
/ slen0
);
2351 if (! CONSTANT_P (tmps
[i
])
2352 && (GET_CODE (tmps
[i
]) != REG
|| GET_MODE (tmps
[i
]) != mode
))
2353 tmps
[i
] = extract_bit_field (tmps
[i
], bytelen
* BITS_PER_UNIT
,
2354 (bytepos
% slen0
) * BITS_PER_UNIT
,
2355 1, NULL_RTX
, mode
, mode
, ssize
);
2357 else if (bytepos
== 0)
2359 rtx mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
2360 emit_move_insn (mem
, src
);
2361 tmps
[i
] = adjust_address (mem
, mode
, 0);
2366 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
2367 SIMD register, which is currently broken. While we get GCC
2368 to emit proper RTL for these cases, let's dump to memory. */
2369 else if (VECTOR_MODE_P (GET_MODE (dst
))
2370 && GET_CODE (src
) == REG
)
2372 int slen
= GET_MODE_SIZE (GET_MODE (src
));
2375 mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
2376 emit_move_insn (mem
, src
);
2377 tmps
[i
] = adjust_address (mem
, mode
, (int) bytepos
);
2379 else if (CONSTANT_P (src
)
2380 || (GET_CODE (src
) == REG
&& GET_MODE (src
) == mode
))
2383 tmps
[i
] = extract_bit_field (src
, bytelen
* BITS_PER_UNIT
,
2384 bytepos
* BITS_PER_UNIT
, 1, NULL_RTX
,
2387 if (BYTES_BIG_ENDIAN
&& shift
)
2388 expand_binop (mode
, ashl_optab
, tmps
[i
], GEN_INT (shift
),
2389 tmps
[i
], 0, OPTAB_WIDEN
);
2394 /* Copy the extracted pieces into the proper (probable) hard regs. */
2395 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
2396 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0), tmps
[i
]);
2399 /* Emit code to move a block SRC to block DST, where SRC and DST are
2400 non-consecutive groups of registers, each represented by a PARALLEL. */
2403 emit_group_move (dst
, src
)
2408 if (GET_CODE (src
) != PARALLEL
2409 || GET_CODE (dst
) != PARALLEL
2410 || XVECLEN (src
, 0) != XVECLEN (dst
, 0))
2413 /* Skip first entry if NULL. */
2414 for (i
= XEXP (XVECEXP (src
, 0, 0), 0) ? 0 : 1; i
< XVECLEN (src
, 0); i
++)
2415 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0),
2416 XEXP (XVECEXP (src
, 0, i
), 0));
2419 /* Emit code to move a block SRC to a block DST, where SRC is non-consecutive
2420 registers represented by a PARALLEL. SSIZE represents the total size of
2421 block DST, or -1 if not known. */
2424 emit_group_store (orig_dst
, src
, ssize
)
2431 if (GET_CODE (src
) != PARALLEL
)
2434 /* Check for a NULL entry, used to indicate that the parameter goes
2435 both on the stack and in registers. */
2436 if (XEXP (XVECEXP (src
, 0, 0), 0))
2441 tmps
= (rtx
*) alloca (sizeof (rtx
) * XVECLEN (src
, 0));
2443 /* Copy the (probable) hard regs into pseudos. */
2444 for (i
= start
; i
< XVECLEN (src
, 0); i
++)
2446 rtx reg
= XEXP (XVECEXP (src
, 0, i
), 0);
2447 tmps
[i
] = gen_reg_rtx (GET_MODE (reg
));
2448 emit_move_insn (tmps
[i
], reg
);
2452 /* If we won't be storing directly into memory, protect the real destination
2453 from strange tricks we might play. */
2455 if (GET_CODE (dst
) == PARALLEL
)
2459 /* We can get a PARALLEL dst if there is a conditional expression in
2460 a return statement. In that case, the dst and src are the same,
2461 so no action is necessary. */
2462 if (rtx_equal_p (dst
, src
))
2465 /* It is unclear if we can ever reach here, but we may as well handle
2466 it. Allocate a temporary, and split this into a store/load to/from
2469 temp
= assign_stack_temp (GET_MODE (dst
), ssize
, 0);
2470 emit_group_store (temp
, src
, ssize
);
2471 emit_group_load (dst
, temp
, ssize
);
2474 else if (GET_CODE (dst
) != MEM
&& GET_CODE (dst
) != CONCAT
)
2476 dst
= gen_reg_rtx (GET_MODE (orig_dst
));
2477 /* Make life a bit easier for combine. */
2478 emit_move_insn (dst
, CONST0_RTX (GET_MODE (orig_dst
)));
2481 /* Process the pieces. */
2482 for (i
= start
; i
< XVECLEN (src
, 0); i
++)
2484 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (src
, 0, i
), 1));
2485 enum machine_mode mode
= GET_MODE (tmps
[i
]);
2486 unsigned int bytelen
= GET_MODE_SIZE (mode
);
2489 /* Handle trailing fragments that run over the size of the struct. */
2490 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2492 if (BYTES_BIG_ENDIAN
)
2494 int shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2495 expand_binop (mode
, ashr_optab
, tmps
[i
], GEN_INT (shift
),
2496 tmps
[i
], 0, OPTAB_WIDEN
);
2498 bytelen
= ssize
- bytepos
;
2501 if (GET_CODE (dst
) == CONCAT
)
2503 if (bytepos
+ bytelen
<= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2504 dest
= XEXP (dst
, 0);
2505 else if (bytepos
>= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2507 bytepos
-= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0)));
2508 dest
= XEXP (dst
, 1);
2510 else if (bytepos
== 0 && XVECLEN (src
, 0))
2512 dest
= assign_stack_temp (GET_MODE (dest
),
2513 GET_MODE_SIZE (GET_MODE (dest
)), 0);
2514 emit_move_insn (adjust_address (dest
, GET_MODE (tmps
[i
]), bytepos
),
2523 /* Optimize the access just a bit. */
2524 if (GET_CODE (dest
) == MEM
2525 && MEM_ALIGN (dest
) >= GET_MODE_ALIGNMENT (mode
)
2526 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2527 && bytelen
== GET_MODE_SIZE (mode
))
2528 emit_move_insn (adjust_address (dest
, mode
, bytepos
), tmps
[i
]);
2530 store_bit_field (dest
, bytelen
* BITS_PER_UNIT
, bytepos
* BITS_PER_UNIT
,
2531 mode
, tmps
[i
], ssize
);
2536 /* Copy from the pseudo into the (probable) hard reg. */
2537 if (orig_dst
!= dst
)
2538 emit_move_insn (orig_dst
, dst
);
2541 /* Generate code to copy a BLKmode object of TYPE out of a
2542 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2543 is null, a stack temporary is created. TGTBLK is returned.
2545 The primary purpose of this routine is to handle functions
2546 that return BLKmode structures in registers. Some machines
2547 (the PA for example) want to return all small structures
2548 in registers regardless of the structure's alignment. */
2551 copy_blkmode_from_reg (tgtblk
, srcreg
, type
)
2556 unsigned HOST_WIDE_INT bytes
= int_size_in_bytes (type
);
2557 rtx src
= NULL
, dst
= NULL
;
2558 unsigned HOST_WIDE_INT bitsize
= MIN (TYPE_ALIGN (type
), BITS_PER_WORD
);
2559 unsigned HOST_WIDE_INT bitpos
, xbitpos
, big_endian_correction
= 0;
2563 tgtblk
= assign_temp (build_qualified_type (type
,
2565 | TYPE_QUAL_CONST
)),
2567 preserve_temp_slots (tgtblk
);
2570 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2571 into a new pseudo which is a full word. */
2573 if (GET_MODE (srcreg
) != BLKmode
2574 && GET_MODE_SIZE (GET_MODE (srcreg
)) < UNITS_PER_WORD
)
2575 srcreg
= convert_to_mode (word_mode
, srcreg
, TREE_UNSIGNED (type
));
2577 /* Structures whose size is not a multiple of a word are aligned
2578 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2579 machine, this means we must skip the empty high order bytes when
2580 calculating the bit offset. */
2581 if (BYTES_BIG_ENDIAN
2582 && bytes
% UNITS_PER_WORD
)
2583 big_endian_correction
2584 = (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
) * BITS_PER_UNIT
));
2586 /* Copy the structure BITSIZE bites at a time.
2588 We could probably emit more efficient code for machines which do not use
2589 strict alignment, but it doesn't seem worth the effort at the current
2591 for (bitpos
= 0, xbitpos
= big_endian_correction
;
2592 bitpos
< bytes
* BITS_PER_UNIT
;
2593 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2595 /* We need a new source operand each time xbitpos is on a
2596 word boundary and when xbitpos == big_endian_correction
2597 (the first time through). */
2598 if (xbitpos
% BITS_PER_WORD
== 0
2599 || xbitpos
== big_endian_correction
)
2600 src
= operand_subword_force (srcreg
, xbitpos
/ BITS_PER_WORD
,
2603 /* We need a new destination operand each time bitpos is on
2605 if (bitpos
% BITS_PER_WORD
== 0)
2606 dst
= operand_subword (tgtblk
, bitpos
/ BITS_PER_WORD
, 1, BLKmode
);
2608 /* Use xbitpos for the source extraction (right justified) and
2609 xbitpos for the destination store (left justified). */
2610 store_bit_field (dst
, bitsize
, bitpos
% BITS_PER_WORD
, word_mode
,
2611 extract_bit_field (src
, bitsize
,
2612 xbitpos
% BITS_PER_WORD
, 1,
2613 NULL_RTX
, word_mode
, word_mode
,
2621 /* Add a USE expression for REG to the (possibly empty) list pointed
2622 to by CALL_FUSAGE. REG must denote a hard register. */
2625 use_reg (call_fusage
, reg
)
2626 rtx
*call_fusage
, reg
;
2628 if (GET_CODE (reg
) != REG
2629 || REGNO (reg
) >= FIRST_PSEUDO_REGISTER
)
2633 = gen_rtx_EXPR_LIST (VOIDmode
,
2634 gen_rtx_USE (VOIDmode
, reg
), *call_fusage
);
2637 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2638 starting at REGNO. All of these registers must be hard registers. */
2641 use_regs (call_fusage
, regno
, nregs
)
2648 if (regno
+ nregs
> FIRST_PSEUDO_REGISTER
)
2651 for (i
= 0; i
< nregs
; i
++)
2652 use_reg (call_fusage
, regno_reg_rtx
[regno
+ i
]);
2655 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2656 PARALLEL REGS. This is for calls that pass values in multiple
2657 non-contiguous locations. The Irix 6 ABI has examples of this. */
2660 use_group_regs (call_fusage
, regs
)
2666 for (i
= 0; i
< XVECLEN (regs
, 0); i
++)
2668 rtx reg
= XEXP (XVECEXP (regs
, 0, i
), 0);
2670 /* A NULL entry means the parameter goes both on the stack and in
2671 registers. This can also be a MEM for targets that pass values
2672 partially on the stack and partially in registers. */
2673 if (reg
!= 0 && GET_CODE (reg
) == REG
)
2674 use_reg (call_fusage
, reg
);
2679 /* Determine whether the LEN bytes generated by CONSTFUN can be
2680 stored to memory using several move instructions. CONSTFUNDATA is
2681 a pointer which will be passed as argument in every CONSTFUN call.
2682 ALIGN is maximum alignment we can assume. Return nonzero if a
2683 call to store_by_pieces should succeed. */
2686 can_store_by_pieces (len
, constfun
, constfundata
, align
)
2687 unsigned HOST_WIDE_INT len
;
2688 rtx (*constfun
) PARAMS ((PTR
, HOST_WIDE_INT
, enum machine_mode
));
2692 unsigned HOST_WIDE_INT max_size
, l
;
2693 HOST_WIDE_INT offset
= 0;
2694 enum machine_mode mode
, tmode
;
2695 enum insn_code icode
;
2699 if (! STORE_BY_PIECES_P (len
, align
))
2702 if (! SLOW_UNALIGNED_ACCESS (word_mode
, align
)
2703 || align
> MOVE_MAX
* BITS_PER_UNIT
|| align
>= BIGGEST_ALIGNMENT
)
2704 align
= MOVE_MAX
* BITS_PER_UNIT
;
2706 /* We would first store what we can in the largest integer mode, then go to
2707 successively smaller modes. */
2710 reverse
<= (HAVE_PRE_DECREMENT
|| HAVE_POST_DECREMENT
);
2715 max_size
= STORE_MAX_PIECES
+ 1;
2716 while (max_size
> 1)
2718 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2719 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2720 if (GET_MODE_SIZE (tmode
) < max_size
)
2723 if (mode
== VOIDmode
)
2726 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
2727 if (icode
!= CODE_FOR_nothing
2728 && align
>= GET_MODE_ALIGNMENT (mode
))
2730 unsigned int size
= GET_MODE_SIZE (mode
);
2737 cst
= (*constfun
) (constfundata
, offset
, mode
);
2738 if (!LEGITIMATE_CONSTANT_P (cst
))
2748 max_size
= GET_MODE_SIZE (mode
);
2751 /* The code above should have handled everything. */
2759 /* Generate several move instructions to store LEN bytes generated by
2760 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2761 pointer which will be passed as argument in every CONSTFUN call.
2762 ALIGN is maximum alignment we can assume. */
2765 store_by_pieces (to
, len
, constfun
, constfundata
, align
)
2767 unsigned HOST_WIDE_INT len
;
2768 rtx (*constfun
) PARAMS ((PTR
, HOST_WIDE_INT
, enum machine_mode
));
2772 struct store_by_pieces data
;
2774 if (! STORE_BY_PIECES_P (len
, align
))
2776 to
= protect_from_queue (to
, 1);
2777 data
.constfun
= constfun
;
2778 data
.constfundata
= constfundata
;
2781 store_by_pieces_1 (&data
, align
);
2784 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2785 rtx with BLKmode). The caller must pass TO through protect_from_queue
2786 before calling. ALIGN is maximum alignment we can assume. */
2789 clear_by_pieces (to
, len
, align
)
2791 unsigned HOST_WIDE_INT len
;
2794 struct store_by_pieces data
;
2796 data
.constfun
= clear_by_pieces_1
;
2797 data
.constfundata
= NULL
;
2800 store_by_pieces_1 (&data
, align
);
2803 /* Callback routine for clear_by_pieces.
2804 Return const0_rtx unconditionally. */
2807 clear_by_pieces_1 (data
, offset
, mode
)
2808 PTR data ATTRIBUTE_UNUSED
;
2809 HOST_WIDE_INT offset ATTRIBUTE_UNUSED
;
2810 enum machine_mode mode ATTRIBUTE_UNUSED
;
2815 /* Subroutine of clear_by_pieces and store_by_pieces.
2816 Generate several move instructions to store LEN bytes of block TO. (A MEM
2817 rtx with BLKmode). The caller must pass TO through protect_from_queue
2818 before calling. ALIGN is maximum alignment we can assume. */
2821 store_by_pieces_1 (data
, align
)
2822 struct store_by_pieces
*data
;
2825 rtx to_addr
= XEXP (data
->to
, 0);
2826 unsigned HOST_WIDE_INT max_size
= STORE_MAX_PIECES
+ 1;
2827 enum machine_mode mode
= VOIDmode
, tmode
;
2828 enum insn_code icode
;
2831 data
->to_addr
= to_addr
;
2833 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
2834 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
2836 data
->explicit_inc_to
= 0;
2838 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
2840 data
->offset
= data
->len
;
2842 /* If storing requires more than two move insns,
2843 copy addresses to registers (to make displacements shorter)
2844 and use post-increment if available. */
2845 if (!data
->autinc_to
2846 && move_by_pieces_ninsns (data
->len
, align
) > 2)
2848 /* Determine the main mode we'll be using. */
2849 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2850 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2851 if (GET_MODE_SIZE (tmode
) < max_size
)
2854 if (USE_STORE_PRE_DECREMENT (mode
) && data
->reverse
&& ! data
->autinc_to
)
2856 data
->to_addr
= copy_addr_to_reg (plus_constant (to_addr
, data
->len
));
2857 data
->autinc_to
= 1;
2858 data
->explicit_inc_to
= -1;
2861 if (USE_STORE_POST_INCREMENT (mode
) && ! data
->reverse
2862 && ! data
->autinc_to
)
2864 data
->to_addr
= copy_addr_to_reg (to_addr
);
2865 data
->autinc_to
= 1;
2866 data
->explicit_inc_to
= 1;
2869 if ( !data
->autinc_to
&& CONSTANT_P (to_addr
))
2870 data
->to_addr
= copy_addr_to_reg (to_addr
);
2873 if (! SLOW_UNALIGNED_ACCESS (word_mode
, align
)
2874 || align
> MOVE_MAX
* BITS_PER_UNIT
|| align
>= BIGGEST_ALIGNMENT
)
2875 align
= MOVE_MAX
* BITS_PER_UNIT
;
2877 /* First store what we can in the largest integer mode, then go to
2878 successively smaller modes. */
2880 while (max_size
> 1)
2882 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2883 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2884 if (GET_MODE_SIZE (tmode
) < max_size
)
2887 if (mode
== VOIDmode
)
2890 icode
= mov_optab
->handlers
[(int) mode
].insn_code
;
2891 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
2892 store_by_pieces_2 (GEN_FCN (icode
), mode
, data
);
2894 max_size
= GET_MODE_SIZE (mode
);
2897 /* The code above should have handled everything. */
2902 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2903 with move instructions for mode MODE. GENFUN is the gen_... function
2904 to make a move insn for that mode. DATA has all the other info. */
2907 store_by_pieces_2 (genfun
, mode
, data
)
2908 rtx (*genfun
) PARAMS ((rtx
, ...));
2909 enum machine_mode mode
;
2910 struct store_by_pieces
*data
;
2912 unsigned int size
= GET_MODE_SIZE (mode
);
2915 while (data
->len
>= size
)
2918 data
->offset
-= size
;
2920 if (data
->autinc_to
)
2921 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
2924 to1
= adjust_address (data
->to
, mode
, data
->offset
);
2926 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
2927 emit_insn (gen_add2_insn (data
->to_addr
,
2928 GEN_INT (-(HOST_WIDE_INT
) size
)));
2930 cst
= (*data
->constfun
) (data
->constfundata
, data
->offset
, mode
);
2931 emit_insn ((*genfun
) (to1
, cst
));
2933 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
2934 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
2936 if (! data
->reverse
)
2937 data
->offset
+= size
;
2943 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2944 its length in bytes. */
2947 clear_storage (object
, size
)
2952 unsigned int align
= (GET_CODE (object
) == MEM
? MEM_ALIGN (object
)
2953 : GET_MODE_ALIGNMENT (GET_MODE (object
)));
2955 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2956 just move a zero. Otherwise, do this a piece at a time. */
2957 if (GET_MODE (object
) != BLKmode
2958 && GET_CODE (size
) == CONST_INT
2959 && INTVAL (size
) == (HOST_WIDE_INT
) GET_MODE_SIZE (GET_MODE (object
)))
2960 emit_move_insn (object
, CONST0_RTX (GET_MODE (object
)));
2963 object
= protect_from_queue (object
, 1);
2964 size
= protect_from_queue (size
, 0);
2966 if (GET_CODE (size
) == CONST_INT
2967 && CLEAR_BY_PIECES_P (INTVAL (size
), align
))
2968 clear_by_pieces (object
, INTVAL (size
), align
);
2969 else if (clear_storage_via_clrstr (object
, size
, align
))
2972 retval
= clear_storage_via_libcall (object
, size
);
2978 /* A subroutine of clear_storage. Expand a clrstr pattern;
2979 return true if successful. */
2982 clear_storage_via_clrstr (object
, size
, align
)
2986 /* Try the most limited insn first, because there's no point
2987 including more than one in the machine description unless
2988 the more limited one has some advantage. */
2990 rtx opalign
= GEN_INT (align
/ BITS_PER_UNIT
);
2991 enum machine_mode mode
;
2993 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
2994 mode
= GET_MODE_WIDER_MODE (mode
))
2996 enum insn_code code
= clrstr_optab
[(int) mode
];
2997 insn_operand_predicate_fn pred
;
2999 if (code
!= CODE_FOR_nothing
3000 /* We don't need MODE to be narrower than
3001 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
3002 the mode mask, as it is returned by the macro, it will
3003 definitely be less than the actual mode mask. */
3004 && ((GET_CODE (size
) == CONST_INT
3005 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
3006 <= (GET_MODE_MASK (mode
) >> 1)))
3007 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
3008 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
3009 || (*pred
) (object
, BLKmode
))
3010 && ((pred
= insn_data
[(int) code
].operand
[2].predicate
) == 0
3011 || (*pred
) (opalign
, VOIDmode
)))
3014 rtx last
= get_last_insn ();
3017 op1
= convert_to_mode (mode
, size
, 1);
3018 pred
= insn_data
[(int) code
].operand
[1].predicate
;
3019 if (pred
!= 0 && ! (*pred
) (op1
, mode
))
3020 op1
= copy_to_mode_reg (mode
, op1
);
3022 pat
= GEN_FCN ((int) code
) (object
, op1
, opalign
);
3029 delete_insns_since (last
);
3036 /* A subroutine of clear_storage. Expand a call to memset or bzero.
3037 Return the return value of memset, 0 otherwise. */
3040 clear_storage_via_libcall (object
, size
)
3043 tree call_expr
, arg_list
, fn
, object_tree
, size_tree
;
3044 enum machine_mode size_mode
;
3047 /* OBJECT or SIZE may have been passed through protect_from_queue.
3049 It is unsafe to save the value generated by protect_from_queue
3050 and reuse it later. Consider what happens if emit_queue is
3051 called before the return value from protect_from_queue is used.
3053 Expansion of the CALL_EXPR below will call emit_queue before
3054 we are finished emitting RTL for argument setup. So if we are
3055 not careful we could get the wrong value for an argument.
3057 To avoid this problem we go ahead and emit code to copy OBJECT
3058 and SIZE into new pseudos. We can then place those new pseudos
3059 into an RTL_EXPR and use them later, even after a call to
3062 Note this is not strictly needed for library calls since they
3063 do not call emit_queue before loading their arguments. However,
3064 we may need to have library calls call emit_queue in the future
3065 since failing to do so could cause problems for targets which
3066 define SMALL_REGISTER_CLASSES and pass arguments in registers. */
3068 object
= copy_to_mode_reg (Pmode
, XEXP (object
, 0));
3070 if (TARGET_MEM_FUNCTIONS
)
3071 size_mode
= TYPE_MODE (sizetype
);
3073 size_mode
= TYPE_MODE (unsigned_type_node
);
3074 size
= convert_to_mode (size_mode
, size
, 1);
3075 size
= copy_to_mode_reg (size_mode
, size
);
3077 /* It is incorrect to use the libcall calling conventions to call
3078 memset in this context. This could be a user call to memset and
3079 the user may wish to examine the return value from memset. For
3080 targets where libcalls and normal calls have different conventions
3081 for returning pointers, we could end up generating incorrect code.
3083 For convenience, we generate the call to bzero this way as well. */
3085 object_tree
= make_tree (ptr_type_node
, object
);
3086 if (TARGET_MEM_FUNCTIONS
)
3087 size_tree
= make_tree (sizetype
, size
);
3089 size_tree
= make_tree (unsigned_type_node
, size
);
3091 fn
= clear_storage_libcall_fn (true);
3092 arg_list
= tree_cons (NULL_TREE
, size_tree
, NULL_TREE
);
3093 if (TARGET_MEM_FUNCTIONS
)
3094 arg_list
= tree_cons (NULL_TREE
, integer_zero_node
, arg_list
);
3095 arg_list
= tree_cons (NULL_TREE
, object_tree
, arg_list
);
3097 /* Now we have to build up the CALL_EXPR itself. */
3098 call_expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (fn
)), fn
);
3099 call_expr
= build (CALL_EXPR
, TREE_TYPE (TREE_TYPE (fn
)),
3100 call_expr
, arg_list
, NULL_TREE
);
3101 TREE_SIDE_EFFECTS (call_expr
) = 1;
3103 retval
= expand_expr (call_expr
, NULL_RTX
, VOIDmode
, 0);
3105 /* If we are initializing a readonly value, show the above call
3106 clobbered it. Otherwise, a load from it may erroneously be
3107 hoisted from a loop. */
3108 if (RTX_UNCHANGING_P (object
))
3109 emit_insn (gen_rtx_CLOBBER (VOIDmode
, object
));
3111 return (TARGET_MEM_FUNCTIONS
? retval
: NULL_RTX
);
3114 /* A subroutine of clear_storage_via_libcall. Create the tree node
3115 for the function we use for block clears. The first time FOR_CALL
3116 is true, we call assemble_external. */
3118 static GTY(()) tree block_clear_fn
;
3121 init_block_clear_fn (asmspec
)
3122 const char *asmspec
;
3124 if (!block_clear_fn
)
3128 if (TARGET_MEM_FUNCTIONS
)
3130 fn
= get_identifier ("memset");
3131 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
3132 integer_type_node
, sizetype
,
3137 fn
= get_identifier ("bzero");
3138 args
= build_function_type_list (void_type_node
, ptr_type_node
,
3139 unsigned_type_node
, NULL_TREE
);
3142 fn
= build_decl (FUNCTION_DECL
, fn
, args
);
3143 DECL_EXTERNAL (fn
) = 1;
3144 TREE_PUBLIC (fn
) = 1;
3145 DECL_ARTIFICIAL (fn
) = 1;
3146 TREE_NOTHROW (fn
) = 1;
3148 block_clear_fn
= fn
;
3153 SET_DECL_RTL (block_clear_fn
, NULL_RTX
);
3154 SET_DECL_ASSEMBLER_NAME (block_clear_fn
, get_identifier (asmspec
));
3159 clear_storage_libcall_fn (for_call
)
3162 static bool emitted_extern
;
3164 if (!block_clear_fn
)
3165 init_block_clear_fn (NULL
);
3167 if (for_call
&& !emitted_extern
)
3169 emitted_extern
= true;
3170 make_decl_rtl (block_clear_fn
, NULL
);
3171 assemble_external (block_clear_fn
);
3174 return block_clear_fn
;
3177 /* Generate code to copy Y into X.
3178 Both Y and X must have the same mode, except that
3179 Y can be a constant with VOIDmode.
3180 This mode cannot be BLKmode; use emit_block_move for that.
3182 Return the last instruction emitted. */
3185 emit_move_insn (x
, y
)
3188 enum machine_mode mode
= GET_MODE (x
);
3189 rtx y_cst
= NULL_RTX
;
3192 x
= protect_from_queue (x
, 1);
3193 y
= protect_from_queue (y
, 0);
3195 if (mode
== BLKmode
|| (GET_MODE (y
) != mode
&& GET_MODE (y
) != VOIDmode
))
3198 /* Never force constant_p_rtx to memory. */
3199 if (GET_CODE (y
) == CONSTANT_P_RTX
)
3201 else if (CONSTANT_P (y
))
3204 && SCALAR_FLOAT_MODE_P (GET_MODE (x
))
3205 && (last_insn
= compress_float_constant (x
, y
)))
3208 if (!LEGITIMATE_CONSTANT_P (y
))
3211 y
= force_const_mem (mode
, y
);
3213 /* If the target's cannot_force_const_mem prevented the spill,
3214 assume that the target's move expanders will also take care
3215 of the non-legitimate constant. */
3221 /* If X or Y are memory references, verify that their addresses are valid
3223 if (GET_CODE (x
) == MEM
3224 && ((! memory_address_p (GET_MODE (x
), XEXP (x
, 0))
3225 && ! push_operand (x
, GET_MODE (x
)))
3227 && CONSTANT_ADDRESS_P (XEXP (x
, 0)))))
3228 x
= validize_mem (x
);
3230 if (GET_CODE (y
) == MEM
3231 && (! memory_address_p (GET_MODE (y
), XEXP (y
, 0))
3233 && CONSTANT_ADDRESS_P (XEXP (y
, 0)))))
3234 y
= validize_mem (y
);
3236 if (mode
== BLKmode
)
3239 last_insn
= emit_move_insn_1 (x
, y
);
3241 if (y_cst
&& GET_CODE (x
) == REG
)
3242 set_unique_reg_note (last_insn
, REG_EQUAL
, y_cst
);
3247 /* Low level part of emit_move_insn.
3248 Called just like emit_move_insn, but assumes X and Y
3249 are basically valid. */
3252 emit_move_insn_1 (x
, y
)
3255 enum machine_mode mode
= GET_MODE (x
);
3256 enum machine_mode submode
;
3257 enum mode_class
class = GET_MODE_CLASS (mode
);
3259 if ((unsigned int) mode
>= (unsigned int) MAX_MACHINE_MODE
)
3262 if (mov_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
3264 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) mode
].insn_code
) (x
, y
));
3266 /* Expand complex moves by moving real part and imag part, if possible. */
3267 else if ((class == MODE_COMPLEX_FLOAT
|| class == MODE_COMPLEX_INT
)
3268 && BLKmode
!= (submode
= GET_MODE_INNER (mode
))
3269 && (mov_optab
->handlers
[(int) submode
].insn_code
3270 != CODE_FOR_nothing
))
3272 /* Don't split destination if it is a stack push. */
3273 int stack
= push_operand (x
, GET_MODE (x
));
3275 #ifdef PUSH_ROUNDING
3276 /* In case we output to the stack, but the size is smaller machine can
3277 push exactly, we need to use move instructions. */
3279 && (PUSH_ROUNDING (GET_MODE_SIZE (submode
))
3280 != GET_MODE_SIZE (submode
)))
3283 HOST_WIDE_INT offset1
, offset2
;
3285 /* Do not use anti_adjust_stack, since we don't want to update
3286 stack_pointer_delta. */
3287 temp
= expand_binop (Pmode
,
3288 #ifdef STACK_GROWS_DOWNWARD
3296 (GET_MODE_SIZE (GET_MODE (x
)))),
3297 stack_pointer_rtx
, 0, OPTAB_LIB_WIDEN
);
3299 if (temp
!= stack_pointer_rtx
)
3300 emit_move_insn (stack_pointer_rtx
, temp
);
3302 #ifdef STACK_GROWS_DOWNWARD
3304 offset2
= GET_MODE_SIZE (submode
);
3306 offset1
= -PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x
)));
3307 offset2
= (-PUSH_ROUNDING (GET_MODE_SIZE (GET_MODE (x
)))
3308 + GET_MODE_SIZE (submode
));
3311 emit_move_insn (change_address (x
, submode
,
3312 gen_rtx_PLUS (Pmode
,
3314 GEN_INT (offset1
))),
3315 gen_realpart (submode
, y
));
3316 emit_move_insn (change_address (x
, submode
,
3317 gen_rtx_PLUS (Pmode
,
3319 GEN_INT (offset2
))),
3320 gen_imagpart (submode
, y
));
3324 /* If this is a stack, push the highpart first, so it
3325 will be in the argument order.
3327 In that case, change_address is used only to convert
3328 the mode, not to change the address. */
3331 /* Note that the real part always precedes the imag part in memory
3332 regardless of machine's endianness. */
3333 #ifdef STACK_GROWS_DOWNWARD
3334 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3335 (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3336 gen_imagpart (submode
, y
)));
3337 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3338 (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3339 gen_realpart (submode
, y
)));
3341 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3342 (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3343 gen_realpart (submode
, y
)));
3344 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3345 (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3346 gen_imagpart (submode
, y
)));
3351 rtx realpart_x
, realpart_y
;
3352 rtx imagpart_x
, imagpart_y
;
3354 /* If this is a complex value with each part being smaller than a
3355 word, the usual calling sequence will likely pack the pieces into
3356 a single register. Unfortunately, SUBREG of hard registers only
3357 deals in terms of words, so we have a problem converting input
3358 arguments to the CONCAT of two registers that is used elsewhere
3359 for complex values. If this is before reload, we can copy it into
3360 memory and reload. FIXME, we should see about using extract and
3361 insert on integer registers, but complex short and complex char
3362 variables should be rarely used. */
3363 if (GET_MODE_BITSIZE (mode
) < 2 * BITS_PER_WORD
3364 && (reload_in_progress
| reload_completed
) == 0)
3367 = (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
);
3369 = (REG_P (y
) && REGNO (y
) < FIRST_PSEUDO_REGISTER
);
3371 if (packed_dest_p
|| packed_src_p
)
3373 enum mode_class reg_class
= ((class == MODE_COMPLEX_FLOAT
)
3374 ? MODE_FLOAT
: MODE_INT
);
3376 enum machine_mode reg_mode
3377 = mode_for_size (GET_MODE_BITSIZE (mode
), reg_class
, 1);
3379 if (reg_mode
!= BLKmode
)
3381 rtx mem
= assign_stack_temp (reg_mode
,
3382 GET_MODE_SIZE (mode
), 0);
3383 rtx cmem
= adjust_address (mem
, mode
, 0);
3386 = N_("function using short complex types cannot be inline");
3390 rtx sreg
= gen_rtx_SUBREG (reg_mode
, x
, 0);
3392 emit_move_insn_1 (cmem
, y
);
3393 return emit_move_insn_1 (sreg
, mem
);
3397 rtx sreg
= gen_rtx_SUBREG (reg_mode
, y
, 0);
3399 emit_move_insn_1 (mem
, sreg
);
3400 return emit_move_insn_1 (x
, cmem
);
3406 realpart_x
= gen_realpart (submode
, x
);
3407 realpart_y
= gen_realpart (submode
, y
);
3408 imagpart_x
= gen_imagpart (submode
, x
);
3409 imagpart_y
= gen_imagpart (submode
, y
);
3411 /* Show the output dies here. This is necessary for SUBREGs
3412 of pseudos since we cannot track their lifetimes correctly;
3413 hard regs shouldn't appear here except as return values.
3414 We never want to emit such a clobber after reload. */
3416 && ! (reload_in_progress
|| reload_completed
)
3417 && (GET_CODE (realpart_x
) == SUBREG
3418 || GET_CODE (imagpart_x
) == SUBREG
))
3419 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
3421 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3422 (realpart_x
, realpart_y
));
3423 emit_insn (GEN_FCN (mov_optab
->handlers
[(int) submode
].insn_code
)
3424 (imagpart_x
, imagpart_y
));
3427 return get_last_insn ();
3430 /* Handle MODE_CC modes: If we don't have a special move insn for this mode,
3431 find a mode to do it in. If we have a movcc, use it. Otherwise,
3432 find the MODE_INT mode of the same width. */
3433 else if (GET_MODE_CLASS (mode
) == MODE_CC
3434 && mov_optab
->handlers
[(int) mode
].insn_code
== CODE_FOR_nothing
)
3436 enum insn_code insn_code
;
3437 enum machine_mode tmode
= VOIDmode
;
3441 && mov_optab
->handlers
[(int) CCmode
].insn_code
!= CODE_FOR_nothing
)
3444 for (tmode
= QImode
; tmode
!= VOIDmode
;
3445 tmode
= GET_MODE_WIDER_MODE (tmode
))
3446 if (GET_MODE_SIZE (tmode
) == GET_MODE_SIZE (mode
))
3449 if (tmode
== VOIDmode
)
3452 /* Get X and Y in TMODE. We can't use gen_lowpart here because it
3453 may call change_address which is not appropriate if we were
3454 called when a reload was in progress. We don't have to worry
3455 about changing the address since the size in bytes is supposed to
3456 be the same. Copy the MEM to change the mode and move any
3457 substitutions from the old MEM to the new one. */
3459 if (reload_in_progress
)
3461 x
= gen_lowpart_common (tmode
, x1
);
3462 if (x
== 0 && GET_CODE (x1
) == MEM
)
3464 x
= adjust_address_nv (x1
, tmode
, 0);
3465 copy_replacements (x1
, x
);
3468 y
= gen_lowpart_common (tmode
, y1
);
3469 if (y
== 0 && GET_CODE (y1
) == MEM
)
3471 y
= adjust_address_nv (y1
, tmode
, 0);
3472 copy_replacements (y1
, y
);
3477 x
= gen_lowpart (tmode
, x
);
3478 y
= gen_lowpart (tmode
, y
);
3481 insn_code
= mov_optab
->handlers
[(int) tmode
].insn_code
;
3482 return emit_insn (GEN_FCN (insn_code
) (x
, y
));
3485 /* This will handle any multi-word or full-word mode that lacks a move_insn
3486 pattern. However, you will get better code if you define such patterns,
3487 even if they must turn into multiple assembler instructions. */
3488 else if (GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
)
3495 #ifdef PUSH_ROUNDING
3497 /* If X is a push on the stack, do the push now and replace
3498 X with a reference to the stack pointer. */
3499 if (push_operand (x
, GET_MODE (x
)))
3504 /* Do not use anti_adjust_stack, since we don't want to update
3505 stack_pointer_delta. */
3506 temp
= expand_binop (Pmode
,
3507 #ifdef STACK_GROWS_DOWNWARD
3515 (GET_MODE_SIZE (GET_MODE (x
)))),
3516 stack_pointer_rtx
, 0, OPTAB_LIB_WIDEN
);
3518 if (temp
!= stack_pointer_rtx
)
3519 emit_move_insn (stack_pointer_rtx
, temp
);
3521 code
= GET_CODE (XEXP (x
, 0));
3523 /* Just hope that small offsets off SP are OK. */
3524 if (code
== POST_INC
)
3525 temp
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3526 GEN_INT (-((HOST_WIDE_INT
)
3527 GET_MODE_SIZE (GET_MODE (x
)))));
3528 else if (code
== POST_DEC
)
3529 temp
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3530 GEN_INT (GET_MODE_SIZE (GET_MODE (x
))));
3532 temp
= stack_pointer_rtx
;
3534 x
= change_address (x
, VOIDmode
, temp
);
3538 /* If we are in reload, see if either operand is a MEM whose address
3539 is scheduled for replacement. */
3540 if (reload_in_progress
&& GET_CODE (x
) == MEM
3541 && (inner
= find_replacement (&XEXP (x
, 0))) != XEXP (x
, 0))
3542 x
= replace_equiv_address_nv (x
, inner
);
3543 if (reload_in_progress
&& GET_CODE (y
) == MEM
3544 && (inner
= find_replacement (&XEXP (y
, 0))) != XEXP (y
, 0))
3545 y
= replace_equiv_address_nv (y
, inner
);
3551 i
< (GET_MODE_SIZE (mode
) + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
3554 rtx xpart
= operand_subword (x
, i
, 1, mode
);
3555 rtx ypart
= operand_subword (y
, i
, 1, mode
);
3557 /* If we can't get a part of Y, put Y into memory if it is a
3558 constant. Otherwise, force it into a register. If we still
3559 can't get a part of Y, abort. */
3560 if (ypart
== 0 && CONSTANT_P (y
))
3562 y
= force_const_mem (mode
, y
);
3563 ypart
= operand_subword (y
, i
, 1, mode
);
3565 else if (ypart
== 0)
3566 ypart
= operand_subword_force (y
, i
, mode
);
3568 if (xpart
== 0 || ypart
== 0)
3571 need_clobber
|= (GET_CODE (xpart
) == SUBREG
);
3573 last_insn
= emit_move_insn (xpart
, ypart
);
3579 /* Show the output dies here. This is necessary for SUBREGs
3580 of pseudos since we cannot track their lifetimes correctly;
3581 hard regs shouldn't appear here except as return values.
3582 We never want to emit such a clobber after reload. */
3584 && ! (reload_in_progress
|| reload_completed
)
3585 && need_clobber
!= 0)
3586 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
3596 /* If Y is representable exactly in a narrower mode, and the target can
3597 perform the extension directly from constant or memory, then emit the
3598 move as an extension. */
3601 compress_float_constant (x
, y
)
3604 enum machine_mode dstmode
= GET_MODE (x
);
3605 enum machine_mode orig_srcmode
= GET_MODE (y
);
3606 enum machine_mode srcmode
;
3609 REAL_VALUE_FROM_CONST_DOUBLE (r
, y
);
3611 for (srcmode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode
));
3612 srcmode
!= orig_srcmode
;
3613 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
3616 rtx trunc_y
, last_insn
;
3618 /* Skip if the target can't extend this way. */
3619 ic
= can_extend_p (dstmode
, srcmode
, 0);
3620 if (ic
== CODE_FOR_nothing
)
3623 /* Skip if the narrowed value isn't exact. */
3624 if (! exact_real_truncate (srcmode
, &r
))
3627 trunc_y
= CONST_DOUBLE_FROM_REAL_VALUE (r
, srcmode
);
3629 if (LEGITIMATE_CONSTANT_P (trunc_y
))
3631 /* Skip if the target needs extra instructions to perform
3633 if (! (*insn_data
[ic
].operand
[1].predicate
) (trunc_y
, srcmode
))
3636 else if (float_extend_from_mem
[dstmode
][srcmode
])
3637 trunc_y
= validize_mem (force_const_mem (srcmode
, trunc_y
));
3641 emit_unop_insn (ic
, x
, trunc_y
, UNKNOWN
);
3642 last_insn
= get_last_insn ();
3644 if (GET_CODE (x
) == REG
)
3645 REG_NOTES (last_insn
)
3646 = gen_rtx_EXPR_LIST (REG_EQUAL
, y
, REG_NOTES (last_insn
));
3654 /* Pushing data onto the stack. */
3656 /* Push a block of length SIZE (perhaps variable)
3657 and return an rtx to address the beginning of the block.
3658 Note that it is not possible for the value returned to be a QUEUED.
3659 The value may be virtual_outgoing_args_rtx.
3661 EXTRA is the number of bytes of padding to push in addition to SIZE.
3662 BELOW nonzero means this padding comes at low addresses;
3663 otherwise, the padding comes at high addresses. */
3666 push_block (size
, extra
, below
)
3672 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
3673 if (CONSTANT_P (size
))
3674 anti_adjust_stack (plus_constant (size
, extra
));
3675 else if (GET_CODE (size
) == REG
&& extra
== 0)
3676 anti_adjust_stack (size
);
3679 temp
= copy_to_mode_reg (Pmode
, size
);
3681 temp
= expand_binop (Pmode
, add_optab
, temp
, GEN_INT (extra
),
3682 temp
, 0, OPTAB_LIB_WIDEN
);
3683 anti_adjust_stack (temp
);
3686 #ifndef STACK_GROWS_DOWNWARD
3692 temp
= virtual_outgoing_args_rtx
;
3693 if (extra
!= 0 && below
)
3694 temp
= plus_constant (temp
, extra
);
3698 if (GET_CODE (size
) == CONST_INT
)
3699 temp
= plus_constant (virtual_outgoing_args_rtx
,
3700 -INTVAL (size
) - (below
? 0 : extra
));
3701 else if (extra
!= 0 && !below
)
3702 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3703 negate_rtx (Pmode
, plus_constant (size
, extra
)));
3705 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3706 negate_rtx (Pmode
, size
));
3709 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT
), temp
);
3712 #ifdef PUSH_ROUNDING
3714 /* Emit single push insn. */
3717 emit_single_push_insn (mode
, x
, type
)
3719 enum machine_mode mode
;
3723 unsigned rounded_size
= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3725 enum insn_code icode
;
3726 insn_operand_predicate_fn pred
;
3728 stack_pointer_delta
+= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3729 /* If there is push pattern, use it. Otherwise try old way of throwing
3730 MEM representing push operation to move expander. */
3731 icode
= push_optab
->handlers
[(int) mode
].insn_code
;
3732 if (icode
!= CODE_FOR_nothing
)
3734 if (((pred
= insn_data
[(int) icode
].operand
[0].predicate
)
3735 && !((*pred
) (x
, mode
))))
3736 x
= force_reg (mode
, x
);
3737 emit_insn (GEN_FCN (icode
) (x
));
3740 if (GET_MODE_SIZE (mode
) == rounded_size
)
3741 dest_addr
= gen_rtx_fmt_e (STACK_PUSH_CODE
, Pmode
, stack_pointer_rtx
);
3744 #ifdef STACK_GROWS_DOWNWARD
3745 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3746 GEN_INT (-(HOST_WIDE_INT
) rounded_size
));
3748 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3749 GEN_INT (rounded_size
));
3751 dest_addr
= gen_rtx_PRE_MODIFY (Pmode
, stack_pointer_rtx
, dest_addr
);
3754 dest
= gen_rtx_MEM (mode
, dest_addr
);
3758 set_mem_attributes (dest
, type
, 1);
3760 if (flag_optimize_sibling_calls
)
3761 /* Function incoming arguments may overlap with sibling call
3762 outgoing arguments and we cannot allow reordering of reads
3763 from function arguments with stores to outgoing arguments
3764 of sibling calls. */
3765 set_mem_alias_set (dest
, 0);
3767 emit_move_insn (dest
, x
);
3771 /* Generate code to push X onto the stack, assuming it has mode MODE and
3773 MODE is redundant except when X is a CONST_INT (since they don't
3775 SIZE is an rtx for the size of data to be copied (in bytes),
3776 needed only if X is BLKmode.
3778 ALIGN (in bits) is maximum alignment we can assume.
3780 If PARTIAL and REG are both nonzero, then copy that many of the first
3781 words of X into registers starting with REG, and push the rest of X.
3782 The amount of space pushed is decreased by PARTIAL words,
3783 rounded *down* to a multiple of PARM_BOUNDARY.
3784 REG must be a hard register in this case.
3785 If REG is zero but PARTIAL is not, take any all others actions for an
3786 argument partially in registers, but do not actually load any
3789 EXTRA is the amount in bytes of extra space to leave next to this arg.
3790 This is ignored if an argument block has already been allocated.
3792 On a machine that lacks real push insns, ARGS_ADDR is the address of
3793 the bottom of the argument block for this call. We use indexing off there
3794 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3795 argument block has not been preallocated.
3797 ARGS_SO_FAR is the size of args previously pushed for this call.
3799 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3800 for arguments passed in registers. If nonzero, it will be the number
3801 of bytes required. */
3804 emit_push_insn (x
, mode
, type
, size
, align
, partial
, reg
, extra
,
3805 args_addr
, args_so_far
, reg_parm_stack_space
,
3808 enum machine_mode mode
;
3817 int reg_parm_stack_space
;
3821 enum direction stack_direction
3822 #ifdef STACK_GROWS_DOWNWARD
3828 /* Decide where to pad the argument: `downward' for below,
3829 `upward' for above, or `none' for don't pad it.
3830 Default is below for small data on big-endian machines; else above. */
3831 enum direction where_pad
= FUNCTION_ARG_PADDING (mode
, type
);
3833 /* Invert direction if stack is post-decrement.
3835 if (STACK_PUSH_CODE
== POST_DEC
)
3836 if (where_pad
!= none
)
3837 where_pad
= (where_pad
== downward
? upward
: downward
);
3839 xinner
= x
= protect_from_queue (x
, 0);
3841 if (mode
== BLKmode
)
3843 /* Copy a block into the stack, entirely or partially. */
3846 int used
= partial
* UNITS_PER_WORD
;
3847 int offset
= used
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
3855 /* USED is now the # of bytes we need not copy to the stack
3856 because registers will take care of them. */
3859 xinner
= adjust_address (xinner
, BLKmode
, used
);
3861 /* If the partial register-part of the arg counts in its stack size,
3862 skip the part of stack space corresponding to the registers.
3863 Otherwise, start copying to the beginning of the stack space,
3864 by setting SKIP to 0. */
3865 skip
= (reg_parm_stack_space
== 0) ? 0 : used
;
3867 #ifdef PUSH_ROUNDING
3868 /* Do it with several push insns if that doesn't take lots of insns
3869 and if there is no difficulty with push insns that skip bytes
3870 on the stack for alignment purposes. */
3873 && GET_CODE (size
) == CONST_INT
3875 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
) - used
, align
))
3876 /* Here we avoid the case of a structure whose weak alignment
3877 forces many pushes of a small amount of data,
3878 and such small pushes do rounding that causes trouble. */
3879 && ((! SLOW_UNALIGNED_ACCESS (word_mode
, align
))
3880 || align
>= BIGGEST_ALIGNMENT
3881 || (PUSH_ROUNDING (align
/ BITS_PER_UNIT
)
3882 == (align
/ BITS_PER_UNIT
)))
3883 && PUSH_ROUNDING (INTVAL (size
)) == INTVAL (size
))
3885 /* Push padding now if padding above and stack grows down,
3886 or if padding below and stack grows up.
3887 But if space already allocated, this has already been done. */
3888 if (extra
&& args_addr
== 0
3889 && where_pad
!= none
&& where_pad
!= stack_direction
)
3890 anti_adjust_stack (GEN_INT (extra
));
3892 move_by_pieces (NULL
, xinner
, INTVAL (size
) - used
, align
);
3895 #endif /* PUSH_ROUNDING */
3899 /* Otherwise make space on the stack and copy the data
3900 to the address of that space. */
3902 /* Deduct words put into registers from the size we must copy. */
3905 if (GET_CODE (size
) == CONST_INT
)
3906 size
= GEN_INT (INTVAL (size
) - used
);
3908 size
= expand_binop (GET_MODE (size
), sub_optab
, size
,
3909 GEN_INT (used
), NULL_RTX
, 0,
3913 /* Get the address of the stack space.
3914 In this case, we do not deal with EXTRA separately.
3915 A single stack adjust will do. */
3918 temp
= push_block (size
, extra
, where_pad
== downward
);
3921 else if (GET_CODE (args_so_far
) == CONST_INT
)
3922 temp
= memory_address (BLKmode
,
3923 plus_constant (args_addr
,
3924 skip
+ INTVAL (args_so_far
)));
3926 temp
= memory_address (BLKmode
,
3927 plus_constant (gen_rtx_PLUS (Pmode
,
3932 if (!ACCUMULATE_OUTGOING_ARGS
)
3934 /* If the source is referenced relative to the stack pointer,
3935 copy it to another register to stabilize it. We do not need
3936 to do this if we know that we won't be changing sp. */
3938 if (reg_mentioned_p (virtual_stack_dynamic_rtx
, temp
)
3939 || reg_mentioned_p (virtual_outgoing_args_rtx
, temp
))
3940 temp
= copy_to_reg (temp
);
3943 target
= gen_rtx_MEM (BLKmode
, temp
);
3947 set_mem_attributes (target
, type
, 1);
3948 /* Function incoming arguments may overlap with sibling call
3949 outgoing arguments and we cannot allow reordering of reads
3950 from function arguments with stores to outgoing arguments
3951 of sibling calls. */
3952 set_mem_alias_set (target
, 0);
3955 /* ALIGN may well be better aligned than TYPE, e.g. due to
3956 PARM_BOUNDARY. Assume the caller isn't lying. */
3957 set_mem_align (target
, align
);
3959 emit_block_move (target
, xinner
, size
, BLOCK_OP_CALL_PARM
);
3962 else if (partial
> 0)
3964 /* Scalar partly in registers. */
3966 int size
= GET_MODE_SIZE (mode
) / UNITS_PER_WORD
;
3969 /* # words of start of argument
3970 that we must make space for but need not store. */
3971 int offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_WORD
);
3972 int args_offset
= INTVAL (args_so_far
);
3975 /* Push padding now if padding above and stack grows down,
3976 or if padding below and stack grows up.
3977 But if space already allocated, this has already been done. */
3978 if (extra
&& args_addr
== 0
3979 && where_pad
!= none
&& where_pad
!= stack_direction
)
3980 anti_adjust_stack (GEN_INT (extra
));
3982 /* If we make space by pushing it, we might as well push
3983 the real data. Otherwise, we can leave OFFSET nonzero
3984 and leave the space uninitialized. */
3988 /* Now NOT_STACK gets the number of words that we don't need to
3989 allocate on the stack. */
3990 not_stack
= partial
- offset
;
3992 /* If the partial register-part of the arg counts in its stack size,
3993 skip the part of stack space corresponding to the registers.
3994 Otherwise, start copying to the beginning of the stack space,
3995 by setting SKIP to 0. */
3996 skip
= (reg_parm_stack_space
== 0) ? 0 : not_stack
;
3998 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
3999 x
= validize_mem (force_const_mem (mode
, x
));
4001 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
4002 SUBREGs of such registers are not allowed. */
4003 if ((GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
4004 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
))
4005 x
= copy_to_reg (x
);
4007 /* Loop over all the words allocated on the stack for this arg. */
4008 /* We can do it by words, because any scalar bigger than a word
4009 has a size a multiple of a word. */
4010 #ifndef PUSH_ARGS_REVERSED
4011 for (i
= not_stack
; i
< size
; i
++)
4013 for (i
= size
- 1; i
>= not_stack
; i
--)
4015 if (i
>= not_stack
+ offset
)
4016 emit_push_insn (operand_subword_force (x
, i
, mode
),
4017 word_mode
, NULL_TREE
, NULL_RTX
, align
, 0, NULL_RTX
,
4019 GEN_INT (args_offset
+ ((i
- not_stack
+ skip
)
4021 reg_parm_stack_space
, alignment_pad
);
4028 /* Push padding now if padding above and stack grows down,
4029 or if padding below and stack grows up.
4030 But if space already allocated, this has already been done. */
4031 if (extra
&& args_addr
== 0
4032 && where_pad
!= none
&& where_pad
!= stack_direction
)
4033 anti_adjust_stack (GEN_INT (extra
));
4035 #ifdef PUSH_ROUNDING
4036 if (args_addr
== 0 && PUSH_ARGS
)
4037 emit_single_push_insn (mode
, x
, type
);
4041 if (GET_CODE (args_so_far
) == CONST_INT
)
4043 = memory_address (mode
,
4044 plus_constant (args_addr
,
4045 INTVAL (args_so_far
)));
4047 addr
= memory_address (mode
, gen_rtx_PLUS (Pmode
, args_addr
,
4049 dest
= gen_rtx_MEM (mode
, addr
);
4052 set_mem_attributes (dest
, type
, 1);
4053 /* Function incoming arguments may overlap with sibling call
4054 outgoing arguments and we cannot allow reordering of reads
4055 from function arguments with stores to outgoing arguments
4056 of sibling calls. */
4057 set_mem_alias_set (dest
, 0);
4060 emit_move_insn (dest
, x
);
4064 /* If part should go in registers, copy that part
4065 into the appropriate registers. Do this now, at the end,
4066 since mem-to-mem copies above may do function calls. */
4067 if (partial
> 0 && reg
!= 0)
4069 /* Handle calls that pass values in multiple non-contiguous locations.
4070 The Irix 6 ABI has examples of this. */
4071 if (GET_CODE (reg
) == PARALLEL
)
4072 emit_group_load (reg
, x
, -1); /* ??? size? */
4074 move_block_to_reg (REGNO (reg
), x
, partial
, mode
);
4077 if (extra
&& args_addr
== 0 && where_pad
== stack_direction
)
4078 anti_adjust_stack (GEN_INT (extra
));
4080 if (alignment_pad
&& args_addr
== 0)
4081 anti_adjust_stack (alignment_pad
);
4084 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4092 /* Only registers can be subtargets. */
4093 || GET_CODE (x
) != REG
4094 /* If the register is readonly, it can't be set more than once. */
4095 || RTX_UNCHANGING_P (x
)
4096 /* Don't use hard regs to avoid extending their life. */
4097 || REGNO (x
) < FIRST_PSEUDO_REGISTER
4098 /* Avoid subtargets inside loops,
4099 since they hide some invariant expressions. */
4100 || preserve_subexpressions_p ())
4104 /* Expand an assignment that stores the value of FROM into TO.
4105 If WANT_VALUE is nonzero, return an rtx for the value of TO.
4106 (This may contain a QUEUED rtx;
4107 if the value is constant, this rtx is a constant.)
4108 Otherwise, the returned value is NULL_RTX.
4110 SUGGEST_REG is no longer actually used.
4111 It used to mean, copy the value through a register
4112 and return that register, if that is possible.
4113 We now use WANT_VALUE to decide whether to do this. */
4116 expand_assignment (to
, from
, want_value
, suggest_reg
)
4119 int suggest_reg ATTRIBUTE_UNUSED
;
4124 /* Don't crash if the lhs of the assignment was erroneous. */
4126 if (TREE_CODE (to
) == ERROR_MARK
)
4128 result
= expand_expr (from
, NULL_RTX
, VOIDmode
, 0);
4129 return want_value
? result
: NULL_RTX
;
4132 /* Assignment of a structure component needs special treatment
4133 if the structure component's rtx is not simply a MEM.
4134 Assignment of an array element at a constant index, and assignment of
4135 an array element in an unaligned packed structure field, has the same
4138 if (TREE_CODE (to
) == COMPONENT_REF
|| TREE_CODE (to
) == BIT_FIELD_REF
4139 || TREE_CODE (to
) == ARRAY_REF
|| TREE_CODE (to
) == ARRAY_RANGE_REF
4140 || TREE_CODE (TREE_TYPE (to
)) == ARRAY_TYPE
)
4142 enum machine_mode mode1
;
4143 HOST_WIDE_INT bitsize
, bitpos
;
4151 tem
= get_inner_reference (to
, &bitsize
, &bitpos
, &offset
, &mode1
,
4152 &unsignedp
, &volatilep
);
4154 /* If we are going to use store_bit_field and extract_bit_field,
4155 make sure to_rtx will be safe for multiple use. */
4157 if (mode1
== VOIDmode
&& want_value
)
4158 tem
= stabilize_reference (tem
);
4160 orig_to_rtx
= to_rtx
= expand_expr (tem
, NULL_RTX
, VOIDmode
, 0);
4164 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
4166 if (GET_CODE (to_rtx
) != MEM
)
4169 #ifdef POINTERS_EXTEND_UNSIGNED
4170 if (GET_MODE (offset_rtx
) != Pmode
)
4171 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
4173 if (GET_MODE (offset_rtx
) != ptr_mode
)
4174 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
4177 /* A constant address in TO_RTX can have VOIDmode, we must not try
4178 to call force_reg for that case. Avoid that case. */
4179 if (GET_CODE (to_rtx
) == MEM
4180 && GET_MODE (to_rtx
) == BLKmode
4181 && GET_MODE (XEXP (to_rtx
, 0)) != VOIDmode
4183 && (bitpos
% bitsize
) == 0
4184 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
4185 && MEM_ALIGN (to_rtx
) == GET_MODE_ALIGNMENT (mode1
))
4187 to_rtx
= adjust_address (to_rtx
, mode1
, bitpos
/ BITS_PER_UNIT
);
4191 to_rtx
= offset_address (to_rtx
, offset_rtx
,
4192 highest_pow2_factor_for_type (TREE_TYPE (to
),
4196 if (GET_CODE (to_rtx
) == MEM
)
4198 /* If the field is at offset zero, we could have been given the
4199 DECL_RTX of the parent struct. Don't munge it. */
4200 to_rtx
= shallow_copy_rtx (to_rtx
);
4202 set_mem_attributes_minus_bitpos (to_rtx
, to
, 0, bitpos
);
4205 /* Deal with volatile and readonly fields. The former is only done
4206 for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4207 if (volatilep
&& GET_CODE (to_rtx
) == MEM
)
4209 if (to_rtx
== orig_to_rtx
)
4210 to_rtx
= copy_rtx (to_rtx
);
4211 MEM_VOLATILE_P (to_rtx
) = 1;
4214 if (TREE_CODE (to
) == COMPONENT_REF
4215 && TREE_READONLY (TREE_OPERAND (to
, 1)))
4217 if (to_rtx
== orig_to_rtx
)
4218 to_rtx
= copy_rtx (to_rtx
);
4219 RTX_UNCHANGING_P (to_rtx
) = 1;
4222 if (GET_CODE (to_rtx
) == MEM
&& ! can_address_p (to
))
4224 if (to_rtx
== orig_to_rtx
)
4225 to_rtx
= copy_rtx (to_rtx
);
4226 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
4229 result
= store_field (to_rtx
, bitsize
, bitpos
, mode1
, from
,
4231 /* Spurious cast for HPUX compiler. */
4232 ? ((enum machine_mode
)
4233 TYPE_MODE (TREE_TYPE (to
)))
4235 unsignedp
, TREE_TYPE (tem
), get_alias_set (to
));
4237 preserve_temp_slots (result
);
4241 /* If the value is meaningful, convert RESULT to the proper mode.
4242 Otherwise, return nothing. */
4243 return (want_value
? convert_modes (TYPE_MODE (TREE_TYPE (to
)),
4244 TYPE_MODE (TREE_TYPE (from
)),
4246 TREE_UNSIGNED (TREE_TYPE (to
)))
4250 /* If the rhs is a function call and its value is not an aggregate,
4251 call the function before we start to compute the lhs.
4252 This is needed for correct code for cases such as
4253 val = setjmp (buf) on machines where reference to val
4254 requires loading up part of an address in a separate insn.
4256 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4257 since it might be a promoted variable where the zero- or sign- extension
4258 needs to be done. Handling this in the normal way is safe because no
4259 computation is done before the call. */
4260 if (TREE_CODE (from
) == CALL_EXPR
&& ! aggregate_value_p (from
)
4261 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from
))) == INTEGER_CST
4262 && ! ((TREE_CODE (to
) == VAR_DECL
|| TREE_CODE (to
) == PARM_DECL
)
4263 && GET_CODE (DECL_RTL (to
)) == REG
))
4268 value
= expand_expr (from
, NULL_RTX
, VOIDmode
, 0);
4270 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4272 /* Handle calls that return values in multiple non-contiguous locations.
4273 The Irix 6 ABI has examples of this. */
4274 if (GET_CODE (to_rtx
) == PARALLEL
)
4275 emit_group_load (to_rtx
, value
, int_size_in_bytes (TREE_TYPE (from
)));
4276 else if (GET_MODE (to_rtx
) == BLKmode
)
4277 emit_block_move (to_rtx
, value
, expr_size (from
), BLOCK_OP_NORMAL
);
4280 #ifdef POINTERS_EXTEND_UNSIGNED
4281 if (POINTER_TYPE_P (TREE_TYPE (to
))
4282 && GET_MODE (to_rtx
) != GET_MODE (value
))
4283 value
= convert_memory_address (GET_MODE (to_rtx
), value
);
4285 emit_move_insn (to_rtx
, value
);
4287 preserve_temp_slots (to_rtx
);
4290 return want_value
? to_rtx
: NULL_RTX
;
4293 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4294 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4297 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4299 /* Don't move directly into a return register. */
4300 if (TREE_CODE (to
) == RESULT_DECL
4301 && (GET_CODE (to_rtx
) == REG
|| GET_CODE (to_rtx
) == PARALLEL
))
4306 temp
= expand_expr (from
, 0, GET_MODE (to_rtx
), 0);
4308 if (GET_CODE (to_rtx
) == PARALLEL
)
4309 emit_group_load (to_rtx
, temp
, int_size_in_bytes (TREE_TYPE (from
)));
4311 emit_move_insn (to_rtx
, temp
);
4313 preserve_temp_slots (to_rtx
);
4316 return want_value
? to_rtx
: NULL_RTX
;
4319 /* In case we are returning the contents of an object which overlaps
4320 the place the value is being stored, use a safe function when copying
4321 a value through a pointer into a structure value return block. */
4322 if (TREE_CODE (to
) == RESULT_DECL
&& TREE_CODE (from
) == INDIRECT_REF
4323 && current_function_returns_struct
4324 && !current_function_returns_pcc_struct
)
4329 size
= expr_size (from
);
4330 from_rtx
= expand_expr (from
, NULL_RTX
, VOIDmode
, 0);
4332 if (TARGET_MEM_FUNCTIONS
)
4333 emit_library_call (memmove_libfunc
, LCT_NORMAL
,
4334 VOIDmode
, 3, XEXP (to_rtx
, 0), Pmode
,
4335 XEXP (from_rtx
, 0), Pmode
,
4336 convert_to_mode (TYPE_MODE (sizetype
),
4337 size
, TREE_UNSIGNED (sizetype
)),
4338 TYPE_MODE (sizetype
));
4340 emit_library_call (bcopy_libfunc
, LCT_NORMAL
,
4341 VOIDmode
, 3, XEXP (from_rtx
, 0), Pmode
,
4342 XEXP (to_rtx
, 0), Pmode
,
4343 convert_to_mode (TYPE_MODE (integer_type_node
),
4345 TREE_UNSIGNED (integer_type_node
)),
4346 TYPE_MODE (integer_type_node
));
4348 preserve_temp_slots (to_rtx
);
4351 return want_value
? to_rtx
: NULL_RTX
;
4354 /* Compute FROM and store the value in the rtx we got. */
4357 result
= store_expr (from
, to_rtx
, want_value
);
4358 preserve_temp_slots (result
);
4361 return want_value
? result
: NULL_RTX
;
4364 /* Generate code for computing expression EXP,
4365 and storing the value into TARGET.
4366 TARGET may contain a QUEUED rtx.
4368 If WANT_VALUE & 1 is nonzero, return a copy of the value
4369 not in TARGET, so that we can be sure to use the proper
4370 value in a containing expression even if TARGET has something
4371 else stored in it. If possible, we copy the value through a pseudo
4372 and return that pseudo. Or, if the value is constant, we try to
4373 return the constant. In some cases, we return a pseudo
4374 copied *from* TARGET.
4376 If the mode is BLKmode then we may return TARGET itself.
4377 It turns out that in BLKmode it doesn't cause a problem.
4378 because C has no operators that could combine two different
4379 assignments into the same BLKmode object with different values
4380 with no sequence point. Will other languages need this to
4383 If WANT_VALUE & 1 is 0, we return NULL, to make sure
4384 to catch quickly any cases where the caller uses the value
4385 and fails to set WANT_VALUE.
4387 If WANT_VALUE & 2 is set, this is a store into a call param on the
4388 stack, and block moves may need to be treated specially. */
4391 store_expr (exp
, target
, want_value
)
4397 int dont_return_target
= 0;
4398 int dont_store_target
= 0;
4400 if (VOID_TYPE_P (TREE_TYPE (exp
)))
4402 /* C++ can generate ?: expressions with a throw expression in one
4403 branch and an rvalue in the other. Here, we resolve attempts to
4404 store the throw expression's nonexistant result. */
4407 expand_expr (exp
, const0_rtx
, VOIDmode
, 0);
4410 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
4412 /* Perform first part of compound expression, then assign from second
4414 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
4415 want_value
& 2 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4417 return store_expr (TREE_OPERAND (exp
, 1), target
, want_value
);
4419 else if (TREE_CODE (exp
) == COND_EXPR
&& GET_MODE (target
) == BLKmode
)
4421 /* For conditional expression, get safe form of the target. Then
4422 test the condition, doing the appropriate assignment on either
4423 side. This avoids the creation of unnecessary temporaries.
4424 For non-BLKmode, it is more efficient not to do this. */
4426 rtx lab1
= gen_label_rtx (), lab2
= gen_label_rtx ();
4429 target
= protect_from_queue (target
, 1);
4431 do_pending_stack_adjust ();
4433 jumpifnot (TREE_OPERAND (exp
, 0), lab1
);
4434 start_cleanup_deferral ();
4435 store_expr (TREE_OPERAND (exp
, 1), target
, want_value
& 2);
4436 end_cleanup_deferral ();
4438 emit_jump_insn (gen_jump (lab2
));
4441 start_cleanup_deferral ();
4442 store_expr (TREE_OPERAND (exp
, 2), target
, want_value
& 2);
4443 end_cleanup_deferral ();
4448 return want_value
& 1 ? target
: NULL_RTX
;
4450 else if (queued_subexp_p (target
))
4451 /* If target contains a postincrement, let's not risk
4452 using it as the place to generate the rhs. */
4454 if (GET_MODE (target
) != BLKmode
&& GET_MODE (target
) != VOIDmode
)
4456 /* Expand EXP into a new pseudo. */
4457 temp
= gen_reg_rtx (GET_MODE (target
));
4458 temp
= expand_expr (exp
, temp
, GET_MODE (target
),
4460 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
4463 temp
= expand_expr (exp
, NULL_RTX
, GET_MODE (target
),
4465 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
4467 /* If target is volatile, ANSI requires accessing the value
4468 *from* the target, if it is accessed. So make that happen.
4469 In no case return the target itself. */
4470 if (! MEM_VOLATILE_P (target
) && (want_value
& 1) != 0)
4471 dont_return_target
= 1;
4473 else if ((want_value
& 1) != 0
4474 && GET_CODE (target
) == MEM
4475 && ! MEM_VOLATILE_P (target
)
4476 && GET_MODE (target
) != BLKmode
)
4477 /* If target is in memory and caller wants value in a register instead,
4478 arrange that. Pass TARGET as target for expand_expr so that,
4479 if EXP is another assignment, WANT_VALUE will be nonzero for it.
4480 We know expand_expr will not use the target in that case.
4481 Don't do this if TARGET is volatile because we are supposed
4482 to write it and then read it. */
4484 temp
= expand_expr (exp
, target
, GET_MODE (target
),
4485 want_value
& 2 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4486 if (GET_MODE (temp
) != BLKmode
&& GET_MODE (temp
) != VOIDmode
)
4488 /* If TEMP is already in the desired TARGET, only copy it from
4489 memory and don't store it there again. */
4491 || (rtx_equal_p (temp
, target
)
4492 && ! side_effects_p (temp
) && ! side_effects_p (target
)))
4493 dont_store_target
= 1;
4494 temp
= copy_to_reg (temp
);
4496 dont_return_target
= 1;
4498 else if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
4499 /* If this is a scalar in a register that is stored in a wider mode
4500 than the declared mode, compute the result into its declared mode
4501 and then convert to the wider mode. Our value is the computed
4504 rtx inner_target
= 0;
4506 /* If we don't want a value, we can do the conversion inside EXP,
4507 which will often result in some optimizations. Do the conversion
4508 in two steps: first change the signedness, if needed, then
4509 the extend. But don't do this if the type of EXP is a subtype
4510 of something else since then the conversion might involve
4511 more than just converting modes. */
4512 if ((want_value
& 1) == 0
4513 && INTEGRAL_TYPE_P (TREE_TYPE (exp
))
4514 && TREE_TYPE (TREE_TYPE (exp
)) == 0)
4516 if (TREE_UNSIGNED (TREE_TYPE (exp
))
4517 != SUBREG_PROMOTED_UNSIGNED_P (target
))
4519 ((*lang_hooks
.types
.signed_or_unsigned_type
)
4520 (SUBREG_PROMOTED_UNSIGNED_P (target
), TREE_TYPE (exp
)), exp
);
4522 exp
= convert ((*lang_hooks
.types
.type_for_mode
)
4523 (GET_MODE (SUBREG_REG (target
)),
4524 SUBREG_PROMOTED_UNSIGNED_P (target
)),
4527 inner_target
= SUBREG_REG (target
);
4530 temp
= expand_expr (exp
, inner_target
, VOIDmode
,
4531 want_value
& 2 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4533 /* If TEMP is a MEM and we want a result value, make the access
4534 now so it gets done only once. Strictly speaking, this is
4535 only necessary if the MEM is volatile, or if the address
4536 overlaps TARGET. But not performing the load twice also
4537 reduces the amount of rtl we generate and then have to CSE. */
4538 if (GET_CODE (temp
) == MEM
&& (want_value
& 1) != 0)
4539 temp
= copy_to_reg (temp
);
4541 /* If TEMP is a VOIDmode constant, use convert_modes to make
4542 sure that we properly convert it. */
4543 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
4545 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
4546 temp
, SUBREG_PROMOTED_UNSIGNED_P (target
));
4547 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
4548 GET_MODE (target
), temp
,
4549 SUBREG_PROMOTED_UNSIGNED_P (target
));
4552 convert_move (SUBREG_REG (target
), temp
,
4553 SUBREG_PROMOTED_UNSIGNED_P (target
));
4555 /* If we promoted a constant, change the mode back down to match
4556 target. Otherwise, the caller might get confused by a result whose
4557 mode is larger than expected. */
4559 if ((want_value
& 1) != 0 && GET_MODE (temp
) != GET_MODE (target
))
4561 if (GET_MODE (temp
) != VOIDmode
)
4563 temp
= gen_lowpart_SUBREG (GET_MODE (target
), temp
);
4564 SUBREG_PROMOTED_VAR_P (temp
) = 1;
4565 SUBREG_PROMOTED_UNSIGNED_SET (temp
,
4566 SUBREG_PROMOTED_UNSIGNED_P (target
));
4569 temp
= convert_modes (GET_MODE (target
),
4570 GET_MODE (SUBREG_REG (target
)),
4571 temp
, SUBREG_PROMOTED_UNSIGNED_P (target
));
4574 return want_value
& 1 ? temp
: NULL_RTX
;
4578 temp
= expand_expr (exp
, target
, GET_MODE (target
),
4579 want_value
& 2 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4580 /* Return TARGET if it's a specified hardware register.
4581 If TARGET is a volatile mem ref, either return TARGET
4582 or return a reg copied *from* TARGET; ANSI requires this.
4584 Otherwise, if TEMP is not TARGET, return TEMP
4585 if it is constant (for efficiency),
4586 or if we really want the correct value. */
4587 if (!(target
&& GET_CODE (target
) == REG
4588 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
4589 && !(GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
))
4590 && ! rtx_equal_p (temp
, target
)
4591 && (CONSTANT_P (temp
) || (want_value
& 1) != 0))
4592 dont_return_target
= 1;
4595 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4596 the same as that of TARGET, adjust the constant. This is needed, for
4597 example, in case it is a CONST_DOUBLE and we want only a word-sized
4599 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
4600 && TREE_CODE (exp
) != ERROR_MARK
4601 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
4602 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
4603 temp
, TREE_UNSIGNED (TREE_TYPE (exp
)));
4605 /* If value was not generated in the target, store it there.
4606 Convert the value to TARGET's type first if necessary.
4607 If TEMP and TARGET compare equal according to rtx_equal_p, but
4608 one or both of them are volatile memory refs, we have to distinguish
4610 - expand_expr has used TARGET. In this case, we must not generate
4611 another copy. This can be detected by TARGET being equal according
4613 - expand_expr has not used TARGET - that means that the source just
4614 happens to have the same RTX form. Since temp will have been created
4615 by expand_expr, it will compare unequal according to == .
4616 We must generate a copy in this case, to reach the correct number
4617 of volatile memory references. */
4619 if ((! rtx_equal_p (temp
, target
)
4620 || (temp
!= target
&& (side_effects_p (temp
)
4621 || side_effects_p (target
))))
4622 && TREE_CODE (exp
) != ERROR_MARK
4623 && ! dont_store_target
4624 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4625 but TARGET is not valid memory reference, TEMP will differ
4626 from TARGET although it is really the same location. */
4627 && (TREE_CODE_CLASS (TREE_CODE (exp
)) != 'd'
4628 || target
!= DECL_RTL_IF_SET (exp
))
4629 /* If there's nothing to copy, don't bother. Don't call expr_size
4630 unless necessary, because some front-ends (C++) expr_size-hook
4631 aborts on objects that are not supposed to be bit-copied or
4633 && expr_size (exp
) != const0_rtx
)
4635 target
= protect_from_queue (target
, 1);
4636 if (GET_MODE (temp
) != GET_MODE (target
)
4637 && GET_MODE (temp
) != VOIDmode
)
4639 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (exp
));
4640 if (dont_return_target
)
4642 /* In this case, we will return TEMP,
4643 so make sure it has the proper mode.
4644 But don't forget to store the value into TARGET. */
4645 temp
= convert_to_mode (GET_MODE (target
), temp
, unsignedp
);
4646 emit_move_insn (target
, temp
);
4649 convert_move (target
, temp
, unsignedp
);
4652 else if (GET_MODE (temp
) == BLKmode
&& TREE_CODE (exp
) == STRING_CST
)
4654 /* Handle copying a string constant into an array. The string
4655 constant may be shorter than the array. So copy just the string's
4656 actual length, and clear the rest. First get the size of the data
4657 type of the string, which is actually the size of the target. */
4658 rtx size
= expr_size (exp
);
4660 if (GET_CODE (size
) == CONST_INT
4661 && INTVAL (size
) < TREE_STRING_LENGTH (exp
))
4662 emit_block_move (target
, temp
, size
,
4664 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4667 /* Compute the size of the data to copy from the string. */
4669 = size_binop (MIN_EXPR
,
4670 make_tree (sizetype
, size
),
4671 size_int (TREE_STRING_LENGTH (exp
)));
4673 = expand_expr (copy_size
, NULL_RTX
, VOIDmode
,
4675 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
4678 /* Copy that much. */
4679 copy_size_rtx
= convert_to_mode (ptr_mode
, copy_size_rtx
,
4680 TREE_UNSIGNED (sizetype
));
4681 emit_block_move (target
, temp
, copy_size_rtx
,
4683 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4685 /* Figure out how much is left in TARGET that we have to clear.
4686 Do all calculations in ptr_mode. */
4687 if (GET_CODE (copy_size_rtx
) == CONST_INT
)
4689 size
= plus_constant (size
, -INTVAL (copy_size_rtx
));
4690 target
= adjust_address (target
, BLKmode
,
4691 INTVAL (copy_size_rtx
));
4695 size
= expand_binop (TYPE_MODE (sizetype
), sub_optab
, size
,
4696 copy_size_rtx
, NULL_RTX
, 0,
4699 #ifdef POINTERS_EXTEND_UNSIGNED
4700 if (GET_MODE (copy_size_rtx
) != Pmode
)
4701 copy_size_rtx
= convert_to_mode (Pmode
, copy_size_rtx
,
4702 TREE_UNSIGNED (sizetype
));
4705 target
= offset_address (target
, copy_size_rtx
,
4706 highest_pow2_factor (copy_size
));
4707 label
= gen_label_rtx ();
4708 emit_cmp_and_jump_insns (size
, const0_rtx
, LT
, NULL_RTX
,
4709 GET_MODE (size
), 0, label
);
4712 if (size
!= const0_rtx
)
4713 clear_storage (target
, size
);
4719 /* Handle calls that return values in multiple non-contiguous locations.
4720 The Irix 6 ABI has examples of this. */
4721 else if (GET_CODE (target
) == PARALLEL
)
4722 emit_group_load (target
, temp
, int_size_in_bytes (TREE_TYPE (exp
)));
4723 else if (GET_MODE (temp
) == BLKmode
)
4724 emit_block_move (target
, temp
, expr_size (exp
),
4726 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4728 emit_move_insn (target
, temp
);
4731 /* If we don't want a value, return NULL_RTX. */
4732 if ((want_value
& 1) == 0)
4735 /* If we are supposed to return TEMP, do so as long as it isn't a MEM.
4736 ??? The latter test doesn't seem to make sense. */
4737 else if (dont_return_target
&& GET_CODE (temp
) != MEM
)
4740 /* Return TARGET itself if it is a hard register. */
4741 else if ((want_value
& 1) != 0
4742 && GET_MODE (target
) != BLKmode
4743 && ! (GET_CODE (target
) == REG
4744 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
4745 return copy_to_reg (target
);
4751 /* Return 1 if EXP just contains zeros. */
4759 switch (TREE_CODE (exp
))
4763 case NON_LVALUE_EXPR
:
4764 case VIEW_CONVERT_EXPR
:
4765 return is_zeros_p (TREE_OPERAND (exp
, 0));
4768 return integer_zerop (exp
);
4772 is_zeros_p (TREE_REALPART (exp
)) && is_zeros_p (TREE_IMAGPART (exp
));
4775 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (exp
), dconst0
);
4778 for (elt
= TREE_VECTOR_CST_ELTS (exp
); elt
;
4779 elt
= TREE_CHAIN (elt
))
4780 if (!is_zeros_p (TREE_VALUE (elt
)))
4786 if (TREE_TYPE (exp
) && TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
4787 return CONSTRUCTOR_ELTS (exp
) == NULL_TREE
;
4788 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
4789 if (! is_zeros_p (TREE_VALUE (elt
)))
4799 /* Return 1 if EXP contains mostly (3/4) zeros. */
4802 mostly_zeros_p (exp
)
4805 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4807 int elts
= 0, zeros
= 0;
4808 tree elt
= CONSTRUCTOR_ELTS (exp
);
4809 if (TREE_TYPE (exp
) && TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
4811 /* If there are no ranges of true bits, it is all zero. */
4812 return elt
== NULL_TREE
;
4814 for (; elt
; elt
= TREE_CHAIN (elt
))
4816 /* We do not handle the case where the index is a RANGE_EXPR,
4817 so the statistic will be somewhat inaccurate.
4818 We do make a more accurate count in store_constructor itself,
4819 so since this function is only used for nested array elements,
4820 this should be close enough. */
4821 if (mostly_zeros_p (TREE_VALUE (elt
)))
4826 return 4 * zeros
>= 3 * elts
;
4829 return is_zeros_p (exp
);
4832 /* Helper function for store_constructor.
4833 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4834 TYPE is the type of the CONSTRUCTOR, not the element type.
4835 CLEARED is as for store_constructor.
4836 ALIAS_SET is the alias set to use for any stores.
4838 This provides a recursive shortcut back to store_constructor when it isn't
4839 necessary to go through store_field. This is so that we can pass through
4840 the cleared field to let store_constructor know that we may not have to
4841 clear a substructure if the outer structure has already been cleared. */
4844 store_constructor_field (target
, bitsize
, bitpos
, mode
, exp
, type
, cleared
,
4847 unsigned HOST_WIDE_INT bitsize
;
4848 HOST_WIDE_INT bitpos
;
4849 enum machine_mode mode
;
4854 if (TREE_CODE (exp
) == CONSTRUCTOR
4855 && bitpos
% BITS_PER_UNIT
== 0
4856 /* If we have a nonzero bitpos for a register target, then we just
4857 let store_field do the bitfield handling. This is unlikely to
4858 generate unnecessary clear instructions anyways. */
4859 && (bitpos
== 0 || GET_CODE (target
) == MEM
))
4861 if (GET_CODE (target
) == MEM
)
4863 = adjust_address (target
,
4864 GET_MODE (target
) == BLKmode
4866 % GET_MODE_ALIGNMENT (GET_MODE (target
)))
4867 ? BLKmode
: VOIDmode
, bitpos
/ BITS_PER_UNIT
);
4870 /* Update the alias set, if required. */
4871 if (GET_CODE (target
) == MEM
&& ! MEM_KEEP_ALIAS_SET_P (target
)
4872 && MEM_ALIAS_SET (target
) != 0)
4874 target
= copy_rtx (target
);
4875 set_mem_alias_set (target
, alias_set
);
4878 store_constructor (exp
, target
, cleared
, bitsize
/ BITS_PER_UNIT
);
4881 store_field (target
, bitsize
, bitpos
, mode
, exp
, VOIDmode
, 0, type
,
4885 /* Store the value of constructor EXP into the rtx TARGET.
4886 TARGET is either a REG or a MEM; we know it cannot conflict, since
4887 safe_from_p has been called.
4888 CLEARED is true if TARGET is known to have been zero'd.
4889 SIZE is the number of bytes of TARGET we are allowed to modify: this
4890 may not be the same as the size of EXP if we are assigning to a field
4891 which has been packed to exclude padding bits. */
4894 store_constructor (exp
, target
, cleared
, size
)
4900 tree type
= TREE_TYPE (exp
);
4901 #ifdef WORD_REGISTER_OPERATIONS
4902 HOST_WIDE_INT exp_size
= int_size_in_bytes (type
);
4905 if (TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4906 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4910 /* We either clear the aggregate or indicate the value is dead. */
4911 if ((TREE_CODE (type
) == UNION_TYPE
4912 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4914 && ! CONSTRUCTOR_ELTS (exp
))
4915 /* If the constructor is empty, clear the union. */
4917 clear_storage (target
, expr_size (exp
));
4921 /* If we are building a static constructor into a register,
4922 set the initial value as zero so we can fold the value into
4923 a constant. But if more than one register is involved,
4924 this probably loses. */
4925 else if (! cleared
&& GET_CODE (target
) == REG
&& TREE_STATIC (exp
)
4926 && GET_MODE_SIZE (GET_MODE (target
)) <= UNITS_PER_WORD
)
4928 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
4932 /* If the constructor has fewer fields than the structure
4933 or if we are initializing the structure to mostly zeros,
4934 clear the whole structure first. Don't do this if TARGET is a
4935 register whose mode size isn't equal to SIZE since clear_storage
4936 can't handle this case. */
4937 else if (! cleared
&& size
> 0
4938 && ((list_length (CONSTRUCTOR_ELTS (exp
))
4939 != fields_length (type
))
4940 || mostly_zeros_p (exp
))
4941 && (GET_CODE (target
) != REG
4942 || ((HOST_WIDE_INT
) GET_MODE_SIZE (GET_MODE (target
))
4945 rtx xtarget
= target
;
4947 if (readonly_fields_p (type
))
4949 xtarget
= copy_rtx (xtarget
);
4950 RTX_UNCHANGING_P (xtarget
) = 1;
4953 clear_storage (xtarget
, GEN_INT (size
));
4958 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
4960 /* Store each element of the constructor into
4961 the corresponding field of TARGET. */
4963 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
4965 tree field
= TREE_PURPOSE (elt
);
4966 tree value
= TREE_VALUE (elt
);
4967 enum machine_mode mode
;
4968 HOST_WIDE_INT bitsize
;
4969 HOST_WIDE_INT bitpos
= 0;
4971 rtx to_rtx
= target
;
4973 /* Just ignore missing fields.
4974 We cleared the whole structure, above,
4975 if any fields are missing. */
4979 if (cleared
&& is_zeros_p (value
))
4982 if (host_integerp (DECL_SIZE (field
), 1))
4983 bitsize
= tree_low_cst (DECL_SIZE (field
), 1);
4987 mode
= DECL_MODE (field
);
4988 if (DECL_BIT_FIELD (field
))
4991 offset
= DECL_FIELD_OFFSET (field
);
4992 if (host_integerp (offset
, 0)
4993 && host_integerp (bit_position (field
), 0))
4995 bitpos
= int_bit_position (field
);
4999 bitpos
= tree_low_cst (DECL_FIELD_BIT_OFFSET (field
), 0);
5005 if (contains_placeholder_p (offset
))
5006 offset
= build (WITH_RECORD_EXPR
, sizetype
,
5007 offset
, make_tree (TREE_TYPE (exp
), target
));
5009 offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, 0);
5010 if (GET_CODE (to_rtx
) != MEM
)
5013 #ifdef POINTERS_EXTEND_UNSIGNED
5014 if (GET_MODE (offset_rtx
) != Pmode
)
5015 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
5017 if (GET_MODE (offset_rtx
) != ptr_mode
)
5018 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
5021 to_rtx
= offset_address (to_rtx
, offset_rtx
,
5022 highest_pow2_factor (offset
));
5025 if (TREE_READONLY (field
))
5027 if (GET_CODE (to_rtx
) == MEM
)
5028 to_rtx
= copy_rtx (to_rtx
);
5030 RTX_UNCHANGING_P (to_rtx
) = 1;
5033 #ifdef WORD_REGISTER_OPERATIONS
5034 /* If this initializes a field that is smaller than a word, at the
5035 start of a word, try to widen it to a full word.
5036 This special case allows us to output C++ member function
5037 initializations in a form that the optimizers can understand. */
5038 if (GET_CODE (target
) == REG
5039 && bitsize
< BITS_PER_WORD
5040 && bitpos
% BITS_PER_WORD
== 0
5041 && GET_MODE_CLASS (mode
) == MODE_INT
5042 && TREE_CODE (value
) == INTEGER_CST
5044 && bitpos
+ BITS_PER_WORD
<= exp_size
* BITS_PER_UNIT
)
5046 tree type
= TREE_TYPE (value
);
5048 if (TYPE_PRECISION (type
) < BITS_PER_WORD
)
5050 type
= (*lang_hooks
.types
.type_for_size
)
5051 (BITS_PER_WORD
, TREE_UNSIGNED (type
));
5052 value
= convert (type
, value
);
5055 if (BYTES_BIG_ENDIAN
)
5057 = fold (build (LSHIFT_EXPR
, type
, value
,
5058 build_int_2 (BITS_PER_WORD
- bitsize
, 0)));
5059 bitsize
= BITS_PER_WORD
;
5064 if (GET_CODE (to_rtx
) == MEM
&& !MEM_KEEP_ALIAS_SET_P (to_rtx
)
5065 && DECL_NONADDRESSABLE_P (field
))
5067 to_rtx
= copy_rtx (to_rtx
);
5068 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
5071 store_constructor_field (to_rtx
, bitsize
, bitpos
, mode
,
5072 value
, type
, cleared
,
5073 get_alias_set (TREE_TYPE (field
)));
5076 else if (TREE_CODE (type
) == ARRAY_TYPE
5077 || TREE_CODE (type
) == VECTOR_TYPE
)
5082 tree domain
= TYPE_DOMAIN (type
);
5083 tree elttype
= TREE_TYPE (type
);
5085 HOST_WIDE_INT minelt
= 0;
5086 HOST_WIDE_INT maxelt
= 0;
5088 /* Vectors are like arrays, but the domain is stored via an array
5090 if (TREE_CODE (type
) == VECTOR_TYPE
)
5092 /* Note that although TYPE_DEBUG_REPRESENTATION_TYPE uses
5093 the same field as TYPE_DOMAIN, we are not guaranteed that
5095 domain
= TYPE_DEBUG_REPRESENTATION_TYPE (type
);
5096 domain
= TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (domain
)));
5099 const_bounds_p
= (TYPE_MIN_VALUE (domain
)
5100 && TYPE_MAX_VALUE (domain
)
5101 && host_integerp (TYPE_MIN_VALUE (domain
), 0)
5102 && host_integerp (TYPE_MAX_VALUE (domain
), 0));
5104 /* If we have constant bounds for the range of the type, get them. */
5107 minelt
= tree_low_cst (TYPE_MIN_VALUE (domain
), 0);
5108 maxelt
= tree_low_cst (TYPE_MAX_VALUE (domain
), 0);
5111 /* If the constructor has fewer elements than the array,
5112 clear the whole array first. Similarly if this is
5113 static constructor of a non-BLKmode object. */
5114 if (cleared
|| (GET_CODE (target
) == REG
&& TREE_STATIC (exp
)))
5118 HOST_WIDE_INT count
= 0, zero_count
= 0;
5119 need_to_clear
= ! const_bounds_p
;
5121 /* This loop is a more accurate version of the loop in
5122 mostly_zeros_p (it handles RANGE_EXPR in an index).
5123 It is also needed to check for missing elements. */
5124 for (elt
= CONSTRUCTOR_ELTS (exp
);
5125 elt
!= NULL_TREE
&& ! need_to_clear
;
5126 elt
= TREE_CHAIN (elt
))
5128 tree index
= TREE_PURPOSE (elt
);
5129 HOST_WIDE_INT this_node_count
;
5131 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5133 tree lo_index
= TREE_OPERAND (index
, 0);
5134 tree hi_index
= TREE_OPERAND (index
, 1);
5136 if (! host_integerp (lo_index
, 1)
5137 || ! host_integerp (hi_index
, 1))
5143 this_node_count
= (tree_low_cst (hi_index
, 1)
5144 - tree_low_cst (lo_index
, 1) + 1);
5147 this_node_count
= 1;
5149 count
+= this_node_count
;
5150 if (mostly_zeros_p (TREE_VALUE (elt
)))
5151 zero_count
+= this_node_count
;
5154 /* Clear the entire array first if there are any missing elements,
5155 or if the incidence of zero elements is >= 75%. */
5157 && (count
< maxelt
- minelt
+ 1 || 4 * zero_count
>= 3 * count
))
5161 if (need_to_clear
&& size
> 0)
5166 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5168 clear_storage (target
, GEN_INT (size
));
5172 else if (REG_P (target
))
5173 /* Inform later passes that the old value is dead. */
5174 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
5176 /* Store each element of the constructor into
5177 the corresponding element of TARGET, determined
5178 by counting the elements. */
5179 for (elt
= CONSTRUCTOR_ELTS (exp
), i
= 0;
5181 elt
= TREE_CHAIN (elt
), i
++)
5183 enum machine_mode mode
;
5184 HOST_WIDE_INT bitsize
;
5185 HOST_WIDE_INT bitpos
;
5187 tree value
= TREE_VALUE (elt
);
5188 tree index
= TREE_PURPOSE (elt
);
5189 rtx xtarget
= target
;
5191 if (cleared
&& is_zeros_p (value
))
5194 unsignedp
= TREE_UNSIGNED (elttype
);
5195 mode
= TYPE_MODE (elttype
);
5196 if (mode
== BLKmode
)
5197 bitsize
= (host_integerp (TYPE_SIZE (elttype
), 1)
5198 ? tree_low_cst (TYPE_SIZE (elttype
), 1)
5201 bitsize
= GET_MODE_BITSIZE (mode
);
5203 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5205 tree lo_index
= TREE_OPERAND (index
, 0);
5206 tree hi_index
= TREE_OPERAND (index
, 1);
5207 rtx index_r
, pos_rtx
, loop_end
;
5208 struct nesting
*loop
;
5209 HOST_WIDE_INT lo
, hi
, count
;
5212 /* If the range is constant and "small", unroll the loop. */
5214 && host_integerp (lo_index
, 0)
5215 && host_integerp (hi_index
, 0)
5216 && (lo
= tree_low_cst (lo_index
, 0),
5217 hi
= tree_low_cst (hi_index
, 0),
5218 count
= hi
- lo
+ 1,
5219 (GET_CODE (target
) != MEM
5221 || (host_integerp (TYPE_SIZE (elttype
), 1)
5222 && (tree_low_cst (TYPE_SIZE (elttype
), 1) * count
5225 lo
-= minelt
; hi
-= minelt
;
5226 for (; lo
<= hi
; lo
++)
5228 bitpos
= lo
* tree_low_cst (TYPE_SIZE (elttype
), 0);
5230 if (GET_CODE (target
) == MEM
5231 && !MEM_KEEP_ALIAS_SET_P (target
)
5232 && TREE_CODE (type
) == ARRAY_TYPE
5233 && TYPE_NONALIASED_COMPONENT (type
))
5235 target
= copy_rtx (target
);
5236 MEM_KEEP_ALIAS_SET_P (target
) = 1;
5239 store_constructor_field
5240 (target
, bitsize
, bitpos
, mode
, value
, type
, cleared
,
5241 get_alias_set (elttype
));
5246 expand_expr (hi_index
, NULL_RTX
, VOIDmode
, 0);
5247 loop_end
= gen_label_rtx ();
5249 unsignedp
= TREE_UNSIGNED (domain
);
5251 index
= build_decl (VAR_DECL
, NULL_TREE
, domain
);
5254 = gen_reg_rtx (promote_mode (domain
, DECL_MODE (index
),
5256 SET_DECL_RTL (index
, index_r
);
5257 if (TREE_CODE (value
) == SAVE_EXPR
5258 && SAVE_EXPR_RTL (value
) == 0)
5260 /* Make sure value gets expanded once before the
5262 expand_expr (value
, const0_rtx
, VOIDmode
, 0);
5265 store_expr (lo_index
, index_r
, 0);
5266 loop
= expand_start_loop (0);
5268 /* Assign value to element index. */
5270 = convert (ssizetype
,
5271 fold (build (MINUS_EXPR
, TREE_TYPE (index
),
5272 index
, TYPE_MIN_VALUE (domain
))));
5273 position
= size_binop (MULT_EXPR
, position
,
5275 TYPE_SIZE_UNIT (elttype
)));
5277 pos_rtx
= expand_expr (position
, 0, VOIDmode
, 0);
5278 xtarget
= offset_address (target
, pos_rtx
,
5279 highest_pow2_factor (position
));
5280 xtarget
= adjust_address (xtarget
, mode
, 0);
5281 if (TREE_CODE (value
) == CONSTRUCTOR
)
5282 store_constructor (value
, xtarget
, cleared
,
5283 bitsize
/ BITS_PER_UNIT
);
5285 store_expr (value
, xtarget
, 0);
5287 expand_exit_loop_if_false (loop
,
5288 build (LT_EXPR
, integer_type_node
,
5291 expand_increment (build (PREINCREMENT_EXPR
,
5293 index
, integer_one_node
), 0, 0);
5295 emit_label (loop_end
);
5298 else if ((index
!= 0 && ! host_integerp (index
, 0))
5299 || ! host_integerp (TYPE_SIZE (elttype
), 1))
5304 index
= ssize_int (1);
5307 index
= convert (ssizetype
,
5308 fold (build (MINUS_EXPR
, index
,
5309 TYPE_MIN_VALUE (domain
))));
5311 position
= size_binop (MULT_EXPR
, index
,
5313 TYPE_SIZE_UNIT (elttype
)));
5314 xtarget
= offset_address (target
,
5315 expand_expr (position
, 0, VOIDmode
, 0),
5316 highest_pow2_factor (position
));
5317 xtarget
= adjust_address (xtarget
, mode
, 0);
5318 store_expr (value
, xtarget
, 0);
5323 bitpos
= ((tree_low_cst (index
, 0) - minelt
)
5324 * tree_low_cst (TYPE_SIZE (elttype
), 1));
5326 bitpos
= (i
* tree_low_cst (TYPE_SIZE (elttype
), 1));
5328 if (GET_CODE (target
) == MEM
&& !MEM_KEEP_ALIAS_SET_P (target
)
5329 && TREE_CODE (type
) == ARRAY_TYPE
5330 && TYPE_NONALIASED_COMPONENT (type
))
5332 target
= copy_rtx (target
);
5333 MEM_KEEP_ALIAS_SET_P (target
) = 1;
5336 store_constructor_field (target
, bitsize
, bitpos
, mode
, value
,
5337 type
, cleared
, get_alias_set (elttype
));
5343 /* Set constructor assignments. */
5344 else if (TREE_CODE (type
) == SET_TYPE
)
5346 tree elt
= CONSTRUCTOR_ELTS (exp
);
5347 unsigned HOST_WIDE_INT nbytes
= int_size_in_bytes (type
), nbits
;
5348 tree domain
= TYPE_DOMAIN (type
);
5349 tree domain_min
, domain_max
, bitlength
;
5351 /* The default implementation strategy is to extract the constant
5352 parts of the constructor, use that to initialize the target,
5353 and then "or" in whatever non-constant ranges we need in addition.
5355 If a large set is all zero or all ones, it is
5356 probably better to set it using memset (if available) or bzero.
5357 Also, if a large set has just a single range, it may also be
5358 better to first clear all the first clear the set (using
5359 bzero/memset), and set the bits we want. */
5361 /* Check for all zeros. */
5362 if (elt
== NULL_TREE
&& size
> 0)
5365 clear_storage (target
, GEN_INT (size
));
5369 domain_min
= convert (sizetype
, TYPE_MIN_VALUE (domain
));
5370 domain_max
= convert (sizetype
, TYPE_MAX_VALUE (domain
));
5371 bitlength
= size_binop (PLUS_EXPR
,
5372 size_diffop (domain_max
, domain_min
),
5375 nbits
= tree_low_cst (bitlength
, 1);
5377 /* For "small" sets, or "medium-sized" (up to 32 bytes) sets that
5378 are "complicated" (more than one range), initialize (the
5379 constant parts) by copying from a constant. */
5380 if (GET_MODE (target
) != BLKmode
|| nbits
<= 2 * BITS_PER_WORD
5381 || (nbytes
<= 32 && TREE_CHAIN (elt
) != NULL_TREE
))
5383 unsigned int set_word_size
= TYPE_ALIGN (TREE_TYPE (exp
));
5384 enum machine_mode mode
= mode_for_size (set_word_size
, MODE_INT
, 1);
5385 char *bit_buffer
= (char *) alloca (nbits
);
5386 HOST_WIDE_INT word
= 0;
5387 unsigned int bit_pos
= 0;
5388 unsigned int ibit
= 0;
5389 unsigned int offset
= 0; /* In bytes from beginning of set. */
5391 elt
= get_set_constructor_bits (exp
, bit_buffer
, nbits
);
5394 if (bit_buffer
[ibit
])
5396 if (BYTES_BIG_ENDIAN
)
5397 word
|= (1 << (set_word_size
- 1 - bit_pos
));
5399 word
|= 1 << bit_pos
;
5403 if (bit_pos
>= set_word_size
|| ibit
== nbits
)
5405 if (word
!= 0 || ! cleared
)
5407 rtx datum
= GEN_INT (word
);
5410 /* The assumption here is that it is safe to use
5411 XEXP if the set is multi-word, but not if
5412 it's single-word. */
5413 if (GET_CODE (target
) == MEM
)
5414 to_rtx
= adjust_address (target
, mode
, offset
);
5415 else if (offset
== 0)
5419 emit_move_insn (to_rtx
, datum
);
5426 offset
+= set_word_size
/ BITS_PER_UNIT
;
5431 /* Don't bother clearing storage if the set is all ones. */
5432 if (TREE_CHAIN (elt
) != NULL_TREE
5433 || (TREE_PURPOSE (elt
) == NULL_TREE
5435 : ( ! host_integerp (TREE_VALUE (elt
), 0)
5436 || ! host_integerp (TREE_PURPOSE (elt
), 0)
5437 || (tree_low_cst (TREE_VALUE (elt
), 0)
5438 - tree_low_cst (TREE_PURPOSE (elt
), 0) + 1
5439 != (HOST_WIDE_INT
) nbits
))))
5440 clear_storage (target
, expr_size (exp
));
5442 for (; elt
!= NULL_TREE
; elt
= TREE_CHAIN (elt
))
5444 /* Start of range of element or NULL. */
5445 tree startbit
= TREE_PURPOSE (elt
);
5446 /* End of range of element, or element value. */
5447 tree endbit
= TREE_VALUE (elt
);
5448 HOST_WIDE_INT startb
, endb
;
5449 rtx bitlength_rtx
, startbit_rtx
, endbit_rtx
, targetx
;
5451 bitlength_rtx
= expand_expr (bitlength
,
5452 NULL_RTX
, MEM
, EXPAND_CONST_ADDRESS
);
5454 /* Handle non-range tuple element like [ expr ]. */
5455 if (startbit
== NULL_TREE
)
5457 startbit
= save_expr (endbit
);
5461 startbit
= convert (sizetype
, startbit
);
5462 endbit
= convert (sizetype
, endbit
);
5463 if (! integer_zerop (domain_min
))
5465 startbit
= size_binop (MINUS_EXPR
, startbit
, domain_min
);
5466 endbit
= size_binop (MINUS_EXPR
, endbit
, domain_min
);
5468 startbit_rtx
= expand_expr (startbit
, NULL_RTX
, MEM
,
5469 EXPAND_CONST_ADDRESS
);
5470 endbit_rtx
= expand_expr (endbit
, NULL_RTX
, MEM
,
5471 EXPAND_CONST_ADDRESS
);
5477 ((build_qualified_type ((*lang_hooks
.types
.type_for_mode
)
5478 (GET_MODE (target
), 0),
5481 emit_move_insn (targetx
, target
);
5484 else if (GET_CODE (target
) == MEM
)
5489 /* Optimization: If startbit and endbit are constants divisible
5490 by BITS_PER_UNIT, call memset instead. */
5491 if (TARGET_MEM_FUNCTIONS
5492 && TREE_CODE (startbit
) == INTEGER_CST
5493 && TREE_CODE (endbit
) == INTEGER_CST
5494 && (startb
= TREE_INT_CST_LOW (startbit
)) % BITS_PER_UNIT
== 0
5495 && (endb
= TREE_INT_CST_LOW (endbit
) + 1) % BITS_PER_UNIT
== 0)
5497 emit_library_call (memset_libfunc
, LCT_NORMAL
,
5499 plus_constant (XEXP (targetx
, 0),
5500 startb
/ BITS_PER_UNIT
),
5502 constm1_rtx
, TYPE_MODE (integer_type_node
),
5503 GEN_INT ((endb
- startb
) / BITS_PER_UNIT
),
5504 TYPE_MODE (sizetype
));
5507 emit_library_call (setbits_libfunc
, LCT_NORMAL
,
5508 VOIDmode
, 4, XEXP (targetx
, 0),
5509 Pmode
, bitlength_rtx
, TYPE_MODE (sizetype
),
5510 startbit_rtx
, TYPE_MODE (sizetype
),
5511 endbit_rtx
, TYPE_MODE (sizetype
));
5514 emit_move_insn (target
, targetx
);
5522 /* Store the value of EXP (an expression tree)
5523 into a subfield of TARGET which has mode MODE and occupies
5524 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5525 If MODE is VOIDmode, it means that we are storing into a bit-field.
5527 If VALUE_MODE is VOIDmode, return nothing in particular.
5528 UNSIGNEDP is not used in this case.
5530 Otherwise, return an rtx for the value stored. This rtx
5531 has mode VALUE_MODE if that is convenient to do.
5532 In this case, UNSIGNEDP must be nonzero if the value is an unsigned type.
5534 TYPE is the type of the underlying object,
5536 ALIAS_SET is the alias set for the destination. This value will
5537 (in general) be different from that for TARGET, since TARGET is a
5538 reference to the containing structure. */
5541 store_field (target
, bitsize
, bitpos
, mode
, exp
, value_mode
, unsignedp
, type
,
5544 HOST_WIDE_INT bitsize
;
5545 HOST_WIDE_INT bitpos
;
5546 enum machine_mode mode
;
5548 enum machine_mode value_mode
;
5553 HOST_WIDE_INT width_mask
= 0;
5555 if (TREE_CODE (exp
) == ERROR_MARK
)
5558 /* If we have nothing to store, do nothing unless the expression has
5561 return expand_expr (exp
, const0_rtx
, VOIDmode
, 0);
5562 else if (bitsize
>= 0 && bitsize
< HOST_BITS_PER_WIDE_INT
)
5563 width_mask
= ((HOST_WIDE_INT
) 1 << bitsize
) - 1;
5565 /* If we are storing into an unaligned field of an aligned union that is
5566 in a register, we may have the mode of TARGET being an integer mode but
5567 MODE == BLKmode. In that case, get an aligned object whose size and
5568 alignment are the same as TARGET and store TARGET into it (we can avoid
5569 the store if the field being stored is the entire width of TARGET). Then
5570 call ourselves recursively to store the field into a BLKmode version of
5571 that object. Finally, load from the object into TARGET. This is not
5572 very efficient in general, but should only be slightly more expensive
5573 than the otherwise-required unaligned accesses. Perhaps this can be
5574 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5575 twice, once with emit_move_insn and once via store_field. */
5578 && (GET_CODE (target
) == REG
|| GET_CODE (target
) == SUBREG
))
5580 rtx object
= assign_temp (type
, 0, 1, 1);
5581 rtx blk_object
= adjust_address (object
, BLKmode
, 0);
5583 if (bitsize
!= (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (target
)))
5584 emit_move_insn (object
, target
);
5586 store_field (blk_object
, bitsize
, bitpos
, mode
, exp
, VOIDmode
, 0, type
,
5589 emit_move_insn (target
, object
);
5591 /* We want to return the BLKmode version of the data. */
5595 if (GET_CODE (target
) == CONCAT
)
5597 /* We're storing into a struct containing a single __complex. */
5601 return store_expr (exp
, target
, 0);
5604 /* If the structure is in a register or if the component
5605 is a bit field, we cannot use addressing to access it.
5606 Use bit-field techniques or SUBREG to store in it. */
5608 if (mode
== VOIDmode
5609 || (mode
!= BLKmode
&& ! direct_store
[(int) mode
]
5610 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
5611 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
5612 || GET_CODE (target
) == REG
5613 || GET_CODE (target
) == SUBREG
5614 /* If the field isn't aligned enough to store as an ordinary memref,
5615 store it as a bit field. */
5617 && ((SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (target
))
5618 && (MEM_ALIGN (target
) < GET_MODE_ALIGNMENT (mode
)))
5619 || bitpos
% GET_MODE_ALIGNMENT (mode
)))
5620 /* If the RHS and field are a constant size and the size of the
5621 RHS isn't the same size as the bitfield, we must use bitfield
5624 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
5625 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)), bitsize
) != 0))
5627 rtx temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, 0);
5629 /* If BITSIZE is narrower than the size of the type of EXP
5630 we will be narrowing TEMP. Normally, what's wanted are the
5631 low-order bits. However, if EXP's type is a record and this is
5632 big-endian machine, we want the upper BITSIZE bits. */
5633 if (BYTES_BIG_ENDIAN
&& GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
5634 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (temp
))
5635 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
5636 temp
= expand_shift (RSHIFT_EXPR
, GET_MODE (temp
), temp
,
5637 size_int (GET_MODE_BITSIZE (GET_MODE (temp
))
5641 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5643 if (mode
!= VOIDmode
&& mode
!= BLKmode
5644 && mode
!= TYPE_MODE (TREE_TYPE (exp
)))
5645 temp
= convert_modes (mode
, TYPE_MODE (TREE_TYPE (exp
)), temp
, 1);
5647 /* If the modes of TARGET and TEMP are both BLKmode, both
5648 must be in memory and BITPOS must be aligned on a byte
5649 boundary. If so, we simply do a block copy. */
5650 if (GET_MODE (target
) == BLKmode
&& GET_MODE (temp
) == BLKmode
)
5652 if (GET_CODE (target
) != MEM
|| GET_CODE (temp
) != MEM
5653 || bitpos
% BITS_PER_UNIT
!= 0)
5656 target
= adjust_address (target
, VOIDmode
, bitpos
/ BITS_PER_UNIT
);
5657 emit_block_move (target
, temp
,
5658 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
5662 return value_mode
== VOIDmode
? const0_rtx
: target
;
5665 /* Store the value in the bitfield. */
5666 store_bit_field (target
, bitsize
, bitpos
, mode
, temp
,
5667 int_size_in_bytes (type
));
5669 if (value_mode
!= VOIDmode
)
5671 /* The caller wants an rtx for the value.
5672 If possible, avoid refetching from the bitfield itself. */
5674 && ! (GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
)))
5677 enum machine_mode tmode
;
5679 tmode
= GET_MODE (temp
);
5680 if (tmode
== VOIDmode
)
5684 return expand_and (tmode
, temp
,
5685 gen_int_mode (width_mask
, tmode
),
5688 count
= build_int_2 (GET_MODE_BITSIZE (tmode
) - bitsize
, 0);
5689 temp
= expand_shift (LSHIFT_EXPR
, tmode
, temp
, count
, 0, 0);
5690 return expand_shift (RSHIFT_EXPR
, tmode
, temp
, count
, 0, 0);
5693 return extract_bit_field (target
, bitsize
, bitpos
, unsignedp
,
5694 NULL_RTX
, value_mode
, VOIDmode
,
5695 int_size_in_bytes (type
));
5701 rtx addr
= XEXP (target
, 0);
5702 rtx to_rtx
= target
;
5704 /* If a value is wanted, it must be the lhs;
5705 so make the address stable for multiple use. */
5707 if (value_mode
!= VOIDmode
&& GET_CODE (addr
) != REG
5708 && ! CONSTANT_ADDRESS_P (addr
)
5709 /* A frame-pointer reference is already stable. */
5710 && ! (GET_CODE (addr
) == PLUS
5711 && GET_CODE (XEXP (addr
, 1)) == CONST_INT
5712 && (XEXP (addr
, 0) == virtual_incoming_args_rtx
5713 || XEXP (addr
, 0) == virtual_stack_vars_rtx
)))
5714 to_rtx
= replace_equiv_address (to_rtx
, copy_to_reg (addr
));
5716 /* Now build a reference to just the desired component. */
5718 to_rtx
= adjust_address (target
, mode
, bitpos
/ BITS_PER_UNIT
);
5720 if (to_rtx
== target
)
5721 to_rtx
= copy_rtx (to_rtx
);
5723 MEM_SET_IN_STRUCT_P (to_rtx
, 1);
5724 if (!MEM_KEEP_ALIAS_SET_P (to_rtx
) && MEM_ALIAS_SET (to_rtx
) != 0)
5725 set_mem_alias_set (to_rtx
, alias_set
);
5727 return store_expr (exp
, to_rtx
, value_mode
!= VOIDmode
);
5731 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5732 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5733 codes and find the ultimate containing object, which we return.
5735 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5736 bit position, and *PUNSIGNEDP to the signedness of the field.
5737 If the position of the field is variable, we store a tree
5738 giving the variable offset (in units) in *POFFSET.
5739 This offset is in addition to the bit position.
5740 If the position is not variable, we store 0 in *POFFSET.
5742 If any of the extraction expressions is volatile,
5743 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5745 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5746 is a mode that can be used to access the field. In that case, *PBITSIZE
5749 If the field describes a variable-sized object, *PMODE is set to
5750 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5751 this case, but the address of the object can be found. */
5754 get_inner_reference (exp
, pbitsize
, pbitpos
, poffset
, pmode
,
5755 punsignedp
, pvolatilep
)
5757 HOST_WIDE_INT
*pbitsize
;
5758 HOST_WIDE_INT
*pbitpos
;
5760 enum machine_mode
*pmode
;
5765 enum machine_mode mode
= VOIDmode
;
5766 tree offset
= size_zero_node
;
5767 tree bit_offset
= bitsize_zero_node
;
5768 tree placeholder_ptr
= 0;
5771 /* First get the mode, signedness, and size. We do this from just the
5772 outermost expression. */
5773 if (TREE_CODE (exp
) == COMPONENT_REF
)
5775 size_tree
= DECL_SIZE (TREE_OPERAND (exp
, 1));
5776 if (! DECL_BIT_FIELD (TREE_OPERAND (exp
, 1)))
5777 mode
= DECL_MODE (TREE_OPERAND (exp
, 1));
5779 *punsignedp
= TREE_UNSIGNED (TREE_OPERAND (exp
, 1));
5781 else if (TREE_CODE (exp
) == BIT_FIELD_REF
)
5783 size_tree
= TREE_OPERAND (exp
, 1);
5784 *punsignedp
= TREE_UNSIGNED (exp
);
5788 mode
= TYPE_MODE (TREE_TYPE (exp
));
5789 *punsignedp
= TREE_UNSIGNED (TREE_TYPE (exp
));
5791 if (mode
== BLKmode
)
5792 size_tree
= TYPE_SIZE (TREE_TYPE (exp
));
5794 *pbitsize
= GET_MODE_BITSIZE (mode
);
5799 if (! host_integerp (size_tree
, 1))
5800 mode
= BLKmode
, *pbitsize
= -1;
5802 *pbitsize
= tree_low_cst (size_tree
, 1);
5805 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5806 and find the ultimate containing object. */
5809 if (TREE_CODE (exp
) == BIT_FIELD_REF
)
5810 bit_offset
= size_binop (PLUS_EXPR
, bit_offset
, TREE_OPERAND (exp
, 2));
5811 else if (TREE_CODE (exp
) == COMPONENT_REF
)
5813 tree field
= TREE_OPERAND (exp
, 1);
5814 tree this_offset
= DECL_FIELD_OFFSET (field
);
5816 /* If this field hasn't been filled in yet, don't go
5817 past it. This should only happen when folding expressions
5818 made during type construction. */
5819 if (this_offset
== 0)
5821 else if (! TREE_CONSTANT (this_offset
)
5822 && contains_placeholder_p (this_offset
))
5823 this_offset
= build (WITH_RECORD_EXPR
, sizetype
, this_offset
, exp
);
5825 offset
= size_binop (PLUS_EXPR
, offset
, this_offset
);
5826 bit_offset
= size_binop (PLUS_EXPR
, bit_offset
,
5827 DECL_FIELD_BIT_OFFSET (field
));
5829 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5832 else if (TREE_CODE (exp
) == ARRAY_REF
5833 || TREE_CODE (exp
) == ARRAY_RANGE_REF
)
5835 tree index
= TREE_OPERAND (exp
, 1);
5836 tree array
= TREE_OPERAND (exp
, 0);
5837 tree domain
= TYPE_DOMAIN (TREE_TYPE (array
));
5838 tree low_bound
= (domain
? TYPE_MIN_VALUE (domain
) : 0);
5839 tree unit_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (array
)));
5841 /* We assume all arrays have sizes that are a multiple of a byte.
5842 First subtract the lower bound, if any, in the type of the
5843 index, then convert to sizetype and multiply by the size of the
5845 if (low_bound
!= 0 && ! integer_zerop (low_bound
))
5846 index
= fold (build (MINUS_EXPR
, TREE_TYPE (index
),
5849 /* If the index has a self-referential type, pass it to a
5850 WITH_RECORD_EXPR; if the component size is, pass our
5851 component to one. */
5852 if (! TREE_CONSTANT (index
)
5853 && contains_placeholder_p (index
))
5854 index
= build (WITH_RECORD_EXPR
, TREE_TYPE (index
), index
, exp
);
5855 if (! TREE_CONSTANT (unit_size
)
5856 && contains_placeholder_p (unit_size
))
5857 unit_size
= build (WITH_RECORD_EXPR
, sizetype
, unit_size
, array
);
5859 offset
= size_binop (PLUS_EXPR
, offset
,
5860 size_binop (MULT_EXPR
,
5861 convert (sizetype
, index
),
5865 else if (TREE_CODE (exp
) == PLACEHOLDER_EXPR
)
5867 tree
new = find_placeholder (exp
, &placeholder_ptr
);
5869 /* If we couldn't find the replacement, return the PLACEHOLDER_EXPR.
5870 We might have been called from tree optimization where we
5871 haven't set up an object yet. */
5879 else if (TREE_CODE (exp
) != NON_LVALUE_EXPR
5880 && TREE_CODE (exp
) != VIEW_CONVERT_EXPR
5881 && ! ((TREE_CODE (exp
) == NOP_EXPR
5882 || TREE_CODE (exp
) == CONVERT_EXPR
)
5883 && (TYPE_MODE (TREE_TYPE (exp
))
5884 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))))))
5887 /* If any reference in the chain is volatile, the effect is volatile. */
5888 if (TREE_THIS_VOLATILE (exp
))
5891 exp
= TREE_OPERAND (exp
, 0);
5894 /* If OFFSET is constant, see if we can return the whole thing as a
5895 constant bit position. Otherwise, split it up. */
5896 if (host_integerp (offset
, 0)
5897 && 0 != (tem
= size_binop (MULT_EXPR
, convert (bitsizetype
, offset
),
5899 && 0 != (tem
= size_binop (PLUS_EXPR
, tem
, bit_offset
))
5900 && host_integerp (tem
, 0))
5901 *pbitpos
= tree_low_cst (tem
, 0), *poffset
= 0;
5903 *pbitpos
= tree_low_cst (bit_offset
, 0), *poffset
= offset
;
5909 /* Return 1 if T is an expression that get_inner_reference handles. */
5912 handled_component_p (t
)
5915 switch (TREE_CODE (t
))
5920 case ARRAY_RANGE_REF
:
5921 case NON_LVALUE_EXPR
:
5922 case VIEW_CONVERT_EXPR
:
5927 return (TYPE_MODE (TREE_TYPE (t
))
5928 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (t
, 0))));
5935 /* Given an rtx VALUE that may contain additions and multiplications, return
5936 an equivalent value that just refers to a register, memory, or constant.
5937 This is done by generating instructions to perform the arithmetic and
5938 returning a pseudo-register containing the value.
5940 The returned value may be a REG, SUBREG, MEM or constant. */
5943 force_operand (value
, target
)
5947 /* Use subtarget as the target for operand 0 of a binary operation. */
5948 rtx subtarget
= get_subtarget (target
);
5949 enum rtx_code code
= GET_CODE (value
);
5951 /* Check for a PIC address load. */
5952 if ((code
== PLUS
|| code
== MINUS
)
5953 && XEXP (value
, 0) == pic_offset_table_rtx
5954 && (GET_CODE (XEXP (value
, 1)) == SYMBOL_REF
5955 || GET_CODE (XEXP (value
, 1)) == LABEL_REF
5956 || GET_CODE (XEXP (value
, 1)) == CONST
))
5959 subtarget
= gen_reg_rtx (GET_MODE (value
));
5960 emit_move_insn (subtarget
, value
);
5964 if (code
== ZERO_EXTEND
|| code
== SIGN_EXTEND
)
5967 target
= gen_reg_rtx (GET_MODE (value
));
5968 convert_move (target
, force_operand (XEXP (value
, 0), NULL
),
5969 code
== ZERO_EXTEND
);
5973 if (GET_RTX_CLASS (code
) == '2' || GET_RTX_CLASS (code
) == 'c')
5975 op2
= XEXP (value
, 1);
5976 if (!CONSTANT_P (op2
) && !(GET_CODE (op2
) == REG
&& op2
!= subtarget
))
5978 if (code
== MINUS
&& GET_CODE (op2
) == CONST_INT
)
5981 op2
= negate_rtx (GET_MODE (value
), op2
);
5984 /* Check for an addition with OP2 a constant integer and our first
5985 operand a PLUS of a virtual register and something else. In that
5986 case, we want to emit the sum of the virtual register and the
5987 constant first and then add the other value. This allows virtual
5988 register instantiation to simply modify the constant rather than
5989 creating another one around this addition. */
5990 if (code
== PLUS
&& GET_CODE (op2
) == CONST_INT
5991 && GET_CODE (XEXP (value
, 0)) == PLUS
5992 && GET_CODE (XEXP (XEXP (value
, 0), 0)) == REG
5993 && REGNO (XEXP (XEXP (value
, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5994 && REGNO (XEXP (XEXP (value
, 0), 0)) <= LAST_VIRTUAL_REGISTER
)
5996 rtx temp
= expand_simple_binop (GET_MODE (value
), code
,
5997 XEXP (XEXP (value
, 0), 0), op2
,
5998 subtarget
, 0, OPTAB_LIB_WIDEN
);
5999 return expand_simple_binop (GET_MODE (value
), code
, temp
,
6000 force_operand (XEXP (XEXP (value
,
6002 target
, 0, OPTAB_LIB_WIDEN
);
6005 op1
= force_operand (XEXP (value
, 0), subtarget
);
6006 op2
= force_operand (op2
, NULL_RTX
);
6010 return expand_mult (GET_MODE (value
), op1
, op2
, target
, 1);
6012 if (!INTEGRAL_MODE_P (GET_MODE (value
)))
6013 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6014 target
, 1, OPTAB_LIB_WIDEN
);
6016 return expand_divmod (0,
6017 FLOAT_MODE_P (GET_MODE (value
))
6018 ? RDIV_EXPR
: TRUNC_DIV_EXPR
,
6019 GET_MODE (value
), op1
, op2
, target
, 0);
6022 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
6026 return expand_divmod (0, TRUNC_DIV_EXPR
, GET_MODE (value
), op1
, op2
,
6030 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
6034 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6035 target
, 0, OPTAB_LIB_WIDEN
);
6038 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6039 target
, 1, OPTAB_LIB_WIDEN
);
6042 if (GET_RTX_CLASS (code
) == '1')
6044 op1
= force_operand (XEXP (value
, 0), NULL_RTX
);
6045 return expand_simple_unop (GET_MODE (value
), code
, op1
, target
, 0);
6048 #ifdef INSN_SCHEDULING
6049 /* On machines that have insn scheduling, we want all memory reference to be
6050 explicit, so we need to deal with such paradoxical SUBREGs. */
6051 if (GET_CODE (value
) == SUBREG
&& GET_CODE (SUBREG_REG (value
)) == MEM
6052 && (GET_MODE_SIZE (GET_MODE (value
))
6053 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value
)))))
6055 = simplify_gen_subreg (GET_MODE (value
),
6056 force_reg (GET_MODE (SUBREG_REG (value
)),
6057 force_operand (SUBREG_REG (value
),
6059 GET_MODE (SUBREG_REG (value
)),
6060 SUBREG_BYTE (value
));
6066 /* Subroutine of expand_expr: return nonzero iff there is no way that
6067 EXP can reference X, which is being modified. TOP_P is nonzero if this
6068 call is going to be used to determine whether we need a temporary
6069 for EXP, as opposed to a recursive call to this function.
6071 It is always safe for this routine to return zero since it merely
6072 searches for optimization opportunities. */
6075 safe_from_p (x
, exp
, top_p
)
6082 static tree save_expr_list
;
6085 /* If EXP has varying size, we MUST use a target since we currently
6086 have no way of allocating temporaries of variable size
6087 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6088 So we assume here that something at a higher level has prevented a
6089 clash. This is somewhat bogus, but the best we can do. Only
6090 do this when X is BLKmode and when we are at the top level. */
6091 || (top_p
&& TREE_TYPE (exp
) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp
))
6092 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) != INTEGER_CST
6093 && (TREE_CODE (TREE_TYPE (exp
)) != ARRAY_TYPE
6094 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)) == NULL_TREE
6095 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)))
6097 && GET_MODE (x
) == BLKmode
)
6098 /* If X is in the outgoing argument area, it is always safe. */
6099 || (GET_CODE (x
) == MEM
6100 && (XEXP (x
, 0) == virtual_outgoing_args_rtx
6101 || (GET_CODE (XEXP (x
, 0)) == PLUS
6102 && XEXP (XEXP (x
, 0), 0) == virtual_outgoing_args_rtx
))))
6105 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6106 find the underlying pseudo. */
6107 if (GET_CODE (x
) == SUBREG
)
6110 if (GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6114 /* A SAVE_EXPR might appear many times in the expression passed to the
6115 top-level safe_from_p call, and if it has a complex subexpression,
6116 examining it multiple times could result in a combinatorial explosion.
6117 E.g. on an Alpha running at least 200MHz, a Fortran test case compiled
6118 with optimization took about 28 minutes to compile -- even though it was
6119 only a few lines long. So we mark each SAVE_EXPR we see with TREE_PRIVATE
6120 and turn that off when we are done. We keep a list of the SAVE_EXPRs
6121 we have processed. Note that the only test of top_p was above. */
6130 rtn
= safe_from_p (x
, exp
, 0);
6132 for (t
= save_expr_list
; t
!= 0; t
= TREE_CHAIN (t
))
6133 TREE_PRIVATE (TREE_PURPOSE (t
)) = 0;
6138 /* Now look at our tree code and possibly recurse. */
6139 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
6142 exp_rtl
= DECL_RTL_IF_SET (exp
);
6149 if (TREE_CODE (exp
) == TREE_LIST
)
6153 if (TREE_VALUE (exp
) && !safe_from_p (x
, TREE_VALUE (exp
), 0))
6155 exp
= TREE_CHAIN (exp
);
6158 if (TREE_CODE (exp
) != TREE_LIST
)
6159 return safe_from_p (x
, exp
, 0);
6162 else if (TREE_CODE (exp
) == ERROR_MARK
)
6163 return 1; /* An already-visited SAVE_EXPR? */
6169 if (!safe_from_p (x
, TREE_OPERAND (exp
, 1), 0))
6174 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
6178 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6179 the expression. If it is set, we conflict iff we are that rtx or
6180 both are in memory. Otherwise, we check all operands of the
6181 expression recursively. */
6183 switch (TREE_CODE (exp
))
6186 /* If the operand is static or we are static, we can't conflict.
6187 Likewise if we don't conflict with the operand at all. */
6188 if (staticp (TREE_OPERAND (exp
, 0))
6189 || TREE_STATIC (exp
)
6190 || safe_from_p (x
, TREE_OPERAND (exp
, 0), 0))
6193 /* Otherwise, the only way this can conflict is if we are taking
6194 the address of a DECL a that address if part of X, which is
6196 exp
= TREE_OPERAND (exp
, 0);
6199 if (!DECL_RTL_SET_P (exp
)
6200 || GET_CODE (DECL_RTL (exp
)) != MEM
)
6203 exp_rtl
= XEXP (DECL_RTL (exp
), 0);
6208 if (GET_CODE (x
) == MEM
6209 && alias_sets_conflict_p (MEM_ALIAS_SET (x
),
6210 get_alias_set (exp
)))
6215 /* Assume that the call will clobber all hard registers and
6217 if ((GET_CODE (x
) == REG
&& REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6218 || GET_CODE (x
) == MEM
)
6223 /* If a sequence exists, we would have to scan every instruction
6224 in the sequence to see if it was safe. This is probably not
6226 if (RTL_EXPR_SEQUENCE (exp
))
6229 exp_rtl
= RTL_EXPR_RTL (exp
);
6232 case WITH_CLEANUP_EXPR
:
6233 exp_rtl
= WITH_CLEANUP_EXPR_RTL (exp
);
6236 case CLEANUP_POINT_EXPR
:
6237 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
6240 exp_rtl
= SAVE_EXPR_RTL (exp
);
6244 /* If we've already scanned this, don't do it again. Otherwise,
6245 show we've scanned it and record for clearing the flag if we're
6247 if (TREE_PRIVATE (exp
))
6250 TREE_PRIVATE (exp
) = 1;
6251 if (! safe_from_p (x
, TREE_OPERAND (exp
, 0), 0))
6253 TREE_PRIVATE (exp
) = 0;
6257 save_expr_list
= tree_cons (exp
, NULL_TREE
, save_expr_list
);
6261 /* The only operand we look at is operand 1. The rest aren't
6262 part of the expression. */
6263 return safe_from_p (x
, TREE_OPERAND (exp
, 1), 0);
6265 case METHOD_CALL_EXPR
:
6266 /* This takes an rtx argument, but shouldn't appear here. */
6273 /* If we have an rtx, we do not need to scan our operands. */
6277 nops
= first_rtl_op (TREE_CODE (exp
));
6278 for (i
= 0; i
< nops
; i
++)
6279 if (TREE_OPERAND (exp
, i
) != 0
6280 && ! safe_from_p (x
, TREE_OPERAND (exp
, i
), 0))
6283 /* If this is a language-specific tree code, it may require
6284 special handling. */
6285 if ((unsigned int) TREE_CODE (exp
)
6286 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
6287 && !(*lang_hooks
.safe_from_p
) (x
, exp
))
6291 /* If we have an rtl, find any enclosed object. Then see if we conflict
6295 if (GET_CODE (exp_rtl
) == SUBREG
)
6297 exp_rtl
= SUBREG_REG (exp_rtl
);
6298 if (GET_CODE (exp_rtl
) == REG
6299 && REGNO (exp_rtl
) < FIRST_PSEUDO_REGISTER
)
6303 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6304 are memory and they conflict. */
6305 return ! (rtx_equal_p (x
, exp_rtl
)
6306 || (GET_CODE (x
) == MEM
&& GET_CODE (exp_rtl
) == MEM
6307 && true_dependence (exp_rtl
, VOIDmode
, x
,
6308 rtx_addr_varies_p
)));
6311 /* If we reach here, it is safe. */
6315 /* Subroutine of expand_expr: return rtx if EXP is a
6316 variable or parameter; else return 0. */
6323 switch (TREE_CODE (exp
))
6327 return DECL_RTL (exp
);
6333 #ifdef MAX_INTEGER_COMPUTATION_MODE
6336 check_max_integer_computation_mode (exp
)
6339 enum tree_code code
;
6340 enum machine_mode mode
;
6342 /* Strip any NOPs that don't change the mode. */
6344 code
= TREE_CODE (exp
);
6346 /* We must allow conversions of constants to MAX_INTEGER_COMPUTATION_MODE. */
6347 if (code
== NOP_EXPR
6348 && TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
)
6351 /* First check the type of the overall operation. We need only look at
6352 unary, binary and relational operations. */
6353 if (TREE_CODE_CLASS (code
) == '1'
6354 || TREE_CODE_CLASS (code
) == '2'
6355 || TREE_CODE_CLASS (code
) == '<')
6357 mode
= TYPE_MODE (TREE_TYPE (exp
));
6358 if (GET_MODE_CLASS (mode
) == MODE_INT
6359 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
6360 internal_error ("unsupported wide integer operation");
6363 /* Check operand of a unary op. */
6364 if (TREE_CODE_CLASS (code
) == '1')
6366 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6367 if (GET_MODE_CLASS (mode
) == MODE_INT
6368 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
6369 internal_error ("unsupported wide integer operation");
6372 /* Check operands of a binary/comparison op. */
6373 if (TREE_CODE_CLASS (code
) == '2' || TREE_CODE_CLASS (code
) == '<')
6375 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6376 if (GET_MODE_CLASS (mode
) == MODE_INT
6377 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
6378 internal_error ("unsupported wide integer operation");
6380 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1)));
6381 if (GET_MODE_CLASS (mode
) == MODE_INT
6382 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
6383 internal_error ("unsupported wide integer operation");
6388 /* Return the highest power of two that EXP is known to be a multiple of.
6389 This is used in updating alignment of MEMs in array references. */
6391 static unsigned HOST_WIDE_INT
6392 highest_pow2_factor (exp
)
6395 unsigned HOST_WIDE_INT c0
, c1
;
6397 switch (TREE_CODE (exp
))
6400 /* We can find the lowest bit that's a one. If the low
6401 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6402 We need to handle this case since we can find it in a COND_EXPR,
6403 a MIN_EXPR, or a MAX_EXPR. If the constant overlows, we have an
6404 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6406 if (TREE_CONSTANT_OVERFLOW (exp
))
6407 return BIGGEST_ALIGNMENT
;
6410 /* Note: tree_low_cst is intentionally not used here,
6411 we don't care about the upper bits. */
6412 c0
= TREE_INT_CST_LOW (exp
);
6414 return c0
? c0
: BIGGEST_ALIGNMENT
;
6418 case PLUS_EXPR
: case MINUS_EXPR
: case MIN_EXPR
: case MAX_EXPR
:
6419 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6420 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6421 return MIN (c0
, c1
);
6424 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6425 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6428 case ROUND_DIV_EXPR
: case TRUNC_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6430 if (integer_pow2p (TREE_OPERAND (exp
, 1))
6431 && host_integerp (TREE_OPERAND (exp
, 1), 1))
6433 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6434 c1
= tree_low_cst (TREE_OPERAND (exp
, 1), 1);
6435 return MAX (1, c0
/ c1
);
6439 case NON_LVALUE_EXPR
: case NOP_EXPR
: case CONVERT_EXPR
:
6440 case SAVE_EXPR
: case WITH_RECORD_EXPR
:
6441 return highest_pow2_factor (TREE_OPERAND (exp
, 0));
6444 return highest_pow2_factor (TREE_OPERAND (exp
, 1));
6447 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6448 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 2));
6449 return MIN (c0
, c1
);
6458 /* Similar, except that it is known that the expression must be a multiple
6459 of the alignment of TYPE. */
6461 static unsigned HOST_WIDE_INT
6462 highest_pow2_factor_for_type (type
, exp
)
6466 unsigned HOST_WIDE_INT type_align
, factor
;
6468 factor
= highest_pow2_factor (exp
);
6469 type_align
= TYPE_ALIGN (type
) / BITS_PER_UNIT
;
6470 return MAX (factor
, type_align
);
6473 /* Return an object on the placeholder list that matches EXP, a
6474 PLACEHOLDER_EXPR. An object "matches" if it is of the type of the
6475 PLACEHOLDER_EXPR or a pointer type to it. For further information, see
6476 tree.def. If no such object is found, return 0. If PLIST is nonzero, it
6477 is a location which initially points to a starting location in the
6478 placeholder list (zero means start of the list) and where a pointer into
6479 the placeholder list at which the object is found is placed. */
6482 find_placeholder (exp
, plist
)
6486 tree type
= TREE_TYPE (exp
);
6487 tree placeholder_expr
;
6489 for (placeholder_expr
6490 = plist
&& *plist
? TREE_CHAIN (*plist
) : placeholder_list
;
6491 placeholder_expr
!= 0;
6492 placeholder_expr
= TREE_CHAIN (placeholder_expr
))
6494 tree need_type
= TYPE_MAIN_VARIANT (type
);
6497 /* Find the outermost reference that is of the type we want. If none,
6498 see if any object has a type that is a pointer to the type we
6500 for (elt
= TREE_PURPOSE (placeholder_expr
); elt
!= 0;
6501 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
6502 || TREE_CODE (elt
) == COND_EXPR
)
6503 ? TREE_OPERAND (elt
, 1)
6504 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
6505 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
6506 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
6507 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
6508 ? TREE_OPERAND (elt
, 0) : 0))
6509 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
6512 *plist
= placeholder_expr
;
6516 for (elt
= TREE_PURPOSE (placeholder_expr
); elt
!= 0;
6518 = ((TREE_CODE (elt
) == COMPOUND_EXPR
6519 || TREE_CODE (elt
) == COND_EXPR
)
6520 ? TREE_OPERAND (elt
, 1)
6521 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
6522 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
6523 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
6524 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
6525 ? TREE_OPERAND (elt
, 0) : 0))
6526 if (POINTER_TYPE_P (TREE_TYPE (elt
))
6527 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
6531 *plist
= placeholder_expr
;
6532 return build1 (INDIRECT_REF
, need_type
, elt
);
6539 /* expand_expr: generate code for computing expression EXP.
6540 An rtx for the computed value is returned. The value is never null.
6541 In the case of a void EXP, const0_rtx is returned.
6543 The value may be stored in TARGET if TARGET is nonzero.
6544 TARGET is just a suggestion; callers must assume that
6545 the rtx returned may not be the same as TARGET.
6547 If TARGET is CONST0_RTX, it means that the value will be ignored.
6549 If TMODE is not VOIDmode, it suggests generating the
6550 result in mode TMODE. But this is done only when convenient.
6551 Otherwise, TMODE is ignored and the value generated in its natural mode.
6552 TMODE is just a suggestion; callers must assume that
6553 the rtx returned may not have mode TMODE.
6555 Note that TARGET may have neither TMODE nor MODE. In that case, it
6556 probably will not be used.
6558 If MODIFIER is EXPAND_SUM then when EXP is an addition
6559 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6560 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6561 products as above, or REG or MEM, or constant.
6562 Ordinarily in such cases we would output mul or add instructions
6563 and then return a pseudo reg containing the sum.
6565 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6566 it also marks a label as absolutely required (it can't be dead).
6567 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6568 This is used for outputting expressions used in initializers.
6570 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6571 with a constant address even if that address is not normally legitimate.
6572 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6574 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6575 a call parameter. Such targets require special care as we haven't yet
6576 marked TARGET so that it's safe from being trashed by libcalls. We
6577 don't want to use TARGET for anything but the final result;
6578 Intermediate values must go elsewhere. Additionally, calls to
6579 emit_block_move will be flagged with BLOCK_OP_CALL_PARM. */
6582 expand_expr (exp
, target
, tmode
, modifier
)
6585 enum machine_mode tmode
;
6586 enum expand_modifier modifier
;
6589 tree type
= TREE_TYPE (exp
);
6590 int unsignedp
= TREE_UNSIGNED (type
);
6591 enum machine_mode mode
;
6592 enum tree_code code
= TREE_CODE (exp
);
6594 rtx subtarget
, original_target
;
6598 /* Handle ERROR_MARK before anybody tries to access its type. */
6599 if (TREE_CODE (exp
) == ERROR_MARK
|| TREE_CODE (type
) == ERROR_MARK
)
6601 op0
= CONST0_RTX (tmode
);
6607 mode
= TYPE_MODE (type
);
6608 /* Use subtarget as the target for operand 0 of a binary operation. */
6609 subtarget
= get_subtarget (target
);
6610 original_target
= target
;
6611 ignore
= (target
== const0_rtx
6612 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
6613 || code
== CONVERT_EXPR
|| code
== REFERENCE_EXPR
6614 || code
== COND_EXPR
|| code
== VIEW_CONVERT_EXPR
)
6615 && TREE_CODE (type
) == VOID_TYPE
));
6617 /* If we are going to ignore this result, we need only do something
6618 if there is a side-effect somewhere in the expression. If there
6619 is, short-circuit the most common cases here. Note that we must
6620 not call expand_expr with anything but const0_rtx in case this
6621 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6625 if (! TREE_SIDE_EFFECTS (exp
))
6628 /* Ensure we reference a volatile object even if value is ignored, but
6629 don't do this if all we are doing is taking its address. */
6630 if (TREE_THIS_VOLATILE (exp
)
6631 && TREE_CODE (exp
) != FUNCTION_DECL
6632 && mode
!= VOIDmode
&& mode
!= BLKmode
6633 && modifier
!= EXPAND_CONST_ADDRESS
)
6635 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, modifier
);
6636 if (GET_CODE (temp
) == MEM
)
6637 temp
= copy_to_reg (temp
);
6641 if (TREE_CODE_CLASS (code
) == '1' || code
== COMPONENT_REF
6642 || code
== INDIRECT_REF
|| code
== BUFFER_REF
)
6643 return expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
6646 else if (TREE_CODE_CLASS (code
) == '2' || TREE_CODE_CLASS (code
) == '<'
6647 || code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
6649 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, modifier
);
6650 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, modifier
);
6653 else if ((code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
6654 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 1)))
6655 /* If the second operand has no side effects, just evaluate
6657 return expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
6659 else if (code
== BIT_FIELD_REF
)
6661 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, modifier
);
6662 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, modifier
);
6663 expand_expr (TREE_OPERAND (exp
, 2), const0_rtx
, VOIDmode
, modifier
);
6670 #ifdef MAX_INTEGER_COMPUTATION_MODE
6671 /* Only check stuff here if the mode we want is different from the mode
6672 of the expression; if it's the same, check_max_integer_computation_mode
6673 will handle it. Do we really need to check this stuff at all? */
6676 && GET_MODE (target
) != mode
6677 && TREE_CODE (exp
) != INTEGER_CST
6678 && TREE_CODE (exp
) != PARM_DECL
6679 && TREE_CODE (exp
) != ARRAY_REF
6680 && TREE_CODE (exp
) != ARRAY_RANGE_REF
6681 && TREE_CODE (exp
) != COMPONENT_REF
6682 && TREE_CODE (exp
) != BIT_FIELD_REF
6683 && TREE_CODE (exp
) != INDIRECT_REF
6684 && TREE_CODE (exp
) != CALL_EXPR
6685 && TREE_CODE (exp
) != VAR_DECL
6686 && TREE_CODE (exp
) != RTL_EXPR
)
6688 enum machine_mode mode
= GET_MODE (target
);
6690 if (GET_MODE_CLASS (mode
) == MODE_INT
6691 && mode
> MAX_INTEGER_COMPUTATION_MODE
)
6692 internal_error ("unsupported wide integer operation");
6696 && TREE_CODE (exp
) != INTEGER_CST
6697 && TREE_CODE (exp
) != PARM_DECL
6698 && TREE_CODE (exp
) != ARRAY_REF
6699 && TREE_CODE (exp
) != ARRAY_RANGE_REF
6700 && TREE_CODE (exp
) != COMPONENT_REF
6701 && TREE_CODE (exp
) != BIT_FIELD_REF
6702 && TREE_CODE (exp
) != INDIRECT_REF
6703 && TREE_CODE (exp
) != VAR_DECL
6704 && TREE_CODE (exp
) != CALL_EXPR
6705 && TREE_CODE (exp
) != RTL_EXPR
6706 && GET_MODE_CLASS (tmode
) == MODE_INT
6707 && tmode
> MAX_INTEGER_COMPUTATION_MODE
)
6708 internal_error ("unsupported wide integer operation");
6710 check_max_integer_computation_mode (exp
);
6713 /* If will do cse, generate all results into pseudo registers
6714 since 1) that allows cse to find more things
6715 and 2) otherwise cse could produce an insn the machine
6716 cannot support. An exception is a CONSTRUCTOR into a multi-word
6717 MEM: that's much more likely to be most efficient into the MEM.
6718 Another is a CALL_EXPR which must return in memory. */
6720 if (! cse_not_expected
&& mode
!= BLKmode
&& target
6721 && (GET_CODE (target
) != REG
|| REGNO (target
) < FIRST_PSEUDO_REGISTER
)
6722 && ! (code
== CONSTRUCTOR
&& GET_MODE_SIZE (mode
) > UNITS_PER_WORD
)
6723 && ! (code
== CALL_EXPR
&& aggregate_value_p (exp
)))
6730 tree function
= decl_function_context (exp
);
6731 /* Handle using a label in a containing function. */
6732 if (function
!= current_function_decl
6733 && function
!= inline_function_decl
&& function
!= 0)
6735 struct function
*p
= find_function_data (function
);
6736 p
->expr
->x_forced_labels
6737 = gen_rtx_EXPR_LIST (VOIDmode
, label_rtx (exp
),
6738 p
->expr
->x_forced_labels
);
6742 if (modifier
== EXPAND_INITIALIZER
)
6743 forced_labels
= gen_rtx_EXPR_LIST (VOIDmode
,
6748 temp
= gen_rtx_MEM (FUNCTION_MODE
,
6749 gen_rtx_LABEL_REF (Pmode
, label_rtx (exp
)));
6750 if (function
!= current_function_decl
6751 && function
!= inline_function_decl
&& function
!= 0)
6752 LABEL_REF_NONLOCAL_P (XEXP (temp
, 0)) = 1;
6757 if (!DECL_RTL_SET_P (exp
))
6759 error_with_decl (exp
, "prior parameter's size depends on `%s'");
6760 return CONST0_RTX (mode
);
6763 /* ... fall through ... */
6766 /* If a static var's type was incomplete when the decl was written,
6767 but the type is complete now, lay out the decl now. */
6768 if (DECL_SIZE (exp
) == 0
6769 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp
))
6770 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
6771 layout_decl (exp
, 0);
6773 /* ... fall through ... */
6777 if (DECL_RTL (exp
) == 0)
6780 /* Ensure variable marked as used even if it doesn't go through
6781 a parser. If it hasn't be used yet, write out an external
6783 if (! TREE_USED (exp
))
6785 assemble_external (exp
);
6786 TREE_USED (exp
) = 1;
6789 /* Show we haven't gotten RTL for this yet. */
6792 /* Handle variables inherited from containing functions. */
6793 context
= decl_function_context (exp
);
6795 /* We treat inline_function_decl as an alias for the current function
6796 because that is the inline function whose vars, types, etc.
6797 are being merged into the current function.
6798 See expand_inline_function. */
6800 if (context
!= 0 && context
!= current_function_decl
6801 && context
!= inline_function_decl
6802 /* If var is static, we don't need a static chain to access it. */
6803 && ! (GET_CODE (DECL_RTL (exp
)) == MEM
6804 && CONSTANT_P (XEXP (DECL_RTL (exp
), 0))))
6808 /* Mark as non-local and addressable. */
6809 DECL_NONLOCAL (exp
) = 1;
6810 if (DECL_NO_STATIC_CHAIN (current_function_decl
))
6812 (*lang_hooks
.mark_addressable
) (exp
);
6813 if (GET_CODE (DECL_RTL (exp
)) != MEM
)
6815 addr
= XEXP (DECL_RTL (exp
), 0);
6816 if (GET_CODE (addr
) == MEM
)
6818 = replace_equiv_address (addr
,
6819 fix_lexical_addr (XEXP (addr
, 0), exp
));
6821 addr
= fix_lexical_addr (addr
, exp
);
6823 temp
= replace_equiv_address (DECL_RTL (exp
), addr
);
6826 /* This is the case of an array whose size is to be determined
6827 from its initializer, while the initializer is still being parsed.
6830 else if (GET_CODE (DECL_RTL (exp
)) == MEM
6831 && GET_CODE (XEXP (DECL_RTL (exp
), 0)) == REG
)
6832 temp
= validize_mem (DECL_RTL (exp
));
6834 /* If DECL_RTL is memory, we are in the normal case and either
6835 the address is not valid or it is not a register and -fforce-addr
6836 is specified, get the address into a register. */
6838 else if (GET_CODE (DECL_RTL (exp
)) == MEM
6839 && modifier
!= EXPAND_CONST_ADDRESS
6840 && modifier
!= EXPAND_SUM
6841 && modifier
!= EXPAND_INITIALIZER
6842 && (! memory_address_p (DECL_MODE (exp
),
6843 XEXP (DECL_RTL (exp
), 0))
6845 && GET_CODE (XEXP (DECL_RTL (exp
), 0)) != REG
)))
6846 temp
= replace_equiv_address (DECL_RTL (exp
),
6847 copy_rtx (XEXP (DECL_RTL (exp
), 0)));
6849 /* If we got something, return it. But first, set the alignment
6850 if the address is a register. */
6853 if (GET_CODE (temp
) == MEM
&& GET_CODE (XEXP (temp
, 0)) == REG
)
6854 mark_reg_pointer (XEXP (temp
, 0), DECL_ALIGN (exp
));
6859 /* If the mode of DECL_RTL does not match that of the decl, it
6860 must be a promoted value. We return a SUBREG of the wanted mode,
6861 but mark it so that we know that it was already extended. */
6863 if (GET_CODE (DECL_RTL (exp
)) == REG
6864 && GET_MODE (DECL_RTL (exp
)) != DECL_MODE (exp
))
6866 /* Get the signedness used for this variable. Ensure we get the
6867 same mode we got when the variable was declared. */
6868 if (GET_MODE (DECL_RTL (exp
))
6869 != promote_mode (type
, DECL_MODE (exp
), &unsignedp
,
6870 (TREE_CODE (exp
) == RESULT_DECL
? 1 : 0)))
6873 temp
= gen_lowpart_SUBREG (mode
, DECL_RTL (exp
));
6874 SUBREG_PROMOTED_VAR_P (temp
) = 1;
6875 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
6879 return DECL_RTL (exp
);
6882 temp
= immed_double_const (TREE_INT_CST_LOW (exp
),
6883 TREE_INT_CST_HIGH (exp
), mode
);
6885 /* ??? If overflow is set, fold will have done an incomplete job,
6886 which can result in (plus xx (const_int 0)), which can get
6887 simplified by validate_replace_rtx during virtual register
6888 instantiation, which can result in unrecognizable insns.
6889 Avoid this by forcing all overflows into registers. */
6890 if (TREE_CONSTANT_OVERFLOW (exp
)
6891 && modifier
!= EXPAND_INITIALIZER
)
6892 temp
= force_reg (mode
, temp
);
6897 return const_vector_from_tree (exp
);
6900 return expand_expr (DECL_INITIAL (exp
), target
, VOIDmode
, modifier
);
6903 /* If optimized, generate immediate CONST_DOUBLE
6904 which will be turned into memory by reload if necessary.
6906 We used to force a register so that loop.c could see it. But
6907 this does not allow gen_* patterns to perform optimizations with
6908 the constants. It also produces two insns in cases like "x = 1.0;".
6909 On most machines, floating-point constants are not permitted in
6910 many insns, so we'd end up copying it to a register in any case.
6912 Now, we do the copying in expand_binop, if appropriate. */
6913 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp
),
6914 TYPE_MODE (TREE_TYPE (exp
)));
6918 temp
= output_constant_def (exp
, 1);
6920 /* temp contains a constant address.
6921 On RISC machines where a constant address isn't valid,
6922 make some insns to get that address into a register. */
6923 if (modifier
!= EXPAND_CONST_ADDRESS
6924 && modifier
!= EXPAND_INITIALIZER
6925 && modifier
!= EXPAND_SUM
6926 && (! memory_address_p (mode
, XEXP (temp
, 0))
6927 || flag_force_addr
))
6928 return replace_equiv_address (temp
,
6929 copy_rtx (XEXP (temp
, 0)));
6932 case EXPR_WITH_FILE_LOCATION
:
6935 const char *saved_input_filename
= input_filename
;
6936 int saved_lineno
= lineno
;
6937 input_filename
= EXPR_WFL_FILENAME (exp
);
6938 lineno
= EXPR_WFL_LINENO (exp
);
6939 if (EXPR_WFL_EMIT_LINE_NOTE (exp
))
6940 emit_line_note (input_filename
, lineno
);
6941 /* Possibly avoid switching back and forth here. */
6942 to_return
= expand_expr (EXPR_WFL_NODE (exp
), target
, tmode
, modifier
);
6943 input_filename
= saved_input_filename
;
6944 lineno
= saved_lineno
;
6949 context
= decl_function_context (exp
);
6951 /* If this SAVE_EXPR was at global context, assume we are an
6952 initialization function and move it into our context. */
6954 SAVE_EXPR_CONTEXT (exp
) = current_function_decl
;
6956 /* We treat inline_function_decl as an alias for the current function
6957 because that is the inline function whose vars, types, etc.
6958 are being merged into the current function.
6959 See expand_inline_function. */
6960 if (context
== current_function_decl
|| context
== inline_function_decl
)
6963 /* If this is non-local, handle it. */
6966 /* The following call just exists to abort if the context is
6967 not of a containing function. */
6968 find_function_data (context
);
6970 temp
= SAVE_EXPR_RTL (exp
);
6971 if (temp
&& GET_CODE (temp
) == REG
)
6973 put_var_into_stack (exp
, /*rescan=*/true);
6974 temp
= SAVE_EXPR_RTL (exp
);
6976 if (temp
== 0 || GET_CODE (temp
) != MEM
)
6979 replace_equiv_address (temp
,
6980 fix_lexical_addr (XEXP (temp
, 0), exp
));
6982 if (SAVE_EXPR_RTL (exp
) == 0)
6984 if (mode
== VOIDmode
)
6987 temp
= assign_temp (build_qualified_type (type
,
6989 | TYPE_QUAL_CONST
)),
6992 SAVE_EXPR_RTL (exp
) = temp
;
6993 if (!optimize
&& GET_CODE (temp
) == REG
)
6994 save_expr_regs
= gen_rtx_EXPR_LIST (VOIDmode
, temp
,
6997 /* If the mode of TEMP does not match that of the expression, it
6998 must be a promoted value. We pass store_expr a SUBREG of the
6999 wanted mode but mark it so that we know that it was already
7002 if (GET_CODE (temp
) == REG
&& GET_MODE (temp
) != mode
)
7004 temp
= gen_lowpart_SUBREG (mode
, SAVE_EXPR_RTL (exp
));
7005 promote_mode (type
, mode
, &unsignedp
, 0);
7006 SUBREG_PROMOTED_VAR_P (temp
) = 1;
7007 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
7010 if (temp
== const0_rtx
)
7011 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, 0);
7013 store_expr (TREE_OPERAND (exp
, 0), temp
,
7014 modifier
== EXPAND_STACK_PARM
? 2 : 0);
7016 TREE_USED (exp
) = 1;
7019 /* If the mode of SAVE_EXPR_RTL does not match that of the expression, it
7020 must be a promoted value. We return a SUBREG of the wanted mode,
7021 but mark it so that we know that it was already extended. */
7023 if (GET_CODE (SAVE_EXPR_RTL (exp
)) == REG
7024 && GET_MODE (SAVE_EXPR_RTL (exp
)) != mode
)
7026 /* Compute the signedness and make the proper SUBREG. */
7027 promote_mode (type
, mode
, &unsignedp
, 0);
7028 temp
= gen_lowpart_SUBREG (mode
, SAVE_EXPR_RTL (exp
));
7029 SUBREG_PROMOTED_VAR_P (temp
) = 1;
7030 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
7034 return SAVE_EXPR_RTL (exp
);
7039 temp
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
7040 TREE_OPERAND (exp
, 0)
7041 = (*lang_hooks
.unsave_expr_now
) (TREE_OPERAND (exp
, 0));
7045 case PLACEHOLDER_EXPR
:
7047 tree old_list
= placeholder_list
;
7048 tree placeholder_expr
= 0;
7050 exp
= find_placeholder (exp
, &placeholder_expr
);
7054 placeholder_list
= TREE_CHAIN (placeholder_expr
);
7055 temp
= expand_expr (exp
, original_target
, tmode
, modifier
);
7056 placeholder_list
= old_list
;
7060 case WITH_RECORD_EXPR
:
7061 /* Put the object on the placeholder list, expand our first operand,
7062 and pop the list. */
7063 placeholder_list
= tree_cons (TREE_OPERAND (exp
, 1), NULL_TREE
,
7065 target
= expand_expr (TREE_OPERAND (exp
, 0), original_target
, tmode
,
7067 placeholder_list
= TREE_CHAIN (placeholder_list
);
7071 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == LABEL_DECL
)
7072 expand_goto (TREE_OPERAND (exp
, 0));
7074 expand_computed_goto (TREE_OPERAND (exp
, 0));
7078 expand_exit_loop_if_false (NULL
,
7079 invert_truthvalue (TREE_OPERAND (exp
, 0)));
7082 case LABELED_BLOCK_EXPR
:
7083 if (LABELED_BLOCK_BODY (exp
))
7084 expand_expr_stmt_value (LABELED_BLOCK_BODY (exp
), 0, 1);
7085 /* Should perhaps use expand_label, but this is simpler and safer. */
7086 do_pending_stack_adjust ();
7087 emit_label (label_rtx (LABELED_BLOCK_LABEL (exp
)));
7090 case EXIT_BLOCK_EXPR
:
7091 if (EXIT_BLOCK_RETURN (exp
))
7092 sorry ("returned value in block_exit_expr");
7093 expand_goto (LABELED_BLOCK_LABEL (EXIT_BLOCK_LABELED_BLOCK (exp
)));
7098 expand_start_loop (1);
7099 expand_expr_stmt_value (TREE_OPERAND (exp
, 0), 0, 1);
7107 tree vars
= TREE_OPERAND (exp
, 0);
7109 /* Need to open a binding contour here because
7110 if there are any cleanups they must be contained here. */
7111 expand_start_bindings (2);
7113 /* Mark the corresponding BLOCK for output in its proper place. */
7114 if (TREE_OPERAND (exp
, 2) != 0
7115 && ! TREE_USED (TREE_OPERAND (exp
, 2)))
7116 (*lang_hooks
.decls
.insert_block
) (TREE_OPERAND (exp
, 2));
7118 /* If VARS have not yet been expanded, expand them now. */
7121 if (!DECL_RTL_SET_P (vars
))
7123 expand_decl_init (vars
);
7124 vars
= TREE_CHAIN (vars
);
7127 temp
= expand_expr (TREE_OPERAND (exp
, 1), target
, tmode
, modifier
);
7129 expand_end_bindings (TREE_OPERAND (exp
, 0), 0, 0);
7135 if (RTL_EXPR_SEQUENCE (exp
))
7137 if (RTL_EXPR_SEQUENCE (exp
) == const0_rtx
)
7139 emit_insn (RTL_EXPR_SEQUENCE (exp
));
7140 RTL_EXPR_SEQUENCE (exp
) = const0_rtx
;
7142 preserve_rtl_expr_result (RTL_EXPR_RTL (exp
));
7143 free_temps_for_rtl_expr (exp
);
7144 return RTL_EXPR_RTL (exp
);
7147 /* If we don't need the result, just ensure we evaluate any
7153 for (elt
= CONSTRUCTOR_ELTS (exp
); elt
; elt
= TREE_CHAIN (elt
))
7154 expand_expr (TREE_VALUE (elt
), const0_rtx
, VOIDmode
, 0);
7159 /* All elts simple constants => refer to a constant in memory. But
7160 if this is a non-BLKmode mode, let it store a field at a time
7161 since that should make a CONST_INT or CONST_DOUBLE when we
7162 fold. Likewise, if we have a target we can use, it is best to
7163 store directly into the target unless the type is large enough
7164 that memcpy will be used. If we are making an initializer and
7165 all operands are constant, put it in memory as well.
7167 FIXME: Avoid trying to fill vector constructors piece-meal.
7168 Output them with output_constant_def below unless we're sure
7169 they're zeros. This should go away when vector initializers
7170 are treated like VECTOR_CST instead of arrays.
7172 else if ((TREE_STATIC (exp
)
7173 && ((mode
== BLKmode
7174 && ! (target
!= 0 && safe_from_p (target
, exp
, 1)))
7175 || TREE_ADDRESSABLE (exp
)
7176 || (host_integerp (TYPE_SIZE_UNIT (type
), 1)
7177 && (! MOVE_BY_PIECES_P
7178 (tree_low_cst (TYPE_SIZE_UNIT (type
), 1),
7180 && ((TREE_CODE (type
) == VECTOR_TYPE
7181 && !is_zeros_p (exp
))
7182 || ! mostly_zeros_p (exp
)))))
7183 || (modifier
== EXPAND_INITIALIZER
&& TREE_CONSTANT (exp
)))
7185 rtx constructor
= output_constant_def (exp
, 1);
7187 if (modifier
!= EXPAND_CONST_ADDRESS
7188 && modifier
!= EXPAND_INITIALIZER
7189 && modifier
!= EXPAND_SUM
)
7190 constructor
= validize_mem (constructor
);
7196 /* Handle calls that pass values in multiple non-contiguous
7197 locations. The Irix 6 ABI has examples of this. */
7198 if (target
== 0 || ! safe_from_p (target
, exp
, 1)
7199 || GET_CODE (target
) == PARALLEL
7200 || modifier
== EXPAND_STACK_PARM
)
7202 = assign_temp (build_qualified_type (type
,
7204 | (TREE_READONLY (exp
)
7205 * TYPE_QUAL_CONST
))),
7206 0, TREE_ADDRESSABLE (exp
), 1);
7208 store_constructor (exp
, target
, 0, int_expr_size (exp
));
7214 tree exp1
= TREE_OPERAND (exp
, 0);
7216 tree string
= string_constant (exp1
, &index
);
7218 /* Try to optimize reads from const strings. */
7220 && TREE_CODE (string
) == STRING_CST
7221 && TREE_CODE (index
) == INTEGER_CST
7222 && compare_tree_int (index
, TREE_STRING_LENGTH (string
)) < 0
7223 && GET_MODE_CLASS (mode
) == MODE_INT
7224 && GET_MODE_SIZE (mode
) == 1
7225 && modifier
!= EXPAND_WRITE
)
7226 return gen_int_mode (TREE_STRING_POINTER (string
)
7227 [TREE_INT_CST_LOW (index
)], mode
);
7229 op0
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
7230 op0
= memory_address (mode
, op0
);
7231 temp
= gen_rtx_MEM (mode
, op0
);
7232 set_mem_attributes (temp
, exp
, 0);
7234 /* If we are writing to this object and its type is a record with
7235 readonly fields, we must mark it as readonly so it will
7236 conflict with readonly references to those fields. */
7237 if (modifier
== EXPAND_WRITE
&& readonly_fields_p (type
))
7238 RTX_UNCHANGING_P (temp
) = 1;
7244 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) != ARRAY_TYPE
)
7248 tree array
= TREE_OPERAND (exp
, 0);
7249 tree domain
= TYPE_DOMAIN (TREE_TYPE (array
));
7250 tree low_bound
= domain
? TYPE_MIN_VALUE (domain
) : integer_zero_node
;
7251 tree index
= convert (sizetype
, TREE_OPERAND (exp
, 1));
7254 /* Optimize the special-case of a zero lower bound.
7256 We convert the low_bound to sizetype to avoid some problems
7257 with constant folding. (E.g. suppose the lower bound is 1,
7258 and its mode is QI. Without the conversion, (ARRAY
7259 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
7260 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
7262 if (! integer_zerop (low_bound
))
7263 index
= size_diffop (index
, convert (sizetype
, low_bound
));
7265 /* Fold an expression like: "foo"[2].
7266 This is not done in fold so it won't happen inside &.
7267 Don't fold if this is for wide characters since it's too
7268 difficult to do correctly and this is a very rare case. */
7270 if (modifier
!= EXPAND_CONST_ADDRESS
&& modifier
!= EXPAND_INITIALIZER
7271 && TREE_CODE (array
) == STRING_CST
7272 && TREE_CODE (index
) == INTEGER_CST
7273 && compare_tree_int (index
, TREE_STRING_LENGTH (array
)) < 0
7274 && GET_MODE_CLASS (mode
) == MODE_INT
7275 && GET_MODE_SIZE (mode
) == 1)
7276 return gen_int_mode (TREE_STRING_POINTER (array
)
7277 [TREE_INT_CST_LOW (index
)], mode
);
7279 /* If this is a constant index into a constant array,
7280 just get the value from the array. Handle both the cases when
7281 we have an explicit constructor and when our operand is a variable
7282 that was declared const. */
7284 if (modifier
!= EXPAND_CONST_ADDRESS
&& modifier
!= EXPAND_INITIALIZER
7285 && TREE_CODE (array
) == CONSTRUCTOR
&& ! TREE_SIDE_EFFECTS (array
)
7286 && TREE_CODE (index
) == INTEGER_CST
7287 && 0 > compare_tree_int (index
,
7288 list_length (CONSTRUCTOR_ELTS
7289 (TREE_OPERAND (exp
, 0)))))
7293 for (elem
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0)),
7294 i
= TREE_INT_CST_LOW (index
);
7295 elem
!= 0 && i
!= 0; i
--, elem
= TREE_CHAIN (elem
))
7299 return expand_expr (fold (TREE_VALUE (elem
)), target
, tmode
,
7303 else if (optimize
>= 1
7304 && modifier
!= EXPAND_CONST_ADDRESS
7305 && modifier
!= EXPAND_INITIALIZER
7306 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
7307 && TREE_CODE (array
) == VAR_DECL
&& DECL_INITIAL (array
)
7308 && TREE_CODE (DECL_INITIAL (array
)) != ERROR_MARK
)
7310 if (TREE_CODE (index
) == INTEGER_CST
)
7312 tree init
= DECL_INITIAL (array
);
7314 if (TREE_CODE (init
) == CONSTRUCTOR
)
7318 for (elem
= CONSTRUCTOR_ELTS (init
);
7320 && !tree_int_cst_equal (TREE_PURPOSE (elem
), index
));
7321 elem
= TREE_CHAIN (elem
))
7324 if (elem
&& !TREE_SIDE_EFFECTS (TREE_VALUE (elem
)))
7325 return expand_expr (fold (TREE_VALUE (elem
)), target
,
7328 else if (TREE_CODE (init
) == STRING_CST
7329 && 0 > compare_tree_int (index
,
7330 TREE_STRING_LENGTH (init
)))
7332 tree type
= TREE_TYPE (TREE_TYPE (init
));
7333 enum machine_mode mode
= TYPE_MODE (type
);
7335 if (GET_MODE_CLASS (mode
) == MODE_INT
7336 && GET_MODE_SIZE (mode
) == 1)
7337 return gen_int_mode (TREE_STRING_POINTER (init
)
7338 [TREE_INT_CST_LOW (index
)], mode
);
7343 goto normal_inner_ref
;
7346 /* If the operand is a CONSTRUCTOR, we can just extract the
7347 appropriate field if it is present. */
7348 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == CONSTRUCTOR
)
7352 for (elt
= CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0)); elt
;
7353 elt
= TREE_CHAIN (elt
))
7354 if (TREE_PURPOSE (elt
) == TREE_OPERAND (exp
, 1)
7355 /* We can normally use the value of the field in the
7356 CONSTRUCTOR. However, if this is a bitfield in
7357 an integral mode that we can fit in a HOST_WIDE_INT,
7358 we must mask only the number of bits in the bitfield,
7359 since this is done implicitly by the constructor. If
7360 the bitfield does not meet either of those conditions,
7361 we can't do this optimization. */
7362 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt
))
7363 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt
)))
7365 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt
)))
7366 <= HOST_BITS_PER_WIDE_INT
))))
7368 if (DECL_BIT_FIELD (TREE_PURPOSE (elt
))
7369 && modifier
== EXPAND_STACK_PARM
)
7371 op0
= expand_expr (TREE_VALUE (elt
), target
, tmode
, modifier
);
7372 if (DECL_BIT_FIELD (TREE_PURPOSE (elt
)))
7374 HOST_WIDE_INT bitsize
7375 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt
)));
7376 enum machine_mode imode
7377 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt
)));
7379 if (TREE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt
))))
7381 op1
= GEN_INT (((HOST_WIDE_INT
) 1 << bitsize
) - 1);
7382 op0
= expand_and (imode
, op0
, op1
, target
);
7387 = build_int_2 (GET_MODE_BITSIZE (imode
) - bitsize
,
7390 op0
= expand_shift (LSHIFT_EXPR
, imode
, op0
, count
,
7392 op0
= expand_shift (RSHIFT_EXPR
, imode
, op0
, count
,
7400 goto normal_inner_ref
;
7403 case ARRAY_RANGE_REF
:
7406 enum machine_mode mode1
;
7407 HOST_WIDE_INT bitsize
, bitpos
;
7410 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
7411 &mode1
, &unsignedp
, &volatilep
);
7414 /* If we got back the original object, something is wrong. Perhaps
7415 we are evaluating an expression too early. In any event, don't
7416 infinitely recurse. */
7420 /* If TEM's type is a union of variable size, pass TARGET to the inner
7421 computation, since it will need a temporary and TARGET is known
7422 to have to do. This occurs in unchecked conversion in Ada. */
7426 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
7427 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
7429 && modifier
!= EXPAND_STACK_PARM
7430 ? target
: NULL_RTX
),
7432 (modifier
== EXPAND_INITIALIZER
7433 || modifier
== EXPAND_CONST_ADDRESS
7434 || modifier
== EXPAND_STACK_PARM
)
7435 ? modifier
: EXPAND_NORMAL
);
7437 /* If this is a constant, put it into a register if it is a
7438 legitimate constant and OFFSET is 0 and memory if it isn't. */
7439 if (CONSTANT_P (op0
))
7441 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (tem
));
7442 if (mode
!= BLKmode
&& LEGITIMATE_CONSTANT_P (op0
)
7444 op0
= force_reg (mode
, op0
);
7446 op0
= validize_mem (force_const_mem (mode
, op0
));
7451 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
,
7454 /* If this object is in a register, put it into memory.
7455 This case can't occur in C, but can in Ada if we have
7456 unchecked conversion of an expression from a scalar type to
7457 an array or record type. */
7458 if (GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
7459 || GET_CODE (op0
) == CONCAT
|| GET_CODE (op0
) == ADDRESSOF
)
7461 /* If the operand is a SAVE_EXPR, we can deal with this by
7462 forcing the SAVE_EXPR into memory. */
7463 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == SAVE_EXPR
)
7465 put_var_into_stack (TREE_OPERAND (exp
, 0),
7467 op0
= SAVE_EXPR_RTL (TREE_OPERAND (exp
, 0));
7472 = build_qualified_type (TREE_TYPE (tem
),
7473 (TYPE_QUALS (TREE_TYPE (tem
))
7474 | TYPE_QUAL_CONST
));
7475 rtx memloc
= assign_temp (nt
, 1, 1, 1);
7477 emit_move_insn (memloc
, op0
);
7482 if (GET_CODE (op0
) != MEM
)
7485 #ifdef POINTERS_EXTEND_UNSIGNED
7486 if (GET_MODE (offset_rtx
) != Pmode
)
7487 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
7489 if (GET_MODE (offset_rtx
) != ptr_mode
)
7490 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
7493 /* A constant address in OP0 can have VOIDmode, we must not try
7494 to call force_reg for that case. Avoid that case. */
7495 if (GET_CODE (op0
) == MEM
7496 && GET_MODE (op0
) == BLKmode
7497 && GET_MODE (XEXP (op0
, 0)) != VOIDmode
7499 && (bitpos
% bitsize
) == 0
7500 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
7501 && MEM_ALIGN (op0
) == GET_MODE_ALIGNMENT (mode1
))
7503 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7507 op0
= offset_address (op0
, offset_rtx
,
7508 highest_pow2_factor (offset
));
7511 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7512 record its alignment as BIGGEST_ALIGNMENT. */
7513 if (GET_CODE (op0
) == MEM
&& bitpos
== 0 && offset
!= 0
7514 && is_aligning_offset (offset
, tem
))
7515 set_mem_align (op0
, BIGGEST_ALIGNMENT
);
7517 /* Don't forget about volatility even if this is a bitfield. */
7518 if (GET_CODE (op0
) == MEM
&& volatilep
&& ! MEM_VOLATILE_P (op0
))
7520 if (op0
== orig_op0
)
7521 op0
= copy_rtx (op0
);
7523 MEM_VOLATILE_P (op0
) = 1;
7526 /* The following code doesn't handle CONCAT.
7527 Assume only bitpos == 0 can be used for CONCAT, due to
7528 one element arrays having the same mode as its element. */
7529 if (GET_CODE (op0
) == CONCAT
)
7531 if (bitpos
!= 0 || bitsize
!= GET_MODE_BITSIZE (GET_MODE (op0
)))
7536 /* In cases where an aligned union has an unaligned object
7537 as a field, we might be extracting a BLKmode value from
7538 an integer-mode (e.g., SImode) object. Handle this case
7539 by doing the extract into an object as wide as the field
7540 (which we know to be the width of a basic mode), then
7541 storing into memory, and changing the mode to BLKmode. */
7542 if (mode1
== VOIDmode
7543 || GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
7544 || (mode1
!= BLKmode
&& ! direct_load
[(int) mode1
]
7545 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
7546 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
7547 && modifier
!= EXPAND_CONST_ADDRESS
7548 && modifier
!= EXPAND_INITIALIZER
)
7549 /* If the field isn't aligned enough to fetch as a memref,
7550 fetch it as a bit field. */
7551 || (mode1
!= BLKmode
7552 && ((TYPE_ALIGN (TREE_TYPE (tem
)) < GET_MODE_ALIGNMENT (mode
)
7553 && SLOW_UNALIGNED_ACCESS (mode1
, MEM_ALIGN (op0
)))
7554 || (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0)))
7555 /* If the type and the field are a constant size and the
7556 size of the type isn't the same size as the bitfield,
7557 we must use bitfield operations. */
7559 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
)))
7561 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)),
7564 enum machine_mode ext_mode
= mode
;
7566 if (ext_mode
== BLKmode
7567 && ! (target
!= 0 && GET_CODE (op0
) == MEM
7568 && GET_CODE (target
) == MEM
7569 && bitpos
% BITS_PER_UNIT
== 0))
7570 ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
7572 if (ext_mode
== BLKmode
)
7574 /* In this case, BITPOS must start at a byte boundary and
7575 TARGET, if specified, must be a MEM. */
7576 if (GET_CODE (op0
) != MEM
7577 || (target
!= 0 && GET_CODE (target
) != MEM
)
7578 || bitpos
% BITS_PER_UNIT
!= 0)
7581 op0
= adjust_address (op0
, VOIDmode
, bitpos
/ BITS_PER_UNIT
);
7583 target
= assign_temp (type
, 0, 1, 1);
7585 emit_block_move (target
, op0
,
7586 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
7588 (modifier
== EXPAND_STACK_PARM
7589 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
7594 op0
= validize_mem (op0
);
7596 if (GET_CODE (op0
) == MEM
&& GET_CODE (XEXP (op0
, 0)) == REG
)
7597 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
7599 op0
= extract_bit_field (op0
, bitsize
, bitpos
, unsignedp
,
7600 (modifier
== EXPAND_STACK_PARM
7601 ? NULL_RTX
: target
),
7603 int_size_in_bytes (TREE_TYPE (tem
)));
7605 /* If the result is a record type and BITSIZE is narrower than
7606 the mode of OP0, an integral mode, and this is a big endian
7607 machine, we must put the field into the high-order bits. */
7608 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
7609 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
7610 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (op0
)))
7611 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
7612 size_int (GET_MODE_BITSIZE (GET_MODE (op0
))
7616 if (mode
== BLKmode
)
7618 rtx
new = assign_temp (build_qualified_type
7619 ((*lang_hooks
.types
.type_for_mode
)
7621 TYPE_QUAL_CONST
), 0, 1, 1);
7623 emit_move_insn (new, op0
);
7624 op0
= copy_rtx (new);
7625 PUT_MODE (op0
, BLKmode
);
7626 set_mem_attributes (op0
, exp
, 1);
7632 /* If the result is BLKmode, use that to access the object
7634 if (mode
== BLKmode
)
7637 /* Get a reference to just this component. */
7638 if (modifier
== EXPAND_CONST_ADDRESS
7639 || modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
7640 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7642 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7644 if (op0
== orig_op0
)
7645 op0
= copy_rtx (op0
);
7647 set_mem_attributes (op0
, exp
, 0);
7648 if (GET_CODE (XEXP (op0
, 0)) == REG
)
7649 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
7651 MEM_VOLATILE_P (op0
) |= volatilep
;
7652 if (mode
== mode1
|| mode1
== BLKmode
|| mode1
== tmode
7653 || modifier
== EXPAND_CONST_ADDRESS
7654 || modifier
== EXPAND_INITIALIZER
)
7656 else if (target
== 0)
7657 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
7659 convert_move (target
, op0
, unsignedp
);
7665 rtx insn
, before
= get_last_insn (), vtbl_ref
;
7667 /* Evaluate the interior expression. */
7668 subtarget
= expand_expr (TREE_OPERAND (exp
, 0), target
,
7671 /* Get or create an instruction off which to hang a note. */
7672 if (REG_P (subtarget
))
7675 insn
= get_last_insn ();
7678 if (! INSN_P (insn
))
7679 insn
= prev_nonnote_insn (insn
);
7683 target
= gen_reg_rtx (GET_MODE (subtarget
));
7684 insn
= emit_move_insn (target
, subtarget
);
7687 /* Collect the data for the note. */
7688 vtbl_ref
= XEXP (DECL_RTL (TREE_OPERAND (exp
, 1)), 0);
7689 vtbl_ref
= plus_constant (vtbl_ref
,
7690 tree_low_cst (TREE_OPERAND (exp
, 2), 0));
7691 /* Discard the initial CONST that was added. */
7692 vtbl_ref
= XEXP (vtbl_ref
, 0);
7695 = gen_rtx_EXPR_LIST (REG_VTABLE_REF
, vtbl_ref
, REG_NOTES (insn
));
7700 /* Intended for a reference to a buffer of a file-object in Pascal.
7701 But it's not certain that a special tree code will really be
7702 necessary for these. INDIRECT_REF might work for them. */
7708 /* Pascal set IN expression.
7711 rlo = set_low - (set_low%bits_per_word);
7712 the_word = set [ (index - rlo)/bits_per_word ];
7713 bit_index = index % bits_per_word;
7714 bitmask = 1 << bit_index;
7715 return !!(the_word & bitmask); */
7717 tree set
= TREE_OPERAND (exp
, 0);
7718 tree index
= TREE_OPERAND (exp
, 1);
7719 int iunsignedp
= TREE_UNSIGNED (TREE_TYPE (index
));
7720 tree set_type
= TREE_TYPE (set
);
7721 tree set_low_bound
= TYPE_MIN_VALUE (TYPE_DOMAIN (set_type
));
7722 tree set_high_bound
= TYPE_MAX_VALUE (TYPE_DOMAIN (set_type
));
7723 rtx index_val
= expand_expr (index
, 0, VOIDmode
, 0);
7724 rtx lo_r
= expand_expr (set_low_bound
, 0, VOIDmode
, 0);
7725 rtx hi_r
= expand_expr (set_high_bound
, 0, VOIDmode
, 0);
7726 rtx setval
= expand_expr (set
, 0, VOIDmode
, 0);
7727 rtx setaddr
= XEXP (setval
, 0);
7728 enum machine_mode index_mode
= TYPE_MODE (TREE_TYPE (index
));
7730 rtx diff
, quo
, rem
, addr
, bit
, result
;
7732 /* If domain is empty, answer is no. Likewise if index is constant
7733 and out of bounds. */
7734 if (((TREE_CODE (set_high_bound
) == INTEGER_CST
7735 && TREE_CODE (set_low_bound
) == INTEGER_CST
7736 && tree_int_cst_lt (set_high_bound
, set_low_bound
))
7737 || (TREE_CODE (index
) == INTEGER_CST
7738 && TREE_CODE (set_low_bound
) == INTEGER_CST
7739 && tree_int_cst_lt (index
, set_low_bound
))
7740 || (TREE_CODE (set_high_bound
) == INTEGER_CST
7741 && TREE_CODE (index
) == INTEGER_CST
7742 && tree_int_cst_lt (set_high_bound
, index
))))
7746 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
7748 /* If we get here, we have to generate the code for both cases
7749 (in range and out of range). */
7751 op0
= gen_label_rtx ();
7752 op1
= gen_label_rtx ();
7754 if (! (GET_CODE (index_val
) == CONST_INT
7755 && GET_CODE (lo_r
) == CONST_INT
))
7756 emit_cmp_and_jump_insns (index_val
, lo_r
, LT
, NULL_RTX
,
7757 GET_MODE (index_val
), iunsignedp
, op1
);
7759 if (! (GET_CODE (index_val
) == CONST_INT
7760 && GET_CODE (hi_r
) == CONST_INT
))
7761 emit_cmp_and_jump_insns (index_val
, hi_r
, GT
, NULL_RTX
,
7762 GET_MODE (index_val
), iunsignedp
, op1
);
7764 /* Calculate the element number of bit zero in the first word
7766 if (GET_CODE (lo_r
) == CONST_INT
)
7767 rlow
= GEN_INT (INTVAL (lo_r
)
7768 & ~((HOST_WIDE_INT
) 1 << BITS_PER_UNIT
));
7770 rlow
= expand_binop (index_mode
, and_optab
, lo_r
,
7771 GEN_INT (~((HOST_WIDE_INT
) 1 << BITS_PER_UNIT
)),
7772 NULL_RTX
, iunsignedp
, OPTAB_LIB_WIDEN
);
7774 diff
= expand_binop (index_mode
, sub_optab
, index_val
, rlow
,
7775 NULL_RTX
, iunsignedp
, OPTAB_LIB_WIDEN
);
7777 quo
= expand_divmod (0, TRUNC_DIV_EXPR
, index_mode
, diff
,
7778 GEN_INT (BITS_PER_UNIT
), NULL_RTX
, iunsignedp
);
7779 rem
= expand_divmod (1, TRUNC_MOD_EXPR
, index_mode
, index_val
,
7780 GEN_INT (BITS_PER_UNIT
), NULL_RTX
, iunsignedp
);
7782 addr
= memory_address (byte_mode
,
7783 expand_binop (index_mode
, add_optab
, diff
,
7784 setaddr
, NULL_RTX
, iunsignedp
,
7787 /* Extract the bit we want to examine. */
7788 bit
= expand_shift (RSHIFT_EXPR
, byte_mode
,
7789 gen_rtx_MEM (byte_mode
, addr
),
7790 make_tree (TREE_TYPE (index
), rem
),
7792 result
= expand_binop (byte_mode
, and_optab
, bit
, const1_rtx
,
7793 GET_MODE (target
) == byte_mode
? target
: 0,
7794 1, OPTAB_LIB_WIDEN
);
7796 if (result
!= target
)
7797 convert_move (target
, result
, 1);
7799 /* Output the code to handle the out-of-range case. */
7802 emit_move_insn (target
, const0_rtx
);
7807 case WITH_CLEANUP_EXPR
:
7808 if (WITH_CLEANUP_EXPR_RTL (exp
) == 0)
7810 WITH_CLEANUP_EXPR_RTL (exp
)
7811 = expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
7812 expand_decl_cleanup_eh (NULL_TREE
, TREE_OPERAND (exp
, 1),
7813 CLEANUP_EH_ONLY (exp
));
7815 /* That's it for this cleanup. */
7816 TREE_OPERAND (exp
, 1) = 0;
7818 return WITH_CLEANUP_EXPR_RTL (exp
);
7820 case CLEANUP_POINT_EXPR
:
7822 /* Start a new binding layer that will keep track of all cleanup
7823 actions to be performed. */
7824 expand_start_bindings (2);
7826 target_temp_slot_level
= temp_slot_level
;
7828 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
7829 /* If we're going to use this value, load it up now. */
7831 op0
= force_not_mem (op0
);
7832 preserve_temp_slots (op0
);
7833 expand_end_bindings (NULL_TREE
, 0, 0);
7838 /* Check for a built-in function. */
7839 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
7840 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
7842 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
7844 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
7845 == BUILT_IN_FRONTEND
)
7846 return (*lang_hooks
.expand_expr
) (exp
, original_target
,
7849 return expand_builtin (exp
, target
, subtarget
, tmode
, ignore
);
7852 return expand_call (exp
, target
, ignore
);
7854 case NON_LVALUE_EXPR
:
7857 case REFERENCE_EXPR
:
7858 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
7861 if (TREE_CODE (type
) == UNION_TYPE
)
7863 tree valtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7865 /* If both input and output are BLKmode, this conversion isn't doing
7866 anything except possibly changing memory attribute. */
7867 if (mode
== BLKmode
&& TYPE_MODE (valtype
) == BLKmode
)
7869 rtx result
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
,
7872 result
= copy_rtx (result
);
7873 set_mem_attributes (result
, exp
, 0);
7878 target
= assign_temp (type
, 0, 1, 1);
7880 if (GET_CODE (target
) == MEM
)
7881 /* Store data into beginning of memory target. */
7882 store_expr (TREE_OPERAND (exp
, 0),
7883 adjust_address (target
, TYPE_MODE (valtype
), 0),
7884 modifier
== EXPAND_STACK_PARM
? 2 : 0);
7886 else if (GET_CODE (target
) == REG
)
7887 /* Store this field into a union of the proper type. */
7888 store_field (target
,
7889 MIN ((int_size_in_bytes (TREE_TYPE
7890 (TREE_OPERAND (exp
, 0)))
7892 (HOST_WIDE_INT
) GET_MODE_BITSIZE (mode
)),
7893 0, TYPE_MODE (valtype
), TREE_OPERAND (exp
, 0),
7894 VOIDmode
, 0, type
, 0);
7898 /* Return the entire union. */
7902 if (mode
== TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
7904 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
,
7907 /* If the signedness of the conversion differs and OP0 is
7908 a promoted SUBREG, clear that indication since we now
7909 have to do the proper extension. */
7910 if (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))) != unsignedp
7911 && GET_CODE (op0
) == SUBREG
)
7912 SUBREG_PROMOTED_VAR_P (op0
) = 0;
7917 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, mode
, modifier
);
7918 if (GET_MODE (op0
) == mode
)
7921 /* If OP0 is a constant, just convert it into the proper mode. */
7922 if (CONSTANT_P (op0
))
7924 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7925 enum machine_mode inner_mode
= TYPE_MODE (inner_type
);
7927 if (modifier
== EXPAND_INITIALIZER
)
7928 return simplify_gen_subreg (mode
, op0
, inner_mode
,
7929 subreg_lowpart_offset (mode
,
7932 return convert_modes (mode
, inner_mode
, op0
,
7933 TREE_UNSIGNED (inner_type
));
7936 if (modifier
== EXPAND_INITIALIZER
)
7937 return gen_rtx_fmt_e (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
);
7941 convert_to_mode (mode
, op0
,
7942 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7944 convert_move (target
, op0
,
7945 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
7948 case VIEW_CONVERT_EXPR
:
7949 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, mode
, modifier
);
7951 /* If the input and output modes are both the same, we are done.
7952 Otherwise, if neither mode is BLKmode and both are within a word, we
7953 can use gen_lowpart. If neither is true, make sure the operand is
7954 in memory and convert the MEM to the new mode. */
7955 if (TYPE_MODE (type
) == GET_MODE (op0
))
7957 else if (TYPE_MODE (type
) != BLKmode
&& GET_MODE (op0
) != BLKmode
7958 && GET_MODE_SIZE (TYPE_MODE (type
)) <= UNITS_PER_WORD
7959 && GET_MODE_SIZE (GET_MODE (op0
)) <= UNITS_PER_WORD
)
7960 op0
= gen_lowpart (TYPE_MODE (type
), op0
);
7961 else if (GET_CODE (op0
) != MEM
)
7963 /* If the operand is not a MEM, force it into memory. Since we
7964 are going to be be changing the mode of the MEM, don't call
7965 force_const_mem for constants because we don't allow pool
7966 constants to change mode. */
7967 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7969 if (TREE_ADDRESSABLE (exp
))
7972 if (target
== 0 || GET_MODE (target
) != TYPE_MODE (inner_type
))
7974 = assign_stack_temp_for_type
7975 (TYPE_MODE (inner_type
),
7976 GET_MODE_SIZE (TYPE_MODE (inner_type
)), 0, inner_type
);
7978 emit_move_insn (target
, op0
);
7982 /* At this point, OP0 is in the correct mode. If the output type is such
7983 that the operand is known to be aligned, indicate that it is.
7984 Otherwise, we need only be concerned about alignment for non-BLKmode
7986 if (GET_CODE (op0
) == MEM
)
7988 op0
= copy_rtx (op0
);
7990 if (TYPE_ALIGN_OK (type
))
7991 set_mem_align (op0
, MAX (MEM_ALIGN (op0
), TYPE_ALIGN (type
)));
7992 else if (TYPE_MODE (type
) != BLKmode
&& STRICT_ALIGNMENT
7993 && MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (TYPE_MODE (type
)))
7995 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7996 HOST_WIDE_INT temp_size
7997 = MAX (int_size_in_bytes (inner_type
),
7998 (HOST_WIDE_INT
) GET_MODE_SIZE (TYPE_MODE (type
)));
7999 rtx
new = assign_stack_temp_for_type (TYPE_MODE (type
),
8000 temp_size
, 0, type
);
8001 rtx new_with_op0_mode
= adjust_address (new, GET_MODE (op0
), 0);
8003 if (TREE_ADDRESSABLE (exp
))
8006 if (GET_MODE (op0
) == BLKmode
)
8007 emit_block_move (new_with_op0_mode
, op0
,
8008 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type
))),
8009 (modifier
== EXPAND_STACK_PARM
8010 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
8012 emit_move_insn (new_with_op0_mode
, op0
);
8017 op0
= adjust_address (op0
, TYPE_MODE (type
), 0);
8023 this_optab
= ! unsignedp
&& flag_trapv
8024 && (GET_MODE_CLASS (mode
) == MODE_INT
)
8025 ? addv_optab
: add_optab
;
8027 /* If we are adding a constant, an RTL_EXPR that is sp, fp, or ap, and
8028 something else, make sure we add the register to the constant and
8029 then to the other thing. This case can occur during strength
8030 reduction and doing it this way will produce better code if the
8031 frame pointer or argument pointer is eliminated.
8033 fold-const.c will ensure that the constant is always in the inner
8034 PLUS_EXPR, so the only case we need to do anything about is if
8035 sp, ap, or fp is our second argument, in which case we must swap
8036 the innermost first argument and our second argument. */
8038 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == PLUS_EXPR
8039 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1)) == INTEGER_CST
8040 && TREE_CODE (TREE_OPERAND (exp
, 1)) == RTL_EXPR
8041 && (RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == frame_pointer_rtx
8042 || RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == stack_pointer_rtx
8043 || RTL_EXPR_RTL (TREE_OPERAND (exp
, 1)) == arg_pointer_rtx
))
8045 tree t
= TREE_OPERAND (exp
, 1);
8047 TREE_OPERAND (exp
, 1) = TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
8048 TREE_OPERAND (TREE_OPERAND (exp
, 0), 0) = t
;
8051 /* If the result is to be ptr_mode and we are adding an integer to
8052 something, we might be forming a constant. So try to use
8053 plus_constant. If it produces a sum and we can't accept it,
8054 use force_operand. This allows P = &ARR[const] to generate
8055 efficient code on machines where a SYMBOL_REF is not a valid
8058 If this is an EXPAND_SUM call, always return the sum. */
8059 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
8060 || (mode
== ptr_mode
&& (unsignedp
|| ! flag_trapv
)))
8062 if (modifier
== EXPAND_STACK_PARM
)
8064 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
8065 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
8066 && TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
8070 op1
= expand_expr (TREE_OPERAND (exp
, 1), subtarget
, VOIDmode
,
8072 /* Use immed_double_const to ensure that the constant is
8073 truncated according to the mode of OP1, then sign extended
8074 to a HOST_WIDE_INT. Using the constant directly can result
8075 in non-canonical RTL in a 64x32 cross compile. */
8077 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 0)),
8079 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))));
8080 op1
= plus_constant (op1
, INTVAL (constant_part
));
8081 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8082 op1
= force_operand (op1
, target
);
8086 else if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
8087 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_INT
8088 && TREE_CONSTANT (TREE_OPERAND (exp
, 0)))
8092 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
8093 (modifier
== EXPAND_INITIALIZER
8094 ? EXPAND_INITIALIZER
: EXPAND_SUM
));
8095 if (! CONSTANT_P (op0
))
8097 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
8098 VOIDmode
, modifier
);
8099 /* Don't go to both_summands if modifier
8100 says it's not right to return a PLUS. */
8101 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8105 /* Use immed_double_const to ensure that the constant is
8106 truncated according to the mode of OP1, then sign extended
8107 to a HOST_WIDE_INT. Using the constant directly can result
8108 in non-canonical RTL in a 64x32 cross compile. */
8110 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1)),
8112 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8113 op0
= plus_constant (op0
, INTVAL (constant_part
));
8114 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8115 op0
= force_operand (op0
, target
);
8120 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8123 /* No sense saving up arithmetic to be done
8124 if it's all in the wrong mode to form part of an address.
8125 And force_operand won't know whether to sign-extend or
8127 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8128 || mode
!= ptr_mode
)
8130 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8131 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8132 if (op0
== const0_rtx
)
8134 if (op1
== const0_rtx
)
8139 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, modifier
);
8140 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, modifier
);
8142 /* We come here from MINUS_EXPR when the second operand is a
8145 /* Make sure any term that's a sum with a constant comes last. */
8146 if (GET_CODE (op0
) == PLUS
8147 && CONSTANT_P (XEXP (op0
, 1)))
8153 /* If adding to a sum including a constant,
8154 associate it to put the constant outside. */
8155 if (GET_CODE (op1
) == PLUS
8156 && CONSTANT_P (XEXP (op1
, 1)))
8158 rtx constant_term
= const0_rtx
;
8160 temp
= simplify_binary_operation (PLUS
, mode
, XEXP (op1
, 0), op0
);
8163 /* Ensure that MULT comes first if there is one. */
8164 else if (GET_CODE (op0
) == MULT
)
8165 op0
= gen_rtx_PLUS (mode
, op0
, XEXP (op1
, 0));
8167 op0
= gen_rtx_PLUS (mode
, XEXP (op1
, 0), op0
);
8169 /* Let's also eliminate constants from op0 if possible. */
8170 op0
= eliminate_constant_term (op0
, &constant_term
);
8172 /* CONSTANT_TERM and XEXP (op1, 1) are known to be constant, so
8173 their sum should be a constant. Form it into OP1, since the
8174 result we want will then be OP0 + OP1. */
8176 temp
= simplify_binary_operation (PLUS
, mode
, constant_term
,
8181 op1
= gen_rtx_PLUS (mode
, constant_term
, XEXP (op1
, 1));
8184 /* Put a constant term last and put a multiplication first. */
8185 if (CONSTANT_P (op0
) || GET_CODE (op1
) == MULT
)
8186 temp
= op1
, op1
= op0
, op0
= temp
;
8188 temp
= simplify_binary_operation (PLUS
, mode
, op0
, op1
);
8189 return temp
? temp
: gen_rtx_PLUS (mode
, op0
, op1
);
8192 /* For initializers, we are allowed to return a MINUS of two
8193 symbolic constants. Here we handle all cases when both operands
8195 /* Handle difference of two symbolic constants,
8196 for the sake of an initializer. */
8197 if ((modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
8198 && really_constant_p (TREE_OPERAND (exp
, 0))
8199 && really_constant_p (TREE_OPERAND (exp
, 1)))
8201 rtx op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
,
8203 rtx op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
,
8206 /* If the last operand is a CONST_INT, use plus_constant of
8207 the negated constant. Else make the MINUS. */
8208 if (GET_CODE (op1
) == CONST_INT
)
8209 return plus_constant (op0
, - INTVAL (op1
));
8211 return gen_rtx_MINUS (mode
, op0
, op1
);
8214 this_optab
= ! unsignedp
&& flag_trapv
8215 && (GET_MODE_CLASS(mode
) == MODE_INT
)
8216 ? subv_optab
: sub_optab
;
8218 /* No sense saving up arithmetic to be done
8219 if it's all in the wrong mode to form part of an address.
8220 And force_operand won't know whether to sign-extend or
8222 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8223 || mode
!= ptr_mode
)
8226 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8229 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, modifier
);
8230 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, modifier
);
8232 /* Convert A - const to A + (-const). */
8233 if (GET_CODE (op1
) == CONST_INT
)
8235 op1
= negate_rtx (mode
, op1
);
8242 /* If first operand is constant, swap them.
8243 Thus the following special case checks need only
8244 check the second operand. */
8245 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
)
8247 tree t1
= TREE_OPERAND (exp
, 0);
8248 TREE_OPERAND (exp
, 0) = TREE_OPERAND (exp
, 1);
8249 TREE_OPERAND (exp
, 1) = t1
;
8252 /* Attempt to return something suitable for generating an
8253 indexed address, for machines that support that. */
8255 if (modifier
== EXPAND_SUM
&& mode
== ptr_mode
8256 && host_integerp (TREE_OPERAND (exp
, 1), 0))
8258 tree exp1
= TREE_OPERAND (exp
, 1);
8260 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
8263 /* If we knew for certain that this is arithmetic for an array
8264 reference, and we knew the bounds of the array, then we could
8265 apply the distributive law across (PLUS X C) for constant C.
8266 Without such knowledge, we risk overflowing the computation
8267 when both X and C are large, but X+C isn't. */
8268 /* ??? Could perhaps special-case EXP being unsigned and C being
8269 positive. In that case we are certain that X+C is no smaller
8270 than X and so the transformed expression will overflow iff the
8271 original would have. */
8273 if (GET_CODE (op0
) != REG
)
8274 op0
= force_operand (op0
, NULL_RTX
);
8275 if (GET_CODE (op0
) != REG
)
8276 op0
= copy_to_mode_reg (mode
, op0
);
8278 return gen_rtx_MULT (mode
, op0
,
8279 gen_int_mode (tree_low_cst (exp1
, 0),
8280 TYPE_MODE (TREE_TYPE (exp1
))));
8283 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8286 if (modifier
== EXPAND_STACK_PARM
)
8289 /* Check for multiplying things that have been extended
8290 from a narrower type. If this machine supports multiplying
8291 in that narrower type with a result in the desired type,
8292 do it that way, and avoid the explicit type-conversion. */
8293 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == NOP_EXPR
8294 && TREE_CODE (type
) == INTEGER_TYPE
8295 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8296 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))))
8297 && ((TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
8298 && int_fits_type_p (TREE_OPERAND (exp
, 1),
8299 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8300 /* Don't use a widening multiply if a shift will do. */
8301 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
8302 > HOST_BITS_PER_WIDE_INT
)
8303 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1))) < 0))
8305 (TREE_CODE (TREE_OPERAND (exp
, 1)) == NOP_EXPR
8306 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
8308 TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))))
8309 /* If both operands are extended, they must either both
8310 be zero-extended or both be sign-extended. */
8311 && (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
8313 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))))))
8315 enum machine_mode innermode
8316 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)));
8317 optab other_optab
= (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8318 ? smul_widen_optab
: umul_widen_optab
);
8319 this_optab
= (TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8320 ? umul_widen_optab
: smul_widen_optab
);
8321 if (mode
== GET_MODE_WIDER_MODE (innermode
))
8323 if (this_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
)
8325 op0
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8326 NULL_RTX
, VOIDmode
, 0);
8327 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
8328 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
8331 op1
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0),
8332 NULL_RTX
, VOIDmode
, 0);
8335 else if (other_optab
->handlers
[(int) mode
].insn_code
!= CODE_FOR_nothing
8336 && innermode
== word_mode
)
8339 op0
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8340 NULL_RTX
, VOIDmode
, 0);
8341 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
8342 op1
= convert_modes (innermode
, mode
,
8343 expand_expr (TREE_OPERAND (exp
, 1),
8344 NULL_RTX
, VOIDmode
, 0),
8347 op1
= expand_expr (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0),
8348 NULL_RTX
, VOIDmode
, 0);
8349 temp
= expand_binop (mode
, other_optab
, op0
, op1
, target
,
8350 unsignedp
, OPTAB_LIB_WIDEN
);
8351 htem
= expand_mult_highpart_adjust (innermode
,
8352 gen_highpart (innermode
, temp
),
8354 gen_highpart (innermode
, temp
),
8356 emit_move_insn (gen_highpart (innermode
, temp
), htem
);
8361 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8362 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8363 return expand_mult (mode
, op0
, op1
, target
, unsignedp
);
8365 case TRUNC_DIV_EXPR
:
8366 case FLOOR_DIV_EXPR
:
8368 case ROUND_DIV_EXPR
:
8369 case EXACT_DIV_EXPR
:
8370 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8372 if (modifier
== EXPAND_STACK_PARM
)
8374 /* Possible optimization: compute the dividend with EXPAND_SUM
8375 then if the divisor is constant can optimize the case
8376 where some terms of the dividend have coeffs divisible by it. */
8377 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8378 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8379 return expand_divmod (0, code
, mode
, op0
, op1
, target
, unsignedp
);
8382 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
8383 expensive divide. If not, combine will rebuild the original
8385 if (flag_unsafe_math_optimizations
&& optimize
&& !optimize_size
8386 && TREE_CODE (type
) == REAL_TYPE
8387 && !real_onep (TREE_OPERAND (exp
, 0)))
8388 return expand_expr (build (MULT_EXPR
, type
, TREE_OPERAND (exp
, 0),
8389 build (RDIV_EXPR
, type
,
8390 build_real (type
, dconst1
),
8391 TREE_OPERAND (exp
, 1))),
8392 target
, tmode
, modifier
);
8393 this_optab
= sdiv_optab
;
8396 case TRUNC_MOD_EXPR
:
8397 case FLOOR_MOD_EXPR
:
8399 case ROUND_MOD_EXPR
:
8400 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8402 if (modifier
== EXPAND_STACK_PARM
)
8404 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8405 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8406 return expand_divmod (1, code
, mode
, op0
, op1
, target
, unsignedp
);
8408 case FIX_ROUND_EXPR
:
8409 case FIX_FLOOR_EXPR
:
8411 abort (); /* Not used for C. */
8413 case FIX_TRUNC_EXPR
:
8414 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
8415 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8416 target
= gen_reg_rtx (mode
);
8417 expand_fix (target
, op0
, unsignedp
);
8421 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
8422 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8423 target
= gen_reg_rtx (mode
);
8424 /* expand_float can't figure out what to do if FROM has VOIDmode.
8425 So give it the correct mode. With -O, cse will optimize this. */
8426 if (GET_MODE (op0
) == VOIDmode
)
8427 op0
= copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
8429 expand_float (target
, op0
,
8430 TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8434 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8435 if (modifier
== EXPAND_STACK_PARM
)
8437 temp
= expand_unop (mode
,
8438 ! unsignedp
&& flag_trapv
8439 && (GET_MODE_CLASS(mode
) == MODE_INT
)
8440 ? negv_optab
: neg_optab
, op0
, target
, 0);
8446 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8447 if (modifier
== EXPAND_STACK_PARM
)
8450 /* Handle complex values specially. */
8451 if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_INT
8452 || GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
8453 return expand_complex_abs (mode
, op0
, target
, unsignedp
);
8455 /* Unsigned abs is simply the operand. Testing here means we don't
8456 risk generating incorrect code below. */
8457 if (TREE_UNSIGNED (type
))
8460 return expand_abs (mode
, op0
, target
, unsignedp
,
8461 safe_from_p (target
, TREE_OPERAND (exp
, 0), 1));
8465 target
= original_target
;
8467 || modifier
== EXPAND_STACK_PARM
8468 || ! safe_from_p (target
, TREE_OPERAND (exp
, 1), 1)
8469 || (GET_CODE (target
) == MEM
&& MEM_VOLATILE_P (target
))
8470 || GET_MODE (target
) != mode
8471 || (GET_CODE (target
) == REG
8472 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
8473 target
= gen_reg_rtx (mode
);
8474 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
8475 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
, 0);
8477 /* First try to do it with a special MIN or MAX instruction.
8478 If that does not win, use a conditional jump to select the proper
8480 this_optab
= (TREE_UNSIGNED (type
)
8481 ? (code
== MIN_EXPR
? umin_optab
: umax_optab
)
8482 : (code
== MIN_EXPR
? smin_optab
: smax_optab
));
8484 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
8489 /* At this point, a MEM target is no longer useful; we will get better
8492 if (GET_CODE (target
) == MEM
)
8493 target
= gen_reg_rtx (mode
);
8496 emit_move_insn (target
, op0
);
8498 op0
= gen_label_rtx ();
8500 /* If this mode is an integer too wide to compare properly,
8501 compare word by word. Rely on cse to optimize constant cases. */
8502 if (GET_MODE_CLASS (mode
) == MODE_INT
8503 && ! can_compare_p (GE
, mode
, ccp_jump
))
8505 if (code
== MAX_EXPR
)
8506 do_jump_by_parts_greater_rtx (mode
, TREE_UNSIGNED (type
),
8507 target
, op1
, NULL_RTX
, op0
);
8509 do_jump_by_parts_greater_rtx (mode
, TREE_UNSIGNED (type
),
8510 op1
, target
, NULL_RTX
, op0
);
8514 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 1)));
8515 do_compare_rtx_and_jump (target
, op1
, code
== MAX_EXPR
? GE
: LE
,
8516 unsignedp
, mode
, NULL_RTX
, NULL_RTX
,
8519 emit_move_insn (target
, op1
);
8524 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8525 if (modifier
== EXPAND_STACK_PARM
)
8527 temp
= expand_unop (mode
, one_cmpl_optab
, op0
, target
, 1);
8533 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8534 if (modifier
== EXPAND_STACK_PARM
)
8536 temp
= expand_unop (mode
, ffs_optab
, op0
, target
, 1);
8542 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8543 temp
= expand_unop (mode
, clz_optab
, op0
, target
, 1);
8549 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8550 temp
= expand_unop (mode
, ctz_optab
, op0
, target
, 1);
8556 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8557 temp
= expand_unop (mode
, popcount_optab
, op0
, target
, 1);
8563 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8564 temp
= expand_unop (mode
, parity_optab
, op0
, target
, 1);
8569 /* ??? Can optimize bitwise operations with one arg constant.
8570 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8571 and (a bitwise1 b) bitwise2 b (etc)
8572 but that is probably not worth while. */
8574 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8575 boolean values when we want in all cases to compute both of them. In
8576 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8577 as actual zero-or-1 values and then bitwise anding. In cases where
8578 there cannot be any side effects, better code would be made by
8579 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8580 how to recognize those cases. */
8582 case TRUTH_AND_EXPR
:
8584 this_optab
= and_optab
;
8589 this_optab
= ior_optab
;
8592 case TRUTH_XOR_EXPR
:
8594 this_optab
= xor_optab
;
8601 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8603 if (modifier
== EXPAND_STACK_PARM
)
8605 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
8606 return expand_shift (code
, mode
, op0
, TREE_OPERAND (exp
, 1), target
,
8609 /* Could determine the answer when only additive constants differ. Also,
8610 the addition of one can be handled by changing the condition. */
8617 case UNORDERED_EXPR
:
8624 temp
= do_store_flag (exp
,
8625 modifier
!= EXPAND_STACK_PARM
? target
: NULL_RTX
,
8626 tmode
!= VOIDmode
? tmode
: mode
, 0);
8630 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8631 if (code
== NE_EXPR
&& integer_zerop (TREE_OPERAND (exp
, 1))
8633 && GET_CODE (original_target
) == REG
8634 && (GET_MODE (original_target
)
8635 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
8637 temp
= expand_expr (TREE_OPERAND (exp
, 0), original_target
,
8640 /* If temp is constant, we can just compute the result. */
8641 if (GET_CODE (temp
) == CONST_INT
)
8643 if (INTVAL (temp
) != 0)
8644 emit_move_insn (target
, const1_rtx
);
8646 emit_move_insn (target
, const0_rtx
);
8651 if (temp
!= original_target
)
8653 enum machine_mode mode1
= GET_MODE (temp
);
8654 if (mode1
== VOIDmode
)
8655 mode1
= tmode
!= VOIDmode
? tmode
: mode
;
8657 temp
= copy_to_mode_reg (mode1
, temp
);
8660 op1
= gen_label_rtx ();
8661 emit_cmp_and_jump_insns (temp
, const0_rtx
, EQ
, NULL_RTX
,
8662 GET_MODE (temp
), unsignedp
, op1
);
8663 emit_move_insn (temp
, const1_rtx
);
8668 /* If no set-flag instruction, must generate a conditional
8669 store into a temporary variable. Drop through
8670 and handle this like && and ||. */
8672 case TRUTH_ANDIF_EXPR
:
8673 case TRUTH_ORIF_EXPR
:
8676 || modifier
== EXPAND_STACK_PARM
8677 || ! safe_from_p (target
, exp
, 1)
8678 /* Make sure we don't have a hard reg (such as function's return
8679 value) live across basic blocks, if not optimizing. */
8680 || (!optimize
&& GET_CODE (target
) == REG
8681 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)))
8682 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
8685 emit_clr_insn (target
);
8687 op1
= gen_label_rtx ();
8688 jumpifnot (exp
, op1
);
8691 emit_0_to_1_insn (target
);
8694 return ignore
? const0_rtx
: target
;
8696 case TRUTH_NOT_EXPR
:
8697 if (modifier
== EXPAND_STACK_PARM
)
8699 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
, 0);
8700 /* The parser is careful to generate TRUTH_NOT_EXPR
8701 only with operands that are always zero or one. */
8702 temp
= expand_binop (mode
, xor_optab
, op0
, const1_rtx
,
8703 target
, 1, OPTAB_LIB_WIDEN
);
8709 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, 0);
8711 return expand_expr (TREE_OPERAND (exp
, 1),
8712 (ignore
? const0_rtx
: target
),
8713 VOIDmode
, modifier
);
8716 /* If we would have a "singleton" (see below) were it not for a
8717 conversion in each arm, bring that conversion back out. */
8718 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == NOP_EXPR
8719 && TREE_CODE (TREE_OPERAND (exp
, 2)) == NOP_EXPR
8720 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0))
8721 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 2), 0))))
8723 tree iftrue
= TREE_OPERAND (TREE_OPERAND (exp
, 1), 0);
8724 tree iffalse
= TREE_OPERAND (TREE_OPERAND (exp
, 2), 0);
8726 if ((TREE_CODE_CLASS (TREE_CODE (iftrue
)) == '2'
8727 && operand_equal_p (iffalse
, TREE_OPERAND (iftrue
, 0), 0))
8728 || (TREE_CODE_CLASS (TREE_CODE (iffalse
)) == '2'
8729 && operand_equal_p (iftrue
, TREE_OPERAND (iffalse
, 0), 0))
8730 || (TREE_CODE_CLASS (TREE_CODE (iftrue
)) == '1'
8731 && operand_equal_p (iffalse
, TREE_OPERAND (iftrue
, 0), 0))
8732 || (TREE_CODE_CLASS (TREE_CODE (iffalse
)) == '1'
8733 && operand_equal_p (iftrue
, TREE_OPERAND (iffalse
, 0), 0)))
8734 return expand_expr (build1 (NOP_EXPR
, type
,
8735 build (COND_EXPR
, TREE_TYPE (iftrue
),
8736 TREE_OPERAND (exp
, 0),
8738 target
, tmode
, modifier
);
8742 /* Note that COND_EXPRs whose type is a structure or union
8743 are required to be constructed to contain assignments of
8744 a temporary variable, so that we can evaluate them here
8745 for side effect only. If type is void, we must do likewise. */
8747 /* If an arm of the branch requires a cleanup,
8748 only that cleanup is performed. */
8751 tree binary_op
= 0, unary_op
= 0;
8753 /* If this is (A ? 1 : 0) and A is a condition, just evaluate it and
8754 convert it to our mode, if necessary. */
8755 if (integer_onep (TREE_OPERAND (exp
, 1))
8756 && integer_zerop (TREE_OPERAND (exp
, 2))
8757 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<')
8761 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
8766 if (modifier
== EXPAND_STACK_PARM
)
8768 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, mode
, modifier
);
8769 if (GET_MODE (op0
) == mode
)
8773 target
= gen_reg_rtx (mode
);
8774 convert_move (target
, op0
, unsignedp
);
8778 /* Check for X ? A + B : A. If we have this, we can copy A to the
8779 output and conditionally add B. Similarly for unary operations.
8780 Don't do this if X has side-effects because those side effects
8781 might affect A or B and the "?" operation is a sequence point in
8782 ANSI. (operand_equal_p tests for side effects.) */
8784 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 1))) == '2'
8785 && operand_equal_p (TREE_OPERAND (exp
, 2),
8786 TREE_OPERAND (TREE_OPERAND (exp
, 1), 0), 0))
8787 singleton
= TREE_OPERAND (exp
, 2), binary_op
= TREE_OPERAND (exp
, 1);
8788 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 2))) == '2'
8789 && operand_equal_p (TREE_OPERAND (exp
, 1),
8790 TREE_OPERAND (TREE_OPERAND (exp
, 2), 0), 0))
8791 singleton
= TREE_OPERAND (exp
, 1), binary_op
= TREE_OPERAND (exp
, 2);
8792 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 1))) == '1'
8793 && operand_equal_p (TREE_OPERAND (exp
, 2),
8794 TREE_OPERAND (TREE_OPERAND (exp
, 1), 0), 0))
8795 singleton
= TREE_OPERAND (exp
, 2), unary_op
= TREE_OPERAND (exp
, 1);
8796 else if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 2))) == '1'
8797 && operand_equal_p (TREE_OPERAND (exp
, 1),
8798 TREE_OPERAND (TREE_OPERAND (exp
, 2), 0), 0))
8799 singleton
= TREE_OPERAND (exp
, 1), unary_op
= TREE_OPERAND (exp
, 2);
8801 /* If we are not to produce a result, we have no target. Otherwise,
8802 if a target was specified use it; it will not be used as an
8803 intermediate target unless it is safe. If no target, use a
8808 else if (modifier
== EXPAND_STACK_PARM
)
8809 temp
= assign_temp (type
, 0, 0, 1);
8810 else if (original_target
8811 && (safe_from_p (original_target
, TREE_OPERAND (exp
, 0), 1)
8812 || (singleton
&& GET_CODE (original_target
) == REG
8813 && REGNO (original_target
) >= FIRST_PSEUDO_REGISTER
8814 && original_target
== var_rtx (singleton
)))
8815 && GET_MODE (original_target
) == mode
8816 #ifdef HAVE_conditional_move
8817 && (! can_conditionally_move_p (mode
)
8818 || GET_CODE (original_target
) == REG
8819 || TREE_ADDRESSABLE (type
))
8821 && (GET_CODE (original_target
) != MEM
8822 || TREE_ADDRESSABLE (type
)))
8823 temp
= original_target
;
8824 else if (TREE_ADDRESSABLE (type
))
8827 temp
= assign_temp (type
, 0, 0, 1);
8829 /* If we had X ? A + C : A, with C a constant power of 2, and we can
8830 do the test of X as a store-flag operation, do this as
8831 A + ((X != 0) << log C). Similarly for other simple binary
8832 operators. Only do for C == 1 if BRANCH_COST is low. */
8833 if (temp
&& singleton
&& binary_op
8834 && (TREE_CODE (binary_op
) == PLUS_EXPR
8835 || TREE_CODE (binary_op
) == MINUS_EXPR
8836 || TREE_CODE (binary_op
) == BIT_IOR_EXPR
8837 || TREE_CODE (binary_op
) == BIT_XOR_EXPR
)
8838 && (BRANCH_COST
>= 3 ? integer_pow2p (TREE_OPERAND (binary_op
, 1))
8839 : integer_onep (TREE_OPERAND (binary_op
, 1)))
8840 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<')
8844 optab boptab
= (TREE_CODE (binary_op
) == PLUS_EXPR
8845 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op
))
8846 ? addv_optab
: add_optab
)
8847 : TREE_CODE (binary_op
) == MINUS_EXPR
8848 ? (TYPE_TRAP_SIGNED (TREE_TYPE (binary_op
))
8849 ? subv_optab
: sub_optab
)
8850 : TREE_CODE (binary_op
) == BIT_IOR_EXPR
? ior_optab
8853 /* If we had X ? A : A + 1, do this as A + (X == 0). */
8854 if (singleton
== TREE_OPERAND (exp
, 1))
8855 cond
= invert_truthvalue (TREE_OPERAND (exp
, 0));
8857 cond
= TREE_OPERAND (exp
, 0);
8859 result
= do_store_flag (cond
, (safe_from_p (temp
, singleton
, 1)
8861 mode
, BRANCH_COST
<= 1);
8863 if (result
!= 0 && ! integer_onep (TREE_OPERAND (binary_op
, 1)))
8864 result
= expand_shift (LSHIFT_EXPR
, mode
, result
,
8865 build_int_2 (tree_log2
8869 (safe_from_p (temp
, singleton
, 1)
8870 ? temp
: NULL_RTX
), 0);
8874 op1
= expand_expr (singleton
, NULL_RTX
, VOIDmode
, 0);
8875 return expand_binop (mode
, boptab
, op1
, result
, temp
,
8876 unsignedp
, OPTAB_LIB_WIDEN
);
8880 do_pending_stack_adjust ();
8882 op0
= gen_label_rtx ();
8884 if (singleton
&& ! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0)))
8888 /* If the target conflicts with the other operand of the
8889 binary op, we can't use it. Also, we can't use the target
8890 if it is a hard register, because evaluating the condition
8891 might clobber it. */
8893 && ! safe_from_p (temp
, TREE_OPERAND (binary_op
, 1), 1))
8894 || (GET_CODE (temp
) == REG
8895 && REGNO (temp
) < FIRST_PSEUDO_REGISTER
))
8896 temp
= gen_reg_rtx (mode
);
8897 store_expr (singleton
, temp
,
8898 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8901 expand_expr (singleton
,
8902 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
8903 if (singleton
== TREE_OPERAND (exp
, 1))
8904 jumpif (TREE_OPERAND (exp
, 0), op0
);
8906 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
8908 start_cleanup_deferral ();
8909 if (binary_op
&& temp
== 0)
8910 /* Just touch the other operand. */
8911 expand_expr (TREE_OPERAND (binary_op
, 1),
8912 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
8914 store_expr (build (TREE_CODE (binary_op
), type
,
8915 make_tree (type
, temp
),
8916 TREE_OPERAND (binary_op
, 1)),
8917 temp
, modifier
== EXPAND_STACK_PARM
? 2 : 0);
8919 store_expr (build1 (TREE_CODE (unary_op
), type
,
8920 make_tree (type
, temp
)),
8921 temp
, modifier
== EXPAND_STACK_PARM
? 2 : 0);
8924 /* Check for A op 0 ? A : FOO and A op 0 ? FOO : A where OP is any
8925 comparison operator. If we have one of these cases, set the
8926 output to A, branch on A (cse will merge these two references),
8927 then set the output to FOO. */
8929 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<'
8930 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1))
8931 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8932 TREE_OPERAND (exp
, 1), 0)
8933 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0))
8934 || TREE_CODE (TREE_OPERAND (exp
, 1)) == SAVE_EXPR
)
8935 && safe_from_p (temp
, TREE_OPERAND (exp
, 2), 1))
8937 if (GET_CODE (temp
) == REG
8938 && REGNO (temp
) < FIRST_PSEUDO_REGISTER
)
8939 temp
= gen_reg_rtx (mode
);
8940 store_expr (TREE_OPERAND (exp
, 1), temp
,
8941 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8942 jumpif (TREE_OPERAND (exp
, 0), op0
);
8944 start_cleanup_deferral ();
8945 store_expr (TREE_OPERAND (exp
, 2), temp
,
8946 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8950 && TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == '<'
8951 && integer_zerop (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1))
8952 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8953 TREE_OPERAND (exp
, 2), 0)
8954 && (! TREE_SIDE_EFFECTS (TREE_OPERAND (exp
, 0))
8955 || TREE_CODE (TREE_OPERAND (exp
, 2)) == SAVE_EXPR
)
8956 && safe_from_p (temp
, TREE_OPERAND (exp
, 1), 1))
8958 if (GET_CODE (temp
) == REG
8959 && REGNO (temp
) < FIRST_PSEUDO_REGISTER
)
8960 temp
= gen_reg_rtx (mode
);
8961 store_expr (TREE_OPERAND (exp
, 2), temp
,
8962 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8963 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
8965 start_cleanup_deferral ();
8966 store_expr (TREE_OPERAND (exp
, 1), temp
,
8967 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8972 op1
= gen_label_rtx ();
8973 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
8975 start_cleanup_deferral ();
8977 /* One branch of the cond can be void, if it never returns. For
8978 example A ? throw : E */
8980 && TREE_TYPE (TREE_OPERAND (exp
, 1)) != void_type_node
)
8981 store_expr (TREE_OPERAND (exp
, 1), temp
,
8982 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8984 expand_expr (TREE_OPERAND (exp
, 1),
8985 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
8986 end_cleanup_deferral ();
8988 emit_jump_insn (gen_jump (op1
));
8991 start_cleanup_deferral ();
8993 && TREE_TYPE (TREE_OPERAND (exp
, 2)) != void_type_node
)
8994 store_expr (TREE_OPERAND (exp
, 2), temp
,
8995 modifier
== EXPAND_STACK_PARM
? 2 : 0);
8997 expand_expr (TREE_OPERAND (exp
, 2),
8998 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
, 0);
9001 end_cleanup_deferral ();
9012 /* Something needs to be initialized, but we didn't know
9013 where that thing was when building the tree. For example,
9014 it could be the return value of a function, or a parameter
9015 to a function which lays down in the stack, or a temporary
9016 variable which must be passed by reference.
9018 We guarantee that the expression will either be constructed
9019 or copied into our original target. */
9021 tree slot
= TREE_OPERAND (exp
, 0);
9022 tree cleanups
= NULL_TREE
;
9025 if (TREE_CODE (slot
) != VAR_DECL
)
9029 target
= original_target
;
9031 /* Set this here so that if we get a target that refers to a
9032 register variable that's already been used, put_reg_into_stack
9033 knows that it should fix up those uses. */
9034 TREE_USED (slot
) = 1;
9038 if (DECL_RTL_SET_P (slot
))
9040 target
= DECL_RTL (slot
);
9041 /* If we have already expanded the slot, so don't do
9043 if (TREE_OPERAND (exp
, 1) == NULL_TREE
)
9048 target
= assign_temp (type
, 2, 0, 1);
9049 /* All temp slots at this level must not conflict. */
9050 preserve_temp_slots (target
);
9051 SET_DECL_RTL (slot
, target
);
9052 if (TREE_ADDRESSABLE (slot
))
9053 put_var_into_stack (slot
, /*rescan=*/false);
9055 /* Since SLOT is not known to the called function
9056 to belong to its stack frame, we must build an explicit
9057 cleanup. This case occurs when we must build up a reference
9058 to pass the reference as an argument. In this case,
9059 it is very likely that such a reference need not be
9062 if (TREE_OPERAND (exp
, 2) == 0)
9063 TREE_OPERAND (exp
, 2)
9064 = (*lang_hooks
.maybe_build_cleanup
) (slot
);
9065 cleanups
= TREE_OPERAND (exp
, 2);
9070 /* This case does occur, when expanding a parameter which
9071 needs to be constructed on the stack. The target
9072 is the actual stack address that we want to initialize.
9073 The function we call will perform the cleanup in this case. */
9075 /* If we have already assigned it space, use that space,
9076 not target that we were passed in, as our target
9077 parameter is only a hint. */
9078 if (DECL_RTL_SET_P (slot
))
9080 target
= DECL_RTL (slot
);
9081 /* If we have already expanded the slot, so don't do
9083 if (TREE_OPERAND (exp
, 1) == NULL_TREE
)
9088 SET_DECL_RTL (slot
, target
);
9089 /* If we must have an addressable slot, then make sure that
9090 the RTL that we just stored in slot is OK. */
9091 if (TREE_ADDRESSABLE (slot
))
9092 put_var_into_stack (slot
, /*rescan=*/true);
9096 exp1
= TREE_OPERAND (exp
, 3) = TREE_OPERAND (exp
, 1);
9097 /* Mark it as expanded. */
9098 TREE_OPERAND (exp
, 1) = NULL_TREE
;
9100 store_expr (exp1
, target
, modifier
== EXPAND_STACK_PARM
? 2 : 0);
9102 expand_decl_cleanup_eh (NULL_TREE
, cleanups
, CLEANUP_EH_ONLY (exp
));
9109 tree lhs
= TREE_OPERAND (exp
, 0);
9110 tree rhs
= TREE_OPERAND (exp
, 1);
9112 temp
= expand_assignment (lhs
, rhs
, ! ignore
, original_target
!= 0);
9118 /* If lhs is complex, expand calls in rhs before computing it.
9119 That's so we don't compute a pointer and save it over a
9120 call. If lhs is simple, compute it first so we can give it
9121 as a target if the rhs is just a call. This avoids an
9122 extra temp and copy and that prevents a partial-subsumption
9123 which makes bad code. Actually we could treat
9124 component_ref's of vars like vars. */
9126 tree lhs
= TREE_OPERAND (exp
, 0);
9127 tree rhs
= TREE_OPERAND (exp
, 1);
9131 /* Check for |= or &= of a bitfield of size one into another bitfield
9132 of size 1. In this case, (unless we need the result of the
9133 assignment) we can do this more efficiently with a
9134 test followed by an assignment, if necessary.
9136 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9137 things change so we do, this code should be enhanced to
9140 && TREE_CODE (lhs
) == COMPONENT_REF
9141 && (TREE_CODE (rhs
) == BIT_IOR_EXPR
9142 || TREE_CODE (rhs
) == BIT_AND_EXPR
)
9143 && TREE_OPERAND (rhs
, 0) == lhs
9144 && TREE_CODE (TREE_OPERAND (rhs
, 1)) == COMPONENT_REF
9145 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs
, 1)))
9146 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs
, 1), 1))))
9148 rtx label
= gen_label_rtx ();
9150 do_jump (TREE_OPERAND (rhs
, 1),
9151 TREE_CODE (rhs
) == BIT_IOR_EXPR
? label
: 0,
9152 TREE_CODE (rhs
) == BIT_AND_EXPR
? label
: 0);
9153 expand_assignment (lhs
, convert (TREE_TYPE (rhs
),
9154 (TREE_CODE (rhs
) == BIT_IOR_EXPR
9156 : integer_zero_node
)),
9158 do_pending_stack_adjust ();
9163 temp
= expand_assignment (lhs
, rhs
, ! ignore
, original_target
!= 0);
9169 if (!TREE_OPERAND (exp
, 0))
9170 expand_null_return ();
9172 expand_return (TREE_OPERAND (exp
, 0));
9175 case PREINCREMENT_EXPR
:
9176 case PREDECREMENT_EXPR
:
9177 return expand_increment (exp
, 0, ignore
);
9179 case POSTINCREMENT_EXPR
:
9180 case POSTDECREMENT_EXPR
:
9181 /* Faster to treat as pre-increment if result is not used. */
9182 return expand_increment (exp
, ! ignore
, ignore
);
9185 if (modifier
== EXPAND_STACK_PARM
)
9187 /* Are we taking the address of a nested function? */
9188 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == FUNCTION_DECL
9189 && decl_function_context (TREE_OPERAND (exp
, 0)) != 0
9190 && ! DECL_NO_STATIC_CHAIN (TREE_OPERAND (exp
, 0))
9191 && ! TREE_STATIC (exp
))
9193 op0
= trampoline_address (TREE_OPERAND (exp
, 0));
9194 op0
= force_operand (op0
, target
);
9196 /* If we are taking the address of something erroneous, just
9198 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ERROR_MARK
)
9200 /* If we are taking the address of a constant and are at the
9201 top level, we have to use output_constant_def since we can't
9202 call force_const_mem at top level. */
9204 && (TREE_CODE (TREE_OPERAND (exp
, 0)) == CONSTRUCTOR
9205 || (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0)))
9207 op0
= XEXP (output_constant_def (TREE_OPERAND (exp
, 0), 0), 0);
9210 /* We make sure to pass const0_rtx down if we came in with
9211 ignore set, to avoid doing the cleanups twice for something. */
9212 op0
= expand_expr (TREE_OPERAND (exp
, 0),
9213 ignore
? const0_rtx
: NULL_RTX
, VOIDmode
,
9214 (modifier
== EXPAND_INITIALIZER
9215 ? modifier
: EXPAND_CONST_ADDRESS
));
9217 /* If we are going to ignore the result, OP0 will have been set
9218 to const0_rtx, so just return it. Don't get confused and
9219 think we are taking the address of the constant. */
9223 /* Pass 1 for MODIFY, so that protect_from_queue doesn't get
9224 clever and returns a REG when given a MEM. */
9225 op0
= protect_from_queue (op0
, 1);
9227 /* We would like the object in memory. If it is a constant, we can
9228 have it be statically allocated into memory. For a non-constant,
9229 we need to allocate some memory and store the value into it. */
9231 if (CONSTANT_P (op0
))
9232 op0
= force_const_mem (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
9234 else if (GET_CODE (op0
) == REG
|| GET_CODE (op0
) == SUBREG
9235 || GET_CODE (op0
) == CONCAT
|| GET_CODE (op0
) == ADDRESSOF
9236 || GET_CODE (op0
) == PARALLEL
)
9238 /* If the operand is a SAVE_EXPR, we can deal with this by
9239 forcing the SAVE_EXPR into memory. */
9240 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == SAVE_EXPR
)
9242 put_var_into_stack (TREE_OPERAND (exp
, 0),
9244 op0
= SAVE_EXPR_RTL (TREE_OPERAND (exp
, 0));
9248 /* If this object is in a register, it can't be BLKmode. */
9249 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
9250 rtx memloc
= assign_temp (inner_type
, 1, 1, 1);
9252 if (GET_CODE (op0
) == PARALLEL
)
9253 /* Handle calls that pass values in multiple
9254 non-contiguous locations. The Irix 6 ABI has examples
9256 emit_group_store (memloc
, op0
,
9257 int_size_in_bytes (inner_type
));
9259 emit_move_insn (memloc
, op0
);
9265 if (GET_CODE (op0
) != MEM
)
9268 mark_temp_addr_taken (op0
);
9269 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
9271 op0
= XEXP (op0
, 0);
9272 #ifdef POINTERS_EXTEND_UNSIGNED
9273 if (GET_MODE (op0
) == Pmode
&& GET_MODE (op0
) != mode
9274 && mode
== ptr_mode
)
9275 op0
= convert_memory_address (ptr_mode
, op0
);
9280 /* If OP0 is not aligned as least as much as the type requires, we
9281 need to make a temporary, copy OP0 to it, and take the address of
9282 the temporary. We want to use the alignment of the type, not of
9283 the operand. Note that this is incorrect for FUNCTION_TYPE, but
9284 the test for BLKmode means that can't happen. The test for
9285 BLKmode is because we never make mis-aligned MEMs with
9288 We don't need to do this at all if the machine doesn't have
9289 strict alignment. */
9290 if (STRICT_ALIGNMENT
&& GET_MODE (op0
) == BLKmode
9291 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0)))
9293 && MEM_ALIGN (op0
) < BIGGEST_ALIGNMENT
)
9295 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
9298 if (TYPE_ALIGN_OK (inner_type
))
9301 if (TREE_ADDRESSABLE (inner_type
))
9303 /* We can't make a bitwise copy of this object, so fail. */
9304 error ("cannot take the address of an unaligned member");
9308 new = assign_stack_temp_for_type
9309 (TYPE_MODE (inner_type
),
9310 MEM_SIZE (op0
) ? INTVAL (MEM_SIZE (op0
))
9311 : int_size_in_bytes (inner_type
),
9312 1, build_qualified_type (inner_type
,
9313 (TYPE_QUALS (inner_type
)
9314 | TYPE_QUAL_CONST
)));
9316 emit_block_move (new, op0
, expr_size (TREE_OPERAND (exp
, 0)),
9317 (modifier
== EXPAND_STACK_PARM
9318 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
9323 op0
= force_operand (XEXP (op0
, 0), target
);
9327 && GET_CODE (op0
) != REG
9328 && modifier
!= EXPAND_CONST_ADDRESS
9329 && modifier
!= EXPAND_INITIALIZER
9330 && modifier
!= EXPAND_SUM
)
9331 op0
= force_reg (Pmode
, op0
);
9333 if (GET_CODE (op0
) == REG
9334 && ! REG_USERVAR_P (op0
))
9335 mark_reg_pointer (op0
, TYPE_ALIGN (TREE_TYPE (type
)));
9337 #ifdef POINTERS_EXTEND_UNSIGNED
9338 if (GET_MODE (op0
) == Pmode
&& GET_MODE (op0
) != mode
9339 && mode
== ptr_mode
)
9340 op0
= convert_memory_address (ptr_mode
, op0
);
9345 case ENTRY_VALUE_EXPR
:
9348 /* COMPLEX type for Extended Pascal & Fortran */
9351 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
9354 /* Get the rtx code of the operands. */
9355 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
9356 op1
= expand_expr (TREE_OPERAND (exp
, 1), 0, VOIDmode
, 0);
9359 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
9363 /* Move the real (op0) and imaginary (op1) parts to their location. */
9364 emit_move_insn (gen_realpart (mode
, target
), op0
);
9365 emit_move_insn (gen_imagpart (mode
, target
), op1
);
9367 insns
= get_insns ();
9370 /* Complex construction should appear as a single unit. */
9371 /* If TARGET is a CONCAT, we got insns like RD = RS, ID = IS,
9372 each with a separate pseudo as destination.
9373 It's not correct for flow to treat them as a unit. */
9374 if (GET_CODE (target
) != CONCAT
)
9375 emit_no_conflict_block (insns
, target
, op0
, op1
, NULL_RTX
);
9383 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
9384 return gen_realpart (mode
, op0
);
9387 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
9388 return gen_imagpart (mode
, op0
);
9392 enum machine_mode partmode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
9396 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
9399 target
= gen_reg_rtx (mode
);
9403 /* Store the realpart and the negated imagpart to target. */
9404 emit_move_insn (gen_realpart (partmode
, target
),
9405 gen_realpart (partmode
, op0
));
9407 imag_t
= gen_imagpart (partmode
, target
);
9408 temp
= expand_unop (partmode
,
9409 ! unsignedp
&& flag_trapv
9410 && (GET_MODE_CLASS(partmode
) == MODE_INT
)
9411 ? negv_optab
: neg_optab
,
9412 gen_imagpart (partmode
, op0
), imag_t
, 0);
9414 emit_move_insn (imag_t
, temp
);
9416 insns
= get_insns ();
9419 /* Conjugate should appear as a single unit
9420 If TARGET is a CONCAT, we got insns like RD = RS, ID = - IS,
9421 each with a separate pseudo as destination.
9422 It's not correct for flow to treat them as a unit. */
9423 if (GET_CODE (target
) != CONCAT
)
9424 emit_no_conflict_block (insns
, target
, op0
, NULL_RTX
, NULL_RTX
);
9431 case TRY_CATCH_EXPR
:
9433 tree handler
= TREE_OPERAND (exp
, 1);
9435 expand_eh_region_start ();
9437 op0
= expand_expr (TREE_OPERAND (exp
, 0), 0, VOIDmode
, 0);
9439 expand_eh_region_end_cleanup (handler
);
9444 case TRY_FINALLY_EXPR
:
9446 tree try_block
= TREE_OPERAND (exp
, 0);
9447 tree finally_block
= TREE_OPERAND (exp
, 1);
9449 if (!optimize
|| unsafe_for_reeval (finally_block
) > 1)
9451 /* In this case, wrapping FINALLY_BLOCK in an UNSAVE_EXPR
9452 is not sufficient, so we cannot expand the block twice.
9453 So we play games with GOTO_SUBROUTINE_EXPR to let us
9454 expand the thing only once. */
9455 /* When not optimizing, we go ahead with this form since
9456 (1) user breakpoints operate more predictably without
9457 code duplication, and
9458 (2) we're not running any of the global optimizers
9459 that would explode in time/space with the highly
9460 connected CFG created by the indirect branching. */
9462 rtx finally_label
= gen_label_rtx ();
9463 rtx done_label
= gen_label_rtx ();
9464 rtx return_link
= gen_reg_rtx (Pmode
);
9465 tree cleanup
= build (GOTO_SUBROUTINE_EXPR
, void_type_node
,
9466 (tree
) finally_label
, (tree
) return_link
);
9467 TREE_SIDE_EFFECTS (cleanup
) = 1;
9469 /* Start a new binding layer that will keep track of all cleanup
9470 actions to be performed. */
9471 expand_start_bindings (2);
9472 target_temp_slot_level
= temp_slot_level
;
9474 expand_decl_cleanup (NULL_TREE
, cleanup
);
9475 op0
= expand_expr (try_block
, target
, tmode
, modifier
);
9477 preserve_temp_slots (op0
);
9478 expand_end_bindings (NULL_TREE
, 0, 0);
9479 emit_jump (done_label
);
9480 emit_label (finally_label
);
9481 expand_expr (finally_block
, const0_rtx
, VOIDmode
, 0);
9482 emit_indirect_jump (return_link
);
9483 emit_label (done_label
);
9487 expand_start_bindings (2);
9488 target_temp_slot_level
= temp_slot_level
;
9490 expand_decl_cleanup (NULL_TREE
, finally_block
);
9491 op0
= expand_expr (try_block
, target
, tmode
, modifier
);
9493 preserve_temp_slots (op0
);
9494 expand_end_bindings (NULL_TREE
, 0, 0);
9500 case GOTO_SUBROUTINE_EXPR
:
9502 rtx subr
= (rtx
) TREE_OPERAND (exp
, 0);
9503 rtx return_link
= *(rtx
*) &TREE_OPERAND (exp
, 1);
9504 rtx return_address
= gen_label_rtx ();
9505 emit_move_insn (return_link
,
9506 gen_rtx_LABEL_REF (Pmode
, return_address
));
9508 emit_label (return_address
);
9513 return expand_builtin_va_arg (TREE_OPERAND (exp
, 0), type
);
9516 return get_exception_pointer (cfun
);
9519 /* Function descriptors are not valid except for as
9520 initialization constants, and should not be expanded. */
9524 return (*lang_hooks
.expand_expr
) (exp
, original_target
, tmode
, modifier
);
9527 /* Here to do an ordinary binary operator, generating an instruction
9528 from the optab already placed in `this_optab'. */
9530 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
9532 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
, 0);
9533 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
9535 if (modifier
== EXPAND_STACK_PARM
)
9537 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
,
9538 unsignedp
, OPTAB_LIB_WIDEN
);
9544 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9545 when applied to the address of EXP produces an address known to be
9546 aligned more than BIGGEST_ALIGNMENT. */
9549 is_aligning_offset (offset
, exp
)
9553 /* Strip off any conversions and WITH_RECORD_EXPR nodes. */
9554 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9555 || TREE_CODE (offset
) == NOP_EXPR
9556 || TREE_CODE (offset
) == CONVERT_EXPR
9557 || TREE_CODE (offset
) == WITH_RECORD_EXPR
)
9558 offset
= TREE_OPERAND (offset
, 0);
9560 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9561 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9562 if (TREE_CODE (offset
) != BIT_AND_EXPR
9563 || !host_integerp (TREE_OPERAND (offset
, 1), 1)
9564 || compare_tree_int (TREE_OPERAND (offset
, 1), BIGGEST_ALIGNMENT
) <= 0
9565 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset
, 1), 1) + 1) < 0)
9568 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9569 It must be NEGATE_EXPR. Then strip any more conversions. */
9570 offset
= TREE_OPERAND (offset
, 0);
9571 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9572 || TREE_CODE (offset
) == NOP_EXPR
9573 || TREE_CODE (offset
) == CONVERT_EXPR
)
9574 offset
= TREE_OPERAND (offset
, 0);
9576 if (TREE_CODE (offset
) != NEGATE_EXPR
)
9579 offset
= TREE_OPERAND (offset
, 0);
9580 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9581 || TREE_CODE (offset
) == NOP_EXPR
9582 || TREE_CODE (offset
) == CONVERT_EXPR
)
9583 offset
= TREE_OPERAND (offset
, 0);
9585 /* This must now be the address either of EXP or of a PLACEHOLDER_EXPR
9586 whose type is the same as EXP. */
9587 return (TREE_CODE (offset
) == ADDR_EXPR
9588 && (TREE_OPERAND (offset
, 0) == exp
9589 || (TREE_CODE (TREE_OPERAND (offset
, 0)) == PLACEHOLDER_EXPR
9590 && (TREE_TYPE (TREE_OPERAND (offset
, 0))
9591 == TREE_TYPE (exp
)))));
9594 /* Return the tree node if an ARG corresponds to a string constant or zero
9595 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9596 in bytes within the string that ARG is accessing. The type of the
9597 offset will be `sizetype'. */
9600 string_constant (arg
, ptr_offset
)
9606 if (TREE_CODE (arg
) == ADDR_EXPR
9607 && TREE_CODE (TREE_OPERAND (arg
, 0)) == STRING_CST
)
9609 *ptr_offset
= size_zero_node
;
9610 return TREE_OPERAND (arg
, 0);
9612 else if (TREE_CODE (arg
) == PLUS_EXPR
)
9614 tree arg0
= TREE_OPERAND (arg
, 0);
9615 tree arg1
= TREE_OPERAND (arg
, 1);
9620 if (TREE_CODE (arg0
) == ADDR_EXPR
9621 && TREE_CODE (TREE_OPERAND (arg0
, 0)) == STRING_CST
)
9623 *ptr_offset
= convert (sizetype
, arg1
);
9624 return TREE_OPERAND (arg0
, 0);
9626 else if (TREE_CODE (arg1
) == ADDR_EXPR
9627 && TREE_CODE (TREE_OPERAND (arg1
, 0)) == STRING_CST
)
9629 *ptr_offset
= convert (sizetype
, arg0
);
9630 return TREE_OPERAND (arg1
, 0);
9637 /* Expand code for a post- or pre- increment or decrement
9638 and return the RTX for the result.
9639 POST is 1 for postinc/decrements and 0 for preinc/decrements. */
9642 expand_increment (exp
, post
, ignore
)
9648 tree incremented
= TREE_OPERAND (exp
, 0);
9649 optab this_optab
= add_optab
;
9651 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
9652 int op0_is_copy
= 0;
9653 int single_insn
= 0;
9654 /* 1 means we can't store into OP0 directly,
9655 because it is a subreg narrower than a word,
9656 and we don't dare clobber the rest of the word. */
9659 /* Stabilize any component ref that might need to be
9660 evaluated more than once below. */
9662 || TREE_CODE (incremented
) == BIT_FIELD_REF
9663 || (TREE_CODE (incremented
) == COMPONENT_REF
9664 && (TREE_CODE (TREE_OPERAND (incremented
, 0)) != INDIRECT_REF
9665 || DECL_BIT_FIELD (TREE_OPERAND (incremented
, 1)))))
9666 incremented
= stabilize_reference (incremented
);
9667 /* Nested *INCREMENT_EXPRs can happen in C++. We must force innermost
9668 ones into save exprs so that they don't accidentally get evaluated
9669 more than once by the code below. */
9670 if (TREE_CODE (incremented
) == PREINCREMENT_EXPR
9671 || TREE_CODE (incremented
) == PREDECREMENT_EXPR
)
9672 incremented
= save_expr (incremented
);
9674 /* Compute the operands as RTX.
9675 Note whether OP0 is the actual lvalue or a copy of it:
9676 I believe it is a copy iff it is a register or subreg
9677 and insns were generated in computing it. */
9679 temp
= get_last_insn ();
9680 op0
= expand_expr (incremented
, NULL_RTX
, VOIDmode
, 0);
9682 /* If OP0 is a SUBREG made for a promoted variable, we cannot increment
9683 in place but instead must do sign- or zero-extension during assignment,
9684 so we copy it into a new register and let the code below use it as
9687 Note that we can safely modify this SUBREG since it is know not to be
9688 shared (it was made by the expand_expr call above). */
9690 if (GET_CODE (op0
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (op0
))
9693 SUBREG_REG (op0
) = copy_to_reg (SUBREG_REG (op0
));
9697 else if (GET_CODE (op0
) == SUBREG
9698 && GET_MODE_BITSIZE (GET_MODE (op0
)) < BITS_PER_WORD
)
9700 /* We cannot increment this SUBREG in place. If we are
9701 post-incrementing, get a copy of the old value. Otherwise,
9702 just mark that we cannot increment in place. */
9704 op0
= copy_to_reg (op0
);
9709 op0_is_copy
= ((GET_CODE (op0
) == SUBREG
|| GET_CODE (op0
) == REG
)
9710 && temp
!= get_last_insn ());
9711 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
, VOIDmode
, 0);
9713 /* Decide whether incrementing or decrementing. */
9714 if (TREE_CODE (exp
) == POSTDECREMENT_EXPR
9715 || TREE_CODE (exp
) == PREDECREMENT_EXPR
)
9716 this_optab
= sub_optab
;
9718 /* Convert decrement by a constant into a negative increment. */
9719 if (this_optab
== sub_optab
9720 && GET_CODE (op1
) == CONST_INT
)
9722 op1
= GEN_INT (-INTVAL (op1
));
9723 this_optab
= add_optab
;
9726 if (TYPE_TRAP_SIGNED (TREE_TYPE (exp
)))
9727 this_optab
= this_optab
== add_optab
? addv_optab
: subv_optab
;
9729 /* For a preincrement, see if we can do this with a single instruction. */
9732 icode
= (int) this_optab
->handlers
[(int) mode
].insn_code
;
9733 if (icode
!= (int) CODE_FOR_nothing
9734 /* Make sure that OP0 is valid for operands 0 and 1
9735 of the insn we want to queue. */
9736 && (*insn_data
[icode
].operand
[0].predicate
) (op0
, mode
)
9737 && (*insn_data
[icode
].operand
[1].predicate
) (op0
, mode
)
9738 && (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
9742 /* If OP0 is not the actual lvalue, but rather a copy in a register,
9743 then we cannot just increment OP0. We must therefore contrive to
9744 increment the original value. Then, for postincrement, we can return
9745 OP0 since it is a copy of the old value. For preincrement, expand here
9746 unless we can do it with a single insn.
9748 Likewise if storing directly into OP0 would clobber high bits
9749 we need to preserve (bad_subreg). */
9750 if (op0_is_copy
|| (!post
&& !single_insn
) || bad_subreg
)
9752 /* This is the easiest way to increment the value wherever it is.
9753 Problems with multiple evaluation of INCREMENTED are prevented
9754 because either (1) it is a component_ref or preincrement,
9755 in which case it was stabilized above, or (2) it is an array_ref
9756 with constant index in an array in a register, which is
9757 safe to reevaluate. */
9758 tree newexp
= build (((TREE_CODE (exp
) == POSTDECREMENT_EXPR
9759 || TREE_CODE (exp
) == PREDECREMENT_EXPR
)
9760 ? MINUS_EXPR
: PLUS_EXPR
),
9763 TREE_OPERAND (exp
, 1));
9765 while (TREE_CODE (incremented
) == NOP_EXPR
9766 || TREE_CODE (incremented
) == CONVERT_EXPR
)
9768 newexp
= convert (TREE_TYPE (incremented
), newexp
);
9769 incremented
= TREE_OPERAND (incremented
, 0);
9772 temp
= expand_assignment (incremented
, newexp
, ! post
&& ! ignore
, 0);
9773 return post
? op0
: temp
;
9778 /* We have a true reference to the value in OP0.
9779 If there is an insn to add or subtract in this mode, queue it.
9780 Queueing the increment insn avoids the register shuffling
9781 that often results if we must increment now and first save
9782 the old value for subsequent use. */
9784 #if 0 /* Turned off to avoid making extra insn for indexed memref. */
9785 op0
= stabilize (op0
);
9788 icode
= (int) this_optab
->handlers
[(int) mode
].insn_code
;
9789 if (icode
!= (int) CODE_FOR_nothing
9790 /* Make sure that OP0 is valid for operands 0 and 1
9791 of the insn we want to queue. */
9792 && (*insn_data
[icode
].operand
[0].predicate
) (op0
, mode
)
9793 && (*insn_data
[icode
].operand
[1].predicate
) (op0
, mode
))
9795 if (! (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
9796 op1
= force_reg (mode
, op1
);
9798 return enqueue_insn (op0
, GEN_FCN (icode
) (op0
, op0
, op1
));
9800 if (icode
!= (int) CODE_FOR_nothing
&& GET_CODE (op0
) == MEM
)
9802 rtx addr
= (general_operand (XEXP (op0
, 0), mode
)
9803 ? force_reg (Pmode
, XEXP (op0
, 0))
9804 : copy_to_reg (XEXP (op0
, 0)));
9807 op0
= replace_equiv_address (op0
, addr
);
9808 temp
= force_reg (GET_MODE (op0
), op0
);
9809 if (! (*insn_data
[icode
].operand
[2].predicate
) (op1
, mode
))
9810 op1
= force_reg (mode
, op1
);
9812 /* The increment queue is LIFO, thus we have to `queue'
9813 the instructions in reverse order. */
9814 enqueue_insn (op0
, gen_move_insn (op0
, temp
));
9815 result
= enqueue_insn (temp
, GEN_FCN (icode
) (temp
, temp
, op1
));
9820 /* Preincrement, or we can't increment with one simple insn. */
9822 /* Save a copy of the value before inc or dec, to return it later. */
9823 temp
= value
= copy_to_reg (op0
);
9825 /* Arrange to return the incremented value. */
9826 /* Copy the rtx because expand_binop will protect from the queue,
9827 and the results of that would be invalid for us to return
9828 if our caller does emit_queue before using our result. */
9829 temp
= copy_rtx (value
= op0
);
9831 /* Increment however we can. */
9832 op1
= expand_binop (mode
, this_optab
, value
, op1
, op0
,
9833 TREE_UNSIGNED (TREE_TYPE (exp
)), OPTAB_LIB_WIDEN
);
9835 /* Make sure the value is stored into OP0. */
9837 emit_move_insn (op0
, op1
);
9842 /* Generate code to calculate EXP using a store-flag instruction
9843 and return an rtx for the result. EXP is either a comparison
9844 or a TRUTH_NOT_EXPR whose operand is a comparison.
9846 If TARGET is nonzero, store the result there if convenient.
9848 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
9851 Return zero if there is no suitable set-flag instruction
9852 available on this machine.
9854 Once expand_expr has been called on the arguments of the comparison,
9855 we are committed to doing the store flag, since it is not safe to
9856 re-evaluate the expression. We emit the store-flag insn by calling
9857 emit_store_flag, but only expand the arguments if we have a reason
9858 to believe that emit_store_flag will be successful. If we think that
9859 it will, but it isn't, we have to simulate the store-flag with a
9860 set/jump/set sequence. */
9863 do_store_flag (exp
, target
, mode
, only_cheap
)
9866 enum machine_mode mode
;
9870 tree arg0
, arg1
, type
;
9872 enum machine_mode operand_mode
;
9876 enum insn_code icode
;
9877 rtx subtarget
= target
;
9880 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9881 result at the end. We can't simply invert the test since it would
9882 have already been inverted if it were valid. This case occurs for
9883 some floating-point comparisons. */
9885 if (TREE_CODE (exp
) == TRUTH_NOT_EXPR
)
9886 invert
= 1, exp
= TREE_OPERAND (exp
, 0);
9888 arg0
= TREE_OPERAND (exp
, 0);
9889 arg1
= TREE_OPERAND (exp
, 1);
9891 /* Don't crash if the comparison was erroneous. */
9892 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
9895 type
= TREE_TYPE (arg0
);
9896 operand_mode
= TYPE_MODE (type
);
9897 unsignedp
= TREE_UNSIGNED (type
);
9899 /* We won't bother with BLKmode store-flag operations because it would mean
9900 passing a lot of information to emit_store_flag. */
9901 if (operand_mode
== BLKmode
)
9904 /* We won't bother with store-flag operations involving function pointers
9905 when function pointers must be canonicalized before comparisons. */
9906 #ifdef HAVE_canonicalize_funcptr_for_compare
9907 if (HAVE_canonicalize_funcptr_for_compare
9908 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == POINTER_TYPE
9909 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
9911 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 1))) == POINTER_TYPE
9912 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
9913 == FUNCTION_TYPE
))))
9920 /* Get the rtx comparison code to use. We know that EXP is a comparison
9921 operation of some type. Some comparisons against 1 and -1 can be
9922 converted to comparisons with zero. Do so here so that the tests
9923 below will be aware that we have a comparison with zero. These
9924 tests will not catch constants in the first operand, but constants
9925 are rarely passed as the first operand. */
9927 switch (TREE_CODE (exp
))
9936 if (integer_onep (arg1
))
9937 arg1
= integer_zero_node
, code
= unsignedp
? LEU
: LE
;
9939 code
= unsignedp
? LTU
: LT
;
9942 if (! unsignedp
&& integer_all_onesp (arg1
))
9943 arg1
= integer_zero_node
, code
= LT
;
9945 code
= unsignedp
? LEU
: LE
;
9948 if (! unsignedp
&& integer_all_onesp (arg1
))
9949 arg1
= integer_zero_node
, code
= GE
;
9951 code
= unsignedp
? GTU
: GT
;
9954 if (integer_onep (arg1
))
9955 arg1
= integer_zero_node
, code
= unsignedp
? GTU
: GT
;
9957 code
= unsignedp
? GEU
: GE
;
9960 case UNORDERED_EXPR
:
9986 /* Put a constant second. */
9987 if (TREE_CODE (arg0
) == REAL_CST
|| TREE_CODE (arg0
) == INTEGER_CST
)
9989 tem
= arg0
; arg0
= arg1
; arg1
= tem
;
9990 code
= swap_condition (code
);
9993 /* If this is an equality or inequality test of a single bit, we can
9994 do this by shifting the bit being tested to the low-order bit and
9995 masking the result with the constant 1. If the condition was EQ,
9996 we xor it with 1. This does not require an scc insn and is faster
9997 than an scc insn even if we have it. */
9999 if ((code
== NE
|| code
== EQ
)
10000 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
10001 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
10003 tree inner
= TREE_OPERAND (arg0
, 0);
10004 int bitnum
= tree_log2 (TREE_OPERAND (arg0
, 1));
10007 /* If INNER is a right shift of a constant and it plus BITNUM does
10008 not overflow, adjust BITNUM and INNER. */
10010 if (TREE_CODE (inner
) == RSHIFT_EXPR
10011 && TREE_CODE (TREE_OPERAND (inner
, 1)) == INTEGER_CST
10012 && TREE_INT_CST_HIGH (TREE_OPERAND (inner
, 1)) == 0
10013 && bitnum
< TYPE_PRECISION (type
)
10014 && 0 > compare_tree_int (TREE_OPERAND (inner
, 1),
10015 bitnum
- TYPE_PRECISION (type
)))
10017 bitnum
+= TREE_INT_CST_LOW (TREE_OPERAND (inner
, 1));
10018 inner
= TREE_OPERAND (inner
, 0);
10021 /* If we are going to be able to omit the AND below, we must do our
10022 operations as unsigned. If we must use the AND, we have a choice.
10023 Normally unsigned is faster, but for some machines signed is. */
10024 ops_unsignedp
= (bitnum
== TYPE_PRECISION (type
) - 1 ? 1
10025 #ifdef LOAD_EXTEND_OP
10026 : (LOAD_EXTEND_OP (operand_mode
) == SIGN_EXTEND
? 0 : 1)
10032 if (! get_subtarget (subtarget
)
10033 || GET_MODE (subtarget
) != operand_mode
10034 || ! safe_from_p (subtarget
, inner
, 1))
10037 op0
= expand_expr (inner
, subtarget
, VOIDmode
, 0);
10040 op0
= expand_shift (RSHIFT_EXPR
, operand_mode
, op0
,
10041 size_int (bitnum
), subtarget
, ops_unsignedp
);
10043 if (GET_MODE (op0
) != mode
)
10044 op0
= convert_to_mode (mode
, op0
, ops_unsignedp
);
10046 if ((code
== EQ
&& ! invert
) || (code
== NE
&& invert
))
10047 op0
= expand_binop (mode
, xor_optab
, op0
, const1_rtx
, subtarget
,
10048 ops_unsignedp
, OPTAB_LIB_WIDEN
);
10050 /* Put the AND last so it can combine with more things. */
10051 if (bitnum
!= TYPE_PRECISION (type
) - 1)
10052 op0
= expand_and (mode
, op0
, const1_rtx
, subtarget
);
10057 /* Now see if we are likely to be able to do this. Return if not. */
10058 if (! can_compare_p (code
, operand_mode
, ccp_store_flag
))
10061 icode
= setcc_gen_code
[(int) code
];
10062 if (icode
== CODE_FOR_nothing
10063 || (only_cheap
&& insn_data
[(int) icode
].operand
[0].mode
!= mode
))
10065 /* We can only do this if it is one of the special cases that
10066 can be handled without an scc insn. */
10067 if ((code
== LT
&& integer_zerop (arg1
))
10068 || (! only_cheap
&& code
== GE
&& integer_zerop (arg1
)))
10070 else if (BRANCH_COST
>= 0
10071 && ! only_cheap
&& (code
== NE
|| code
== EQ
)
10072 && TREE_CODE (type
) != REAL_TYPE
10073 && ((abs_optab
->handlers
[(int) operand_mode
].insn_code
10074 != CODE_FOR_nothing
)
10075 || (ffs_optab
->handlers
[(int) operand_mode
].insn_code
10076 != CODE_FOR_nothing
)))
10082 if (! get_subtarget (target
)
10083 || GET_MODE (subtarget
) != operand_mode
10084 || ! safe_from_p (subtarget
, arg1
, 1))
10087 op0
= expand_expr (arg0
, subtarget
, VOIDmode
, 0);
10088 op1
= expand_expr (arg1
, NULL_RTX
, VOIDmode
, 0);
10091 target
= gen_reg_rtx (mode
);
10093 /* Pass copies of OP0 and OP1 in case they contain a QUEUED. This is safe
10094 because, if the emit_store_flag does anything it will succeed and
10095 OP0 and OP1 will not be used subsequently. */
10097 result
= emit_store_flag (target
, code
,
10098 queued_subexp_p (op0
) ? copy_rtx (op0
) : op0
,
10099 queued_subexp_p (op1
) ? copy_rtx (op1
) : op1
,
10100 operand_mode
, unsignedp
, 1);
10105 result
= expand_binop (mode
, xor_optab
, result
, const1_rtx
,
10106 result
, 0, OPTAB_LIB_WIDEN
);
10110 /* If this failed, we have to do this with set/compare/jump/set code. */
10111 if (GET_CODE (target
) != REG
10112 || reg_mentioned_p (target
, op0
) || reg_mentioned_p (target
, op1
))
10113 target
= gen_reg_rtx (GET_MODE (target
));
10115 emit_move_insn (target
, invert
? const0_rtx
: const1_rtx
);
10116 result
= compare_from_rtx (op0
, op1
, code
, unsignedp
,
10117 operand_mode
, NULL_RTX
);
10118 if (GET_CODE (result
) == CONST_INT
)
10119 return (((result
== const0_rtx
&& ! invert
)
10120 || (result
!= const0_rtx
&& invert
))
10121 ? const0_rtx
: const1_rtx
);
10123 /* The code of RESULT may not match CODE if compare_from_rtx
10124 decided to swap its operands and reverse the original code.
10126 We know that compare_from_rtx returns either a CONST_INT or
10127 a new comparison code, so it is safe to just extract the
10128 code from RESULT. */
10129 code
= GET_CODE (result
);
10131 label
= gen_label_rtx ();
10132 if (bcc_gen_fctn
[(int) code
] == 0)
10135 emit_jump_insn ((*bcc_gen_fctn
[(int) code
]) (label
));
10136 emit_move_insn (target
, invert
? const1_rtx
: const0_rtx
);
10137 emit_label (label
);
10143 /* Stubs in case we haven't got a casesi insn. */
10144 #ifndef HAVE_casesi
10145 # define HAVE_casesi 0
10146 # define gen_casesi(a, b, c, d, e) (0)
10147 # define CODE_FOR_casesi CODE_FOR_nothing
10150 /* If the machine does not have a case insn that compares the bounds,
10151 this means extra overhead for dispatch tables, which raises the
10152 threshold for using them. */
10153 #ifndef CASE_VALUES_THRESHOLD
10154 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
10155 #endif /* CASE_VALUES_THRESHOLD */
10158 case_values_threshold ()
10160 return CASE_VALUES_THRESHOLD
;
10163 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10164 0 otherwise (i.e. if there is no casesi instruction). */
10166 try_casesi (index_type
, index_expr
, minval
, range
,
10167 table_label
, default_label
)
10168 tree index_type
, index_expr
, minval
, range
;
10169 rtx table_label ATTRIBUTE_UNUSED
;
10172 enum machine_mode index_mode
= SImode
;
10173 int index_bits
= GET_MODE_BITSIZE (index_mode
);
10174 rtx op1
, op2
, index
;
10175 enum machine_mode op_mode
;
10180 /* Convert the index to SImode. */
10181 if (GET_MODE_BITSIZE (TYPE_MODE (index_type
)) > GET_MODE_BITSIZE (index_mode
))
10183 enum machine_mode omode
= TYPE_MODE (index_type
);
10184 rtx rangertx
= expand_expr (range
, NULL_RTX
, VOIDmode
, 0);
10186 /* We must handle the endpoints in the original mode. */
10187 index_expr
= build (MINUS_EXPR
, index_type
,
10188 index_expr
, minval
);
10189 minval
= integer_zero_node
;
10190 index
= expand_expr (index_expr
, NULL_RTX
, VOIDmode
, 0);
10191 emit_cmp_and_jump_insns (rangertx
, index
, LTU
, NULL_RTX
,
10192 omode
, 1, default_label
);
10193 /* Now we can safely truncate. */
10194 index
= convert_to_mode (index_mode
, index
, 0);
10198 if (TYPE_MODE (index_type
) != index_mode
)
10200 index_expr
= convert ((*lang_hooks
.types
.type_for_size
)
10201 (index_bits
, 0), index_expr
);
10202 index_type
= TREE_TYPE (index_expr
);
10205 index
= expand_expr (index_expr
, NULL_RTX
, VOIDmode
, 0);
10208 index
= protect_from_queue (index
, 0);
10209 do_pending_stack_adjust ();
10211 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[0].mode
;
10212 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[0].predicate
)
10214 index
= copy_to_mode_reg (op_mode
, index
);
10216 op1
= expand_expr (minval
, NULL_RTX
, VOIDmode
, 0);
10218 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[1].mode
;
10219 op1
= convert_modes (op_mode
, TYPE_MODE (TREE_TYPE (minval
)),
10220 op1
, TREE_UNSIGNED (TREE_TYPE (minval
)));
10221 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[1].predicate
)
10223 op1
= copy_to_mode_reg (op_mode
, op1
);
10225 op2
= expand_expr (range
, NULL_RTX
, VOIDmode
, 0);
10227 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[2].mode
;
10228 op2
= convert_modes (op_mode
, TYPE_MODE (TREE_TYPE (range
)),
10229 op2
, TREE_UNSIGNED (TREE_TYPE (range
)));
10230 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[2].predicate
)
10232 op2
= copy_to_mode_reg (op_mode
, op2
);
10234 emit_jump_insn (gen_casesi (index
, op1
, op2
,
10235 table_label
, default_label
));
10239 /* Attempt to generate a tablejump instruction; same concept. */
10240 #ifndef HAVE_tablejump
10241 #define HAVE_tablejump 0
10242 #define gen_tablejump(x, y) (0)
10245 /* Subroutine of the next function.
10247 INDEX is the value being switched on, with the lowest value
10248 in the table already subtracted.
10249 MODE is its expected mode (needed if INDEX is constant).
10250 RANGE is the length of the jump table.
10251 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10253 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10254 index value is out of range. */
10257 do_tablejump (index
, mode
, range
, table_label
, default_label
)
10258 rtx index
, range
, table_label
, default_label
;
10259 enum machine_mode mode
;
10263 if (INTVAL (range
) > cfun
->max_jumptable_ents
)
10264 cfun
->max_jumptable_ents
= INTVAL (range
);
10266 /* Do an unsigned comparison (in the proper mode) between the index
10267 expression and the value which represents the length of the range.
10268 Since we just finished subtracting the lower bound of the range
10269 from the index expression, this comparison allows us to simultaneously
10270 check that the original index expression value is both greater than
10271 or equal to the minimum value of the range and less than or equal to
10272 the maximum value of the range. */
10274 emit_cmp_and_jump_insns (index
, range
, GTU
, NULL_RTX
, mode
, 1,
10277 /* If index is in range, it must fit in Pmode.
10278 Convert to Pmode so we can index with it. */
10280 index
= convert_to_mode (Pmode
, index
, 1);
10282 /* Don't let a MEM slip thru, because then INDEX that comes
10283 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10284 and break_out_memory_refs will go to work on it and mess it up. */
10285 #ifdef PIC_CASE_VECTOR_ADDRESS
10286 if (flag_pic
&& GET_CODE (index
) != REG
)
10287 index
= copy_to_mode_reg (Pmode
, index
);
10290 /* If flag_force_addr were to affect this address
10291 it could interfere with the tricky assumptions made
10292 about addresses that contain label-refs,
10293 which may be valid only very near the tablejump itself. */
10294 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10295 GET_MODE_SIZE, because this indicates how large insns are. The other
10296 uses should all be Pmode, because they are addresses. This code
10297 could fail if addresses and insns are not the same size. */
10298 index
= gen_rtx_PLUS (Pmode
,
10299 gen_rtx_MULT (Pmode
, index
,
10300 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE
))),
10301 gen_rtx_LABEL_REF (Pmode
, table_label
));
10302 #ifdef PIC_CASE_VECTOR_ADDRESS
10304 index
= PIC_CASE_VECTOR_ADDRESS (index
);
10307 index
= memory_address_noforce (CASE_VECTOR_MODE
, index
);
10308 temp
= gen_reg_rtx (CASE_VECTOR_MODE
);
10309 vector
= gen_rtx_MEM (CASE_VECTOR_MODE
, index
);
10310 RTX_UNCHANGING_P (vector
) = 1;
10311 MEM_NOTRAP_P (vector
) = 1;
10312 convert_move (temp
, vector
, 0);
10314 emit_jump_insn (gen_tablejump (temp
, table_label
));
10316 /* If we are generating PIC code or if the table is PC-relative, the
10317 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10318 if (! CASE_VECTOR_PC_RELATIVE
&& ! flag_pic
)
10323 try_tablejump (index_type
, index_expr
, minval
, range
,
10324 table_label
, default_label
)
10325 tree index_type
, index_expr
, minval
, range
;
10326 rtx table_label
, default_label
;
10330 if (! HAVE_tablejump
)
10333 index_expr
= fold (build (MINUS_EXPR
, index_type
,
10334 convert (index_type
, index_expr
),
10335 convert (index_type
, minval
)));
10336 index
= expand_expr (index_expr
, NULL_RTX
, VOIDmode
, 0);
10338 index
= protect_from_queue (index
, 0);
10339 do_pending_stack_adjust ();
10341 do_tablejump (index
, TYPE_MODE (index_type
),
10342 convert_modes (TYPE_MODE (index_type
),
10343 TYPE_MODE (TREE_TYPE (range
)),
10344 expand_expr (range
, NULL_RTX
,
10346 TREE_UNSIGNED (TREE_TYPE (range
))),
10347 table_label
, default_label
);
10351 /* Nonzero if the mode is a valid vector mode for this architecture.
10352 This returns nonzero even if there is no hardware support for the
10353 vector mode, but we can emulate with narrower modes. */
10356 vector_mode_valid_p (mode
)
10357 enum machine_mode mode
;
10359 enum mode_class
class = GET_MODE_CLASS (mode
);
10360 enum machine_mode innermode
;
10362 /* Doh! What's going on? */
10363 if (class != MODE_VECTOR_INT
10364 && class != MODE_VECTOR_FLOAT
)
10367 /* Hardware support. Woo hoo! */
10368 if (VECTOR_MODE_SUPPORTED_P (mode
))
10371 innermode
= GET_MODE_INNER (mode
);
10373 /* We should probably return 1 if requesting V4DI and we have no DI,
10374 but we have V2DI, but this is probably very unlikely. */
10376 /* If we have support for the inner mode, we can safely emulate it.
10377 We may not have V2DI, but me can emulate with a pair of DIs. */
10378 return mov_optab
->handlers
[innermode
].insn_code
!= CODE_FOR_nothing
;
10381 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10383 const_vector_from_tree (exp
)
10389 enum machine_mode inner
, mode
;
10391 mode
= TYPE_MODE (TREE_TYPE (exp
));
10393 if (is_zeros_p (exp
))
10394 return CONST0_RTX (mode
);
10396 units
= GET_MODE_NUNITS (mode
);
10397 inner
= GET_MODE_INNER (mode
);
10399 v
= rtvec_alloc (units
);
10401 link
= TREE_VECTOR_CST_ELTS (exp
);
10402 for (i
= 0; link
; link
= TREE_CHAIN (link
), ++i
)
10404 elt
= TREE_VALUE (link
);
10406 if (TREE_CODE (elt
) == REAL_CST
)
10407 RTVEC_ELT (v
, i
) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt
),
10410 RTVEC_ELT (v
, i
) = immed_double_const (TREE_INT_CST_LOW (elt
),
10411 TREE_INT_CST_HIGH (elt
),
10415 return gen_rtx_raw_CONST_VECTOR (mode
, v
);
10418 #include "gt-expr.h"