]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/config/epiphany/epiphany.h
Turn HARD_REGNO_MODE_OK into a target hook
[thirdparty/gcc.git] / gcc / config / epiphany / epiphany.h
CommitLineData
d19f5793 1/* Definitions of target machine for GNU compiler, Argonaut EPIPHANY cpu.
aad93da1 2 Copyright (C) 1994-2017 Free Software Foundation, Inc.
d19f5793 3 Contributed by Embecosm on behalf of Adapteva, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify
8it under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 3, or (at your option)
10any later version.
11
12GCC is distributed in the hope that it will be useful,
13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3. If not see
19<http://www.gnu.org/licenses/>. */
20
21#ifndef GCC_EPIPHANY_H
22#define GCC_EPIPHANY_H
23
24#undef LINK_SPEC
25#undef STARTFILE_SPEC
26#undef ENDFILE_SPEC
27#undef SIZE_TYPE
28#undef PTRDIFF_TYPE
29#undef WCHAR_TYPE
30#undef WCHAR_TYPE_SIZE
31\f
32/* Names to predefine in the preprocessor for this target machine. */
33#define TARGET_CPU_CPP_BUILTINS() \
34 do \
35 { \
36 builtin_define ("__epiphany__"); \
37 builtin_define ("__little_endian__"); \
38 builtin_define_with_int_value ("__EPIPHANY_STACK_OFFSET__", \
39 epiphany_stack_offset); \
40 builtin_assert ("cpu=epiphany"); \
41 builtin_assert ("machine=epiphany"); \
42 } while (0)
43
44/* Pick up the libgloss library. One day we may do this by linker script, but
fad55529 45 for now its static.
46 libgloss might use errno/__errno, which might not have been needed when we
47 saw libc the first time, so link with libc a second time. */
d19f5793 48#undef LIB_SPEC
fad55529 49#define LIB_SPEC "%{!shared:%{g*:-lg} %{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}} -lepiphany %{!shared:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
d19f5793 50
51#define LINK_SPEC "%{v}"
52
53#define STARTFILE_SPEC "%{!shared:crt0.o%s} crti.o%s " \
54 "%{mfp-mode=int:crtint.o%s} %{mfp-mode=truncate:crtrunc.o%s} " \
55 "%{m1reg-r43:crtm1reg-r43.o%s} %{m1reg-r63:crtm1reg-r63.o%s} " \
56 "crtbegin.o%s"
57
58#define ENDFILE_SPEC "crtend.o%s crtn.o%s"
59
6c03ca24 60#define EPIPHANY_LIBRARY_EXTRA_SPEC \
61 "-ffixed-r40 -ffixed-r41 -ffixed-r42 -ffixed-r43"
62
63/* In the "spec:" rule,, t-epiphany changes this to epiphany_library_stub_spec
64 and epiphany_library_extra_spec, respectively. */
65#define EXTRA_SPECS \
66 { "epiphany_library_extra_spec", "" }, \
67 { "epiphany_library_build_spec", EPIPHANY_LIBRARY_EXTRA_SPEC }, \
68
69#define DRIVER_SELF_SPECS " %(epiphany_library_extra_spec) "
70
d19f5793 71#undef USER_LABEL_PREFIX
72#define USER_LABEL_PREFIX "_"
73
74#define CRT_CALL_STATIC_FUNCTION(SECTION_OP, FUNC) \
75 asm (SECTION_OP "\n\
76 mov r0,%low(" USER_LABEL_PREFIX #FUNC")\n\
77 movt r0,%high(" USER_LABEL_PREFIX #FUNC")\n\
78 jalr r0\n\
79 .text");
80
81#if 0 /* We would like to use Posix for profiling, but the simulator
82 interface still lacks mkdir. */
83#define TARGET_POSIX_IO
84#endif
85\f
86/* Target machine storage layout. */
87
88/* Define this if most significant bit is lowest numbered
89 in instructions that operate on numbered bit-fields. */
90#define BITS_BIG_ENDIAN 0
91
92/* Define this if most significant byte of a word is the lowest numbered. */
93#define BYTES_BIG_ENDIAN 0
94
95/* Define this if most significant word of a multiword number is the lowest
96 numbered. */
97#define WORDS_BIG_ENDIAN 0
98
99/* Width of a word, in units (bytes). */
100#define UNITS_PER_WORD 4
101
102/* Define this macro if it is advisable to hold scalars in registers
103 in a wider mode than that declared by the program. In such cases,
104 the value is constrained to be within the bounds of the declared
105 type, but kept valid in the wider mode. The signedness of the
106 extension may differ from that of the type. */
107/* It is far faster to zero extend chars than to sign extend them */
108
109#define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
110 if (GET_MODE_CLASS (MODE) == MODE_INT \
111 && GET_MODE_SIZE (MODE) < 4) \
112 { \
113 if (MODE == QImode) \
114 UNSIGNEDP = 1; \
115 else if (MODE == HImode) \
116 UNSIGNEDP = 1; \
117 (MODE) = SImode; \
118 }
119
120/* Allocation boundary (in *bits*) for storing arguments in argument list. */
121#define PARM_BOUNDARY 32
122
123/* Boundary (in *bits*) on which stack pointer should be aligned. */
124#define STACK_BOUNDARY 64
125
126/* ALIGN FRAMES on word boundaries */
127#define EPIPHANY_STACK_ALIGN(LOC) (((LOC)+7) & ~7)
128
129/* Allocation boundary (in *bits*) for the code of a function. */
130#define FUNCTION_BOUNDARY 32
131
132/* Every structure's size must be a multiple of this. */
133#define STRUCTURE_SIZE_BOUNDARY 8
134
135/* A bit-field declared as `int' forces `int' alignment for the struct. */
136#define PCC_BITFIELD_TYPE_MATTERS 1
137
138/* No data type wants to be aligned rounder than this. */
139/* This is bigger than currently necessary for the EPIPHANY. If 8 byte floats are
140 ever added it's not clear whether they'll need such alignment or not. For
141 now we assume they will. We can always relax it if necessary but the
142 reverse isn't true. */
143#define BIGGEST_ALIGNMENT 64
144
145/* The best alignment to use in cases where we have a choice. */
146#define FASTEST_ALIGNMENT 64
147
148#define MALLOC_ABI_ALIGNMENT BIGGEST_ALIGNMENT
149
150/* Make strings dword-aligned so strcpy from constants will be faster. */
151#define CONSTANT_ALIGNMENT(EXP, ALIGN) \
152 ((TREE_CODE (EXP) == STRING_CST \
153 && (ALIGN) < FASTEST_ALIGNMENT) \
154 ? FASTEST_ALIGNMENT : (ALIGN))
155
156/* Make arrays of chars dword-aligned for the same reasons.
157 Also, align arrays of SImode items. */
158#define DATA_ALIGNMENT(TYPE, ALIGN) \
159 (TREE_CODE (TYPE) == ARRAY_TYPE \
160 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
161 && (ALIGN) < FASTEST_ALIGNMENT \
162 ? FASTEST_ALIGNMENT \
163 : (TREE_CODE (TYPE) == ARRAY_TYPE \
164 && TYPE_MODE (TREE_TYPE (TYPE)) == SImode \
165 && (ALIGN) < FASTEST_ALIGNMENT) \
166 ? FASTEST_ALIGNMENT \
167 : (ALIGN))
168
169/* Set this nonzero if move instructions will actually fail to work
170 when given unaligned data. */
171/* On the EPIPHANY the lower address bits are masked to 0 as necessary. The chip
172 won't croak when given an unaligned address, but the insn will still fail
173 to produce the correct result. */
174#define STRICT_ALIGNMENT 1
175
176/* layout_type overrides our ADJUST_ALIGNMENT settings from epiphany-modes.def
177 for vector modes, so we have to override it back. */
178#define ROUND_TYPE_ALIGN(TYPE, MANGLED_ALIGN, SPECIFIED_ALIGN) \
179 (TREE_CODE (TYPE) == VECTOR_TYPE && !TYPE_USER_ALIGN (TYPE) \
180 && SPECIFIED_ALIGN <= GET_MODE_ALIGNMENT (TYPE_MODE (TYPE)) \
181 ? GET_MODE_ALIGNMENT (TYPE_MODE (TYPE)) \
182 : ((TREE_CODE (TYPE) == RECORD_TYPE \
183 || TREE_CODE (TYPE) == UNION_TYPE \
184 || TREE_CODE (TYPE) == QUAL_UNION_TYPE) \
185 && !TYPE_PACKED (TYPE)) \
186 ? epiphany_special_round_type_align ((TYPE), (MANGLED_ALIGN), \
187 (SPECIFIED_ALIGN)) \
188 : MAX ((MANGLED_ALIGN), (SPECIFIED_ALIGN)))
189
700a9760 190#define ADJUST_FIELD_ALIGN(FIELD, TYPE, COMPUTED) \
191 epiphany_adjust_field_align((TYPE), (COMPUTED))
d19f5793 192\f
193/* Layout of source language data types. */
194
195#define SHORT_TYPE_SIZE 16
196#define INT_TYPE_SIZE 32
197#define LONG_TYPE_SIZE 32
198#define LONG_LONG_TYPE_SIZE 64
199#define FLOAT_TYPE_SIZE 32
200#define DOUBLE_TYPE_SIZE 64
201#define LONG_DOUBLE_TYPE_SIZE 64
202
203/* Define this as 1 if `char' should by default be signed; else as 0. */
204#define DEFAULT_SIGNED_CHAR 0
205
206#define SIZE_TYPE "long unsigned int"
207#define PTRDIFF_TYPE "long int"
208#define WCHAR_TYPE "unsigned int"
209#define WCHAR_TYPE_SIZE BITS_PER_WORD
210\f
211/* Standard register usage. */
212
213/* Number of actual hardware registers.
214 The hardware registers are assigned numbers for the compiler
215 from 0 to just below FIRST_PSEUDO_REGISTER.
216 All registers that the compiler knows about must be given numbers,
217 even those that are not normally considered general registers. */
218
219#define FIRST_PSEUDO_REGISTER 78
220
221
222/* General purpose registers. */
223#define GPR_FIRST 0 /* First gpr */
224
225#define PIC_REGNO (GPR_FIRST + 28) /* PIC register. */
226#define GPR_LAST (GPR_FIRST + 63) /* Last gpr */
227#define CORE_CONTROL_FIRST CONFIG_REGNUM
228#define CORE_CONTROL_LAST IRET_REGNUM
229
230#define GPR_P(R) IN_RANGE (R, GPR_FIRST, GPR_LAST)
231#define GPR_OR_AP_P(R) (GPR_P (R) || (R) == ARG_POINTER_REGNUM)
232
233#define GPR_OR_PSEUDO_P(R) (GPR_P (R) || (R) >= FIRST_PSEUDO_REGISTER)
234#define GPR_AP_OR_PSEUDO_P(R) (GPR_OR_AP_P (R) || (R) >= FIRST_PSEUDO_REGISTER)
235
236#define FIXED_REGISTERS \
237{ /* Integer Registers */ \
238 0, 0, 0, 0, 0, 0, 0, 0, /* 000-007, gr0 - gr7 */ \
239 0, 0, 0, 0, 0, 1, 0, 0, /* 008-015, gr8 - gr15 */ \
240 0, 0, 0, 0, 0, 0, 0, 0, /* 016-023, gr16 - gr23 */ \
241 0, 0, 0, 0, 1, 1, 1, 1, /* 024-031, gr24 - gr31 */ \
242 0, 0, 0, 0, 0, 0, 0, 0, /* 032-039, gr32 - gr39 */ \
3092057b 243 0, 0, 0, 0, 0, 0, 0, 0, /* 040-047, gr40 - gr47 */ \
d19f5793 244 0, 0, 0, 0, 0, 0, 0, 0, /* 048-055, gr48 - gr55 */ \
245 0, 0, 0, 0, 0, 0, 0, 0, /* 056-063, gr56 - gr63 */ \
246 /* Other registers */ \
247 1, /* 64 AP - fake arg ptr */ \
248 1, /* soft frame pointer */ \
249 1, /* CC_REGNUM - integer conditions */\
250 1, /* CCFP_REGNUM - fp conditions */\
251 1, 1, 1, 1, 1, 1, /* Core Control Registers. */ \
252 1, 1, 1, /* FP_{NEAREST,...}_REGNUM */\
253 1, /* UNKNOWN_REGNUM - placeholder. */\
254}
255
256/* Like `FIXED_REGISTERS' but has 1 for each register that is clobbered (in
257 general) by function calls as well as for fixed registers. This macro
258 therefore identifies the registers that are not available for general
259 allocation of values that must live across function calls.
260
261 If a register has 0 in `CALL_USED_REGISTERS', the compiler automatically
262 saves it on function entry and restores it on function exit, if the register
263 is used within the function. */
264
265#define CALL_USED_REGISTERS \
266{ /* Integer Registers */ \
267 1, 1, 1, 1, 0, 0, 0, 0, /* 000-007, gr0 - gr7 */ \
268 0, 0, 0, 0, 1, 1, 1, 0, /* 008-015, gr8 - gr15 */ \
269 1, 1, 1, 1, 1, 1, 1, 1, /* 016-023, gr16 - gr23 */ \
270 1, 1, 1, 1, 1, 1, 1, 1, /* 024-031, gr24 - gr31 */ \
271 0, 0, 0, 0, 0, 0, 0, 0, /* 032-039, gr32 - gr38 */ \
3092057b 272 0, 0, 0, 0, 1, 1, 1, 1, /* 040-047, gr40 - gr47 */ \
d19f5793 273 1, 1, 1, 1, 1, 1, 1, 1, /* 048-055, gr48 - gr55 */ \
274 1, 1, 1, 1, 1, 1, 1, 1, /* 056-063, gr56 - gr63 */ \
275 1, /* 64 AP - fake arg ptr */ \
276 1, /* soft frame pointer */ \
277 1, /* 66 CC_REGNUM */ \
278 1, /* 67 CCFP_REGNUM */ \
279 1, 1, 1, 1, 1, 1, /* Core Control Registers. */ \
280 1, 1, 1, /* FP_{NEAREST,...}_REGNUM */\
281 1, /* UNKNOWN_REGNUM - placeholder. */\
282}
283
284#define REG_ALLOC_ORDER \
285 { \
286 0, 1, 2, 3, /* Caller-saved 'small' registers. */ \
287 12, /* Caller-saved unpaired register. */ \
288 /* Caller-saved registers. */ \
289 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, \
290 44, 45, 46, 47, \
291 48, 49, 50, 51, 52, 53, 54, 55, \
292 56, 57, 58, 59, 60, 61, 62, 63, \
293 4, 5, 6, 7, /* Calle-saved 'small' registers. */ \
294 15, /* Calle-saved unpaired register. */ \
295 8, 9, 10, 11, /* Calle-saved registers. */ \
3092057b 296 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, \
d19f5793 297 14, 13, /* Link register, stack pointer. */ \
d19f5793 298 /* Can't allocate, but must name these... */ \
299 28, 29, 30, 31, \
300 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77 \
301 }
302
99d1a463 303#define HARD_REGNO_RENAME_OK(SRC, DST) epiphany_regno_rename_ok (SRC, DST)
304
d19f5793 305/* Return number of consecutive hard regs needed starting at reg REGNO
306 to hold something of mode MODE.
307 This is ordinarily the length in words of a value of mode MODE
308 but can be less for certain modes in special long registers. */
309#define HARD_REGNO_NREGS(REGNO, MODE) \
310((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
311
d19f5793 312/* A C expression that is nonzero if it is desirable to choose
313 register allocation so as to avoid move instructions between a
314 value of mode MODE1 and a value of mode MODE2.
315
b395382f 316 If `TARGET_HARD_REGNO_MODE_OK (R, MODE1)' and
317 `TARGET_HARD_REGNO_MODE_OK (R, MODE2)' are ever different for any R,
318 then `MODES_TIEABLE_P (MODE1, MODE2)' must be zero. */
d19f5793 319
320#define MODES_TIEABLE_P(MODE1, MODE2) 1
321
322/* Register classes and constants. */
323
324/* Define the classes of registers for register constraints in the
325 machine description. Also define ranges of constants.
326
327 One of the classes must always be named ALL_REGS and include all hard regs.
328 If there is more than one class, another class must be named NO_REGS
329 and contain no registers.
330
331 The name GENERAL_REGS must be the name of a class (or an alias for
332 another name such as ALL_REGS). This is the class of registers
333 that is allowed by "g" or "r" in a register constraint.
334 Also, registers outside this class are allocated only when
335 instructions express preferences for them.
336
337 The classes must be numbered in nondecreasing order; that is,
338 a larger-numbered class must never be contained completely
339 in a smaller-numbered class.
340
341 For any two classes, it is very desirable that there be another
342 class that represents their union.
343
344 It is important that any condition codes have class NO_REGS.
345 See `register_operand'. */
346
347enum reg_class {
348 NO_REGS,
349 LR_REGS,
350 SHORT_INSN_REGS,
351 SIBCALL_REGS,
352 GENERAL_REGS,
353 CORE_CONTROL_REGS,
354 ALL_REGS,
355 LIM_REG_CLASSES
356};
357
358#define N_REG_CLASSES ((int) LIM_REG_CLASSES)
359
360/* Give names of register classes as strings for dump file. */
361#define REG_CLASS_NAMES \
362{ \
363 "NO_REGS", \
364 "LR_REGS", \
365 "SHORT_INSN_REGS", \
366 "SIBCALL_REGS", \
367 "GENERAL_REGS", \
368 "CORE_CONTROL_REGS", \
369 "ALL_REGS" \
370}
371
372/* Define which registers fit in which classes.
373 This is an initializer for a vector of HARD_REG_SET
374 of length N_REG_CLASSES. */
375
376#define REG_CLASS_CONTENTS \
377{ /* r0-r31 r32-r63 ap/sfp/cc1/cc2/iret/status */ \
378 { 0x00000000,0x00000000,0x0}, /* NO_REGS */ \
379 { 0x00004000,0x00000000,0x0}, /* LR_REGS */ \
380 { 0x000000ff,0x00000000,0x0}, /* SHORT_INSN_REGS */ \
381 { 0xffff100f,0xffffff00,0x0}, /* SIBCALL_REGS */ \
382 { 0xffffffff,0xffffffff,0x0003}, /* GENERAL_REGS */ \
383 { 0x00000000,0x00000000,0x03f0}, /* CORE_CONTROL_REGS */ \
384 { 0xffffffff,0xffffffff,0x3fff}, /* ALL_REGS */ \
385}
386
387
388/* The same information, inverted:
389 Return the class number of the smallest class containing
390 reg number REGNO. This could be a conditional expression
391 or could index an array. */
392extern enum reg_class epiphany_regno_reg_class[FIRST_PSEUDO_REGISTER];
393#define REGNO_REG_CLASS(REGNO) \
394(epiphany_regno_reg_class[REGNO])
395
396/* The class value for index registers, and the one for base regs. */
397#define BASE_REG_CLASS GENERAL_REGS
398#define INDEX_REG_CLASS GENERAL_REGS
399
400/* These assume that REGNO is a hard or pseudo reg number.
401 They give nonzero only if REGNO is a hard reg of the suitable class
402 or a pseudo reg currently allocated to a suitable hard reg.
403 Since they use reg_renumber, they are safe only once reg_renumber
957b2bdc 404 has been allocated, which happens in reginfo.c during register
405 allocation. */
d19f5793 406#define REGNO_OK_FOR_BASE_P(REGNO) \
407((REGNO) < FIRST_PSEUDO_REGISTER || (unsigned) reg_renumber[REGNO] < FIRST_PSEUDO_REGISTER)
408#define REGNO_OK_FOR_INDEX_P(REGNO) \
409((REGNO) < FIRST_PSEUDO_REGISTER || (unsigned) reg_renumber[REGNO] < FIRST_PSEUDO_REGISTER)
410
411
412
413/* Given an rtx X being reloaded into a reg required to be
414 in class CLASS, return the class of reg to actually use.
415 In general this is just CLASS; but on some machines
416 in some cases it is preferable to use a more restrictive class. */
417#define PREFERRED_RELOAD_CLASS(X,CLASS) \
418(CLASS)
419
420/* Return the maximum number of consecutive registers
421 needed to represent mode MODE in a register of class CLASS. */
422#define CLASS_MAX_NREGS(CLASS, MODE) \
423((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
424
425/* The letters I, J, K, L, M, N, O, P in a register constraint string
426 can be used to stand for particular ranges of immediate operands.
427 This macro defines what the ranges are.
428 C is the letter, and VALUE is a constant value.
429 Return 1 if VALUE is in the range specified by C. */
430
431/* 'I' is used for 16 bit unsigned.
432 'Cal' is used for long immediates (32 bits)
433 'K' is used for any constant up to 5 bits.
434 'L' is used for any 11 bit signed.
435*/
436
437#define IMM16(X) (IN_RANGE ((X), 0, 0xFFFF))
438#define SIMM16(X) (IN_RANGE ((X), -65536, 65535))
439#define SIMM11(X) (IN_RANGE ((X), -1024, 1023))
440#define IMM5(X) (IN_RANGE ((X), 0, 0x1F))
441\f
442typedef struct GTY (()) machine_function
443{
444 unsigned args_parsed : 1;
445 unsigned pretend_args_odd : 1;
446 unsigned lr_clobbered : 1;
447 unsigned control_use_inserted : 1;
78d11f8a 448 unsigned lr_slot_known : 1;
d19f5793 449 unsigned sw_entities_processed : 6;
450 long lr_slot_offset;
451 rtx and_mask;
452 rtx or_mask;
453 unsigned unknown_mode_uses;
454 unsigned unknown_mode_sets;
455} machine_function_t;
456
457#define MACHINE_FUNCTION(fun) (fun)->machine
458
459#define INIT_EXPANDERS epiphany_init_expanders ()
460\f
461/* Stack layout and stack pointer usage. */
462
463/* Define this macro if pushing a word onto the stack moves the stack
464 pointer to a smaller address. */
2b785411 465#define STACK_GROWS_DOWNWARD 1
d19f5793 466
467/* Define this to nonzero if the nominal address of the stack frame
468 is at the high-address end of the local variables;
469 that is, each additional local variable allocated
470 goes at a more negative offset in the frame. */
471#define FRAME_GROWS_DOWNWARD 1
472
473/* Offset within stack frame to start allocating local variables at.
474 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
475 first local allocated. Otherwise, it is the offset to the BEGINNING
476 of the first local allocated. */
477#define STARTING_FRAME_OFFSET epiphany_stack_offset
478
479/* Offset from the stack pointer register to the first location at which
480 outgoing arguments are placed. */
481#define STACK_POINTER_OFFSET epiphany_stack_offset
482
483/* Offset of first parameter from the argument pointer register value. */
484/* 4 bytes for each of previous fp, return address, and previous gp.
485 4 byte reserved area for future considerations. */
486#define FIRST_PARM_OFFSET(FNDECL) \
487 (epiphany_stack_offset \
488 + (MACHINE_FUNCTION (DECL_STRUCT_FUNCTION (FNDECL))->pretend_args_odd \
489 ? 4 : 0))
490
491#define INCOMING_FRAME_SP_OFFSET epiphany_stack_offset
492
493/* Register to use for pushing function arguments. */
494#define STACK_POINTER_REGNUM GPR_SP
495
496/* Base register for access to local variables of the function. */
497#define HARD_FRAME_POINTER_REGNUM GPR_FP
498
499/* Register in which static-chain is passed to a function. This must
500 not be a register used by the prologue. */
501#define STATIC_CHAIN_REGNUM GPR_IP
502
503/* Define the offset between two registers, one to be eliminated, and the other
504 its replacement, at the start of a routine. */
505
506#define ELIMINABLE_REGS \
507{{ FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
508 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
509 { ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
510 { ARG_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM}, \
511}
512
513/* Define the offset between two registers, one to be eliminated, and the other
514 its replacement, at the start of a routine. */
515
516#define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
517 ((OFFSET) = epiphany_initial_elimination_offset ((FROM), (TO)))
518\f
519/* Function argument passing. */
520
521/* If defined, the maximum amount of space required for outgoing
522 arguments will be computed and placed into the variable
523 `current_function_outgoing_args_size'. No space will be pushed
524 onto the stack for each call; instead, the function prologue should
525 increase the stack frame size by this amount. */
526#define ACCUMULATE_OUTGOING_ARGS 1
527
528/* Define a data type for recording info about an argument list
529 during the scan of that argument list. This data type should
530 hold all necessary information about the function itself
531 and about the args processed so far, enough to enable macros
532 such as FUNCTION_ARG to determine where the next arg should go. */
533#define CUMULATIVE_ARGS int
534
535/* Initialize a variable CUM of type CUMULATIVE_ARGS
536 for a call to a function whose data type is FNTYPE.
537 For a library call, FNTYPE is 0. */
538#define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \
539((CUM) = 0)
540
541/* The number of registers used for parameter passing. Local to this file. */
542#define MAX_EPIPHANY_PARM_REGS 4
543
544/* 1 if N is a possible register number for function argument passing. */
545#define FUNCTION_ARG_REGNO_P(N) \
546((unsigned) (N) < MAX_EPIPHANY_PARM_REGS)
547
548/* Return boolean indicating arg of type TYPE and mode MODE will be passed in
549 a reg. This includes arguments that have to be passed by reference as the
550 pointer to them is passed in a reg if one is available (and that is what
551 we're given).
552 This macro is only used in this file. */
553/* We must use partial argument passing because of the chosen mode
554 of varargs handling. */
555#define PASS_IN_REG_P(CUM, MODE, TYPE) \
556 (ROUND_ADVANCE_CUM ((CUM), (MODE), (TYPE)) < MAX_EPIPHANY_PARM_REGS)
557\f
558/* Tell GCC to use TARGET_RETURN_IN_MEMORY. */
559#define DEFAULT_PCC_STRUCT_RETURN 0
560\f
561/* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
562 the stack pointer does not matter. The value is tested only in
563 functions that have frame pointers.
564 No definition is equivalent to always zero. */
565#define EXIT_IGNORE_STACK 1
566
567#define EPILOGUE_USES(REGNO) epiphany_epilogue_uses (REGNO)
568
569/* Output assembler code to FILE to increment profiler label # LABELNO
570 for profiling a function entry. */
571#define FUNCTION_PROFILER(FILE, LABELNO)
572
573/* Given an rtx for the frame pointer,
574 return an rtx for the address of the frame. */
575#define FRAME_ADDR_RTX(frame) \
576 ((frame) == hard_frame_pointer_rtx ? arg_pointer_rtx : NULL)
577
f315be49 578#define EPIPHANY_RETURN_REGNO \
579 ((current_function_decl != NULL \
580 && epiphany_is_interrupt_p (current_function_decl)) \
581 ? IRET_REGNUM : GPR_LR)
d19f5793 582/* This is not only for dwarf unwind info, but also for the benefit of
583 df-scan.c to tell it that LR is live at the function start. */
f315be49 584#define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, EPIPHANY_RETURN_REGNO)
d19f5793 585
586/* However, we haven't implemented the rest needed for dwarf2 unwind info. */
587#define DWARF2_UNWIND_INFO 0
588
589#define RETURN_ADDR_RTX(count, frame) \
590 (count ? NULL_RTX \
591 : gen_rtx_UNSPEC (SImode, gen_rtvec (1, const0_rtx), UNSPEC_RETURN_ADDR))
f315be49 592
593#define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (EPIPHANY_RETURN_REGNO)
d19f5793 594\f
595/* Trampolines.
596 An epiphany trampoline looks like this:
597 mov r16,%low(fnaddr)
598 movt r16,%high(fnaddr)
599 mov ip,%low(cxt)
600 movt ip,%high(cxt)
601 jr r16 */
602
603/* Length in units of the trampoline for entering a nested function. */
604#define TRAMPOLINE_SIZE 20
605\f
606/* Addressing modes, and classification of registers for them. */
607
608/* Maximum number of registers that can appear in a valid memory address. */
609#define MAX_REGS_PER_ADDRESS 2
610
611/* We have post_modify (load/store with update). */
612#define HAVE_POST_INCREMENT TARGET_POST_INC
613#define HAVE_POST_DECREMENT TARGET_POST_INC
614#define HAVE_POST_MODIFY_DISP TARGET_POST_MODIFY
615#define HAVE_POST_MODIFY_REG TARGET_POST_MODIFY
616
fea11e96 617/* Currently, the only users of the USE_*CREMENT macros are
618 move_by_pieces / store_by_pieces_1 . We don't want them to use
619 POST_MODIFY modes, because we got ample addressing range for the
620 reg+offset addressing mode; besides, there are short index+offset loads,
621 but the only short post-modify load uses POST_MODIFY_REG.
622 Moreover, using auto-increment in move_by_pieces from structure copying
623 in the prologue causes confused debug output.
624 If another pass starts using these macros where the use of these
625 addressing modes would make more sense, we can try checking the
626 current pass. */
627#define USE_LOAD_POST_INCREMENT(MODE) 0
628#define USE_LOAD_POST_DECREMENT(MODE) 0
629#define USE_STORE_POST_INCREMENT(MODE) 0
630#define USE_STORE_POST_DECREMENT(MODE) 0
631
d19f5793 632/* Recognize any constant value that is a valid address. */
633#define CONSTANT_ADDRESS_P(X) \
634(GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
635 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST)
636
637#define RTX_OK_FOR_OFFSET_P(MODE, X) \
638 RTX_OK_FOR_OFFSET_1 (GET_MODE_CLASS (MODE) == MODE_VECTOR_INT \
af8303fa 639 && epiphany_vect_align == 4 \
640 ? (machine_mode) SImode : (machine_mode) (MODE), X)
d19f5793 641#define RTX_OK_FOR_OFFSET_1(MODE, X) \
642 (GET_CODE (X) == CONST_INT \
643 && !(INTVAL (X) & (GET_MODE_SIZE (MODE) - 1)) \
644 && INTVAL (X) >= -2047 * (int) GET_MODE_SIZE (MODE) \
645 && INTVAL (X) <= 2047 * (int) GET_MODE_SIZE (MODE))
646
647/* Frame offsets cannot be evaluated till the frame pointer is eliminated. */
648#define RTX_FRAME_OFFSET_P(X) \
649 ((X) == frame_pointer_rtx \
650 || (GET_CODE (X) == PLUS && XEXP ((X), 0) == frame_pointer_rtx \
651 && CONST_INT_P (XEXP ((X), 1))))
652\f
653/* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
654 return the mode to be used for the comparison. */
655#define SELECT_CC_MODE(OP, X, Y) \
656 epiphany_select_cc_mode (OP, X, Y)
657
658/* Return nonzero if SELECT_CC_MODE will never return MODE for a
659 floating point inequality comparison. */
660
661#define REVERSE_CONDITION(CODE, MODE) \
662 ((MODE) == CC_FPmode || (MODE) == CC_FP_EQmode || (MODE) == CC_FP_GTEmode \
663 || (MODE) == CC_FP_ORDmode || (MODE) == CC_FP_UNEQmode \
664 ? reverse_condition_maybe_unordered (CODE) \
665 : (MODE) == CCmode ? reverse_condition (CODE) \
666 : UNKNOWN)
667
668/* We can reverse all CCmodes with REVERSE_CONDITION. */
669#define REVERSIBLE_CC_MODE(MODE) \
670 ((MODE) == CCmode || (MODE) == CC_FPmode || (MODE) == CC_FP_EQmode \
671 || (MODE) == CC_FP_GTEmode || (MODE) == CC_FP_ORDmode \
672 || (MODE) == CC_FP_UNEQmode)
673\f
674/* Costs. */
675
676/* The cost of a branch insn. */
677/* ??? What's the right value here? Branches are certainly more
678 expensive than reg->reg moves. */
679#define BRANCH_COST(speed_p, predictable_p) \
680 (speed_p ? epiphany_branch_cost : 1)
681
682/* Nonzero if access to memory by bytes is slow and undesirable.
683 For RISC chips, it means that access to memory by bytes is no
684 better than access by words when possible, so grab a whole word
685 and maybe make use of that. */
686#define SLOW_BYTE_ACCESS 1
687
688/* Define this macro if it is as good or better to call a constant
689 function address than to call an address kept in a register. */
690/* On the EPIPHANY, calling through registers is slow. */
93516111 691#define NO_FUNCTION_CSE 1
d19f5793 692\f
693/* Section selection. */
694/* WARNING: These section names also appear in dwarf2out.c. */
695
696#define TEXT_SECTION_ASM_OP "\t.section .text"
697#define DATA_SECTION_ASM_OP "\t.section .data"
698
699#undef READONLY_DATA_SECTION_ASM_OP
700#define READONLY_DATA_SECTION_ASM_OP "\t.section .rodata"
701
702#define BSS_SECTION_ASM_OP "\t.section .bss"
703
704/* Define this macro if jump tables (for tablejump insns) should be
705 output in the text section, along with the assembler instructions.
706 Otherwise, the readonly data section is used.
707 This macro is irrelevant if there is no separate readonly data section. */
708#define JUMP_TABLES_IN_TEXT_SECTION (flag_pic)
709\f
710/* PIC */
711
712/* The register number of the register used to address a table of static
713 data addresses in memory. In some cases this register is defined by a
714 processor's ``application binary interface'' (ABI). When this macro
715 is defined, RTL is generated for this register once, as with the stack
716 pointer and frame pointer registers. If this macro is not defined, it
717 is up to the machine-dependent files to allocate such a register (if
718 necessary). */
719#define PIC_OFFSET_TABLE_REGNUM (flag_pic ? PIC_REGNO : INVALID_REGNUM)
720\f
721/* Control the assembler format that we output. */
722
723/* A C string constant describing how to begin a comment in the target
724 assembler language. The compiler assumes that the comment will
725 end at the end of the line. */
726#define ASM_COMMENT_START ";"
727
728/* Output to assembler file text saying following lines
729 may contain character constants, extra white space, comments, etc. */
730#define ASM_APP_ON ""
731
732/* Output to assembler file text saying following lines
733 no longer contain unusual constructs. */
734#define ASM_APP_OFF ""
735
736/* Globalizing directive for a label. */
737#define GLOBAL_ASM_OP "\t.global\t"
738
739/* How to refer to registers in assembler output.
740 This sequence is indexed by compiler's hard-register-number (see above). */
741
742#define REGISTER_NAMES \
743{ \
744 "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \
745 "r8", "r9", "r10", "fp", "ip", "sp", "lr", "r15", \
746 "r16", "r17","r18", "r19", "r20", "r21", "r22", "r23", \
747 "r24", "r25", "r26", "r27", "r28", "r29", "r30", "r31", \
748 "r32", "r33", "r34", "r35", "r36", "r37", "r38", "r39", \
749 "r40", "r41", "r42", "r43", "r44", "r45", "r46", "r47", \
750 "r48", "r49", "r50", "r51", "r52", "r53", "r54", "r55", \
751 "r56", "r57", "r58", "r59", "r60", "r61", "r62", "r63", \
752 "ap", "sfp", "cc1", "cc2", \
753 "config", "status", "lc", "ls", "le", "iret", \
754 "fp_near", "fp_trunc", "fp_anyfp", "unknown" \
755}
756
757#define FINAL_PRESCAN_INSN(INSN, OPVEC, NOPERANDS) \
758 epiphany_final_prescan_insn (INSN, OPVEC, NOPERANDS)
759
760#define LOCAL_LABEL_PREFIX "."
761
762/* A C expression which evaluates to true if CODE is a valid
763 punctuation character for use in the `PRINT_OPERAND' macro. */
764extern char epiphany_punct_chars[256];
765#define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
766 epiphany_punct_chars[(unsigned char) (CHAR)]
767
768/* This is how to output an element of a case-vector that is absolute. */
769#define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
770do { \
771 if (CASE_VECTOR_MODE == Pmode) \
772 asm_fprintf ((FILE), "\t.word %LL%d\n", (VALUE)); \
773 else \
774 asm_fprintf ((FILE), "\t.short %LL%d\n", (VALUE)); \
775} while (0)
776
777/* This is how to output an element of a case-vector that is relative. */
778#define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
779do { \
780 if (CASE_VECTOR_MODE == Pmode) \
781 asm_fprintf ((FILE), "\t.word"); \
782 else \
783 asm_fprintf ((FILE), "\t.short"); \
784 asm_fprintf ((FILE), " %LL%d-%LL%d\n", (VALUE), (REL)); \
785} while (0)
786
787/* This is how to output an assembler line
788 that says to advance the location counter
789 to a multiple of 2**LOG bytes. */
9b6b345f 790#define ASM_OUTPUT_ALIGN(FILE, LOG) \
d19f5793 791do { if ((LOG) != 0) fprintf (FILE, "\t.balign %d\n", 1 << (LOG)); } while (0)
83debce3 792
9b6b345f 793/* Inside the text section, align with nops rather than zeros. */
794#define ASM_OUTPUT_ALIGN_WITH_NOP(FILE, LOG) \
795do \
796{ \
797 if ((LOG) != 0) fprintf (FILE, "\t.balignw %d,0x01a2\n", 1 << (LOG)); \
798} while (0)
799
83debce3 800/* This is how to declare the size of a function. */
801#undef ASM_DECLARE_FUNCTION_SIZE
802#define ASM_DECLARE_FUNCTION_SIZE(FILE, FNAME, DECL) \
803 do \
804 { \
805 const char *__name = (FNAME); \
806 tree attrs = DECL_ATTRIBUTES ((DECL)); \
807 \
808 if (!flag_inhibit_size_directive) \
809 { \
810 if (lookup_attribute ("forwarder_section", attrs)) \
811 { \
812 const char *prefix = "__forwarder_dst_"; \
813 char *dst_name \
814 = (char *) alloca (strlen (prefix) + strlen (__name) + 1); \
815 \
816 strcpy (dst_name, prefix); \
817 strcat (dst_name, __name); \
818 __name = dst_name; \
819 } \
820 ASM_OUTPUT_MEASURED_SIZE ((FILE), __name); \
821 } \
822 } \
823 while (0)
d19f5793 824\f
825/* Debugging information. */
826
827/* Generate DBX and DWARF debugging information. */
828#define DBX_DEBUGGING_INFO 1
829
830#undef PREFERRED_DEBUGGING_TYPE
831#define PREFERRED_DEBUGGING_TYPE DWARF2_DEBUG
832
833/* Turn off splitting of long stabs. */
834#define DBX_CONTIN_LENGTH 0
835\f
836/* Miscellaneous. */
837
838/* Specify the machine mode that this machine uses
839 for the index in the tablejump instruction. */
840#define CASE_VECTOR_MODE (TARGET_SMALL16 && optimize_size ? HImode : Pmode)
841
842/* Define if operations between registers always perform the operation
843 on the full register even if a narrower mode is specified. */
94f1fba7 844#define WORD_REGISTER_OPERATIONS 1
d19f5793 845
846/* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
847 will either zero-extend or sign-extend. The value of this macro should
848 be the code that says which one of the two operations is implicitly
849 done, UNKNOWN if none. */
850#define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
851
852/* Max number of bytes we can move from memory to memory
853 in one reasonably fast instruction. */
854#define MOVE_MAX 8
855
856/* Define this to be nonzero if shift instructions ignore all but the low-order
857 few bits. */
858#define SHIFT_COUNT_TRUNCATED 1
859
860/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
861 is done just by pretending it is already truncated. */
862#define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
863
864/* Specify the machine mode that pointers have.
865 After generation of rtl, the compiler makes no further distinction
866 between pointers and any other objects of this machine mode. */
867
868#define Pmode SImode
869
870/* A function address in a call instruction. */
871#define FUNCTION_MODE SImode
872\f
873/* EPIPHANY function types. */
874enum epiphany_function_type
875{
876 EPIPHANY_FUNCTION_UNKNOWN, EPIPHANY_FUNCTION_NORMAL,
83debce3 877 EPIPHANY_FUNCTION_INTERRUPT
d19f5793 878};
879
83debce3 880#define EPIPHANY_INTERRUPT_P(TYPE) ((TYPE) == EPIPHANY_FUNCTION_INTERRUPT)
d19f5793 881
882/* Compute the type of a function from its DECL. */
883
884#define IMMEDIATE_PREFIX "#"
885
886#define OPTIMIZE_MODE_SWITCHING(ENTITY) \
887 (epiphany_optimize_mode_switching (ENTITY))
888
889/* We have two fake entities for lazy code motion of the mask constants,
890 one entity each for round-to-nearest / truncating
891 with a different idea what FP_MODE_ROUND_UNKNOWN will be, and
892 finally an entity that runs in a second mode switching pass to
893 resolve FP_MODE_ROUND_UNKNOWN. */
894#define NUM_MODES_FOR_MODE_SWITCHING \
c85716aa 895 { 2, 2, 2, \
896 FP_MODE_NONE, FP_MODE_NONE, FP_MODE_NONE, FP_MODE_NONE, FP_MODE_NONE }
d19f5793 897
d19f5793 898#define TARGET_INSERT_MODE_SWITCH_USE epiphany_insert_mode_switch_use
899
900/* Mode switching entities. */
901enum
902{
903 EPIPHANY_MSW_ENTITY_AND,
904 EPIPHANY_MSW_ENTITY_OR,
c85716aa 905 EPIPHANY_MSW_ENTITY_CONFIG, /* 1 means config is known or saved. */
d19f5793 906 EPIPHANY_MSW_ENTITY_NEAREST,
907 EPIPHANY_MSW_ENTITY_TRUNC,
908 EPIPHANY_MSW_ENTITY_ROUND_UNKNOWN,
909 EPIPHANY_MSW_ENTITY_ROUND_KNOWN,
c85716aa 910 EPIPHANY_MSW_ENTITY_FPU_OMNIBUS,
911 EPIPHANY_MSW_ENTITY_NUM
d19f5793 912};
913
914extern int epiphany_normal_fp_rounding;
e5f9891c 915#ifndef IN_LIBGCC2
cbe8bda8 916extern rtl_opt_pass *make_pass_mode_switch_use (gcc::context *ctxt);
917extern rtl_opt_pass *make_pass_resolve_sw_modes (gcc::context *ctxt);
e5f9891c 918#endif
d19f5793 919
920/* This will need to be adjusted when FP_CONTRACT_ON is properly
921 implemented. */
922#define TARGET_FUSED_MADD (flag_fp_contract_mode == FP_CONTRACT_FAST)
923
3ea98387 924#undef ASM_DECLARE_FUNCTION_NAME
925#define ASM_DECLARE_FUNCTION_NAME(FILE, NAME, DECL) \
926 epiphany_start_function ((FILE), (NAME), (DECL))
927
e8f53f72 928/* This is how we tell the assembler that two symbols have the same value. */
929#define ASM_OUTPUT_DEF(FILE, NAME1, NAME2) \
930 do \
931 { \
932 assemble_name (FILE, NAME1); \
933 fputs (" = ", FILE); \
934 assemble_name (FILE, NAME2); \
935 fputc ('\n', FILE); \
936 } \
937 while (0)
938
d19f5793 939#endif /* !GCC_EPIPHANY_H */