]>
Commit | Line | Data |
---|---|---|
feeeff5c | 1 | /* Subroutines used for code generation on the EPIPHANY cpu. |
5624e564 | 2 | Copyright (C) 1994-2015 Free Software Foundation, Inc. |
feeeff5c JR |
3 | Contributed by Embecosm on behalf of Adapteva, Inc. |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 3, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING3. If not see | |
19 | <http://www.gnu.org/licenses/>. */ | |
20 | ||
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
c7131fb2 | 24 | #include "backend.h" |
feeeff5c | 25 | #include "tree.h" |
c7131fb2 AM |
26 | #include "rtl.h" |
27 | #include "df.h" | |
28 | #include "alias.h" | |
40e23961 | 29 | #include "fold-const.h" |
d8a2d370 DN |
30 | #include "stor-layout.h" |
31 | #include "varasm.h" | |
32 | #include "calls.h" | |
33 | #include "stringpool.h" | |
feeeff5c | 34 | #include "regs.h" |
feeeff5c JR |
35 | #include "insn-config.h" |
36 | #include "conditions.h" | |
37 | #include "output.h" | |
38 | #include "insn-attr.h" | |
39 | #include "flags.h" | |
b0710fe1 AM |
40 | #include "insn-codes.h" |
41 | #include "optabs.h" | |
36566b39 PK |
42 | #include "expmed.h" |
43 | #include "dojump.h" | |
44 | #include "explow.h" | |
45 | #include "emit-rtl.h" | |
46 | #include "stmt.h" | |
feeeff5c JR |
47 | #include "expr.h" |
48 | #include "diagnostic-core.h" | |
49 | #include "recog.h" | |
50 | #include "toplev.h" | |
51 | #include "tm_p.h" | |
52 | #include "target.h" | |
60393bbc AM |
53 | #include "cfgrtl.h" |
54 | #include "cfganal.h" | |
55 | #include "lcm.h" | |
56 | #include "cfgbuild.h" | |
57 | #include "cfgcleanup.h" | |
feeeff5c | 58 | #include "langhooks.h" |
feeeff5c | 59 | #include "tm-constrs.h" |
7ee2468b | 60 | #include "tree-pass.h" /* for current_pass */ |
05555c4a DM |
61 | #include "context.h" |
62 | #include "pass_manager.h" | |
9b2b7279 | 63 | #include "builtins.h" |
feeeff5c JR |
64 | |
65 | /* Which cpu we're compiling for. */ | |
66 | int epiphany_cpu_type; | |
67 | ||
68 | /* Name of mangle string to add to symbols to separate code compiled for each | |
69 | cpu (or NULL). */ | |
70 | const char *epiphany_mangle_cpu; | |
71 | ||
72 | /* Array of valid operand punctuation characters. */ | |
73 | char epiphany_punct_chars[256]; | |
74 | ||
75 | /* The rounding mode that we generally use for floating point. */ | |
76 | int epiphany_normal_fp_rounding; | |
77 | ||
05555c4a DM |
78 | /* The pass instance, for use in epiphany_optimize_mode_switching. */ |
79 | static opt_pass *pass_mode_switch_use; | |
80 | ||
feeeff5c JR |
81 | static void epiphany_init_reg_tables (void); |
82 | static int get_epiphany_condition_code (rtx); | |
83 | static tree epiphany_handle_interrupt_attribute (tree *, tree, tree, int, bool *); | |
60098013 JR |
84 | static tree epiphany_handle_forwarder_attribute (tree *, tree, tree, int, |
85 | bool *); | |
ef4bddc2 | 86 | static bool epiphany_pass_by_reference (cumulative_args_t, machine_mode, |
feeeff5c | 87 | const_tree, bool); |
bcfba653 | 88 | static rtx_insn *frame_insn (rtx); |
feeeff5c JR |
89 | \f |
90 | /* defines for the initialization of the GCC target structure. */ | |
91 | #define TARGET_ATTRIBUTE_TABLE epiphany_attribute_table | |
92 | ||
93 | #define TARGET_PRINT_OPERAND epiphany_print_operand | |
94 | #define TARGET_PRINT_OPERAND_ADDRESS epiphany_print_operand_address | |
95 | ||
96 | #define TARGET_RTX_COSTS epiphany_rtx_costs | |
97 | #define TARGET_ADDRESS_COST epiphany_address_cost | |
98 | #define TARGET_MEMORY_MOVE_COST epiphany_memory_move_cost | |
99 | ||
100 | #define TARGET_PROMOTE_FUNCTION_MODE epiphany_promote_function_mode | |
101 | #define TARGET_PROMOTE_PROTOTYPES hook_bool_const_tree_true | |
102 | ||
103 | #define TARGET_RETURN_IN_MEMORY epiphany_return_in_memory | |
104 | #define TARGET_PASS_BY_REFERENCE epiphany_pass_by_reference | |
105 | #define TARGET_CALLEE_COPIES hook_bool_CUMULATIVE_ARGS_mode_tree_bool_true | |
106 | #define TARGET_FUNCTION_VALUE epiphany_function_value | |
107 | #define TARGET_LIBCALL_VALUE epiphany_libcall_value | |
108 | #define TARGET_FUNCTION_VALUE_REGNO_P epiphany_function_value_regno_p | |
109 | ||
110 | #define TARGET_SETUP_INCOMING_VARARGS epiphany_setup_incoming_varargs | |
111 | ||
112 | /* Using the simplistic varags handling forces us to do partial reg/stack | |
113 | argument passing for types with larger size (> 4 bytes) than alignemnt. */ | |
114 | #define TARGET_ARG_PARTIAL_BYTES epiphany_arg_partial_bytes | |
115 | ||
116 | #define TARGET_FUNCTION_OK_FOR_SIBCALL epiphany_function_ok_for_sibcall | |
117 | ||
118 | #define TARGET_SCHED_ISSUE_RATE epiphany_issue_rate | |
119 | #define TARGET_SCHED_ADJUST_COST epiphany_adjust_cost | |
120 | ||
121 | #define TARGET_LEGITIMATE_ADDRESS_P epiphany_legitimate_address_p | |
122 | ||
123 | #define TARGET_SECONDARY_RELOAD epiphany_secondary_reload | |
124 | ||
125 | #define TARGET_OPTION_OVERRIDE epiphany_override_options | |
126 | ||
127 | #define TARGET_CONDITIONAL_REGISTER_USAGE epiphany_conditional_register_usage | |
128 | ||
129 | #define TARGET_FUNCTION_ARG epiphany_function_arg | |
130 | ||
131 | #define TARGET_FUNCTION_ARG_ADVANCE epiphany_function_arg_advance | |
132 | ||
133 | #define TARGET_FUNCTION_ARG_BOUNDARY epiphany_function_arg_boundary | |
134 | ||
135 | #define TARGET_TRAMPOLINE_INIT epiphany_trampoline_init | |
136 | ||
137 | /* Nonzero if the constant rtx value is a legitimate general operand. | |
138 | We can handle any 32- or 64-bit constant. */ | |
139 | #define TARGET_LEGITIMATE_CONSTANT_P hook_bool_mode_rtx_true | |
140 | ||
141 | #define TARGET_MIN_DIVISIONS_FOR_RECIP_MUL \ | |
142 | epiphany_min_divisions_for_recip_mul | |
143 | ||
144 | #define TARGET_VECTORIZE_PREFERRED_SIMD_MODE epiphany_preferred_simd_mode | |
145 | ||
146 | #define TARGET_VECTOR_MODE_SUPPORTED_P epiphany_vector_mode_supported_p | |
147 | ||
148 | #define TARGET_VECTORIZE_VECTOR_ALIGNMENT_REACHABLE \ | |
149 | epiphany_vector_alignment_reachable | |
150 | ||
151 | #define TARGET_VECTORIZE_SUPPORT_VECTOR_MISALIGNMENT \ | |
152 | epiphany_support_vector_misalignment | |
153 | ||
154 | #define TARGET_ASM_CAN_OUTPUT_MI_THUNK \ | |
155 | hook_bool_const_tree_hwi_hwi_const_tree_true | |
156 | #define TARGET_ASM_OUTPUT_MI_THUNK epiphany_output_mi_thunk | |
157 | ||
d9bb5800 JR |
158 | /* ??? we can use larger offsets for wider-mode sized accesses, but there |
159 | is no concept of anchors being dependent on the modes that they are used | |
160 | for, so we can only use an offset range that would suit all modes. */ | |
161 | #define TARGET_MAX_ANCHOR_OFFSET (optimize_size ? 31 : 2047) | |
162 | /* We further restrict the minimum to be a multiple of eight. */ | |
163 | #define TARGET_MIN_ANCHOR_OFFSET (optimize_size ? 0 : -2040) | |
164 | ||
06b90602 CB |
165 | /* Mode switching hooks. */ |
166 | ||
167 | #define TARGET_MODE_EMIT emit_set_fp_mode | |
168 | ||
169 | #define TARGET_MODE_NEEDED epiphany_mode_needed | |
170 | ||
171 | #define TARGET_MODE_PRIORITY epiphany_mode_priority | |
172 | ||
173 | #define TARGET_MODE_ENTRY epiphany_mode_entry | |
174 | ||
175 | #define TARGET_MODE_EXIT epiphany_mode_exit | |
176 | ||
177 | #define TARGET_MODE_AFTER epiphany_mode_after | |
178 | ||
feeeff5c JR |
179 | #include "target-def.h" |
180 | ||
181 | #undef TARGET_ASM_ALIGNED_HI_OP | |
182 | #define TARGET_ASM_ALIGNED_HI_OP "\t.hword\t" | |
183 | #undef TARGET_ASM_ALIGNED_SI_OP | |
184 | #define TARGET_ASM_ALIGNED_SI_OP "\t.word\t" | |
185 | \f | |
186 | bool | |
187 | epiphany_is_interrupt_p (tree decl) | |
188 | { | |
189 | tree attrs; | |
190 | ||
191 | attrs = DECL_ATTRIBUTES (decl); | |
192 | if (lookup_attribute ("interrupt", attrs)) | |
193 | return true; | |
194 | else | |
195 | return false; | |
196 | } | |
197 | ||
198 | /* Called from epiphany_override_options. | |
199 | We use this to initialize various things. */ | |
200 | ||
201 | static void | |
202 | epiphany_init (void) | |
203 | { | |
204 | /* N.B. this pass must not run before the first optimize_mode_switching | |
205 | pass because of the side offect of epiphany_mode_needed on | |
206 | MACHINE_FUNCTION(cfun)->unknown_mode_uses. But it must run before | |
207 | pass_resolve_sw_modes. */ | |
05555c4a DM |
208 | pass_mode_switch_use = make_pass_mode_switch_use (g); |
209 | struct register_pass_info insert_use_info | |
210 | = { pass_mode_switch_use, "mode_sw", | |
feeeff5c JR |
211 | 1, PASS_POS_INSERT_AFTER |
212 | }; | |
05555c4a DM |
213 | opt_pass *mode_sw2 |
214 | = g->get_passes()->get_pass_mode_switching ()->clone (); | |
215 | struct register_pass_info mode_sw2_info | |
216 | = { mode_sw2, "mode_sw", | |
feeeff5c JR |
217 | 1, PASS_POS_INSERT_AFTER |
218 | }; | |
05555c4a DM |
219 | opt_pass *mode_sw3 = make_pass_resolve_sw_modes (g); |
220 | struct register_pass_info mode_sw3_info | |
221 | = { mode_sw3, "mode_sw", | |
feeeff5c JR |
222 | 1, PASS_POS_INSERT_AFTER |
223 | }; | |
05555c4a DM |
224 | opt_pass *mode_sw4 |
225 | = g->get_passes()->get_pass_split_all_insns ()->clone (); | |
226 | struct register_pass_info mode_sw4_info | |
227 | = { mode_sw4, "mode_sw", | |
feeeff5c JR |
228 | 1, PASS_POS_INSERT_AFTER |
229 | }; | |
566be57c JR |
230 | static const int num_modes[] = NUM_MODES_FOR_MODE_SWITCHING; |
231 | #define N_ENTITIES ARRAY_SIZE (num_modes) | |
feeeff5c JR |
232 | |
233 | epiphany_init_reg_tables (); | |
234 | ||
235 | /* Initialize array for PRINT_OPERAND_PUNCT_VALID_P. */ | |
236 | memset (epiphany_punct_chars, 0, sizeof (epiphany_punct_chars)); | |
237 | epiphany_punct_chars['-'] = 1; | |
238 | ||
239 | epiphany_normal_fp_rounding | |
240 | = (epiphany_normal_fp_mode == FP_MODE_ROUND_TRUNC | |
241 | ? FP_MODE_ROUND_TRUNC : FP_MODE_ROUND_NEAREST); | |
242 | register_pass (&mode_sw4_info); | |
243 | register_pass (&mode_sw2_info); | |
244 | register_pass (&mode_sw3_info); | |
245 | register_pass (&insert_use_info); | |
246 | register_pass (&mode_sw2_info); | |
566be57c JR |
247 | /* Verify that NUM_MODES_FOR_MODE_SWITCHING has one value per entity. */ |
248 | gcc_assert (N_ENTITIES == EPIPHANY_MSW_ENTITY_NUM); | |
feeeff5c JR |
249 | |
250 | #if 1 /* As long as peep2_rescan is not implemented, | |
251 | (see http://gcc.gnu.org/ml/gcc-patches/2011-10/msg02819.html,) | |
252 | we need a second peephole2 pass to get reasonable code. */ | |
253 | { | |
05555c4a DM |
254 | opt_pass *extra_peephole2 |
255 | = g->get_passes ()->get_pass_peephole2 ()->clone (); | |
256 | struct register_pass_info peep2_2_info | |
257 | = { extra_peephole2, "peephole2", | |
feeeff5c JR |
258 | 1, PASS_POS_INSERT_AFTER |
259 | }; | |
260 | ||
261 | register_pass (&peep2_2_info); | |
262 | } | |
263 | #endif | |
264 | } | |
265 | ||
266 | /* The condition codes of the EPIPHANY, and the inverse function. */ | |
267 | static const char *const epiphany_condition_codes[] = | |
268 | { /* 0 1 2 3 4 5 6 7 8 9 */ | |
269 | "eq", "ne", "ltu", "gteu", "gt", "lte", "gte", "lt", "gtu", "lteu", | |
270 | /* 10 11 12 13 */ | |
271 | "beq","bne","blt", "blte", | |
272 | }; | |
273 | ||
274 | #define EPIPHANY_INVERSE_CONDITION_CODE(X) ((X) ^ 1) | |
275 | ||
276 | /* Returns the index of the EPIPHANY condition code string in | |
277 | `epiphany_condition_codes'. COMPARISON should be an rtx like | |
278 | `(eq (...) (...))'. */ | |
279 | ||
280 | static int | |
281 | get_epiphany_condition_code (rtx comparison) | |
282 | { | |
283 | switch (GET_MODE (XEXP (comparison, 0))) | |
284 | { | |
285 | case CCmode: | |
286 | switch (GET_CODE (comparison)) | |
287 | { | |
288 | case EQ : return 0; | |
289 | case NE : return 1; | |
290 | case LTU : return 2; | |
291 | case GEU : return 3; | |
292 | case GT : return 4; | |
293 | case LE : return 5; | |
294 | case GE : return 6; | |
295 | case LT : return 7; | |
296 | case GTU : return 8; | |
297 | case LEU : return 9; | |
298 | ||
299 | default : gcc_unreachable (); | |
300 | } | |
301 | case CC_N_NEmode: | |
302 | switch (GET_CODE (comparison)) | |
303 | { | |
304 | case EQ: return 6; | |
305 | case NE: return 7; | |
306 | default: gcc_unreachable (); | |
307 | } | |
308 | case CC_C_LTUmode: | |
309 | switch (GET_CODE (comparison)) | |
310 | { | |
311 | case GEU: return 2; | |
312 | case LTU: return 3; | |
313 | default: gcc_unreachable (); | |
314 | } | |
315 | case CC_C_GTUmode: | |
316 | switch (GET_CODE (comparison)) | |
317 | { | |
318 | case LEU: return 3; | |
319 | case GTU: return 2; | |
320 | default: gcc_unreachable (); | |
321 | } | |
322 | case CC_FPmode: | |
323 | switch (GET_CODE (comparison)) | |
324 | { | |
325 | case EQ: return 10; | |
326 | case NE: return 11; | |
327 | case LT: return 12; | |
328 | case LE: return 13; | |
329 | default: gcc_unreachable (); | |
330 | } | |
331 | case CC_FP_EQmode: | |
332 | switch (GET_CODE (comparison)) | |
333 | { | |
334 | case EQ: return 0; | |
335 | case NE: return 1; | |
336 | default: gcc_unreachable (); | |
337 | } | |
338 | case CC_FP_GTEmode: | |
339 | switch (GET_CODE (comparison)) | |
340 | { | |
341 | case EQ: return 0; | |
342 | case NE: return 1; | |
343 | case GT : return 4; | |
344 | case GE : return 6; | |
345 | case UNLE : return 5; | |
346 | case UNLT : return 7; | |
347 | default: gcc_unreachable (); | |
348 | } | |
349 | case CC_FP_ORDmode: | |
350 | switch (GET_CODE (comparison)) | |
351 | { | |
352 | case ORDERED: return 9; | |
353 | case UNORDERED: return 8; | |
354 | default: gcc_unreachable (); | |
355 | } | |
356 | case CC_FP_UNEQmode: | |
357 | switch (GET_CODE (comparison)) | |
358 | { | |
359 | case UNEQ: return 9; | |
360 | case LTGT: return 8; | |
361 | default: gcc_unreachable (); | |
362 | } | |
363 | default: gcc_unreachable (); | |
364 | } | |
365 | /*NOTREACHED*/ | |
366 | return (42); | |
367 | } | |
368 | ||
369 | ||
370 | /* Return 1 if hard register REGNO can hold a value of machine_mode MODE. */ | |
371 | int | |
ef4bddc2 | 372 | hard_regno_mode_ok (int regno, machine_mode mode) |
feeeff5c JR |
373 | { |
374 | if (GET_MODE_SIZE (mode) > UNITS_PER_WORD) | |
375 | return (regno & 1) == 0 && GPR_P (regno); | |
376 | else | |
377 | return 1; | |
378 | } | |
379 | ||
380 | /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE, | |
381 | return the mode to be used for the comparison. */ | |
382 | ||
ef4bddc2 | 383 | machine_mode |
feeeff5c JR |
384 | epiphany_select_cc_mode (enum rtx_code op, |
385 | rtx x ATTRIBUTE_UNUSED, | |
386 | rtx y ATTRIBUTE_UNUSED) | |
387 | { | |
388 | if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT) | |
389 | { | |
8afab237 JR |
390 | if (TARGET_SOFT_CMPSF |
391 | || op == ORDERED || op == UNORDERED) | |
feeeff5c JR |
392 | { |
393 | if (op == EQ || op == NE) | |
394 | return CC_FP_EQmode; | |
395 | if (op == ORDERED || op == UNORDERED) | |
396 | return CC_FP_ORDmode; | |
397 | if (op == UNEQ || op == LTGT) | |
398 | return CC_FP_UNEQmode; | |
399 | return CC_FP_GTEmode; | |
400 | } | |
401 | return CC_FPmode; | |
402 | } | |
403 | /* recognize combiner pattern ashlsi_btst: | |
404 | (parallel [ | |
405 | (set (reg:N_NE 65 cc1) | |
406 | (compare:N_NE (zero_extract:SI (reg/v:SI 75 [ a ]) | |
407 | (const_int 1 [0x1]) | |
408 | (const_int 0 [0x0])) | |
409 | (const_int 0 [0x0]))) | |
410 | (clobber (scratch:SI)) */ | |
411 | else if ((op == EQ || op == NE) | |
412 | && GET_CODE (x) == ZERO_EXTRACT | |
413 | && XEXP (x, 1) == const1_rtx | |
414 | && CONST_INT_P (XEXP (x, 2))) | |
415 | return CC_N_NEmode; | |
416 | else if ((op == GEU || op == LTU) && GET_CODE (x) == PLUS) | |
417 | return CC_C_LTUmode; | |
418 | else if ((op == LEU || op == GTU) && GET_CODE (x) == MINUS) | |
419 | return CC_C_GTUmode; | |
420 | else | |
421 | return CCmode; | |
422 | } | |
423 | ||
424 | enum reg_class epiphany_regno_reg_class[FIRST_PSEUDO_REGISTER]; | |
425 | ||
426 | static void | |
427 | epiphany_init_reg_tables (void) | |
428 | { | |
429 | int i; | |
430 | ||
431 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
432 | { | |
433 | if (i == GPR_LR) | |
434 | epiphany_regno_reg_class[i] = LR_REGS; | |
435 | else if (i <= 7 && TARGET_PREFER_SHORT_INSN_REGS) | |
436 | epiphany_regno_reg_class[i] = SHORT_INSN_REGS; | |
437 | else if (call_used_regs[i] | |
438 | && TEST_HARD_REG_BIT (reg_class_contents[GENERAL_REGS], i)) | |
439 | epiphany_regno_reg_class[i] = SIBCALL_REGS; | |
440 | else if (i >= CORE_CONTROL_FIRST && i <= CORE_CONTROL_LAST) | |
441 | epiphany_regno_reg_class[i] = CORE_CONTROL_REGS; | |
442 | else if (i < (GPR_LAST+1) | |
443 | || i == ARG_POINTER_REGNUM || i == FRAME_POINTER_REGNUM) | |
444 | epiphany_regno_reg_class[i] = GENERAL_REGS; | |
445 | else if (i == CC_REGNUM) | |
446 | epiphany_regno_reg_class[i] = NO_REGS /* CC_REG: must be NO_REGS */; | |
447 | else | |
448 | epiphany_regno_reg_class[i] = NO_REGS; | |
449 | } | |
450 | } | |
451 | \f | |
452 | /* EPIPHANY specific attribute support. | |
453 | ||
454 | The EPIPHANY has these attributes: | |
455 | interrupt - for interrupt functions. | |
456 | short_call - the function is assumed to be reachable with the b / bl | |
457 | instructions. | |
458 | long_call - the function address is loaded into a register before use. | |
459 | disinterrupt - functions which mask interrupts throughout. | |
460 | They unmask them while calling an interruptible | |
461 | function, though. */ | |
462 | ||
463 | static const struct attribute_spec epiphany_attribute_table[] = | |
464 | { | |
465 | /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */ | |
60098013 JR |
466 | { "interrupt", 0, 9, true, false, false, epiphany_handle_interrupt_attribute, true }, |
467 | { "forwarder_section", 1, 1, true, false, false, epiphany_handle_forwarder_attribute, false }, | |
feeeff5c JR |
468 | { "long_call", 0, 0, false, true, true, NULL, false }, |
469 | { "short_call", 0, 0, false, true, true, NULL, false }, | |
60098013 | 470 | { "disinterrupt", 0, 0, false, true, true, NULL, true }, |
feeeff5c JR |
471 | { NULL, 0, 0, false, false, false, NULL, false } |
472 | }; | |
473 | ||
474 | /* Handle an "interrupt" attribute; arguments as in | |
475 | struct attribute_spec.handler. */ | |
476 | static tree | |
e7b7077e | 477 | epiphany_handle_interrupt_attribute (tree *node, tree name, tree args, |
feeeff5c JR |
478 | int flags ATTRIBUTE_UNUSED, |
479 | bool *no_add_attrs) | |
480 | { | |
60098013 JR |
481 | tree value; |
482 | ||
483 | if (!args) | |
e7b7077e JR |
484 | { |
485 | gcc_assert (DECL_P (*node)); | |
486 | tree t = TREE_TYPE (*node); | |
487 | if (TREE_CODE (t) != FUNCTION_TYPE) | |
488 | warning (OPT_Wattributes, "%qE attribute only applies to functions", | |
489 | name); | |
490 | /* Argument handling and the stack layout for interrupt handlers | |
491 | don't mix. It makes no sense in the first place, so emit an | |
492 | error for this. */ | |
493 | else if (TYPE_ARG_TYPES (t) | |
494 | && TREE_VALUE (TYPE_ARG_TYPES (t)) != void_type_node) | |
495 | error_at (DECL_SOURCE_LOCATION (*node), | |
496 | "interrupt handlers cannot have arguments"); | |
497 | return NULL_TREE; | |
498 | } | |
60098013 JR |
499 | |
500 | value = TREE_VALUE (args); | |
feeeff5c JR |
501 | |
502 | if (TREE_CODE (value) != STRING_CST) | |
503 | { | |
504 | warning (OPT_Wattributes, | |
505 | "argument of %qE attribute is not a string constant", name); | |
506 | *no_add_attrs = true; | |
507 | } | |
508 | else if (strcmp (TREE_STRING_POINTER (value), "reset") | |
509 | && strcmp (TREE_STRING_POINTER (value), "software_exception") | |
188b7e23 JR |
510 | && strcmp (TREE_STRING_POINTER (value), "page_miss") |
511 | && strcmp (TREE_STRING_POINTER (value), "timer0") | |
512 | && strcmp (TREE_STRING_POINTER (value), "timer1") | |
513 | && strcmp (TREE_STRING_POINTER (value), "message") | |
feeeff5c JR |
514 | && strcmp (TREE_STRING_POINTER (value), "dma0") |
515 | && strcmp (TREE_STRING_POINTER (value), "dma1") | |
188b7e23 | 516 | && strcmp (TREE_STRING_POINTER (value), "wand") |
feeeff5c JR |
517 | && strcmp (TREE_STRING_POINTER (value), "swi")) |
518 | { | |
519 | warning (OPT_Wattributes, | |
188b7e23 | 520 | "argument of %qE attribute is not \"reset\", \"software_exception\", \"page_miss\", \"timer0\", \"timer1\", \"message\", \"dma0\", \"dma1\", \"wand\" or \"swi\"", |
feeeff5c JR |
521 | name); |
522 | *no_add_attrs = true; | |
60098013 | 523 | return NULL_TREE; |
feeeff5c JR |
524 | } |
525 | ||
60098013 JR |
526 | return epiphany_handle_interrupt_attribute (node, name, TREE_CHAIN (args), |
527 | flags, no_add_attrs); | |
528 | } | |
529 | ||
530 | /* Handle a "forwarder_section" attribute; arguments as in | |
531 | struct attribute_spec.handler. */ | |
532 | static tree | |
533 | epiphany_handle_forwarder_attribute (tree *node ATTRIBUTE_UNUSED, | |
534 | tree name, tree args, | |
535 | int flags ATTRIBUTE_UNUSED, | |
536 | bool *no_add_attrs) | |
537 | { | |
538 | tree value; | |
539 | ||
540 | value = TREE_VALUE (args); | |
541 | ||
542 | if (TREE_CODE (value) != STRING_CST) | |
543 | { | |
544 | warning (OPT_Wattributes, | |
545 | "argument of %qE attribute is not a string constant", name); | |
546 | *no_add_attrs = true; | |
547 | } | |
feeeff5c JR |
548 | return NULL_TREE; |
549 | } | |
550 | ||
551 | \f | |
552 | /* Misc. utilities. */ | |
553 | ||
554 | /* Generate a SYMBOL_REF for the special function NAME. When the address | |
555 | can't be placed directly into a call instruction, and if possible, copy | |
556 | it to a register so that cse / code hoisting is possible. */ | |
557 | rtx | |
558 | sfunc_symbol (const char *name) | |
559 | { | |
560 | rtx sym = gen_rtx_SYMBOL_REF (Pmode, name); | |
561 | ||
562 | /* These sfuncs should be hidden, and every dso should get a copy. */ | |
563 | SYMBOL_REF_FLAGS (sym) = SYMBOL_FLAG_FUNCTION | SYMBOL_FLAG_LOCAL; | |
564 | if (TARGET_SHORT_CALLS) | |
565 | ; /* Nothing to be done. */ | |
566 | else if (can_create_pseudo_p ()) | |
567 | sym = copy_to_mode_reg (Pmode, sym); | |
568 | else /* We rely on reload to fix this up. */ | |
569 | gcc_assert (!reload_in_progress || reload_completed); | |
570 | return sym; | |
571 | } | |
572 | ||
573 | /* X and Y are two things to compare using CODE in IN_MODE. | |
574 | Emit the compare insn, construct the the proper cc reg in the proper | |
575 | mode, and return the rtx for the cc reg comparison in CMODE. */ | |
576 | ||
577 | rtx | |
ef4bddc2 RS |
578 | gen_compare_reg (machine_mode cmode, enum rtx_code code, |
579 | machine_mode in_mode, rtx x, rtx y) | |
feeeff5c | 580 | { |
ef4bddc2 | 581 | machine_mode mode = SELECT_CC_MODE (code, x, y); |
feeeff5c JR |
582 | rtx cc_reg, pat, clob0, clob1, clob2; |
583 | ||
584 | if (in_mode == VOIDmode) | |
585 | in_mode = GET_MODE (x); | |
586 | if (in_mode == VOIDmode) | |
587 | in_mode = GET_MODE (y); | |
588 | ||
589 | if (mode == CC_FPmode) | |
590 | { | |
591 | /* The epiphany has only EQ / NE / LT / LE conditions for | |
592 | hardware floating point. */ | |
593 | if (code == GT || code == GE || code == UNLE || code == UNLT) | |
594 | { | |
595 | rtx tmp = x; x = y; y = tmp; | |
596 | code = swap_condition (code); | |
597 | } | |
598 | cc_reg = gen_rtx_REG (mode, CCFP_REGNUM); | |
599 | y = force_reg (in_mode, y); | |
600 | } | |
601 | else | |
602 | { | |
603 | if (mode == CC_FP_GTEmode | |
604 | && (code == LE || code == LT || code == UNGT || code == UNGE)) | |
605 | { | |
105766f3 JR |
606 | if (flag_finite_math_only |
607 | && ((REG_P (x) && REGNO (x) == GPR_0) | |
608 | || (REG_P (y) && REGNO (y) == GPR_1))) | |
609 | switch (code) | |
610 | { | |
611 | case LE: code = UNLE; break; | |
612 | case LT: code = UNLT; break; | |
613 | case UNGT: code = GT; break; | |
614 | case UNGE: code = GE; break; | |
615 | default: gcc_unreachable (); | |
616 | } | |
617 | else | |
618 | { | |
619 | rtx tmp = x; x = y; y = tmp; | |
620 | code = swap_condition (code); | |
621 | } | |
feeeff5c JR |
622 | } |
623 | cc_reg = gen_rtx_REG (mode, CC_REGNUM); | |
624 | } | |
625 | if ((mode == CC_FP_EQmode || mode == CC_FP_GTEmode | |
626 | || mode == CC_FP_ORDmode || mode == CC_FP_UNEQmode) | |
627 | /* mov<mode>cc might want to re-emit a comparison during ifcvt. */ | |
105766f3 JR |
628 | && (!REG_P (x) || REGNO (x) != GPR_0 |
629 | || !REG_P (y) || REGNO (y) != GPR_1)) | |
feeeff5c JR |
630 | { |
631 | rtx reg; | |
632 | ||
105766f3 JR |
633 | #if 0 |
634 | /* ??? We should really do the r0/r1 clobber only during rtl expansion, | |
635 | but just like the flag clobber of movsicc, we have to allow | |
636 | this for ifcvt to work, on the assumption that we'll only want | |
637 | to do this if these registers have been used before by the | |
638 | pre-ifcvt code. */ | |
feeeff5c | 639 | gcc_assert (currently_expanding_to_rtl); |
105766f3 JR |
640 | #endif |
641 | reg = gen_rtx_REG (in_mode, GPR_0); | |
642 | if (reg_overlap_mentioned_p (reg, y)) | |
643 | return 0; | |
feeeff5c JR |
644 | emit_move_insn (reg, x); |
645 | x = reg; | |
105766f3 | 646 | reg = gen_rtx_REG (in_mode, GPR_1); |
feeeff5c JR |
647 | emit_move_insn (reg, y); |
648 | y = reg; | |
649 | } | |
650 | else | |
651 | x = force_reg (in_mode, x); | |
652 | ||
f7df4a84 | 653 | pat = gen_rtx_SET (cc_reg, gen_rtx_COMPARE (mode, x, y)); |
feeeff5c JR |
654 | if (mode == CC_FP_EQmode || mode == CC_FP_GTEmode) |
655 | { | |
656 | const char *name = mode == CC_FP_EQmode ? "__eqsf2" : "__gtesf2"; | |
657 | rtx use = gen_rtx_USE (VOIDmode, sfunc_symbol (name)); | |
658 | ||
659 | clob0 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (SImode, GPR_IP)); | |
660 | clob1 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (SImode, GPR_LR)); | |
661 | pat = gen_rtx_PARALLEL (VOIDmode, gen_rtvec (4, pat, use, clob0, clob1)); | |
662 | } | |
663 | else if (mode == CC_FP_ORDmode || mode == CC_FP_UNEQmode) | |
664 | { | |
665 | const char *name = mode == CC_FP_ORDmode ? "__ordsf2" : "__uneqsf2"; | |
666 | rtx use = gen_rtx_USE (VOIDmode, sfunc_symbol (name)); | |
667 | ||
668 | clob0 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (SImode, GPR_IP)); | |
669 | clob1 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (SImode, GPR_16)); | |
670 | clob2 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (SImode, GPR_LR)); | |
671 | pat = gen_rtx_PARALLEL (VOIDmode, gen_rtvec (5, pat, use, | |
672 | clob0, clob1, clob2)); | |
673 | } | |
674 | else | |
675 | { | |
676 | clob0 = gen_rtx_CLOBBER (VOIDmode, gen_rtx_SCRATCH (in_mode)); | |
677 | pat = gen_rtx_PARALLEL (VOIDmode, gen_rtvec (2, pat, clob0)); | |
678 | } | |
679 | emit_insn (pat); | |
680 | return gen_rtx_fmt_ee (code, cmode, cc_reg, const0_rtx); | |
681 | } | |
682 | \f | |
683 | /* The ROUND_ADVANCE* macros are local to this file. */ | |
684 | /* Round SIZE up to a word boundary. */ | |
685 | #define ROUND_ADVANCE(SIZE) \ | |
686 | (((SIZE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD) | |
687 | ||
688 | /* Round arg MODE/TYPE up to the next word boundary. */ | |
689 | #define ROUND_ADVANCE_ARG(MODE, TYPE) \ | |
690 | ((MODE) == BLKmode \ | |
691 | ? ROUND_ADVANCE (int_size_in_bytes (TYPE)) \ | |
692 | : ROUND_ADVANCE (GET_MODE_SIZE (MODE))) | |
693 | ||
694 | /* Round CUM up to the necessary point for argument MODE/TYPE. */ | |
695 | #define ROUND_ADVANCE_CUM(CUM, MODE, TYPE) \ | |
696 | (epiphany_function_arg_boundary ((MODE), (TYPE)) > BITS_PER_WORD \ | |
697 | ? (((CUM) + 1) & ~1) \ | |
698 | : (CUM)) | |
699 | ||
700 | static unsigned int | |
ef4bddc2 | 701 | epiphany_function_arg_boundary (machine_mode mode, const_tree type) |
feeeff5c JR |
702 | { |
703 | if ((type ? TYPE_ALIGN (type) : GET_MODE_BITSIZE (mode)) <= PARM_BOUNDARY) | |
704 | return PARM_BOUNDARY; | |
705 | return 2 * PARM_BOUNDARY; | |
706 | } | |
707 | ||
708 | /* Do any needed setup for a variadic function. For the EPIPHANY, we | |
709 | actually emit the code in epiphany_expand_prologue. | |
710 | ||
711 | CUM has not been updated for the last named argument which has type TYPE | |
712 | and mode MODE, and we rely on this fact. */ | |
713 | ||
714 | ||
715 | static void | |
ef4bddc2 | 716 | epiphany_setup_incoming_varargs (cumulative_args_t cum, machine_mode mode, |
feeeff5c JR |
717 | tree type, int *pretend_size, int no_rtl) |
718 | { | |
719 | int first_anon_arg; | |
720 | CUMULATIVE_ARGS next_cum; | |
721 | machine_function_t *mf = MACHINE_FUNCTION (cfun); | |
722 | ||
723 | /* All BLKmode values are passed by reference. */ | |
724 | gcc_assert (mode != BLKmode); | |
725 | ||
726 | next_cum = *get_cumulative_args (cum); | |
727 | next_cum | |
728 | = ROUND_ADVANCE_CUM (next_cum, mode, type) + ROUND_ADVANCE_ARG (mode, type); | |
729 | first_anon_arg = next_cum; | |
730 | ||
731 | if (first_anon_arg < MAX_EPIPHANY_PARM_REGS && !no_rtl) | |
732 | { | |
733 | /* Note that first_reg_offset < MAX_EPIPHANY_PARM_REGS. */ | |
734 | int first_reg_offset = first_anon_arg; | |
735 | ||
736 | *pretend_size = ((MAX_EPIPHANY_PARM_REGS - first_reg_offset) | |
737 | * UNITS_PER_WORD); | |
738 | } | |
739 | mf->args_parsed = 1; | |
740 | mf->pretend_args_odd = ((*pretend_size & UNITS_PER_WORD) ? 1 : 0); | |
741 | } | |
742 | ||
743 | static int | |
ef4bddc2 | 744 | epiphany_arg_partial_bytes (cumulative_args_t cum, machine_mode mode, |
feeeff5c JR |
745 | tree type, bool named ATTRIBUTE_UNUSED) |
746 | { | |
747 | int words = 0, rounded_cum; | |
748 | ||
749 | gcc_assert (!epiphany_pass_by_reference (cum, mode, type, /* named */ true)); | |
750 | ||
751 | rounded_cum = ROUND_ADVANCE_CUM (*get_cumulative_args (cum), mode, type); | |
752 | if (rounded_cum < MAX_EPIPHANY_PARM_REGS) | |
753 | { | |
754 | words = MAX_EPIPHANY_PARM_REGS - rounded_cum; | |
755 | if (words >= ROUND_ADVANCE_ARG (mode, type)) | |
756 | words = 0; | |
757 | } | |
758 | return words * UNITS_PER_WORD; | |
759 | } | |
760 | \f | |
761 | /* Cost functions. */ | |
762 | ||
763 | /* Compute a (partial) cost for rtx X. Return true if the complete | |
764 | cost has been computed, and false if subexpressions should be | |
765 | scanned. In either case, *TOTAL contains the cost result. */ | |
766 | ||
767 | static bool | |
e548c9df AM |
768 | epiphany_rtx_costs (rtx x, machine_mode mode, int outer_code, |
769 | int opno ATTRIBUTE_UNUSED, | |
feeeff5c JR |
770 | int *total, bool speed ATTRIBUTE_UNUSED) |
771 | { | |
e548c9df AM |
772 | int code = GET_CODE (x); |
773 | ||
feeeff5c JR |
774 | switch (code) |
775 | { | |
776 | /* Small integers in the right context are as cheap as registers. */ | |
777 | case CONST_INT: | |
778 | if ((outer_code == PLUS || outer_code == MINUS) | |
779 | && SIMM11 (INTVAL (x))) | |
780 | { | |
781 | *total = 0; | |
782 | return true; | |
783 | } | |
784 | if (IMM16 (INTVAL (x))) | |
785 | { | |
786 | *total = outer_code == SET ? 0 : COSTS_N_INSNS (1); | |
787 | return true; | |
788 | } | |
789 | /* FALLTHRU */ | |
790 | ||
791 | case CONST: | |
792 | case LABEL_REF: | |
793 | case SYMBOL_REF: | |
794 | *total = COSTS_N_INSNS ((epiphany_small16 (x) ? 0 : 1) | |
795 | + (outer_code == SET ? 0 : 1)); | |
796 | return true; | |
797 | ||
798 | case CONST_DOUBLE: | |
799 | { | |
800 | rtx high, low; | |
801 | split_double (x, &high, &low); | |
802 | *total = COSTS_N_INSNS (!IMM16 (INTVAL (high)) | |
803 | + !IMM16 (INTVAL (low))); | |
804 | return true; | |
805 | } | |
806 | ||
807 | case ASHIFT: | |
808 | case ASHIFTRT: | |
809 | case LSHIFTRT: | |
810 | *total = COSTS_N_INSNS (1); | |
811 | return true; | |
812 | ||
b5d0ecea | 813 | case COMPARE: |
e548c9df | 814 | switch (mode) |
b5d0ecea JR |
815 | { |
816 | /* There are a number of single-insn combiner patterns that use | |
817 | the flag side effects of arithmetic. */ | |
818 | case CC_N_NEmode: | |
819 | case CC_C_LTUmode: | |
820 | case CC_C_GTUmode: | |
821 | return true; | |
822 | default: | |
823 | return false; | |
824 | } | |
825 | ||
d9bb5800 JR |
826 | |
827 | case SET: | |
828 | { | |
829 | rtx src = SET_SRC (x); | |
830 | if (BINARY_P (src)) | |
831 | *total = 0; | |
832 | return false; | |
833 | } | |
834 | ||
feeeff5c JR |
835 | default: |
836 | return false; | |
837 | } | |
838 | } | |
839 | ||
840 | ||
841 | /* Provide the costs of an addressing mode that contains ADDR. | |
842 | If ADDR is not a valid address, its cost is irrelevant. */ | |
843 | ||
844 | static int | |
ef4bddc2 | 845 | epiphany_address_cost (rtx addr, machine_mode mode, |
b413068c | 846 | addr_space_t as ATTRIBUTE_UNUSED, bool speed) |
feeeff5c JR |
847 | { |
848 | rtx reg; | |
849 | rtx off = const0_rtx; | |
850 | int i; | |
851 | ||
852 | if (speed) | |
853 | return 0; | |
854 | /* Return 0 for addresses valid in short insns, 1 for addresses only valid | |
855 | in long insns. */ | |
856 | switch (GET_CODE (addr)) | |
857 | { | |
858 | case PLUS : | |
859 | reg = XEXP (addr, 0); | |
860 | off = XEXP (addr, 1); | |
861 | break; | |
862 | case POST_MODIFY: | |
863 | reg = XEXP (addr, 0); | |
864 | off = XEXP (addr, 1); | |
865 | gcc_assert (GET_CODE (off) == PLUS && rtx_equal_p (reg, XEXP (off, 0))); | |
866 | off = XEXP (off, 1); | |
867 | if (satisfies_constraint_Rgs (reg) && satisfies_constraint_Rgs (off)) | |
868 | return 0; | |
869 | return 1; | |
870 | case REG: | |
871 | default: | |
872 | reg = addr; | |
873 | break; | |
874 | } | |
875 | if (!satisfies_constraint_Rgs (reg)) | |
876 | return 1; | |
2266617f JR |
877 | /* The offset range available for short instructions depends on the mode |
878 | of the memory access. */ | |
feeeff5c JR |
879 | /* First, make sure we have a valid integer. */ |
880 | if (!satisfies_constraint_L (off)) | |
881 | return 1; | |
882 | i = INTVAL (off); | |
2266617f JR |
883 | switch (GET_MODE_SIZE (mode)) |
884 | { | |
885 | default: | |
886 | case 4: | |
887 | if (i & 1) | |
888 | return 1; | |
889 | i >>= 1; | |
890 | /* Fall through. */ | |
891 | case 2: | |
892 | if (i & 1) | |
893 | return 1; | |
894 | i >>= 1; | |
895 | /* Fall through. */ | |
896 | case 1: | |
897 | return i < -7 || i > 7; | |
898 | } | |
feeeff5c JR |
899 | } |
900 | ||
901 | /* Compute the cost of moving data between registers and memory. | |
902 | For integer, load latency is twice as long as register-register moves, | |
903 | but issue pich is the same. For floating point, load latency is three | |
904 | times as much as a reg-reg move. */ | |
905 | static int | |
ef4bddc2 | 906 | epiphany_memory_move_cost (machine_mode mode, |
feeeff5c JR |
907 | reg_class_t rclass ATTRIBUTE_UNUSED, |
908 | bool in ATTRIBUTE_UNUSED) | |
909 | { | |
910 | return GET_MODE_CLASS (mode) == MODE_INT ? 3 : 4; | |
911 | } | |
912 | \f | |
913 | /* Function prologue/epilogue handlers. */ | |
914 | ||
915 | /* EPIPHANY stack frames look like: | |
916 | ||
917 | Before call After call | |
918 | +-----------------------+ +-----------------------+ | |
919 | | | | | | |
920 | high | local variables, | | local variables, | | |
921 | mem | reg save area, etc. | | reg save area, etc. | | |
922 | | | | | | |
923 | +-----------------------+ +-----------------------+ | |
924 | | | | | | |
925 | | arguments on stack. | | arguments on stack. | | |
926 | | | | | | |
927 | SP+8->+-----------------------+FP+8m->+-----------------------+ | |
928 | | 2 word save area for | | reg parm save area, | | |
929 | | leaf funcs / flags | | only created for | | |
930 | SP+0->+-----------------------+ | variable argument | | |
931 | | functions | | |
932 | FP+8n->+-----------------------+ | |
933 | | | | |
934 | | register save area | | |
935 | | | | |
936 | +-----------------------+ | |
937 | | | | |
938 | | local variables | | |
939 | | | | |
940 | FP+0->+-----------------------+ | |
941 | | | | |
942 | | alloca allocations | | |
943 | | | | |
944 | +-----------------------+ | |
945 | | | | |
946 | | arguments on stack | | |
947 | | | | |
948 | SP+8->+-----------------------+ | |
949 | low | 2 word save area for | | |
950 | memory | leaf funcs / flags | | |
951 | SP+0->+-----------------------+ | |
952 | ||
953 | Notes: | |
954 | 1) The "reg parm save area" does not exist for non variable argument fns. | |
955 | The "reg parm save area" could be eliminated if we created our | |
956 | own TARGET_GIMPLIFY_VA_ARG_EXPR, but that has tradeoffs as well | |
957 | (so it's not done). */ | |
958 | ||
959 | /* Structure to be filled in by epiphany_compute_frame_size with register | |
960 | save masks, and offsets for the current function. */ | |
961 | struct epiphany_frame_info | |
962 | { | |
963 | unsigned int total_size; /* # bytes that the entire frame takes up. */ | |
964 | unsigned int pretend_size; /* # bytes we push and pretend caller did. */ | |
965 | unsigned int args_size; /* # bytes that outgoing arguments take up. */ | |
966 | unsigned int reg_size; /* # bytes needed to store regs. */ | |
967 | unsigned int var_size; /* # bytes that variables take up. */ | |
968 | HARD_REG_SET gmask; /* Set of saved gp registers. */ | |
969 | int initialized; /* Nonzero if frame size already calculated. */ | |
970 | int stld_sz; /* Current load/store data size for offset | |
971 | adjustment. */ | |
972 | int need_fp; /* value to override "frame_pointer_needed */ | |
4c97f1cc JR |
973 | /* FIRST_SLOT is the slot that is saved first, at the very start of |
974 | the frame, with a POST_MODIFY to allocate the frame, if the size fits, | |
975 | or at least the parm and register save areas, otherwise. | |
976 | In the case of a large frame, LAST_SLOT is the slot that is saved last, | |
977 | with a POST_MODIFY to allocate the rest of the frame. */ | |
feeeff5c JR |
978 | int first_slot, last_slot, first_slot_offset, last_slot_offset; |
979 | int first_slot_size; | |
980 | int small_threshold; | |
981 | }; | |
982 | ||
983 | /* Current frame information calculated by epiphany_compute_frame_size. */ | |
984 | static struct epiphany_frame_info current_frame_info; | |
985 | ||
986 | /* Zero structure to initialize current_frame_info. */ | |
987 | static struct epiphany_frame_info zero_frame_info; | |
988 | ||
989 | /* The usual; we set up our machine_function data. */ | |
990 | static struct machine_function * | |
991 | epiphany_init_machine_status (void) | |
992 | { | |
993 | struct machine_function *machine; | |
994 | ||
995 | /* Reset state info for each function. */ | |
996 | current_frame_info = zero_frame_info; | |
997 | ||
766090c2 | 998 | machine = ggc_cleared_alloc<machine_function_t> (); |
feeeff5c JR |
999 | |
1000 | return machine; | |
1001 | } | |
1002 | ||
1003 | /* Implements INIT_EXPANDERS. We just set up to call the above | |
1004 | * function. */ | |
1005 | void | |
1006 | epiphany_init_expanders (void) | |
1007 | { | |
1008 | init_machine_status = epiphany_init_machine_status; | |
1009 | } | |
1010 | ||
1011 | /* Type of function DECL. | |
1012 | ||
1013 | The result is cached. To reset the cache at the end of a function, | |
1014 | call with DECL = NULL_TREE. */ | |
1015 | ||
1016 | static enum epiphany_function_type | |
1017 | epiphany_compute_function_type (tree decl) | |
1018 | { | |
1019 | tree a; | |
1020 | /* Cached value. */ | |
1021 | static enum epiphany_function_type fn_type = EPIPHANY_FUNCTION_UNKNOWN; | |
1022 | /* Last function we were called for. */ | |
1023 | static tree last_fn = NULL_TREE; | |
1024 | ||
1025 | /* Resetting the cached value? */ | |
1026 | if (decl == NULL_TREE) | |
1027 | { | |
1028 | fn_type = EPIPHANY_FUNCTION_UNKNOWN; | |
1029 | last_fn = NULL_TREE; | |
1030 | return fn_type; | |
1031 | } | |
1032 | ||
1033 | if (decl == last_fn && fn_type != EPIPHANY_FUNCTION_UNKNOWN) | |
1034 | return fn_type; | |
1035 | ||
1036 | /* Assume we have a normal function (not an interrupt handler). */ | |
1037 | fn_type = EPIPHANY_FUNCTION_NORMAL; | |
1038 | ||
1039 | /* Now see if this is an interrupt handler. */ | |
1040 | for (a = DECL_ATTRIBUTES (decl); | |
1041 | a; | |
1042 | a = TREE_CHAIN (a)) | |
1043 | { | |
60098013 | 1044 | tree name = TREE_PURPOSE (a); |
feeeff5c | 1045 | |
60098013 JR |
1046 | if (name == get_identifier ("interrupt")) |
1047 | fn_type = EPIPHANY_FUNCTION_INTERRUPT; | |
feeeff5c JR |
1048 | } |
1049 | ||
1050 | last_fn = decl; | |
1051 | return fn_type; | |
1052 | } | |
1053 | ||
1054 | #define RETURN_ADDR_REGNUM GPR_LR | |
1055 | #define FRAME_POINTER_MASK (1 << (FRAME_POINTER_REGNUM)) | |
1056 | #define RETURN_ADDR_MASK (1 << (RETURN_ADDR_REGNUM)) | |
1057 | ||
1058 | /* Tell prologue and epilogue if register REGNO should be saved / restored. | |
1059 | The return address and frame pointer are treated separately. | |
1060 | Don't consider them here. */ | |
1061 | #define MUST_SAVE_REGISTER(regno, interrupt_p) \ | |
1062 | ((df_regs_ever_live_p (regno) \ | |
416ff32e | 1063 | || (interrupt_p && !crtl->is_leaf \ |
feeeff5c JR |
1064 | && call_used_regs[regno] && !fixed_regs[regno])) \ |
1065 | && (!call_used_regs[regno] || regno == GPR_LR \ | |
1066 | || (interrupt_p && regno != GPR_SP))) | |
1067 | ||
1068 | #define MUST_SAVE_RETURN_ADDR 0 | |
1069 | ||
1070 | /* Return the bytes needed to compute the frame pointer from the current | |
1071 | stack pointer. | |
1072 | ||
1073 | SIZE is the size needed for local variables. */ | |
1074 | ||
1075 | static unsigned int | |
1076 | epiphany_compute_frame_size (int size /* # of var. bytes allocated. */) | |
1077 | { | |
1078 | int regno; | |
1079 | unsigned int total_size, var_size, args_size, pretend_size, reg_size; | |
1080 | HARD_REG_SET gmask; | |
1081 | enum epiphany_function_type fn_type; | |
1082 | int interrupt_p; | |
1083 | int first_slot, last_slot, first_slot_offset, last_slot_offset; | |
1084 | int first_slot_size; | |
1085 | int small_slots = 0; | |
feeeff5c JR |
1086 | |
1087 | var_size = size; | |
1088 | args_size = crtl->outgoing_args_size; | |
1089 | pretend_size = crtl->args.pretend_args_size; | |
1090 | total_size = args_size + var_size; | |
1091 | reg_size = 0; | |
1092 | CLEAR_HARD_REG_SET (gmask); | |
1093 | first_slot = -1; | |
1094 | first_slot_offset = 0; | |
1095 | last_slot = -1; | |
1096 | last_slot_offset = 0; | |
1097 | first_slot_size = UNITS_PER_WORD; | |
1098 | ||
1099 | /* See if this is an interrupt handler. Call used registers must be saved | |
1100 | for them too. */ | |
1101 | fn_type = epiphany_compute_function_type (current_function_decl); | |
1102 | interrupt_p = EPIPHANY_INTERRUPT_P (fn_type); | |
1103 | ||
1104 | /* Calculate space needed for registers. */ | |
1105 | ||
1106 | for (regno = MAX_EPIPHANY_PARM_REGS - 1; pretend_size > reg_size; regno--) | |
1107 | { | |
1108 | reg_size += UNITS_PER_WORD; | |
1109 | SET_HARD_REG_BIT (gmask, regno); | |
1110 | if (epiphany_stack_offset - reg_size == 0) | |
1111 | first_slot = regno; | |
1112 | } | |
1113 | ||
1114 | if (interrupt_p) | |
1115 | reg_size += 2 * UNITS_PER_WORD; | |
1116 | else | |
1117 | small_slots = epiphany_stack_offset / UNITS_PER_WORD; | |
1118 | ||
1119 | if (frame_pointer_needed) | |
1120 | { | |
1121 | current_frame_info.need_fp = 1; | |
1122 | if (!interrupt_p && first_slot < 0) | |
1123 | first_slot = GPR_FP; | |
1124 | } | |
1125 | else | |
1126 | current_frame_info.need_fp = 0; | |
1127 | for (regno = 0; regno <= GPR_LAST; regno++) | |
1128 | { | |
1129 | if (MUST_SAVE_REGISTER (regno, interrupt_p)) | |
1130 | { | |
1131 | gcc_assert (!TEST_HARD_REG_BIT (gmask, regno)); | |
1132 | reg_size += UNITS_PER_WORD; | |
1133 | SET_HARD_REG_BIT (gmask, regno); | |
1134 | /* FIXME: when optimizing for speed, take schedling into account | |
1135 | when selecting these registers. */ | |
1136 | if (regno == first_slot) | |
1137 | gcc_assert (regno == GPR_FP && frame_pointer_needed); | |
1138 | else if (!interrupt_p && first_slot < 0) | |
1139 | first_slot = regno; | |
1140 | else if (last_slot < 0 | |
1141 | && (first_slot ^ regno) != 1 | |
105766f3 | 1142 | && (!interrupt_p || regno > GPR_1)) |
feeeff5c JR |
1143 | last_slot = regno; |
1144 | } | |
1145 | } | |
1146 | if (TEST_HARD_REG_BIT (gmask, GPR_LR)) | |
1147 | MACHINE_FUNCTION (cfun)->lr_clobbered = 1; | |
1148 | /* ??? Could sometimes do better than that. */ | |
1149 | current_frame_info.small_threshold | |
1150 | = (optimize >= 3 || interrupt_p ? 0 | |
1151 | : pretend_size ? small_slots | |
1152 | : 4 + small_slots - (first_slot == GPR_FP)); | |
1153 | ||
1154 | /* If there might be variables with 64-bit alignment requirement, align the | |
1155 | start of the variables. */ | |
1156 | if (var_size >= 2 * UNITS_PER_WORD | |
1157 | /* We don't want to split a double reg save/restore across two unpaired | |
1158 | stack slots when optimizing. This rounding could be avoided with | |
1159 | more complex reordering of the register saves, but that would seem | |
1160 | to be a lot of code complexity for little gain. */ | |
1161 | || (reg_size > 8 && optimize)) | |
1162 | reg_size = EPIPHANY_STACK_ALIGN (reg_size); | |
4c97f1cc JR |
1163 | if (((total_size + reg_size |
1164 | /* Reserve space for UNKNOWN_REGNUM. */ | |
1165 | + EPIPHANY_STACK_ALIGN (4)) | |
1166 | <= (unsigned) epiphany_stack_offset) | |
feeeff5c | 1167 | && !interrupt_p |
416ff32e | 1168 | && crtl->is_leaf && !frame_pointer_needed) |
feeeff5c JR |
1169 | { |
1170 | first_slot = -1; | |
1171 | last_slot = -1; | |
1172 | goto alloc_done; | |
1173 | } | |
1174 | else if (reg_size | |
1175 | && !interrupt_p | |
1176 | && reg_size < (unsigned HOST_WIDE_INT) epiphany_stack_offset) | |
1177 | reg_size = epiphany_stack_offset; | |
1178 | if (interrupt_p) | |
1179 | { | |
1180 | if (total_size + reg_size < 0x3fc) | |
1181 | { | |
1182 | first_slot_offset = EPIPHANY_STACK_ALIGN (total_size + reg_size); | |
1183 | first_slot_offset += EPIPHANY_STACK_ALIGN (epiphany_stack_offset); | |
1184 | last_slot = -1; | |
1185 | } | |
1186 | else | |
1187 | { | |
1188 | first_slot_offset = EPIPHANY_STACK_ALIGN (reg_size); | |
1189 | last_slot_offset = EPIPHANY_STACK_ALIGN (total_size); | |
1190 | last_slot_offset += EPIPHANY_STACK_ALIGN (epiphany_stack_offset); | |
1191 | if (last_slot >= 0) | |
1192 | CLEAR_HARD_REG_BIT (gmask, last_slot); | |
1193 | } | |
1194 | } | |
1195 | else if (total_size + reg_size < 0x1ffc && first_slot >= 0) | |
1196 | { | |
1197 | first_slot_offset = EPIPHANY_STACK_ALIGN (total_size + reg_size); | |
1198 | last_slot = -1; | |
1199 | } | |
1200 | else | |
1201 | { | |
1202 | if (total_size + reg_size <= (unsigned) epiphany_stack_offset) | |
1203 | { | |
1204 | gcc_assert (first_slot < 0); | |
160051af | 1205 | gcc_assert (reg_size == 0 || (int) reg_size == epiphany_stack_offset); |
feeeff5c JR |
1206 | last_slot_offset = EPIPHANY_STACK_ALIGN (total_size + reg_size); |
1207 | } | |
1208 | else | |
1209 | { | |
1210 | first_slot_offset | |
1211 | = (reg_size | |
1212 | ? EPIPHANY_STACK_ALIGN (reg_size - epiphany_stack_offset) : 0); | |
1213 | if (!first_slot_offset) | |
1214 | { | |
1215 | if (first_slot != GPR_FP || !current_frame_info.need_fp) | |
1216 | last_slot = first_slot; | |
1217 | first_slot = -1; | |
1218 | } | |
1219 | last_slot_offset = EPIPHANY_STACK_ALIGN (total_size); | |
1220 | if (reg_size) | |
1221 | last_slot_offset += EPIPHANY_STACK_ALIGN (epiphany_stack_offset); | |
1222 | } | |
1223 | if (last_slot >= 0) | |
1224 | CLEAR_HARD_REG_BIT (gmask, last_slot); | |
1225 | } | |
1226 | alloc_done: | |
1227 | if (first_slot >= 0) | |
1228 | { | |
1229 | CLEAR_HARD_REG_BIT (gmask, first_slot); | |
1230 | if (TEST_HARD_REG_BIT (gmask, first_slot ^ 1) | |
1231 | && epiphany_stack_offset - pretend_size >= 2 * UNITS_PER_WORD) | |
1232 | { | |
1233 | CLEAR_HARD_REG_BIT (gmask, first_slot ^ 1); | |
1234 | first_slot_size = 2 * UNITS_PER_WORD; | |
1235 | first_slot &= ~1; | |
1236 | } | |
1237 | } | |
1238 | total_size = first_slot_offset + last_slot_offset; | |
1239 | ||
feeeff5c JR |
1240 | /* Save computed information. */ |
1241 | current_frame_info.total_size = total_size; | |
1242 | current_frame_info.pretend_size = pretend_size; | |
1243 | current_frame_info.var_size = var_size; | |
1244 | current_frame_info.args_size = args_size; | |
1245 | current_frame_info.reg_size = reg_size; | |
1246 | COPY_HARD_REG_SET (current_frame_info.gmask, gmask); | |
1247 | current_frame_info.first_slot = first_slot; | |
1248 | current_frame_info.last_slot = last_slot; | |
1249 | current_frame_info.first_slot_offset = first_slot_offset; | |
1250 | current_frame_info.first_slot_size = first_slot_size; | |
1251 | current_frame_info.last_slot_offset = last_slot_offset; | |
feeeff5c JR |
1252 | |
1253 | current_frame_info.initialized = reload_completed; | |
1254 | ||
1255 | /* Ok, we're done. */ | |
1256 | return total_size; | |
1257 | } | |
1258 | \f | |
1259 | /* Print operand X (an rtx) in assembler syntax to file FILE. | |
1260 | CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified. | |
1261 | For `%' followed by punctuation, CODE is the punctuation and X is null. */ | |
1262 | ||
1263 | static void | |
1264 | epiphany_print_operand (FILE *file, rtx x, int code) | |
1265 | { | |
1266 | switch (code) | |
1267 | { | |
1268 | case 'd': | |
1269 | fputs (epiphany_condition_codes[get_epiphany_condition_code (x)], file); | |
1270 | return; | |
1271 | case 'D': | |
1272 | fputs (epiphany_condition_codes[EPIPHANY_INVERSE_CONDITION_CODE | |
1273 | (get_epiphany_condition_code (x))], | |
1274 | file); | |
1275 | return; | |
1276 | ||
1277 | case 'X': | |
1278 | current_frame_info.stld_sz = 8; | |
1279 | break; | |
1280 | ||
1281 | case 'C' : | |
1282 | current_frame_info.stld_sz = 4; | |
1283 | break; | |
1284 | ||
1285 | case 'c' : | |
1286 | current_frame_info.stld_sz = 2; | |
1287 | break; | |
1288 | ||
1289 | case 'f': | |
1290 | fputs (REG_P (x) ? "jalr " : "bl ", file); | |
1291 | break; | |
1292 | ||
1293 | case '-': | |
1294 | fprintf (file, "r%d", epiphany_m1reg); | |
1295 | return; | |
1296 | ||
1297 | case 0 : | |
1298 | /* Do nothing special. */ | |
1299 | break; | |
1300 | default : | |
1301 | /* Unknown flag. */ | |
1302 | output_operand_lossage ("invalid operand output code"); | |
1303 | } | |
1304 | ||
1305 | switch (GET_CODE (x)) | |
1306 | { | |
1307 | rtx addr; | |
1308 | rtx offset; | |
1309 | ||
1310 | case REG : | |
1311 | fputs (reg_names[REGNO (x)], file); | |
1312 | break; | |
1313 | case MEM : | |
1314 | if (code == 0) | |
1315 | current_frame_info.stld_sz = 1; | |
1316 | fputc ('[', file); | |
1317 | addr = XEXP (x, 0); | |
1318 | switch (GET_CODE (addr)) | |
1319 | { | |
1320 | case POST_INC: | |
1321 | offset = GEN_INT (GET_MODE_SIZE (GET_MODE (x))); | |
1322 | addr = XEXP (addr, 0); | |
1323 | break; | |
1324 | case POST_DEC: | |
1325 | offset = GEN_INT (-GET_MODE_SIZE (GET_MODE (x))); | |
1326 | addr = XEXP (addr, 0); | |
1327 | break; | |
1328 | case POST_MODIFY: | |
1329 | offset = XEXP (XEXP (addr, 1), 1); | |
1330 | addr = XEXP (addr, 0); | |
1331 | break; | |
1332 | default: | |
1333 | offset = 0; | |
1334 | break; | |
1335 | } | |
1336 | output_address (addr); | |
1337 | fputc (']', file); | |
1338 | if (offset) | |
1339 | { | |
1340 | fputc (',', file); | |
1341 | if (CONST_INT_P (offset)) switch (GET_MODE_SIZE (GET_MODE (x))) | |
1342 | { | |
1343 | default: | |
1344 | gcc_unreachable (); | |
1345 | case 8: | |
1346 | offset = GEN_INT (INTVAL (offset) >> 3); | |
1347 | break; | |
1348 | case 4: | |
1349 | offset = GEN_INT (INTVAL (offset) >> 2); | |
1350 | break; | |
1351 | case 2: | |
1352 | offset = GEN_INT (INTVAL (offset) >> 1); | |
1353 | break; | |
1354 | case 1: | |
1355 | break; | |
1356 | } | |
1357 | output_address (offset); | |
1358 | } | |
1359 | break; | |
1360 | case CONST_DOUBLE : | |
1361 | /* We handle SFmode constants here as output_addr_const doesn't. */ | |
1362 | if (GET_MODE (x) == SFmode) | |
1363 | { | |
1364 | REAL_VALUE_TYPE d; | |
1365 | long l; | |
1366 | ||
1367 | REAL_VALUE_FROM_CONST_DOUBLE (d, x); | |
1368 | REAL_VALUE_TO_TARGET_SINGLE (d, l); | |
1369 | fprintf (file, "%s0x%08lx", IMMEDIATE_PREFIX, l); | |
1370 | break; | |
1371 | } | |
1372 | /* Fall through. Let output_addr_const deal with it. */ | |
1373 | case CONST_INT: | |
1374 | fprintf(file,"%s",IMMEDIATE_PREFIX); | |
1375 | if (code == 'C' || code == 'X') | |
1376 | { | |
1377 | fprintf (file, "%ld", | |
1378 | (long) (INTVAL (x) / current_frame_info.stld_sz)); | |
1379 | break; | |
1380 | } | |
1381 | /* Fall through */ | |
1382 | default : | |
1383 | output_addr_const (file, x); | |
1384 | break; | |
1385 | } | |
1386 | } | |
1387 | ||
1388 | /* Print a memory address as an operand to reference that memory location. */ | |
1389 | ||
1390 | static void | |
1391 | epiphany_print_operand_address (FILE *file, rtx addr) | |
1392 | { | |
1393 | register rtx base, index = 0; | |
1394 | int offset = 0; | |
1395 | ||
1396 | switch (GET_CODE (addr)) | |
1397 | { | |
1398 | case REG : | |
1399 | fputs (reg_names[REGNO (addr)], file); | |
1400 | break; | |
1401 | case SYMBOL_REF : | |
1402 | if (/*???*/ 0 && SYMBOL_REF_FUNCTION_P (addr)) | |
1403 | { | |
1404 | output_addr_const (file, addr); | |
1405 | } | |
1406 | else | |
1407 | { | |
1408 | output_addr_const (file, addr); | |
1409 | } | |
1410 | break; | |
1411 | case PLUS : | |
1412 | if (GET_CODE (XEXP (addr, 0)) == CONST_INT) | |
1413 | offset = INTVAL (XEXP (addr, 0)), base = XEXP (addr, 1); | |
1414 | else if (GET_CODE (XEXP (addr, 1)) == CONST_INT) | |
1415 | offset = INTVAL (XEXP (addr, 1)), base = XEXP (addr, 0); | |
1416 | else | |
1417 | base = XEXP (addr, 0), index = XEXP (addr, 1); | |
1418 | gcc_assert (GET_CODE (base) == REG); | |
1419 | fputs (reg_names[REGNO (base)], file); | |
1420 | if (index == 0) | |
1421 | { | |
1422 | /* | |
1423 | ** ++rk quirky method to scale offset for ld/str....... | |
1424 | */ | |
1425 | fprintf (file, ",%s%d", IMMEDIATE_PREFIX, | |
1426 | offset/current_frame_info.stld_sz); | |
1427 | } | |
1428 | else | |
1429 | { | |
1430 | switch (GET_CODE (index)) | |
1431 | { | |
1432 | case REG: | |
1433 | fprintf (file, ",%s", reg_names[REGNO (index)]); | |
1434 | break; | |
1435 | case SYMBOL_REF: | |
1436 | fputc (',', file), output_addr_const (file, index); | |
1437 | break; | |
1438 | default: | |
1439 | gcc_unreachable (); | |
1440 | } | |
1441 | } | |
1442 | break; | |
1443 | case PRE_INC: case PRE_DEC: case POST_INC: case POST_DEC: case POST_MODIFY: | |
1444 | /* We shouldn't get here as we've lost the mode of the memory object | |
1445 | (which says how much to inc/dec by. */ | |
1446 | gcc_unreachable (); | |
1447 | break; | |
1448 | default: | |
1449 | output_addr_const (file, addr); | |
1450 | break; | |
1451 | } | |
1452 | } | |
1453 | ||
1454 | void | |
bcfba653 | 1455 | epiphany_final_prescan_insn (rtx_insn *insn ATTRIBUTE_UNUSED, |
feeeff5c JR |
1456 | rtx *opvec ATTRIBUTE_UNUSED, |
1457 | int noperands ATTRIBUTE_UNUSED) | |
1458 | { | |
1459 | int i = epiphany_n_nops; | |
1460 | rtx pat ATTRIBUTE_UNUSED; | |
1461 | ||
1462 | while (i--) | |
1463 | fputs ("\tnop\n", asm_out_file); | |
1464 | } | |
1465 | ||
1466 | \f | |
1467 | /* Worker function for TARGET_RETURN_IN_MEMORY. */ | |
1468 | ||
1469 | static bool | |
1470 | epiphany_return_in_memory (const_tree type, const_tree fntype ATTRIBUTE_UNUSED) | |
1471 | { | |
1472 | HOST_WIDE_INT size = int_size_in_bytes (type); | |
1473 | ||
1474 | if (AGGREGATE_TYPE_P (type) | |
1475 | && (TYPE_MODE (type) == BLKmode || TYPE_NEEDS_CONSTRUCTING (type))) | |
1476 | return true; | |
1477 | return (size == -1 || size > 8); | |
1478 | } | |
1479 | ||
1480 | /* For EPIPHANY, All aggregates and arguments greater than 8 bytes are | |
1481 | passed by reference. */ | |
1482 | ||
1483 | static bool | |
1484 | epiphany_pass_by_reference (cumulative_args_t ca ATTRIBUTE_UNUSED, | |
ef4bddc2 | 1485 | machine_mode mode, const_tree type, |
feeeff5c JR |
1486 | bool named ATTRIBUTE_UNUSED) |
1487 | { | |
1488 | if (type) | |
1489 | { | |
1490 | if (AGGREGATE_TYPE_P (type) | |
1491 | && (mode == BLKmode || TYPE_NEEDS_CONSTRUCTING (type))) | |
1492 | return true; | |
1493 | } | |
1494 | return false; | |
1495 | } | |
1496 | ||
1497 | ||
1498 | static rtx | |
1499 | epiphany_function_value (const_tree ret_type, | |
1500 | const_tree fn_decl_or_type ATTRIBUTE_UNUSED, | |
1501 | bool outgoing ATTRIBUTE_UNUSED) | |
1502 | { | |
ef4bddc2 | 1503 | machine_mode mode; |
feeeff5c JR |
1504 | |
1505 | mode = TYPE_MODE (ret_type); | |
1506 | /* We must change the mode like PROMOTE_MODE does. | |
1507 | ??? PROMOTE_MODE is ignored for non-scalar types. | |
1508 | The set of types tested here has to be kept in sync | |
1509 | with the one in explow.c:promote_mode. */ | |
1510 | if (GET_MODE_CLASS (mode) == MODE_INT | |
1511 | && GET_MODE_SIZE (mode) < 4 | |
1512 | && (TREE_CODE (ret_type) == INTEGER_TYPE | |
1513 | || TREE_CODE (ret_type) == ENUMERAL_TYPE | |
1514 | || TREE_CODE (ret_type) == BOOLEAN_TYPE | |
1515 | || TREE_CODE (ret_type) == OFFSET_TYPE)) | |
1516 | mode = SImode; | |
1517 | return gen_rtx_REG (mode, 0); | |
1518 | } | |
1519 | ||
1520 | static rtx | |
ef4bddc2 | 1521 | epiphany_libcall_value (machine_mode mode, const_rtx fun ATTRIBUTE_UNUSED) |
feeeff5c JR |
1522 | { |
1523 | return gen_rtx_REG (mode, 0); | |
1524 | } | |
1525 | ||
1565f169 | 1526 | static bool |
feeeff5c JR |
1527 | epiphany_function_value_regno_p (const unsigned int regno ATTRIBUTE_UNUSED) |
1528 | { | |
1529 | return regno == 0; | |
1530 | } | |
1531 | ||
1532 | /* Fix up invalid option settings. */ | |
1533 | static void | |
1534 | epiphany_override_options (void) | |
1535 | { | |
1536 | if (epiphany_stack_offset < 4) | |
1537 | error ("stack_offset must be at least 4"); | |
1538 | if (epiphany_stack_offset & 3) | |
1539 | error ("stack_offset must be a multiple of 4"); | |
1540 | epiphany_stack_offset = (epiphany_stack_offset + 3) & -4; | |
f577844d JR |
1541 | if (!TARGET_SOFT_CMPSF) |
1542 | flag_finite_math_only = 1; | |
feeeff5c JR |
1543 | |
1544 | /* This needs to be done at start up. It's convenient to do it here. */ | |
1545 | epiphany_init (); | |
1546 | } | |
1547 | ||
1548 | /* For a DImode load / store SET, make a SImode set for a | |
1549 | REG_FRAME_RELATED_EXPR note, using OFFSET to create a high or lowpart | |
1550 | subreg. */ | |
1551 | static rtx | |
1552 | frame_subreg_note (rtx set, int offset) | |
1553 | { | |
1554 | rtx src = simplify_gen_subreg (SImode, SET_SRC (set), DImode, offset); | |
1555 | rtx dst = simplify_gen_subreg (SImode, SET_DEST (set), DImode, offset); | |
1556 | ||
f7df4a84 | 1557 | set = gen_rtx_SET (dst ,src); |
feeeff5c JR |
1558 | RTX_FRAME_RELATED_P (set) = 1; |
1559 | return set; | |
1560 | } | |
1561 | ||
bcfba653 | 1562 | static rtx_insn * |
feeeff5c JR |
1563 | frame_insn (rtx x) |
1564 | { | |
1565 | int i; | |
1566 | rtx note = NULL_RTX; | |
bcfba653 | 1567 | rtx_insn *insn; |
feeeff5c JR |
1568 | |
1569 | if (GET_CODE (x) == PARALLEL) | |
1570 | { | |
1571 | rtx part = XVECEXP (x, 0, 0); | |
1572 | ||
1573 | if (GET_MODE (SET_DEST (part)) == DImode) | |
1574 | { | |
1575 | note = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (XVECLEN (x, 0) + 1)); | |
1576 | XVECEXP (note, 0, 0) = frame_subreg_note (part, 0); | |
1577 | XVECEXP (note, 0, 1) = frame_subreg_note (part, UNITS_PER_WORD); | |
1578 | for (i = XVECLEN (x, 0) - 1; i >= 1; i--) | |
1579 | { | |
1580 | part = copy_rtx (XVECEXP (x, 0, i)); | |
1581 | ||
1582 | if (GET_CODE (part) == SET) | |
1583 | RTX_FRAME_RELATED_P (part) = 1; | |
1584 | XVECEXP (note, 0, i + 1) = part; | |
1585 | } | |
1586 | } | |
1587 | else | |
1588 | { | |
1589 | for (i = XVECLEN (x, 0) - 1; i >= 0; i--) | |
1590 | { | |
1591 | part = XVECEXP (x, 0, i); | |
1592 | ||
1593 | if (GET_CODE (part) == SET) | |
1594 | RTX_FRAME_RELATED_P (part) = 1; | |
1595 | } | |
1596 | } | |
1597 | } | |
1598 | else if (GET_CODE (x) == SET && GET_MODE (SET_DEST (x)) == DImode) | |
1599 | note = gen_rtx_PARALLEL (VOIDmode, | |
1600 | gen_rtvec (2, frame_subreg_note (x, 0), | |
1601 | frame_subreg_note (x, UNITS_PER_WORD))); | |
bcfba653 DM |
1602 | insn = emit_insn (x); |
1603 | RTX_FRAME_RELATED_P (insn) = 1; | |
feeeff5c | 1604 | if (note) |
bcfba653 DM |
1605 | add_reg_note (insn, REG_FRAME_RELATED_EXPR, note); |
1606 | return insn; | |
feeeff5c JR |
1607 | } |
1608 | ||
bcfba653 | 1609 | static rtx_insn * |
feeeff5c JR |
1610 | frame_move_insn (rtx to, rtx from) |
1611 | { | |
f7df4a84 | 1612 | return frame_insn (gen_rtx_SET (to, from)); |
feeeff5c JR |
1613 | } |
1614 | ||
1615 | /* Generate a MEM referring to a varargs argument slot. */ | |
1616 | ||
1617 | static rtx | |
ef4bddc2 | 1618 | gen_varargs_mem (machine_mode mode, rtx addr) |
feeeff5c JR |
1619 | { |
1620 | rtx mem = gen_rtx_MEM (mode, addr); | |
1621 | MEM_NOTRAP_P (mem) = 1; | |
1622 | set_mem_alias_set (mem, get_varargs_alias_set ()); | |
1623 | return mem; | |
1624 | } | |
1625 | ||
1626 | /* Emit instructions to save or restore registers in the range [MIN..LIMIT) . | |
1627 | If EPILOGUE_P is 0, save; if it is one, restore. | |
1628 | ADDR is the stack slot to save the first register to; subsequent | |
1629 | registers are written to lower addresses. | |
1630 | However, the order of register pairs can be reversed in order to | |
1631 | use double-word load-store instructions. Likewise, an unpaired single | |
1632 | word save slot can be skipped while double saves are carried out, and | |
1633 | reused when a single register is to be saved. */ | |
1634 | ||
1635 | static void | |
1636 | epiphany_emit_save_restore (int min, int limit, rtx addr, int epilogue_p) | |
1637 | { | |
1638 | int i; | |
1639 | int stack_offset | |
1640 | = current_frame_info.first_slot >= 0 ? epiphany_stack_offset : 0; | |
1641 | rtx skipped_mem = NULL_RTX; | |
1642 | int last_saved = limit - 1; | |
1643 | ||
1644 | if (!optimize) | |
1645 | while (last_saved >= 0 | |
1646 | && !TEST_HARD_REG_BIT (current_frame_info.gmask, last_saved)) | |
1647 | last_saved--; | |
1648 | for (i = 0; i < limit; i++) | |
1649 | { | |
ef4bddc2 | 1650 | machine_mode mode = word_mode; |
feeeff5c JR |
1651 | rtx mem, reg; |
1652 | int n = i; | |
ef4bddc2 | 1653 | rtx (*gen_mem) (machine_mode, rtx) = gen_frame_mem; |
feeeff5c JR |
1654 | |
1655 | /* Make sure we push the arguments in the right order. */ | |
1656 | if (n < MAX_EPIPHANY_PARM_REGS && crtl->args.pretend_args_size) | |
1657 | { | |
1658 | n = MAX_EPIPHANY_PARM_REGS - 1 - n; | |
1659 | gen_mem = gen_varargs_mem; | |
1660 | } | |
1661 | if (stack_offset == current_frame_info.first_slot_size | |
1662 | && current_frame_info.first_slot >= 0) | |
1663 | { | |
1664 | if (current_frame_info.first_slot_size > UNITS_PER_WORD) | |
1665 | { | |
1666 | mode = DImode; | |
0a81f074 RS |
1667 | addr = plus_constant (Pmode, addr, |
1668 | - (HOST_WIDE_INT) UNITS_PER_WORD); | |
feeeff5c JR |
1669 | } |
1670 | if (i-- < min || !epilogue_p) | |
1671 | goto next_slot; | |
1672 | n = current_frame_info.first_slot; | |
1673 | gen_mem = gen_frame_mem; | |
1674 | } | |
1675 | else if (n == UNKNOWN_REGNUM | |
1676 | && stack_offset > current_frame_info.first_slot_size) | |
1677 | { | |
1678 | i--; | |
1679 | goto next_slot; | |
1680 | } | |
1681 | else if (!TEST_HARD_REG_BIT (current_frame_info.gmask, n)) | |
1682 | continue; | |
1683 | else if (i < min) | |
1684 | goto next_slot; | |
1685 | ||
1686 | /* Check for a register pair to save. */ | |
1687 | if (n == i | |
1688 | && (n >= MAX_EPIPHANY_PARM_REGS || crtl->args.pretend_args_size == 0) | |
1689 | && (n & 1) == 0 && n+1 < limit | |
1690 | && TEST_HARD_REG_BIT (current_frame_info.gmask, n+1)) | |
1691 | { | |
1692 | /* If it fits in the current stack slot pair, place it there. */ | |
1693 | if (GET_CODE (addr) == PLUS && (stack_offset & 7) == 0 | |
1694 | && stack_offset != 2 * UNITS_PER_WORD | |
1695 | && (current_frame_info.last_slot < 0 | |
1696 | || INTVAL (XEXP (addr, 1)) != UNITS_PER_WORD) | |
1697 | && (n+1 != last_saved || !skipped_mem)) | |
1698 | { | |
1699 | mode = DImode; | |
1700 | i++; | |
0a81f074 RS |
1701 | addr = plus_constant (Pmode, addr, |
1702 | - (HOST_WIDE_INT) UNITS_PER_WORD); | |
feeeff5c JR |
1703 | } |
1704 | /* If it fits in the following stack slot pair, that's fine, too. */ | |
1705 | else if (GET_CODE (addr) == PLUS && (stack_offset & 7) == 4 | |
1706 | && stack_offset != 2 * UNITS_PER_WORD | |
1707 | && stack_offset != 3 * UNITS_PER_WORD | |
1708 | && (current_frame_info.last_slot < 0 | |
1709 | || INTVAL (XEXP (addr, 1)) != 2 * UNITS_PER_WORD) | |
1710 | && n + 1 != last_saved) | |
1711 | { | |
1712 | gcc_assert (!skipped_mem); | |
1713 | stack_offset -= GET_MODE_SIZE (mode); | |
1714 | skipped_mem = gen_mem (mode, addr); | |
1715 | mode = DImode; | |
1716 | i++; | |
0a81f074 RS |
1717 | addr = plus_constant (Pmode, addr, |
1718 | - (HOST_WIDE_INT) 2 * UNITS_PER_WORD); | |
feeeff5c JR |
1719 | } |
1720 | } | |
1721 | reg = gen_rtx_REG (mode, n); | |
1722 | if (mode != DImode && skipped_mem) | |
1723 | mem = skipped_mem; | |
1724 | else | |
1725 | mem = gen_mem (mode, addr); | |
3b088b47 JR |
1726 | |
1727 | /* If we are loading / storing LR, note the offset that | |
1728 | gen_reload_insi_ra requires. Since GPR_LR is even, | |
1729 | we only need to test n, even if mode is DImode. */ | |
1730 | gcc_assert ((GPR_LR & 1) == 0); | |
1731 | if (n == GPR_LR) | |
1732 | { | |
1733 | long lr_slot_offset = 0; | |
1734 | rtx m_addr = XEXP (mem, 0); | |
1735 | ||
1736 | if (GET_CODE (m_addr) == PLUS) | |
1737 | lr_slot_offset = INTVAL (XEXP (m_addr, 1)); | |
1738 | if (frame_pointer_needed) | |
1739 | lr_slot_offset += (current_frame_info.first_slot_offset | |
1740 | - current_frame_info.total_size); | |
1741 | if (MACHINE_FUNCTION (cfun)->lr_slot_known) | |
1742 | gcc_assert (MACHINE_FUNCTION (cfun)->lr_slot_offset | |
1743 | == lr_slot_offset); | |
1744 | MACHINE_FUNCTION (cfun)->lr_slot_offset = lr_slot_offset; | |
1745 | MACHINE_FUNCTION (cfun)->lr_slot_known = 1; | |
1746 | } | |
1747 | ||
feeeff5c JR |
1748 | if (!epilogue_p) |
1749 | frame_move_insn (mem, reg); | |
1750 | else if (n >= MAX_EPIPHANY_PARM_REGS || !crtl->args.pretend_args_size) | |
1751 | emit_move_insn (reg, mem); | |
1752 | if (mem == skipped_mem) | |
1753 | { | |
1754 | skipped_mem = NULL_RTX; | |
1755 | continue; | |
1756 | } | |
1757 | next_slot: | |
0a81f074 | 1758 | addr = plus_constant (Pmode, addr, -(HOST_WIDE_INT) UNITS_PER_WORD); |
feeeff5c JR |
1759 | stack_offset -= GET_MODE_SIZE (mode); |
1760 | } | |
1761 | } | |
1762 | ||
1763 | void | |
1764 | epiphany_expand_prologue (void) | |
1765 | { | |
1766 | int interrupt_p; | |
1767 | enum epiphany_function_type fn_type; | |
1768 | rtx addr, mem, off, reg; | |
feeeff5c JR |
1769 | |
1770 | if (!current_frame_info.initialized) | |
1771 | epiphany_compute_frame_size (get_frame_size ()); | |
1772 | ||
1773 | /* It is debatable if we should adjust this by epiphany_stack_offset. */ | |
1774 | if (flag_stack_usage_info) | |
1775 | current_function_static_stack_size = current_frame_info.total_size; | |
1776 | ||
1777 | fn_type = epiphany_compute_function_type (current_function_decl); | |
1778 | interrupt_p = EPIPHANY_INTERRUPT_P (fn_type); | |
1779 | ||
1780 | if (interrupt_p) | |
1781 | { | |
0a81f074 | 1782 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c | 1783 | - (HOST_WIDE_INT) 2 * UNITS_PER_WORD); |
60098013 JR |
1784 | if (!lookup_attribute ("forwarder_section", |
1785 | DECL_ATTRIBUTES (current_function_decl)) | |
1786 | || !epiphany_is_long_call_p (XEXP (DECL_RTL (current_function_decl), | |
1787 | 0))) | |
1788 | frame_move_insn (gen_frame_mem (DImode, addr), | |
1789 | gen_rtx_REG (DImode, GPR_0)); | |
feeeff5c JR |
1790 | frame_move_insn (gen_rtx_REG (SImode, GPR_0), |
1791 | gen_rtx_REG (word_mode, STATUS_REGNUM)); | |
105766f3 | 1792 | frame_move_insn (gen_rtx_REG (SImode, GPR_1), |
feeeff5c JR |
1793 | gen_rtx_REG (word_mode, IRET_REGNUM)); |
1794 | mem = gen_frame_mem (BLKmode, stack_pointer_rtx); | |
1795 | off = GEN_INT (-current_frame_info.first_slot_offset); | |
1796 | frame_insn (gen_stack_adjust_add (off, mem)); | |
1797 | if (!epiphany_uninterruptible_p (current_function_decl)) | |
1798 | emit_insn (gen_gie ()); | |
0a81f074 | 1799 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c JR |
1800 | current_frame_info.first_slot_offset |
1801 | - (HOST_WIDE_INT) 3 * UNITS_PER_WORD); | |
1802 | } | |
1803 | else | |
1804 | { | |
0a81f074 | 1805 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c JR |
1806 | epiphany_stack_offset |
1807 | - (HOST_WIDE_INT) UNITS_PER_WORD); | |
1808 | epiphany_emit_save_restore (0, current_frame_info.small_threshold, | |
1809 | addr, 0); | |
1810 | /* Allocate register save area; for small to medium size frames, | |
1811 | allocate the entire frame; this is joint with one register save. */ | |
1812 | if (current_frame_info.first_slot >= 0) | |
1813 | { | |
ef4bddc2 | 1814 | machine_mode mode |
feeeff5c JR |
1815 | = (current_frame_info.first_slot_size == UNITS_PER_WORD |
1816 | ? word_mode : DImode); | |
1817 | ||
1818 | off = GEN_INT (-current_frame_info.first_slot_offset); | |
1819 | mem = gen_frame_mem (BLKmode, | |
1820 | gen_rtx_PLUS (Pmode, stack_pointer_rtx, off)); | |
1821 | frame_insn (gen_stack_adjust_str | |
1822 | (gen_frame_mem (mode, stack_pointer_rtx), | |
1823 | gen_rtx_REG (mode, current_frame_info.first_slot), | |
1824 | off, mem)); | |
0a81f074 RS |
1825 | addr = plus_constant (Pmode, addr, |
1826 | current_frame_info.first_slot_offset); | |
feeeff5c JR |
1827 | } |
1828 | } | |
1829 | epiphany_emit_save_restore (current_frame_info.small_threshold, | |
1830 | FIRST_PSEUDO_REGISTER, addr, 0); | |
1831 | if (current_frame_info.need_fp) | |
1832 | frame_move_insn (hard_frame_pointer_rtx, stack_pointer_rtx); | |
1833 | /* For large frames, allocate bulk of frame. This is usually joint with one | |
1834 | register save. */ | |
1835 | if (current_frame_info.last_slot >= 0) | |
1836 | { | |
bcfba653 DM |
1837 | rtx ip, mem2, note; |
1838 | rtx_insn *insn; | |
d4bca93c | 1839 | |
feeeff5c JR |
1840 | gcc_assert (current_frame_info.last_slot != GPR_FP |
1841 | || (!current_frame_info.need_fp | |
1842 | && current_frame_info.first_slot < 0)); | |
1843 | off = GEN_INT (-current_frame_info.last_slot_offset); | |
1844 | mem = gen_frame_mem (BLKmode, | |
1845 | gen_rtx_PLUS (Pmode, stack_pointer_rtx, off)); | |
d4bca93c JR |
1846 | ip = gen_rtx_REG (Pmode, GPR_IP); |
1847 | frame_move_insn (ip, off); | |
1848 | reg = gen_rtx_REG (word_mode, current_frame_info.last_slot), | |
1849 | mem2 = gen_frame_mem (word_mode, stack_pointer_rtx), | |
1850 | insn = frame_insn (gen_stack_adjust_str (mem2, reg, ip, mem)); | |
1851 | /* Instruction scheduling can separate the instruction setting IP from | |
1852 | INSN so that dwarf2out_frame_debug_expr becomes confused what the | |
1853 | temporary register is. Example: _gcov.o */ | |
f7df4a84 | 1854 | note = gen_rtx_SET (stack_pointer_rtx, |
d4bca93c JR |
1855 | gen_rtx_PLUS (Pmode, stack_pointer_rtx, off)); |
1856 | note = gen_rtx_PARALLEL (VOIDmode, | |
f7df4a84 | 1857 | gen_rtvec (2, gen_rtx_SET (mem2, reg), note)); |
d4bca93c | 1858 | add_reg_note (insn, REG_FRAME_RELATED_EXPR, note); |
feeeff5c JR |
1859 | } |
1860 | /* If there is only one or no register to save, yet we have a large frame, | |
1861 | use an add. */ | |
1862 | else if (current_frame_info.last_slot_offset) | |
1863 | { | |
1864 | mem = gen_frame_mem (BLKmode, | |
0a81f074 | 1865 | plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c JR |
1866 | current_frame_info.last_slot_offset)); |
1867 | off = GEN_INT (-current_frame_info.last_slot_offset); | |
1868 | if (!SIMM11 (INTVAL (off))) | |
1869 | { | |
1870 | reg = gen_rtx_REG (Pmode, GPR_IP); | |
1871 | frame_move_insn (reg, off); | |
1872 | off = reg; | |
1873 | } | |
1874 | frame_insn (gen_stack_adjust_add (off, mem)); | |
1875 | } | |
feeeff5c JR |
1876 | } |
1877 | ||
1878 | void | |
1879 | epiphany_expand_epilogue (int sibcall_p) | |
1880 | { | |
1881 | int interrupt_p; | |
1882 | enum epiphany_function_type fn_type; | |
1883 | rtx mem, addr, reg, off; | |
1884 | HOST_WIDE_INT restore_offset; | |
1885 | ||
1886 | fn_type = epiphany_compute_function_type( current_function_decl); | |
1887 | interrupt_p = EPIPHANY_INTERRUPT_P (fn_type); | |
1888 | ||
1889 | /* For variable frames, deallocate bulk of frame. */ | |
1890 | if (current_frame_info.need_fp) | |
1891 | { | |
1892 | mem = gen_frame_mem (BLKmode, stack_pointer_rtx); | |
1893 | emit_insn (gen_stack_adjust_mov (mem)); | |
1894 | } | |
1895 | /* Else for large static frames, deallocate bulk of frame. */ | |
1896 | else if (current_frame_info.last_slot_offset) | |
1897 | { | |
1898 | mem = gen_frame_mem (BLKmode, stack_pointer_rtx); | |
1899 | reg = gen_rtx_REG (Pmode, GPR_IP); | |
1900 | emit_move_insn (reg, GEN_INT (current_frame_info.last_slot_offset)); | |
1901 | emit_insn (gen_stack_adjust_add (reg, mem)); | |
1902 | } | |
1903 | restore_offset = (interrupt_p | |
1904 | ? - 3 * UNITS_PER_WORD | |
1905 | : epiphany_stack_offset - (HOST_WIDE_INT) UNITS_PER_WORD); | |
0a81f074 | 1906 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c JR |
1907 | (current_frame_info.first_slot_offset |
1908 | + restore_offset)); | |
1909 | epiphany_emit_save_restore (current_frame_info.small_threshold, | |
1910 | FIRST_PSEUDO_REGISTER, addr, 1); | |
1911 | ||
1912 | if (interrupt_p && !epiphany_uninterruptible_p (current_function_decl)) | |
1913 | emit_insn (gen_gid ()); | |
1914 | ||
1915 | off = GEN_INT (current_frame_info.first_slot_offset); | |
1916 | mem = gen_frame_mem (BLKmode, stack_pointer_rtx); | |
1917 | /* For large / variable size frames, deallocating the register save area is | |
1918 | joint with one register restore; for medium size frames, we use a | |
1919 | dummy post-increment load to dealloacte the whole frame. */ | |
1920 | if (!SIMM11 (INTVAL (off)) || current_frame_info.last_slot >= 0) | |
1921 | { | |
1922 | emit_insn (gen_stack_adjust_ldr | |
1923 | (gen_rtx_REG (word_mode, | |
1924 | (current_frame_info.last_slot >= 0 | |
1925 | ? current_frame_info.last_slot : GPR_IP)), | |
1926 | gen_frame_mem (word_mode, stack_pointer_rtx), | |
1927 | off, | |
1928 | mem)); | |
1929 | } | |
1930 | /* While for small frames, we deallocate the entire frame with one add. */ | |
1931 | else if (INTVAL (off)) | |
1932 | { | |
1933 | emit_insn (gen_stack_adjust_add (off, mem)); | |
1934 | } | |
1935 | if (interrupt_p) | |
1936 | { | |
188b7e23 JR |
1937 | emit_move_insn (gen_rtx_REG (word_mode, STATUS_REGNUM), |
1938 | gen_rtx_REG (SImode, GPR_0)); | |
1939 | emit_move_insn (gen_rtx_REG (word_mode, IRET_REGNUM), | |
105766f3 | 1940 | gen_rtx_REG (SImode, GPR_1)); |
0a81f074 | 1941 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c | 1942 | - (HOST_WIDE_INT) 2 * UNITS_PER_WORD); |
188b7e23 JR |
1943 | emit_move_insn (gen_rtx_REG (DImode, GPR_0), |
1944 | gen_frame_mem (DImode, addr)); | |
feeeff5c | 1945 | } |
0a81f074 | 1946 | addr = plus_constant (Pmode, stack_pointer_rtx, |
feeeff5c JR |
1947 | epiphany_stack_offset - (HOST_WIDE_INT) UNITS_PER_WORD); |
1948 | epiphany_emit_save_restore (0, current_frame_info.small_threshold, addr, 1); | |
1949 | if (!sibcall_p) | |
1950 | { | |
1951 | if (interrupt_p) | |
1952 | emit_jump_insn (gen_return_internal_interrupt()); | |
1953 | else | |
1954 | emit_jump_insn (gen_return_i ()); | |
1955 | } | |
1956 | } | |
1957 | ||
1958 | int | |
1959 | epiphany_initial_elimination_offset (int from, int to) | |
1960 | { | |
1961 | epiphany_compute_frame_size (get_frame_size ()); | |
1962 | if (from == FRAME_POINTER_REGNUM && to == STACK_POINTER_REGNUM) | |
1963 | return current_frame_info.total_size - current_frame_info.reg_size; | |
1964 | if (from == FRAME_POINTER_REGNUM && to == HARD_FRAME_POINTER_REGNUM) | |
1965 | return current_frame_info.first_slot_offset - current_frame_info.reg_size; | |
1966 | if (from == ARG_POINTER_REGNUM && to == STACK_POINTER_REGNUM) | |
1967 | return (current_frame_info.total_size | |
1968 | - ((current_frame_info.pretend_size + 4) & -8)); | |
1969 | if (from == ARG_POINTER_REGNUM && to == HARD_FRAME_POINTER_REGNUM) | |
1970 | return (current_frame_info.first_slot_offset | |
1971 | - ((current_frame_info.pretend_size + 4) & -8)); | |
1972 | gcc_unreachable (); | |
1973 | } | |
1974 | ||
ffcc7caf JR |
1975 | bool |
1976 | epiphany_regno_rename_ok (unsigned, unsigned dst) | |
1977 | { | |
1978 | enum epiphany_function_type fn_type; | |
1979 | ||
1980 | fn_type = epiphany_compute_function_type (current_function_decl); | |
1981 | if (!EPIPHANY_INTERRUPT_P (fn_type)) | |
1982 | return true; | |
1983 | if (df_regs_ever_live_p (dst)) | |
1984 | return true; | |
1985 | return false; | |
1986 | } | |
1987 | ||
feeeff5c JR |
1988 | static int |
1989 | epiphany_issue_rate (void) | |
1990 | { | |
1991 | return 2; | |
1992 | } | |
1993 | ||
1994 | /* Function to update the integer COST | |
1995 | based on the relationship between INSN that is dependent on | |
1996 | DEP_INSN through the dependence LINK. The default is to make no | |
1997 | adjustment to COST. This can be used for example to specify to | |
1998 | the scheduler that an output- or anti-dependence does not incur | |
1999 | the same cost as a data-dependence. The return value should be | |
2000 | the new value for COST. */ | |
2001 | static int | |
ac44248e | 2002 | epiphany_adjust_cost (rtx_insn *insn, rtx link, rtx_insn *dep_insn, int cost) |
feeeff5c JR |
2003 | { |
2004 | if (REG_NOTE_KIND (link) == 0) | |
2005 | { | |
2006 | rtx dep_set; | |
2007 | ||
2008 | if (recog_memoized (insn) < 0 | |
2009 | || recog_memoized (dep_insn) < 0) | |
2010 | return cost; | |
2011 | ||
2012 | dep_set = single_set (dep_insn); | |
2013 | ||
2014 | /* The latency that we specify in the scheduling description refers | |
2015 | to the actual output, not to an auto-increment register; for that, | |
2016 | the latency is one. */ | |
2017 | if (dep_set && MEM_P (SET_SRC (dep_set)) && cost > 1) | |
2018 | { | |
2019 | rtx set = single_set (insn); | |
2020 | ||
2021 | if (set | |
d9b83a68 | 2022 | && !reg_overlap_mentioned_p (SET_DEST (dep_set), SET_SRC (set)) |
feeeff5c | 2023 | && (!MEM_P (SET_DEST (set)) |
d9b83a68 JR |
2024 | || !reg_overlap_mentioned_p (SET_DEST (dep_set), |
2025 | XEXP (SET_DEST (set), 0)))) | |
feeeff5c JR |
2026 | cost = 1; |
2027 | } | |
2028 | } | |
2029 | return cost; | |
2030 | } | |
2031 | ||
2032 | #define REG_OK_FOR_INDEX_P(X) REG_OK_FOR_BASE_P (X) | |
2033 | ||
2034 | #define RTX_OK_FOR_BASE_P(X) \ | |
2035 | (REG_P (X) && REG_OK_FOR_BASE_P (X)) | |
2036 | ||
2037 | #define RTX_OK_FOR_INDEX_P(MODE, X) \ | |
2038 | ((GET_MODE_CLASS (MODE) != MODE_VECTOR_INT \ | |
2039 | || epiphany_vect_align >= GET_MODE_SIZE (MODE)) \ | |
2040 | && (REG_P (X) && REG_OK_FOR_INDEX_P (X))) | |
2041 | ||
2042 | #define LEGITIMATE_OFFSET_ADDRESS_P(MODE, X) \ | |
2043 | (GET_CODE (X) == PLUS \ | |
2044 | && RTX_OK_FOR_BASE_P (XEXP (X, 0)) \ | |
2045 | && (RTX_OK_FOR_INDEX_P (MODE, XEXP (X, 1)) \ | |
2046 | || RTX_OK_FOR_OFFSET_P (MODE, XEXP (X, 1)))) | |
2047 | ||
2048 | static bool | |
ef4bddc2 | 2049 | epiphany_legitimate_address_p (machine_mode mode, rtx x, bool strict) |
feeeff5c JR |
2050 | { |
2051 | #define REG_OK_FOR_BASE_P(X) \ | |
2052 | (strict ? GPR_P (REGNO (X)) : GPR_AP_OR_PSEUDO_P (REGNO (X))) | |
2053 | if (RTX_OK_FOR_BASE_P (x)) | |
2054 | return true; | |
2055 | if (RTX_FRAME_OFFSET_P (x)) | |
2056 | return true; | |
2057 | if (LEGITIMATE_OFFSET_ADDRESS_P (mode, x)) | |
2058 | return true; | |
0ccfc3ab JR |
2059 | /* If this is a misaligned stack access, don't force it to reg+index. */ |
2060 | if (GET_MODE_SIZE (mode) == 8 | |
2061 | && GET_CODE (x) == PLUS && XEXP (x, 0) == stack_pointer_rtx | |
2062 | /* Decomposed to SImode; GET_MODE_SIZE (SImode) == 4 */ | |
2063 | && !(INTVAL (XEXP (x, 1)) & 3) | |
2064 | && INTVAL (XEXP (x, 1)) >= -2047 * 4 | |
2065 | && INTVAL (XEXP (x, 1)) <= 2046 * 4) | |
2066 | return true; | |
feeeff5c JR |
2067 | if (TARGET_POST_INC |
2068 | && (GET_CODE (x) == POST_DEC || GET_CODE (x) == POST_INC) | |
2069 | && RTX_OK_FOR_BASE_P (XEXP ((x), 0))) | |
2070 | return true; | |
2071 | if ((TARGET_POST_MODIFY || reload_completed) | |
2072 | && GET_CODE (x) == POST_MODIFY | |
2073 | && GET_CODE (XEXP ((x), 1)) == PLUS | |
2074 | && rtx_equal_p (XEXP ((x), 0), XEXP (XEXP ((x), 1), 0)) | |
2075 | && LEGITIMATE_OFFSET_ADDRESS_P (mode, XEXP ((x), 1))) | |
2076 | return true; | |
2077 | if (mode == BLKmode) | |
d9bb5800 | 2078 | return epiphany_legitimate_address_p (SImode, x, strict); |
feeeff5c JR |
2079 | return false; |
2080 | } | |
2081 | ||
2082 | static reg_class_t | |
2083 | epiphany_secondary_reload (bool in_p, rtx x, reg_class_t rclass, | |
ef4bddc2 | 2084 | machine_mode mode ATTRIBUTE_UNUSED, |
feeeff5c JR |
2085 | secondary_reload_info *sri) |
2086 | { | |
2087 | /* This could give more reload inheritance, but we are missing some | |
2088 | reload infrastructure. */ | |
2089 | if (0) | |
2090 | if (in_p && GET_CODE (x) == UNSPEC | |
2091 | && satisfies_constraint_Sra (x) && !satisfies_constraint_Rra (x)) | |
2092 | { | |
2093 | gcc_assert (rclass == GENERAL_REGS); | |
2094 | sri->icode = CODE_FOR_reload_insi_ra; | |
2095 | return NO_REGS; | |
2096 | } | |
2097 | return NO_REGS; | |
2098 | } | |
2099 | ||
2100 | bool | |
2101 | epiphany_is_long_call_p (rtx x) | |
2102 | { | |
2103 | tree decl = SYMBOL_REF_DECL (x); | |
2104 | bool ret_val = !TARGET_SHORT_CALLS; | |
2105 | tree attrs; | |
2106 | ||
2107 | /* ??? Is it safe to default to ret_val if decl is NULL? We should | |
2108 | probably encode information via encode_section_info, and also | |
2109 | have (an) option(s) to take SYMBOL_FLAG_LOCAL and/or SYMBOL_FLAG_EXTERNAL | |
2110 | into account. */ | |
2111 | if (decl) | |
2112 | { | |
2113 | attrs = TYPE_ATTRIBUTES (TREE_TYPE (decl)); | |
2114 | if (lookup_attribute ("long_call", attrs)) | |
2115 | ret_val = true; | |
2116 | else if (lookup_attribute ("short_call", attrs)) | |
2117 | ret_val = false; | |
2118 | } | |
2119 | return ret_val; | |
2120 | } | |
2121 | ||
2122 | bool | |
2123 | epiphany_small16 (rtx x) | |
2124 | { | |
2125 | rtx base = x; | |
2126 | rtx offs ATTRIBUTE_UNUSED = const0_rtx; | |
2127 | ||
2128 | if (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS) | |
2129 | { | |
2130 | base = XEXP (XEXP (x, 0), 0); | |
2131 | offs = XEXP (XEXP (x, 0), 1); | |
2132 | } | |
2133 | if (GET_CODE (base) == SYMBOL_REF && SYMBOL_REF_FUNCTION_P (base) | |
2134 | && epiphany_is_long_call_p (base)) | |
2135 | return false; | |
2136 | return TARGET_SMALL16 != 0; | |
2137 | } | |
2138 | ||
2139 | /* Return nonzero if it is ok to make a tail-call to DECL. */ | |
2140 | static bool | |
2141 | epiphany_function_ok_for_sibcall (tree decl, tree exp) | |
2142 | { | |
2143 | bool cfun_interrupt_p, call_interrupt_p; | |
2144 | ||
2145 | cfun_interrupt_p = EPIPHANY_INTERRUPT_P (epiphany_compute_function_type | |
2146 | (current_function_decl)); | |
2147 | if (decl) | |
2148 | call_interrupt_p = EPIPHANY_INTERRUPT_P (epiphany_compute_function_type (decl)); | |
2149 | else | |
2150 | { | |
2151 | tree fn_type = TREE_TYPE (CALL_EXPR_FN (exp)); | |
2152 | ||
2153 | gcc_assert (POINTER_TYPE_P (fn_type)); | |
2154 | fn_type = TREE_TYPE (fn_type); | |
2155 | gcc_assert (TREE_CODE (fn_type) == FUNCTION_TYPE | |
2156 | || TREE_CODE (fn_type) == METHOD_TYPE); | |
2157 | call_interrupt_p | |
2158 | = lookup_attribute ("interrupt", TYPE_ATTRIBUTES (fn_type)) != NULL; | |
2159 | } | |
2160 | ||
2161 | /* Don't tailcall from or to an ISR routine - although we could in | |
2162 | principle tailcall from one ISR routine to another, we'd need to | |
2163 | handle this in sibcall_epilogue to make it work. */ | |
2164 | if (cfun_interrupt_p || call_interrupt_p) | |
2165 | return false; | |
2166 | ||
2167 | /* Everything else is ok. */ | |
2168 | return true; | |
2169 | } | |
2170 | ||
2171 | /* T is a function declaration or the MEM_EXPR of a MEM passed to a call | |
2172 | expander. | |
2173 | Return true iff the type of T has the uninterruptible attribute. | |
2174 | If T is NULL, return false. */ | |
2175 | bool | |
2176 | epiphany_uninterruptible_p (tree t) | |
2177 | { | |
2178 | tree attrs; | |
2179 | ||
2180 | if (t) | |
2181 | { | |
2182 | attrs = TYPE_ATTRIBUTES (TREE_TYPE (t)); | |
2183 | if (lookup_attribute ("disinterrupt", attrs)) | |
2184 | return true; | |
2185 | } | |
2186 | return false; | |
2187 | } | |
2188 | ||
2189 | bool | |
2190 | epiphany_call_uninterruptible_p (rtx mem) | |
2191 | { | |
2192 | rtx addr = XEXP (mem, 0); | |
2193 | tree t = NULL_TREE; | |
2194 | ||
2195 | if (GET_CODE (addr) == SYMBOL_REF) | |
2196 | t = SYMBOL_REF_DECL (addr); | |
2197 | if (!t) | |
2198 | t = MEM_EXPR (mem); | |
2199 | return epiphany_uninterruptible_p (t); | |
2200 | } | |
2201 | ||
ef4bddc2 RS |
2202 | static machine_mode |
2203 | epiphany_promote_function_mode (const_tree type, machine_mode mode, | |
feeeff5c JR |
2204 | int *punsignedp ATTRIBUTE_UNUSED, |
2205 | const_tree funtype ATTRIBUTE_UNUSED, | |
2206 | int for_return ATTRIBUTE_UNUSED) | |
2207 | { | |
2208 | int dummy; | |
2209 | ||
2210 | return promote_mode (type, mode, &dummy); | |
2211 | } | |
2212 | ||
2213 | static void | |
2214 | epiphany_conditional_register_usage (void) | |
2215 | { | |
2216 | int i; | |
2217 | ||
2218 | if (PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM) | |
2219 | { | |
2220 | fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; | |
2221 | call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; | |
2222 | } | |
2223 | if (TARGET_HALF_REG_FILE) | |
2224 | { | |
2225 | for (i = 32; i <= 63; i++) | |
2226 | { | |
2227 | fixed_regs[i] = 1; | |
2228 | call_used_regs[i] = 1; | |
2229 | } | |
2230 | } | |
2231 | if (epiphany_m1reg >= 0) | |
2232 | { | |
2233 | fixed_regs[epiphany_m1reg] = 1; | |
2234 | call_used_regs[epiphany_m1reg] = 1; | |
2235 | } | |
2236 | if (!TARGET_PREFER_SHORT_INSN_REGS) | |
2237 | CLEAR_HARD_REG_SET (reg_class_contents[SHORT_INSN_REGS]); | |
2238 | COPY_HARD_REG_SET (reg_class_contents[SIBCALL_REGS], | |
2239 | reg_class_contents[GENERAL_REGS]); | |
2240 | /* It would be simpler and quicker if we could just use | |
2241 | AND_COMPL_HARD_REG_SET, alas, call_used_reg_set is yet uninitialized; | |
2242 | it is set up later by our caller. */ | |
2243 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
2244 | if (!call_used_regs[i]) | |
2245 | CLEAR_HARD_REG_BIT (reg_class_contents[SIBCALL_REGS], i); | |
2246 | } | |
2247 | ||
2248 | /* Determine where to put an argument to a function. | |
2249 | Value is zero to push the argument on the stack, | |
2250 | or a hard register in which to store the argument. | |
2251 | ||
2252 | MODE is the argument's machine mode. | |
2253 | TYPE is the data type of the argument (as a tree). | |
2254 | This is null for libcalls where that information may | |
2255 | not be available. | |
2256 | CUM is a variable of type CUMULATIVE_ARGS which gives info about | |
2257 | the preceding args and about the function being called. | |
2258 | NAMED is nonzero if this argument is a named parameter | |
2259 | (otherwise it is an extra parameter matching an ellipsis). */ | |
2260 | /* On the EPIPHANY the first MAX_EPIPHANY_PARM_REGS args are normally in | |
2261 | registers and the rest are pushed. */ | |
2262 | static rtx | |
ef4bddc2 | 2263 | epiphany_function_arg (cumulative_args_t cum_v, machine_mode mode, |
feeeff5c JR |
2264 | const_tree type, bool named ATTRIBUTE_UNUSED) |
2265 | { | |
2266 | CUMULATIVE_ARGS cum = *get_cumulative_args (cum_v); | |
2267 | ||
2268 | if (PASS_IN_REG_P (cum, mode, type)) | |
2269 | return gen_rtx_REG (mode, ROUND_ADVANCE_CUM (cum, mode, type)); | |
2270 | return 0; | |
2271 | } | |
2272 | ||
2273 | /* Update the data in CUM to advance over an argument | |
2274 | of mode MODE and data type TYPE. | |
2275 | (TYPE is null for libcalls where that information may not be available.) */ | |
2276 | static void | |
ef4bddc2 | 2277 | epiphany_function_arg_advance (cumulative_args_t cum_v, machine_mode mode, |
feeeff5c JR |
2278 | const_tree type, bool named ATTRIBUTE_UNUSED) |
2279 | { | |
2280 | CUMULATIVE_ARGS *cum = get_cumulative_args (cum_v); | |
2281 | ||
2282 | *cum = ROUND_ADVANCE_CUM (*cum, mode, type) + ROUND_ADVANCE_ARG (mode, type); | |
2283 | } | |
2284 | \f | |
2285 | /* Nested function support. | |
2286 | An epiphany trampoline looks like this: | |
2287 | mov r16,%low(fnaddr) | |
2288 | movt r16,%high(fnaddr) | |
2289 | mov ip,%low(cxt) | |
2290 | movt ip,%high(cxt) | |
2291 | jr r16 */ | |
2292 | ||
2293 | #define EPIPHANY_LOW_RTX(X) \ | |
2294 | (gen_rtx_IOR (SImode, \ | |
2295 | gen_rtx_ASHIFT (SImode, \ | |
2296 | gen_rtx_AND (SImode, (X), GEN_INT (0xff)), GEN_INT (5)), \ | |
2297 | gen_rtx_ASHIFT (SImode, \ | |
2298 | gen_rtx_AND (SImode, (X), GEN_INT (0xff00)), GEN_INT (12)))) | |
2299 | #define EPIPHANY_HIGH_RTX(X) \ | |
2300 | EPIPHANY_LOW_RTX (gen_rtx_LSHIFTRT (SImode, (X), GEN_INT (16))) | |
2301 | ||
2302 | /* Emit RTL insns to initialize the variable parts of a trampoline. | |
2303 | FNADDR is an RTX for the address of the function's pure code. | |
2304 | CXT is an RTX for the static chain value for the function. */ | |
2305 | static void | |
2306 | epiphany_trampoline_init (rtx tramp_mem, tree fndecl, rtx cxt) | |
2307 | { | |
2308 | rtx fnaddr = XEXP (DECL_RTL (fndecl), 0); | |
2309 | rtx tramp = force_reg (Pmode, XEXP (tramp_mem, 0)); | |
2310 | ||
0a81f074 | 2311 | emit_move_insn (gen_rtx_MEM (SImode, plus_constant (Pmode, tramp, 0)), |
feeeff5c JR |
2312 | gen_rtx_IOR (SImode, GEN_INT (0x4002000b), |
2313 | EPIPHANY_LOW_RTX (fnaddr))); | |
0a81f074 | 2314 | emit_move_insn (gen_rtx_MEM (SImode, plus_constant (Pmode, tramp, 4)), |
feeeff5c JR |
2315 | gen_rtx_IOR (SImode, GEN_INT (0x5002000b), |
2316 | EPIPHANY_HIGH_RTX (fnaddr))); | |
0a81f074 | 2317 | emit_move_insn (gen_rtx_MEM (SImode, plus_constant (Pmode, tramp, 8)), |
feeeff5c JR |
2318 | gen_rtx_IOR (SImode, GEN_INT (0x2002800b), |
2319 | EPIPHANY_LOW_RTX (cxt))); | |
0a81f074 | 2320 | emit_move_insn (gen_rtx_MEM (SImode, plus_constant (Pmode, tramp, 12)), |
feeeff5c JR |
2321 | gen_rtx_IOR (SImode, GEN_INT (0x3002800b), |
2322 | EPIPHANY_HIGH_RTX (cxt))); | |
0a81f074 | 2323 | emit_move_insn (gen_rtx_MEM (SImode, plus_constant (Pmode, tramp, 16)), |
feeeff5c JR |
2324 | GEN_INT (0x0802014f)); |
2325 | } | |
2326 | \f | |
2327 | bool | |
2328 | epiphany_optimize_mode_switching (int entity) | |
2329 | { | |
2330 | if (MACHINE_FUNCTION (cfun)->sw_entities_processed & (1 << entity)) | |
2331 | return false; | |
2332 | switch (entity) | |
2333 | { | |
2334 | case EPIPHANY_MSW_ENTITY_AND: | |
2335 | case EPIPHANY_MSW_ENTITY_OR: | |
566be57c | 2336 | case EPIPHANY_MSW_ENTITY_CONFIG: |
feeeff5c JR |
2337 | return true; |
2338 | case EPIPHANY_MSW_ENTITY_NEAREST: | |
2339 | case EPIPHANY_MSW_ENTITY_TRUNC: | |
2340 | return optimize > 0; | |
2341 | case EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN: | |
2342 | return MACHINE_FUNCTION (cfun)->unknown_mode_uses != 0; | |
2343 | case EPIPHANY_MSW_ENTITY_ROUND_KNOWN: | |
2344 | return (MACHINE_FUNCTION (cfun)->sw_entities_processed | |
2345 | & (1 << EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN)) != 0; | |
2346 | case EPIPHANY_MSW_ENTITY_FPU_OMNIBUS: | |
05555c4a | 2347 | return optimize == 0 || current_pass == pass_mode_switch_use; |
feeeff5c JR |
2348 | } |
2349 | gcc_unreachable (); | |
2350 | } | |
2351 | ||
06b90602 CB |
2352 | static int |
2353 | epiphany_mode_priority (int entity, int priority) | |
feeeff5c | 2354 | { |
566be57c JR |
2355 | if (entity == EPIPHANY_MSW_ENTITY_AND || entity == EPIPHANY_MSW_ENTITY_OR |
2356 | || entity== EPIPHANY_MSW_ENTITY_CONFIG) | |
feeeff5c JR |
2357 | return priority; |
2358 | if (priority > 3) | |
2359 | switch (priority) | |
2360 | { | |
2361 | case 4: return FP_MODE_ROUND_UNKNOWN; | |
2362 | case 5: return FP_MODE_NONE; | |
2363 | default: gcc_unreachable (); | |
2364 | } | |
2365 | switch ((enum attr_fp_mode) epiphany_normal_fp_mode) | |
2366 | { | |
2367 | case FP_MODE_INT: | |
2368 | switch (priority) | |
2369 | { | |
2370 | case 0: return FP_MODE_INT; | |
2371 | case 1: return epiphany_normal_fp_rounding; | |
2372 | case 2: return (epiphany_normal_fp_rounding == FP_MODE_ROUND_NEAREST | |
2373 | ? FP_MODE_ROUND_TRUNC : FP_MODE_ROUND_NEAREST); | |
2374 | case 3: return FP_MODE_CALLER; | |
2375 | } | |
2376 | case FP_MODE_ROUND_NEAREST: | |
2377 | case FP_MODE_CALLER: | |
2378 | switch (priority) | |
2379 | { | |
2380 | case 0: return FP_MODE_ROUND_NEAREST; | |
2381 | case 1: return FP_MODE_ROUND_TRUNC; | |
2382 | case 2: return FP_MODE_INT; | |
2383 | case 3: return FP_MODE_CALLER; | |
2384 | } | |
2385 | case FP_MODE_ROUND_TRUNC: | |
2386 | switch (priority) | |
2387 | { | |
2388 | case 0: return FP_MODE_ROUND_TRUNC; | |
2389 | case 1: return FP_MODE_ROUND_NEAREST; | |
2390 | case 2: return FP_MODE_INT; | |
2391 | case 3: return FP_MODE_CALLER; | |
2392 | } | |
2393 | case FP_MODE_ROUND_UNKNOWN: | |
2394 | case FP_MODE_NONE: | |
2395 | gcc_unreachable (); | |
2396 | } | |
2397 | gcc_unreachable (); | |
2398 | } | |
2399 | ||
2400 | int | |
ac44248e | 2401 | epiphany_mode_needed (int entity, rtx_insn *insn) |
feeeff5c JR |
2402 | { |
2403 | enum attr_fp_mode mode; | |
2404 | ||
2405 | if (recog_memoized (insn) < 0) | |
2406 | { | |
2407 | if (entity == EPIPHANY_MSW_ENTITY_AND | |
566be57c JR |
2408 | || entity == EPIPHANY_MSW_ENTITY_OR |
2409 | || entity == EPIPHANY_MSW_ENTITY_CONFIG) | |
feeeff5c JR |
2410 | return 2; |
2411 | return FP_MODE_NONE; | |
2412 | } | |
2413 | mode = get_attr_fp_mode (insn); | |
2414 | ||
2415 | switch (entity) | |
2416 | { | |
2417 | case EPIPHANY_MSW_ENTITY_AND: | |
566be57c | 2418 | return mode != FP_MODE_NONE && mode != FP_MODE_INT ? 1 : 2; |
feeeff5c JR |
2419 | case EPIPHANY_MSW_ENTITY_OR: |
2420 | return mode == FP_MODE_INT ? 1 : 2; | |
566be57c JR |
2421 | case EPIPHANY_MSW_ENTITY_CONFIG: |
2422 | /* We must know/save config before we set it to something else. | |
2423 | Where we need the original value, we are fine with having it | |
2424 | just unchanged from the function start. | |
2425 | Because of the nature of the mode switching optimization, | |
2426 | a restore will be dominated by a clobber. */ | |
2710a27a JR |
2427 | if (mode != FP_MODE_NONE && mode != FP_MODE_CALLER) |
2428 | return 1; | |
2429 | /* A cpecial case are abnormal edges, which are deemed to clobber | |
2430 | the mode as well. We need to pin this effect on a actually | |
2431 | dominating insn, and one where the frame can be accessed, too, in | |
2432 | case the pseudo used to save CONFIG doesn't get a hard register. */ | |
2433 | if (CALL_P (insn) && find_reg_note (insn, REG_EH_REGION, NULL_RTX)) | |
2434 | return 1; | |
2435 | return 2; | |
feeeff5c JR |
2436 | case EPIPHANY_MSW_ENTITY_ROUND_KNOWN: |
2437 | if (recog_memoized (insn) == CODE_FOR_set_fp_mode) | |
2438 | mode = (enum attr_fp_mode) epiphany_mode_after (entity, mode, insn); | |
2439 | /* Fall through. */ | |
2440 | case EPIPHANY_MSW_ENTITY_NEAREST: | |
2441 | case EPIPHANY_MSW_ENTITY_TRUNC: | |
2442 | if (mode == FP_MODE_ROUND_UNKNOWN) | |
2443 | { | |
2444 | MACHINE_FUNCTION (cfun)->unknown_mode_uses++; | |
2445 | return FP_MODE_NONE; | |
2446 | } | |
2447 | return mode; | |
2448 | case EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN: | |
2449 | if (mode == FP_MODE_ROUND_NEAREST || mode == FP_MODE_ROUND_TRUNC) | |
2450 | return FP_MODE_ROUND_UNKNOWN; | |
2451 | return mode; | |
2452 | case EPIPHANY_MSW_ENTITY_FPU_OMNIBUS: | |
2453 | if (mode == FP_MODE_ROUND_UNKNOWN) | |
2454 | return epiphany_normal_fp_rounding; | |
2455 | return mode; | |
2456 | default: | |
2457 | gcc_unreachable (); | |
2458 | } | |
2459 | } | |
2460 | ||
06b90602 | 2461 | static int |
feeeff5c JR |
2462 | epiphany_mode_entry_exit (int entity, bool exit) |
2463 | { | |
2464 | int normal_mode = epiphany_normal_fp_mode ; | |
2465 | ||
2466 | MACHINE_FUNCTION (cfun)->sw_entities_processed |= (1 << entity); | |
2467 | if (epiphany_is_interrupt_p (current_function_decl)) | |
2468 | normal_mode = FP_MODE_CALLER; | |
2469 | switch (entity) | |
2470 | { | |
2471 | case EPIPHANY_MSW_ENTITY_AND: | |
2472 | if (exit) | |
2473 | return normal_mode != FP_MODE_INT ? 1 : 2; | |
2474 | return 0; | |
2475 | case EPIPHANY_MSW_ENTITY_OR: | |
2476 | if (exit) | |
2477 | return normal_mode == FP_MODE_INT ? 1 : 2; | |
2478 | return 0; | |
566be57c JR |
2479 | case EPIPHANY_MSW_ENTITY_CONFIG: |
2480 | if (exit) | |
2481 | return 2; | |
2482 | return normal_mode == FP_MODE_CALLER ? 0 : 1; | |
feeeff5c JR |
2483 | case EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN: |
2484 | if (normal_mode == FP_MODE_ROUND_NEAREST | |
2485 | || normal_mode == FP_MODE_ROUND_TRUNC) | |
2486 | return FP_MODE_ROUND_UNKNOWN; | |
2487 | /* Fall through. */ | |
2488 | case EPIPHANY_MSW_ENTITY_NEAREST: | |
2489 | case EPIPHANY_MSW_ENTITY_TRUNC: | |
2490 | case EPIPHANY_MSW_ENTITY_ROUND_KNOWN: | |
2491 | case EPIPHANY_MSW_ENTITY_FPU_OMNIBUS: | |
2492 | return normal_mode; | |
2493 | default: | |
2494 | gcc_unreachable (); | |
2495 | } | |
2496 | } | |
2497 | ||
2498 | int | |
ac44248e | 2499 | epiphany_mode_after (int entity, int last_mode, rtx_insn *insn) |
feeeff5c JR |
2500 | { |
2501 | /* We have too few call-saved registers to hope to keep the masks across | |
2502 | calls. */ | |
2503 | if (entity == EPIPHANY_MSW_ENTITY_AND || entity == EPIPHANY_MSW_ENTITY_OR) | |
2504 | { | |
b64925dc | 2505 | if (CALL_P (insn)) |
feeeff5c JR |
2506 | return 0; |
2507 | return last_mode; | |
2508 | } | |
2710a27a JR |
2509 | /* If there is an abnormal edge, we don't want the config register to |
2510 | be 'saved' again at the destination. | |
2511 | The frame pointer adjustment is inside a PARALLEL because of the | |
2512 | flags clobber. */ | |
2513 | if (entity == EPIPHANY_MSW_ENTITY_CONFIG && NONJUMP_INSN_P (insn) | |
2514 | && GET_CODE (PATTERN (insn)) == PARALLEL | |
2515 | && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET | |
2516 | && SET_DEST (XVECEXP (PATTERN (insn), 0, 0)) == frame_pointer_rtx) | |
2517 | { | |
2518 | gcc_assert (cfun->has_nonlocal_label); | |
2519 | return 1; | |
2520 | } | |
feeeff5c JR |
2521 | if (recog_memoized (insn) < 0) |
2522 | return last_mode; | |
2523 | if (get_attr_fp_mode (insn) == FP_MODE_ROUND_UNKNOWN | |
2524 | && last_mode != FP_MODE_ROUND_NEAREST && last_mode != FP_MODE_ROUND_TRUNC) | |
2525 | { | |
2526 | if (entity == EPIPHANY_MSW_ENTITY_NEAREST) | |
2527 | return FP_MODE_ROUND_NEAREST; | |
2528 | if (entity == EPIPHANY_MSW_ENTITY_TRUNC) | |
2529 | return FP_MODE_ROUND_TRUNC; | |
2530 | } | |
2531 | if (recog_memoized (insn) == CODE_FOR_set_fp_mode) | |
2532 | { | |
2533 | rtx src = SET_SRC (XVECEXP (PATTERN (insn), 0, 0)); | |
2534 | int fp_mode; | |
2535 | ||
2536 | if (REG_P (src)) | |
2537 | return FP_MODE_CALLER; | |
2538 | fp_mode = INTVAL (XVECEXP (XEXP (src, 0), 0, 0)); | |
2539 | if (entity == EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN | |
2540 | && (fp_mode == FP_MODE_ROUND_NEAREST | |
2541 | || fp_mode == EPIPHANY_MSW_ENTITY_TRUNC)) | |
2542 | return FP_MODE_ROUND_UNKNOWN; | |
2543 | return fp_mode; | |
2544 | } | |
2545 | return last_mode; | |
2546 | } | |
2547 | ||
06b90602 CB |
2548 | static int |
2549 | epiphany_mode_entry (int entity) | |
2550 | { | |
2551 | return epiphany_mode_entry_exit (entity, false); | |
2552 | } | |
2553 | ||
2554 | static int | |
2555 | epiphany_mode_exit (int entity) | |
2556 | { | |
2557 | return epiphany_mode_entry_exit (entity, true); | |
2558 | } | |
2559 | ||
feeeff5c | 2560 | void |
cbb1e3d9 CB |
2561 | emit_set_fp_mode (int entity, int mode, int prev_mode ATTRIBUTE_UNUSED, |
2562 | HARD_REG_SET regs_live ATTRIBUTE_UNUSED) | |
feeeff5c JR |
2563 | { |
2564 | rtx save_cc, cc_reg, mask, src, src2; | |
2565 | enum attr_fp_mode fp_mode; | |
2566 | ||
2567 | if (!MACHINE_FUNCTION (cfun)->and_mask) | |
2568 | { | |
2569 | MACHINE_FUNCTION (cfun)->and_mask = gen_reg_rtx (SImode); | |
2570 | MACHINE_FUNCTION (cfun)->or_mask = gen_reg_rtx (SImode); | |
2571 | } | |
2572 | if (entity == EPIPHANY_MSW_ENTITY_AND) | |
2573 | { | |
2574 | gcc_assert (mode >= 0 && mode <= 2); | |
2575 | if (mode == 1) | |
2576 | emit_move_insn (MACHINE_FUNCTION (cfun)->and_mask, | |
2577 | gen_int_mode (0xfff1fffe, SImode)); | |
2578 | return; | |
2579 | } | |
2580 | else if (entity == EPIPHANY_MSW_ENTITY_OR) | |
2581 | { | |
2582 | gcc_assert (mode >= 0 && mode <= 2); | |
2583 | if (mode == 1) | |
2584 | emit_move_insn (MACHINE_FUNCTION (cfun)->or_mask, GEN_INT(0x00080000)); | |
2585 | return; | |
2586 | } | |
566be57c JR |
2587 | else if (entity == EPIPHANY_MSW_ENTITY_CONFIG) |
2588 | { | |
2589 | /* Mode switching optimization is done after emit_initial_value_sets, | |
2590 | so we have to take care of CONFIG_REGNUM here. */ | |
2591 | gcc_assert (mode >= 0 && mode <= 2); | |
2592 | rtx save = get_hard_reg_initial_val (SImode, CONFIG_REGNUM); | |
2593 | if (mode == 1) | |
2594 | emit_insn (gen_save_config (save)); | |
2595 | return; | |
2596 | } | |
feeeff5c JR |
2597 | fp_mode = (enum attr_fp_mode) mode; |
2598 | src = NULL_RTX; | |
2599 | ||
2600 | switch (fp_mode) | |
2601 | { | |
2602 | case FP_MODE_CALLER: | |
566be57c JR |
2603 | /* The EPIPHANY_MSW_ENTITY_CONFIG processing must come later |
2604 | so that the config save gets inserted before the first use. */ | |
2605 | gcc_assert (entity > EPIPHANY_MSW_ENTITY_CONFIG); | |
feeeff5c JR |
2606 | src = get_hard_reg_initial_val (SImode, CONFIG_REGNUM); |
2607 | mask = MACHINE_FUNCTION (cfun)->and_mask; | |
2608 | break; | |
2609 | case FP_MODE_ROUND_UNKNOWN: | |
2610 | MACHINE_FUNCTION (cfun)->unknown_mode_sets++; | |
2611 | mask = MACHINE_FUNCTION (cfun)->and_mask; | |
2612 | break; | |
2613 | case FP_MODE_ROUND_NEAREST: | |
2614 | if (entity == EPIPHANY_MSW_ENTITY_TRUNC) | |
2615 | return; | |
2616 | mask = MACHINE_FUNCTION (cfun)->and_mask; | |
2617 | break; | |
2618 | case FP_MODE_ROUND_TRUNC: | |
2619 | if (entity == EPIPHANY_MSW_ENTITY_NEAREST) | |
2620 | return; | |
2621 | mask = MACHINE_FUNCTION (cfun)->and_mask; | |
2622 | break; | |
2623 | case FP_MODE_INT: | |
2624 | mask = MACHINE_FUNCTION (cfun)->or_mask; | |
2625 | break; | |
2626 | case FP_MODE_NONE: | |
2627 | default: | |
2628 | gcc_unreachable (); | |
2629 | } | |
2630 | save_cc = gen_reg_rtx (CCmode); | |
2631 | cc_reg = gen_rtx_REG (CCmode, CC_REGNUM); | |
2632 | emit_move_insn (save_cc, cc_reg); | |
2633 | mask = force_reg (SImode, mask); | |
2634 | if (!src) | |
2635 | { | |
2636 | rtvec v = gen_rtvec (1, GEN_INT (fp_mode)); | |
2637 | ||
2638 | src = gen_rtx_CONST (SImode, gen_rtx_UNSPEC (SImode, v, UNSPEC_FP_MODE)); | |
2639 | } | |
2640 | if (entity == EPIPHANY_MSW_ENTITY_ROUND_KNOWN | |
2641 | || entity == EPIPHANY_MSW_ENTITY_FPU_OMNIBUS) | |
2642 | src2 = copy_rtx (src); | |
2643 | else | |
2644 | { | |
2645 | rtvec v = gen_rtvec (1, GEN_INT (FP_MODE_ROUND_UNKNOWN)); | |
2646 | ||
2647 | src2 = gen_rtx_CONST (SImode, gen_rtx_UNSPEC (SImode, v, UNSPEC_FP_MODE)); | |
2648 | } | |
2649 | emit_insn (gen_set_fp_mode (src, src2, mask)); | |
2650 | emit_move_insn (cc_reg, save_cc); | |
2651 | } | |
2652 | ||
2653 | void | |
2654 | epiphany_expand_set_fp_mode (rtx *operands) | |
2655 | { | |
2656 | rtx ctrl = gen_rtx_REG (SImode, CONFIG_REGNUM); | |
2657 | rtx src = operands[0]; | |
2658 | rtx mask_reg = operands[2]; | |
2659 | rtx scratch = operands[3]; | |
2660 | enum attr_fp_mode fp_mode; | |
2661 | ||
2662 | ||
2663 | gcc_assert (rtx_equal_p (src, operands[1]) | |
2664 | /* Sometimes reload gets silly and reloads the same pseudo | |
2665 | into different registers. */ | |
2666 | || (REG_P (src) && REG_P (operands[1]))); | |
2667 | ||
2668 | if (!epiphany_uninterruptible_p (current_function_decl)) | |
2669 | emit_insn (gen_gid ()); | |
2670 | emit_move_insn (scratch, ctrl); | |
2671 | ||
2672 | if (GET_CODE (src) == REG) | |
2673 | { | |
2674 | /* FP_MODE_CALLER */ | |
2675 | emit_insn (gen_xorsi3 (scratch, scratch, src)); | |
2676 | emit_insn (gen_andsi3 (scratch, scratch, mask_reg)); | |
2677 | emit_insn (gen_xorsi3 (scratch, scratch, src)); | |
2678 | } | |
2679 | else | |
2680 | { | |
2681 | gcc_assert (GET_CODE (src) == CONST); | |
2682 | src = XEXP (src, 0); | |
2683 | fp_mode = (enum attr_fp_mode) INTVAL (XVECEXP (src, 0, 0)); | |
2684 | switch (fp_mode) | |
2685 | { | |
2686 | case FP_MODE_ROUND_NEAREST: | |
2687 | emit_insn (gen_andsi3 (scratch, scratch, mask_reg)); | |
2688 | break; | |
2689 | case FP_MODE_ROUND_TRUNC: | |
2690 | emit_insn (gen_andsi3 (scratch, scratch, mask_reg)); | |
2691 | emit_insn (gen_add2_insn (scratch, const1_rtx)); | |
2692 | break; | |
2693 | case FP_MODE_INT: | |
2694 | emit_insn (gen_iorsi3 (scratch, scratch, mask_reg)); | |
2695 | break; | |
2696 | case FP_MODE_CALLER: | |
2697 | case FP_MODE_ROUND_UNKNOWN: | |
2698 | case FP_MODE_NONE: | |
2699 | gcc_unreachable (); | |
2700 | } | |
2701 | } | |
2702 | emit_move_insn (ctrl, scratch); | |
2703 | if (!epiphany_uninterruptible_p (current_function_decl)) | |
2704 | emit_insn (gen_gie ()); | |
2705 | } | |
2706 | ||
2707 | void | |
84034c69 | 2708 | epiphany_insert_mode_switch_use (rtx_insn *insn, |
feeeff5c JR |
2709 | int entity ATTRIBUTE_UNUSED, |
2710 | int mode ATTRIBUTE_UNUSED) | |
2711 | { | |
2712 | rtx pat = PATTERN (insn); | |
2713 | rtvec v; | |
2714 | int len, i; | |
2715 | rtx near = gen_rtx_REG (SImode, FP_NEAREST_REGNUM); | |
2716 | rtx trunc = gen_rtx_REG (SImode, FP_TRUNCATE_REGNUM); | |
2717 | ||
2718 | if (entity != EPIPHANY_MSW_ENTITY_FPU_OMNIBUS) | |
2719 | return; | |
2720 | switch ((enum attr_fp_mode) get_attr_fp_mode (insn)) | |
2721 | { | |
2722 | case FP_MODE_ROUND_NEAREST: | |
2723 | near = gen_rtx_USE (VOIDmode, near); | |
2724 | trunc = gen_rtx_CLOBBER (VOIDmode, trunc); | |
2725 | break; | |
2726 | case FP_MODE_ROUND_TRUNC: | |
2727 | near = gen_rtx_CLOBBER (VOIDmode, near); | |
2728 | trunc = gen_rtx_USE (VOIDmode, trunc); | |
2729 | break; | |
2730 | case FP_MODE_ROUND_UNKNOWN: | |
2731 | near = gen_rtx_USE (VOIDmode, gen_rtx_REG (SImode, FP_ANYFP_REGNUM)); | |
2732 | trunc = copy_rtx (near); | |
2733 | /* Fall through. */ | |
2734 | case FP_MODE_INT: | |
2735 | case FP_MODE_CALLER: | |
2736 | near = gen_rtx_USE (VOIDmode, near); | |
2737 | trunc = gen_rtx_USE (VOIDmode, trunc); | |
2738 | break; | |
2739 | case FP_MODE_NONE: | |
2740 | gcc_unreachable (); | |
2741 | } | |
2742 | gcc_assert (GET_CODE (pat) == PARALLEL); | |
2743 | len = XVECLEN (pat, 0); | |
2744 | v = rtvec_alloc (len + 2); | |
2745 | for (i = 0; i < len; i++) | |
2746 | RTVEC_ELT (v, i) = XVECEXP (pat, 0, i); | |
2747 | RTVEC_ELT (v, len) = near; | |
2748 | RTVEC_ELT (v, len + 1) = trunc; | |
2749 | pat = gen_rtx_PARALLEL (VOIDmode, v); | |
2750 | PATTERN (insn) = pat; | |
2751 | MACHINE_FUNCTION (cfun)->control_use_inserted = true; | |
2752 | } | |
2753 | ||
2754 | bool | |
2755 | epiphany_epilogue_uses (int regno) | |
2756 | { | |
2757 | if (regno == GPR_LR) | |
2758 | return true; | |
2759 | if (reload_completed && epiphany_is_interrupt_p (current_function_decl)) | |
2760 | { | |
2761 | if (fixed_regs[regno] | |
2762 | && regno != STATUS_REGNUM && regno != IRET_REGNUM | |
2763 | && regno != FP_NEAREST_REGNUM && regno != FP_TRUNCATE_REGNUM) | |
2764 | return false; | |
2765 | return true; | |
2766 | } | |
2767 | if (regno == FP_NEAREST_REGNUM | |
2768 | && epiphany_normal_fp_mode != FP_MODE_ROUND_TRUNC) | |
2769 | return true; | |
2770 | if (regno == FP_TRUNCATE_REGNUM | |
2771 | && epiphany_normal_fp_mode != FP_MODE_ROUND_NEAREST) | |
2772 | return true; | |
2773 | return false; | |
2774 | } | |
2775 | ||
2776 | static unsigned int | |
ef4bddc2 | 2777 | epiphany_min_divisions_for_recip_mul (machine_mode mode) |
feeeff5c JR |
2778 | { |
2779 | if (flag_reciprocal_math && mode == SFmode) | |
2780 | /* We'll expand into a multiply-by-reciprocal anyway, so we might a well do | |
2781 | it already at the tree level and expose it to further optimizations. */ | |
2782 | return 1; | |
2783 | return default_min_divisions_for_recip_mul (mode); | |
2784 | } | |
2785 | ||
ef4bddc2 RS |
2786 | static machine_mode |
2787 | epiphany_preferred_simd_mode (machine_mode mode ATTRIBUTE_UNUSED) | |
feeeff5c JR |
2788 | { |
2789 | return TARGET_VECT_DOUBLE ? DImode : SImode; | |
2790 | } | |
2791 | ||
2792 | static bool | |
ef4bddc2 | 2793 | epiphany_vector_mode_supported_p (machine_mode mode) |
feeeff5c JR |
2794 | { |
2795 | if (mode == V2SFmode) | |
2796 | return true; | |
2797 | if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT | |
2798 | && (GET_MODE_SIZE (mode) == 4 || GET_MODE_SIZE (mode) == 8)) | |
2799 | return true; | |
2800 | return false; | |
2801 | } | |
2802 | ||
2803 | static bool | |
2804 | epiphany_vector_alignment_reachable (const_tree type, bool is_packed) | |
2805 | { | |
2806 | /* Vectors which aren't in packed structures will not be less aligned than | |
2807 | the natural alignment of their element type, so this is safe. */ | |
2808 | if (TYPE_ALIGN_UNIT (type) == 4) | |
2809 | return !is_packed; | |
2810 | ||
2811 | return default_builtin_vector_alignment_reachable (type, is_packed); | |
2812 | } | |
2813 | ||
2814 | static bool | |
ef4bddc2 | 2815 | epiphany_support_vector_misalignment (machine_mode mode, const_tree type, |
feeeff5c JR |
2816 | int misalignment, bool is_packed) |
2817 | { | |
2818 | if (GET_MODE_SIZE (mode) == 8 && misalignment % 4 == 0) | |
2819 | return true; | |
2820 | return default_builtin_support_vector_misalignment (mode, type, misalignment, | |
2821 | is_packed); | |
2822 | } | |
2823 | ||
2824 | /* STRUCTURE_SIZE_BOUNDARY seems a bit crude in how it enlarges small | |
2825 | structs. Make structs double-word-aligned it they are a double word or | |
2826 | (potentially) larger; failing that, do the same for a size of 32 bits. */ | |
2827 | unsigned | |
2828 | epiphany_special_round_type_align (tree type, unsigned computed, | |
2829 | unsigned specified) | |
2830 | { | |
2831 | unsigned align = MAX (computed, specified); | |
2832 | tree field; | |
2833 | HOST_WIDE_INT total, max; | |
2834 | unsigned try_align = FASTEST_ALIGNMENT; | |
2835 | ||
2836 | if (maximum_field_alignment && try_align > maximum_field_alignment) | |
2837 | try_align = maximum_field_alignment; | |
2838 | if (align >= try_align) | |
2839 | return align; | |
2840 | for (max = 0, field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
2841 | { | |
2842 | tree offset, size; | |
2843 | ||
2844 | if (TREE_CODE (field) != FIELD_DECL | |
2845 | || TREE_TYPE (field) == error_mark_node) | |
2846 | continue; | |
2847 | offset = bit_position (field); | |
2848 | size = DECL_SIZE (field); | |
cc269bb6 | 2849 | if (!tree_fits_uhwi_p (offset) || !tree_fits_uhwi_p (size) |
eb1ce453 KZ |
2850 | || tree_to_uhwi (offset) >= try_align |
2851 | || tree_to_uhwi (size) >= try_align) | |
feeeff5c | 2852 | return try_align; |
eb1ce453 | 2853 | total = tree_to_uhwi (offset) + tree_to_uhwi (size); |
feeeff5c JR |
2854 | if (total > max) |
2855 | max = total; | |
2856 | } | |
2857 | if (max >= (HOST_WIDE_INT) try_align) | |
2858 | align = try_align; | |
2859 | else if (try_align > 32 && max >= 32) | |
2860 | align = max > 32 ? 64 : 32; | |
2861 | return align; | |
2862 | } | |
2863 | ||
2864 | /* Upping the alignment of arrays in structs is not only a performance | |
2865 | enhancement, it also helps preserve assumptions about how | |
2866 | arrays-at-the-end-of-structs work, like for struct gcov_fn_info in | |
2867 | libgcov.c . */ | |
2868 | unsigned | |
2869 | epiphany_adjust_field_align (tree field, unsigned computed) | |
2870 | { | |
2871 | if (computed == 32 | |
2872 | && TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE) | |
2873 | { | |
2874 | tree elmsz = TYPE_SIZE (TREE_TYPE (TREE_TYPE (field))); | |
2875 | ||
ae7e9ddd | 2876 | if (!tree_fits_uhwi_p (elmsz) || tree_to_uhwi (elmsz) >= 32) |
feeeff5c JR |
2877 | return 64; |
2878 | } | |
2879 | return computed; | |
2880 | } | |
2881 | ||
2882 | /* Output code to add DELTA to the first argument, and then jump | |
2883 | to FUNCTION. Used for C++ multiple inheritance. */ | |
2884 | static void | |
2885 | epiphany_output_mi_thunk (FILE *file, tree thunk ATTRIBUTE_UNUSED, | |
2886 | HOST_WIDE_INT delta, | |
2887 | HOST_WIDE_INT vcall_offset, | |
2888 | tree function) | |
2889 | { | |
2890 | int this_regno | |
2891 | = aggregate_value_p (TREE_TYPE (TREE_TYPE (function)), function) ? 1 : 0; | |
2892 | const char *this_name = reg_names[this_regno]; | |
2893 | const char *fname; | |
2894 | ||
2895 | /* We use IP and R16 as a scratch registers. */ | |
2896 | gcc_assert (call_used_regs [GPR_IP]); | |
2897 | gcc_assert (call_used_regs [GPR_16]); | |
2898 | ||
2899 | /* Add DELTA. When possible use a plain add, otherwise load it into | |
2900 | a register first. */ | |
2901 | if (delta == 0) | |
2902 | ; /* Done. */ | |
2903 | else if (SIMM11 (delta)) | |
2904 | asm_fprintf (file, "\tadd\t%s,%s,%d\n", this_name, this_name, (int) delta); | |
2905 | else if (delta < 0 && delta >= -0xffff) | |
2906 | { | |
2907 | asm_fprintf (file, "\tmov\tip,%d\n", (int) -delta); | |
2908 | asm_fprintf (file, "\tsub\t%s,%s,ip\n", this_name, this_name); | |
2909 | } | |
2910 | else | |
2911 | { | |
2912 | asm_fprintf (file, "\tmov\tip,%%low(%ld)\n", (long) delta); | |
2913 | if (delta & ~0xffff) | |
2914 | asm_fprintf (file, "\tmovt\tip,%%high(%ld)\n", (long) delta); | |
2915 | asm_fprintf (file, "\tadd\t%s,%s,ip\n", this_name, this_name); | |
2916 | } | |
2917 | ||
2918 | /* If needed, add *(*THIS + VCALL_OFFSET) to THIS. */ | |
2919 | if (vcall_offset != 0) | |
2920 | { | |
2921 | /* ldr ip,[this] --> temp = *this | |
2922 | ldr ip,[ip,vcall_offset] > temp = *(*this + vcall_offset) | |
2923 | add this,this,ip --> this+ = *(*this + vcall_offset) */ | |
2924 | asm_fprintf (file, "\tldr\tip, [%s]\n", this_name); | |
2925 | if (vcall_offset < -0x7ff * 4 || vcall_offset > 0x7ff * 4 | |
2926 | || (vcall_offset & 3) != 0) | |
2927 | { | |
2928 | asm_fprintf (file, "\tmov\tr16, %%low(%ld)\n", (long) vcall_offset); | |
2929 | asm_fprintf (file, "\tmovt\tr16, %%high(%ld)\n", (long) vcall_offset); | |
2930 | asm_fprintf (file, "\tldr\tip, [ip,r16]\n"); | |
2931 | } | |
2932 | else | |
2933 | asm_fprintf (file, "\tldr\tip, [ip,%d]\n", (int) vcall_offset / 4); | |
2934 | asm_fprintf (file, "\tadd\t%s, %s, ip\n", this_name, this_name); | |
2935 | } | |
2936 | ||
2937 | fname = XSTR (XEXP (DECL_RTL (function), 0), 0); | |
2938 | if (epiphany_is_long_call_p (XEXP (DECL_RTL (function), 0))) | |
2939 | { | |
2940 | fputs ("\tmov\tip,%low(", file); | |
2941 | assemble_name (file, fname); | |
2942 | fputs (")\n\tmovt\tip,%high(", file); | |
2943 | assemble_name (file, fname); | |
2944 | fputs (")\n\tjr ip\n", file); | |
2945 | } | |
2946 | else | |
2947 | { | |
2948 | fputs ("\tb\t", file); | |
2949 | assemble_name (file, fname); | |
2950 | fputc ('\n', file); | |
2951 | } | |
2952 | } | |
2953 | ||
188b7e23 JR |
2954 | void |
2955 | epiphany_start_function (FILE *file, const char *name, tree decl) | |
2956 | { | |
60098013 JR |
2957 | /* If the function doesn't fit into the on-chip memory, it will have a |
2958 | section attribute - or lack of it - that denotes it goes somewhere else. | |
2959 | But the architecture spec says that an interrupt vector still has to | |
2960 | point to on-chip memory. So we must place a jump there to get to the | |
2961 | actual function implementation. The forwarder_section attribute | |
2962 | specifies the section where this jump goes. | |
2963 | This mechanism can also be useful to have a shortcall destination for | |
2964 | a function that is actually placed much farther away. */ | |
2965 | tree attrs, int_attr, int_names, int_name, forwarder_attr; | |
188b7e23 JR |
2966 | |
2967 | attrs = DECL_ATTRIBUTES (decl); | |
2968 | int_attr = lookup_attribute ("interrupt", attrs); | |
2969 | if (int_attr) | |
60098013 JR |
2970 | for (int_names = TREE_VALUE (int_attr); int_names; |
2971 | int_names = TREE_CHAIN (int_names)) | |
2972 | { | |
2973 | char buf[99]; | |
2974 | ||
2975 | int_name = TREE_VALUE (int_names); | |
2976 | sprintf (buf, "ivt_entry_%.80s", TREE_STRING_POINTER (int_name)); | |
2977 | switch_to_section (get_section (buf, SECTION_CODE, decl)); | |
2978 | fputs ("\tb\t", file); | |
2979 | assemble_name (file, name); | |
2980 | fputc ('\n', file); | |
2981 | } | |
2982 | forwarder_attr = lookup_attribute ("forwarder_section", attrs); | |
2983 | if (forwarder_attr) | |
2984 | { | |
2985 | const char *prefix = "__forwarder_dst_"; | |
2986 | char *dst_name = (char *) alloca (strlen (prefix) + strlen (name) + 1); | |
2987 | ||
2988 | strcpy (dst_name, prefix); | |
2989 | strcat (dst_name, name); | |
2990 | forwarder_attr = TREE_VALUE (TREE_VALUE (forwarder_attr)); | |
2991 | switch_to_section (get_section (TREE_STRING_POINTER (forwarder_attr), | |
2992 | SECTION_CODE, decl)); | |
2993 | ASM_OUTPUT_FUNCTION_LABEL (file, name, decl); | |
2994 | if (epiphany_is_long_call_p (XEXP (DECL_RTL (decl), 0))) | |
2995 | { | |
2996 | int tmp = GPR_0; | |
188b7e23 | 2997 | |
60098013 JR |
2998 | if (int_attr) |
2999 | fputs ("\tstrd r0,[sp,-1]\n", file); | |
3000 | else | |
3001 | tmp = GPR_16; | |
3002 | gcc_assert (call_used_regs[tmp]); | |
3003 | fprintf (file, "\tmov r%d,%%low(", tmp); | |
3004 | assemble_name (file, dst_name); | |
3005 | fprintf (file, ")\n" | |
3006 | "\tmovt r%d,%%high(", tmp); | |
3007 | assemble_name (file, dst_name); | |
3008 | fprintf (file, ")\n" | |
3009 | "\tjr r%d\n", tmp); | |
3010 | } | |
3011 | else | |
3012 | { | |
3013 | fputs ("\tb\t", file); | |
3014 | assemble_name (file, dst_name); | |
3015 | fputc ('\n', file); | |
3016 | } | |
3017 | name = dst_name; | |
188b7e23 | 3018 | } |
60098013 | 3019 | switch_to_section (function_section (decl)); |
188b7e23 JR |
3020 | ASM_OUTPUT_FUNCTION_LABEL (file, name, decl); |
3021 | } | |
3022 | ||
feeeff5c | 3023 | struct gcc_target targetm = TARGET_INITIALIZER; |