]>
Commit | Line | Data |
---|---|---|
d1e082c2 | 1 | /* Copyright (C) 1997-2013 Free Software Foundation, Inc. |
36a05131 BS |
2 | Contributed by Red Hat, Inc. |
3 | ||
7ec022b2 | 4 | This file is part of GCC. |
36a05131 | 5 | |
7ec022b2 | 6 | GCC is free software; you can redistribute it and/or modify |
36a05131 | 7 | it under the terms of the GNU General Public License as published by |
2f83c7d6 | 8 | the Free Software Foundation; either version 3, or (at your option) |
36a05131 BS |
9 | any later version. |
10 | ||
7ec022b2 | 11 | GCC is distributed in the hope that it will be useful, |
36a05131 BS |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
2f83c7d6 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
36a05131 BS |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
4977bab6 ZW |
22 | #include "coretypes.h" |
23 | #include "tm.h" | |
36a05131 BS |
24 | #include "rtl.h" |
25 | #include "tree.h" | |
26 | #include "regs.h" | |
27 | #include "hard-reg-set.h" | |
36a05131 BS |
28 | #include "insn-config.h" |
29 | #include "conditions.h" | |
30 | #include "insn-flags.h" | |
31 | #include "output.h" | |
32 | #include "insn-attr.h" | |
33 | #include "flags.h" | |
34 | #include "recog.h" | |
35 | #include "reload.h" | |
36 | #include "expr.h" | |
37 | #include "obstack.h" | |
38 | #include "except.h" | |
39 | #include "function.h" | |
40 | #include "optabs.h" | |
718f9c0f | 41 | #include "diagnostic-core.h" |
36a05131 BS |
42 | #include "basic-block.h" |
43 | #include "tm_p.h" | |
44 | #include "ggc.h" | |
36a05131 BS |
45 | #include "target.h" |
46 | #include "target-def.h" | |
8cd5a4e0 | 47 | #include "targhooks.h" |
6e34d3a3 | 48 | #include "langhooks.h" |
6fb5fa3c | 49 | #include "df.h" |
7ee2468b | 50 | #include "dumpfile.h" |
36a05131 BS |
51 | |
52 | #ifndef FRV_INLINE | |
53 | #define FRV_INLINE inline | |
54 | #endif | |
55 | ||
c557edf4 RS |
56 | /* The maximum number of distinct NOP patterns. There are three: |
57 | nop, fnop and mnop. */ | |
58 | #define NUM_NOP_PATTERNS 3 | |
59 | ||
60 | /* Classification of instructions and units: integer, floating-point/media, | |
61 | branch and control. */ | |
62 | enum frv_insn_group { GROUP_I, GROUP_FM, GROUP_B, GROUP_C, NUM_GROUPS }; | |
63 | ||
64 | /* The DFA names of the units, in packet order. */ | |
65 | static const char *const frv_unit_names[] = | |
66 | { | |
67 | "c", | |
68 | "i0", "f0", | |
69 | "i1", "f1", | |
70 | "i2", "f2", | |
71 | "i3", "f3", | |
72 | "b0", "b1" | |
73 | }; | |
74 | ||
75 | /* The classification of each unit in frv_unit_names[]. */ | |
76 | static const enum frv_insn_group frv_unit_groups[ARRAY_SIZE (frv_unit_names)] = | |
77 | { | |
78 | GROUP_C, | |
79 | GROUP_I, GROUP_FM, | |
80 | GROUP_I, GROUP_FM, | |
81 | GROUP_I, GROUP_FM, | |
82 | GROUP_I, GROUP_FM, | |
83 | GROUP_B, GROUP_B | |
84 | }; | |
85 | ||
86 | /* Return the DFA unit code associated with the Nth unit of integer | |
87 | or floating-point group GROUP, */ | |
88 | #define NTH_UNIT(GROUP, N) frv_unit_codes[(GROUP) + (N) * 2 + 1] | |
89 | ||
90 | /* Return the number of integer or floating-point unit UNIT | |
91 | (1 for I1, 2 for F2, etc.). */ | |
92 | #define UNIT_NUMBER(UNIT) (((UNIT) - 1) / 2) | |
93 | ||
94 | /* The DFA unit number for each unit in frv_unit_names[]. */ | |
95 | static int frv_unit_codes[ARRAY_SIZE (frv_unit_names)]; | |
96 | ||
97 | /* FRV_TYPE_TO_UNIT[T] is the last unit in frv_unit_names[] that can issue | |
98 | an instruction of type T. The value is ARRAY_SIZE (frv_unit_names) if | |
99 | no instruction of type T has been seen. */ | |
100 | static unsigned int frv_type_to_unit[TYPE_UNKNOWN + 1]; | |
101 | ||
102 | /* An array of dummy nop INSNs, one for each type of nop that the | |
103 | target supports. */ | |
104 | static GTY(()) rtx frv_nops[NUM_NOP_PATTERNS]; | |
105 | ||
106 | /* The number of nop instructions in frv_nops[]. */ | |
107 | static unsigned int frv_num_nops; | |
108 | ||
5c5e8419 JR |
109 | /* The type of access. FRV_IO_UNKNOWN means the access can be either |
110 | a read or a write. */ | |
111 | enum frv_io_type { FRV_IO_UNKNOWN, FRV_IO_READ, FRV_IO_WRITE }; | |
112 | ||
38c28a25 AH |
113 | /* Information about one __builtin_read or __builtin_write access, or |
114 | the combination of several such accesses. The most general value | |
115 | is all-zeros (an unknown access to an unknown address). */ | |
116 | struct frv_io { | |
5c5e8419 | 117 | enum frv_io_type type; |
38c28a25 AH |
118 | |
119 | /* The constant address being accessed, or zero if not known. */ | |
120 | HOST_WIDE_INT const_address; | |
121 | ||
122 | /* The run-time address, as used in operand 0 of the membar pattern. */ | |
123 | rtx var_address; | |
124 | }; | |
125 | ||
c557edf4 RS |
126 | /* Return true if instruction INSN should be packed with the following |
127 | instruction. */ | |
128 | #define PACKING_FLAG_P(INSN) (GET_MODE (INSN) == TImode) | |
129 | ||
130 | /* Set the value of PACKING_FLAG_P(INSN). */ | |
131 | #define SET_PACKING_FLAG(INSN) PUT_MODE (INSN, TImode) | |
132 | #define CLEAR_PACKING_FLAG(INSN) PUT_MODE (INSN, VOIDmode) | |
133 | ||
134 | /* Loop with REG set to each hard register in rtx X. */ | |
135 | #define FOR_EACH_REGNO(REG, X) \ | |
136 | for (REG = REGNO (X); \ | |
137 | REG < REGNO (X) + HARD_REGNO_NREGS (REGNO (X), GET_MODE (X)); \ | |
138 | REG++) | |
139 | ||
38c28a25 | 140 | /* This structure contains machine specific function data. */ |
d1b38208 | 141 | struct GTY(()) machine_function |
38c28a25 AH |
142 | { |
143 | /* True if we have created an rtx that relies on the stack frame. */ | |
144 | int frame_needed; | |
145 | ||
146 | /* True if this function contains at least one __builtin_{read,write}*. */ | |
147 | bool has_membar_p; | |
148 | }; | |
149 | ||
36a05131 BS |
150 | /* Temporary register allocation support structure. */ |
151 | typedef struct frv_tmp_reg_struct | |
152 | { | |
153 | HARD_REG_SET regs; /* possible registers to allocate */ | |
154 | int next_reg[N_REG_CLASSES]; /* next register to allocate per class */ | |
155 | } | |
156 | frv_tmp_reg_t; | |
157 | ||
c557edf4 | 158 | /* Register state information for VLIW re-packing phase. */ |
36a05131 | 159 | #define REGSTATE_CC_MASK 0x07 /* Mask to isolate CCn for cond exec */ |
c557edf4 RS |
160 | #define REGSTATE_MODIFIED 0x08 /* reg modified in current VLIW insn */ |
161 | #define REGSTATE_IF_TRUE 0x10 /* reg modified in cond exec true */ | |
162 | #define REGSTATE_IF_FALSE 0x20 /* reg modified in cond exec false */ | |
163 | ||
36a05131 BS |
164 | #define REGSTATE_IF_EITHER (REGSTATE_IF_TRUE | REGSTATE_IF_FALSE) |
165 | ||
c557edf4 | 166 | typedef unsigned char regstate_t; |
36a05131 BS |
167 | |
168 | /* Used in frv_frame_accessor_t to indicate the direction of a register-to- | |
169 | memory move. */ | |
170 | enum frv_stack_op | |
171 | { | |
172 | FRV_LOAD, | |
173 | FRV_STORE | |
174 | }; | |
175 | ||
176 | /* Information required by frv_frame_access. */ | |
177 | typedef struct | |
178 | { | |
179 | /* This field is FRV_LOAD if registers are to be loaded from the stack and | |
180 | FRV_STORE if they should be stored onto the stack. FRV_STORE implies | |
181 | the move is being done by the prologue code while FRV_LOAD implies it | |
182 | is being done by the epilogue. */ | |
183 | enum frv_stack_op op; | |
184 | ||
185 | /* The base register to use when accessing the stack. This may be the | |
186 | frame pointer, stack pointer, or a temporary. The choice of register | |
187 | depends on which part of the frame is being accessed and how big the | |
188 | frame is. */ | |
189 | rtx base; | |
190 | ||
191 | /* The offset of BASE from the bottom of the current frame, in bytes. */ | |
192 | int base_offset; | |
193 | } frv_frame_accessor_t; | |
194 | ||
87b483a1 | 195 | /* Conditional execution support gathered together in one structure. */ |
36a05131 BS |
196 | typedef struct |
197 | { | |
198 | /* Linked list of insns to add if the conditional execution conversion was | |
199 | successful. Each link points to an EXPR_LIST which points to the pattern | |
200 | of the insn to add, and the insn to be inserted before. */ | |
201 | rtx added_insns_list; | |
202 | ||
203 | /* Identify which registers are safe to allocate for if conversions to | |
204 | conditional execution. We keep the last allocated register in the | |
205 | register classes between COND_EXEC statements. This will mean we allocate | |
206 | different registers for each different COND_EXEC group if we can. This | |
207 | might allow the scheduler to intermix two different COND_EXEC sections. */ | |
208 | frv_tmp_reg_t tmp_reg; | |
209 | ||
210 | /* For nested IFs, identify which CC registers are used outside of setting | |
211 | via a compare isnsn, and using via a check insn. This will allow us to | |
212 | know if we can rewrite the register to use a different register that will | |
213 | be paired with the CR register controlling the nested IF-THEN blocks. */ | |
214 | HARD_REG_SET nested_cc_ok_rewrite; | |
215 | ||
216 | /* Temporary registers allocated to hold constants during conditional | |
217 | execution. */ | |
218 | rtx scratch_regs[FIRST_PSEUDO_REGISTER]; | |
219 | ||
220 | /* Current number of temp registers available. */ | |
221 | int cur_scratch_regs; | |
222 | ||
87b483a1 | 223 | /* Number of nested conditional execution blocks. */ |
36a05131 BS |
224 | int num_nested_cond_exec; |
225 | ||
226 | /* Map of insns that set up constants in scratch registers. */ | |
227 | bitmap scratch_insns_bitmap; | |
228 | ||
87b483a1 | 229 | /* Conditional execution test register (CC0..CC7). */ |
36a05131 BS |
230 | rtx cr_reg; |
231 | ||
232 | /* Conditional execution compare register that is paired with cr_reg, so that | |
233 | nested compares can be done. The csubcc and caddcc instructions don't | |
234 | have enough bits to specify both a CC register to be set and a CR register | |
235 | to do the test on, so the same bit number is used for both. Needless to | |
839a4992 | 236 | say, this is rather inconvenient for GCC. */ |
36a05131 BS |
237 | rtx nested_cc_reg; |
238 | ||
239 | /* Extra CR registers used for &&, ||. */ | |
240 | rtx extra_int_cr; | |
241 | rtx extra_fp_cr; | |
242 | ||
243 | /* Previous CR used in nested if, to make sure we are dealing with the same | |
87b483a1 | 244 | nested if as the previous statement. */ |
36a05131 BS |
245 | rtx last_nested_if_cr; |
246 | } | |
247 | frv_ifcvt_t; | |
248 | ||
249 | static /* GTY(()) */ frv_ifcvt_t frv_ifcvt; | |
250 | ||
251 | /* Map register number to smallest register class. */ | |
252 | enum reg_class regno_reg_class[FIRST_PSEUDO_REGISTER]; | |
253 | ||
87b483a1 | 254 | /* Cached value of frv_stack_info. */ |
36a05131 BS |
255 | static frv_stack_t *frv_stack_cache = (frv_stack_t *)0; |
256 | ||
36a05131 | 257 | /* Forward references */ |
0b2c18fe | 258 | |
c5387660 | 259 | static void frv_option_override (void); |
c6c3dba9 | 260 | static bool frv_legitimate_address_p (enum machine_mode, rtx, bool); |
f2206911 | 261 | static int frv_default_flags_for_cpu (void); |
3101faab | 262 | static int frv_string_begins_with (const_tree, const char *); |
34208acf | 263 | static FRV_INLINE bool frv_small_data_reloc_p (rtx, int); |
0fb30cb7 NF |
264 | static void frv_print_operand (FILE *, rtx, int); |
265 | static void frv_print_operand_address (FILE *, rtx); | |
266 | static bool frv_print_operand_punct_valid_p (unsigned char code); | |
36a05131 | 267 | static void frv_print_operand_memory_reference_reg |
f2206911 KC |
268 | (FILE *, rtx); |
269 | static void frv_print_operand_memory_reference (FILE *, rtx, int); | |
270 | static int frv_print_operand_jump_hint (rtx); | |
036ff63f | 271 | static const char *comparison_string (enum rtx_code, rtx); |
219d92a4 AS |
272 | static rtx frv_function_value (const_tree, const_tree, |
273 | bool); | |
274 | static rtx frv_libcall_value (enum machine_mode, | |
275 | const_rtx); | |
f2206911 KC |
276 | static FRV_INLINE int frv_regno_ok_for_base_p (int, int); |
277 | static rtx single_set_pattern (rtx); | |
278 | static int frv_function_contains_far_jump (void); | |
279 | static rtx frv_alloc_temp_reg (frv_tmp_reg_t *, | |
280 | enum reg_class, | |
281 | enum machine_mode, | |
282 | int, int); | |
283 | static rtx frv_frame_offset_rtx (int); | |
284 | static rtx frv_frame_mem (enum machine_mode, rtx, int); | |
285 | static rtx frv_dwarf_store (rtx, int); | |
286 | static void frv_frame_insn (rtx, rtx); | |
287 | static void frv_frame_access (frv_frame_accessor_t*, | |
288 | rtx, int); | |
289 | static void frv_frame_access_multi (frv_frame_accessor_t*, | |
290 | frv_stack_t *, int); | |
291 | static void frv_frame_access_standard_regs (enum frv_stack_op, | |
292 | frv_stack_t *); | |
293 | static struct machine_function *frv_init_machine_status (void); | |
f2206911 KC |
294 | static rtx frv_int_to_acc (enum insn_code, int, rtx); |
295 | static enum machine_mode frv_matching_accg_mode (enum machine_mode); | |
2396bce1 EC |
296 | static rtx frv_read_argument (tree, unsigned int); |
297 | static rtx frv_read_iacc_argument (enum machine_mode, tree, unsigned int); | |
f2206911 KC |
298 | static int frv_check_constant_argument (enum insn_code, int, rtx); |
299 | static rtx frv_legitimize_target (enum insn_code, rtx); | |
300 | static rtx frv_legitimize_argument (enum insn_code, int, rtx); | |
bef8809e | 301 | static rtx frv_legitimize_tls_address (rtx, enum tls_model); |
506d7b68 | 302 | static rtx frv_legitimize_address (rtx, rtx, enum machine_mode); |
f2206911 KC |
303 | static rtx frv_expand_set_builtin (enum insn_code, tree, rtx); |
304 | static rtx frv_expand_unop_builtin (enum insn_code, tree, rtx); | |
305 | static rtx frv_expand_binop_builtin (enum insn_code, tree, rtx); | |
306 | static rtx frv_expand_cut_builtin (enum insn_code, tree, rtx); | |
307 | static rtx frv_expand_binopimm_builtin (enum insn_code, tree, rtx); | |
308 | static rtx frv_expand_voidbinop_builtin (enum insn_code, tree); | |
c557edf4 RS |
309 | static rtx frv_expand_int_void2arg (enum insn_code, tree); |
310 | static rtx frv_expand_prefetches (enum insn_code, tree); | |
f2206911 KC |
311 | static rtx frv_expand_voidtriop_builtin (enum insn_code, tree); |
312 | static rtx frv_expand_voidaccop_builtin (enum insn_code, tree); | |
313 | static rtx frv_expand_mclracc_builtin (tree); | |
314 | static rtx frv_expand_mrdacc_builtin (enum insn_code, tree); | |
315 | static rtx frv_expand_mwtacc_builtin (enum insn_code, tree); | |
316 | static rtx frv_expand_noargs_builtin (enum insn_code); | |
c557edf4 | 317 | static void frv_split_iacc_move (rtx, rtx); |
f2206911 KC |
318 | static rtx frv_emit_comparison (enum rtx_code, rtx, rtx); |
319 | static int frv_clear_registers_used (rtx *, void *); | |
320 | static void frv_ifcvt_add_insn (rtx, rtx, int); | |
321 | static rtx frv_ifcvt_rewrite_mem (rtx, enum machine_mode, rtx); | |
322 | static rtx frv_ifcvt_load_value (rtx, rtx); | |
c557edf4 RS |
323 | static int frv_acc_group_1 (rtx *, void *); |
324 | static unsigned int frv_insn_unit (rtx); | |
325 | static bool frv_issues_to_branch_unit_p (rtx); | |
326 | static int frv_cond_flags (rtx); | |
327 | static bool frv_regstate_conflict_p (regstate_t, regstate_t); | |
328 | static int frv_registers_conflict_p_1 (rtx *, void *); | |
329 | static bool frv_registers_conflict_p (rtx); | |
7bc980e1 | 330 | static void frv_registers_update_1 (rtx, const_rtx, void *); |
c557edf4 RS |
331 | static void frv_registers_update (rtx); |
332 | static void frv_start_packet (void); | |
333 | static void frv_start_packet_block (void); | |
334 | static void frv_finish_packet (void (*) (void)); | |
335 | static bool frv_pack_insn_p (rtx); | |
336 | static void frv_add_insn_to_packet (rtx); | |
337 | static void frv_insert_nop_in_packet (rtx); | |
338 | static bool frv_for_each_packet (void (*) (void)); | |
339 | static bool frv_sort_insn_group_1 (enum frv_insn_group, | |
340 | unsigned int, unsigned int, | |
341 | unsigned int, unsigned int, | |
342 | state_t); | |
343 | static int frv_compare_insns (const void *, const void *); | |
344 | static void frv_sort_insn_group (enum frv_insn_group); | |
345 | static void frv_reorder_packet (void); | |
346 | static void frv_fill_unused_units (enum frv_insn_group); | |
347 | static void frv_align_label (void); | |
348 | static void frv_reorg_packet (void); | |
349 | static void frv_register_nop (rtx); | |
350 | static void frv_reorg (void); | |
f2206911 KC |
351 | static void frv_pack_insns (void); |
352 | static void frv_function_prologue (FILE *, HOST_WIDE_INT); | |
353 | static void frv_function_epilogue (FILE *, HOST_WIDE_INT); | |
354 | static bool frv_assemble_integer (rtx, unsigned, int); | |
355 | static void frv_init_builtins (void); | |
356 | static rtx frv_expand_builtin (tree, rtx, rtx, enum machine_mode, int); | |
357 | static void frv_init_libfuncs (void); | |
3101faab | 358 | static bool frv_in_small_data_p (const_tree); |
3961e8fe | 359 | static void frv_asm_output_mi_thunk |
f2206911 | 360 | (FILE *, tree, HOST_WIDE_INT, HOST_WIDE_INT, tree); |
d5cc9181 | 361 | static void frv_setup_incoming_varargs (cumulative_args_t, |
d8c2bed3 KH |
362 | enum machine_mode, |
363 | tree, int *, int); | |
8ac411c7 | 364 | static rtx frv_expand_builtin_saveregs (void); |
d7bd8aeb | 365 | static void frv_expand_builtin_va_start (tree, rtx); |
68f932c4 RS |
366 | static bool frv_rtx_costs (rtx, int, int, int, int*, |
367 | bool); | |
33124e84 AS |
368 | static int frv_register_move_cost (enum machine_mode, |
369 | reg_class_t, reg_class_t); | |
370 | static int frv_memory_move_cost (enum machine_mode, | |
371 | reg_class_t, bool); | |
f2206911 KC |
372 | static void frv_asm_out_constructor (rtx, int); |
373 | static void frv_asm_out_destructor (rtx, int); | |
34208acf | 374 | static bool frv_function_symbol_referenced_p (rtx); |
1a627b35 | 375 | static bool frv_legitimate_constant_p (enum machine_mode, rtx); |
fbbf66e7 | 376 | static bool frv_cannot_force_const_mem (enum machine_mode, rtx); |
34208acf AO |
377 | static const char *unspec_got_name (int); |
378 | static void frv_output_const_unspec (FILE *, | |
379 | const struct frv_unspec *); | |
764678d1 | 380 | static bool frv_function_ok_for_sibcall (tree, tree); |
8ac411c7 | 381 | static rtx frv_struct_value_rtx (tree, int); |
586de218 | 382 | static bool frv_must_pass_in_stack (enum machine_mode mode, const_tree type); |
d5cc9181 | 383 | static int frv_arg_partial_bytes (cumulative_args_t, enum machine_mode, |
78a52f11 | 384 | tree, bool); |
d5cc9181 | 385 | static rtx frv_function_arg (cumulative_args_t, enum machine_mode, |
88a1f47f | 386 | const_tree, bool); |
d5cc9181 | 387 | static rtx frv_function_incoming_arg (cumulative_args_t, enum machine_mode, |
88a1f47f | 388 | const_tree, bool); |
d5cc9181 | 389 | static void frv_function_arg_advance (cumulative_args_t, enum machine_mode, |
88a1f47f | 390 | const_tree, bool); |
c2ed6cf8 NF |
391 | static unsigned int frv_function_arg_boundary (enum machine_mode, |
392 | const_tree); | |
fdbe66f2 EB |
393 | static void frv_output_dwarf_dtprel (FILE *, int, rtx) |
394 | ATTRIBUTE_UNUSED; | |
a87cf97e | 395 | static reg_class_t frv_secondary_reload (bool, rtx, reg_class_t, |
35f2d8ef NC |
396 | enum machine_mode, |
397 | secondary_reload_info *); | |
b52b1749 | 398 | static bool frv_frame_pointer_required (void); |
7b5cbb57 | 399 | static bool frv_can_eliminate (const int, const int); |
5efd84c5 | 400 | static void frv_conditional_register_usage (void); |
e9d5fdb2 | 401 | static void frv_trampoline_init (rtx, tree, rtx); |
c28350ab | 402 | static bool frv_class_likely_spilled_p (reg_class_t); |
0b2c18fe | 403 | \f |
36a05131 | 404 | /* Initialize the GCC target structure. */ |
0fb30cb7 NF |
405 | #undef TARGET_PRINT_OPERAND |
406 | #define TARGET_PRINT_OPERAND frv_print_operand | |
407 | #undef TARGET_PRINT_OPERAND_ADDRESS | |
408 | #define TARGET_PRINT_OPERAND_ADDRESS frv_print_operand_address | |
409 | #undef TARGET_PRINT_OPERAND_PUNCT_VALID_P | |
410 | #define TARGET_PRINT_OPERAND_PUNCT_VALID_P frv_print_operand_punct_valid_p | |
36a05131 BS |
411 | #undef TARGET_ASM_FUNCTION_PROLOGUE |
412 | #define TARGET_ASM_FUNCTION_PROLOGUE frv_function_prologue | |
413 | #undef TARGET_ASM_FUNCTION_EPILOGUE | |
414 | #define TARGET_ASM_FUNCTION_EPILOGUE frv_function_epilogue | |
415 | #undef TARGET_ASM_INTEGER | |
416 | #define TARGET_ASM_INTEGER frv_assemble_integer | |
c5387660 JM |
417 | #undef TARGET_OPTION_OVERRIDE |
418 | #define TARGET_OPTION_OVERRIDE frv_option_override | |
14966b94 KG |
419 | #undef TARGET_INIT_BUILTINS |
420 | #define TARGET_INIT_BUILTINS frv_init_builtins | |
421 | #undef TARGET_EXPAND_BUILTIN | |
422 | #define TARGET_EXPAND_BUILTIN frv_expand_builtin | |
c15c90bb ZW |
423 | #undef TARGET_INIT_LIBFUNCS |
424 | #define TARGET_INIT_LIBFUNCS frv_init_libfuncs | |
b3fbfc07 KG |
425 | #undef TARGET_IN_SMALL_DATA_P |
426 | #define TARGET_IN_SMALL_DATA_P frv_in_small_data_p | |
33124e84 AS |
427 | #undef TARGET_REGISTER_MOVE_COST |
428 | #define TARGET_REGISTER_MOVE_COST frv_register_move_cost | |
429 | #undef TARGET_MEMORY_MOVE_COST | |
430 | #define TARGET_MEMORY_MOVE_COST frv_memory_move_cost | |
3c50106f RH |
431 | #undef TARGET_RTX_COSTS |
432 | #define TARGET_RTX_COSTS frv_rtx_costs | |
90a63880 RH |
433 | #undef TARGET_ASM_CONSTRUCTOR |
434 | #define TARGET_ASM_CONSTRUCTOR frv_asm_out_constructor | |
435 | #undef TARGET_ASM_DESTRUCTOR | |
436 | #define TARGET_ASM_DESTRUCTOR frv_asm_out_destructor | |
36a05131 | 437 | |
c590b625 RH |
438 | #undef TARGET_ASM_OUTPUT_MI_THUNK |
439 | #define TARGET_ASM_OUTPUT_MI_THUNK frv_asm_output_mi_thunk | |
3961e8fe RH |
440 | #undef TARGET_ASM_CAN_OUTPUT_MI_THUNK |
441 | #define TARGET_ASM_CAN_OUTPUT_MI_THUNK default_can_output_mi_thunk_no_vcall | |
c590b625 | 442 | |
28a60850 RS |
443 | #undef TARGET_SCHED_ISSUE_RATE |
444 | #define TARGET_SCHED_ISSUE_RATE frv_issue_rate | |
ffb344c1 | 445 | |
506d7b68 PB |
446 | #undef TARGET_LEGITIMIZE_ADDRESS |
447 | #define TARGET_LEGITIMIZE_ADDRESS frv_legitimize_address | |
448 | ||
764678d1 AO |
449 | #undef TARGET_FUNCTION_OK_FOR_SIBCALL |
450 | #define TARGET_FUNCTION_OK_FOR_SIBCALL frv_function_ok_for_sibcall | |
1a627b35 RS |
451 | #undef TARGET_LEGITIMATE_CONSTANT_P |
452 | #define TARGET_LEGITIMATE_CONSTANT_P frv_legitimate_constant_p | |
34208acf AO |
453 | #undef TARGET_CANNOT_FORCE_CONST_MEM |
454 | #define TARGET_CANNOT_FORCE_CONST_MEM frv_cannot_force_const_mem | |
455 | ||
bef8809e AH |
456 | #undef TARGET_HAVE_TLS |
457 | #define TARGET_HAVE_TLS HAVE_AS_TLS | |
458 | ||
8ac411c7 KH |
459 | #undef TARGET_STRUCT_VALUE_RTX |
460 | #define TARGET_STRUCT_VALUE_RTX frv_struct_value_rtx | |
fe984136 RH |
461 | #undef TARGET_MUST_PASS_IN_STACK |
462 | #define TARGET_MUST_PASS_IN_STACK frv_must_pass_in_stack | |
8cd5a4e0 RH |
463 | #undef TARGET_PASS_BY_REFERENCE |
464 | #define TARGET_PASS_BY_REFERENCE hook_pass_by_reference_must_pass_in_stack | |
78a52f11 RH |
465 | #undef TARGET_ARG_PARTIAL_BYTES |
466 | #define TARGET_ARG_PARTIAL_BYTES frv_arg_partial_bytes | |
88a1f47f NF |
467 | #undef TARGET_FUNCTION_ARG |
468 | #define TARGET_FUNCTION_ARG frv_function_arg | |
469 | #undef TARGET_FUNCTION_INCOMING_ARG | |
470 | #define TARGET_FUNCTION_INCOMING_ARG frv_function_incoming_arg | |
471 | #undef TARGET_FUNCTION_ARG_ADVANCE | |
472 | #define TARGET_FUNCTION_ARG_ADVANCE frv_function_arg_advance | |
c2ed6cf8 NF |
473 | #undef TARGET_FUNCTION_ARG_BOUNDARY |
474 | #define TARGET_FUNCTION_ARG_BOUNDARY frv_function_arg_boundary | |
8ac411c7 KH |
475 | |
476 | #undef TARGET_EXPAND_BUILTIN_SAVEREGS | |
477 | #define TARGET_EXPAND_BUILTIN_SAVEREGS frv_expand_builtin_saveregs | |
d8c2bed3 KH |
478 | #undef TARGET_SETUP_INCOMING_VARARGS |
479 | #define TARGET_SETUP_INCOMING_VARARGS frv_setup_incoming_varargs | |
c557edf4 RS |
480 | #undef TARGET_MACHINE_DEPENDENT_REORG |
481 | #define TARGET_MACHINE_DEPENDENT_REORG frv_reorg | |
8ac411c7 | 482 | |
d7bd8aeb JJ |
483 | #undef TARGET_EXPAND_BUILTIN_VA_START |
484 | #define TARGET_EXPAND_BUILTIN_VA_START frv_expand_builtin_va_start | |
485 | ||
fdbe66f2 EB |
486 | #if HAVE_AS_TLS |
487 | #undef TARGET_ASM_OUTPUT_DWARF_DTPREL | |
488 | #define TARGET_ASM_OUTPUT_DWARF_DTPREL frv_output_dwarf_dtprel | |
489 | #endif | |
490 | ||
c28350ab AS |
491 | #undef TARGET_CLASS_LIKELY_SPILLED_P |
492 | #define TARGET_CLASS_LIKELY_SPILLED_P frv_class_likely_spilled_p | |
493 | ||
35f2d8ef NC |
494 | #undef TARGET_SECONDARY_RELOAD |
495 | #define TARGET_SECONDARY_RELOAD frv_secondary_reload | |
496 | ||
c6c3dba9 PB |
497 | #undef TARGET_LEGITIMATE_ADDRESS_P |
498 | #define TARGET_LEGITIMATE_ADDRESS_P frv_legitimate_address_p | |
499 | ||
b52b1749 AS |
500 | #undef TARGET_FRAME_POINTER_REQUIRED |
501 | #define TARGET_FRAME_POINTER_REQUIRED frv_frame_pointer_required | |
502 | ||
7b5cbb57 AS |
503 | #undef TARGET_CAN_ELIMINATE |
504 | #define TARGET_CAN_ELIMINATE frv_can_eliminate | |
505 | ||
5efd84c5 NF |
506 | #undef TARGET_CONDITIONAL_REGISTER_USAGE |
507 | #define TARGET_CONDITIONAL_REGISTER_USAGE frv_conditional_register_usage | |
508 | ||
e9d5fdb2 RH |
509 | #undef TARGET_TRAMPOLINE_INIT |
510 | #define TARGET_TRAMPOLINE_INIT frv_trampoline_init | |
511 | ||
219d92a4 AS |
512 | #undef TARGET_FUNCTION_VALUE |
513 | #define TARGET_FUNCTION_VALUE frv_function_value | |
514 | #undef TARGET_LIBCALL_VALUE | |
515 | #define TARGET_LIBCALL_VALUE frv_libcall_value | |
516 | ||
36a05131 | 517 | struct gcc_target targetm = TARGET_INITIALIZER; |
bef8809e AH |
518 | |
519 | #define FRV_SYMBOL_REF_TLS_P(RTX) \ | |
520 | (GET_CODE (RTX) == SYMBOL_REF && SYMBOL_REF_TLS_MODEL (RTX) != 0) | |
521 | ||
36a05131 | 522 | \f |
764678d1 AO |
523 | /* Any function call that satisfies the machine-independent |
524 | requirements is eligible on FR-V. */ | |
525 | ||
526 | static bool | |
527 | frv_function_ok_for_sibcall (tree decl ATTRIBUTE_UNUSED, | |
528 | tree exp ATTRIBUTE_UNUSED) | |
529 | { | |
530 | return true; | |
531 | } | |
532 | ||
34208acf AO |
533 | /* Return true if SYMBOL is a small data symbol and relocation RELOC |
534 | can be used to access it directly in a load or store. */ | |
36a05131 | 535 | |
34208acf AO |
536 | static FRV_INLINE bool |
537 | frv_small_data_reloc_p (rtx symbol, int reloc) | |
36a05131 | 538 | { |
34208acf AO |
539 | return (GET_CODE (symbol) == SYMBOL_REF |
540 | && SYMBOL_REF_SMALL_P (symbol) | |
541 | && (!TARGET_FDPIC || flag_pic == 1) | |
542 | && (reloc == R_FRV_GOTOFF12 || reloc == R_FRV_GPREL12)); | |
543 | } | |
36a05131 | 544 | |
34208acf AO |
545 | /* Return true if X is a valid relocation unspec. If it is, fill in UNSPEC |
546 | appropriately. */ | |
36a05131 | 547 | |
6d26dc3b | 548 | bool |
34208acf AO |
549 | frv_const_unspec_p (rtx x, struct frv_unspec *unspec) |
550 | { | |
551 | if (GET_CODE (x) == CONST) | |
552 | { | |
553 | unspec->offset = 0; | |
554 | x = XEXP (x, 0); | |
555 | if (GET_CODE (x) == PLUS && GET_CODE (XEXP (x, 1)) == CONST_INT) | |
556 | { | |
557 | unspec->offset += INTVAL (XEXP (x, 1)); | |
558 | x = XEXP (x, 0); | |
559 | } | |
560 | if (GET_CODE (x) == UNSPEC && XINT (x, 1) == UNSPEC_GOT) | |
561 | { | |
562 | unspec->symbol = XVECEXP (x, 0, 0); | |
563 | unspec->reloc = INTVAL (XVECEXP (x, 0, 1)); | |
36a05131 | 564 | |
34208acf AO |
565 | if (unspec->offset == 0) |
566 | return true; | |
36a05131 | 567 | |
34208acf AO |
568 | if (frv_small_data_reloc_p (unspec->symbol, unspec->reloc) |
569 | && unspec->offset > 0 | |
fa37ed29 | 570 | && unspec->offset < g_switch_value) |
34208acf AO |
571 | return true; |
572 | } | |
573 | } | |
574 | return false; | |
36a05131 BS |
575 | } |
576 | ||
34208acf AO |
577 | /* Decide whether we can force certain constants to memory. If we |
578 | decide we can't, the caller should be able to cope with it in | |
579 | another way. | |
36a05131 | 580 | |
34208acf AO |
581 | We never allow constants to be forced into memory for TARGET_FDPIC. |
582 | This is necessary for several reasons: | |
36a05131 | 583 | |
1a627b35 | 584 | 1. Since frv_legitimate_constant_p rejects constant pool addresses, the |
34208acf AO |
585 | target-independent code will try to force them into the constant |
586 | pool, thus leading to infinite recursion. | |
36a05131 | 587 | |
34208acf AO |
588 | 2. We can never introduce new constant pool references during reload. |
589 | Any such reference would require use of the pseudo FDPIC register. | |
36a05131 | 590 | |
34208acf AO |
591 | 3. We can't represent a constant added to a function pointer (which is |
592 | not the same as a pointer to a function+constant). | |
593 | ||
594 | 4. In many cases, it's more efficient to calculate the constant in-line. */ | |
595 | ||
596 | static bool | |
fbbf66e7 RS |
597 | frv_cannot_force_const_mem (enum machine_mode mode ATTRIBUTE_UNUSED, |
598 | rtx x ATTRIBUTE_UNUSED) | |
34208acf AO |
599 | { |
600 | return TARGET_FDPIC; | |
601 | } | |
36a05131 BS |
602 | \f |
603 | static int | |
f2206911 | 604 | frv_default_flags_for_cpu (void) |
36a05131 BS |
605 | { |
606 | switch (frv_cpu_type) | |
607 | { | |
608 | case FRV_CPU_GENERIC: | |
609 | return MASK_DEFAULT_FRV; | |
610 | ||
c557edf4 RS |
611 | case FRV_CPU_FR550: |
612 | return MASK_DEFAULT_FR550; | |
613 | ||
36a05131 BS |
614 | case FRV_CPU_FR500: |
615 | case FRV_CPU_TOMCAT: | |
616 | return MASK_DEFAULT_FR500; | |
617 | ||
c557edf4 RS |
618 | case FRV_CPU_FR450: |
619 | return MASK_DEFAULT_FR450; | |
620 | ||
621 | case FRV_CPU_FR405: | |
36a05131 BS |
622 | case FRV_CPU_FR400: |
623 | return MASK_DEFAULT_FR400; | |
624 | ||
625 | case FRV_CPU_FR300: | |
626 | case FRV_CPU_SIMPLE: | |
627 | return MASK_DEFAULT_SIMPLE; | |
44e91694 NS |
628 | |
629 | default: | |
630 | gcc_unreachable (); | |
36a05131 | 631 | } |
36a05131 BS |
632 | } |
633 | ||
c5387660 | 634 | /* Implement TARGET_OPTION_OVERRIDE. */ |
36a05131 | 635 | |
c5387660 JM |
636 | static void |
637 | frv_option_override (void) | |
36a05131 | 638 | { |
c557edf4 RS |
639 | int regno; |
640 | unsigned int i; | |
36a05131 | 641 | |
36a05131 BS |
642 | target_flags |= (frv_default_flags_for_cpu () & ~target_flags_explicit); |
643 | ||
644 | /* -mlibrary-pic sets -fPIC and -G0 and also suppresses warnings from the | |
645 | linker about linking pic and non-pic code. */ | |
646 | if (TARGET_LIBPIC) | |
647 | { | |
648 | if (!flag_pic) /* -fPIC */ | |
649 | flag_pic = 2; | |
650 | ||
fa37ed29 | 651 | if (!global_options_set.x_g_switch_value) /* -G0 */ |
36a05131 | 652 | { |
36a05131 BS |
653 | g_switch_value = 0; |
654 | } | |
655 | } | |
656 | ||
36a05131 BS |
657 | /* A C expression whose value is a register class containing hard |
658 | register REGNO. In general there is more than one such class; | |
659 | choose a class which is "minimal", meaning that no smaller class | |
87b483a1 | 660 | also contains the register. */ |
36a05131 BS |
661 | |
662 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
663 | { | |
0a2aaacc | 664 | enum reg_class rclass; |
36a05131 BS |
665 | |
666 | if (GPR_P (regno)) | |
667 | { | |
668 | int gpr_reg = regno - GPR_FIRST; | |
bef8809e AH |
669 | |
670 | if (gpr_reg == GR8_REG) | |
0a2aaacc | 671 | rclass = GR8_REGS; |
bef8809e AH |
672 | |
673 | else if (gpr_reg == GR9_REG) | |
0a2aaacc | 674 | rclass = GR9_REGS; |
bef8809e AH |
675 | |
676 | else if (gpr_reg == GR14_REG) | |
0a2aaacc | 677 | rclass = FDPIC_FPTR_REGS; |
bef8809e AH |
678 | |
679 | else if (gpr_reg == FDPIC_REGNO) | |
0a2aaacc | 680 | rclass = FDPIC_REGS; |
bef8809e AH |
681 | |
682 | else if ((gpr_reg & 3) == 0) | |
0a2aaacc | 683 | rclass = QUAD_REGS; |
36a05131 BS |
684 | |
685 | else if ((gpr_reg & 1) == 0) | |
0a2aaacc | 686 | rclass = EVEN_REGS; |
36a05131 BS |
687 | |
688 | else | |
0a2aaacc | 689 | rclass = GPR_REGS; |
36a05131 BS |
690 | } |
691 | ||
692 | else if (FPR_P (regno)) | |
693 | { | |
694 | int fpr_reg = regno - GPR_FIRST; | |
695 | if ((fpr_reg & 3) == 0) | |
0a2aaacc | 696 | rclass = QUAD_FPR_REGS; |
36a05131 BS |
697 | |
698 | else if ((fpr_reg & 1) == 0) | |
0a2aaacc | 699 | rclass = FEVEN_REGS; |
36a05131 BS |
700 | |
701 | else | |
0a2aaacc | 702 | rclass = FPR_REGS; |
36a05131 BS |
703 | } |
704 | ||
705 | else if (regno == LR_REGNO) | |
0a2aaacc | 706 | rclass = LR_REG; |
36a05131 BS |
707 | |
708 | else if (regno == LCR_REGNO) | |
0a2aaacc | 709 | rclass = LCR_REG; |
36a05131 BS |
710 | |
711 | else if (ICC_P (regno)) | |
0a2aaacc | 712 | rclass = ICC_REGS; |
36a05131 BS |
713 | |
714 | else if (FCC_P (regno)) | |
0a2aaacc | 715 | rclass = FCC_REGS; |
36a05131 BS |
716 | |
717 | else if (ICR_P (regno)) | |
0a2aaacc | 718 | rclass = ICR_REGS; |
36a05131 BS |
719 | |
720 | else if (FCR_P (regno)) | |
0a2aaacc | 721 | rclass = FCR_REGS; |
36a05131 BS |
722 | |
723 | else if (ACC_P (regno)) | |
724 | { | |
725 | int r = regno - ACC_FIRST; | |
726 | if ((r & 3) == 0) | |
0a2aaacc | 727 | rclass = QUAD_ACC_REGS; |
36a05131 | 728 | else if ((r & 1) == 0) |
0a2aaacc | 729 | rclass = EVEN_ACC_REGS; |
36a05131 | 730 | else |
0a2aaacc | 731 | rclass = ACC_REGS; |
36a05131 BS |
732 | } |
733 | ||
734 | else if (ACCG_P (regno)) | |
0a2aaacc | 735 | rclass = ACCG_REGS; |
36a05131 BS |
736 | |
737 | else | |
0a2aaacc | 738 | rclass = NO_REGS; |
36a05131 | 739 | |
0a2aaacc | 740 | regno_reg_class[regno] = rclass; |
36a05131 BS |
741 | } |
742 | ||
743 | /* Check for small data option */ | |
fa37ed29 | 744 | if (!global_options_set.x_g_switch_value && !TARGET_LIBPIC) |
36a05131 BS |
745 | g_switch_value = SDATA_DEFAULT_SIZE; |
746 | ||
36a05131 BS |
747 | /* There is no single unaligned SI op for PIC code. Sometimes we |
748 | need to use ".4byte" and sometimes we need to use ".picptr". | |
749 | See frv_assemble_integer for details. */ | |
34208acf | 750 | if (flag_pic || TARGET_FDPIC) |
36a05131 BS |
751 | targetm.asm_out.unaligned_op.si = 0; |
752 | ||
34208acf AO |
753 | if ((target_flags_explicit & MASK_LINKED_FP) == 0) |
754 | target_flags |= MASK_LINKED_FP; | |
755 | ||
38c28a25 AH |
756 | if ((target_flags_explicit & MASK_OPTIMIZE_MEMBAR) == 0) |
757 | target_flags |= MASK_OPTIMIZE_MEMBAR; | |
758 | ||
c557edf4 RS |
759 | for (i = 0; i < ARRAY_SIZE (frv_unit_names); i++) |
760 | frv_unit_codes[i] = get_cpu_unit_code (frv_unit_names[i]); | |
761 | ||
762 | for (i = 0; i < ARRAY_SIZE (frv_type_to_unit); i++) | |
763 | frv_type_to_unit[i] = ARRAY_SIZE (frv_unit_codes); | |
764 | ||
36a05131 BS |
765 | init_machine_status = frv_init_machine_status; |
766 | } | |
767 | ||
36a05131 BS |
768 | \f |
769 | /* Return true if NAME (a STRING_CST node) begins with PREFIX. */ | |
770 | ||
771 | static int | |
3101faab | 772 | frv_string_begins_with (const_tree name, const char *prefix) |
36a05131 | 773 | { |
3101faab | 774 | const int prefix_len = strlen (prefix); |
36a05131 BS |
775 | |
776 | /* Remember: NAME's length includes the null terminator. */ | |
777 | return (TREE_STRING_LENGTH (name) > prefix_len | |
778 | && strncmp (TREE_STRING_POINTER (name), prefix, prefix_len) == 0); | |
779 | } | |
36a05131 BS |
780 | \f |
781 | /* Zero or more C statements that may conditionally modify two variables | |
782 | `fixed_regs' and `call_used_regs' (both of type `char []') after they have | |
783 | been initialized from the two preceding macros. | |
784 | ||
785 | This is necessary in case the fixed or call-clobbered registers depend on | |
786 | target flags. | |
787 | ||
788 | You need not define this macro if it has no work to do. | |
789 | ||
790 | If the usage of an entire class of registers depends on the target flags, | |
791 | you may indicate this to GCC by using this macro to modify `fixed_regs' and | |
792 | `call_used_regs' to 1 for each of the registers in the classes which should | |
793 | not be used by GCC. Also define the macro `REG_CLASS_FROM_LETTER' to return | |
794 | `NO_REGS' if it is called with a letter for a class that shouldn't be used. | |
795 | ||
796 | (However, if this class is not included in `GENERAL_REGS' and all of the | |
797 | insn patterns whose constraints permit this class are controlled by target | |
798 | switches, then GCC will automatically avoid using these registers when the | |
799 | target switches are opposed to them.) */ | |
800 | ||
5efd84c5 | 801 | static void |
f2206911 | 802 | frv_conditional_register_usage (void) |
36a05131 BS |
803 | { |
804 | int i; | |
805 | ||
806 | for (i = GPR_FIRST + NUM_GPRS; i <= GPR_LAST; i++) | |
807 | fixed_regs[i] = call_used_regs[i] = 1; | |
808 | ||
809 | for (i = FPR_FIRST + NUM_FPRS; i <= FPR_LAST; i++) | |
810 | fixed_regs[i] = call_used_regs[i] = 1; | |
811 | ||
36a05131 BS |
812 | /* Reserve the registers used for conditional execution. At present, we need |
813 | 1 ICC and 1 ICR register. */ | |
814 | fixed_regs[ICC_TEMP] = call_used_regs[ICC_TEMP] = 1; | |
815 | fixed_regs[ICR_TEMP] = call_used_regs[ICR_TEMP] = 1; | |
816 | ||
817 | if (TARGET_FIXED_CC) | |
818 | { | |
819 | fixed_regs[ICC_FIRST] = call_used_regs[ICC_FIRST] = 1; | |
820 | fixed_regs[FCC_FIRST] = call_used_regs[FCC_FIRST] = 1; | |
821 | fixed_regs[ICR_FIRST] = call_used_regs[ICR_FIRST] = 1; | |
822 | fixed_regs[FCR_FIRST] = call_used_regs[FCR_FIRST] = 1; | |
823 | } | |
824 | ||
34208acf AO |
825 | if (TARGET_FDPIC) |
826 | fixed_regs[GPR_FIRST + 16] = fixed_regs[GPR_FIRST + 17] = | |
827 | call_used_regs[GPR_FIRST + 16] = call_used_regs[GPR_FIRST + 17] = 0; | |
828 | ||
36a05131 BS |
829 | #if 0 |
830 | /* If -fpic, SDA_BASE_REG is the PIC register. */ | |
831 | if (g_switch_value == 0 && !flag_pic) | |
832 | fixed_regs[SDA_BASE_REG] = call_used_regs[SDA_BASE_REG] = 0; | |
833 | ||
834 | if (!flag_pic) | |
835 | fixed_regs[PIC_REGNO] = call_used_regs[PIC_REGNO] = 0; | |
836 | #endif | |
837 | } | |
838 | ||
839 | \f | |
840 | /* | |
841 | * Compute the stack frame layout | |
842 | * | |
843 | * Register setup: | |
844 | * +---------------+-----------------------+-----------------------+ | |
845 | * |Register |type |caller-save/callee-save| | |
846 | * +---------------+-----------------------+-----------------------+ | |
847 | * |GR0 |Zero register | - | | |
848 | * |GR1 |Stack pointer(SP) | - | | |
849 | * |GR2 |Frame pointer(FP) | - | | |
850 | * |GR3 |Hidden parameter | caller save | | |
851 | * |GR4-GR7 | - | caller save | | |
852 | * |GR8-GR13 |Argument register | caller save | | |
853 | * |GR14-GR15 | - | caller save | | |
854 | * |GR16-GR31 | - | callee save | | |
855 | * |GR32-GR47 | - | caller save | | |
856 | * |GR48-GR63 | - | callee save | | |
857 | * |FR0-FR15 | - | caller save | | |
858 | * |FR16-FR31 | - | callee save | | |
859 | * |FR32-FR47 | - | caller save | | |
860 | * |FR48-FR63 | - | callee save | | |
861 | * +---------------+-----------------------+-----------------------+ | |
862 | * | |
863 | * Stack frame setup: | |
864 | * Low | |
865 | * SP-> |-----------------------------------| | |
866 | * | Argument area | | |
867 | * |-----------------------------------| | |
868 | * | Register save area | | |
869 | * |-----------------------------------| | |
870 | * | Local variable save area | | |
871 | * FP-> |-----------------------------------| | |
872 | * | Old FP | | |
873 | * |-----------------------------------| | |
874 | * | Hidden parameter save area | | |
875 | * |-----------------------------------| | |
876 | * | Return address(LR) storage area | | |
877 | * |-----------------------------------| | |
878 | * | Padding for alignment | | |
879 | * |-----------------------------------| | |
880 | * | Register argument area | | |
881 | * OLD SP-> |-----------------------------------| | |
882 | * | Parameter area | | |
883 | * |-----------------------------------| | |
884 | * High | |
885 | * | |
886 | * Argument area/Parameter area: | |
887 | * | |
888 | * When a function is called, this area is used for argument transfer. When | |
889 | * the argument is set up by the caller function, this area is referred to as | |
890 | * the argument area. When the argument is referenced by the callee function, | |
891 | * this area is referred to as the parameter area. The area is allocated when | |
892 | * all arguments cannot be placed on the argument register at the time of | |
893 | * argument transfer. | |
894 | * | |
895 | * Register save area: | |
896 | * | |
897 | * This is a register save area that must be guaranteed for the caller | |
898 | * function. This area is not secured when the register save operation is not | |
899 | * needed. | |
900 | * | |
901 | * Local variable save area: | |
902 | * | |
903 | * This is the area for local variables and temporary variables. | |
904 | * | |
905 | * Old FP: | |
906 | * | |
907 | * This area stores the FP value of the caller function. | |
908 | * | |
909 | * Hidden parameter save area: | |
910 | * | |
911 | * This area stores the start address of the return value storage | |
912 | * area for a struct/union return function. | |
913 | * When a struct/union is used as the return value, the caller | |
914 | * function stores the return value storage area start address in | |
915 | * register GR3 and passes it to the caller function. | |
916 | * The callee function interprets the address stored in the GR3 | |
917 | * as the return value storage area start address. | |
918 | * When register GR3 needs to be saved into memory, the callee | |
919 | * function saves it in the hidden parameter save area. This | |
920 | * area is not secured when the save operation is not needed. | |
921 | * | |
922 | * Return address(LR) storage area: | |
923 | * | |
924 | * This area saves the LR. The LR stores the address of a return to the caller | |
925 | * function for the purpose of function calling. | |
926 | * | |
927 | * Argument register area: | |
928 | * | |
929 | * This area saves the argument register. This area is not secured when the | |
930 | * save operation is not needed. | |
931 | * | |
932 | * Argument: | |
933 | * | |
934 | * Arguments, the count of which equals the count of argument registers (6 | |
935 | * words), are positioned in registers GR8 to GR13 and delivered to the callee | |
936 | * function. When a struct/union return function is called, the return value | |
937 | * area address is stored in register GR3. Arguments not placed in the | |
938 | * argument registers will be stored in the stack argument area for transfer | |
939 | * purposes. When an 8-byte type argument is to be delivered using registers, | |
940 | * it is divided into two and placed in two registers for transfer. When | |
941 | * argument registers must be saved to memory, the callee function secures an | |
942 | * argument register save area in the stack. In this case, a continuous | |
943 | * argument register save area must be established in the parameter area. The | |
944 | * argument register save area must be allocated as needed to cover the size of | |
945 | * the argument register to be saved. If the function has a variable count of | |
946 | * arguments, it saves all argument registers in the argument register save | |
947 | * area. | |
948 | * | |
949 | * Argument Extension Format: | |
950 | * | |
951 | * When an argument is to be stored in the stack, its type is converted to an | |
952 | * extended type in accordance with the individual argument type. The argument | |
953 | * is freed by the caller function after the return from the callee function is | |
954 | * made. | |
955 | * | |
956 | * +-----------------------+---------------+------------------------+ | |
957 | * | Argument Type |Extended Type |Stack Storage Size(byte)| | |
958 | * +-----------------------+---------------+------------------------+ | |
959 | * |char |int | 4 | | |
960 | * |signed char |int | 4 | | |
961 | * |unsigned char |int | 4 | | |
962 | * |[signed] short int |int | 4 | | |
963 | * |unsigned short int |int | 4 | | |
964 | * |[signed] int |No extension | 4 | | |
965 | * |unsigned int |No extension | 4 | | |
966 | * |[signed] long int |No extension | 4 | | |
967 | * |unsigned long int |No extension | 4 | | |
968 | * |[signed] long long int |No extension | 8 | | |
969 | * |unsigned long long int |No extension | 8 | | |
970 | * |float |double | 8 | | |
971 | * |double |No extension | 8 | | |
972 | * |long double |No extension | 8 | | |
973 | * |pointer |No extension | 4 | | |
974 | * |struct/union |- | 4 (*1) | | |
975 | * +-----------------------+---------------+------------------------+ | |
976 | * | |
977 | * When a struct/union is to be delivered as an argument, the caller copies it | |
978 | * to the local variable area and delivers the address of that area. | |
979 | * | |
980 | * Return Value: | |
981 | * | |
982 | * +-------------------------------+----------------------+ | |
983 | * |Return Value Type |Return Value Interface| | |
984 | * +-------------------------------+----------------------+ | |
985 | * |void |None | | |
986 | * |[signed|unsigned] char |GR8 | | |
987 | * |[signed|unsigned] short int |GR8 | | |
988 | * |[signed|unsigned] int |GR8 | | |
989 | * |[signed|unsigned] long int |GR8 | | |
990 | * |pointer |GR8 | | |
991 | * |[signed|unsigned] long long int|GR8 & GR9 | | |
992 | * |float |GR8 | | |
993 | * |double |GR8 & GR9 | | |
994 | * |long double |GR8 & GR9 | | |
995 | * |struct/union |(*1) | | |
996 | * +-------------------------------+----------------------+ | |
997 | * | |
998 | * When a struct/union is used as the return value, the caller function stores | |
999 | * the start address of the return value storage area into GR3 and then passes | |
1000 | * it to the callee function. The callee function interprets GR3 as the start | |
1001 | * address of the return value storage area. When this address needs to be | |
1002 | * saved in memory, the callee function secures the hidden parameter save area | |
1003 | * and saves the address in that area. | |
1004 | */ | |
1005 | ||
1006 | frv_stack_t * | |
f2206911 | 1007 | frv_stack_info (void) |
36a05131 BS |
1008 | { |
1009 | static frv_stack_t info, zero_info; | |
1010 | frv_stack_t *info_ptr = &info; | |
1011 | tree fndecl = current_function_decl; | |
1012 | int varargs_p = 0; | |
1013 | tree cur_arg; | |
1014 | tree next_arg; | |
1015 | int range; | |
1016 | int alignment; | |
1017 | int offset; | |
1018 | ||
87b483a1 KH |
1019 | /* If we've already calculated the values and reload is complete, |
1020 | just return now. */ | |
36a05131 BS |
1021 | if (frv_stack_cache) |
1022 | return frv_stack_cache; | |
1023 | ||
87b483a1 | 1024 | /* Zero all fields. */ |
36a05131 BS |
1025 | info = zero_info; |
1026 | ||
87b483a1 | 1027 | /* Set up the register range information. */ |
36a05131 BS |
1028 | info_ptr->regs[STACK_REGS_GPR].name = "gpr"; |
1029 | info_ptr->regs[STACK_REGS_GPR].first = LAST_ARG_REGNUM + 1; | |
1030 | info_ptr->regs[STACK_REGS_GPR].last = GPR_LAST; | |
1031 | info_ptr->regs[STACK_REGS_GPR].dword_p = TRUE; | |
1032 | ||
1033 | info_ptr->regs[STACK_REGS_FPR].name = "fpr"; | |
1034 | info_ptr->regs[STACK_REGS_FPR].first = FPR_FIRST; | |
1035 | info_ptr->regs[STACK_REGS_FPR].last = FPR_LAST; | |
1036 | info_ptr->regs[STACK_REGS_FPR].dword_p = TRUE; | |
1037 | ||
1038 | info_ptr->regs[STACK_REGS_LR].name = "lr"; | |
1039 | info_ptr->regs[STACK_REGS_LR].first = LR_REGNO; | |
1040 | info_ptr->regs[STACK_REGS_LR].last = LR_REGNO; | |
1041 | info_ptr->regs[STACK_REGS_LR].special_p = 1; | |
1042 | ||
1043 | info_ptr->regs[STACK_REGS_CC].name = "cc"; | |
1044 | info_ptr->regs[STACK_REGS_CC].first = CC_FIRST; | |
1045 | info_ptr->regs[STACK_REGS_CC].last = CC_LAST; | |
1046 | info_ptr->regs[STACK_REGS_CC].field_p = TRUE; | |
1047 | ||
1048 | info_ptr->regs[STACK_REGS_LCR].name = "lcr"; | |
1049 | info_ptr->regs[STACK_REGS_LCR].first = LCR_REGNO; | |
1050 | info_ptr->regs[STACK_REGS_LCR].last = LCR_REGNO; | |
1051 | ||
1052 | info_ptr->regs[STACK_REGS_STDARG].name = "stdarg"; | |
1053 | info_ptr->regs[STACK_REGS_STDARG].first = FIRST_ARG_REGNUM; | |
1054 | info_ptr->regs[STACK_REGS_STDARG].last = LAST_ARG_REGNUM; | |
1055 | info_ptr->regs[STACK_REGS_STDARG].dword_p = 1; | |
1056 | info_ptr->regs[STACK_REGS_STDARG].special_p = 1; | |
1057 | ||
1058 | info_ptr->regs[STACK_REGS_STRUCT].name = "struct"; | |
8ac411c7 KH |
1059 | info_ptr->regs[STACK_REGS_STRUCT].first = FRV_STRUCT_VALUE_REGNUM; |
1060 | info_ptr->regs[STACK_REGS_STRUCT].last = FRV_STRUCT_VALUE_REGNUM; | |
36a05131 BS |
1061 | info_ptr->regs[STACK_REGS_STRUCT].special_p = 1; |
1062 | ||
1063 | info_ptr->regs[STACK_REGS_FP].name = "fp"; | |
1064 | info_ptr->regs[STACK_REGS_FP].first = FRAME_POINTER_REGNUM; | |
1065 | info_ptr->regs[STACK_REGS_FP].last = FRAME_POINTER_REGNUM; | |
1066 | info_ptr->regs[STACK_REGS_FP].special_p = 1; | |
1067 | ||
1068 | /* Determine if this is a stdarg function. If so, allocate space to store | |
1069 | the 6 arguments. */ | |
1070 | if (cfun->stdarg) | |
1071 | varargs_p = 1; | |
1072 | ||
1073 | else | |
1074 | { | |
1075 | /* Find the last argument, and see if it is __builtin_va_alist. */ | |
1076 | for (cur_arg = DECL_ARGUMENTS (fndecl); cur_arg != (tree)0; cur_arg = next_arg) | |
1077 | { | |
910ad8de | 1078 | next_arg = DECL_CHAIN (cur_arg); |
36a05131 BS |
1079 | if (next_arg == (tree)0) |
1080 | { | |
1081 | if (DECL_NAME (cur_arg) | |
1082 | && !strcmp (IDENTIFIER_POINTER (DECL_NAME (cur_arg)), "__builtin_va_alist")) | |
1083 | varargs_p = 1; | |
1084 | ||
1085 | break; | |
1086 | } | |
1087 | } | |
1088 | } | |
1089 | ||
87b483a1 | 1090 | /* Iterate over all of the register ranges. */ |
36a05131 BS |
1091 | for (range = 0; range < STACK_REGS_MAX; range++) |
1092 | { | |
1093 | frv_stack_regs_t *reg_ptr = &(info_ptr->regs[range]); | |
1094 | int first = reg_ptr->first; | |
1095 | int last = reg_ptr->last; | |
1096 | int size_1word = 0; | |
1097 | int size_2words = 0; | |
1098 | int regno; | |
1099 | ||
87b483a1 | 1100 | /* Calculate which registers need to be saved & save area size. */ |
36a05131 BS |
1101 | switch (range) |
1102 | { | |
1103 | default: | |
1104 | for (regno = first; regno <= last; regno++) | |
1105 | { | |
6fb5fa3c | 1106 | if ((df_regs_ever_live_p (regno) && !call_used_regs[regno]) |
e3b5732b | 1107 | || (crtl->calls_eh_return |
36a05131 | 1108 | && (regno >= FIRST_EH_REGNUM && regno <= LAST_EH_REGNUM)) |
34208acf | 1109 | || (!TARGET_FDPIC && flag_pic |
ad516a74 | 1110 | && crtl->uses_pic_offset_table && regno == PIC_REGNO)) |
36a05131 BS |
1111 | { |
1112 | info_ptr->save_p[regno] = REG_SAVE_1WORD; | |
1113 | size_1word += UNITS_PER_WORD; | |
1114 | } | |
1115 | } | |
1116 | break; | |
1117 | ||
1118 | /* Calculate whether we need to create a frame after everything else | |
1119 | has been processed. */ | |
1120 | case STACK_REGS_FP: | |
1121 | break; | |
1122 | ||
1123 | case STACK_REGS_LR: | |
6fb5fa3c | 1124 | if (df_regs_ever_live_p (LR_REGNO) |
36a05131 | 1125 | || profile_flag |
34208acf AO |
1126 | /* This is set for __builtin_return_address, etc. */ |
1127 | || cfun->machine->frame_needed | |
1128 | || (TARGET_LINKED_FP && frame_pointer_needed) | |
1129 | || (!TARGET_FDPIC && flag_pic | |
ad516a74 | 1130 | && crtl->uses_pic_offset_table)) |
36a05131 BS |
1131 | { |
1132 | info_ptr->save_p[LR_REGNO] = REG_SAVE_1WORD; | |
1133 | size_1word += UNITS_PER_WORD; | |
1134 | } | |
1135 | break; | |
1136 | ||
1137 | case STACK_REGS_STDARG: | |
1138 | if (varargs_p) | |
1139 | { | |
87b483a1 KH |
1140 | /* If this is a stdarg function with a non varardic |
1141 | argument split between registers and the stack, | |
1142 | adjust the saved registers downward. */ | |
7dd68986 | 1143 | last -= (ADDR_ALIGN (crtl->args.pretend_args_size, UNITS_PER_WORD) |
36a05131 BS |
1144 | / UNITS_PER_WORD); |
1145 | ||
1146 | for (regno = first; regno <= last; regno++) | |
1147 | { | |
1148 | info_ptr->save_p[regno] = REG_SAVE_1WORD; | |
1149 | size_1word += UNITS_PER_WORD; | |
1150 | } | |
1151 | ||
1152 | info_ptr->stdarg_size = size_1word; | |
1153 | } | |
1154 | break; | |
1155 | ||
1156 | case STACK_REGS_STRUCT: | |
1157 | if (cfun->returns_struct) | |
1158 | { | |
8ac411c7 | 1159 | info_ptr->save_p[FRV_STRUCT_VALUE_REGNUM] = REG_SAVE_1WORD; |
36a05131 BS |
1160 | size_1word += UNITS_PER_WORD; |
1161 | } | |
1162 | break; | |
1163 | } | |
1164 | ||
1165 | ||
1166 | if (size_1word) | |
1167 | { | |
87b483a1 | 1168 | /* If this is a field, it only takes one word. */ |
36a05131 BS |
1169 | if (reg_ptr->field_p) |
1170 | size_1word = UNITS_PER_WORD; | |
1171 | ||
87b483a1 | 1172 | /* Determine which register pairs can be saved together. */ |
36a05131 BS |
1173 | else if (reg_ptr->dword_p && TARGET_DWORD) |
1174 | { | |
1175 | for (regno = first; regno < last; regno += 2) | |
1176 | { | |
1177 | if (info_ptr->save_p[regno] && info_ptr->save_p[regno+1]) | |
1178 | { | |
1179 | size_2words += 2 * UNITS_PER_WORD; | |
1180 | size_1word -= 2 * UNITS_PER_WORD; | |
1181 | info_ptr->save_p[regno] = REG_SAVE_2WORDS; | |
1182 | info_ptr->save_p[regno+1] = REG_SAVE_NO_SAVE; | |
1183 | } | |
1184 | } | |
1185 | } | |
1186 | ||
1187 | reg_ptr->size_1word = size_1word; | |
1188 | reg_ptr->size_2words = size_2words; | |
1189 | ||
1190 | if (! reg_ptr->special_p) | |
1191 | { | |
1192 | info_ptr->regs_size_1word += size_1word; | |
1193 | info_ptr->regs_size_2words += size_2words; | |
1194 | } | |
1195 | } | |
1196 | } | |
1197 | ||
1198 | /* Set up the sizes of each each field in the frame body, making the sizes | |
1199 | of each be divisible by the size of a dword if dword operations might | |
1200 | be used, or the size of a word otherwise. */ | |
1201 | alignment = (TARGET_DWORD? 2 * UNITS_PER_WORD : UNITS_PER_WORD); | |
1202 | ||
7dd68986 | 1203 | info_ptr->parameter_size = ADDR_ALIGN (crtl->outgoing_args_size, alignment); |
36a05131 BS |
1204 | info_ptr->regs_size = ADDR_ALIGN (info_ptr->regs_size_2words |
1205 | + info_ptr->regs_size_1word, | |
1206 | alignment); | |
1207 | info_ptr->vars_size = ADDR_ALIGN (get_frame_size (), alignment); | |
1208 | ||
7dd68986 | 1209 | info_ptr->pretend_size = crtl->args.pretend_args_size; |
36a05131 BS |
1210 | |
1211 | /* Work out the size of the frame, excluding the header. Both the frame | |
1212 | body and register parameter area will be dword-aligned. */ | |
1213 | info_ptr->total_size | |
1214 | = (ADDR_ALIGN (info_ptr->parameter_size | |
1215 | + info_ptr->regs_size | |
1216 | + info_ptr->vars_size, | |
1217 | 2 * UNITS_PER_WORD) | |
1218 | + ADDR_ALIGN (info_ptr->pretend_size | |
1219 | + info_ptr->stdarg_size, | |
1220 | 2 * UNITS_PER_WORD)); | |
1221 | ||
1222 | /* See if we need to create a frame at all, if so add header area. */ | |
1223 | if (info_ptr->total_size > 0 | |
34208acf | 1224 | || frame_pointer_needed |
36a05131 BS |
1225 | || info_ptr->regs[STACK_REGS_LR].size_1word > 0 |
1226 | || info_ptr->regs[STACK_REGS_STRUCT].size_1word > 0) | |
1227 | { | |
1228 | offset = info_ptr->parameter_size; | |
1229 | info_ptr->header_size = 4 * UNITS_PER_WORD; | |
1230 | info_ptr->total_size += 4 * UNITS_PER_WORD; | |
1231 | ||
87b483a1 | 1232 | /* Calculate the offsets to save normal register pairs. */ |
36a05131 BS |
1233 | for (range = 0; range < STACK_REGS_MAX; range++) |
1234 | { | |
1235 | frv_stack_regs_t *reg_ptr = &(info_ptr->regs[range]); | |
1236 | if (! reg_ptr->special_p) | |
1237 | { | |
1238 | int first = reg_ptr->first; | |
1239 | int last = reg_ptr->last; | |
1240 | int regno; | |
1241 | ||
1242 | for (regno = first; regno <= last; regno++) | |
1243 | if (info_ptr->save_p[regno] == REG_SAVE_2WORDS | |
1244 | && regno != FRAME_POINTER_REGNUM | |
1245 | && (regno < FIRST_ARG_REGNUM | |
1246 | || regno > LAST_ARG_REGNUM)) | |
1247 | { | |
1248 | info_ptr->reg_offset[regno] = offset; | |
1249 | offset += 2 * UNITS_PER_WORD; | |
1250 | } | |
1251 | } | |
1252 | } | |
1253 | ||
87b483a1 | 1254 | /* Calculate the offsets to save normal single registers. */ |
36a05131 BS |
1255 | for (range = 0; range < STACK_REGS_MAX; range++) |
1256 | { | |
1257 | frv_stack_regs_t *reg_ptr = &(info_ptr->regs[range]); | |
1258 | if (! reg_ptr->special_p) | |
1259 | { | |
1260 | int first = reg_ptr->first; | |
1261 | int last = reg_ptr->last; | |
1262 | int regno; | |
1263 | ||
1264 | for (regno = first; regno <= last; regno++) | |
1265 | if (info_ptr->save_p[regno] == REG_SAVE_1WORD | |
1266 | && regno != FRAME_POINTER_REGNUM | |
1267 | && (regno < FIRST_ARG_REGNUM | |
1268 | || regno > LAST_ARG_REGNUM)) | |
1269 | { | |
1270 | info_ptr->reg_offset[regno] = offset; | |
1271 | offset += UNITS_PER_WORD; | |
1272 | } | |
1273 | } | |
1274 | } | |
1275 | ||
1276 | /* Calculate the offset to save the local variables at. */ | |
1277 | offset = ADDR_ALIGN (offset, alignment); | |
1278 | if (info_ptr->vars_size) | |
1279 | { | |
1280 | info_ptr->vars_offset = offset; | |
1281 | offset += info_ptr->vars_size; | |
1282 | } | |
1283 | ||
1284 | /* Align header to a dword-boundary. */ | |
1285 | offset = ADDR_ALIGN (offset, 2 * UNITS_PER_WORD); | |
1286 | ||
1287 | /* Calculate the offsets in the fixed frame. */ | |
1288 | info_ptr->save_p[FRAME_POINTER_REGNUM] = REG_SAVE_1WORD; | |
1289 | info_ptr->reg_offset[FRAME_POINTER_REGNUM] = offset; | |
1290 | info_ptr->regs[STACK_REGS_FP].size_1word = UNITS_PER_WORD; | |
1291 | ||
1292 | info_ptr->save_p[LR_REGNO] = REG_SAVE_1WORD; | |
1293 | info_ptr->reg_offset[LR_REGNO] = offset + 2*UNITS_PER_WORD; | |
1294 | info_ptr->regs[STACK_REGS_LR].size_1word = UNITS_PER_WORD; | |
1295 | ||
1296 | if (cfun->returns_struct) | |
1297 | { | |
8ac411c7 KH |
1298 | info_ptr->save_p[FRV_STRUCT_VALUE_REGNUM] = REG_SAVE_1WORD; |
1299 | info_ptr->reg_offset[FRV_STRUCT_VALUE_REGNUM] = offset + UNITS_PER_WORD; | |
36a05131 BS |
1300 | info_ptr->regs[STACK_REGS_STRUCT].size_1word = UNITS_PER_WORD; |
1301 | } | |
1302 | ||
1303 | /* Calculate the offsets to store the arguments passed in registers | |
1304 | for stdarg functions. The register pairs are first and the single | |
1305 | register if any is last. The register save area starts on a | |
1306 | dword-boundary. */ | |
1307 | if (info_ptr->stdarg_size) | |
1308 | { | |
1309 | int first = info_ptr->regs[STACK_REGS_STDARG].first; | |
1310 | int last = info_ptr->regs[STACK_REGS_STDARG].last; | |
1311 | int regno; | |
1312 | ||
1313 | /* Skip the header. */ | |
1314 | offset += 4 * UNITS_PER_WORD; | |
1315 | for (regno = first; regno <= last; regno++) | |
1316 | { | |
1317 | if (info_ptr->save_p[regno] == REG_SAVE_2WORDS) | |
1318 | { | |
1319 | info_ptr->reg_offset[regno] = offset; | |
1320 | offset += 2 * UNITS_PER_WORD; | |
1321 | } | |
1322 | else if (info_ptr->save_p[regno] == REG_SAVE_1WORD) | |
1323 | { | |
1324 | info_ptr->reg_offset[regno] = offset; | |
1325 | offset += UNITS_PER_WORD; | |
1326 | } | |
1327 | } | |
1328 | } | |
1329 | } | |
1330 | ||
1331 | if (reload_completed) | |
1332 | frv_stack_cache = info_ptr; | |
1333 | ||
1334 | return info_ptr; | |
1335 | } | |
1336 | ||
1337 | \f | |
87b483a1 | 1338 | /* Print the information about the frv stack offsets, etc. when debugging. */ |
36a05131 BS |
1339 | |
1340 | void | |
f2206911 | 1341 | frv_debug_stack (frv_stack_t *info) |
36a05131 BS |
1342 | { |
1343 | int range; | |
1344 | ||
1345 | if (!info) | |
1346 | info = frv_stack_info (); | |
1347 | ||
1348 | fprintf (stderr, "\nStack information for function %s:\n", | |
1349 | ((current_function_decl && DECL_NAME (current_function_decl)) | |
1350 | ? IDENTIFIER_POINTER (DECL_NAME (current_function_decl)) | |
1351 | : "<unknown>")); | |
1352 | ||
1353 | fprintf (stderr, "\ttotal_size\t= %6d\n", info->total_size); | |
1354 | fprintf (stderr, "\tvars_size\t= %6d\n", info->vars_size); | |
1355 | fprintf (stderr, "\tparam_size\t= %6d\n", info->parameter_size); | |
1356 | fprintf (stderr, "\tregs_size\t= %6d, 1w = %3d, 2w = %3d\n", | |
1357 | info->regs_size, info->regs_size_1word, info->regs_size_2words); | |
1358 | ||
1359 | fprintf (stderr, "\theader_size\t= %6d\n", info->header_size); | |
1360 | fprintf (stderr, "\tpretend_size\t= %6d\n", info->pretend_size); | |
1361 | fprintf (stderr, "\tvars_offset\t= %6d\n", info->vars_offset); | |
1362 | fprintf (stderr, "\tregs_offset\t= %6d\n", info->regs_offset); | |
1363 | ||
1364 | for (range = 0; range < STACK_REGS_MAX; range++) | |
1365 | { | |
1366 | frv_stack_regs_t *regs = &(info->regs[range]); | |
1367 | if ((regs->size_1word + regs->size_2words) > 0) | |
1368 | { | |
1369 | int first = regs->first; | |
1370 | int last = regs->last; | |
1371 | int regno; | |
1372 | ||
1373 | fprintf (stderr, "\t%s\tsize\t= %6d, 1w = %3d, 2w = %3d, save =", | |
1374 | regs->name, regs->size_1word + regs->size_2words, | |
1375 | regs->size_1word, regs->size_2words); | |
1376 | ||
1377 | for (regno = first; regno <= last; regno++) | |
1378 | { | |
1379 | if (info->save_p[regno] == REG_SAVE_1WORD) | |
1380 | fprintf (stderr, " %s (%d)", reg_names[regno], | |
1381 | info->reg_offset[regno]); | |
1382 | ||
1383 | else if (info->save_p[regno] == REG_SAVE_2WORDS) | |
1384 | fprintf (stderr, " %s-%s (%d)", reg_names[regno], | |
1385 | reg_names[regno+1], info->reg_offset[regno]); | |
1386 | } | |
1387 | ||
1388 | fputc ('\n', stderr); | |
1389 | } | |
1390 | } | |
1391 | ||
1392 | fflush (stderr); | |
1393 | } | |
1394 | ||
1395 | ||
1396 | \f | |
1397 | ||
c557edf4 RS |
1398 | /* Used during final to control the packing of insns. The value is |
1399 | 1 if the current instruction should be packed with the next one, | |
1400 | 0 if it shouldn't or -1 if packing is disabled altogether. */ | |
36a05131 BS |
1401 | |
1402 | static int frv_insn_packing_flag; | |
1403 | ||
1404 | /* True if the current function contains a far jump. */ | |
1405 | ||
1406 | static int | |
f2206911 | 1407 | frv_function_contains_far_jump (void) |
36a05131 BS |
1408 | { |
1409 | rtx insn = get_insns (); | |
1410 | while (insn != NULL | |
b64925dc | 1411 | && !(JUMP_P (insn) |
36a05131 BS |
1412 | && get_attr_far_jump (insn) == FAR_JUMP_YES)) |
1413 | insn = NEXT_INSN (insn); | |
1414 | return (insn != NULL); | |
1415 | } | |
1416 | ||
1417 | /* For the FRV, this function makes sure that a function with far jumps | |
1418 | will return correctly. It also does the VLIW packing. */ | |
1419 | ||
1420 | static void | |
f2206911 | 1421 | frv_function_prologue (FILE *file, HOST_WIDE_INT size ATTRIBUTE_UNUSED) |
36a05131 | 1422 | { |
0fad9ab9 NC |
1423 | rtx insn, next, last_call; |
1424 | ||
36a05131 BS |
1425 | /* If no frame was created, check whether the function uses a call |
1426 | instruction to implement a far jump. If so, save the link in gr3 and | |
1427 | replace all returns to LR with returns to GR3. GR3 is used because it | |
1428 | is call-clobbered, because is not available to the register allocator, | |
1429 | and because all functions that take a hidden argument pointer will have | |
1430 | a stack frame. */ | |
1431 | if (frv_stack_info ()->total_size == 0 && frv_function_contains_far_jump ()) | |
1432 | { | |
1433 | rtx insn; | |
1434 | ||
1435 | /* Just to check that the above comment is true. */ | |
6fb5fa3c | 1436 | gcc_assert (!df_regs_ever_live_p (GPR_FIRST + 3)); |
36a05131 BS |
1437 | |
1438 | /* Generate the instruction that saves the link register. */ | |
1439 | fprintf (file, "\tmovsg lr,gr3\n"); | |
1440 | ||
1441 | /* Replace the LR with GR3 in *return_internal patterns. The insn | |
1442 | will now return using jmpl @(gr3,0) rather than bralr. We cannot | |
1443 | simply emit a different assembly directive because bralr and jmpl | |
1444 | execute in different units. */ | |
1445 | for (insn = get_insns(); insn != NULL; insn = NEXT_INSN (insn)) | |
b64925dc | 1446 | if (JUMP_P (insn)) |
36a05131 BS |
1447 | { |
1448 | rtx pattern = PATTERN (insn); | |
1449 | if (GET_CODE (pattern) == PARALLEL | |
1450 | && XVECLEN (pattern, 0) >= 2 | |
1451 | && GET_CODE (XVECEXP (pattern, 0, 0)) == RETURN | |
1452 | && GET_CODE (XVECEXP (pattern, 0, 1)) == USE) | |
1453 | { | |
1454 | rtx address = XEXP (XVECEXP (pattern, 0, 1), 0); | |
1455 | if (GET_CODE (address) == REG && REGNO (address) == LR_REGNO) | |
6fb5fa3c | 1456 | SET_REGNO (address, GPR_FIRST + 3); |
36a05131 BS |
1457 | } |
1458 | } | |
1459 | } | |
1460 | ||
1461 | frv_pack_insns (); | |
c557edf4 RS |
1462 | |
1463 | /* Allow the garbage collector to free the nops created by frv_reorg. */ | |
1464 | memset (frv_nops, 0, sizeof (frv_nops)); | |
0fad9ab9 NC |
1465 | |
1466 | /* Locate CALL_ARG_LOCATION notes that have been misplaced | |
1467 | and move them back to where they should be located. */ | |
1468 | last_call = NULL_RTX; | |
1469 | for (insn = get_insns (); insn; insn = next) | |
1470 | { | |
1471 | next = NEXT_INSN (insn); | |
1472 | if (CALL_P (insn) | |
1473 | || (INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE | |
1474 | && CALL_P (XVECEXP (PATTERN (insn), 0, 0)))) | |
1475 | last_call = insn; | |
1476 | ||
1477 | if (!NOTE_P (insn) || NOTE_KIND (insn) != NOTE_INSN_CALL_ARG_LOCATION) | |
1478 | continue; | |
1479 | ||
1480 | if (NEXT_INSN (last_call) == insn) | |
1481 | continue; | |
1482 | ||
1483 | NEXT_INSN (PREV_INSN (insn)) = NEXT_INSN (insn); | |
1484 | PREV_INSN (NEXT_INSN (insn)) = PREV_INSN (insn); | |
1485 | PREV_INSN (insn) = last_call; | |
1486 | NEXT_INSN (insn) = NEXT_INSN (last_call); | |
1487 | PREV_INSN (NEXT_INSN (insn)) = insn; | |
1488 | NEXT_INSN (PREV_INSN (insn)) = insn; | |
1489 | last_call = insn; | |
1490 | } | |
36a05131 BS |
1491 | } |
1492 | ||
1493 | \f | |
1494 | /* Return the next available temporary register in a given class. */ | |
1495 | ||
1496 | static rtx | |
f2206911 KC |
1497 | frv_alloc_temp_reg ( |
1498 | frv_tmp_reg_t *info, /* which registers are available */ | |
0a2aaacc | 1499 | enum reg_class rclass, /* register class desired */ |
f2206911 KC |
1500 | enum machine_mode mode, /* mode to allocate register with */ |
1501 | int mark_as_used, /* register not available after allocation */ | |
1502 | int no_abort) /* return NULL instead of aborting */ | |
36a05131 | 1503 | { |
0a2aaacc | 1504 | int regno = info->next_reg[ (int)rclass ]; |
36a05131 | 1505 | int orig_regno = regno; |
0a2aaacc | 1506 | HARD_REG_SET *reg_in_class = ®_class_contents[ (int)rclass ]; |
36a05131 BS |
1507 | int i, nr; |
1508 | ||
1509 | for (;;) | |
1510 | { | |
1511 | if (TEST_HARD_REG_BIT (*reg_in_class, regno) | |
1512 | && TEST_HARD_REG_BIT (info->regs, regno)) | |
1513 | break; | |
1514 | ||
1515 | if (++regno >= FIRST_PSEUDO_REGISTER) | |
1516 | regno = 0; | |
1517 | if (regno == orig_regno) | |
1518 | { | |
44e91694 NS |
1519 | gcc_assert (no_abort); |
1520 | return NULL_RTX; | |
36a05131 BS |
1521 | } |
1522 | } | |
1523 | ||
1524 | nr = HARD_REGNO_NREGS (regno, mode); | |
0a2aaacc | 1525 | info->next_reg[ (int)rclass ] = regno + nr; |
36a05131 BS |
1526 | |
1527 | if (mark_as_used) | |
1528 | for (i = 0; i < nr; i++) | |
1529 | CLEAR_HARD_REG_BIT (info->regs, regno+i); | |
1530 | ||
1531 | return gen_rtx_REG (mode, regno); | |
1532 | } | |
1533 | ||
1534 | \f | |
1535 | /* Return an rtx with the value OFFSET, which will either be a register or a | |
1536 | signed 12-bit integer. It can be used as the second operand in an "add" | |
1537 | instruction, or as the index in a load or store. | |
1538 | ||
1539 | The function returns a constant rtx if OFFSET is small enough, otherwise | |
1540 | it loads the constant into register OFFSET_REGNO and returns that. */ | |
1541 | static rtx | |
f2206911 | 1542 | frv_frame_offset_rtx (int offset) |
36a05131 BS |
1543 | { |
1544 | rtx offset_rtx = GEN_INT (offset); | |
2f5b1308 | 1545 | if (IN_RANGE (offset, -2048, 2047)) |
36a05131 BS |
1546 | return offset_rtx; |
1547 | else | |
1548 | { | |
1549 | rtx reg_rtx = gen_rtx_REG (SImode, OFFSET_REGNO); | |
2f5b1308 | 1550 | if (IN_RANGE (offset, -32768, 32767)) |
36a05131 BS |
1551 | emit_insn (gen_movsi (reg_rtx, offset_rtx)); |
1552 | else | |
1553 | { | |
1554 | emit_insn (gen_movsi_high (reg_rtx, offset_rtx)); | |
1555 | emit_insn (gen_movsi_lo_sum (reg_rtx, offset_rtx)); | |
1556 | } | |
1557 | return reg_rtx; | |
1558 | } | |
1559 | } | |
1560 | ||
1561 | /* Generate (mem:MODE (plus:Pmode BASE (frv_frame_offset OFFSET)))). The | |
1562 | prologue and epilogue uses such expressions to access the stack. */ | |
1563 | static rtx | |
f2206911 | 1564 | frv_frame_mem (enum machine_mode mode, rtx base, int offset) |
36a05131 BS |
1565 | { |
1566 | return gen_rtx_MEM (mode, gen_rtx_PLUS (Pmode, | |
1567 | base, | |
1568 | frv_frame_offset_rtx (offset))); | |
1569 | } | |
1570 | ||
1571 | /* Generate a frame-related expression: | |
1572 | ||
1573 | (set REG (mem (plus (sp) (const_int OFFSET)))). | |
1574 | ||
1575 | Such expressions are used in FRAME_RELATED_EXPR notes for more complex | |
1576 | instructions. Marking the expressions as frame-related is superfluous if | |
1577 | the note contains just a single set. But if the note contains a PARALLEL | |
1578 | or SEQUENCE that has several sets, each set must be individually marked | |
1579 | as frame-related. */ | |
1580 | static rtx | |
f2206911 | 1581 | frv_dwarf_store (rtx reg, int offset) |
36a05131 BS |
1582 | { |
1583 | rtx set = gen_rtx_SET (VOIDmode, | |
1584 | gen_rtx_MEM (GET_MODE (reg), | |
0a81f074 | 1585 | plus_constant (Pmode, stack_pointer_rtx, |
36a05131 BS |
1586 | offset)), |
1587 | reg); | |
1588 | RTX_FRAME_RELATED_P (set) = 1; | |
1589 | return set; | |
1590 | } | |
1591 | ||
1592 | /* Emit a frame-related instruction whose pattern is PATTERN. The | |
1593 | instruction is the last in a sequence that cumulatively performs the | |
1594 | operation described by DWARF_PATTERN. The instruction is marked as | |
1595 | frame-related and has a REG_FRAME_RELATED_EXPR note containing | |
1596 | DWARF_PATTERN. */ | |
1597 | static void | |
f2206911 | 1598 | frv_frame_insn (rtx pattern, rtx dwarf_pattern) |
36a05131 BS |
1599 | { |
1600 | rtx insn = emit_insn (pattern); | |
1601 | RTX_FRAME_RELATED_P (insn) = 1; | |
1602 | REG_NOTES (insn) = alloc_EXPR_LIST (REG_FRAME_RELATED_EXPR, | |
1603 | dwarf_pattern, | |
1604 | REG_NOTES (insn)); | |
1605 | } | |
1606 | ||
1607 | /* Emit instructions that transfer REG to or from the memory location (sp + | |
1608 | STACK_OFFSET). The register is stored in memory if ACCESSOR->OP is | |
1609 | FRV_STORE and loaded if it is FRV_LOAD. Only the prologue uses this | |
1610 | function to store registers and only the epilogue uses it to load them. | |
1611 | ||
1612 | The caller sets up ACCESSOR so that BASE is equal to (sp + BASE_OFFSET). | |
1613 | The generated instruction will use BASE as its base register. BASE may | |
1614 | simply be the stack pointer, but if several accesses are being made to a | |
1615 | region far away from the stack pointer, it may be more efficient to set | |
1616 | up a temporary instead. | |
b16c1435 | 1617 | |
36a05131 BS |
1618 | Store instructions will be frame-related and will be annotated with the |
1619 | overall effect of the store. Load instructions will be followed by a | |
1620 | (use) to prevent later optimizations from zapping them. | |
1621 | ||
1622 | The function takes care of the moves to and from SPRs, using TEMP_REGNO | |
1623 | as a temporary in such cases. */ | |
1624 | static void | |
f2206911 | 1625 | frv_frame_access (frv_frame_accessor_t *accessor, rtx reg, int stack_offset) |
36a05131 BS |
1626 | { |
1627 | enum machine_mode mode = GET_MODE (reg); | |
1628 | rtx mem = frv_frame_mem (mode, | |
1629 | accessor->base, | |
1630 | stack_offset - accessor->base_offset); | |
1631 | ||
1632 | if (accessor->op == FRV_LOAD) | |
1633 | { | |
1634 | if (SPR_P (REGNO (reg))) | |
1635 | { | |
1636 | rtx temp = gen_rtx_REG (mode, TEMP_REGNO); | |
1637 | emit_insn (gen_rtx_SET (VOIDmode, temp, mem)); | |
1638 | emit_insn (gen_rtx_SET (VOIDmode, reg, temp)); | |
1639 | } | |
1640 | else | |
8d8256c1 NC |
1641 | { |
1642 | /* We cannot use reg+reg addressing for DImode access. */ | |
1643 | if (mode == DImode | |
1644 | && GET_CODE (XEXP (mem, 0)) == PLUS | |
1645 | && GET_CODE (XEXP (XEXP (mem, 0), 0)) == REG | |
1646 | && GET_CODE (XEXP (XEXP (mem, 0), 1)) == REG) | |
1647 | { | |
1648 | rtx temp = gen_rtx_REG (SImode, TEMP_REGNO); | |
5c5e8419 JR |
1649 | |
1650 | emit_move_insn (temp, | |
1651 | gen_rtx_PLUS (SImode, XEXP (XEXP (mem, 0), 0), | |
1652 | XEXP (XEXP (mem, 0), 1))); | |
8d8256c1 NC |
1653 | mem = gen_rtx_MEM (DImode, temp); |
1654 | } | |
1655 | emit_insn (gen_rtx_SET (VOIDmode, reg, mem)); | |
1656 | } | |
c41c1387 | 1657 | emit_use (reg); |
36a05131 BS |
1658 | } |
1659 | else | |
1660 | { | |
1661 | if (SPR_P (REGNO (reg))) | |
1662 | { | |
1663 | rtx temp = gen_rtx_REG (mode, TEMP_REGNO); | |
1664 | emit_insn (gen_rtx_SET (VOIDmode, temp, reg)); | |
1665 | frv_frame_insn (gen_rtx_SET (Pmode, mem, temp), | |
1666 | frv_dwarf_store (reg, stack_offset)); | |
1667 | } | |
8d8256c1 | 1668 | else if (mode == DImode) |
36a05131 BS |
1669 | { |
1670 | /* For DImode saves, the dwarf2 version needs to be a SEQUENCE | |
1671 | with a separate save for each register. */ | |
1672 | rtx reg1 = gen_rtx_REG (SImode, REGNO (reg)); | |
1673 | rtx reg2 = gen_rtx_REG (SImode, REGNO (reg) + 1); | |
1674 | rtx set1 = frv_dwarf_store (reg1, stack_offset); | |
1675 | rtx set2 = frv_dwarf_store (reg2, stack_offset + 4); | |
8d8256c1 NC |
1676 | |
1677 | /* Also we cannot use reg+reg addressing. */ | |
1678 | if (GET_CODE (XEXP (mem, 0)) == PLUS | |
1679 | && GET_CODE (XEXP (XEXP (mem, 0), 0)) == REG | |
1680 | && GET_CODE (XEXP (XEXP (mem, 0), 1)) == REG) | |
1681 | { | |
1682 | rtx temp = gen_rtx_REG (SImode, TEMP_REGNO); | |
5c5e8419 JR |
1683 | emit_move_insn (temp, |
1684 | gen_rtx_PLUS (SImode, XEXP (XEXP (mem, 0), 0), | |
1685 | XEXP (XEXP (mem, 0), 1))); | |
8d8256c1 NC |
1686 | mem = gen_rtx_MEM (DImode, temp); |
1687 | } | |
1688 | ||
36a05131 BS |
1689 | frv_frame_insn (gen_rtx_SET (Pmode, mem, reg), |
1690 | gen_rtx_PARALLEL (VOIDmode, | |
1691 | gen_rtvec (2, set1, set2))); | |
1692 | } | |
1693 | else | |
1694 | frv_frame_insn (gen_rtx_SET (Pmode, mem, reg), | |
1695 | frv_dwarf_store (reg, stack_offset)); | |
1696 | } | |
1697 | } | |
1698 | ||
1699 | /* A function that uses frv_frame_access to transfer a group of registers to | |
1700 | or from the stack. ACCESSOR is passed directly to frv_frame_access, INFO | |
1701 | is the stack information generated by frv_stack_info, and REG_SET is the | |
1702 | number of the register set to transfer. */ | |
1703 | static void | |
f2206911 KC |
1704 | frv_frame_access_multi (frv_frame_accessor_t *accessor, |
1705 | frv_stack_t *info, | |
1706 | int reg_set) | |
36a05131 BS |
1707 | { |
1708 | frv_stack_regs_t *regs_info; | |
1709 | int regno; | |
1710 | ||
1711 | regs_info = &info->regs[reg_set]; | |
1712 | for (regno = regs_info->first; regno <= regs_info->last; regno++) | |
1713 | if (info->save_p[regno]) | |
1714 | frv_frame_access (accessor, | |
1715 | info->save_p[regno] == REG_SAVE_2WORDS | |
1716 | ? gen_rtx_REG (DImode, regno) | |
1717 | : gen_rtx_REG (SImode, regno), | |
1718 | info->reg_offset[regno]); | |
1719 | } | |
1720 | ||
1721 | /* Save or restore callee-saved registers that are kept outside the frame | |
1722 | header. The function saves the registers if OP is FRV_STORE and restores | |
1723 | them if OP is FRV_LOAD. INFO is the stack information generated by | |
1724 | frv_stack_info. */ | |
1725 | static void | |
f2206911 | 1726 | frv_frame_access_standard_regs (enum frv_stack_op op, frv_stack_t *info) |
36a05131 BS |
1727 | { |
1728 | frv_frame_accessor_t accessor; | |
1729 | ||
1730 | accessor.op = op; | |
1731 | accessor.base = stack_pointer_rtx; | |
1732 | accessor.base_offset = 0; | |
1733 | frv_frame_access_multi (&accessor, info, STACK_REGS_GPR); | |
1734 | frv_frame_access_multi (&accessor, info, STACK_REGS_FPR); | |
1735 | frv_frame_access_multi (&accessor, info, STACK_REGS_LCR); | |
b16c1435 | 1736 | } |
36a05131 BS |
1737 | |
1738 | ||
1739 | /* Called after register allocation to add any instructions needed for the | |
1740 | prologue. Using a prologue insn is favored compared to putting all of the | |
b88cf82e KH |
1741 | instructions in the TARGET_ASM_FUNCTION_PROLOGUE target hook, since |
1742 | it allows the scheduler to intermix instructions with the saves of | |
1743 | the caller saved registers. In some cases, it might be necessary | |
1744 | to emit a barrier instruction as the last insn to prevent such | |
1745 | scheduling. | |
36a05131 BS |
1746 | |
1747 | Also any insns generated here should have RTX_FRAME_RELATED_P(insn) = 1 | |
1748 | so that the debug info generation code can handle them properly. */ | |
1749 | void | |
f2206911 | 1750 | frv_expand_prologue (void) |
36a05131 BS |
1751 | { |
1752 | frv_stack_t *info = frv_stack_info (); | |
1753 | rtx sp = stack_pointer_rtx; | |
1754 | rtx fp = frame_pointer_rtx; | |
1755 | frv_frame_accessor_t accessor; | |
1756 | ||
1757 | if (TARGET_DEBUG_STACK) | |
1758 | frv_debug_stack (info); | |
1759 | ||
7027164c NC |
1760 | if (flag_stack_usage_info) |
1761 | current_function_static_stack_size = info->total_size; | |
1762 | ||
36a05131 BS |
1763 | if (info->total_size == 0) |
1764 | return; | |
1765 | ||
1766 | /* We're interested in three areas of the frame here: | |
1767 | ||
1768 | A: the register save area | |
1769 | B: the old FP | |
1770 | C: the header after B | |
1771 | ||
1772 | If the frame pointer isn't used, we'll have to set up A, B and C | |
1773 | using the stack pointer. If the frame pointer is used, we'll access | |
1774 | them as follows: | |
1775 | ||
1776 | A: set up using sp | |
1777 | B: set up using sp or a temporary (see below) | |
1778 | C: set up using fp | |
1779 | ||
1780 | We set up B using the stack pointer if the frame is small enough. | |
1781 | Otherwise, it's more efficient to copy the old stack pointer into a | |
1782 | temporary and use that. | |
1783 | ||
1784 | Note that it's important to make sure the prologue and epilogue use the | |
1785 | same registers to access A and C, since doing otherwise will confuse | |
1786 | the aliasing code. */ | |
1787 | ||
1788 | /* Set up ACCESSOR for accessing region B above. If the frame pointer | |
1789 | isn't used, the same method will serve for C. */ | |
1790 | accessor.op = FRV_STORE; | |
1791 | if (frame_pointer_needed && info->total_size > 2048) | |
1792 | { | |
36a05131 BS |
1793 | accessor.base = gen_rtx_REG (Pmode, OLD_SP_REGNO); |
1794 | accessor.base_offset = info->total_size; | |
5c5e8419 | 1795 | emit_insn (gen_movsi (accessor.base, sp)); |
36a05131 BS |
1796 | } |
1797 | else | |
1798 | { | |
1799 | accessor.base = stack_pointer_rtx; | |
1800 | accessor.base_offset = 0; | |
1801 | } | |
1802 | ||
1803 | /* Allocate the stack space. */ | |
1804 | { | |
1805 | rtx asm_offset = frv_frame_offset_rtx (-info->total_size); | |
1806 | rtx dwarf_offset = GEN_INT (-info->total_size); | |
1807 | ||
1808 | frv_frame_insn (gen_stack_adjust (sp, sp, asm_offset), | |
1809 | gen_rtx_SET (Pmode, | |
1810 | sp, | |
1811 | gen_rtx_PLUS (Pmode, sp, dwarf_offset))); | |
1812 | } | |
1813 | ||
1814 | /* If the frame pointer is needed, store the old one at (sp + FP_OFFSET) | |
1815 | and point the new one to that location. */ | |
1816 | if (frame_pointer_needed) | |
1817 | { | |
1818 | int fp_offset = info->reg_offset[FRAME_POINTER_REGNUM]; | |
1819 | ||
1820 | /* ASM_SRC and DWARF_SRC both point to the frame header. ASM_SRC is | |
1821 | based on ACCESSOR.BASE but DWARF_SRC is always based on the stack | |
1822 | pointer. */ | |
0a81f074 | 1823 | rtx asm_src = plus_constant (Pmode, accessor.base, |
36a05131 | 1824 | fp_offset - accessor.base_offset); |
0a81f074 | 1825 | rtx dwarf_src = plus_constant (Pmode, sp, fp_offset); |
36a05131 BS |
1826 | |
1827 | /* Store the old frame pointer at (sp + FP_OFFSET). */ | |
1828 | frv_frame_access (&accessor, fp, fp_offset); | |
1829 | ||
1830 | /* Set up the new frame pointer. */ | |
1831 | frv_frame_insn (gen_rtx_SET (VOIDmode, fp, asm_src), | |
1832 | gen_rtx_SET (VOIDmode, fp, dwarf_src)); | |
1833 | ||
1834 | /* Access region C from the frame pointer. */ | |
1835 | accessor.base = fp; | |
1836 | accessor.base_offset = fp_offset; | |
1837 | } | |
1838 | ||
1839 | /* Set up region C. */ | |
1840 | frv_frame_access_multi (&accessor, info, STACK_REGS_STRUCT); | |
1841 | frv_frame_access_multi (&accessor, info, STACK_REGS_LR); | |
1842 | frv_frame_access_multi (&accessor, info, STACK_REGS_STDARG); | |
1843 | ||
1844 | /* Set up region A. */ | |
1845 | frv_frame_access_standard_regs (FRV_STORE, info); | |
1846 | ||
1847 | /* If this is a varargs/stdarg function, issue a blockage to prevent the | |
1848 | scheduler from moving loads before the stores saving the registers. */ | |
1849 | if (info->stdarg_size > 0) | |
1850 | emit_insn (gen_blockage ()); | |
1851 | ||
87b483a1 | 1852 | /* Set up pic register/small data register for this function. */ |
ad516a74 | 1853 | if (!TARGET_FDPIC && flag_pic && crtl->uses_pic_offset_table) |
36a05131 BS |
1854 | emit_insn (gen_pic_prologue (gen_rtx_REG (Pmode, PIC_REGNO), |
1855 | gen_rtx_REG (Pmode, LR_REGNO), | |
1856 | gen_rtx_REG (SImode, OFFSET_REGNO))); | |
1857 | } | |
1858 | ||
1859 | \f | |
1860 | /* Under frv, all of the work is done via frv_expand_epilogue, but | |
839a4992 | 1861 | this function provides a convenient place to do cleanup. */ |
36a05131 BS |
1862 | |
1863 | static void | |
f2206911 KC |
1864 | frv_function_epilogue (FILE *file ATTRIBUTE_UNUSED, |
1865 | HOST_WIDE_INT size ATTRIBUTE_UNUSED) | |
36a05131 BS |
1866 | { |
1867 | frv_stack_cache = (frv_stack_t *)0; | |
1868 | ||
87b483a1 | 1869 | /* Zap last used registers for conditional execution. */ |
fad205ff | 1870 | memset (&frv_ifcvt.tmp_reg, 0, sizeof (frv_ifcvt.tmp_reg)); |
36a05131 | 1871 | |
87b483a1 | 1872 | /* Release the bitmap of created insns. */ |
7b210806 | 1873 | BITMAP_FREE (frv_ifcvt.scratch_insns_bitmap); |
36a05131 BS |
1874 | } |
1875 | ||
1876 | \f | |
1877 | /* Called after register allocation to add any instructions needed for the | |
43aa4e05 | 1878 | epilogue. Using an epilogue insn is favored compared to putting all of the |
b88cf82e KH |
1879 | instructions in the TARGET_ASM_FUNCTION_PROLOGUE target hook, since |
1880 | it allows the scheduler to intermix instructions with the saves of | |
1881 | the caller saved registers. In some cases, it might be necessary | |
1882 | to emit a barrier instruction as the last insn to prevent such | |
c557edf4 | 1883 | scheduling. */ |
36a05131 BS |
1884 | |
1885 | void | |
764678d1 | 1886 | frv_expand_epilogue (bool emit_return) |
36a05131 BS |
1887 | { |
1888 | frv_stack_t *info = frv_stack_info (); | |
1889 | rtx fp = frame_pointer_rtx; | |
1890 | rtx sp = stack_pointer_rtx; | |
1891 | rtx return_addr; | |
1892 | int fp_offset; | |
1893 | ||
1894 | fp_offset = info->reg_offset[FRAME_POINTER_REGNUM]; | |
1895 | ||
1896 | /* Restore the stack pointer to its original value if alloca or the like | |
1897 | is used. */ | |
416ff32e | 1898 | if (! crtl->sp_is_unchanging) |
36a05131 BS |
1899 | emit_insn (gen_addsi3 (sp, fp, frv_frame_offset_rtx (-fp_offset))); |
1900 | ||
1901 | /* Restore the callee-saved registers that were used in this function. */ | |
1902 | frv_frame_access_standard_regs (FRV_LOAD, info); | |
1903 | ||
1904 | /* Set RETURN_ADDR to the address we should return to. Set it to NULL if | |
1905 | no return instruction should be emitted. */ | |
764678d1 | 1906 | if (info->save_p[LR_REGNO]) |
36a05131 BS |
1907 | { |
1908 | int lr_offset; | |
1909 | rtx mem; | |
1910 | ||
1911 | /* Use the same method to access the link register's slot as we did in | |
1912 | the prologue. In other words, use the frame pointer if available, | |
1913 | otherwise use the stack pointer. | |
1914 | ||
1915 | LR_OFFSET is the offset of the link register's slot from the start | |
1916 | of the frame and MEM is a memory rtx for it. */ | |
1917 | lr_offset = info->reg_offset[LR_REGNO]; | |
1918 | if (frame_pointer_needed) | |
1919 | mem = frv_frame_mem (Pmode, fp, lr_offset - fp_offset); | |
1920 | else | |
1921 | mem = frv_frame_mem (Pmode, sp, lr_offset); | |
1922 | ||
1923 | /* Load the old link register into a GPR. */ | |
1924 | return_addr = gen_rtx_REG (Pmode, TEMP_REGNO); | |
1925 | emit_insn (gen_rtx_SET (VOIDmode, return_addr, mem)); | |
1926 | } | |
1927 | else | |
1928 | return_addr = gen_rtx_REG (Pmode, LR_REGNO); | |
1929 | ||
1930 | /* Restore the old frame pointer. Emit a USE afterwards to make sure | |
1931 | the load is preserved. */ | |
1932 | if (frame_pointer_needed) | |
1933 | { | |
1934 | emit_insn (gen_rtx_SET (VOIDmode, fp, gen_rtx_MEM (Pmode, fp))); | |
c41c1387 | 1935 | emit_use (fp); |
36a05131 BS |
1936 | } |
1937 | ||
1938 | /* Deallocate the stack frame. */ | |
1939 | if (info->total_size != 0) | |
1940 | { | |
1941 | rtx offset = frv_frame_offset_rtx (info->total_size); | |
1942 | emit_insn (gen_stack_adjust (sp, sp, offset)); | |
1943 | } | |
1944 | ||
1945 | /* If this function uses eh_return, add the final stack adjustment now. */ | |
e3b5732b | 1946 | if (crtl->calls_eh_return) |
36a05131 BS |
1947 | emit_insn (gen_stack_adjust (sp, sp, EH_RETURN_STACKADJ_RTX)); |
1948 | ||
764678d1 | 1949 | if (emit_return) |
36a05131 | 1950 | emit_jump_insn (gen_epilogue_return (return_addr)); |
764678d1 AO |
1951 | else |
1952 | { | |
1953 | rtx lr = return_addr; | |
1954 | ||
1955 | if (REGNO (return_addr) != LR_REGNO) | |
1956 | { | |
1957 | lr = gen_rtx_REG (Pmode, LR_REGNO); | |
1958 | emit_move_insn (lr, return_addr); | |
1959 | } | |
1960 | ||
c41c1387 | 1961 | emit_use (lr); |
764678d1 | 1962 | } |
36a05131 BS |
1963 | } |
1964 | ||
1965 | \f | |
b88cf82e | 1966 | /* Worker function for TARGET_ASM_OUTPUT_MI_THUNK. */ |
36a05131 | 1967 | |
c590b625 | 1968 | static void |
f2206911 KC |
1969 | frv_asm_output_mi_thunk (FILE *file, |
1970 | tree thunk_fndecl ATTRIBUTE_UNUSED, | |
1971 | HOST_WIDE_INT delta, | |
1972 | HOST_WIDE_INT vcall_offset ATTRIBUTE_UNUSED, | |
1973 | tree function) | |
36a05131 BS |
1974 | { |
1975 | const char *name_func = XSTR (XEXP (DECL_RTL (function), 0), 0); | |
1976 | const char *name_arg0 = reg_names[FIRST_ARG_REGNUM]; | |
1977 | const char *name_jmp = reg_names[JUMP_REGNO]; | |
c557edf4 | 1978 | const char *parallel = (frv_issue_rate () > 1 ? ".p" : ""); |
36a05131 | 1979 | |
87b483a1 | 1980 | /* Do the add using an addi if possible. */ |
2f5b1308 | 1981 | if (IN_RANGE (delta, -2048, 2047)) |
eb0424da | 1982 | fprintf (file, "\taddi %s,#%d,%s\n", name_arg0, (int) delta, name_arg0); |
36a05131 BS |
1983 | else |
1984 | { | |
4a0a75dd KG |
1985 | const char *const name_add = reg_names[TEMP_REGNO]; |
1986 | fprintf (file, "\tsethi%s #hi(" HOST_WIDE_INT_PRINT_DEC "),%s\n", | |
1987 | parallel, delta, name_add); | |
1988 | fprintf (file, "\tsetlo #lo(" HOST_WIDE_INT_PRINT_DEC "),%s\n", | |
1989 | delta, name_add); | |
36a05131 BS |
1990 | fprintf (file, "\tadd %s,%s,%s\n", name_add, name_arg0, name_arg0); |
1991 | } | |
1992 | ||
34208acf AO |
1993 | if (TARGET_FDPIC) |
1994 | { | |
1995 | const char *name_pic = reg_names[FDPIC_REGNO]; | |
1996 | name_jmp = reg_names[FDPIC_FPTR_REGNO]; | |
1997 | ||
1998 | if (flag_pic != 1) | |
1999 | { | |
2000 | fprintf (file, "\tsethi%s #gotofffuncdeschi(", parallel); | |
2001 | assemble_name (file, name_func); | |
2002 | fprintf (file, "),%s\n", name_jmp); | |
2003 | ||
2004 | fprintf (file, "\tsetlo #gotofffuncdesclo("); | |
2005 | assemble_name (file, name_func); | |
2006 | fprintf (file, "),%s\n", name_jmp); | |
2007 | ||
2008 | fprintf (file, "\tldd @(%s,%s), %s\n", name_jmp, name_pic, name_jmp); | |
2009 | } | |
2010 | else | |
2011 | { | |
2012 | fprintf (file, "\tlddo @(%s,#gotofffuncdesc12(", name_pic); | |
2013 | assemble_name (file, name_func); | |
2014 | fprintf (file, "\t)), %s\n", name_jmp); | |
2015 | } | |
2016 | } | |
2017 | else if (!flag_pic) | |
36a05131 BS |
2018 | { |
2019 | fprintf (file, "\tsethi%s #hi(", parallel); | |
2020 | assemble_name (file, name_func); | |
2021 | fprintf (file, "),%s\n", name_jmp); | |
2022 | ||
2023 | fprintf (file, "\tsetlo #lo("); | |
2024 | assemble_name (file, name_func); | |
2025 | fprintf (file, "),%s\n", name_jmp); | |
2026 | } | |
2027 | else | |
2028 | { | |
2029 | /* Use JUMP_REGNO as a temporary PIC register. */ | |
2030 | const char *name_lr = reg_names[LR_REGNO]; | |
2031 | const char *name_gppic = name_jmp; | |
2032 | const char *name_tmp = reg_names[TEMP_REGNO]; | |
2033 | ||
2034 | fprintf (file, "\tmovsg %s,%s\n", name_lr, name_tmp); | |
2035 | fprintf (file, "\tcall 1f\n"); | |
2036 | fprintf (file, "1:\tmovsg %s,%s\n", name_lr, name_gppic); | |
2037 | fprintf (file, "\tmovgs %s,%s\n", name_tmp, name_lr); | |
2038 | fprintf (file, "\tsethi%s #gprelhi(1b),%s\n", parallel, name_tmp); | |
2039 | fprintf (file, "\tsetlo #gprello(1b),%s\n", name_tmp); | |
2040 | fprintf (file, "\tsub %s,%s,%s\n", name_gppic, name_tmp, name_gppic); | |
2041 | ||
2042 | fprintf (file, "\tsethi%s #gprelhi(", parallel); | |
2043 | assemble_name (file, name_func); | |
2044 | fprintf (file, "),%s\n", name_tmp); | |
2045 | ||
2046 | fprintf (file, "\tsetlo #gprello("); | |
2047 | assemble_name (file, name_func); | |
2048 | fprintf (file, "),%s\n", name_tmp); | |
2049 | ||
2050 | fprintf (file, "\tadd %s,%s,%s\n", name_gppic, name_tmp, name_jmp); | |
2051 | } | |
2052 | ||
87b483a1 | 2053 | /* Jump to the function address. */ |
36a05131 BS |
2054 | fprintf (file, "\tjmpl @(%s,%s)\n", name_jmp, reg_names[GPR_FIRST+0]); |
2055 | } | |
2056 | ||
2057 | \f | |
36a05131 | 2058 | |
87b483a1 | 2059 | /* On frv, create a frame whenever we need to create stack. */ |
36a05131 | 2060 | |
b52b1749 | 2061 | static bool |
f2206911 | 2062 | frv_frame_pointer_required (void) |
36a05131 | 2063 | { |
34208acf AO |
2064 | /* If we forgoing the usual linkage requirements, we only need |
2065 | a frame pointer if the stack pointer might change. */ | |
2066 | if (!TARGET_LINKED_FP) | |
416ff32e | 2067 | return !crtl->sp_is_unchanging; |
34208acf | 2068 | |
416ff32e | 2069 | if (! crtl->is_leaf) |
b52b1749 | 2070 | return true; |
36a05131 BS |
2071 | |
2072 | if (get_frame_size () != 0) | |
b52b1749 | 2073 | return true; |
36a05131 BS |
2074 | |
2075 | if (cfun->stdarg) | |
b52b1749 | 2076 | return true; |
36a05131 | 2077 | |
416ff32e | 2078 | if (!crtl->sp_is_unchanging) |
b52b1749 | 2079 | return true; |
36a05131 | 2080 | |
ad516a74 | 2081 | if (!TARGET_FDPIC && flag_pic && crtl->uses_pic_offset_table) |
b52b1749 | 2082 | return true; |
36a05131 BS |
2083 | |
2084 | if (profile_flag) | |
b52b1749 | 2085 | return true; |
36a05131 BS |
2086 | |
2087 | if (cfun->machine->frame_needed) | |
b52b1749 | 2088 | return true; |
36a05131 | 2089 | |
b52b1749 | 2090 | return false; |
36a05131 BS |
2091 | } |
2092 | ||
2093 | \f | |
7b5cbb57 AS |
2094 | /* Worker function for TARGET_CAN_ELIMINATE. */ |
2095 | ||
2096 | bool | |
2097 | frv_can_eliminate (const int from, const int to) | |
2098 | { | |
2099 | return (from == ARG_POINTER_REGNUM && to == STACK_POINTER_REGNUM | |
2100 | ? ! frame_pointer_needed | |
2101 | : true); | |
2102 | } | |
2103 | ||
36a05131 BS |
2104 | /* This macro is similar to `INITIAL_FRAME_POINTER_OFFSET'. It specifies the |
2105 | initial difference between the specified pair of registers. This macro must | |
2106 | be defined if `ELIMINABLE_REGS' is defined. */ | |
2107 | ||
2108 | /* See frv_stack_info for more details on the frv stack frame. */ | |
2109 | ||
2110 | int | |
f2206911 | 2111 | frv_initial_elimination_offset (int from, int to) |
36a05131 BS |
2112 | { |
2113 | frv_stack_t *info = frv_stack_info (); | |
2114 | int ret = 0; | |
2115 | ||
2116 | if (to == STACK_POINTER_REGNUM && from == ARG_POINTER_REGNUM) | |
2117 | ret = info->total_size - info->pretend_size; | |
2118 | ||
2119 | else if (to == STACK_POINTER_REGNUM && from == FRAME_POINTER_REGNUM) | |
88d6a75f | 2120 | ret = info->reg_offset[FRAME_POINTER_REGNUM]; |
36a05131 BS |
2121 | |
2122 | else if (to == FRAME_POINTER_REGNUM && from == ARG_POINTER_REGNUM) | |
2123 | ret = (info->total_size | |
2124 | - info->reg_offset[FRAME_POINTER_REGNUM] | |
2125 | - info->pretend_size); | |
2126 | ||
2127 | else | |
44e91694 | 2128 | gcc_unreachable (); |
36a05131 BS |
2129 | |
2130 | if (TARGET_DEBUG_STACK) | |
2131 | fprintf (stderr, "Eliminate %s to %s by adding %d\n", | |
2132 | reg_names [from], reg_names[to], ret); | |
2133 | ||
2134 | return ret; | |
2135 | } | |
2136 | ||
2137 | \f | |
d8c2bed3 | 2138 | /* Worker function for TARGET_SETUP_INCOMING_VARARGS. */ |
36a05131 | 2139 | |
d8c2bed3 | 2140 | static void |
d5cc9181 | 2141 | frv_setup_incoming_varargs (cumulative_args_t cum_v, |
f2206911 KC |
2142 | enum machine_mode mode, |
2143 | tree type ATTRIBUTE_UNUSED, | |
2144 | int *pretend_size, | |
2145 | int second_time) | |
36a05131 | 2146 | { |
d5cc9181 JR |
2147 | CUMULATIVE_ARGS *cum = get_cumulative_args (cum_v); |
2148 | ||
36a05131 BS |
2149 | if (TARGET_DEBUG_ARG) |
2150 | fprintf (stderr, | |
2151 | "setup_vararg: words = %2d, mode = %4s, pretend_size = %d, second_time = %d\n", | |
2152 | *cum, GET_MODE_NAME (mode), *pretend_size, second_time); | |
2153 | } | |
2154 | ||
2155 | \f | |
b88cf82e | 2156 | /* Worker function for TARGET_EXPAND_BUILTIN_SAVEREGS. */ |
36a05131 | 2157 | |
8ac411c7 | 2158 | static rtx |
f2206911 | 2159 | frv_expand_builtin_saveregs (void) |
36a05131 BS |
2160 | { |
2161 | int offset = UNITS_PER_WORD * FRV_NUM_ARG_REGS; | |
2162 | ||
2163 | if (TARGET_DEBUG_ARG) | |
2164 | fprintf (stderr, "expand_builtin_saveregs: offset from ap = %d\n", | |
2165 | offset); | |
2166 | ||
f1c25d3b | 2167 | return gen_rtx_PLUS (Pmode, virtual_incoming_args_rtx, GEN_INT (- offset)); |
36a05131 BS |
2168 | } |
2169 | ||
2170 | \f | |
2171 | /* Expand __builtin_va_start to do the va_start macro. */ | |
2172 | ||
d7bd8aeb | 2173 | static void |
f2206911 | 2174 | frv_expand_builtin_va_start (tree valist, rtx nextarg) |
36a05131 BS |
2175 | { |
2176 | tree t; | |
7dd68986 | 2177 | int num = crtl->args.info - FIRST_ARG_REGNUM - FRV_NUM_ARG_REGS; |
36a05131 BS |
2178 | |
2179 | nextarg = gen_rtx_PLUS (Pmode, virtual_incoming_args_rtx, | |
2180 | GEN_INT (UNITS_PER_WORD * num)); | |
2181 | ||
2182 | if (TARGET_DEBUG_ARG) | |
2183 | { | |
2184 | fprintf (stderr, "va_start: args_info = %d, num = %d\n", | |
7dd68986 | 2185 | crtl->args.info, num); |
36a05131 BS |
2186 | |
2187 | debug_rtx (nextarg); | |
2188 | } | |
2189 | ||
726a989a | 2190 | t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, |
5be014d5 AP |
2191 | fold_convert (TREE_TYPE (valist), |
2192 | make_tree (sizetype, nextarg))); | |
36a05131 BS |
2193 | TREE_SIDE_EFFECTS (t) = 1; |
2194 | ||
2195 | expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
2196 | } | |
2197 | ||
36a05131 BS |
2198 | \f |
2199 | /* Expand a block move operation, and return 1 if successful. Return 0 | |
2200 | if we should let the compiler generate normal code. | |
2201 | ||
2202 | operands[0] is the destination | |
2203 | operands[1] is the source | |
2204 | operands[2] is the length | |
2205 | operands[3] is the alignment */ | |
2206 | ||
2207 | /* Maximum number of loads to do before doing the stores */ | |
2208 | #ifndef MAX_MOVE_REG | |
2209 | #define MAX_MOVE_REG 4 | |
2210 | #endif | |
2211 | ||
2212 | /* Maximum number of total loads to do. */ | |
2213 | #ifndef TOTAL_MOVE_REG | |
2214 | #define TOTAL_MOVE_REG 8 | |
2215 | #endif | |
2216 | ||
2217 | int | |
f2206911 | 2218 | frv_expand_block_move (rtx operands[]) |
36a05131 BS |
2219 | { |
2220 | rtx orig_dest = operands[0]; | |
2221 | rtx orig_src = operands[1]; | |
2222 | rtx bytes_rtx = operands[2]; | |
2223 | rtx align_rtx = operands[3]; | |
2224 | int constp = (GET_CODE (bytes_rtx) == CONST_INT); | |
2225 | int align; | |
2226 | int bytes; | |
2227 | int offset; | |
2228 | int num_reg; | |
2229 | int i; | |
2230 | rtx src_reg; | |
2231 | rtx dest_reg; | |
2232 | rtx src_addr; | |
2233 | rtx dest_addr; | |
2234 | rtx src_mem; | |
2235 | rtx dest_mem; | |
2236 | rtx tmp_reg; | |
2237 | rtx stores[MAX_MOVE_REG]; | |
2238 | int move_bytes; | |
2239 | enum machine_mode mode; | |
2240 | ||
87b483a1 | 2241 | /* If this is not a fixed size move, just call memcpy. */ |
36a05131 BS |
2242 | if (! constp) |
2243 | return FALSE; | |
2244 | ||
44e91694 NS |
2245 | /* This should be a fixed size alignment. */ |
2246 | gcc_assert (GET_CODE (align_rtx) == CONST_INT); | |
36a05131 BS |
2247 | |
2248 | align = INTVAL (align_rtx); | |
2249 | ||
2250 | /* Anything to move? */ | |
2251 | bytes = INTVAL (bytes_rtx); | |
2252 | if (bytes <= 0) | |
2253 | return TRUE; | |
2254 | ||
2255 | /* Don't support real large moves. */ | |
2256 | if (bytes > TOTAL_MOVE_REG*align) | |
2257 | return FALSE; | |
2258 | ||
2259 | /* Move the address into scratch registers. */ | |
2260 | dest_reg = copy_addr_to_reg (XEXP (orig_dest, 0)); | |
2261 | src_reg = copy_addr_to_reg (XEXP (orig_src, 0)); | |
2262 | ||
2263 | num_reg = offset = 0; | |
2264 | for ( ; bytes > 0; (bytes -= move_bytes), (offset += move_bytes)) | |
2265 | { | |
87b483a1 | 2266 | /* Calculate the correct offset for src/dest. */ |
36a05131 BS |
2267 | if (offset == 0) |
2268 | { | |
2269 | src_addr = src_reg; | |
2270 | dest_addr = dest_reg; | |
2271 | } | |
2272 | else | |
2273 | { | |
0a81f074 RS |
2274 | src_addr = plus_constant (Pmode, src_reg, offset); |
2275 | dest_addr = plus_constant (Pmode, dest_reg, offset); | |
36a05131 BS |
2276 | } |
2277 | ||
2278 | /* Generate the appropriate load and store, saving the stores | |
2279 | for later. */ | |
2280 | if (bytes >= 4 && align >= 4) | |
2281 | mode = SImode; | |
2282 | else if (bytes >= 2 && align >= 2) | |
2283 | mode = HImode; | |
2284 | else | |
2285 | mode = QImode; | |
2286 | ||
2287 | move_bytes = GET_MODE_SIZE (mode); | |
2288 | tmp_reg = gen_reg_rtx (mode); | |
2289 | src_mem = change_address (orig_src, mode, src_addr); | |
2290 | dest_mem = change_address (orig_dest, mode, dest_addr); | |
2291 | emit_insn (gen_rtx_SET (VOIDmode, tmp_reg, src_mem)); | |
2292 | stores[num_reg++] = gen_rtx_SET (VOIDmode, dest_mem, tmp_reg); | |
2293 | ||
2294 | if (num_reg >= MAX_MOVE_REG) | |
2295 | { | |
2296 | for (i = 0; i < num_reg; i++) | |
2297 | emit_insn (stores[i]); | |
2298 | num_reg = 0; | |
2299 | } | |
2300 | } | |
2301 | ||
2302 | for (i = 0; i < num_reg; i++) | |
2303 | emit_insn (stores[i]); | |
2304 | ||
2305 | return TRUE; | |
2306 | } | |
2307 | ||
2308 | \f | |
2309 | /* Expand a block clear operation, and return 1 if successful. Return 0 | |
2310 | if we should let the compiler generate normal code. | |
2311 | ||
2312 | operands[0] is the destination | |
2313 | operands[1] is the length | |
57e84f18 | 2314 | operands[3] is the alignment */ |
36a05131 BS |
2315 | |
2316 | int | |
f2206911 | 2317 | frv_expand_block_clear (rtx operands[]) |
36a05131 BS |
2318 | { |
2319 | rtx orig_dest = operands[0]; | |
2320 | rtx bytes_rtx = operands[1]; | |
57e84f18 | 2321 | rtx align_rtx = operands[3]; |
36a05131 BS |
2322 | int constp = (GET_CODE (bytes_rtx) == CONST_INT); |
2323 | int align; | |
2324 | int bytes; | |
2325 | int offset; | |
36a05131 BS |
2326 | rtx dest_reg; |
2327 | rtx dest_addr; | |
2328 | rtx dest_mem; | |
2329 | int clear_bytes; | |
2330 | enum machine_mode mode; | |
2331 | ||
87b483a1 | 2332 | /* If this is not a fixed size move, just call memcpy. */ |
36a05131 BS |
2333 | if (! constp) |
2334 | return FALSE; | |
2335 | ||
44e91694 NS |
2336 | /* This should be a fixed size alignment. */ |
2337 | gcc_assert (GET_CODE (align_rtx) == CONST_INT); | |
36a05131 BS |
2338 | |
2339 | align = INTVAL (align_rtx); | |
2340 | ||
2341 | /* Anything to move? */ | |
2342 | bytes = INTVAL (bytes_rtx); | |
2343 | if (bytes <= 0) | |
2344 | return TRUE; | |
2345 | ||
2346 | /* Don't support real large clears. */ | |
2347 | if (bytes > TOTAL_MOVE_REG*align) | |
2348 | return FALSE; | |
2349 | ||
2350 | /* Move the address into a scratch register. */ | |
2351 | dest_reg = copy_addr_to_reg (XEXP (orig_dest, 0)); | |
2352 | ||
5c5e8419 | 2353 | offset = 0; |
36a05131 BS |
2354 | for ( ; bytes > 0; (bytes -= clear_bytes), (offset += clear_bytes)) |
2355 | { | |
87b483a1 | 2356 | /* Calculate the correct offset for src/dest. */ |
36a05131 BS |
2357 | dest_addr = ((offset == 0) |
2358 | ? dest_reg | |
0a81f074 | 2359 | : plus_constant (Pmode, dest_reg, offset)); |
36a05131 | 2360 | |
87b483a1 | 2361 | /* Generate the appropriate store of gr0. */ |
36a05131 BS |
2362 | if (bytes >= 4 && align >= 4) |
2363 | mode = SImode; | |
2364 | else if (bytes >= 2 && align >= 2) | |
2365 | mode = HImode; | |
2366 | else | |
2367 | mode = QImode; | |
2368 | ||
2369 | clear_bytes = GET_MODE_SIZE (mode); | |
2370 | dest_mem = change_address (orig_dest, mode, dest_addr); | |
2371 | emit_insn (gen_rtx_SET (VOIDmode, dest_mem, const0_rtx)); | |
2372 | } | |
2373 | ||
2374 | return TRUE; | |
2375 | } | |
2376 | ||
2377 | \f | |
2378 | /* The following variable is used to output modifiers of assembler | |
87b483a1 | 2379 | code of the current output insn. */ |
36a05131 BS |
2380 | |
2381 | static rtx *frv_insn_operands; | |
2382 | ||
2383 | /* The following function is used to add assembler insn code suffix .p | |
87b483a1 | 2384 | if it is necessary. */ |
36a05131 BS |
2385 | |
2386 | const char * | |
f2206911 | 2387 | frv_asm_output_opcode (FILE *f, const char *ptr) |
36a05131 BS |
2388 | { |
2389 | int c; | |
2390 | ||
c557edf4 | 2391 | if (frv_insn_packing_flag <= 0) |
36a05131 BS |
2392 | return ptr; |
2393 | ||
2394 | for (; *ptr && *ptr != ' ' && *ptr != '\t';) | |
2395 | { | |
2396 | c = *ptr++; | |
2397 | if (c == '%' && ((*ptr >= 'a' && *ptr <= 'z') | |
2398 | || (*ptr >= 'A' && *ptr <= 'Z'))) | |
2399 | { | |
2400 | int letter = *ptr++; | |
2401 | ||
2402 | c = atoi (ptr); | |
2403 | frv_print_operand (f, frv_insn_operands [c], letter); | |
2404 | while ((c = *ptr) >= '0' && c <= '9') | |
2405 | ptr++; | |
2406 | } | |
2407 | else | |
2408 | fputc (c, f); | |
2409 | } | |
2410 | ||
c557edf4 | 2411 | fprintf (f, ".p"); |
36a05131 BS |
2412 | |
2413 | return ptr; | |
2414 | } | |
2415 | ||
c557edf4 RS |
2416 | /* Set up the packing bit for the current output insn. Note that this |
2417 | function is not called for asm insns. */ | |
36a05131 BS |
2418 | |
2419 | void | |
c557edf4 RS |
2420 | frv_final_prescan_insn (rtx insn, rtx *opvec, |
2421 | int noperands ATTRIBUTE_UNUSED) | |
36a05131 | 2422 | { |
c557edf4 | 2423 | if (INSN_P (insn)) |
36a05131 | 2424 | { |
c557edf4 RS |
2425 | if (frv_insn_packing_flag >= 0) |
2426 | { | |
2427 | frv_insn_operands = opvec; | |
2428 | frv_insn_packing_flag = PACKING_FLAG_P (insn); | |
2429 | } | |
2430 | else if (recog_memoized (insn) >= 0 | |
2431 | && get_attr_acc_group (insn) == ACC_GROUP_ODD) | |
2432 | /* Packing optimizations have been disabled, but INSN can only | |
2433 | be issued in M1. Insert an mnop in M0. */ | |
2434 | fprintf (asm_out_file, "\tmnop.p\n"); | |
36a05131 | 2435 | } |
36a05131 BS |
2436 | } |
2437 | ||
2438 | ||
2439 | \f | |
2440 | /* A C expression whose value is RTL representing the address in a stack frame | |
2441 | where the pointer to the caller's frame is stored. Assume that FRAMEADDR is | |
2442 | an RTL expression for the address of the stack frame itself. | |
2443 | ||
2444 | If you don't define this macro, the default is to return the value of | |
2445 | FRAMEADDR--that is, the stack frame address is also the address of the stack | |
2446 | word that points to the previous frame. */ | |
2447 | ||
2448 | /* The default is correct, but we need to make sure the frame gets created. */ | |
2449 | rtx | |
f2206911 | 2450 | frv_dynamic_chain_address (rtx frame) |
36a05131 BS |
2451 | { |
2452 | cfun->machine->frame_needed = 1; | |
2453 | return frame; | |
2454 | } | |
2455 | ||
2456 | ||
2457 | /* A C expression whose value is RTL representing the value of the return | |
2458 | address for the frame COUNT steps up from the current frame, after the | |
2459 | prologue. FRAMEADDR is the frame pointer of the COUNT frame, or the frame | |
2460 | pointer of the COUNT - 1 frame if `RETURN_ADDR_IN_PREVIOUS_FRAME' is | |
2461 | defined. | |
2462 | ||
2463 | The value of the expression must always be the correct address when COUNT is | |
2464 | zero, but may be `NULL_RTX' if there is not way to determine the return | |
2465 | address of other frames. */ | |
2466 | ||
2467 | rtx | |
34208acf | 2468 | frv_return_addr_rtx (int count, rtx frame) |
36a05131 | 2469 | { |
34208acf AO |
2470 | if (count != 0) |
2471 | return const0_rtx; | |
36a05131 | 2472 | cfun->machine->frame_needed = 1; |
0a81f074 | 2473 | return gen_rtx_MEM (Pmode, plus_constant (Pmode, frame, 8)); |
36a05131 BS |
2474 | } |
2475 | ||
2476 | /* Given a memory reference MEMREF, interpret the referenced memory as | |
2477 | an array of MODE values, and return a reference to the element | |
2478 | specified by INDEX. Assume that any pre-modification implicit in | |
2479 | MEMREF has already happened. | |
2480 | ||
2481 | MEMREF must be a legitimate operand for modes larger than SImode. | |
c6c3dba9 | 2482 | frv_legitimate_address_p forbids register+register addresses, which |
36a05131 BS |
2483 | this function cannot handle. */ |
2484 | rtx | |
f2206911 | 2485 | frv_index_memory (rtx memref, enum machine_mode mode, int index) |
36a05131 BS |
2486 | { |
2487 | rtx base = XEXP (memref, 0); | |
2488 | if (GET_CODE (base) == PRE_MODIFY) | |
2489 | base = XEXP (base, 0); | |
2490 | return change_address (memref, mode, | |
0a81f074 RS |
2491 | plus_constant (Pmode, base, |
2492 | index * GET_MODE_SIZE (mode))); | |
36a05131 BS |
2493 | } |
2494 | ||
2495 | \f | |
2496 | /* Print a memory address as an operand to reference that memory location. */ | |
0fb30cb7 | 2497 | static void |
f2206911 | 2498 | frv_print_operand_address (FILE * stream, rtx x) |
36a05131 BS |
2499 | { |
2500 | if (GET_CODE (x) == MEM) | |
2501 | x = XEXP (x, 0); | |
2502 | ||
2503 | switch (GET_CODE (x)) | |
2504 | { | |
2505 | case REG: | |
2506 | fputs (reg_names [ REGNO (x)], stream); | |
2507 | return; | |
2508 | ||
2509 | case CONST_INT: | |
2510 | fprintf (stream, "%ld", (long) INTVAL (x)); | |
2511 | return; | |
2512 | ||
2513 | case SYMBOL_REF: | |
2514 | assemble_name (stream, XSTR (x, 0)); | |
2515 | return; | |
2516 | ||
2517 | case LABEL_REF: | |
2518 | case CONST: | |
2519 | output_addr_const (stream, x); | |
2520 | return; | |
2521 | ||
8d8256c1 NC |
2522 | case PLUS: |
2523 | /* Poorly constructed asm statements can trigger this alternative. | |
2524 | See gcc/testsuite/gcc.dg/asm-4.c for an example. */ | |
2525 | frv_print_operand_memory_reference (stream, x, 0); | |
2526 | return; | |
2527 | ||
36a05131 BS |
2528 | default: |
2529 | break; | |
2530 | } | |
2531 | ||
ab532386 | 2532 | fatal_insn ("bad insn to frv_print_operand_address:", x); |
36a05131 BS |
2533 | } |
2534 | ||
2535 | \f | |
2536 | static void | |
f2206911 | 2537 | frv_print_operand_memory_reference_reg (FILE * stream, rtx x) |
36a05131 BS |
2538 | { |
2539 | int regno = true_regnum (x); | |
2540 | if (GPR_P (regno)) | |
2541 | fputs (reg_names[regno], stream); | |
2542 | else | |
ab532386 | 2543 | fatal_insn ("bad register to frv_print_operand_memory_reference_reg:", x); |
36a05131 BS |
2544 | } |
2545 | ||
2546 | /* Print a memory reference suitable for the ld/st instructions. */ | |
2547 | ||
2548 | static void | |
f2206911 | 2549 | frv_print_operand_memory_reference (FILE * stream, rtx x, int addr_offset) |
36a05131 | 2550 | { |
34208acf | 2551 | struct frv_unspec unspec; |
36a05131 BS |
2552 | rtx x0 = NULL_RTX; |
2553 | rtx x1 = NULL_RTX; | |
2554 | ||
2555 | switch (GET_CODE (x)) | |
2556 | { | |
2557 | case SUBREG: | |
2558 | case REG: | |
2559 | x0 = x; | |
2560 | break; | |
2561 | ||
2562 | case PRE_MODIFY: /* (pre_modify (reg) (plus (reg) (reg))) */ | |
2563 | x0 = XEXP (x, 0); | |
2564 | x1 = XEXP (XEXP (x, 1), 1); | |
2565 | break; | |
2566 | ||
2567 | case CONST_INT: | |
2568 | x1 = x; | |
2569 | break; | |
2570 | ||
2571 | case PLUS: | |
2572 | x0 = XEXP (x, 0); | |
2573 | x1 = XEXP (x, 1); | |
2574 | if (GET_CODE (x0) == CONST_INT) | |
2575 | { | |
2576 | x0 = XEXP (x, 1); | |
2577 | x1 = XEXP (x, 0); | |
2578 | } | |
2579 | break; | |
2580 | ||
2581 | default: | |
ab532386 | 2582 | fatal_insn ("bad insn to frv_print_operand_memory_reference:", x); |
36a05131 BS |
2583 | break; |
2584 | ||
2585 | } | |
2586 | ||
2587 | if (addr_offset) | |
2588 | { | |
2589 | if (!x1) | |
2590 | x1 = const0_rtx; | |
2591 | else if (GET_CODE (x1) != CONST_INT) | |
ab532386 | 2592 | fatal_insn ("bad insn to frv_print_operand_memory_reference:", x); |
36a05131 BS |
2593 | } |
2594 | ||
2595 | fputs ("@(", stream); | |
2596 | if (!x0) | |
2597 | fputs (reg_names[GPR_R0], stream); | |
2598 | else if (GET_CODE (x0) == REG || GET_CODE (x0) == SUBREG) | |
2599 | frv_print_operand_memory_reference_reg (stream, x0); | |
2600 | else | |
ab532386 | 2601 | fatal_insn ("bad insn to frv_print_operand_memory_reference:", x); |
36a05131 BS |
2602 | |
2603 | fputs (",", stream); | |
2604 | if (!x1) | |
2605 | fputs (reg_names [GPR_R0], stream); | |
2606 | ||
2607 | else | |
2608 | { | |
2609 | switch (GET_CODE (x1)) | |
2610 | { | |
2611 | case SUBREG: | |
2612 | case REG: | |
2613 | frv_print_operand_memory_reference_reg (stream, x1); | |
2614 | break; | |
2615 | ||
2616 | case CONST_INT: | |
2617 | fprintf (stream, "%ld", (long) (INTVAL (x1) + addr_offset)); | |
2618 | break; | |
2619 | ||
36a05131 | 2620 | case CONST: |
34208acf | 2621 | if (!frv_const_unspec_p (x1, &unspec)) |
ab532386 | 2622 | fatal_insn ("bad insn to frv_print_operand_memory_reference:", x1); |
34208acf | 2623 | frv_output_const_unspec (stream, &unspec); |
36a05131 BS |
2624 | break; |
2625 | ||
2626 | default: | |
ab532386 | 2627 | fatal_insn ("bad insn to frv_print_operand_memory_reference:", x); |
36a05131 BS |
2628 | } |
2629 | } | |
2630 | ||
2631 | fputs (")", stream); | |
2632 | } | |
2633 | ||
2634 | \f | |
2635 | /* Return 2 for likely branches and 0 for non-likely branches */ | |
2636 | ||
2637 | #define FRV_JUMP_LIKELY 2 | |
2638 | #define FRV_JUMP_NOT_LIKELY 0 | |
2639 | ||
2640 | static int | |
f2206911 | 2641 | frv_print_operand_jump_hint (rtx insn) |
36a05131 BS |
2642 | { |
2643 | rtx note; | |
2644 | rtx labelref; | |
2645 | int ret; | |
2646 | HOST_WIDE_INT prob = -1; | |
2647 | enum { UNKNOWN, BACKWARD, FORWARD } jump_type = UNKNOWN; | |
2648 | ||
b64925dc | 2649 | gcc_assert (JUMP_P (insn)); |
36a05131 BS |
2650 | |
2651 | /* Assume any non-conditional jump is likely. */ | |
2652 | if (! any_condjump_p (insn)) | |
2653 | ret = FRV_JUMP_LIKELY; | |
2654 | ||
2655 | else | |
2656 | { | |
2657 | labelref = condjump_label (insn); | |
2658 | if (labelref) | |
2659 | { | |
2660 | rtx label = XEXP (labelref, 0); | |
2661 | jump_type = (insn_current_address > INSN_ADDRESSES (INSN_UID (label)) | |
2662 | ? BACKWARD | |
2663 | : FORWARD); | |
2664 | } | |
2665 | ||
2666 | note = find_reg_note (insn, REG_BR_PROB, 0); | |
2667 | if (!note) | |
2668 | ret = ((jump_type == BACKWARD) ? FRV_JUMP_LIKELY : FRV_JUMP_NOT_LIKELY); | |
2669 | ||
2670 | else | |
2671 | { | |
2672 | prob = INTVAL (XEXP (note, 0)); | |
2673 | ret = ((prob >= (REG_BR_PROB_BASE / 2)) | |
2674 | ? FRV_JUMP_LIKELY | |
2675 | : FRV_JUMP_NOT_LIKELY); | |
2676 | } | |
2677 | } | |
2678 | ||
2679 | #if 0 | |
2680 | if (TARGET_DEBUG) | |
2681 | { | |
2682 | char *direction; | |
2683 | ||
2684 | switch (jump_type) | |
2685 | { | |
2686 | default: | |
2687 | case UNKNOWN: direction = "unknown jump direction"; break; | |
2688 | case BACKWARD: direction = "jump backward"; break; | |
2689 | case FORWARD: direction = "jump forward"; break; | |
2690 | } | |
2691 | ||
2692 | fprintf (stderr, | |
2693 | "%s: uid %ld, %s, probability = %ld, max prob. = %ld, hint = %d\n", | |
2694 | IDENTIFIER_POINTER (DECL_NAME (current_function_decl)), | |
2695 | (long)INSN_UID (insn), direction, (long)prob, | |
2696 | (long)REG_BR_PROB_BASE, ret); | |
2697 | } | |
2698 | #endif | |
2699 | ||
2700 | return ret; | |
2701 | } | |
2702 | ||
2703 | \f | |
036ff63f RS |
2704 | /* Return the comparison operator to use for CODE given that the ICC |
2705 | register is OP0. */ | |
2706 | ||
2707 | static const char * | |
2708 | comparison_string (enum rtx_code code, rtx op0) | |
2709 | { | |
2710 | bool is_nz_p = GET_MODE (op0) == CC_NZmode; | |
2711 | switch (code) | |
2712 | { | |
2713 | default: output_operand_lossage ("bad condition code"); | |
2714 | case EQ: return "eq"; | |
2715 | case NE: return "ne"; | |
2716 | case LT: return is_nz_p ? "n" : "lt"; | |
2717 | case LE: return "le"; | |
2718 | case GT: return "gt"; | |
2719 | case GE: return is_nz_p ? "p" : "ge"; | |
2720 | case LTU: return is_nz_p ? "no" : "c"; | |
2721 | case LEU: return is_nz_p ? "eq" : "ls"; | |
2722 | case GTU: return is_nz_p ? "ne" : "hi"; | |
2723 | case GEU: return is_nz_p ? "ra" : "nc"; | |
2724 | } | |
2725 | } | |
2726 | ||
43aa4e05 | 2727 | /* Print an operand to an assembler instruction. |
36a05131 BS |
2728 | |
2729 | `%' followed by a letter and a digit says to output an operand in an | |
0fb30cb7 NF |
2730 | alternate fashion. Four letters have standard, built-in meanings |
2731 | described below. The hook `TARGET_PRINT_OPERAND' can define | |
2732 | additional letters with nonstandard meanings. | |
36a05131 BS |
2733 | |
2734 | `%cDIGIT' can be used to substitute an operand that is a constant value | |
2735 | without the syntax that normally indicates an immediate operand. | |
2736 | ||
2737 | `%nDIGIT' is like `%cDIGIT' except that the value of the constant is negated | |
2738 | before printing. | |
2739 | ||
2740 | `%aDIGIT' can be used to substitute an operand as if it were a memory | |
2741 | reference, with the actual operand treated as the address. This may be | |
2742 | useful when outputting a "load address" instruction, because often the | |
2743 | assembler syntax for such an instruction requires you to write the operand | |
2744 | as if it were a memory reference. | |
2745 | ||
2746 | `%lDIGIT' is used to substitute a `label_ref' into a jump instruction. | |
2747 | ||
2748 | `%=' outputs a number which is unique to each instruction in the entire | |
2749 | compilation. This is useful for making local labels to be referred to more | |
2750 | than once in a single template that generates multiple assembler | |
2751 | instructions. | |
2752 | ||
0fb30cb7 NF |
2753 | `%' followed by a punctuation character specifies a substitution that |
2754 | does not use an operand. Only one case is standard: `%%' outputs a | |
2755 | `%' into the assembler code. Other nonstandard cases can be defined | |
2756 | in the `TARGET_PRINT_OPERAND' hook. You must also define which | |
2757 | punctuation characters are valid with the | |
2758 | `TARGET_PRINT_OPERAND_PUNCT_VALID_P' hook. */ | |
36a05131 | 2759 | |
0fb30cb7 | 2760 | static void |
f2206911 | 2761 | frv_print_operand (FILE * file, rtx x, int code) |
36a05131 | 2762 | { |
34208acf | 2763 | struct frv_unspec unspec; |
36a05131 BS |
2764 | HOST_WIDE_INT value; |
2765 | int offset; | |
2766 | ||
0a2aaacc | 2767 | if (code != 0 && !ISALPHA (code)) |
36a05131 BS |
2768 | value = 0; |
2769 | ||
2770 | else if (GET_CODE (x) == CONST_INT) | |
2771 | value = INTVAL (x); | |
2772 | ||
2773 | else if (GET_CODE (x) == CONST_DOUBLE) | |
2774 | { | |
2775 | if (GET_MODE (x) == SFmode) | |
2776 | { | |
2777 | REAL_VALUE_TYPE rv; | |
2778 | long l; | |
2779 | ||
2780 | REAL_VALUE_FROM_CONST_DOUBLE (rv, x); | |
2781 | REAL_VALUE_TO_TARGET_SINGLE (rv, l); | |
2782 | value = l; | |
2783 | } | |
2784 | ||
2785 | else if (GET_MODE (x) == VOIDmode) | |
2786 | value = CONST_DOUBLE_LOW (x); | |
2787 | ||
2788 | else | |
ab532386 | 2789 | fatal_insn ("bad insn in frv_print_operand, bad const_double", x); |
36a05131 BS |
2790 | } |
2791 | ||
2792 | else | |
2793 | value = 0; | |
2794 | ||
2795 | switch (code) | |
2796 | { | |
2797 | ||
2798 | case '.': | |
87b483a1 | 2799 | /* Output r0. */ |
36a05131 BS |
2800 | fputs (reg_names[GPR_R0], file); |
2801 | break; | |
2802 | ||
2803 | case '#': | |
2804 | fprintf (file, "%d", frv_print_operand_jump_hint (current_output_insn)); | |
2805 | break; | |
2806 | ||
0f6e5d45 | 2807 | case '@': |
87b483a1 | 2808 | /* Output small data area base register (gr16). */ |
36a05131 BS |
2809 | fputs (reg_names[SDA_BASE_REG], file); |
2810 | break; | |
2811 | ||
2812 | case '~': | |
87b483a1 | 2813 | /* Output pic register (gr17). */ |
36a05131 BS |
2814 | fputs (reg_names[PIC_REGNO], file); |
2815 | break; | |
2816 | ||
2817 | case '*': | |
87b483a1 | 2818 | /* Output the temporary integer CCR register. */ |
36a05131 BS |
2819 | fputs (reg_names[ICR_TEMP], file); |
2820 | break; | |
2821 | ||
2822 | case '&': | |
87b483a1 | 2823 | /* Output the temporary integer CC register. */ |
36a05131 BS |
2824 | fputs (reg_names[ICC_TEMP], file); |
2825 | break; | |
2826 | ||
87b483a1 | 2827 | /* case 'a': print an address. */ |
36a05131 BS |
2828 | |
2829 | case 'C': | |
87b483a1 | 2830 | /* Print appropriate test for integer branch false operation. */ |
036ff63f RS |
2831 | fputs (comparison_string (reverse_condition (GET_CODE (x)), |
2832 | XEXP (x, 0)), file); | |
36a05131 BS |
2833 | break; |
2834 | ||
36a05131 | 2835 | case 'c': |
87b483a1 | 2836 | /* Print appropriate test for integer branch true operation. */ |
036ff63f | 2837 | fputs (comparison_string (GET_CODE (x), XEXP (x, 0)), file); |
36a05131 BS |
2838 | break; |
2839 | ||
2840 | case 'e': | |
2841 | /* Print 1 for a NE and 0 for an EQ to give the final argument | |
2842 | for a conditional instruction. */ | |
2843 | if (GET_CODE (x) == NE) | |
2844 | fputs ("1", file); | |
2845 | ||
2846 | else if (GET_CODE (x) == EQ) | |
2847 | fputs ("0", file); | |
2848 | ||
2849 | else | |
ab532386 | 2850 | fatal_insn ("bad insn to frv_print_operand, 'e' modifier:", x); |
36a05131 BS |
2851 | break; |
2852 | ||
2853 | case 'F': | |
87b483a1 | 2854 | /* Print appropriate test for floating point branch false operation. */ |
36a05131 BS |
2855 | switch (GET_CODE (x)) |
2856 | { | |
2857 | default: | |
ab532386 | 2858 | fatal_insn ("bad insn to frv_print_operand, 'F' modifier:", x); |
36a05131 BS |
2859 | |
2860 | case EQ: fputs ("ne", file); break; | |
2861 | case NE: fputs ("eq", file); break; | |
2862 | case LT: fputs ("uge", file); break; | |
2863 | case LE: fputs ("ug", file); break; | |
2864 | case GT: fputs ("ule", file); break; | |
2865 | case GE: fputs ("ul", file); break; | |
2866 | } | |
2867 | break; | |
2868 | ||
2869 | case 'f': | |
87b483a1 | 2870 | /* Print appropriate test for floating point branch true operation. */ |
36a05131 BS |
2871 | switch (GET_CODE (x)) |
2872 | { | |
2873 | default: | |
ab532386 | 2874 | fatal_insn ("bad insn to frv_print_operand, 'f' modifier:", x); |
36a05131 BS |
2875 | |
2876 | case EQ: fputs ("eq", file); break; | |
2877 | case NE: fputs ("ne", file); break; | |
2878 | case LT: fputs ("lt", file); break; | |
2879 | case LE: fputs ("le", file); break; | |
2880 | case GT: fputs ("gt", file); break; | |
2881 | case GE: fputs ("ge", file); break; | |
2882 | } | |
2883 | break; | |
2884 | ||
34208acf AO |
2885 | case 'g': |
2886 | /* Print appropriate GOT function. */ | |
2887 | if (GET_CODE (x) != CONST_INT) | |
ab532386 | 2888 | fatal_insn ("bad insn to frv_print_operand, 'g' modifier:", x); |
34208acf AO |
2889 | fputs (unspec_got_name (INTVAL (x)), file); |
2890 | break; | |
2891 | ||
36a05131 BS |
2892 | case 'I': |
2893 | /* Print 'i' if the operand is a constant, or is a memory reference that | |
87b483a1 | 2894 | adds a constant. */ |
36a05131 BS |
2895 | if (GET_CODE (x) == MEM) |
2896 | x = ((GET_CODE (XEXP (x, 0)) == PLUS) | |
2897 | ? XEXP (XEXP (x, 0), 1) | |
2898 | : XEXP (x, 0)); | |
34208acf AO |
2899 | else if (GET_CODE (x) == PLUS) |
2900 | x = XEXP (x, 1); | |
36a05131 BS |
2901 | |
2902 | switch (GET_CODE (x)) | |
2903 | { | |
2904 | default: | |
2905 | break; | |
2906 | ||
2907 | case CONST_INT: | |
2908 | case SYMBOL_REF: | |
2909 | case CONST: | |
2910 | fputs ("i", file); | |
2911 | break; | |
2912 | } | |
2913 | break; | |
2914 | ||
2915 | case 'i': | |
2916 | /* For jump instructions, print 'i' if the operand is a constant or | |
87b483a1 | 2917 | is an expression that adds a constant. */ |
36a05131 BS |
2918 | if (GET_CODE (x) == CONST_INT) |
2919 | fputs ("i", file); | |
2920 | ||
2921 | else | |
2922 | { | |
2923 | if (GET_CODE (x) == CONST_INT | |
2924 | || (GET_CODE (x) == PLUS | |
2925 | && (GET_CODE (XEXP (x, 1)) == CONST_INT | |
2926 | || GET_CODE (XEXP (x, 0)) == CONST_INT))) | |
2927 | fputs ("i", file); | |
2928 | } | |
2929 | break; | |
2930 | ||
2931 | case 'L': | |
2932 | /* Print the lower register of a double word register pair */ | |
2933 | if (GET_CODE (x) == REG) | |
2934 | fputs (reg_names[ REGNO (x)+1 ], file); | |
2935 | else | |
ab532386 | 2936 | fatal_insn ("bad insn to frv_print_operand, 'L' modifier:", x); |
36a05131 BS |
2937 | break; |
2938 | ||
87b483a1 | 2939 | /* case 'l': print a LABEL_REF. */ |
36a05131 BS |
2940 | |
2941 | case 'M': | |
2942 | case 'N': | |
2943 | /* Print a memory reference for ld/st/jmp, %N prints a memory reference | |
2944 | for the second word of double memory operations. */ | |
2945 | offset = (code == 'M') ? 0 : UNITS_PER_WORD; | |
2946 | switch (GET_CODE (x)) | |
2947 | { | |
2948 | default: | |
ab532386 | 2949 | fatal_insn ("bad insn to frv_print_operand, 'M/N' modifier:", x); |
36a05131 BS |
2950 | |
2951 | case MEM: | |
2952 | frv_print_operand_memory_reference (file, XEXP (x, 0), offset); | |
2953 | break; | |
2954 | ||
2955 | case REG: | |
2956 | case SUBREG: | |
2957 | case CONST_INT: | |
2958 | case PLUS: | |
2959 | case SYMBOL_REF: | |
2960 | frv_print_operand_memory_reference (file, x, offset); | |
2961 | break; | |
2962 | } | |
2963 | break; | |
2964 | ||
2965 | case 'O': | |
2966 | /* Print the opcode of a command. */ | |
2967 | switch (GET_CODE (x)) | |
2968 | { | |
2969 | default: | |
ab532386 | 2970 | fatal_insn ("bad insn to frv_print_operand, 'O' modifier:", x); |
36a05131 BS |
2971 | |
2972 | case PLUS: fputs ("add", file); break; | |
2973 | case MINUS: fputs ("sub", file); break; | |
2974 | case AND: fputs ("and", file); break; | |
2975 | case IOR: fputs ("or", file); break; | |
2976 | case XOR: fputs ("xor", file); break; | |
2977 | case ASHIFT: fputs ("sll", file); break; | |
2978 | case ASHIFTRT: fputs ("sra", file); break; | |
2979 | case LSHIFTRT: fputs ("srl", file); break; | |
2980 | } | |
2981 | break; | |
2982 | ||
87b483a1 | 2983 | /* case 'n': negate and print a constant int. */ |
36a05131 BS |
2984 | |
2985 | case 'P': | |
2986 | /* Print PIC label using operand as the number. */ | |
2987 | if (GET_CODE (x) != CONST_INT) | |
ab532386 | 2988 | fatal_insn ("bad insn to frv_print_operand, P modifier:", x); |
36a05131 BS |
2989 | |
2990 | fprintf (file, ".LCF%ld", (long)INTVAL (x)); | |
2991 | break; | |
2992 | ||
2993 | case 'U': | |
87b483a1 | 2994 | /* Print 'u' if the operand is a update load/store. */ |
36a05131 BS |
2995 | if (GET_CODE (x) == MEM && GET_CODE (XEXP (x, 0)) == PRE_MODIFY) |
2996 | fputs ("u", file); | |
2997 | break; | |
2998 | ||
2999 | case 'z': | |
87b483a1 | 3000 | /* If value is 0, print gr0, otherwise it must be a register. */ |
36a05131 BS |
3001 | if (GET_CODE (x) == CONST_INT && INTVAL (x) == 0) |
3002 | fputs (reg_names[GPR_R0], file); | |
3003 | ||
3004 | else if (GET_CODE (x) == REG) | |
3005 | fputs (reg_names [REGNO (x)], file); | |
3006 | ||
3007 | else | |
ab532386 | 3008 | fatal_insn ("bad insn in frv_print_operand, z case", x); |
36a05131 BS |
3009 | break; |
3010 | ||
3011 | case 'x': | |
87b483a1 | 3012 | /* Print constant in hex. */ |
36a05131 BS |
3013 | if (GET_CODE (x) == CONST_INT || GET_CODE (x) == CONST_DOUBLE) |
3014 | { | |
3015 | fprintf (file, "%s0x%.4lx", IMMEDIATE_PREFIX, (long) value); | |
3016 | break; | |
3017 | } | |
3018 | ||
87b483a1 | 3019 | /* Fall through. */ |
36a05131 BS |
3020 | |
3021 | case '\0': | |
3022 | if (GET_CODE (x) == REG) | |
3023 | fputs (reg_names [REGNO (x)], file); | |
3024 | ||
3025 | else if (GET_CODE (x) == CONST_INT | |
3026 | || GET_CODE (x) == CONST_DOUBLE) | |
3027 | fprintf (file, "%s%ld", IMMEDIATE_PREFIX, (long) value); | |
3028 | ||
34208acf AO |
3029 | else if (frv_const_unspec_p (x, &unspec)) |
3030 | frv_output_const_unspec (file, &unspec); | |
3031 | ||
36a05131 BS |
3032 | else if (GET_CODE (x) == MEM) |
3033 | frv_print_operand_address (file, XEXP (x, 0)); | |
3034 | ||
3035 | else if (CONSTANT_ADDRESS_P (x)) | |
3036 | frv_print_operand_address (file, x); | |
3037 | ||
3038 | else | |
ab532386 | 3039 | fatal_insn ("bad insn in frv_print_operand, 0 case", x); |
36a05131 BS |
3040 | |
3041 | break; | |
3042 | ||
3043 | default: | |
3044 | fatal_insn ("frv_print_operand: unknown code", x); | |
3045 | break; | |
3046 | } | |
3047 | ||
3048 | return; | |
3049 | } | |
3050 | ||
0fb30cb7 NF |
3051 | static bool |
3052 | frv_print_operand_punct_valid_p (unsigned char code) | |
3053 | { | |
3054 | return (code == '.' || code == '#' || code == '@' || code == '~' | |
3055 | || code == '*' || code == '&'); | |
3056 | } | |
3057 | ||
36a05131 BS |
3058 | \f |
3059 | /* A C statement (sans semicolon) for initializing the variable CUM for the | |
3060 | state at the beginning of the argument list. The variable has type | |
3061 | `CUMULATIVE_ARGS'. The value of FNTYPE is the tree node for the data type | |
3062 | of the function which will receive the args, or 0 if the args are to a | |
3063 | compiler support library function. The value of INDIRECT is nonzero when | |
3064 | processing an indirect call, for example a call through a function pointer. | |
3065 | The value of INDIRECT is zero for a call to an explicitly named function, a | |
3066 | library function call, or when `INIT_CUMULATIVE_ARGS' is used to find | |
3067 | arguments for the function being compiled. | |
3068 | ||
3069 | When processing a call to a compiler support library function, LIBNAME | |
3070 | identifies which one. It is a `symbol_ref' rtx which contains the name of | |
3071 | the function, as a string. LIBNAME is 0 when an ordinary C function call is | |
3072 | being processed. Thus, each time this macro is called, either LIBNAME or | |
3073 | FNTYPE is nonzero, but never both of them at once. */ | |
3074 | ||
3075 | void | |
f2206911 KC |
3076 | frv_init_cumulative_args (CUMULATIVE_ARGS *cum, |
3077 | tree fntype, | |
3078 | rtx libname, | |
3079 | tree fndecl, | |
3080 | int incoming) | |
36a05131 BS |
3081 | { |
3082 | *cum = FIRST_ARG_REGNUM; | |
3083 | ||
3084 | if (TARGET_DEBUG_ARG) | |
3085 | { | |
3086 | fprintf (stderr, "\ninit_cumulative_args:"); | |
563a317a | 3087 | if (!fndecl && fntype) |
36a05131 BS |
3088 | fputs (" indirect", stderr); |
3089 | ||
3090 | if (incoming) | |
3091 | fputs (" incoming", stderr); | |
3092 | ||
3093 | if (fntype) | |
3094 | { | |
3095 | tree ret_type = TREE_TYPE (fntype); | |
3096 | fprintf (stderr, " return=%s,", | |
3097 | tree_code_name[ (int)TREE_CODE (ret_type) ]); | |
3098 | } | |
3099 | ||
3100 | if (libname && GET_CODE (libname) == SYMBOL_REF) | |
3101 | fprintf (stderr, " libname=%s", XSTR (libname, 0)); | |
3102 | ||
3103 | if (cfun->returns_struct) | |
3104 | fprintf (stderr, " return-struct"); | |
3105 | ||
3106 | putc ('\n', stderr); | |
3107 | } | |
3108 | } | |
3109 | ||
3110 | \f | |
fe984136 RH |
3111 | /* Return true if we should pass an argument on the stack rather than |
3112 | in registers. */ | |
3113 | ||
3114 | static bool | |
586de218 | 3115 | frv_must_pass_in_stack (enum machine_mode mode, const_tree type) |
fe984136 RH |
3116 | { |
3117 | if (mode == BLKmode) | |
3118 | return true; | |
3119 | if (type == NULL) | |
3120 | return false; | |
3121 | return AGGREGATE_TYPE_P (type); | |
3122 | } | |
3123 | ||
36a05131 BS |
3124 | /* If defined, a C expression that gives the alignment boundary, in bits, of an |
3125 | argument with the specified mode and type. If it is not defined, | |
3126 | `PARM_BOUNDARY' is used for all arguments. */ | |
3127 | ||
c2ed6cf8 | 3128 | static unsigned int |
f2206911 | 3129 | frv_function_arg_boundary (enum machine_mode mode ATTRIBUTE_UNUSED, |
c2ed6cf8 | 3130 | const_tree type ATTRIBUTE_UNUSED) |
36a05131 BS |
3131 | { |
3132 | return BITS_PER_WORD; | |
3133 | } | |
3134 | ||
88a1f47f | 3135 | static rtx |
d5cc9181 | 3136 | frv_function_arg_1 (cumulative_args_t cum_v, enum machine_mode mode, |
88a1f47f NF |
3137 | const_tree type ATTRIBUTE_UNUSED, bool named, |
3138 | bool incoming ATTRIBUTE_UNUSED) | |
36a05131 | 3139 | { |
d5cc9181 JR |
3140 | const CUMULATIVE_ARGS *cum = get_cumulative_args (cum_v); |
3141 | ||
36a05131 BS |
3142 | enum machine_mode xmode = (mode == BLKmode) ? SImode : mode; |
3143 | int arg_num = *cum; | |
3144 | rtx ret; | |
3145 | const char *debstr; | |
3146 | ||
3147 | /* Return a marker for use in the call instruction. */ | |
3148 | if (xmode == VOIDmode) | |
3149 | { | |
3150 | ret = const0_rtx; | |
3151 | debstr = "<0>"; | |
3152 | } | |
3153 | ||
3154 | else if (arg_num <= LAST_ARG_REGNUM) | |
3155 | { | |
f1c25d3b | 3156 | ret = gen_rtx_REG (xmode, arg_num); |
36a05131 BS |
3157 | debstr = reg_names[arg_num]; |
3158 | } | |
3159 | ||
3160 | else | |
3161 | { | |
3162 | ret = NULL_RTX; | |
3163 | debstr = "memory"; | |
3164 | } | |
3165 | ||
3166 | if (TARGET_DEBUG_ARG) | |
3167 | fprintf (stderr, | |
3168 | "function_arg: words = %2d, mode = %4s, named = %d, size = %3d, arg = %s\n", | |
3169 | arg_num, GET_MODE_NAME (mode), named, GET_MODE_SIZE (mode), debstr); | |
3170 | ||
3171 | return ret; | |
3172 | } | |
3173 | ||
88a1f47f | 3174 | static rtx |
d5cc9181 | 3175 | frv_function_arg (cumulative_args_t cum, enum machine_mode mode, |
88a1f47f NF |
3176 | const_tree type, bool named) |
3177 | { | |
3178 | return frv_function_arg_1 (cum, mode, type, named, false); | |
3179 | } | |
3180 | ||
3181 | static rtx | |
d5cc9181 | 3182 | frv_function_incoming_arg (cumulative_args_t cum, enum machine_mode mode, |
88a1f47f NF |
3183 | const_tree type, bool named) |
3184 | { | |
3185 | return frv_function_arg_1 (cum, mode, type, named, true); | |
3186 | } | |
3187 | ||
36a05131 BS |
3188 | \f |
3189 | /* A C statement (sans semicolon) to update the summarizer variable CUM to | |
3190 | advance past an argument in the argument list. The values MODE, TYPE and | |
3191 | NAMED describe that argument. Once this is done, the variable CUM is | |
3192 | suitable for analyzing the *following* argument with `FUNCTION_ARG', etc. | |
3193 | ||
3194 | This macro need not do anything if the argument in question was passed on | |
3195 | the stack. The compiler knows how to track the amount of stack space used | |
3196 | for arguments without any special help. */ | |
3197 | ||
88a1f47f | 3198 | static void |
d5cc9181 | 3199 | frv_function_arg_advance (cumulative_args_t cum_v, |
f2206911 | 3200 | enum machine_mode mode, |
88a1f47f NF |
3201 | const_tree type ATTRIBUTE_UNUSED, |
3202 | bool named) | |
36a05131 | 3203 | { |
d5cc9181 JR |
3204 | CUMULATIVE_ARGS *cum = get_cumulative_args (cum_v); |
3205 | ||
36a05131 BS |
3206 | enum machine_mode xmode = (mode == BLKmode) ? SImode : mode; |
3207 | int bytes = GET_MODE_SIZE (xmode); | |
3208 | int words = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
3209 | int arg_num = *cum; | |
3210 | ||
3211 | *cum = arg_num + words; | |
3212 | ||
3213 | if (TARGET_DEBUG_ARG) | |
3214 | fprintf (stderr, | |
3215 | "function_adv: words = %2d, mode = %4s, named = %d, size = %3d\n", | |
3216 | arg_num, GET_MODE_NAME (mode), named, words * UNITS_PER_WORD); | |
3217 | } | |
3218 | ||
3219 | \f | |
3220 | /* A C expression for the number of words, at the beginning of an argument, | |
3221 | must be put in registers. The value must be zero for arguments that are | |
3222 | passed entirely in registers or that are entirely pushed on the stack. | |
3223 | ||
3224 | On some machines, certain arguments must be passed partially in registers | |
3225 | and partially in memory. On these machines, typically the first N words of | |
3226 | arguments are passed in registers, and the rest on the stack. If a | |
3227 | multi-word argument (a `double' or a structure) crosses that boundary, its | |
3228 | first few words must be passed in registers and the rest must be pushed. | |
3229 | This macro tells the compiler when this occurs, and how many of the words | |
3230 | should go in registers. | |
3231 | ||
3232 | `FUNCTION_ARG' for these arguments should return the first register to be | |
3233 | used by the caller for this argument; likewise `FUNCTION_INCOMING_ARG', for | |
3234 | the called function. */ | |
3235 | ||
78a52f11 | 3236 | static int |
d5cc9181 | 3237 | frv_arg_partial_bytes (cumulative_args_t cum, enum machine_mode mode, |
78a52f11 | 3238 | tree type ATTRIBUTE_UNUSED, bool named ATTRIBUTE_UNUSED) |
36a05131 | 3239 | { |
d5cc9181 | 3240 | |
36a05131 BS |
3241 | enum machine_mode xmode = (mode == BLKmode) ? SImode : mode; |
3242 | int bytes = GET_MODE_SIZE (xmode); | |
3243 | int words = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
d5cc9181 | 3244 | int arg_num = *get_cumulative_args (cum); |
36a05131 BS |
3245 | int ret; |
3246 | ||
3247 | ret = ((arg_num <= LAST_ARG_REGNUM && arg_num + words > LAST_ARG_REGNUM+1) | |
3248 | ? LAST_ARG_REGNUM - arg_num + 1 | |
3249 | : 0); | |
78a52f11 | 3250 | ret *= UNITS_PER_WORD; |
36a05131 BS |
3251 | |
3252 | if (TARGET_DEBUG_ARG && ret) | |
78a52f11 | 3253 | fprintf (stderr, "frv_arg_partial_bytes: %d\n", ret); |
36a05131 BS |
3254 | |
3255 | return ret; | |
36a05131 BS |
3256 | } |
3257 | ||
219d92a4 AS |
3258 | \f |
3259 | /* Implements TARGET_FUNCTION_VALUE. */ | |
3260 | ||
3261 | static rtx | |
3262 | frv_function_value (const_tree valtype, | |
3263 | const_tree fn_decl_or_type ATTRIBUTE_UNUSED, | |
3264 | bool outgoing ATTRIBUTE_UNUSED) | |
3265 | { | |
3266 | return gen_rtx_REG (TYPE_MODE (valtype), RETURN_VALUE_REGNUM); | |
3267 | } | |
3268 | ||
3269 | \f | |
3270 | /* Implements TARGET_LIBCALL_VALUE. */ | |
3271 | ||
3272 | static rtx | |
3273 | frv_libcall_value (enum machine_mode mode, | |
3274 | const_rtx fun ATTRIBUTE_UNUSED) | |
3275 | { | |
3276 | return gen_rtx_REG (mode, RETURN_VALUE_REGNUM); | |
3277 | } | |
3278 | ||
3279 | \f | |
3280 | /* Implements FUNCTION_VALUE_REGNO_P. */ | |
3281 | ||
3282 | bool | |
3283 | frv_function_value_regno_p (const unsigned int regno) | |
3284 | { | |
3285 | return (regno == RETURN_VALUE_REGNUM); | |
3286 | } | |
36a05131 BS |
3287 | \f |
3288 | /* Return true if a register is ok to use as a base or index register. */ | |
3289 | ||
3290 | static FRV_INLINE int | |
f2206911 | 3291 | frv_regno_ok_for_base_p (int regno, int strict_p) |
36a05131 BS |
3292 | { |
3293 | if (GPR_P (regno)) | |
3294 | return TRUE; | |
3295 | ||
3296 | if (strict_p) | |
3297 | return (reg_renumber[regno] >= 0 && GPR_P (reg_renumber[regno])); | |
3298 | ||
3299 | if (regno == ARG_POINTER_REGNUM) | |
3300 | return TRUE; | |
3301 | ||
3302 | return (regno >= FIRST_PSEUDO_REGISTER); | |
3303 | } | |
3304 | ||
3305 | \f | |
3306 | /* A C compound statement with a conditional `goto LABEL;' executed if X (an | |
3307 | RTX) is a legitimate memory address on the target machine for a memory | |
3308 | operand of mode MODE. | |
3309 | ||
3310 | It usually pays to define several simpler macros to serve as subroutines for | |
3311 | this one. Otherwise it may be too complicated to understand. | |
3312 | ||
3313 | This macro must exist in two variants: a strict variant and a non-strict | |
3314 | one. The strict variant is used in the reload pass. It must be defined so | |
3315 | that any pseudo-register that has not been allocated a hard register is | |
3316 | considered a memory reference. In contexts where some kind of register is | |
3317 | required, a pseudo-register with no hard register must be rejected. | |
3318 | ||
3319 | The non-strict variant is used in other passes. It must be defined to | |
3320 | accept all pseudo-registers in every context where some kind of register is | |
3321 | required. | |
3322 | ||
3323 | Compiler source files that want to use the strict variant of this macro | |
3324 | define the macro `REG_OK_STRICT'. You should use an `#ifdef REG_OK_STRICT' | |
3325 | conditional to define the strict variant in that case and the non-strict | |
3326 | variant otherwise. | |
3327 | ||
36a05131 BS |
3328 | Normally, constant addresses which are the sum of a `symbol_ref' and an |
3329 | integer are stored inside a `const' RTX to mark them as constant. | |
3330 | Therefore, there is no need to recognize such sums specifically as | |
3331 | legitimate addresses. Normally you would simply recognize any `const' as | |
3332 | legitimate. | |
3333 | ||
0fb30cb7 NF |
3334 | Usually `TARGET_PRINT_OPERAND_ADDRESS' is not prepared to handle |
3335 | constant sums that are not marked with `const'. It assumes that a | |
3336 | naked `plus' indicates indexing. If so, then you *must* reject such | |
3337 | naked constant sums as illegitimate addresses, so that none of them | |
3338 | will be given to `TARGET_PRINT_OPERAND_ADDRESS'. */ | |
36a05131 BS |
3339 | |
3340 | int | |
c6c3dba9 PB |
3341 | frv_legitimate_address_p_1 (enum machine_mode mode, |
3342 | rtx x, | |
3343 | int strict_p, | |
3344 | int condexec_p, | |
3345 | int allow_double_reg_p) | |
36a05131 BS |
3346 | { |
3347 | rtx x0, x1; | |
3348 | int ret = 0; | |
3349 | HOST_WIDE_INT value; | |
3350 | unsigned regno0; | |
3351 | ||
bef8809e AH |
3352 | if (FRV_SYMBOL_REF_TLS_P (x)) |
3353 | return 0; | |
3354 | ||
36a05131 BS |
3355 | switch (GET_CODE (x)) |
3356 | { | |
3357 | default: | |
3358 | break; | |
3359 | ||
3360 | case SUBREG: | |
3361 | x = SUBREG_REG (x); | |
3362 | if (GET_CODE (x) != REG) | |
3363 | break; | |
3364 | ||
87b483a1 | 3365 | /* Fall through. */ |
36a05131 BS |
3366 | |
3367 | case REG: | |
3368 | ret = frv_regno_ok_for_base_p (REGNO (x), strict_p); | |
3369 | break; | |
3370 | ||
3371 | case PRE_MODIFY: | |
3372 | x0 = XEXP (x, 0); | |
3373 | x1 = XEXP (x, 1); | |
3374 | if (GET_CODE (x0) != REG | |
3375 | || ! frv_regno_ok_for_base_p (REGNO (x0), strict_p) | |
3376 | || GET_CODE (x1) != PLUS | |
3377 | || ! rtx_equal_p (x0, XEXP (x1, 0)) | |
3378 | || GET_CODE (XEXP (x1, 1)) != REG | |
3379 | || ! frv_regno_ok_for_base_p (REGNO (XEXP (x1, 1)), strict_p)) | |
3380 | break; | |
3381 | ||
3382 | ret = 1; | |
3383 | break; | |
3384 | ||
3385 | case CONST_INT: | |
2300b9dd | 3386 | /* 12-bit immediate */ |
36a05131 BS |
3387 | if (condexec_p) |
3388 | ret = FALSE; | |
3389 | else | |
3390 | { | |
2f5b1308 | 3391 | ret = IN_RANGE (INTVAL (x), -2048, 2047); |
36a05131 BS |
3392 | |
3393 | /* If we can't use load/store double operations, make sure we can | |
3394 | address the second word. */ | |
3395 | if (ret && GET_MODE_SIZE (mode) > UNITS_PER_WORD) | |
2f5b1308 JR |
3396 | ret = IN_RANGE (INTVAL (x) + GET_MODE_SIZE (mode) - 1, |
3397 | -2048, 2047); | |
36a05131 BS |
3398 | } |
3399 | break; | |
3400 | ||
3401 | case PLUS: | |
3402 | x0 = XEXP (x, 0); | |
3403 | x1 = XEXP (x, 1); | |
3404 | ||
3405 | if (GET_CODE (x0) == SUBREG) | |
3406 | x0 = SUBREG_REG (x0); | |
3407 | ||
3408 | if (GET_CODE (x0) != REG) | |
3409 | break; | |
3410 | ||
3411 | regno0 = REGNO (x0); | |
3412 | if (!frv_regno_ok_for_base_p (regno0, strict_p)) | |
3413 | break; | |
3414 | ||
3415 | switch (GET_CODE (x1)) | |
3416 | { | |
3417 | default: | |
3418 | break; | |
3419 | ||
3420 | case SUBREG: | |
3421 | x1 = SUBREG_REG (x1); | |
3422 | if (GET_CODE (x1) != REG) | |
3423 | break; | |
3424 | ||
87b483a1 | 3425 | /* Fall through. */ |
36a05131 BS |
3426 | |
3427 | case REG: | |
87b483a1 KH |
3428 | /* Do not allow reg+reg addressing for modes > 1 word if we |
3429 | can't depend on having move double instructions. */ | |
34208acf | 3430 | if (!allow_double_reg_p && GET_MODE_SIZE (mode) > UNITS_PER_WORD) |
36a05131 BS |
3431 | ret = FALSE; |
3432 | else | |
3433 | ret = frv_regno_ok_for_base_p (REGNO (x1), strict_p); | |
3434 | break; | |
3435 | ||
3436 | case CONST_INT: | |
2300b9dd | 3437 | /* 12-bit immediate */ |
36a05131 BS |
3438 | if (condexec_p) |
3439 | ret = FALSE; | |
3440 | else | |
3441 | { | |
3442 | value = INTVAL (x1); | |
2f5b1308 | 3443 | ret = IN_RANGE (value, -2048, 2047); |
36a05131 BS |
3444 | |
3445 | /* If we can't use load/store double operations, make sure we can | |
3446 | address the second word. */ | |
3447 | if (ret && GET_MODE_SIZE (mode) > UNITS_PER_WORD) | |
2f5b1308 | 3448 | ret = IN_RANGE (value + GET_MODE_SIZE (mode) - 1, -2048, 2047); |
36a05131 BS |
3449 | } |
3450 | break; | |
3451 | ||
36a05131 | 3452 | case CONST: |
34208acf | 3453 | if (!condexec_p && got12_operand (x1, VOIDmode)) |
36a05131 BS |
3454 | ret = TRUE; |
3455 | break; | |
3456 | ||
3457 | } | |
3458 | break; | |
3459 | } | |
3460 | ||
3461 | if (TARGET_DEBUG_ADDR) | |
3462 | { | |
331d9186 | 3463 | fprintf (stderr, "\n========== legitimate_address_p, mode = %s, result = %d, addresses are %sstrict%s\n", |
36a05131 BS |
3464 | GET_MODE_NAME (mode), ret, (strict_p) ? "" : "not ", |
3465 | (condexec_p) ? ", inside conditional code" : ""); | |
3466 | debug_rtx (x); | |
3467 | } | |
3468 | ||
3469 | return ret; | |
3470 | } | |
3471 | ||
c6c3dba9 PB |
3472 | bool |
3473 | frv_legitimate_address_p (enum machine_mode mode, rtx x, bool strict_p) | |
3474 | { | |
3475 | return frv_legitimate_address_p_1 (mode, x, strict_p, FALSE, FALSE); | |
3476 | } | |
3477 | ||
bef8809e AH |
3478 | /* Given an ADDR, generate code to inline the PLT. */ |
3479 | static rtx | |
3480 | gen_inlined_tls_plt (rtx addr) | |
3481 | { | |
fdbe66f2 | 3482 | rtx retval, dest; |
bef8809e AH |
3483 | rtx picreg = get_hard_reg_initial_val (Pmode, FDPIC_REG); |
3484 | ||
3485 | ||
3486 | dest = gen_reg_rtx (DImode); | |
3487 | ||
3488 | if (flag_pic == 1) | |
3489 | { | |
3490 | /* | |
3491 | -fpic version: | |
3492 | ||
3493 | lddi.p @(gr15, #gottlsdesc12(ADDR)), gr8 | |
3494 | calll #gettlsoff(ADDR)@(gr8, gr0) | |
3495 | */ | |
3496 | emit_insn (gen_tls_lddi (dest, addr, picreg)); | |
3497 | } | |
3498 | else | |
3499 | { | |
3500 | /* | |
3501 | -fPIC version: | |
3502 | ||
3503 | sethi.p #gottlsdeschi(ADDR), gr8 | |
3504 | setlo #gottlsdesclo(ADDR), gr8 | |
3505 | ldd #tlsdesc(ADDR)@(gr15, gr8), gr8 | |
3506 | calll #gettlsoff(ADDR)@(gr8, gr0) | |
3507 | */ | |
3508 | rtx reguse = gen_reg_rtx (Pmode); | |
3509 | emit_insn (gen_tlsoff_hilo (reguse, addr, GEN_INT (R_FRV_GOTTLSDESCHI))); | |
3510 | emit_insn (gen_tls_tlsdesc_ldd (dest, picreg, reguse, addr)); | |
3511 | } | |
3512 | ||
3513 | retval = gen_reg_rtx (Pmode); | |
a701780f | 3514 | emit_insn (gen_tls_indirect_call (retval, addr, dest, picreg)); |
bef8809e AH |
3515 | return retval; |
3516 | } | |
3517 | ||
3518 | /* Emit a TLSMOFF or TLSMOFF12 offset, depending on -mTLS. Returns | |
3519 | the destination address. */ | |
3520 | static rtx | |
3521 | gen_tlsmoff (rtx addr, rtx reg) | |
3522 | { | |
3523 | rtx dest = gen_reg_rtx (Pmode); | |
3524 | ||
3525 | if (TARGET_BIG_TLS) | |
3526 | { | |
3527 | /* sethi.p #tlsmoffhi(x), grA | |
3528 | setlo #tlsmofflo(x), grA | |
3529 | */ | |
3530 | dest = gen_reg_rtx (Pmode); | |
3531 | emit_insn (gen_tlsoff_hilo (dest, addr, | |
3532 | GEN_INT (R_FRV_TLSMOFFHI))); | |
3533 | dest = gen_rtx_PLUS (Pmode, dest, reg); | |
3534 | } | |
3535 | else | |
3536 | { | |
3537 | /* addi grB, #tlsmoff12(x), grC | |
3538 | -or- | |
3539 | ld/st @(grB, #tlsmoff12(x)), grC | |
3540 | */ | |
3541 | dest = gen_reg_rtx (Pmode); | |
3542 | emit_insn (gen_symGOTOFF2reg_i (dest, addr, reg, | |
3543 | GEN_INT (R_FRV_TLSMOFF12))); | |
3544 | } | |
3545 | return dest; | |
3546 | } | |
3547 | ||
3548 | /* Generate code for a TLS address. */ | |
3549 | static rtx | |
3550 | frv_legitimize_tls_address (rtx addr, enum tls_model model) | |
3551 | { | |
3552 | rtx dest, tp = gen_rtx_REG (Pmode, 29); | |
3553 | rtx picreg = get_hard_reg_initial_val (Pmode, 15); | |
3554 | ||
3555 | switch (model) | |
3556 | { | |
3557 | case TLS_MODEL_INITIAL_EXEC: | |
3558 | if (flag_pic == 1) | |
3559 | { | |
3560 | /* -fpic version. | |
3561 | ldi @(gr15, #gottlsoff12(x)), gr5 | |
3562 | */ | |
3563 | dest = gen_reg_rtx (Pmode); | |
3564 | emit_insn (gen_tls_load_gottlsoff12 (dest, addr, picreg)); | |
3565 | dest = gen_rtx_PLUS (Pmode, tp, dest); | |
3566 | } | |
3567 | else | |
3568 | { | |
3569 | /* -fPIC or anything else. | |
3570 | ||
3571 | sethi.p #gottlsoffhi(x), gr14 | |
3572 | setlo #gottlsofflo(x), gr14 | |
3573 | ld #tlsoff(x)@(gr15, gr14), gr9 | |
3574 | */ | |
3575 | rtx tmp = gen_reg_rtx (Pmode); | |
3576 | dest = gen_reg_rtx (Pmode); | |
3577 | emit_insn (gen_tlsoff_hilo (tmp, addr, | |
3578 | GEN_INT (R_FRV_GOTTLSOFF_HI))); | |
3579 | ||
3580 | emit_insn (gen_tls_tlsoff_ld (dest, picreg, tmp, addr)); | |
3581 | dest = gen_rtx_PLUS (Pmode, tp, dest); | |
3582 | } | |
3583 | break; | |
3584 | case TLS_MODEL_LOCAL_DYNAMIC: | |
3585 | { | |
3586 | rtx reg, retval; | |
3587 | ||
3588 | if (TARGET_INLINE_PLT) | |
3589 | retval = gen_inlined_tls_plt (GEN_INT (0)); | |
3590 | else | |
3591 | { | |
3592 | /* call #gettlsoff(0) */ | |
3593 | retval = gen_reg_rtx (Pmode); | |
3594 | emit_insn (gen_call_gettlsoff (retval, GEN_INT (0), picreg)); | |
3595 | } | |
3596 | ||
3597 | reg = gen_reg_rtx (Pmode); | |
3598 | emit_insn (gen_rtx_SET (VOIDmode, reg, | |
3599 | gen_rtx_PLUS (Pmode, | |
3600 | retval, tp))); | |
3601 | ||
3602 | dest = gen_tlsmoff (addr, reg); | |
3603 | ||
3604 | /* | |
3605 | dest = gen_reg_rtx (Pmode); | |
3606 | emit_insn (gen_tlsoff_hilo (dest, addr, | |
3607 | GEN_INT (R_FRV_TLSMOFFHI))); | |
3608 | dest = gen_rtx_PLUS (Pmode, dest, reg); | |
3609 | */ | |
3610 | break; | |
3611 | } | |
3612 | case TLS_MODEL_LOCAL_EXEC: | |
3613 | dest = gen_tlsmoff (addr, gen_rtx_REG (Pmode, 29)); | |
3614 | break; | |
3615 | case TLS_MODEL_GLOBAL_DYNAMIC: | |
3616 | { | |
3617 | rtx retval; | |
3618 | ||
3619 | if (TARGET_INLINE_PLT) | |
3620 | retval = gen_inlined_tls_plt (addr); | |
3621 | else | |
3622 | { | |
3623 | /* call #gettlsoff(x) */ | |
3624 | retval = gen_reg_rtx (Pmode); | |
3625 | emit_insn (gen_call_gettlsoff (retval, addr, picreg)); | |
3626 | } | |
3627 | dest = gen_rtx_PLUS (Pmode, retval, tp); | |
3628 | break; | |
3629 | } | |
3630 | default: | |
44e91694 | 3631 | gcc_unreachable (); |
bef8809e AH |
3632 | } |
3633 | ||
3634 | return dest; | |
3635 | } | |
3636 | ||
2a2e3f05 | 3637 | rtx |
bef8809e | 3638 | frv_legitimize_address (rtx x, |
2a2e3f05 AH |
3639 | rtx oldx ATTRIBUTE_UNUSED, |
3640 | enum machine_mode mode ATTRIBUTE_UNUSED) | |
3641 | { | |
bef8809e AH |
3642 | if (GET_CODE (x) == SYMBOL_REF) |
3643 | { | |
3644 | enum tls_model model = SYMBOL_REF_TLS_MODEL (x); | |
3645 | if (model != 0) | |
3646 | return frv_legitimize_tls_address (x, model); | |
3647 | } | |
3648 | ||
506d7b68 | 3649 | return x; |
2a2e3f05 | 3650 | } |
36a05131 | 3651 | \f |
34208acf AO |
3652 | /* Test whether a local function descriptor is canonical, i.e., |
3653 | whether we can use FUNCDESC_GOTOFF to compute the address of the | |
3654 | function. */ | |
3655 | ||
3656 | static bool | |
3657 | frv_local_funcdesc_p (rtx fnx) | |
3658 | { | |
3659 | tree fn; | |
3660 | enum symbol_visibility vis; | |
3661 | bool ret; | |
36a05131 | 3662 | |
34208acf AO |
3663 | if (! SYMBOL_REF_LOCAL_P (fnx)) |
3664 | return FALSE; | |
3665 | ||
3666 | fn = SYMBOL_REF_DECL (fnx); | |
3667 | ||
3668 | if (! fn) | |
3669 | return FALSE; | |
36a05131 | 3670 | |
34208acf | 3671 | vis = DECL_VISIBILITY (fn); |
36a05131 | 3672 | |
34208acf AO |
3673 | if (vis == VISIBILITY_PROTECTED) |
3674 | /* Private function descriptors for protected functions are not | |
3675 | canonical. Temporarily change the visibility to global. */ | |
3676 | vis = VISIBILITY_DEFAULT; | |
3677 | else if (flag_shlib) | |
3678 | /* If we're already compiling for a shared library (that, unlike | |
3679 | executables, can't assume that the existence of a definition | |
3680 | implies local binding), we can skip the re-testing. */ | |
3681 | return TRUE; | |
36a05131 | 3682 | |
34208acf | 3683 | ret = default_binds_local_p_1 (fn, flag_pic); |
36a05131 | 3684 | |
34208acf AO |
3685 | DECL_VISIBILITY (fn) = vis; |
3686 | ||
3687 | return ret; | |
3688 | } | |
3689 | ||
3690 | /* Load the _gp symbol into DEST. SRC is supposed to be the FDPIC | |
3691 | register. */ | |
36a05131 BS |
3692 | |
3693 | rtx | |
34208acf AO |
3694 | frv_gen_GPsym2reg (rtx dest, rtx src) |
3695 | { | |
3696 | tree gp = get_identifier ("_gp"); | |
3697 | rtx gp_sym = gen_rtx_SYMBOL_REF (Pmode, IDENTIFIER_POINTER (gp)); | |
36a05131 | 3698 | |
34208acf AO |
3699 | return gen_symGOT2reg (dest, gp_sym, src, GEN_INT (R_FRV_GOT12)); |
3700 | } | |
3701 | ||
3702 | static const char * | |
3703 | unspec_got_name (int i) | |
3704 | { | |
3705 | switch (i) | |
36a05131 | 3706 | { |
34208acf AO |
3707 | case R_FRV_GOT12: return "got12"; |
3708 | case R_FRV_GOTHI: return "gothi"; | |
3709 | case R_FRV_GOTLO: return "gotlo"; | |
3710 | case R_FRV_FUNCDESC: return "funcdesc"; | |
3711 | case R_FRV_FUNCDESC_GOT12: return "gotfuncdesc12"; | |
3712 | case R_FRV_FUNCDESC_GOTHI: return "gotfuncdeschi"; | |
3713 | case R_FRV_FUNCDESC_GOTLO: return "gotfuncdesclo"; | |
3714 | case R_FRV_FUNCDESC_VALUE: return "funcdescvalue"; | |
3715 | case R_FRV_FUNCDESC_GOTOFF12: return "gotofffuncdesc12"; | |
3716 | case R_FRV_FUNCDESC_GOTOFFHI: return "gotofffuncdeschi"; | |
3717 | case R_FRV_FUNCDESC_GOTOFFLO: return "gotofffuncdesclo"; | |
3718 | case R_FRV_GOTOFF12: return "gotoff12"; | |
3719 | case R_FRV_GOTOFFHI: return "gotoffhi"; | |
3720 | case R_FRV_GOTOFFLO: return "gotofflo"; | |
3721 | case R_FRV_GPREL12: return "gprel12"; | |
3722 | case R_FRV_GPRELHI: return "gprelhi"; | |
3723 | case R_FRV_GPRELLO: return "gprello"; | |
bef8809e AH |
3724 | case R_FRV_GOTTLSOFF_HI: return "gottlsoffhi"; |
3725 | case R_FRV_GOTTLSOFF_LO: return "gottlsofflo"; | |
3726 | case R_FRV_TLSMOFFHI: return "tlsmoffhi"; | |
3727 | case R_FRV_TLSMOFFLO: return "tlsmofflo"; | |
3728 | case R_FRV_TLSMOFF12: return "tlsmoff12"; | |
3729 | case R_FRV_TLSDESCHI: return "tlsdeschi"; | |
3730 | case R_FRV_TLSDESCLO: return "tlsdesclo"; | |
3731 | case R_FRV_GOTTLSDESCHI: return "gottlsdeschi"; | |
3732 | case R_FRV_GOTTLSDESCLO: return "gottlsdesclo"; | |
44e91694 | 3733 | default: gcc_unreachable (); |
36a05131 | 3734 | } |
34208acf | 3735 | } |
36a05131 | 3736 | |
34208acf AO |
3737 | /* Write the assembler syntax for UNSPEC to STREAM. Note that any offset |
3738 | is added inside the relocation operator. */ | |
3739 | ||
3740 | static void | |
3741 | frv_output_const_unspec (FILE *stream, const struct frv_unspec *unspec) | |
3742 | { | |
3743 | fprintf (stream, "#%s(", unspec_got_name (unspec->reloc)); | |
0a81f074 RS |
3744 | output_addr_const (stream, plus_constant (Pmode, unspec->symbol, |
3745 | unspec->offset)); | |
34208acf AO |
3746 | fputs (")", stream); |
3747 | } | |
3748 | ||
3749 | /* Implement FIND_BASE_TERM. See whether ORIG_X represents #gprel12(foo) | |
3750 | or #gotoff12(foo) for some small data symbol foo. If so, return foo, | |
3751 | otherwise return ORIG_X. */ | |
3752 | ||
3753 | rtx | |
3754 | frv_find_base_term (rtx x) | |
3755 | { | |
3756 | struct frv_unspec unspec; | |
3757 | ||
3758 | if (frv_const_unspec_p (x, &unspec) | |
3759 | && frv_small_data_reloc_p (unspec.symbol, unspec.reloc)) | |
0a81f074 | 3760 | return plus_constant (Pmode, unspec.symbol, unspec.offset); |
34208acf AO |
3761 | |
3762 | return x; | |
36a05131 BS |
3763 | } |
3764 | ||
3765 | /* Return 1 if operand is a valid FRV address. CONDEXEC_P is true if | |
3766 | the operand is used by a predicated instruction. */ | |
3767 | ||
6d26dc3b | 3768 | int |
f2206911 | 3769 | frv_legitimate_memory_operand (rtx op, enum machine_mode mode, int condexec_p) |
36a05131 BS |
3770 | { |
3771 | return ((GET_MODE (op) == mode || mode == VOIDmode) | |
3772 | && GET_CODE (op) == MEM | |
c6c3dba9 PB |
3773 | && frv_legitimate_address_p_1 (mode, XEXP (op, 0), |
3774 | reload_completed, condexec_p, FALSE)); | |
34208acf AO |
3775 | } |
3776 | ||
3777 | void | |
764678d1 | 3778 | frv_expand_fdpic_call (rtx *operands, bool ret_value, bool sibcall) |
34208acf AO |
3779 | { |
3780 | rtx lr = gen_rtx_REG (Pmode, LR_REGNO); | |
3781 | rtx picreg = get_hard_reg_initial_val (SImode, FDPIC_REG); | |
3782 | rtx c, rvrtx=0; | |
3783 | rtx addr; | |
3784 | ||
3785 | if (ret_value) | |
3786 | { | |
3787 | rvrtx = operands[0]; | |
3788 | operands ++; | |
3789 | } | |
3790 | ||
3791 | addr = XEXP (operands[0], 0); | |
3792 | ||
3793 | /* Inline PLTs if we're optimizing for speed. We'd like to inline | |
3794 | any calls that would involve a PLT, but can't tell, since we | |
3795 | don't know whether an extern function is going to be provided by | |
3796 | a separate translation unit or imported from a separate module. | |
3797 | When compiling for shared libraries, if the function has default | |
3798 | visibility, we assume it's overridable, so we inline the PLT, but | |
3799 | for executables, we don't really have a way to make a good | |
3800 | decision: a function is as likely to be imported from a shared | |
3801 | library as it is to be defined in the executable itself. We | |
3802 | assume executables will get global functions defined locally, | |
3803 | whereas shared libraries will have them potentially overridden, | |
3804 | so we only inline PLTs when compiling for shared libraries. | |
3805 | ||
3806 | In order to mark a function as local to a shared library, any | |
3807 | non-default visibility attribute suffices. Unfortunately, | |
3808 | there's no simple way to tag a function declaration as ``in a | |
3809 | different module'', which we could then use to trigger PLT | |
3810 | inlining on executables. There's -minline-plt, but it affects | |
3811 | all external functions, so one would have to also mark function | |
3812 | declarations available in the same module with non-default | |
3813 | visibility, which is advantageous in itself. */ | |
764678d1 AO |
3814 | if (GET_CODE (addr) == SYMBOL_REF |
3815 | && ((!SYMBOL_REF_LOCAL_P (addr) && TARGET_INLINE_PLT) | |
3816 | || sibcall)) | |
34208acf AO |
3817 | { |
3818 | rtx x, dest; | |
3819 | dest = gen_reg_rtx (SImode); | |
3820 | if (flag_pic != 1) | |
3821 | x = gen_symGOTOFF2reg_hilo (dest, addr, OUR_FDPIC_REG, | |
3822 | GEN_INT (R_FRV_FUNCDESC_GOTOFF12)); | |
3823 | else | |
3824 | x = gen_symGOTOFF2reg (dest, addr, OUR_FDPIC_REG, | |
3825 | GEN_INT (R_FRV_FUNCDESC_GOTOFF12)); | |
3826 | emit_insn (x); | |
ad516a74 | 3827 | crtl->uses_pic_offset_table = TRUE; |
34208acf | 3828 | addr = dest; |
2396bce1 | 3829 | } |
34208acf AO |
3830 | else if (GET_CODE (addr) == SYMBOL_REF) |
3831 | { | |
3832 | /* These are always either local, or handled through a local | |
3833 | PLT. */ | |
3834 | if (ret_value) | |
3835 | c = gen_call_value_fdpicsi (rvrtx, addr, operands[1], | |
3836 | operands[2], picreg, lr); | |
3837 | else | |
3838 | c = gen_call_fdpicsi (addr, operands[1], operands[2], picreg, lr); | |
3839 | emit_call_insn (c); | |
3840 | return; | |
3841 | } | |
3842 | else if (! ldd_address_operand (addr, Pmode)) | |
3843 | addr = force_reg (Pmode, addr); | |
3844 | ||
3845 | picreg = gen_reg_rtx (DImode); | |
3846 | emit_insn (gen_movdi_ldd (picreg, addr)); | |
3847 | ||
764678d1 AO |
3848 | if (sibcall && ret_value) |
3849 | c = gen_sibcall_value_fdpicdi (rvrtx, picreg, const0_rtx); | |
3850 | else if (sibcall) | |
3851 | c = gen_sibcall_fdpicdi (picreg, const0_rtx); | |
3852 | else if (ret_value) | |
34208acf AO |
3853 | c = gen_call_value_fdpicdi (rvrtx, picreg, const0_rtx, lr); |
3854 | else | |
3855 | c = gen_call_fdpicdi (picreg, const0_rtx, lr); | |
3856 | emit_call_insn (c); | |
36a05131 | 3857 | } |
36a05131 | 3858 | \f |
6d26dc3b KH |
3859 | /* Look for a SYMBOL_REF of a function in an rtx. We always want to |
3860 | process these separately from any offsets, such that we add any | |
3861 | offsets to the function descriptor (the actual pointer), not to the | |
3862 | function address. */ | |
36a05131 | 3863 | |
6d26dc3b KH |
3864 | static bool |
3865 | frv_function_symbol_referenced_p (rtx x) | |
36a05131 | 3866 | { |
6d26dc3b KH |
3867 | const char *format; |
3868 | int length; | |
3869 | int j; | |
36a05131 | 3870 | |
6d26dc3b KH |
3871 | if (GET_CODE (x) == SYMBOL_REF) |
3872 | return SYMBOL_REF_FUNCTION_P (x); | |
34208acf | 3873 | |
6d26dc3b KH |
3874 | length = GET_RTX_LENGTH (GET_CODE (x)); |
3875 | format = GET_RTX_FORMAT (GET_CODE (x)); | |
36a05131 | 3876 | |
6d26dc3b | 3877 | for (j = 0; j < length; ++j) |
36a05131 | 3878 | { |
6d26dc3b KH |
3879 | switch (format[j]) |
3880 | { | |
3881 | case 'e': | |
3882 | if (frv_function_symbol_referenced_p (XEXP (x, j))) | |
3883 | return TRUE; | |
3884 | break; | |
36a05131 | 3885 | |
6d26dc3b KH |
3886 | case 'V': |
3887 | case 'E': | |
3888 | if (XVEC (x, j) != 0) | |
3889 | { | |
3890 | int k; | |
3891 | for (k = 0; k < XVECLEN (x, j); ++k) | |
3892 | if (frv_function_symbol_referenced_p (XVECEXP (x, j, k))) | |
3893 | return TRUE; | |
3894 | } | |
3895 | break; | |
36a05131 | 3896 | |
6d26dc3b KH |
3897 | default: |
3898 | /* Nothing to do. */ | |
3899 | break; | |
3900 | } | |
36a05131 BS |
3901 | } |
3902 | ||
36a05131 BS |
3903 | return FALSE; |
3904 | } | |
3905 | ||
6d26dc3b KH |
3906 | /* Return true if the memory operand is one that can be conditionally |
3907 | executed. */ | |
36a05131 | 3908 | |
f2206911 | 3909 | int |
6d26dc3b | 3910 | condexec_memory_operand (rtx op, enum machine_mode mode) |
36a05131 | 3911 | { |
6d26dc3b KH |
3912 | enum machine_mode op_mode = GET_MODE (op); |
3913 | rtx addr; | |
36a05131 | 3914 | |
6d26dc3b | 3915 | if (mode != VOIDmode && op_mode != mode) |
36a05131 BS |
3916 | return FALSE; |
3917 | ||
6d26dc3b | 3918 | switch (op_mode) |
36a05131 BS |
3919 | { |
3920 | default: | |
6d26dc3b | 3921 | return FALSE; |
36a05131 | 3922 | |
6d26dc3b KH |
3923 | case QImode: |
3924 | case HImode: | |
3925 | case SImode: | |
3926 | case SFmode: | |
36a05131 BS |
3927 | break; |
3928 | } | |
3929 | ||
6d26dc3b | 3930 | if (GET_CODE (op) != MEM) |
36a05131 BS |
3931 | return FALSE; |
3932 | ||
6d26dc3b | 3933 | addr = XEXP (op, 0); |
c6c3dba9 | 3934 | return frv_legitimate_address_p_1 (mode, addr, reload_completed, TRUE, FALSE); |
36a05131 | 3935 | } |
36a05131 BS |
3936 | \f |
3937 | /* Return true if the bare return instruction can be used outside of the | |
3938 | epilog code. For frv, we only do it if there was no stack allocation. */ | |
3939 | ||
3940 | int | |
f2206911 | 3941 | direct_return_p (void) |
36a05131 BS |
3942 | { |
3943 | frv_stack_t *info; | |
3944 | ||
3945 | if (!reload_completed) | |
3946 | return FALSE; | |
3947 | ||
3948 | info = frv_stack_info (); | |
3949 | return (info->total_size == 0); | |
3950 | } | |
3951 | ||
3952 | \f | |
2a2e3f05 AH |
3953 | void |
3954 | frv_emit_move (enum machine_mode mode, rtx dest, rtx src) | |
3955 | { | |
bef8809e AH |
3956 | if (GET_CODE (src) == SYMBOL_REF) |
3957 | { | |
3958 | enum tls_model model = SYMBOL_REF_TLS_MODEL (src); | |
3959 | if (model != 0) | |
3960 | src = frv_legitimize_tls_address (src, model); | |
3961 | } | |
3962 | ||
2a2e3f05 AH |
3963 | switch (mode) |
3964 | { | |
3965 | case SImode: | |
3966 | if (frv_emit_movsi (dest, src)) | |
3967 | return; | |
3968 | break; | |
3969 | ||
3970 | case QImode: | |
3971 | case HImode: | |
3972 | case DImode: | |
3973 | case SFmode: | |
3974 | case DFmode: | |
3975 | if (!reload_in_progress | |
3976 | && !reload_completed | |
3977 | && !register_operand (dest, mode) | |
3978 | && !reg_or_0_operand (src, mode)) | |
3979 | src = copy_to_mode_reg (mode, src); | |
3980 | break; | |
3981 | ||
3982 | default: | |
44e91694 | 3983 | gcc_unreachable (); |
2a2e3f05 AH |
3984 | } |
3985 | ||
3986 | emit_insn (gen_rtx_SET (VOIDmode, dest, src)); | |
3987 | } | |
3988 | ||
36a05131 BS |
3989 | /* Emit code to handle a MOVSI, adding in the small data register or pic |
3990 | register if needed to load up addresses. Return TRUE if the appropriate | |
3991 | instructions are emitted. */ | |
3992 | ||
3993 | int | |
f2206911 | 3994 | frv_emit_movsi (rtx dest, rtx src) |
36a05131 BS |
3995 | { |
3996 | int base_regno = -1; | |
34208acf AO |
3997 | int unspec = 0; |
3998 | rtx sym = src; | |
3999 | struct frv_unspec old_unspec; | |
36a05131 BS |
4000 | |
4001 | if (!reload_in_progress | |
4002 | && !reload_completed | |
4003 | && !register_operand (dest, SImode) | |
4004 | && (!reg_or_0_operand (src, SImode) | |
4005 | /* Virtual registers will almost always be replaced by an | |
4006 | add instruction, so expose this to CSE by copying to | |
87b483a1 | 4007 | an intermediate register. */ |
36a05131 | 4008 | || (GET_CODE (src) == REG |
2f5b1308 JR |
4009 | && IN_RANGE (REGNO (src), |
4010 | FIRST_VIRTUAL_REGISTER, | |
4011 | LAST_VIRTUAL_POINTER_REGISTER)))) | |
36a05131 BS |
4012 | { |
4013 | emit_insn (gen_rtx_SET (VOIDmode, dest, copy_to_mode_reg (SImode, src))); | |
4014 | return TRUE; | |
4015 | } | |
4016 | ||
4017 | /* Explicitly add in the PIC or small data register if needed. */ | |
4018 | switch (GET_CODE (src)) | |
4019 | { | |
4020 | default: | |
4021 | break; | |
4022 | ||
4023 | case LABEL_REF: | |
34208acf AO |
4024 | handle_label: |
4025 | if (TARGET_FDPIC) | |
4026 | { | |
4027 | /* Using GPREL12, we use a single GOT entry for all symbols | |
4028 | in read-only sections, but trade sequences such as: | |
4029 | ||
4030 | sethi #gothi(label), gr# | |
4031 | setlo #gotlo(label), gr# | |
4032 | ld @(gr15,gr#), gr# | |
4033 | ||
4034 | for | |
4035 | ||
4036 | ld @(gr15,#got12(_gp)), gr# | |
4037 | sethi #gprelhi(label), gr## | |
4038 | setlo #gprello(label), gr## | |
4039 | add gr#, gr##, gr## | |
4040 | ||
4041 | We may often be able to share gr# for multiple | |
4042 | computations of GPREL addresses, and we may often fold | |
4043 | the final add into the pair of registers of a load or | |
4044 | store instruction, so it's often profitable. Even when | |
4045 | optimizing for size, we're trading a GOT entry for an | |
4046 | additional instruction, which trades GOT space | |
4047 | (read-write) for code size (read-only, shareable), as | |
4048 | long as the symbol is not used in more than two different | |
4049 | locations. | |
2396bce1 | 4050 | |
34208acf AO |
4051 | With -fpie/-fpic, we'd be trading a single load for a |
4052 | sequence of 4 instructions, because the offset of the | |
4ee31f1e | 4053 | label can't be assumed to be addressable with 12 bits, so |
34208acf AO |
4054 | we don't do this. */ |
4055 | if (TARGET_GPREL_RO) | |
4056 | unspec = R_FRV_GPREL12; | |
4057 | else | |
4058 | unspec = R_FRV_GOT12; | |
4059 | } | |
4060 | else if (flag_pic) | |
36a05131 BS |
4061 | base_regno = PIC_REGNO; |
4062 | ||
4063 | break; | |
4064 | ||
4065 | case CONST: | |
34208acf AO |
4066 | if (frv_const_unspec_p (src, &old_unspec)) |
4067 | break; | |
36a05131 | 4068 | |
34208acf AO |
4069 | if (TARGET_FDPIC && frv_function_symbol_referenced_p (XEXP (src, 0))) |
4070 | { | |
4071 | handle_whatever: | |
4072 | src = force_reg (GET_MODE (XEXP (src, 0)), XEXP (src, 0)); | |
4073 | emit_move_insn (dest, src); | |
4074 | return TRUE; | |
4075 | } | |
4076 | else | |
4077 | { | |
4078 | sym = XEXP (sym, 0); | |
4079 | if (GET_CODE (sym) == PLUS | |
4080 | && GET_CODE (XEXP (sym, 0)) == SYMBOL_REF | |
4081 | && GET_CODE (XEXP (sym, 1)) == CONST_INT) | |
4082 | sym = XEXP (sym, 0); | |
4083 | if (GET_CODE (sym) == SYMBOL_REF) | |
4084 | goto handle_sym; | |
4085 | else if (GET_CODE (sym) == LABEL_REF) | |
4086 | goto handle_label; | |
4087 | else | |
4088 | goto handle_whatever; | |
4089 | } | |
36a05131 BS |
4090 | break; |
4091 | ||
4092 | case SYMBOL_REF: | |
34208acf AO |
4093 | handle_sym: |
4094 | if (TARGET_FDPIC) | |
4095 | { | |
bef8809e AH |
4096 | enum tls_model model = SYMBOL_REF_TLS_MODEL (sym); |
4097 | ||
4098 | if (model != 0) | |
4099 | { | |
4100 | src = frv_legitimize_tls_address (src, model); | |
4101 | emit_move_insn (dest, src); | |
4102 | return TRUE; | |
4103 | } | |
4104 | ||
34208acf AO |
4105 | if (SYMBOL_REF_FUNCTION_P (sym)) |
4106 | { | |
4107 | if (frv_local_funcdesc_p (sym)) | |
4108 | unspec = R_FRV_FUNCDESC_GOTOFF12; | |
4109 | else | |
4110 | unspec = R_FRV_FUNCDESC_GOT12; | |
4111 | } | |
4112 | else | |
4113 | { | |
4114 | if (CONSTANT_POOL_ADDRESS_P (sym)) | |
4115 | switch (GET_CODE (get_pool_constant (sym))) | |
4116 | { | |
4117 | case CONST: | |
4118 | case SYMBOL_REF: | |
4119 | case LABEL_REF: | |
4120 | if (flag_pic) | |
4121 | { | |
4122 | unspec = R_FRV_GOTOFF12; | |
4123 | break; | |
4124 | } | |
4125 | /* Fall through. */ | |
4126 | default: | |
4127 | if (TARGET_GPREL_RO) | |
4128 | unspec = R_FRV_GPREL12; | |
4129 | else | |
4130 | unspec = R_FRV_GOT12; | |
4131 | break; | |
4132 | } | |
4133 | else if (SYMBOL_REF_LOCAL_P (sym) | |
4134 | && !SYMBOL_REF_EXTERNAL_P (sym) | |
4135 | && SYMBOL_REF_DECL (sym) | |
4136 | && (!DECL_P (SYMBOL_REF_DECL (sym)) | |
4137 | || !DECL_COMMON (SYMBOL_REF_DECL (sym)))) | |
4138 | { | |
4139 | tree decl = SYMBOL_REF_DECL (sym); | |
4140 | tree init = TREE_CODE (decl) == VAR_DECL | |
4141 | ? DECL_INITIAL (decl) | |
4142 | : TREE_CODE (decl) == CONSTRUCTOR | |
4143 | ? decl : 0; | |
4144 | int reloc = 0; | |
4145 | bool named_section, readonly; | |
4146 | ||
4147 | if (init && init != error_mark_node) | |
4148 | reloc = compute_reloc_for_constant (init); | |
2396bce1 | 4149 | |
34208acf AO |
4150 | named_section = TREE_CODE (decl) == VAR_DECL |
4151 | && lookup_attribute ("section", DECL_ATTRIBUTES (decl)); | |
4152 | readonly = decl_readonly_section (decl, reloc); | |
2396bce1 | 4153 | |
34208acf AO |
4154 | if (named_section) |
4155 | unspec = R_FRV_GOT12; | |
4156 | else if (!readonly) | |
4157 | unspec = R_FRV_GOTOFF12; | |
4158 | else if (readonly && TARGET_GPREL_RO) | |
4159 | unspec = R_FRV_GPREL12; | |
4160 | else | |
4161 | unspec = R_FRV_GOT12; | |
4162 | } | |
4163 | else | |
4164 | unspec = R_FRV_GOT12; | |
4165 | } | |
4166 | } | |
4167 | ||
4168 | else if (SYMBOL_REF_SMALL_P (sym)) | |
36a05131 BS |
4169 | base_regno = SDA_BASE_REG; |
4170 | ||
4171 | else if (flag_pic) | |
4172 | base_regno = PIC_REGNO; | |
4173 | ||
4174 | break; | |
4175 | } | |
4176 | ||
4177 | if (base_regno >= 0) | |
4178 | { | |
34208acf AO |
4179 | if (GET_CODE (sym) == SYMBOL_REF && SYMBOL_REF_SMALL_P (sym)) |
4180 | emit_insn (gen_symGOTOFF2reg (dest, src, | |
4181 | gen_rtx_REG (Pmode, base_regno), | |
4182 | GEN_INT (R_FRV_GPREL12))); | |
4183 | else | |
4184 | emit_insn (gen_symGOTOFF2reg_hilo (dest, src, | |
4185 | gen_rtx_REG (Pmode, base_regno), | |
4186 | GEN_INT (R_FRV_GPREL12))); | |
36a05131 | 4187 | if (base_regno == PIC_REGNO) |
ad516a74 | 4188 | crtl->uses_pic_offset_table = TRUE; |
34208acf AO |
4189 | return TRUE; |
4190 | } | |
36a05131 | 4191 | |
34208acf AO |
4192 | if (unspec) |
4193 | { | |
4194 | rtx x; | |
4195 | ||
4196 | /* Since OUR_FDPIC_REG is a pseudo register, we can't safely introduce | |
4197 | new uses of it once reload has begun. */ | |
44e91694 | 4198 | gcc_assert (!reload_in_progress && !reload_completed); |
34208acf AO |
4199 | |
4200 | switch (unspec) | |
4201 | { | |
4202 | case R_FRV_GOTOFF12: | |
4203 | if (!frv_small_data_reloc_p (sym, unspec)) | |
4204 | x = gen_symGOTOFF2reg_hilo (dest, src, OUR_FDPIC_REG, | |
4205 | GEN_INT (unspec)); | |
4206 | else | |
4207 | x = gen_symGOTOFF2reg (dest, src, OUR_FDPIC_REG, GEN_INT (unspec)); | |
4208 | break; | |
4209 | case R_FRV_GPREL12: | |
4210 | if (!frv_small_data_reloc_p (sym, unspec)) | |
4211 | x = gen_symGPREL2reg_hilo (dest, src, OUR_FDPIC_REG, | |
4212 | GEN_INT (unspec)); | |
4213 | else | |
4214 | x = gen_symGPREL2reg (dest, src, OUR_FDPIC_REG, GEN_INT (unspec)); | |
4215 | break; | |
4216 | case R_FRV_FUNCDESC_GOTOFF12: | |
4217 | if (flag_pic != 1) | |
4218 | x = gen_symGOTOFF2reg_hilo (dest, src, OUR_FDPIC_REG, | |
4219 | GEN_INT (unspec)); | |
4220 | else | |
4221 | x = gen_symGOTOFF2reg (dest, src, OUR_FDPIC_REG, GEN_INT (unspec)); | |
4222 | break; | |
4223 | default: | |
4224 | if (flag_pic != 1) | |
4225 | x = gen_symGOT2reg_hilo (dest, src, OUR_FDPIC_REG, | |
4226 | GEN_INT (unspec)); | |
4227 | else | |
4228 | x = gen_symGOT2reg (dest, src, OUR_FDPIC_REG, GEN_INT (unspec)); | |
4229 | break; | |
4230 | } | |
4231 | emit_insn (x); | |
ad516a74 | 4232 | crtl->uses_pic_offset_table = TRUE; |
36a05131 BS |
4233 | return TRUE; |
4234 | } | |
4235 | ||
34208acf | 4236 | |
36a05131 BS |
4237 | return FALSE; |
4238 | } | |
4239 | ||
4240 | \f | |
4241 | /* Return a string to output a single word move. */ | |
4242 | ||
4243 | const char * | |
f2206911 | 4244 | output_move_single (rtx operands[], rtx insn) |
36a05131 BS |
4245 | { |
4246 | rtx dest = operands[0]; | |
4247 | rtx src = operands[1]; | |
4248 | ||
4249 | if (GET_CODE (dest) == REG) | |
4250 | { | |
4251 | int dest_regno = REGNO (dest); | |
4252 | enum machine_mode mode = GET_MODE (dest); | |
4253 | ||
4254 | if (GPR_P (dest_regno)) | |
4255 | { | |
4256 | if (GET_CODE (src) == REG) | |
4257 | { | |
4258 | /* gpr <- some sort of register */ | |
4259 | int src_regno = REGNO (src); | |
4260 | ||
4261 | if (GPR_P (src_regno)) | |
4262 | return "mov %1, %0"; | |
4263 | ||
4264 | else if (FPR_P (src_regno)) | |
4265 | return "movfg %1, %0"; | |
4266 | ||
4267 | else if (SPR_P (src_regno)) | |
4268 | return "movsg %1, %0"; | |
4269 | } | |
4270 | ||
4271 | else if (GET_CODE (src) == MEM) | |
4272 | { | |
4273 | /* gpr <- memory */ | |
4274 | switch (mode) | |
4275 | { | |
4276 | default: | |
4277 | break; | |
4278 | ||
4279 | case QImode: | |
4280 | return "ldsb%I1%U1 %M1,%0"; | |
4281 | ||
4282 | case HImode: | |
4283 | return "ldsh%I1%U1 %M1,%0"; | |
4284 | ||
4285 | case SImode: | |
4286 | case SFmode: | |
4287 | return "ld%I1%U1 %M1, %0"; | |
4288 | } | |
4289 | } | |
4290 | ||
4291 | else if (GET_CODE (src) == CONST_INT | |
4292 | || GET_CODE (src) == CONST_DOUBLE) | |
4293 | { | |
4294 | /* gpr <- integer/floating constant */ | |
4295 | HOST_WIDE_INT value; | |
4296 | ||
4297 | if (GET_CODE (src) == CONST_INT) | |
4298 | value = INTVAL (src); | |
4299 | ||
4300 | else if (mode == SFmode) | |
4301 | { | |
4302 | REAL_VALUE_TYPE rv; | |
4303 | long l; | |
4304 | ||
4305 | REAL_VALUE_FROM_CONST_DOUBLE (rv, src); | |
4306 | REAL_VALUE_TO_TARGET_SINGLE (rv, l); | |
4307 | value = l; | |
4308 | } | |
4309 | ||
4310 | else | |
4311 | value = CONST_DOUBLE_LOW (src); | |
4312 | ||
2f5b1308 | 4313 | if (IN_RANGE (value, -32768, 32767)) |
36a05131 BS |
4314 | return "setlos %1, %0"; |
4315 | ||
4316 | return "#"; | |
4317 | } | |
4318 | ||
4319 | else if (GET_CODE (src) == SYMBOL_REF | |
4320 | || GET_CODE (src) == LABEL_REF | |
4321 | || GET_CODE (src) == CONST) | |
4322 | { | |
36a05131 BS |
4323 | return "#"; |
4324 | } | |
4325 | } | |
4326 | ||
4327 | else if (FPR_P (dest_regno)) | |
4328 | { | |
4329 | if (GET_CODE (src) == REG) | |
4330 | { | |
4331 | /* fpr <- some sort of register */ | |
4332 | int src_regno = REGNO (src); | |
4333 | ||
4334 | if (GPR_P (src_regno)) | |
4335 | return "movgf %1, %0"; | |
4336 | ||
4337 | else if (FPR_P (src_regno)) | |
4338 | { | |
4339 | if (TARGET_HARD_FLOAT) | |
4340 | return "fmovs %1, %0"; | |
4341 | else | |
4342 | return "mor %1, %1, %0"; | |
4343 | } | |
4344 | } | |
4345 | ||
4346 | else if (GET_CODE (src) == MEM) | |
4347 | { | |
4348 | /* fpr <- memory */ | |
4349 | switch (mode) | |
4350 | { | |
4351 | default: | |
4352 | break; | |
4353 | ||
4354 | case QImode: | |
4355 | return "ldbf%I1%U1 %M1,%0"; | |
4356 | ||
4357 | case HImode: | |
4358 | return "ldhf%I1%U1 %M1,%0"; | |
4359 | ||
4360 | case SImode: | |
4361 | case SFmode: | |
4362 | return "ldf%I1%U1 %M1, %0"; | |
4363 | } | |
4364 | } | |
4365 | ||
4366 | else if (ZERO_P (src)) | |
4367 | return "movgf %., %0"; | |
4368 | } | |
4369 | ||
4370 | else if (SPR_P (dest_regno)) | |
4371 | { | |
4372 | if (GET_CODE (src) == REG) | |
4373 | { | |
4374 | /* spr <- some sort of register */ | |
4375 | int src_regno = REGNO (src); | |
4376 | ||
4377 | if (GPR_P (src_regno)) | |
4378 | return "movgs %1, %0"; | |
4379 | } | |
c557edf4 RS |
4380 | else if (ZERO_P (src)) |
4381 | return "movgs %., %0"; | |
36a05131 BS |
4382 | } |
4383 | } | |
4384 | ||
4385 | else if (GET_CODE (dest) == MEM) | |
4386 | { | |
4387 | if (GET_CODE (src) == REG) | |
4388 | { | |
4389 | int src_regno = REGNO (src); | |
4390 | enum machine_mode mode = GET_MODE (dest); | |
4391 | ||
4392 | if (GPR_P (src_regno)) | |
4393 | { | |
4394 | switch (mode) | |
4395 | { | |
4396 | default: | |
4397 | break; | |
4398 | ||
4399 | case QImode: | |
4400 | return "stb%I0%U0 %1, %M0"; | |
4401 | ||
4402 | case HImode: | |
4403 | return "sth%I0%U0 %1, %M0"; | |
4404 | ||
4405 | case SImode: | |
4406 | case SFmode: | |
4407 | return "st%I0%U0 %1, %M0"; | |
4408 | } | |
4409 | } | |
4410 | ||
4411 | else if (FPR_P (src_regno)) | |
4412 | { | |
4413 | switch (mode) | |
4414 | { | |
4415 | default: | |
4416 | break; | |
4417 | ||
4418 | case QImode: | |
4419 | return "stbf%I0%U0 %1, %M0"; | |
4420 | ||
4421 | case HImode: | |
4422 | return "sthf%I0%U0 %1, %M0"; | |
4423 | ||
4424 | case SImode: | |
4425 | case SFmode: | |
4426 | return "stf%I0%U0 %1, %M0"; | |
4427 | } | |
4428 | } | |
4429 | } | |
4430 | ||
4431 | else if (ZERO_P (src)) | |
4432 | { | |
4433 | switch (GET_MODE (dest)) | |
4434 | { | |
4435 | default: | |
4436 | break; | |
4437 | ||
4438 | case QImode: | |
4439 | return "stb%I0%U0 %., %M0"; | |
4440 | ||
4441 | case HImode: | |
4442 | return "sth%I0%U0 %., %M0"; | |
4443 | ||
4444 | case SImode: | |
4445 | case SFmode: | |
4446 | return "st%I0%U0 %., %M0"; | |
4447 | } | |
4448 | } | |
4449 | } | |
4450 | ||
ab532386 | 4451 | fatal_insn ("bad output_move_single operand", insn); |
36a05131 BS |
4452 | return ""; |
4453 | } | |
4454 | ||
4455 | \f | |
4456 | /* Return a string to output a double word move. */ | |
4457 | ||
4458 | const char * | |
f2206911 | 4459 | output_move_double (rtx operands[], rtx insn) |
36a05131 BS |
4460 | { |
4461 | rtx dest = operands[0]; | |
4462 | rtx src = operands[1]; | |
4463 | enum machine_mode mode = GET_MODE (dest); | |
4464 | ||
4465 | if (GET_CODE (dest) == REG) | |
4466 | { | |
4467 | int dest_regno = REGNO (dest); | |
4468 | ||
4469 | if (GPR_P (dest_regno)) | |
4470 | { | |
4471 | if (GET_CODE (src) == REG) | |
4472 | { | |
4473 | /* gpr <- some sort of register */ | |
4474 | int src_regno = REGNO (src); | |
4475 | ||
4476 | if (GPR_P (src_regno)) | |
4477 | return "#"; | |
4478 | ||
4479 | else if (FPR_P (src_regno)) | |
4480 | { | |
4481 | if (((dest_regno - GPR_FIRST) & 1) == 0 | |
4482 | && ((src_regno - FPR_FIRST) & 1) == 0) | |
4483 | return "movfgd %1, %0"; | |
4484 | ||
4485 | return "#"; | |
4486 | } | |
4487 | } | |
4488 | ||
4489 | else if (GET_CODE (src) == MEM) | |
4490 | { | |
4491 | /* gpr <- memory */ | |
4492 | if (dbl_memory_one_insn_operand (src, mode)) | |
4493 | return "ldd%I1%U1 %M1, %0"; | |
4494 | ||
4495 | return "#"; | |
4496 | } | |
4497 | ||
4498 | else if (GET_CODE (src) == CONST_INT | |
4499 | || GET_CODE (src) == CONST_DOUBLE) | |
4500 | return "#"; | |
4501 | } | |
4502 | ||
4503 | else if (FPR_P (dest_regno)) | |
4504 | { | |
4505 | if (GET_CODE (src) == REG) | |
4506 | { | |
4507 | /* fpr <- some sort of register */ | |
4508 | int src_regno = REGNO (src); | |
4509 | ||
4510 | if (GPR_P (src_regno)) | |
4511 | { | |
4512 | if (((dest_regno - FPR_FIRST) & 1) == 0 | |
4513 | && ((src_regno - GPR_FIRST) & 1) == 0) | |
4514 | return "movgfd %1, %0"; | |
4515 | ||
4516 | return "#"; | |
4517 | } | |
4518 | ||
4519 | else if (FPR_P (src_regno)) | |
4520 | { | |
4521 | if (TARGET_DOUBLE | |
4522 | && ((dest_regno - FPR_FIRST) & 1) == 0 | |
4523 | && ((src_regno - FPR_FIRST) & 1) == 0) | |
4524 | return "fmovd %1, %0"; | |
4525 | ||
4526 | return "#"; | |
4527 | } | |
4528 | } | |
4529 | ||
4530 | else if (GET_CODE (src) == MEM) | |
4531 | { | |
4532 | /* fpr <- memory */ | |
4533 | if (dbl_memory_one_insn_operand (src, mode)) | |
4534 | return "lddf%I1%U1 %M1, %0"; | |
4535 | ||
4536 | return "#"; | |
4537 | } | |
4538 | ||
4539 | else if (ZERO_P (src)) | |
4540 | return "#"; | |
4541 | } | |
4542 | } | |
4543 | ||
4544 | else if (GET_CODE (dest) == MEM) | |
4545 | { | |
4546 | if (GET_CODE (src) == REG) | |
4547 | { | |
4548 | int src_regno = REGNO (src); | |
4549 | ||
4550 | if (GPR_P (src_regno)) | |
4551 | { | |
4552 | if (((src_regno - GPR_FIRST) & 1) == 0 | |
4553 | && dbl_memory_one_insn_operand (dest, mode)) | |
4554 | return "std%I0%U0 %1, %M0"; | |
4555 | ||
4556 | return "#"; | |
4557 | } | |
4558 | ||
4559 | if (FPR_P (src_regno)) | |
4560 | { | |
4561 | if (((src_regno - FPR_FIRST) & 1) == 0 | |
4562 | && dbl_memory_one_insn_operand (dest, mode)) | |
4563 | return "stdf%I0%U0 %1, %M0"; | |
4564 | ||
4565 | return "#"; | |
4566 | } | |
4567 | } | |
4568 | ||
4569 | else if (ZERO_P (src)) | |
4570 | { | |
4571 | if (dbl_memory_one_insn_operand (dest, mode)) | |
4572 | return "std%I0%U0 %., %M0"; | |
4573 | ||
4574 | return "#"; | |
4575 | } | |
4576 | } | |
4577 | ||
ab532386 | 4578 | fatal_insn ("bad output_move_double operand", insn); |
36a05131 BS |
4579 | return ""; |
4580 | } | |
4581 | ||
4582 | \f | |
4583 | /* Return a string to output a single word conditional move. | |
4584 | Operand0 -- EQ/NE of ccr register and 0 | |
4585 | Operand1 -- CCR register | |
4586 | Operand2 -- destination | |
4587 | Operand3 -- source */ | |
4588 | ||
4589 | const char * | |
f2206911 | 4590 | output_condmove_single (rtx operands[], rtx insn) |
36a05131 BS |
4591 | { |
4592 | rtx dest = operands[2]; | |
4593 | rtx src = operands[3]; | |
4594 | ||
4595 | if (GET_CODE (dest) == REG) | |
4596 | { | |
4597 | int dest_regno = REGNO (dest); | |
4598 | enum machine_mode mode = GET_MODE (dest); | |
4599 | ||
4600 | if (GPR_P (dest_regno)) | |
4601 | { | |
4602 | if (GET_CODE (src) == REG) | |
4603 | { | |
4604 | /* gpr <- some sort of register */ | |
4605 | int src_regno = REGNO (src); | |
4606 | ||
4607 | if (GPR_P (src_regno)) | |
4608 | return "cmov %z3, %2, %1, %e0"; | |
4609 | ||
4610 | else if (FPR_P (src_regno)) | |
4611 | return "cmovfg %3, %2, %1, %e0"; | |
4612 | } | |
4613 | ||
4614 | else if (GET_CODE (src) == MEM) | |
4615 | { | |
4616 | /* gpr <- memory */ | |
4617 | switch (mode) | |
4618 | { | |
4619 | default: | |
4620 | break; | |
4621 | ||
4622 | case QImode: | |
4623 | return "cldsb%I3%U3 %M3, %2, %1, %e0"; | |
4624 | ||
4625 | case HImode: | |
4626 | return "cldsh%I3%U3 %M3, %2, %1, %e0"; | |
4627 | ||
4628 | case SImode: | |
4629 | case SFmode: | |
4630 | return "cld%I3%U3 %M3, %2, %1, %e0"; | |
4631 | } | |
4632 | } | |
4633 | ||
4634 | else if (ZERO_P (src)) | |
4635 | return "cmov %., %2, %1, %e0"; | |
4636 | } | |
4637 | ||
4638 | else if (FPR_P (dest_regno)) | |
4639 | { | |
4640 | if (GET_CODE (src) == REG) | |
4641 | { | |
4642 | /* fpr <- some sort of register */ | |
4643 | int src_regno = REGNO (src); | |
4644 | ||
4645 | if (GPR_P (src_regno)) | |
4646 | return "cmovgf %3, %2, %1, %e0"; | |
4647 | ||
4648 | else if (FPR_P (src_regno)) | |
4649 | { | |
4650 | if (TARGET_HARD_FLOAT) | |
4651 | return "cfmovs %3,%2,%1,%e0"; | |
4652 | else | |
4653 | return "cmor %3, %3, %2, %1, %e0"; | |
4654 | } | |
4655 | } | |
4656 | ||
4657 | else if (GET_CODE (src) == MEM) | |
4658 | { | |
4659 | /* fpr <- memory */ | |
4660 | if (mode == SImode || mode == SFmode) | |
4661 | return "cldf%I3%U3 %M3, %2, %1, %e0"; | |
4662 | } | |
4663 | ||
4664 | else if (ZERO_P (src)) | |
4665 | return "cmovgf %., %2, %1, %e0"; | |
4666 | } | |
4667 | } | |
4668 | ||
4669 | else if (GET_CODE (dest) == MEM) | |
4670 | { | |
4671 | if (GET_CODE (src) == REG) | |
4672 | { | |
4673 | int src_regno = REGNO (src); | |
4674 | enum machine_mode mode = GET_MODE (dest); | |
4675 | ||
4676 | if (GPR_P (src_regno)) | |
4677 | { | |
4678 | switch (mode) | |
4679 | { | |
4680 | default: | |
4681 | break; | |
4682 | ||
4683 | case QImode: | |
4684 | return "cstb%I2%U2 %3, %M2, %1, %e0"; | |
4685 | ||
4686 | case HImode: | |
4687 | return "csth%I2%U2 %3, %M2, %1, %e0"; | |
4688 | ||
4689 | case SImode: | |
4690 | case SFmode: | |
4691 | return "cst%I2%U2 %3, %M2, %1, %e0"; | |
4692 | } | |
4693 | } | |
4694 | ||
4695 | else if (FPR_P (src_regno) && (mode == SImode || mode == SFmode)) | |
4696 | return "cstf%I2%U2 %3, %M2, %1, %e0"; | |
4697 | } | |
4698 | ||
4699 | else if (ZERO_P (src)) | |
4700 | { | |
4701 | enum machine_mode mode = GET_MODE (dest); | |
4702 | switch (mode) | |
4703 | { | |
4704 | default: | |
4705 | break; | |
4706 | ||
4707 | case QImode: | |
4708 | return "cstb%I2%U2 %., %M2, %1, %e0"; | |
4709 | ||
4710 | case HImode: | |
4711 | return "csth%I2%U2 %., %M2, %1, %e0"; | |
4712 | ||
4713 | case SImode: | |
4714 | case SFmode: | |
4715 | return "cst%I2%U2 %., %M2, %1, %e0"; | |
4716 | } | |
4717 | } | |
4718 | } | |
4719 | ||
ab532386 | 4720 | fatal_insn ("bad output_condmove_single operand", insn); |
36a05131 BS |
4721 | return ""; |
4722 | } | |
4723 | ||
4724 | \f | |
4725 | /* Emit the appropriate code to do a comparison, returning the register the | |
4726 | comparison was done it. */ | |
4727 | ||
4728 | static rtx | |
f2206911 | 4729 | frv_emit_comparison (enum rtx_code test, rtx op0, rtx op1) |
36a05131 BS |
4730 | { |
4731 | enum machine_mode cc_mode; | |
4732 | rtx cc_reg; | |
4733 | ||
87b483a1 | 4734 | /* Floating point doesn't have comparison against a constant. */ |
36a05131 BS |
4735 | if (GET_MODE (op0) == CC_FPmode && GET_CODE (op1) != REG) |
4736 | op1 = force_reg (GET_MODE (op0), op1); | |
4737 | ||
4738 | /* Possibly disable using anything but a fixed register in order to work | |
4739 | around cse moving comparisons past function calls. */ | |
4740 | cc_mode = SELECT_CC_MODE (test, op0, op1); | |
4741 | cc_reg = ((TARGET_ALLOC_CC) | |
4742 | ? gen_reg_rtx (cc_mode) | |
4743 | : gen_rtx_REG (cc_mode, | |
4744 | (cc_mode == CC_FPmode) ? FCC_FIRST : ICC_FIRST)); | |
4745 | ||
4746 | emit_insn (gen_rtx_SET (VOIDmode, cc_reg, | |
4747 | gen_rtx_COMPARE (cc_mode, op0, op1))); | |
4748 | ||
4749 | return cc_reg; | |
4750 | } | |
4751 | ||
4752 | \f | |
f90b7a5a | 4753 | /* Emit code for a conditional branch. |
36a05131 BS |
4754 | XXX: I originally wanted to add a clobber of a CCR register to use in |
4755 | conditional execution, but that confuses the rest of the compiler. */ | |
4756 | ||
4757 | int | |
f90b7a5a | 4758 | frv_emit_cond_branch (rtx operands[]) |
36a05131 BS |
4759 | { |
4760 | rtx test_rtx; | |
4761 | rtx label_ref; | |
4762 | rtx if_else; | |
f90b7a5a PB |
4763 | enum rtx_code test = GET_CODE (operands[0]); |
4764 | rtx cc_reg = frv_emit_comparison (test, operands[1], operands[2]); | |
36a05131 BS |
4765 | enum machine_mode cc_mode = GET_MODE (cc_reg); |
4766 | ||
4767 | /* Branches generate: | |
4768 | (set (pc) | |
4769 | (if_then_else (<test>, <cc_reg>, (const_int 0)) | |
4770 | (label_ref <branch_label>) | |
4771 | (pc))) */ | |
f90b7a5a | 4772 | label_ref = gen_rtx_LABEL_REF (VOIDmode, operands[3]); |
1c563bed | 4773 | test_rtx = gen_rtx_fmt_ee (test, cc_mode, cc_reg, const0_rtx); |
36a05131 BS |
4774 | if_else = gen_rtx_IF_THEN_ELSE (cc_mode, test_rtx, label_ref, pc_rtx); |
4775 | emit_jump_insn (gen_rtx_SET (VOIDmode, pc_rtx, if_else)); | |
4776 | return TRUE; | |
4777 | } | |
4778 | ||
4779 | \f | |
f90b7a5a | 4780 | /* Emit code to set a gpr to 1/0 based on a comparison. */ |
36a05131 BS |
4781 | |
4782 | int | |
f90b7a5a | 4783 | frv_emit_scc (rtx operands[]) |
36a05131 BS |
4784 | { |
4785 | rtx set; | |
4786 | rtx test_rtx; | |
4787 | rtx clobber; | |
4788 | rtx cr_reg; | |
f90b7a5a PB |
4789 | enum rtx_code test = GET_CODE (operands[1]); |
4790 | rtx cc_reg = frv_emit_comparison (test, operands[2], operands[3]); | |
36a05131 BS |
4791 | |
4792 | /* SCC instructions generate: | |
4793 | (parallel [(set <target> (<test>, <cc_reg>, (const_int 0)) | |
4794 | (clobber (<ccr_reg>))]) */ | |
4795 | test_rtx = gen_rtx_fmt_ee (test, SImode, cc_reg, const0_rtx); | |
f90b7a5a | 4796 | set = gen_rtx_SET (VOIDmode, operands[0], test_rtx); |
36a05131 BS |
4797 | |
4798 | cr_reg = ((TARGET_ALLOC_CC) | |
4799 | ? gen_reg_rtx (CC_CCRmode) | |
4800 | : gen_rtx_REG (CC_CCRmode, | |
4801 | ((GET_MODE (cc_reg) == CC_FPmode) | |
4802 | ? FCR_FIRST | |
4803 | : ICR_FIRST))); | |
4804 | ||
4805 | clobber = gen_rtx_CLOBBER (VOIDmode, cr_reg); | |
4806 | emit_insn (gen_rtx_PARALLEL (VOIDmode, gen_rtvec (2, set, clobber))); | |
4807 | return TRUE; | |
4808 | } | |
4809 | ||
4810 | \f | |
4811 | /* Split a SCC instruction into component parts, returning a SEQUENCE to hold | |
839a4992 | 4812 | the separate insns. */ |
36a05131 BS |
4813 | |
4814 | rtx | |
f2206911 | 4815 | frv_split_scc (rtx dest, rtx test, rtx cc_reg, rtx cr_reg, HOST_WIDE_INT value) |
36a05131 BS |
4816 | { |
4817 | rtx ret; | |
4818 | ||
4819 | start_sequence (); | |
4820 | ||
4821 | /* Set the appropriate CCR bit. */ | |
4822 | emit_insn (gen_rtx_SET (VOIDmode, | |
4823 | cr_reg, | |
4824 | gen_rtx_fmt_ee (GET_CODE (test), | |
4825 | GET_MODE (cr_reg), | |
4826 | cc_reg, | |
4827 | const0_rtx))); | |
4828 | ||
4829 | /* Move the value into the destination. */ | |
4830 | emit_move_insn (dest, GEN_INT (value)); | |
4831 | ||
4832 | /* Move 0 into the destination if the test failed */ | |
4833 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
4834 | gen_rtx_EQ (GET_MODE (cr_reg), | |
4835 | cr_reg, | |
4836 | const0_rtx), | |
4837 | gen_rtx_SET (VOIDmode, dest, const0_rtx))); | |
4838 | ||
4839 | /* Finish up, return sequence. */ | |
4840 | ret = get_insns (); | |
4841 | end_sequence (); | |
4842 | return ret; | |
4843 | } | |
4844 | ||
4845 | \f | |
4846 | /* Emit the code for a conditional move, return TRUE if we could do the | |
4847 | move. */ | |
4848 | ||
4849 | int | |
f2206911 | 4850 | frv_emit_cond_move (rtx dest, rtx test_rtx, rtx src1, rtx src2) |
36a05131 BS |
4851 | { |
4852 | rtx set; | |
4853 | rtx clobber_cc; | |
4854 | rtx test2; | |
4855 | rtx cr_reg; | |
4856 | rtx if_rtx; | |
4857 | enum rtx_code test = GET_CODE (test_rtx); | |
f90b7a5a PB |
4858 | rtx cc_reg = frv_emit_comparison (test, |
4859 | XEXP (test_rtx, 0), XEXP (test_rtx, 1)); | |
36a05131 BS |
4860 | enum machine_mode cc_mode = GET_MODE (cc_reg); |
4861 | ||
4862 | /* Conditional move instructions generate: | |
4863 | (parallel [(set <target> | |
4864 | (if_then_else (<test> <cc_reg> (const_int 0)) | |
4865 | <src1> | |
4866 | <src2>)) | |
4867 | (clobber (<ccr_reg>))]) */ | |
4868 | ||
4869 | /* Handle various cases of conditional move involving two constants. */ | |
4870 | if (GET_CODE (src1) == CONST_INT && GET_CODE (src2) == CONST_INT) | |
4871 | { | |
4872 | HOST_WIDE_INT value1 = INTVAL (src1); | |
4873 | HOST_WIDE_INT value2 = INTVAL (src2); | |
4874 | ||
87b483a1 | 4875 | /* Having 0 as one of the constants can be done by loading the other |
36a05131 BS |
4876 | constant, and optionally moving in gr0. */ |
4877 | if (value1 == 0 || value2 == 0) | |
4878 | ; | |
4879 | ||
4880 | /* If the first value is within an addi range and also the difference | |
4881 | between the two fits in an addi's range, load up the difference, then | |
4882 | conditionally move in 0, and then unconditionally add the first | |
4883 | value. */ | |
2f5b1308 JR |
4884 | else if (IN_RANGE (value1, -2048, 2047) |
4885 | && IN_RANGE (value2 - value1, -2048, 2047)) | |
36a05131 BS |
4886 | ; |
4887 | ||
4888 | /* If neither condition holds, just force the constant into a | |
4889 | register. */ | |
4890 | else | |
4891 | { | |
4892 | src1 = force_reg (GET_MODE (dest), src1); | |
4893 | src2 = force_reg (GET_MODE (dest), src2); | |
4894 | } | |
4895 | } | |
4896 | ||
4897 | /* If one value is a register, insure the other value is either 0 or a | |
4898 | register. */ | |
4899 | else | |
4900 | { | |
4901 | if (GET_CODE (src1) == CONST_INT && INTVAL (src1) != 0) | |
4902 | src1 = force_reg (GET_MODE (dest), src1); | |
4903 | ||
4904 | if (GET_CODE (src2) == CONST_INT && INTVAL (src2) != 0) | |
4905 | src2 = force_reg (GET_MODE (dest), src2); | |
4906 | } | |
4907 | ||
4908 | test2 = gen_rtx_fmt_ee (test, cc_mode, cc_reg, const0_rtx); | |
4909 | if_rtx = gen_rtx_IF_THEN_ELSE (GET_MODE (dest), test2, src1, src2); | |
4910 | ||
4911 | set = gen_rtx_SET (VOIDmode, dest, if_rtx); | |
4912 | ||
4913 | cr_reg = ((TARGET_ALLOC_CC) | |
4914 | ? gen_reg_rtx (CC_CCRmode) | |
4915 | : gen_rtx_REG (CC_CCRmode, | |
4916 | (cc_mode == CC_FPmode) ? FCR_FIRST : ICR_FIRST)); | |
4917 | ||
4918 | clobber_cc = gen_rtx_CLOBBER (VOIDmode, cr_reg); | |
4919 | emit_insn (gen_rtx_PARALLEL (VOIDmode, gen_rtvec (2, set, clobber_cc))); | |
4920 | return TRUE; | |
4921 | } | |
4922 | ||
4923 | \f | |
839a4992 | 4924 | /* Split a conditional move into constituent parts, returning a SEQUENCE |
36a05131 BS |
4925 | containing all of the insns. */ |
4926 | ||
4927 | rtx | |
f2206911 | 4928 | frv_split_cond_move (rtx operands[]) |
36a05131 BS |
4929 | { |
4930 | rtx dest = operands[0]; | |
4931 | rtx test = operands[1]; | |
4932 | rtx cc_reg = operands[2]; | |
4933 | rtx src1 = operands[3]; | |
4934 | rtx src2 = operands[4]; | |
4935 | rtx cr_reg = operands[5]; | |
4936 | rtx ret; | |
4937 | enum machine_mode cr_mode = GET_MODE (cr_reg); | |
4938 | ||
4939 | start_sequence (); | |
4940 | ||
4941 | /* Set the appropriate CCR bit. */ | |
4942 | emit_insn (gen_rtx_SET (VOIDmode, | |
4943 | cr_reg, | |
4944 | gen_rtx_fmt_ee (GET_CODE (test), | |
4945 | GET_MODE (cr_reg), | |
4946 | cc_reg, | |
4947 | const0_rtx))); | |
4948 | ||
4949 | /* Handle various cases of conditional move involving two constants. */ | |
4950 | if (GET_CODE (src1) == CONST_INT && GET_CODE (src2) == CONST_INT) | |
4951 | { | |
4952 | HOST_WIDE_INT value1 = INTVAL (src1); | |
4953 | HOST_WIDE_INT value2 = INTVAL (src2); | |
4954 | ||
87b483a1 | 4955 | /* Having 0 as one of the constants can be done by loading the other |
36a05131 BS |
4956 | constant, and optionally moving in gr0. */ |
4957 | if (value1 == 0) | |
4958 | { | |
4959 | emit_move_insn (dest, src2); | |
4960 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
4961 | gen_rtx_NE (cr_mode, cr_reg, | |
4962 | const0_rtx), | |
4963 | gen_rtx_SET (VOIDmode, dest, src1))); | |
4964 | } | |
4965 | ||
4966 | else if (value2 == 0) | |
4967 | { | |
4968 | emit_move_insn (dest, src1); | |
4969 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
4970 | gen_rtx_EQ (cr_mode, cr_reg, | |
4971 | const0_rtx), | |
4972 | gen_rtx_SET (VOIDmode, dest, src2))); | |
4973 | } | |
4974 | ||
4975 | /* If the first value is within an addi range and also the difference | |
4976 | between the two fits in an addi's range, load up the difference, then | |
4977 | conditionally move in 0, and then unconditionally add the first | |
4978 | value. */ | |
2f5b1308 JR |
4979 | else if (IN_RANGE (value1, -2048, 2047) |
4980 | && IN_RANGE (value2 - value1, -2048, 2047)) | |
36a05131 BS |
4981 | { |
4982 | rtx dest_si = ((GET_MODE (dest) == SImode) | |
4983 | ? dest | |
4984 | : gen_rtx_SUBREG (SImode, dest, 0)); | |
4985 | ||
4986 | emit_move_insn (dest_si, GEN_INT (value2 - value1)); | |
4987 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
4988 | gen_rtx_NE (cr_mode, cr_reg, | |
4989 | const0_rtx), | |
4990 | gen_rtx_SET (VOIDmode, dest_si, | |
4991 | const0_rtx))); | |
4992 | emit_insn (gen_addsi3 (dest_si, dest_si, src1)); | |
4993 | } | |
4994 | ||
4995 | else | |
44e91694 | 4996 | gcc_unreachable (); |
36a05131 BS |
4997 | } |
4998 | else | |
4999 | { | |
5000 | /* Emit the conditional move for the test being true if needed. */ | |
5001 | if (! rtx_equal_p (dest, src1)) | |
5002 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5003 | gen_rtx_NE (cr_mode, cr_reg, const0_rtx), | |
5004 | gen_rtx_SET (VOIDmode, dest, src1))); | |
5005 | ||
5006 | /* Emit the conditional move for the test being false if needed. */ | |
5007 | if (! rtx_equal_p (dest, src2)) | |
5008 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5009 | gen_rtx_EQ (cr_mode, cr_reg, const0_rtx), | |
5010 | gen_rtx_SET (VOIDmode, dest, src2))); | |
5011 | } | |
5012 | ||
5013 | /* Finish up, return sequence. */ | |
5014 | ret = get_insns (); | |
5015 | end_sequence (); | |
5016 | return ret; | |
5017 | } | |
5018 | ||
5019 | \f | |
5020 | /* Split (set DEST SOURCE), where DEST is a double register and SOURCE is a | |
5021 | memory location that is not known to be dword-aligned. */ | |
5022 | void | |
f2206911 | 5023 | frv_split_double_load (rtx dest, rtx source) |
36a05131 BS |
5024 | { |
5025 | int regno = REGNO (dest); | |
5026 | rtx dest1 = gen_highpart (SImode, dest); | |
5027 | rtx dest2 = gen_lowpart (SImode, dest); | |
5028 | rtx address = XEXP (source, 0); | |
5029 | ||
5030 | /* If the address is pre-modified, load the lower-numbered register | |
5031 | first, then load the other register using an integer offset from | |
5032 | the modified base register. This order should always be safe, | |
5033 | since the pre-modification cannot affect the same registers as the | |
5034 | load does. | |
5035 | ||
5036 | The situation for other loads is more complicated. Loading one | |
5037 | of the registers could affect the value of ADDRESS, so we must | |
5038 | be careful which order we do them in. */ | |
5039 | if (GET_CODE (address) == PRE_MODIFY | |
5040 | || ! refers_to_regno_p (regno, regno + 1, address, NULL)) | |
5041 | { | |
5042 | /* It is safe to load the lower-numbered register first. */ | |
5043 | emit_move_insn (dest1, change_address (source, SImode, NULL)); | |
5044 | emit_move_insn (dest2, frv_index_memory (source, SImode, 1)); | |
5045 | } | |
5046 | else | |
5047 | { | |
5048 | /* ADDRESS is not pre-modified and the address depends on the | |
5049 | lower-numbered register. Load the higher-numbered register | |
5050 | first. */ | |
5051 | emit_move_insn (dest2, frv_index_memory (source, SImode, 1)); | |
5052 | emit_move_insn (dest1, change_address (source, SImode, NULL)); | |
5053 | } | |
5054 | } | |
5055 | ||
5056 | /* Split (set DEST SOURCE), where DEST refers to a dword memory location | |
5057 | and SOURCE is either a double register or the constant zero. */ | |
5058 | void | |
f2206911 | 5059 | frv_split_double_store (rtx dest, rtx source) |
36a05131 BS |
5060 | { |
5061 | rtx dest1 = change_address (dest, SImode, NULL); | |
5062 | rtx dest2 = frv_index_memory (dest, SImode, 1); | |
5063 | if (ZERO_P (source)) | |
5064 | { | |
5065 | emit_move_insn (dest1, CONST0_RTX (SImode)); | |
5066 | emit_move_insn (dest2, CONST0_RTX (SImode)); | |
5067 | } | |
5068 | else | |
5069 | { | |
5070 | emit_move_insn (dest1, gen_highpart (SImode, source)); | |
5071 | emit_move_insn (dest2, gen_lowpart (SImode, source)); | |
5072 | } | |
5073 | } | |
5074 | ||
5075 | \f | |
5076 | /* Split a min/max operation returning a SEQUENCE containing all of the | |
5077 | insns. */ | |
5078 | ||
5079 | rtx | |
f2206911 | 5080 | frv_split_minmax (rtx operands[]) |
36a05131 BS |
5081 | { |
5082 | rtx dest = operands[0]; | |
5083 | rtx minmax = operands[1]; | |
5084 | rtx src1 = operands[2]; | |
5085 | rtx src2 = operands[3]; | |
5086 | rtx cc_reg = operands[4]; | |
5087 | rtx cr_reg = operands[5]; | |
5088 | rtx ret; | |
5089 | enum rtx_code test_code; | |
5090 | enum machine_mode cr_mode = GET_MODE (cr_reg); | |
5091 | ||
5092 | start_sequence (); | |
5093 | ||
87b483a1 | 5094 | /* Figure out which test to use. */ |
36a05131 BS |
5095 | switch (GET_CODE (minmax)) |
5096 | { | |
5097 | default: | |
44e91694 | 5098 | gcc_unreachable (); |
36a05131 BS |
5099 | |
5100 | case SMIN: test_code = LT; break; | |
5101 | case SMAX: test_code = GT; break; | |
5102 | case UMIN: test_code = LTU; break; | |
5103 | case UMAX: test_code = GTU; break; | |
5104 | } | |
5105 | ||
5106 | /* Issue the compare instruction. */ | |
5107 | emit_insn (gen_rtx_SET (VOIDmode, | |
5108 | cc_reg, | |
5109 | gen_rtx_COMPARE (GET_MODE (cc_reg), | |
5110 | src1, src2))); | |
5111 | ||
5112 | /* Set the appropriate CCR bit. */ | |
5113 | emit_insn (gen_rtx_SET (VOIDmode, | |
5114 | cr_reg, | |
5115 | gen_rtx_fmt_ee (test_code, | |
5116 | GET_MODE (cr_reg), | |
5117 | cc_reg, | |
5118 | const0_rtx))); | |
5119 | ||
9cd10576 | 5120 | /* If are taking the min/max of a nonzero constant, load that first, and |
36a05131 BS |
5121 | then do a conditional move of the other value. */ |
5122 | if (GET_CODE (src2) == CONST_INT && INTVAL (src2) != 0) | |
5123 | { | |
44e91694 | 5124 | gcc_assert (!rtx_equal_p (dest, src1)); |
36a05131 BS |
5125 | |
5126 | emit_move_insn (dest, src2); | |
5127 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5128 | gen_rtx_NE (cr_mode, cr_reg, const0_rtx), | |
5129 | gen_rtx_SET (VOIDmode, dest, src1))); | |
5130 | } | |
5131 | ||
5132 | /* Otherwise, do each half of the move. */ | |
5133 | else | |
5134 | { | |
5135 | /* Emit the conditional move for the test being true if needed. */ | |
5136 | if (! rtx_equal_p (dest, src1)) | |
5137 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5138 | gen_rtx_NE (cr_mode, cr_reg, const0_rtx), | |
5139 | gen_rtx_SET (VOIDmode, dest, src1))); | |
5140 | ||
5141 | /* Emit the conditional move for the test being false if needed. */ | |
5142 | if (! rtx_equal_p (dest, src2)) | |
5143 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5144 | gen_rtx_EQ (cr_mode, cr_reg, const0_rtx), | |
5145 | gen_rtx_SET (VOIDmode, dest, src2))); | |
5146 | } | |
5147 | ||
5148 | /* Finish up, return sequence. */ | |
5149 | ret = get_insns (); | |
5150 | end_sequence (); | |
5151 | return ret; | |
5152 | } | |
5153 | ||
5154 | \f | |
5155 | /* Split an integer abs operation returning a SEQUENCE containing all of the | |
5156 | insns. */ | |
5157 | ||
5158 | rtx | |
f2206911 | 5159 | frv_split_abs (rtx operands[]) |
36a05131 BS |
5160 | { |
5161 | rtx dest = operands[0]; | |
5162 | rtx src = operands[1]; | |
5163 | rtx cc_reg = operands[2]; | |
5164 | rtx cr_reg = operands[3]; | |
5165 | rtx ret; | |
5166 | ||
5167 | start_sequence (); | |
5168 | ||
5169 | /* Issue the compare < 0 instruction. */ | |
5170 | emit_insn (gen_rtx_SET (VOIDmode, | |
5171 | cc_reg, | |
5172 | gen_rtx_COMPARE (CCmode, src, const0_rtx))); | |
5173 | ||
5174 | /* Set the appropriate CCR bit. */ | |
5175 | emit_insn (gen_rtx_SET (VOIDmode, | |
5176 | cr_reg, | |
5177 | gen_rtx_fmt_ee (LT, CC_CCRmode, cc_reg, const0_rtx))); | |
5178 | ||
87b483a1 | 5179 | /* Emit the conditional negate if the value is negative. */ |
36a05131 BS |
5180 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, |
5181 | gen_rtx_NE (CC_CCRmode, cr_reg, const0_rtx), | |
5182 | gen_negsi2 (dest, src))); | |
5183 | ||
5184 | /* Emit the conditional move for the test being false if needed. */ | |
5185 | if (! rtx_equal_p (dest, src)) | |
5186 | emit_insn (gen_rtx_COND_EXEC (VOIDmode, | |
5187 | gen_rtx_EQ (CC_CCRmode, cr_reg, const0_rtx), | |
5188 | gen_rtx_SET (VOIDmode, dest, src))); | |
5189 | ||
5190 | /* Finish up, return sequence. */ | |
5191 | ret = get_insns (); | |
5192 | end_sequence (); | |
5193 | return ret; | |
5194 | } | |
5195 | ||
5196 | \f | |
5197 | /* An internal function called by for_each_rtx to clear in a hard_reg set each | |
5198 | register used in an insn. */ | |
5199 | ||
5200 | static int | |
f2206911 | 5201 | frv_clear_registers_used (rtx *ptr, void *data) |
36a05131 BS |
5202 | { |
5203 | if (GET_CODE (*ptr) == REG) | |
5204 | { | |
5205 | int regno = REGNO (*ptr); | |
5206 | HARD_REG_SET *p_regs = (HARD_REG_SET *)data; | |
5207 | ||
5208 | if (regno < FIRST_PSEUDO_REGISTER) | |
5209 | { | |
5210 | int reg_max = regno + HARD_REGNO_NREGS (regno, GET_MODE (*ptr)); | |
5211 | ||
5212 | while (regno < reg_max) | |
5213 | { | |
5214 | CLEAR_HARD_REG_BIT (*p_regs, regno); | |
5215 | regno++; | |
5216 | } | |
5217 | } | |
5218 | } | |
5219 | ||
5220 | return 0; | |
5221 | } | |
5222 | ||
5223 | \f | |
67a0732f SB |
5224 | /* Initialize machine-specific if-conversion data. |
5225 | On the FR-V, we don't have any extra fields per se, but it is useful hook to | |
36a05131 BS |
5226 | initialize the static storage. */ |
5227 | void | |
afa63532 | 5228 | frv_ifcvt_machdep_init (void *ce_info ATTRIBUTE_UNUSED) |
36a05131 BS |
5229 | { |
5230 | frv_ifcvt.added_insns_list = NULL_RTX; | |
5231 | frv_ifcvt.cur_scratch_regs = 0; | |
5232 | frv_ifcvt.num_nested_cond_exec = 0; | |
5233 | frv_ifcvt.cr_reg = NULL_RTX; | |
5234 | frv_ifcvt.nested_cc_reg = NULL_RTX; | |
5235 | frv_ifcvt.extra_int_cr = NULL_RTX; | |
5236 | frv_ifcvt.extra_fp_cr = NULL_RTX; | |
5237 | frv_ifcvt.last_nested_if_cr = NULL_RTX; | |
5238 | } | |
5239 | ||
5240 | \f | |
1ae58c30 | 5241 | /* Internal function to add a potential insn to the list of insns to be inserted |
36a05131 BS |
5242 | if the conditional execution conversion is successful. */ |
5243 | ||
5244 | static void | |
f2206911 | 5245 | frv_ifcvt_add_insn (rtx pattern, rtx insn, int before_p) |
36a05131 BS |
5246 | { |
5247 | rtx link = alloc_EXPR_LIST (VOIDmode, pattern, insn); | |
5248 | ||
87b483a1 | 5249 | link->jump = before_p; /* Mark to add this before or after insn. */ |
36a05131 BS |
5250 | frv_ifcvt.added_insns_list = alloc_EXPR_LIST (VOIDmode, link, |
5251 | frv_ifcvt.added_insns_list); | |
5252 | ||
5253 | if (TARGET_DEBUG_COND_EXEC) | |
5254 | { | |
5255 | fprintf (stderr, | |
5256 | "\n:::::::::: frv_ifcvt_add_insn: add the following %s insn %d:\n", | |
5257 | (before_p) ? "before" : "after", | |
5258 | (int)INSN_UID (insn)); | |
5259 | ||
5260 | debug_rtx (pattern); | |
5261 | } | |
5262 | } | |
5263 | ||
5264 | \f | |
5265 | /* A C expression to modify the code described by the conditional if | |
5266 | information CE_INFO, possibly updating the tests in TRUE_EXPR, and | |
5267 | FALSE_EXPR for converting if-then and if-then-else code to conditional | |
5268 | instructions. Set either TRUE_EXPR or FALSE_EXPR to a null pointer if the | |
5269 | tests cannot be converted. */ | |
5270 | ||
5271 | void | |
f2206911 | 5272 | frv_ifcvt_modify_tests (ce_if_block_t *ce_info, rtx *p_true, rtx *p_false) |
36a05131 BS |
5273 | { |
5274 | basic_block test_bb = ce_info->test_bb; /* test basic block */ | |
5275 | basic_block then_bb = ce_info->then_bb; /* THEN */ | |
5276 | basic_block else_bb = ce_info->else_bb; /* ELSE or NULL */ | |
5277 | basic_block join_bb = ce_info->join_bb; /* join block or NULL */ | |
5278 | rtx true_expr = *p_true; | |
5279 | rtx cr; | |
5280 | rtx cc; | |
5281 | rtx nested_cc; | |
5282 | enum machine_mode mode = GET_MODE (true_expr); | |
5283 | int j; | |
5284 | basic_block *bb; | |
5285 | int num_bb; | |
5286 | frv_tmp_reg_t *tmp_reg = &frv_ifcvt.tmp_reg; | |
5287 | rtx check_insn; | |
5288 | rtx sub_cond_exec_reg; | |
5289 | enum rtx_code code; | |
5290 | enum rtx_code code_true; | |
5291 | enum rtx_code code_false; | |
5292 | enum reg_class cc_class; | |
5293 | enum reg_class cr_class; | |
5294 | int cc_first; | |
5295 | int cc_last; | |
a2041967 | 5296 | reg_set_iterator rsi; |
36a05131 BS |
5297 | |
5298 | /* Make sure we are only dealing with hard registers. Also honor the | |
5299 | -mno-cond-exec switch, and -mno-nested-cond-exec switches if | |
5300 | applicable. */ | |
0b2c18fe RS |
5301 | if (!reload_completed || !TARGET_COND_EXEC |
5302 | || (!TARGET_NESTED_CE && ce_info->pass > 1)) | |
36a05131 BS |
5303 | goto fail; |
5304 | ||
5305 | /* Figure out which registers we can allocate for our own purposes. Only | |
5306 | consider registers that are not preserved across function calls and are | |
5307 | not fixed. However, allow the ICC/ICR temporary registers to be allocated | |
87b483a1 | 5308 | if we did not need to use them in reloading other registers. */ |
fad205ff | 5309 | memset (&tmp_reg->regs, 0, sizeof (tmp_reg->regs)); |
36a05131 BS |
5310 | COPY_HARD_REG_SET (tmp_reg->regs, call_used_reg_set); |
5311 | AND_COMPL_HARD_REG_SET (tmp_reg->regs, fixed_reg_set); | |
5312 | SET_HARD_REG_BIT (tmp_reg->regs, ICC_TEMP); | |
5313 | SET_HARD_REG_BIT (tmp_reg->regs, ICR_TEMP); | |
5314 | ||
5315 | /* If this is a nested IF, we need to discover whether the CC registers that | |
5316 | are set/used inside of the block are used anywhere else. If not, we can | |
5317 | change them to be the CC register that is paired with the CR register that | |
5318 | controls the outermost IF block. */ | |
5319 | if (ce_info->pass > 1) | |
5320 | { | |
5321 | CLEAR_HARD_REG_SET (frv_ifcvt.nested_cc_ok_rewrite); | |
5322 | for (j = CC_FIRST; j <= CC_LAST; j++) | |
5323 | if (TEST_HARD_REG_BIT (tmp_reg->regs, j)) | |
5324 | { | |
eedd7243 | 5325 | if (REGNO_REG_SET_P (df_get_live_in (then_bb), j)) |
36a05131 BS |
5326 | continue; |
5327 | ||
5e2d947c | 5328 | if (else_bb |
eedd7243 | 5329 | && REGNO_REG_SET_P (df_get_live_in (else_bb), j)) |
36a05131 BS |
5330 | continue; |
5331 | ||
5e2d947c | 5332 | if (join_bb |
eedd7243 | 5333 | && REGNO_REG_SET_P (df_get_live_in (join_bb), j)) |
36a05131 BS |
5334 | continue; |
5335 | ||
5336 | SET_HARD_REG_BIT (frv_ifcvt.nested_cc_ok_rewrite, j); | |
5337 | } | |
5338 | } | |
5339 | ||
5340 | for (j = 0; j < frv_ifcvt.cur_scratch_regs; j++) | |
5341 | frv_ifcvt.scratch_regs[j] = NULL_RTX; | |
5342 | ||
5343 | frv_ifcvt.added_insns_list = NULL_RTX; | |
5344 | frv_ifcvt.cur_scratch_regs = 0; | |
5345 | ||
5346 | bb = (basic_block *) alloca ((2 + ce_info->num_multiple_test_blocks) | |
5347 | * sizeof (basic_block)); | |
5348 | ||
5349 | if (join_bb) | |
5350 | { | |
38c28a25 | 5351 | unsigned int regno; |
36a05131 BS |
5352 | |
5353 | /* Remove anything live at the beginning of the join block from being | |
5354 | available for allocation. */ | |
eedd7243 | 5355 | EXECUTE_IF_SET_IN_REG_SET (df_get_live_in (join_bb), 0, regno, rsi) |
a2041967 KH |
5356 | { |
5357 | if (regno < FIRST_PSEUDO_REGISTER) | |
5358 | CLEAR_HARD_REG_BIT (tmp_reg->regs, regno); | |
5359 | } | |
36a05131 BS |
5360 | } |
5361 | ||
5362 | /* Add in all of the blocks in multiple &&/|| blocks to be scanned. */ | |
5363 | num_bb = 0; | |
5364 | if (ce_info->num_multiple_test_blocks) | |
5365 | { | |
5366 | basic_block multiple_test_bb = ce_info->last_test_bb; | |
5367 | ||
5368 | while (multiple_test_bb != test_bb) | |
5369 | { | |
5370 | bb[num_bb++] = multiple_test_bb; | |
628f6a4e | 5371 | multiple_test_bb = EDGE_PRED (multiple_test_bb, 0)->src; |
36a05131 BS |
5372 | } |
5373 | } | |
5374 | ||
5375 | /* Add in the THEN and ELSE blocks to be scanned. */ | |
5376 | bb[num_bb++] = then_bb; | |
5377 | if (else_bb) | |
5378 | bb[num_bb++] = else_bb; | |
5379 | ||
5380 | sub_cond_exec_reg = NULL_RTX; | |
5381 | frv_ifcvt.num_nested_cond_exec = 0; | |
5382 | ||
5383 | /* Scan all of the blocks for registers that must not be allocated. */ | |
5384 | for (j = 0; j < num_bb; j++) | |
5385 | { | |
a813c111 SB |
5386 | rtx last_insn = BB_END (bb[j]); |
5387 | rtx insn = BB_HEAD (bb[j]); | |
38c28a25 | 5388 | unsigned int regno; |
36a05131 | 5389 | |
c263766c RH |
5390 | if (dump_file) |
5391 | fprintf (dump_file, "Scanning %s block %d, start %d, end %d\n", | |
36a05131 BS |
5392 | (bb[j] == else_bb) ? "else" : ((bb[j] == then_bb) ? "then" : "test"), |
5393 | (int) bb[j]->index, | |
a813c111 SB |
5394 | (int) INSN_UID (BB_HEAD (bb[j])), |
5395 | (int) INSN_UID (BB_END (bb[j]))); | |
36a05131 BS |
5396 | |
5397 | /* Anything live at the beginning of the block is obviously unavailable | |
5398 | for allocation. */ | |
eedd7243 | 5399 | EXECUTE_IF_SET_IN_REG_SET (df_get_live_in (bb[j]), 0, regno, rsi) |
a2041967 KH |
5400 | { |
5401 | if (regno < FIRST_PSEUDO_REGISTER) | |
5402 | CLEAR_HARD_REG_BIT (tmp_reg->regs, regno); | |
5403 | } | |
36a05131 | 5404 | |
87b483a1 | 5405 | /* Loop through the insns in the block. */ |
36a05131 BS |
5406 | for (;;) |
5407 | { | |
5408 | /* Mark any new registers that are created as being unavailable for | |
5409 | allocation. Also see if the CC register used in nested IFs can be | |
5410 | reallocated. */ | |
5411 | if (INSN_P (insn)) | |
5412 | { | |
5413 | rtx pattern; | |
5414 | rtx set; | |
5415 | int skip_nested_if = FALSE; | |
5416 | ||
5417 | for_each_rtx (&PATTERN (insn), frv_clear_registers_used, | |
5418 | (void *)&tmp_reg->regs); | |
5419 | ||
5420 | pattern = PATTERN (insn); | |
5421 | if (GET_CODE (pattern) == COND_EXEC) | |
5422 | { | |
5423 | rtx reg = XEXP (COND_EXEC_TEST (pattern), 0); | |
5424 | ||
5425 | if (reg != sub_cond_exec_reg) | |
5426 | { | |
5427 | sub_cond_exec_reg = reg; | |
5428 | frv_ifcvt.num_nested_cond_exec++; | |
5429 | } | |
5430 | } | |
5431 | ||
5432 | set = single_set_pattern (pattern); | |
5433 | if (set) | |
5434 | { | |
5435 | rtx dest = SET_DEST (set); | |
5436 | rtx src = SET_SRC (set); | |
5437 | ||
5438 | if (GET_CODE (dest) == REG) | |
5439 | { | |
5440 | int regno = REGNO (dest); | |
5441 | enum rtx_code src_code = GET_CODE (src); | |
5442 | ||
5443 | if (CC_P (regno) && src_code == COMPARE) | |
5444 | skip_nested_if = TRUE; | |
5445 | ||
5446 | else if (CR_P (regno) | |
5447 | && (src_code == IF_THEN_ELSE | |
ec8e098d | 5448 | || COMPARISON_P (src))) |
36a05131 BS |
5449 | skip_nested_if = TRUE; |
5450 | } | |
5451 | } | |
5452 | ||
5453 | if (! skip_nested_if) | |
5454 | for_each_rtx (&PATTERN (insn), frv_clear_registers_used, | |
5455 | (void *)&frv_ifcvt.nested_cc_ok_rewrite); | |
5456 | } | |
5457 | ||
5458 | if (insn == last_insn) | |
5459 | break; | |
5460 | ||
5461 | insn = NEXT_INSN (insn); | |
5462 | } | |
5463 | } | |
5464 | ||
5465 | /* If this is a nested if, rewrite the CC registers that are available to | |
5466 | include the ones that can be rewritten, to increase the chance of being | |
5467 | able to allocate a paired CC/CR register combination. */ | |
5468 | if (ce_info->pass > 1) | |
5469 | { | |
5470 | for (j = CC_FIRST; j <= CC_LAST; j++) | |
5471 | if (TEST_HARD_REG_BIT (frv_ifcvt.nested_cc_ok_rewrite, j)) | |
5472 | SET_HARD_REG_BIT (tmp_reg->regs, j); | |
5473 | else | |
5474 | CLEAR_HARD_REG_BIT (tmp_reg->regs, j); | |
5475 | } | |
5476 | ||
c263766c | 5477 | if (dump_file) |
36a05131 BS |
5478 | { |
5479 | int num_gprs = 0; | |
c263766c | 5480 | fprintf (dump_file, "Available GPRs: "); |
36a05131 BS |
5481 | |
5482 | for (j = GPR_FIRST; j <= GPR_LAST; j++) | |
5483 | if (TEST_HARD_REG_BIT (tmp_reg->regs, j)) | |
5484 | { | |
c263766c | 5485 | fprintf (dump_file, " %d [%s]", j, reg_names[j]); |
36a05131 BS |
5486 | if (++num_gprs > GPR_TEMP_NUM+2) |
5487 | break; | |
5488 | } | |
5489 | ||
c263766c | 5490 | fprintf (dump_file, "%s\nAvailable CRs: ", |
36a05131 BS |
5491 | (num_gprs > GPR_TEMP_NUM+2) ? " ..." : ""); |
5492 | ||
5493 | for (j = CR_FIRST; j <= CR_LAST; j++) | |
5494 | if (TEST_HARD_REG_BIT (tmp_reg->regs, j)) | |
c263766c | 5495 | fprintf (dump_file, " %d [%s]", j, reg_names[j]); |
36a05131 | 5496 | |
c263766c | 5497 | fputs ("\n", dump_file); |
36a05131 BS |
5498 | |
5499 | if (ce_info->pass > 1) | |
5500 | { | |
c263766c | 5501 | fprintf (dump_file, "Modifiable CCs: "); |
36a05131 BS |
5502 | for (j = CC_FIRST; j <= CC_LAST; j++) |
5503 | if (TEST_HARD_REG_BIT (tmp_reg->regs, j)) | |
c263766c | 5504 | fprintf (dump_file, " %d [%s]", j, reg_names[j]); |
36a05131 | 5505 | |
c263766c | 5506 | fprintf (dump_file, "\n%d nested COND_EXEC statements\n", |
36a05131 BS |
5507 | frv_ifcvt.num_nested_cond_exec); |
5508 | } | |
5509 | } | |
5510 | ||
5511 | /* Allocate the appropriate temporary condition code register. Try to | |
5512 | allocate the ICR/FCR register that corresponds to the ICC/FCC register so | |
5513 | that conditional cmp's can be done. */ | |
036ff63f | 5514 | if (mode == CCmode || mode == CC_UNSmode || mode == CC_NZmode) |
36a05131 BS |
5515 | { |
5516 | cr_class = ICR_REGS; | |
5517 | cc_class = ICC_REGS; | |
5518 | cc_first = ICC_FIRST; | |
5519 | cc_last = ICC_LAST; | |
5520 | } | |
5521 | else if (mode == CC_FPmode) | |
5522 | { | |
5523 | cr_class = FCR_REGS; | |
5524 | cc_class = FCC_REGS; | |
5525 | cc_first = FCC_FIRST; | |
5526 | cc_last = FCC_LAST; | |
5527 | } | |
5528 | else | |
5529 | { | |
5530 | cc_first = cc_last = 0; | |
5531 | cr_class = cc_class = NO_REGS; | |
5532 | } | |
5533 | ||
5534 | cc = XEXP (true_expr, 0); | |
5535 | nested_cc = cr = NULL_RTX; | |
5536 | if (cc_class != NO_REGS) | |
5537 | { | |
5538 | /* For nested IFs and &&/||, see if we can find a CC and CR register pair | |
5539 | so we can execute a csubcc/caddcc/cfcmps instruction. */ | |
5540 | int cc_regno; | |
5541 | ||
5542 | for (cc_regno = cc_first; cc_regno <= cc_last; cc_regno++) | |
5543 | { | |
5544 | int cr_regno = cc_regno - CC_FIRST + CR_FIRST; | |
5545 | ||
5546 | if (TEST_HARD_REG_BIT (frv_ifcvt.tmp_reg.regs, cc_regno) | |
5547 | && TEST_HARD_REG_BIT (frv_ifcvt.tmp_reg.regs, cr_regno)) | |
5548 | { | |
5549 | frv_ifcvt.tmp_reg.next_reg[ (int)cr_class ] = cr_regno; | |
5550 | cr = frv_alloc_temp_reg (tmp_reg, cr_class, CC_CCRmode, TRUE, | |
5551 | TRUE); | |
5552 | ||
5553 | frv_ifcvt.tmp_reg.next_reg[ (int)cc_class ] = cc_regno; | |
5554 | nested_cc = frv_alloc_temp_reg (tmp_reg, cc_class, CCmode, | |
5555 | TRUE, TRUE); | |
5556 | break; | |
5557 | } | |
5558 | } | |
5559 | } | |
5560 | ||
5561 | if (! cr) | |
5562 | { | |
c263766c RH |
5563 | if (dump_file) |
5564 | fprintf (dump_file, "Could not allocate a CR temporary register\n"); | |
36a05131 BS |
5565 | |
5566 | goto fail; | |
5567 | } | |
5568 | ||
c263766c RH |
5569 | if (dump_file) |
5570 | fprintf (dump_file, | |
36a05131 BS |
5571 | "Will use %s for conditional execution, %s for nested comparisons\n", |
5572 | reg_names[ REGNO (cr)], | |
5573 | (nested_cc) ? reg_names[ REGNO (nested_cc) ] : "<none>"); | |
5574 | ||
5575 | /* Set the CCR bit. Note for integer tests, we reverse the condition so that | |
5576 | in an IF-THEN-ELSE sequence, we are testing the TRUE case against the CCR | |
5577 | bit being true. We don't do this for floating point, because of NaNs. */ | |
5578 | code = GET_CODE (true_expr); | |
5579 | if (GET_MODE (cc) != CC_FPmode) | |
5580 | { | |
5581 | code = reverse_condition (code); | |
5582 | code_true = EQ; | |
5583 | code_false = NE; | |
5584 | } | |
5585 | else | |
5586 | { | |
5587 | code_true = NE; | |
5588 | code_false = EQ; | |
5589 | } | |
5590 | ||
5591 | check_insn = gen_rtx_SET (VOIDmode, cr, | |
5592 | gen_rtx_fmt_ee (code, CC_CCRmode, cc, const0_rtx)); | |
5593 | ||
5594 | /* Record the check insn to be inserted later. */ | |
a813c111 | 5595 | frv_ifcvt_add_insn (check_insn, BB_END (test_bb), TRUE); |
36a05131 BS |
5596 | |
5597 | /* Update the tests. */ | |
5598 | frv_ifcvt.cr_reg = cr; | |
5599 | frv_ifcvt.nested_cc_reg = nested_cc; | |
5600 | *p_true = gen_rtx_fmt_ee (code_true, CC_CCRmode, cr, const0_rtx); | |
5601 | *p_false = gen_rtx_fmt_ee (code_false, CC_CCRmode, cr, const0_rtx); | |
5602 | return; | |
5603 | ||
5604 | /* Fail, don't do this conditional execution. */ | |
5605 | fail: | |
5606 | *p_true = NULL_RTX; | |
5607 | *p_false = NULL_RTX; | |
c263766c RH |
5608 | if (dump_file) |
5609 | fprintf (dump_file, "Disabling this conditional execution.\n"); | |
36a05131 BS |
5610 | |
5611 | return; | |
5612 | } | |
5613 | ||
5614 | \f | |
5615 | /* A C expression to modify the code described by the conditional if | |
5616 | information CE_INFO, for the basic block BB, possibly updating the tests in | |
5617 | TRUE_EXPR, and FALSE_EXPR for converting the && and || parts of if-then or | |
5618 | if-then-else code to conditional instructions. Set either TRUE_EXPR or | |
5619 | FALSE_EXPR to a null pointer if the tests cannot be converted. */ | |
5620 | ||
5621 | /* p_true and p_false are given expressions of the form: | |
5622 | ||
5623 | (and (eq:CC_CCR (reg:CC_CCR) | |
5624 | (const_int 0)) | |
5625 | (eq:CC (reg:CC) | |
5626 | (const_int 0))) */ | |
5627 | ||
5628 | void | |
f2206911 KC |
5629 | frv_ifcvt_modify_multiple_tests (ce_if_block_t *ce_info, |
5630 | basic_block bb, | |
5631 | rtx *p_true, | |
5632 | rtx *p_false) | |
36a05131 BS |
5633 | { |
5634 | rtx old_true = XEXP (*p_true, 0); | |
5635 | rtx old_false = XEXP (*p_false, 0); | |
5636 | rtx true_expr = XEXP (*p_true, 1); | |
5637 | rtx false_expr = XEXP (*p_false, 1); | |
5638 | rtx test_expr; | |
5639 | rtx old_test; | |
5640 | rtx cr = XEXP (old_true, 0); | |
5641 | rtx check_insn; | |
5642 | rtx new_cr = NULL_RTX; | |
5643 | rtx *p_new_cr = (rtx *)0; | |
5644 | rtx if_else; | |
5645 | rtx compare; | |
5646 | rtx cc; | |
5647 | enum reg_class cr_class; | |
5648 | enum machine_mode mode = GET_MODE (true_expr); | |
5649 | rtx (*logical_func)(rtx, rtx, rtx); | |
5650 | ||
5651 | if (TARGET_DEBUG_COND_EXEC) | |
5652 | { | |
5653 | fprintf (stderr, | |
5654 | "\n:::::::::: frv_ifcvt_modify_multiple_tests, before modification for %s\ntrue insn:\n", | |
5655 | ce_info->and_and_p ? "&&" : "||"); | |
5656 | ||
5657 | debug_rtx (*p_true); | |
5658 | ||
5659 | fputs ("\nfalse insn:\n", stderr); | |
5660 | debug_rtx (*p_false); | |
5661 | } | |
5662 | ||
0b2c18fe | 5663 | if (!TARGET_MULTI_CE) |
36a05131 BS |
5664 | goto fail; |
5665 | ||
5666 | if (GET_CODE (cr) != REG) | |
5667 | goto fail; | |
b16c1435 | 5668 | |
036ff63f | 5669 | if (mode == CCmode || mode == CC_UNSmode || mode == CC_NZmode) |
36a05131 BS |
5670 | { |
5671 | cr_class = ICR_REGS; | |
5672 | p_new_cr = &frv_ifcvt.extra_int_cr; | |
5673 | } | |
5674 | else if (mode == CC_FPmode) | |
5675 | { | |
5676 | cr_class = FCR_REGS; | |
5677 | p_new_cr = &frv_ifcvt.extra_fp_cr; | |
5678 | } | |
5679 | else | |
5680 | goto fail; | |
5681 | ||
5682 | /* Allocate a temp CR, reusing a previously allocated temp CR if we have 3 or | |
5683 | more &&/|| tests. */ | |
5684 | new_cr = *p_new_cr; | |
5685 | if (! new_cr) | |
5686 | { | |
5687 | new_cr = *p_new_cr = frv_alloc_temp_reg (&frv_ifcvt.tmp_reg, cr_class, | |
5688 | CC_CCRmode, TRUE, TRUE); | |
5689 | if (! new_cr) | |
5690 | goto fail; | |
5691 | } | |
5692 | ||
5693 | if (ce_info->and_and_p) | |
5694 | { | |
5695 | old_test = old_false; | |
5696 | test_expr = true_expr; | |
5697 | logical_func = (GET_CODE (old_true) == EQ) ? gen_andcr : gen_andncr; | |
5698 | *p_true = gen_rtx_NE (CC_CCRmode, cr, const0_rtx); | |
5699 | *p_false = gen_rtx_EQ (CC_CCRmode, cr, const0_rtx); | |
5700 | } | |
5701 | else | |
5702 | { | |
5703 | old_test = old_false; | |
5704 | test_expr = false_expr; | |
5705 | logical_func = (GET_CODE (old_false) == EQ) ? gen_orcr : gen_orncr; | |
5706 | *p_true = gen_rtx_EQ (CC_CCRmode, cr, const0_rtx); | |
5707 | *p_false = gen_rtx_NE (CC_CCRmode, cr, const0_rtx); | |
5708 | } | |
5709 | ||
5710 | /* First add the andcr/andncr/orcr/orncr, which will be added after the | |
5711 | conditional check instruction, due to frv_ifcvt_add_insn being a LIFO | |
5712 | stack. */ | |
a813c111 | 5713 | frv_ifcvt_add_insn ((*logical_func) (cr, cr, new_cr), BB_END (bb), TRUE); |
36a05131 BS |
5714 | |
5715 | /* Now add the conditional check insn. */ | |
5716 | cc = XEXP (test_expr, 0); | |
5717 | compare = gen_rtx_fmt_ee (GET_CODE (test_expr), CC_CCRmode, cc, const0_rtx); | |
5718 | if_else = gen_rtx_IF_THEN_ELSE (CC_CCRmode, old_test, compare, const0_rtx); | |
5719 | ||
5720 | check_insn = gen_rtx_SET (VOIDmode, new_cr, if_else); | |
5721 | ||
87b483a1 | 5722 | /* Add the new check insn to the list of check insns that need to be |
36a05131 | 5723 | inserted. */ |
a813c111 | 5724 | frv_ifcvt_add_insn (check_insn, BB_END (bb), TRUE); |
36a05131 BS |
5725 | |
5726 | if (TARGET_DEBUG_COND_EXEC) | |
5727 | { | |
5728 | fputs ("\n:::::::::: frv_ifcvt_modify_multiple_tests, after modification\ntrue insn:\n", | |
5729 | stderr); | |
5730 | ||
5731 | debug_rtx (*p_true); | |
5732 | ||
5733 | fputs ("\nfalse insn:\n", stderr); | |
5734 | debug_rtx (*p_false); | |
5735 | } | |
5736 | ||
5737 | return; | |
5738 | ||
5739 | fail: | |
5740 | *p_true = *p_false = NULL_RTX; | |
5741 | ||
87b483a1 | 5742 | /* If we allocated a CR register, release it. */ |
36a05131 BS |
5743 | if (new_cr) |
5744 | { | |
5745 | CLEAR_HARD_REG_BIT (frv_ifcvt.tmp_reg.regs, REGNO (new_cr)); | |
5746 | *p_new_cr = NULL_RTX; | |
5747 | } | |
5748 | ||
5749 | if (TARGET_DEBUG_COND_EXEC) | |
5750 | fputs ("\n:::::::::: frv_ifcvt_modify_multiple_tests, failed.\n", stderr); | |
5751 | ||
5752 | return; | |
5753 | } | |
5754 | ||
5755 | \f | |
5756 | /* Return a register which will be loaded with a value if an IF block is | |
5757 | converted to conditional execution. This is used to rewrite instructions | |
5758 | that use constants to ones that just use registers. */ | |
5759 | ||
5760 | static rtx | |
f2206911 | 5761 | frv_ifcvt_load_value (rtx value, rtx insn ATTRIBUTE_UNUSED) |
36a05131 BS |
5762 | { |
5763 | int num_alloc = frv_ifcvt.cur_scratch_regs; | |
5764 | int i; | |
5765 | rtx reg; | |
5766 | ||
5767 | /* We know gr0 == 0, so replace any errant uses. */ | |
5768 | if (value == const0_rtx) | |
5769 | return gen_rtx_REG (SImode, GPR_FIRST); | |
5770 | ||
5771 | /* First search all registers currently loaded to see if we have an | |
5772 | applicable constant. */ | |
5773 | if (CONSTANT_P (value) | |
5774 | || (GET_CODE (value) == REG && REGNO (value) == LR_REGNO)) | |
5775 | { | |
5776 | for (i = 0; i < num_alloc; i++) | |
5777 | { | |
5778 | if (rtx_equal_p (SET_SRC (frv_ifcvt.scratch_regs[i]), value)) | |
5779 | return SET_DEST (frv_ifcvt.scratch_regs[i]); | |
5780 | } | |
5781 | } | |
5782 | ||
87b483a1 | 5783 | /* Have we exhausted the number of registers available? */ |
36a05131 BS |
5784 | if (num_alloc >= GPR_TEMP_NUM) |
5785 | { | |
c263766c RH |
5786 | if (dump_file) |
5787 | fprintf (dump_file, "Too many temporary registers allocated\n"); | |
36a05131 BS |
5788 | |
5789 | return NULL_RTX; | |
5790 | } | |
5791 | ||
5792 | /* Allocate the new register. */ | |
5793 | reg = frv_alloc_temp_reg (&frv_ifcvt.tmp_reg, GPR_REGS, SImode, TRUE, TRUE); | |
5794 | if (! reg) | |
5795 | { | |
c263766c RH |
5796 | if (dump_file) |
5797 | fputs ("Could not find a scratch register\n", dump_file); | |
36a05131 BS |
5798 | |
5799 | return NULL_RTX; | |
5800 | } | |
5801 | ||
5802 | frv_ifcvt.cur_scratch_regs++; | |
5803 | frv_ifcvt.scratch_regs[num_alloc] = gen_rtx_SET (VOIDmode, reg, value); | |
5804 | ||
c263766c | 5805 | if (dump_file) |
36a05131 BS |
5806 | { |
5807 | if (GET_CODE (value) == CONST_INT) | |
c263766c | 5808 | fprintf (dump_file, "Register %s will hold %ld\n", |
36a05131 BS |
5809 | reg_names[ REGNO (reg)], (long)INTVAL (value)); |
5810 | ||
5811 | else if (GET_CODE (value) == REG && REGNO (value) == LR_REGNO) | |
c263766c | 5812 | fprintf (dump_file, "Register %s will hold LR\n", |
36a05131 BS |
5813 | reg_names[ REGNO (reg)]); |
5814 | ||
5815 | else | |
c263766c | 5816 | fprintf (dump_file, "Register %s will hold a saved value\n", |
36a05131 BS |
5817 | reg_names[ REGNO (reg)]); |
5818 | } | |
5819 | ||
5820 | return reg; | |
5821 | } | |
5822 | ||
5823 | \f | |
5824 | /* Update a MEM used in conditional code that might contain an offset to put | |
5825 | the offset into a scratch register, so that the conditional load/store | |
5826 | operations can be used. This function returns the original pointer if the | |
5827 | MEM is valid to use in conditional code, NULL if we can't load up the offset | |
5828 | into a temporary register, or the new MEM if we were successful. */ | |
5829 | ||
5830 | static rtx | |
f2206911 | 5831 | frv_ifcvt_rewrite_mem (rtx mem, enum machine_mode mode, rtx insn) |
36a05131 BS |
5832 | { |
5833 | rtx addr = XEXP (mem, 0); | |
5834 | ||
c6c3dba9 | 5835 | if (!frv_legitimate_address_p_1 (mode, addr, reload_completed, TRUE, FALSE)) |
36a05131 BS |
5836 | { |
5837 | if (GET_CODE (addr) == PLUS) | |
5838 | { | |
5839 | rtx addr_op0 = XEXP (addr, 0); | |
5840 | rtx addr_op1 = XEXP (addr, 1); | |
5841 | ||
34208acf | 5842 | if (GET_CODE (addr_op0) == REG && CONSTANT_P (addr_op1)) |
36a05131 BS |
5843 | { |
5844 | rtx reg = frv_ifcvt_load_value (addr_op1, insn); | |
5845 | if (!reg) | |
5846 | return NULL_RTX; | |
5847 | ||
5848 | addr = gen_rtx_PLUS (Pmode, addr_op0, reg); | |
5849 | } | |
5850 | ||
5851 | else | |
5852 | return NULL_RTX; | |
5853 | } | |
5854 | ||
5855 | else if (CONSTANT_P (addr)) | |
5856 | addr = frv_ifcvt_load_value (addr, insn); | |
5857 | ||
5858 | else | |
5859 | return NULL_RTX; | |
5860 | ||
5861 | if (addr == NULL_RTX) | |
5862 | return NULL_RTX; | |
5863 | ||
5864 | else if (XEXP (mem, 0) != addr) | |
5865 | return change_address (mem, mode, addr); | |
5866 | } | |
5867 | ||
5868 | return mem; | |
5869 | } | |
5870 | ||
5871 | \f | |
5872 | /* Given a PATTERN, return a SET expression if this PATTERN has only a single | |
5873 | SET, possibly conditionally executed. It may also have CLOBBERs, USEs. */ | |
5874 | ||
5875 | static rtx | |
f2206911 | 5876 | single_set_pattern (rtx pattern) |
36a05131 BS |
5877 | { |
5878 | rtx set; | |
5879 | int i; | |
5880 | ||
5881 | if (GET_CODE (pattern) == COND_EXEC) | |
5882 | pattern = COND_EXEC_CODE (pattern); | |
5883 | ||
5884 | if (GET_CODE (pattern) == SET) | |
5885 | return pattern; | |
5886 | ||
5887 | else if (GET_CODE (pattern) == PARALLEL) | |
5888 | { | |
5889 | for (i = 0, set = 0; i < XVECLEN (pattern, 0); i++) | |
5890 | { | |
5891 | rtx sub = XVECEXP (pattern, 0, i); | |
5892 | ||
5893 | switch (GET_CODE (sub)) | |
5894 | { | |
5895 | case USE: | |
5896 | case CLOBBER: | |
5897 | break; | |
5898 | ||
5899 | case SET: | |
5900 | if (set) | |
5901 | return 0; | |
5902 | else | |
5903 | set = sub; | |
5904 | break; | |
5905 | ||
5906 | default: | |
5907 | return 0; | |
5908 | } | |
5909 | } | |
5910 | return set; | |
5911 | } | |
5912 | ||
5913 | return 0; | |
5914 | } | |
5915 | ||
5916 | \f | |
5917 | /* A C expression to modify the code described by the conditional if | |
5918 | information CE_INFO with the new PATTERN in INSN. If PATTERN is a null | |
5919 | pointer after the IFCVT_MODIFY_INSN macro executes, it is assumed that that | |
5920 | insn cannot be converted to be executed conditionally. */ | |
5921 | ||
5922 | rtx | |
5da1fd3d | 5923 | frv_ifcvt_modify_insn (ce_if_block_t *ce_info, |
f2206911 KC |
5924 | rtx pattern, |
5925 | rtx insn) | |
36a05131 BS |
5926 | { |
5927 | rtx orig_ce_pattern = pattern; | |
5928 | rtx set; | |
5929 | rtx op0; | |
5930 | rtx op1; | |
5931 | rtx test; | |
5932 | ||
44e91694 | 5933 | gcc_assert (GET_CODE (pattern) == COND_EXEC); |
36a05131 BS |
5934 | |
5935 | test = COND_EXEC_TEST (pattern); | |
5936 | if (GET_CODE (test) == AND) | |
5937 | { | |
5938 | rtx cr = frv_ifcvt.cr_reg; | |
5939 | rtx test_reg; | |
5940 | ||
5941 | op0 = XEXP (test, 0); | |
5942 | if (! rtx_equal_p (cr, XEXP (op0, 0))) | |
5943 | goto fail; | |
5944 | ||
5945 | op1 = XEXP (test, 1); | |
5946 | test_reg = XEXP (op1, 0); | |
5947 | if (GET_CODE (test_reg) != REG) | |
5948 | goto fail; | |
5949 | ||
5950 | /* Is this the first nested if block in this sequence? If so, generate | |
5951 | an andcr or andncr. */ | |
5952 | if (! frv_ifcvt.last_nested_if_cr) | |
5953 | { | |
5954 | rtx and_op; | |
5955 | ||
5956 | frv_ifcvt.last_nested_if_cr = test_reg; | |
5957 | if (GET_CODE (op0) == NE) | |
5958 | and_op = gen_andcr (test_reg, cr, test_reg); | |
5959 | else | |
5960 | and_op = gen_andncr (test_reg, cr, test_reg); | |
5961 | ||
5962 | frv_ifcvt_add_insn (and_op, insn, TRUE); | |
5963 | } | |
5964 | ||
5965 | /* If this isn't the first statement in the nested if sequence, see if we | |
5966 | are dealing with the same register. */ | |
5967 | else if (! rtx_equal_p (test_reg, frv_ifcvt.last_nested_if_cr)) | |
5968 | goto fail; | |
5969 | ||
5970 | COND_EXEC_TEST (pattern) = test = op1; | |
5971 | } | |
5972 | ||
5973 | /* If this isn't a nested if, reset state variables. */ | |
5974 | else | |
5975 | { | |
5976 | frv_ifcvt.last_nested_if_cr = NULL_RTX; | |
5977 | } | |
5978 | ||
5979 | set = single_set_pattern (pattern); | |
5980 | if (set) | |
5981 | { | |
5982 | rtx dest = SET_DEST (set); | |
5983 | rtx src = SET_SRC (set); | |
5984 | enum machine_mode mode = GET_MODE (dest); | |
5985 | ||
87b483a1 | 5986 | /* Check for normal binary operators. */ |
ec8e098d | 5987 | if (mode == SImode && ARITHMETIC_P (src)) |
36a05131 BS |
5988 | { |
5989 | op0 = XEXP (src, 0); | |
5990 | op1 = XEXP (src, 1); | |
5991 | ||
34208acf | 5992 | if (integer_register_operand (op0, SImode) && CONSTANT_P (op1)) |
36a05131 BS |
5993 | { |
5994 | op1 = frv_ifcvt_load_value (op1, insn); | |
5995 | if (op1) | |
5996 | COND_EXEC_CODE (pattern) | |
5997 | = gen_rtx_SET (VOIDmode, dest, gen_rtx_fmt_ee (GET_CODE (src), | |
5998 | GET_MODE (src), | |
5999 | op0, op1)); | |
6000 | else | |
6001 | goto fail; | |
6002 | } | |
6003 | } | |
6004 | ||
6005 | /* For multiply by a constant, we need to handle the sign extending | |
6006 | correctly. Add a USE of the value after the multiply to prevent flow | |
6007 | from cratering because only one register out of the two were used. */ | |
6008 | else if (mode == DImode && GET_CODE (src) == MULT) | |
6009 | { | |
6010 | op0 = XEXP (src, 0); | |
6011 | op1 = XEXP (src, 1); | |
6012 | if (GET_CODE (op0) == SIGN_EXTEND && GET_CODE (op1) == CONST_INT) | |
6013 | { | |
6014 | op1 = frv_ifcvt_load_value (op1, insn); | |
6015 | if (op1) | |
6016 | { | |
6017 | op1 = gen_rtx_SIGN_EXTEND (DImode, op1); | |
6018 | COND_EXEC_CODE (pattern) | |
6019 | = gen_rtx_SET (VOIDmode, dest, | |
6020 | gen_rtx_MULT (DImode, op0, op1)); | |
6021 | } | |
6022 | else | |
6023 | goto fail; | |
6024 | } | |
6025 | ||
c41c1387 | 6026 | frv_ifcvt_add_insn (gen_use (dest), insn, FALSE); |
36a05131 BS |
6027 | } |
6028 | ||
6029 | /* If we are just loading a constant created for a nested conditional | |
6030 | execution statement, just load the constant without any conditional | |
6031 | execution, since we know that the constant will not interfere with any | |
6032 | other registers. */ | |
6033 | else if (frv_ifcvt.scratch_insns_bitmap | |
6034 | && bitmap_bit_p (frv_ifcvt.scratch_insns_bitmap, | |
5da1fd3d | 6035 | INSN_UID (insn)) |
5da1fd3d | 6036 | && REG_P (SET_DEST (set)) |
9a228f09 AO |
6037 | /* We must not unconditionally set a scratch reg chosen |
6038 | for a nested if-converted block if its incoming | |
6039 | value from the TEST block (or the result of the THEN | |
6040 | branch) could/should propagate to the JOIN block. | |
6041 | It suffices to test whether the register is live at | |
6042 | the JOIN point: if it's live there, we can infer | |
6043 | that we set it in the former JOIN block of the | |
6044 | nested if-converted block (otherwise it wouldn't | |
6045 | have been available as a scratch register), and it | |
6046 | is either propagated through or set in the other | |
6047 | conditional block. It's probably not worth trying | |
6048 | to catch the latter case, and it could actually | |
6049 | limit scheduling of the combined block quite | |
6050 | severely. */ | |
6051 | && ce_info->join_bb | |
eedd7243 RIL |
6052 | && ! (REGNO_REG_SET_P (df_get_live_in (ce_info->join_bb), |
6053 | REGNO (SET_DEST (set)))) | |
9a228f09 AO |
6054 | /* Similarly, we must not unconditionally set a reg |
6055 | used as scratch in the THEN branch if the same reg | |
6056 | is live in the ELSE branch. */ | |
5da1fd3d AO |
6057 | && (! ce_info->else_bb |
6058 | || BLOCK_FOR_INSN (insn) == ce_info->else_bb | |
eedd7243 RIL |
6059 | || ! (REGNO_REG_SET_P (df_get_live_in (ce_info->else_bb), |
6060 | REGNO (SET_DEST (set)))))) | |
36a05131 BS |
6061 | pattern = set; |
6062 | ||
6063 | else if (mode == QImode || mode == HImode || mode == SImode | |
6064 | || mode == SFmode) | |
6065 | { | |
6066 | int changed_p = FALSE; | |
6067 | ||
6068 | /* Check for just loading up a constant */ | |
6069 | if (CONSTANT_P (src) && integer_register_operand (dest, mode)) | |
6070 | { | |
6071 | src = frv_ifcvt_load_value (src, insn); | |
6072 | if (!src) | |
6073 | goto fail; | |
6074 | ||
6075 | changed_p = TRUE; | |
6076 | } | |
6077 | ||
6078 | /* See if we need to fix up stores */ | |
6079 | if (GET_CODE (dest) == MEM) | |
6080 | { | |
6081 | rtx new_mem = frv_ifcvt_rewrite_mem (dest, mode, insn); | |
6082 | ||
6083 | if (!new_mem) | |
6084 | goto fail; | |
6085 | ||
6086 | else if (new_mem != dest) | |
6087 | { | |
6088 | changed_p = TRUE; | |
6089 | dest = new_mem; | |
6090 | } | |
6091 | } | |
6092 | ||
6093 | /* See if we need to fix up loads */ | |
6094 | if (GET_CODE (src) == MEM) | |
6095 | { | |
6096 | rtx new_mem = frv_ifcvt_rewrite_mem (src, mode, insn); | |
6097 | ||
6098 | if (!new_mem) | |
6099 | goto fail; | |
6100 | ||
6101 | else if (new_mem != src) | |
6102 | { | |
6103 | changed_p = TRUE; | |
6104 | src = new_mem; | |
6105 | } | |
6106 | } | |
6107 | ||
6108 | /* If either src or destination changed, redo SET. */ | |
6109 | if (changed_p) | |
6110 | COND_EXEC_CODE (pattern) = gen_rtx_SET (VOIDmode, dest, src); | |
6111 | } | |
6112 | ||
6113 | /* Rewrite a nested set cccr in terms of IF_THEN_ELSE. Also deal with | |
6114 | rewriting the CC register to be the same as the paired CC/CR register | |
6115 | for nested ifs. */ | |
ec8e098d | 6116 | else if (mode == CC_CCRmode && COMPARISON_P (src)) |
36a05131 BS |
6117 | { |
6118 | int regno = REGNO (XEXP (src, 0)); | |
6119 | rtx if_else; | |
6120 | ||
6121 | if (ce_info->pass > 1 | |
6122 | && regno != (int)REGNO (frv_ifcvt.nested_cc_reg) | |
6123 | && TEST_HARD_REG_BIT (frv_ifcvt.nested_cc_ok_rewrite, regno)) | |
6124 | { | |
6125 | src = gen_rtx_fmt_ee (GET_CODE (src), | |
6126 | CC_CCRmode, | |
6127 | frv_ifcvt.nested_cc_reg, | |
6128 | XEXP (src, 1)); | |
6129 | } | |
6130 | ||
6131 | if_else = gen_rtx_IF_THEN_ELSE (CC_CCRmode, test, src, const0_rtx); | |
6132 | pattern = gen_rtx_SET (VOIDmode, dest, if_else); | |
6133 | } | |
6134 | ||
6135 | /* Remap a nested compare instruction to use the paired CC/CR reg. */ | |
6136 | else if (ce_info->pass > 1 | |
6137 | && GET_CODE (dest) == REG | |
6138 | && CC_P (REGNO (dest)) | |
6139 | && REGNO (dest) != REGNO (frv_ifcvt.nested_cc_reg) | |
6140 | && TEST_HARD_REG_BIT (frv_ifcvt.nested_cc_ok_rewrite, | |
6141 | REGNO (dest)) | |
6142 | && GET_CODE (src) == COMPARE) | |
6143 | { | |
6144 | PUT_MODE (frv_ifcvt.nested_cc_reg, GET_MODE (dest)); | |
6145 | COND_EXEC_CODE (pattern) | |
6146 | = gen_rtx_SET (VOIDmode, frv_ifcvt.nested_cc_reg, copy_rtx (src)); | |
6147 | } | |
6148 | } | |
6149 | ||
6150 | if (TARGET_DEBUG_COND_EXEC) | |
6151 | { | |
6152 | rtx orig_pattern = PATTERN (insn); | |
6153 | ||
6154 | PATTERN (insn) = pattern; | |
6155 | fprintf (stderr, | |
6156 | "\n:::::::::: frv_ifcvt_modify_insn: pass = %d, insn after modification:\n", | |
6157 | ce_info->pass); | |
6158 | ||
6159 | debug_rtx (insn); | |
6160 | PATTERN (insn) = orig_pattern; | |
6161 | } | |
6162 | ||
6163 | return pattern; | |
6164 | ||
6165 | fail: | |
6166 | if (TARGET_DEBUG_COND_EXEC) | |
6167 | { | |
6168 | rtx orig_pattern = PATTERN (insn); | |
6169 | ||
6170 | PATTERN (insn) = orig_ce_pattern; | |
6171 | fprintf (stderr, | |
6172 | "\n:::::::::: frv_ifcvt_modify_insn: pass = %d, insn could not be modified:\n", | |
6173 | ce_info->pass); | |
6174 | ||
6175 | debug_rtx (insn); | |
6176 | PATTERN (insn) = orig_pattern; | |
6177 | } | |
6178 | ||
6179 | return NULL_RTX; | |
6180 | } | |
6181 | ||
6182 | \f | |
6183 | /* A C expression to perform any final machine dependent modifications in | |
6184 | converting code to conditional execution in the code described by the | |
6185 | conditional if information CE_INFO. */ | |
6186 | ||
6187 | void | |
f2206911 | 6188 | frv_ifcvt_modify_final (ce_if_block_t *ce_info ATTRIBUTE_UNUSED) |
36a05131 BS |
6189 | { |
6190 | rtx existing_insn; | |
6191 | rtx check_insn; | |
6192 | rtx p = frv_ifcvt.added_insns_list; | |
6193 | int i; | |
6194 | ||
6195 | /* Loop inserting the check insns. The last check insn is the first test, | |
6196 | and is the appropriate place to insert constants. */ | |
44e91694 | 6197 | gcc_assert (p); |
36a05131 BS |
6198 | |
6199 | do | |
6200 | { | |
6201 | rtx check_and_insert_insns = XEXP (p, 0); | |
6202 | rtx old_p = p; | |
6203 | ||
6204 | check_insn = XEXP (check_and_insert_insns, 0); | |
6205 | existing_insn = XEXP (check_and_insert_insns, 1); | |
6206 | p = XEXP (p, 1); | |
6207 | ||
6208 | /* The jump bit is used to say that the new insn is to be inserted BEFORE | |
6209 | the existing insn, otherwise it is to be inserted AFTER. */ | |
6210 | if (check_and_insert_insns->jump) | |
6211 | { | |
6212 | emit_insn_before (check_insn, existing_insn); | |
6213 | check_and_insert_insns->jump = 0; | |
6214 | } | |
6215 | else | |
6216 | emit_insn_after (check_insn, existing_insn); | |
6217 | ||
6218 | free_EXPR_LIST_node (check_and_insert_insns); | |
6219 | free_EXPR_LIST_node (old_p); | |
6220 | } | |
6221 | while (p != NULL_RTX); | |
6222 | ||
6223 | /* Load up any constants needed into temp gprs */ | |
6224 | for (i = 0; i < frv_ifcvt.cur_scratch_regs; i++) | |
6225 | { | |
6226 | rtx insn = emit_insn_before (frv_ifcvt.scratch_regs[i], existing_insn); | |
6227 | if (! frv_ifcvt.scratch_insns_bitmap) | |
7b210806 | 6228 | frv_ifcvt.scratch_insns_bitmap = BITMAP_ALLOC (NULL); |
36a05131 BS |
6229 | bitmap_set_bit (frv_ifcvt.scratch_insns_bitmap, INSN_UID (insn)); |
6230 | frv_ifcvt.scratch_regs[i] = NULL_RTX; | |
6231 | } | |
6232 | ||
6233 | frv_ifcvt.added_insns_list = NULL_RTX; | |
6234 | frv_ifcvt.cur_scratch_regs = 0; | |
6235 | } | |
6236 | ||
6237 | \f | |
6238 | /* A C expression to cancel any machine dependent modifications in converting | |
6239 | code to conditional execution in the code described by the conditional if | |
6240 | information CE_INFO. */ | |
6241 | ||
6242 | void | |
f2206911 | 6243 | frv_ifcvt_modify_cancel (ce_if_block_t *ce_info ATTRIBUTE_UNUSED) |
36a05131 BS |
6244 | { |
6245 | int i; | |
6246 | rtx p = frv_ifcvt.added_insns_list; | |
6247 | ||
6248 | /* Loop freeing up the EXPR_LIST's allocated. */ | |
6249 | while (p != NULL_RTX) | |
6250 | { | |
6251 | rtx check_and_jump = XEXP (p, 0); | |
6252 | rtx old_p = p; | |
6253 | ||
6254 | p = XEXP (p, 1); | |
6255 | free_EXPR_LIST_node (check_and_jump); | |
6256 | free_EXPR_LIST_node (old_p); | |
6257 | } | |
6258 | ||
6259 | /* Release any temporary gprs allocated. */ | |
6260 | for (i = 0; i < frv_ifcvt.cur_scratch_regs; i++) | |
6261 | frv_ifcvt.scratch_regs[i] = NULL_RTX; | |
6262 | ||
6263 | frv_ifcvt.added_insns_list = NULL_RTX; | |
6264 | frv_ifcvt.cur_scratch_regs = 0; | |
6265 | return; | |
6266 | } | |
6267 | \f | |
6268 | /* A C expression for the size in bytes of the trampoline, as an integer. | |
6269 | The template is: | |
6270 | ||
6271 | setlo #0, <jmp_reg> | |
6272 | setlo #0, <static_chain> | |
6273 | sethi #0, <jmp_reg> | |
6274 | sethi #0, <static_chain> | |
6275 | jmpl @(gr0,<jmp_reg>) */ | |
6276 | ||
6277 | int | |
f2206911 | 6278 | frv_trampoline_size (void) |
36a05131 | 6279 | { |
34208acf AO |
6280 | if (TARGET_FDPIC) |
6281 | /* Allocate room for the function descriptor and the lddi | |
6282 | instruction. */ | |
6283 | return 8 + 6 * 4; | |
6284 | return 5 /* instructions */ * 4 /* instruction size. */; | |
36a05131 BS |
6285 | } |
6286 | ||
6287 | \f | |
6288 | /* A C statement to initialize the variable parts of a trampoline. ADDR is an | |
6289 | RTX for the address of the trampoline; FNADDR is an RTX for the address of | |
6290 | the nested function; STATIC_CHAIN is an RTX for the static chain value that | |
6291 | should be passed to the function when it is called. | |
6292 | ||
6293 | The template is: | |
6294 | ||
6295 | setlo #0, <jmp_reg> | |
6296 | setlo #0, <static_chain> | |
6297 | sethi #0, <jmp_reg> | |
6298 | sethi #0, <static_chain> | |
6299 | jmpl @(gr0,<jmp_reg>) */ | |
6300 | ||
e9d5fdb2 RH |
6301 | static void |
6302 | frv_trampoline_init (rtx m_tramp, tree fndecl, rtx static_chain) | |
36a05131 | 6303 | { |
e9d5fdb2 RH |
6304 | rtx addr = XEXP (m_tramp, 0); |
6305 | rtx fnaddr = XEXP (DECL_RTL (fndecl), 0); | |
36a05131 BS |
6306 | rtx sc_reg = force_reg (Pmode, static_chain); |
6307 | ||
6308 | emit_library_call (gen_rtx_SYMBOL_REF (SImode, "__trampoline_setup"), | |
5c5e8419 | 6309 | LCT_NORMAL, VOIDmode, 4, |
36a05131 BS |
6310 | addr, Pmode, |
6311 | GEN_INT (frv_trampoline_size ()), SImode, | |
6312 | fnaddr, Pmode, | |
6313 | sc_reg, Pmode); | |
6314 | } | |
6315 | ||
6316 | \f | |
6317 | /* Many machines have some registers that cannot be copied directly to or from | |
6318 | memory or even from other types of registers. An example is the `MQ' | |
6319 | register, which on most machines, can only be copied to or from general | |
6320 | registers, but not memory. Some machines allow copying all registers to and | |
6321 | from memory, but require a scratch register for stores to some memory | |
6322 | locations (e.g., those with symbolic address on the RT, and those with | |
981f6289 | 6323 | certain symbolic address on the SPARC when compiling PIC). In some cases, |
36a05131 BS |
6324 | both an intermediate and a scratch register are required. |
6325 | ||
6326 | You should define these macros to indicate to the reload phase that it may | |
6327 | need to allocate at least one register for a reload in addition to the | |
6328 | register to contain the data. Specifically, if copying X to a register | |
0a2aaacc | 6329 | RCLASS in MODE requires an intermediate register, you should define |
36a05131 BS |
6330 | `SECONDARY_INPUT_RELOAD_CLASS' to return the largest register class all of |
6331 | whose registers can be used as intermediate registers or scratch registers. | |
6332 | ||
0a2aaacc | 6333 | If copying a register RCLASS in MODE to X requires an intermediate or scratch |
36a05131 BS |
6334 | register, `SECONDARY_OUTPUT_RELOAD_CLASS' should be defined to return the |
6335 | largest register class required. If the requirements for input and output | |
6336 | reloads are the same, the macro `SECONDARY_RELOAD_CLASS' should be used | |
6337 | instead of defining both macros identically. | |
6338 | ||
6339 | The values returned by these macros are often `GENERAL_REGS'. Return | |
6340 | `NO_REGS' if no spare register is needed; i.e., if X can be directly copied | |
0a2aaacc | 6341 | to or from a register of RCLASS in MODE without requiring a scratch register. |
36a05131 BS |
6342 | Do not define this macro if it would always return `NO_REGS'. |
6343 | ||
6344 | If a scratch register is required (either with or without an intermediate | |
6345 | register), you should define patterns for `reload_inM' or `reload_outM', as | |
6346 | required.. These patterns, which will normally be implemented with a | |
6347 | `define_expand', should be similar to the `movM' patterns, except that | |
6348 | operand 2 is the scratch register. | |
6349 | ||
6350 | Define constraints for the reload register and scratch register that contain | |
6351 | a single register class. If the original reload register (whose class is | |
0a2aaacc | 6352 | RCLASS) can meet the constraint given in the pattern, the value returned by |
36a05131 BS |
6353 | these macros is used for the class of the scratch register. Otherwise, two |
6354 | additional reload registers are required. Their classes are obtained from | |
6355 | the constraints in the insn pattern. | |
6356 | ||
6357 | X might be a pseudo-register or a `subreg' of a pseudo-register, which could | |
6358 | either be in a hard register or in memory. Use `true_regnum' to find out; | |
6359 | it will return -1 if the pseudo is in memory and the hard register number if | |
6360 | it is in a register. | |
6361 | ||
6362 | These macros should not be used in the case where a particular class of | |
6363 | registers can only be copied to memory and not to another class of | |
6364 | registers. In that case, secondary reload registers are not needed and | |
6365 | would not be helpful. Instead, a stack location must be used to perform the | |
43aa4e05 | 6366 | copy and the `movM' pattern should use memory as an intermediate storage. |
36a05131 BS |
6367 | This case often occurs between floating-point and general registers. */ |
6368 | ||
6369 | enum reg_class | |
0a2aaacc | 6370 | frv_secondary_reload_class (enum reg_class rclass, |
f2206911 | 6371 | enum machine_mode mode ATTRIBUTE_UNUSED, |
35f2d8ef | 6372 | rtx x) |
36a05131 BS |
6373 | { |
6374 | enum reg_class ret; | |
6375 | ||
0a2aaacc | 6376 | switch (rclass) |
36a05131 BS |
6377 | { |
6378 | default: | |
6379 | ret = NO_REGS; | |
6380 | break; | |
6381 | ||
6382 | /* Accumulators/Accumulator guard registers need to go through floating | |
6383 | point registers. */ | |
6384 | case QUAD_REGS: | |
36a05131 BS |
6385 | case GPR_REGS: |
6386 | ret = NO_REGS; | |
6387 | if (x && GET_CODE (x) == REG) | |
6388 | { | |
6389 | int regno = REGNO (x); | |
6390 | ||
6391 | if (ACC_P (regno) || ACCG_P (regno)) | |
6392 | ret = FPR_REGS; | |
6393 | } | |
6394 | break; | |
6395 | ||
9cd10576 | 6396 | /* Nonzero constants should be loaded into an FPR through a GPR. */ |
36a05131 | 6397 | case QUAD_FPR_REGS: |
36a05131 BS |
6398 | if (x && CONSTANT_P (x) && !ZERO_P (x)) |
6399 | ret = GPR_REGS; | |
6400 | else | |
6401 | ret = NO_REGS; | |
6402 | break; | |
6403 | ||
6404 | /* All of these types need gpr registers. */ | |
6405 | case ICC_REGS: | |
6406 | case FCC_REGS: | |
6407 | case CC_REGS: | |
6408 | case ICR_REGS: | |
6409 | case FCR_REGS: | |
6410 | case CR_REGS: | |
6411 | case LCR_REG: | |
6412 | case LR_REG: | |
6413 | ret = GPR_REGS; | |
6414 | break; | |
6415 | ||
35f2d8ef | 6416 | /* The accumulators need fpr registers. */ |
36a05131 BS |
6417 | case QUAD_ACC_REGS: |
6418 | case ACCG_REGS: | |
6419 | ret = FPR_REGS; | |
6420 | break; | |
6421 | } | |
6422 | ||
6423 | return ret; | |
6424 | } | |
6425 | ||
35f2d8ef NC |
6426 | /* This hook exists to catch the case where secondary_reload_class() is |
6427 | called from init_reg_autoinc() in regclass.c - before the reload optabs | |
6428 | have been initialised. */ | |
6429 | ||
a87cf97e JR |
6430 | static reg_class_t |
6431 | frv_secondary_reload (bool in_p, rtx x, reg_class_t reload_class_i, | |
35f2d8ef NC |
6432 | enum machine_mode reload_mode, |
6433 | secondary_reload_info * sri) | |
6434 | { | |
6435 | enum reg_class rclass = NO_REGS; | |
a87cf97e | 6436 | enum reg_class reload_class = (enum reg_class) reload_class_i; |
35f2d8ef NC |
6437 | |
6438 | if (sri->prev_sri && sri->prev_sri->t_icode != CODE_FOR_nothing) | |
6439 | { | |
6440 | sri->icode = sri->prev_sri->t_icode; | |
6441 | return NO_REGS; | |
6442 | } | |
6443 | ||
6444 | rclass = frv_secondary_reload_class (reload_class, reload_mode, x); | |
6445 | ||
6446 | if (rclass != NO_REGS) | |
6447 | { | |
f9621cc4 RS |
6448 | enum insn_code icode |
6449 | = direct_optab_handler (in_p ? reload_in_optab : reload_out_optab, | |
6450 | reload_mode); | |
35f2d8ef NC |
6451 | if (icode == 0) |
6452 | { | |
6453 | /* This happens when then the reload_[in|out]_optabs have | |
6454 | not been initialised. */ | |
6455 | sri->t_icode = CODE_FOR_nothing; | |
6456 | return rclass; | |
6457 | } | |
6458 | } | |
6459 | ||
6460 | /* Fall back to the default secondary reload handler. */ | |
6461 | return default_secondary_reload (in_p, x, reload_class, reload_mode, sri); | |
6462 | ||
6463 | } | |
36a05131 | 6464 | \f |
c28350ab | 6465 | /* Worker function for TARGET_CLASS_LIKELY_SPILLED_P. */ |
36a05131 | 6466 | |
c28350ab AS |
6467 | static bool |
6468 | frv_class_likely_spilled_p (reg_class_t rclass) | |
36a05131 | 6469 | { |
0a2aaacc | 6470 | switch (rclass) |
36a05131 BS |
6471 | { |
6472 | default: | |
6473 | break; | |
6474 | ||
17c21957 AO |
6475 | case GR8_REGS: |
6476 | case GR9_REGS: | |
6477 | case GR89_REGS: | |
6478 | case FDPIC_FPTR_REGS: | |
6479 | case FDPIC_REGS: | |
36a05131 BS |
6480 | case ICC_REGS: |
6481 | case FCC_REGS: | |
6482 | case CC_REGS: | |
6483 | case ICR_REGS: | |
6484 | case FCR_REGS: | |
6485 | case CR_REGS: | |
6486 | case LCR_REG: | |
6487 | case LR_REG: | |
6488 | case SPR_REGS: | |
6489 | case QUAD_ACC_REGS: | |
36a05131 | 6490 | case ACCG_REGS: |
c28350ab | 6491 | return true; |
36a05131 BS |
6492 | } |
6493 | ||
c28350ab | 6494 | return false; |
36a05131 BS |
6495 | } |
6496 | ||
6497 | \f | |
6498 | /* An expression for the alignment of a structure field FIELD if the | |
7ec022b2 | 6499 | alignment computed in the usual way is COMPUTED. GCC uses this |
36a05131 BS |
6500 | value instead of the value in `BIGGEST_ALIGNMENT' or |
6501 | `BIGGEST_FIELD_ALIGNMENT', if defined, for structure fields only. */ | |
6502 | ||
6503 | /* The definition type of the bit field data is either char, short, long or | |
6504 | long long. The maximum bit size is the number of bits of its own type. | |
6505 | ||
6506 | The bit field data is assigned to a storage unit that has an adequate size | |
6507 | for bit field data retention and is located at the smallest address. | |
6508 | ||
6509 | Consecutive bit field data are packed at consecutive bits having the same | |
6510 | storage unit, with regard to the type, beginning with the MSB and continuing | |
6511 | toward the LSB. | |
6512 | ||
6513 | If a field to be assigned lies over a bit field type boundary, its | |
6514 | assignment is completed by aligning it with a boundary suitable for the | |
6515 | type. | |
6516 | ||
6517 | When a bit field having a bit length of 0 is declared, it is forcibly | |
6518 | assigned to the next storage unit. | |
6519 | ||
6520 | e.g) | |
6521 | struct { | |
6522 | int a:2; | |
6523 | int b:6; | |
6524 | char c:4; | |
6525 | int d:10; | |
6526 | int :0; | |
6527 | int f:2; | |
6528 | } x; | |
6529 | ||
6530 | +0 +1 +2 +3 | |
6531 | &x 00000000 00000000 00000000 00000000 | |
6532 | MLM----L | |
6533 | a b | |
6534 | &x+4 00000000 00000000 00000000 00000000 | |
6535 | M--L | |
6536 | c | |
6537 | &x+8 00000000 00000000 00000000 00000000 | |
6538 | M----------L | |
6539 | d | |
6540 | &x+12 00000000 00000000 00000000 00000000 | |
6541 | ML | |
6542 | f | |
6543 | */ | |
6544 | ||
6545 | int | |
f2206911 | 6546 | frv_adjust_field_align (tree field, int computed) |
36a05131 | 6547 | { |
b16c1435 EC |
6548 | /* Make sure that the bitfield is not wider than the type. */ |
6549 | if (DECL_BIT_FIELD (field) | |
25f93e18 | 6550 | && !DECL_ARTIFICIAL (field)) |
36a05131 BS |
6551 | { |
6552 | tree parent = DECL_CONTEXT (field); | |
6553 | tree prev = NULL_TREE; | |
6554 | tree cur; | |
6555 | ||
910ad8de | 6556 | for (cur = TYPE_FIELDS (parent); cur && cur != field; cur = DECL_CHAIN (cur)) |
36a05131 BS |
6557 | { |
6558 | if (TREE_CODE (cur) != FIELD_DECL) | |
6559 | continue; | |
6560 | ||
6561 | prev = cur; | |
6562 | } | |
6563 | ||
44e91694 | 6564 | gcc_assert (cur); |
36a05131 BS |
6565 | |
6566 | /* If this isn't a :0 field and if the previous element is a bitfield | |
6567 | also, see if the type is different, if so, we will need to align the | |
87b483a1 | 6568 | bit-field to the next boundary. */ |
36a05131 BS |
6569 | if (prev |
6570 | && ! DECL_PACKED (field) | |
6571 | && ! integer_zerop (DECL_SIZE (field)) | |
6572 | && DECL_BIT_FIELD_TYPE (field) != DECL_BIT_FIELD_TYPE (prev)) | |
6573 | { | |
6574 | int prev_align = TYPE_ALIGN (TREE_TYPE (prev)); | |
6575 | int cur_align = TYPE_ALIGN (TREE_TYPE (field)); | |
6576 | computed = (prev_align > cur_align) ? prev_align : cur_align; | |
6577 | } | |
6578 | } | |
6579 | ||
6580 | return computed; | |
6581 | } | |
6582 | ||
6583 | \f | |
6584 | /* A C expression that is nonzero if it is permissible to store a value of mode | |
6585 | MODE in hard register number REGNO (or in several registers starting with | |
6586 | that one). For a machine where all registers are equivalent, a suitable | |
6587 | definition is | |
6588 | ||
6589 | #define HARD_REGNO_MODE_OK(REGNO, MODE) 1 | |
6590 | ||
6591 | It is not necessary for this macro to check for the numbers of fixed | |
6592 | registers, because the allocation mechanism considers them to be always | |
6593 | occupied. | |
6594 | ||
6595 | On some machines, double-precision values must be kept in even/odd register | |
6596 | pairs. The way to implement that is to define this macro to reject odd | |
6597 | register numbers for such modes. | |
6598 | ||
6599 | The minimum requirement for a mode to be OK in a register is that the | |
6600 | `movMODE' instruction pattern support moves between the register and any | |
6601 | other hard register for which the mode is OK; and that moving a value into | |
6602 | the register and back out not alter it. | |
6603 | ||
6604 | Since the same instruction used to move `SImode' will work for all narrower | |
6605 | integer modes, it is not necessary on any machine for `HARD_REGNO_MODE_OK' | |
6606 | to distinguish between these modes, provided you define patterns `movhi', | |
6607 | etc., to take advantage of this. This is useful because of the interaction | |
6608 | between `HARD_REGNO_MODE_OK' and `MODES_TIEABLE_P'; it is very desirable for | |
6609 | all integer modes to be tieable. | |
6610 | ||
6611 | Many machines have special registers for floating point arithmetic. Often | |
6612 | people assume that floating point machine modes are allowed only in floating | |
6613 | point registers. This is not true. Any registers that can hold integers | |
6614 | can safely *hold* a floating point machine mode, whether or not floating | |
6615 | arithmetic can be done on it in those registers. Integer move instructions | |
6616 | can be used to move the values. | |
6617 | ||
6618 | On some machines, though, the converse is true: fixed-point machine modes | |
6619 | may not go in floating registers. This is true if the floating registers | |
6620 | normalize any value stored in them, because storing a non-floating value | |
6621 | there would garble it. In this case, `HARD_REGNO_MODE_OK' should reject | |
6622 | fixed-point machine modes in floating registers. But if the floating | |
6623 | registers do not automatically normalize, if you can store any bit pattern | |
6624 | in one and retrieve it unchanged without a trap, then any machine mode may | |
6625 | go in a floating register, so you can define this macro to say so. | |
6626 | ||
6627 | The primary significance of special floating registers is rather that they | |
6628 | are the registers acceptable in floating point arithmetic instructions. | |
6629 | However, this is of no concern to `HARD_REGNO_MODE_OK'. You handle it by | |
6630 | writing the proper constraints for those instructions. | |
6631 | ||
6632 | On some machines, the floating registers are especially slow to access, so | |
6633 | that it is better to store a value in a stack frame than in such a register | |
6634 | if floating point arithmetic is not being done. As long as the floating | |
6635 | registers are not in class `GENERAL_REGS', they will not be used unless some | |
6636 | pattern's constraint asks for one. */ | |
6637 | ||
6638 | int | |
f2206911 | 6639 | frv_hard_regno_mode_ok (int regno, enum machine_mode mode) |
36a05131 BS |
6640 | { |
6641 | int base; | |
6642 | int mask; | |
6643 | ||
6644 | switch (mode) | |
6645 | { | |
6646 | case CCmode: | |
6647 | case CC_UNSmode: | |
036ff63f | 6648 | case CC_NZmode: |
36a05131 BS |
6649 | return ICC_P (regno) || GPR_P (regno); |
6650 | ||
6651 | case CC_CCRmode: | |
6652 | return CR_P (regno) || GPR_P (regno); | |
6653 | ||
6654 | case CC_FPmode: | |
6655 | return FCC_P (regno) || GPR_P (regno); | |
6656 | ||
6657 | default: | |
6658 | break; | |
6659 | } | |
6660 | ||
6661 | /* Set BASE to the first register in REGNO's class. Set MASK to the | |
6662 | bits that must be clear in (REGNO - BASE) for the register to be | |
6663 | well-aligned. */ | |
6664 | if (INTEGRAL_MODE_P (mode) || FLOAT_MODE_P (mode) || VECTOR_MODE_P (mode)) | |
6665 | { | |
6666 | if (ACCG_P (regno)) | |
6667 | { | |
6668 | /* ACCGs store one byte. Two-byte quantities must start in | |
6669 | even-numbered registers, four-byte ones in registers whose | |
6670 | numbers are divisible by four, and so on. */ | |
6671 | base = ACCG_FIRST; | |
6672 | mask = GET_MODE_SIZE (mode) - 1; | |
6673 | } | |
6674 | else | |
6675 | { | |
b16c1435 EC |
6676 | /* The other registers store one word. */ |
6677 | if (GPR_P (regno) || regno == AP_FIRST) | |
36a05131 BS |
6678 | base = GPR_FIRST; |
6679 | ||
6680 | else if (FPR_P (regno)) | |
6681 | base = FPR_FIRST; | |
6682 | ||
6683 | else if (ACC_P (regno)) | |
6684 | base = ACC_FIRST; | |
6685 | ||
b16c1435 EC |
6686 | else if (SPR_P (regno)) |
6687 | return mode == SImode; | |
6688 | ||
87b483a1 | 6689 | /* Fill in the table. */ |
36a05131 BS |
6690 | else |
6691 | return 0; | |
6692 | ||
6693 | /* Anything smaller than an SI is OK in any word-sized register. */ | |
6694 | if (GET_MODE_SIZE (mode) < 4) | |
6695 | return 1; | |
6696 | ||
6697 | mask = (GET_MODE_SIZE (mode) / 4) - 1; | |
6698 | } | |
6699 | return (((regno - base) & mask) == 0); | |
6700 | } | |
6701 | ||
6702 | return 0; | |
6703 | } | |
6704 | ||
6705 | \f | |
6706 | /* A C expression for the number of consecutive hard registers, starting at | |
6707 | register number REGNO, required to hold a value of mode MODE. | |
6708 | ||
6709 | On a machine where all registers are exactly one word, a suitable definition | |
6710 | of this macro is | |
6711 | ||
6712 | #define HARD_REGNO_NREGS(REGNO, MODE) \ | |
6713 | ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) \ | |
6714 | / UNITS_PER_WORD)) */ | |
6715 | ||
6716 | /* On the FRV, make the CC_FP mode take 3 words in the integer registers, so | |
6717 | that we can build the appropriate instructions to properly reload the | |
6718 | values. Also, make the byte-sized accumulator guards use one guard | |
6719 | for each byte. */ | |
6720 | ||
6721 | int | |
f2206911 | 6722 | frv_hard_regno_nregs (int regno, enum machine_mode mode) |
36a05131 BS |
6723 | { |
6724 | if (ACCG_P (regno)) | |
6725 | return GET_MODE_SIZE (mode); | |
6726 | else | |
6727 | return (GET_MODE_SIZE (mode) + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
6728 | } | |
6729 | ||
6730 | \f | |
6731 | /* A C expression for the maximum number of consecutive registers of | |
0a2aaacc | 6732 | class RCLASS needed to hold a value of mode MODE. |
36a05131 BS |
6733 | |
6734 | This is closely related to the macro `HARD_REGNO_NREGS'. In fact, the value | |
0a2aaacc KG |
6735 | of the macro `CLASS_MAX_NREGS (RCLASS, MODE)' should be the maximum value of |
6736 | `HARD_REGNO_NREGS (REGNO, MODE)' for all REGNO values in the class RCLASS. | |
36a05131 BS |
6737 | |
6738 | This macro helps control the handling of multiple-word values in | |
6739 | the reload pass. | |
6740 | ||
6741 | This declaration is required. */ | |
6742 | ||
6743 | int | |
0a2aaacc | 6744 | frv_class_max_nregs (enum reg_class rclass, enum machine_mode mode) |
36a05131 | 6745 | { |
0a2aaacc | 6746 | if (rclass == ACCG_REGS) |
36a05131 BS |
6747 | /* An N-byte value requires N accumulator guards. */ |
6748 | return GET_MODE_SIZE (mode); | |
6749 | else | |
6750 | return (GET_MODE_SIZE (mode) + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
6751 | } | |
6752 | ||
6753 | \f | |
6754 | /* A C expression that is nonzero if X is a legitimate constant for an | |
6755 | immediate operand on the target machine. You can assume that X satisfies | |
6756 | `CONSTANT_P', so you need not check this. In fact, `1' is a suitable | |
6757 | definition for this macro on machines where anything `CONSTANT_P' is valid. */ | |
6758 | ||
1a627b35 RS |
6759 | static bool |
6760 | frv_legitimate_constant_p (enum machine_mode mode, rtx x) | |
36a05131 | 6761 | { |
34208acf AO |
6762 | /* frv_cannot_force_const_mem always returns true for FDPIC. This |
6763 | means that the move expanders will be expected to deal with most | |
6764 | kinds of constant, regardless of what we return here. | |
6765 | ||
1a627b35 | 6766 | However, among its other duties, frv_legitimate_constant_p decides whether |
34208acf AO |
6767 | a constant can be entered into reg_equiv_constant[]. If we return true, |
6768 | reload can create new instances of the constant whenever it likes. | |
6769 | ||
6770 | The idea is therefore to accept as many constants as possible (to give | |
6771 | reload more freedom) while rejecting constants that can only be created | |
6772 | at certain times. In particular, anything with a symbolic component will | |
6773 | require use of the pseudo FDPIC register, which is only available before | |
6774 | reload. */ | |
6775 | if (TARGET_FDPIC) | |
6776 | return LEGITIMATE_PIC_OPERAND_P (x); | |
6777 | ||
87b483a1 | 6778 | /* All of the integer constants are ok. */ |
36a05131 BS |
6779 | if (GET_CODE (x) != CONST_DOUBLE) |
6780 | return TRUE; | |
6781 | ||
87b483a1 | 6782 | /* double integer constants are ok. */ |
1a627b35 | 6783 | if (GET_MODE (x) == VOIDmode || mode == DImode) |
36a05131 BS |
6784 | return TRUE; |
6785 | ||
87b483a1 | 6786 | /* 0 is always ok. */ |
36a05131 BS |
6787 | if (x == CONST0_RTX (mode)) |
6788 | return TRUE; | |
6789 | ||
6790 | /* If floating point is just emulated, allow any constant, since it will be | |
87b483a1 | 6791 | constructed in the GPRs. */ |
36a05131 BS |
6792 | if (!TARGET_HAS_FPRS) |
6793 | return TRUE; | |
6794 | ||
6795 | if (mode == DFmode && !TARGET_DOUBLE) | |
6796 | return TRUE; | |
6797 | ||
6798 | /* Otherwise store the constant away and do a load. */ | |
6799 | return FALSE; | |
6800 | } | |
036ff63f RS |
6801 | |
6802 | /* Implement SELECT_CC_MODE. Choose CC_FP for floating-point comparisons, | |
6803 | CC_NZ for comparisons against zero in which a single Z or N flag test | |
6804 | is enough, CC_UNS for other unsigned comparisons, and CC for other | |
6805 | signed comparisons. */ | |
6806 | ||
6807 | enum machine_mode | |
6808 | frv_select_cc_mode (enum rtx_code code, rtx x, rtx y) | |
6809 | { | |
6810 | if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT) | |
6811 | return CC_FPmode; | |
6812 | ||
6813 | switch (code) | |
6814 | { | |
6815 | case EQ: | |
6816 | case NE: | |
6817 | case LT: | |
6818 | case GE: | |
6819 | return y == const0_rtx ? CC_NZmode : CCmode; | |
6820 | ||
6821 | case GTU: | |
6822 | case GEU: | |
6823 | case LTU: | |
6824 | case LEU: | |
6825 | return y == const0_rtx ? CC_NZmode : CC_UNSmode; | |
6826 | ||
6827 | default: | |
6828 | return CCmode; | |
6829 | } | |
6830 | } | |
36a05131 | 6831 | \f |
33124e84 AS |
6832 | |
6833 | /* Worker function for TARGET_REGISTER_MOVE_COST. */ | |
36a05131 BS |
6834 | |
6835 | #define HIGH_COST 40 | |
6836 | #define MEDIUM_COST 3 | |
6837 | #define LOW_COST 1 | |
6838 | ||
33124e84 AS |
6839 | static int |
6840 | frv_register_move_cost (enum machine_mode mode ATTRIBUTE_UNUSED, | |
6841 | reg_class_t from, reg_class_t to) | |
36a05131 BS |
6842 | { |
6843 | switch (from) | |
6844 | { | |
6845 | default: | |
6846 | break; | |
6847 | ||
6848 | case QUAD_REGS: | |
36a05131 | 6849 | case GPR_REGS: |
73d7e266 VM |
6850 | case GR8_REGS: |
6851 | case GR9_REGS: | |
6852 | case GR89_REGS: | |
6853 | case FDPIC_REGS: | |
6854 | case FDPIC_FPTR_REGS: | |
6855 | case FDPIC_CALL_REGS: | |
6856 | ||
36a05131 BS |
6857 | switch (to) |
6858 | { | |
6859 | default: | |
6860 | break; | |
6861 | ||
9b5db25d | 6862 | case QUAD_REGS: |
36a05131 | 6863 | case GPR_REGS: |
73d7e266 VM |
6864 | case GR8_REGS: |
6865 | case GR9_REGS: | |
6866 | case GR89_REGS: | |
6867 | case FDPIC_REGS: | |
6868 | case FDPIC_FPTR_REGS: | |
6869 | case FDPIC_CALL_REGS: | |
6870 | ||
36a05131 BS |
6871 | return LOW_COST; |
6872 | ||
36a05131 BS |
6873 | case FPR_REGS: |
6874 | return LOW_COST; | |
6875 | ||
6876 | case LCR_REG: | |
6877 | case LR_REG: | |
6878 | case SPR_REGS: | |
6879 | return LOW_COST; | |
6880 | } | |
6881 | ||
9b5db25d | 6882 | case QUAD_FPR_REGS: |
36a05131 BS |
6883 | switch (to) |
6884 | { | |
6885 | default: | |
6886 | break; | |
6887 | ||
6888 | case QUAD_REGS: | |
36a05131 | 6889 | case GPR_REGS: |
73d7e266 VM |
6890 | case GR8_REGS: |
6891 | case GR9_REGS: | |
6892 | case GR89_REGS: | |
6893 | case FDPIC_REGS: | |
6894 | case FDPIC_FPTR_REGS: | |
6895 | case FDPIC_CALL_REGS: | |
6896 | ||
36a05131 BS |
6897 | case QUAD_ACC_REGS: |
6898 | case ACCG_REGS: | |
6899 | return MEDIUM_COST; | |
6900 | ||
9b5db25d | 6901 | case QUAD_FPR_REGS: |
36a05131 BS |
6902 | return LOW_COST; |
6903 | } | |
6904 | ||
6905 | case LCR_REG: | |
6906 | case LR_REG: | |
6907 | case SPR_REGS: | |
6908 | switch (to) | |
6909 | { | |
6910 | default: | |
6911 | break; | |
6912 | ||
6913 | case QUAD_REGS: | |
36a05131 | 6914 | case GPR_REGS: |
73d7e266 VM |
6915 | case GR8_REGS: |
6916 | case GR9_REGS: | |
6917 | case GR89_REGS: | |
6918 | case FDPIC_REGS: | |
6919 | case FDPIC_FPTR_REGS: | |
6920 | case FDPIC_CALL_REGS: | |
6921 | ||
36a05131 BS |
6922 | return MEDIUM_COST; |
6923 | } | |
6924 | ||
36a05131 BS |
6925 | case QUAD_ACC_REGS: |
6926 | case ACCG_REGS: | |
6927 | switch (to) | |
6928 | { | |
6929 | default: | |
6930 | break; | |
6931 | ||
9b5db25d | 6932 | case QUAD_FPR_REGS: |
36a05131 BS |
6933 | return MEDIUM_COST; |
6934 | ||
6935 | } | |
6936 | } | |
6937 | ||
6938 | return HIGH_COST; | |
6939 | } | |
33124e84 AS |
6940 | |
6941 | /* Worker function for TARGET_MEMORY_MOVE_COST. */ | |
6942 | ||
6943 | static int | |
6944 | frv_memory_move_cost (enum machine_mode mode ATTRIBUTE_UNUSED, | |
6945 | reg_class_t rclass ATTRIBUTE_UNUSED, | |
6946 | bool in ATTRIBUTE_UNUSED) | |
6947 | { | |
6948 | return 4; | |
6949 | } | |
6950 | ||
36a05131 BS |
6951 | \f |
6952 | /* Implementation of TARGET_ASM_INTEGER. In the FRV case we need to | |
6953 | use ".picptr" to generate safe relocations for PIC code. We also | |
6954 | need a fixup entry for aligned (non-debugging) code. */ | |
6955 | ||
6956 | static bool | |
f2206911 | 6957 | frv_assemble_integer (rtx value, unsigned int size, int aligned_p) |
36a05131 | 6958 | { |
34208acf | 6959 | if ((flag_pic || TARGET_FDPIC) && size == UNITS_PER_WORD) |
36a05131 BS |
6960 | { |
6961 | if (GET_CODE (value) == CONST | |
6962 | || GET_CODE (value) == SYMBOL_REF | |
6963 | || GET_CODE (value) == LABEL_REF) | |
6964 | { | |
34208acf AO |
6965 | if (TARGET_FDPIC && GET_CODE (value) == SYMBOL_REF |
6966 | && SYMBOL_REF_FUNCTION_P (value)) | |
6967 | { | |
6968 | fputs ("\t.picptr\tfuncdesc(", asm_out_file); | |
6969 | output_addr_const (asm_out_file, value); | |
6970 | fputs (")\n", asm_out_file); | |
6971 | return true; | |
6972 | } | |
6973 | else if (TARGET_FDPIC && GET_CODE (value) == CONST | |
6974 | && frv_function_symbol_referenced_p (value)) | |
6975 | return false; | |
6976 | if (aligned_p && !TARGET_FDPIC) | |
36a05131 BS |
6977 | { |
6978 | static int label_num = 0; | |
6979 | char buf[256]; | |
6980 | const char *p; | |
6981 | ||
6982 | ASM_GENERATE_INTERNAL_LABEL (buf, "LCP", label_num++); | |
14966b94 | 6983 | p = (* targetm.strip_name_encoding) (buf); |
36a05131 BS |
6984 | |
6985 | fprintf (asm_out_file, "%s:\n", p); | |
6986 | fprintf (asm_out_file, "%s\n", FIXUP_SECTION_ASM_OP); | |
6987 | fprintf (asm_out_file, "\t.picptr\t%s\n", p); | |
6988 | fprintf (asm_out_file, "\t.previous\n"); | |
6989 | } | |
6990 | assemble_integer_with_op ("\t.picptr\t", value); | |
6991 | return true; | |
6992 | } | |
6993 | if (!aligned_p) | |
6994 | { | |
6995 | /* We've set the unaligned SI op to NULL, so we always have to | |
6996 | handle the unaligned case here. */ | |
6997 | assemble_integer_with_op ("\t.4byte\t", value); | |
6998 | return true; | |
6999 | } | |
7000 | } | |
7001 | return default_assemble_integer (value, size, aligned_p); | |
7002 | } | |
7003 | ||
7004 | /* Function to set up the backend function structure. */ | |
7005 | ||
7006 | static struct machine_function * | |
f2206911 | 7007 | frv_init_machine_status (void) |
36a05131 | 7008 | { |
a9429e29 | 7009 | return ggc_alloc_cleared_machine_function (); |
36a05131 | 7010 | } |
ffb344c1 | 7011 | \f |
28a60850 RS |
7012 | /* Implement TARGET_SCHED_ISSUE_RATE. */ |
7013 | ||
c557edf4 | 7014 | int |
28a60850 RS |
7015 | frv_issue_rate (void) |
7016 | { | |
7017 | if (!TARGET_PACK) | |
7018 | return 1; | |
7019 | ||
7020 | switch (frv_cpu_type) | |
7021 | { | |
7022 | default: | |
7023 | case FRV_CPU_FR300: | |
7024 | case FRV_CPU_SIMPLE: | |
7025 | return 1; | |
7026 | ||
7027 | case FRV_CPU_FR400: | |
c557edf4 RS |
7028 | case FRV_CPU_FR405: |
7029 | case FRV_CPU_FR450: | |
28a60850 RS |
7030 | return 2; |
7031 | ||
7032 | case FRV_CPU_GENERIC: | |
7033 | case FRV_CPU_FR500: | |
7034 | case FRV_CPU_TOMCAT: | |
7035 | return 4; | |
c557edf4 RS |
7036 | |
7037 | case FRV_CPU_FR550: | |
7038 | return 8; | |
28a60850 RS |
7039 | } |
7040 | } | |
36a05131 | 7041 | \f |
c557edf4 RS |
7042 | /* A for_each_rtx callback. If X refers to an accumulator, return |
7043 | ACC_GROUP_ODD if the bit 2 of the register number is set and | |
7044 | ACC_GROUP_EVEN if it is clear. Return 0 (ACC_GROUP_NONE) | |
7045 | otherwise. */ | |
36a05131 | 7046 | |
c557edf4 RS |
7047 | static int |
7048 | frv_acc_group_1 (rtx *x, void *data ATTRIBUTE_UNUSED) | |
36a05131 | 7049 | { |
c557edf4 | 7050 | if (REG_P (*x)) |
36a05131 | 7051 | { |
c557edf4 RS |
7052 | if (ACC_P (REGNO (*x))) |
7053 | return (REGNO (*x) - ACC_FIRST) & 4 ? ACC_GROUP_ODD : ACC_GROUP_EVEN; | |
7054 | if (ACCG_P (REGNO (*x))) | |
7055 | return (REGNO (*x) - ACCG_FIRST) & 4 ? ACC_GROUP_ODD : ACC_GROUP_EVEN; | |
7056 | } | |
7057 | return 0; | |
7058 | } | |
36a05131 | 7059 | |
c557edf4 | 7060 | /* Return the value of INSN's acc_group attribute. */ |
36a05131 | 7061 | |
c557edf4 RS |
7062 | int |
7063 | frv_acc_group (rtx insn) | |
7064 | { | |
7065 | /* This distinction only applies to the FR550 packing constraints. */ | |
7066 | if (frv_cpu_type != FRV_CPU_FR550) | |
7067 | return ACC_GROUP_NONE; | |
7068 | return for_each_rtx (&PATTERN (insn), frv_acc_group_1, 0); | |
7069 | } | |
36a05131 | 7070 | |
c557edf4 RS |
7071 | /* Return the index of the DFA unit in FRV_UNIT_NAMES[] that instruction |
7072 | INSN will try to claim first. Since this value depends only on the | |
7073 | type attribute, we can cache the results in FRV_TYPE_TO_UNIT[]. */ | |
36a05131 | 7074 | |
c557edf4 RS |
7075 | static unsigned int |
7076 | frv_insn_unit (rtx insn) | |
7077 | { | |
7078 | enum attr_type type; | |
36a05131 | 7079 | |
c557edf4 RS |
7080 | type = get_attr_type (insn); |
7081 | if (frv_type_to_unit[type] == ARRAY_SIZE (frv_unit_codes)) | |
7082 | { | |
7083 | /* We haven't seen this type of instruction before. */ | |
7084 | state_t state; | |
7085 | unsigned int unit; | |
36a05131 | 7086 | |
c557edf4 RS |
7087 | /* Issue the instruction on its own to see which unit it prefers. */ |
7088 | state = alloca (state_size ()); | |
7089 | state_reset (state); | |
7090 | state_transition (state, insn); | |
36a05131 | 7091 | |
c557edf4 RS |
7092 | /* Find out which unit was taken. */ |
7093 | for (unit = 0; unit < ARRAY_SIZE (frv_unit_codes); unit++) | |
7094 | if (cpu_unit_reservation_p (state, frv_unit_codes[unit])) | |
7095 | break; | |
36a05131 | 7096 | |
44e91694 | 7097 | gcc_assert (unit != ARRAY_SIZE (frv_unit_codes)); |
36a05131 | 7098 | |
c557edf4 | 7099 | frv_type_to_unit[type] = unit; |
36a05131 | 7100 | } |
c557edf4 RS |
7101 | return frv_type_to_unit[type]; |
7102 | } | |
36a05131 | 7103 | |
c557edf4 | 7104 | /* Return true if INSN issues to a branch unit. */ |
36a05131 | 7105 | |
c557edf4 RS |
7106 | static bool |
7107 | frv_issues_to_branch_unit_p (rtx insn) | |
7108 | { | |
7109 | return frv_unit_groups[frv_insn_unit (insn)] == GROUP_B; | |
7110 | } | |
7111 | \f | |
5c5e8419 JR |
7112 | /* The instructions in the packet, partitioned into groups. */ |
7113 | struct frv_packet_group { | |
7114 | /* How many instructions in the packet belong to this group. */ | |
7115 | unsigned int num_insns; | |
7116 | ||
7117 | /* A list of the instructions that belong to this group, in the order | |
7118 | they appear in the rtl stream. */ | |
7119 | rtx insns[ARRAY_SIZE (frv_unit_codes)]; | |
7120 | ||
7121 | /* The contents of INSNS after they have been sorted into the correct | |
7122 | assembly-language order. Element X issues to unit X. The list may | |
7123 | contain extra nops. */ | |
7124 | rtx sorted[ARRAY_SIZE (frv_unit_codes)]; | |
7125 | ||
7126 | /* The member of frv_nops[] to use in sorted[]. */ | |
7127 | rtx nop; | |
7128 | }; | |
7129 | ||
c557edf4 RS |
7130 | /* The current state of the packing pass, implemented by frv_pack_insns. */ |
7131 | static struct { | |
7132 | /* The state of the pipeline DFA. */ | |
7133 | state_t dfa_state; | |
7134 | ||
7135 | /* Which hardware registers are set within the current packet, | |
7136 | and the conditions under which they are set. */ | |
7137 | regstate_t regstate[FIRST_PSEUDO_REGISTER]; | |
7138 | ||
7139 | /* The memory locations that have been modified so far in this | |
7140 | packet. MEM is the memref and COND is the regstate_t condition | |
7141 | under which it is set. */ | |
7142 | struct { | |
7143 | rtx mem; | |
7144 | regstate_t cond; | |
7145 | } mems[2]; | |
7146 | ||
7147 | /* The number of valid entries in MEMS. The value is larger than | |
7148 | ARRAY_SIZE (mems) if there were too many mems to record. */ | |
7149 | unsigned int num_mems; | |
7150 | ||
7151 | /* The maximum number of instructions that can be packed together. */ | |
7152 | unsigned int issue_rate; | |
7153 | ||
7154 | /* The instructions in the packet, partitioned into groups. */ | |
5c5e8419 | 7155 | struct frv_packet_group groups[NUM_GROUPS]; |
c557edf4 RS |
7156 | |
7157 | /* The instructions that make up the current packet. */ | |
7158 | rtx insns[ARRAY_SIZE (frv_unit_codes)]; | |
7159 | unsigned int num_insns; | |
7160 | } frv_packet; | |
7161 | ||
7162 | /* Return the regstate_t flags for the given COND_EXEC condition. | |
7163 | Abort if the condition isn't in the right form. */ | |
36a05131 | 7164 | |
c557edf4 RS |
7165 | static int |
7166 | frv_cond_flags (rtx cond) | |
7167 | { | |
44e91694 NS |
7168 | gcc_assert ((GET_CODE (cond) == EQ || GET_CODE (cond) == NE) |
7169 | && GET_CODE (XEXP (cond, 0)) == REG | |
7170 | && CR_P (REGNO (XEXP (cond, 0))) | |
7171 | && XEXP (cond, 1) == const0_rtx); | |
7172 | return ((REGNO (XEXP (cond, 0)) - CR_FIRST) | |
7173 | | (GET_CODE (cond) == NE | |
7174 | ? REGSTATE_IF_TRUE | |
7175 | : REGSTATE_IF_FALSE)); | |
c557edf4 | 7176 | } |
36a05131 | 7177 | |
36a05131 | 7178 | |
c557edf4 RS |
7179 | /* Return true if something accessed under condition COND2 can |
7180 | conflict with something written under condition COND1. */ | |
36a05131 | 7181 | |
c557edf4 RS |
7182 | static bool |
7183 | frv_regstate_conflict_p (regstate_t cond1, regstate_t cond2) | |
7184 | { | |
7185 | /* If either reference was unconditional, we have a conflict. */ | |
7186 | if ((cond1 & REGSTATE_IF_EITHER) == 0 | |
7187 | || (cond2 & REGSTATE_IF_EITHER) == 0) | |
7188 | return true; | |
7189 | ||
7190 | /* The references might conflict if they were controlled by | |
7191 | different CRs. */ | |
7192 | if ((cond1 & REGSTATE_CC_MASK) != (cond2 & REGSTATE_CC_MASK)) | |
7193 | return true; | |
7194 | ||
7195 | /* They definitely conflict if they are controlled by the | |
7196 | same condition. */ | |
7197 | if ((cond1 & cond2 & REGSTATE_IF_EITHER) != 0) | |
7198 | return true; | |
7199 | ||
7200 | return false; | |
36a05131 BS |
7201 | } |
7202 | ||
c557edf4 RS |
7203 | |
7204 | /* A for_each_rtx callback. Return 1 if *X depends on an instruction in | |
7205 | the current packet. DATA points to a regstate_t that describes the | |
7206 | condition under which *X might be set or used. */ | |
36a05131 BS |
7207 | |
7208 | static int | |
c557edf4 | 7209 | frv_registers_conflict_p_1 (rtx *x, void *data) |
36a05131 | 7210 | { |
c557edf4 RS |
7211 | unsigned int regno, i; |
7212 | regstate_t cond; | |
36a05131 | 7213 | |
c557edf4 | 7214 | cond = *(regstate_t *) data; |
36a05131 | 7215 | |
c557edf4 RS |
7216 | if (GET_CODE (*x) == REG) |
7217 | FOR_EACH_REGNO (regno, *x) | |
7218 | if ((frv_packet.regstate[regno] & REGSTATE_MODIFIED) != 0) | |
7219 | if (frv_regstate_conflict_p (frv_packet.regstate[regno], cond)) | |
7220 | return 1; | |
36a05131 | 7221 | |
c557edf4 RS |
7222 | if (GET_CODE (*x) == MEM) |
7223 | { | |
7224 | /* If we ran out of memory slots, assume a conflict. */ | |
7225 | if (frv_packet.num_mems > ARRAY_SIZE (frv_packet.mems)) | |
7226 | return 1; | |
36a05131 | 7227 | |
c557edf4 RS |
7228 | /* Check for output or true dependencies with earlier MEMs. */ |
7229 | for (i = 0; i < frv_packet.num_mems; i++) | |
7230 | if (frv_regstate_conflict_p (frv_packet.mems[i].cond, cond)) | |
7231 | { | |
53d9622b | 7232 | if (true_dependence (frv_packet.mems[i].mem, VOIDmode, *x)) |
c557edf4 | 7233 | return 1; |
36a05131 | 7234 | |
c557edf4 RS |
7235 | if (output_dependence (frv_packet.mems[i].mem, *x)) |
7236 | return 1; | |
7237 | } | |
7238 | } | |
36a05131 | 7239 | |
c557edf4 RS |
7240 | /* The return values of calls aren't significant: they describe |
7241 | the effect of the call as a whole, not of the insn itself. */ | |
7242 | if (GET_CODE (*x) == SET && GET_CODE (SET_SRC (*x)) == CALL) | |
7243 | { | |
7244 | if (for_each_rtx (&SET_SRC (*x), frv_registers_conflict_p_1, data)) | |
7245 | return 1; | |
7246 | return -1; | |
7247 | } | |
36a05131 | 7248 | |
c557edf4 RS |
7249 | /* Check subexpressions. */ |
7250 | return 0; | |
7251 | } | |
36a05131 | 7252 | |
36a05131 | 7253 | |
c557edf4 RS |
7254 | /* Return true if something in X might depend on an instruction |
7255 | in the current packet. */ | |
36a05131 | 7256 | |
c557edf4 RS |
7257 | static bool |
7258 | frv_registers_conflict_p (rtx x) | |
7259 | { | |
7260 | regstate_t flags; | |
36a05131 | 7261 | |
c557edf4 RS |
7262 | flags = 0; |
7263 | if (GET_CODE (x) == COND_EXEC) | |
7264 | { | |
7265 | if (for_each_rtx (&XEXP (x, 0), frv_registers_conflict_p_1, &flags)) | |
7266 | return true; | |
36a05131 | 7267 | |
c557edf4 RS |
7268 | flags |= frv_cond_flags (XEXP (x, 0)); |
7269 | x = XEXP (x, 1); | |
36a05131 | 7270 | } |
c557edf4 RS |
7271 | return for_each_rtx (&x, frv_registers_conflict_p_1, &flags); |
7272 | } | |
36a05131 BS |
7273 | |
7274 | ||
c557edf4 RS |
7275 | /* A note_stores callback. DATA points to the regstate_t condition |
7276 | under which X is modified. Update FRV_PACKET accordingly. */ | |
36a05131 | 7277 | |
c557edf4 | 7278 | static void |
7bc980e1 | 7279 | frv_registers_update_1 (rtx x, const_rtx pat ATTRIBUTE_UNUSED, void *data) |
c557edf4 RS |
7280 | { |
7281 | unsigned int regno; | |
7282 | ||
7283 | if (GET_CODE (x) == REG) | |
7284 | FOR_EACH_REGNO (regno, x) | |
7285 | frv_packet.regstate[regno] |= *(regstate_t *) data; | |
7286 | ||
7287 | if (GET_CODE (x) == MEM) | |
36a05131 | 7288 | { |
c557edf4 | 7289 | if (frv_packet.num_mems < ARRAY_SIZE (frv_packet.mems)) |
36a05131 | 7290 | { |
c557edf4 RS |
7291 | frv_packet.mems[frv_packet.num_mems].mem = x; |
7292 | frv_packet.mems[frv_packet.num_mems].cond = *(regstate_t *) data; | |
7293 | } | |
7294 | frv_packet.num_mems++; | |
7295 | } | |
7296 | } | |
36a05131 | 7297 | |
36a05131 | 7298 | |
c557edf4 RS |
7299 | /* Update the register state information for an instruction whose |
7300 | body is X. */ | |
7301 | ||
7302 | static void | |
7303 | frv_registers_update (rtx x) | |
7304 | { | |
7305 | regstate_t flags; | |
7306 | ||
7307 | flags = REGSTATE_MODIFIED; | |
7308 | if (GET_CODE (x) == COND_EXEC) | |
7309 | { | |
7310 | flags |= frv_cond_flags (XEXP (x, 0)); | |
7311 | x = XEXP (x, 1); | |
36a05131 | 7312 | } |
c557edf4 RS |
7313 | note_stores (x, frv_registers_update_1, &flags); |
7314 | } | |
36a05131 | 7315 | |
c557edf4 RS |
7316 | |
7317 | /* Initialize frv_packet for the start of a new packet. */ | |
7318 | ||
7319 | static void | |
7320 | frv_start_packet (void) | |
7321 | { | |
7322 | enum frv_insn_group group; | |
7323 | ||
7324 | memset (frv_packet.regstate, 0, sizeof (frv_packet.regstate)); | |
7325 | frv_packet.num_mems = 0; | |
7326 | frv_packet.num_insns = 0; | |
5c5e8419 JR |
7327 | for (group = GROUP_I; group < NUM_GROUPS; |
7328 | group = (enum frv_insn_group) (group + 1)) | |
c557edf4 | 7329 | frv_packet.groups[group].num_insns = 0; |
36a05131 BS |
7330 | } |
7331 | ||
36a05131 | 7332 | |
c557edf4 RS |
7333 | /* Likewise for the start of a new basic block. */ |
7334 | ||
7335 | static void | |
7336 | frv_start_packet_block (void) | |
36a05131 | 7337 | { |
c557edf4 RS |
7338 | state_reset (frv_packet.dfa_state); |
7339 | frv_start_packet (); | |
7340 | } | |
36a05131 | 7341 | |
c557edf4 RS |
7342 | |
7343 | /* Finish the current packet, if any, and start a new one. Call | |
7344 | HANDLE_PACKET with FRV_PACKET describing the completed packet. */ | |
7345 | ||
7346 | static void | |
7347 | frv_finish_packet (void (*handle_packet) (void)) | |
7348 | { | |
7349 | if (frv_packet.num_insns > 0) | |
36a05131 | 7350 | { |
c557edf4 RS |
7351 | handle_packet (); |
7352 | state_transition (frv_packet.dfa_state, 0); | |
7353 | frv_start_packet (); | |
7354 | } | |
7355 | } | |
36a05131 | 7356 | |
36a05131 | 7357 | |
c557edf4 RS |
7358 | /* Return true if INSN can be added to the current packet. Update |
7359 | the DFA state on success. */ | |
36a05131 | 7360 | |
c557edf4 RS |
7361 | static bool |
7362 | frv_pack_insn_p (rtx insn) | |
7363 | { | |
7364 | /* See if the packet is already as long as it can be. */ | |
7365 | if (frv_packet.num_insns == frv_packet.issue_rate) | |
7366 | return false; | |
36a05131 | 7367 | |
c557edf4 RS |
7368 | /* If the scheduler thought that an instruction should start a packet, |
7369 | it's usually a good idea to believe it. It knows much more about | |
7370 | the latencies than we do. | |
36a05131 | 7371 | |
c557edf4 | 7372 | There are some exceptions though: |
36a05131 | 7373 | |
c557edf4 RS |
7374 | - Conditional instructions are scheduled on the assumption that |
7375 | they will be executed. This is usually a good thing, since it | |
c112cf2b | 7376 | tends to avoid unnecessary stalls in the conditional code. |
c557edf4 RS |
7377 | But we want to pack conditional instructions as tightly as |
7378 | possible, in order to optimize the case where they aren't | |
7379 | executed. | |
36a05131 | 7380 | |
c557edf4 RS |
7381 | - The scheduler will always put branches on their own, even |
7382 | if there's no real dependency. | |
36a05131 | 7383 | |
c557edf4 RS |
7384 | - There's no point putting a call in its own packet unless |
7385 | we have to. */ | |
7386 | if (frv_packet.num_insns > 0 | |
b64925dc | 7387 | && NONJUMP_INSN_P (insn) |
c557edf4 RS |
7388 | && GET_MODE (insn) == TImode |
7389 | && GET_CODE (PATTERN (insn)) != COND_EXEC) | |
7390 | return false; | |
36a05131 | 7391 | |
c557edf4 RS |
7392 | /* Check for register conflicts. Don't do this for setlo since any |
7393 | conflict will be with the partnering sethi, with which it can | |
7394 | be packed. */ | |
7395 | if (get_attr_type (insn) != TYPE_SETLO) | |
7396 | if (frv_registers_conflict_p (PATTERN (insn))) | |
7397 | return false; | |
36a05131 | 7398 | |
c557edf4 RS |
7399 | return state_transition (frv_packet.dfa_state, insn) < 0; |
7400 | } | |
36a05131 | 7401 | |
36a05131 | 7402 | |
c557edf4 | 7403 | /* Add instruction INSN to the current packet. */ |
36a05131 | 7404 | |
c557edf4 RS |
7405 | static void |
7406 | frv_add_insn_to_packet (rtx insn) | |
7407 | { | |
7408 | struct frv_packet_group *packet_group; | |
7409 | ||
7410 | packet_group = &frv_packet.groups[frv_unit_groups[frv_insn_unit (insn)]]; | |
7411 | packet_group->insns[packet_group->num_insns++] = insn; | |
7412 | frv_packet.insns[frv_packet.num_insns++] = insn; | |
7413 | ||
7414 | frv_registers_update (PATTERN (insn)); | |
36a05131 BS |
7415 | } |
7416 | ||
c557edf4 RS |
7417 | |
7418 | /* Insert INSN (a member of frv_nops[]) into the current packet. If the | |
7419 | packet ends in a branch or call, insert the nop before it, otherwise | |
7420 | add to the end. */ | |
36a05131 BS |
7421 | |
7422 | static void | |
c557edf4 | 7423 | frv_insert_nop_in_packet (rtx insn) |
36a05131 | 7424 | { |
c557edf4 RS |
7425 | struct frv_packet_group *packet_group; |
7426 | rtx last; | |
7427 | ||
7428 | packet_group = &frv_packet.groups[frv_unit_groups[frv_insn_unit (insn)]]; | |
7429 | last = frv_packet.insns[frv_packet.num_insns - 1]; | |
b64925dc | 7430 | if (! NONJUMP_INSN_P (last)) |
c557edf4 RS |
7431 | { |
7432 | insn = emit_insn_before (PATTERN (insn), last); | |
7433 | frv_packet.insns[frv_packet.num_insns - 1] = insn; | |
7434 | frv_packet.insns[frv_packet.num_insns++] = last; | |
7435 | } | |
7436 | else | |
7437 | { | |
7438 | insn = emit_insn_after (PATTERN (insn), last); | |
7439 | frv_packet.insns[frv_packet.num_insns++] = insn; | |
7440 | } | |
7441 | packet_group->insns[packet_group->num_insns++] = insn; | |
7442 | } | |
7443 | ||
36a05131 | 7444 | |
c557edf4 RS |
7445 | /* If packing is enabled, divide the instructions into packets and |
7446 | return true. Call HANDLE_PACKET for each complete packet. */ | |
7447 | ||
7448 | static bool | |
7449 | frv_for_each_packet (void (*handle_packet) (void)) | |
7450 | { | |
7451 | rtx insn, next_insn; | |
7452 | ||
7453 | frv_packet.issue_rate = frv_issue_rate (); | |
7454 | ||
7455 | /* Early exit if we don't want to pack insns. */ | |
28a60850 RS |
7456 | if (!optimize |
7457 | || !flag_schedule_insns_after_reload | |
0b2c18fe | 7458 | || !TARGET_VLIW_BRANCH |
c557edf4 RS |
7459 | || frv_packet.issue_rate == 1) |
7460 | return false; | |
36a05131 | 7461 | |
c557edf4 | 7462 | /* Set up the initial packing state. */ |
36a05131 | 7463 | dfa_start (); |
c557edf4 | 7464 | frv_packet.dfa_state = alloca (state_size ()); |
36a05131 | 7465 | |
c557edf4 RS |
7466 | frv_start_packet_block (); |
7467 | for (insn = get_insns (); insn != 0; insn = next_insn) | |
36a05131 | 7468 | { |
c557edf4 RS |
7469 | enum rtx_code code; |
7470 | bool eh_insn_p; | |
36a05131 | 7471 | |
c557edf4 RS |
7472 | code = GET_CODE (insn); |
7473 | next_insn = NEXT_INSN (insn); | |
7474 | ||
7475 | if (code == CODE_LABEL) | |
36a05131 | 7476 | { |
c557edf4 RS |
7477 | frv_finish_packet (handle_packet); |
7478 | frv_start_packet_block (); | |
7479 | } | |
36a05131 | 7480 | |
39718607 | 7481 | if (INSN_P (insn)) |
c557edf4 RS |
7482 | switch (GET_CODE (PATTERN (insn))) |
7483 | { | |
7484 | case USE: | |
7485 | case CLOBBER: | |
c557edf4 | 7486 | break; |
36a05131 | 7487 | |
c557edf4 RS |
7488 | default: |
7489 | /* Calls mustn't be packed on a TOMCAT. */ | |
b64925dc | 7490 | if (CALL_P (insn) && frv_cpu_type == FRV_CPU_TOMCAT) |
c557edf4 RS |
7491 | frv_finish_packet (handle_packet); |
7492 | ||
7493 | /* Since the last instruction in a packet determines the EH | |
7494 | region, any exception-throwing instruction must come at | |
7495 | the end of reordered packet. Insns that issue to a | |
7496 | branch unit are bound to come last; for others it's | |
7497 | too hard to predict. */ | |
7498 | eh_insn_p = (find_reg_note (insn, REG_EH_REGION, NULL) != NULL); | |
7499 | if (eh_insn_p && !frv_issues_to_branch_unit_p (insn)) | |
7500 | frv_finish_packet (handle_packet); | |
7501 | ||
7502 | /* Finish the current packet if we can't add INSN to it. | |
7503 | Simulate cycles until INSN is ready to issue. */ | |
7504 | if (!frv_pack_insn_p (insn)) | |
7505 | { | |
7506 | frv_finish_packet (handle_packet); | |
7507 | while (!frv_pack_insn_p (insn)) | |
7508 | state_transition (frv_packet.dfa_state, 0); | |
7509 | } | |
36a05131 | 7510 | |
c557edf4 RS |
7511 | /* Add the instruction to the packet. */ |
7512 | frv_add_insn_to_packet (insn); | |
7513 | ||
7514 | /* Calls and jumps end a packet, as do insns that throw | |
7515 | an exception. */ | |
7516 | if (code == CALL_INSN || code == JUMP_INSN || eh_insn_p) | |
7517 | frv_finish_packet (handle_packet); | |
7518 | break; | |
7519 | } | |
7520 | } | |
7521 | frv_finish_packet (handle_packet); | |
7522 | dfa_finish (); | |
7523 | return true; | |
7524 | } | |
7525 | \f | |
7526 | /* Subroutine of frv_sort_insn_group. We are trying to sort | |
7527 | frv_packet.groups[GROUP].sorted[0...NUM_INSNS-1] into assembly | |
7528 | language order. We have already picked a new position for | |
7529 | frv_packet.groups[GROUP].sorted[X] if bit X of ISSUED is set. | |
7530 | These instructions will occupy elements [0, LOWER_SLOT) and | |
7531 | [UPPER_SLOT, NUM_INSNS) of the final (sorted) array. STATE is | |
7532 | the DFA state after issuing these instructions. | |
7533 | ||
7534 | Try filling elements [LOWER_SLOT, UPPER_SLOT) with every permutation | |
7535 | of the unused instructions. Return true if one such permutation gives | |
7536 | a valid ordering, leaving the successful permutation in sorted[]. | |
7537 | Do not modify sorted[] until a valid permutation is found. */ | |
7538 | ||
7539 | static bool | |
7540 | frv_sort_insn_group_1 (enum frv_insn_group group, | |
7541 | unsigned int lower_slot, unsigned int upper_slot, | |
7542 | unsigned int issued, unsigned int num_insns, | |
7543 | state_t state) | |
7544 | { | |
7545 | struct frv_packet_group *packet_group; | |
7546 | unsigned int i; | |
7547 | state_t test_state; | |
7548 | size_t dfa_size; | |
7549 | rtx insn; | |
7550 | ||
7551 | /* Early success if we've filled all the slots. */ | |
7552 | if (lower_slot == upper_slot) | |
7553 | return true; | |
7554 | ||
7555 | packet_group = &frv_packet.groups[group]; | |
7556 | dfa_size = state_size (); | |
7557 | test_state = alloca (dfa_size); | |
7558 | ||
7559 | /* Try issuing each unused instruction. */ | |
7560 | for (i = num_insns - 1; i + 1 != 0; i--) | |
7561 | if (~issued & (1 << i)) | |
7562 | { | |
7563 | insn = packet_group->sorted[i]; | |
7564 | memcpy (test_state, state, dfa_size); | |
7565 | if (state_transition (test_state, insn) < 0 | |
7566 | && cpu_unit_reservation_p (test_state, | |
7567 | NTH_UNIT (group, upper_slot - 1)) | |
7568 | && frv_sort_insn_group_1 (group, lower_slot, upper_slot - 1, | |
7569 | issued | (1 << i), num_insns, | |
7570 | test_state)) | |
7571 | { | |
7572 | packet_group->sorted[upper_slot - 1] = insn; | |
7573 | return true; | |
7574 | } | |
7575 | } | |
7576 | ||
7577 | return false; | |
7578 | } | |
7579 | ||
7580 | /* Compare two instructions by their frv_insn_unit. */ | |
7581 | ||
7582 | static int | |
7583 | frv_compare_insns (const void *first, const void *second) | |
7584 | { | |
5ead67f6 KG |
7585 | const rtx *const insn1 = (rtx const *) first, |
7586 | *const insn2 = (rtx const *) second; | |
c557edf4 RS |
7587 | return frv_insn_unit (*insn1) - frv_insn_unit (*insn2); |
7588 | } | |
7589 | ||
7590 | /* Copy frv_packet.groups[GROUP].insns[] to frv_packet.groups[GROUP].sorted[] | |
7591 | and sort it into assembly language order. See frv.md for a description of | |
7592 | the algorithm. */ | |
7593 | ||
7594 | static void | |
7595 | frv_sort_insn_group (enum frv_insn_group group) | |
7596 | { | |
7597 | struct frv_packet_group *packet_group; | |
7598 | unsigned int first, i, nop, max_unit, num_slots; | |
7599 | state_t state, test_state; | |
7600 | size_t dfa_size; | |
7601 | ||
7602 | packet_group = &frv_packet.groups[group]; | |
75d0ac8d RS |
7603 | |
7604 | /* Assume no nop is needed. */ | |
7605 | packet_group->nop = 0; | |
7606 | ||
c557edf4 RS |
7607 | if (packet_group->num_insns == 0) |
7608 | return; | |
7609 | ||
7610 | /* Copy insns[] to sorted[]. */ | |
7611 | memcpy (packet_group->sorted, packet_group->insns, | |
7612 | sizeof (rtx) * packet_group->num_insns); | |
7613 | ||
7614 | /* Sort sorted[] by the unit that each insn tries to take first. */ | |
7615 | if (packet_group->num_insns > 1) | |
7616 | qsort (packet_group->sorted, packet_group->num_insns, | |
7617 | sizeof (rtx), frv_compare_insns); | |
7618 | ||
7619 | /* That's always enough for branch and control insns. */ | |
7620 | if (group == GROUP_B || group == GROUP_C) | |
7621 | return; | |
7622 | ||
7623 | dfa_size = state_size (); | |
7624 | state = alloca (dfa_size); | |
7625 | test_state = alloca (dfa_size); | |
7626 | ||
7627 | /* Find the highest FIRST such that sorted[0...FIRST-1] can issue | |
7628 | consecutively and such that the DFA takes unit X when sorted[X] | |
7629 | is added. Set STATE to the new DFA state. */ | |
7630 | state_reset (test_state); | |
7631 | for (first = 0; first < packet_group->num_insns; first++) | |
7632 | { | |
7633 | memcpy (state, test_state, dfa_size); | |
7634 | if (state_transition (test_state, packet_group->sorted[first]) >= 0 | |
7635 | || !cpu_unit_reservation_p (test_state, NTH_UNIT (group, first))) | |
7636 | break; | |
7637 | } | |
7638 | ||
7639 | /* If all the instructions issued in ascending order, we're done. */ | |
7640 | if (first == packet_group->num_insns) | |
7641 | return; | |
36a05131 | 7642 | |
c557edf4 RS |
7643 | /* Add nops to the end of sorted[] and try each permutation until |
7644 | we find one that works. */ | |
7645 | for (nop = 0; nop < frv_num_nops; nop++) | |
7646 | { | |
7647 | max_unit = frv_insn_unit (frv_nops[nop]); | |
7648 | if (frv_unit_groups[max_unit] == group) | |
36a05131 | 7649 | { |
c557edf4 RS |
7650 | packet_group->nop = frv_nops[nop]; |
7651 | num_slots = UNIT_NUMBER (max_unit) + 1; | |
7652 | for (i = packet_group->num_insns; i < num_slots; i++) | |
7653 | packet_group->sorted[i] = frv_nops[nop]; | |
7654 | if (frv_sort_insn_group_1 (group, first, num_slots, | |
7655 | (1 << first) - 1, num_slots, state)) | |
7656 | return; | |
36a05131 | 7657 | } |
c557edf4 | 7658 | } |
44e91694 | 7659 | gcc_unreachable (); |
c557edf4 RS |
7660 | } |
7661 | \f | |
7662 | /* Sort the current packet into assembly-language order. Set packing | |
7663 | flags as appropriate. */ | |
36a05131 | 7664 | |
c557edf4 RS |
7665 | static void |
7666 | frv_reorder_packet (void) | |
7667 | { | |
7668 | unsigned int cursor[NUM_GROUPS]; | |
7669 | rtx insns[ARRAY_SIZE (frv_unit_groups)]; | |
7670 | unsigned int unit, to, from; | |
7671 | enum frv_insn_group group; | |
7672 | struct frv_packet_group *packet_group; | |
7673 | ||
7674 | /* First sort each group individually. */ | |
5c5e8419 JR |
7675 | for (group = GROUP_I; group < NUM_GROUPS; |
7676 | group = (enum frv_insn_group) (group + 1)) | |
c557edf4 RS |
7677 | { |
7678 | cursor[group] = 0; | |
7679 | frv_sort_insn_group (group); | |
7680 | } | |
7681 | ||
7682 | /* Go through the unit template and try add an instruction from | |
7683 | that unit's group. */ | |
7684 | to = 0; | |
7685 | for (unit = 0; unit < ARRAY_SIZE (frv_unit_groups); unit++) | |
7686 | { | |
7687 | group = frv_unit_groups[unit]; | |
7688 | packet_group = &frv_packet.groups[group]; | |
7689 | if (cursor[group] < packet_group->num_insns) | |
36a05131 | 7690 | { |
c557edf4 | 7691 | /* frv_reorg should have added nops for us. */ |
44e91694 NS |
7692 | gcc_assert (packet_group->sorted[cursor[group]] |
7693 | != packet_group->nop); | |
c557edf4 | 7694 | insns[to++] = packet_group->sorted[cursor[group]++]; |
36a05131 | 7695 | } |
c557edf4 | 7696 | } |
36a05131 | 7697 | |
44e91694 | 7698 | gcc_assert (to == frv_packet.num_insns); |
36a05131 | 7699 | |
c557edf4 RS |
7700 | /* Clear the last instruction's packing flag, thus marking the end of |
7701 | a packet. Reorder the other instructions relative to it. */ | |
7702 | CLEAR_PACKING_FLAG (insns[to - 1]); | |
7703 | for (from = 0; from < to - 1; from++) | |
7704 | { | |
7705 | remove_insn (insns[from]); | |
6fb5fa3c | 7706 | add_insn_before (insns[from], insns[to - 1], NULL); |
c557edf4 RS |
7707 | SET_PACKING_FLAG (insns[from]); |
7708 | } | |
7709 | } | |
36a05131 | 7710 | |
36a05131 | 7711 | |
c557edf4 RS |
7712 | /* Divide instructions into packets. Reorder the contents of each |
7713 | packet so that they are in the correct assembly-language order. | |
7714 | ||
7715 | Since this pass can change the raw meaning of the rtl stream, it must | |
7716 | only be called at the last minute, just before the instructions are | |
7717 | written out. */ | |
7718 | ||
7719 | static void | |
7720 | frv_pack_insns (void) | |
7721 | { | |
7722 | if (frv_for_each_packet (frv_reorder_packet)) | |
7723 | frv_insn_packing_flag = 0; | |
7724 | else | |
7725 | frv_insn_packing_flag = -1; | |
7726 | } | |
7727 | \f | |
7728 | /* See whether we need to add nops to group GROUP in order to | |
7729 | make a valid packet. */ | |
7730 | ||
7731 | static void | |
7732 | frv_fill_unused_units (enum frv_insn_group group) | |
7733 | { | |
7734 | unsigned int non_nops, nops, i; | |
7735 | struct frv_packet_group *packet_group; | |
7736 | ||
7737 | packet_group = &frv_packet.groups[group]; | |
7738 | ||
7739 | /* Sort the instructions into assembly-language order. | |
7740 | Use nops to fill slots that are otherwise unused. */ | |
7741 | frv_sort_insn_group (group); | |
7742 | ||
7743 | /* See how many nops are needed before the final useful instruction. */ | |
7744 | i = nops = 0; | |
7745 | for (non_nops = 0; non_nops < packet_group->num_insns; non_nops++) | |
7746 | while (packet_group->sorted[i++] == packet_group->nop) | |
7747 | nops++; | |
7748 | ||
7749 | /* Insert that many nops into the instruction stream. */ | |
7750 | while (nops-- > 0) | |
7751 | frv_insert_nop_in_packet (packet_group->nop); | |
7752 | } | |
7753 | ||
38c28a25 AH |
7754 | /* Return true if accesses IO1 and IO2 refer to the same doubleword. */ |
7755 | ||
7756 | static bool | |
7757 | frv_same_doubleword_p (const struct frv_io *io1, const struct frv_io *io2) | |
7758 | { | |
7759 | if (io1->const_address != 0 && io2->const_address != 0) | |
7760 | return io1->const_address == io2->const_address; | |
7761 | ||
7762 | if (io1->var_address != 0 && io2->var_address != 0) | |
7763 | return rtx_equal_p (io1->var_address, io2->var_address); | |
7764 | ||
7765 | return false; | |
7766 | } | |
7767 | ||
7768 | /* Return true if operations IO1 and IO2 are guaranteed to complete | |
7769 | in order. */ | |
7770 | ||
7771 | static bool | |
7772 | frv_io_fixed_order_p (const struct frv_io *io1, const struct frv_io *io2) | |
7773 | { | |
7774 | /* The order of writes is always preserved. */ | |
7775 | if (io1->type == FRV_IO_WRITE && io2->type == FRV_IO_WRITE) | |
7776 | return true; | |
7777 | ||
7778 | /* The order of reads isn't preserved. */ | |
7779 | if (io1->type != FRV_IO_WRITE && io2->type != FRV_IO_WRITE) | |
7780 | return false; | |
7781 | ||
7782 | /* One operation is a write and the other is (or could be) a read. | |
7783 | The order is only guaranteed if the accesses are to the same | |
7784 | doubleword. */ | |
7785 | return frv_same_doubleword_p (io1, io2); | |
7786 | } | |
7787 | ||
7788 | /* Generalize I/O operation X so that it covers both X and Y. */ | |
7789 | ||
7790 | static void | |
7791 | frv_io_union (struct frv_io *x, const struct frv_io *y) | |
7792 | { | |
7793 | if (x->type != y->type) | |
7794 | x->type = FRV_IO_UNKNOWN; | |
7795 | if (!frv_same_doubleword_p (x, y)) | |
7796 | { | |
7797 | x->const_address = 0; | |
7798 | x->var_address = 0; | |
7799 | } | |
7800 | } | |
7801 | ||
7802 | /* Fill IO with information about the load or store associated with | |
7803 | membar instruction INSN. */ | |
7804 | ||
7805 | static void | |
7806 | frv_extract_membar (struct frv_io *io, rtx insn) | |
7807 | { | |
7808 | extract_insn (insn); | |
5c5e8419 | 7809 | io->type = (enum frv_io_type) INTVAL (recog_data.operand[2]); |
38c28a25 AH |
7810 | io->const_address = INTVAL (recog_data.operand[1]); |
7811 | io->var_address = XEXP (recog_data.operand[0], 0); | |
7812 | } | |
7813 | ||
7814 | /* A note_stores callback for which DATA points to an rtx. Nullify *DATA | |
7815 | if X is a register and *DATA depends on X. */ | |
7816 | ||
7817 | static void | |
7bc980e1 | 7818 | frv_io_check_address (rtx x, const_rtx pat ATTRIBUTE_UNUSED, void *data) |
38c28a25 | 7819 | { |
5ead67f6 | 7820 | rtx *other = (rtx *) data; |
38c28a25 AH |
7821 | |
7822 | if (REG_P (x) && *other != 0 && reg_overlap_mentioned_p (x, *other)) | |
7823 | *other = 0; | |
7824 | } | |
7825 | ||
7826 | /* A note_stores callback for which DATA points to a HARD_REG_SET. | |
7827 | Remove every modified register from the set. */ | |
7828 | ||
7829 | static void | |
7bc980e1 | 7830 | frv_io_handle_set (rtx x, const_rtx pat ATTRIBUTE_UNUSED, void *data) |
38c28a25 | 7831 | { |
5ead67f6 | 7832 | HARD_REG_SET *set = (HARD_REG_SET *) data; |
38c28a25 AH |
7833 | unsigned int regno; |
7834 | ||
7835 | if (REG_P (x)) | |
7836 | FOR_EACH_REGNO (regno, x) | |
7837 | CLEAR_HARD_REG_BIT (*set, regno); | |
7838 | } | |
7839 | ||
7840 | /* A for_each_rtx callback for which DATA points to a HARD_REG_SET. | |
7841 | Add every register in *X to the set. */ | |
7842 | ||
7843 | static int | |
7844 | frv_io_handle_use_1 (rtx *x, void *data) | |
7845 | { | |
5ead67f6 | 7846 | HARD_REG_SET *set = (HARD_REG_SET *) data; |
38c28a25 AH |
7847 | unsigned int regno; |
7848 | ||
7849 | if (REG_P (*x)) | |
7850 | FOR_EACH_REGNO (regno, *x) | |
7851 | SET_HARD_REG_BIT (*set, regno); | |
7852 | ||
7853 | return 0; | |
7854 | } | |
7855 | ||
7856 | /* A note_stores callback that applies frv_io_handle_use_1 to an | |
7857 | entire rhs value. */ | |
7858 | ||
7859 | static void | |
7860 | frv_io_handle_use (rtx *x, void *data) | |
7861 | { | |
7862 | for_each_rtx (x, frv_io_handle_use_1, data); | |
7863 | } | |
7864 | ||
7865 | /* Go through block BB looking for membars to remove. There are two | |
7866 | cases where intra-block analysis is enough: | |
7867 | ||
7868 | - a membar is redundant if it occurs between two consecutive I/O | |
7869 | operations and if those operations are guaranteed to complete | |
7870 | in order. | |
7871 | ||
7872 | - a membar for a __builtin_read is redundant if the result is | |
7873 | used before the next I/O operation is issued. | |
7874 | ||
7875 | If the last membar in the block could not be removed, and there | |
7876 | are guaranteed to be no I/O operations between that membar and | |
7877 | the end of the block, store the membar in *LAST_MEMBAR, otherwise | |
7878 | store null. | |
7879 | ||
7880 | Describe the block's first I/O operation in *NEXT_IO. Describe | |
7881 | an unknown operation if the block doesn't do any I/O. */ | |
7882 | ||
7883 | static void | |
7884 | frv_optimize_membar_local (basic_block bb, struct frv_io *next_io, | |
7885 | rtx *last_membar) | |
7886 | { | |
7887 | HARD_REG_SET used_regs; | |
7888 | rtx next_membar, set, insn; | |
7889 | bool next_is_end_p; | |
7890 | ||
7891 | /* NEXT_IO is the next I/O operation to be performed after the current | |
7892 | instruction. It starts off as being an unknown operation. */ | |
7893 | memset (next_io, 0, sizeof (*next_io)); | |
7894 | ||
7895 | /* NEXT_IS_END_P is true if NEXT_IO describes the end of the block. */ | |
7896 | next_is_end_p = true; | |
7897 | ||
7898 | /* If the current instruction is a __builtin_read or __builtin_write, | |
7899 | NEXT_MEMBAR is the membar instruction associated with it. NEXT_MEMBAR | |
7900 | is null if the membar has already been deleted. | |
7901 | ||
7902 | Note that the initialization here should only be needed to | |
536fa7b7 | 7903 | suppress warnings. */ |
38c28a25 AH |
7904 | next_membar = 0; |
7905 | ||
7906 | /* USED_REGS is the set of registers that are used before the | |
7907 | next I/O instruction. */ | |
7908 | CLEAR_HARD_REG_SET (used_regs); | |
7909 | ||
7910 | for (insn = BB_END (bb); insn != BB_HEAD (bb); insn = PREV_INSN (insn)) | |
b64925dc | 7911 | if (CALL_P (insn)) |
38c28a25 AH |
7912 | { |
7913 | /* We can't predict what a call will do to volatile memory. */ | |
7914 | memset (next_io, 0, sizeof (struct frv_io)); | |
7915 | next_is_end_p = false; | |
7916 | CLEAR_HARD_REG_SET (used_regs); | |
7917 | } | |
7918 | else if (INSN_P (insn)) | |
7919 | switch (recog_memoized (insn)) | |
7920 | { | |
7921 | case CODE_FOR_optional_membar_qi: | |
7922 | case CODE_FOR_optional_membar_hi: | |
7923 | case CODE_FOR_optional_membar_si: | |
7924 | case CODE_FOR_optional_membar_di: | |
7925 | next_membar = insn; | |
7926 | if (next_is_end_p) | |
7927 | { | |
7928 | /* Local information isn't enough to decide whether this | |
7929 | membar is needed. Stash it away for later. */ | |
7930 | *last_membar = insn; | |
7931 | frv_extract_membar (next_io, insn); | |
7932 | next_is_end_p = false; | |
7933 | } | |
7934 | else | |
7935 | { | |
7936 | /* Check whether the I/O operation before INSN could be | |
7937 | reordered with one described by NEXT_IO. If it can't, | |
7938 | INSN will not be needed. */ | |
7939 | struct frv_io prev_io; | |
7940 | ||
7941 | frv_extract_membar (&prev_io, insn); | |
7942 | if (frv_io_fixed_order_p (&prev_io, next_io)) | |
7943 | { | |
7944 | if (dump_file) | |
7945 | fprintf (dump_file, | |
7946 | ";; [Local] Removing membar %d since order" | |
7947 | " of accesses is guaranteed\n", | |
7948 | INSN_UID (next_membar)); | |
7949 | ||
7950 | insn = NEXT_INSN (insn); | |
7951 | delete_insn (next_membar); | |
7952 | next_membar = 0; | |
7953 | } | |
7954 | *next_io = prev_io; | |
7955 | } | |
7956 | break; | |
7957 | ||
7958 | default: | |
7959 | /* Invalidate NEXT_IO's address if it depends on something that | |
7960 | is clobbered by INSN. */ | |
7961 | if (next_io->var_address) | |
7962 | note_stores (PATTERN (insn), frv_io_check_address, | |
7963 | &next_io->var_address); | |
7964 | ||
7965 | /* If the next membar is associated with a __builtin_read, | |
7966 | see if INSN reads from that address. If it does, and if | |
7967 | the destination register is used before the next I/O access, | |
7968 | there is no need for the membar. */ | |
7969 | set = PATTERN (insn); | |
7970 | if (next_io->type == FRV_IO_READ | |
7971 | && next_io->var_address != 0 | |
7972 | && next_membar != 0 | |
7973 | && GET_CODE (set) == SET | |
7974 | && GET_CODE (SET_DEST (set)) == REG | |
7975 | && TEST_HARD_REG_BIT (used_regs, REGNO (SET_DEST (set)))) | |
7976 | { | |
7977 | rtx src; | |
7978 | ||
7979 | src = SET_SRC (set); | |
7980 | if (GET_CODE (src) == ZERO_EXTEND) | |
7981 | src = XEXP (src, 0); | |
7982 | ||
7983 | if (GET_CODE (src) == MEM | |
7984 | && rtx_equal_p (XEXP (src, 0), next_io->var_address)) | |
7985 | { | |
7986 | if (dump_file) | |
7987 | fprintf (dump_file, | |
7988 | ";; [Local] Removing membar %d since the target" | |
7989 | " of %d is used before the I/O operation\n", | |
7990 | INSN_UID (next_membar), INSN_UID (insn)); | |
7991 | ||
7992 | if (next_membar == *last_membar) | |
7993 | *last_membar = 0; | |
7994 | ||
7995 | delete_insn (next_membar); | |
7996 | next_membar = 0; | |
7997 | } | |
7998 | } | |
7999 | ||
8000 | /* If INSN has volatile references, forget about any registers | |
8001 | that are used after it. Otherwise forget about uses that | |
8002 | are (or might be) defined by INSN. */ | |
8003 | if (volatile_refs_p (PATTERN (insn))) | |
8004 | CLEAR_HARD_REG_SET (used_regs); | |
8005 | else | |
8006 | note_stores (PATTERN (insn), frv_io_handle_set, &used_regs); | |
8007 | ||
8008 | note_uses (&PATTERN (insn), frv_io_handle_use, &used_regs); | |
8009 | break; | |
8010 | } | |
8011 | } | |
8012 | ||
8013 | /* See if MEMBAR, the last membar instruction in BB, can be removed. | |
8014 | FIRST_IO[X] describes the first operation performed by basic block X. */ | |
8015 | ||
8016 | static void | |
8017 | frv_optimize_membar_global (basic_block bb, struct frv_io *first_io, | |
8018 | rtx membar) | |
8019 | { | |
8020 | struct frv_io this_io, next_io; | |
8021 | edge succ; | |
8022 | edge_iterator ei; | |
8023 | ||
8024 | /* We need to keep the membar if there is an edge to the exit block. */ | |
8025 | FOR_EACH_EDGE (succ, ei, bb->succs) | |
8026 | /* for (succ = bb->succ; succ != 0; succ = succ->succ_next) */ | |
8027 | if (succ->dest == EXIT_BLOCK_PTR) | |
8028 | return; | |
8029 | ||
8030 | /* Work out the union of all successor blocks. */ | |
8031 | ei = ei_start (bb->succs); | |
8032 | ei_cond (ei, &succ); | |
8033 | /* next_io = first_io[bb->succ->dest->index]; */ | |
8034 | next_io = first_io[succ->dest->index]; | |
8035 | ei = ei_start (bb->succs); | |
8036 | if (ei_cond (ei, &succ)) | |
8037 | { | |
8038 | for (ei_next (&ei); ei_cond (ei, &succ); ei_next (&ei)) | |
8039 | /*for (succ = bb->succ->succ_next; succ != 0; succ = succ->succ_next)*/ | |
8040 | frv_io_union (&next_io, &first_io[succ->dest->index]); | |
8041 | } | |
8042 | else | |
8043 | gcc_unreachable (); | |
8044 | ||
8045 | frv_extract_membar (&this_io, membar); | |
8046 | if (frv_io_fixed_order_p (&this_io, &next_io)) | |
8047 | { | |
8048 | if (dump_file) | |
8049 | fprintf (dump_file, | |
8050 | ";; [Global] Removing membar %d since order of accesses" | |
8051 | " is guaranteed\n", INSN_UID (membar)); | |
8052 | ||
8053 | delete_insn (membar); | |
8054 | } | |
8055 | } | |
8056 | ||
8057 | /* Remove redundant membars from the current function. */ | |
8058 | ||
8059 | static void | |
8060 | frv_optimize_membar (void) | |
8061 | { | |
8062 | basic_block bb; | |
8063 | struct frv_io *first_io; | |
8064 | rtx *last_membar; | |
8065 | ||
8066 | compute_bb_for_insn (); | |
5ead67f6 KG |
8067 | first_io = XCNEWVEC (struct frv_io, last_basic_block); |
8068 | last_membar = XCNEWVEC (rtx, last_basic_block); | |
38c28a25 AH |
8069 | |
8070 | FOR_EACH_BB (bb) | |
8071 | frv_optimize_membar_local (bb, &first_io[bb->index], | |
8072 | &last_membar[bb->index]); | |
8073 | ||
8074 | FOR_EACH_BB (bb) | |
8075 | if (last_membar[bb->index] != 0) | |
8076 | frv_optimize_membar_global (bb, first_io, last_membar[bb->index]); | |
8077 | ||
8078 | free (first_io); | |
8079 | free (last_membar); | |
8080 | } | |
8081 | \f | |
c557edf4 RS |
8082 | /* Used by frv_reorg to keep track of the current packet's address. */ |
8083 | static unsigned int frv_packet_address; | |
36a05131 | 8084 | |
c557edf4 RS |
8085 | /* If the current packet falls through to a label, try to pad the packet |
8086 | with nops in order to fit the label's alignment requirements. */ | |
8087 | ||
8088 | static void | |
8089 | frv_align_label (void) | |
8090 | { | |
8091 | unsigned int alignment, target, nop; | |
8092 | rtx x, last, barrier, label; | |
8093 | ||
8094 | /* Walk forward to the start of the next packet. Set ALIGNMENT to the | |
8095 | maximum alignment of that packet, LABEL to the last label between | |
8096 | the packets, and BARRIER to the last barrier. */ | |
8097 | last = frv_packet.insns[frv_packet.num_insns - 1]; | |
8098 | label = barrier = 0; | |
8099 | alignment = 4; | |
8100 | for (x = NEXT_INSN (last); x != 0 && !INSN_P (x); x = NEXT_INSN (x)) | |
8101 | { | |
8102 | if (LABEL_P (x)) | |
36a05131 | 8103 | { |
c557edf4 RS |
8104 | unsigned int subalign = 1 << label_to_alignment (x); |
8105 | alignment = MAX (alignment, subalign); | |
8106 | label = x; | |
36a05131 | 8107 | } |
c557edf4 RS |
8108 | if (BARRIER_P (x)) |
8109 | barrier = x; | |
8110 | } | |
36a05131 | 8111 | |
c557edf4 RS |
8112 | /* If -malign-labels, and the packet falls through to an unaligned |
8113 | label, try introducing a nop to align that label to 8 bytes. */ | |
8114 | if (TARGET_ALIGN_LABELS | |
8115 | && label != 0 | |
8116 | && barrier == 0 | |
8117 | && frv_packet.num_insns < frv_packet.issue_rate) | |
8118 | alignment = MAX (alignment, 8); | |
36a05131 | 8119 | |
c557edf4 RS |
8120 | /* Advance the address to the end of the current packet. */ |
8121 | frv_packet_address += frv_packet.num_insns * 4; | |
36a05131 | 8122 | |
c557edf4 RS |
8123 | /* Work out the target address, after alignment. */ |
8124 | target = (frv_packet_address + alignment - 1) & -alignment; | |
8125 | ||
8126 | /* If the packet falls through to the label, try to find an efficient | |
8127 | padding sequence. */ | |
8128 | if (barrier == 0) | |
8129 | { | |
8130 | /* First try adding nops to the current packet. */ | |
8131 | for (nop = 0; nop < frv_num_nops; nop++) | |
8132 | while (frv_packet_address < target && frv_pack_insn_p (frv_nops[nop])) | |
8133 | { | |
8134 | frv_insert_nop_in_packet (frv_nops[nop]); | |
8135 | frv_packet_address += 4; | |
8136 | } | |
8137 | ||
8138 | /* If we still haven't reached the target, add some new packets that | |
8139 | contain only nops. If there are two types of nop, insert an | |
8140 | alternating sequence of frv_nops[0] and frv_nops[1], which will | |
8141 | lead to packets like: | |
8142 | ||
8143 | nop.p | |
8144 | mnop.p/fnop.p | |
8145 | nop.p | |
8146 | mnop/fnop | |
8147 | ||
8148 | etc. Just emit frv_nops[0] if that's the only nop we have. */ | |
8149 | last = frv_packet.insns[frv_packet.num_insns - 1]; | |
8150 | nop = 0; | |
8151 | while (frv_packet_address < target) | |
8152 | { | |
8153 | last = emit_insn_after (PATTERN (frv_nops[nop]), last); | |
8154 | frv_packet_address += 4; | |
8155 | if (frv_num_nops > 1) | |
8156 | nop ^= 1; | |
36a05131 BS |
8157 | } |
8158 | } | |
8159 | ||
c557edf4 | 8160 | frv_packet_address = target; |
36a05131 BS |
8161 | } |
8162 | ||
c557edf4 RS |
8163 | /* Subroutine of frv_reorg, called after each packet has been constructed |
8164 | in frv_packet. */ | |
8165 | ||
8166 | static void | |
8167 | frv_reorg_packet (void) | |
8168 | { | |
8169 | frv_fill_unused_units (GROUP_I); | |
8170 | frv_fill_unused_units (GROUP_FM); | |
8171 | frv_align_label (); | |
8172 | } | |
8173 | ||
8174 | /* Add an instruction with pattern NOP to frv_nops[]. */ | |
8175 | ||
8176 | static void | |
8177 | frv_register_nop (rtx nop) | |
8178 | { | |
8179 | nop = make_insn_raw (nop); | |
8180 | NEXT_INSN (nop) = 0; | |
8181 | PREV_INSN (nop) = 0; | |
8182 | frv_nops[frv_num_nops++] = nop; | |
8183 | } | |
8184 | ||
8185 | /* Implement TARGET_MACHINE_DEPENDENT_REORG. Divide the instructions | |
8186 | into packets and check whether we need to insert nops in order to | |
8187 | fulfill the processor's issue requirements. Also, if the user has | |
8188 | requested a certain alignment for a label, try to meet that alignment | |
8189 | by inserting nops in the previous packet. */ | |
8190 | ||
8191 | static void | |
8192 | frv_reorg (void) | |
8193 | { | |
38c28a25 AH |
8194 | if (optimize > 0 && TARGET_OPTIMIZE_MEMBAR && cfun->machine->has_membar_p) |
8195 | frv_optimize_membar (); | |
8196 | ||
c557edf4 RS |
8197 | frv_num_nops = 0; |
8198 | frv_register_nop (gen_nop ()); | |
8199 | if (TARGET_MEDIA) | |
8200 | frv_register_nop (gen_mnop ()); | |
8201 | if (TARGET_HARD_FLOAT) | |
8202 | frv_register_nop (gen_fnop ()); | |
8203 | ||
8204 | /* Estimate the length of each branch. Although this may change after | |
8205 | we've inserted nops, it will only do so in big functions. */ | |
8206 | shorten_branches (get_insns ()); | |
8207 | ||
8208 | frv_packet_address = 0; | |
8209 | frv_for_each_packet (frv_reorg_packet); | |
8210 | } | |
36a05131 BS |
8211 | \f |
8212 | #define def_builtin(name, type, code) \ | |
c79efc4d | 8213 | add_builtin_function ((name), (type), (code), BUILT_IN_MD, NULL, NULL) |
36a05131 BS |
8214 | |
8215 | struct builtin_description | |
8216 | { | |
8217 | enum insn_code icode; | |
8218 | const char *name; | |
8219 | enum frv_builtins code; | |
8220 | enum rtx_code comparison; | |
8221 | unsigned int flag; | |
8222 | }; | |
8223 | ||
8224 | /* Media intrinsics that take a single, constant argument. */ | |
8225 | ||
8226 | static struct builtin_description bdesc_set[] = | |
8227 | { | |
5c5e8419 | 8228 | { CODE_FOR_mhdsets, "__MHDSETS", FRV_BUILTIN_MHDSETS, UNKNOWN, 0 } |
36a05131 BS |
8229 | }; |
8230 | ||
87b483a1 | 8231 | /* Media intrinsics that take just one argument. */ |
36a05131 BS |
8232 | |
8233 | static struct builtin_description bdesc_1arg[] = | |
8234 | { | |
5c5e8419 JR |
8235 | { CODE_FOR_mnot, "__MNOT", FRV_BUILTIN_MNOT, UNKNOWN, 0 }, |
8236 | { CODE_FOR_munpackh, "__MUNPACKH", FRV_BUILTIN_MUNPACKH, UNKNOWN, 0 }, | |
8237 | { CODE_FOR_mbtoh, "__MBTOH", FRV_BUILTIN_MBTOH, UNKNOWN, 0 }, | |
8238 | { CODE_FOR_mhtob, "__MHTOB", FRV_BUILTIN_MHTOB, UNKNOWN, 0}, | |
8239 | { CODE_FOR_mabshs, "__MABSHS", FRV_BUILTIN_MABSHS, UNKNOWN, 0 }, | |
8240 | { CODE_FOR_scutss, "__SCUTSS", FRV_BUILTIN_SCUTSS, UNKNOWN, 0 } | |
36a05131 BS |
8241 | }; |
8242 | ||
87b483a1 | 8243 | /* Media intrinsics that take two arguments. */ |
36a05131 BS |
8244 | |
8245 | static struct builtin_description bdesc_2arg[] = | |
8246 | { | |
5c5e8419 JR |
8247 | { CODE_FOR_mand, "__MAND", FRV_BUILTIN_MAND, UNKNOWN, 0}, |
8248 | { CODE_FOR_mor, "__MOR", FRV_BUILTIN_MOR, UNKNOWN, 0}, | |
8249 | { CODE_FOR_mxor, "__MXOR", FRV_BUILTIN_MXOR, UNKNOWN, 0}, | |
8250 | { CODE_FOR_maveh, "__MAVEH", FRV_BUILTIN_MAVEH, UNKNOWN, 0}, | |
8251 | { CODE_FOR_msaths, "__MSATHS", FRV_BUILTIN_MSATHS, UNKNOWN, 0}, | |
8252 | { CODE_FOR_msathu, "__MSATHU", FRV_BUILTIN_MSATHU, UNKNOWN, 0}, | |
8253 | { CODE_FOR_maddhss, "__MADDHSS", FRV_BUILTIN_MADDHSS, UNKNOWN, 0}, | |
8254 | { CODE_FOR_maddhus, "__MADDHUS", FRV_BUILTIN_MADDHUS, UNKNOWN, 0}, | |
8255 | { CODE_FOR_msubhss, "__MSUBHSS", FRV_BUILTIN_MSUBHSS, UNKNOWN, 0}, | |
8256 | { CODE_FOR_msubhus, "__MSUBHUS", FRV_BUILTIN_MSUBHUS, UNKNOWN, 0}, | |
8257 | { CODE_FOR_mqaddhss, "__MQADDHSS", FRV_BUILTIN_MQADDHSS, UNKNOWN, 0}, | |
8258 | { CODE_FOR_mqaddhus, "__MQADDHUS", FRV_BUILTIN_MQADDHUS, UNKNOWN, 0}, | |
8259 | { CODE_FOR_mqsubhss, "__MQSUBHSS", FRV_BUILTIN_MQSUBHSS, UNKNOWN, 0}, | |
8260 | { CODE_FOR_mqsubhus, "__MQSUBHUS", FRV_BUILTIN_MQSUBHUS, UNKNOWN, 0}, | |
8261 | { CODE_FOR_mpackh, "__MPACKH", FRV_BUILTIN_MPACKH, UNKNOWN, 0}, | |
8262 | { CODE_FOR_mcop1, "__Mcop1", FRV_BUILTIN_MCOP1, UNKNOWN, 0}, | |
8263 | { CODE_FOR_mcop2, "__Mcop2", FRV_BUILTIN_MCOP2, UNKNOWN, 0}, | |
8264 | { CODE_FOR_mwcut, "__MWCUT", FRV_BUILTIN_MWCUT, UNKNOWN, 0}, | |
8265 | { CODE_FOR_mqsaths, "__MQSATHS", FRV_BUILTIN_MQSATHS, UNKNOWN, 0}, | |
8266 | { CODE_FOR_mqlclrhs, "__MQLCLRHS", FRV_BUILTIN_MQLCLRHS, UNKNOWN, 0}, | |
8267 | { CODE_FOR_mqlmths, "__MQLMTHS", FRV_BUILTIN_MQLMTHS, UNKNOWN, 0}, | |
8268 | { CODE_FOR_smul, "__SMUL", FRV_BUILTIN_SMUL, UNKNOWN, 0}, | |
8269 | { CODE_FOR_umul, "__UMUL", FRV_BUILTIN_UMUL, UNKNOWN, 0}, | |
8270 | { CODE_FOR_addss, "__ADDSS", FRV_BUILTIN_ADDSS, UNKNOWN, 0}, | |
8271 | { CODE_FOR_subss, "__SUBSS", FRV_BUILTIN_SUBSS, UNKNOWN, 0}, | |
8272 | { CODE_FOR_slass, "__SLASS", FRV_BUILTIN_SLASS, UNKNOWN, 0}, | |
8273 | { CODE_FOR_scan, "__SCAN", FRV_BUILTIN_SCAN, UNKNOWN, 0} | |
c557edf4 RS |
8274 | }; |
8275 | ||
8276 | /* Integer intrinsics that take two arguments and have no return value. */ | |
8277 | ||
8278 | static struct builtin_description bdesc_int_void2arg[] = | |
8279 | { | |
5c5e8419 JR |
8280 | { CODE_FOR_smass, "__SMASS", FRV_BUILTIN_SMASS, UNKNOWN, 0}, |
8281 | { CODE_FOR_smsss, "__SMSSS", FRV_BUILTIN_SMSSS, UNKNOWN, 0}, | |
8282 | { CODE_FOR_smu, "__SMU", FRV_BUILTIN_SMU, UNKNOWN, 0} | |
c557edf4 RS |
8283 | }; |
8284 | ||
8285 | static struct builtin_description bdesc_prefetches[] = | |
8286 | { | |
5c5e8419 JR |
8287 | { CODE_FOR_frv_prefetch0, "__data_prefetch0", FRV_BUILTIN_PREFETCH0, UNKNOWN, |
8288 | 0}, | |
8289 | { CODE_FOR_frv_prefetch, "__data_prefetch", FRV_BUILTIN_PREFETCH, UNKNOWN, 0} | |
36a05131 BS |
8290 | }; |
8291 | ||
8292 | /* Media intrinsics that take two arguments, the first being an ACC number. */ | |
8293 | ||
8294 | static struct builtin_description bdesc_cut[] = | |
8295 | { | |
5c5e8419 JR |
8296 | { CODE_FOR_mcut, "__MCUT", FRV_BUILTIN_MCUT, UNKNOWN, 0}, |
8297 | { CODE_FOR_mcutss, "__MCUTSS", FRV_BUILTIN_MCUTSS, UNKNOWN, 0}, | |
8298 | { CODE_FOR_mdcutssi, "__MDCUTSSI", FRV_BUILTIN_MDCUTSSI, UNKNOWN, 0} | |
36a05131 BS |
8299 | }; |
8300 | ||
87b483a1 | 8301 | /* Two-argument media intrinsics with an immediate second argument. */ |
36a05131 BS |
8302 | |
8303 | static struct builtin_description bdesc_2argimm[] = | |
8304 | { | |
5c5e8419 JR |
8305 | { CODE_FOR_mrotli, "__MROTLI", FRV_BUILTIN_MROTLI, UNKNOWN, 0}, |
8306 | { CODE_FOR_mrotri, "__MROTRI", FRV_BUILTIN_MROTRI, UNKNOWN, 0}, | |
8307 | { CODE_FOR_msllhi, "__MSLLHI", FRV_BUILTIN_MSLLHI, UNKNOWN, 0}, | |
8308 | { CODE_FOR_msrlhi, "__MSRLHI", FRV_BUILTIN_MSRLHI, UNKNOWN, 0}, | |
8309 | { CODE_FOR_msrahi, "__MSRAHI", FRV_BUILTIN_MSRAHI, UNKNOWN, 0}, | |
8310 | { CODE_FOR_mexpdhw, "__MEXPDHW", FRV_BUILTIN_MEXPDHW, UNKNOWN, 0}, | |
8311 | { CODE_FOR_mexpdhd, "__MEXPDHD", FRV_BUILTIN_MEXPDHD, UNKNOWN, 0}, | |
8312 | { CODE_FOR_mdrotli, "__MDROTLI", FRV_BUILTIN_MDROTLI, UNKNOWN, 0}, | |
8313 | { CODE_FOR_mcplhi, "__MCPLHI", FRV_BUILTIN_MCPLHI, UNKNOWN, 0}, | |
8314 | { CODE_FOR_mcpli, "__MCPLI", FRV_BUILTIN_MCPLI, UNKNOWN, 0}, | |
8315 | { CODE_FOR_mhsetlos, "__MHSETLOS", FRV_BUILTIN_MHSETLOS, UNKNOWN, 0}, | |
8316 | { CODE_FOR_mhsetloh, "__MHSETLOH", FRV_BUILTIN_MHSETLOH, UNKNOWN, 0}, | |
8317 | { CODE_FOR_mhsethis, "__MHSETHIS", FRV_BUILTIN_MHSETHIS, UNKNOWN, 0}, | |
8318 | { CODE_FOR_mhsethih, "__MHSETHIH", FRV_BUILTIN_MHSETHIH, UNKNOWN, 0}, | |
8319 | { CODE_FOR_mhdseth, "__MHDSETH", FRV_BUILTIN_MHDSETH, UNKNOWN, 0}, | |
8320 | { CODE_FOR_mqsllhi, "__MQSLLHI", FRV_BUILTIN_MQSLLHI, UNKNOWN, 0}, | |
8321 | { CODE_FOR_mqsrahi, "__MQSRAHI", FRV_BUILTIN_MQSRAHI, UNKNOWN, 0} | |
36a05131 BS |
8322 | }; |
8323 | ||
8324 | /* Media intrinsics that take two arguments and return void, the first argument | |
87b483a1 | 8325 | being a pointer to 4 words in memory. */ |
36a05131 BS |
8326 | |
8327 | static struct builtin_description bdesc_void2arg[] = | |
8328 | { | |
5c5e8419 JR |
8329 | { CODE_FOR_mdunpackh, "__MDUNPACKH", FRV_BUILTIN_MDUNPACKH, UNKNOWN, 0}, |
8330 | { CODE_FOR_mbtohe, "__MBTOHE", FRV_BUILTIN_MBTOHE, UNKNOWN, 0}, | |
36a05131 BS |
8331 | }; |
8332 | ||
8333 | /* Media intrinsics that take three arguments, the first being a const_int that | |
87b483a1 | 8334 | denotes an accumulator, and that return void. */ |
36a05131 BS |
8335 | |
8336 | static struct builtin_description bdesc_void3arg[] = | |
8337 | { | |
5c5e8419 JR |
8338 | { CODE_FOR_mcpxrs, "__MCPXRS", FRV_BUILTIN_MCPXRS, UNKNOWN, 0}, |
8339 | { CODE_FOR_mcpxru, "__MCPXRU", FRV_BUILTIN_MCPXRU, UNKNOWN, 0}, | |
8340 | { CODE_FOR_mcpxis, "__MCPXIS", FRV_BUILTIN_MCPXIS, UNKNOWN, 0}, | |
8341 | { CODE_FOR_mcpxiu, "__MCPXIU", FRV_BUILTIN_MCPXIU, UNKNOWN, 0}, | |
8342 | { CODE_FOR_mmulhs, "__MMULHS", FRV_BUILTIN_MMULHS, UNKNOWN, 0}, | |
8343 | { CODE_FOR_mmulhu, "__MMULHU", FRV_BUILTIN_MMULHU, UNKNOWN, 0}, | |
8344 | { CODE_FOR_mmulxhs, "__MMULXHS", FRV_BUILTIN_MMULXHS, UNKNOWN, 0}, | |
8345 | { CODE_FOR_mmulxhu, "__MMULXHU", FRV_BUILTIN_MMULXHU, UNKNOWN, 0}, | |
8346 | { CODE_FOR_mmachs, "__MMACHS", FRV_BUILTIN_MMACHS, UNKNOWN, 0}, | |
8347 | { CODE_FOR_mmachu, "__MMACHU", FRV_BUILTIN_MMACHU, UNKNOWN, 0}, | |
8348 | { CODE_FOR_mmrdhs, "__MMRDHS", FRV_BUILTIN_MMRDHS, UNKNOWN, 0}, | |
8349 | { CODE_FOR_mmrdhu, "__MMRDHU", FRV_BUILTIN_MMRDHU, UNKNOWN, 0}, | |
8350 | { CODE_FOR_mqcpxrs, "__MQCPXRS", FRV_BUILTIN_MQCPXRS, UNKNOWN, 0}, | |
8351 | { CODE_FOR_mqcpxru, "__MQCPXRU", FRV_BUILTIN_MQCPXRU, UNKNOWN, 0}, | |
8352 | { CODE_FOR_mqcpxis, "__MQCPXIS", FRV_BUILTIN_MQCPXIS, UNKNOWN, 0}, | |
8353 | { CODE_FOR_mqcpxiu, "__MQCPXIU", FRV_BUILTIN_MQCPXIU, UNKNOWN, 0}, | |
8354 | { CODE_FOR_mqmulhs, "__MQMULHS", FRV_BUILTIN_MQMULHS, UNKNOWN, 0}, | |
8355 | { CODE_FOR_mqmulhu, "__MQMULHU", FRV_BUILTIN_MQMULHU, UNKNOWN, 0}, | |
8356 | { CODE_FOR_mqmulxhs, "__MQMULXHS", FRV_BUILTIN_MQMULXHS, UNKNOWN, 0}, | |
8357 | { CODE_FOR_mqmulxhu, "__MQMULXHU", FRV_BUILTIN_MQMULXHU, UNKNOWN, 0}, | |
8358 | { CODE_FOR_mqmachs, "__MQMACHS", FRV_BUILTIN_MQMACHS, UNKNOWN, 0}, | |
8359 | { CODE_FOR_mqmachu, "__MQMACHU", FRV_BUILTIN_MQMACHU, UNKNOWN, 0}, | |
8360 | { CODE_FOR_mqxmachs, "__MQXMACHS", FRV_BUILTIN_MQXMACHS, UNKNOWN, 0}, | |
8361 | { CODE_FOR_mqxmacxhs, "__MQXMACXHS", FRV_BUILTIN_MQXMACXHS, UNKNOWN, 0}, | |
8362 | { CODE_FOR_mqmacxhs, "__MQMACXHS", FRV_BUILTIN_MQMACXHS, UNKNOWN, 0} | |
36a05131 BS |
8363 | }; |
8364 | ||
8365 | /* Media intrinsics that take two accumulator numbers as argument and | |
8366 | return void. */ | |
8367 | ||
8368 | static struct builtin_description bdesc_voidacc[] = | |
8369 | { | |
5c5e8419 JR |
8370 | { CODE_FOR_maddaccs, "__MADDACCS", FRV_BUILTIN_MADDACCS, UNKNOWN, 0}, |
8371 | { CODE_FOR_msubaccs, "__MSUBACCS", FRV_BUILTIN_MSUBACCS, UNKNOWN, 0}, | |
8372 | { CODE_FOR_masaccs, "__MASACCS", FRV_BUILTIN_MASACCS, UNKNOWN, 0}, | |
8373 | { CODE_FOR_mdaddaccs, "__MDADDACCS", FRV_BUILTIN_MDADDACCS, UNKNOWN, 0}, | |
8374 | { CODE_FOR_mdsubaccs, "__MDSUBACCS", FRV_BUILTIN_MDSUBACCS, UNKNOWN, 0}, | |
8375 | { CODE_FOR_mdasaccs, "__MDASACCS", FRV_BUILTIN_MDASACCS, UNKNOWN, 0} | |
36a05131 BS |
8376 | }; |
8377 | ||
38c28a25 AH |
8378 | /* Intrinsics that load a value and then issue a MEMBAR. The load is |
8379 | a normal move and the ICODE is for the membar. */ | |
c14ff86e AH |
8380 | |
8381 | static struct builtin_description bdesc_loads[] = | |
8382 | { | |
38c28a25 | 8383 | { CODE_FOR_optional_membar_qi, "__builtin_read8", |
5c5e8419 | 8384 | FRV_BUILTIN_READ8, UNKNOWN, 0}, |
38c28a25 | 8385 | { CODE_FOR_optional_membar_hi, "__builtin_read16", |
5c5e8419 | 8386 | FRV_BUILTIN_READ16, UNKNOWN, 0}, |
38c28a25 | 8387 | { CODE_FOR_optional_membar_si, "__builtin_read32", |
5c5e8419 | 8388 | FRV_BUILTIN_READ32, UNKNOWN, 0}, |
38c28a25 | 8389 | { CODE_FOR_optional_membar_di, "__builtin_read64", |
5c5e8419 | 8390 | FRV_BUILTIN_READ64, UNKNOWN, 0} |
c14ff86e AH |
8391 | }; |
8392 | ||
8393 | /* Likewise stores. */ | |
8394 | ||
8395 | static struct builtin_description bdesc_stores[] = | |
8396 | { | |
38c28a25 | 8397 | { CODE_FOR_optional_membar_qi, "__builtin_write8", |
5c5e8419 | 8398 | FRV_BUILTIN_WRITE8, UNKNOWN, 0}, |
38c28a25 | 8399 | { CODE_FOR_optional_membar_hi, "__builtin_write16", |
5c5e8419 | 8400 | FRV_BUILTIN_WRITE16, UNKNOWN, 0}, |
38c28a25 | 8401 | { CODE_FOR_optional_membar_si, "__builtin_write32", |
5c5e8419 | 8402 | FRV_BUILTIN_WRITE32, UNKNOWN, 0}, |
38c28a25 | 8403 | { CODE_FOR_optional_membar_di, "__builtin_write64", |
5c5e8419 | 8404 | FRV_BUILTIN_WRITE64, UNKNOWN, 0}, |
c14ff86e AH |
8405 | }; |
8406 | ||
87b483a1 | 8407 | /* Initialize media builtins. */ |
36a05131 | 8408 | |
14966b94 | 8409 | static void |
f2206911 | 8410 | frv_init_builtins (void) |
36a05131 | 8411 | { |
36a05131 BS |
8412 | tree accumulator = integer_type_node; |
8413 | tree integer = integer_type_node; | |
8414 | tree voidt = void_type_node; | |
8415 | tree uhalf = short_unsigned_type_node; | |
8416 | tree sword1 = long_integer_type_node; | |
8417 | tree uword1 = long_unsigned_type_node; | |
8418 | tree sword2 = long_long_integer_type_node; | |
8419 | tree uword2 = long_long_unsigned_type_node; | |
8420 | tree uword4 = build_pointer_type (uword1); | |
c14ff86e AH |
8421 | tree vptr = build_pointer_type (build_type_variant (void_type_node, 0, 1)); |
8422 | tree ubyte = unsigned_char_type_node; | |
c557edf4 | 8423 | tree iacc = integer_type_node; |
36a05131 BS |
8424 | |
8425 | #define UNARY(RET, T1) \ | |
e84a6fcf | 8426 | build_function_type_list (RET, T1, NULL_TREE) |
36a05131 BS |
8427 | |
8428 | #define BINARY(RET, T1, T2) \ | |
e84a6fcf | 8429 | build_function_type_list (RET, T1, T2, NULL_TREE) |
36a05131 BS |
8430 | |
8431 | #define TRINARY(RET, T1, T2, T3) \ | |
e84a6fcf | 8432 | build_function_type_list (RET, T1, T2, T3, NULL_TREE) |
36a05131 | 8433 | |
a738d848 | 8434 | #define QUAD(RET, T1, T2, T3, T4) \ |
4adf72f1 | 8435 | build_function_type_list (RET, T1, T2, T3, T4, NULL_TREE) |
a738d848 | 8436 | |
e84a6fcf | 8437 | tree void_ftype_void = build_function_type_list (voidt, NULL_TREE); |
36a05131 BS |
8438 | |
8439 | tree void_ftype_acc = UNARY (voidt, accumulator); | |
8440 | tree void_ftype_uw4_uw1 = BINARY (voidt, uword4, uword1); | |
8441 | tree void_ftype_uw4_uw2 = BINARY (voidt, uword4, uword2); | |
8442 | tree void_ftype_acc_uw1 = BINARY (voidt, accumulator, uword1); | |
8443 | tree void_ftype_acc_acc = BINARY (voidt, accumulator, accumulator); | |
8444 | tree void_ftype_acc_uw1_uw1 = TRINARY (voidt, accumulator, uword1, uword1); | |
8445 | tree void_ftype_acc_sw1_sw1 = TRINARY (voidt, accumulator, sword1, sword1); | |
8446 | tree void_ftype_acc_uw2_uw2 = TRINARY (voidt, accumulator, uword2, uword2); | |
8447 | tree void_ftype_acc_sw2_sw2 = TRINARY (voidt, accumulator, sword2, sword2); | |
8448 | ||
8449 | tree uw1_ftype_uw1 = UNARY (uword1, uword1); | |
8450 | tree uw1_ftype_sw1 = UNARY (uword1, sword1); | |
8451 | tree uw1_ftype_uw2 = UNARY (uword1, uword2); | |
8452 | tree uw1_ftype_acc = UNARY (uword1, accumulator); | |
8453 | tree uw1_ftype_uh_uh = BINARY (uword1, uhalf, uhalf); | |
8454 | tree uw1_ftype_uw1_uw1 = BINARY (uword1, uword1, uword1); | |
8455 | tree uw1_ftype_uw1_int = BINARY (uword1, uword1, integer); | |
8456 | tree uw1_ftype_acc_uw1 = BINARY (uword1, accumulator, uword1); | |
8457 | tree uw1_ftype_acc_sw1 = BINARY (uword1, accumulator, sword1); | |
8458 | tree uw1_ftype_uw2_uw1 = BINARY (uword1, uword2, uword1); | |
8459 | tree uw1_ftype_uw2_int = BINARY (uword1, uword2, integer); | |
8460 | ||
8461 | tree sw1_ftype_int = UNARY (sword1, integer); | |
8462 | tree sw1_ftype_sw1_sw1 = BINARY (sword1, sword1, sword1); | |
8463 | tree sw1_ftype_sw1_int = BINARY (sword1, sword1, integer); | |
8464 | ||
8465 | tree uw2_ftype_uw1 = UNARY (uword2, uword1); | |
8466 | tree uw2_ftype_uw1_int = BINARY (uword2, uword1, integer); | |
8467 | tree uw2_ftype_uw2_uw2 = BINARY (uword2, uword2, uword2); | |
8468 | tree uw2_ftype_uw2_int = BINARY (uword2, uword2, integer); | |
8469 | tree uw2_ftype_acc_int = BINARY (uword2, accumulator, integer); | |
a738d848 | 8470 | tree uw2_ftype_uh_uh_uh_uh = QUAD (uword2, uhalf, uhalf, uhalf, uhalf); |
36a05131 BS |
8471 | |
8472 | tree sw2_ftype_sw2_sw2 = BINARY (sword2, sword2, sword2); | |
c557edf4 RS |
8473 | tree sw2_ftype_sw2_int = BINARY (sword2, sword2, integer); |
8474 | tree uw2_ftype_uw1_uw1 = BINARY (uword2, uword1, uword1); | |
8475 | tree sw2_ftype_sw1_sw1 = BINARY (sword2, sword1, sword1); | |
8476 | tree void_ftype_sw1_sw1 = BINARY (voidt, sword1, sword1); | |
8477 | tree void_ftype_iacc_sw2 = BINARY (voidt, iacc, sword2); | |
8478 | tree void_ftype_iacc_sw1 = BINARY (voidt, iacc, sword1); | |
8479 | tree sw1_ftype_sw1 = UNARY (sword1, sword1); | |
8480 | tree sw2_ftype_iacc = UNARY (sword2, iacc); | |
8481 | tree sw1_ftype_iacc = UNARY (sword1, iacc); | |
8482 | tree void_ftype_ptr = UNARY (voidt, const_ptr_type_node); | |
c14ff86e AH |
8483 | tree uw1_ftype_vptr = UNARY (uword1, vptr); |
8484 | tree uw2_ftype_vptr = UNARY (uword2, vptr); | |
8485 | tree void_ftype_vptr_ub = BINARY (voidt, vptr, ubyte); | |
8486 | tree void_ftype_vptr_uh = BINARY (voidt, vptr, uhalf); | |
8487 | tree void_ftype_vptr_uw1 = BINARY (voidt, vptr, uword1); | |
8488 | tree void_ftype_vptr_uw2 = BINARY (voidt, vptr, uword2); | |
36a05131 BS |
8489 | |
8490 | def_builtin ("__MAND", uw1_ftype_uw1_uw1, FRV_BUILTIN_MAND); | |
8491 | def_builtin ("__MOR", uw1_ftype_uw1_uw1, FRV_BUILTIN_MOR); | |
8492 | def_builtin ("__MXOR", uw1_ftype_uw1_uw1, FRV_BUILTIN_MXOR); | |
8493 | def_builtin ("__MNOT", uw1_ftype_uw1, FRV_BUILTIN_MNOT); | |
8494 | def_builtin ("__MROTLI", uw1_ftype_uw1_int, FRV_BUILTIN_MROTLI); | |
8495 | def_builtin ("__MROTRI", uw1_ftype_uw1_int, FRV_BUILTIN_MROTRI); | |
8496 | def_builtin ("__MWCUT", uw1_ftype_uw2_uw1, FRV_BUILTIN_MWCUT); | |
8497 | def_builtin ("__MAVEH", uw1_ftype_uw1_uw1, FRV_BUILTIN_MAVEH); | |
8498 | def_builtin ("__MSLLHI", uw1_ftype_uw1_int, FRV_BUILTIN_MSLLHI); | |
8499 | def_builtin ("__MSRLHI", uw1_ftype_uw1_int, FRV_BUILTIN_MSRLHI); | |
8500 | def_builtin ("__MSRAHI", sw1_ftype_sw1_int, FRV_BUILTIN_MSRAHI); | |
8501 | def_builtin ("__MSATHS", sw1_ftype_sw1_sw1, FRV_BUILTIN_MSATHS); | |
8502 | def_builtin ("__MSATHU", uw1_ftype_uw1_uw1, FRV_BUILTIN_MSATHU); | |
8503 | def_builtin ("__MADDHSS", sw1_ftype_sw1_sw1, FRV_BUILTIN_MADDHSS); | |
8504 | def_builtin ("__MADDHUS", uw1_ftype_uw1_uw1, FRV_BUILTIN_MADDHUS); | |
8505 | def_builtin ("__MSUBHSS", sw1_ftype_sw1_sw1, FRV_BUILTIN_MSUBHSS); | |
8506 | def_builtin ("__MSUBHUS", uw1_ftype_uw1_uw1, FRV_BUILTIN_MSUBHUS); | |
8507 | def_builtin ("__MMULHS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MMULHS); | |
8508 | def_builtin ("__MMULHU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MMULHU); | |
8509 | def_builtin ("__MMULXHS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MMULXHS); | |
8510 | def_builtin ("__MMULXHU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MMULXHU); | |
8511 | def_builtin ("__MMACHS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MMACHS); | |
8512 | def_builtin ("__MMACHU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MMACHU); | |
8513 | def_builtin ("__MMRDHS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MMRDHS); | |
8514 | def_builtin ("__MMRDHU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MMRDHU); | |
8515 | def_builtin ("__MQADDHSS", sw2_ftype_sw2_sw2, FRV_BUILTIN_MQADDHSS); | |
8516 | def_builtin ("__MQADDHUS", uw2_ftype_uw2_uw2, FRV_BUILTIN_MQADDHUS); | |
8517 | def_builtin ("__MQSUBHSS", sw2_ftype_sw2_sw2, FRV_BUILTIN_MQSUBHSS); | |
8518 | def_builtin ("__MQSUBHUS", uw2_ftype_uw2_uw2, FRV_BUILTIN_MQSUBHUS); | |
8519 | def_builtin ("__MQMULHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQMULHS); | |
8520 | def_builtin ("__MQMULHU", void_ftype_acc_uw2_uw2, FRV_BUILTIN_MQMULHU); | |
8521 | def_builtin ("__MQMULXHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQMULXHS); | |
8522 | def_builtin ("__MQMULXHU", void_ftype_acc_uw2_uw2, FRV_BUILTIN_MQMULXHU); | |
8523 | def_builtin ("__MQMACHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQMACHS); | |
8524 | def_builtin ("__MQMACHU", void_ftype_acc_uw2_uw2, FRV_BUILTIN_MQMACHU); | |
8525 | def_builtin ("__MCPXRS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MCPXRS); | |
8526 | def_builtin ("__MCPXRU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MCPXRU); | |
8527 | def_builtin ("__MCPXIS", void_ftype_acc_sw1_sw1, FRV_BUILTIN_MCPXIS); | |
8528 | def_builtin ("__MCPXIU", void_ftype_acc_uw1_uw1, FRV_BUILTIN_MCPXIU); | |
8529 | def_builtin ("__MQCPXRS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQCPXRS); | |
8530 | def_builtin ("__MQCPXRU", void_ftype_acc_uw2_uw2, FRV_BUILTIN_MQCPXRU); | |
8531 | def_builtin ("__MQCPXIS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQCPXIS); | |
8532 | def_builtin ("__MQCPXIU", void_ftype_acc_uw2_uw2, FRV_BUILTIN_MQCPXIU); | |
8533 | def_builtin ("__MCUT", uw1_ftype_acc_uw1, FRV_BUILTIN_MCUT); | |
8534 | def_builtin ("__MCUTSS", uw1_ftype_acc_sw1, FRV_BUILTIN_MCUTSS); | |
8535 | def_builtin ("__MEXPDHW", uw1_ftype_uw1_int, FRV_BUILTIN_MEXPDHW); | |
8536 | def_builtin ("__MEXPDHD", uw2_ftype_uw1_int, FRV_BUILTIN_MEXPDHD); | |
8537 | def_builtin ("__MPACKH", uw1_ftype_uh_uh, FRV_BUILTIN_MPACKH); | |
8538 | def_builtin ("__MUNPACKH", uw2_ftype_uw1, FRV_BUILTIN_MUNPACKH); | |
a738d848 | 8539 | def_builtin ("__MDPACKH", uw2_ftype_uh_uh_uh_uh, FRV_BUILTIN_MDPACKH); |
b16c1435 | 8540 | def_builtin ("__MDUNPACKH", void_ftype_uw4_uw2, FRV_BUILTIN_MDUNPACKH); |
36a05131 BS |
8541 | def_builtin ("__MBTOH", uw2_ftype_uw1, FRV_BUILTIN_MBTOH); |
8542 | def_builtin ("__MHTOB", uw1_ftype_uw2, FRV_BUILTIN_MHTOB); | |
8543 | def_builtin ("__MBTOHE", void_ftype_uw4_uw1, FRV_BUILTIN_MBTOHE); | |
8544 | def_builtin ("__MCLRACC", void_ftype_acc, FRV_BUILTIN_MCLRACC); | |
8545 | def_builtin ("__MCLRACCA", void_ftype_void, FRV_BUILTIN_MCLRACCA); | |
8546 | def_builtin ("__MRDACC", uw1_ftype_acc, FRV_BUILTIN_MRDACC); | |
8547 | def_builtin ("__MRDACCG", uw1_ftype_acc, FRV_BUILTIN_MRDACCG); | |
8548 | def_builtin ("__MWTACC", void_ftype_acc_uw1, FRV_BUILTIN_MWTACC); | |
8549 | def_builtin ("__MWTACCG", void_ftype_acc_uw1, FRV_BUILTIN_MWTACCG); | |
8550 | def_builtin ("__Mcop1", uw1_ftype_uw1_uw1, FRV_BUILTIN_MCOP1); | |
8551 | def_builtin ("__Mcop2", uw1_ftype_uw1_uw1, FRV_BUILTIN_MCOP2); | |
8552 | def_builtin ("__MTRAP", void_ftype_void, FRV_BUILTIN_MTRAP); | |
8553 | def_builtin ("__MQXMACHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQXMACHS); | |
8554 | def_builtin ("__MQXMACXHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQXMACXHS); | |
8555 | def_builtin ("__MQMACXHS", void_ftype_acc_sw2_sw2, FRV_BUILTIN_MQMACXHS); | |
8556 | def_builtin ("__MADDACCS", void_ftype_acc_acc, FRV_BUILTIN_MADDACCS); | |
8557 | def_builtin ("__MSUBACCS", void_ftype_acc_acc, FRV_BUILTIN_MSUBACCS); | |
8558 | def_builtin ("__MASACCS", void_ftype_acc_acc, FRV_BUILTIN_MASACCS); | |
8559 | def_builtin ("__MDADDACCS", void_ftype_acc_acc, FRV_BUILTIN_MDADDACCS); | |
8560 | def_builtin ("__MDSUBACCS", void_ftype_acc_acc, FRV_BUILTIN_MDSUBACCS); | |
8561 | def_builtin ("__MDASACCS", void_ftype_acc_acc, FRV_BUILTIN_MDASACCS); | |
8562 | def_builtin ("__MABSHS", uw1_ftype_sw1, FRV_BUILTIN_MABSHS); | |
8563 | def_builtin ("__MDROTLI", uw2_ftype_uw2_int, FRV_BUILTIN_MDROTLI); | |
8564 | def_builtin ("__MCPLHI", uw1_ftype_uw2_int, FRV_BUILTIN_MCPLHI); | |
8565 | def_builtin ("__MCPLI", uw1_ftype_uw2_int, FRV_BUILTIN_MCPLI); | |
8566 | def_builtin ("__MDCUTSSI", uw2_ftype_acc_int, FRV_BUILTIN_MDCUTSSI); | |
8567 | def_builtin ("__MQSATHS", sw2_ftype_sw2_sw2, FRV_BUILTIN_MQSATHS); | |
8568 | def_builtin ("__MHSETLOS", sw1_ftype_sw1_int, FRV_BUILTIN_MHSETLOS); | |
8569 | def_builtin ("__MHSETHIS", sw1_ftype_sw1_int, FRV_BUILTIN_MHSETHIS); | |
8570 | def_builtin ("__MHDSETS", sw1_ftype_int, FRV_BUILTIN_MHDSETS); | |
8571 | def_builtin ("__MHSETLOH", uw1_ftype_uw1_int, FRV_BUILTIN_MHSETLOH); | |
8572 | def_builtin ("__MHSETHIH", uw1_ftype_uw1_int, FRV_BUILTIN_MHSETHIH); | |
8573 | def_builtin ("__MHDSETH", uw1_ftype_uw1_int, FRV_BUILTIN_MHDSETH); | |
c557edf4 RS |
8574 | def_builtin ("__MQLCLRHS", sw2_ftype_sw2_sw2, FRV_BUILTIN_MQLCLRHS); |
8575 | def_builtin ("__MQLMTHS", sw2_ftype_sw2_sw2, FRV_BUILTIN_MQLMTHS); | |
8576 | def_builtin ("__MQSLLHI", uw2_ftype_uw2_int, FRV_BUILTIN_MQSLLHI); | |
8577 | def_builtin ("__MQSRAHI", sw2_ftype_sw2_int, FRV_BUILTIN_MQSRAHI); | |
8578 | def_builtin ("__SMUL", sw2_ftype_sw1_sw1, FRV_BUILTIN_SMUL); | |
8579 | def_builtin ("__UMUL", uw2_ftype_uw1_uw1, FRV_BUILTIN_UMUL); | |
8580 | def_builtin ("__SMASS", void_ftype_sw1_sw1, FRV_BUILTIN_SMASS); | |
8581 | def_builtin ("__SMSSS", void_ftype_sw1_sw1, FRV_BUILTIN_SMSSS); | |
8582 | def_builtin ("__SMU", void_ftype_sw1_sw1, FRV_BUILTIN_SMU); | |
8583 | def_builtin ("__ADDSS", sw1_ftype_sw1_sw1, FRV_BUILTIN_ADDSS); | |
8584 | def_builtin ("__SUBSS", sw1_ftype_sw1_sw1, FRV_BUILTIN_SUBSS); | |
8585 | def_builtin ("__SLASS", sw1_ftype_sw1_sw1, FRV_BUILTIN_SLASS); | |
8586 | def_builtin ("__SCAN", sw1_ftype_sw1_sw1, FRV_BUILTIN_SCAN); | |
8587 | def_builtin ("__SCUTSS", sw1_ftype_sw1, FRV_BUILTIN_SCUTSS); | |
8588 | def_builtin ("__IACCreadll", sw2_ftype_iacc, FRV_BUILTIN_IACCreadll); | |
8589 | def_builtin ("__IACCreadl", sw1_ftype_iacc, FRV_BUILTIN_IACCreadl); | |
8590 | def_builtin ("__IACCsetll", void_ftype_iacc_sw2, FRV_BUILTIN_IACCsetll); | |
8591 | def_builtin ("__IACCsetl", void_ftype_iacc_sw1, FRV_BUILTIN_IACCsetl); | |
8592 | def_builtin ("__data_prefetch0", void_ftype_ptr, FRV_BUILTIN_PREFETCH0); | |
8593 | def_builtin ("__data_prefetch", void_ftype_ptr, FRV_BUILTIN_PREFETCH); | |
c14ff86e AH |
8594 | def_builtin ("__builtin_read8", uw1_ftype_vptr, FRV_BUILTIN_READ8); |
8595 | def_builtin ("__builtin_read16", uw1_ftype_vptr, FRV_BUILTIN_READ16); | |
8596 | def_builtin ("__builtin_read32", uw1_ftype_vptr, FRV_BUILTIN_READ32); | |
8597 | def_builtin ("__builtin_read64", uw2_ftype_vptr, FRV_BUILTIN_READ64); | |
8598 | ||
8599 | def_builtin ("__builtin_write8", void_ftype_vptr_ub, FRV_BUILTIN_WRITE8); | |
8600 | def_builtin ("__builtin_write16", void_ftype_vptr_uh, FRV_BUILTIN_WRITE16); | |
8601 | def_builtin ("__builtin_write32", void_ftype_vptr_uw1, FRV_BUILTIN_WRITE32); | |
8602 | def_builtin ("__builtin_write64", void_ftype_vptr_uw2, FRV_BUILTIN_WRITE64); | |
36a05131 BS |
8603 | |
8604 | #undef UNARY | |
8605 | #undef BINARY | |
8606 | #undef TRINARY | |
a738d848 | 8607 | #undef QUAD |
36a05131 BS |
8608 | } |
8609 | ||
c15c90bb ZW |
8610 | /* Set the names for various arithmetic operations according to the |
8611 | FRV ABI. */ | |
8612 | static void | |
8613 | frv_init_libfuncs (void) | |
8614 | { | |
8615 | set_optab_libfunc (smod_optab, SImode, "__modi"); | |
8616 | set_optab_libfunc (umod_optab, SImode, "__umodi"); | |
8617 | ||
8618 | set_optab_libfunc (add_optab, DImode, "__addll"); | |
8619 | set_optab_libfunc (sub_optab, DImode, "__subll"); | |
8620 | set_optab_libfunc (smul_optab, DImode, "__mulll"); | |
8621 | set_optab_libfunc (sdiv_optab, DImode, "__divll"); | |
8622 | set_optab_libfunc (smod_optab, DImode, "__modll"); | |
8623 | set_optab_libfunc (umod_optab, DImode, "__umodll"); | |
8624 | set_optab_libfunc (and_optab, DImode, "__andll"); | |
8625 | set_optab_libfunc (ior_optab, DImode, "__orll"); | |
8626 | set_optab_libfunc (xor_optab, DImode, "__xorll"); | |
8627 | set_optab_libfunc (one_cmpl_optab, DImode, "__notll"); | |
8628 | ||
8629 | set_optab_libfunc (add_optab, SFmode, "__addf"); | |
8630 | set_optab_libfunc (sub_optab, SFmode, "__subf"); | |
8631 | set_optab_libfunc (smul_optab, SFmode, "__mulf"); | |
8632 | set_optab_libfunc (sdiv_optab, SFmode, "__divf"); | |
8633 | ||
8634 | set_optab_libfunc (add_optab, DFmode, "__addd"); | |
8635 | set_optab_libfunc (sub_optab, DFmode, "__subd"); | |
8636 | set_optab_libfunc (smul_optab, DFmode, "__muld"); | |
8637 | set_optab_libfunc (sdiv_optab, DFmode, "__divd"); | |
8638 | ||
85363ca0 ZW |
8639 | set_conv_libfunc (sext_optab, DFmode, SFmode, "__ftod"); |
8640 | set_conv_libfunc (trunc_optab, SFmode, DFmode, "__dtof"); | |
8641 | ||
8642 | set_conv_libfunc (sfix_optab, SImode, SFmode, "__ftoi"); | |
8643 | set_conv_libfunc (sfix_optab, DImode, SFmode, "__ftoll"); | |
8644 | set_conv_libfunc (sfix_optab, SImode, DFmode, "__dtoi"); | |
8645 | set_conv_libfunc (sfix_optab, DImode, DFmode, "__dtoll"); | |
8646 | ||
8647 | set_conv_libfunc (ufix_optab, SImode, SFmode, "__ftoui"); | |
09c55720 RS |
8648 | set_conv_libfunc (ufix_optab, DImode, SFmode, "__ftoull"); |
8649 | set_conv_libfunc (ufix_optab, SImode, DFmode, "__dtoui"); | |
8650 | set_conv_libfunc (ufix_optab, DImode, DFmode, "__dtoull"); | |
85363ca0 ZW |
8651 | |
8652 | set_conv_libfunc (sfloat_optab, SFmode, SImode, "__itof"); | |
8653 | set_conv_libfunc (sfloat_optab, SFmode, DImode, "__lltof"); | |
8654 | set_conv_libfunc (sfloat_optab, DFmode, SImode, "__itod"); | |
8655 | set_conv_libfunc (sfloat_optab, DFmode, DImode, "__lltod"); | |
c15c90bb ZW |
8656 | } |
8657 | ||
36a05131 BS |
8658 | /* Convert an integer constant to an accumulator register. ICODE is the |
8659 | code of the target instruction, OPNUM is the number of the | |
8660 | accumulator operand and OPVAL is the constant integer. Try both | |
8661 | ACC and ACCG registers; only report an error if neither fit the | |
8662 | instruction. */ | |
8663 | ||
8664 | static rtx | |
f2206911 | 8665 | frv_int_to_acc (enum insn_code icode, int opnum, rtx opval) |
36a05131 BS |
8666 | { |
8667 | rtx reg; | |
c557edf4 RS |
8668 | int i; |
8669 | ||
0fa2e4df | 8670 | /* ACCs and ACCGs are implicit global registers if media intrinsics |
c557edf4 | 8671 | are being used. We set up this lazily to avoid creating lots of |
c112cf2b | 8672 | unnecessary call_insn rtl in non-media code. */ |
c557edf4 RS |
8673 | for (i = 0; i <= ACC_MASK; i++) |
8674 | if ((i & ACC_MASK) == i) | |
8675 | global_regs[i + ACC_FIRST] = global_regs[i + ACCG_FIRST] = 1; | |
36a05131 BS |
8676 | |
8677 | if (GET_CODE (opval) != CONST_INT) | |
8678 | { | |
8679 | error ("accumulator is not a constant integer"); | |
8680 | return NULL_RTX; | |
8681 | } | |
c557edf4 | 8682 | if ((INTVAL (opval) & ~ACC_MASK) != 0) |
36a05131 BS |
8683 | { |
8684 | error ("accumulator number is out of bounds"); | |
8685 | return NULL_RTX; | |
8686 | } | |
8687 | ||
8688 | reg = gen_rtx_REG (insn_data[icode].operand[opnum].mode, | |
8689 | ACC_FIRST + INTVAL (opval)); | |
8690 | if (! (*insn_data[icode].operand[opnum].predicate) (reg, VOIDmode)) | |
6fb5fa3c | 8691 | SET_REGNO (reg, ACCG_FIRST + INTVAL (opval)); |
36a05131 BS |
8692 | |
8693 | if (! (*insn_data[icode].operand[opnum].predicate) (reg, VOIDmode)) | |
8694 | { | |
9e637a26 | 8695 | error ("inappropriate accumulator for %qs", insn_data[icode].name); |
36a05131 BS |
8696 | return NULL_RTX; |
8697 | } | |
8698 | return reg; | |
8699 | } | |
8700 | ||
8701 | /* If an ACC rtx has mode MODE, return the mode that the matching ACCG | |
8702 | should have. */ | |
8703 | ||
8704 | static enum machine_mode | |
f2206911 | 8705 | frv_matching_accg_mode (enum machine_mode mode) |
36a05131 BS |
8706 | { |
8707 | switch (mode) | |
8708 | { | |
8709 | case V4SImode: | |
8710 | return V4QImode; | |
8711 | ||
8712 | case DImode: | |
8713 | return HImode; | |
8714 | ||
8715 | case SImode: | |
8716 | return QImode; | |
8717 | ||
8718 | default: | |
44e91694 | 8719 | gcc_unreachable (); |
36a05131 BS |
8720 | } |
8721 | } | |
8722 | ||
38c28a25 AH |
8723 | /* Given that a __builtin_read or __builtin_write function is accessing |
8724 | address ADDRESS, return the value that should be used as operand 1 | |
8725 | of the membar. */ | |
8726 | ||
8727 | static rtx | |
8728 | frv_io_address_cookie (rtx address) | |
8729 | { | |
8730 | return (GET_CODE (address) == CONST_INT | |
8731 | ? GEN_INT (INTVAL (address) / 8 * 8) | |
8732 | : const0_rtx); | |
8733 | } | |
8734 | ||
36a05131 BS |
8735 | /* Return the accumulator guard that should be paired with accumulator |
8736 | register ACC. The mode of the returned register is in the same | |
8737 | class as ACC, but is four times smaller. */ | |
8738 | ||
8739 | rtx | |
f2206911 | 8740 | frv_matching_accg_for_acc (rtx acc) |
36a05131 BS |
8741 | { |
8742 | return gen_rtx_REG (frv_matching_accg_mode (GET_MODE (acc)), | |
8743 | REGNO (acc) - ACC_FIRST + ACCG_FIRST); | |
8744 | } | |
8745 | ||
2396bce1 EC |
8746 | /* Read the requested argument from the call EXP given by INDEX. |
8747 | Return the value as an rtx. */ | |
36a05131 BS |
8748 | |
8749 | static rtx | |
2396bce1 | 8750 | frv_read_argument (tree exp, unsigned int index) |
36a05131 | 8751 | { |
5c5e8419 | 8752 | return expand_normal (CALL_EXPR_ARG (exp, index)); |
36a05131 BS |
8753 | } |
8754 | ||
c557edf4 RS |
8755 | /* Like frv_read_argument, but interpret the argument as the number |
8756 | of an IACC register and return a (reg:MODE ...) rtx for it. */ | |
8757 | ||
8758 | static rtx | |
2396bce1 EC |
8759 | frv_read_iacc_argument (enum machine_mode mode, tree call, |
8760 | unsigned int index) | |
c557edf4 RS |
8761 | { |
8762 | int i, regno; | |
8763 | rtx op; | |
8764 | ||
2396bce1 | 8765 | op = frv_read_argument (call, index); |
c557edf4 RS |
8766 | if (GET_CODE (op) != CONST_INT |
8767 | || INTVAL (op) < 0 | |
8768 | || INTVAL (op) > IACC_LAST - IACC_FIRST | |
8769 | || ((INTVAL (op) * 4) & (GET_MODE_SIZE (mode) - 1)) != 0) | |
8770 | { | |
8771 | error ("invalid IACC argument"); | |
8772 | op = const0_rtx; | |
8773 | } | |
8774 | ||
0fa2e4df | 8775 | /* IACCs are implicit global registers. We set up this lazily to |
c112cf2b | 8776 | avoid creating lots of unnecessary call_insn rtl when IACCs aren't |
c557edf4 RS |
8777 | being used. */ |
8778 | regno = INTVAL (op) + IACC_FIRST; | |
8779 | for (i = 0; i < HARD_REGNO_NREGS (regno, mode); i++) | |
8780 | global_regs[regno + i] = 1; | |
8781 | ||
8782 | return gen_rtx_REG (mode, regno); | |
8783 | } | |
8784 | ||
36a05131 BS |
8785 | /* Return true if OPVAL can be used for operand OPNUM of instruction ICODE. |
8786 | The instruction should require a constant operand of some sort. The | |
8787 | function prints an error if OPVAL is not valid. */ | |
8788 | ||
8789 | static int | |
f2206911 | 8790 | frv_check_constant_argument (enum insn_code icode, int opnum, rtx opval) |
36a05131 BS |
8791 | { |
8792 | if (GET_CODE (opval) != CONST_INT) | |
8793 | { | |
9e637a26 | 8794 | error ("%qs expects a constant argument", insn_data[icode].name); |
36a05131 BS |
8795 | return FALSE; |
8796 | } | |
8797 | if (! (*insn_data[icode].operand[opnum].predicate) (opval, VOIDmode)) | |
8798 | { | |
9e637a26 | 8799 | error ("constant argument out of range for %qs", insn_data[icode].name); |
36a05131 BS |
8800 | return FALSE; |
8801 | } | |
8802 | return TRUE; | |
8803 | } | |
8804 | ||
8805 | /* Return a legitimate rtx for instruction ICODE's return value. Use TARGET | |
8806 | if it's not null, has the right mode, and satisfies operand 0's | |
8807 | predicate. */ | |
8808 | ||
8809 | static rtx | |
f2206911 | 8810 | frv_legitimize_target (enum insn_code icode, rtx target) |
36a05131 BS |
8811 | { |
8812 | enum machine_mode mode = insn_data[icode].operand[0].mode; | |
8813 | ||
8814 | if (! target | |
8815 | || GET_MODE (target) != mode | |
8816 | || ! (*insn_data[icode].operand[0].predicate) (target, mode)) | |
8817 | return gen_reg_rtx (mode); | |
8818 | else | |
8819 | return target; | |
8820 | } | |
8821 | ||
8822 | /* Given that ARG is being passed as operand OPNUM to instruction ICODE, | |
839a4992 | 8823 | check whether ARG satisfies the operand's constraints. If it doesn't, |
36a05131 BS |
8824 | copy ARG to a temporary register and return that. Otherwise return ARG |
8825 | itself. */ | |
8826 | ||
8827 | static rtx | |
f2206911 | 8828 | frv_legitimize_argument (enum insn_code icode, int opnum, rtx arg) |
36a05131 BS |
8829 | { |
8830 | enum machine_mode mode = insn_data[icode].operand[opnum].mode; | |
8831 | ||
8832 | if ((*insn_data[icode].operand[opnum].predicate) (arg, mode)) | |
8833 | return arg; | |
8834 | else | |
8835 | return copy_to_mode_reg (mode, arg); | |
8836 | } | |
8837 | ||
c14ff86e AH |
8838 | /* Return a volatile memory reference of mode MODE whose address is ARG. */ |
8839 | ||
8840 | static rtx | |
8841 | frv_volatile_memref (enum machine_mode mode, rtx arg) | |
8842 | { | |
8843 | rtx mem; | |
8844 | ||
8845 | mem = gen_rtx_MEM (mode, memory_address (mode, arg)); | |
8846 | MEM_VOLATILE_P (mem) = 1; | |
8847 | return mem; | |
8848 | } | |
8849 | ||
36a05131 BS |
8850 | /* Expand builtins that take a single, constant argument. At the moment, |
8851 | only MHDSETS falls into this category. */ | |
8852 | ||
8853 | static rtx | |
2396bce1 | 8854 | frv_expand_set_builtin (enum insn_code icode, tree call, rtx target) |
36a05131 BS |
8855 | { |
8856 | rtx pat; | |
2396bce1 | 8857 | rtx op0 = frv_read_argument (call, 0); |
36a05131 BS |
8858 | |
8859 | if (! frv_check_constant_argument (icode, 1, op0)) | |
8860 | return NULL_RTX; | |
8861 | ||
8862 | target = frv_legitimize_target (icode, target); | |
8863 | pat = GEN_FCN (icode) (target, op0); | |
8864 | if (! pat) | |
8865 | return NULL_RTX; | |
8866 | ||
8867 | emit_insn (pat); | |
8868 | return target; | |
8869 | } | |
8870 | ||
87b483a1 | 8871 | /* Expand builtins that take one operand. */ |
36a05131 BS |
8872 | |
8873 | static rtx | |
2396bce1 | 8874 | frv_expand_unop_builtin (enum insn_code icode, tree call, rtx target) |
36a05131 BS |
8875 | { |
8876 | rtx pat; | |
2396bce1 | 8877 | rtx op0 = frv_read_argument (call, 0); |
36a05131 BS |
8878 | |
8879 | target = frv_legitimize_target (icode, target); | |
8880 | op0 = frv_legitimize_argument (icode, 1, op0); | |
8881 | pat = GEN_FCN (icode) (target, op0); | |
8882 | if (! pat) | |
8883 | return NULL_RTX; | |
8884 | ||
8885 | emit_insn (pat); | |
8886 | return target; | |
8887 | } | |
8888 | ||
87b483a1 | 8889 | /* Expand builtins that take two operands. */ |
36a05131 BS |
8890 | |
8891 | static rtx | |
2396bce1 | 8892 | frv_expand_binop_builtin (enum insn_code icode, tree call, rtx target) |
36a05131 BS |
8893 | { |
8894 | rtx pat; | |
2396bce1 EC |
8895 | rtx op0 = frv_read_argument (call, 0); |
8896 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
8897 | |
8898 | target = frv_legitimize_target (icode, target); | |
8899 | op0 = frv_legitimize_argument (icode, 1, op0); | |
8900 | op1 = frv_legitimize_argument (icode, 2, op1); | |
8901 | pat = GEN_FCN (icode) (target, op0, op1); | |
8902 | if (! pat) | |
8903 | return NULL_RTX; | |
8904 | ||
8905 | emit_insn (pat); | |
8906 | return target; | |
8907 | } | |
8908 | ||
8909 | /* Expand cut-style builtins, which take two operands and an implicit ACCG | |
87b483a1 | 8910 | one. */ |
36a05131 BS |
8911 | |
8912 | static rtx | |
2396bce1 | 8913 | frv_expand_cut_builtin (enum insn_code icode, tree call, rtx target) |
36a05131 BS |
8914 | { |
8915 | rtx pat; | |
2396bce1 EC |
8916 | rtx op0 = frv_read_argument (call, 0); |
8917 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
8918 | rtx op2; |
8919 | ||
8920 | target = frv_legitimize_target (icode, target); | |
8921 | op0 = frv_int_to_acc (icode, 1, op0); | |
8922 | if (! op0) | |
8923 | return NULL_RTX; | |
8924 | ||
8925 | if (icode == CODE_FOR_mdcutssi || GET_CODE (op1) == CONST_INT) | |
8926 | { | |
8927 | if (! frv_check_constant_argument (icode, 2, op1)) | |
8928 | return NULL_RTX; | |
8929 | } | |
8930 | else | |
8931 | op1 = frv_legitimize_argument (icode, 2, op1); | |
8932 | ||
8933 | op2 = frv_matching_accg_for_acc (op0); | |
8934 | pat = GEN_FCN (icode) (target, op0, op1, op2); | |
8935 | if (! pat) | |
8936 | return NULL_RTX; | |
8937 | ||
8938 | emit_insn (pat); | |
8939 | return target; | |
8940 | } | |
8941 | ||
87b483a1 | 8942 | /* Expand builtins that take two operands and the second is immediate. */ |
36a05131 BS |
8943 | |
8944 | static rtx | |
2396bce1 | 8945 | frv_expand_binopimm_builtin (enum insn_code icode, tree call, rtx target) |
36a05131 BS |
8946 | { |
8947 | rtx pat; | |
2396bce1 EC |
8948 | rtx op0 = frv_read_argument (call, 0); |
8949 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
8950 | |
8951 | if (! frv_check_constant_argument (icode, 2, op1)) | |
8952 | return NULL_RTX; | |
8953 | ||
8954 | target = frv_legitimize_target (icode, target); | |
8955 | op0 = frv_legitimize_argument (icode, 1, op0); | |
8956 | pat = GEN_FCN (icode) (target, op0, op1); | |
8957 | if (! pat) | |
8958 | return NULL_RTX; | |
8959 | ||
8960 | emit_insn (pat); | |
8961 | return target; | |
8962 | } | |
8963 | ||
8964 | /* Expand builtins that take two operands, the first operand being a pointer to | |
87b483a1 | 8965 | ints and return void. */ |
36a05131 BS |
8966 | |
8967 | static rtx | |
2396bce1 | 8968 | frv_expand_voidbinop_builtin (enum insn_code icode, tree call) |
36a05131 BS |
8969 | { |
8970 | rtx pat; | |
2396bce1 EC |
8971 | rtx op0 = frv_read_argument (call, 0); |
8972 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
8973 | enum machine_mode mode0 = insn_data[icode].operand[0].mode; |
8974 | rtx addr; | |
8975 | ||
8976 | if (GET_CODE (op0) != MEM) | |
8977 | { | |
8978 | rtx reg = op0; | |
8979 | ||
8980 | if (! offsettable_address_p (0, mode0, op0)) | |
8981 | { | |
8982 | reg = gen_reg_rtx (Pmode); | |
8983 | emit_insn (gen_rtx_SET (VOIDmode, reg, op0)); | |
8984 | } | |
8985 | ||
8986 | op0 = gen_rtx_MEM (SImode, reg); | |
8987 | } | |
8988 | ||
8989 | addr = XEXP (op0, 0); | |
8990 | if (! offsettable_address_p (0, mode0, addr)) | |
8991 | addr = copy_to_mode_reg (Pmode, op0); | |
8992 | ||
8993 | op0 = change_address (op0, V4SImode, addr); | |
8994 | op1 = frv_legitimize_argument (icode, 1, op1); | |
8995 | pat = GEN_FCN (icode) (op0, op1); | |
8996 | if (! pat) | |
8997 | return 0; | |
8998 | ||
8999 | emit_insn (pat); | |
9000 | return 0; | |
9001 | } | |
9002 | ||
c557edf4 RS |
9003 | /* Expand builtins that take two long operands and return void. */ |
9004 | ||
9005 | static rtx | |
2396bce1 | 9006 | frv_expand_int_void2arg (enum insn_code icode, tree call) |
c557edf4 RS |
9007 | { |
9008 | rtx pat; | |
2396bce1 EC |
9009 | rtx op0 = frv_read_argument (call, 0); |
9010 | rtx op1 = frv_read_argument (call, 1); | |
c557edf4 RS |
9011 | |
9012 | op0 = frv_legitimize_argument (icode, 1, op0); | |
9013 | op1 = frv_legitimize_argument (icode, 1, op1); | |
9014 | pat = GEN_FCN (icode) (op0, op1); | |
9015 | if (! pat) | |
9016 | return NULL_RTX; | |
9017 | ||
9018 | emit_insn (pat); | |
9019 | return NULL_RTX; | |
9020 | } | |
9021 | ||
9022 | /* Expand prefetch builtins. These take a single address as argument. */ | |
9023 | ||
9024 | static rtx | |
2396bce1 | 9025 | frv_expand_prefetches (enum insn_code icode, tree call) |
c557edf4 RS |
9026 | { |
9027 | rtx pat; | |
2396bce1 | 9028 | rtx op0 = frv_read_argument (call, 0); |
c557edf4 RS |
9029 | |
9030 | pat = GEN_FCN (icode) (force_reg (Pmode, op0)); | |
9031 | if (! pat) | |
9032 | return 0; | |
9033 | ||
9034 | emit_insn (pat); | |
9035 | return 0; | |
9036 | } | |
9037 | ||
36a05131 BS |
9038 | /* Expand builtins that take three operands and return void. The first |
9039 | argument must be a constant that describes a pair or quad accumulators. A | |
9040 | fourth argument is created that is the accumulator guard register that | |
9041 | corresponds to the accumulator. */ | |
9042 | ||
9043 | static rtx | |
2396bce1 | 9044 | frv_expand_voidtriop_builtin (enum insn_code icode, tree call) |
36a05131 BS |
9045 | { |
9046 | rtx pat; | |
2396bce1 EC |
9047 | rtx op0 = frv_read_argument (call, 0); |
9048 | rtx op1 = frv_read_argument (call, 1); | |
9049 | rtx op2 = frv_read_argument (call, 2); | |
36a05131 BS |
9050 | rtx op3; |
9051 | ||
9052 | op0 = frv_int_to_acc (icode, 0, op0); | |
9053 | if (! op0) | |
9054 | return NULL_RTX; | |
9055 | ||
9056 | op1 = frv_legitimize_argument (icode, 1, op1); | |
9057 | op2 = frv_legitimize_argument (icode, 2, op2); | |
9058 | op3 = frv_matching_accg_for_acc (op0); | |
9059 | pat = GEN_FCN (icode) (op0, op1, op2, op3); | |
9060 | if (! pat) | |
9061 | return NULL_RTX; | |
9062 | ||
9063 | emit_insn (pat); | |
9064 | return NULL_RTX; | |
9065 | } | |
9066 | ||
9067 | /* Expand builtins that perform accumulator-to-accumulator operations. | |
9068 | These builtins take two accumulator numbers as argument and return | |
9069 | void. */ | |
9070 | ||
9071 | static rtx | |
2396bce1 | 9072 | frv_expand_voidaccop_builtin (enum insn_code icode, tree call) |
36a05131 BS |
9073 | { |
9074 | rtx pat; | |
2396bce1 EC |
9075 | rtx op0 = frv_read_argument (call, 0); |
9076 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
9077 | rtx op2; |
9078 | rtx op3; | |
9079 | ||
9080 | op0 = frv_int_to_acc (icode, 0, op0); | |
9081 | if (! op0) | |
9082 | return NULL_RTX; | |
9083 | ||
9084 | op1 = frv_int_to_acc (icode, 1, op1); | |
9085 | if (! op1) | |
9086 | return NULL_RTX; | |
9087 | ||
9088 | op2 = frv_matching_accg_for_acc (op0); | |
9089 | op3 = frv_matching_accg_for_acc (op1); | |
9090 | pat = GEN_FCN (icode) (op0, op1, op2, op3); | |
9091 | if (! pat) | |
9092 | return NULL_RTX; | |
9093 | ||
9094 | emit_insn (pat); | |
9095 | return NULL_RTX; | |
9096 | } | |
9097 | ||
38c28a25 AH |
9098 | /* Expand a __builtin_read* function. ICODE is the instruction code for the |
9099 | membar and TARGET_MODE is the mode that the loaded value should have. */ | |
c14ff86e AH |
9100 | |
9101 | static rtx | |
38c28a25 | 9102 | frv_expand_load_builtin (enum insn_code icode, enum machine_mode target_mode, |
2396bce1 | 9103 | tree call, rtx target) |
c14ff86e | 9104 | { |
2396bce1 | 9105 | rtx op0 = frv_read_argument (call, 0); |
38c28a25 AH |
9106 | rtx cookie = frv_io_address_cookie (op0); |
9107 | ||
9108 | if (target == 0 || !REG_P (target)) | |
9109 | target = gen_reg_rtx (target_mode); | |
9110 | op0 = frv_volatile_memref (insn_data[icode].operand[0].mode, op0); | |
9111 | convert_move (target, op0, 1); | |
9112 | emit_insn (GEN_FCN (icode) (copy_rtx (op0), cookie, GEN_INT (FRV_IO_READ))); | |
9113 | cfun->machine->has_membar_p = 1; | |
c14ff86e AH |
9114 | return target; |
9115 | } | |
9116 | ||
38c28a25 | 9117 | /* Likewise __builtin_write* functions. */ |
c14ff86e AH |
9118 | |
9119 | static rtx | |
2396bce1 | 9120 | frv_expand_store_builtin (enum insn_code icode, tree call) |
c14ff86e | 9121 | { |
2396bce1 EC |
9122 | rtx op0 = frv_read_argument (call, 0); |
9123 | rtx op1 = frv_read_argument (call, 1); | |
38c28a25 | 9124 | rtx cookie = frv_io_address_cookie (op0); |
c14ff86e | 9125 | |
38c28a25 AH |
9126 | op0 = frv_volatile_memref (insn_data[icode].operand[0].mode, op0); |
9127 | convert_move (op0, force_reg (insn_data[icode].operand[0].mode, op1), 1); | |
9128 | emit_insn (GEN_FCN (icode) (copy_rtx (op0), cookie, GEN_INT (FRV_IO_WRITE))); | |
9129 | cfun->machine->has_membar_p = 1; | |
c14ff86e AH |
9130 | return NULL_RTX; |
9131 | } | |
9132 | ||
a738d848 RS |
9133 | /* Expand the MDPACKH builtin. It takes four unsigned short arguments and |
9134 | each argument forms one word of the two double-word input registers. | |
2396bce1 EC |
9135 | CALL is the tree for the call and TARGET, if nonnull, suggests a good place |
9136 | to put the return value. */ | |
a738d848 RS |
9137 | |
9138 | static rtx | |
2396bce1 | 9139 | frv_expand_mdpackh_builtin (tree call, rtx target) |
a738d848 RS |
9140 | { |
9141 | enum insn_code icode = CODE_FOR_mdpackh; | |
9142 | rtx pat, op0, op1; | |
2396bce1 EC |
9143 | rtx arg1 = frv_read_argument (call, 0); |
9144 | rtx arg2 = frv_read_argument (call, 1); | |
9145 | rtx arg3 = frv_read_argument (call, 2); | |
9146 | rtx arg4 = frv_read_argument (call, 3); | |
a738d848 RS |
9147 | |
9148 | target = frv_legitimize_target (icode, target); | |
9149 | op0 = gen_reg_rtx (DImode); | |
9150 | op1 = gen_reg_rtx (DImode); | |
9151 | ||
0fa2e4df | 9152 | /* The high half of each word is not explicitly initialized, so indicate |
a738d848 | 9153 | that the input operands are not live before this point. */ |
c41c1387 RS |
9154 | emit_clobber (op0); |
9155 | emit_clobber (op1); | |
a738d848 RS |
9156 | |
9157 | /* Move each argument into the low half of its associated input word. */ | |
9158 | emit_move_insn (simplify_gen_subreg (HImode, op0, DImode, 2), arg1); | |
9159 | emit_move_insn (simplify_gen_subreg (HImode, op0, DImode, 6), arg2); | |
9160 | emit_move_insn (simplify_gen_subreg (HImode, op1, DImode, 2), arg3); | |
9161 | emit_move_insn (simplify_gen_subreg (HImode, op1, DImode, 6), arg4); | |
9162 | ||
9163 | pat = GEN_FCN (icode) (target, op0, op1); | |
9164 | if (! pat) | |
9165 | return NULL_RTX; | |
9166 | ||
9167 | emit_insn (pat); | |
9168 | return target; | |
9169 | } | |
9170 | ||
36a05131 BS |
9171 | /* Expand the MCLRACC builtin. This builtin takes a single accumulator |
9172 | number as argument. */ | |
9173 | ||
9174 | static rtx | |
2396bce1 | 9175 | frv_expand_mclracc_builtin (tree call) |
36a05131 BS |
9176 | { |
9177 | enum insn_code icode = CODE_FOR_mclracc; | |
9178 | rtx pat; | |
2396bce1 | 9179 | rtx op0 = frv_read_argument (call, 0); |
36a05131 BS |
9180 | |
9181 | op0 = frv_int_to_acc (icode, 0, op0); | |
9182 | if (! op0) | |
9183 | return NULL_RTX; | |
9184 | ||
9185 | pat = GEN_FCN (icode) (op0); | |
9186 | if (pat) | |
9187 | emit_insn (pat); | |
9188 | ||
9189 | return NULL_RTX; | |
9190 | } | |
9191 | ||
9192 | /* Expand builtins that take no arguments. */ | |
9193 | ||
9194 | static rtx | |
f2206911 | 9195 | frv_expand_noargs_builtin (enum insn_code icode) |
36a05131 | 9196 | { |
a556fd39 | 9197 | rtx pat = GEN_FCN (icode) (const0_rtx); |
36a05131 BS |
9198 | if (pat) |
9199 | emit_insn (pat); | |
9200 | ||
9201 | return NULL_RTX; | |
9202 | } | |
9203 | ||
9204 | /* Expand MRDACC and MRDACCG. These builtins take a single accumulator | |
9205 | number or accumulator guard number as argument and return an SI integer. */ | |
9206 | ||
9207 | static rtx | |
2396bce1 | 9208 | frv_expand_mrdacc_builtin (enum insn_code icode, tree call) |
36a05131 BS |
9209 | { |
9210 | rtx pat; | |
9211 | rtx target = gen_reg_rtx (SImode); | |
2396bce1 | 9212 | rtx op0 = frv_read_argument (call, 0); |
36a05131 BS |
9213 | |
9214 | op0 = frv_int_to_acc (icode, 1, op0); | |
9215 | if (! op0) | |
9216 | return NULL_RTX; | |
9217 | ||
9218 | pat = GEN_FCN (icode) (target, op0); | |
9219 | if (! pat) | |
9220 | return NULL_RTX; | |
9221 | ||
9222 | emit_insn (pat); | |
9223 | return target; | |
9224 | } | |
9225 | ||
9226 | /* Expand MWTACC and MWTACCG. These builtins take an accumulator or | |
9227 | accumulator guard as their first argument and an SImode value as their | |
9228 | second. */ | |
9229 | ||
9230 | static rtx | |
2396bce1 | 9231 | frv_expand_mwtacc_builtin (enum insn_code icode, tree call) |
36a05131 BS |
9232 | { |
9233 | rtx pat; | |
2396bce1 EC |
9234 | rtx op0 = frv_read_argument (call, 0); |
9235 | rtx op1 = frv_read_argument (call, 1); | |
36a05131 BS |
9236 | |
9237 | op0 = frv_int_to_acc (icode, 0, op0); | |
9238 | if (! op0) | |
9239 | return NULL_RTX; | |
9240 | ||
9241 | op1 = frv_legitimize_argument (icode, 1, op1); | |
9242 | pat = GEN_FCN (icode) (op0, op1); | |
9243 | if (pat) | |
9244 | emit_insn (pat); | |
9245 | ||
9246 | return NULL_RTX; | |
9247 | } | |
9248 | ||
c557edf4 RS |
9249 | /* Emit a move from SRC to DEST in SImode chunks. This can be used |
9250 | to move DImode values into and out of IACC0. */ | |
9251 | ||
9252 | static void | |
9253 | frv_split_iacc_move (rtx dest, rtx src) | |
9254 | { | |
9255 | enum machine_mode inner; | |
9256 | int i; | |
9257 | ||
9258 | inner = GET_MODE (dest); | |
9259 | for (i = 0; i < GET_MODE_SIZE (inner); i += GET_MODE_SIZE (SImode)) | |
9260 | emit_move_insn (simplify_gen_subreg (SImode, dest, inner, i), | |
9261 | simplify_gen_subreg (SImode, src, inner, i)); | |
9262 | } | |
9263 | ||
87b483a1 | 9264 | /* Expand builtins. */ |
36a05131 | 9265 | |
14966b94 | 9266 | static rtx |
f2206911 KC |
9267 | frv_expand_builtin (tree exp, |
9268 | rtx target, | |
9269 | rtx subtarget ATTRIBUTE_UNUSED, | |
9270 | enum machine_mode mode ATTRIBUTE_UNUSED, | |
9271 | int ignore ATTRIBUTE_UNUSED) | |
36a05131 | 9272 | { |
5039610b | 9273 | tree fndecl = TREE_OPERAND (CALL_EXPR_FN (exp), 0); |
36a05131 BS |
9274 | unsigned fcode = (unsigned)DECL_FUNCTION_CODE (fndecl); |
9275 | unsigned i; | |
9276 | struct builtin_description *d; | |
9277 | ||
c557edf4 | 9278 | if (fcode < FRV_BUILTIN_FIRST_NONMEDIA && !TARGET_MEDIA) |
36a05131 BS |
9279 | { |
9280 | error ("media functions are not available unless -mmedia is used"); | |
9281 | return NULL_RTX; | |
9282 | } | |
9283 | ||
9284 | switch (fcode) | |
9285 | { | |
9286 | case FRV_BUILTIN_MCOP1: | |
9287 | case FRV_BUILTIN_MCOP2: | |
9288 | case FRV_BUILTIN_MDUNPACKH: | |
9289 | case FRV_BUILTIN_MBTOHE: | |
9290 | if (! TARGET_MEDIA_REV1) | |
9291 | { | |
9292 | error ("this media function is only available on the fr500"); | |
9293 | return NULL_RTX; | |
9294 | } | |
9295 | break; | |
9296 | ||
9297 | case FRV_BUILTIN_MQXMACHS: | |
9298 | case FRV_BUILTIN_MQXMACXHS: | |
9299 | case FRV_BUILTIN_MQMACXHS: | |
9300 | case FRV_BUILTIN_MADDACCS: | |
9301 | case FRV_BUILTIN_MSUBACCS: | |
9302 | case FRV_BUILTIN_MASACCS: | |
9303 | case FRV_BUILTIN_MDADDACCS: | |
9304 | case FRV_BUILTIN_MDSUBACCS: | |
9305 | case FRV_BUILTIN_MDASACCS: | |
9306 | case FRV_BUILTIN_MABSHS: | |
9307 | case FRV_BUILTIN_MDROTLI: | |
9308 | case FRV_BUILTIN_MCPLHI: | |
9309 | case FRV_BUILTIN_MCPLI: | |
9310 | case FRV_BUILTIN_MDCUTSSI: | |
9311 | case FRV_BUILTIN_MQSATHS: | |
9312 | case FRV_BUILTIN_MHSETLOS: | |
9313 | case FRV_BUILTIN_MHSETLOH: | |
9314 | case FRV_BUILTIN_MHSETHIS: | |
9315 | case FRV_BUILTIN_MHSETHIH: | |
9316 | case FRV_BUILTIN_MHDSETS: | |
9317 | case FRV_BUILTIN_MHDSETH: | |
9318 | if (! TARGET_MEDIA_REV2) | |
9319 | { | |
c557edf4 RS |
9320 | error ("this media function is only available on the fr400" |
9321 | " and fr550"); | |
9322 | return NULL_RTX; | |
9323 | } | |
9324 | break; | |
9325 | ||
9326 | case FRV_BUILTIN_SMASS: | |
9327 | case FRV_BUILTIN_SMSSS: | |
9328 | case FRV_BUILTIN_SMU: | |
9329 | case FRV_BUILTIN_ADDSS: | |
9330 | case FRV_BUILTIN_SUBSS: | |
9331 | case FRV_BUILTIN_SLASS: | |
9332 | case FRV_BUILTIN_SCUTSS: | |
9333 | case FRV_BUILTIN_IACCreadll: | |
9334 | case FRV_BUILTIN_IACCreadl: | |
9335 | case FRV_BUILTIN_IACCsetll: | |
9336 | case FRV_BUILTIN_IACCsetl: | |
9337 | if (!TARGET_FR405_BUILTINS) | |
9338 | { | |
9339 | error ("this builtin function is only available" | |
9340 | " on the fr405 and fr450"); | |
9341 | return NULL_RTX; | |
9342 | } | |
9343 | break; | |
9344 | ||
9345 | case FRV_BUILTIN_PREFETCH: | |
9346 | if (!TARGET_FR500_FR550_BUILTINS) | |
9347 | { | |
9348 | error ("this builtin function is only available on the fr500" | |
9349 | " and fr550"); | |
9350 | return NULL_RTX; | |
9351 | } | |
9352 | break; | |
9353 | ||
9354 | case FRV_BUILTIN_MQLCLRHS: | |
9355 | case FRV_BUILTIN_MQLMTHS: | |
9356 | case FRV_BUILTIN_MQSLLHI: | |
9357 | case FRV_BUILTIN_MQSRAHI: | |
9358 | if (!TARGET_MEDIA_FR450) | |
9359 | { | |
9360 | error ("this builtin function is only available on the fr450"); | |
36a05131 BS |
9361 | return NULL_RTX; |
9362 | } | |
9363 | break; | |
9364 | ||
9365 | default: | |
9366 | break; | |
9367 | } | |
9368 | ||
87b483a1 | 9369 | /* Expand unique builtins. */ |
36a05131 BS |
9370 | |
9371 | switch (fcode) | |
9372 | { | |
9373 | case FRV_BUILTIN_MTRAP: | |
9374 | return frv_expand_noargs_builtin (CODE_FOR_mtrap); | |
9375 | ||
9376 | case FRV_BUILTIN_MCLRACC: | |
2396bce1 | 9377 | return frv_expand_mclracc_builtin (exp); |
36a05131 BS |
9378 | |
9379 | case FRV_BUILTIN_MCLRACCA: | |
9380 | if (TARGET_ACC_8) | |
9381 | return frv_expand_noargs_builtin (CODE_FOR_mclracca8); | |
9382 | else | |
9383 | return frv_expand_noargs_builtin (CODE_FOR_mclracca4); | |
9384 | ||
9385 | case FRV_BUILTIN_MRDACC: | |
2396bce1 | 9386 | return frv_expand_mrdacc_builtin (CODE_FOR_mrdacc, exp); |
36a05131 BS |
9387 | |
9388 | case FRV_BUILTIN_MRDACCG: | |
2396bce1 | 9389 | return frv_expand_mrdacc_builtin (CODE_FOR_mrdaccg, exp); |
36a05131 BS |
9390 | |
9391 | case FRV_BUILTIN_MWTACC: | |
2396bce1 | 9392 | return frv_expand_mwtacc_builtin (CODE_FOR_mwtacc, exp); |
36a05131 BS |
9393 | |
9394 | case FRV_BUILTIN_MWTACCG: | |
2396bce1 | 9395 | return frv_expand_mwtacc_builtin (CODE_FOR_mwtaccg, exp); |
36a05131 | 9396 | |
a738d848 | 9397 | case FRV_BUILTIN_MDPACKH: |
2396bce1 | 9398 | return frv_expand_mdpackh_builtin (exp, target); |
a738d848 | 9399 | |
c557edf4 RS |
9400 | case FRV_BUILTIN_IACCreadll: |
9401 | { | |
2396bce1 | 9402 | rtx src = frv_read_iacc_argument (DImode, exp, 0); |
c557edf4 RS |
9403 | if (target == 0 || !REG_P (target)) |
9404 | target = gen_reg_rtx (DImode); | |
9405 | frv_split_iacc_move (target, src); | |
9406 | return target; | |
9407 | } | |
9408 | ||
9409 | case FRV_BUILTIN_IACCreadl: | |
2396bce1 | 9410 | return frv_read_iacc_argument (SImode, exp, 0); |
c557edf4 RS |
9411 | |
9412 | case FRV_BUILTIN_IACCsetll: | |
9413 | { | |
2396bce1 EC |
9414 | rtx dest = frv_read_iacc_argument (DImode, exp, 0); |
9415 | rtx src = frv_read_argument (exp, 1); | |
c557edf4 RS |
9416 | frv_split_iacc_move (dest, force_reg (DImode, src)); |
9417 | return 0; | |
9418 | } | |
9419 | ||
9420 | case FRV_BUILTIN_IACCsetl: | |
9421 | { | |
2396bce1 EC |
9422 | rtx dest = frv_read_iacc_argument (SImode, exp, 0); |
9423 | rtx src = frv_read_argument (exp, 1); | |
c557edf4 RS |
9424 | emit_move_insn (dest, force_reg (SImode, src)); |
9425 | return 0; | |
9426 | } | |
9427 | ||
36a05131 BS |
9428 | default: |
9429 | break; | |
9430 | } | |
9431 | ||
87b483a1 | 9432 | /* Expand groups of builtins. */ |
36a05131 | 9433 | |
e97a46ce | 9434 | for (i = 0, d = bdesc_set; i < ARRAY_SIZE (bdesc_set); i++, d++) |
36a05131 | 9435 | if (d->code == fcode) |
2396bce1 | 9436 | return frv_expand_set_builtin (d->icode, exp, target); |
36a05131 | 9437 | |
e97a46ce | 9438 | for (i = 0, d = bdesc_1arg; i < ARRAY_SIZE (bdesc_1arg); i++, d++) |
36a05131 | 9439 | if (d->code == fcode) |
2396bce1 | 9440 | return frv_expand_unop_builtin (d->icode, exp, target); |
36a05131 | 9441 | |
e97a46ce | 9442 | for (i = 0, d = bdesc_2arg; i < ARRAY_SIZE (bdesc_2arg); i++, d++) |
36a05131 | 9443 | if (d->code == fcode) |
2396bce1 | 9444 | return frv_expand_binop_builtin (d->icode, exp, target); |
36a05131 | 9445 | |
e97a46ce | 9446 | for (i = 0, d = bdesc_cut; i < ARRAY_SIZE (bdesc_cut); i++, d++) |
36a05131 | 9447 | if (d->code == fcode) |
2396bce1 | 9448 | return frv_expand_cut_builtin (d->icode, exp, target); |
36a05131 | 9449 | |
e97a46ce KG |
9450 | for (i = 0, d = bdesc_2argimm; i < ARRAY_SIZE (bdesc_2argimm); i++, d++) |
9451 | if (d->code == fcode) | |
2396bce1 | 9452 | return frv_expand_binopimm_builtin (d->icode, exp, target); |
36a05131 | 9453 | |
e97a46ce KG |
9454 | for (i = 0, d = bdesc_void2arg; i < ARRAY_SIZE (bdesc_void2arg); i++, d++) |
9455 | if (d->code == fcode) | |
2396bce1 | 9456 | return frv_expand_voidbinop_builtin (d->icode, exp); |
36a05131 | 9457 | |
e97a46ce KG |
9458 | for (i = 0, d = bdesc_void3arg; i < ARRAY_SIZE (bdesc_void3arg); i++, d++) |
9459 | if (d->code == fcode) | |
2396bce1 | 9460 | return frv_expand_voidtriop_builtin (d->icode, exp); |
e97a46ce KG |
9461 | |
9462 | for (i = 0, d = bdesc_voidacc; i < ARRAY_SIZE (bdesc_voidacc); i++, d++) | |
9463 | if (d->code == fcode) | |
2396bce1 | 9464 | return frv_expand_voidaccop_builtin (d->icode, exp); |
36a05131 | 9465 | |
c557edf4 RS |
9466 | for (i = 0, d = bdesc_int_void2arg; |
9467 | i < ARRAY_SIZE (bdesc_int_void2arg); i++, d++) | |
9468 | if (d->code == fcode) | |
2396bce1 | 9469 | return frv_expand_int_void2arg (d->icode, exp); |
c557edf4 RS |
9470 | |
9471 | for (i = 0, d = bdesc_prefetches; | |
9472 | i < ARRAY_SIZE (bdesc_prefetches); i++, d++) | |
9473 | if (d->code == fcode) | |
2396bce1 | 9474 | return frv_expand_prefetches (d->icode, exp); |
c557edf4 | 9475 | |
c14ff86e AH |
9476 | for (i = 0, d = bdesc_loads; i < ARRAY_SIZE (bdesc_loads); i++, d++) |
9477 | if (d->code == fcode) | |
38c28a25 | 9478 | return frv_expand_load_builtin (d->icode, TYPE_MODE (TREE_TYPE (exp)), |
2396bce1 | 9479 | exp, target); |
c14ff86e AH |
9480 | |
9481 | for (i = 0, d = bdesc_stores; i < ARRAY_SIZE (bdesc_stores); i++, d++) | |
9482 | if (d->code == fcode) | |
2396bce1 | 9483 | return frv_expand_store_builtin (d->icode, exp); |
c14ff86e | 9484 | |
36a05131 BS |
9485 | return 0; |
9486 | } | |
14966b94 | 9487 | |
b3fbfc07 | 9488 | static bool |
3101faab | 9489 | frv_in_small_data_p (const_tree decl) |
b3fbfc07 | 9490 | { |
0f6e5d45 | 9491 | HOST_WIDE_INT size; |
3101faab | 9492 | const_tree section_name; |
0f6e5d45 RH |
9493 | |
9494 | /* Don't apply the -G flag to internal compiler structures. We | |
9495 | should leave such structures in the main data section, partly | |
9496 | for efficiency and partly because the size of some of them | |
9497 | (such as C++ typeinfos) is not known until later. */ | |
9498 | if (TREE_CODE (decl) != VAR_DECL || DECL_ARTIFICIAL (decl)) | |
9499 | return false; | |
9500 | ||
0f6e5d45 RH |
9501 | /* If we already know which section the decl should be in, see if |
9502 | it's a small data section. */ | |
9503 | section_name = DECL_SECTION_NAME (decl); | |
9504 | if (section_name) | |
9505 | { | |
44e91694 | 9506 | gcc_assert (TREE_CODE (section_name) == STRING_CST); |
0f6e5d45 RH |
9507 | if (frv_string_begins_with (section_name, ".sdata")) |
9508 | return true; | |
9509 | if (frv_string_begins_with (section_name, ".sbss")) | |
9510 | return true; | |
68c0ab4f | 9511 | return false; |
0f6e5d45 | 9512 | } |
b3fbfc07 | 9513 | |
68c0ab4f | 9514 | size = int_size_in_bytes (TREE_TYPE (decl)); |
fa37ed29 | 9515 | if (size > 0 && size <= g_switch_value) |
68c0ab4f RS |
9516 | return true; |
9517 | ||
0f6e5d45 | 9518 | return false; |
b3fbfc07 | 9519 | } |
3c50106f RH |
9520 | \f |
9521 | static bool | |
f2206911 KC |
9522 | frv_rtx_costs (rtx x, |
9523 | int code ATTRIBUTE_UNUSED, | |
9524 | int outer_code ATTRIBUTE_UNUSED, | |
68f932c4 | 9525 | int opno ATTRIBUTE_UNUSED, |
f40751dd JH |
9526 | int *total, |
9527 | bool speed ATTRIBUTE_UNUSED) | |
3c50106f | 9528 | { |
34208acf AO |
9529 | if (outer_code == MEM) |
9530 | { | |
9531 | /* Don't differentiate between memory addresses. All the ones | |
9532 | we accept have equal cost. */ | |
9533 | *total = COSTS_N_INSNS (0); | |
9534 | return true; | |
9535 | } | |
9536 | ||
3c50106f RH |
9537 | switch (code) |
9538 | { | |
9539 | case CONST_INT: | |
2300b9dd | 9540 | /* Make 12-bit integers really cheap. */ |
2f5b1308 | 9541 | if (IN_RANGE (INTVAL (x), -2048, 2047)) |
3c50106f RH |
9542 | { |
9543 | *total = 0; | |
9544 | return true; | |
9545 | } | |
87b483a1 | 9546 | /* Fall through. */ |
3c50106f RH |
9547 | |
9548 | case CONST: | |
9549 | case LABEL_REF: | |
9550 | case SYMBOL_REF: | |
9551 | case CONST_DOUBLE: | |
9552 | *total = COSTS_N_INSNS (2); | |
9553 | return true; | |
9554 | ||
9555 | case PLUS: | |
9556 | case MINUS: | |
9557 | case AND: | |
9558 | case IOR: | |
9559 | case XOR: | |
9560 | case ASHIFT: | |
9561 | case ASHIFTRT: | |
9562 | case LSHIFTRT: | |
9563 | case NOT: | |
9564 | case NEG: | |
9565 | case COMPARE: | |
9566 | if (GET_MODE (x) == SImode) | |
9567 | *total = COSTS_N_INSNS (1); | |
9568 | else if (GET_MODE (x) == DImode) | |
9569 | *total = COSTS_N_INSNS (2); | |
9570 | else | |
9571 | *total = COSTS_N_INSNS (3); | |
9572 | return true; | |
9573 | ||
9574 | case MULT: | |
9575 | if (GET_MODE (x) == SImode) | |
9576 | *total = COSTS_N_INSNS (2); | |
9577 | else | |
9578 | *total = COSTS_N_INSNS (6); /* guess */ | |
9579 | return true; | |
9580 | ||
9581 | case DIV: | |
9582 | case UDIV: | |
9583 | case MOD: | |
9584 | case UMOD: | |
9585 | *total = COSTS_N_INSNS (18); | |
9586 | return true; | |
9587 | ||
34208acf AO |
9588 | case MEM: |
9589 | *total = COSTS_N_INSNS (3); | |
9590 | return true; | |
9591 | ||
3c50106f RH |
9592 | default: |
9593 | return false; | |
9594 | } | |
9595 | } | |
90a63880 RH |
9596 | \f |
9597 | static void | |
f2206911 | 9598 | frv_asm_out_constructor (rtx symbol, int priority ATTRIBUTE_UNUSED) |
90a63880 | 9599 | { |
d6b5193b | 9600 | switch_to_section (ctors_section); |
90a63880 | 9601 | assemble_align (POINTER_SIZE); |
34208acf AO |
9602 | if (TARGET_FDPIC) |
9603 | { | |
44e91694 NS |
9604 | int ok = frv_assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, 1); |
9605 | ||
9606 | gcc_assert (ok); | |
34208acf AO |
9607 | return; |
9608 | } | |
90a63880 RH |
9609 | assemble_integer_with_op ("\t.picptr\t", symbol); |
9610 | } | |
9611 | ||
9612 | static void | |
f2206911 | 9613 | frv_asm_out_destructor (rtx symbol, int priority ATTRIBUTE_UNUSED) |
90a63880 | 9614 | { |
d6b5193b | 9615 | switch_to_section (dtors_section); |
90a63880 | 9616 | assemble_align (POINTER_SIZE); |
34208acf AO |
9617 | if (TARGET_FDPIC) |
9618 | { | |
44e91694 | 9619 | int ok = frv_assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, 1); |
2396bce1 | 9620 | |
44e91694 | 9621 | gcc_assert (ok); |
34208acf AO |
9622 | return; |
9623 | } | |
90a63880 RH |
9624 | assemble_integer_with_op ("\t.picptr\t", symbol); |
9625 | } | |
8ac411c7 KH |
9626 | |
9627 | /* Worker function for TARGET_STRUCT_VALUE_RTX. */ | |
9628 | ||
9629 | static rtx | |
9630 | frv_struct_value_rtx (tree fntype ATTRIBUTE_UNUSED, | |
9631 | int incoming ATTRIBUTE_UNUSED) | |
9632 | { | |
9633 | return gen_rtx_REG (Pmode, FRV_STRUCT_VALUE_REGNUM); | |
9634 | } | |
c557edf4 | 9635 | |
bef8809e AH |
9636 | #define TLS_BIAS (2048 - 16) |
9637 | ||
fdbe66f2 | 9638 | /* This is called from dwarf2out.c via TARGET_ASM_OUTPUT_DWARF_DTPREL. |
bef8809e AH |
9639 | We need to emit DTP-relative relocations. */ |
9640 | ||
fdbe66f2 | 9641 | static void |
bef8809e AH |
9642 | frv_output_dwarf_dtprel (FILE *file, int size, rtx x) |
9643 | { | |
44e91694 | 9644 | gcc_assert (size == 4); |
bef8809e AH |
9645 | fputs ("\t.picptr\ttlsmoff(", file); |
9646 | /* We want the unbiased TLS offset, so add the bias to the | |
9647 | expression, such that the implicit biasing cancels out. */ | |
0a81f074 | 9648 | output_addr_const (file, plus_constant (Pmode, x, TLS_BIAS)); |
bef8809e AH |
9649 | fputs (")", file); |
9650 | } | |
9651 | ||
c557edf4 | 9652 | #include "gt-frv.h" |