1 /* Output routines for GCC for Renesas / SuperH SH.
2 Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
3 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Steve Chamberlain (sac@cygnus.com).
6 Improved by Jim Wilson (wilson@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
26 #include "coretypes.h"
28 #include "insn-config.h"
37 #include "hard-reg-set.h"
39 #include "insn-attr.h"
42 #include "integrate.h"
46 #include "target-def.h"
47 #include "langhooks.h"
48 #include "basic-block.h"
50 #include "cfglayout.h"
52 #include "sched-int.h"
57 #include "alloc-pool.h"
58 #include "tm-constrs.h"
61 int code_for_indirect_jump_scratch
= CODE_FOR_indirect_jump_scratch
;
63 #define MSW (TARGET_LITTLE_ENDIAN ? 1 : 0)
64 #define LSW (TARGET_LITTLE_ENDIAN ? 0 : 1)
66 /* These are some macros to abstract register modes. */
67 #define CONST_OK_FOR_ADD(size) \
68 (TARGET_SHMEDIA ? CONST_OK_FOR_I10 (size) : CONST_OK_FOR_I08 (size))
69 #define GEN_MOV (*(TARGET_SHMEDIA64 ? gen_movdi : gen_movsi))
70 #define GEN_ADD3 (*(TARGET_SHMEDIA64 ? gen_adddi3 : gen_addsi3))
71 #define GEN_SUB3 (*(TARGET_SHMEDIA64 ? gen_subdi3 : gen_subsi3))
73 /* Used to simplify the logic below. Find the attributes wherever
75 #define SH_ATTRIBUTES(decl) \
76 (TYPE_P (decl)) ? TYPE_ATTRIBUTES (decl) \
77 : DECL_ATTRIBUTES (decl) \
78 ? (DECL_ATTRIBUTES (decl)) \
79 : TYPE_ATTRIBUTES (TREE_TYPE (decl))
81 /* Set to 1 by expand_prologue() when the function is an interrupt handler. */
82 int current_function_interrupt
;
84 tree sh_deferred_function_attributes
;
85 tree
*sh_deferred_function_attributes_tail
= &sh_deferred_function_attributes
;
87 /* Global variables for machine-dependent things. */
89 /* Which cpu are we scheduling for. */
90 enum processor_type sh_cpu
;
92 /* Definitions used in ready queue reordering for first scheduling pass. */
94 /* Reg weights arrays for modes SFmode and SImode, indexed by insn LUID. */
95 static short *regmode_weight
[2];
97 /* Total SFmode and SImode weights of scheduled insns. */
98 static int curr_regmode_pressure
[2];
100 /* Number of r0 life regions. */
101 static int r0_life_regions
;
103 /* If true, skip cycles for Q -> R movement. */
104 static int skip_cycles
= 0;
106 /* Cached value of can_issue_more. This is cached in sh_variable_issue hook
107 and returned from sh_reorder2. */
108 static short cached_can_issue_more
;
110 /* Unique number for UNSPEC_BBR pattern. */
111 static unsigned int unspec_bbr_uid
= 1;
113 /* Provides the class number of the smallest class containing
116 enum reg_class regno_reg_class
[FIRST_PSEUDO_REGISTER
] =
118 R0_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
119 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
120 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
121 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
122 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
123 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
124 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
125 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
126 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
127 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
128 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
129 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
130 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
131 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
132 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
133 GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
, GENERAL_REGS
,
134 FP0_REGS
,FP_REGS
, FP_REGS
, FP_REGS
,
135 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
136 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
137 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
138 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
139 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
140 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
141 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
142 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
143 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
144 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
145 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
146 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
147 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
148 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
149 FP_REGS
, FP_REGS
, FP_REGS
, FP_REGS
,
150 TARGET_REGS
, TARGET_REGS
, TARGET_REGS
, TARGET_REGS
,
151 TARGET_REGS
, TARGET_REGS
, TARGET_REGS
, TARGET_REGS
,
152 DF_REGS
, DF_REGS
, DF_REGS
, DF_REGS
,
153 DF_REGS
, DF_REGS
, DF_REGS
, DF_REGS
,
154 NO_REGS
, GENERAL_REGS
, PR_REGS
, T_REGS
,
155 MAC_REGS
, MAC_REGS
, FPUL_REGS
, FPSCR_REGS
,
156 GENERAL_REGS
, GENERAL_REGS
,
159 char sh_register_names
[FIRST_PSEUDO_REGISTER
] \
160 [MAX_REGISTER_NAME_LENGTH
+ 1] = SH_REGISTER_NAMES_INITIALIZER
;
162 char sh_additional_register_names
[ADDREGNAMES_SIZE
] \
163 [MAX_ADDITIONAL_REGISTER_NAME_LENGTH
+ 1]
164 = SH_ADDITIONAL_REGISTER_NAMES_INITIALIZER
;
166 int assembler_dialect
;
168 static bool shmedia_space_reserved_for_target_registers
;
170 static bool sh_handle_option (size_t, const char *, int);
171 static void split_branches (rtx
);
172 static int branch_dest (rtx
);
173 static void force_into (rtx
, rtx
);
174 static void print_slot (rtx
);
175 static rtx
add_constant (rtx
, enum machine_mode
, rtx
);
176 static void dump_table (rtx
, rtx
);
177 static int hi_const (rtx
);
178 static int broken_move (rtx
);
179 static int mova_p (rtx
);
180 static rtx
find_barrier (int, rtx
, rtx
);
181 static int noncall_uses_reg (rtx
, rtx
, rtx
*);
182 static rtx
gen_block_redirect (rtx
, int, int);
183 static void sh_reorg (void);
184 static void output_stack_adjust (int, rtx
, int, HARD_REG_SET
*, bool);
185 static rtx
frame_insn (rtx
);
186 static rtx
push (int);
187 static void pop (int);
188 static void push_regs (HARD_REG_SET
*, int);
189 static int calc_live_regs (HARD_REG_SET
*);
190 static HOST_WIDE_INT
rounded_frame_size (int);
191 static bool sh_frame_pointer_required (void);
192 static rtx
mark_constant_pool_use (rtx
);
193 static tree
sh_handle_interrupt_handler_attribute (tree
*, tree
, tree
, int, bool *);
194 static tree
sh_handle_resbank_handler_attribute (tree
*, tree
,
196 static tree
sh2a_handle_function_vector_handler_attribute (tree
*, tree
,
198 static tree
sh_handle_sp_switch_attribute (tree
*, tree
, tree
, int, bool *);
199 static tree
sh_handle_trap_exit_attribute (tree
*, tree
, tree
, int, bool *);
200 static tree
sh_handle_renesas_attribute (tree
*, tree
, tree
, int, bool *);
201 static void sh_output_function_epilogue (FILE *, HOST_WIDE_INT
);
202 static void sh_insert_attributes (tree
, tree
*);
203 static const char *sh_check_pch_target_flags (int);
204 static int sh_adjust_cost (rtx
, rtx
, rtx
, int);
205 static int sh_issue_rate (void);
206 static int sh_dfa_new_cycle (FILE *, int, rtx
, int, int, int *sort_p
);
207 static short find_set_regmode_weight (rtx
, enum machine_mode
);
208 static short find_insn_regmode_weight (rtx
, enum machine_mode
);
209 static void find_regmode_weight (basic_block
, enum machine_mode
);
210 static int find_r0_life_regions (basic_block
);
211 static void sh_md_init_global (FILE *, int, int);
212 static void sh_md_finish_global (FILE *, int);
213 static int rank_for_reorder (const void *, const void *);
214 static void swap_reorder (rtx
*, int);
215 static void ready_reorder (rtx
*, int);
216 static short high_pressure (enum machine_mode
);
217 static int sh_reorder (FILE *, int, rtx
*, int *, int);
218 static int sh_reorder2 (FILE *, int, rtx
*, int *, int);
219 static void sh_md_init (FILE *, int, int);
220 static int sh_variable_issue (FILE *, int, rtx
, int);
222 static bool sh_function_ok_for_sibcall (tree
, tree
);
224 static bool sh_cannot_modify_jumps_p (void);
225 static enum reg_class
sh_target_reg_class (void);
226 static bool sh_optimize_target_register_callee_saved (bool);
227 static bool sh_ms_bitfield_layout_p (const_tree
);
229 static void sh_init_builtins (void);
230 static tree
sh_builtin_decl (unsigned, bool);
231 static void sh_media_init_builtins (void);
232 static tree
sh_media_builtin_decl (unsigned, bool);
233 static rtx
sh_expand_builtin (tree
, rtx
, rtx
, enum machine_mode
, int);
234 static void sh_output_mi_thunk (FILE *, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
, tree
);
235 static void sh_file_start (void);
236 static int flow_dependent_p (rtx
, rtx
);
237 static void flow_dependent_p_1 (rtx
, const_rtx
, void *);
238 static int shiftcosts (rtx
);
239 static int andcosts (rtx
);
240 static int addsubcosts (rtx
);
241 static int multcosts (rtx
);
242 static bool unspec_caller_rtx_p (rtx
);
243 static bool sh_cannot_copy_insn_p (rtx
);
244 static bool sh_rtx_costs (rtx
, int, int, int *, bool);
245 static int sh_address_cost (rtx
, bool);
246 static int sh_pr_n_sets (void);
247 static rtx
sh_allocate_initial_value (rtx
);
248 static bool sh_legitimate_address_p (enum machine_mode
, rtx
, bool);
249 static rtx
sh_legitimize_address (rtx
, rtx
, enum machine_mode
);
250 static int shmedia_target_regs_stack_space (HARD_REG_SET
*);
251 static int shmedia_reserve_space_for_target_registers_p (int, HARD_REG_SET
*);
252 static int shmedia_target_regs_stack_adjust (HARD_REG_SET
*);
253 static int scavenge_reg (HARD_REG_SET
*s
);
254 struct save_schedule_s
;
255 static struct save_entry_s
*sh5_schedule_saves (HARD_REG_SET
*,
256 struct save_schedule_s
*, int);
258 static rtx
sh_struct_value_rtx (tree
, int);
259 static rtx
sh_function_value (const_tree
, const_tree
, bool);
260 static rtx
sh_libcall_value (enum machine_mode
, const_rtx
);
261 static bool sh_return_in_memory (const_tree
, const_tree
);
262 static rtx
sh_builtin_saveregs (void);
263 static void sh_setup_incoming_varargs (CUMULATIVE_ARGS
*, enum machine_mode
, tree
, int *, int);
264 static bool sh_strict_argument_naming (CUMULATIVE_ARGS
*);
265 static bool sh_pretend_outgoing_varargs_named (CUMULATIVE_ARGS
*);
266 static tree
sh_build_builtin_va_list (void);
267 static void sh_va_start (tree
, rtx
);
268 static tree
sh_gimplify_va_arg_expr (tree
, tree
, gimple_seq
*, gimple_seq
*);
269 static bool sh_promote_prototypes (const_tree
);
270 static enum machine_mode
sh_promote_function_mode (const_tree type
,
275 static bool sh_pass_by_reference (CUMULATIVE_ARGS
*, enum machine_mode
,
277 static bool sh_callee_copies (CUMULATIVE_ARGS
*, enum machine_mode
,
279 static int sh_arg_partial_bytes (CUMULATIVE_ARGS
*, enum machine_mode
,
281 static bool sh_scalar_mode_supported_p (enum machine_mode
);
282 static int sh_dwarf_calling_convention (const_tree
);
283 static void sh_encode_section_info (tree
, rtx
, int);
284 static int sh2a_function_vector_p (tree
);
285 static void sh_trampoline_init (rtx
, tree
, rtx
);
286 static rtx
sh_trampoline_adjust_address (rtx
);
288 static const struct attribute_spec sh_attribute_table
[] =
290 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
291 { "interrupt_handler", 0, 0, true, false, false, sh_handle_interrupt_handler_attribute
},
292 { "sp_switch", 1, 1, true, false, false, sh_handle_sp_switch_attribute
},
293 { "trap_exit", 1, 1, true, false, false, sh_handle_trap_exit_attribute
},
294 { "renesas", 0, 0, false, true, false, sh_handle_renesas_attribute
},
295 { "trapa_handler", 0, 0, true, false, false, sh_handle_interrupt_handler_attribute
},
296 { "nosave_low_regs", 0, 0, true, false, false, sh_handle_interrupt_handler_attribute
},
297 { "resbank", 0, 0, true, false, false, sh_handle_resbank_handler_attribute
},
298 { "function_vector", 1, 1, true, false, false, sh2a_handle_function_vector_handler_attribute
},
300 /* Symbian support adds three new attributes:
301 dllexport - for exporting a function/variable that will live in a dll
302 dllimport - for importing a function/variable from a dll
304 Microsoft allows multiple declspecs in one __declspec, separating
305 them with spaces. We do NOT support this. Instead, use __declspec
307 { "dllimport", 0, 0, true, false, false, sh_symbian_handle_dll_attribute
},
308 { "dllexport", 0, 0, true, false, false, sh_symbian_handle_dll_attribute
},
310 { NULL
, 0, 0, false, false, false, NULL
}
313 /* Initialize the GCC target structure. */
314 #undef TARGET_ATTRIBUTE_TABLE
315 #define TARGET_ATTRIBUTE_TABLE sh_attribute_table
317 /* The next two are used for debug info when compiling with -gdwarf. */
318 #undef TARGET_ASM_UNALIGNED_HI_OP
319 #define TARGET_ASM_UNALIGNED_HI_OP "\t.uaword\t"
320 #undef TARGET_ASM_UNALIGNED_SI_OP
321 #define TARGET_ASM_UNALIGNED_SI_OP "\t.ualong\t"
323 /* These are NULLed out on non-SH5 in OVERRIDE_OPTIONS. */
324 #undef TARGET_ASM_UNALIGNED_DI_OP
325 #define TARGET_ASM_UNALIGNED_DI_OP "\t.uaquad\t"
326 #undef TARGET_ASM_ALIGNED_DI_OP
327 #define TARGET_ASM_ALIGNED_DI_OP "\t.quad\t"
329 #undef TARGET_ASM_FUNCTION_EPILOGUE
330 #define TARGET_ASM_FUNCTION_EPILOGUE sh_output_function_epilogue
332 #undef TARGET_ASM_OUTPUT_MI_THUNK
333 #define TARGET_ASM_OUTPUT_MI_THUNK sh_output_mi_thunk
335 #undef TARGET_ASM_CAN_OUTPUT_MI_THUNK
336 #define TARGET_ASM_CAN_OUTPUT_MI_THUNK hook_bool_const_tree_hwi_hwi_const_tree_true
338 #undef TARGET_ASM_FILE_START
339 #define TARGET_ASM_FILE_START sh_file_start
340 #undef TARGET_ASM_FILE_START_FILE_DIRECTIVE
341 #define TARGET_ASM_FILE_START_FILE_DIRECTIVE true
343 #undef TARGET_DEFAULT_TARGET_FLAGS
344 #define TARGET_DEFAULT_TARGET_FLAGS TARGET_DEFAULT
345 #undef TARGET_HANDLE_OPTION
346 #define TARGET_HANDLE_OPTION sh_handle_option
348 #undef TARGET_INSERT_ATTRIBUTES
349 #define TARGET_INSERT_ATTRIBUTES sh_insert_attributes
351 #undef TARGET_SCHED_ADJUST_COST
352 #define TARGET_SCHED_ADJUST_COST sh_adjust_cost
354 #undef TARGET_SCHED_ISSUE_RATE
355 #define TARGET_SCHED_ISSUE_RATE sh_issue_rate
357 /* The next 5 hooks have been implemented for reenabling sched1. With the
358 help of these macros we are limiting the movement of insns in sched1 to
359 reduce the register pressure. The overall idea is to keep count of SImode
360 and SFmode regs required by already scheduled insns. When these counts
361 cross some threshold values; give priority to insns that free registers.
362 The insn that frees registers is most likely to be the insn with lowest
363 LUID (original insn order); but such an insn might be there in the stalled
364 queue (Q) instead of the ready queue (R). To solve this, we skip cycles
365 upto a max of 8 cycles so that such insns may move from Q -> R.
367 The description of the hooks are as below:
369 TARGET_SCHED_INIT_GLOBAL: Added a new target hook in the generic
370 scheduler; it is called inside the sched_init function just after
371 find_insn_reg_weights function call. It is used to calculate the SImode
372 and SFmode weights of insns of basic blocks; much similar to what
373 find_insn_reg_weights does.
374 TARGET_SCHED_FINISH_GLOBAL: Corresponding cleanup hook.
376 TARGET_SCHED_DFA_NEW_CYCLE: Skip cycles if high register pressure is
377 indicated by TARGET_SCHED_REORDER2; doing this may move insns from
380 TARGET_SCHED_REORDER: If the register pressure for SImode or SFmode is
381 high; reorder the ready queue so that the insn with lowest LUID will be
384 TARGET_SCHED_REORDER2: If the register pressure is high, indicate to
385 TARGET_SCHED_DFA_NEW_CYCLE to skip cycles.
387 TARGET_SCHED_VARIABLE_ISSUE: Cache the value of can_issue_more so that it
388 can be returned from TARGET_SCHED_REORDER2.
390 TARGET_SCHED_INIT: Reset the register pressure counting variables. */
392 #undef TARGET_SCHED_DFA_NEW_CYCLE
393 #define TARGET_SCHED_DFA_NEW_CYCLE sh_dfa_new_cycle
395 #undef TARGET_SCHED_INIT_GLOBAL
396 #define TARGET_SCHED_INIT_GLOBAL sh_md_init_global
398 #undef TARGET_SCHED_FINISH_GLOBAL
399 #define TARGET_SCHED_FINISH_GLOBAL sh_md_finish_global
401 #undef TARGET_SCHED_VARIABLE_ISSUE
402 #define TARGET_SCHED_VARIABLE_ISSUE sh_variable_issue
404 #undef TARGET_SCHED_REORDER
405 #define TARGET_SCHED_REORDER sh_reorder
407 #undef TARGET_SCHED_REORDER2
408 #define TARGET_SCHED_REORDER2 sh_reorder2
410 #undef TARGET_SCHED_INIT
411 #define TARGET_SCHED_INIT sh_md_init
413 #undef TARGET_LEGITIMIZE_ADDRESS
414 #define TARGET_LEGITIMIZE_ADDRESS sh_legitimize_address
416 #undef TARGET_CANNOT_MODIFY_JUMPS_P
417 #define TARGET_CANNOT_MODIFY_JUMPS_P sh_cannot_modify_jumps_p
418 #undef TARGET_BRANCH_TARGET_REGISTER_CLASS
419 #define TARGET_BRANCH_TARGET_REGISTER_CLASS sh_target_reg_class
420 #undef TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED
421 #define TARGET_BRANCH_TARGET_REGISTER_CALLEE_SAVED \
422 sh_optimize_target_register_callee_saved
424 #undef TARGET_MS_BITFIELD_LAYOUT_P
425 #define TARGET_MS_BITFIELD_LAYOUT_P sh_ms_bitfield_layout_p
427 #undef TARGET_INIT_BUILTINS
428 #define TARGET_INIT_BUILTINS sh_init_builtins
429 #undef TARGET_BUILTIN_DECL
430 #define TARGET_BUILTIN_DECL sh_builtin_decl
431 #undef TARGET_EXPAND_BUILTIN
432 #define TARGET_EXPAND_BUILTIN sh_expand_builtin
434 #undef TARGET_FUNCTION_OK_FOR_SIBCALL
435 #define TARGET_FUNCTION_OK_FOR_SIBCALL sh_function_ok_for_sibcall
437 #undef TARGET_CANNOT_COPY_INSN_P
438 #define TARGET_CANNOT_COPY_INSN_P sh_cannot_copy_insn_p
439 #undef TARGET_RTX_COSTS
440 #define TARGET_RTX_COSTS sh_rtx_costs
441 #undef TARGET_ADDRESS_COST
442 #define TARGET_ADDRESS_COST sh_address_cost
443 #undef TARGET_ALLOCATE_INITIAL_VALUE
444 #define TARGET_ALLOCATE_INITIAL_VALUE sh_allocate_initial_value
446 #undef TARGET_MACHINE_DEPENDENT_REORG
447 #define TARGET_MACHINE_DEPENDENT_REORG sh_reorg
449 #undef TARGET_DWARF_REGISTER_SPAN
450 #define TARGET_DWARF_REGISTER_SPAN sh_dwarf_register_span
453 #undef TARGET_HAVE_TLS
454 #define TARGET_HAVE_TLS true
457 #undef TARGET_PROMOTE_PROTOTYPES
458 #define TARGET_PROMOTE_PROTOTYPES sh_promote_prototypes
459 #undef TARGET_PROMOTE_FUNCTION_MODE
460 #define TARGET_PROMOTE_FUNCTION_MODE sh_promote_function_mode
462 #undef TARGET_FUNCTION_VALUE
463 #define TARGET_FUNCTION_VALUE sh_function_value
464 #undef TARGET_LIBCALL_VALUE
465 #define TARGET_LIBCALL_VALUE sh_libcall_value
466 #undef TARGET_STRUCT_VALUE_RTX
467 #define TARGET_STRUCT_VALUE_RTX sh_struct_value_rtx
468 #undef TARGET_RETURN_IN_MEMORY
469 #define TARGET_RETURN_IN_MEMORY sh_return_in_memory
471 #undef TARGET_EXPAND_BUILTIN_SAVEREGS
472 #define TARGET_EXPAND_BUILTIN_SAVEREGS sh_builtin_saveregs
473 #undef TARGET_SETUP_INCOMING_VARARGS
474 #define TARGET_SETUP_INCOMING_VARARGS sh_setup_incoming_varargs
475 #undef TARGET_STRICT_ARGUMENT_NAMING
476 #define TARGET_STRICT_ARGUMENT_NAMING sh_strict_argument_naming
477 #undef TARGET_PRETEND_OUTGOING_VARARGS_NAMED
478 #define TARGET_PRETEND_OUTGOING_VARARGS_NAMED sh_pretend_outgoing_varargs_named
479 #undef TARGET_MUST_PASS_IN_STACK
480 #define TARGET_MUST_PASS_IN_STACK must_pass_in_stack_var_size
481 #undef TARGET_PASS_BY_REFERENCE
482 #define TARGET_PASS_BY_REFERENCE sh_pass_by_reference
483 #undef TARGET_CALLEE_COPIES
484 #define TARGET_CALLEE_COPIES sh_callee_copies
485 #undef TARGET_ARG_PARTIAL_BYTES
486 #define TARGET_ARG_PARTIAL_BYTES sh_arg_partial_bytes
488 #undef TARGET_BUILD_BUILTIN_VA_LIST
489 #define TARGET_BUILD_BUILTIN_VA_LIST sh_build_builtin_va_list
490 #undef TARGET_EXPAND_BUILTIN_VA_START
491 #define TARGET_EXPAND_BUILTIN_VA_START sh_va_start
492 #undef TARGET_GIMPLIFY_VA_ARG_EXPR
493 #define TARGET_GIMPLIFY_VA_ARG_EXPR sh_gimplify_va_arg_expr
495 #undef TARGET_SCALAR_MODE_SUPPORTED_P
496 #define TARGET_SCALAR_MODE_SUPPORTED_P sh_scalar_mode_supported_p
497 #undef TARGET_VECTOR_MODE_SUPPORTED_P
498 #define TARGET_VECTOR_MODE_SUPPORTED_P sh_vector_mode_supported_p
500 #undef TARGET_CHECK_PCH_TARGET_FLAGS
501 #define TARGET_CHECK_PCH_TARGET_FLAGS sh_check_pch_target_flags
503 #undef TARGET_DWARF_CALLING_CONVENTION
504 #define TARGET_DWARF_CALLING_CONVENTION sh_dwarf_calling_convention
506 #undef TARGET_FRAME_POINTER_REQUIRED
507 #define TARGET_FRAME_POINTER_REQUIRED sh_frame_pointer_required
509 /* Return regmode weight for insn. */
510 #define INSN_REGMODE_WEIGHT(INSN, MODE) regmode_weight[((MODE) == SImode) ? 0 : 1][INSN_UID (INSN)]
512 /* Return current register pressure for regmode. */
513 #define CURR_REGMODE_PRESSURE(MODE) curr_regmode_pressure[((MODE) == SImode) ? 0 : 1]
515 #undef TARGET_ENCODE_SECTION_INFO
516 #define TARGET_ENCODE_SECTION_INFO sh_encode_section_info
520 #undef TARGET_ENCODE_SECTION_INFO
521 #define TARGET_ENCODE_SECTION_INFO sh_symbian_encode_section_info
522 #undef TARGET_STRIP_NAME_ENCODING
523 #define TARGET_STRIP_NAME_ENCODING sh_symbian_strip_name_encoding
524 #undef TARGET_CXX_IMPORT_EXPORT_CLASS
525 #define TARGET_CXX_IMPORT_EXPORT_CLASS sh_symbian_import_export_class
529 #undef TARGET_SECONDARY_RELOAD
530 #define TARGET_SECONDARY_RELOAD sh_secondary_reload
532 #undef TARGET_LEGITIMATE_ADDRESS_P
533 #define TARGET_LEGITIMATE_ADDRESS_P sh_legitimate_address_p
535 #undef TARGET_TRAMPOLINE_INIT
536 #define TARGET_TRAMPOLINE_INIT sh_trampoline_init
537 #undef TARGET_TRAMPOLINE_ADJUST_ADDRESS
538 #define TARGET_TRAMPOLINE_ADJUST_ADDRESS sh_trampoline_adjust_address
540 /* Machine-specific symbol_ref flags. */
541 #define SYMBOL_FLAG_FUNCVEC_FUNCTION (SYMBOL_FLAG_MACH_DEP << 0)
543 struct gcc_target targetm
= TARGET_INITIALIZER
;
545 /* Implement TARGET_HANDLE_OPTION. */
548 sh_handle_option (size_t code
, const char *arg ATTRIBUTE_UNUSED
,
549 int value ATTRIBUTE_UNUSED
)
554 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH1
;
558 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2
;
562 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2A
;
566 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2A_NOFPU
;
570 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2A_SINGLE
;
573 case OPT_m2a_single_only
:
574 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2A_SINGLE_ONLY
;
578 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH2E
;
582 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH3
;
586 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH3E
;
593 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4
;
597 case OPT_m4_100_nofpu
:
598 case OPT_m4_200_nofpu
:
599 case OPT_m4_300_nofpu
:
603 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4_NOFPU
;
607 case OPT_m4_100_single
:
608 case OPT_m4_200_single
:
609 case OPT_m4_300_single
:
610 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4_SINGLE
;
613 case OPT_m4_single_only
:
614 case OPT_m4_100_single_only
:
615 case OPT_m4_200_single_only
:
616 case OPT_m4_300_single_only
:
617 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4_SINGLE_ONLY
;
621 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4A
;
626 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4A_NOFPU
;
630 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4A_SINGLE
;
633 case OPT_m4a_single_only
:
634 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH4A_SINGLE_ONLY
;
638 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_32MEDIA
;
641 case OPT_m5_32media_nofpu
:
642 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_32MEDIA_NOFPU
;
646 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_64MEDIA
;
649 case OPT_m5_64media_nofpu
:
650 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_64MEDIA_NOFPU
;
654 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_COMPACT
;
657 case OPT_m5_compact_nofpu
:
658 target_flags
= (target_flags
& ~MASK_ARCH
) | SELECT_SH5_COMPACT_NOFPU
;
666 /* Set default optimization options. */
668 sh_optimization_options (int level ATTRIBUTE_UNUSED
, int size ATTRIBUTE_UNUSED
)
673 sh_div_str
= "inv:minlat";
677 target_flags
|= MASK_SMALLCODE
;
678 sh_div_str
= SH_DIV_STR_FOR_SIZE
;
681 TARGET_CBRANCHDI4
= 1;
682 /* We can't meaningfully test TARGET_SHMEDIA here, because -m options
683 haven't been parsed yet, hence we'd read only the default.
684 sh_target_reg_class will return NO_REGS if this is not SHMEDIA, so
685 it's OK to always set flag_branch_target_load_optimize. */
688 flag_branch_target_load_optimize
= 1;
690 target_flags
|= MASK_SAVE_ALL_TARGET_REGS
;
692 /* Likewise, we can't meaningfully test TARGET_SH2E / TARGET_IEEE
693 here, so leave it to OVERRIDE_OPTIONS to set
694 flag_finite_math_only. We set it to 2 here so we know if the user
695 explicitly requested this to be on or off. */
696 flag_finite_math_only
= 2;
697 /* If flag_schedule_insns is 1, we set it to 2 here so we know if
698 the user explicitly requested this to be on or off. */
699 if (flag_schedule_insns
> 0)
700 flag_schedule_insns
= 2;
702 set_param_value ("simultaneous-prefetches", 2);
705 /* Implement OVERRIDE_OPTIONS macro. Validate and override various
706 options, and do some machine dependent initialization. */
708 sh_override_options (void)
712 SUBTARGET_OVERRIDE_OPTIONS
;
713 if (flag_finite_math_only
== 2)
714 flag_finite_math_only
715 = !flag_signaling_nans
&& TARGET_SH2E
&& ! TARGET_IEEE
;
716 if (TARGET_SH2E
&& !flag_finite_math_only
)
717 target_flags
|= MASK_IEEE
;
718 sh_cpu
= PROCESSOR_SH1
;
719 assembler_dialect
= 0;
721 sh_cpu
= PROCESSOR_SH2
;
723 sh_cpu
= PROCESSOR_SH2E
;
725 sh_cpu
= PROCESSOR_SH2A
;
727 sh_cpu
= PROCESSOR_SH3
;
729 sh_cpu
= PROCESSOR_SH3E
;
732 assembler_dialect
= 1;
733 sh_cpu
= PROCESSOR_SH4
;
735 if (TARGET_SH4A_ARCH
)
737 assembler_dialect
= 1;
738 sh_cpu
= PROCESSOR_SH4A
;
742 sh_cpu
= PROCESSOR_SH5
;
743 target_flags
|= MASK_ALIGN_DOUBLE
;
744 if (TARGET_SHMEDIA_FPU
)
745 target_flags
|= MASK_FMOVD
;
748 /* There are no delay slots on SHmedia. */
749 flag_delayed_branch
= 0;
750 /* Relaxation isn't yet supported for SHmedia */
751 target_flags
&= ~MASK_RELAX
;
752 /* After reload, if conversion does little good but can cause
754 - find_if_block doesn't do anything for SH because we don't
755 have conditional execution patterns. (We use conditional
756 move patterns, which are handled differently, and only
758 - find_cond_trap doesn't do anything for the SH because we
759 don't have conditional traps.
760 - find_if_case_1 uses redirect_edge_and_branch_force in
761 the only path that does an optimization, and this causes
762 an ICE when branch targets are in registers.
763 - find_if_case_2 doesn't do anything for the SHmedia after
764 reload except when it can redirect a tablejump - and
765 that's rather rare. */
766 flag_if_conversion2
= 0;
767 if (! strcmp (sh_div_str
, "call"))
768 sh_div_strategy
= SH_DIV_CALL
;
769 else if (! strcmp (sh_div_str
, "call2"))
770 sh_div_strategy
= SH_DIV_CALL2
;
771 if (! strcmp (sh_div_str
, "fp") && TARGET_FPU_ANY
)
772 sh_div_strategy
= SH_DIV_FP
;
773 else if (! strcmp (sh_div_str
, "inv"))
774 sh_div_strategy
= SH_DIV_INV
;
775 else if (! strcmp (sh_div_str
, "inv:minlat"))
776 sh_div_strategy
= SH_DIV_INV_MINLAT
;
777 else if (! strcmp (sh_div_str
, "inv20u"))
778 sh_div_strategy
= SH_DIV_INV20U
;
779 else if (! strcmp (sh_div_str
, "inv20l"))
780 sh_div_strategy
= SH_DIV_INV20L
;
781 else if (! strcmp (sh_div_str
, "inv:call2"))
782 sh_div_strategy
= SH_DIV_INV_CALL2
;
783 else if (! strcmp (sh_div_str
, "inv:call"))
784 sh_div_strategy
= SH_DIV_INV_CALL
;
785 else if (! strcmp (sh_div_str
, "inv:fp"))
788 sh_div_strategy
= SH_DIV_INV_FP
;
790 sh_div_strategy
= SH_DIV_INV
;
792 TARGET_CBRANCHDI4
= 0;
793 /* Assembler CFI isn't yet fully supported for SHmedia. */
794 flag_dwarf2_cfi_asm
= 0;
799 /* Only the sh64-elf assembler fully supports .quad properly. */
800 targetm
.asm_out
.aligned_op
.di
= NULL
;
801 targetm
.asm_out
.unaligned_op
.di
= NULL
;
805 if (! strcmp (sh_div_str
, "call-div1"))
806 sh_div_strategy
= SH_DIV_CALL_DIV1
;
807 else if (! strcmp (sh_div_str
, "call-fp")
808 && (TARGET_FPU_DOUBLE
809 || (TARGET_HARD_SH4
&& TARGET_SH2E
)
810 || (TARGET_SHCOMPACT
&& TARGET_FPU_ANY
)))
811 sh_div_strategy
= SH_DIV_CALL_FP
;
812 else if (! strcmp (sh_div_str
, "call-table") && TARGET_SH2
)
813 sh_div_strategy
= SH_DIV_CALL_TABLE
;
815 /* Pick one that makes most sense for the target in general.
816 It is not much good to use different functions depending
817 on -Os, since then we'll end up with two different functions
818 when some of the code is compiled for size, and some for
821 /* SH4 tends to emphasize speed. */
823 sh_div_strategy
= SH_DIV_CALL_TABLE
;
824 /* These have their own way of doing things. */
825 else if (TARGET_SH2A
)
826 sh_div_strategy
= SH_DIV_INTRINSIC
;
827 /* ??? Should we use the integer SHmedia function instead? */
828 else if (TARGET_SHCOMPACT
&& TARGET_FPU_ANY
)
829 sh_div_strategy
= SH_DIV_CALL_FP
;
830 /* SH1 .. SH3 cores often go into small-footprint systems, so
831 default to the smallest implementation available. */
832 else if (TARGET_SH2
) /* ??? EXPERIMENTAL */
833 sh_div_strategy
= SH_DIV_CALL_TABLE
;
835 sh_div_strategy
= SH_DIV_CALL_DIV1
;
838 TARGET_PRETEND_CMOVE
= 0;
839 if (sh_divsi3_libfunc
[0])
840 ; /* User supplied - leave it alone. */
841 else if (TARGET_DIVIDE_CALL_FP
)
842 sh_divsi3_libfunc
= "__sdivsi3_i4";
843 else if (TARGET_DIVIDE_CALL_TABLE
)
844 sh_divsi3_libfunc
= "__sdivsi3_i4i";
846 sh_divsi3_libfunc
= "__sdivsi3_1";
848 sh_divsi3_libfunc
= "__sdivsi3";
849 if (sh_branch_cost
== -1)
851 = TARGET_SH5
? 1 : ! TARGET_SH2
|| TARGET_HARD_SH4
? 2 : 1;
853 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
; regno
++)
854 if (! VALID_REGISTER_P (regno
))
855 sh_register_names
[regno
][0] = '\0';
857 for (regno
= 0; regno
< ADDREGNAMES_SIZE
; regno
++)
858 if (! VALID_REGISTER_P (ADDREGNAMES_REGNO (regno
)))
859 sh_additional_register_names
[regno
][0] = '\0';
861 flag_omit_frame_pointer
= (PREFERRED_DEBUGGING_TYPE
== DWARF2_DEBUG
);
863 if ((flag_pic
&& ! TARGET_PREFERGOT
)
864 || (TARGET_SHMEDIA
&& !TARGET_PT_FIXED
))
865 flag_no_function_cse
= 1;
867 if (targetm
.small_register_classes_for_mode_p (VOIDmode
)) \
869 /* Never run scheduling before reload, since that can
870 break global alloc, and generates slower code anyway due
871 to the pressure on R0. */
872 /* Enable sched1 for SH4 if the user explicitly requests.
873 When sched1 is enabled, the ready queue will be reordered by
874 the target hooks if pressure is high. We can not do this for
875 PIC, SH3 and lower as they give spill failures for R0. */
876 if (!TARGET_HARD_SH4
|| flag_pic
)
877 flag_schedule_insns
= 0;
878 /* ??? Current exception handling places basic block boundaries
879 after call_insns. It causes the high pressure on R0 and gives
880 spill failures for R0 in reload. See PR 22553 and the thread
882 <http://gcc.gnu.org/ml/gcc-patches/2005-10/msg00816.html>. */
883 else if (flag_exceptions
)
885 if (flag_schedule_insns
== 1)
886 warning (0, "ignoring -fschedule-insns because of exception handling bug");
887 flag_schedule_insns
= 0;
889 else if (flag_schedule_insns
== 2)
890 flag_schedule_insns
= 0;
893 if ((target_flags_explicit
& MASK_ACCUMULATE_OUTGOING_ARGS
) == 0)
894 target_flags
|= MASK_ACCUMULATE_OUTGOING_ARGS
;
896 /* Unwind info is not correct around the CFG unless either a frame
897 pointer is present or M_A_O_A is set. Fixing this requires rewriting
898 unwind info generation to be aware of the CFG and propagating states
900 if ((flag_unwind_tables
|| flag_asynchronous_unwind_tables
901 || flag_exceptions
|| flag_non_call_exceptions
)
902 && flag_omit_frame_pointer
903 && !(target_flags
& MASK_ACCUMULATE_OUTGOING_ARGS
))
905 if (target_flags_explicit
& MASK_ACCUMULATE_OUTGOING_ARGS
)
906 warning (0, "unwind tables currently require either a frame pointer "
907 "or -maccumulate-outgoing-args for correctness");
908 target_flags
|= MASK_ACCUMULATE_OUTGOING_ARGS
;
911 /* Unwinding with -freorder-blocks-and-partition does not work on this
912 architecture, because it requires far jumps to label crossing between
913 hot/cold sections which are rejected on this architecture. */
914 if (flag_reorder_blocks_and_partition
)
918 inform (input_location
,
919 "-freorder-blocks-and-partition does not work with "
920 "exceptions on this architecture");
921 flag_reorder_blocks_and_partition
= 0;
922 flag_reorder_blocks
= 1;
924 else if (flag_unwind_tables
)
926 inform (input_location
,
927 "-freorder-blocks-and-partition does not support unwind "
928 "info on this architecture");
929 flag_reorder_blocks_and_partition
= 0;
930 flag_reorder_blocks
= 1;
934 if (align_loops
== 0)
935 align_loops
= 1 << (TARGET_SH5
? 3 : 2);
936 if (align_jumps
== 0)
937 align_jumps
= 1 << CACHE_LOG
;
938 else if (align_jumps
< (TARGET_SHMEDIA
? 4 : 2))
939 align_jumps
= TARGET_SHMEDIA
? 4 : 2;
941 /* Allocation boundary (in *bytes*) for the code of a function.
942 SH1: 32 bit alignment is faster, because instructions are always
943 fetched as a pair from a longword boundary.
944 SH2 .. SH5 : align to cache line start. */
945 if (align_functions
== 0)
947 = TARGET_SMALLCODE
? FUNCTION_BOUNDARY
/8 : (1 << CACHE_LOG
);
948 /* The linker relaxation code breaks when a function contains
949 alignments that are larger than that at the start of a
954 = align_loops
> align_jumps
? align_loops
: align_jumps
;
956 /* Also take possible .long constants / mova tables int account. */
959 if (align_functions
< min_align
)
960 align_functions
= min_align
;
963 if (sh_fixed_range_str
)
964 sh_fix_range (sh_fixed_range_str
);
967 /* Print the operand address in x to the stream. */
970 print_operand_address (FILE *stream
, rtx x
)
972 switch (GET_CODE (x
))
976 fprintf (stream
, "@%s", reg_names
[true_regnum (x
)]);
981 rtx base
= XEXP (x
, 0);
982 rtx index
= XEXP (x
, 1);
984 switch (GET_CODE (index
))
987 fprintf (stream
, "@(%d,%s)", (int) INTVAL (index
),
988 reg_names
[true_regnum (base
)]);
994 int base_num
= true_regnum (base
);
995 int index_num
= true_regnum (index
);
997 fprintf (stream
, "@(r0,%s)",
998 reg_names
[MAX (base_num
, index_num
)]);
1009 fprintf (stream
, "@-%s", reg_names
[true_regnum (XEXP (x
, 0))]);
1013 fprintf (stream
, "@%s+", reg_names
[true_regnum (XEXP (x
, 0))]);
1017 x
= mark_constant_pool_use (x
);
1018 output_addr_const (stream
, x
);
1023 /* Print operand x (an rtx) in assembler syntax to file stream
1024 according to modifier code.
1026 '.' print a .s if insn needs delay slot
1027 ',' print LOCAL_LABEL_PREFIX
1028 '@' print trap, rte or rts depending upon pragma interruptness
1029 '#' output a nop if there is nothing to put in the delay slot
1030 ''' print likelihood suffix (/u for unlikely).
1031 '>' print branch target if -fverbose-asm
1032 'O' print a constant without the #
1033 'R' print the LSW of a dp value - changes if in little endian
1034 'S' print the MSW of a dp value - changes if in little endian
1035 'T' print the next word of a dp value - same as 'R' in big endian mode.
1036 'M' SHMEDIA: print an `x' if `m' will print `base,index'.
1037 otherwise: print .b / .w / .l / .s / .d suffix if operand is a MEM.
1038 'N' print 'r63' if the operand is (const_int 0).
1039 'd' print a V2SF reg as dN instead of fpN.
1040 'm' print a pair `base,offset' or `base,index', for LD and ST.
1041 'U' Likewise for {LD,ST}{HI,LO}.
1042 'V' print the position of a single bit set.
1043 'W' print the position of a single bit cleared.
1044 't' print a memory address which is a register.
1045 'u' prints the lowest 16 bits of CONST_INT, as an unsigned value.
1046 'o' output an operator. */
1049 print_operand (FILE *stream
, rtx x
, int code
)
1052 enum machine_mode mode
;
1060 && ! INSN_ANNULLED_BRANCH_P (XVECEXP (final_sequence
, 0, 0))
1061 && get_attr_length (XVECEXP (final_sequence
, 0, 1)))
1062 fprintf (stream
, ASSEMBLER_DIALECT
? "/s" : ".s");
1065 fprintf (stream
, "%s", LOCAL_LABEL_PREFIX
);
1068 trapa_attr
= lookup_attribute ("trap_exit",
1069 DECL_ATTRIBUTES (current_function_decl
));
1071 fprintf (stream
, "trapa #%ld",
1072 (long) TREE_INT_CST_LOW (TREE_VALUE (TREE_VALUE (trapa_attr
))));
1073 else if (sh_cfun_interrupt_handler_p ())
1075 if (sh_cfun_resbank_handler_p ())
1076 fprintf (stream
, "resbank\n");
1077 fprintf (stream
, "rte");
1080 fprintf (stream
, "rts");
1083 /* Output a nop if there's nothing in the delay slot. */
1084 if (dbr_sequence_length () == 0)
1085 fprintf (stream
, "\n\tnop");
1089 rtx note
= find_reg_note (current_output_insn
, REG_BR_PROB
, 0);
1091 if (note
&& INTVAL (XEXP (note
, 0)) * 2 < REG_BR_PROB_BASE
)
1092 fputs ("/u", stream
);
1096 if (flag_verbose_asm
&& JUMP_LABEL (current_output_insn
))
1098 fputs ("\t! target: ", stream
);
1099 output_addr_const (stream
, JUMP_LABEL (current_output_insn
));
1103 x
= mark_constant_pool_use (x
);
1104 output_addr_const (stream
, x
);
1106 /* N.B.: %R / %S / %T adjust memory addresses by four.
1107 For SHMEDIA, that means they can be used to access the first and
1108 second 32 bit part of a 64 bit (or larger) value that
1109 might be held in floating point registers or memory.
1110 While they can be used to access 64 bit parts of a larger value
1111 held in general purpose registers, that won't work with memory -
1112 neither for fp registers, since the frxx names are used. */
1114 if (REG_P (x
) || GET_CODE (x
) == SUBREG
)
1116 regno
= true_regnum (x
);
1117 regno
+= FP_REGISTER_P (regno
) ? 1 : LSW
;
1118 fputs (reg_names
[regno
], (stream
));
1122 x
= adjust_address (x
, SImode
, 4 * LSW
);
1123 print_operand_address (stream
, XEXP (x
, 0));
1129 mode
= GET_MODE (x
);
1130 if (mode
== VOIDmode
)
1132 if (GET_MODE_SIZE (mode
) >= 8)
1133 sub
= simplify_subreg (SImode
, x
, mode
, 4 * LSW
);
1135 print_operand (stream
, sub
, 0);
1137 output_operand_lossage ("invalid operand to %%R");
1141 if (REG_P (x
) || GET_CODE (x
) == SUBREG
)
1143 regno
= true_regnum (x
);
1144 regno
+= FP_REGISTER_P (regno
) ? 0 : MSW
;
1145 fputs (reg_names
[regno
], (stream
));
1149 x
= adjust_address (x
, SImode
, 4 * MSW
);
1150 print_operand_address (stream
, XEXP (x
, 0));
1156 mode
= GET_MODE (x
);
1157 if (mode
== VOIDmode
)
1159 if (GET_MODE_SIZE (mode
) >= 8)
1160 sub
= simplify_subreg (SImode
, x
, mode
, 4 * MSW
);
1162 print_operand (stream
, sub
, 0);
1164 output_operand_lossage ("invalid operand to %%S");
1168 /* Next word of a double. */
1169 switch (GET_CODE (x
))
1172 fputs (reg_names
[REGNO (x
) + 1], (stream
));
1175 if (GET_CODE (XEXP (x
, 0)) != PRE_DEC
1176 && GET_CODE (XEXP (x
, 0)) != POST_INC
)
1177 x
= adjust_address (x
, SImode
, 4);
1178 print_operand_address (stream
, XEXP (x
, 0));
1186 gcc_assert (MEM_P (x
));
1188 switch (GET_CODE (x
))
1192 print_operand (stream
, x
, 0);
1200 switch (GET_CODE (x
))
1202 case PLUS
: fputs ("add", stream
); break;
1203 case MINUS
: fputs ("sub", stream
); break;
1204 case MULT
: fputs ("mul", stream
); break;
1205 case DIV
: fputs ("div", stream
); break;
1206 case EQ
: fputs ("eq", stream
); break;
1207 case NE
: fputs ("ne", stream
); break;
1208 case GT
: case LT
: fputs ("gt", stream
); break;
1209 case GE
: case LE
: fputs ("ge", stream
); break;
1210 case GTU
: case LTU
: fputs ("gtu", stream
); break;
1211 case GEU
: case LEU
: fputs ("geu", stream
); break;
1220 && GET_CODE (XEXP (x
, 0)) == PLUS
1221 && (REG_P (XEXP (XEXP (x
, 0), 1))
1222 || GET_CODE (XEXP (XEXP (x
, 0), 1)) == SUBREG
))
1223 fputc ('x', stream
);
1229 switch (GET_MODE (x
))
1231 case QImode
: fputs (".b", stream
); break;
1232 case HImode
: fputs (".w", stream
); break;
1233 case SImode
: fputs (".l", stream
); break;
1234 case SFmode
: fputs (".s", stream
); break;
1235 case DFmode
: fputs (".d", stream
); break;
1236 default: gcc_unreachable ();
1243 gcc_assert (MEM_P (x
));
1247 switch (GET_CODE (x
))
1251 print_operand (stream
, x
, 0);
1252 fputs (", 0", stream
);
1256 print_operand (stream
, XEXP (x
, 0), 0);
1257 fputs (", ", stream
);
1258 print_operand (stream
, XEXP (x
, 1), 0);
1268 int num
= exact_log2 (INTVAL (x
));
1269 gcc_assert (num
>= 0);
1270 fprintf (stream
, "#%d", num
);
1276 int num
= exact_log2 (~INTVAL (x
));
1277 gcc_assert (num
>= 0);
1278 fprintf (stream
, "#%d", num
);
1283 gcc_assert (REG_P (x
) && GET_MODE (x
) == V2SFmode
);
1285 fprintf ((stream
), "d%s", reg_names
[REGNO (x
)] + 1);
1289 if (x
== CONST0_RTX (GET_MODE (x
)))
1291 fprintf ((stream
), "r63");
1294 goto default_output
;
1296 if (CONST_INT_P (x
))
1298 fprintf ((stream
), "%u", (unsigned) INTVAL (x
) & (0x10000 - 1));
1306 mode
= GET_MODE (x
);
1308 switch (GET_CODE (x
))
1312 rtx inner
= XEXP (x
, 0);
1314 enum machine_mode inner_mode
;
1316 /* We might see SUBREGs with vector mode registers inside. */
1317 if (GET_CODE (inner
) == SUBREG
1318 && (GET_MODE_SIZE (GET_MODE (inner
))
1319 == GET_MODE_SIZE (GET_MODE (SUBREG_REG (inner
))))
1320 && subreg_lowpart_p (inner
))
1321 inner
= SUBREG_REG (inner
);
1322 if (CONST_INT_P (inner
))
1324 x
= GEN_INT (trunc_int_for_mode (INTVAL (inner
), GET_MODE (x
)));
1325 goto default_output
;
1327 inner_mode
= GET_MODE (inner
);
1328 if (GET_CODE (inner
) == SUBREG
1329 && (GET_MODE_SIZE (GET_MODE (inner
))
1330 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (inner
))))
1331 && REG_P (SUBREG_REG (inner
)))
1333 offset
= subreg_regno_offset (REGNO (SUBREG_REG (inner
)),
1334 GET_MODE (SUBREG_REG (inner
)),
1335 SUBREG_BYTE (inner
),
1337 inner
= SUBREG_REG (inner
);
1339 if (!REG_P (inner
) || GET_MODE_SIZE (inner_mode
) > 8)
1341 /* Floating point register pairs are always big endian;
1342 general purpose registers are 64 bit wide. */
1343 regno
= REGNO (inner
);
1344 regno
= (HARD_REGNO_NREGS (regno
, inner_mode
)
1345 - HARD_REGNO_NREGS (regno
, mode
))
1353 /* FIXME: We need this on SHmedia32 because reload generates
1354 some sign-extended HI or QI loads into DImode registers
1355 but, because Pmode is SImode, the address ends up with a
1356 subreg:SI of the DImode register. Maybe reload should be
1357 fixed so as to apply alter_subreg to such loads? */
1359 gcc_assert (trapping_target_operand (x
, VOIDmode
));
1360 x
= XEXP (XEXP (x
, 2), 0);
1361 goto default_output
;
1363 gcc_assert (SUBREG_BYTE (x
) == 0
1364 && REG_P (SUBREG_REG (x
)));
1372 if (FP_REGISTER_P (regno
)
1373 && mode
== V16SFmode
)
1374 fprintf ((stream
), "mtrx%s", reg_names
[regno
] + 2);
1375 else if (FP_REGISTER_P (REGNO (x
))
1376 && mode
== V4SFmode
)
1377 fprintf ((stream
), "fv%s", reg_names
[regno
] + 2);
1379 && mode
== V2SFmode
)
1380 fprintf ((stream
), "fp%s", reg_names
[regno
] + 2);
1381 else if (FP_REGISTER_P (REGNO (x
))
1382 && GET_MODE_SIZE (mode
) > 4)
1383 fprintf ((stream
), "d%s", reg_names
[regno
] + 1);
1385 fputs (reg_names
[regno
], (stream
));
1389 output_address (XEXP (x
, 0));
1394 fputc ('#', stream
);
1395 output_addr_const (stream
, x
);
1403 /* Encode symbol attributes of a SYMBOL_REF into its
1404 SYMBOL_REF_FLAGS. */
1406 sh_encode_section_info (tree decl
, rtx rtl
, int first
)
1408 default_encode_section_info (decl
, rtl
, first
);
1410 if (TREE_CODE (decl
) == FUNCTION_DECL
1411 && sh2a_function_vector_p (decl
) && TARGET_SH2A
)
1412 SYMBOL_REF_FLAGS (XEXP (rtl
, 0)) |= SYMBOL_FLAG_FUNCVEC_FUNCTION
;
1415 /* Like force_operand, but guarantees that VALUE ends up in TARGET. */
1417 force_into (rtx value
, rtx target
)
1419 value
= force_operand (value
, target
);
1420 if (! rtx_equal_p (value
, target
))
1421 emit_insn (gen_move_insn (target
, value
));
1424 /* Emit code to perform a block move. Choose the best method.
1426 OPERANDS[0] is the destination.
1427 OPERANDS[1] is the source.
1428 OPERANDS[2] is the size.
1429 OPERANDS[3] is the alignment safe to use. */
1432 expand_block_move (rtx
*operands
)
1434 int align
= INTVAL (operands
[3]);
1435 int constp
= (CONST_INT_P (operands
[2]));
1436 int bytes
= (constp
? INTVAL (operands
[2]) : 0);
1441 /* If we could use mov.l to move words and dest is word-aligned, we
1442 can use movua.l for loads and still generate a relatively short
1443 and efficient sequence. */
1444 if (TARGET_SH4A_ARCH
&& align
< 4
1445 && MEM_ALIGN (operands
[0]) >= 32
1446 && can_move_by_pieces (bytes
, 32))
1448 rtx dest
= copy_rtx (operands
[0]);
1449 rtx src
= copy_rtx (operands
[1]);
1450 /* We could use different pseudos for each copied word, but
1451 since movua can only load into r0, it's kind of
1453 rtx temp
= gen_reg_rtx (SImode
);
1454 rtx src_addr
= copy_addr_to_reg (XEXP (src
, 0));
1457 while (copied
+ 4 <= bytes
)
1459 rtx to
= adjust_address (dest
, SImode
, copied
);
1460 rtx from
= adjust_automodify_address (src
, BLKmode
,
1463 set_mem_size (from
, GEN_INT (4));
1464 emit_insn (gen_movua (temp
, from
));
1465 emit_move_insn (src_addr
, plus_constant (src_addr
, 4));
1466 emit_move_insn (to
, temp
);
1471 move_by_pieces (adjust_address (dest
, BLKmode
, copied
),
1472 adjust_automodify_address (src
, BLKmode
,
1474 bytes
- copied
, align
, 0);
1479 /* If it isn't a constant number of bytes, or if it doesn't have 4 byte
1480 alignment, or if it isn't a multiple of 4 bytes, then fail. */
1481 if (align
< 4 || (bytes
% 4 != 0))
1484 if (TARGET_HARD_SH4
)
1488 else if (bytes
== 12)
1490 rtx func_addr_rtx
= gen_reg_rtx (Pmode
);
1491 rtx r4
= gen_rtx_REG (SImode
, 4);
1492 rtx r5
= gen_rtx_REG (SImode
, 5);
1494 function_symbol (func_addr_rtx
, "__movmemSI12_i4", SFUNC_STATIC
);
1495 force_into (XEXP (operands
[0], 0), r4
);
1496 force_into (XEXP (operands
[1], 0), r5
);
1497 emit_insn (gen_block_move_real_i4 (func_addr_rtx
));
1500 else if (! TARGET_SMALLCODE
)
1502 const char *entry_name
;
1503 rtx func_addr_rtx
= gen_reg_rtx (Pmode
);
1505 rtx r4
= gen_rtx_REG (SImode
, 4);
1506 rtx r5
= gen_rtx_REG (SImode
, 5);
1507 rtx r6
= gen_rtx_REG (SImode
, 6);
1509 entry_name
= (bytes
& 4 ? "__movmem_i4_odd" : "__movmem_i4_even");
1510 function_symbol (func_addr_rtx
, entry_name
, SFUNC_STATIC
);
1511 force_into (XEXP (operands
[0], 0), r4
);
1512 force_into (XEXP (operands
[1], 0), r5
);
1514 dwords
= bytes
>> 3;
1515 emit_insn (gen_move_insn (r6
, GEN_INT (dwords
- 1)));
1516 emit_insn (gen_block_lump_real_i4 (func_addr_rtx
));
1525 rtx func_addr_rtx
= gen_reg_rtx (Pmode
);
1526 rtx r4
= gen_rtx_REG (SImode
, 4);
1527 rtx r5
= gen_rtx_REG (SImode
, 5);
1529 sprintf (entry
, "__movmemSI%d", bytes
);
1530 function_symbol (func_addr_rtx
, entry
, SFUNC_STATIC
);
1531 force_into (XEXP (operands
[0], 0), r4
);
1532 force_into (XEXP (operands
[1], 0), r5
);
1533 emit_insn (gen_block_move_real (func_addr_rtx
));
1537 /* This is the same number of bytes as a memcpy call, but to a different
1538 less common function name, so this will occasionally use more space. */
1539 if (! TARGET_SMALLCODE
)
1541 rtx func_addr_rtx
= gen_reg_rtx (Pmode
);
1542 int final_switch
, while_loop
;
1543 rtx r4
= gen_rtx_REG (SImode
, 4);
1544 rtx r5
= gen_rtx_REG (SImode
, 5);
1545 rtx r6
= gen_rtx_REG (SImode
, 6);
1547 function_symbol (func_addr_rtx
, "__movmem", SFUNC_STATIC
);
1548 force_into (XEXP (operands
[0], 0), r4
);
1549 force_into (XEXP (operands
[1], 0), r5
);
1551 /* r6 controls the size of the move. 16 is decremented from it
1552 for each 64 bytes moved. Then the negative bit left over is used
1553 as an index into a list of move instructions. e.g., a 72 byte move
1554 would be set up with size(r6) = 14, for one iteration through the
1555 big while loop, and a switch of -2 for the last part. */
1557 final_switch
= 16 - ((bytes
/ 4) % 16);
1558 while_loop
= ((bytes
/ 4) / 16 - 1) * 16;
1559 emit_insn (gen_move_insn (r6
, GEN_INT (while_loop
+ final_switch
)));
1560 emit_insn (gen_block_lump_real (func_addr_rtx
));
1567 /* Prepare operands for a move define_expand; specifically, one of the
1568 operands must be in a register. */
1571 prepare_move_operands (rtx operands
[], enum machine_mode mode
)
1573 if ((mode
== SImode
|| mode
== DImode
)
1575 && ! ((mode
== Pmode
|| mode
== ptr_mode
)
1576 && tls_symbolic_operand (operands
[1], Pmode
) != TLS_MODEL_NONE
))
1579 if (SYMBOLIC_CONST_P (operands
[1]))
1581 if (MEM_P (operands
[0]))
1582 operands
[1] = force_reg (Pmode
, operands
[1]);
1583 else if (TARGET_SHMEDIA
1584 && GET_CODE (operands
[1]) == LABEL_REF
1585 && target_reg_operand (operands
[0], mode
))
1589 temp
= (!can_create_pseudo_p ()
1591 : gen_reg_rtx (Pmode
));
1592 operands
[1] = legitimize_pic_address (operands
[1], mode
, temp
);
1595 else if (GET_CODE (operands
[1]) == CONST
1596 && GET_CODE (XEXP (operands
[1], 0)) == PLUS
1597 && SYMBOLIC_CONST_P (XEXP (XEXP (operands
[1], 0), 0)))
1599 temp
= !can_create_pseudo_p () ? operands
[0] : gen_reg_rtx (Pmode
);
1600 temp
= legitimize_pic_address (XEXP (XEXP (operands
[1], 0), 0),
1602 operands
[1] = expand_binop (mode
, add_optab
, temp
,
1603 XEXP (XEXP (operands
[1], 0), 1),
1604 (!can_create_pseudo_p ()
1606 : gen_reg_rtx (Pmode
)),
1607 0, OPTAB_LIB_WIDEN
);
1611 if (! reload_in_progress
&& ! reload_completed
)
1613 /* Copy the source to a register if both operands aren't registers. */
1614 if (! register_operand (operands
[0], mode
)
1615 && ! sh_register_operand (operands
[1], mode
))
1616 operands
[1] = copy_to_mode_reg (mode
, operands
[1]);
1618 if (MEM_P (operands
[0]) && ! memory_operand (operands
[0], mode
))
1620 /* This is like change_address_1 (operands[0], mode, 0, 1) ,
1621 except that we can't use that function because it is static. */
1622 rtx new_rtx
= change_address (operands
[0], mode
, 0);
1623 MEM_COPY_ATTRIBUTES (new_rtx
, operands
[0]);
1624 operands
[0] = new_rtx
;
1627 /* This case can happen while generating code to move the result
1628 of a library call to the target. Reject `st r0,@(rX,rY)' because
1629 reload will fail to find a spill register for rX, since r0 is already
1630 being used for the source. */
1632 && refers_to_regno_p (R0_REG
, R0_REG
+ 1, operands
[1], (rtx
*)0)
1633 && MEM_P (operands
[0])
1634 && GET_CODE (XEXP (operands
[0], 0)) == PLUS
1635 && REG_P (XEXP (XEXP (operands
[0], 0), 1)))
1636 operands
[1] = copy_to_mode_reg (mode
, operands
[1]);
1639 if (mode
== Pmode
|| mode
== ptr_mode
)
1642 enum tls_model tls_kind
;
1646 if (GET_CODE (op1
) == CONST
1647 && GET_CODE (XEXP (op1
, 0)) == PLUS
1648 && (tls_symbolic_operand (XEXP (XEXP (op1
, 0), 0), Pmode
)
1651 opc
= XEXP (XEXP (op1
, 0), 1);
1652 op1
= XEXP (XEXP (op1
, 0), 0);
1657 if ((tls_kind
= tls_symbolic_operand (op1
, Pmode
)) != TLS_MODEL_NONE
)
1659 rtx tga_op1
, tga_ret
, tmp
, tmp2
;
1663 case TLS_MODEL_GLOBAL_DYNAMIC
:
1664 tga_ret
= gen_rtx_REG (Pmode
, R0_REG
);
1665 emit_call_insn (gen_tls_global_dynamic (tga_ret
, op1
));
1669 case TLS_MODEL_LOCAL_DYNAMIC
:
1670 tga_ret
= gen_rtx_REG (Pmode
, R0_REG
);
1671 emit_call_insn (gen_tls_local_dynamic (tga_ret
, op1
));
1673 tmp
= gen_reg_rtx (Pmode
);
1674 emit_move_insn (tmp
, tga_ret
);
1676 if (register_operand (op0
, Pmode
))
1679 tmp2
= gen_reg_rtx (Pmode
);
1681 emit_insn (gen_symDTPOFF2reg (tmp2
, op1
, tmp
));
1685 case TLS_MODEL_INITIAL_EXEC
:
1688 /* Don't schedule insns for getting GOT address when
1689 the first scheduling is enabled, to avoid spill
1691 if (flag_schedule_insns
)
1692 emit_insn (gen_blockage ());
1693 emit_insn (gen_GOTaddr2picreg ());
1694 emit_use (gen_rtx_REG (SImode
, PIC_REG
));
1695 if (flag_schedule_insns
)
1696 emit_insn (gen_blockage ());
1698 tga_op1
= !can_create_pseudo_p () ? op0
: gen_reg_rtx (Pmode
);
1699 tmp
= gen_sym2GOTTPOFF (op1
);
1700 emit_insn (gen_tls_initial_exec (tga_op1
, tmp
));
1704 case TLS_MODEL_LOCAL_EXEC
:
1705 tmp2
= gen_reg_rtx (Pmode
);
1706 emit_insn (gen_load_gbr (tmp2
));
1707 tmp
= gen_reg_rtx (Pmode
);
1708 emit_insn (gen_symTPOFF2reg (tmp
, op1
));
1710 if (register_operand (op0
, Pmode
))
1713 op1
= gen_reg_rtx (Pmode
);
1715 emit_insn (gen_addsi3 (op1
, tmp
, tmp2
));
1722 emit_insn (gen_addsi3 (op1
, op1
, force_reg (SImode
, opc
)));
1731 prepare_cbranch_operands (rtx
*operands
, enum machine_mode mode
,
1732 enum rtx_code comparison
)
1735 rtx scratch
= NULL_RTX
;
1737 if (comparison
== LAST_AND_UNUSED_RTX_CODE
)
1738 comparison
= GET_CODE (operands
[0]);
1740 scratch
= operands
[4];
1741 if (CONST_INT_P (operands
[1])
1742 && !CONST_INT_P (operands
[2]))
1744 rtx tmp
= operands
[1];
1746 operands
[1] = operands
[2];
1748 comparison
= swap_condition (comparison
);
1750 if (CONST_INT_P (operands
[2]))
1752 HOST_WIDE_INT val
= INTVAL (operands
[2]);
1753 if ((val
== -1 || val
== -0x81)
1754 && (comparison
== GT
|| comparison
== LE
))
1756 comparison
= (comparison
== GT
) ? GE
: LT
;
1757 operands
[2] = gen_int_mode (val
+ 1, mode
);
1759 else if ((val
== 1 || val
== 0x80)
1760 && (comparison
== GE
|| comparison
== LT
))
1762 comparison
= (comparison
== GE
) ? GT
: LE
;
1763 operands
[2] = gen_int_mode (val
- 1, mode
);
1765 else if (val
== 1 && (comparison
== GEU
|| comparison
== LTU
))
1767 comparison
= (comparison
== GEU
) ? NE
: EQ
;
1768 operands
[2] = CONST0_RTX (mode
);
1770 else if (val
== 0x80 && (comparison
== GEU
|| comparison
== LTU
))
1772 comparison
= (comparison
== GEU
) ? GTU
: LEU
;
1773 operands
[2] = gen_int_mode (val
- 1, mode
);
1775 else if (val
== 0 && (comparison
== GTU
|| comparison
== LEU
))
1776 comparison
= (comparison
== GTU
) ? NE
: EQ
;
1777 else if (mode
== SImode
1778 && ((val
== 0x7fffffff
1779 && (comparison
== GTU
|| comparison
== LEU
))
1780 || ((unsigned HOST_WIDE_INT
) val
1781 == (unsigned HOST_WIDE_INT
) 0x7fffffff + 1
1782 && (comparison
== GEU
|| comparison
== LTU
))))
1784 comparison
= (comparison
== GTU
|| comparison
== GEU
) ? LT
: GE
;
1785 operands
[2] = CONST0_RTX (mode
);
1789 if (can_create_pseudo_p ())
1790 operands
[1] = force_reg (mode
, op1
);
1791 /* When we are handling DImode comparisons, we want to keep constants so
1792 that we can optimize the component comparisons; however, memory loads
1793 are better issued as a whole so that they can be scheduled well.
1794 SImode equality comparisons allow I08 constants, but only when they
1795 compare r0. Hence, if operands[1] has to be loaded from somewhere else
1796 into a register, that register might as well be r0, and we allow the
1797 constant. If it is already in a register, this is likely to be
1798 allocated to a different hard register, thus we load the constant into
1799 a register unless it is zero. */
1800 if (!REG_P (operands
[2])
1801 && (!CONST_INT_P (operands
[2])
1802 || (mode
== SImode
&& operands
[2] != CONST0_RTX (SImode
)
1803 && ((comparison
!= EQ
&& comparison
!= NE
)
1804 || (REG_P (op1
) && REGNO (op1
) != R0_REG
)
1805 || !satisfies_constraint_I08 (operands
[2])))))
1807 if (scratch
&& GET_MODE (scratch
) == mode
)
1809 emit_move_insn (scratch
, operands
[2]);
1810 operands
[2] = scratch
;
1812 else if (can_create_pseudo_p ())
1813 operands
[2] = force_reg (mode
, operands
[2]);
1819 expand_cbranchsi4 (rtx
*operands
, enum rtx_code comparison
, int probability
)
1821 rtx (*branch_expander
) (rtx
) = gen_branch_true
;
1824 comparison
= prepare_cbranch_operands (operands
, SImode
, comparison
);
1827 case NE
: case LT
: case LE
: case LTU
: case LEU
:
1828 comparison
= reverse_condition (comparison
);
1829 branch_expander
= gen_branch_false
;
1832 emit_insn (gen_rtx_SET (VOIDmode
, gen_rtx_REG (SImode
, T_REG
),
1833 gen_rtx_fmt_ee (comparison
, SImode
,
1834 operands
[1], operands
[2])));
1835 jump
= emit_jump_insn (branch_expander (operands
[3]));
1836 if (probability
>= 0)
1837 add_reg_note (jump
, REG_BR_PROB
, GEN_INT (probability
));
1841 /* ??? How should we distribute probabilities when more than one branch
1842 is generated. So far we only have soem ad-hoc observations:
1843 - If the operands are random, they are likely to differ in both parts.
1844 - If comparing items in a hash chain, the operands are random or equal;
1845 operation should be EQ or NE.
1846 - If items are searched in an ordered tree from the root, we can expect
1847 the highpart to be unequal about half of the time; operation should be
1848 an inequality comparison, operands non-constant, and overall probability
1849 about 50%. Likewise for quicksort.
1850 - Range checks will be often made against constants. Even if we assume for
1851 simplicity an even distribution of the non-constant operand over a
1852 sub-range here, the same probability could be generated with differently
1853 wide sub-ranges - as long as the ratio of the part of the subrange that
1854 is before the threshold to the part that comes after the threshold stays
1855 the same. Thus, we can't really tell anything here;
1856 assuming random distribution is at least simple.
1860 expand_cbranchdi4 (rtx
*operands
, enum rtx_code comparison
)
1862 enum rtx_code msw_taken
, msw_skip
, lsw_taken
;
1863 rtx skip_label
= NULL_RTX
;
1864 rtx op1h
, op1l
, op2h
, op2l
;
1867 int msw_taken_prob
= -1, msw_skip_prob
= -1, lsw_taken_prob
= -1;
1868 rtx scratch
= operands
[4];
1870 comparison
= prepare_cbranch_operands (operands
, DImode
, comparison
);
1871 op1h
= gen_highpart_mode (SImode
, DImode
, operands
[1]);
1872 op2h
= gen_highpart_mode (SImode
, DImode
, operands
[2]);
1873 op1l
= gen_lowpart (SImode
, operands
[1]);
1874 op2l
= gen_lowpart (SImode
, operands
[2]);
1875 msw_taken
= msw_skip
= lsw_taken
= LAST_AND_UNUSED_RTX_CODE
;
1876 prob
= split_branch_probability
;
1877 rev_prob
= REG_BR_PROB_BASE
- prob
;
1880 /* ??? Should we use the cmpeqdi_t pattern for equality comparisons?
1881 That costs 1 cycle more when the first branch can be predicted taken,
1882 but saves us mispredicts because only one branch needs prediction.
1883 It also enables generating the cmpeqdi_t-1 pattern. */
1885 if (TARGET_CMPEQDI_T
)
1887 emit_insn (gen_cmpeqdi_t (operands
[1], operands
[2]));
1888 emit_jump_insn (gen_branch_true (operands
[3]));
1895 /* If we had more precision, we'd use rev_prob - (rev_prob >> 32) .
1897 msw_skip_prob
= rev_prob
;
1898 if (REG_BR_PROB_BASE
<= 65535)
1899 lsw_taken_prob
= prob
? REG_BR_PROB_BASE
: 0;
1902 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 64);
1906 - ((HOST_WIDEST_INT
) REG_BR_PROB_BASE
* rev_prob
1907 / ((HOST_WIDEST_INT
) prob
<< 32)))
1913 if (TARGET_CMPEQDI_T
)
1915 emit_insn (gen_cmpeqdi_t (operands
[1], operands
[2]));
1916 emit_jump_insn (gen_branch_false (operands
[3]));
1920 msw_taken_prob
= prob
;
1925 msw_taken
= comparison
;
1926 if (CONST_INT_P (op2l
) && INTVAL (op2l
) == -1)
1928 if (comparison
!= GTU
|| op2h
!= CONST0_RTX (SImode
))
1929 msw_skip
= swap_condition (msw_taken
);
1933 if (op2l
== CONST0_RTX (SImode
))
1934 msw_taken
= comparison
;
1937 msw_taken
= comparison
== GE
? GT
: GTU
;
1938 msw_skip
= swap_condition (msw_taken
);
1943 msw_taken
= comparison
;
1944 if (op2l
== CONST0_RTX (SImode
))
1946 msw_skip
= swap_condition (msw_taken
);
1950 if (CONST_INT_P (op2l
) && INTVAL (op2l
) == -1)
1951 msw_taken
= comparison
;
1955 if (comparison
== LE
)
1957 else if (op2h
!= CONST0_RTX (SImode
))
1961 msw_skip
= swap_condition (msw_taken
);
1964 default: return false;
1966 num_branches
= ((msw_taken
!= LAST_AND_UNUSED_RTX_CODE
)
1967 + (msw_skip
!= LAST_AND_UNUSED_RTX_CODE
)
1968 + (lsw_taken
!= LAST_AND_UNUSED_RTX_CODE
));
1969 if (comparison
!= EQ
&& comparison
!= NE
&& num_branches
> 1)
1971 if (!CONSTANT_P (operands
[2])
1972 && prob
>= (int) (REG_BR_PROB_BASE
* 3 / 8U)
1973 && prob
<= (int) (REG_BR_PROB_BASE
* 5 / 8U))
1975 msw_taken_prob
= prob
/ 2U;
1977 = REG_BR_PROB_BASE
* rev_prob
/ (REG_BR_PROB_BASE
+ rev_prob
);
1978 lsw_taken_prob
= prob
;
1982 msw_taken_prob
= prob
;
1983 msw_skip_prob
= REG_BR_PROB_BASE
;
1984 /* ??? If we have a constant op2h, should we use that when
1985 calculating lsw_taken_prob? */
1986 lsw_taken_prob
= prob
;
1991 operands
[4] = NULL_RTX
;
1992 if (reload_completed
1993 && ! arith_reg_or_0_operand (op2h
, SImode
)
1994 && (true_regnum (op1h
) || (comparison
!= EQ
&& comparison
!= NE
))
1995 && (msw_taken
!= LAST_AND_UNUSED_RTX_CODE
1996 || msw_skip
!= LAST_AND_UNUSED_RTX_CODE
))
1998 emit_move_insn (scratch
, operands
[2]);
1999 operands
[2] = scratch
;
2001 if (msw_taken
!= LAST_AND_UNUSED_RTX_CODE
)
2002 expand_cbranchsi4 (operands
, msw_taken
, msw_taken_prob
);
2003 if (msw_skip
!= LAST_AND_UNUSED_RTX_CODE
)
2005 rtx taken_label
= operands
[3];
2007 /* Operands were possibly modified, but msw_skip doesn't expect this.
2008 Always use the original ones. */
2009 if (msw_taken
!= LAST_AND_UNUSED_RTX_CODE
)
2015 operands
[3] = skip_label
= gen_label_rtx ();
2016 expand_cbranchsi4 (operands
, msw_skip
, msw_skip_prob
);
2017 operands
[3] = taken_label
;
2021 if (lsw_taken
!= LAST_AND_UNUSED_RTX_CODE
)
2023 if (reload_completed
2024 && ! arith_reg_or_0_operand (op2l
, SImode
)
2025 && (true_regnum (op1l
) || (lsw_taken
!= EQ
&& lsw_taken
!= NE
)))
2027 emit_move_insn (scratch
, operands
[2]);
2028 operands
[2] = scratch
;
2030 expand_cbranchsi4 (operands
, lsw_taken
, lsw_taken_prob
);
2032 if (msw_skip
!= LAST_AND_UNUSED_RTX_CODE
)
2033 emit_label (skip_label
);
2037 /* Emit INSN, possibly in a PARALLEL with an USE of fpscr for SH4. */
2040 sh_emit_set_t_insn (rtx insn
, enum machine_mode mode
)
2042 if ((TARGET_SH4
|| TARGET_SH2A
) && GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2044 insn
= gen_rtx_PARALLEL (VOIDmode
,
2046 gen_rtx_USE (VOIDmode
, get_fpscr_rtx ())));
2047 (mode
== SFmode
? emit_sf_insn
: emit_df_insn
) (insn
);
2053 /* Prepare the operands for an scc instruction; make sure that the
2054 compare has been done and the result is in T_REG. */
2056 sh_emit_scc_to_t (enum rtx_code code
, rtx op0
, rtx op1
)
2058 rtx t_reg
= gen_rtx_REG (SImode
, T_REG
);
2059 enum rtx_code oldcode
= code
;
2060 enum machine_mode mode
;
2062 /* First need a compare insn. */
2066 /* It isn't possible to handle this case. */
2083 if (code
!= oldcode
)
2090 mode
= GET_MODE (op0
);
2091 if (mode
== VOIDmode
)
2092 mode
= GET_MODE (op1
);
2094 op0
= force_reg (mode
, op0
);
2095 if ((code
!= EQ
&& code
!= NE
2096 && (op1
!= const0_rtx
2097 || code
== GTU
|| code
== GEU
|| code
== LTU
|| code
== LEU
))
2098 || (mode
== DImode
&& op1
!= const0_rtx
)
2099 || (TARGET_SH2E
&& GET_MODE_CLASS (mode
) == MODE_FLOAT
))
2100 op1
= force_reg (mode
, op1
);
2102 sh_emit_set_t_insn (gen_rtx_SET (VOIDmode
, t_reg
,
2103 gen_rtx_fmt_ee (code
, SImode
, op0
, op1
)),
2108 sh_emit_cheap_store_flag (enum machine_mode mode
, enum rtx_code code
,
2111 rtx target
= gen_reg_rtx (SImode
);
2114 gcc_assert (TARGET_SHMEDIA
);
2123 tmp
= gen_rtx_fmt_ee (code
, SImode
, op0
, op1
);
2124 emit_insn (gen_cstore4_media (target
, tmp
, op0
, op1
));
2134 tmp
= gen_rtx_fmt_ee (reverse_condition (code
), mode
, op0
, op1
);
2135 emit_insn (gen_cstore4_media (target
, tmp
, op0
, op1
));
2153 rtx t2
= gen_reg_rtx (DImode
);
2154 emit_insn (gen_extendsidi2 (t2
, target
));
2158 return gen_rtx_fmt_ee (code
, VOIDmode
, target
, const0_rtx
);
2161 /* Called from the md file, set up the operands of a compare instruction. */
2164 sh_emit_compare_and_branch (rtx
*operands
, enum machine_mode mode
)
2166 enum rtx_code code
= GET_CODE (operands
[0]);
2167 enum rtx_code branch_code
;
2168 rtx op0
= operands
[1];
2169 rtx op1
= operands
[2];
2171 bool need_ccmpeq
= false;
2173 if (TARGET_SH2E
&& GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2175 op0
= force_reg (mode
, op0
);
2176 op1
= force_reg (mode
, op1
);
2180 if (code
!= EQ
|| mode
== DImode
)
2182 /* Force args into regs, since we can't use constants here. */
2183 op0
= force_reg (mode
, op0
);
2184 if (op1
!= const0_rtx
|| code
== GTU
|| code
== GEU
)
2185 op1
= force_reg (mode
, op1
);
2189 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2192 || (code
== LE
&& TARGET_IEEE
&& TARGET_SH2E
)
2193 || (code
== GE
&& !(TARGET_IEEE
&& TARGET_SH2E
)))
2195 tem
= op0
, op0
= op1
, op1
= tem
;
2196 code
= swap_condition (code
);
2199 /* GE becomes fcmp/gt+fcmp/eq, for SH2E and TARGET_IEEE only. */
2202 gcc_assert (TARGET_IEEE
&& TARGET_SH2E
);
2207 /* Now we can have EQ, NE, GT, LE. NE and LE are then transformed
2208 to EQ/GT respectively. */
2209 gcc_assert (code
== EQ
|| code
== GT
|| code
== NE
|| code
== LE
);
2226 branch_code
= reverse_condition (code
);
2232 insn
= gen_rtx_SET (VOIDmode
,
2233 gen_rtx_REG (SImode
, T_REG
),
2234 gen_rtx_fmt_ee (branch_code
, SImode
, op0
, op1
));
2236 sh_emit_set_t_insn (insn
, mode
);
2238 sh_emit_set_t_insn (gen_ieee_ccmpeqsf_t (op0
, op1
), mode
);
2240 if (branch_code
== code
)
2241 emit_jump_insn (gen_branch_true (operands
[3]));
2243 emit_jump_insn (gen_branch_false (operands
[3]));
2247 sh_emit_compare_and_set (rtx
*operands
, enum machine_mode mode
)
2249 enum rtx_code code
= GET_CODE (operands
[1]);
2250 rtx op0
= operands
[2];
2251 rtx op1
= operands
[3];
2253 bool invert
= false;
2256 op0
= force_reg (mode
, op0
);
2257 if ((code
!= EQ
&& code
!= NE
2258 && (op1
!= const0_rtx
2259 || code
== GTU
|| code
== GEU
|| code
== LTU
|| code
== LEU
))
2260 || (mode
== DImode
&& op1
!= const0_rtx
)
2261 || (TARGET_SH2E
&& GET_MODE_CLASS (mode
) == MODE_FLOAT
))
2262 op1
= force_reg (mode
, op1
);
2264 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2266 if (code
== LT
|| code
== LE
)
2268 code
= swap_condition (code
);
2269 tem
= op0
, op0
= op1
, op1
= tem
;
2275 lab
= gen_label_rtx ();
2276 sh_emit_scc_to_t (EQ
, op0
, op1
);
2277 emit_jump_insn (gen_branch_true (lab
));
2294 sh_emit_scc_to_t (code
, op0
, op1
);
2298 emit_insn (gen_movnegt (operands
[0]));
2300 emit_move_insn (operands
[0], gen_rtx_REG (SImode
, T_REG
));
2303 /* Functions to output assembly code. */
2305 /* Return a sequence of instructions to perform DI or DF move.
2307 Since the SH cannot move a DI or DF in one instruction, we have
2308 to take care when we see overlapping source and dest registers. */
2311 output_movedouble (rtx insn ATTRIBUTE_UNUSED
, rtx operands
[],
2312 enum machine_mode mode
)
2314 rtx dst
= operands
[0];
2315 rtx src
= operands
[1];
2318 && GET_CODE (XEXP (dst
, 0)) == PRE_DEC
)
2319 return "mov.l %T1,%0\n\tmov.l %1,%0";
2321 if (register_operand (dst
, mode
)
2322 && register_operand (src
, mode
))
2324 if (REGNO (src
) == MACH_REG
)
2325 return "sts mach,%S0\n\tsts macl,%R0";
2327 /* When mov.d r1,r2 do r2->r3 then r1->r2;
2328 when mov.d r1,r0 do r1->r0 then r2->r1. */
2330 if (REGNO (src
) + 1 == REGNO (dst
))
2331 return "mov %T1,%T0\n\tmov %1,%0";
2333 return "mov %1,%0\n\tmov %T1,%T0";
2335 else if (CONST_INT_P (src
))
2337 if (INTVAL (src
) < 0)
2338 output_asm_insn ("mov #-1,%S0", operands
);
2340 output_asm_insn ("mov #0,%S0", operands
);
2342 return "mov %1,%R0";
2344 else if (MEM_P (src
))
2347 int dreg
= REGNO (dst
);
2348 rtx inside
= XEXP (src
, 0);
2350 switch (GET_CODE (inside
))
2353 ptrreg
= REGNO (inside
);
2357 ptrreg
= subreg_regno (inside
);
2361 ptrreg
= REGNO (XEXP (inside
, 0));
2362 /* ??? A r0+REG address shouldn't be possible here, because it isn't
2363 an offsettable address. Unfortunately, offsettable addresses use
2364 QImode to check the offset, and a QImode offsettable address
2365 requires r0 for the other operand, which is not currently
2366 supported, so we can't use the 'o' constraint.
2367 Thus we must check for and handle r0+REG addresses here.
2368 We punt for now, since this is likely very rare. */
2369 gcc_assert (!REG_P (XEXP (inside
, 1)));
2373 return "mov.l %1,%0\n\tmov.l %1+4,%T0";
2375 return "mov.l %1,%0\n\tmov.l %1,%T0";
2380 /* Work out the safe way to copy. Copy into the second half first. */
2382 return "mov.l %T1,%T0\n\tmov.l %1,%0";
2385 return "mov.l %1,%0\n\tmov.l %T1,%T0";
2388 /* Print an instruction which would have gone into a delay slot after
2389 another instruction, but couldn't because the other instruction expanded
2390 into a sequence where putting the slot insn at the end wouldn't work. */
2393 print_slot (rtx insn
)
2395 final_scan_insn (XVECEXP (insn
, 0, 1), asm_out_file
, optimize
, 1, NULL
);
2397 INSN_DELETED_P (XVECEXP (insn
, 0, 1)) = 1;
2401 output_far_jump (rtx insn
, rtx op
)
2403 struct { rtx lab
, reg
, op
; } this_jmp
;
2404 rtx braf_base_lab
= NULL_RTX
;
2407 int offset
= branch_dest (insn
) - INSN_ADDRESSES (INSN_UID (insn
));
2410 this_jmp
.lab
= gen_label_rtx ();
2414 && offset
- get_attr_length (insn
) <= 32766)
2417 jump
= "mov.w %O0,%1; braf %1";
2425 jump
= "mov.l %O0,%1; braf %1";
2427 jump
= "mov.l r0,@-r15; mova %O0,r0; mov.l @r0,%1; add r0,%1; mov.l @r15+,r0; jmp @%1";
2430 jump
= "mov.l %O0,%1; jmp @%1";
2432 /* If we have a scratch register available, use it. */
2433 if (NONJUMP_INSN_P ((prev
= prev_nonnote_insn (insn
)))
2434 && INSN_CODE (prev
) == CODE_FOR_indirect_jump_scratch
)
2436 this_jmp
.reg
= SET_DEST (XVECEXP (PATTERN (prev
), 0, 0));
2437 if (REGNO (this_jmp
.reg
) == R0_REG
&& flag_pic
&& ! TARGET_SH2
)
2438 jump
= "mov.l r1,@-r15; mova %O0,r0; mov.l @r0,r1; add r1,r0; mov.l @r15+,r1; jmp @%1";
2439 output_asm_insn (jump
, &this_jmp
.lab
);
2440 if (dbr_sequence_length ())
2441 print_slot (final_sequence
);
2443 output_asm_insn ("nop", 0);
2447 /* Output the delay slot insn first if any. */
2448 if (dbr_sequence_length ())
2449 print_slot (final_sequence
);
2451 this_jmp
.reg
= gen_rtx_REG (SImode
, 13);
2452 /* We must keep the stack aligned to 8-byte boundaries on SH5.
2453 Fortunately, MACL is fixed and call-clobbered, and we never
2454 need its value across jumps, so save r13 in it instead of in
2457 output_asm_insn ("lds r13, macl", 0);
2459 output_asm_insn ("mov.l r13,@-r15", 0);
2460 output_asm_insn (jump
, &this_jmp
.lab
);
2462 output_asm_insn ("sts macl, r13", 0);
2464 output_asm_insn ("mov.l @r15+,r13", 0);
2466 if (far
&& flag_pic
&& TARGET_SH2
)
2468 braf_base_lab
= gen_label_rtx ();
2469 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "L",
2470 CODE_LABEL_NUMBER (braf_base_lab
));
2473 output_asm_insn (".align 2", 0);
2474 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "L", CODE_LABEL_NUMBER (this_jmp
.lab
));
2476 if (far
&& flag_pic
)
2479 this_jmp
.lab
= braf_base_lab
;
2480 output_asm_insn (".long %O2-%O0", &this_jmp
.lab
);
2483 output_asm_insn (far
? ".long %O2" : ".word %O2-%O0", &this_jmp
.lab
);
2487 /* Local label counter, used for constants in the pool and inside
2488 pattern branches. */
2490 static int lf
= 100;
2492 /* Output code for ordinary branches. */
2495 output_branch (int logic
, rtx insn
, rtx
*operands
)
2497 switch (get_attr_length (insn
))
2500 /* This can happen if filling the delay slot has caused a forward
2501 branch to exceed its range (we could reverse it, but only
2502 when we know we won't overextend other branches; this should
2503 best be handled by relaxation).
2504 It can also happen when other condbranches hoist delay slot insn
2505 from their destination, thus leading to code size increase.
2506 But the branch will still be in the range -4092..+4098 bytes. */
2511 /* The call to print_slot will clobber the operands. */
2512 rtx op0
= operands
[0];
2514 /* If the instruction in the delay slot is annulled (true), then
2515 there is no delay slot where we can put it now. The only safe
2516 place for it is after the label. final will do that by default. */
2519 && ! INSN_ANNULLED_BRANCH_P (XVECEXP (final_sequence
, 0, 0))
2520 && get_attr_length (XVECEXP (final_sequence
, 0, 1)))
2522 asm_fprintf (asm_out_file
, "\tb%s%ss\t%LLF%d\n", logic
? "f" : "t",
2523 ASSEMBLER_DIALECT
? "/" : ".", label
);
2524 print_slot (final_sequence
);
2527 asm_fprintf (asm_out_file
, "\tb%s\t%LLF%d\n", logic
? "f" : "t", label
);
2529 output_asm_insn ("bra\t%l0", &op0
);
2530 fprintf (asm_out_file
, "\tnop\n");
2531 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LF", label
);
2535 /* When relaxing, handle this like a short branch. The linker
2536 will fix it up if it still doesn't fit after relaxation. */
2538 return logic
? "bt%.\t%l0" : "bf%.\t%l0";
2540 /* These are for SH2e, in which we have to account for the
2541 extra nop because of the hardware bug in annulled branches. */
2547 gcc_assert (!final_sequence
2548 || !(INSN_ANNULLED_BRANCH_P
2549 (XVECEXP (final_sequence
, 0, 0))));
2550 asm_fprintf (asm_out_file
, "b%s%ss\t%LLF%d\n",
2552 ASSEMBLER_DIALECT
? "/" : ".", label
);
2553 fprintf (asm_out_file
, "\tnop\n");
2554 output_asm_insn ("bra\t%l0", operands
);
2555 fprintf (asm_out_file
, "\tnop\n");
2556 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "LF", label
);
2560 /* When relaxing, fall through. */
2565 sprintf (buffer
, "b%s%ss\t%%l0",
2567 ASSEMBLER_DIALECT
? "/" : ".");
2568 output_asm_insn (buffer
, &operands
[0]);
2573 /* There should be no longer branches now - that would
2574 indicate that something has destroyed the branches set
2575 up in machine_dependent_reorg. */
2580 /* Output a code sequence for INSN using TEMPL with OPERANDS; but before,
2581 fill in operands 9 as a label to the successor insn.
2582 We try to use jump threading where possible.
2583 IF CODE matches the comparison in the IF_THEN_ELSE of a following jump,
2584 we assume the jump is taken. I.e. EQ means follow jmp and bf, NE means
2585 follow jmp and bt, if the address is in range. */
2587 output_branchy_insn (enum rtx_code code
, const char *templ
,
2588 rtx insn
, rtx
*operands
)
2590 rtx next_insn
= NEXT_INSN (insn
);
2592 if (next_insn
&& JUMP_P (next_insn
) && condjump_p (next_insn
))
2594 rtx src
= SET_SRC (PATTERN (next_insn
));
2595 if (GET_CODE (src
) == IF_THEN_ELSE
&& GET_CODE (XEXP (src
, 0)) != code
)
2597 /* Following branch not taken */
2598 operands
[9] = gen_label_rtx ();
2599 emit_label_after (operands
[9], next_insn
);
2600 INSN_ADDRESSES_NEW (operands
[9],
2601 INSN_ADDRESSES (INSN_UID (next_insn
))
2602 + get_attr_length (next_insn
));
2607 int offset
= (branch_dest (next_insn
)
2608 - INSN_ADDRESSES (INSN_UID (next_insn
)) + 4);
2609 if (offset
>= -252 && offset
<= 258)
2611 if (GET_CODE (src
) == IF_THEN_ELSE
)
2613 src
= XEXP (src
, 1);
2619 operands
[9] = gen_label_rtx ();
2620 emit_label_after (operands
[9], insn
);
2621 INSN_ADDRESSES_NEW (operands
[9],
2622 INSN_ADDRESSES (INSN_UID (insn
))
2623 + get_attr_length (insn
));
2628 output_ieee_ccmpeq (rtx insn
, rtx
*operands
)
2630 return output_branchy_insn (NE
, "bt\t%l9\n\tfcmp/eq\t%1,%0",
2634 /* Output the start of the assembler file. */
2637 sh_file_start (void)
2639 default_file_start ();
2642 /* Declare the .directive section before it is used. */
2643 fputs ("\t.section .directive, \"SM\", @progbits, 1\n", asm_out_file
);
2644 fputs ("\t.asciz \"#<SYMEDIT>#\\n\"\n", asm_out_file
);
2648 /* We need to show the text section with the proper
2649 attributes as in TEXT_SECTION_ASM_OP, before dwarf2out
2650 emits it without attributes in TEXT_SECTION_ASM_OP, else GAS
2651 will complain. We can teach GAS specifically about the
2652 default attributes for our choice of text section, but
2653 then we would have to change GAS again if/when we change
2654 the text section name. */
2655 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
2657 /* Switch to the data section so that the coffsem symbol
2658 isn't in the text section. */
2659 switch_to_section (data_section
);
2661 if (TARGET_LITTLE_ENDIAN
)
2662 fputs ("\t.little\n", asm_out_file
);
2666 if (TARGET_SHCOMPACT
)
2667 fputs ("\t.mode\tSHcompact\n", asm_out_file
);
2668 else if (TARGET_SHMEDIA
)
2669 fprintf (asm_out_file
, "\t.mode\tSHmedia\n\t.abi\t%i\n",
2670 TARGET_SHMEDIA64
? 64 : 32);
2674 /* Check if PAT includes UNSPEC_CALLER unspec pattern. */
2677 unspec_caller_rtx_p (rtx pat
)
2682 split_const (pat
, &base
, &offset
);
2683 if (GET_CODE (base
) == UNSPEC
)
2685 if (XINT (base
, 1) == UNSPEC_CALLER
)
2687 for (i
= 0; i
< XVECLEN (base
, 0); i
++)
2688 if (unspec_caller_rtx_p (XVECEXP (base
, 0, i
)))
2694 /* Indicate that INSN cannot be duplicated. This is true for insn
2695 that generates a unique label. */
2698 sh_cannot_copy_insn_p (rtx insn
)
2702 if (!reload_completed
|| !flag_pic
)
2705 if (!NONJUMP_INSN_P (insn
))
2707 if (asm_noperands (insn
) >= 0)
2710 pat
= PATTERN (insn
);
2711 if (GET_CODE (pat
) != SET
)
2713 pat
= SET_SRC (pat
);
2715 if (unspec_caller_rtx_p (pat
))
2721 /* Actual number of instructions used to make a shift by N. */
2722 static const char ashiftrt_insns
[] =
2723 { 0,1,2,3,4,5,8,8,8,8,8,8,8,8,8,8,2,3,4,5,8,8,8,8,8,8,8,8,8,8,8,2};
2725 /* Left shift and logical right shift are the same. */
2726 static const char shift_insns
[] =
2727 { 0,1,1,2,2,3,3,4,1,2,2,3,3,4,3,3,1,2,2,3,3,4,3,3,2,3,3,4,4,4,3,3};
2729 /* Individual shift amounts needed to get the above length sequences.
2730 One bit right shifts clobber the T bit, so when possible, put one bit
2731 shifts in the middle of the sequence, so the ends are eligible for
2732 branch delay slots. */
2733 static const short shift_amounts
[32][5] = {
2734 {0}, {1}, {2}, {2, 1},
2735 {2, 2}, {2, 1, 2}, {2, 2, 2}, {2, 2, 1, 2},
2736 {8}, {8, 1}, {8, 2}, {8, 1, 2},
2737 {8, 2, 2}, {8, 2, 1, 2}, {8, -2, 8}, {8, -1, 8},
2738 {16}, {16, 1}, {16, 2}, {16, 1, 2},
2739 {16, 2, 2}, {16, 2, 1, 2}, {16, -2, 8}, {16, -1, 8},
2740 {16, 8}, {16, 1, 8}, {16, 8, 2}, {16, 8, 1, 2},
2741 {16, 8, 2, 2}, {16, -1, -2, 16}, {16, -2, 16}, {16, -1, 16}};
2743 /* Likewise, but for shift amounts < 16, up to three highmost bits
2744 might be clobbered. This is typically used when combined with some
2745 kind of sign or zero extension. */
2747 static const char ext_shift_insns
[] =
2748 { 0,1,1,2,2,3,2,2,1,2,2,3,3,3,2,2,1,2,2,3,3,4,3,3,2,3,3,4,4,4,3,3};
2750 static const short ext_shift_amounts
[32][4] = {
2751 {0}, {1}, {2}, {2, 1},
2752 {2, 2}, {2, 1, 2}, {8, -2}, {8, -1},
2753 {8}, {8, 1}, {8, 2}, {8, 1, 2},
2754 {8, 2, 2}, {16, -2, -1}, {16, -2}, {16, -1},
2755 {16}, {16, 1}, {16, 2}, {16, 1, 2},
2756 {16, 2, 2}, {16, 2, 1, 2}, {16, -2, 8}, {16, -1, 8},
2757 {16, 8}, {16, 1, 8}, {16, 8, 2}, {16, 8, 1, 2},
2758 {16, 8, 2, 2}, {16, -1, -2, 16}, {16, -2, 16}, {16, -1, 16}};
2760 /* Assuming we have a value that has been sign-extended by at least one bit,
2761 can we use the ext_shift_amounts with the last shift turned to an arithmetic shift
2762 to shift it by N without data loss, and quicker than by other means? */
2763 #define EXT_SHIFT_SIGNED(n) (((n) | 8) == 15)
2765 /* This is used in length attributes in sh.md to help compute the length
2766 of arbitrary constant shift instructions. */
2769 shift_insns_rtx (rtx insn
)
2771 rtx set_src
= SET_SRC (XVECEXP (PATTERN (insn
), 0, 0));
2772 int shift_count
= INTVAL (XEXP (set_src
, 1)) & 31;
2773 enum rtx_code shift_code
= GET_CODE (set_src
);
2778 return ashiftrt_insns
[shift_count
];
2781 return shift_insns
[shift_count
];
2787 /* Return the cost of a shift. */
2797 if (GET_MODE_SIZE (GET_MODE (x
)) > UNITS_PER_WORD
)
2799 if (GET_MODE (x
) == DImode
2800 && CONST_INT_P (XEXP (x
, 1))
2801 && INTVAL (XEXP (x
, 1)) == 1)
2804 /* Everything else is invalid, because there is no pattern for it. */
2807 /* If shift by a non constant, then this will be expensive. */
2808 if (!CONST_INT_P (XEXP (x
, 1)))
2809 return SH_DYNAMIC_SHIFT_COST
;
2811 /* Otherwise, return the true cost in instructions. Cope with out of range
2812 shift counts more or less arbitrarily. */
2813 value
= INTVAL (XEXP (x
, 1)) & 31;
2815 if (GET_CODE (x
) == ASHIFTRT
)
2817 int cost
= ashiftrt_insns
[value
];
2818 /* If SH3, then we put the constant in a reg and use shad. */
2819 if (cost
> 1 + SH_DYNAMIC_SHIFT_COST
)
2820 cost
= 1 + SH_DYNAMIC_SHIFT_COST
;
2824 return shift_insns
[value
];
2827 /* Return the cost of an AND operation. */
2834 /* Anding with a register is a single cycle and instruction. */
2835 if (!CONST_INT_P (XEXP (x
, 1)))
2838 i
= INTVAL (XEXP (x
, 1));
2842 if (satisfies_constraint_I10 (XEXP (x
, 1))
2843 || satisfies_constraint_J16 (XEXP (x
, 1)))
2846 return 1 + rtx_cost (XEXP (x
, 1), AND
, !optimize_size
);
2849 /* These constants are single cycle extu.[bw] instructions. */
2850 if (i
== 0xff || i
== 0xffff)
2852 /* Constants that can be used in an and immediate instruction in a single
2853 cycle, but this requires r0, so make it a little more expensive. */
2854 if (CONST_OK_FOR_K08 (i
))
2856 /* Constants that can be loaded with a mov immediate and an and.
2857 This case is probably unnecessary. */
2858 if (CONST_OK_FOR_I08 (i
))
2860 /* Any other constants requires a 2 cycle pc-relative load plus an and.
2861 This case is probably unnecessary. */
2865 /* Return the cost of an addition or a subtraction. */
2870 /* Adding a register is a single cycle insn. */
2871 if (REG_P (XEXP (x
, 1))
2872 || GET_CODE (XEXP (x
, 1)) == SUBREG
)
2875 /* Likewise for small constants. */
2876 if (CONST_INT_P (XEXP (x
, 1))
2877 && CONST_OK_FOR_ADD (INTVAL (XEXP (x
, 1))))
2881 switch (GET_CODE (XEXP (x
, 1)))
2886 return TARGET_SHMEDIA64
? 5 : 3;
2889 if (CONST_OK_FOR_I16 (INTVAL (XEXP (x
, 1))))
2891 else if (CONST_OK_FOR_I16 (INTVAL (XEXP (x
, 1)) >> 16))
2893 else if (CONST_OK_FOR_I16 ((INTVAL (XEXP (x
, 1)) >> 16) >> 16))
2901 /* Any other constant requires a 2 cycle pc-relative load plus an
2906 /* Return the cost of a multiply. */
2908 multcosts (rtx x ATTRIBUTE_UNUSED
)
2910 if (sh_multcost
>= 0)
2913 /* ??? We have a mul insn, but it has a latency of three, and doesn't
2914 accept constants. Ideally, we would use a cost of one or two and
2915 add the cost of the operand, but disregard the latter when inside loops
2916 and loop invariant code motion is still to follow.
2917 Using a multiply first and splitting it later if it's a loss
2918 doesn't work because of different sign / zero extension semantics
2919 of multiplies vs. shifts. */
2920 return TARGET_SMALLCODE
? 2 : 3;
2924 /* We have a mul insn, so we can never take more than the mul and the
2925 read of the mac reg, but count more because of the latency and extra
2927 if (TARGET_SMALLCODE
)
2932 /* If we're aiming at small code, then just count the number of
2933 insns in a multiply call sequence. */
2934 if (TARGET_SMALLCODE
)
2937 /* Otherwise count all the insns in the routine we'd be calling too. */
2941 /* Compute a (partial) cost for rtx X. Return true if the complete
2942 cost has been computed, and false if subexpressions should be
2943 scanned. In either case, *TOTAL contains the cost result. */
2946 sh_rtx_costs (rtx x
, int code
, int outer_code
, int *total
,
2947 bool speed ATTRIBUTE_UNUSED
)
2954 if (INTVAL (x
) == 0)
2956 else if (outer_code
== AND
&& and_operand ((x
), DImode
))
2958 else if ((outer_code
== IOR
|| outer_code
== XOR
2959 || outer_code
== PLUS
)
2960 && CONST_OK_FOR_I10 (INTVAL (x
)))
2962 else if (CONST_OK_FOR_I16 (INTVAL (x
)))
2963 *total
= COSTS_N_INSNS (outer_code
!= SET
);
2964 else if (CONST_OK_FOR_I16 (INTVAL (x
) >> 16))
2965 *total
= COSTS_N_INSNS ((outer_code
!= SET
) + 1);
2966 else if (CONST_OK_FOR_I16 ((INTVAL (x
) >> 16) >> 16))
2967 *total
= COSTS_N_INSNS ((outer_code
!= SET
) + 2);
2969 *total
= COSTS_N_INSNS ((outer_code
!= SET
) + 3);
2972 if (CONST_OK_FOR_I08 (INTVAL (x
)))
2974 else if ((outer_code
== AND
|| outer_code
== IOR
|| outer_code
== XOR
)
2975 && CONST_OK_FOR_K08 (INTVAL (x
)))
2977 /* prepare_cmp_insn will force costly constants int registers before
2978 the cbranch[sd]i4 patterns can see them, so preserve potentially
2979 interesting ones not covered by I08 above. */
2980 else if (outer_code
== COMPARE
2981 && ((unsigned HOST_WIDE_INT
) INTVAL (x
)
2982 == (unsigned HOST_WIDE_INT
) 0x7fffffff + 1
2983 || INTVAL (x
) == 0x7fffffff
2984 || INTVAL (x
) == 0x80 || INTVAL (x
) == -0x81))
2993 if (TARGET_SHMEDIA64
)
2994 *total
= COSTS_N_INSNS (4);
2995 else if (TARGET_SHMEDIA32
)
2996 *total
= COSTS_N_INSNS (2);
3003 *total
= COSTS_N_INSNS (4);
3004 /* prepare_cmp_insn will force costly constants int registers before
3005 the cbranchdi4 pattern can see them, so preserve potentially
3006 interesting ones. */
3007 else if (outer_code
== COMPARE
&& GET_MODE (x
) == DImode
)
3013 if (x
== CONST0_RTX (GET_MODE (x
)))
3015 else if (sh_1el_vec (x
, VOIDmode
))
3016 *total
= outer_code
!= SET
;
3017 if (sh_rep_vec (x
, VOIDmode
))
3018 *total
= ((GET_MODE_UNIT_SIZE (GET_MODE (x
)) + 3) / 4
3019 + (outer_code
!= SET
));
3020 *total
= COSTS_N_INSNS (3) + (outer_code
!= SET
);
3025 *total
= COSTS_N_INSNS (addsubcosts (x
));
3029 *total
= COSTS_N_INSNS (andcosts (x
));
3033 *total
= COSTS_N_INSNS (multcosts (x
));
3039 *total
= COSTS_N_INSNS (shiftcosts (x
));
3046 *total
= COSTS_N_INSNS (20);
3050 if (sh_1el_vec (x
, VOIDmode
))
3051 *total
= outer_code
!= SET
;
3052 if (sh_rep_vec (x
, VOIDmode
))
3053 *total
= ((GET_MODE_UNIT_SIZE (GET_MODE (x
)) + 3) / 4
3054 + (outer_code
!= SET
));
3055 *total
= COSTS_N_INSNS (3) + (outer_code
!= SET
);
3068 /* Compute the cost of an address. For the SH, all valid addresses are
3069 the same cost. Use a slightly higher cost for reg + reg addressing,
3070 since it increases pressure on r0. */
3073 sh_address_cost (rtx X
,
3074 bool speed ATTRIBUTE_UNUSED
)
3076 return (GET_CODE (X
) == PLUS
3077 && ! CONSTANT_P (XEXP (X
, 1))
3078 && ! TARGET_SHMEDIA
? 1 : 0);
3081 /* Code to expand a shift. */
3084 gen_ashift (int type
, int n
, rtx reg
)
3086 /* Negative values here come from the shift_amounts array. */
3099 emit_insn (gen_ashrsi3_k (reg
, reg
, GEN_INT (n
)));
3103 emit_insn (gen_lshrsi3_m (reg
, reg
, GEN_INT (n
)));
3105 emit_insn (gen_lshrsi3_k (reg
, reg
, GEN_INT (n
)));
3108 emit_insn (gen_ashlsi3_std (reg
, reg
, GEN_INT (n
)));
3113 /* Same for HImode */
3116 gen_ashift_hi (int type
, int n
, rtx reg
)
3118 /* Negative values here come from the shift_amounts array. */
3132 /* We don't have HImode right shift operations because using the
3133 ordinary 32 bit shift instructions for that doesn't generate proper
3134 zero/sign extension.
3135 gen_ashift_hi is only called in contexts where we know that the
3136 sign extension works out correctly. */
3139 if (GET_CODE (reg
) == SUBREG
)
3141 offset
= SUBREG_BYTE (reg
);
3142 reg
= SUBREG_REG (reg
);
3144 gen_ashift (type
, n
, gen_rtx_SUBREG (SImode
, reg
, offset
));
3148 emit_insn (gen_ashlhi3_k (reg
, reg
, GEN_INT (n
)));
3153 /* Output RTL to split a constant shift into its component SH constant
3154 shift instructions. */
3157 gen_shifty_op (int code
, rtx
*operands
)
3159 int value
= INTVAL (operands
[2]);
3162 /* Truncate the shift count in case it is out of bounds. */
3167 if (code
== LSHIFTRT
)
3169 emit_insn (gen_rotlsi3_1 (operands
[0], operands
[0]));
3170 emit_insn (gen_movt (operands
[0]));
3173 else if (code
== ASHIFT
)
3175 /* There is a two instruction sequence for 31 bit left shifts,
3176 but it requires r0. */
3177 if (REG_P (operands
[0]) && REGNO (operands
[0]) == 0)
3179 emit_insn (gen_andsi3 (operands
[0], operands
[0], const1_rtx
));
3180 emit_insn (gen_rotlsi3_31 (operands
[0], operands
[0]));
3185 else if (value
== 0)
3187 /* This can happen even when optimizing, if there were subregs before
3188 reload. Don't output a nop here, as this is never optimized away;
3189 use a no-op move instead. */
3190 emit_insn (gen_rtx_SET (VOIDmode
, operands
[0], operands
[0]));
3194 max
= shift_insns
[value
];
3195 for (i
= 0; i
< max
; i
++)
3196 gen_ashift (code
, shift_amounts
[value
][i
], operands
[0]);
3199 /* Same as above, but optimized for values where the topmost bits don't
3203 gen_shifty_hi_op (int code
, rtx
*operands
)
3205 int value
= INTVAL (operands
[2]);
3207 void (*gen_fun
) (int, int, rtx
);
3209 /* This operation is used by and_shl for SImode values with a few
3210 high bits known to be cleared. */
3214 emit_insn (gen_nop ());
3218 gen_fun
= GET_MODE (operands
[0]) == HImode
? gen_ashift_hi
: gen_ashift
;
3221 max
= ext_shift_insns
[value
];
3222 for (i
= 0; i
< max
; i
++)
3223 gen_fun (code
, ext_shift_amounts
[value
][i
], operands
[0]);
3226 /* When shifting right, emit the shifts in reverse order, so that
3227 solitary negative values come first. */
3228 for (i
= ext_shift_insns
[value
] - 1; i
>= 0; i
--)
3229 gen_fun (code
, ext_shift_amounts
[value
][i
], operands
[0]);
3232 /* Output RTL for an arithmetic right shift. */
3234 /* ??? Rewrite to use super-optimizer sequences. */
3237 expand_ashiftrt (rtx
*operands
)
3245 if (!CONST_INT_P (operands
[2]))
3247 rtx count
= copy_to_mode_reg (SImode
, operands
[2]);
3248 emit_insn (gen_negsi2 (count
, count
));
3249 emit_insn (gen_ashrsi3_d (operands
[0], operands
[1], count
));
3252 else if (ashiftrt_insns
[INTVAL (operands
[2]) & 31]
3253 > 1 + SH_DYNAMIC_SHIFT_COST
)
3256 = force_reg (SImode
, GEN_INT (- (INTVAL (operands
[2]) & 31)));
3257 emit_insn (gen_ashrsi3_d (operands
[0], operands
[1], count
));
3261 if (!CONST_INT_P (operands
[2]))
3264 value
= INTVAL (operands
[2]) & 31;
3268 /* If we are called from abs expansion, arrange things so that we
3269 we can use a single MT instruction that doesn't clobber the source,
3270 if LICM can hoist out the load of the constant zero. */
3271 if (currently_expanding_to_rtl
)
3273 emit_insn (gen_cmpgtsi_t (force_reg (SImode
, CONST0_RTX (SImode
)),
3275 emit_insn (gen_mov_neg_si_t (operands
[0]));
3278 emit_insn (gen_ashrsi2_31 (operands
[0], operands
[1]));
3281 else if (value
>= 16 && value
<= 19)
3283 wrk
= gen_reg_rtx (SImode
);
3284 emit_insn (gen_ashrsi2_16 (wrk
, operands
[1]));
3287 gen_ashift (ASHIFTRT
, 1, wrk
);
3288 emit_move_insn (operands
[0], wrk
);
3291 /* Expand a short sequence inline, longer call a magic routine. */
3292 else if (value
<= 5)
3294 wrk
= gen_reg_rtx (SImode
);
3295 emit_move_insn (wrk
, operands
[1]);
3297 gen_ashift (ASHIFTRT
, 1, wrk
);
3298 emit_move_insn (operands
[0], wrk
);
3302 wrk
= gen_reg_rtx (Pmode
);
3304 /* Load the value into an arg reg and call a helper. */
3305 emit_move_insn (gen_rtx_REG (SImode
, 4), operands
[1]);
3306 sprintf (func
, "__ashiftrt_r4_%d", value
);
3307 function_symbol (wrk
, func
, SFUNC_STATIC
);
3308 emit_insn (gen_ashrsi3_n (GEN_INT (value
), wrk
));
3309 emit_move_insn (operands
[0], gen_rtx_REG (SImode
, 4));
3314 sh_dynamicalize_shift_p (rtx count
)
3316 return shift_insns
[INTVAL (count
) & 31] > 1 + SH_DYNAMIC_SHIFT_COST
;
3319 /* Try to find a good way to implement the combiner pattern
3320 [(set (match_operand:SI 0 "register_operand" "r")
3321 (and:SI (ashift:SI (match_operand:SI 1 "register_operand" "r")
3322 (match_operand:SI 2 "const_int_operand" "n"))
3323 (match_operand:SI 3 "const_int_operand" "n"))) .
3324 LEFT_RTX is operand 2 in the above pattern, and MASK_RTX is operand 3.
3325 return 0 for simple right / left or left/right shift combination.
3326 return 1 for a combination of shifts with zero_extend.
3327 return 2 for a combination of shifts with an AND that needs r0.
3328 return 3 for a combination of shifts with an AND that needs an extra
3329 scratch register, when the three highmost bits of the AND mask are clear.
3330 return 4 for a combination of shifts with an AND that needs an extra
3331 scratch register, when any of the three highmost bits of the AND mask
3333 If ATTRP is set, store an initial right shift width in ATTRP[0],
3334 and the instruction length in ATTRP[1] . These values are not valid
3336 When ATTRP is set and returning 1, ATTRP[2] gets set to the index into
3337 shift_amounts for the last shift value that is to be used before the
3340 shl_and_kind (rtx left_rtx
, rtx mask_rtx
, int *attrp
)
3342 unsigned HOST_WIDE_INT mask
, lsb
, mask2
, lsb2
;
3343 int left
= INTVAL (left_rtx
), right
;
3345 int cost
, best_cost
= 10000;
3346 int best_right
= 0, best_len
= 0;
3350 if (left
< 0 || left
> 31)
3352 if (CONST_INT_P (mask_rtx
))
3353 mask
= (unsigned HOST_WIDE_INT
) INTVAL (mask_rtx
) >> left
;
3355 mask
= (unsigned HOST_WIDE_INT
) GET_MODE_MASK (SImode
) >> left
;
3356 /* Can this be expressed as a right shift / left shift pair? */
3357 lsb
= ((mask
^ (mask
- 1)) >> 1) + 1;
3358 right
= exact_log2 (lsb
);
3359 mask2
= ~(mask
+ lsb
- 1);
3360 lsb2
= ((mask2
^ (mask2
- 1)) >> 1) + 1;
3361 /* mask has no zeroes but trailing zeroes <==> ! mask2 */
3363 best_cost
= shift_insns
[right
] + shift_insns
[right
+ left
];
3364 /* mask has no trailing zeroes <==> ! right */
3365 else if (! right
&& mask2
== ~(lsb2
- 1))
3367 int late_right
= exact_log2 (lsb2
);
3368 best_cost
= shift_insns
[left
+ late_right
] + shift_insns
[late_right
];
3370 /* Try to use zero extend. */
3371 if (mask2
== ~(lsb2
- 1))
3375 for (width
= 8; width
<= 16; width
+= 8)
3377 /* Can we zero-extend right away? */
3378 if (lsb2
== (unsigned HOST_WIDE_INT
) 1 << width
)
3381 = 1 + ext_shift_insns
[right
] + ext_shift_insns
[left
+ right
];
3382 if (cost
< best_cost
)
3393 /* ??? Could try to put zero extend into initial right shift,
3394 or even shift a bit left before the right shift. */
3395 /* Determine value of first part of left shift, to get to the
3396 zero extend cut-off point. */
3397 first
= width
- exact_log2 (lsb2
) + right
;
3398 if (first
>= 0 && right
+ left
- first
>= 0)
3400 cost
= ext_shift_insns
[right
] + ext_shift_insns
[first
] + 1
3401 + ext_shift_insns
[right
+ left
- first
];
3402 if (cost
< best_cost
)
3414 /* Try to use r0 AND pattern */
3415 for (i
= 0; i
<= 2; i
++)
3419 if (! CONST_OK_FOR_K08 (mask
>> i
))
3421 cost
= (i
!= 0) + 2 + ext_shift_insns
[left
+ i
];
3422 if (cost
< best_cost
)
3427 best_len
= cost
- 1;
3430 /* Try to use a scratch register to hold the AND operand. */
3431 can_ext
= ((mask
<< left
) & ((unsigned HOST_WIDE_INT
) 3 << 30)) == 0;
3432 for (i
= 0; i
<= 2; i
++)
3436 cost
= (i
!= 0) + (CONST_OK_FOR_I08 (mask
>> i
) ? 2 : 3)
3437 + (can_ext
? ext_shift_insns
: shift_insns
)[left
+ i
];
3438 if (cost
< best_cost
)
3443 best_len
= cost
- 1 - ! CONST_OK_FOR_I08 (mask
>> i
);
3449 attrp
[0] = best_right
;
3450 attrp
[1] = best_len
;
3455 /* This is used in length attributes of the unnamed instructions
3456 corresponding to shl_and_kind return values of 1 and 2. */
3458 shl_and_length (rtx insn
)
3460 rtx set_src
, left_rtx
, mask_rtx
;
3463 set_src
= SET_SRC (XVECEXP (PATTERN (insn
), 0, 0));
3464 left_rtx
= XEXP (XEXP (set_src
, 0), 1);
3465 mask_rtx
= XEXP (set_src
, 1);
3466 shl_and_kind (left_rtx
, mask_rtx
, attributes
);
3467 return attributes
[1];
3470 /* This is used in length attribute of the and_shl_scratch instruction. */
3473 shl_and_scr_length (rtx insn
)
3475 rtx set_src
= SET_SRC (XVECEXP (PATTERN (insn
), 0, 0));
3476 int len
= shift_insns
[INTVAL (XEXP (set_src
, 1)) & 31];
3477 rtx op
= XEXP (set_src
, 0);
3478 len
+= shift_insns
[INTVAL (XEXP (op
, 1)) & 31] + 1;
3479 op
= XEXP (XEXP (op
, 0), 0);
3480 return len
+ shift_insns
[INTVAL (XEXP (op
, 1)) & 31];
3483 /* Generate rtl for instructions for which shl_and_kind advised a particular
3484 method of generating them, i.e. returned zero. */
3487 gen_shl_and (rtx dest
, rtx left_rtx
, rtx mask_rtx
, rtx source
)
3490 unsigned HOST_WIDE_INT mask
;
3491 int kind
= shl_and_kind (left_rtx
, mask_rtx
, attributes
);
3492 int right
, total_shift
;
3493 void (*shift_gen_fun
) (int, rtx
*) = gen_shifty_hi_op
;
3495 right
= attributes
[0];
3496 total_shift
= INTVAL (left_rtx
) + right
;
3497 mask
= (unsigned HOST_WIDE_INT
) INTVAL (mask_rtx
) >> total_shift
;
3504 int first
= attributes
[2];
3509 emit_insn ((mask
<< right
) <= 0xff
3510 ? gen_zero_extendqisi2 (dest
,
3511 gen_lowpart (QImode
, source
))
3512 : gen_zero_extendhisi2 (dest
,
3513 gen_lowpart (HImode
, source
)));
3517 emit_insn (gen_movsi (dest
, source
));
3521 operands
[2] = GEN_INT (right
);
3522 gen_shifty_hi_op (LSHIFTRT
, operands
);
3526 operands
[2] = GEN_INT (first
);
3527 gen_shifty_hi_op (ASHIFT
, operands
);
3528 total_shift
-= first
;
3532 emit_insn (mask
<= 0xff
3533 ? gen_zero_extendqisi2 (dest
, gen_lowpart (QImode
, dest
))
3534 : gen_zero_extendhisi2 (dest
, gen_lowpart (HImode
, dest
)));
3535 if (total_shift
> 0)
3537 operands
[2] = GEN_INT (total_shift
);
3538 gen_shifty_hi_op (ASHIFT
, operands
);
3543 shift_gen_fun
= gen_shifty_op
;
3545 /* If the topmost bit that matters is set, set the topmost bits
3546 that don't matter. This way, we might be able to get a shorter
3548 if (mask
& ((HOST_WIDE_INT
) 1 << (31 - total_shift
)))
3549 mask
|= (HOST_WIDE_INT
) ~0 << (31 - total_shift
);
3551 /* Don't expand fine-grained when combining, because that will
3552 make the pattern fail. */
3553 if (currently_expanding_to_rtl
3554 || reload_in_progress
|| reload_completed
)
3558 /* Cases 3 and 4 should be handled by this split
3559 only while combining */
3560 gcc_assert (kind
<= 2);
3563 emit_insn (gen_lshrsi3 (dest
, source
, GEN_INT (right
)));
3566 emit_insn (gen_andsi3 (dest
, source
, GEN_INT (mask
)));
3571 operands
[2] = GEN_INT (total_shift
);
3572 shift_gen_fun (ASHIFT
, operands
);
3579 if (kind
!= 4 && total_shift
< 16)
3581 neg
= -ext_shift_amounts
[total_shift
][1];
3583 neg
-= ext_shift_amounts
[total_shift
][2];
3587 emit_insn (gen_and_shl_scratch (dest
, source
,
3590 GEN_INT (total_shift
+ neg
),
3592 emit_insn (gen_movsi (dest
, dest
));
3599 /* Try to find a good way to implement the combiner pattern
3600 [(set (match_operand:SI 0 "register_operand" "=r")
3601 (sign_extract:SI (ashift:SI (match_operand:SI 1 "register_operand" "r")
3602 (match_operand:SI 2 "const_int_operand" "n")
3603 (match_operand:SI 3 "const_int_operand" "n")
3605 (clobber (reg:SI T_REG))]
3606 LEFT_RTX is operand 2 in the above pattern, and SIZE_RTX is operand 3.
3607 return 0 for simple left / right shift combination.
3608 return 1 for left shift / 8 bit sign extend / left shift.
3609 return 2 for left shift / 16 bit sign extend / left shift.
3610 return 3 for left shift / 8 bit sign extend / shift / sign extend.
3611 return 4 for left shift / 16 bit sign extend / shift / sign extend.
3612 return 5 for left shift / 16 bit sign extend / right shift
3613 return 6 for < 8 bit sign extend / left shift.
3614 return 7 for < 8 bit sign extend / left shift / single right shift.
3615 If COSTP is nonzero, assign the calculated cost to *COSTP. */
3618 shl_sext_kind (rtx left_rtx
, rtx size_rtx
, int *costp
)
3620 int left
, size
, insize
, ext
;
3621 int cost
= 0, best_cost
;
3624 left
= INTVAL (left_rtx
);
3625 size
= INTVAL (size_rtx
);
3626 insize
= size
- left
;
3627 gcc_assert (insize
> 0);
3628 /* Default to left / right shift. */
3630 best_cost
= shift_insns
[32 - insize
] + ashiftrt_insns
[32 - size
];
3633 /* 16 bit shift / sign extend / 16 bit shift */
3634 cost
= shift_insns
[16 - insize
] + 1 + ashiftrt_insns
[16 - size
];
3635 /* If ashiftrt_insns[16 - size] is 8, this choice will be overridden
3636 below, by alternative 3 or something even better. */
3637 if (cost
< best_cost
)
3643 /* Try a plain sign extend between two shifts. */
3644 for (ext
= 16; ext
>= insize
; ext
-= 8)
3648 cost
= ext_shift_insns
[ext
- insize
] + 1 + shift_insns
[size
- ext
];
3649 if (cost
< best_cost
)
3651 kind
= ext
/ (unsigned) 8;
3655 /* Check if we can do a sloppy shift with a final signed shift
3656 restoring the sign. */
3657 if (EXT_SHIFT_SIGNED (size
- ext
))
3658 cost
= ext_shift_insns
[ext
- insize
] + ext_shift_insns
[size
- ext
] + 1;
3659 /* If not, maybe it's still cheaper to do the second shift sloppy,
3660 and do a final sign extend? */
3661 else if (size
<= 16)
3662 cost
= ext_shift_insns
[ext
- insize
] + 1
3663 + ext_shift_insns
[size
> ext
? size
- ext
: ext
- size
] + 1;
3666 if (cost
< best_cost
)
3668 kind
= ext
/ (unsigned) 8 + 2;
3672 /* Check if we can sign extend in r0 */
3675 cost
= 3 + shift_insns
[left
];
3676 if (cost
< best_cost
)
3681 /* Try the same with a final signed shift. */
3684 cost
= 3 + ext_shift_insns
[left
+ 1] + 1;
3685 if (cost
< best_cost
)
3694 /* Try to use a dynamic shift. */
3695 cost
= shift_insns
[32 - insize
] + 1 + SH_DYNAMIC_SHIFT_COST
;
3696 if (cost
< best_cost
)
3707 /* Function to be used in the length attribute of the instructions
3708 implementing this pattern. */
3711 shl_sext_length (rtx insn
)
3713 rtx set_src
, left_rtx
, size_rtx
;
3716 set_src
= SET_SRC (XVECEXP (PATTERN (insn
), 0, 0));
3717 left_rtx
= XEXP (XEXP (set_src
, 0), 1);
3718 size_rtx
= XEXP (set_src
, 1);
3719 shl_sext_kind (left_rtx
, size_rtx
, &cost
);
3723 /* Generate rtl for this pattern */
3726 gen_shl_sext (rtx dest
, rtx left_rtx
, rtx size_rtx
, rtx source
)
3729 int left
, size
, insize
, cost
;
3732 kind
= shl_sext_kind (left_rtx
, size_rtx
, &cost
);
3733 left
= INTVAL (left_rtx
);
3734 size
= INTVAL (size_rtx
);
3735 insize
= size
- left
;
3743 int ext
= kind
& 1 ? 8 : 16;
3744 int shift2
= size
- ext
;
3746 /* Don't expand fine-grained when combining, because that will
3747 make the pattern fail. */
3748 if (! currently_expanding_to_rtl
3749 && ! reload_in_progress
&& ! reload_completed
)
3751 emit_insn (gen_shl_sext_ext (dest
, source
, left_rtx
, size_rtx
));
3752 emit_insn (gen_movsi (dest
, source
));
3756 emit_insn (gen_movsi (dest
, source
));
3760 operands
[2] = GEN_INT (ext
- insize
);
3761 gen_shifty_hi_op (ASHIFT
, operands
);
3764 ? gen_extendqisi2 (dest
, gen_lowpart (QImode
, dest
))
3765 : gen_extendhisi2 (dest
, gen_lowpart (HImode
, dest
)));
3770 operands
[2] = GEN_INT (shift2
);
3771 gen_shifty_op (ASHIFT
, operands
);
3778 if (EXT_SHIFT_SIGNED (shift2
))
3780 operands
[2] = GEN_INT (shift2
+ 1);
3781 gen_shifty_op (ASHIFT
, operands
);
3782 operands
[2] = const1_rtx
;
3783 gen_shifty_op (ASHIFTRT
, operands
);
3786 operands
[2] = GEN_INT (shift2
);
3787 gen_shifty_hi_op (ASHIFT
, operands
);
3791 operands
[2] = GEN_INT (-shift2
);
3792 gen_shifty_hi_op (LSHIFTRT
, operands
);
3794 emit_insn (size
<= 8
3795 ? gen_extendqisi2 (dest
, gen_lowpart (QImode
, dest
))
3796 : gen_extendhisi2 (dest
, gen_lowpart (HImode
, dest
)));
3803 if (! currently_expanding_to_rtl
3804 && ! reload_in_progress
&& ! reload_completed
)
3805 emit_insn (gen_shl_sext_ext (dest
, source
, left_rtx
, size_rtx
));
3809 operands
[2] = GEN_INT (16 - insize
);
3810 gen_shifty_hi_op (ASHIFT
, operands
);
3811 emit_insn (gen_extendhisi2 (dest
, gen_lowpart (HImode
, dest
)));
3813 /* Don't use gen_ashrsi3 because it generates new pseudos. */
3815 gen_ashift (ASHIFTRT
, 1, dest
);
3820 /* Don't expand fine-grained when combining, because that will
3821 make the pattern fail. */
3822 if (! currently_expanding_to_rtl
3823 && ! reload_in_progress
&& ! reload_completed
)
3825 emit_insn (gen_shl_sext_ext (dest
, source
, left_rtx
, size_rtx
));
3826 emit_insn (gen_movsi (dest
, source
));
3829 emit_insn (gen_andsi3 (dest
, source
, GEN_INT ((1 << insize
) - 1)));
3830 emit_insn (gen_xorsi3 (dest
, dest
, GEN_INT (1 << (insize
- 1))));
3831 emit_insn (gen_addsi3 (dest
, dest
, GEN_INT (-1 << (insize
- 1))));
3833 operands
[2] = kind
== 7 ? GEN_INT (left
+ 1) : left_rtx
;
3834 gen_shifty_op (ASHIFT
, operands
);
3836 emit_insn (gen_ashrsi3_k (dest
, dest
, const1_rtx
));
3844 /* Prefix a symbol_ref name with "datalabel". */
3847 gen_datalabel_ref (rtx sym
)
3851 if (GET_CODE (sym
) == LABEL_REF
)
3852 return gen_rtx_CONST (GET_MODE (sym
),
3853 gen_rtx_UNSPEC (GET_MODE (sym
),
3857 gcc_assert (GET_CODE (sym
) == SYMBOL_REF
);
3859 str
= XSTR (sym
, 0);
3860 /* Share all SYMBOL_REF strings with the same value - that is important
3862 str
= IDENTIFIER_POINTER (get_identifier (str
));
3863 XSTR (sym
, 0) = str
;
3869 static alloc_pool label_ref_list_pool
;
3871 typedef struct label_ref_list_d
3874 struct label_ref_list_d
*next
;
3875 } *label_ref_list_t
;
3877 /* The SH cannot load a large constant into a register, constants have to
3878 come from a pc relative load. The reference of a pc relative load
3879 instruction must be less than 1k in front of the instruction. This
3880 means that we often have to dump a constant inside a function, and
3881 generate code to branch around it.
3883 It is important to minimize this, since the branches will slow things
3884 down and make things bigger.
3886 Worst case code looks like:
3904 We fix this by performing a scan before scheduling, which notices which
3905 instructions need to have their operands fetched from the constant table
3906 and builds the table.
3910 scan, find an instruction which needs a pcrel move. Look forward, find the
3911 last barrier which is within MAX_COUNT bytes of the requirement.
3912 If there isn't one, make one. Process all the instructions between
3913 the find and the barrier.
3915 In the above example, we can tell that L3 is within 1k of L1, so
3916 the first move can be shrunk from the 3 insn+constant sequence into
3917 just 1 insn, and the constant moved to L3 to make:
3928 Then the second move becomes the target for the shortening process. */
3932 rtx value
; /* Value in table. */
3933 rtx label
; /* Label of value. */
3934 label_ref_list_t wend
; /* End of window. */
3935 enum machine_mode mode
; /* Mode of value. */
3937 /* True if this constant is accessed as part of a post-increment
3938 sequence. Note that HImode constants are never accessed in this way. */
3939 bool part_of_sequence_p
;
3942 /* The maximum number of constants that can fit into one pool, since
3943 constants in the range 0..510 are at least 2 bytes long, and in the
3944 range from there to 1018 at least 4 bytes. */
3946 #define MAX_POOL_SIZE 372
3947 static pool_node pool_vector
[MAX_POOL_SIZE
];
3948 static int pool_size
;
3949 static rtx pool_window_label
;
3950 static int pool_window_last
;
3952 static int max_labelno_before_reorg
;
3954 /* ??? If we need a constant in HImode which is the truncated value of a
3955 constant we need in SImode, we could combine the two entries thus saving
3956 two bytes. Is this common enough to be worth the effort of implementing
3959 /* ??? This stuff should be done at the same time that we shorten branches.
3960 As it is now, we must assume that all branches are the maximum size, and
3961 this causes us to almost always output constant pools sooner than
3964 /* Add a constant to the pool and return its label. */
3967 add_constant (rtx x
, enum machine_mode mode
, rtx last_value
)
3971 label_ref_list_t ref
, newref
;
3973 /* First see if we've already got it. */
3974 for (i
= 0; i
< pool_size
; i
++)
3976 if (x
->code
== pool_vector
[i
].value
->code
3977 && mode
== pool_vector
[i
].mode
)
3979 if (x
->code
== CODE_LABEL
)
3981 if (XINT (x
, 3) != XINT (pool_vector
[i
].value
, 3))
3984 if (rtx_equal_p (x
, pool_vector
[i
].value
))
3989 || ! rtx_equal_p (last_value
, pool_vector
[i
-1].value
))
3991 new_rtx
= gen_label_rtx ();
3992 LABEL_REFS (new_rtx
) = pool_vector
[i
].label
;
3993 pool_vector
[i
].label
= lab
= new_rtx
;
3995 if (lab
&& pool_window_label
)
3997 newref
= (label_ref_list_t
) pool_alloc (label_ref_list_pool
);
3998 newref
->label
= pool_window_label
;
3999 ref
= pool_vector
[pool_window_last
].wend
;
4001 pool_vector
[pool_window_last
].wend
= newref
;
4004 pool_window_label
= new_rtx
;
4005 pool_window_last
= i
;
4011 /* Need a new one. */
4012 pool_vector
[pool_size
].value
= x
;
4013 if (last_value
&& rtx_equal_p (last_value
, pool_vector
[pool_size
- 1].value
))
4016 pool_vector
[pool_size
- 1].part_of_sequence_p
= true;
4019 lab
= gen_label_rtx ();
4020 pool_vector
[pool_size
].mode
= mode
;
4021 pool_vector
[pool_size
].label
= lab
;
4022 pool_vector
[pool_size
].wend
= NULL
;
4023 pool_vector
[pool_size
].part_of_sequence_p
= (lab
== 0);
4024 if (lab
&& pool_window_label
)
4026 newref
= (label_ref_list_t
) pool_alloc (label_ref_list_pool
);
4027 newref
->label
= pool_window_label
;
4028 ref
= pool_vector
[pool_window_last
].wend
;
4030 pool_vector
[pool_window_last
].wend
= newref
;
4033 pool_window_label
= lab
;
4034 pool_window_last
= pool_size
;
4039 /* Output the literal table. START, if nonzero, is the first instruction
4040 this table is needed for, and also indicates that there is at least one
4041 casesi_worker_2 instruction; We have to emit the operand3 labels from
4042 these insns at a 4-byte aligned position. BARRIER is the barrier
4043 after which we are to place the table. */
4046 dump_table (rtx start
, rtx barrier
)
4052 label_ref_list_t ref
;
4055 /* Do two passes, first time dump out the HI sized constants. */
4057 for (i
= 0; i
< pool_size
; i
++)
4059 pool_node
*p
= &pool_vector
[i
];
4061 if (p
->mode
== HImode
)
4065 scan
= emit_insn_after (gen_align_2 (), scan
);
4068 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4069 scan
= emit_label_after (lab
, scan
);
4070 scan
= emit_insn_after (gen_consttable_2 (p
->value
, const0_rtx
),
4072 for (ref
= p
->wend
; ref
; ref
= ref
->next
)
4075 scan
= emit_insn_after (gen_consttable_window_end (lab
), scan
);
4078 else if (p
->mode
== DFmode
)
4086 scan
= emit_insn_after (gen_align_4 (), scan
);
4088 for (; start
!= barrier
; start
= NEXT_INSN (start
))
4089 if (NONJUMP_INSN_P (start
)
4090 && recog_memoized (start
) == CODE_FOR_casesi_worker_2
)
4092 rtx src
= SET_SRC (XVECEXP (PATTERN (start
), 0, 0));
4093 rtx lab
= XEXP (XVECEXP (src
, 0, 3), 0);
4095 scan
= emit_label_after (lab
, scan
);
4098 if (TARGET_FMOVD
&& TARGET_ALIGN_DOUBLE
&& have_df
)
4100 rtx align_insn
= NULL_RTX
;
4102 scan
= emit_label_after (gen_label_rtx (), scan
);
4103 scan
= emit_insn_after (gen_align_log (GEN_INT (3)), scan
);
4106 for (i
= 0; i
< pool_size
; i
++)
4108 pool_node
*p
= &pool_vector
[i
];
4116 if (align_insn
&& !p
->part_of_sequence_p
)
4118 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4119 emit_label_before (lab
, align_insn
);
4120 emit_insn_before (gen_consttable_4 (p
->value
, const0_rtx
),
4122 for (ref
= p
->wend
; ref
; ref
= ref
->next
)
4125 emit_insn_before (gen_consttable_window_end (lab
),
4128 delete_insn (align_insn
);
4129 align_insn
= NULL_RTX
;
4134 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4135 scan
= emit_label_after (lab
, scan
);
4136 scan
= emit_insn_after (gen_consttable_4 (p
->value
,
4138 need_align
= ! need_align
;
4144 scan
= emit_insn_after (gen_align_log (GEN_INT (3)), scan
);
4149 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4150 scan
= emit_label_after (lab
, scan
);
4151 scan
= emit_insn_after (gen_consttable_8 (p
->value
, const0_rtx
),
4158 if (p
->mode
!= HImode
)
4160 for (ref
= p
->wend
; ref
; ref
= ref
->next
)
4163 scan
= emit_insn_after (gen_consttable_window_end (lab
),
4172 for (i
= 0; i
< pool_size
; i
++)
4174 pool_node
*p
= &pool_vector
[i
];
4185 scan
= emit_label_after (gen_label_rtx (), scan
);
4186 scan
= emit_insn_after (gen_align_4 (), scan
);
4188 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4189 scan
= emit_label_after (lab
, scan
);
4190 scan
= emit_insn_after (gen_consttable_4 (p
->value
, const0_rtx
),
4198 scan
= emit_label_after (gen_label_rtx (), scan
);
4199 scan
= emit_insn_after (gen_align_4 (), scan
);
4201 for (lab
= p
->label
; lab
; lab
= LABEL_REFS (lab
))
4202 scan
= emit_label_after (lab
, scan
);
4203 scan
= emit_insn_after (gen_consttable_8 (p
->value
, const0_rtx
),
4210 if (p
->mode
!= HImode
)
4212 for (ref
= p
->wend
; ref
; ref
= ref
->next
)
4215 scan
= emit_insn_after (gen_consttable_window_end (lab
), scan
);
4220 scan
= emit_insn_after (gen_consttable_end (), scan
);
4221 scan
= emit_barrier_after (scan
);
4223 pool_window_label
= NULL_RTX
;
4224 pool_window_last
= 0;
4227 /* Return nonzero if constant would be an ok source for a
4228 mov.w instead of a mov.l. */
4233 return (CONST_INT_P (src
)
4234 && INTVAL (src
) >= -32768
4235 && INTVAL (src
) <= 32767);
4238 #define MOVA_LABELREF(mova) XVECEXP (SET_SRC (PATTERN (mova)), 0, 0)
4240 /* Nonzero if the insn is a move instruction which needs to be fixed. */
4242 /* ??? For a DImode/DFmode moves, we don't need to fix it if each half of the
4243 CONST_DOUBLE input value is CONST_OK_FOR_I08. For a SFmode move, we don't
4244 need to fix it if the input value is CONST_OK_FOR_I08. */
4247 broken_move (rtx insn
)
4249 if (NONJUMP_INSN_P (insn
))
4251 rtx pat
= PATTERN (insn
);
4252 if (GET_CODE (pat
) == PARALLEL
)
4253 pat
= XVECEXP (pat
, 0, 0);
4254 if (GET_CODE (pat
) == SET
4255 /* We can load any 8-bit value if we don't care what the high
4256 order bits end up as. */
4257 && GET_MODE (SET_DEST (pat
)) != QImode
4258 && (CONSTANT_P (SET_SRC (pat
))
4259 /* Match mova_const. */
4260 || (GET_CODE (SET_SRC (pat
)) == UNSPEC
4261 && XINT (SET_SRC (pat
), 1) == UNSPEC_MOVA
4262 && GET_CODE (XVECEXP (SET_SRC (pat
), 0, 0)) == CONST
))
4264 && GET_CODE (SET_SRC (pat
)) == CONST_DOUBLE
4265 && (fp_zero_operand (SET_SRC (pat
))
4266 || fp_one_operand (SET_SRC (pat
)))
4267 /* In general we don't know the current setting of fpscr, so disable fldi.
4268 There is an exception if this was a register-register move
4269 before reload - and hence it was ascertained that we have
4270 single precision setting - and in a post-reload optimization
4271 we changed this to do a constant load. In that case
4272 we don't have an r0 clobber, hence we must use fldi. */
4274 || (GET_CODE (XEXP (XVECEXP (PATTERN (insn
), 0, 2), 0))
4276 && REG_P (SET_DEST (pat
))
4277 && FP_REGISTER_P (REGNO (SET_DEST (pat
))))
4279 && GET_MODE (SET_DEST (pat
)) == SImode
4280 && (satisfies_constraint_I20 (SET_SRC (pat
))
4281 || satisfies_constraint_I28 (SET_SRC (pat
))))
4282 && ! satisfies_constraint_I08 (SET_SRC (pat
)))
4292 return (NONJUMP_INSN_P (insn
)
4293 && GET_CODE (PATTERN (insn
)) == SET
4294 && GET_CODE (SET_SRC (PATTERN (insn
))) == UNSPEC
4295 && XINT (SET_SRC (PATTERN (insn
)), 1) == UNSPEC_MOVA
4296 /* Don't match mova_const. */
4297 && GET_CODE (MOVA_LABELREF (insn
)) == LABEL_REF
);
4300 /* Fix up a mova from a switch that went out of range. */
4302 fixup_mova (rtx mova
)
4304 PUT_MODE (XEXP (MOVA_LABELREF (mova
), 0), QImode
);
4307 SET_SRC (PATTERN (mova
)) = MOVA_LABELREF (mova
);
4308 INSN_CODE (mova
) = -1;
4313 rtx lab
= gen_label_rtx ();
4314 rtx wpat
, wpat0
, wpat1
, wsrc
, target
, base
, diff
;
4318 worker
= NEXT_INSN (worker
);
4320 && !LABEL_P (worker
)
4321 && !JUMP_P (worker
));
4322 } while (NOTE_P (worker
)
4323 || recog_memoized (worker
) != CODE_FOR_casesi_worker_1
);
4324 wpat
= PATTERN (worker
);
4325 wpat0
= XVECEXP (wpat
, 0, 0);
4326 wpat1
= XVECEXP (wpat
, 0, 1);
4327 wsrc
= SET_SRC (wpat0
);
4328 PATTERN (worker
) = (gen_casesi_worker_2
4329 (SET_DEST (wpat0
), XVECEXP (wsrc
, 0, 1),
4330 XEXP (XVECEXP (wsrc
, 0, 2), 0), lab
,
4332 INSN_CODE (worker
) = -1;
4333 target
= XVECEXP (SET_SRC (PATTERN (mova
)), 0, 0);
4334 base
= gen_rtx_LABEL_REF (Pmode
, lab
);
4335 diff
= gen_rtx_UNSPEC (Pmode
, gen_rtvec (2, target
, base
), UNSPEC_SYMOFF
);
4336 SET_SRC (PATTERN (mova
)) = gen_rtx_CONST (Pmode
, diff
);
4337 INSN_CODE (mova
) = -1;
4341 /* NEW_MOVA is a mova we've just encountered while scanning forward. Update
4342 *num_mova, and check if the new mova is not nested within the first one.
4343 return 0 if *first_mova was replaced, 1 if new_mova was replaced,
4344 2 if new_mova has been assigned to *first_mova, -1 otherwise.. */
4346 untangle_mova (int *num_mova
, rtx
*first_mova
, rtx new_mova
)
4348 int n_addr
= 0; /* Initialization to shut up spurious warning. */
4349 int f_target
, n_target
= 0; /* Likewise. */
4353 /* If NEW_MOVA has no address yet, it will be handled later. */
4354 if (INSN_ADDRESSES_SIZE() <= (unsigned) INSN_UID (new_mova
))
4357 n_addr
= INSN_ADDRESSES (INSN_UID (new_mova
));
4358 n_target
= INSN_ADDRESSES (INSN_UID (XEXP (MOVA_LABELREF (new_mova
), 0)));
4359 if (n_addr
> n_target
|| n_addr
+ 1022 < n_target
)
4361 /* Change the mova into a load.
4362 broken_move will then return true for it. */
4363 fixup_mova (new_mova
);
4369 *first_mova
= new_mova
;
4374 = INSN_ADDRESSES (INSN_UID (XEXP (MOVA_LABELREF (*first_mova
), 0))))
4379 if (f_target
- INSN_ADDRESSES (INSN_UID (*first_mova
))
4380 > n_target
- n_addr
)
4382 fixup_mova (*first_mova
);
4387 fixup_mova (new_mova
);
4392 /* Find the last barrier from insn FROM which is close enough to hold the
4393 constant pool. If we can't find one, then create one near the end of
4397 find_barrier (int num_mova
, rtx mova
, rtx from
)
4406 int leading_mova
= num_mova
;
4407 rtx barrier_before_mova
= 0, found_barrier
= 0, good_barrier
= 0;
4411 rtx last_got
= NULL_RTX
;
4412 rtx last_symoff
= NULL_RTX
;
4414 /* For HImode: range is 510, add 4 because pc counts from address of
4415 second instruction after this one, subtract 2 for the jump instruction
4416 that we may need to emit before the table, subtract 2 for the instruction
4417 that fills the jump delay slot (in very rare cases, reorg will take an
4418 instruction from after the constant pool or will leave the delay slot
4419 empty). This gives 510.
4420 For SImode: range is 1020, add 4 because pc counts from address of
4421 second instruction after this one, subtract 2 in case pc is 2 byte
4422 aligned, subtract 2 for the jump instruction that we may need to emit
4423 before the table, subtract 2 for the instruction that fills the jump
4424 delay slot. This gives 1018. */
4426 /* The branch will always be shortened now that the reference address for
4427 forward branches is the successor address, thus we need no longer make
4428 adjustments to the [sh]i_limit for -O0. */
4433 while (from
&& count_si
< si_limit
&& count_hi
< hi_limit
)
4435 int inc
= get_attr_length (from
);
4438 /* If this is a label that existed at the time of the compute_alignments
4439 call, determine the alignment. N.B. When find_barrier recurses for
4440 an out-of-reach mova, we might see labels at the start of previously
4441 inserted constant tables. */
4443 && CODE_LABEL_NUMBER (from
) <= max_labelno_before_reorg
)
4446 new_align
= 1 << label_to_alignment (from
);
4447 else if (BARRIER_P (prev_nonnote_insn (from
)))
4448 new_align
= 1 << barrier_align (from
);
4453 /* In case we are scanning a constant table because of recursion, check
4454 for explicit alignments. If the table is long, we might be forced
4455 to emit the new table in front of it; the length of the alignment
4456 might be the last straw. */
4457 else if (NONJUMP_INSN_P (from
)
4458 && GET_CODE (PATTERN (from
)) == UNSPEC_VOLATILE
4459 && XINT (PATTERN (from
), 1) == UNSPECV_ALIGN
)
4460 new_align
= INTVAL (XVECEXP (PATTERN (from
), 0, 0));
4461 /* When we find the end of a constant table, paste the new constant
4462 at the end. That is better than putting it in front because
4463 this way, we don't need extra alignment for adding a 4-byte-aligned
4464 mov(a) label to a 2/4 or 8/4 byte aligned table. */
4465 else if (NONJUMP_INSN_P (from
)
4466 && GET_CODE (PATTERN (from
)) == UNSPEC_VOLATILE
4467 && XINT (PATTERN (from
), 1) == UNSPECV_CONST_END
)
4470 if (BARRIER_P (from
))
4474 found_barrier
= from
;
4476 /* If we are at the end of the function, or in front of an alignment
4477 instruction, we need not insert an extra alignment. We prefer
4478 this kind of barrier. */
4479 if (barrier_align (from
) > 2)
4480 good_barrier
= from
;
4482 /* If we are at the end of a hot/cold block, dump the constants
4484 next
= NEXT_INSN (from
);
4487 && NOTE_KIND (next
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
4491 if (broken_move (from
))
4494 enum machine_mode mode
;
4496 pat
= PATTERN (from
);
4497 if (GET_CODE (pat
) == PARALLEL
)
4498 pat
= XVECEXP (pat
, 0, 0);
4499 src
= SET_SRC (pat
);
4500 dst
= SET_DEST (pat
);
4501 mode
= GET_MODE (dst
);
4503 /* GOT pcrelat setting comes in pair of
4506 instructions. (plus add r0,r12).
4507 Remember if we see one without the other. */
4508 if (GET_CODE (src
) == UNSPEC
&& PIC_ADDR_P (XVECEXP (src
, 0, 0)))
4509 last_got
= last_got
? NULL_RTX
: from
;
4510 else if (PIC_ADDR_P (src
))
4511 last_got
= last_got
? NULL_RTX
: from
;
4513 /* We must explicitly check the mode, because sometimes the
4514 front end will generate code to load unsigned constants into
4515 HImode targets without properly sign extending them. */
4517 || (mode
== SImode
&& hi_const (src
) && REGNO (dst
) != FPUL_REG
))
4520 /* We put the short constants before the long constants, so
4521 we must count the length of short constants in the range
4522 for the long constants. */
4523 /* ??? This isn't optimal, but is easy to do. */
4528 /* We dump DF/DI constants before SF/SI ones, because
4529 the limit is the same, but the alignment requirements
4530 are higher. We may waste up to 4 additional bytes
4531 for alignment, and the DF/DI constant may have
4532 another SF/SI constant placed before it. */
4533 if (TARGET_SHCOMPACT
4535 && (mode
== DFmode
|| mode
== DImode
))
4540 while (si_align
> 2 && found_si
+ si_align
- 2 > count_si
)
4542 if (found_si
> count_si
)
4543 count_si
= found_si
;
4544 found_si
+= GET_MODE_SIZE (mode
);
4546 si_limit
-= GET_MODE_SIZE (mode
);
4552 switch (untangle_mova (&num_mova
, &mova
, from
))
4557 rtx src
= SET_SRC (PATTERN (from
));
4558 if (GET_CODE (src
) == CONST
4559 && GET_CODE (XEXP (src
, 0)) == UNSPEC
4560 && XINT (XEXP (src
, 0), 1) == UNSPEC_SYMOFF
)
4564 case 0: return find_barrier (0, 0, mova
);
4569 = good_barrier
? good_barrier
: found_barrier
;
4573 if (found_si
> count_si
)
4574 count_si
= found_si
;
4576 else if (JUMP_TABLE_DATA_P (from
))
4578 if ((num_mova
> 1 && GET_MODE (prev_nonnote_insn (from
)) == VOIDmode
)
4580 && (prev_nonnote_insn (from
)
4581 == XEXP (MOVA_LABELREF (mova
), 0))))
4583 if (barrier_align (next_real_insn (from
)) == align_jumps_log
)
4585 /* We have just passed the barrier in front of the
4586 ADDR_DIFF_VEC, which is stored in found_barrier. Since
4587 the ADDR_DIFF_VEC is accessed as data, just like our pool
4588 constants, this is a good opportunity to accommodate what
4589 we have gathered so far.
4590 If we waited any longer, we could end up at a barrier in
4591 front of code, which gives worse cache usage for separated
4592 instruction / data caches. */
4593 good_barrier
= found_barrier
;
4598 rtx body
= PATTERN (from
);
4599 inc
= XVECLEN (body
, 1) * GET_MODE_SIZE (GET_MODE (body
));
4602 /* For the SH1, we generate alignments even after jumps-around-jumps. */
4603 else if (JUMP_P (from
)
4605 && ! TARGET_SMALLCODE
)
4608 /* There is a possibility that a bf is transformed into a bf/s by the
4609 delay slot scheduler. */
4610 if (JUMP_P (from
) && !JUMP_TABLE_DATA_P (from
)
4611 && get_attr_type (from
) == TYPE_CBRANCH
4612 && GET_CODE (PATTERN (NEXT_INSN (PREV_INSN (from
)))) != SEQUENCE
)
4618 if (new_align
> si_align
)
4620 si_limit
-= (count_si
- 1) & (new_align
- si_align
);
4621 si_align
= new_align
;
4623 count_si
= (count_si
+ new_align
- 1) & -new_align
;
4628 if (new_align
> hi_align
)
4630 hi_limit
-= (count_hi
- 1) & (new_align
- hi_align
);
4631 hi_align
= new_align
;
4633 count_hi
= (count_hi
+ new_align
- 1) & -new_align
;
4635 from
= NEXT_INSN (from
);
4642 /* Try as we might, the leading mova is out of range. Change
4643 it into a load (which will become a pcload) and retry. */
4645 return find_barrier (0, 0, mova
);
4649 /* Insert the constant pool table before the mova instruction,
4650 to prevent the mova label reference from going out of range. */
4652 good_barrier
= found_barrier
= barrier_before_mova
;
4658 if (good_barrier
&& next_real_insn (found_barrier
))
4659 found_barrier
= good_barrier
;
4663 /* We didn't find a barrier in time to dump our stuff,
4664 so we'll make one. */
4665 rtx label
= gen_label_rtx ();
4667 /* Don't emit a constant table in the middle of insns for
4668 casesi_worker_2. This is a bit overkill but is enough
4669 because casesi_worker_2 wouldn't appear so frequently. */
4673 /* If we exceeded the range, then we must back up over the last
4674 instruction we looked at. Otherwise, we just need to undo the
4675 NEXT_INSN at the end of the loop. */
4676 if (PREV_INSN (from
) != orig
4677 && (count_hi
> hi_limit
|| count_si
> si_limit
))
4678 from
= PREV_INSN (PREV_INSN (from
));
4680 from
= PREV_INSN (from
);
4682 /* Don't emit a constant table int the middle of global pointer setting,
4683 since that that would move the addressing base GOT into another table.
4684 We need the first mov instruction before the _GLOBAL_OFFSET_TABLE_
4685 in the pool anyway, so just move up the whole constant pool. */
4687 from
= PREV_INSN (last_got
);
4689 /* Don't insert the constant pool table at the position which
4690 may be the landing pad. */
4693 && find_reg_note (from
, REG_EH_REGION
, NULL_RTX
))
4694 from
= PREV_INSN (from
);
4696 /* Walk back to be just before any jump or label.
4697 Putting it before a label reduces the number of times the branch
4698 around the constant pool table will be hit. Putting it before
4699 a jump makes it more likely that the bra delay slot will be
4701 while (NOTE_P (from
) || JUMP_P (from
)
4703 from
= PREV_INSN (from
);
4705 from
= emit_jump_insn_after (gen_jump (label
), from
);
4706 JUMP_LABEL (from
) = label
;
4707 LABEL_NUSES (label
) = 1;
4708 found_barrier
= emit_barrier_after (from
);
4709 emit_label_after (label
, found_barrier
);
4712 return found_barrier
;
4715 /* If the instruction INSN is implemented by a special function, and we can
4716 positively find the register that is used to call the sfunc, and this
4717 register is not used anywhere else in this instruction - except as the
4718 destination of a set, return this register; else, return 0. */
4720 sfunc_uses_reg (rtx insn
)
4723 rtx pattern
, part
, reg_part
, reg
;
4725 if (!NONJUMP_INSN_P (insn
))
4727 pattern
= PATTERN (insn
);
4728 if (GET_CODE (pattern
) != PARALLEL
|| get_attr_type (insn
) != TYPE_SFUNC
)
4731 for (reg_part
= 0, i
= XVECLEN (pattern
, 0) - 1; i
>= 1; i
--)
4733 part
= XVECEXP (pattern
, 0, i
);
4734 if (GET_CODE (part
) == USE
&& GET_MODE (XEXP (part
, 0)) == SImode
)
4739 reg
= XEXP (reg_part
, 0);
4740 for (i
= XVECLEN (pattern
, 0) - 1; i
>= 0; i
--)
4742 part
= XVECEXP (pattern
, 0, i
);
4743 if (part
== reg_part
|| GET_CODE (part
) == CLOBBER
)
4745 if (reg_mentioned_p (reg
, ((GET_CODE (part
) == SET
4746 && REG_P (SET_DEST (part
)))
4747 ? SET_SRC (part
) : part
)))
4753 /* See if the only way in which INSN uses REG is by calling it, or by
4754 setting it while calling it. Set *SET to a SET rtx if the register
4758 noncall_uses_reg (rtx reg
, rtx insn
, rtx
*set
)
4764 reg2
= sfunc_uses_reg (insn
);
4765 if (reg2
&& REGNO (reg2
) == REGNO (reg
))
4767 pattern
= single_set (insn
);
4769 && REG_P (SET_DEST (pattern
))
4770 && REGNO (reg
) == REGNO (SET_DEST (pattern
)))
4776 /* We don't use rtx_equal_p because we don't care if the mode is
4778 pattern
= single_set (insn
);
4780 && REG_P (SET_DEST (pattern
))
4781 && REGNO (reg
) == REGNO (SET_DEST (pattern
)))
4787 par
= PATTERN (insn
);
4788 if (GET_CODE (par
) == PARALLEL
)
4789 for (i
= XVECLEN (par
, 0) - 1; i
>= 0; i
--)
4791 part
= XVECEXP (par
, 0, i
);
4792 if (GET_CODE (part
) != SET
&& reg_mentioned_p (reg
, part
))
4795 return reg_mentioned_p (reg
, SET_SRC (pattern
));
4801 pattern
= PATTERN (insn
);
4803 if (GET_CODE (pattern
) == PARALLEL
)
4807 for (i
= XVECLEN (pattern
, 0) - 1; i
>= 1; i
--)
4808 if (reg_mentioned_p (reg
, XVECEXP (pattern
, 0, i
)))
4810 pattern
= XVECEXP (pattern
, 0, 0);
4813 if (GET_CODE (pattern
) == SET
)
4815 if (reg_mentioned_p (reg
, SET_DEST (pattern
)))
4817 /* We don't use rtx_equal_p, because we don't care if the
4818 mode is different. */
4819 if (!REG_P (SET_DEST (pattern
))
4820 || REGNO (reg
) != REGNO (SET_DEST (pattern
)))
4826 pattern
= SET_SRC (pattern
);
4829 if (GET_CODE (pattern
) != CALL
4830 || !MEM_P (XEXP (pattern
, 0))
4831 || ! rtx_equal_p (reg
, XEXP (XEXP (pattern
, 0), 0)))
4837 /* Given a X, a pattern of an insn or a part of it, return a mask of used
4838 general registers. Bits 0..15 mean that the respective registers
4839 are used as inputs in the instruction. Bits 16..31 mean that the
4840 registers 0..15, respectively, are used as outputs, or are clobbered.
4841 IS_DEST should be set to 16 if X is the destination of a SET, else to 0. */
4843 regs_used (rtx x
, int is_dest
)
4851 code
= GET_CODE (x
);
4856 return (((1 << HARD_REGNO_NREGS (0, GET_MODE (x
))) - 1)
4857 << (REGNO (x
) + is_dest
));
4861 rtx y
= SUBREG_REG (x
);
4866 return (((1 << HARD_REGNO_NREGS (0, GET_MODE (x
))) - 1)
4868 subreg_regno_offset (REGNO (y
),
4871 GET_MODE (x
)) + is_dest
));
4875 return regs_used (SET_SRC (x
), 0) | regs_used (SET_DEST (x
), 16);
4877 /* If there was a return value, it must have been indicated with USE. */
4892 fmt
= GET_RTX_FORMAT (code
);
4894 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
4899 for (j
= XVECLEN (x
, i
) - 1; j
>= 0; j
--)
4900 used
|= regs_used (XVECEXP (x
, i
, j
), is_dest
);
4902 else if (fmt
[i
] == 'e')
4903 used
|= regs_used (XEXP (x
, i
), is_dest
);
4908 /* Create an instruction that prevents redirection of a conditional branch
4909 to the destination of the JUMP with address ADDR.
4910 If the branch needs to be implemented as an indirect jump, try to find
4911 a scratch register for it.
4912 If NEED_BLOCK is 0, don't do anything unless we need a scratch register.
4913 If any preceding insn that doesn't fit into a delay slot is good enough,
4914 pass 1. Pass 2 if a definite blocking insn is needed.
4915 -1 is used internally to avoid deep recursion.
4916 If a blocking instruction is made or recognized, return it. */
4919 gen_block_redirect (rtx jump
, int addr
, int need_block
)
4922 rtx prev
= prev_nonnote_insn (jump
);
4925 /* First, check if we already have an instruction that satisfies our need. */
4926 if (prev
&& NONJUMP_INSN_P (prev
) && ! INSN_DELETED_P (prev
))
4928 if (INSN_CODE (prev
) == CODE_FOR_indirect_jump_scratch
)
4930 if (GET_CODE (PATTERN (prev
)) == USE
4931 || GET_CODE (PATTERN (prev
)) == CLOBBER
4932 || get_attr_in_delay_slot (prev
) == IN_DELAY_SLOT_YES
)
4934 else if ((need_block
&= ~1) < 0)
4936 else if (recog_memoized (prev
) == CODE_FOR_block_branch_redirect
)
4939 if (GET_CODE (PATTERN (jump
)) == RETURN
)
4943 /* Reorg even does nasty things with return insns that cause branches
4944 to go out of range - see find_end_label and callers. */
4945 return emit_insn_before (gen_block_branch_redirect (const0_rtx
) , jump
);
4947 /* We can't use JUMP_LABEL here because it might be undefined
4948 when not optimizing. */
4949 dest
= XEXP (SET_SRC (PATTERN (jump
)), 0);
4950 /* If the branch is out of range, try to find a scratch register for it. */
4952 && (INSN_ADDRESSES (INSN_UID (dest
)) - addr
+ (unsigned) 4092
4956 /* Don't look for the stack pointer as a scratch register,
4957 it would cause trouble if an interrupt occurred. */
4958 unsigned attempt
= 0x7fff, used
;
4959 int jump_left
= flag_expensive_optimizations
+ 1;
4961 /* It is likely that the most recent eligible instruction is wanted for
4962 the delay slot. Therefore, find out which registers it uses, and
4963 try to avoid using them. */
4965 for (scan
= jump
; (scan
= PREV_INSN (scan
)); )
4969 if (INSN_DELETED_P (scan
))
4971 code
= GET_CODE (scan
);
4972 if (code
== CODE_LABEL
|| code
== JUMP_INSN
)
4975 && GET_CODE (PATTERN (scan
)) != USE
4976 && GET_CODE (PATTERN (scan
)) != CLOBBER
4977 && get_attr_in_delay_slot (scan
) == IN_DELAY_SLOT_YES
)
4979 attempt
&= ~regs_used (PATTERN (scan
), 0);
4983 for (used
= dead
= 0, scan
= JUMP_LABEL (jump
);
4984 (scan
= NEXT_INSN (scan
)); )
4988 if (INSN_DELETED_P (scan
))
4990 code
= GET_CODE (scan
);
4993 used
|= regs_used (PATTERN (scan
), 0);
4994 if (code
== CALL_INSN
)
4995 used
|= regs_used (CALL_INSN_FUNCTION_USAGE (scan
), 0);
4996 dead
|= (used
>> 16) & ~used
;
5002 if (code
== JUMP_INSN
)
5004 if (jump_left
-- && simplejump_p (scan
))
5005 scan
= JUMP_LABEL (scan
);
5011 /* Mask out the stack pointer again, in case it was
5012 the only 'free' register we have found. */
5015 /* If the immediate destination is still in range, check for possible
5016 threading with a jump beyond the delay slot insn.
5017 Don't check if we are called recursively; the jump has been or will be
5018 checked in a different invocation then. */
5020 else if (optimize
&& need_block
>= 0)
5022 rtx next
= next_active_insn (next_active_insn (dest
));
5023 if (next
&& JUMP_P (next
)
5024 && GET_CODE (PATTERN (next
)) == SET
5025 && recog_memoized (next
) == CODE_FOR_jump_compact
)
5027 dest
= JUMP_LABEL (next
);
5029 && (INSN_ADDRESSES (INSN_UID (dest
)) - addr
+ (unsigned) 4092
5031 gen_block_redirect (next
, INSN_ADDRESSES (INSN_UID (next
)), -1);
5037 rtx reg
= gen_rtx_REG (SImode
, exact_log2 (dead
& -dead
));
5039 /* It would be nice if we could convert the jump into an indirect
5040 jump / far branch right now, and thus exposing all constituent
5041 instructions to further optimization. However, reorg uses
5042 simplejump_p to determine if there is an unconditional jump where
5043 it should try to schedule instructions from the target of the
5044 branch; simplejump_p fails for indirect jumps even if they have
5046 rtx insn
= emit_insn_before (gen_indirect_jump_scratch
5047 (reg
, GEN_INT (unspec_bbr_uid
++)),
5049 /* ??? We would like this to have the scope of the jump, but that
5050 scope will change when a delay slot insn of an inner scope is added.
5051 Hence, after delay slot scheduling, we'll have to expect
5052 NOTE_INSN_BLOCK_END notes between the indirect_jump_scratch and
5055 INSN_LOCATOR (insn
) = INSN_LOCATOR (jump
);
5056 INSN_CODE (insn
) = CODE_FOR_indirect_jump_scratch
;
5059 else if (need_block
)
5060 /* We can't use JUMP_LABEL here because it might be undefined
5061 when not optimizing. */
5062 return emit_insn_before (gen_block_branch_redirect
5063 (GEN_INT (unspec_bbr_uid
++)),
5068 #define CONDJUMP_MIN -252
5069 #define CONDJUMP_MAX 262
5072 /* A label (to be placed) in front of the jump
5073 that jumps to our ultimate destination. */
5075 /* Where we are going to insert it if we cannot move the jump any farther,
5076 or the jump itself if we have picked up an existing jump. */
5078 /* The ultimate destination. */
5080 struct far_branch
*prev
;
5081 /* If the branch has already been created, its address;
5082 else the address of its first prospective user. */
5086 static void gen_far_branch (struct far_branch
*);
5087 enum mdep_reorg_phase_e mdep_reorg_phase
;
5089 gen_far_branch (struct far_branch
*bp
)
5091 rtx insn
= bp
->insert_place
;
5093 rtx label
= gen_label_rtx ();
5096 emit_label_after (label
, insn
);
5099 jump
= emit_jump_insn_after (gen_jump (bp
->far_label
), insn
);
5100 LABEL_NUSES (bp
->far_label
)++;
5103 jump
= emit_jump_insn_after (gen_return (), insn
);
5104 /* Emit a barrier so that reorg knows that any following instructions
5105 are not reachable via a fall-through path.
5106 But don't do this when not optimizing, since we wouldn't suppress the
5107 alignment for the barrier then, and could end up with out-of-range
5108 pc-relative loads. */
5110 emit_barrier_after (jump
);
5111 emit_label_after (bp
->near_label
, insn
);
5112 JUMP_LABEL (jump
) = bp
->far_label
;
5113 ok
= invert_jump (insn
, label
, 1);
5116 /* If we are branching around a jump (rather than a return), prevent
5117 reorg from using an insn from the jump target as the delay slot insn -
5118 when reorg did this, it pessimized code (we rather hide the delay slot)
5119 and it could cause branches to go out of range. */
5122 (gen_stuff_delay_slot
5123 (GEN_INT (unspec_bbr_uid
++),
5124 GEN_INT (recog_memoized (insn
) == CODE_FOR_branch_false
)),
5126 /* Prevent reorg from undoing our splits. */
5127 gen_block_redirect (jump
, bp
->address
+= 2, 2);
5130 /* Fix up ADDR_DIFF_VECs. */
5132 fixup_addr_diff_vecs (rtx first
)
5136 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5138 rtx vec_lab
, pat
, prev
, prevpat
, x
, braf_label
;
5141 || GET_CODE (PATTERN (insn
)) != ADDR_DIFF_VEC
)
5143 pat
= PATTERN (insn
);
5144 vec_lab
= XEXP (XEXP (pat
, 0), 0);
5146 /* Search the matching casesi_jump_2. */
5147 for (prev
= vec_lab
; ; prev
= PREV_INSN (prev
))
5151 prevpat
= PATTERN (prev
);
5152 if (GET_CODE (prevpat
) != PARALLEL
|| XVECLEN (prevpat
, 0) != 2)
5154 x
= XVECEXP (prevpat
, 0, 1);
5155 if (GET_CODE (x
) != USE
)
5158 if (GET_CODE (x
) == LABEL_REF
&& XEXP (x
, 0) == vec_lab
)
5161 /* FIXME: This is a bug in the optimizer, but it seems harmless
5162 to just avoid panicing. */
5166 /* Emit the reference label of the braf where it belongs, right after
5167 the casesi_jump_2 (i.e. braf). */
5168 braf_label
= XEXP (XEXP (SET_SRC (XVECEXP (prevpat
, 0, 0)), 1), 0);
5169 emit_label_after (braf_label
, prev
);
5171 /* Fix up the ADDR_DIF_VEC to be relative
5172 to the reference address of the braf. */
5173 XEXP (XEXP (pat
, 0), 0) = braf_label
;
5177 /* BARRIER_OR_LABEL is either a BARRIER or a CODE_LABEL immediately following
5178 a barrier. Return the base 2 logarithm of the desired alignment. */
5180 barrier_align (rtx barrier_or_label
)
5182 rtx next
= next_real_insn (barrier_or_label
), pat
, prev
;
5183 int slot
, credit
, jump_to_next
= 0;
5188 pat
= PATTERN (next
);
5190 if (GET_CODE (pat
) == ADDR_DIFF_VEC
)
5193 if (GET_CODE (pat
) == UNSPEC_VOLATILE
&& XINT (pat
, 1) == UNSPECV_ALIGN
)
5194 /* This is a barrier in front of a constant table. */
5197 prev
= prev_real_insn (barrier_or_label
);
5198 if (GET_CODE (PATTERN (prev
)) == ADDR_DIFF_VEC
)
5200 pat
= PATTERN (prev
);
5201 /* If this is a very small table, we want to keep the alignment after
5202 the table to the minimum for proper code alignment. */
5203 return ((TARGET_SMALLCODE
5204 || ((unsigned) XVECLEN (pat
, 1) * GET_MODE_SIZE (GET_MODE (pat
))
5205 <= (unsigned) 1 << (CACHE_LOG
- 2)))
5206 ? 1 << TARGET_SHMEDIA
: align_jumps_log
);
5209 if (TARGET_SMALLCODE
)
5212 if (! TARGET_SH2
|| ! optimize
)
5213 return align_jumps_log
;
5215 /* When fixing up pcloads, a constant table might be inserted just before
5216 the basic block that ends with the barrier. Thus, we can't trust the
5217 instruction lengths before that. */
5218 if (mdep_reorg_phase
> SH_FIXUP_PCLOAD
)
5220 /* Check if there is an immediately preceding branch to the insn beyond
5221 the barrier. We must weight the cost of discarding useful information
5222 from the current cache line when executing this branch and there is
5223 an alignment, against that of fetching unneeded insn in front of the
5224 branch target when there is no alignment. */
5226 /* There are two delay_slot cases to consider. One is the simple case
5227 where the preceding branch is to the insn beyond the barrier (simple
5228 delay slot filling), and the other is where the preceding branch has
5229 a delay slot that is a duplicate of the insn after the barrier
5230 (fill_eager_delay_slots) and the branch is to the insn after the insn
5231 after the barrier. */
5233 /* PREV is presumed to be the JUMP_INSN for the barrier under
5234 investigation. Skip to the insn before it. */
5235 prev
= prev_real_insn (prev
);
5237 for (slot
= 2, credit
= (1 << (CACHE_LOG
- 2)) + 2;
5238 credit
>= 0 && prev
&& NONJUMP_INSN_P (prev
);
5239 prev
= prev_real_insn (prev
))
5242 if (GET_CODE (PATTERN (prev
)) == USE
5243 || GET_CODE (PATTERN (prev
)) == CLOBBER
)
5245 if (GET_CODE (PATTERN (prev
)) == SEQUENCE
)
5247 prev
= XVECEXP (PATTERN (prev
), 0, 1);
5248 if (INSN_UID (prev
) == INSN_UID (next
))
5250 /* Delay slot was filled with insn at jump target. */
5257 get_attr_in_delay_slot (prev
) == IN_DELAY_SLOT_YES
)
5259 credit
-= get_attr_length (prev
);
5263 && JUMP_LABEL (prev
))
5267 || next_real_insn (JUMP_LABEL (prev
)) == next
5268 /* If relax_delay_slots() decides NEXT was redundant
5269 with some previous instruction, it will have
5270 redirected PREV's jump to the following insn. */
5271 || JUMP_LABEL (prev
) == next_nonnote_insn (next
)
5272 /* There is no upper bound on redundant instructions
5273 that might have been skipped, but we must not put an
5274 alignment where none had been before. */
5275 || (x
= (NEXT_INSN (NEXT_INSN (PREV_INSN (prev
)))),
5277 && (INSN_CODE (x
) == CODE_FOR_block_branch_redirect
5278 || INSN_CODE (x
) == CODE_FOR_indirect_jump_scratch
5279 || INSN_CODE (x
) == CODE_FOR_stuff_delay_slot
))))
5281 rtx pat
= PATTERN (prev
);
5282 if (GET_CODE (pat
) == PARALLEL
)
5283 pat
= XVECEXP (pat
, 0, 0);
5284 if (credit
- slot
>= (GET_CODE (SET_SRC (pat
)) == PC
? 2 : 0))
5290 return align_jumps_log
;
5293 /* If we are inside a phony loop, almost any kind of label can turn up as the
5294 first one in the loop. Aligning a braf label causes incorrect switch
5295 destination addresses; we can detect braf labels because they are
5296 followed by a BARRIER.
5297 Applying loop alignment to small constant or switch tables is a waste
5298 of space, so we suppress this too. */
5300 sh_loop_align (rtx label
)
5305 next
= next_nonnote_insn (next
);
5306 while (next
&& LABEL_P (next
));
5310 || GET_CODE (PATTERN (next
)) == ADDR_DIFF_VEC
5311 || recog_memoized (next
) == CODE_FOR_consttable_2
)
5314 return align_loops_log
;
5317 /* Do a final pass over the function, just before delayed branch
5323 rtx first
, insn
, mova
= NULL_RTX
;
5325 rtx r0_rtx
= gen_rtx_REG (Pmode
, 0);
5326 rtx r0_inc_rtx
= gen_rtx_POST_INC (Pmode
, r0_rtx
);
5328 first
= get_insns ();
5329 max_labelno_before_reorg
= max_label_num ();
5331 /* We must split call insns before introducing `mova's. If we're
5332 optimizing, they'll have already been split. Otherwise, make
5333 sure we don't split them too late. */
5335 split_all_insns_noflow ();
5340 /* If relaxing, generate pseudo-ops to associate function calls with
5341 the symbols they call. It does no harm to not generate these
5342 pseudo-ops. However, when we can generate them, it enables to
5343 linker to potentially relax the jsr to a bsr, and eliminate the
5344 register load and, possibly, the constant pool entry. */
5346 mdep_reorg_phase
= SH_INSERT_USES_LABELS
;
5349 /* Remove all REG_LABEL_OPERAND notes. We want to use them for our
5350 own purposes. This works because none of the remaining passes
5351 need to look at them.
5353 ??? But it may break in the future. We should use a machine
5354 dependent REG_NOTE, or some other approach entirely. */
5355 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5361 while ((note
= find_reg_note (insn
, REG_LABEL_OPERAND
,
5363 remove_note (insn
, note
);
5367 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5369 rtx pattern
, reg
, link
, set
, scan
, dies
, label
;
5370 int rescan
= 0, foundinsn
= 0;
5374 pattern
= PATTERN (insn
);
5376 if (GET_CODE (pattern
) == PARALLEL
)
5377 pattern
= XVECEXP (pattern
, 0, 0);
5378 if (GET_CODE (pattern
) == SET
)
5379 pattern
= SET_SRC (pattern
);
5381 if (GET_CODE (pattern
) != CALL
5382 || !MEM_P (XEXP (pattern
, 0)))
5385 reg
= XEXP (XEXP (pattern
, 0), 0);
5389 reg
= sfunc_uses_reg (insn
);
5397 /* Try scanning backward to find where the register is set. */
5399 for (scan
= PREV_INSN (insn
);
5400 scan
&& !LABEL_P (scan
);
5401 scan
= PREV_INSN (scan
))
5403 if (! INSN_P (scan
))
5406 if (! reg_mentioned_p (reg
, scan
))
5409 if (noncall_uses_reg (reg
, scan
, &set
))
5422 /* The register is set at LINK. */
5424 /* We can only optimize the function call if the register is
5425 being set to a symbol. In theory, we could sometimes
5426 optimize calls to a constant location, but the assembler
5427 and linker do not support that at present. */
5428 if (GET_CODE (SET_SRC (set
)) != SYMBOL_REF
5429 && GET_CODE (SET_SRC (set
)) != LABEL_REF
)
5432 /* Scan forward from LINK to the place where REG dies, and
5433 make sure that the only insns which use REG are
5434 themselves function calls. */
5436 /* ??? This doesn't work for call targets that were allocated
5437 by reload, since there may not be a REG_DEAD note for the
5441 for (scan
= NEXT_INSN (link
); scan
; scan
= NEXT_INSN (scan
))
5445 /* Don't try to trace forward past a CODE_LABEL if we haven't
5446 seen INSN yet. Ordinarily, we will only find the setting insn
5447 if it is in the same basic block. However,
5448 cross-jumping can insert code labels in between the load and
5449 the call, and can result in situations where a single call
5450 insn may have two targets depending on where we came from. */
5452 if (LABEL_P (scan
) && ! foundinsn
)
5455 if (! INSN_P (scan
))
5458 /* Don't try to trace forward past a JUMP. To optimize
5459 safely, we would have to check that all the
5460 instructions at the jump destination did not use REG. */
5465 if (! reg_mentioned_p (reg
, scan
))
5468 if (noncall_uses_reg (reg
, scan
, &scanset
))
5475 && (CALL_P (scan
) || sfunc_uses_reg (scan
)))
5477 /* There is a function call to this register other
5478 than the one we are checking. If we optimize
5479 this call, we need to rescan again below. */
5483 /* ??? We shouldn't have to worry about SCANSET here.
5484 We should just be able to check for a REG_DEAD note
5485 on a function call. However, the REG_DEAD notes are
5486 apparently not dependable around libcalls; c-torture
5487 execute/920501-2 is a test case. If SCANSET is set,
5488 then this insn sets the register, so it must have
5489 died earlier. Unfortunately, this will only handle
5490 the cases in which the register is, in fact, set in a
5493 /* ??? We shouldn't have to use FOUNDINSN here.
5494 This dates back to when we used LOG_LINKS to find
5495 the most recent insn which sets the register. */
5499 || find_reg_note (scan
, REG_DEAD
, reg
)))
5508 /* Either there was a branch, or some insn used REG
5509 other than as a function call address. */
5513 /* Create a code label, and put it in a REG_LABEL_OPERAND note
5514 on the insn which sets the register, and on each call insn
5515 which uses the register. In final_prescan_insn we look for
5516 the REG_LABEL_OPERAND notes, and output the appropriate label
5519 label
= gen_label_rtx ();
5520 add_reg_note (link
, REG_LABEL_OPERAND
, label
);
5521 add_reg_note (insn
, REG_LABEL_OPERAND
, label
);
5529 scan
= NEXT_INSN (scan
);
5532 && reg_mentioned_p (reg
, scan
))
5533 || ((reg2
= sfunc_uses_reg (scan
))
5534 && REGNO (reg2
) == REGNO (reg
))))
5535 add_reg_note (scan
, REG_LABEL_OPERAND
, label
);
5537 while (scan
!= dies
);
5543 fixup_addr_diff_vecs (first
);
5547 mdep_reorg_phase
= SH_SHORTEN_BRANCHES0
;
5548 shorten_branches (first
);
5551 /* Scan the function looking for move instructions which have to be
5552 changed to pc-relative loads and insert the literal tables. */
5553 label_ref_list_pool
= create_alloc_pool ("label references list",
5554 sizeof (struct label_ref_list_d
),
5556 mdep_reorg_phase
= SH_FIXUP_PCLOAD
;
5557 for (insn
= first
, num_mova
= 0; insn
; insn
= NEXT_INSN (insn
))
5561 /* ??? basic block reordering can move a switch table dispatch
5562 below the switch table. Check if that has happened.
5563 We only have the addresses available when optimizing; but then,
5564 this check shouldn't be needed when not optimizing. */
5565 if (!untangle_mova (&num_mova
, &mova
, insn
))
5571 else if (JUMP_P (insn
)
5572 && GET_CODE (PATTERN (insn
)) == ADDR_DIFF_VEC
5574 /* ??? loop invariant motion can also move a mova out of a
5575 loop. Since loop does this code motion anyway, maybe we
5576 should wrap UNSPEC_MOVA into a CONST, so that reload can
5579 && GET_MODE (prev_nonnote_insn (insn
)) == VOIDmode
)
5580 || (prev_nonnote_insn (insn
)
5581 == XEXP (MOVA_LABELREF (mova
), 0))))
5588 /* Some code might have been inserted between the mova and
5589 its ADDR_DIFF_VEC. Check if the mova is still in range. */
5590 for (scan
= mova
, total
= 0; scan
!= insn
; scan
= NEXT_INSN (scan
))
5591 total
+= get_attr_length (scan
);
5593 /* range of mova is 1020, add 4 because pc counts from address of
5594 second instruction after this one, subtract 2 in case pc is 2
5595 byte aligned. Possible alignment needed for the ADDR_DIFF_VEC
5596 cancels out with alignment effects of the mova itself. */
5599 /* Change the mova into a load, and restart scanning
5600 there. broken_move will then return true for mova. */
5605 if (broken_move (insn
)
5606 || (NONJUMP_INSN_P (insn
)
5607 && recog_memoized (insn
) == CODE_FOR_casesi_worker_2
))
5610 /* Scan ahead looking for a barrier to stick the constant table
5612 rtx barrier
= find_barrier (num_mova
, mova
, insn
);
5613 rtx last_float_move
= NULL_RTX
, last_float
= 0, *last_float_addr
= NULL
;
5614 int need_aligned_label
= 0;
5616 if (num_mova
&& ! mova_p (mova
))
5618 /* find_barrier had to change the first mova into a
5619 pcload; thus, we have to start with this new pcload. */
5623 /* Now find all the moves between the points and modify them. */
5624 for (scan
= insn
; scan
!= barrier
; scan
= NEXT_INSN (scan
))
5628 if (NONJUMP_INSN_P (scan
)
5629 && recog_memoized (scan
) == CODE_FOR_casesi_worker_2
)
5630 need_aligned_label
= 1;
5631 if (broken_move (scan
))
5633 rtx
*patp
= &PATTERN (scan
), pat
= *patp
;
5637 enum machine_mode mode
;
5639 if (GET_CODE (pat
) == PARALLEL
)
5640 patp
= &XVECEXP (pat
, 0, 0), pat
= *patp
;
5641 src
= SET_SRC (pat
);
5642 dst
= SET_DEST (pat
);
5643 mode
= GET_MODE (dst
);
5645 if (mode
== SImode
&& hi_const (src
)
5646 && REGNO (dst
) != FPUL_REG
)
5651 while (GET_CODE (dst
) == SUBREG
)
5653 offset
+= subreg_regno_offset (REGNO (SUBREG_REG (dst
)),
5654 GET_MODE (SUBREG_REG (dst
)),
5657 dst
= SUBREG_REG (dst
);
5659 dst
= gen_rtx_REG (HImode
, REGNO (dst
) + offset
);
5661 if (REG_P (dst
) && FP_ANY_REGISTER_P (REGNO (dst
)))
5663 /* This must be an insn that clobbers r0. */
5664 rtx
*clobberp
= &XVECEXP (PATTERN (scan
), 0,
5665 XVECLEN (PATTERN (scan
), 0)
5667 rtx clobber
= *clobberp
;
5669 gcc_assert (GET_CODE (clobber
) == CLOBBER
5670 && rtx_equal_p (XEXP (clobber
, 0), r0_rtx
));
5673 && reg_set_between_p (r0_rtx
, last_float_move
, scan
))
5677 && GET_MODE_SIZE (mode
) != 4
5678 && GET_MODE_SIZE (GET_MODE (last_float
)) == 4)
5680 lab
= add_constant (src
, mode
, last_float
);
5682 emit_insn_before (gen_mova (lab
), scan
);
5685 /* There will be a REG_UNUSED note for r0 on
5686 LAST_FLOAT_MOVE; we have to change it to REG_INC,
5687 lest reorg:mark_target_live_regs will not
5688 consider r0 to be used, and we end up with delay
5689 slot insn in front of SCAN that clobbers r0. */
5691 = find_regno_note (last_float_move
, REG_UNUSED
, 0);
5693 /* If we are not optimizing, then there may not be
5696 PUT_REG_NOTE_KIND (note
, REG_INC
);
5698 *last_float_addr
= r0_inc_rtx
;
5700 last_float_move
= scan
;
5702 newsrc
= gen_const_mem (mode
,
5703 (((TARGET_SH4
&& ! TARGET_FMOVD
)
5704 || REGNO (dst
) == FPUL_REG
)
5707 last_float_addr
= &XEXP (newsrc
, 0);
5709 /* Remove the clobber of r0. */
5710 *clobberp
= gen_rtx_CLOBBER (GET_MODE (clobber
),
5711 gen_rtx_SCRATCH (Pmode
));
5713 /* This is a mova needing a label. Create it. */
5714 else if (GET_CODE (src
) == UNSPEC
5715 && XINT (src
, 1) == UNSPEC_MOVA
5716 && GET_CODE (XVECEXP (src
, 0, 0)) == CONST
)
5718 lab
= add_constant (XVECEXP (src
, 0, 0), mode
, 0);
5719 newsrc
= gen_rtx_LABEL_REF (VOIDmode
, lab
);
5720 newsrc
= gen_rtx_UNSPEC (SImode
,
5721 gen_rtvec (1, newsrc
),
5726 lab
= add_constant (src
, mode
, 0);
5727 newsrc
= gen_rtx_LABEL_REF (VOIDmode
, lab
);
5728 newsrc
= gen_const_mem (mode
, newsrc
);
5730 *patp
= gen_rtx_SET (VOIDmode
, dst
, newsrc
);
5731 INSN_CODE (scan
) = -1;
5734 dump_table (need_aligned_label
? insn
: 0, barrier
);
5738 free_alloc_pool (label_ref_list_pool
);
5739 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5740 PUT_MODE (insn
, VOIDmode
);
5742 mdep_reorg_phase
= SH_SHORTEN_BRANCHES1
;
5743 INSN_ADDRESSES_FREE ();
5744 split_branches (first
);
5746 /* The INSN_REFERENCES_ARE_DELAYED in sh.h is problematic because it
5747 also has an effect on the register that holds the address of the sfunc.
5748 Insert an extra dummy insn in front of each sfunc that pretends to
5749 use this register. */
5750 if (flag_delayed_branch
)
5752 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5754 rtx reg
= sfunc_uses_reg (insn
);
5758 emit_insn_before (gen_use_sfunc_addr (reg
), insn
);
5762 /* fpscr is not actually a user variable, but we pretend it is for the
5763 sake of the previous optimization passes, since we want it handled like
5764 one. However, we don't have any debugging information for it, so turn
5765 it into a non-user variable now. */
5767 REG_USERVAR_P (get_fpscr_rtx ()) = 0;
5769 mdep_reorg_phase
= SH_AFTER_MDEP_REORG
;
5773 get_dest_uid (rtx label
, int max_uid
)
5775 rtx dest
= next_real_insn (label
);
5778 /* This can happen for an undefined label. */
5780 dest_uid
= INSN_UID (dest
);
5781 /* If this is a newly created branch redirection blocking instruction,
5782 we cannot index the branch_uid or insn_addresses arrays with its
5783 uid. But then, we won't need to, because the actual destination is
5784 the following branch. */
5785 while (dest_uid
>= max_uid
)
5787 dest
= NEXT_INSN (dest
);
5788 dest_uid
= INSN_UID (dest
);
5790 if (JUMP_P (dest
) && GET_CODE (PATTERN (dest
)) == RETURN
)
5795 /* Split condbranches that are out of range. Also add clobbers for
5796 scratch registers that are needed in far jumps.
5797 We do this before delay slot scheduling, so that it can take our
5798 newly created instructions into account. It also allows us to
5799 find branches with common targets more easily. */
5802 split_branches (rtx first
)
5805 struct far_branch
**uid_branch
, *far_branch_list
= 0;
5806 int max_uid
= get_max_uid ();
5809 /* Find out which branches are out of range. */
5810 shorten_branches (first
);
5812 uid_branch
= (struct far_branch
**) alloca (max_uid
* sizeof *uid_branch
);
5813 memset ((char *) uid_branch
, 0, max_uid
* sizeof *uid_branch
);
5815 for (insn
= first
; insn
; insn
= NEXT_INSN (insn
))
5816 if (! INSN_P (insn
))
5818 else if (INSN_DELETED_P (insn
))
5820 /* Shorten_branches would split this instruction again,
5821 so transform it into a note. */
5822 SET_INSN_DELETED (insn
);
5824 else if (JUMP_P (insn
)
5825 /* Don't mess with ADDR_DIFF_VEC */
5826 && (GET_CODE (PATTERN (insn
)) == SET
5827 || GET_CODE (PATTERN (insn
)) == RETURN
))
5829 enum attr_type type
= get_attr_type (insn
);
5830 if (type
== TYPE_CBRANCH
)
5834 if (get_attr_length (insn
) > 4)
5836 rtx src
= SET_SRC (PATTERN (insn
));
5837 rtx olabel
= XEXP (XEXP (src
, 1), 0);
5838 int addr
= INSN_ADDRESSES (INSN_UID (insn
));
5840 int dest_uid
= get_dest_uid (olabel
, max_uid
);
5841 struct far_branch
*bp
= uid_branch
[dest_uid
];
5843 /* redirect_jump needs a valid JUMP_LABEL, and it might delete
5844 the label if the LABEL_NUSES count drops to zero. There is
5845 always a jump_optimize pass that sets these values, but it
5846 proceeds to delete unreferenced code, and then if not
5847 optimizing, to un-delete the deleted instructions, thus
5848 leaving labels with too low uses counts. */
5851 JUMP_LABEL (insn
) = olabel
;
5852 LABEL_NUSES (olabel
)++;
5856 bp
= (struct far_branch
*) alloca (sizeof *bp
);
5857 uid_branch
[dest_uid
] = bp
;
5858 bp
->prev
= far_branch_list
;
5859 far_branch_list
= bp
;
5861 = XEXP (XEXP (SET_SRC (PATTERN (insn
)), 1), 0);
5862 LABEL_NUSES (bp
->far_label
)++;
5866 label
= bp
->near_label
;
5867 if (! label
&& bp
->address
- addr
>= CONDJUMP_MIN
)
5869 rtx block
= bp
->insert_place
;
5871 if (GET_CODE (PATTERN (block
)) == RETURN
)
5872 block
= PREV_INSN (block
);
5874 block
= gen_block_redirect (block
,
5876 label
= emit_label_after (gen_label_rtx (),
5878 bp
->near_label
= label
;
5880 else if (label
&& ! NEXT_INSN (label
))
5882 if (addr
+ 2 - bp
->address
<= CONDJUMP_MAX
)
5883 bp
->insert_place
= insn
;
5885 gen_far_branch (bp
);
5889 || (NEXT_INSN (label
) && bp
->address
- addr
< CONDJUMP_MIN
))
5891 bp
->near_label
= label
= gen_label_rtx ();
5892 bp
->insert_place
= insn
;
5895 ok
= redirect_jump (insn
, label
, 0);
5900 /* get_attr_length (insn) == 2 */
5901 /* Check if we have a pattern where reorg wants to redirect
5902 the branch to a label from an unconditional branch that
5904 /* We can't use JUMP_LABEL here because it might be undefined
5905 when not optimizing. */
5906 /* A syntax error might cause beyond to be NULL_RTX. */
5908 = next_active_insn (XEXP (XEXP (SET_SRC (PATTERN (insn
)), 1),
5913 || ((beyond
= next_active_insn (beyond
))
5914 && JUMP_P (beyond
)))
5915 && GET_CODE (PATTERN (beyond
)) == SET
5916 && recog_memoized (beyond
) == CODE_FOR_jump_compact
5918 (INSN_UID (XEXP (SET_SRC (PATTERN (beyond
)), 0)))
5919 - INSN_ADDRESSES (INSN_UID (insn
)) + (unsigned) 252)
5921 gen_block_redirect (beyond
,
5922 INSN_ADDRESSES (INSN_UID (beyond
)), 1);
5925 next
= next_active_insn (insn
);
5929 || ((next
= next_active_insn (next
))
5931 && GET_CODE (PATTERN (next
)) == SET
5932 && recog_memoized (next
) == CODE_FOR_jump_compact
5934 (INSN_UID (XEXP (SET_SRC (PATTERN (next
)), 0)))
5935 - INSN_ADDRESSES (INSN_UID (insn
)) + (unsigned) 252)
5937 gen_block_redirect (next
, INSN_ADDRESSES (INSN_UID (next
)), 1);
5939 else if (type
== TYPE_JUMP
|| type
== TYPE_RETURN
)
5941 int addr
= INSN_ADDRESSES (INSN_UID (insn
));
5944 struct far_branch
*bp
;
5946 if (type
== TYPE_JUMP
)
5948 far_label
= XEXP (SET_SRC (PATTERN (insn
)), 0);
5949 dest_uid
= get_dest_uid (far_label
, max_uid
);
5952 /* Parse errors can lead to labels outside
5954 if (! NEXT_INSN (far_label
))
5959 JUMP_LABEL (insn
) = far_label
;
5960 LABEL_NUSES (far_label
)++;
5962 redirect_jump (insn
, NULL_RTX
, 1);
5966 bp
= uid_branch
[dest_uid
];
5969 bp
= (struct far_branch
*) alloca (sizeof *bp
);
5970 uid_branch
[dest_uid
] = bp
;
5971 bp
->prev
= far_branch_list
;
5972 far_branch_list
= bp
;
5974 bp
->far_label
= far_label
;
5976 LABEL_NUSES (far_label
)++;
5978 else if (bp
->near_label
&& ! NEXT_INSN (bp
->near_label
))
5979 if (addr
- bp
->address
<= CONDJUMP_MAX
)
5980 emit_label_after (bp
->near_label
, PREV_INSN (insn
));
5983 gen_far_branch (bp
);
5989 bp
->insert_place
= insn
;
5991 emit_insn_before (gen_block_branch_redirect (const0_rtx
), insn
);
5993 gen_block_redirect (insn
, addr
, bp
->near_label
? 2 : 0);
5996 /* Generate all pending far branches,
5997 and free our references to the far labels. */
5998 while (far_branch_list
)
6000 if (far_branch_list
->near_label
6001 && ! NEXT_INSN (far_branch_list
->near_label
))
6002 gen_far_branch (far_branch_list
);
6004 && far_branch_list
->far_label
6005 && ! --LABEL_NUSES (far_branch_list
->far_label
))
6006 delete_insn (far_branch_list
->far_label
);
6007 far_branch_list
= far_branch_list
->prev
;
6010 /* Instruction length information is no longer valid due to the new
6011 instructions that have been generated. */
6012 init_insn_lengths ();
6015 /* Dump out instruction addresses, which is useful for debugging the
6016 constant pool table stuff.
6018 If relaxing, output the label and pseudo-ops used to link together
6019 calls and the instruction which set the registers. */
6021 /* ??? The addresses printed by this routine for insns are nonsense for
6022 insns which are inside of a sequence where none of the inner insns have
6023 variable length. This is because the second pass of shorten_branches
6024 does not bother to update them. */
6027 final_prescan_insn (rtx insn
, rtx
*opvec ATTRIBUTE_UNUSED
,
6028 int noperands ATTRIBUTE_UNUSED
)
6030 if (TARGET_DUMPISIZE
)
6031 fprintf (asm_out_file
, "\n! at %04x\n", INSN_ADDRESSES (INSN_UID (insn
)));
6037 note
= find_reg_note (insn
, REG_LABEL_OPERAND
, NULL_RTX
);
6042 pattern
= PATTERN (insn
);
6043 if (GET_CODE (pattern
) == PARALLEL
)
6044 pattern
= XVECEXP (pattern
, 0, 0);
6045 switch (GET_CODE (pattern
))
6048 if (GET_CODE (SET_SRC (pattern
)) != CALL
6049 && get_attr_type (insn
) != TYPE_SFUNC
)
6051 targetm
.asm_out
.internal_label
6052 (asm_out_file
, "L", CODE_LABEL_NUMBER (XEXP (note
, 0)));
6055 /* else FALLTHROUGH */
6057 asm_fprintf (asm_out_file
, "\t.uses %LL%d\n",
6058 CODE_LABEL_NUMBER (XEXP (note
, 0)));
6068 /* Dump out any constants accumulated in the final pass. These will
6072 output_jump_label_table (void)
6078 fprintf (asm_out_file
, "\t.align 2\n");
6079 for (i
= 0; i
< pool_size
; i
++)
6081 pool_node
*p
= &pool_vector
[i
];
6083 (*targetm
.asm_out
.internal_label
) (asm_out_file
, "L",
6084 CODE_LABEL_NUMBER (p
->label
));
6085 output_asm_insn (".long %O0", &p
->value
);
6093 /* A full frame looks like:
6097 [ if current_function_anonymous_args
6110 local-0 <- fp points here. */
6112 /* Number of bytes pushed for anonymous args, used to pass information
6113 between expand_prologue and expand_epilogue. */
6115 /* Adjust the stack by SIZE bytes. REG holds the rtl of the register to be
6116 adjusted. If epilogue_p is zero, this is for a prologue; otherwise, it's
6117 for an epilogue and a negative value means that it's for a sibcall
6118 epilogue. If LIVE_REGS_MASK is nonzero, it points to a HARD_REG_SET of
6119 all the registers that are about to be restored, and hence dead. */
6122 output_stack_adjust (int size
, rtx reg
, int epilogue_p
,
6123 HARD_REG_SET
*live_regs_mask
, bool frame_p
)
6125 rtx (*emit_fn
) (rtx
) = frame_p
? &frame_insn
: &emit_insn
;
6128 HOST_WIDE_INT align
= STACK_BOUNDARY
/ BITS_PER_UNIT
;
6130 /* This test is bogus, as output_stack_adjust is used to re-align the
6133 gcc_assert (!(size
% align
));
6136 if (CONST_OK_FOR_ADD (size
))
6137 emit_fn (GEN_ADD3 (reg
, reg
, GEN_INT (size
)));
6138 /* Try to do it with two partial adjustments; however, we must make
6139 sure that the stack is properly aligned at all times, in case
6140 an interrupt occurs between the two partial adjustments. */
6141 else if (CONST_OK_FOR_ADD (size
/ 2 & -align
)
6142 && CONST_OK_FOR_ADD (size
- (size
/ 2 & -align
)))
6144 emit_fn (GEN_ADD3 (reg
, reg
, GEN_INT (size
/ 2 & -align
)));
6145 emit_fn (GEN_ADD3 (reg
, reg
, GEN_INT (size
- (size
/ 2 & -align
))));
6151 int temp
= epilogue_p
? 7 : (TARGET_SH5
? 0 : 1);
6154 /* If TEMP is invalid, we could temporarily save a general
6155 register to MACL. However, there is currently no need
6156 to handle this case, so just die when we see it. */
6158 || current_function_interrupt
6159 || ! call_really_used_regs
[temp
] || fixed_regs
[temp
])
6161 if (temp
< 0 && ! current_function_interrupt
6162 && (TARGET_SHMEDIA
|| epilogue_p
>= 0))
6165 COPY_HARD_REG_SET (temps
, call_used_reg_set
);
6166 AND_COMPL_HARD_REG_SET (temps
, call_fixed_reg_set
);
6170 if (crtl
->return_rtx
)
6172 enum machine_mode mode
;
6173 mode
= GET_MODE (crtl
->return_rtx
);
6174 if (BASE_RETURN_VALUE_REG (mode
) == FIRST_RET_REG
)
6175 nreg
= HARD_REGNO_NREGS (FIRST_RET_REG
, mode
);
6177 for (i
= 0; i
< nreg
; i
++)
6178 CLEAR_HARD_REG_BIT (temps
, FIRST_RET_REG
+ i
);
6179 if (crtl
->calls_eh_return
)
6181 CLEAR_HARD_REG_BIT (temps
, EH_RETURN_STACKADJ_REGNO
);
6182 for (i
= 0; i
<= 3; i
++)
6183 CLEAR_HARD_REG_BIT (temps
, EH_RETURN_DATA_REGNO (i
));
6186 if (TARGET_SHMEDIA
&& epilogue_p
< 0)
6187 for (i
= FIRST_TARGET_REG
; i
<= LAST_TARGET_REG
; i
++)
6188 CLEAR_HARD_REG_BIT (temps
, i
);
6189 if (epilogue_p
<= 0)
6191 for (i
= FIRST_PARM_REG
;
6192 i
< FIRST_PARM_REG
+ NPARM_REGS (SImode
); i
++)
6193 CLEAR_HARD_REG_BIT (temps
, i
);
6194 if (cfun
->static_chain_decl
!= NULL
)
6195 CLEAR_HARD_REG_BIT (temps
, STATIC_CHAIN_REGNUM
);
6197 temp
= scavenge_reg (&temps
);
6199 if (temp
< 0 && live_regs_mask
)
6203 COPY_HARD_REG_SET (temps
, *live_regs_mask
);
6204 CLEAR_HARD_REG_BIT (temps
, REGNO (reg
));
6205 temp
= scavenge_reg (&temps
);
6209 rtx adj_reg
, tmp_reg
, mem
;
6211 /* If we reached here, the most likely case is the (sibcall)
6212 epilogue for non SHmedia. Put a special push/pop sequence
6213 for such case as the last resort. This looks lengthy but
6214 would not be problem because it seems to be very
6217 gcc_assert (!TARGET_SHMEDIA
&& epilogue_p
);
6220 /* ??? There is still the slight possibility that r4 or
6221 r5 have been reserved as fixed registers or assigned
6222 as global registers, and they change during an
6223 interrupt. There are possible ways to handle this:
6225 - If we are adjusting the frame pointer (r14), we can do
6226 with a single temp register and an ordinary push / pop
6228 - Grab any call-used or call-saved registers (i.e. not
6229 fixed or globals) for the temps we need. We might
6230 also grab r14 if we are adjusting the stack pointer.
6231 If we can't find enough available registers, issue
6232 a diagnostic and die - the user must have reserved
6233 way too many registers.
6234 But since all this is rather unlikely to happen and
6235 would require extra testing, we just die if r4 / r5
6236 are not available. */
6237 gcc_assert (!fixed_regs
[4] && !fixed_regs
[5]
6238 && !global_regs
[4] && !global_regs
[5]);
6240 adj_reg
= gen_rtx_REG (GET_MODE (reg
), 4);
6241 tmp_reg
= gen_rtx_REG (GET_MODE (reg
), 5);
6242 emit_move_insn (gen_tmp_stack_mem (Pmode
, reg
), adj_reg
);
6243 emit_insn (GEN_MOV (adj_reg
, GEN_INT (size
)));
6244 emit_insn (GEN_ADD3 (adj_reg
, adj_reg
, reg
));
6245 mem
= gen_tmp_stack_mem (Pmode
, gen_rtx_PRE_DEC (Pmode
, adj_reg
));
6246 emit_move_insn (mem
, tmp_reg
);
6247 emit_move_insn (tmp_reg
, gen_tmp_stack_mem (Pmode
, reg
));
6248 mem
= gen_tmp_stack_mem (Pmode
, gen_rtx_PRE_DEC (Pmode
, adj_reg
));
6249 emit_move_insn (mem
, tmp_reg
);
6250 emit_move_insn (reg
, adj_reg
);
6251 mem
= gen_tmp_stack_mem (Pmode
, gen_rtx_POST_INC (Pmode
, reg
));
6252 emit_move_insn (adj_reg
, mem
);
6253 mem
= gen_tmp_stack_mem (Pmode
, gen_rtx_POST_INC (Pmode
, reg
));
6254 emit_move_insn (tmp_reg
, mem
);
6255 /* Tell flow the insns that pop r4/r5 aren't dead. */
6260 const_reg
= gen_rtx_REG (GET_MODE (reg
), temp
);
6262 /* If SIZE is negative, subtract the positive value.
6263 This sometimes allows a constant pool entry to be shared
6264 between prologue and epilogue code. */
6267 emit_insn (GEN_MOV (const_reg
, GEN_INT (-size
)));
6268 insn
= emit_fn (GEN_SUB3 (reg
, reg
, const_reg
));
6272 emit_insn (GEN_MOV (const_reg
, GEN_INT (size
)));
6273 insn
= emit_fn (GEN_ADD3 (reg
, reg
, const_reg
));
6276 add_reg_note (insn
, REG_FRAME_RELATED_EXPR
,
6277 gen_rtx_SET (VOIDmode
, reg
,
6278 gen_rtx_PLUS (SImode
, reg
,
6288 RTX_FRAME_RELATED_P (x
) = 1;
6292 /* Output RTL to push register RN onto the stack. */
6299 x
= gen_push_fpul ();
6300 else if (rn
== FPSCR_REG
)
6301 x
= gen_push_fpscr ();
6302 else if ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && TARGET_FMOVD
&& ! TARGET_FPU_SINGLE
6303 && FP_OR_XD_REGISTER_P (rn
))
6305 if (FP_REGISTER_P (rn
) && (rn
- FIRST_FP_REG
) & 1)
6307 x
= gen_push_4 (gen_rtx_REG (DFmode
, rn
));
6309 else if (TARGET_SH2E
&& FP_REGISTER_P (rn
))
6310 x
= gen_push_e (gen_rtx_REG (SFmode
, rn
));
6312 x
= gen_push (gen_rtx_REG (SImode
, rn
));
6315 add_reg_note (x
, REG_INC
, gen_rtx_REG (SImode
, STACK_POINTER_REGNUM
));
6319 /* Output RTL to pop register RN from the stack. */
6326 x
= gen_pop_fpul ();
6327 else if (rn
== FPSCR_REG
)
6328 x
= gen_pop_fpscr ();
6329 else if ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && TARGET_FMOVD
&& ! TARGET_FPU_SINGLE
6330 && FP_OR_XD_REGISTER_P (rn
))
6332 if (FP_REGISTER_P (rn
) && (rn
- FIRST_FP_REG
) & 1)
6334 x
= gen_pop_4 (gen_rtx_REG (DFmode
, rn
));
6336 else if (TARGET_SH2E
&& FP_REGISTER_P (rn
))
6337 x
= gen_pop_e (gen_rtx_REG (SFmode
, rn
));
6339 x
= gen_pop (gen_rtx_REG (SImode
, rn
));
6342 add_reg_note (x
, REG_INC
, gen_rtx_REG (SImode
, STACK_POINTER_REGNUM
));
6345 /* Generate code to push the regs specified in the mask. */
6348 push_regs (HARD_REG_SET
*mask
, int interrupt_handler
)
6350 int i
= interrupt_handler
? LAST_BANKED_REG
+ 1 : 0;
6353 /* Push PR last; this gives better latencies after the prologue, and
6354 candidates for the return delay slot when there are no general
6355 registers pushed. */
6356 for (; i
< FIRST_PSEUDO_REGISTER
; i
++)
6358 /* If this is an interrupt handler, and the SZ bit varies,
6359 and we have to push any floating point register, we need
6360 to switch to the correct precision first. */
6361 if (i
== FIRST_FP_REG
&& interrupt_handler
&& TARGET_FMOVD
6362 && hard_reg_set_intersect_p (*mask
, reg_class_contents
[DF_REGS
]))
6364 HARD_REG_SET unsaved
;
6367 COMPL_HARD_REG_SET (unsaved
, *mask
);
6368 fpscr_set_from_mem (NORMAL_MODE (FP_MODE
), unsaved
);
6372 && (i
!= FPSCR_REG
|| ! skip_fpscr
)
6373 && TEST_HARD_REG_BIT (*mask
, i
))
6375 /* If the ISR has RESBANK attribute assigned, don't push any of
6376 the following registers - R0-R14, MACH, MACL and GBR. */
6377 if (! (sh_cfun_resbank_handler_p ()
6378 && ((i
>= FIRST_GENERAL_REG
&& i
< LAST_GENERAL_REG
)
6386 /* Push banked registers last to improve delay slot opportunities. */
6387 if (interrupt_handler
)
6388 for (i
= FIRST_BANKED_REG
; i
<= LAST_BANKED_REG
; i
++)
6389 if (TEST_HARD_REG_BIT (*mask
, i
))
6392 /* Don't push PR register for an ISR with RESBANK attribute assigned. */
6393 if (TEST_HARD_REG_BIT (*mask
, PR_REG
) && !sh_cfun_resbank_handler_p ())
6397 /* Calculate how much extra space is needed to save all callee-saved
6399 LIVE_REGS_MASK is the register mask calculated by calc_live_regs. */
6402 shmedia_target_regs_stack_space (HARD_REG_SET
*live_regs_mask
)
6405 int stack_space
= 0;
6406 int interrupt_handler
= sh_cfun_interrupt_handler_p ();
6408 for (reg
= LAST_TARGET_REG
; reg
>= FIRST_TARGET_REG
; reg
--)
6409 if ((! call_really_used_regs
[reg
] || interrupt_handler
)
6410 && ! TEST_HARD_REG_BIT (*live_regs_mask
, reg
))
6411 /* Leave space to save this target register on the stack,
6412 in case target register allocation wants to use it. */
6413 stack_space
+= GET_MODE_SIZE (REGISTER_NATURAL_MODE (reg
));
6417 /* Decide whether we should reserve space for callee-save target registers,
6418 in case target register allocation wants to use them. REGS_SAVED is
6419 the space, in bytes, that is already required for register saves.
6420 LIVE_REGS_MASK is the register mask calculated by calc_live_regs. */
6423 shmedia_reserve_space_for_target_registers_p (int regs_saved
,
6424 HARD_REG_SET
*live_regs_mask
)
6428 return shmedia_target_regs_stack_space (live_regs_mask
) <= regs_saved
;
6431 /* Decide how much space to reserve for callee-save target registers
6432 in case target register allocation wants to use them.
6433 LIVE_REGS_MASK is the register mask calculated by calc_live_regs. */
6436 shmedia_target_regs_stack_adjust (HARD_REG_SET
*live_regs_mask
)
6438 if (shmedia_space_reserved_for_target_registers
)
6439 return shmedia_target_regs_stack_space (live_regs_mask
);
6444 /* Work out the registers which need to be saved, both as a mask and a
6445 count of saved words. Return the count.
6447 If doing a pragma interrupt function, then push all regs used by the
6448 function, and if we call another function (we can tell by looking at PR),
6449 make sure that all the regs it clobbers are safe too. */
6452 calc_live_regs (HARD_REG_SET
*live_regs_mask
)
6457 bool interrupt_or_trapa_handler
, trapa_handler
, interrupt_handler
;
6458 bool nosave_low_regs
;
6459 int pr_live
, has_call
;
6461 attrs
= DECL_ATTRIBUTES (current_function_decl
);
6462 interrupt_or_trapa_handler
= sh_cfun_interrupt_handler_p ();
6463 trapa_handler
= lookup_attribute ("trapa_handler", attrs
) != NULL_TREE
;
6464 interrupt_handler
= interrupt_or_trapa_handler
&& ! trapa_handler
;
6465 nosave_low_regs
= lookup_attribute ("nosave_low_regs", attrs
) != NULL_TREE
;
6467 CLEAR_HARD_REG_SET (*live_regs_mask
);
6468 if ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && TARGET_FMOVD
&& interrupt_handler
6469 && df_regs_ever_live_p (FPSCR_REG
))
6470 target_flags
&= ~MASK_FPU_SINGLE
;
6471 /* If we can save a lot of saves by switching to double mode, do that. */
6472 else if ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && TARGET_FMOVD
&& TARGET_FPU_SINGLE
)
6473 for (count
= 0, reg
= FIRST_FP_REG
; reg
<= LAST_FP_REG
; reg
+= 2)
6474 if (df_regs_ever_live_p (reg
) && df_regs_ever_live_p (reg
+1)
6475 && (! call_really_used_regs
[reg
]
6476 || interrupt_handler
)
6479 target_flags
&= ~MASK_FPU_SINGLE
;
6482 /* PR_MEDIA_REG is a general purpose register, thus global_alloc already
6483 knows how to use it. That means the pseudo originally allocated for
6484 the initial value can become the PR_MEDIA_REG hard register, as seen for
6485 execute/20010122-1.c:test9. */
6487 /* ??? this function is called from initial_elimination_offset, hence we
6488 can't use the result of sh_media_register_for_return here. */
6489 pr_live
= sh_pr_n_sets ();
6492 rtx pr_initial
= has_hard_reg_initial_val (Pmode
, PR_REG
);
6493 pr_live
= (pr_initial
6494 ? (!REG_P (pr_initial
)
6495 || REGNO (pr_initial
) != (PR_REG
))
6496 : df_regs_ever_live_p (PR_REG
));
6497 /* For Shcompact, if not optimizing, we end up with a memory reference
6498 using the return address pointer for __builtin_return_address even
6499 though there is no actual need to put the PR register on the stack. */
6500 pr_live
|= df_regs_ever_live_p (RETURN_ADDRESS_POINTER_REGNUM
);
6502 /* Force PR to be live if the prologue has to call the SHmedia
6503 argument decoder or register saver. */
6504 if (TARGET_SHCOMPACT
6505 && ((crtl
->args
.info
.call_cookie
6506 & ~ CALL_COOKIE_RET_TRAMP (1))
6507 || crtl
->saves_all_registers
))
6509 has_call
= TARGET_SHMEDIA
? ! leaf_function_p () : pr_live
;
6510 for (count
= 0, reg
= FIRST_PSEUDO_REGISTER
; reg
-- != 0; )
6512 if (reg
== (TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
)
6515 ? (/* Need to save all the regs ever live. */
6516 (df_regs_ever_live_p (reg
)
6517 || (call_really_used_regs
[reg
]
6518 && (! fixed_regs
[reg
] || reg
== MACH_REG
|| reg
== MACL_REG
6519 || reg
== PIC_OFFSET_TABLE_REGNUM
)
6521 || (TARGET_SHMEDIA
&& has_call
6522 && REGISTER_NATURAL_MODE (reg
) == SImode
6523 && (GENERAL_REGISTER_P (reg
) || TARGET_REGISTER_P (reg
))))
6524 && reg
!= STACK_POINTER_REGNUM
&& reg
!= ARG_POINTER_REGNUM
6525 && reg
!= RETURN_ADDRESS_POINTER_REGNUM
6526 && reg
!= T_REG
&& reg
!= GBR_REG
6527 /* Push fpscr only on targets which have FPU */
6528 && (reg
!= FPSCR_REG
|| TARGET_FPU_ANY
))
6529 : (/* Only push those regs which are used and need to be saved. */
6532 && crtl
->args
.info
.call_cookie
6533 && reg
== PIC_OFFSET_TABLE_REGNUM
)
6534 || (df_regs_ever_live_p (reg
)
6535 && ((!call_really_used_regs
[reg
]
6536 && !(reg
!= PIC_OFFSET_TABLE_REGNUM
6537 && fixed_regs
[reg
] && call_used_regs
[reg
]))
6538 || (trapa_handler
&& reg
== FPSCR_REG
&& TARGET_FPU_ANY
)))
6539 || (crtl
->calls_eh_return
6540 && (reg
== EH_RETURN_DATA_REGNO (0)
6541 || reg
== EH_RETURN_DATA_REGNO (1)
6542 || reg
== EH_RETURN_DATA_REGNO (2)
6543 || reg
== EH_RETURN_DATA_REGNO (3)))
6544 || ((reg
== MACL_REG
|| reg
== MACH_REG
)
6545 && df_regs_ever_live_p (reg
)
6546 && sh_cfun_attr_renesas_p ())
6549 SET_HARD_REG_BIT (*live_regs_mask
, reg
);
6550 count
+= GET_MODE_SIZE (REGISTER_NATURAL_MODE (reg
));
6552 if ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
|| TARGET_SH5
) && TARGET_FMOVD
6553 && GET_MODE_CLASS (REGISTER_NATURAL_MODE (reg
)) == MODE_FLOAT
)
6555 if (FP_REGISTER_P (reg
))
6557 if (! TARGET_FPU_SINGLE
&& ! df_regs_ever_live_p (reg
^ 1))
6559 SET_HARD_REG_BIT (*live_regs_mask
, (reg
^ 1));
6560 count
+= GET_MODE_SIZE (REGISTER_NATURAL_MODE (reg
^ 1));
6563 else if (XD_REGISTER_P (reg
))
6565 /* Must switch to double mode to access these registers. */
6566 target_flags
&= ~MASK_FPU_SINGLE
;
6570 if (nosave_low_regs
&& reg
== R8_REG
)
6573 /* If we have a target register optimization pass after prologue / epilogue
6574 threading, we need to assume all target registers will be live even if
6576 if (flag_branch_target_load_optimize2
6577 && TARGET_SAVE_ALL_TARGET_REGS
6578 && shmedia_space_reserved_for_target_registers
)
6579 for (reg
= LAST_TARGET_REG
; reg
>= FIRST_TARGET_REG
; reg
--)
6580 if ((! call_really_used_regs
[reg
] || interrupt_handler
)
6581 && ! TEST_HARD_REG_BIT (*live_regs_mask
, reg
))
6583 SET_HARD_REG_BIT (*live_regs_mask
, reg
);
6584 count
+= GET_MODE_SIZE (REGISTER_NATURAL_MODE (reg
));
6586 /* If this is an interrupt handler, we don't have any call-clobbered
6587 registers we can conveniently use for target register save/restore.
6588 Make sure we save at least one general purpose register when we need
6589 to save target registers. */
6590 if (interrupt_handler
6591 && hard_reg_set_intersect_p (*live_regs_mask
,
6592 reg_class_contents
[TARGET_REGS
])
6593 && ! hard_reg_set_intersect_p (*live_regs_mask
,
6594 reg_class_contents
[GENERAL_REGS
]))
6596 SET_HARD_REG_BIT (*live_regs_mask
, R0_REG
);
6597 count
+= GET_MODE_SIZE (REGISTER_NATURAL_MODE (R0_REG
));
6603 /* Code to generate prologue and epilogue sequences */
6605 /* PUSHED is the number of bytes that are being pushed on the
6606 stack for register saves. Return the frame size, padded
6607 appropriately so that the stack stays properly aligned. */
6608 static HOST_WIDE_INT
6609 rounded_frame_size (int pushed
)
6611 HOST_WIDE_INT size
= get_frame_size ();
6612 HOST_WIDE_INT align
= STACK_BOUNDARY
/ BITS_PER_UNIT
;
6614 if (ACCUMULATE_OUTGOING_ARGS
)
6615 size
+= crtl
->outgoing_args_size
;
6617 return ((size
+ pushed
+ align
- 1) & -align
) - pushed
;
6620 /* Choose a call-clobbered target-branch register that remains
6621 unchanged along the whole function. We set it up as the return
6622 value in the prologue. */
6624 sh_media_register_for_return (void)
6629 if (! current_function_is_leaf
)
6631 if (lookup_attribute ("interrupt_handler",
6632 DECL_ATTRIBUTES (current_function_decl
)))
6634 if (sh_cfun_interrupt_handler_p ())
6637 tr0_used
= flag_pic
&& df_regs_ever_live_p (PIC_OFFSET_TABLE_REGNUM
);
6639 for (regno
= FIRST_TARGET_REG
+ tr0_used
; regno
<= LAST_TARGET_REG
; regno
++)
6640 if (call_really_used_regs
[regno
] && ! df_regs_ever_live_p (regno
))
6646 /* The maximum registers we need to save are:
6647 - 62 general purpose registers (r15 is stack pointer, r63 is zero)
6648 - 32 floating point registers (for each pair, we save none,
6649 one single precision value, or a double precision value).
6650 - 8 target registers
6651 - add 1 entry for a delimiter. */
6652 #define MAX_SAVED_REGS (62+32+8)
6654 typedef struct save_entry_s
6663 /* There will be a delimiter entry with VOIDmode both at the start and the
6664 end of a filled in schedule. The end delimiter has the offset of the
6665 save with the smallest (i.e. most negative) offset. */
6666 typedef struct save_schedule_s
6668 save_entry entries
[MAX_SAVED_REGS
+ 2];
6669 int temps
[MAX_TEMPS
+1];
6672 /* Fill in SCHEDULE according to LIVE_REGS_MASK. If RESTORE is nonzero,
6673 use reverse order. Returns the last entry written to (not counting
6674 the delimiter). OFFSET_BASE is a number to be added to all offset
6678 sh5_schedule_saves (HARD_REG_SET
*live_regs_mask
, save_schedule
*schedule
,
6682 save_entry
*entry
= schedule
->entries
;
6686 if (! current_function_interrupt
)
6687 for (i
= FIRST_GENERAL_REG
; tmpx
< MAX_TEMPS
&& i
<= LAST_GENERAL_REG
; i
++)
6688 if (call_really_used_regs
[i
] && ! fixed_regs
[i
] && i
!= PR_MEDIA_REG
6689 && ! FUNCTION_ARG_REGNO_P (i
)
6690 && i
!= FIRST_RET_REG
6691 && ! (cfun
->static_chain_decl
!= NULL
&& i
== STATIC_CHAIN_REGNUM
)
6692 && ! (crtl
->calls_eh_return
6693 && (i
== EH_RETURN_STACKADJ_REGNO
6694 || ((unsigned) i
>= EH_RETURN_DATA_REGNO (0)
6695 && (unsigned) i
<= EH_RETURN_DATA_REGNO (3)))))
6696 schedule
->temps
[tmpx
++] = i
;
6698 entry
->mode
= VOIDmode
;
6699 entry
->offset
= offset_base
;
6701 /* We loop twice: first, we save 8-byte aligned registers in the
6702 higher addresses, that are known to be aligned. Then, we
6703 proceed to saving 32-bit registers that don't need 8-byte
6705 If this is an interrupt function, all registers that need saving
6706 need to be saved in full. moreover, we need to postpone saving
6707 target registers till we have saved some general purpose registers
6708 we can then use as scratch registers. */
6709 offset
= offset_base
;
6710 for (align
= 1; align
>= 0; align
--)
6712 for (i
= FIRST_PSEUDO_REGISTER
- 1; i
>= 0; i
--)
6713 if (TEST_HARD_REG_BIT (*live_regs_mask
, i
))
6715 enum machine_mode mode
= REGISTER_NATURAL_MODE (i
);
6718 if (current_function_interrupt
)
6720 if (TARGET_REGISTER_P (i
))
6722 if (GENERAL_REGISTER_P (i
))
6725 if (mode
== SFmode
&& (i
% 2) == 1
6726 && ! TARGET_FPU_SINGLE
&& FP_REGISTER_P (i
)
6727 && (TEST_HARD_REG_BIT (*live_regs_mask
, (i
^ 1))))
6734 /* If we're doing the aligned pass and this is not aligned,
6735 or we're doing the unaligned pass and this is aligned,
6737 if ((GET_MODE_SIZE (mode
) % (STACK_BOUNDARY
/ BITS_PER_UNIT
) == 0)
6741 if (current_function_interrupt
6742 && GENERAL_REGISTER_P (i
)
6743 && tmpx
< MAX_TEMPS
)
6744 schedule
->temps
[tmpx
++] = i
;
6746 offset
-= GET_MODE_SIZE (mode
);
6749 entry
->offset
= offset
;
6752 if (align
&& current_function_interrupt
)
6753 for (i
= LAST_TARGET_REG
; i
>= FIRST_TARGET_REG
; i
--)
6754 if (TEST_HARD_REG_BIT (*live_regs_mask
, i
))
6756 offset
-= GET_MODE_SIZE (DImode
);
6758 entry
->mode
= DImode
;
6759 entry
->offset
= offset
;
6764 entry
->mode
= VOIDmode
;
6765 entry
->offset
= offset
;
6766 schedule
->temps
[tmpx
] = -1;
6771 sh_expand_prologue (void)
6773 HARD_REG_SET live_regs_mask
;
6776 int save_flags
= target_flags
;
6779 = lookup_attribute ("sp_switch", DECL_ATTRIBUTES (current_function_decl
));
6781 current_function_interrupt
= sh_cfun_interrupt_handler_p ();
6783 /* We have pretend args if we had an object sent partially in registers
6784 and partially on the stack, e.g. a large structure. */
6785 pretend_args
= crtl
->args
.pretend_args_size
;
6786 if (TARGET_VARARGS_PRETEND_ARGS (current_function_decl
)
6787 && (NPARM_REGS(SImode
)
6788 > crtl
->args
.info
.arg_count
[(int) SH_ARG_INT
]))
6790 /* Dwarf2 module doesn't expect frame related insns here. */
6791 output_stack_adjust (-pretend_args
6792 - crtl
->args
.info
.stack_regs
* 8,
6793 stack_pointer_rtx
, 0, NULL
, false);
6795 if (TARGET_SHCOMPACT
&& flag_pic
&& crtl
->args
.info
.call_cookie
)
6796 /* We're going to use the PIC register to load the address of the
6797 incoming-argument decoder and/or of the return trampoline from
6798 the GOT, so make sure the PIC register is preserved and
6800 df_set_regs_ever_live (PIC_OFFSET_TABLE_REGNUM
, true);
6802 if (TARGET_SHCOMPACT
6803 && (crtl
->args
.info
.call_cookie
& ~ CALL_COOKIE_RET_TRAMP(1)))
6807 /* First, make all registers with incoming arguments that will
6808 be pushed onto the stack live, so that register renaming
6809 doesn't overwrite them. */
6810 for (reg
= 0; reg
< NPARM_REGS (SImode
); reg
++)
6811 if (CALL_COOKIE_STACKSEQ_GET (crtl
->args
.info
.call_cookie
)
6812 >= NPARM_REGS (SImode
) - reg
)
6813 for (; reg
< NPARM_REGS (SImode
); reg
++)
6814 emit_insn (gen_shcompact_preserve_incoming_args
6815 (gen_rtx_REG (SImode
, FIRST_PARM_REG
+ reg
)));
6816 else if (CALL_COOKIE_INT_REG_GET
6817 (crtl
->args
.info
.call_cookie
, reg
) == 1)
6818 emit_insn (gen_shcompact_preserve_incoming_args
6819 (gen_rtx_REG (SImode
, FIRST_PARM_REG
+ reg
)));
6821 emit_move_insn (gen_rtx_REG (Pmode
, MACL_REG
),
6823 emit_move_insn (gen_rtx_REG (SImode
, R0_REG
),
6824 GEN_INT (crtl
->args
.info
.call_cookie
));
6825 emit_move_insn (gen_rtx_REG (SImode
, MACH_REG
),
6826 gen_rtx_REG (SImode
, R0_REG
));
6828 else if (TARGET_SHMEDIA
)
6830 int tr
= sh_media_register_for_return ();
6833 emit_move_insn (gen_rtx_REG (DImode
, tr
),
6834 gen_rtx_REG (DImode
, PR_MEDIA_REG
));
6837 /* Emit the code for SETUP_VARARGS. */
6840 if (TARGET_VARARGS_PRETEND_ARGS (current_function_decl
))
6842 /* Push arg regs as if they'd been provided by caller in stack. */
6843 for (i
= 0; i
< NPARM_REGS(SImode
); i
++)
6845 int rn
= NPARM_REGS(SImode
) + FIRST_PARM_REG
- i
- 1;
6848 if (i
>= (NPARM_REGS(SImode
)
6849 - crtl
->args
.info
.arg_count
[(int) SH_ARG_INT
]
6857 /* If we're supposed to switch stacks at function entry, do so now. */
6861 /* The argument specifies a variable holding the address of the
6862 stack the interrupt function should switch to/from at entry/exit. */
6863 tree arg
= TREE_VALUE ( TREE_VALUE (sp_switch_attr
));
6865 = ggc_strdup (TREE_STRING_POINTER (arg
));
6866 rtx sp_switch
= gen_rtx_SYMBOL_REF (Pmode
, s
);
6868 lab
= add_constant (sp_switch
, SImode
, 0);
6869 newsrc
= gen_rtx_LABEL_REF (VOIDmode
, lab
);
6870 newsrc
= gen_const_mem (SImode
, newsrc
);
6872 emit_insn (gen_sp_switch_1 (newsrc
));
6875 d
= calc_live_regs (&live_regs_mask
);
6876 /* ??? Maybe we could save some switching if we can move a mode switch
6877 that already happens to be at the function start into the prologue. */
6878 if (target_flags
!= save_flags
&& ! current_function_interrupt
)
6879 emit_insn (gen_toggle_sz ());
6883 int offset_base
, offset
;
6885 int offset_in_r0
= -1;
6887 int tregs_space
= shmedia_target_regs_stack_adjust (&live_regs_mask
);
6888 int total_size
, save_size
;
6889 save_schedule schedule
;
6893 if (call_really_used_regs
[R0_REG
] && ! fixed_regs
[R0_REG
]
6894 && ! current_function_interrupt
)
6895 r0
= gen_rtx_REG (Pmode
, R0_REG
);
6897 /* D is the actual number of bytes that we need for saving registers,
6898 however, in initial_elimination_offset we have committed to using
6899 an additional TREGS_SPACE amount of bytes - in order to keep both
6900 addresses to arguments supplied by the caller and local variables
6901 valid, we must keep this gap. Place it between the incoming
6902 arguments and the actually saved registers in a bid to optimize
6903 locality of reference. */
6904 total_size
= d
+ tregs_space
;
6905 total_size
+= rounded_frame_size (total_size
);
6906 save_size
= total_size
- rounded_frame_size (d
);
6907 if (save_size
% (STACK_BOUNDARY
/ BITS_PER_UNIT
))
6908 d_rounding
= ((STACK_BOUNDARY
/ BITS_PER_UNIT
)
6909 - save_size
% (STACK_BOUNDARY
/ BITS_PER_UNIT
));
6911 /* If adjusting the stack in a single step costs nothing extra, do so.
6912 I.e. either if a single addi is enough, or we need a movi anyway,
6913 and we don't exceed the maximum offset range (the test for the
6914 latter is conservative for simplicity). */
6916 && (CONST_OK_FOR_I10 (-total_size
)
6917 || (! CONST_OK_FOR_I10 (-(save_size
+ d_rounding
))
6918 && total_size
<= 2044)))
6919 d_rounding
= total_size
- save_size
;
6921 offset_base
= d
+ d_rounding
;
6923 output_stack_adjust (-(save_size
+ d_rounding
), stack_pointer_rtx
,
6926 sh5_schedule_saves (&live_regs_mask
, &schedule
, offset_base
);
6927 tmp_pnt
= schedule
.temps
;
6928 for (entry
= &schedule
.entries
[1]; entry
->mode
!= VOIDmode
; entry
++)
6930 enum machine_mode mode
= (enum machine_mode
) entry
->mode
;
6931 unsigned int reg
= entry
->reg
;
6932 rtx reg_rtx
, mem_rtx
, pre_dec
= NULL_RTX
;
6935 offset
= entry
->offset
;
6937 reg_rtx
= gen_rtx_REG (mode
, reg
);
6939 mem_rtx
= gen_frame_mem (mode
,
6940 gen_rtx_PLUS (Pmode
,
6944 if (!memory_address_p (mode
, XEXP (mem_rtx
, 0)))
6950 if (HAVE_PRE_DECREMENT
6951 && (offset_in_r0
- offset
== GET_MODE_SIZE (mode
)
6952 || mem_rtx
== NULL_RTX
6953 || reg
== PR_REG
|| SPECIAL_REGISTER_P (reg
)))
6955 pre_dec
= gen_frame_mem (mode
, gen_rtx_PRE_DEC (Pmode
, r0
));
6957 if (!memory_address_p (mode
, XEXP (pre_dec
, 0)))
6962 offset
+= GET_MODE_SIZE (mode
);
6966 if (mem_rtx
!= NULL_RTX
)
6969 if (offset_in_r0
== -1)
6971 emit_move_insn (r0
, GEN_INT (offset
));
6972 offset_in_r0
= offset
;
6974 else if (offset
!= offset_in_r0
)
6979 GEN_INT (offset
- offset_in_r0
)));
6980 offset_in_r0
+= offset
- offset_in_r0
;
6983 if (pre_dec
!= NULL_RTX
)
6989 (Pmode
, r0
, stack_pointer_rtx
));
6993 offset
-= GET_MODE_SIZE (mode
);
6994 offset_in_r0
-= GET_MODE_SIZE (mode
);
6999 mem_rtx
= gen_frame_mem (mode
, r0
);
7001 mem_rtx
= gen_frame_mem (mode
,
7002 gen_rtx_PLUS (Pmode
,
7006 /* We must not use an r0-based address for target-branch
7007 registers or for special registers without pre-dec
7008 memory addresses, since we store their values in r0
7010 gcc_assert (!TARGET_REGISTER_P (reg
)
7011 && ((reg
!= PR_REG
&& !SPECIAL_REGISTER_P (reg
))
7012 || mem_rtx
== pre_dec
));
7015 orig_reg_rtx
= reg_rtx
;
7016 if (TARGET_REGISTER_P (reg
)
7017 || ((reg
== PR_REG
|| SPECIAL_REGISTER_P (reg
))
7018 && mem_rtx
!= pre_dec
))
7020 rtx tmp_reg
= gen_rtx_REG (GET_MODE (reg_rtx
), *tmp_pnt
);
7022 emit_move_insn (tmp_reg
, reg_rtx
);
7024 if (REGNO (tmp_reg
) == R0_REG
)
7028 gcc_assert (!refers_to_regno_p
7029 (R0_REG
, R0_REG
+1, mem_rtx
, (rtx
*) 0));
7032 if (*++tmp_pnt
<= 0)
7033 tmp_pnt
= schedule
.temps
;
7040 /* Mark as interesting for dwarf cfi generator */
7041 insn
= emit_move_insn (mem_rtx
, reg_rtx
);
7042 RTX_FRAME_RELATED_P (insn
) = 1;
7043 /* If we use an intermediate register for the save, we can't
7044 describe this exactly in cfi as a copy of the to-be-saved
7045 register into the temporary register and then the temporary
7046 register on the stack, because the temporary register can
7047 have a different natural size than the to-be-saved register.
7048 Thus, we gloss over the intermediate copy and pretend we do
7049 a direct save from the to-be-saved register. */
7050 if (REGNO (reg_rtx
) != reg
)
7054 set
= gen_rtx_SET (VOIDmode
, mem_rtx
, orig_reg_rtx
);
7055 add_reg_note (insn
, REG_FRAME_RELATED_EXPR
, set
);
7058 if (TARGET_SHCOMPACT
&& (offset_in_r0
!= -1))
7060 rtx reg_rtx
= gen_rtx_REG (mode
, reg
);
7062 rtx mem_rtx
= gen_frame_mem (mode
,
7063 gen_rtx_PLUS (Pmode
,
7067 set
= gen_rtx_SET (VOIDmode
, mem_rtx
, reg_rtx
);
7068 add_reg_note (insn
, REG_FRAME_RELATED_EXPR
, set
);
7073 gcc_assert (entry
->offset
== d_rounding
);
7076 push_regs (&live_regs_mask
, current_function_interrupt
);
7078 if (flag_pic
&& df_regs_ever_live_p (PIC_OFFSET_TABLE_REGNUM
))
7079 emit_insn (gen_GOTaddr2picreg ());
7081 if (SHMEDIA_REGS_STACK_ADJUST ())
7083 /* This must NOT go through the PLT, otherwise mach and macl
7084 may be clobbered. */
7085 function_symbol (gen_rtx_REG (Pmode
, R0_REG
),
7087 ? "__GCC_push_shmedia_regs"
7088 : "__GCC_push_shmedia_regs_nofpu"), SFUNC_GOT
);
7089 emit_insn (gen_shmedia_save_restore_regs_compact
7090 (GEN_INT (-SHMEDIA_REGS_STACK_ADJUST ())));
7093 if (target_flags
!= save_flags
&& ! current_function_interrupt
)
7094 emit_insn (gen_toggle_sz ());
7096 target_flags
= save_flags
;
7098 output_stack_adjust (-rounded_frame_size (d
) + d_rounding
,
7099 stack_pointer_rtx
, 0, NULL
, true);
7101 if (frame_pointer_needed
)
7102 frame_insn (GEN_MOV (hard_frame_pointer_rtx
, stack_pointer_rtx
));
7104 if (TARGET_SHCOMPACT
7105 && (crtl
->args
.info
.call_cookie
& ~ CALL_COOKIE_RET_TRAMP(1)))
7107 /* This must NOT go through the PLT, otherwise mach and macl
7108 may be clobbered. */
7109 function_symbol (gen_rtx_REG (Pmode
, R0_REG
),
7110 "__GCC_shcompact_incoming_args", SFUNC_GOT
);
7111 emit_insn (gen_shcompact_incoming_args ());
7116 sh_expand_epilogue (bool sibcall_p
)
7118 HARD_REG_SET live_regs_mask
;
7122 int save_flags
= target_flags
;
7123 int frame_size
, save_size
;
7124 int fpscr_deferred
= 0;
7125 int e
= sibcall_p
? -1 : 1;
7127 d
= calc_live_regs (&live_regs_mask
);
7130 frame_size
= rounded_frame_size (d
);
7134 int tregs_space
= shmedia_target_regs_stack_adjust (&live_regs_mask
);
7136 if (d
% (STACK_BOUNDARY
/ BITS_PER_UNIT
))
7137 d_rounding
= ((STACK_BOUNDARY
/ BITS_PER_UNIT
)
7138 - d
% (STACK_BOUNDARY
/ BITS_PER_UNIT
));
7140 total_size
= d
+ tregs_space
;
7141 total_size
+= rounded_frame_size (total_size
);
7142 save_size
= total_size
- frame_size
;
7144 /* If adjusting the stack in a single step costs nothing extra, do so.
7145 I.e. either if a single addi is enough, or we need a movi anyway,
7146 and we don't exceed the maximum offset range (the test for the
7147 latter is conservative for simplicity). */
7149 && ! frame_pointer_needed
7150 && (CONST_OK_FOR_I10 (total_size
)
7151 || (! CONST_OK_FOR_I10 (save_size
+ d_rounding
)
7152 && total_size
<= 2044)))
7153 d_rounding
= frame_size
;
7155 frame_size
-= d_rounding
;
7158 if (frame_pointer_needed
)
7160 /* We must avoid scheduling the epilogue with previous basic blocks.
7161 See PR/18032 and PR/40313. */
7162 emit_insn (gen_blockage ());
7163 output_stack_adjust (frame_size
, hard_frame_pointer_rtx
, e
,
7164 &live_regs_mask
, false);
7166 /* We must avoid moving the stack pointer adjustment past code
7167 which reads from the local frame, else an interrupt could
7168 occur after the SP adjustment and clobber data in the local
7170 emit_insn (gen_blockage ());
7171 emit_insn (GEN_MOV (stack_pointer_rtx
, hard_frame_pointer_rtx
));
7173 else if (frame_size
)
7175 /* We must avoid moving the stack pointer adjustment past code
7176 which reads from the local frame, else an interrupt could
7177 occur after the SP adjustment and clobber data in the local
7179 emit_insn (gen_blockage ());
7180 output_stack_adjust (frame_size
, stack_pointer_rtx
, e
,
7181 &live_regs_mask
, false);
7184 if (SHMEDIA_REGS_STACK_ADJUST ())
7186 function_symbol (gen_rtx_REG (Pmode
, R0_REG
),
7188 ? "__GCC_pop_shmedia_regs"
7189 : "__GCC_pop_shmedia_regs_nofpu"), SFUNC_GOT
);
7190 /* This must NOT go through the PLT, otherwise mach and macl
7191 may be clobbered. */
7192 emit_insn (gen_shmedia_save_restore_regs_compact
7193 (GEN_INT (SHMEDIA_REGS_STACK_ADJUST ())));
7196 /* Pop all the registers. */
7198 if (target_flags
!= save_flags
&& ! current_function_interrupt
)
7199 emit_insn (gen_toggle_sz ());
7202 int offset_base
, offset
;
7203 int offset_in_r0
= -1;
7205 rtx r0
= gen_rtx_REG (Pmode
, R0_REG
);
7206 save_schedule schedule
;
7210 entry
= sh5_schedule_saves (&live_regs_mask
, &schedule
, d_rounding
);
7211 offset_base
= -entry
[1].offset
+ d_rounding
;
7212 tmp_pnt
= schedule
.temps
;
7213 for (; entry
->mode
!= VOIDmode
; entry
--)
7215 enum machine_mode mode
= (enum machine_mode
) entry
->mode
;
7216 int reg
= entry
->reg
;
7217 rtx reg_rtx
, mem_rtx
, post_inc
= NULL_RTX
, insn
;
7219 offset
= offset_base
+ entry
->offset
;
7220 reg_rtx
= gen_rtx_REG (mode
, reg
);
7222 mem_rtx
= gen_frame_mem (mode
,
7223 gen_rtx_PLUS (Pmode
,
7227 if (!memory_address_p (mode
, XEXP (mem_rtx
, 0)))
7230 if (HAVE_POST_INCREMENT
7231 && (offset
== offset_in_r0
7232 || (offset
+ GET_MODE_SIZE (mode
) != d
+ d_rounding
7233 && mem_rtx
== NULL_RTX
)
7234 || reg
== PR_REG
|| SPECIAL_REGISTER_P (reg
)))
7236 post_inc
= gen_frame_mem (mode
, gen_rtx_POST_INC (Pmode
, r0
));
7238 if (!memory_address_p (mode
, XEXP (post_inc
, 0)))
7239 post_inc
= NULL_RTX
;
7244 if (mem_rtx
!= NULL_RTX
)
7247 if (offset_in_r0
== -1)
7249 emit_move_insn (r0
, GEN_INT (offset
));
7250 offset_in_r0
= offset
;
7252 else if (offset
!= offset_in_r0
)
7257 GEN_INT (offset
- offset_in_r0
)));
7258 offset_in_r0
+= offset
- offset_in_r0
;
7261 if (post_inc
!= NULL_RTX
)
7267 (Pmode
, r0
, stack_pointer_rtx
));
7273 offset_in_r0
+= GET_MODE_SIZE (mode
);
7276 mem_rtx
= gen_frame_mem (mode
, r0
);
7278 mem_rtx
= gen_frame_mem (mode
,
7279 gen_rtx_PLUS (Pmode
,
7283 gcc_assert ((reg
!= PR_REG
&& !SPECIAL_REGISTER_P (reg
))
7284 || mem_rtx
== post_inc
);
7287 if ((reg
== PR_REG
|| SPECIAL_REGISTER_P (reg
))
7288 && mem_rtx
!= post_inc
)
7290 insn
= emit_move_insn (r0
, mem_rtx
);
7293 else if (TARGET_REGISTER_P (reg
))
7295 rtx tmp_reg
= gen_rtx_REG (mode
, *tmp_pnt
);
7297 /* Give the scheduler a bit of freedom by using up to
7298 MAX_TEMPS registers in a round-robin fashion. */
7299 insn
= emit_move_insn (tmp_reg
, mem_rtx
);
7302 tmp_pnt
= schedule
.temps
;
7305 insn
= emit_move_insn (reg_rtx
, mem_rtx
);
7308 gcc_assert (entry
->offset
+ offset_base
== d
+ d_rounding
);
7310 else /* ! TARGET_SH5 */
7315 /* For an ISR with RESBANK attribute assigned, don't pop PR
7317 if (TEST_HARD_REG_BIT (live_regs_mask
, PR_REG
)
7318 && !sh_cfun_resbank_handler_p ())
7320 if (!frame_pointer_needed
)
7321 emit_insn (gen_blockage ());
7325 /* Banked registers are popped first to avoid being scheduled in the
7326 delay slot. RTE switches banks before the ds instruction. */
7327 if (current_function_interrupt
)
7329 for (i
= LAST_BANKED_REG
; i
>= FIRST_BANKED_REG
; i
--)
7330 if (TEST_HARD_REG_BIT (live_regs_mask
, i
))
7333 last_reg
= FIRST_PSEUDO_REGISTER
- LAST_BANKED_REG
- 1;
7336 last_reg
= FIRST_PSEUDO_REGISTER
;
7338 for (i
= 0; i
< last_reg
; i
++)
7340 int j
= (FIRST_PSEUDO_REGISTER
- 1) - i
;
7342 if (j
== FPSCR_REG
&& current_function_interrupt
&& TARGET_FMOVD
7343 && hard_reg_set_intersect_p (live_regs_mask
,
7344 reg_class_contents
[DF_REGS
]))
7346 /* For an ISR with RESBANK attribute assigned, don't pop
7347 following registers, R0-R14, MACH, MACL and GBR. */
7348 else if (j
!= PR_REG
&& TEST_HARD_REG_BIT (live_regs_mask
, j
)
7349 && ! (sh_cfun_resbank_handler_p ()
7350 && ((j
>= FIRST_GENERAL_REG
7351 && j
< LAST_GENERAL_REG
)
7357 if (j
== FIRST_FP_REG
&& fpscr_deferred
)
7361 if (target_flags
!= save_flags
&& ! current_function_interrupt
)
7362 emit_insn (gen_toggle_sz ());
7363 target_flags
= save_flags
;
7365 output_stack_adjust (crtl
->args
.pretend_args_size
7366 + save_size
+ d_rounding
7367 + crtl
->args
.info
.stack_regs
* 8,
7368 stack_pointer_rtx
, e
, NULL
, false);
7370 if (crtl
->calls_eh_return
)
7371 emit_insn (GEN_ADD3 (stack_pointer_rtx
, stack_pointer_rtx
,
7372 EH_RETURN_STACKADJ_RTX
));
7374 /* Switch back to the normal stack if necessary. */
7375 if (lookup_attribute ("sp_switch", DECL_ATTRIBUTES (current_function_decl
)))
7376 emit_insn (gen_sp_switch_2 ());
7378 /* Tell flow the insn that pops PR isn't dead. */
7379 /* PR_REG will never be live in SHmedia mode, and we don't need to
7380 USE PR_MEDIA_REG, since it will be explicitly copied to TR0_REG
7381 by the return pattern. */
7382 if (TEST_HARD_REG_BIT (live_regs_mask
, PR_REG
))
7383 emit_use (gen_rtx_REG (SImode
, PR_REG
));
7386 static int sh_need_epilogue_known
= 0;
7389 sh_need_epilogue (void)
7391 if (! sh_need_epilogue_known
)
7396 sh_expand_epilogue (0);
7397 epilogue
= get_insns ();
7399 sh_need_epilogue_known
= (epilogue
== NULL
? -1 : 1);
7401 return sh_need_epilogue_known
> 0;
7404 /* Emit code to change the current function's return address to RA.
7405 TEMP is available as a scratch register, if needed. */
7408 sh_set_return_address (rtx ra
, rtx tmp
)
7410 HARD_REG_SET live_regs_mask
;
7412 int pr_reg
= TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
;
7415 d
= calc_live_regs (&live_regs_mask
);
7417 /* If pr_reg isn't life, we can set it (or the register given in
7418 sh_media_register_for_return) directly. */
7419 if (! TEST_HARD_REG_BIT (live_regs_mask
, pr_reg
))
7425 int rr_regno
= sh_media_register_for_return ();
7430 rr
= gen_rtx_REG (DImode
, rr_regno
);
7433 rr
= gen_rtx_REG (SImode
, pr_reg
);
7435 emit_insn (GEN_MOV (rr
, ra
));
7436 /* Tell flow the register for return isn't dead. */
7444 save_schedule schedule
;
7447 entry
= sh5_schedule_saves (&live_regs_mask
, &schedule
, 0);
7448 offset
= entry
[1].offset
;
7449 for (; entry
->mode
!= VOIDmode
; entry
--)
7450 if (entry
->reg
== pr_reg
)
7453 /* We can't find pr register. */
7457 offset
= entry
->offset
- offset
;
7458 pr_offset
= (rounded_frame_size (d
) + offset
7459 + SHMEDIA_REGS_STACK_ADJUST ());
7462 pr_offset
= rounded_frame_size (d
);
7464 emit_insn (GEN_MOV (tmp
, GEN_INT (pr_offset
)));
7466 if (frame_pointer_needed
)
7467 emit_insn (GEN_ADD3 (tmp
, tmp
, hard_frame_pointer_rtx
));
7469 emit_insn (GEN_ADD3 (tmp
, tmp
, stack_pointer_rtx
));
7471 tmp
= gen_frame_mem (Pmode
, tmp
);
7472 emit_insn (GEN_MOV (tmp
, ra
));
7473 /* Tell this store isn't dead. */
7477 /* Clear variables at function end. */
7480 sh_output_function_epilogue (FILE *file ATTRIBUTE_UNUSED
,
7481 HOST_WIDE_INT size ATTRIBUTE_UNUSED
)
7483 sh_need_epilogue_known
= 0;
7487 sh_builtin_saveregs (void)
7489 /* First unnamed integer register. */
7490 int first_intreg
= crtl
->args
.info
.arg_count
[(int) SH_ARG_INT
];
7491 /* Number of integer registers we need to save. */
7492 int n_intregs
= MAX (0, NPARM_REGS (SImode
) - first_intreg
);
7493 /* First unnamed SFmode float reg */
7494 int first_floatreg
= crtl
->args
.info
.arg_count
[(int) SH_ARG_FLOAT
];
7495 /* Number of SFmode float regs to save. */
7496 int n_floatregs
= MAX (0, NPARM_REGS (SFmode
) - first_floatreg
);
7499 alias_set_type alias_set
;
7505 int pushregs
= n_intregs
;
7507 while (pushregs
< NPARM_REGS (SImode
) - 1
7508 && (CALL_COOKIE_INT_REG_GET
7509 (crtl
->args
.info
.call_cookie
,
7510 NPARM_REGS (SImode
) - pushregs
)
7513 crtl
->args
.info
.call_cookie
7514 &= ~ CALL_COOKIE_INT_REG (NPARM_REGS (SImode
)
7519 if (pushregs
== NPARM_REGS (SImode
))
7520 crtl
->args
.info
.call_cookie
7521 |= (CALL_COOKIE_INT_REG (0, 1)
7522 | CALL_COOKIE_STACKSEQ (pushregs
- 1));
7524 crtl
->args
.info
.call_cookie
7525 |= CALL_COOKIE_STACKSEQ (pushregs
);
7527 crtl
->args
.pretend_args_size
+= 8 * n_intregs
;
7529 if (TARGET_SHCOMPACT
)
7533 if (! TARGET_SH2E
&& ! TARGET_SH4
&& ! TARGET_SH5
)
7535 error ("__builtin_saveregs not supported by this subtarget");
7542 /* Allocate block of memory for the regs. */
7543 /* ??? If n_intregs + n_floatregs == 0, should we allocate at least 1 byte?
7544 Or can assign_stack_local accept a 0 SIZE argument? */
7545 bufsize
= (n_intregs
* UNITS_PER_WORD
) + (n_floatregs
* UNITS_PER_WORD
);
7548 regbuf
= gen_frame_mem (BLKmode
, gen_rtx_REG (Pmode
, ARG_POINTER_REGNUM
));
7549 else if (n_floatregs
& 1)
7553 regbuf
= assign_stack_local (BLKmode
, bufsize
+ UNITS_PER_WORD
, 0);
7554 addr
= copy_to_mode_reg (Pmode
, XEXP (regbuf
, 0));
7555 emit_insn (gen_iorsi3 (addr
, addr
, GEN_INT (UNITS_PER_WORD
)));
7556 regbuf
= change_address (regbuf
, BLKmode
, addr
);
7558 else if (STACK_BOUNDARY
< 64 && TARGET_FPU_DOUBLE
&& n_floatregs
)
7562 regbuf
= assign_stack_local (BLKmode
, bufsize
+ UNITS_PER_WORD
, 0);
7563 addr
= copy_to_mode_reg (Pmode
, plus_constant (XEXP (regbuf
, 0), 4));
7564 mask
= copy_to_mode_reg (Pmode
, GEN_INT (-8));
7565 emit_insn (gen_andsi3 (addr
, addr
, mask
));
7566 regbuf
= change_address (regbuf
, BLKmode
, addr
);
7569 regbuf
= assign_stack_local (BLKmode
, bufsize
, TARGET_FPU_DOUBLE
? 64 : 0);
7570 alias_set
= get_varargs_alias_set ();
7571 set_mem_alias_set (regbuf
, alias_set
);
7574 This is optimized to only save the regs that are necessary. Explicitly
7575 named args need not be saved. */
7577 move_block_from_reg (BASE_ARG_REG (SImode
) + first_intreg
,
7578 adjust_address (regbuf
, BLKmode
,
7579 n_floatregs
* UNITS_PER_WORD
),
7583 /* Return the address of the regbuf. */
7584 return XEXP (regbuf
, 0);
7587 This is optimized to only save the regs that are necessary. Explicitly
7588 named args need not be saved.
7589 We explicitly build a pointer to the buffer because it halves the insn
7590 count when not optimizing (otherwise the pointer is built for each reg
7592 We emit the moves in reverse order so that we can use predecrement. */
7594 fpregs
= copy_to_mode_reg (Pmode
,
7595 plus_constant (XEXP (regbuf
, 0),
7596 n_floatregs
* UNITS_PER_WORD
));
7597 if (TARGET_SH4
|| TARGET_SH2A_DOUBLE
)
7600 for (regno
= NPARM_REGS (DFmode
) - 2; regno
>= first_floatreg
; regno
-= 2)
7602 emit_insn (gen_addsi3 (fpregs
, fpregs
,
7603 GEN_INT (-2 * UNITS_PER_WORD
)));
7604 mem
= change_address (regbuf
, DFmode
, fpregs
);
7605 emit_move_insn (mem
,
7606 gen_rtx_REG (DFmode
, BASE_ARG_REG (DFmode
) + regno
));
7608 regno
= first_floatreg
;
7611 emit_insn (gen_addsi3 (fpregs
, fpregs
, GEN_INT (-UNITS_PER_WORD
)));
7612 mem
= change_address (regbuf
, SFmode
, fpregs
);
7613 emit_move_insn (mem
,
7614 gen_rtx_REG (SFmode
, BASE_ARG_REG (SFmode
) + regno
7615 - (TARGET_LITTLE_ENDIAN
!= 0)));
7619 for (regno
= NPARM_REGS (SFmode
) - 1; regno
>= first_floatreg
; regno
--)
7623 emit_insn (gen_addsi3 (fpregs
, fpregs
, GEN_INT (-UNITS_PER_WORD
)));
7624 mem
= change_address (regbuf
, SFmode
, fpregs
);
7625 emit_move_insn (mem
,
7626 gen_rtx_REG (SFmode
, BASE_ARG_REG (SFmode
) + regno
));
7629 /* Return the address of the regbuf. */
7630 return XEXP (regbuf
, 0);
7633 /* Define the `__builtin_va_list' type for the ABI. */
7636 sh_build_builtin_va_list (void)
7638 tree f_next_o
, f_next_o_limit
, f_next_fp
, f_next_fp_limit
, f_next_stack
;
7641 if (TARGET_SH5
|| (! TARGET_SH2E
&& ! TARGET_SH4
)
7642 || TARGET_HITACHI
|| sh_cfun_attr_renesas_p ())
7643 return ptr_type_node
;
7645 record
= (*lang_hooks
.types
.make_type
) (RECORD_TYPE
);
7647 f_next_o
= build_decl (BUILTINS_LOCATION
,
7648 FIELD_DECL
, get_identifier ("__va_next_o"),
7650 f_next_o_limit
= build_decl (BUILTINS_LOCATION
,
7652 get_identifier ("__va_next_o_limit"),
7654 f_next_fp
= build_decl (BUILTINS_LOCATION
,
7655 FIELD_DECL
, get_identifier ("__va_next_fp"),
7657 f_next_fp_limit
= build_decl (BUILTINS_LOCATION
,
7659 get_identifier ("__va_next_fp_limit"),
7661 f_next_stack
= build_decl (BUILTINS_LOCATION
,
7662 FIELD_DECL
, get_identifier ("__va_next_stack"),
7665 DECL_FIELD_CONTEXT (f_next_o
) = record
;
7666 DECL_FIELD_CONTEXT (f_next_o_limit
) = record
;
7667 DECL_FIELD_CONTEXT (f_next_fp
) = record
;
7668 DECL_FIELD_CONTEXT (f_next_fp_limit
) = record
;
7669 DECL_FIELD_CONTEXT (f_next_stack
) = record
;
7671 TYPE_FIELDS (record
) = f_next_o
;
7672 TREE_CHAIN (f_next_o
) = f_next_o_limit
;
7673 TREE_CHAIN (f_next_o_limit
) = f_next_fp
;
7674 TREE_CHAIN (f_next_fp
) = f_next_fp_limit
;
7675 TREE_CHAIN (f_next_fp_limit
) = f_next_stack
;
7677 layout_type (record
);
7682 /* Implement `va_start' for varargs and stdarg. */
7685 sh_va_start (tree valist
, rtx nextarg
)
7687 tree f_next_o
, f_next_o_limit
, f_next_fp
, f_next_fp_limit
, f_next_stack
;
7688 tree next_o
, next_o_limit
, next_fp
, next_fp_limit
, next_stack
;
7694 expand_builtin_saveregs ();
7695 std_expand_builtin_va_start (valist
, nextarg
);
7699 if ((! TARGET_SH2E
&& ! TARGET_SH4
)
7700 || TARGET_HITACHI
|| sh_cfun_attr_renesas_p ())
7702 std_expand_builtin_va_start (valist
, nextarg
);
7706 f_next_o
= TYPE_FIELDS (va_list_type_node
);
7707 f_next_o_limit
= TREE_CHAIN (f_next_o
);
7708 f_next_fp
= TREE_CHAIN (f_next_o_limit
);
7709 f_next_fp_limit
= TREE_CHAIN (f_next_fp
);
7710 f_next_stack
= TREE_CHAIN (f_next_fp_limit
);
7712 next_o
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_o
), valist
, f_next_o
,
7714 next_o_limit
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_o_limit
),
7715 valist
, f_next_o_limit
, NULL_TREE
);
7716 next_fp
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_fp
), valist
, f_next_fp
,
7718 next_fp_limit
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_fp_limit
),
7719 valist
, f_next_fp_limit
, NULL_TREE
);
7720 next_stack
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_stack
),
7721 valist
, f_next_stack
, NULL_TREE
);
7723 /* Call __builtin_saveregs. */
7724 u
= make_tree (sizetype
, expand_builtin_saveregs ());
7725 u
= fold_convert (ptr_type_node
, u
);
7726 t
= build2 (MODIFY_EXPR
, ptr_type_node
, next_fp
, u
);
7727 TREE_SIDE_EFFECTS (t
) = 1;
7728 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7730 nfp
= crtl
->args
.info
.arg_count
[SH_ARG_FLOAT
];
7735 u
= fold_build2 (POINTER_PLUS_EXPR
, ptr_type_node
, u
,
7736 size_int (UNITS_PER_WORD
* nfp
));
7737 t
= build2 (MODIFY_EXPR
, ptr_type_node
, next_fp_limit
, u
);
7738 TREE_SIDE_EFFECTS (t
) = 1;
7739 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7741 t
= build2 (MODIFY_EXPR
, ptr_type_node
, next_o
, u
);
7742 TREE_SIDE_EFFECTS (t
) = 1;
7743 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7745 nint
= crtl
->args
.info
.arg_count
[SH_ARG_INT
];
7750 u
= fold_build2 (POINTER_PLUS_EXPR
, ptr_type_node
, u
,
7751 size_int (UNITS_PER_WORD
* nint
));
7752 t
= build2 (MODIFY_EXPR
, ptr_type_node
, next_o_limit
, u
);
7753 TREE_SIDE_EFFECTS (t
) = 1;
7754 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7756 u
= make_tree (ptr_type_node
, nextarg
);
7757 t
= build2 (MODIFY_EXPR
, ptr_type_node
, next_stack
, u
);
7758 TREE_SIDE_EFFECTS (t
) = 1;
7759 expand_expr (t
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7762 /* TYPE is a RECORD_TYPE. If there is only a single nonzero-sized
7763 member, return it. */
7765 find_sole_member (tree type
)
7767 tree field
, member
= NULL_TREE
;
7769 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7771 if (TREE_CODE (field
) != FIELD_DECL
)
7773 if (!DECL_SIZE (field
))
7775 if (integer_zerop (DECL_SIZE (field
)))
7783 /* Implement `va_arg'. */
7786 sh_gimplify_va_arg_expr (tree valist
, tree type
, gimple_seq
*pre_p
,
7787 gimple_seq
*post_p ATTRIBUTE_UNUSED
)
7789 HOST_WIDE_INT size
, rsize
;
7790 tree tmp
, pptr_type_node
;
7791 tree addr
, lab_over
= NULL
, result
= NULL
;
7792 int pass_by_ref
= targetm
.calls
.must_pass_in_stack (TYPE_MODE (type
), type
);
7796 type
= build_pointer_type (type
);
7798 size
= int_size_in_bytes (type
);
7799 rsize
= (size
+ UNITS_PER_WORD
- 1) & -UNITS_PER_WORD
;
7800 pptr_type_node
= build_pointer_type (ptr_type_node
);
7802 if (! TARGET_SH5
&& (TARGET_SH2E
|| TARGET_SH4
)
7803 && ! (TARGET_HITACHI
|| sh_cfun_attr_renesas_p ()))
7805 tree f_next_o
, f_next_o_limit
, f_next_fp
, f_next_fp_limit
, f_next_stack
;
7806 tree next_o
, next_o_limit
, next_fp
, next_fp_limit
, next_stack
;
7811 f_next_o
= TYPE_FIELDS (va_list_type_node
);
7812 f_next_o_limit
= TREE_CHAIN (f_next_o
);
7813 f_next_fp
= TREE_CHAIN (f_next_o_limit
);
7814 f_next_fp_limit
= TREE_CHAIN (f_next_fp
);
7815 f_next_stack
= TREE_CHAIN (f_next_fp_limit
);
7817 next_o
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_o
), valist
, f_next_o
,
7819 next_o_limit
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_o_limit
),
7820 valist
, f_next_o_limit
, NULL_TREE
);
7821 next_fp
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_fp
),
7822 valist
, f_next_fp
, NULL_TREE
);
7823 next_fp_limit
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_fp_limit
),
7824 valist
, f_next_fp_limit
, NULL_TREE
);
7825 next_stack
= build3 (COMPONENT_REF
, TREE_TYPE (f_next_stack
),
7826 valist
, f_next_stack
, NULL_TREE
);
7828 /* Structures with a single member with a distinct mode are passed
7829 like their member. This is relevant if the latter has a REAL_TYPE
7830 or COMPLEX_TYPE type. */
7832 while (TREE_CODE (eff_type
) == RECORD_TYPE
7833 && (member
= find_sole_member (eff_type
))
7834 && (TREE_CODE (TREE_TYPE (member
)) == REAL_TYPE
7835 || TREE_CODE (TREE_TYPE (member
)) == COMPLEX_TYPE
7836 || TREE_CODE (TREE_TYPE (member
)) == RECORD_TYPE
))
7838 tree field_type
= TREE_TYPE (member
);
7840 if (TYPE_MODE (eff_type
) == TYPE_MODE (field_type
))
7841 eff_type
= field_type
;
7844 gcc_assert ((TYPE_ALIGN (eff_type
)
7845 < GET_MODE_ALIGNMENT (TYPE_MODE (field_type
)))
7846 || (TYPE_ALIGN (eff_type
)
7847 > GET_MODE_BITSIZE (TYPE_MODE (field_type
))));
7852 if (TARGET_SH4
|| TARGET_SH2A_DOUBLE
)
7854 pass_as_float
= ((TREE_CODE (eff_type
) == REAL_TYPE
&& size
<= 8)
7855 || (TREE_CODE (eff_type
) == COMPLEX_TYPE
7856 && TREE_CODE (TREE_TYPE (eff_type
)) == REAL_TYPE
7861 pass_as_float
= (TREE_CODE (eff_type
) == REAL_TYPE
&& size
== 4);
7864 addr
= create_tmp_var (pptr_type_node
, NULL
);
7865 lab_false
= create_artificial_label (UNKNOWN_LOCATION
);
7866 lab_over
= create_artificial_label (UNKNOWN_LOCATION
);
7868 valist
= build1 (INDIRECT_REF
, ptr_type_node
, addr
);
7872 tree next_fp_tmp
= create_tmp_var (TREE_TYPE (f_next_fp
), NULL
);
7874 bool is_double
= size
== 8 && TREE_CODE (eff_type
) == REAL_TYPE
;
7876 tmp
= build1 (ADDR_EXPR
, pptr_type_node
, unshare_expr (next_fp
));
7877 gimplify_assign (unshare_expr (addr
), tmp
, pre_p
);
7879 gimplify_assign (unshare_expr (next_fp_tmp
), valist
, pre_p
);
7880 tmp
= next_fp_limit
;
7881 if (size
> 4 && !is_double
)
7882 tmp
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (tmp
),
7883 unshare_expr (tmp
), size_int (4 - size
));
7884 tmp
= build2 (GE_EXPR
, boolean_type_node
,
7885 unshare_expr (next_fp_tmp
), unshare_expr (tmp
));
7886 cmp
= build3 (COND_EXPR
, void_type_node
, tmp
,
7887 build1 (GOTO_EXPR
, void_type_node
,
7888 unshare_expr (lab_false
)), NULL_TREE
);
7890 gimplify_and_add (cmp
, pre_p
);
7892 if (TYPE_ALIGN (eff_type
) > BITS_PER_WORD
7893 || (is_double
|| size
== 16))
7895 tmp
= fold_convert (sizetype
, next_fp_tmp
);
7896 tmp
= build2 (BIT_AND_EXPR
, sizetype
, tmp
,
7897 size_int (UNITS_PER_WORD
));
7898 tmp
= build2 (POINTER_PLUS_EXPR
, ptr_type_node
,
7899 unshare_expr (next_fp_tmp
), tmp
);
7900 gimplify_assign (unshare_expr (next_fp_tmp
), tmp
, pre_p
);
7903 gimplify_and_add (cmp
, pre_p
);
7905 #ifdef FUNCTION_ARG_SCmode_WART
7906 if (TYPE_MODE (eff_type
) == SCmode
7907 && TARGET_SH4
&& TARGET_LITTLE_ENDIAN
)
7909 tree subtype
= TREE_TYPE (eff_type
);
7913 = std_gimplify_va_arg_expr (next_fp_tmp
, subtype
, pre_p
, NULL
);
7914 imag
= get_initialized_tmp_var (imag
, pre_p
, NULL
);
7917 = std_gimplify_va_arg_expr (next_fp_tmp
, subtype
, pre_p
, NULL
);
7918 real
= get_initialized_tmp_var (real
, pre_p
, NULL
);
7920 result
= build2 (COMPLEX_EXPR
, eff_type
, real
, imag
);
7921 if (type
!= eff_type
)
7922 result
= build1 (VIEW_CONVERT_EXPR
, type
, result
);
7923 result
= get_initialized_tmp_var (result
, pre_p
, NULL
);
7925 #endif /* FUNCTION_ARG_SCmode_WART */
7927 tmp
= build1 (GOTO_EXPR
, void_type_node
, unshare_expr (lab_over
));
7928 gimplify_and_add (tmp
, pre_p
);
7930 tmp
= build1 (LABEL_EXPR
, void_type_node
, unshare_expr (lab_false
));
7931 gimplify_and_add (tmp
, pre_p
);
7933 tmp
= build1 (ADDR_EXPR
, pptr_type_node
, unshare_expr (next_stack
));
7934 gimplify_assign (unshare_expr (addr
), tmp
, pre_p
);
7935 gimplify_assign (unshare_expr (next_fp_tmp
),
7936 unshare_expr (valist
), pre_p
);
7938 gimplify_assign (unshare_expr (valist
),
7939 unshare_expr (next_fp_tmp
), post_p
);
7940 valist
= next_fp_tmp
;
7944 tmp
= build2 (POINTER_PLUS_EXPR
, ptr_type_node
,
7945 unshare_expr (next_o
), size_int (rsize
));
7946 tmp
= build2 (GT_EXPR
, boolean_type_node
, tmp
,
7947 unshare_expr (next_o_limit
));
7948 tmp
= build3 (COND_EXPR
, void_type_node
, tmp
,
7949 build1 (GOTO_EXPR
, void_type_node
,
7950 unshare_expr (lab_false
)),
7952 gimplify_and_add (tmp
, pre_p
);
7954 tmp
= build1 (ADDR_EXPR
, pptr_type_node
, unshare_expr (next_o
));
7955 gimplify_assign (unshare_expr (addr
), tmp
, pre_p
);
7957 tmp
= build1 (GOTO_EXPR
, void_type_node
, unshare_expr (lab_over
));
7958 gimplify_and_add (tmp
, pre_p
);
7960 tmp
= build1 (LABEL_EXPR
, void_type_node
, unshare_expr (lab_false
));
7961 gimplify_and_add (tmp
, pre_p
);
7963 if (size
> 4 && ! (TARGET_SH4
|| TARGET_SH2A
))
7964 gimplify_assign (unshare_expr (next_o
),
7965 unshare_expr (next_o_limit
), pre_p
);
7967 tmp
= build1 (ADDR_EXPR
, pptr_type_node
, unshare_expr (next_stack
));
7968 gimplify_assign (unshare_expr (addr
), tmp
, pre_p
);
7973 tmp
= build1 (LABEL_EXPR
, void_type_node
, unshare_expr (lab_over
));
7974 gimplify_and_add (tmp
, pre_p
);
7978 /* ??? In va-sh.h, there had been code to make values larger than
7979 size 8 indirect. This does not match the FUNCTION_ARG macros. */
7981 tmp
= std_gimplify_va_arg_expr (valist
, type
, pre_p
, NULL
);
7984 gimplify_assign (result
, tmp
, pre_p
);
7985 result
= build1 (NOP_EXPR
, TREE_TYPE (result
), result
);
7986 tmp
= build1 (LABEL_EXPR
, void_type_node
, unshare_expr (lab_over
));
7987 gimplify_and_add (tmp
, pre_p
);
7993 result
= build_va_arg_indirect_ref (result
);
7998 /* 64 bit floating points memory transfers are paired single precision loads
7999 or store. So DWARF information needs fixing in little endian (unless
8000 PR=SZ=1 in FPSCR). */
8002 sh_dwarf_register_span (rtx reg
)
8004 unsigned regno
= REGNO (reg
);
8006 if (WORDS_BIG_ENDIAN
|| GET_MODE (reg
) != DFmode
)
8010 gen_rtx_PARALLEL (VOIDmode
,
8012 gen_rtx_REG (SFmode
,
8013 DBX_REGISTER_NUMBER (regno
+1)),
8014 gen_rtx_REG (SFmode
,
8015 DBX_REGISTER_NUMBER (regno
))));
8018 static enum machine_mode
8019 sh_promote_function_mode (const_tree type
, enum machine_mode mode
,
8020 int *punsignedp
, const_tree funtype
,
8021 int for_return ATTRIBUTE_UNUSED
)
8023 if (sh_promote_prototypes (funtype
))
8024 return promote_mode (type
, mode
, punsignedp
);
8030 sh_promote_prototypes (const_tree type
)
8036 return ! sh_attr_renesas_p (type
);
8039 /* Whether an argument must be passed by reference. On SHcompact, we
8040 pretend arguments wider than 32-bits that would have been passed in
8041 registers are passed by reference, so that an SHmedia trampoline
8042 loads them into the full 64-bits registers. */
8045 shcompact_byref (const CUMULATIVE_ARGS
*cum
, enum machine_mode mode
,
8046 const_tree type
, bool named
)
8048 unsigned HOST_WIDE_INT size
;
8051 size
= int_size_in_bytes (type
);
8053 size
= GET_MODE_SIZE (mode
);
8055 if (cum
->arg_count
[SH_ARG_INT
] < NPARM_REGS (SImode
)
8057 || GET_SH_ARG_CLASS (mode
) == SH_ARG_INT
8058 || (GET_SH_ARG_CLASS (mode
) == SH_ARG_FLOAT
8059 && cum
->arg_count
[SH_ARG_FLOAT
] >= NPARM_REGS (SFmode
)))
8061 && !SHCOMPACT_FORCE_ON_STACK (mode
, type
)
8062 && !SH5_WOULD_BE_PARTIAL_NREGS (*cum
, mode
, type
, named
))
8069 sh_pass_by_reference (CUMULATIVE_ARGS
*cum
, enum machine_mode mode
,
8070 const_tree type
, bool named
)
8072 if (targetm
.calls
.must_pass_in_stack (mode
, type
))
8075 /* ??? std_gimplify_va_arg_expr passes NULL for cum. That function
8076 wants to know about pass-by-reference semantics for incoming
8081 if (TARGET_SHCOMPACT
)
8083 cum
->byref
= shcompact_byref (cum
, mode
, type
, named
);
8084 return cum
->byref
!= 0;
8091 sh_callee_copies (CUMULATIVE_ARGS
*cum
, enum machine_mode mode
,
8092 const_tree type
, bool named ATTRIBUTE_UNUSED
)
8094 /* ??? How can it possibly be correct to return true only on the
8095 caller side of the equation? Is there someplace else in the
8096 sh backend that's magically producing the copies? */
8097 return (cum
->outgoing
8098 && ((mode
== BLKmode
? TYPE_ALIGN (type
) : GET_MODE_ALIGNMENT (mode
))
8099 % SH_MIN_ALIGN_FOR_CALLEE_COPY
== 0));
8103 sh_arg_partial_bytes (CUMULATIVE_ARGS
*cum
, enum machine_mode mode
,
8104 tree type
, bool named ATTRIBUTE_UNUSED
)
8109 && PASS_IN_REG_P (*cum
, mode
, type
)
8110 && !(TARGET_SH4
|| TARGET_SH2A_DOUBLE
)
8111 && (ROUND_REG (*cum
, mode
)
8113 ? ROUND_ADVANCE (GET_MODE_SIZE (mode
))
8114 : ROUND_ADVANCE (int_size_in_bytes (type
)))
8115 > NPARM_REGS (mode
)))
8116 words
= NPARM_REGS (mode
) - ROUND_REG (*cum
, mode
);
8118 else if (!TARGET_SHCOMPACT
8119 && SH5_WOULD_BE_PARTIAL_NREGS (*cum
, mode
, type
, named
))
8120 words
= NPARM_REGS (SImode
) - cum
->arg_count
[SH_ARG_INT
];
8122 return words
* UNITS_PER_WORD
;
8126 /* Define where to put the arguments to a function.
8127 Value is zero to push the argument on the stack,
8128 or a hard register in which to store the argument.
8130 MODE is the argument's machine mode.
8131 TYPE is the data type of the argument (as a tree).
8132 This is null for libcalls where that information may
8134 CUM is a variable of type CUMULATIVE_ARGS which gives info about
8135 the preceding args and about the function being called.
8136 NAMED is nonzero if this argument is a named parameter
8137 (otherwise it is an extra parameter matching an ellipsis).
8139 On SH the first args are normally in registers
8140 and the rest are pushed. Any arg that starts within the first
8141 NPARM_REGS words is at least partially passed in a register unless
8142 its data type forbids. */
8146 sh_function_arg (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
8147 tree type
, int named
)
8149 if (! TARGET_SH5
&& mode
== VOIDmode
)
8150 return GEN_INT (ca
->renesas_abi
? 1 : 0);
8153 && PASS_IN_REG_P (*ca
, mode
, type
)
8154 && (named
|| ! (TARGET_HITACHI
|| ca
->renesas_abi
)))
8158 if (mode
== SCmode
&& TARGET_SH4
&& TARGET_LITTLE_ENDIAN
8159 && (! FUNCTION_ARG_SCmode_WART
|| (ROUND_REG (*ca
, mode
) & 1)))
8161 rtx r1
= gen_rtx_EXPR_LIST (VOIDmode
,
8162 gen_rtx_REG (SFmode
,
8164 + (ROUND_REG (*ca
, mode
) ^ 1)),
8166 rtx r2
= gen_rtx_EXPR_LIST (VOIDmode
,
8167 gen_rtx_REG (SFmode
,
8169 + ((ROUND_REG (*ca
, mode
) + 1) ^ 1)),
8171 return gen_rtx_PARALLEL(SCmode
, gen_rtvec(2, r1
, r2
));
8174 /* If the alignment of a DF value causes an SF register to be
8175 skipped, we will use that skipped register for the next SF
8177 if ((TARGET_HITACHI
|| ca
->renesas_abi
)
8178 && ca
->free_single_fp_reg
8180 return gen_rtx_REG (mode
, ca
->free_single_fp_reg
);
8182 regno
= (BASE_ARG_REG (mode
) + ROUND_REG (*ca
, mode
))
8183 ^ (mode
== SFmode
&& TARGET_SH4
8184 && TARGET_LITTLE_ENDIAN
!= 0
8185 && ! TARGET_HITACHI
&& ! ca
->renesas_abi
);
8186 return gen_rtx_REG (mode
, regno
);
8192 if (mode
== VOIDmode
&& TARGET_SHCOMPACT
)
8193 return GEN_INT (ca
->call_cookie
);
8195 /* The following test assumes unnamed arguments are promoted to
8197 if (mode
== SFmode
&& ca
->free_single_fp_reg
)
8198 return SH5_PROTOTYPED_FLOAT_ARG (*ca
, mode
, ca
->free_single_fp_reg
);
8200 if ((GET_SH_ARG_CLASS (mode
) == SH_ARG_FLOAT
)
8201 && (named
|| ! ca
->prototype_p
)
8202 && ca
->arg_count
[(int) SH_ARG_FLOAT
] < NPARM_REGS (SFmode
))
8204 if (! ca
->prototype_p
&& TARGET_SHMEDIA
)
8205 return SH5_PROTOTYPELESS_FLOAT_ARG (*ca
, mode
);
8207 return SH5_PROTOTYPED_FLOAT_ARG (*ca
, mode
,
8209 + ca
->arg_count
[(int) SH_ARG_FLOAT
]);
8212 if (ca
->arg_count
[(int) SH_ARG_INT
] < NPARM_REGS (SImode
)
8213 && (! TARGET_SHCOMPACT
8214 || (! SHCOMPACT_FORCE_ON_STACK (mode
, type
)
8215 && ! SH5_WOULD_BE_PARTIAL_NREGS (*ca
, mode
,
8218 return gen_rtx_REG (mode
, (FIRST_PARM_REG
8219 + ca
->arg_count
[(int) SH_ARG_INT
]));
8228 /* Update the data in CUM to advance over an argument
8229 of mode MODE and data type TYPE.
8230 (TYPE is null for libcalls where that information may not be
8234 sh_function_arg_advance (CUMULATIVE_ARGS
*ca
, enum machine_mode mode
,
8235 tree type
, int named
)
8239 else if (TARGET_SH5
)
8241 tree type2
= (ca
->byref
&& type
8244 enum machine_mode mode2
= (ca
->byref
&& type
8247 int dwords
= ((ca
->byref
8250 ? int_size_in_bytes (type2
)
8251 : GET_MODE_SIZE (mode2
)) + 7) / 8;
8252 int numregs
= MIN (dwords
, NPARM_REGS (SImode
)
8253 - ca
->arg_count
[(int) SH_ARG_INT
]);
8257 ca
->arg_count
[(int) SH_ARG_INT
] += numregs
;
8258 if (TARGET_SHCOMPACT
8259 && SHCOMPACT_FORCE_ON_STACK (mode2
, type2
))
8262 |= CALL_COOKIE_INT_REG (ca
->arg_count
[(int) SH_ARG_INT
]
8264 /* N.B. We want this also for outgoing. */
8265 ca
->stack_regs
+= numregs
;
8270 ca
->stack_regs
+= numregs
;
8271 ca
->byref_regs
+= numregs
;
8275 |= CALL_COOKIE_INT_REG (ca
->arg_count
[(int) SH_ARG_INT
]
8279 |= CALL_COOKIE_INT_REG (ca
->arg_count
[(int) SH_ARG_INT
]
8282 else if (dwords
> numregs
)
8284 int pushregs
= numregs
;
8286 if (TARGET_SHCOMPACT
)
8287 ca
->stack_regs
+= numregs
;
8288 while (pushregs
< NPARM_REGS (SImode
) - 1
8289 && (CALL_COOKIE_INT_REG_GET
8291 NPARM_REGS (SImode
) - pushregs
)
8295 &= ~ CALL_COOKIE_INT_REG (NPARM_REGS (SImode
)
8299 if (numregs
== NPARM_REGS (SImode
))
8301 |= CALL_COOKIE_INT_REG (0, 1)
8302 | CALL_COOKIE_STACKSEQ (numregs
- 1);
8305 |= CALL_COOKIE_STACKSEQ (numregs
);
8308 if (GET_SH_ARG_CLASS (mode2
) == SH_ARG_FLOAT
8309 && (named
|| ! ca
->prototype_p
))
8311 if (mode2
== SFmode
&& ca
->free_single_fp_reg
)
8312 ca
->free_single_fp_reg
= 0;
8313 else if (ca
->arg_count
[(int) SH_ARG_FLOAT
]
8314 < NPARM_REGS (SFmode
))
8317 = MIN ((GET_MODE_SIZE (mode2
) + 7) / 8 * 2,
8319 - ca
->arg_count
[(int) SH_ARG_FLOAT
]);
8321 ca
->arg_count
[(int) SH_ARG_FLOAT
] += numfpregs
;
8323 if (TARGET_SHCOMPACT
&& ! ca
->prototype_p
)
8325 if (ca
->outgoing
&& numregs
> 0)
8329 |= (CALL_COOKIE_INT_REG
8330 (ca
->arg_count
[(int) SH_ARG_INT
]
8331 - numregs
+ ((numfpregs
- 2) / 2),
8332 4 + (ca
->arg_count
[(int) SH_ARG_FLOAT
]
8335 while (numfpregs
-= 2);
8337 else if (mode2
== SFmode
&& (named
)
8338 && (ca
->arg_count
[(int) SH_ARG_FLOAT
]
8339 < NPARM_REGS (SFmode
)))
8340 ca
->free_single_fp_reg
8341 = FIRST_FP_PARM_REG
- numfpregs
8342 + ca
->arg_count
[(int) SH_ARG_FLOAT
] + 1;
8348 if ((TARGET_HITACHI
|| ca
->renesas_abi
) && TARGET_FPU_DOUBLE
)
8350 /* Note that we've used the skipped register. */
8351 if (mode
== SFmode
&& ca
->free_single_fp_reg
)
8353 ca
->free_single_fp_reg
= 0;
8356 /* When we have a DF after an SF, there's an SF register that get
8357 skipped in order to align the DF value. We note this skipped
8358 register, because the next SF value will use it, and not the
8359 SF that follows the DF. */
8361 && ROUND_REG (*ca
, DFmode
) != ROUND_REG (*ca
, SFmode
))
8363 ca
->free_single_fp_reg
= (ROUND_REG (*ca
, SFmode
)
8364 + BASE_ARG_REG (mode
));
8368 if (! ((TARGET_SH4
|| TARGET_SH2A
) || ca
->renesas_abi
)
8369 || PASS_IN_REG_P (*ca
, mode
, type
))
8370 (ca
->arg_count
[(int) GET_SH_ARG_CLASS (mode
)]
8371 = (ROUND_REG (*ca
, mode
)
8373 ? ROUND_ADVANCE (int_size_in_bytes (type
))
8374 : ROUND_ADVANCE (GET_MODE_SIZE (mode
)))));
8377 /* The Renesas calling convention doesn't quite fit into this scheme since
8378 the address is passed like an invisible argument, but one that is always
8379 passed in memory. */
8381 sh_struct_value_rtx (tree fndecl
, int incoming ATTRIBUTE_UNUSED
)
8383 if (TARGET_HITACHI
|| sh_attr_renesas_p (fndecl
))
8385 return gen_rtx_REG (Pmode
, 2);
8388 /* Worker function for TARGET_FUNCTION_VALUE.
8390 For the SH, this is like LIBCALL_VALUE, except that we must change the
8391 mode like PROMOTE_MODE does.
8392 ??? PROMOTE_MODE is ignored for non-scalar types. The set of types
8393 tested here has to be kept in sync with the one in explow.c:promote_mode.
8397 sh_function_value (const_tree valtype
,
8398 const_tree fn_decl_or_type
,
8399 bool outgoing ATTRIBUTE_UNUSED
)
8402 && !DECL_P (fn_decl_or_type
))
8403 fn_decl_or_type
= NULL
;
8405 return gen_rtx_REG (
8406 ((GET_MODE_CLASS (TYPE_MODE (valtype
)) == MODE_INT
8407 && GET_MODE_SIZE (TYPE_MODE (valtype
)) < 4
8408 && (TREE_CODE (valtype
) == INTEGER_TYPE
8409 || TREE_CODE (valtype
) == ENUMERAL_TYPE
8410 || TREE_CODE (valtype
) == BOOLEAN_TYPE
8411 || TREE_CODE (valtype
) == REAL_TYPE
8412 || TREE_CODE (valtype
) == OFFSET_TYPE
))
8413 && sh_promote_prototypes (fn_decl_or_type
)
8414 ? (TARGET_SHMEDIA64
? DImode
: SImode
) : TYPE_MODE (valtype
)),
8415 BASE_RETURN_VALUE_REG (TYPE_MODE (valtype
)));
8418 /* Worker function for TARGET_LIBCALL_VALUE. */
8421 sh_libcall_value (enum machine_mode mode
, const_rtx fun ATTRIBUTE_UNUSED
)
8423 return gen_rtx_REG (mode
, BASE_RETURN_VALUE_REG (mode
));
8426 /* Worker function for FUNCTION_VALUE_REGNO_P. */
8429 sh_function_value_regno_p (const unsigned int regno
)
8431 return ((regno
) == FIRST_RET_REG
8432 || (TARGET_SH2E
&& (regno
) == FIRST_FP_RET_REG
)
8433 || (TARGET_SHMEDIA_FPU
&& (regno
) == FIRST_FP_RET_REG
));
8436 /* Worker function for TARGET_RETURN_IN_MEMORY. */
8439 sh_return_in_memory (const_tree type
, const_tree fndecl
)
8443 if (TYPE_MODE (type
) == BLKmode
)
8444 return ((unsigned HOST_WIDE_INT
) int_size_in_bytes (type
)) > 8;
8446 return GET_MODE_SIZE (TYPE_MODE (type
)) > 8;
8450 return (TYPE_MODE (type
) == BLKmode
8451 || ((TARGET_HITACHI
|| sh_attr_renesas_p (fndecl
))
8452 && TREE_CODE (type
) == RECORD_TYPE
));
8456 /* We actually emit the code in sh_expand_prologue. We used to use
8457 a static variable to flag that we need to emit this code, but that
8458 doesn't when inlining, when functions are deferred and then emitted
8459 later. Fortunately, we already have two flags that are part of struct
8460 function that tell if a function uses varargs or stdarg. */
8462 sh_setup_incoming_varargs (CUMULATIVE_ARGS
*ca
,
8463 enum machine_mode mode
,
8465 int *pretend_arg_size
,
8466 int second_time ATTRIBUTE_UNUSED
)
8468 gcc_assert (cfun
->stdarg
);
8469 if (TARGET_VARARGS_PRETEND_ARGS (current_function_decl
))
8471 int named_parm_regs
, anon_parm_regs
;
8473 named_parm_regs
= (ROUND_REG (*ca
, mode
)
8475 ? ROUND_ADVANCE (int_size_in_bytes (type
))
8476 : ROUND_ADVANCE (GET_MODE_SIZE (mode
))));
8477 anon_parm_regs
= NPARM_REGS (SImode
) - named_parm_regs
;
8478 if (anon_parm_regs
> 0)
8479 *pretend_arg_size
= anon_parm_regs
* 4;
8484 sh_strict_argument_naming (CUMULATIVE_ARGS
*ca ATTRIBUTE_UNUSED
)
8490 sh_pretend_outgoing_varargs_named (CUMULATIVE_ARGS
*ca
)
8492 return ! (TARGET_HITACHI
|| ca
->renesas_abi
) && ! TARGET_SH5
;
8496 /* Define the offset between two registers, one to be eliminated, and
8497 the other its replacement, at the start of a routine. */
8500 initial_elimination_offset (int from
, int to
)
8503 int regs_saved_rounding
= 0;
8504 int total_saved_regs_space
;
8505 int total_auto_space
;
8506 int save_flags
= target_flags
;
8508 HARD_REG_SET live_regs_mask
;
8510 shmedia_space_reserved_for_target_registers
= false;
8511 regs_saved
= calc_live_regs (&live_regs_mask
);
8512 regs_saved
+= SHMEDIA_REGS_STACK_ADJUST ();
8514 if (shmedia_reserve_space_for_target_registers_p (regs_saved
, &live_regs_mask
))
8516 shmedia_space_reserved_for_target_registers
= true;
8517 regs_saved
+= shmedia_target_regs_stack_adjust (&live_regs_mask
);
8520 if (TARGET_SH5
&& regs_saved
% (STACK_BOUNDARY
/ BITS_PER_UNIT
))
8521 regs_saved_rounding
= ((STACK_BOUNDARY
/ BITS_PER_UNIT
)
8522 - regs_saved
% (STACK_BOUNDARY
/ BITS_PER_UNIT
));
8524 total_auto_space
= rounded_frame_size (regs_saved
) - regs_saved_rounding
;
8525 copy_flags
= target_flags
;
8526 target_flags
= save_flags
;
8528 total_saved_regs_space
= regs_saved
+ regs_saved_rounding
;
8530 if (from
== ARG_POINTER_REGNUM
&& to
== HARD_FRAME_POINTER_REGNUM
)
8531 return total_saved_regs_space
+ total_auto_space
8532 + crtl
->args
.info
.byref_regs
* 8;
8534 if (from
== ARG_POINTER_REGNUM
&& to
== STACK_POINTER_REGNUM
)
8535 return total_saved_regs_space
+ total_auto_space
8536 + crtl
->args
.info
.byref_regs
* 8;
8538 /* Initial gap between fp and sp is 0. */
8539 if (from
== HARD_FRAME_POINTER_REGNUM
&& to
== STACK_POINTER_REGNUM
)
8542 if (from
== FRAME_POINTER_REGNUM
&& to
== STACK_POINTER_REGNUM
)
8543 return rounded_frame_size (0);
8545 if (from
== FRAME_POINTER_REGNUM
&& to
== HARD_FRAME_POINTER_REGNUM
)
8546 return rounded_frame_size (0);
8548 gcc_assert (from
== RETURN_ADDRESS_POINTER_REGNUM
8549 && (to
== HARD_FRAME_POINTER_REGNUM
8550 || to
== STACK_POINTER_REGNUM
));
8553 int n
= total_saved_regs_space
;
8554 int pr_reg
= TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
;
8555 save_schedule schedule
;
8558 n
+= total_auto_space
;
8560 /* If it wasn't saved, there's not much we can do. */
8561 if (! TEST_HARD_REG_BIT (live_regs_mask
, pr_reg
))
8564 target_flags
= copy_flags
;
8566 sh5_schedule_saves (&live_regs_mask
, &schedule
, n
);
8567 for (entry
= &schedule
.entries
[1]; entry
->mode
!= VOIDmode
; entry
++)
8568 if (entry
->reg
== pr_reg
)
8570 target_flags
= save_flags
;
8571 return entry
->offset
;
8576 return total_auto_space
;
8579 /* Parse the -mfixed-range= option string. */
8581 sh_fix_range (const char *const_str
)
8584 char *str
, *dash
, *comma
;
8586 /* str must be of the form REG1'-'REG2{,REG1'-'REG} where REG1 and
8587 REG2 are either register names or register numbers. The effect
8588 of this option is to mark the registers in the range from REG1 to
8589 REG2 as ``fixed'' so they won't be used by the compiler. */
8591 i
= strlen (const_str
);
8592 str
= (char *) alloca (i
+ 1);
8593 memcpy (str
, const_str
, i
+ 1);
8597 dash
= strchr (str
, '-');
8600 warning (0, "value of -mfixed-range must have form REG1-REG2");
8604 comma
= strchr (dash
+ 1, ',');
8608 first
= decode_reg_name (str
);
8611 warning (0, "unknown register name: %s", str
);
8615 last
= decode_reg_name (dash
+ 1);
8618 warning (0, "unknown register name: %s", dash
+ 1);
8626 warning (0, "%s-%s is an empty range", str
, dash
+ 1);
8630 for (i
= first
; i
<= last
; ++i
)
8631 fixed_regs
[i
] = call_used_regs
[i
] = 1;
8641 /* Insert any deferred function attributes from earlier pragmas. */
8643 sh_insert_attributes (tree node
, tree
*attributes
)
8647 if (TREE_CODE (node
) != FUNCTION_DECL
)
8650 /* We are only interested in fields. */
8654 /* Append the attributes to the deferred attributes. */
8655 *sh_deferred_function_attributes_tail
= *attributes
;
8656 attrs
= sh_deferred_function_attributes
;
8660 /* Some attributes imply or require the interrupt attribute. */
8661 if (!lookup_attribute ("interrupt_handler", attrs
)
8662 && !lookup_attribute ("interrupt_handler", DECL_ATTRIBUTES (node
)))
8664 /* If we have a trapa_handler, but no interrupt_handler attribute,
8665 insert an interrupt_handler attribute. */
8666 if (lookup_attribute ("trapa_handler", attrs
) != NULL_TREE
)
8667 /* We can't use sh_pr_interrupt here because that's not in the
8670 = tree_cons (get_identifier("interrupt_handler"), NULL_TREE
, attrs
);
8671 /* However, for sp_switch, trap_exit, nosave_low_regs and resbank,
8672 if the interrupt attribute is missing, we ignore the attribute
8674 else if (lookup_attribute ("sp_switch", attrs
)
8675 || lookup_attribute ("trap_exit", attrs
)
8676 || lookup_attribute ("nosave_low_regs", attrs
)
8677 || lookup_attribute ("resbank", attrs
))
8681 for (tail
= attributes
; attrs
; attrs
= TREE_CHAIN (attrs
))
8683 if (is_attribute_p ("sp_switch", TREE_PURPOSE (attrs
))
8684 || is_attribute_p ("trap_exit", TREE_PURPOSE (attrs
))
8685 || is_attribute_p ("nosave_low_regs", TREE_PURPOSE (attrs
))
8686 || is_attribute_p ("resbank", TREE_PURPOSE (attrs
)))
8687 warning (OPT_Wattributes
,
8688 "%qE attribute only applies to interrupt functions",
8689 TREE_PURPOSE (attrs
));
8692 *tail
= tree_cons (TREE_PURPOSE (attrs
), NULL_TREE
,
8694 tail
= &TREE_CHAIN (*tail
);
8697 attrs
= *attributes
;
8701 /* Install the processed list. */
8702 *attributes
= attrs
;
8704 /* Clear deferred attributes. */
8705 sh_deferred_function_attributes
= NULL_TREE
;
8706 sh_deferred_function_attributes_tail
= &sh_deferred_function_attributes
;
8711 /* Supported attributes:
8713 interrupt_handler -- specifies this function is an interrupt handler.
8715 trapa_handler - like above, but don't save all registers.
8717 sp_switch -- specifies an alternate stack for an interrupt handler
8720 trap_exit -- use a trapa to exit an interrupt function instead of
8723 nosave_low_regs - don't save r0..r7 in an interrupt handler.
8724 This is useful on the SH3 and upwards,
8725 which has a separate set of low regs for User and Supervisor modes.
8726 This should only be used for the lowest level of interrupts. Higher levels
8727 of interrupts must save the registers in case they themselves are
8730 renesas -- use Renesas calling/layout conventions (functions and
8733 resbank -- In case of an ISR, use a register bank to save registers
8734 R0-R14, MACH, MACL, GBR and PR. This is useful only on SH2A targets.
8737 /* Handle a 'resbank' attribute. */
8739 sh_handle_resbank_handler_attribute (tree
* node
, tree name
,
8740 tree args ATTRIBUTE_UNUSED
,
8741 int flags ATTRIBUTE_UNUSED
,
8742 bool * no_add_attrs
)
8746 warning (OPT_Wattributes
, "%qE attribute is supported only for SH2A",
8748 *no_add_attrs
= true;
8750 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8752 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
8754 *no_add_attrs
= true;
8760 /* Handle an "interrupt_handler" attribute; arguments as in
8761 struct attribute_spec.handler. */
8763 sh_handle_interrupt_handler_attribute (tree
*node
, tree name
,
8764 tree args ATTRIBUTE_UNUSED
,
8765 int flags ATTRIBUTE_UNUSED
,
8768 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8770 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
8772 *no_add_attrs
= true;
8774 else if (TARGET_SHCOMPACT
)
8776 error ("attribute interrupt_handler is not compatible with -m5-compact");
8777 *no_add_attrs
= true;
8783 /* Handle an 'function_vector' attribute; arguments as in
8784 struct attribute_spec.handler. */
8786 sh2a_handle_function_vector_handler_attribute (tree
* node
, tree name
,
8787 tree args ATTRIBUTE_UNUSED
,
8788 int flags ATTRIBUTE_UNUSED
,
8789 bool * no_add_attrs
)
8793 warning (OPT_Wattributes
, "%qE attribute only applies to SH2A",
8795 *no_add_attrs
= true;
8797 else if (TREE_CODE (*node
) != FUNCTION_DECL
)
8799 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
8801 *no_add_attrs
= true;
8803 else if (TREE_CODE (TREE_VALUE (args
)) != INTEGER_CST
)
8805 /* The argument must be a constant integer. */
8806 warning (OPT_Wattributes
,
8807 "%qE attribute argument not an integer constant",
8809 *no_add_attrs
= true;
8811 else if (TREE_INT_CST_LOW (TREE_VALUE (args
)) > 255)
8813 /* The argument value must be between 0 to 255. */
8814 warning (OPT_Wattributes
,
8815 "%qE attribute argument should be between 0 to 255",
8817 *no_add_attrs
= true;
8822 /* Returns 1 if current function has been assigned the attribute
8823 'function_vector'. */
8825 sh2a_is_function_vector_call (rtx x
)
8827 if (GET_CODE (x
) == SYMBOL_REF
8828 && (SYMBOL_REF_FLAGS (x
) & SYMBOL_FLAG_FUNCVEC_FUNCTION
))
8830 tree tr
= SYMBOL_REF_DECL (x
);
8832 if (sh2a_function_vector_p (tr
))
8839 /* Returns the function vector number, if the the attribute
8840 'function_vector' is assigned, otherwise returns zero. */
8842 sh2a_get_function_vector_number (rtx x
)
8847 if ((GET_CODE (x
) == SYMBOL_REF
)
8848 && (SYMBOL_REF_FLAGS (x
) & SYMBOL_FLAG_FUNCVEC_FUNCTION
))
8850 t
= SYMBOL_REF_DECL (x
);
8852 if (TREE_CODE (t
) != FUNCTION_DECL
)
8855 list
= SH_ATTRIBUTES (t
);
8858 if (is_attribute_p ("function_vector", TREE_PURPOSE (list
)))
8860 num
= TREE_INT_CST_LOW (TREE_VALUE (TREE_VALUE (list
)));
8864 list
= TREE_CHAIN (list
);
8873 /* Handle an "sp_switch" attribute; arguments as in
8874 struct attribute_spec.handler. */
8876 sh_handle_sp_switch_attribute (tree
*node
, tree name
, tree args
,
8877 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8879 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8881 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
8883 *no_add_attrs
= true;
8885 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
8887 /* The argument must be a constant string. */
8888 warning (OPT_Wattributes
, "%qE attribute argument not a string constant",
8890 *no_add_attrs
= true;
8896 /* Handle an "trap_exit" attribute; arguments as in
8897 struct attribute_spec.handler. */
8899 sh_handle_trap_exit_attribute (tree
*node
, tree name
, tree args
,
8900 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8902 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8904 warning (OPT_Wattributes
, "%qE attribute only applies to functions",
8906 *no_add_attrs
= true;
8908 /* The argument specifies a trap number to be used in a trapa instruction
8909 at function exit (instead of an rte instruction). */
8910 else if (TREE_CODE (TREE_VALUE (args
)) != INTEGER_CST
)
8912 /* The argument must be a constant integer. */
8913 warning (OPT_Wattributes
, "%qE attribute argument not an "
8914 "integer constant", name
);
8915 *no_add_attrs
= true;
8922 sh_handle_renesas_attribute (tree
*node ATTRIBUTE_UNUSED
,
8923 tree name ATTRIBUTE_UNUSED
,
8924 tree args ATTRIBUTE_UNUSED
,
8925 int flags ATTRIBUTE_UNUSED
,
8926 bool *no_add_attrs ATTRIBUTE_UNUSED
)
8931 /* True if __attribute__((renesas)) or -mrenesas. */
8933 sh_attr_renesas_p (const_tree td
)
8940 td
= TREE_TYPE (td
);
8941 if (td
== error_mark_node
)
8943 return (lookup_attribute ("renesas", TYPE_ATTRIBUTES (td
))
8947 /* True if __attribute__((renesas)) or -mrenesas, for the current
8950 sh_cfun_attr_renesas_p (void)
8952 return sh_attr_renesas_p (current_function_decl
);
8956 sh_cfun_interrupt_handler_p (void)
8958 return (lookup_attribute ("interrupt_handler",
8959 DECL_ATTRIBUTES (current_function_decl
))
8963 /* Returns 1 if FUNC has been assigned the attribute
8964 "function_vector". */
8966 sh2a_function_vector_p (tree func
)
8969 if (TREE_CODE (func
) != FUNCTION_DECL
)
8972 list
= SH_ATTRIBUTES (func
);
8975 if (is_attribute_p ("function_vector", TREE_PURPOSE (list
)))
8978 list
= TREE_CHAIN (list
);
8983 /* Returns TRUE if given tree has the "resbank" attribute. */
8986 sh_cfun_resbank_handler_p (void)
8988 return ((lookup_attribute ("resbank",
8989 DECL_ATTRIBUTES (current_function_decl
))
8991 && (lookup_attribute ("interrupt_handler",
8992 DECL_ATTRIBUTES (current_function_decl
))
8993 != NULL_TREE
) && TARGET_SH2A
);
8996 /* Implement TARGET_CHECK_PCH_TARGET_FLAGS. */
8999 sh_check_pch_target_flags (int old_flags
)
9001 if ((old_flags
^ target_flags
) & (MASK_SH1
| MASK_SH2
| MASK_SH3
9002 | MASK_SH_E
| MASK_HARD_SH4
9003 | MASK_FPU_SINGLE
| MASK_SH4
))
9004 return _("created and used with different architectures / ABIs");
9005 if ((old_flags
^ target_flags
) & MASK_HITACHI
)
9006 return _("created and used with different ABIs");
9007 if ((old_flags
^ target_flags
) & MASK_LITTLE_ENDIAN
)
9008 return _("created and used with different endianness");
9012 /* Predicates used by the templates. */
9014 /* Returns 1 if OP is MACL, MACH or PR. The input must be a REG rtx.
9015 Used only in general_movsrc_operand. */
9018 system_reg_operand (rtx op
, enum machine_mode mode ATTRIBUTE_UNUSED
)
9030 /* Nonzero if OP is a floating point value with value 0.0. */
9033 fp_zero_operand (rtx op
)
9037 if (GET_MODE (op
) != SFmode
)
9040 REAL_VALUE_FROM_CONST_DOUBLE (r
, op
);
9041 return REAL_VALUES_EQUAL (r
, dconst0
) && ! REAL_VALUE_MINUS_ZERO (r
);
9044 /* Nonzero if OP is a floating point value with value 1.0. */
9047 fp_one_operand (rtx op
)
9051 if (GET_MODE (op
) != SFmode
)
9054 REAL_VALUE_FROM_CONST_DOUBLE (r
, op
);
9055 return REAL_VALUES_EQUAL (r
, dconst1
);
9058 /* In general mode switching is used. If we are
9059 compiling without -mfmovd, movsf_ie isn't taken into account for
9060 mode switching. We could check in machine_dependent_reorg for
9061 cases where we know we are in single precision mode, but there is
9062 interface to find that out during reload, so we must avoid
9063 choosing an fldi alternative during reload and thus failing to
9064 allocate a scratch register for the constant loading. */
9072 tertiary_reload_operand (rtx op
, enum machine_mode mode ATTRIBUTE_UNUSED
)
9074 enum rtx_code code
= GET_CODE (op
);
9075 return code
== MEM
|| (TARGET_SH4
&& code
== CONST_DOUBLE
);
9078 /* Return the TLS type for TLS symbols, 0 for otherwise. */
9080 tls_symbolic_operand (rtx op
, enum machine_mode mode ATTRIBUTE_UNUSED
)
9082 if (GET_CODE (op
) != SYMBOL_REF
)
9083 return TLS_MODEL_NONE
;
9084 return SYMBOL_REF_TLS_MODEL (op
);
9087 /* Return the destination address of a branch. */
9090 branch_dest (rtx branch
)
9092 rtx dest
= SET_SRC (PATTERN (branch
));
9095 if (GET_CODE (dest
) == IF_THEN_ELSE
)
9096 dest
= XEXP (dest
, 1);
9097 dest
= XEXP (dest
, 0);
9098 dest_uid
= INSN_UID (dest
);
9099 return INSN_ADDRESSES (dest_uid
);
9102 /* Return nonzero if REG is not used after INSN.
9103 We assume REG is a reload reg, and therefore does
9104 not live past labels. It may live past calls or jumps though. */
9106 reg_unused_after (rtx reg
, rtx insn
)
9111 /* If the reg is set by this instruction, then it is safe for our
9112 case. Disregard the case where this is a store to memory, since
9113 we are checking a register used in the store address. */
9114 set
= single_set (insn
);
9115 if (set
&& !MEM_P (SET_DEST (set
))
9116 && reg_overlap_mentioned_p (reg
, SET_DEST (set
)))
9119 while ((insn
= NEXT_INSN (insn
)))
9125 code
= GET_CODE (insn
);
9128 /* If this is a label that existed before reload, then the register
9129 if dead here. However, if this is a label added by reorg, then
9130 the register may still be live here. We can't tell the difference,
9131 so we just ignore labels completely. */
9132 if (code
== CODE_LABEL
)
9137 if (code
== JUMP_INSN
)
9140 /* If this is a sequence, we must handle them all at once.
9141 We could have for instance a call that sets the target register,
9142 and an insn in a delay slot that uses the register. In this case,
9143 we must return 0. */
9144 else if (code
== INSN
&& GET_CODE (PATTERN (insn
)) == SEQUENCE
)
9149 for (i
= 0; i
< XVECLEN (PATTERN (insn
), 0); i
++)
9151 rtx this_insn
= XVECEXP (PATTERN (insn
), 0, i
);
9152 rtx set
= single_set (this_insn
);
9154 if (CALL_P (this_insn
))
9156 else if (JUMP_P (this_insn
))
9158 if (INSN_ANNULLED_BRANCH_P (this_insn
))
9163 if (set
&& reg_overlap_mentioned_p (reg
, SET_SRC (set
)))
9165 if (set
&& reg_overlap_mentioned_p (reg
, SET_DEST (set
)))
9167 if (!MEM_P (SET_DEST (set
)))
9173 && reg_overlap_mentioned_p (reg
, PATTERN (this_insn
)))
9178 else if (code
== JUMP_INSN
)
9182 set
= single_set (insn
);
9183 if (set
&& reg_overlap_mentioned_p (reg
, SET_SRC (set
)))
9185 if (set
&& reg_overlap_mentioned_p (reg
, SET_DEST (set
)))
9186 return !MEM_P (SET_DEST (set
));
9187 if (set
== 0 && reg_overlap_mentioned_p (reg
, PATTERN (insn
)))
9190 if (code
== CALL_INSN
&& call_really_used_regs
[REGNO (reg
)])
9198 static GTY(()) rtx fpscr_rtx
;
9200 get_fpscr_rtx (void)
9204 fpscr_rtx
= gen_rtx_REG (PSImode
, FPSCR_REG
);
9205 REG_USERVAR_P (fpscr_rtx
) = 1;
9206 mark_user_reg (fpscr_rtx
);
9208 if (! reload_completed
|| mdep_reorg_phase
!= SH_AFTER_MDEP_REORG
)
9209 mark_user_reg (fpscr_rtx
);
9213 static GTY(()) tree fpscr_values
;
9216 emit_fpu_switch (rtx scratch
, int index
)
9220 if (fpscr_values
== NULL
)
9224 t
= build_index_type (integer_one_node
);
9225 t
= build_array_type (integer_type_node
, t
);
9226 t
= build_decl (BUILTINS_LOCATION
,
9227 VAR_DECL
, get_identifier ("__fpscr_values"), t
);
9228 DECL_ARTIFICIAL (t
) = 1;
9229 DECL_IGNORED_P (t
) = 1;
9230 DECL_EXTERNAL (t
) = 1;
9231 TREE_STATIC (t
) = 1;
9232 TREE_PUBLIC (t
) = 1;
9238 src
= DECL_RTL (fpscr_values
);
9239 if (!can_create_pseudo_p ())
9241 emit_move_insn (scratch
, XEXP (src
, 0));
9243 emit_insn (gen_addsi3 (scratch
, scratch
, GEN_INT (index
* 4)));
9244 src
= adjust_automodify_address (src
, PSImode
, scratch
, index
* 4);
9247 src
= adjust_address (src
, PSImode
, index
* 4);
9249 dst
= get_fpscr_rtx ();
9250 emit_move_insn (dst
, src
);
9254 emit_sf_insn (rtx pat
)
9260 emit_df_insn (rtx pat
)
9266 expand_sf_unop (rtx (*fun
) (rtx
, rtx
, rtx
), rtx
*operands
)
9268 emit_sf_insn ((*fun
) (operands
[0], operands
[1], get_fpscr_rtx ()));
9272 expand_sf_binop (rtx (*fun
) (rtx
, rtx
, rtx
, rtx
), rtx
*operands
)
9274 emit_sf_insn ((*fun
) (operands
[0], operands
[1], operands
[2],
9279 expand_df_unop (rtx (*fun
) (rtx
, rtx
, rtx
), rtx
*operands
)
9281 emit_df_insn ((*fun
) (operands
[0], operands
[1], get_fpscr_rtx ()));
9285 expand_df_binop (rtx (*fun
) (rtx
, rtx
, rtx
, rtx
), rtx
*operands
)
9287 emit_df_insn ((*fun
) (operands
[0], operands
[1], operands
[2],
9291 static rtx
get_free_reg (HARD_REG_SET
);
9293 /* This function returns a register to use to load the address to load
9294 the fpscr from. Currently it always returns r1 or r7, but when we are
9295 able to use pseudo registers after combine, or have a better mechanism
9296 for choosing a register, it should be done here. */
9297 /* REGS_LIVE is the liveness information for the point for which we
9298 need this allocation. In some bare-bones exit blocks, r1 is live at the
9299 start. We can even have all of r0..r3 being live:
9300 __complex__ long long f (double d) { if (d == 0) return 2; else return 3; }
9301 INSN before which new insns are placed with will clobber the register
9302 we return. If a basic block consists only of setting the return value
9303 register to a pseudo and using that register, the return value is not
9304 live before or after this block, yet we we'll insert our insns right in
9308 get_free_reg (HARD_REG_SET regs_live
)
9310 if (! TEST_HARD_REG_BIT (regs_live
, 1))
9311 return gen_rtx_REG (Pmode
, 1);
9313 /* Hard reg 1 is live; since this is a small register classes target,
9314 there shouldn't be anything but a jump before the function end. */
9315 gcc_assert (!TEST_HARD_REG_BIT (regs_live
, 7));
9316 return gen_rtx_REG (Pmode
, 7);
9319 /* This function will set the fpscr from memory.
9320 MODE is the mode we are setting it to. */
9322 fpscr_set_from_mem (int mode
, HARD_REG_SET regs_live
)
9324 enum attr_fp_mode fp_mode
= (enum attr_fp_mode
) mode
;
9325 enum attr_fp_mode norm_mode
= ACTUAL_NORMAL_MODE (FP_MODE
);
9328 addr_reg
= !can_create_pseudo_p () ? get_free_reg (regs_live
) : NULL_RTX
;
9329 emit_fpu_switch (addr_reg
, fp_mode
== norm_mode
);
9332 /* Is the given character a logical line separator for the assembler? */
9333 #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
9334 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
9338 sh_insn_length_adjustment (rtx insn
)
9340 /* Instructions with unfilled delay slots take up an extra two bytes for
9341 the nop in the delay slot. */
9342 if (((NONJUMP_INSN_P (insn
)
9343 && GET_CODE (PATTERN (insn
)) != USE
9344 && GET_CODE (PATTERN (insn
)) != CLOBBER
)
9346 || (JUMP_P (insn
) && !JUMP_TABLE_DATA_P (insn
)))
9347 && GET_CODE (PATTERN (NEXT_INSN (PREV_INSN (insn
)))) != SEQUENCE
9348 && get_attr_needs_delay_slot (insn
) == NEEDS_DELAY_SLOT_YES
)
9351 /* SH2e has a bug that prevents the use of annulled branches, so if
9352 the delay slot is not filled, we'll have to put a NOP in it. */
9353 if (sh_cpu_attr
== CPU_SH2E
9354 && JUMP_P (insn
) && !JUMP_TABLE_DATA_P (insn
)
9355 && get_attr_type (insn
) == TYPE_CBRANCH
9356 && GET_CODE (PATTERN (NEXT_INSN (PREV_INSN (insn
)))) != SEQUENCE
)
9359 /* sh-dsp parallel processing insn take four bytes instead of two. */
9361 if (NONJUMP_INSN_P (insn
))
9364 rtx body
= PATTERN (insn
);
9367 int maybe_label
= 1;
9369 if (GET_CODE (body
) == ASM_INPUT
)
9370 templ
= XSTR (body
, 0);
9371 else if (asm_noperands (body
) >= 0)
9373 = decode_asm_operands (body
, NULL
, NULL
, NULL
, NULL
, NULL
);
9382 while (c
== ' ' || c
== '\t');
9383 /* all sh-dsp parallel-processing insns start with p.
9384 The only non-ppi sh insn starting with p is pref.
9385 The only ppi starting with pr is prnd. */
9386 if ((c
== 'p' || c
== 'P') && strncasecmp ("re", templ
, 2))
9388 /* The repeat pseudo-insn expands two three insns, a total of
9389 six bytes in size. */
9390 else if ((c
== 'r' || c
== 'R')
9391 && ! strncasecmp ("epeat", templ
, 5))
9393 while (c
&& c
!= '\n'
9394 && ! IS_ASM_LOGICAL_LINE_SEPARATOR (c
, templ
))
9396 /* If this is a label, it is obviously not a ppi insn. */
9397 if (c
== ':' && maybe_label
)
9402 else if (c
== '\'' || c
== '"')
9407 maybe_label
= c
!= ':';
9415 /* Return TRUE for a valid displacement for the REG+disp addressing
9418 /* ??? The SH2e does not have the REG+disp addressing mode when loading values
9419 into the FRx registers. We implement this by setting the maximum offset
9420 to zero when the value is SFmode. This also restricts loading of SFmode
9421 values into the integer registers, but that can't be helped. */
9423 /* The SH allows a displacement in a QI or HI amode, but only when the
9424 other operand is R0. GCC doesn't handle this very well, so we forgot
9427 A legitimate index for a QI or HI is 0, SI can be any number 0..63,
9428 DI can be any number 0..60. */
9431 sh_legitimate_index_p (enum machine_mode mode
, rtx op
)
9433 if (CONST_INT_P (op
))
9439 /* Check if this the address of an unaligned load / store. */
9440 if (mode
== VOIDmode
)
9441 return CONST_OK_FOR_I06 (INTVAL (op
));
9443 size
= GET_MODE_SIZE (mode
);
9444 return (!(INTVAL (op
) & (size
- 1))
9445 && INTVAL (op
) >= -512 * size
9446 && INTVAL (op
) < 512 * size
);
9451 if (GET_MODE_SIZE (mode
) == 1
9452 && (unsigned) INTVAL (op
) < 4096)
9456 if ((GET_MODE_SIZE (mode
) == 4
9457 && (unsigned) INTVAL (op
) < 64
9458 && !(INTVAL (op
) & 3)
9459 && !(TARGET_SH2E
&& mode
== SFmode
))
9460 || (GET_MODE_SIZE (mode
) == 4
9461 && (unsigned) INTVAL (op
) < 16383
9462 && !(INTVAL (op
) & 3) && TARGET_SH2A
))
9465 if ((GET_MODE_SIZE (mode
) == 8
9466 && (unsigned) INTVAL (op
) < 60
9467 && !(INTVAL (op
) & 3)
9468 && !((TARGET_SH4
|| TARGET_SH2A
) && mode
== DFmode
))
9469 || ((GET_MODE_SIZE (mode
)==8)
9470 && (unsigned) INTVAL (op
) < 8192
9471 && !(INTVAL (op
) & (TARGET_SH2A_DOUBLE
? 7 : 3))
9472 && (TARGET_SH2A
&& mode
== DFmode
)))
9479 /* Recognize an RTL expression that is a valid memory address for
9481 The MODE argument is the machine mode for the MEM expression
9482 that wants to use this address.
9490 sh_legitimate_address_p (enum machine_mode mode
, rtx x
, bool strict
)
9492 if (MAYBE_BASE_REGISTER_RTX_P (x
, strict
))
9494 else if ((GET_CODE (x
) == POST_INC
|| GET_CODE (x
) == PRE_DEC
)
9496 && MAYBE_BASE_REGISTER_RTX_P (XEXP (x
, 0), strict
))
9498 else if (GET_CODE (x
) == PLUS
9499 && (mode
!= PSImode
|| reload_completed
))
9501 rtx xop0
= XEXP (x
, 0);
9502 rtx xop1
= XEXP (x
, 1);
9504 if (GET_MODE_SIZE (mode
) <= 8
9505 && MAYBE_BASE_REGISTER_RTX_P (xop0
, strict
)
9506 && sh_legitimate_index_p (mode
, xop1
))
9509 if ((ALLOW_INDEXED_ADDRESS
|| GET_MODE (x
) == DImode
9510 || ((xop0
== stack_pointer_rtx
9511 || xop0
== hard_frame_pointer_rtx
)
9512 && REG_P (xop1
) && REGNO (xop1
) == R0_REG
)
9513 || ((xop1
== stack_pointer_rtx
9514 || xop1
== hard_frame_pointer_rtx
)
9515 && REG_P (xop0
) && REGNO (xop0
) == R0_REG
))
9516 && ((!TARGET_SHMEDIA
&& GET_MODE_SIZE (mode
) <= 4)
9517 || (TARGET_SHMEDIA
&& GET_MODE_SIZE (mode
) <= 8)
9518 || ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
)
9519 && TARGET_FMOVD
&& mode
== DFmode
)))
9521 if (MAYBE_BASE_REGISTER_RTX_P (xop1
, strict
)
9522 && MAYBE_INDEX_REGISTER_RTX_P (xop0
, strict
))
9524 if (MAYBE_INDEX_REGISTER_RTX_P (xop1
, strict
)
9525 && MAYBE_BASE_REGISTER_RTX_P (xop0
, strict
))
9533 /* Return TRUE if X references a SYMBOL_REF or LABEL_REF whose symbol
9534 isn't protected by a PIC unspec. */
9536 nonpic_symbol_mentioned_p (rtx x
)
9538 register const char *fmt
;
9541 if (GET_CODE (x
) == SYMBOL_REF
|| GET_CODE (x
) == LABEL_REF
9542 || GET_CODE (x
) == PC
)
9545 /* We don't want to look into the possible MEM location of a
9546 CONST_DOUBLE, since we're not going to use it, in general. */
9547 if (GET_CODE (x
) == CONST_DOUBLE
)
9550 if (GET_CODE (x
) == UNSPEC
9551 && (XINT (x
, 1) == UNSPEC_PIC
9552 || XINT (x
, 1) == UNSPEC_GOT
9553 || XINT (x
, 1) == UNSPEC_GOTOFF
9554 || XINT (x
, 1) == UNSPEC_GOTPLT
9555 || XINT (x
, 1) == UNSPEC_GOTTPOFF
9556 || XINT (x
, 1) == UNSPEC_DTPOFF
9557 || XINT (x
, 1) == UNSPEC_TPOFF
9558 || XINT (x
, 1) == UNSPEC_PLT
9559 || XINT (x
, 1) == UNSPEC_SYMOFF
9560 || XINT (x
, 1) == UNSPEC_PCREL_SYMOFF
))
9563 fmt
= GET_RTX_FORMAT (GET_CODE (x
));
9564 for (i
= GET_RTX_LENGTH (GET_CODE (x
)) - 1; i
>= 0; i
--)
9570 for (j
= XVECLEN (x
, i
) - 1; j
>= 0; j
--)
9571 if (nonpic_symbol_mentioned_p (XVECEXP (x
, i
, j
)))
9574 else if (fmt
[i
] == 'e' && nonpic_symbol_mentioned_p (XEXP (x
, i
)))
9581 /* Convert a non-PIC address in `orig' to a PIC address using @GOT or
9582 @GOTOFF in `reg'. */
9584 legitimize_pic_address (rtx orig
, enum machine_mode mode ATTRIBUTE_UNUSED
,
9587 if (tls_symbolic_operand (orig
, Pmode
) != TLS_MODEL_NONE
)
9590 if (GET_CODE (orig
) == LABEL_REF
9591 || (GET_CODE (orig
) == SYMBOL_REF
&& SYMBOL_REF_LOCAL_P (orig
)))
9594 reg
= gen_reg_rtx (Pmode
);
9596 emit_insn (gen_symGOTOFF2reg (reg
, orig
));
9599 else if (GET_CODE (orig
) == SYMBOL_REF
)
9602 reg
= gen_reg_rtx (Pmode
);
9604 emit_insn (gen_symGOT2reg (reg
, orig
));
9610 /* Try machine-dependent ways of modifying an illegitimate address
9611 to be legitimate. If we find one, return the new, valid address.
9612 Otherwise, return X.
9614 For the SH, if X is almost suitable for indexing, but the offset is
9615 out of range, convert it into a normal form so that CSE has a chance
9616 of reducing the number of address registers used. */
9619 sh_legitimize_address (rtx x
, rtx oldx
, enum machine_mode mode
)
9622 x
= legitimize_pic_address (oldx
, mode
, NULL_RTX
);
9624 if (GET_CODE (x
) == PLUS
9625 && (GET_MODE_SIZE (mode
) == 4
9626 || GET_MODE_SIZE (mode
) == 8)
9627 && CONST_INT_P (XEXP (x
, 1))
9628 && BASE_REGISTER_RTX_P (XEXP (x
, 0))
9630 && ! ((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && mode
== DFmode
)
9631 && ! (TARGET_SH2E
&& mode
== SFmode
))
9633 rtx index_rtx
= XEXP (x
, 1);
9634 HOST_WIDE_INT offset
= INTVAL (index_rtx
), offset_base
;
9637 /* On rare occasions, we might get an unaligned pointer
9638 that is indexed in a way to give an aligned address.
9639 Therefore, keep the lower two bits in offset_base. */
9640 /* Instead of offset_base 128..131 use 124..127, so that
9641 simple add suffices. */
9643 offset_base
= ((offset
+ 4) & ~60) - 4;
9645 offset_base
= offset
& ~60;
9647 /* Sometimes the normal form does not suit DImode. We
9648 could avoid that by using smaller ranges, but that
9649 would give less optimized code when SImode is
9651 if (GET_MODE_SIZE (mode
) + offset
- offset_base
<= 64)
9653 sum
= expand_binop (Pmode
, add_optab
, XEXP (x
, 0),
9654 GEN_INT (offset_base
), NULL_RTX
, 0,
9657 return gen_rtx_PLUS (Pmode
, sum
, GEN_INT (offset
- offset_base
));
9664 /* Attempt to replace *P, which is an address that needs reloading, with
9665 a valid memory address for an operand of mode MODE.
9666 Like for sh_legitimize_address, for the SH we try to get a normal form
9667 of the address. That will allow inheritance of the address reloads. */
9670 sh_legitimize_reload_address (rtx
*p
, enum machine_mode mode
, int opnum
,
9673 enum reload_type type
= (enum reload_type
) itype
;
9675 if (GET_CODE (*p
) == PLUS
9676 && (GET_MODE_SIZE (mode
) == 4 || GET_MODE_SIZE (mode
) == 8)
9677 && CONST_INT_P (XEXP (*p
, 1))
9678 && MAYBE_BASE_REGISTER_RTX_P (XEXP (*p
, 0), true)
9680 && ! (TARGET_SH4
&& mode
== DFmode
)
9681 && ! (mode
== PSImode
&& type
== RELOAD_FOR_INPUT_ADDRESS
)
9682 && (ALLOW_INDEXED_ADDRESS
9683 || XEXP (*p
, 0) == stack_pointer_rtx
9684 || XEXP (*p
, 0) == hard_frame_pointer_rtx
))
9686 rtx index_rtx
= XEXP (*p
, 1);
9687 HOST_WIDE_INT offset
= INTVAL (index_rtx
), offset_base
;
9690 if (TARGET_SH2A
&& mode
== DFmode
&& (offset
& 0x7))
9692 push_reload (*p
, NULL_RTX
, p
, NULL
,
9693 BASE_REG_CLASS
, Pmode
, VOIDmode
, 0, 0, opnum
, type
);
9696 if (TARGET_SH2E
&& mode
== SFmode
)
9699 push_reload (*p
, NULL_RTX
, p
, NULL
,
9700 BASE_REG_CLASS
, Pmode
, VOIDmode
, 0, 0, opnum
, type
);
9703 /* Instead of offset_base 128..131 use 124..127, so that
9704 simple add suffices. */
9706 offset_base
= ((offset
+ 4) & ~60) - 4;
9708 offset_base
= offset
& ~60;
9709 /* Sometimes the normal form does not suit DImode. We could avoid
9710 that by using smaller ranges, but that would give less optimized
9711 code when SImode is prevalent. */
9712 if (GET_MODE_SIZE (mode
) + offset
- offset_base
<= 64)
9714 sum
= gen_rtx_PLUS (Pmode
, XEXP (*p
, 0), GEN_INT (offset_base
));
9715 *p
= gen_rtx_PLUS (Pmode
, sum
, GEN_INT (offset
- offset_base
));
9716 push_reload (sum
, NULL_RTX
, &XEXP (*p
, 0), NULL
,
9717 BASE_REG_CLASS
, Pmode
, VOIDmode
, 0, 0, opnum
, type
);
9721 /* We must re-recognize what we created before. */
9722 else if (GET_CODE (*p
) == PLUS
9723 && (GET_MODE_SIZE (mode
) == 4 || GET_MODE_SIZE (mode
) == 8)
9724 && GET_CODE (XEXP (*p
, 0)) == PLUS
9725 && CONST_INT_P (XEXP (XEXP (*p
, 0), 1))
9726 && MAYBE_BASE_REGISTER_RTX_P (XEXP (XEXP (*p
, 0), 0), true)
9727 && CONST_INT_P (XEXP (*p
, 1))
9729 && ! (TARGET_SH2E
&& mode
== SFmode
))
9731 /* Because this address is so complex, we know it must have
9732 been created by LEGITIMIZE_RELOAD_ADDRESS before; thus,
9733 it is already unshared, and needs no further unsharing. */
9734 push_reload (XEXP (*p
, 0), NULL_RTX
, &XEXP (*p
, 0), NULL
,
9735 BASE_REG_CLASS
, Pmode
, VOIDmode
, 0, 0, opnum
, type
);
9745 /* Mark the use of a constant in the literal table. If the constant
9746 has multiple labels, make it unique. */
9748 mark_constant_pool_use (rtx x
)
9750 rtx insn
, lab
, pattern
;
9755 switch (GET_CODE (x
))
9765 /* Get the first label in the list of labels for the same constant
9766 and delete another labels in the list. */
9768 for (insn
= PREV_INSN (x
); insn
; insn
= PREV_INSN (insn
))
9771 || LABEL_REFS (insn
) != NEXT_INSN (insn
))
9776 for (insn
= LABEL_REFS (lab
); insn
; insn
= LABEL_REFS (insn
))
9777 INSN_DELETED_P (insn
) = 1;
9779 /* Mark constants in a window. */
9780 for (insn
= NEXT_INSN (x
); insn
; insn
= NEXT_INSN (insn
))
9782 if (!NONJUMP_INSN_P (insn
))
9785 pattern
= PATTERN (insn
);
9786 if (GET_CODE (pattern
) != UNSPEC_VOLATILE
)
9789 switch (XINT (pattern
, 1))
9791 case UNSPECV_CONST2
:
9792 case UNSPECV_CONST4
:
9793 case UNSPECV_CONST8
:
9794 XVECEXP (pattern
, 0, 1) = const1_rtx
;
9796 case UNSPECV_WINDOW_END
:
9797 if (XVECEXP (pattern
, 0, 0) == x
)
9800 case UNSPECV_CONST_END
:
9810 /* Return true if it's possible to redirect BRANCH1 to the destination
9811 of an unconditional jump BRANCH2. We only want to do this if the
9812 resulting branch will have a short displacement. */
9814 sh_can_redirect_branch (rtx branch1
, rtx branch2
)
9816 if (flag_expensive_optimizations
&& simplejump_p (branch2
))
9818 rtx dest
= XEXP (SET_SRC (single_set (branch2
)), 0);
9822 for (distance
= 0, insn
= NEXT_INSN (branch1
);
9823 insn
&& distance
< 256;
9824 insn
= PREV_INSN (insn
))
9829 distance
+= get_attr_length (insn
);
9831 for (distance
= 0, insn
= NEXT_INSN (branch1
);
9832 insn
&& distance
< 256;
9833 insn
= NEXT_INSN (insn
))
9838 distance
+= get_attr_length (insn
);
9844 /* Return nonzero if register old_reg can be renamed to register new_reg. */
9846 sh_hard_regno_rename_ok (unsigned int old_reg ATTRIBUTE_UNUSED
,
9847 unsigned int new_reg
)
9849 /* Interrupt functions can only use registers that have already been
9850 saved by the prologue, even if they would normally be
9853 if (sh_cfun_interrupt_handler_p () && !df_regs_ever_live_p (new_reg
))
9859 /* Function to update the integer COST
9860 based on the relationship between INSN that is dependent on
9861 DEP_INSN through the dependence LINK. The default is to make no
9862 adjustment to COST. This can be used for example to specify to
9863 the scheduler that an output- or anti-dependence does not incur
9864 the same cost as a data-dependence. The return value should be
9865 the new value for COST. */
9867 sh_adjust_cost (rtx insn
, rtx link ATTRIBUTE_UNUSED
, rtx dep_insn
, int cost
)
9873 /* On SHmedia, if the dependence is an anti-dependence or
9874 output-dependence, there is no cost. */
9875 if (REG_NOTE_KIND (link
) != 0)
9877 /* However, dependencies between target register loads and
9878 uses of the register in a subsequent block that are separated
9879 by a conditional branch are not modelled - we have to do with
9880 the anti-dependency between the target register load and the
9881 conditional branch that ends the current block. */
9882 if (REG_NOTE_KIND (link
) == REG_DEP_ANTI
9883 && GET_CODE (PATTERN (dep_insn
)) == SET
9884 && (get_attr_type (dep_insn
) == TYPE_PT_MEDIA
9885 || get_attr_type (dep_insn
) == TYPE_PTABS_MEDIA
)
9886 && get_attr_type (insn
) == TYPE_CBRANCH_MEDIA
)
9888 int orig_cost
= cost
;
9889 rtx note
= find_reg_note (insn
, REG_BR_PROB
, 0);
9890 rtx target
= ((! note
9891 || INTVAL (XEXP (note
, 0)) * 2 < REG_BR_PROB_BASE
)
9892 ? insn
: JUMP_LABEL (insn
));
9893 /* On the likely path, the branch costs 1, on the unlikely path,
9897 target
= next_active_insn (target
);
9898 while (target
&& ! flow_dependent_p (target
, dep_insn
)
9900 /* If two branches are executed in immediate succession, with the
9901 first branch properly predicted, this causes a stall at the
9902 second branch, hence we won't need the target for the
9903 second branch for two cycles after the launch of the first
9905 if (cost
> orig_cost
- 2)
9906 cost
= orig_cost
- 2;
9912 else if (get_attr_is_mac_media (insn
)
9913 && get_attr_is_mac_media (dep_insn
))
9916 else if (! reload_completed
9917 && GET_CODE (PATTERN (insn
)) == SET
9918 && GET_CODE (SET_SRC (PATTERN (insn
))) == FLOAT
9919 && GET_CODE (PATTERN (dep_insn
)) == SET
9920 && fp_arith_reg_operand (SET_SRC (PATTERN (dep_insn
)), VOIDmode
)
9923 /* Schedule the ptabs for a casesi_jump_media in preference to stuff
9924 that is needed at the target. */
9925 else if (get_attr_type (insn
) == TYPE_JUMP_MEDIA
9926 && ! flow_dependent_p (insn
, dep_insn
))
9929 else if (REG_NOTE_KIND (link
) == 0)
9931 enum attr_type type
;
9934 if (recog_memoized (insn
) < 0
9935 || recog_memoized (dep_insn
) < 0)
9938 dep_set
= single_set (dep_insn
);
9940 /* The latency that we specify in the scheduling description refers
9941 to the actual output, not to an auto-increment register; for that,
9942 the latency is one. */
9943 if (dep_set
&& MEM_P (SET_SRC (dep_set
)) && cost
> 1)
9945 rtx set
= single_set (insn
);
9948 && !reg_mentioned_p (SET_DEST (dep_set
), SET_SRC (set
))
9949 && (!MEM_P (SET_DEST (set
))
9950 || !reg_mentioned_p (SET_DEST (dep_set
),
9951 XEXP (SET_DEST (set
), 0))))
9954 /* The only input for a call that is timing-critical is the
9955 function's address. */
9958 rtx call
= PATTERN (insn
);
9960 if (GET_CODE (call
) == PARALLEL
)
9961 call
= XVECEXP (call
, 0 ,0);
9962 if (GET_CODE (call
) == SET
)
9963 call
= SET_SRC (call
);
9964 if (GET_CODE (call
) == CALL
&& MEM_P (XEXP (call
, 0))
9965 /* sibcalli_thunk uses a symbol_ref in an unspec. */
9966 && (GET_CODE (XEXP (XEXP (call
, 0), 0)) == UNSPEC
9967 || ! reg_set_p (XEXP (XEXP (call
, 0), 0), dep_insn
)))
9968 cost
-= TARGET_SH4_300
? 3 : 6;
9970 /* Likewise, the most timing critical input for an sfuncs call
9971 is the function address. However, sfuncs typically start
9972 using their arguments pretty quickly.
9973 Assume a four cycle delay for SH4 before they are needed.
9974 Cached ST40-300 calls are quicker, so assume only a one
9976 ??? Maybe we should encode the delays till input registers
9977 are needed by sfuncs into the sfunc call insn. */
9978 /* All sfunc calls are parallels with at least four components.
9979 Exploit this to avoid unnecessary calls to sfunc_uses_reg. */
9980 else if (GET_CODE (PATTERN (insn
)) == PARALLEL
9981 && XVECLEN (PATTERN (insn
), 0) >= 4
9982 && (reg
= sfunc_uses_reg (insn
)))
9984 if (! reg_set_p (reg
, dep_insn
))
9985 cost
-= TARGET_SH4_300
? 1 : 4;
9987 if (TARGET_HARD_SH4
&& !TARGET_SH4_300
)
9989 enum attr_type dep_type
= get_attr_type (dep_insn
);
9991 if (dep_type
== TYPE_FLOAD
|| dep_type
== TYPE_PCFLOAD
)
9993 else if ((dep_type
== TYPE_LOAD_SI
|| dep_type
== TYPE_PCLOAD_SI
)
9994 && (type
= get_attr_type (insn
)) != TYPE_CALL
9995 && type
!= TYPE_SFUNC
)
9997 /* When the preceding instruction loads the shift amount of
9998 the following SHAD/SHLD, the latency of the load is increased
10000 if (get_attr_type (insn
) == TYPE_DYN_SHIFT
10001 && get_attr_any_int_load (dep_insn
) == ANY_INT_LOAD_YES
10002 && reg_overlap_mentioned_p (SET_DEST (dep_set
),
10003 XEXP (SET_SRC (single_set (insn
)),
10006 /* When an LS group instruction with a latency of less than
10007 3 cycles is followed by a double-precision floating-point
10008 instruction, FIPR, or FTRV, the latency of the first
10009 instruction is increased to 3 cycles. */
10011 && get_attr_insn_class (dep_insn
) == INSN_CLASS_LS_GROUP
10012 && get_attr_dfp_comp (insn
) == DFP_COMP_YES
)
10014 /* The lsw register of a double-precision computation is ready one
10016 else if (reload_completed
10017 && get_attr_dfp_comp (dep_insn
) == DFP_COMP_YES
10018 && (use_pat
= single_set (insn
))
10019 && ! regno_use_in (REGNO (SET_DEST (single_set (dep_insn
))),
10020 SET_SRC (use_pat
)))
10023 if (get_attr_any_fp_comp (dep_insn
) == ANY_FP_COMP_YES
10024 && get_attr_late_fp_use (insn
) == LATE_FP_USE_YES
)
10027 else if (TARGET_SH4_300
)
10029 /* Stores need their input register two cycles later. */
10030 if (dep_set
&& cost
>= 1
10031 && ((type
= get_attr_type (insn
)) == TYPE_STORE
10032 || type
== TYPE_PSTORE
10033 || type
== TYPE_FSTORE
|| type
== TYPE_MAC_MEM
))
10035 rtx set
= single_set (insn
);
10037 if (!reg_mentioned_p (SET_SRC (set
), XEXP (SET_DEST (set
), 0))
10038 && rtx_equal_p (SET_SRC (set
), SET_DEST (dep_set
)))
10041 /* But don't reduce the cost below 1 if the address depends
10042 on a side effect of dep_insn. */
10044 && modified_in_p (XEXP (SET_DEST (set
), 0), dep_insn
))
10050 /* An anti-dependence penalty of two applies if the first insn is a double
10051 precision fadd / fsub / fmul. */
10052 else if (!TARGET_SH4_300
10053 && REG_NOTE_KIND (link
) == REG_DEP_ANTI
10054 && recog_memoized (dep_insn
) >= 0
10055 && (get_attr_type (dep_insn
) == TYPE_DFP_ARITH
10056 || get_attr_type (dep_insn
) == TYPE_DFP_MUL
)
10057 /* A lot of alleged anti-flow dependences are fake,
10058 so check this one is real. */
10059 && flow_dependent_p (dep_insn
, insn
))
10065 /* Check if INSN is flow-dependent on DEP_INSN. Can also be used to check
10066 if DEP_INSN is anti-flow dependent on INSN. */
10068 flow_dependent_p (rtx insn
, rtx dep_insn
)
10070 rtx tmp
= PATTERN (insn
);
10072 note_stores (PATTERN (dep_insn
), flow_dependent_p_1
, &tmp
);
10073 return tmp
== NULL_RTX
;
10076 /* A helper function for flow_dependent_p called through note_stores. */
10078 flow_dependent_p_1 (rtx x
, const_rtx pat ATTRIBUTE_UNUSED
, void *data
)
10080 rtx
* pinsn
= (rtx
*) data
;
10082 if (*pinsn
&& reg_referenced_p (x
, *pinsn
))
10086 /* For use by sh_allocate_initial_value. Note that sh.md contains some
10087 'special function' patterns (type sfunc) that clobber pr, but that
10088 do not look like function calls to leaf_function_p. Hence we must
10089 do this extra check. */
10091 sh_pr_n_sets (void)
10093 return DF_REG_DEF_COUNT (TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
);
10096 /* Return where to allocate pseudo for a given hard register initial
10099 sh_allocate_initial_value (rtx hard_reg
)
10103 if (REGNO (hard_reg
) == (TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
))
10105 if (current_function_is_leaf
10106 && ! sh_pr_n_sets ()
10107 && ! (TARGET_SHCOMPACT
10108 && ((crtl
->args
.info
.call_cookie
10109 & ~ CALL_COOKIE_RET_TRAMP (1))
10110 || crtl
->saves_all_registers
)))
10113 x
= gen_frame_mem (Pmode
, return_address_pointer_rtx
);
10121 /* This function returns "2" to indicate dual issue for the SH4
10122 processor. To be used by the DFA pipeline description. */
10124 sh_issue_rate (void)
10126 if (TARGET_SUPERSCALAR
)
10132 /* Functions for ready queue reordering for sched1. */
10134 /* Get weight for mode for a set x. */
10136 find_set_regmode_weight (rtx x
, enum machine_mode mode
)
10138 if (GET_CODE (x
) == CLOBBER
&& register_operand (SET_DEST (x
), mode
))
10140 if (GET_CODE (x
) == SET
&& register_operand (SET_DEST (x
), mode
))
10142 if (REG_P (SET_DEST (x
)))
10144 if (!reg_mentioned_p (SET_DEST (x
), SET_SRC (x
)))
10154 /* Get regmode weight for insn. */
10156 find_insn_regmode_weight (rtx insn
, enum machine_mode mode
)
10158 short reg_weight
= 0;
10161 /* Increment weight for each register born here. */
10162 x
= PATTERN (insn
);
10163 reg_weight
+= find_set_regmode_weight (x
, mode
);
10164 if (GET_CODE (x
) == PARALLEL
)
10167 for (j
= XVECLEN (x
, 0) - 1; j
>= 0; j
--)
10169 x
= XVECEXP (PATTERN (insn
), 0, j
);
10170 reg_weight
+= find_set_regmode_weight (x
, mode
);
10173 /* Decrement weight for each register that dies here. */
10174 for (x
= REG_NOTES (insn
); x
; x
= XEXP (x
, 1))
10176 if (REG_NOTE_KIND (x
) == REG_DEAD
|| REG_NOTE_KIND (x
) == REG_UNUSED
)
10178 rtx note
= XEXP (x
, 0);
10179 if (REG_P (note
) && GET_MODE (note
) == mode
)
10186 /* Calculate regmode weights for all insns of a basic block. */
10188 find_regmode_weight (basic_block b
, enum machine_mode mode
)
10190 rtx insn
, next_tail
, head
, tail
;
10192 get_ebb_head_tail (b
, b
, &head
, &tail
);
10193 next_tail
= NEXT_INSN (tail
);
10195 for (insn
= head
; insn
!= next_tail
; insn
= NEXT_INSN (insn
))
10197 /* Handle register life information. */
10198 if (!INSN_P (insn
))
10201 if (mode
== SFmode
)
10202 INSN_REGMODE_WEIGHT (insn
, mode
) =
10203 find_insn_regmode_weight (insn
, mode
) + 2 * find_insn_regmode_weight (insn
, DFmode
);
10204 else if (mode
== SImode
)
10205 INSN_REGMODE_WEIGHT (insn
, mode
) =
10206 find_insn_regmode_weight (insn
, mode
) + 2 * find_insn_regmode_weight (insn
, DImode
);
10210 /* Comparison function for ready queue sorting. */
10212 rank_for_reorder (const void *x
, const void *y
)
10214 rtx tmp
= *(const rtx
*) y
;
10215 rtx tmp2
= *(const rtx
*) x
;
10217 /* The insn in a schedule group should be issued the first. */
10218 if (SCHED_GROUP_P (tmp
) != SCHED_GROUP_P (tmp2
))
10219 return SCHED_GROUP_P (tmp2
) ? 1 : -1;
10221 /* If insns are equally good, sort by INSN_LUID (original insn order), This
10222 minimizes instruction movement, thus minimizing sched's effect on
10223 register pressure. */
10224 return INSN_LUID (tmp
) - INSN_LUID (tmp2
);
10227 /* Resort the array A in which only element at index N may be out of order. */
10229 swap_reorder (rtx
*a
, int n
)
10231 rtx insn
= a
[n
- 1];
10234 while (i
>= 0 && rank_for_reorder (a
+ i
, &insn
) >= 0)
10242 #define SCHED_REORDER(READY, N_READY) \
10245 if ((N_READY) == 2) \
10246 swap_reorder (READY, N_READY); \
10247 else if ((N_READY) > 2) \
10248 qsort (READY, N_READY, sizeof (rtx), rank_for_reorder); \
10252 /* Sort the ready list READY by ascending priority, using the SCHED_REORDER
10255 ready_reorder (rtx
*ready
, int nready
)
10257 SCHED_REORDER (ready
, nready
);
10260 /* Count life regions of r0 for a block. */
10262 find_r0_life_regions (basic_block b
)
10271 if (REGNO_REG_SET_P (df_get_live_in (b
), R0_REG
))
10282 insn
= BB_HEAD (b
);
10284 r0_reg
= gen_rtx_REG (SImode
, R0_REG
);
10289 if (find_regno_note (insn
, REG_DEAD
, R0_REG
))
10295 && (pset
= single_set (insn
))
10296 && reg_overlap_mentioned_p (r0_reg
, SET_DEST (pset
))
10297 && !find_regno_note (insn
, REG_UNUSED
, R0_REG
))
10305 insn
= NEXT_INSN (insn
);
10307 return set
- death
;
10310 /* Calculate regmode weights for all insns of all basic block. */
10312 sh_md_init_global (FILE *dump ATTRIBUTE_UNUSED
,
10313 int verbose ATTRIBUTE_UNUSED
,
10318 regmode_weight
[0] = (short *) xcalloc (old_max_uid
, sizeof (short));
10319 regmode_weight
[1] = (short *) xcalloc (old_max_uid
, sizeof (short));
10320 r0_life_regions
= 0;
10322 FOR_EACH_BB_REVERSE (b
)
10324 find_regmode_weight (b
, SImode
);
10325 find_regmode_weight (b
, SFmode
);
10326 if (!reload_completed
)
10327 r0_life_regions
+= find_r0_life_regions (b
);
10330 CURR_REGMODE_PRESSURE (SImode
) = 0;
10331 CURR_REGMODE_PRESSURE (SFmode
) = 0;
10337 sh_md_finish_global (FILE *dump ATTRIBUTE_UNUSED
,
10338 int verbose ATTRIBUTE_UNUSED
)
10340 if (regmode_weight
[0])
10342 free (regmode_weight
[0]);
10343 regmode_weight
[0] = NULL
;
10345 if (regmode_weight
[1])
10347 free (regmode_weight
[1]);
10348 regmode_weight
[1] = NULL
;
10352 /* The scalar modes supported differs from the default version in TImode
10353 for 32-bit SHMEDIA. */
10355 sh_scalar_mode_supported_p (enum machine_mode mode
)
10357 if (TARGET_SHMEDIA32
&& mode
== TImode
)
10360 return default_scalar_mode_supported_p (mode
);
10363 /* Cache the can_issue_more so that we can return it from reorder2. Also,
10364 keep count of register pressures on SImode and SFmode. */
10366 sh_variable_issue (FILE *dump ATTRIBUTE_UNUSED
,
10367 int sched_verbose ATTRIBUTE_UNUSED
,
10369 int can_issue_more
)
10371 if (GET_CODE (PATTERN (insn
)) != USE
10372 && GET_CODE (PATTERN (insn
)) != CLOBBER
)
10373 cached_can_issue_more
= can_issue_more
- 1;
10375 cached_can_issue_more
= can_issue_more
;
10377 if (reload_completed
)
10378 return cached_can_issue_more
;
10380 CURR_REGMODE_PRESSURE (SImode
) += INSN_REGMODE_WEIGHT (insn
, SImode
);
10381 CURR_REGMODE_PRESSURE (SFmode
) += INSN_REGMODE_WEIGHT (insn
, SFmode
);
10383 return cached_can_issue_more
;
10387 sh_md_init (FILE *dump ATTRIBUTE_UNUSED
,
10388 int verbose ATTRIBUTE_UNUSED
,
10389 int veclen ATTRIBUTE_UNUSED
)
10391 CURR_REGMODE_PRESSURE (SImode
) = 0;
10392 CURR_REGMODE_PRESSURE (SFmode
) = 0;
10395 /* Some magic numbers. */
10396 /* Pressure on register r0 can lead to spill failures. so avoid sched1 for
10397 functions that already have high pressure on r0. */
10398 #define R0_MAX_LIFE_REGIONS 2
10399 /* Register Pressure thresholds for SImode and SFmode registers. */
10400 #define SIMODE_MAX_WEIGHT 5
10401 #define SFMODE_MAX_WEIGHT 10
10403 /* Return true if the pressure is high for MODE. */
10405 high_pressure (enum machine_mode mode
)
10407 /* Pressure on register r0 can lead to spill failures. so avoid sched1 for
10408 functions that already have high pressure on r0. */
10409 if (r0_life_regions
>= R0_MAX_LIFE_REGIONS
)
10412 if (mode
== SFmode
)
10413 return (CURR_REGMODE_PRESSURE (SFmode
) > SFMODE_MAX_WEIGHT
);
10415 return (CURR_REGMODE_PRESSURE (SImode
) > SIMODE_MAX_WEIGHT
);
10418 /* Reorder ready queue if register pressure is high. */
10420 sh_reorder (FILE *dump ATTRIBUTE_UNUSED
,
10421 int sched_verbose ATTRIBUTE_UNUSED
,
10424 int clock_var ATTRIBUTE_UNUSED
)
10426 if (reload_completed
)
10427 return sh_issue_rate ();
10429 if (high_pressure (SFmode
) || high_pressure (SImode
))
10431 ready_reorder (ready
, *n_readyp
);
10434 return sh_issue_rate ();
10437 /* Skip cycles if the current register pressure is high. */
10439 sh_reorder2 (FILE *dump ATTRIBUTE_UNUSED
,
10440 int sched_verbose ATTRIBUTE_UNUSED
,
10441 rtx
*ready ATTRIBUTE_UNUSED
,
10442 int *n_readyp ATTRIBUTE_UNUSED
,
10443 int clock_var ATTRIBUTE_UNUSED
)
10445 if (reload_completed
)
10446 return cached_can_issue_more
;
10448 if (high_pressure(SFmode
) || high_pressure (SImode
))
10451 return cached_can_issue_more
;
10454 /* Skip cycles without sorting the ready queue. This will move insn from
10455 Q->R. If this is the last cycle we are skipping; allow sorting of ready
10456 queue by sh_reorder. */
10458 /* Generally, skipping these many cycles are sufficient for all insns to move
10460 #define MAX_SKIPS 8
10463 sh_dfa_new_cycle (FILE *sched_dump ATTRIBUTE_UNUSED
,
10464 int sched_verbose ATTRIBUTE_UNUSED
,
10465 rtx insn ATTRIBUTE_UNUSED
,
10466 int last_clock_var
,
10470 if (reload_completed
)
10475 if ((clock_var
- last_clock_var
) < MAX_SKIPS
)
10480 /* If this is the last cycle we are skipping, allow reordering of R. */
10481 if ((clock_var
- last_clock_var
) == MAX_SKIPS
)
10493 /* SHmedia requires registers for branches, so we can't generate new
10494 branches past reload. */
10496 sh_cannot_modify_jumps_p (void)
10498 return (TARGET_SHMEDIA
&& (reload_in_progress
|| reload_completed
));
10501 static enum reg_class
10502 sh_target_reg_class (void)
10504 return TARGET_SHMEDIA
? TARGET_REGS
: NO_REGS
;
10508 sh_optimize_target_register_callee_saved (bool after_prologue_epilogue_gen
)
10510 HARD_REG_SET dummy
;
10515 if (! shmedia_space_reserved_for_target_registers
)
10517 if (after_prologue_epilogue_gen
&& ! TARGET_SAVE_ALL_TARGET_REGS
)
10519 if (calc_live_regs (&dummy
) >= 6 * 8)
10525 sh_ms_bitfield_layout_p (const_tree record_type ATTRIBUTE_UNUSED
)
10527 return (TARGET_SH5
|| TARGET_HITACHI
|| sh_attr_renesas_p (record_type
));
10531 On the SH1..SH4, the trampoline looks like
10532 2 0002 D202 mov.l l2,r2
10533 1 0000 D301 mov.l l1,r3
10534 3 0004 422B jmp @r2
10536 5 0008 00000000 l1: .long area
10537 6 000c 00000000 l2: .long function
10539 SH5 (compact) uses r1 instead of r3 for the static chain. */
10542 /* Emit RTL insns to initialize the variable parts of a trampoline.
10543 FNADDR is an RTX for the address of the function's pure code.
10544 CXT is an RTX for the static chain value for the function. */
10547 sh_trampoline_init (rtx tramp_mem
, tree fndecl
, rtx cxt
)
10549 rtx fnaddr
= XEXP (DECL_RTL (fndecl
), 0);
10550 rtx tramp
= force_reg (Pmode
, XEXP (tramp_mem
, 0));
10552 if (TARGET_SHMEDIA64
)
10557 rtx movi1
= GEN_INT (0xcc000010);
10558 rtx shori1
= GEN_INT (0xc8000010);
10561 /* The following trampoline works within a +- 128 KB range for cxt:
10562 ptb/u cxt,tr1; movi fnaddr >> 48,r0; shori fnaddr >> 32,r0;
10563 shori fnaddr >> 16,r0; shori fnaddr,r0; ptabs/l r0,tr0
10564 gettr tr1,r1; blink tr0,r63 */
10565 /* Address rounding makes it hard to compute the exact bounds of the
10566 offset for this trampoline, but we have a rather generous offset
10567 range, so frame_offset should do fine as an upper bound. */
10568 if (cxt
== virtual_stack_vars_rtx
&& frame_offset
< 0x20000)
10570 /* ??? could optimize this trampoline initialization
10571 by writing DImode words with two insns each. */
10572 rtx mask
= force_reg (DImode
, GEN_INT (0x3fffc00));
10573 rtx insn
= gen_rtx_MINUS (DImode
, cxt
, tramp
);
10574 insn
= gen_rtx_ASHIFT (DImode
, insn
, GEN_INT (10-2));
10575 insn
= gen_rtx_AND (DImode
, insn
, mask
);
10576 /* Or in ptb/u .,tr1 pattern */
10577 insn
= gen_rtx_IOR (DImode
, insn
, gen_int_mode (0xec000010, SImode
));
10578 insn
= force_operand (insn
, NULL_RTX
);
10579 insn
= gen_lowpart (SImode
, insn
);
10580 emit_move_insn (change_address (tramp_mem
, SImode
, NULL_RTX
), insn
);
10581 insn
= gen_rtx_LSHIFTRT (DImode
, fnaddr
, GEN_INT (38));
10582 insn
= gen_rtx_AND (DImode
, insn
, mask
);
10583 insn
= force_operand (gen_rtx_IOR (DImode
, movi1
, insn
), NULL_RTX
);
10584 insn
= gen_lowpart (SImode
, insn
);
10585 emit_move_insn (adjust_address (tramp_mem
, SImode
, 4), insn
);
10586 insn
= gen_rtx_LSHIFTRT (DImode
, fnaddr
, GEN_INT (22));
10587 insn
= gen_rtx_AND (DImode
, insn
, mask
);
10588 insn
= force_operand (gen_rtx_IOR (DImode
, shori1
, insn
), NULL_RTX
);
10589 insn
= gen_lowpart (SImode
, insn
);
10590 emit_move_insn (adjust_address (tramp_mem
, SImode
, 8), insn
);
10591 insn
= gen_rtx_LSHIFTRT (DImode
, fnaddr
, GEN_INT (6));
10592 insn
= gen_rtx_AND (DImode
, insn
, mask
);
10593 insn
= force_operand (gen_rtx_IOR (DImode
, shori1
, insn
), NULL_RTX
);
10594 insn
= gen_lowpart (SImode
, insn
);
10595 emit_move_insn (adjust_address (tramp_mem
, SImode
, 12), insn
);
10596 insn
= gen_rtx_ASHIFT (DImode
, fnaddr
, GEN_INT (10));
10597 insn
= gen_rtx_AND (DImode
, insn
, mask
);
10598 insn
= force_operand (gen_rtx_IOR (DImode
, shori1
, insn
), NULL_RTX
);
10599 insn
= gen_lowpart (SImode
, insn
);
10600 emit_move_insn (adjust_address (tramp_mem
, SImode
, 16), insn
);
10601 emit_move_insn (adjust_address (tramp_mem
, SImode
, 20),
10602 GEN_INT (0x6bf10600));
10603 emit_move_insn (adjust_address (tramp_mem
, SImode
, 24),
10604 GEN_INT (0x4415fc10));
10605 emit_move_insn (adjust_address (tramp_mem
, SImode
, 28),
10606 GEN_INT (0x4401fff0));
10607 emit_insn (gen_ic_invalidate_line (tramp
));
10610 tramp_templ
= gen_rtx_SYMBOL_REF (Pmode
,"__GCC_nested_trampoline");
10611 fixed_len
= TRAMPOLINE_SIZE
- 2 * GET_MODE_SIZE (Pmode
);
10613 tramp_templ
= gen_datalabel_ref (tramp_templ
);
10615 src
= gen_const_mem (BLKmode
, tramp_templ
);
10616 set_mem_align (dst
, 256);
10617 set_mem_align (src
, 64);
10618 emit_block_move (dst
, src
, GEN_INT (fixed_len
), BLOCK_OP_NORMAL
);
10620 emit_move_insn (adjust_address (tramp_mem
, Pmode
, fixed_len
), fnaddr
);
10621 emit_move_insn (adjust_address (tramp_mem
, Pmode
,
10622 fixed_len
+ GET_MODE_SIZE (Pmode
)),
10624 emit_insn (gen_ic_invalidate_line (tramp
));
10627 else if (TARGET_SHMEDIA
)
10629 /* movi fnaddr >> 16,r1; shori fnaddr,r1; ptabs/l r1,tr0
10630 movi cxt >> 16,r1; shori cxt,r1; blink tr0,r63 */
10631 rtx quad0
= gen_reg_rtx (DImode
), cxtload
= gen_reg_rtx (DImode
);
10632 rtx quad1
= gen_reg_rtx (DImode
), quad2
= gen_reg_rtx (DImode
);
10633 /* movi 0,r1: 0xcc000010 shori 0,r1: c8000010 concatenated,
10634 rotated 10 right, and higher 16 bit of every 32 selected. */
10636 = force_reg (V2HImode
, (simplify_gen_subreg
10637 (V2HImode
, GEN_INT (0x4330432), SImode
, 0)));
10638 rtx ptabs
= force_reg (DImode
, GEN_INT (0x6bf10600));
10639 rtx blink
= force_reg (DImode
, GEN_INT (0x4401fff0));
10641 fnaddr
= force_reg (SImode
, fnaddr
);
10642 cxt
= force_reg (SImode
, cxt
);
10643 emit_insn (gen_mshflo_w_x (gen_rtx_SUBREG (V4HImode
, quad0
, 0),
10644 gen_rtx_SUBREG (V2HImode
, fnaddr
, 0),
10646 emit_insn (gen_rotrdi3_mextr (quad0
, quad0
,
10647 GEN_INT (TARGET_LITTLE_ENDIAN
? 24 : 56)));
10648 emit_insn (gen_ashldi3_media (quad0
, quad0
, const2_rtx
));
10649 emit_move_insn (change_address (tramp_mem
, DImode
, NULL_RTX
), quad0
);
10650 emit_insn (gen_mshflo_w_x (gen_rtx_SUBREG (V4HImode
, cxtload
, 0),
10651 gen_rtx_SUBREG (V2HImode
, cxt
, 0),
10653 emit_insn (gen_rotrdi3_mextr (cxtload
, cxtload
,
10654 GEN_INT (TARGET_LITTLE_ENDIAN
? 24 : 56)));
10655 emit_insn (gen_ashldi3_media (cxtload
, cxtload
, const2_rtx
));
10656 if (TARGET_LITTLE_ENDIAN
)
10658 emit_insn (gen_mshflo_l_di (quad1
, ptabs
, cxtload
));
10659 emit_insn (gen_mextr4 (quad2
, cxtload
, blink
));
10663 emit_insn (gen_mextr4 (quad1
, cxtload
, ptabs
));
10664 emit_insn (gen_mshflo_l_di (quad2
, blink
, cxtload
));
10666 emit_move_insn (adjust_address (tramp_mem
, DImode
, 8), quad1
);
10667 emit_move_insn (adjust_address (tramp_mem
, DImode
, 16), quad2
);
10668 emit_insn (gen_ic_invalidate_line (tramp
));
10671 else if (TARGET_SHCOMPACT
)
10673 emit_insn (gen_initialize_trampoline (tramp
, cxt
, fnaddr
));
10676 emit_move_insn (change_address (tramp_mem
, SImode
, NULL_RTX
),
10677 gen_int_mode (TARGET_LITTLE_ENDIAN
? 0xd301d202 : 0xd202d301,
10679 emit_move_insn (adjust_address (tramp_mem
, SImode
, 4),
10680 gen_int_mode (TARGET_LITTLE_ENDIAN
? 0x0009422b : 0x422b0009,
10682 emit_move_insn (adjust_address (tramp_mem
, SImode
, 8), cxt
);
10683 emit_move_insn (adjust_address (tramp_mem
, SImode
, 12), fnaddr
);
10684 if (TARGET_HARVARD
)
10686 if (!TARGET_INLINE_IC_INVALIDATE
10687 || (!(TARGET_SH4A_ARCH
|| TARGET_SH4_300
) && TARGET_USERMODE
))
10688 emit_library_call (function_symbol (NULL
, "__ic_invalidate",
10689 FUNCTION_ORDINARY
),
10690 LCT_NORMAL
, VOIDmode
, 1, tramp
, SImode
);
10692 emit_insn (gen_ic_invalidate_line (tramp
));
10696 /* On SH5, trampolines are SHmedia code, so add 1 to the address. */
10699 sh_trampoline_adjust_address (rtx tramp
)
10701 if (TARGET_SHMEDIA
)
10702 tramp
= expand_simple_binop (Pmode
, PLUS
, tramp
, const1_rtx
,
10703 gen_reg_rtx (Pmode
), 0, OPTAB_LIB_WIDEN
);
10707 /* FIXME: This is overly conservative. A SHcompact function that
10708 receives arguments ``by reference'' will have them stored in its
10709 own stack frame, so it must not pass pointers or references to
10710 these arguments to other functions by means of sibling calls. */
10711 /* If PIC, we cannot make sibling calls to global functions
10712 because the PLT requires r12 to be live. */
10714 sh_function_ok_for_sibcall (tree decl
, tree exp ATTRIBUTE_UNUSED
)
10717 && (! TARGET_SHCOMPACT
10718 || crtl
->args
.info
.stack_regs
== 0)
10719 && ! sh_cfun_interrupt_handler_p ()
10721 || (decl
&& ! TREE_PUBLIC (decl
))
10722 || (decl
&& DECL_VISIBILITY (decl
) != VISIBILITY_DEFAULT
)));
10725 /* Machine specific built-in functions. */
10727 struct builtin_description
10729 const enum insn_code icode
;
10730 const char *const name
;
10735 /* describe number and signedness of arguments; arg[0] == result
10736 (1: unsigned, 2: signed, 4: don't care, 8: pointer 0: no argument */
10737 /* 9: 64-bit pointer, 10: 32-bit pointer */
10738 static const char signature_args
[][4] =
10740 #define SH_BLTIN_V2SI2 0
10742 #define SH_BLTIN_V4HI2 1
10744 #define SH_BLTIN_V2SI3 2
10746 #define SH_BLTIN_V4HI3 3
10748 #define SH_BLTIN_V8QI3 4
10750 #define SH_BLTIN_MAC_HISI 5
10752 #define SH_BLTIN_SH_HI 6
10754 #define SH_BLTIN_SH_SI 7
10756 #define SH_BLTIN_V4HI2V2SI 8
10758 #define SH_BLTIN_V4HI2V8QI 9
10760 #define SH_BLTIN_SISF 10
10762 #define SH_BLTIN_LDUA_L 11
10764 #define SH_BLTIN_LDUA_Q 12
10766 #define SH_BLTIN_STUA_L 13
10768 #define SH_BLTIN_STUA_Q 14
10770 #define SH_BLTIN_LDUA_L64 15
10772 #define SH_BLTIN_LDUA_Q64 16
10774 #define SH_BLTIN_STUA_L64 17
10776 #define SH_BLTIN_STUA_Q64 18
10778 #define SH_BLTIN_NUM_SHARED_SIGNATURES 19
10779 #define SH_BLTIN_2 19
10780 #define SH_BLTIN_SU 19
10782 #define SH_BLTIN_3 20
10783 #define SH_BLTIN_SUS 20
10785 #define SH_BLTIN_PSSV 21
10787 #define SH_BLTIN_XXUU 22
10788 #define SH_BLTIN_UUUU 22
10790 #define SH_BLTIN_PV 23
10793 /* mcmv: operands considered unsigned. */
10794 /* mmulsum_wq, msad_ubq: result considered unsigned long long. */
10795 /* mperm: control value considered unsigned int. */
10796 /* mshalds, mshard, mshards, mshlld, mshlrd: shift count is unsigned int. */
10797 /* mshards_q: returns signed short. */
10798 /* nsb: takes long long arg, returns unsigned char. */
10799 static struct builtin_description bdesc
[] =
10801 { CODE_FOR_absv2si2
, "__builtin_absv2si2", SH_BLTIN_V2SI2
, 0 },
10802 { CODE_FOR_absv4hi2
, "__builtin_absv4hi2", SH_BLTIN_V4HI2
, 0 },
10803 { CODE_FOR_addv2si3
, "__builtin_addv2si3", SH_BLTIN_V2SI3
, 0 },
10804 { CODE_FOR_addv4hi3
, "__builtin_addv4hi3", SH_BLTIN_V4HI3
, 0 },
10805 { CODE_FOR_ssaddv2si3
,"__builtin_ssaddv2si3", SH_BLTIN_V2SI3
, 0 },
10806 { CODE_FOR_usaddv8qi3
,"__builtin_usaddv8qi3", SH_BLTIN_V8QI3
, 0 },
10807 { CODE_FOR_ssaddv4hi3
,"__builtin_ssaddv4hi3", SH_BLTIN_V4HI3
, 0 },
10808 { CODE_FOR_alloco_i
, "__builtin_sh_media_ALLOCO", SH_BLTIN_PV
, 0 },
10809 { CODE_FOR_negcmpeqv8qi
,"__builtin_sh_media_MCMPEQ_B", SH_BLTIN_V8QI3
, 0 },
10810 { CODE_FOR_negcmpeqv2si
,"__builtin_sh_media_MCMPEQ_L", SH_BLTIN_V2SI3
, 0 },
10811 { CODE_FOR_negcmpeqv4hi
,"__builtin_sh_media_MCMPEQ_W", SH_BLTIN_V4HI3
, 0 },
10812 { CODE_FOR_negcmpgtuv8qi
,"__builtin_sh_media_MCMPGT_UB", SH_BLTIN_V8QI3
, 0 },
10813 { CODE_FOR_negcmpgtv2si
,"__builtin_sh_media_MCMPGT_L", SH_BLTIN_V2SI3
, 0 },
10814 { CODE_FOR_negcmpgtv4hi
,"__builtin_sh_media_MCMPGT_W", SH_BLTIN_V4HI3
, 0 },
10815 { CODE_FOR_mcmv
, "__builtin_sh_media_MCMV", SH_BLTIN_UUUU
, 0 },
10816 { CODE_FOR_mcnvs_lw
, "__builtin_sh_media_MCNVS_LW", SH_BLTIN_3
, 0 },
10817 { CODE_FOR_mcnvs_wb
, "__builtin_sh_media_MCNVS_WB", SH_BLTIN_V4HI2V8QI
, 0 },
10818 { CODE_FOR_mcnvs_wub
, "__builtin_sh_media_MCNVS_WUB", SH_BLTIN_V4HI2V8QI
, 0 },
10819 { CODE_FOR_mextr1
, "__builtin_sh_media_MEXTR1", SH_BLTIN_V8QI3
, 0 },
10820 { CODE_FOR_mextr2
, "__builtin_sh_media_MEXTR2", SH_BLTIN_V8QI3
, 0 },
10821 { CODE_FOR_mextr3
, "__builtin_sh_media_MEXTR3", SH_BLTIN_V8QI3
, 0 },
10822 { CODE_FOR_mextr4
, "__builtin_sh_media_MEXTR4", SH_BLTIN_V8QI3
, 0 },
10823 { CODE_FOR_mextr5
, "__builtin_sh_media_MEXTR5", SH_BLTIN_V8QI3
, 0 },
10824 { CODE_FOR_mextr6
, "__builtin_sh_media_MEXTR6", SH_BLTIN_V8QI3
, 0 },
10825 { CODE_FOR_mextr7
, "__builtin_sh_media_MEXTR7", SH_BLTIN_V8QI3
, 0 },
10826 { CODE_FOR_mmacfx_wl
, "__builtin_sh_media_MMACFX_WL", SH_BLTIN_MAC_HISI
, 0 },
10827 { CODE_FOR_mmacnfx_wl
,"__builtin_sh_media_MMACNFX_WL", SH_BLTIN_MAC_HISI
, 0 },
10828 { CODE_FOR_mulv2si3
, "__builtin_mulv2si3", SH_BLTIN_V2SI3
, 0 },
10829 { CODE_FOR_mulv4hi3
, "__builtin_mulv4hi3", SH_BLTIN_V4HI3
, 0 },
10830 { CODE_FOR_mmulfx_l
, "__builtin_sh_media_MMULFX_L", SH_BLTIN_V2SI3
, 0 },
10831 { CODE_FOR_mmulfx_w
, "__builtin_sh_media_MMULFX_W", SH_BLTIN_V4HI3
, 0 },
10832 { CODE_FOR_mmulfxrp_w
,"__builtin_sh_media_MMULFXRP_W", SH_BLTIN_V4HI3
, 0 },
10833 { CODE_FOR_mmulhi_wl
, "__builtin_sh_media_MMULHI_WL", SH_BLTIN_V4HI2V2SI
, 0 },
10834 { CODE_FOR_mmullo_wl
, "__builtin_sh_media_MMULLO_WL", SH_BLTIN_V4HI2V2SI
, 0 },
10835 { CODE_FOR_mmulsum_wq
,"__builtin_sh_media_MMULSUM_WQ", SH_BLTIN_XXUU
, 0 },
10836 { CODE_FOR_mperm_w
, "__builtin_sh_media_MPERM_W", SH_BLTIN_SH_HI
, 0 },
10837 { CODE_FOR_msad_ubq
, "__builtin_sh_media_MSAD_UBQ", SH_BLTIN_XXUU
, 0 },
10838 { CODE_FOR_mshalds_l
, "__builtin_sh_media_MSHALDS_L", SH_BLTIN_SH_SI
, 0 },
10839 { CODE_FOR_mshalds_w
, "__builtin_sh_media_MSHALDS_W", SH_BLTIN_SH_HI
, 0 },
10840 { CODE_FOR_ashrv2si3
, "__builtin_ashrv2si3", SH_BLTIN_SH_SI
, 0 },
10841 { CODE_FOR_ashrv4hi3
, "__builtin_ashrv4hi3", SH_BLTIN_SH_HI
, 0 },
10842 { CODE_FOR_mshards_q
, "__builtin_sh_media_MSHARDS_Q", SH_BLTIN_SUS
, 0 },
10843 { CODE_FOR_mshfhi_b
, "__builtin_sh_media_MSHFHI_B", SH_BLTIN_V8QI3
, 0 },
10844 { CODE_FOR_mshfhi_l
, "__builtin_sh_media_MSHFHI_L", SH_BLTIN_V2SI3
, 0 },
10845 { CODE_FOR_mshfhi_w
, "__builtin_sh_media_MSHFHI_W", SH_BLTIN_V4HI3
, 0 },
10846 { CODE_FOR_mshflo_b
, "__builtin_sh_media_MSHFLO_B", SH_BLTIN_V8QI3
, 0 },
10847 { CODE_FOR_mshflo_l
, "__builtin_sh_media_MSHFLO_L", SH_BLTIN_V2SI3
, 0 },
10848 { CODE_FOR_mshflo_w
, "__builtin_sh_media_MSHFLO_W", SH_BLTIN_V4HI3
, 0 },
10849 { CODE_FOR_ashlv2si3
, "__builtin_ashlv2si3", SH_BLTIN_SH_SI
, 0 },
10850 { CODE_FOR_ashlv4hi3
, "__builtin_ashlv4hi3", SH_BLTIN_SH_HI
, 0 },
10851 { CODE_FOR_lshrv2si3
, "__builtin_lshrv2si3", SH_BLTIN_SH_SI
, 0 },
10852 { CODE_FOR_lshrv4hi3
, "__builtin_lshrv4hi3", SH_BLTIN_SH_HI
, 0 },
10853 { CODE_FOR_subv2si3
, "__builtin_subv2si3", SH_BLTIN_V2SI3
, 0 },
10854 { CODE_FOR_subv4hi3
, "__builtin_subv4hi3", SH_BLTIN_V4HI3
, 0 },
10855 { CODE_FOR_sssubv2si3
,"__builtin_sssubv2si3", SH_BLTIN_V2SI3
, 0 },
10856 { CODE_FOR_ussubv8qi3
,"__builtin_ussubv8qi3", SH_BLTIN_V8QI3
, 0 },
10857 { CODE_FOR_sssubv4hi3
,"__builtin_sssubv4hi3", SH_BLTIN_V4HI3
, 0 },
10858 { CODE_FOR_fcosa_s
, "__builtin_sh_media_FCOSA_S", SH_BLTIN_SISF
, 0 },
10859 { CODE_FOR_fsina_s
, "__builtin_sh_media_FSINA_S", SH_BLTIN_SISF
, 0 },
10860 { CODE_FOR_fipr
, "__builtin_sh_media_FIPR_S", SH_BLTIN_3
, 0 },
10861 { CODE_FOR_ftrv
, "__builtin_sh_media_FTRV_S", SH_BLTIN_3
, 0 },
10862 { CODE_FOR_mac_media
, "__builtin_sh_media_FMAC_S", SH_BLTIN_3
, 0 },
10863 { CODE_FOR_sqrtdf2
, "__builtin_sh_media_FSQRT_D", SH_BLTIN_2
, 0 },
10864 { CODE_FOR_sqrtsf2
, "__builtin_sh_media_FSQRT_S", SH_BLTIN_2
, 0 },
10865 { CODE_FOR_fsrra_s
, "__builtin_sh_media_FSRRA_S", SH_BLTIN_2
, 0 },
10866 { CODE_FOR_ldhi_l
, "__builtin_sh_media_LDHI_L", SH_BLTIN_LDUA_L
, 0 },
10867 { CODE_FOR_ldhi_q
, "__builtin_sh_media_LDHI_Q", SH_BLTIN_LDUA_Q
, 0 },
10868 { CODE_FOR_ldlo_l
, "__builtin_sh_media_LDLO_L", SH_BLTIN_LDUA_L
, 0 },
10869 { CODE_FOR_ldlo_q
, "__builtin_sh_media_LDLO_Q", SH_BLTIN_LDUA_Q
, 0 },
10870 { CODE_FOR_sthi_l
, "__builtin_sh_media_STHI_L", SH_BLTIN_STUA_L
, 0 },
10871 { CODE_FOR_sthi_q
, "__builtin_sh_media_STHI_Q", SH_BLTIN_STUA_Q
, 0 },
10872 { CODE_FOR_stlo_l
, "__builtin_sh_media_STLO_L", SH_BLTIN_STUA_L
, 0 },
10873 { CODE_FOR_stlo_q
, "__builtin_sh_media_STLO_Q", SH_BLTIN_STUA_Q
, 0 },
10874 { CODE_FOR_ldhi_l64
, "__builtin_sh_media_LDHI_L", SH_BLTIN_LDUA_L64
, 0 },
10875 { CODE_FOR_ldhi_q64
, "__builtin_sh_media_LDHI_Q", SH_BLTIN_LDUA_Q64
, 0 },
10876 { CODE_FOR_ldlo_l64
, "__builtin_sh_media_LDLO_L", SH_BLTIN_LDUA_L64
, 0 },
10877 { CODE_FOR_ldlo_q64
, "__builtin_sh_media_LDLO_Q", SH_BLTIN_LDUA_Q64
, 0 },
10878 { CODE_FOR_sthi_l64
, "__builtin_sh_media_STHI_L", SH_BLTIN_STUA_L64
, 0 },
10879 { CODE_FOR_sthi_q64
, "__builtin_sh_media_STHI_Q", SH_BLTIN_STUA_Q64
, 0 },
10880 { CODE_FOR_stlo_l64
, "__builtin_sh_media_STLO_L", SH_BLTIN_STUA_L64
, 0 },
10881 { CODE_FOR_stlo_q64
, "__builtin_sh_media_STLO_Q", SH_BLTIN_STUA_Q64
, 0 },
10882 { CODE_FOR_nsb
, "__builtin_sh_media_NSB", SH_BLTIN_SU
, 0 },
10883 { CODE_FOR_byterev
, "__builtin_sh_media_BYTEREV", SH_BLTIN_2
, 0 },
10884 { CODE_FOR_prefetch
, "__builtin_sh_media_PREFO", SH_BLTIN_PSSV
, 0 },
10888 sh_media_init_builtins (void)
10890 tree shared
[SH_BLTIN_NUM_SHARED_SIGNATURES
];
10891 struct builtin_description
*d
;
10893 memset (shared
, 0, sizeof shared
);
10894 for (d
= bdesc
; d
- bdesc
< (int) ARRAY_SIZE (bdesc
); d
++)
10896 tree type
, arg_type
= 0;
10897 int signature
= d
->signature
;
10900 if (signature
< SH_BLTIN_NUM_SHARED_SIGNATURES
&& shared
[signature
])
10901 type
= shared
[signature
];
10904 int has_result
= signature_args
[signature
][0] != 0;
10906 if ((signature_args
[signature
][1] & 8)
10907 && (((signature_args
[signature
][1] & 1) && TARGET_SHMEDIA32
)
10908 || ((signature_args
[signature
][1] & 2) && TARGET_SHMEDIA64
)))
10910 if (! TARGET_FPU_ANY
10911 && FLOAT_MODE_P (insn_data
[d
->icode
].operand
[0].mode
))
10913 type
= void_list_node
;
10916 int arg
= signature_args
[signature
][i
];
10917 int opno
= i
- 1 + has_result
;
10920 arg_type
= ptr_type_node
;
10922 arg_type
= (*lang_hooks
.types
.type_for_mode
)
10923 (insn_data
[d
->icode
].operand
[opno
].mode
,
10928 arg_type
= void_type_node
;
10931 type
= tree_cons (NULL_TREE
, arg_type
, type
);
10933 type
= build_function_type (arg_type
, type
);
10934 if (signature
< SH_BLTIN_NUM_SHARED_SIGNATURES
)
10935 shared
[signature
] = type
;
10938 add_builtin_function (d
->name
, type
, d
- bdesc
, BUILT_IN_MD
,
10943 /* Returns the shmedia builtin decl for CODE. */
10946 sh_media_builtin_decl (unsigned code
, bool initialize_p ATTRIBUTE_UNUSED
)
10948 if (code
>= ARRAY_SIZE (bdesc
))
10949 return error_mark_node
;
10951 return bdesc
[code
].fndecl
;
10954 /* Implements target hook vector_mode_supported_p. */
10956 sh_vector_mode_supported_p (enum machine_mode mode
)
10959 && ((mode
== V2SFmode
)
10960 || (mode
== V4SFmode
)
10961 || (mode
== V16SFmode
)))
10964 else if (TARGET_SHMEDIA
10965 && ((mode
== V8QImode
)
10966 || (mode
== V2HImode
)
10967 || (mode
== V4HImode
)
10968 || (mode
== V2SImode
)))
10975 sh_frame_pointer_required (void)
10977 /* If needed override this in other tm.h files to cope with various OS
10978 lossage requiring a frame pointer. */
10979 if (SUBTARGET_FRAME_POINTER_REQUIRED
)
10988 /* Implements target hook dwarf_calling_convention. Return an enum
10989 of dwarf_calling_convention. */
10991 sh_dwarf_calling_convention (const_tree func
)
10993 if (sh_attr_renesas_p (func
))
10994 return DW_CC_GNU_renesas_sh
;
10996 return DW_CC_normal
;
11000 sh_init_builtins (void)
11002 if (TARGET_SHMEDIA
)
11003 sh_media_init_builtins ();
11006 /* Returns the sh builtin decl for CODE. */
11009 sh_builtin_decl (unsigned code
, bool initialize_p ATTRIBUTE_UNUSED
)
11011 if (TARGET_SHMEDIA
)
11012 return sh_media_builtin_decl (code
, initialize_p
);
11014 return error_mark_node
;
11017 /* Expand an expression EXP that calls a built-in function,
11018 with result going to TARGET if that's convenient
11019 (and in mode MODE if that's convenient).
11020 SUBTARGET may be used as the target for computing one of EXP's operands.
11021 IGNORE is nonzero if the value is to be ignored. */
11024 sh_expand_builtin (tree exp
, rtx target
, rtx subtarget ATTRIBUTE_UNUSED
,
11025 enum machine_mode mode ATTRIBUTE_UNUSED
, int ignore
)
11027 tree fndecl
= TREE_OPERAND (CALL_EXPR_FN (exp
), 0);
11028 unsigned int fcode
= DECL_FUNCTION_CODE (fndecl
);
11029 const struct builtin_description
*d
= &bdesc
[fcode
];
11030 enum insn_code icode
= d
->icode
;
11031 int signature
= d
->signature
;
11032 enum machine_mode tmode
= VOIDmode
;
11037 if (signature_args
[signature
][0])
11042 tmode
= insn_data
[icode
].operand
[0].mode
;
11044 || GET_MODE (target
) != tmode
11045 || ! (*insn_data
[icode
].operand
[0].predicate
) (target
, tmode
))
11046 target
= gen_reg_rtx (tmode
);
11047 op
[nop
++] = target
;
11052 for (i
= 1; i
<= 3; i
++, nop
++)
11055 enum machine_mode opmode
, argmode
;
11058 if (! signature_args
[signature
][i
])
11060 arg
= CALL_EXPR_ARG (exp
, i
- 1);
11061 if (arg
== error_mark_node
)
11063 if (signature_args
[signature
][i
] & 8)
11066 optype
= ptr_type_node
;
11070 opmode
= insn_data
[icode
].operand
[nop
].mode
;
11071 optype
= (*lang_hooks
.types
.type_for_mode
) (opmode
, 0);
11073 argmode
= TYPE_MODE (TREE_TYPE (arg
));
11074 if (argmode
!= opmode
)
11075 arg
= build1 (NOP_EXPR
, optype
, arg
);
11076 op
[nop
] = expand_expr (arg
, NULL_RTX
, opmode
, EXPAND_NORMAL
);
11077 if (! (*insn_data
[icode
].operand
[nop
].predicate
) (op
[nop
], opmode
))
11078 op
[nop
] = copy_to_mode_reg (opmode
, op
[nop
]);
11084 pat
= (*insn_data
[d
->icode
].genfun
) (op
[0]);
11087 pat
= (*insn_data
[d
->icode
].genfun
) (op
[0], op
[1]);
11090 pat
= (*insn_data
[d
->icode
].genfun
) (op
[0], op
[1], op
[2]);
11093 pat
= (*insn_data
[d
->icode
].genfun
) (op
[0], op
[1], op
[2], op
[3]);
11096 gcc_unreachable ();
11105 sh_expand_unop_v2sf (enum rtx_code code
, rtx op0
, rtx op1
)
11107 rtx sel0
= const0_rtx
;
11108 rtx sel1
= const1_rtx
;
11109 rtx (*fn
) (rtx
, rtx
, rtx
, rtx
, rtx
) = gen_unary_sf_op
;
11110 rtx op
= gen_rtx_fmt_e (code
, SFmode
, op1
);
11112 emit_insn ((*fn
) (op0
, op1
, op
, sel0
, sel0
));
11113 emit_insn ((*fn
) (op0
, op1
, op
, sel1
, sel1
));
11117 sh_expand_binop_v2sf (enum rtx_code code
, rtx op0
, rtx op1
, rtx op2
)
11119 rtx op
= gen_rtx_fmt_ee (code
, SFmode
, op1
, op2
);
11121 emit_insn (gen_binary_sf_op0 (op0
, op1
, op2
, op
));
11122 emit_insn (gen_binary_sf_op1 (op0
, op1
, op2
, op
));
11125 /* Return true if hard register REGNO can hold a value of machine-mode MODE.
11126 We can allow any mode in any general register. The special registers
11127 only allow SImode. Don't allow any mode in the PR.
11129 We cannot hold DCmode values in the XD registers because alter_reg
11130 handles subregs of them incorrectly. We could work around this by
11131 spacing the XD registers like the DR registers, but this would require
11132 additional memory in every compilation to hold larger register vectors.
11133 We could hold SFmode / SCmode values in XD registers, but that
11134 would require a tertiary reload when reloading from / to memory,
11135 and a secondary reload to reload from / to general regs; that
11136 seems to be a loosing proposition.
11138 We want to allow TImode FP regs so that when V4SFmode is loaded as TImode,
11139 it won't be ferried through GP registers first. */
11142 sh_hard_regno_mode_ok (unsigned int regno
, enum machine_mode mode
)
11144 if (SPECIAL_REGISTER_P (regno
))
11145 return mode
== SImode
;
11147 if (regno
== FPUL_REG
)
11148 return (mode
== SImode
|| mode
== SFmode
);
11150 if (FP_REGISTER_P (regno
) && mode
== SFmode
)
11153 if (mode
== V2SFmode
)
11155 if (((FP_REGISTER_P (regno
) && (regno
- FIRST_FP_REG
) % 2 == 0)
11156 || GENERAL_REGISTER_P (regno
)))
11162 if (mode
== V4SFmode
)
11164 if ((FP_REGISTER_P (regno
) && (regno
- FIRST_FP_REG
) % 4 == 0)
11165 || GENERAL_REGISTER_P (regno
))
11171 if (mode
== V16SFmode
)
11173 if (TARGET_SHMEDIA
)
11175 if (FP_REGISTER_P (regno
) && (regno
- FIRST_FP_REG
) % 16 == 0)
11181 return regno
== FIRST_XD_REG
;
11184 if (FP_REGISTER_P (regno
))
11188 || ((TARGET_SH2E
|| TARGET_SHMEDIA
) && mode
== SCmode
)
11189 || ((((TARGET_SH4
|| TARGET_SH2A_DOUBLE
) && mode
== DFmode
)
11192 && (mode
== DFmode
|| mode
== DImode
11193 || mode
== V2SFmode
|| mode
== TImode
)))
11194 && ((regno
- FIRST_FP_REG
) & 1) == 0)
11195 || ((TARGET_SH4
|| TARGET_SHMEDIA
) && mode
== TImode
11196 && ((regno
- FIRST_FP_REG
) & 3) == 0))
11202 if (XD_REGISTER_P (regno
))
11203 return mode
== DFmode
;
11205 if (TARGET_REGISTER_P (regno
))
11206 return (mode
== DImode
|| mode
== SImode
|| mode
== PDImode
);
11208 if (regno
== PR_REG
)
11209 return mode
== SImode
;
11211 if (regno
== FPSCR_REG
)
11212 return mode
== PSImode
;
11214 /* FIXME. This works around PR target/37633 for -O0. */
11215 if (!optimize
&& TARGET_SHMEDIA32
&& GET_MODE_SIZE (mode
) > 4)
11217 unsigned int n
= GET_MODE_SIZE (mode
) / 8;
11219 if (regno
>= FIRST_GENERAL_REG
+ 10 - n
+ 1
11220 && regno
<= FIRST_GENERAL_REG
+ 14)
11227 /* Return the class of registers for which a mode change from FROM to TO
11230 sh_cannot_change_mode_class (enum machine_mode from
, enum machine_mode to
,
11231 enum reg_class rclass
)
11233 /* We want to enable the use of SUBREGs as a means to
11234 VEC_SELECT a single element of a vector. */
11235 if (to
== SFmode
&& VECTOR_MODE_P (from
) && GET_MODE_INNER (from
) == SFmode
)
11236 return (reg_classes_intersect_p (GENERAL_REGS
, rclass
));
11238 if (GET_MODE_SIZE (from
) != GET_MODE_SIZE (to
))
11240 if (TARGET_LITTLE_ENDIAN
)
11242 if (GET_MODE_SIZE (to
) < 8 || GET_MODE_SIZE (from
) < 8)
11243 return reg_classes_intersect_p (DF_REGS
, rclass
);
11247 if (GET_MODE_SIZE (from
) < 8)
11248 return reg_classes_intersect_p (DF_HI_REGS
, rclass
);
11254 /* Return true if registers in machine mode MODE will likely be
11255 allocated to registers in small register classes. */
11258 sh_small_register_classes_for_mode_p (enum machine_mode mode ATTRIBUTE_UNUSED
)
11260 return (! TARGET_SHMEDIA
);
11263 /* If ADDRESS refers to a CODE_LABEL, add NUSES to the number of times
11264 that label is used. */
11267 sh_mark_label (rtx address
, int nuses
)
11269 if (GOTOFF_P (address
))
11271 /* Extract the label or symbol. */
11272 address
= XEXP (address
, 0);
11273 if (GET_CODE (address
) == PLUS
)
11274 address
= XEXP (address
, 0);
11275 address
= XVECEXP (address
, 0, 0);
11277 if (GET_CODE (address
) == LABEL_REF
11278 && LABEL_P (XEXP (address
, 0)))
11279 LABEL_NUSES (XEXP (address
, 0)) += nuses
;
11282 /* Compute extra cost of moving data between one register class
11285 /* If SECONDARY*_RELOAD_CLASS says something about the src/dst pair, regclass
11286 uses this information. Hence, the general register <-> floating point
11287 register information here is not used for SFmode. */
11290 sh_register_move_cost (enum machine_mode mode
,
11291 enum reg_class srcclass
, enum reg_class dstclass
)
11293 if (dstclass
== T_REGS
|| dstclass
== PR_REGS
)
11296 if (dstclass
== MAC_REGS
&& srcclass
== MAC_REGS
)
11299 if (mode
== SImode
&& ! TARGET_SHMEDIA
&& TARGET_FMOVD
11300 && REGCLASS_HAS_FP_REG (srcclass
)
11301 && REGCLASS_HAS_FP_REG (dstclass
))
11304 if (REGCLASS_HAS_FP_REG (dstclass
) && srcclass
== T_REGS
)
11305 return ((TARGET_HARD_SH4
&& !optimize_size
) ? 10 : 7);
11307 if ((REGCLASS_HAS_FP_REG (dstclass
) && srcclass
== MAC_REGS
)
11308 || (dstclass
== MAC_REGS
&& REGCLASS_HAS_FP_REG (srcclass
)))
11311 if ((REGCLASS_HAS_FP_REG (dstclass
)
11312 && REGCLASS_HAS_GENERAL_REG (srcclass
))
11313 || (REGCLASS_HAS_GENERAL_REG (dstclass
)
11314 && REGCLASS_HAS_FP_REG (srcclass
)))
11315 return ((TARGET_SHMEDIA
? 4 : TARGET_FMOVD
? 8 : 12)
11316 * ((GET_MODE_SIZE (mode
) + 7) / 8U));
11318 if ((dstclass
== FPUL_REGS
11319 && REGCLASS_HAS_GENERAL_REG (srcclass
))
11320 || (srcclass
== FPUL_REGS
11321 && REGCLASS_HAS_GENERAL_REG (dstclass
)))
11324 if ((dstclass
== FPUL_REGS
11325 && (srcclass
== PR_REGS
|| srcclass
== MAC_REGS
|| srcclass
== T_REGS
))
11326 || (srcclass
== FPUL_REGS
11327 && (dstclass
== PR_REGS
|| dstclass
== MAC_REGS
)))
11330 if ((srcclass
== TARGET_REGS
&& ! REGCLASS_HAS_GENERAL_REG (dstclass
))
11331 || ((dstclass
) == TARGET_REGS
&& ! REGCLASS_HAS_GENERAL_REG (srcclass
)))
11334 /* ??? ptabs faults on (value & 0x3) == 0x3 */
11336 && ((srcclass
) == TARGET_REGS
|| (srcclass
) == SIBCALL_REGS
))
11338 if (sh_gettrcost
>= 0)
11339 return sh_gettrcost
;
11340 else if (!TARGET_PT_FIXED
)
11344 if ((srcclass
== FPSCR_REGS
&& ! REGCLASS_HAS_GENERAL_REG (dstclass
))
11345 || (dstclass
== FPSCR_REGS
&& ! REGCLASS_HAS_GENERAL_REG (srcclass
)))
11350 && ! REGCLASS_HAS_GENERAL_REG (srcclass
)
11351 && ! REGCLASS_HAS_GENERAL_REG (dstclass
)))
11352 return 2 * ((GET_MODE_SIZE (mode
) + 7) / 8U);
11354 return 2 * ((GET_MODE_SIZE (mode
) + 3) / 4U);
11357 static rtx
emit_load_ptr (rtx
, rtx
);
11360 emit_load_ptr (rtx reg
, rtx addr
)
11362 rtx mem
= gen_const_mem (ptr_mode
, addr
);
11364 if (Pmode
!= ptr_mode
)
11365 mem
= gen_rtx_SIGN_EXTEND (Pmode
, mem
);
11366 return emit_move_insn (reg
, mem
);
11370 sh_output_mi_thunk (FILE *file
, tree thunk_fndecl ATTRIBUTE_UNUSED
,
11371 HOST_WIDE_INT delta
, HOST_WIDE_INT vcall_offset
,
11374 CUMULATIVE_ARGS cum
;
11375 int structure_value_byref
= 0;
11376 rtx this_rtx
, this_value
, sibcall
, insns
, funexp
;
11377 tree funtype
= TREE_TYPE (function
);
11378 int simple_add
= CONST_OK_FOR_ADD (delta
);
11380 rtx scratch0
, scratch1
, scratch2
;
11383 reload_completed
= 1;
11384 epilogue_completed
= 1;
11385 current_function_uses_only_leaf_regs
= 1;
11387 emit_note (NOTE_INSN_PROLOGUE_END
);
11389 /* Find the "this" pointer. We have such a wide range of ABIs for the
11390 SH that it's best to do this completely machine independently.
11391 "this" is passed as first argument, unless a structure return pointer
11392 comes first, in which case "this" comes second. */
11393 INIT_CUMULATIVE_ARGS (cum
, funtype
, NULL_RTX
, 0, 1);
11394 #ifndef PCC_STATIC_STRUCT_RETURN
11395 if (aggregate_value_p (TREE_TYPE (TREE_TYPE (function
)), function
))
11396 structure_value_byref
= 1;
11397 #endif /* not PCC_STATIC_STRUCT_RETURN */
11398 if (structure_value_byref
&& sh_struct_value_rtx (function
, 0) == 0)
11400 tree ptype
= build_pointer_type (TREE_TYPE (funtype
));
11402 FUNCTION_ARG_ADVANCE (cum
, Pmode
, ptype
, 1);
11404 this_rtx
= FUNCTION_ARG (cum
, Pmode
, ptr_type_node
, 1);
11406 /* For SHcompact, we only have r0 for a scratch register: r1 is the
11407 static chain pointer (even if you can't have nested virtual functions
11408 right now, someone might implement them sometime), and the rest of the
11409 registers are used for argument passing, are callee-saved, or reserved. */
11410 /* We need to check call_used_regs / fixed_regs in case -fcall_saved-reg /
11411 -ffixed-reg has been used. */
11412 if (! call_used_regs
[0] || fixed_regs
[0])
11413 error ("r0 needs to be available as a call-clobbered register");
11414 scratch0
= scratch1
= scratch2
= gen_rtx_REG (Pmode
, 0);
11417 if (call_used_regs
[1] && ! fixed_regs
[1])
11418 scratch1
= gen_rtx_REG (ptr_mode
, 1);
11419 /* N.B., if not TARGET_HITACHI, register 2 is used to pass the pointer
11420 pointing where to return struct values. */
11421 if (call_used_regs
[3] && ! fixed_regs
[3])
11422 scratch2
= gen_rtx_REG (Pmode
, 3);
11424 else if (TARGET_SHMEDIA
)
11426 for (i
= FIRST_GENERAL_REG
; i
<= LAST_GENERAL_REG
; i
++)
11427 if (i
!= REGNO (scratch0
) &&
11428 call_used_regs
[i
] && ! fixed_regs
[i
] && ! FUNCTION_ARG_REGNO_P (i
))
11430 scratch1
= gen_rtx_REG (ptr_mode
, i
);
11433 if (scratch1
== scratch0
)
11434 error ("Need a second call-clobbered general purpose register");
11435 for (i
= FIRST_TARGET_REG
; i
<= LAST_TARGET_REG
; i
++)
11436 if (call_used_regs
[i
] && ! fixed_regs
[i
])
11438 scratch2
= gen_rtx_REG (Pmode
, i
);
11441 if (scratch2
== scratch0
)
11442 error ("Need a call-clobbered target register");
11445 this_value
= plus_constant (this_rtx
, delta
);
11447 && (simple_add
|| scratch0
!= scratch1
)
11448 && strict_memory_address_p (ptr_mode
, this_value
))
11450 emit_load_ptr (scratch0
, this_value
);
11455 ; /* Do nothing. */
11456 else if (simple_add
)
11457 emit_move_insn (this_rtx
, this_value
);
11460 emit_move_insn (scratch1
, GEN_INT (delta
));
11461 emit_insn (gen_add2_insn (this_rtx
, scratch1
));
11469 emit_load_ptr (scratch0
, this_rtx
);
11471 offset_addr
= plus_constant (scratch0
, vcall_offset
);
11472 if (strict_memory_address_p (ptr_mode
, offset_addr
))
11473 ; /* Do nothing. */
11474 else if (! TARGET_SH5
&& scratch0
!= scratch1
)
11476 /* scratch0 != scratch1, and we have indexed loads. Get better
11477 schedule by loading the offset into r1 and using an indexed
11478 load - then the load of r1 can issue before the load from
11479 (this_rtx + delta) finishes. */
11480 emit_move_insn (scratch1
, GEN_INT (vcall_offset
));
11481 offset_addr
= gen_rtx_PLUS (Pmode
, scratch0
, scratch1
);
11483 else if (CONST_OK_FOR_ADD (vcall_offset
))
11485 emit_insn (gen_add2_insn (scratch0
, GEN_INT (vcall_offset
)));
11486 offset_addr
= scratch0
;
11488 else if (scratch0
!= scratch1
)
11490 emit_move_insn (scratch1
, GEN_INT (vcall_offset
));
11491 emit_insn (gen_add2_insn (scratch0
, scratch1
));
11492 offset_addr
= scratch0
;
11495 gcc_unreachable (); /* FIXME */
11496 emit_load_ptr (scratch0
, offset_addr
);
11498 if (Pmode
!= ptr_mode
)
11499 scratch0
= gen_rtx_TRUNCATE (ptr_mode
, scratch0
);
11500 emit_insn (gen_add2_insn (this_rtx
, scratch0
));
11503 /* Generate a tail call to the target function. */
11504 if (! TREE_USED (function
))
11506 assemble_external (function
);
11507 TREE_USED (function
) = 1;
11509 funexp
= XEXP (DECL_RTL (function
), 0);
11510 /* If the function is overridden, so is the thunk, hence we don't
11511 need GOT addressing even if this is a public symbol. */
11513 if (TARGET_SH1
&& ! flag_weak
)
11514 sibcall
= gen_sibcalli_thunk (funexp
, const0_rtx
);
11517 if (TARGET_SH2
&& flag_pic
)
11519 sibcall
= gen_sibcall_pcrel (funexp
, const0_rtx
);
11520 XEXP (XVECEXP (sibcall
, 0, 2), 0) = scratch2
;
11524 if (TARGET_SHMEDIA
&& flag_pic
)
11526 funexp
= gen_sym2PIC (funexp
);
11527 PUT_MODE (funexp
, Pmode
);
11529 emit_move_insn (scratch2
, funexp
);
11530 funexp
= gen_rtx_MEM (FUNCTION_MODE
, scratch2
);
11531 sibcall
= gen_sibcall (funexp
, const0_rtx
, NULL_RTX
);
11533 sibcall
= emit_call_insn (sibcall
);
11534 SIBLING_CALL_P (sibcall
) = 1;
11535 use_reg (&CALL_INSN_FUNCTION_USAGE (sibcall
), this_rtx
);
11538 /* Run just enough of rest_of_compilation to do scheduling and get
11539 the insns emitted. Note that use_thunk calls
11540 assemble_start_function and assemble_end_function. */
11542 insn_locators_alloc ();
11543 insns
= get_insns ();
11549 split_all_insns_noflow ();
11554 if (optimize
> 0 && flag_delayed_branch
)
11555 dbr_schedule (insns
);
11557 shorten_branches (insns
);
11558 final_start_function (insns
, file
, 1);
11559 final (insns
, file
, 1);
11560 final_end_function ();
11562 reload_completed
= 0;
11563 epilogue_completed
= 0;
11567 function_symbol (rtx target
, const char *name
, enum sh_function_kind kind
)
11571 /* If this is not an ordinary function, the name usually comes from a
11572 string literal or an sprintf buffer. Make sure we use the same
11573 string consistently, so that cse will be able to unify address loads. */
11574 if (kind
!= FUNCTION_ORDINARY
)
11575 name
= IDENTIFIER_POINTER (get_identifier (name
));
11576 sym
= gen_rtx_SYMBOL_REF (Pmode
, name
);
11577 SYMBOL_REF_FLAGS (sym
) = SYMBOL_FLAG_FUNCTION
;
11581 case FUNCTION_ORDINARY
:
11585 rtx reg
= target
? target
: gen_reg_rtx (Pmode
);
11587 emit_insn (gen_symGOT2reg (reg
, sym
));
11593 /* ??? To allow cse to work, we use GOTOFF relocations.
11594 we could add combiner patterns to transform this into
11595 straight pc-relative calls with sym2PIC / bsrf when
11596 label load and function call are still 1:1 and in the
11597 same basic block during combine. */
11598 rtx reg
= target
? target
: gen_reg_rtx (Pmode
);
11600 emit_insn (gen_symGOTOFF2reg (reg
, sym
));
11605 if (target
&& sym
!= target
)
11607 emit_move_insn (target
, sym
);
11613 /* Find the number of a general purpose register in S. */
11615 scavenge_reg (HARD_REG_SET
*s
)
11618 for (r
= FIRST_GENERAL_REG
; r
<= LAST_GENERAL_REG
; r
++)
11619 if (TEST_HARD_REG_BIT (*s
, r
))
11625 sh_get_pr_initial_val (void)
11629 /* ??? Unfortunately, get_hard_reg_initial_val doesn't always work for the
11630 PR register on SHcompact, because it might be clobbered by the prologue.
11631 We check first if that is known to be the case. */
11632 if (TARGET_SHCOMPACT
11633 && ((crtl
->args
.info
.call_cookie
11634 & ~ CALL_COOKIE_RET_TRAMP (1))
11635 || crtl
->saves_all_registers
))
11636 return gen_frame_mem (SImode
, return_address_pointer_rtx
);
11638 /* If we haven't finished rtl generation, there might be a nonlocal label
11639 that we haven't seen yet.
11640 ??? get_hard_reg_initial_val fails if it is called after register
11641 allocation has started, unless it has been called before for the
11642 same register. And even then, we end in trouble if we didn't use
11643 the register in the same basic block before. So call
11644 get_hard_reg_initial_val now and wrap it in an unspec if we might
11645 need to replace it. */
11646 /* ??? We also must do this for TARGET_SH1 in general, because otherwise
11647 combine can put the pseudo returned by get_hard_reg_initial_val into
11648 instructions that need a general purpose registers, which will fail to
11649 be recognized when the pseudo becomes allocated to PR. */
11651 = get_hard_reg_initial_val (Pmode
, TARGET_SHMEDIA
? PR_MEDIA_REG
: PR_REG
);
11653 return gen_rtx_UNSPEC (SImode
, gen_rtvec (1, val
), UNSPEC_RA
);
11658 sh_expand_t_scc (rtx operands
[])
11660 enum rtx_code code
= GET_CODE (operands
[1]);
11661 rtx target
= operands
[0];
11662 rtx op0
= operands
[2];
11663 rtx op1
= operands
[3];
11664 rtx result
= target
;
11667 if (!REG_P (op0
) || REGNO (op0
) != T_REG
11668 || !CONST_INT_P (op1
))
11670 if (!REG_P (result
))
11671 result
= gen_reg_rtx (SImode
);
11672 val
= INTVAL (op1
);
11673 if ((code
== EQ
&& val
== 1) || (code
== NE
&& val
== 0))
11674 emit_insn (gen_movt (result
));
11675 else if (TARGET_SH2A
&& ((code
== EQ
&& val
== 0)
11676 || (code
== NE
&& val
== 1)))
11677 emit_insn (gen_xorsi3_movrt (result
));
11678 else if ((code
== EQ
&& val
== 0) || (code
== NE
&& val
== 1))
11680 emit_clobber (result
);
11681 emit_insn (gen_subc (result
, result
, result
));
11682 emit_insn (gen_addsi3 (result
, result
, const1_rtx
));
11684 else if (code
== EQ
|| code
== NE
)
11685 emit_insn (gen_move_insn (result
, GEN_INT (code
== NE
)));
11688 if (result
!= target
)
11689 emit_move_insn (target
, result
);
11693 /* INSN is an sfunc; return the rtx that describes the address used. */
11695 extract_sfunc_addr (rtx insn
)
11697 rtx pattern
, part
= NULL_RTX
;
11700 pattern
= PATTERN (insn
);
11701 len
= XVECLEN (pattern
, 0);
11702 for (i
= 0; i
< len
; i
++)
11704 part
= XVECEXP (pattern
, 0, i
);
11705 if (GET_CODE (part
) == USE
&& GET_MODE (XEXP (part
, 0)) == Pmode
11706 && GENERAL_REGISTER_P (true_regnum (XEXP (part
, 0))))
11707 return XEXP (part
, 0);
11709 gcc_assert (GET_CODE (XVECEXP (pattern
, 0, 0)) == UNSPEC_VOLATILE
);
11710 return XVECEXP (XVECEXP (pattern
, 0, 0), 0, 1);
11713 /* Verify that the register in use_sfunc_addr still agrees with the address
11714 used in the sfunc. This prevents fill_slots_from_thread from changing
11716 INSN is the use_sfunc_addr instruction, and REG is the register it
11719 check_use_sfunc_addr (rtx insn
, rtx reg
)
11721 /* Search for the sfunc. It should really come right after INSN. */
11722 while ((insn
= NEXT_INSN (insn
)))
11724 if (LABEL_P (insn
) || JUMP_P (insn
))
11726 if (! INSN_P (insn
))
11729 if (GET_CODE (PATTERN (insn
)) == SEQUENCE
)
11730 insn
= XVECEXP (PATTERN (insn
), 0, 0);
11731 if (GET_CODE (PATTERN (insn
)) != PARALLEL
11732 || get_attr_type (insn
) != TYPE_SFUNC
)
11734 return rtx_equal_p (extract_sfunc_addr (insn
), reg
);
11736 gcc_unreachable ();
11739 /* This function returns a constant rtx that represents pi / 2**15 in
11740 SFmode. it's used to scale SFmode angles, in radians, to a
11741 fixed-point signed 16.16-bit fraction of a full circle, i.e., 2*pi
11742 maps to 0x10000). */
11744 static GTY(()) rtx sh_fsca_sf2int_rtx
;
11747 sh_fsca_sf2int (void)
11749 if (! sh_fsca_sf2int_rtx
)
11751 REAL_VALUE_TYPE rv
;
11753 real_from_string (&rv
, "10430.378350470453");
11754 sh_fsca_sf2int_rtx
= const_double_from_real_value (rv
, SFmode
);
11757 return sh_fsca_sf2int_rtx
;
11760 /* This function returns a constant rtx that represents pi / 2**15 in
11761 DFmode. it's used to scale DFmode angles, in radians, to a
11762 fixed-point signed 16.16-bit fraction of a full circle, i.e., 2*pi
11763 maps to 0x10000). */
11765 static GTY(()) rtx sh_fsca_df2int_rtx
;
11768 sh_fsca_df2int (void)
11770 if (! sh_fsca_df2int_rtx
)
11772 REAL_VALUE_TYPE rv
;
11774 real_from_string (&rv
, "10430.378350470453");
11775 sh_fsca_df2int_rtx
= const_double_from_real_value (rv
, DFmode
);
11778 return sh_fsca_df2int_rtx
;
11781 /* This function returns a constant rtx that represents 2**15 / pi in
11782 SFmode. it's used to scale a fixed-point signed 16.16-bit fraction
11783 of a full circle back to a SFmode value, i.e., 0x10000 maps to
11786 static GTY(()) rtx sh_fsca_int2sf_rtx
;
11789 sh_fsca_int2sf (void)
11791 if (! sh_fsca_int2sf_rtx
)
11793 REAL_VALUE_TYPE rv
;
11795 real_from_string (&rv
, "9.587379924285257e-5");
11796 sh_fsca_int2sf_rtx
= const_double_from_real_value (rv
, SFmode
);
11799 return sh_fsca_int2sf_rtx
;
11802 /* Initialize the CUMULATIVE_ARGS structure. */
11805 sh_init_cumulative_args (CUMULATIVE_ARGS
* pcum
,
11807 rtx libname ATTRIBUTE_UNUSED
,
11809 signed int n_named_args
,
11810 enum machine_mode mode
)
11812 pcum
->arg_count
[(int) SH_ARG_FLOAT
] = 0;
11813 pcum
->free_single_fp_reg
= 0;
11814 pcum
->stack_regs
= 0;
11815 pcum
->byref_regs
= 0;
11817 pcum
->outgoing
= (n_named_args
== -1) ? 0 : 1;
11819 /* XXX - Should we check TARGET_HITACHI here ??? */
11820 pcum
->renesas_abi
= sh_attr_renesas_p (fntype
) ? 1 : 0;
11824 pcum
->force_mem
= ((TARGET_HITACHI
|| pcum
->renesas_abi
)
11825 && aggregate_value_p (TREE_TYPE (fntype
), fndecl
));
11826 pcum
->prototype_p
= TYPE_ARG_TYPES (fntype
) ? TRUE
: FALSE
;
11827 pcum
->arg_count
[(int) SH_ARG_INT
]
11828 = TARGET_SH5
&& aggregate_value_p (TREE_TYPE (fntype
), fndecl
);
11831 = CALL_COOKIE_RET_TRAMP (TARGET_SHCOMPACT
11832 && pcum
->arg_count
[(int) SH_ARG_INT
] == 0
11833 && (TYPE_MODE (TREE_TYPE (fntype
)) == BLKmode
11834 ? int_size_in_bytes (TREE_TYPE (fntype
))
11835 : GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (fntype
)))) > 4
11836 && (BASE_RETURN_VALUE_REG (TYPE_MODE (TREE_TYPE (fntype
)))
11837 == FIRST_RET_REG
));
11841 pcum
->arg_count
[(int) SH_ARG_INT
] = 0;
11842 pcum
->prototype_p
= FALSE
;
11843 if (mode
!= VOIDmode
)
11845 pcum
->call_cookie
=
11846 CALL_COOKIE_RET_TRAMP (TARGET_SHCOMPACT
11847 && GET_MODE_SIZE (mode
) > 4
11848 && BASE_RETURN_VALUE_REG (mode
) == FIRST_RET_REG
);
11850 /* If the default ABI is the Renesas ABI then all library
11851 calls must assume that the library will be using the
11852 Renesas ABI. So if the function would return its result
11853 in memory then we must force the address of this memory
11854 block onto the stack. Ideally we would like to call
11855 targetm.calls.return_in_memory() here but we do not have
11856 the TYPE or the FNDECL available so we synthesize the
11857 contents of that function as best we can. */
11859 (TARGET_DEFAULT
& MASK_HITACHI
)
11860 && (mode
== BLKmode
11861 || (GET_MODE_SIZE (mode
) > 4
11862 && !(mode
== DFmode
11863 && TARGET_FPU_DOUBLE
)));
11867 pcum
->call_cookie
= 0;
11868 pcum
->force_mem
= FALSE
;
11873 /* Replace any occurrence of FROM(n) in X with TO(n). The function does
11874 not enter into CONST_DOUBLE for the replace.
11876 Note that copying is not done so X must not be shared unless all copies
11877 are to be modified.
11879 This is like replace_rtx, except that we operate on N_REPLACEMENTS
11880 replacements simultaneously - FROM(n) is replacements[n*2] and to(n) is
11881 replacements[n*2+1] - and that we take mode changes into account.
11883 If a replacement is ambiguous, return NULL_RTX.
11885 If MODIFY is zero, don't modify any rtl in place,
11886 just return zero or nonzero for failure / success. */
11889 replace_n_hard_rtx (rtx x
, rtx
*replacements
, int n_replacements
, int modify
)
11894 /* The following prevents loops occurrence when we change MEM in
11895 CONST_DOUBLE onto the same CONST_DOUBLE. */
11896 if (x
!= 0 && GET_CODE (x
) == CONST_DOUBLE
)
11899 for (i
= n_replacements
- 1; i
>= 0 ; i
--)
11900 if (x
== replacements
[i
*2] && GET_MODE (x
) == GET_MODE (replacements
[i
*2+1]))
11901 return replacements
[i
*2+1];
11903 /* Allow this function to make replacements in EXPR_LISTs. */
11907 if (GET_CODE (x
) == SUBREG
)
11909 rtx new_rtx
= replace_n_hard_rtx (SUBREG_REG (x
), replacements
,
11910 n_replacements
, modify
);
11912 if (CONST_INT_P (new_rtx
))
11914 x
= simplify_subreg (GET_MODE (x
), new_rtx
,
11915 GET_MODE (SUBREG_REG (x
)),
11921 SUBREG_REG (x
) = new_rtx
;
11925 else if (REG_P (x
))
11927 unsigned regno
= REGNO (x
);
11928 unsigned nregs
= (regno
< FIRST_PSEUDO_REGISTER
11929 ? HARD_REGNO_NREGS (regno
, GET_MODE (x
)) : 1);
11930 rtx result
= NULL_RTX
;
11932 for (i
= n_replacements
- 1; i
>= 0; i
--)
11934 rtx from
= replacements
[i
*2];
11935 rtx to
= replacements
[i
*2+1];
11936 unsigned from_regno
, from_nregs
, to_regno
, new_regno
;
11940 from_regno
= REGNO (from
);
11941 from_nregs
= (from_regno
< FIRST_PSEUDO_REGISTER
11942 ? HARD_REGNO_NREGS (from_regno
, GET_MODE (from
)) : 1);
11943 if (regno
< from_regno
+ from_nregs
&& regno
+ nregs
> from_regno
)
11945 if (regno
< from_regno
11946 || regno
+ nregs
> from_regno
+ nregs
11950 to_regno
= REGNO (to
);
11951 if (to_regno
< FIRST_PSEUDO_REGISTER
)
11953 new_regno
= regno
+ to_regno
- from_regno
;
11954 if ((unsigned) HARD_REGNO_NREGS (new_regno
, GET_MODE (x
))
11957 result
= gen_rtx_REG (GET_MODE (x
), new_regno
);
11959 else if (GET_MODE (x
) <= GET_MODE (to
))
11960 result
= gen_lowpart_common (GET_MODE (x
), to
);
11962 result
= gen_lowpart_SUBREG (GET_MODE (x
), to
);
11965 return result
? result
: x
;
11967 else if (GET_CODE (x
) == ZERO_EXTEND
)
11969 rtx new_rtx
= replace_n_hard_rtx (XEXP (x
, 0), replacements
,
11970 n_replacements
, modify
);
11972 if (CONST_INT_P (new_rtx
))
11974 x
= simplify_unary_operation (ZERO_EXTEND
, GET_MODE (x
),
11975 new_rtx
, GET_MODE (XEXP (x
, 0)));
11980 XEXP (x
, 0) = new_rtx
;
11985 fmt
= GET_RTX_FORMAT (GET_CODE (x
));
11986 for (i
= GET_RTX_LENGTH (GET_CODE (x
)) - 1; i
>= 0; i
--)
11992 new_rtx
= replace_n_hard_rtx (XEXP (x
, i
), replacements
,
11993 n_replacements
, modify
);
11997 XEXP (x
, i
) = new_rtx
;
11999 else if (fmt
[i
] == 'E')
12000 for (j
= XVECLEN (x
, i
) - 1; j
>= 0; j
--)
12002 new_rtx
= replace_n_hard_rtx (XVECEXP (x
, i
, j
), replacements
,
12003 n_replacements
, modify
);
12007 XVECEXP (x
, i
, j
) = new_rtx
;
12015 sh_gen_truncate (enum machine_mode mode
, rtx x
, int need_sign_ext
)
12017 enum rtx_code code
= TRUNCATE
;
12019 if (GET_CODE (x
) == ZERO_EXTEND
|| GET_CODE (x
) == SIGN_EXTEND
)
12021 rtx inner
= XEXP (x
, 0);
12022 enum machine_mode inner_mode
= GET_MODE (inner
);
12024 if (inner_mode
== mode
)
12026 else if (GET_MODE_SIZE (inner_mode
) >= GET_MODE_SIZE (mode
))
12028 else if (GET_MODE_SIZE (inner_mode
) < GET_MODE_SIZE (mode
)
12029 && (! need_sign_ext
|| GET_CODE (x
) == SIGN_EXTEND
))
12031 code
= GET_CODE (x
);
12035 return gen_rtx_fmt_e (code
, mode
, x
);
12038 /* called via for_each_rtx after reload, to clean up truncates of
12039 registers that span multiple actual hard registers. */
12041 shmedia_cleanup_truncate (rtx
*p
, void *n_changes
)
12045 if (GET_CODE (x
) != TRUNCATE
)
12048 if (GET_MODE_SIZE (GET_MODE (reg
)) > 8 && REG_P (reg
))
12050 enum machine_mode reg_mode
= GET_MODE (reg
);
12051 XEXP (x
, 0) = simplify_subreg (DImode
, reg
, reg_mode
,
12052 subreg_lowpart_offset (DImode
, reg_mode
));
12053 *(int*) n_changes
+= 1;
12059 /* Load and store depend on the highpart of the address. However,
12060 set_attr_alternative does not give well-defined results before reload,
12061 so we must look at the rtl ourselves to see if any of the feeding
12062 registers is used in a memref. */
12064 /* Called by sh_contains_memref_p via for_each_rtx. */
12066 sh_contains_memref_p_1 (rtx
*loc
, void *data ATTRIBUTE_UNUSED
)
12068 return (MEM_P (*loc
));
12071 /* Return nonzero iff INSN contains a MEM. */
12073 sh_contains_memref_p (rtx insn
)
12075 return for_each_rtx (&PATTERN (insn
), &sh_contains_memref_p_1
, NULL
);
12078 /* Return nonzero iff INSN loads a banked register. */
12080 sh_loads_bankedreg_p (rtx insn
)
12082 if (GET_CODE (PATTERN (insn
)) == SET
)
12084 rtx op
= SET_DEST (PATTERN(insn
));
12085 if (REG_P (op
) && BANKED_REGISTER_P (REGNO (op
)))
12092 /* FNADDR is the MEM expression from a call expander. Return an address
12093 to use in an SHmedia insn pattern. */
12095 shmedia_prepare_call_address (rtx fnaddr
, int is_sibcall
)
12099 fnaddr
= XEXP (fnaddr
, 0);
12100 is_sym
= GET_CODE (fnaddr
) == SYMBOL_REF
;
12101 if (flag_pic
&& is_sym
)
12103 if (! SYMBOL_REF_LOCAL_P (fnaddr
))
12105 rtx reg
= gen_reg_rtx (Pmode
);
12107 /* We must not use GOTPLT for sibcalls, because PIC_REG
12108 must be restored before the PLT code gets to run. */
12110 emit_insn (gen_symGOT2reg (reg
, fnaddr
));
12112 emit_insn (gen_symGOTPLT2reg (reg
, fnaddr
));
12117 fnaddr
= gen_sym2PIC (fnaddr
);
12118 PUT_MODE (fnaddr
, Pmode
);
12121 /* If ptabs might trap, make this visible to the rest of the compiler.
12122 We generally assume that symbols pertain to valid locations, but
12123 it is possible to generate invalid symbols with asm or linker tricks.
12124 In a list of functions where each returns its successor, an invalid
12125 symbol might denote an empty list. */
12126 if (!TARGET_PT_FIXED
12127 && (!is_sym
|| TARGET_INVALID_SYMBOLS
)
12128 && (!REG_P (fnaddr
) || ! TARGET_REGISTER_P (REGNO (fnaddr
))))
12130 rtx tr
= gen_reg_rtx (PDImode
);
12132 emit_insn (gen_ptabs (tr
, fnaddr
));
12135 else if (! target_reg_operand (fnaddr
, Pmode
))
12136 fnaddr
= copy_to_mode_reg (Pmode
, fnaddr
);
12141 sh_secondary_reload (bool in_p
, rtx x
, enum reg_class rclass
,
12142 enum machine_mode mode
, secondary_reload_info
*sri
)
12146 if (REGCLASS_HAS_FP_REG (rclass
)
12147 && ! TARGET_SHMEDIA
12148 && immediate_operand ((x
), mode
)
12149 && ! ((fp_zero_operand (x
) || fp_one_operand (x
))
12150 && mode
== SFmode
&& fldi_ok ()))
12154 sri
->icode
= CODE_FOR_reload_insf__frn
;
12157 sri
->icode
= CODE_FOR_reload_indf__frn
;
12160 /* ??? If we knew that we are in the appropriate mode -
12161 single precision - we could use a reload pattern directly. */
12166 if (rclass
== FPUL_REGS
12168 && (REGNO (x
) == MACL_REG
|| REGNO (x
) == MACH_REG
12169 || REGNO (x
) == T_REG
))
12170 || GET_CODE (x
) == PLUS
))
12171 return GENERAL_REGS
;
12172 if (rclass
== FPUL_REGS
&& immediate_operand (x
, mode
))
12174 if (satisfies_constraint_I08 (x
) || fp_zero_operand (x
))
12175 return GENERAL_REGS
;
12176 else if (mode
== SFmode
)
12178 sri
->icode
= CODE_FOR_reload_insi__i_fpul
;
12181 if (rclass
== FPSCR_REGS
12182 && ((REG_P (x
) && REGNO (x
) >= FIRST_PSEUDO_REGISTER
)
12183 || (MEM_P (x
) && GET_CODE (XEXP (x
, 0)) == PLUS
)))
12184 return GENERAL_REGS
;
12185 if (REGCLASS_HAS_FP_REG (rclass
)
12187 && immediate_operand (x
, mode
)
12188 && x
!= CONST0_RTX (GET_MODE (x
))
12189 && GET_MODE (x
) != V4SFmode
)
12190 return GENERAL_REGS
;
12191 if ((mode
== QImode
|| mode
== HImode
)
12192 && TARGET_SHMEDIA
&& inqhi_operand (x
, mode
))
12194 sri
->icode
= ((mode
== QImode
)
12195 ? CODE_FOR_reload_inqi
: CODE_FOR_reload_inhi
);
12198 if (TARGET_SHMEDIA
&& rclass
== GENERAL_REGS
12199 && (GET_CODE (x
) == LABEL_REF
|| PIC_ADDR_P (x
)))
12200 return TARGET_REGS
;
12201 } /* end of input-only processing. */
12203 if (((REGCLASS_HAS_FP_REG (rclass
)
12205 && (GENERAL_OR_AP_REGISTER_P (REGNO (x
))
12206 || (FP_REGISTER_P (REGNO (x
)) && mode
== SImode
12207 && TARGET_FMOVD
))))
12208 || (REGCLASS_HAS_GENERAL_REG (rclass
)
12210 && FP_REGISTER_P (REGNO (x
))))
12211 && ! TARGET_SHMEDIA
12212 && (mode
== SFmode
|| mode
== SImode
))
12214 if ((rclass
== FPUL_REGS
12215 || (REGCLASS_HAS_FP_REG (rclass
)
12216 && ! TARGET_SHMEDIA
&& mode
== SImode
))
12219 && (REGNO (x
) >= FIRST_PSEUDO_REGISTER
12220 || REGNO (x
) == T_REG
12221 || system_reg_operand (x
, VOIDmode
)))))
12223 if (rclass
== FPUL_REGS
)
12224 return GENERAL_REGS
;
12227 if ((rclass
== TARGET_REGS
12228 || (TARGET_SHMEDIA
&& rclass
== SIBCALL_REGS
))
12229 && !satisfies_constraint_Csy (x
)
12230 && (!REG_P (x
) || ! GENERAL_REGISTER_P (REGNO (x
))))
12231 return GENERAL_REGS
;
12232 if ((rclass
== MAC_REGS
|| rclass
== PR_REGS
)
12233 && REG_P (x
) && ! GENERAL_REGISTER_P (REGNO (x
))
12234 && rclass
!= REGNO_REG_CLASS (REGNO (x
)))
12235 return GENERAL_REGS
;
12236 if (rclass
!= GENERAL_REGS
&& REG_P (x
)
12237 && TARGET_REGISTER_P (REGNO (x
)))
12238 return GENERAL_REGS
;
12242 enum sh_divide_strategy_e sh_div_strategy
= SH_DIV_STRATEGY_DEFAULT
;