1 /* Definitions for the Blackfin port.
2 Copyright (C) 2005, 2007, 2008 Free Software Foundation, Inc.
3 Contributed by Analog Devices.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published
9 by the Free Software Foundation; either version 3, or (at your
10 option) any later version.
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 License for more details.
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/>. */
24 #define OBJECT_FORMAT_ELF
29 /* Print subsidiary information on the compiler version in use. */
30 #define TARGET_VERSION fprintf (stderr, " (BlackFin bfin)")
32 /* Run-time compilation parameters selecting different hardware subsets. */
34 extern int target_flags;
36 #ifndef DEFAULT_CPU_TYPE
37 #define DEFAULT_CPU_TYPE BFIN_CPU_BF532
40 /* Predefinition in the preprocessor for this target machine */
41 #ifndef TARGET_CPU_CPP_BUILTINS
42 #define TARGET_CPU_CPP_BUILTINS() \
45 builtin_define_std ("bfin"); \
46 builtin_define_std ("BFIN"); \
47 builtin_define ("__ADSPBLACKFIN__"); \
48 builtin_define ("__ADSPLPBLACKFIN__"); \
50 switch (bfin_cpu_type) \
52 case BFIN_CPU_BF522: \
53 builtin_define ("__ADSPBF522__"); \
54 builtin_define ("__ADSPBF52x__"); \
56 case BFIN_CPU_BF523: \
57 builtin_define ("__ADSPBF523__"); \
58 builtin_define ("__ADSPBF52x__"); \
60 case BFIN_CPU_BF524: \
61 builtin_define ("__ADSPBF524__"); \
62 builtin_define ("__ADSPBF52x__"); \
64 case BFIN_CPU_BF525: \
65 builtin_define ("__ADSPBF525__"); \
66 builtin_define ("__ADSPBF52x__"); \
68 case BFIN_CPU_BF526: \
69 builtin_define ("__ADSPBF526__"); \
70 builtin_define ("__ADSPBF52x__"); \
72 case BFIN_CPU_BF527: \
73 builtin_define ("__ADSPBF527__"); \
74 builtin_define ("__ADSPBF52x__"); \
76 case BFIN_CPU_BF531: \
77 builtin_define ("__ADSPBF531__"); \
79 case BFIN_CPU_BF532: \
80 builtin_define ("__ADSPBF532__"); \
82 case BFIN_CPU_BF533: \
83 builtin_define ("__ADSPBF533__"); \
85 case BFIN_CPU_BF534: \
86 builtin_define ("__ADSPBF534__"); \
88 case BFIN_CPU_BF536: \
89 builtin_define ("__ADSPBF536__"); \
91 case BFIN_CPU_BF537: \
92 builtin_define ("__ADSPBF537__"); \
94 case BFIN_CPU_BF538: \
95 builtin_define ("__ADSPBF538__"); \
97 case BFIN_CPU_BF539: \
98 builtin_define ("__ADSPBF539__"); \
100 case BFIN_CPU_BF542: \
101 builtin_define ("__ADSPBF542__"); \
102 builtin_define ("__ADSPBF54x__"); \
104 case BFIN_CPU_BF544: \
105 builtin_define ("__ADSPBF544__"); \
106 builtin_define ("__ADSPBF54x__"); \
108 case BFIN_CPU_BF548: \
109 builtin_define ("__ADSPBF548__"); \
110 builtin_define ("__ADSPBF54x__"); \
112 case BFIN_CPU_BF547: \
113 builtin_define ("__ADSPBF547__"); \
114 builtin_define ("__ADSPBF54x__"); \
116 case BFIN_CPU_BF549: \
117 builtin_define ("__ADSPBF549__"); \
118 builtin_define ("__ADSPBF54x__"); \
120 case BFIN_CPU_BF561: \
121 builtin_define ("__ADSPBF561__"); \
125 if (bfin_si_revision != -1) \
127 /* space of 0xnnnn and a NUL */ \
128 char *buf = alloca (7); \
130 sprintf (buf, "0x%04x", bfin_si_revision); \
131 builtin_define_with_value ("__SILICON_REVISION__", buf, 0); \
134 if (bfin_workarounds) \
135 builtin_define ("__WORKAROUNDS_ENABLED"); \
136 if (ENABLE_WA_SPECULATIVE_LOADS) \
137 builtin_define ("__WORKAROUND_SPECULATIVE_LOADS"); \
138 if (ENABLE_WA_SPECULATIVE_SYNCS) \
139 builtin_define ("__WORKAROUND_SPECULATIVE_SYNCS"); \
143 builtin_define ("__BFIN_FDPIC__"); \
144 builtin_define ("__FDPIC__"); \
146 if (TARGET_ID_SHARED_LIBRARY \
147 && !TARGET_SEP_DATA) \
148 builtin_define ("__ID_SHARED_LIB__"); \
149 if (flag_no_builtin) \
150 builtin_define ("__NO_BUILTIN"); \
155 #define DRIVER_SELF_SPECS SUBTARGET_DRIVER_SELF_SPECS "\
156 %{!mcpu=*:-mcpu=bf532} \
157 %{mleaf-id-shared-library:%{!mid-shared-library:-mid-shared-library}} \
158 %{mfdpic:%{!fpic:%{!fpie:%{!fPIC:%{!fPIE:\
159 %{!fno-pic:%{!fno-pie:%{!fno-PIC:%{!fno-PIE:-fpie}}}}}}}}} \
161 #ifndef SUBTARGET_DRIVER_SELF_SPECS
162 # define SUBTARGET_DRIVER_SELF_SPECS
165 #define LINK_GCC_C_SEQUENCE_SPEC "\
166 %{mfast-fp:-lbffastfp} %G %L %{mfast-fp:-lbffastfp} %G \
169 /* A C string constant that tells the GCC driver program options to pass to
170 the assembler. It can also specify how to translate options you give to GNU
171 CC into options for GCC to pass to the assembler. See the file `sun3.h'
172 for an example of this.
174 Do not define this macro if it does not need to do anything.
176 Defined in svr4.h. */
179 %{G*} %{v} %{n} %{T} %{Ym,*} %{Yd,*} %{Wa,*:%*} \
180 %{mno-fdpic:-mnopic} %{mfdpic}"
185 %{mfdpic:-melf32bfinfd -z text} \
186 %{static:-dn -Bstatic} \
187 %{shared:-G -Bdynamic} \
188 %{symbolic:-Bsymbolic} \
192 -init __init -fini __fini "
194 /* Generate DSP instructions, like DSP halfword loads */
195 #define TARGET_DSP (1)
197 #define TARGET_DEFAULT 0
199 /* Maximum number of library ids we permit */
200 #define MAX_LIBRARY_ID 255
202 extern const char *bfin_library_id_string;
204 /* Sometimes certain combinations of command options do not make
205 sense on a particular target machine. You can define a macro
206 `OVERRIDE_OPTIONS' to take account of this. This macro, if
207 defined, is executed once just after all the command options have
210 Don't use this macro to turn on various extra optimizations for
211 `-O'. That is what `OPTIMIZATION_OPTIONS' is for. */
213 #define OVERRIDE_OPTIONS override_options ()
215 #define FUNCTION_MODE SImode
218 /* store-condition-codes instructions store 0 for false
219 This is the value stored for true. */
220 #define STORE_FLAG_VALUE 1
222 /* Define this if pushing a word on the stack
223 makes the stack pointer a smaller address. */
224 #define STACK_GROWS_DOWNWARD
226 #define STACK_PUSH_CODE PRE_DEC
228 /* Define this to nonzero if the nominal address of the stack frame
229 is at the high-address end of the local variables;
230 that is, each additional local variable allocated
231 goes at a more negative offset in the frame. */
232 #define FRAME_GROWS_DOWNWARD 1
234 /* We define a dummy ARGP register; the parameters start at offset 0 from
236 #define FIRST_PARM_OFFSET(DECL) 0
238 /* Offset within stack frame to start allocating local variables at.
239 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
240 first local allocated. Otherwise, it is the offset to the BEGINNING
241 of the first local allocated. */
242 #define STARTING_FRAME_OFFSET 0
244 /* Register to use for pushing function arguments. */
245 #define STACK_POINTER_REGNUM REG_P6
247 /* Base register for access to local variables of the function. */
248 #define FRAME_POINTER_REGNUM REG_P7
250 /* A dummy register that will be eliminated to either FP or SP. */
251 #define ARG_POINTER_REGNUM REG_ARGP
253 /* `PIC_OFFSET_TABLE_REGNUM'
254 The register number of the register used to address a table of
255 static data addresses in memory. In some cases this register is
256 defined by a processor's "application binary interface" (ABI).
257 When this macro is defined, RTL is generated for this register
258 once, as with the stack pointer and frame pointer registers. If
259 this macro is not defined, it is up to the machine-dependent files
260 to allocate such a register (if necessary). */
261 #define PIC_OFFSET_TABLE_REGNUM (REG_P5)
263 #define FDPIC_FPTR_REGNO REG_P1
264 #define FDPIC_REGNO REG_P3
265 #define OUR_FDPIC_REG get_hard_reg_initial_val (SImode, FDPIC_REGNO)
267 /* A static chain register for nested functions. We need to use a
268 call-clobbered register for this. */
269 #define STATIC_CHAIN_REGNUM REG_P2
271 /* Define this if functions should assume that stack space has been
272 allocated for arguments even when their values are passed in
275 The value of this macro is the size, in bytes, of the area reserved for
276 arguments passed in registers.
278 This space can either be allocated by the caller or be a part of the
279 machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE'
281 #define FIXED_STACK_AREA 12
282 #define REG_PARM_STACK_SPACE(FNDECL) FIXED_STACK_AREA
284 /* Define this if the above stack space is to be considered part of the
285 * space allocated by the caller. */
286 #define OUTGOING_REG_PARM_STACK_SPACE(FNTYPE) 1
288 /* Define this if the maximum size of all the outgoing args is to be
289 accumulated and pushed during the prologue. The amount can be
290 found in the variable crtl->outgoing_args_size. */
291 #define ACCUMULATE_OUTGOING_ARGS 1
293 /* Value should be nonzero if functions must have frame pointers.
294 Zero means the frame pointer need not be set up (and parms
295 may be accessed via the stack pointer) in functions that seem suitable.
296 This is computed in `reload', in reload1.c.
298 #define FRAME_POINTER_REQUIRED (bfin_frame_pointer_required ())
300 /*#define DATA_ALIGNMENT(TYPE, BASIC-ALIGN) for arrays.. */
302 /* If defined, a C expression to compute the alignment for a local
303 variable. TYPE is the data type, and ALIGN is the alignment that
304 the object would ordinarily have. The value of this macro is used
305 instead of that alignment to align the object.
307 If this macro is not defined, then ALIGN is used.
309 One use of this macro is to increase alignment of medium-size
310 data to make it all fit in fewer cache lines. */
312 #define LOCAL_ALIGNMENT(TYPE, ALIGN) bfin_local_alignment ((TYPE), (ALIGN))
314 /* Make strings word-aligned so strcpy from constants will be faster. */
315 #define CONSTANT_ALIGNMENT(EXP, ALIGN) \
316 (TREE_CODE (EXP) == STRING_CST \
317 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
319 #define TRAMPOLINE_SIZE (TARGET_FDPIC ? 30 : 18)
320 #define TRAMPOLINE_TEMPLATE(FILE) \
323 fprintf(FILE, "\t.dd\t0x00000000\n"); /* 0 */ \
324 fprintf(FILE, "\t.dd\t0x00000000\n"); /* 0 */ \
325 fprintf(FILE, "\t.dd\t0x0000e109\n"); /* p1.l = fn low */ \
326 fprintf(FILE, "\t.dd\t0x0000e149\n"); /* p1.h = fn high */ \
327 fprintf(FILE, "\t.dd\t0x0000e10a\n"); /* p2.l = sc low */ \
328 fprintf(FILE, "\t.dd\t0x0000e14a\n"); /* p2.h = sc high */ \
329 fprintf(FILE, "\t.dw\t0xac4b\n"); /* p3 = [p1 + 4] */ \
330 fprintf(FILE, "\t.dw\t0x9149\n"); /* p1 = [p1] */ \
331 fprintf(FILE, "\t.dw\t0x0051\n"); /* jump (p1)*/ \
335 fprintf(FILE, "\t.dd\t0x0000e109\n"); /* p1.l = fn low */ \
336 fprintf(FILE, "\t.dd\t0x0000e149\n"); /* p1.h = fn high */ \
337 fprintf(FILE, "\t.dd\t0x0000e10a\n"); /* p2.l = sc low */ \
338 fprintf(FILE, "\t.dd\t0x0000e14a\n"); /* p2.h = sc high */ \
339 fprintf(FILE, "\t.dw\t0x0051\n"); /* jump (p1)*/ \
342 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
343 initialize_trampoline (TRAMP, FNADDR, CXT)
345 /* Definitions for register eliminations.
347 This is an array of structures. Each structure initializes one pair
348 of eliminable registers. The "from" register number is given first,
349 followed by "to". Eliminations of the same "from" register are listed
350 in order of preference.
352 There are two registers that can always be eliminated on the i386.
353 The frame pointer and the arg pointer can be replaced by either the
354 hard frame pointer or to the stack pointer, depending upon the
355 circumstances. The hard frame pointer is not used before reload and
356 so it is not eligible for elimination. */
358 #define ELIMINABLE_REGS \
359 {{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
360 { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM}, \
361 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}} \
363 /* Given FROM and TO register numbers, say whether this elimination is
364 allowed. Frame pointer elimination is automatically handled.
366 All other eliminations are valid. */
368 #define CAN_ELIMINATE(FROM, TO) \
369 ((TO) == STACK_POINTER_REGNUM ? ! frame_pointer_needed : 1)
371 /* Define the offset between two registers, one to be eliminated, and the other
372 its replacement, at the start of a routine. */
374 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
375 ((OFFSET) = bfin_initial_elimination_offset ((FROM), (TO)))
377 /* This processor has
378 8 data register for doing arithmetic
379 8 pointer register for doing addressing, including
382 4 sets of indexing registers (I0-3, B0-3, L0-3, M0-3)
383 1 condition code flag register CC
384 5 return address registers RETS/I/X/N/E
385 1 arithmetic status register (ASTAT). */
387 #define FIRST_PSEUDO_REGISTER 50
389 #define D_REGNO_P(X) ((X) <= REG_R7)
390 #define P_REGNO_P(X) ((X) >= REG_P0 && (X) <= REG_P7)
391 #define I_REGNO_P(X) ((X) >= REG_I0 && (X) <= REG_I3)
392 #define DP_REGNO_P(X) (D_REGNO_P (X) || P_REGNO_P (X))
393 #define ADDRESS_REGNO_P(X) ((X) >= REG_P0 && (X) <= REG_M3)
394 #define DREG_P(X) (REG_P (X) && D_REGNO_P (REGNO (X)))
395 #define PREG_P(X) (REG_P (X) && P_REGNO_P (REGNO (X)))
396 #define IREG_P(X) (REG_P (X) && I_REGNO_P (REGNO (X)))
397 #define DPREG_P(X) (REG_P (X) && DP_REGNO_P (REGNO (X)))
399 #define REGISTER_NAMES { \
400 "R0", "R1", "R2", "R3", "R4", "R5", "R6", "R7", \
401 "P0", "P1", "P2", "P3", "P4", "P5", "SP", "FP", \
402 "I0", "I1", "I2", "I3", "B0", "B1", "B2", "B3", \
403 "L0", "L1", "L2", "L3", "M0", "M1", "M2", "M3", \
406 "RETS", "RETI", "RETX", "RETN", "RETE", "ASTAT", "SEQSTAT", "USP", \
408 "LT0", "LT1", "LC0", "LC1", "LB0", "LB1" \
411 #define SHORT_REGISTER_NAMES { \
412 "R0.L", "R1.L", "R2.L", "R3.L", "R4.L", "R5.L", "R6.L", "R7.L", \
413 "P0.L", "P1.L", "P2.L", "P3.L", "P4.L", "P5.L", "SP.L", "FP.L", \
414 "I0.L", "I1.L", "I2.L", "I3.L", "B0.L", "B1.L", "B2.L", "B3.L", \
415 "L0.L", "L1.L", "L2.L", "L3.L", "M0.L", "M1.L", "M2.L", "M3.L", }
417 #define HIGH_REGISTER_NAMES { \
418 "R0.H", "R1.H", "R2.H", "R3.H", "R4.H", "R5.H", "R6.H", "R7.H", \
419 "P0.H", "P1.H", "P2.H", "P3.H", "P4.H", "P5.H", "SP.H", "FP.H", \
420 "I0.H", "I1.H", "I2.H", "I3.H", "B0.H", "B1.H", "B2.H", "B3.H", \
421 "L0.H", "L1.H", "L2.H", "L3.H", "M0.H", "M1.H", "M2.H", "M3.H", }
423 #define DREGS_PAIR_NAMES { \
424 "R1:0.p", 0, "R3:2.p", 0, "R5:4.p", 0, "R7:6.p", 0, }
426 #define BYTE_REGISTER_NAMES { \
427 "R0.B", "R1.B", "R2.B", "R3.B", "R4.B", "R5.B", "R6.B", "R7.B", }
430 /* 1 for registers that have pervasive standard uses
431 and are not available for the register allocator. */
433 #define FIXED_REGISTERS \
434 /*r0 r1 r2 r3 r4 r5 r6 r7 p0 p1 p2 p3 p4 p5 p6 p7 */ \
435 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, \
436 /*i0 i1 i2 i3 b0 b1 b2 b3 l0 l1 l2 l3 m0 m1 m2 m3 */ \
437 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, \
438 /*a0 a1 cc rets/i/x/n/e astat seqstat usp argp lt0/1 lc0/1 */ \
439 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
444 /* 1 for registers not available across function calls.
445 These must include the FIXED_REGISTERS and also any
446 registers that can be used without being saved.
447 The latter must include the registers where values are returned
448 and the register where structure-value addresses are passed.
449 Aside from that, you can include as many other registers as you like. */
451 #define CALL_USED_REGISTERS \
452 /*r0 r1 r2 r3 r4 r5 r6 r7 p0 p1 p2 p3 p4 p5 p6 p7 */ \
453 { 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, \
454 /*i0 i1 i2 i3 b0 b1 b2 b3 l0 l1 l2 l3 m0 m1 m2 m3 */ \
455 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
456 /*a0 a1 cc rets/i/x/n/e astat seqstat usp argp lt0/1 lc0/1 */ \
457 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, \
462 /* Order in which to allocate registers. Each register must be
463 listed once, even those in FIXED_REGISTERS. List frame pointer
464 late and fixed registers last. Note that, in general, we prefer
465 registers listed in CALL_USED_REGISTERS, keeping the others
466 available for storage of persistent values. */
468 #define REG_ALLOC_ORDER \
469 { REG_R0, REG_R1, REG_R2, REG_R3, REG_R7, REG_R6, REG_R5, REG_R4, \
470 REG_P2, REG_P1, REG_P0, REG_P5, REG_P4, REG_P3, REG_P6, REG_P7, \
472 REG_I0, REG_I1, REG_I2, REG_I3, REG_B0, REG_B1, REG_B2, REG_B3, \
473 REG_L0, REG_L1, REG_L2, REG_L3, REG_M0, REG_M1, REG_M2, REG_M3, \
474 REG_RETS, REG_RETI, REG_RETX, REG_RETN, REG_RETE, \
475 REG_ASTAT, REG_SEQSTAT, REG_USP, \
477 REG_LT0, REG_LT1, REG_LC0, REG_LC1, REG_LB0, REG_LB1 \
480 /* Macro to conditionally modify fixed_regs/call_used_regs. */
481 #define CONDITIONAL_REGISTER_USAGE \
483 conditional_register_usage(); \
485 call_used_regs[FDPIC_REGNO] = 1; \
486 if (!TARGET_FDPIC && flag_pic) \
488 fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
489 call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1; \
493 /* Define the classes of registers for register constraints in the
494 machine description. Also define ranges of constants.
496 One of the classes must always be named ALL_REGS and include all hard regs.
497 If there is more than one class, another class must be named NO_REGS
498 and contain no registers.
500 The name GENERAL_REGS must be the name of a class (or an alias for
501 another name such as ALL_REGS). This is the class of registers
502 that is allowed by "g" or "r" in a register constraint.
503 Also, registers outside this class are allocated only when
504 instructions express preferences for them.
506 The classes must be numbered in nondecreasing order; that is,
507 a larger-numbered class must never be contained completely
508 in a smaller-numbered class.
510 For any two classes, it is very desirable that there be another
511 class that represents their union. */
521 CIRCREGS, /* Circular buffering registers, Ix, Bx, Lx together form. See Automatic Circular Buffering. */
551 ALL_REGS, LIM_REG_CLASSES
554 #define N_REG_CLASSES ((int)LIM_REG_CLASSES)
556 #define GENERAL_REGS DPREGS
558 /* Give names of register classes as strings for dump file. */
560 #define REG_CLASS_NAMES \
598 /* An initializer containing the contents of the register classes, as integers
599 which are bit masks. The Nth integer specifies the contents of class N.
600 The way the integer MASK is interpreted is that register R is in the class
601 if `MASK & (1 << R)' is 1.
603 When the machine has more than 32 registers, an integer does not suffice.
604 Then the integers are replaced by sub-initializers, braced groupings
605 containing several integers. Each sub-initializer must be suitable as an
606 initializer for the type `HARD_REG_SET' which is defined in
609 /* NOTE: DSP registers, IREGS - AREGS, are not GENERAL_REGS. We use
610 MOST_REGS as the union of DPREGS and DAGREGS. */
612 #define REG_CLASS_CONTENTS \
614 { { 0x00000000, 0 }, /* NO_REGS */ \
615 { 0x000f0000, 0 }, /* IREGS */ \
616 { 0x00f00000, 0 }, /* BREGS */ \
617 { 0x0f000000, 0 }, /* LREGS */ \
618 { 0xf0000000, 0 }, /* MREGS */ \
619 { 0x0fff0000, 0 }, /* CIRCREGS */ \
620 { 0xffff0000, 0 }, /* DAGREGS */ \
621 { 0x00000000, 0x1 }, /* EVEN_AREGS */ \
622 { 0x00000000, 0x2 }, /* ODD_AREGS */ \
623 { 0x00000000, 0x3 }, /* AREGS */ \
624 { 0x00000000, 0x4 }, /* CCREGS */ \
625 { 0x00000055, 0 }, /* EVEN_DREGS */ \
626 { 0x000000aa, 0 }, /* ODD_DREGS */ \
627 { 0x00000001, 0 }, /* D0REGS */ \
628 { 0x00000002, 0 }, /* D1REGS */ \
629 { 0x00000004, 0 }, /* D2REGS */ \
630 { 0x00000008, 0 }, /* D3REGS */ \
631 { 0x00000010, 0 }, /* D4REGS */ \
632 { 0x00000020, 0 }, /* D5REGS */ \
633 { 0x00000040, 0 }, /* D6REGS */ \
634 { 0x00000080, 0 }, /* D7REGS */ \
635 { 0x000000ff, 0 }, /* DREGS */ \
636 { 0x00000100, 0x000 }, /* P0REGS */ \
637 { 0x00000800, 0x000 }, /* FDPIC_REGS */ \
638 { 0x00000200, 0x000 }, /* FDPIC_FPTR_REGS */ \
639 { 0x00004700, 0x800 }, /* PREGS_CLOBBERED */ \
640 { 0x0000ff00, 0x800 }, /* PREGS */ \
641 { 0x000fff00, 0x800 }, /* IPREGS */ \
642 { 0x0000ffff, 0x800 }, /* DPREGS */ \
643 { 0xffffffff, 0x800 }, /* MOST_REGS */\
644 { 0x00000000, 0x3000 }, /* LT_REGS */\
645 { 0x00000000, 0xc000 }, /* LC_REGS */\
646 { 0x00000000, 0x30000 }, /* LB_REGS */\
647 { 0x00000000, 0x3f7f8 }, /* PROLOGUE_REGS */\
648 { 0xffffffff, 0x3fff8 }, /* NON_A_CC_REGS */\
649 { 0xffffffff, 0x3ffff }} /* ALL_REGS */
651 #define IREG_POSSIBLE_P(OUTER) \
652 ((OUTER) == POST_INC || (OUTER) == PRE_INC \
653 || (OUTER) == POST_DEC || (OUTER) == PRE_DEC \
654 || (OUTER) == MEM || (OUTER) == ADDRESS)
656 #define MODE_CODE_BASE_REG_CLASS(MODE, OUTER, INDEX) \
657 ((MODE) == HImode && IREG_POSSIBLE_P (OUTER) ? IPREGS : PREGS)
659 #define INDEX_REG_CLASS PREGS
661 #define REGNO_OK_FOR_BASE_STRICT_P(X, MODE, OUTER, INDEX) \
662 (P_REGNO_P (X) || (X) == REG_ARGP \
663 || (IREG_POSSIBLE_P (OUTER) && (MODE) == HImode \
666 #define REGNO_OK_FOR_BASE_NONSTRICT_P(X, MODE, OUTER, INDEX) \
667 ((X) >= FIRST_PSEUDO_REGISTER \
668 || REGNO_OK_FOR_BASE_STRICT_P (X, MODE, OUTER, INDEX))
671 #define REGNO_MODE_CODE_OK_FOR_BASE_P(X, MODE, OUTER, INDEX) \
672 REGNO_OK_FOR_BASE_STRICT_P (X, MODE, OUTER, INDEX)
674 #define REGNO_MODE_CODE_OK_FOR_BASE_P(X, MODE, OUTER, INDEX) \
675 REGNO_OK_FOR_BASE_NONSTRICT_P (X, MODE, OUTER, INDEX)
678 #define REGNO_OK_FOR_INDEX_P(X) 0
680 /* The same information, inverted:
681 Return the class number of the smallest class containing
682 reg number REGNO. This could be a conditional expression
683 or could index an array. */
685 #define REGNO_REG_CLASS(REGNO) \
686 ((REGNO) == REG_R0 ? D0REGS \
687 : (REGNO) == REG_R1 ? D1REGS \
688 : (REGNO) == REG_R2 ? D2REGS \
689 : (REGNO) == REG_R3 ? D3REGS \
690 : (REGNO) == REG_R4 ? D4REGS \
691 : (REGNO) == REG_R5 ? D5REGS \
692 : (REGNO) == REG_R6 ? D6REGS \
693 : (REGNO) == REG_R7 ? D7REGS \
694 : (REGNO) == REG_P0 ? P0REGS \
695 : (REGNO) < REG_I0 ? PREGS \
696 : (REGNO) == REG_ARGP ? PREGS \
697 : (REGNO) >= REG_I0 && (REGNO) <= REG_I3 ? IREGS \
698 : (REGNO) >= REG_L0 && (REGNO) <= REG_L3 ? LREGS \
699 : (REGNO) >= REG_B0 && (REGNO) <= REG_B3 ? BREGS \
700 : (REGNO) >= REG_M0 && (REGNO) <= REG_M3 ? MREGS \
701 : (REGNO) == REG_A0 || (REGNO) == REG_A1 ? AREGS \
702 : (REGNO) == REG_LT0 || (REGNO) == REG_LT1 ? LT_REGS \
703 : (REGNO) == REG_LC0 || (REGNO) == REG_LC1 ? LC_REGS \
704 : (REGNO) == REG_LB0 || (REGNO) == REG_LB1 ? LB_REGS \
705 : (REGNO) == REG_CC ? CCREGS \
706 : (REGNO) >= REG_RETS ? PROLOGUE_REGS \
709 /* When defined, the compiler allows registers explicitly used in the
710 rtl to be used as spill registers but prevents the compiler from
711 extending the lifetime of these registers. */
712 #define SMALL_REGISTER_CLASSES 1
714 #define CLASS_LIKELY_SPILLED_P(CLASS) \
715 ((CLASS) == PREGS_CLOBBERED \
716 || (CLASS) == PROLOGUE_REGS \
717 || (CLASS) == P0REGS \
718 || (CLASS) == D0REGS \
719 || (CLASS) == D1REGS \
720 || (CLASS) == D2REGS \
721 || (CLASS) == CCREGS)
723 /* Do not allow to store a value in REG_CC for any mode */
724 /* Do not allow to store value in pregs if mode is not SI*/
725 #define HARD_REGNO_MODE_OK(REGNO, MODE) hard_regno_mode_ok((REGNO), (MODE))
727 /* Return the maximum number of consecutive registers
728 needed to represent mode MODE in a register of class CLASS. */
729 #define CLASS_MAX_NREGS(CLASS, MODE) \
730 ((MODE) == V2PDImode && (CLASS) == AREGS ? 2 \
731 : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))
733 #define HARD_REGNO_NREGS(REGNO, MODE) \
734 ((MODE) == PDImode && ((REGNO) == REG_A0 || (REGNO) == REG_A1) ? 1 \
735 : (MODE) == V2PDImode && ((REGNO) == REG_A0 || (REGNO) == REG_A1) ? 2 \
736 : CLASS_MAX_NREGS (GENERAL_REGS, MODE))
738 /* A C expression that is nonzero if hard register TO can be
739 considered for use as a rename register for FROM register */
740 #define HARD_REGNO_RENAME_OK(FROM, TO) bfin_hard_regno_rename_ok (FROM, TO)
742 /* A C expression that is nonzero if it is desirable to choose
743 register allocation so as to avoid move instructions between a
744 value of mode MODE1 and a value of mode MODE2.
746 If `HARD_REGNO_MODE_OK (R, MODE1)' and `HARD_REGNO_MODE_OK (R,
747 MODE2)' are ever different for any R, then `MODES_TIEABLE_P (MODE1,
748 MODE2)' must be zero. */
749 #define MODES_TIEABLE_P(MODE1, MODE2) \
750 ((MODE1) == (MODE2) \
751 || ((GET_MODE_CLASS (MODE1) == MODE_INT \
752 || GET_MODE_CLASS (MODE1) == MODE_FLOAT) \
753 && (GET_MODE_CLASS (MODE2) == MODE_INT \
754 || GET_MODE_CLASS (MODE2) == MODE_FLOAT) \
755 && (MODE1) != BImode && (MODE2) != BImode \
756 && GET_MODE_SIZE (MODE1) <= UNITS_PER_WORD \
757 && GET_MODE_SIZE (MODE2) <= UNITS_PER_WORD))
759 /* `PREFERRED_RELOAD_CLASS (X, CLASS)'
760 A C expression that places additional restrictions on the register
761 class to use when it is necessary to copy value X into a register
762 in class CLASS. The value is a register class; perhaps CLASS, or
763 perhaps another, smaller class. */
764 #define PREFERRED_RELOAD_CLASS(X, CLASS) \
765 (GET_CODE (X) == POST_INC \
766 || GET_CODE (X) == POST_DEC \
767 || GET_CODE (X) == PRE_DEC ? PREGS : (CLASS))
769 /* Function Calling Conventions. */
771 /* The type of the current function; normal functions are of type
774 SUBROUTINE, INTERRUPT_HANDLER, EXCPT_HANDLER, NMI_HANDLER
777 #define FUNCTION_ARG_REGISTERS { REG_R0, REG_R1, REG_R2, -1 }
779 /* Flags for the call/call_value rtl operations set up by function_arg */
780 #define CALL_NORMAL 0x00000000 /* no special processing */
781 #define CALL_LONG 0x00000001 /* always call indirect */
782 #define CALL_SHORT 0x00000002 /* always call by symbol */
785 int words; /* # words passed so far */
786 int nregs; /* # registers available for passing */
787 int *arg_regs; /* array of register -1 terminated */
788 int call_cookie; /* Do special things for this call */
791 /* Define where to put the arguments to a function.
792 Value is zero to push the argument on the stack,
793 or a hard register in which to store the argument.
795 MODE is the argument's machine mode.
796 TYPE is the data type of the argument (as a tree).
797 This is null for libcalls where that information may
799 CUM is a variable of type CUMULATIVE_ARGS which gives info about
800 the preceding args and about the function being called.
801 NAMED is nonzero if this argument is a named parameter
802 (otherwise it is an extra parameter matching an ellipsis). */
804 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
805 (function_arg (&CUM, MODE, TYPE, NAMED))
807 #define FUNCTION_ARG_REGNO_P(REGNO) function_arg_regno_p (REGNO)
810 /* Initialize a variable CUM of type CUMULATIVE_ARGS
811 for a call to a function whose data type is FNTYPE.
812 For a library call, FNTYPE is 0. */
813 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT, N_NAMED_ARGS) \
814 (init_cumulative_args (&CUM, FNTYPE, LIBNAME))
816 /* Update the data in CUM to advance over an argument
817 of mode MODE and data type TYPE.
818 (TYPE is null for libcalls where that information may not be available.) */
819 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
820 (function_arg_advance (&CUM, MODE, TYPE, NAMED))
822 #define RETURN_POPS_ARGS(FDECL, FUNTYPE, STKSIZE) 0
824 /* Define how to find the value returned by a function.
825 VALTYPE is the data type of the value (as a tree).
826 If the precise function being called is known, FUNC is its FUNCTION_DECL;
827 otherwise, FUNC is 0.
830 #define VALUE_REGNO(MODE) (REG_R0)
832 #define FUNCTION_VALUE(VALTYPE, FUNC) \
833 gen_rtx_REG (TYPE_MODE (VALTYPE), \
834 VALUE_REGNO(TYPE_MODE(VALTYPE)))
836 /* Define how to find the value returned by a library function
837 assuming the value has mode MODE. */
839 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, VALUE_REGNO(MODE))
841 #define FUNCTION_VALUE_REGNO_P(N) ((N) == REG_R0)
843 #define DEFAULT_PCC_STRUCT_RETURN 0
844 #define TARGET_RETURN_IN_MEMORY bfin_return_in_memory
846 /* Before the prologue, the return address is in the RETS register. */
847 #define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, REG_RETS)
849 #define RETURN_ADDR_RTX(COUNT, FRAME) bfin_return_addr_rtx (COUNT)
851 #define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (REG_RETS)
853 /* Call instructions don't modify the stack pointer on the Blackfin. */
854 #define INCOMING_FRAME_SP_OFFSET 0
856 /* Describe how we implement __builtin_eh_return. */
857 #define EH_RETURN_DATA_REGNO(N) ((N) < 2 ? (N) : INVALID_REGNUM)
858 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, REG_P2)
859 #define EH_RETURN_HANDLER_RTX \
860 gen_frame_mem (Pmode, plus_constant (frame_pointer_rtx, UNITS_PER_WORD))
862 /* Addressing Modes */
864 /* Recognize any constant value that is a valid address. */
865 #define CONSTANT_ADDRESS_P(X) (CONSTANT_P (X))
867 /* Nonzero if the constant value X is a legitimate general operand.
868 symbol_ref are not legitimate and will be put into constant pool.
869 See force_const_mem().
870 If -mno-pool, all constants are legitimate.
872 #define LEGITIMATE_CONSTANT_P(X) bfin_legitimate_constant_p (X)
874 /* A number, the maximum number of registers that can appear in a
875 valid memory address. Note that it is up to you to specify a
876 value equal to the maximum number that `GO_IF_LEGITIMATE_ADDRESS'
877 would ever accept. */
878 #define MAX_REGS_PER_ADDRESS 1
880 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
881 that is a valid memory address for an instruction.
882 The MODE argument is the machine mode for the MEM expression
883 that wants to use this address.
885 Blackfin addressing modes are as follows:
891 W [ Preg + uimm16m2 ]
899 #define LEGITIMATE_MODE_FOR_AUTOINC_P(MODE) \
900 (GET_MODE_SIZE (MODE) <= 4 || (MODE) == PDImode)
903 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, WIN) \
905 if (bfin_legitimate_address_p (MODE, X, 1)) \
909 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, WIN) \
911 if (bfin_legitimate_address_p (MODE, X, 0)) \
916 /* Try machine-dependent ways of modifying an illegitimate address
917 to be legitimate. If we find one, return the new, valid address.
918 This macro is used in only one place: `memory_address' in explow.c.
920 OLDX is the address as it was before break_out_memory_refs was called.
921 In some cases it is useful to look at this to decide what needs to be done.
923 MODE and WIN are passed so that this macro can use
924 GO_IF_LEGITIMATE_ADDRESS.
926 It is always safe for this macro to do nothing. It exists to recognize
927 opportunities to optimize the output.
929 #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) \
931 rtx _q = legitimize_address(X, OLDX, MODE); \
932 if (_q) { X = _q; goto WIN; } \
935 #define HAVE_POST_INCREMENT 1
936 #define HAVE_POST_DECREMENT 1
937 #define HAVE_PRE_DECREMENT 1
939 /* `LEGITIMATE_PIC_OPERAND_P (X)'
940 A C expression that is nonzero if X is a legitimate immediate
941 operand on the target machine when generating position independent
942 code. You can assume that X satisfies `CONSTANT_P', so you need
943 not check this. You can also assume FLAG_PIC is true, so you need
944 not check it either. You need not define this macro if all
945 constants (including `SYMBOL_REF') can be immediate operands when
946 generating position independent code. */
947 #define LEGITIMATE_PIC_OPERAND_P(X) ! SYMBOLIC_CONST (X)
949 #define SYMBOLIC_CONST(X) \
950 (GET_CODE (X) == SYMBOL_REF \
951 || GET_CODE (X) == LABEL_REF \
952 || (GET_CODE (X) == CONST && symbolic_reference_mentioned_p (X)))
955 A C statement or compound statement with a conditional `goto
956 LABEL;' executed if memory address X (an RTX) can have different
957 meanings depending on the machine mode of the memory reference it
958 is used for or if the address is valid for some modes but not
961 Autoincrement and autodecrement addresses typically have
962 mode-dependent effects because the amount of the increment or
963 decrement is the size of the operand being addressed. Some
964 machines have other mode-dependent addresses. Many RISC machines
965 have no mode-dependent addresses.
967 You may assume that ADDR is a valid address for the machine.
969 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL)
971 #define NOTICE_UPDATE_CC(EXPR, INSN) 0
973 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
974 is done just by pretending it is already truncated. */
975 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
977 /* Max number of bytes we can move from memory to memory
978 in one reasonably fast instruction. */
979 #define MOVE_MAX UNITS_PER_WORD
981 /* If a memory-to-memory move would take MOVE_RATIO or more simple
982 move-instruction pairs, we will do a movmem or libcall instead. */
986 /* STORAGE LAYOUT: target machine storage layout
987 Define this macro as a C expression which is nonzero if accessing
988 less than a word of memory (i.e. a `char' or a `short') is no
989 faster than accessing a word of memory, i.e., if such access
990 require more than one instruction or if there is no difference in
991 cost between byte and (aligned) word loads.
993 When this macro is not defined, the compiler will access a field by
994 finding the smallest containing object; when it is defined, a
995 fullword load will be used if alignment permits. Unless bytes
996 accesses are faster than word accesses, using word accesses is
997 preferable since it may eliminate subsequent memory access if
998 subsequent accesses occur to other fields in the same word of the
999 structure, but to different bytes. */
1000 #define SLOW_BYTE_ACCESS 0
1001 #define SLOW_SHORT_ACCESS 0
1003 /* Define this if most significant bit is lowest numbered
1004 in instructions that operate on numbered bit-fields. */
1005 #define BITS_BIG_ENDIAN 0
1007 /* Define this if most significant byte of a word is the lowest numbered.
1008 We can't access bytes but if we could we would in the Big Endian order. */
1009 #define BYTES_BIG_ENDIAN 0
1011 /* Define this if most significant word of a multiword number is numbered. */
1012 #define WORDS_BIG_ENDIAN 0
1014 /* number of bits in an addressable storage unit */
1015 #define BITS_PER_UNIT 8
1017 /* Width in bits of a "word", which is the contents of a machine register.
1018 Note that this is not necessarily the width of data type `int';
1019 if using 16-bit ints on a 68000, this would still be 32.
1020 But on a machine with 16-bit registers, this would be 16. */
1021 #define BITS_PER_WORD 32
1023 /* Width of a word, in units (bytes). */
1024 #define UNITS_PER_WORD 4
1026 /* Width in bits of a pointer.
1027 See also the macro `Pmode1' defined below. */
1028 #define POINTER_SIZE 32
1030 /* Allocation boundary (in *bits*) for storing pointers in memory. */
1031 #define POINTER_BOUNDARY 32
1033 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
1034 #define PARM_BOUNDARY 32
1036 /* Boundary (in *bits*) on which stack pointer should be aligned. */
1037 #define STACK_BOUNDARY 32
1039 /* Allocation boundary (in *bits*) for the code of a function. */
1040 #define FUNCTION_BOUNDARY 32
1042 /* Alignment of field after `int : 0' in a structure. */
1043 #define EMPTY_FIELD_BOUNDARY BITS_PER_WORD
1045 /* No data type wants to be aligned rounder than this. */
1046 #define BIGGEST_ALIGNMENT 32
1048 /* Define this if move instructions will actually fail to work
1049 when given unaligned data. */
1050 #define STRICT_ALIGNMENT 1
1052 /* (shell-command "rm c-decl.o stor-layout.o")
1053 * never define PCC_BITFIELD_TYPE_MATTERS
1054 * really cause some alignment problem
1057 #define UNITS_PER_FLOAT ((FLOAT_TYPE_SIZE + BITS_PER_UNIT - 1) / \
1060 #define UNITS_PER_DOUBLE ((DOUBLE_TYPE_SIZE + BITS_PER_UNIT - 1) / \
1064 /* what is the 'type' of size_t */
1065 #define SIZE_TYPE "long unsigned int"
1067 /* Define this as 1 if `char' should by default be signed; else as 0. */
1068 #define DEFAULT_SIGNED_CHAR 1
1069 #define FLOAT_TYPE_SIZE BITS_PER_WORD
1070 #define SHORT_TYPE_SIZE 16
1071 #define CHAR_TYPE_SIZE 8
1072 #define INT_TYPE_SIZE 32
1073 #define LONG_TYPE_SIZE 32
1074 #define LONG_LONG_TYPE_SIZE 64
1076 /* Note: Fix this to depend on target switch. -- lev */
1078 /* Note: Try to implement double and force long double. -- tonyko
1079 * #define __DOUBLES_ARE_FLOATS__
1080 * #define DOUBLE_TYPE_SIZE FLOAT_TYPE_SIZE
1081 * #define LONG_DOUBLE_TYPE_SIZE DOUBLE_TYPE_SIZE
1082 * #define DOUBLES_ARE_FLOATS 1
1085 #define DOUBLE_TYPE_SIZE 64
1086 #define LONG_DOUBLE_TYPE_SIZE 64
1088 /* `PROMOTE_MODE (M, UNSIGNEDP, TYPE)'
1089 A macro to update M and UNSIGNEDP when an object whose type is
1090 TYPE and which has the specified mode and signedness is to be
1091 stored in a register. This macro is only called when TYPE is a
1094 On most RISC machines, which only have operations that operate on
1095 a full register, define this macro to set M to `word_mode' if M is
1096 an integer mode narrower than `BITS_PER_WORD'. In most cases,
1097 only integer modes should be widened because wider-precision
1098 floating-point operations are usually more expensive than their
1099 narrower counterparts.
1101 For most machines, the macro definition does not change UNSIGNEDP.
1102 However, some machines, have instructions that preferentially
1103 handle either signed or unsigned quantities of certain modes. For
1104 example, on the DEC Alpha, 32-bit loads from memory and 32-bit add
1105 instructions sign-extend the result to 64 bits. On such machines,
1106 set UNSIGNEDP according to which kind of extension is more
1109 Do not define this macro if it would never modify M.*/
1111 #define BFIN_PROMOTE_MODE_P(MODE) \
1112 (!TARGET_DSP && GET_MODE_CLASS (MODE) == MODE_INT \
1113 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD)
1115 #define PROMOTE_MODE(MODE, UNSIGNEDP, TYPE) \
1116 if (BFIN_PROMOTE_MODE_P(MODE)) \
1118 if (MODE == QImode) \
1120 else if (MODE == HImode) \
1125 /* Describing Relative Costs of Operations */
1127 /* Do not put function addr into constant pool */
1128 #define NO_FUNCTION_CSE 1
1130 /* A C expression for the cost of moving data from a register in class FROM to
1131 one in class TO. The classes are expressed using the enumeration values
1132 such as `GENERAL_REGS'. A value of 2 is the default; other values are
1133 interpreted relative to that.
1135 It is not required that the cost always equal 2 when FROM is the same as TO;
1136 on some machines it is expensive to move between registers if they are not
1137 general registers. */
1139 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1140 bfin_register_move_cost ((MODE), (CLASS1), (CLASS2))
1142 /* A C expression for the cost of moving data of mode M between a
1143 register and memory. A value of 2 is the default; this cost is
1144 relative to those in `REGISTER_MOVE_COST'.
1146 If moving between registers and memory is more expensive than
1147 between two registers, you should define this macro to express the
1150 #define MEMORY_MOVE_COST(MODE, CLASS, IN) \
1151 bfin_memory_move_cost ((MODE), (CLASS), (IN))
1153 /* Specify the machine mode that this machine uses
1154 for the index in the tablejump instruction. */
1155 #define CASE_VECTOR_MODE SImode
1157 #define JUMP_TABLES_IN_TEXT_SECTION flag_pic
1159 /* Define if operations between registers always perform the operation
1160 on the full register even if a narrower mode is specified.
1161 #define WORD_REGISTER_OPERATIONS
1164 /* Evaluates to true if A and B are mac flags that can be used
1165 together in a single multiply insn. That is the case if they are
1166 both the same flag not involving M, or if one is a combination of
1167 the other with M. */
1168 #define MACFLAGS_MATCH_P(A, B) \
1170 || ((A) == MACFLAG_NONE && (B) == MACFLAG_M) \
1171 || ((A) == MACFLAG_M && (B) == MACFLAG_NONE) \
1172 || ((A) == MACFLAG_IS && (B) == MACFLAG_IS_M) \
1173 || ((A) == MACFLAG_IS_M && (B) == MACFLAG_IS))
1175 /* Switch into a generic section. */
1176 #define TARGET_ASM_NAMED_SECTION default_elf_asm_named_section
1178 #define PRINT_OPERAND(FILE, RTX, CODE) print_operand (FILE, RTX, CODE)
1179 #define PRINT_OPERAND_ADDRESS(FILE, RTX) print_address_operand (FILE, RTX)
1181 typedef enum sections {
1187 typedef enum directives {
1196 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) \
1198 || ((C) == '|' && (STR)[1] == '|'))
1200 #define TEXT_SECTION_ASM_OP ".text;"
1201 #define DATA_SECTION_ASM_OP ".data;"
1203 #define ASM_APP_ON ""
1204 #define ASM_APP_OFF ""
1206 #define ASM_GLOBALIZE_LABEL1(FILE, NAME) \
1207 do { fputs (".global ", FILE); \
1208 assemble_name (FILE, NAME); \
1210 fputc ('\n',FILE); \
1213 #define ASM_DECLARE_FUNCTION_NAME(FILE,NAME,DECL) \
1215 fputs (".type ", FILE); \
1216 assemble_name (FILE, NAME); \
1217 fputs (", STT_FUNC", FILE); \
1219 fputc ('\n',FILE); \
1220 ASM_OUTPUT_LABEL(FILE, NAME); \
1223 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1224 do { assemble_name (FILE, NAME); \
1225 fputs (":\n",FILE); \
1228 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1229 do { fprintf (FILE, "_%s", NAME); \
1232 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1233 do { char __buf[256]; \
1234 fprintf (FILE, "\t.dd\t"); \
1235 ASM_GENERATE_INTERNAL_LABEL (__buf, "L", VALUE); \
1236 assemble_name (FILE, __buf); \
1237 fputc (';', FILE); \
1238 fputc ('\n', FILE); \
1241 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1242 MY_ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL)
1244 #define MY_ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) \
1247 fprintf (FILE, "\t.dd\t"); \
1248 ASM_GENERATE_INTERNAL_LABEL (__buf, "L", VALUE); \
1249 assemble_name (FILE, __buf); \
1250 fputs (" - ", FILE); \
1251 ASM_GENERATE_INTERNAL_LABEL (__buf, "L", REL); \
1252 assemble_name (FILE, __buf); \
1253 fputc (';', FILE); \
1254 fputc ('\n', FILE); \
1257 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1260 fprintf (FILE, "\t.align %d\n", 1 << (LOG)); \
1263 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1265 asm_output_skip (FILE, SIZE); \
1268 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1270 switch_to_section (data_section); \
1271 if ((SIZE) >= (unsigned int) 4 ) ASM_OUTPUT_ALIGN(FILE,2); \
1272 ASM_OUTPUT_SIZE_DIRECTIVE (FILE, NAME, SIZE); \
1273 ASM_OUTPUT_LABEL (FILE, NAME); \
1274 fprintf (FILE, "%s %ld;\n", ASM_SPACE, \
1275 (ROUNDED) > (unsigned int) 1 ? (ROUNDED) : 1); \
1278 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1280 ASM_GLOBALIZE_LABEL1(FILE,NAME); \
1281 ASM_OUTPUT_LOCAL (FILE, NAME, SIZE, ROUNDED); } while(0)
1283 #define ASM_COMMENT_START "//"
1285 #define FUNCTION_PROFILER(FILE, LABELNO) \
1287 fprintf (FILE, "\tCALL __mcount;\n"); \
1290 #undef NO_PROFILE_COUNTERS
1291 #define NO_PROFILE_COUNTERS 1
1293 #define ASM_OUTPUT_REG_PUSH(FILE, REGNO) fprintf (FILE, "[SP--] = %s;\n", reg_names[REGNO])
1294 #define ASM_OUTPUT_REG_POP(FILE, REGNO) fprintf (FILE, "%s = [SP++];\n", reg_names[REGNO])
1296 extern struct rtx_def *bfin_compare_op0, *bfin_compare_op1;
1297 extern struct rtx_def *bfin_cc_rtx, *bfin_rets_rtx;
1299 /* This works for GAS and some other assemblers. */
1300 #define SET_ASM_OP ".set "
1302 /* DBX register number for a given compiler register number */
1303 #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1305 #define SIZE_ASM_OP "\t.size\t"
1307 extern int splitting_for_sched;
1309 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) ((CHAR) == '!')
1311 #endif /* _BFIN_CONFIG */