Subversion Repositories openrisc_me

/* Definitions for the Blackfin port.

   Copyright (C) 2005, 2007 Free Software Foundation, Inc.

   Contributed by Analog Devices.

   This file is part of GCC.

   GCC is free software; you can redistribute it and/or modify it

   under the terms of the GNU General Public License as published

   by the Free Software Foundation; either version 3, or (at your

   option) any later version.

   GCC is distributed in the hope that it will be useful, but WITHOUT

   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY

   or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public

   License for more details.

   You should have received a copy of the GNU General Public License

   along with GCC; see the file COPYING3.  If not see

   <http://www.gnu.org/licenses/>.  */

#ifndef _BFIN_CONFIG

#define _BFIN_CONFIG

#define OBJECT_FORMAT_ELF

#define BRT 1

#define BRF 0

/* Print subsidiary information on the compiler version in use.  */

#define TARGET_VERSION fprintf (stderr, " (BlackFin bfin)")

/* Run-time compilation parameters selecting different hardware subsets.  */

extern int target_flags;

/* Predefinition in the preprocessor for this target machine */

#ifndef TARGET_CPU_CPP_BUILTINS

#define TARGET_CPU_CPP_BUILTINS()               \

  do                                            \

    {                                           \

      builtin_define_std ("bfin");              \

      builtin_define_std ("BFIN");              \

      builtin_define ("__ADSPBLACKFIN__");      \

      if (TARGET_FDPIC)                         \

        builtin_define ("__BFIN_FDPIC__");      \

      if (TARGET_ID_SHARED_LIBRARY)             \

        builtin_define ("__ID_SHARED_LIB__");   \

    }                                           \

  while (0)

#endif

#define DRIVER_SELF_SPECS SUBTARGET_DRIVER_SELF_SPECS   "\

 %{mfdpic:%{!fpic:%{!fpie:%{!fPIC:%{!fPIE:\

            %{!fno-pic:%{!fno-pie:%{!fno-PIC:%{!fno-PIE:-fpie}}}}}}}}} \

"

#ifndef SUBTARGET_DRIVER_SELF_SPECS

# define SUBTARGET_DRIVER_SELF_SPECS

#endif

#define LINK_GCC_C_SEQUENCE_SPEC \

  "%{mfdpic:%{!static: %L} %{static: %G %L %G}} \

  %{!mfdpic:%G %L %G}"

/* A C string constant that tells the GCC driver program options to pass to

   the assembler.  It can also specify how to translate options you give to GNU

   CC into options for GCC to pass to the assembler.  See the file `sun3.h'

   for an example of this.

   Do not define this macro if it does not need to do anything.

   Defined in svr4.h.  */

#undef  ASM_SPEC

#define ASM_SPEC "\

%{G*} %{v} %{n} %{T} %{Ym,*} %{Yd,*} %{Wa,*:%*} \

    %{mno-fdpic:-mnopic} %{mfdpic}"

#define LINK_SPEC "\

%{h*} %{v:-V} \

%{b} \

%{mfdpic:-melf32bfinfd -z text} \

%{static:-dn -Bstatic} \

%{shared:-G -Bdynamic} \

%{symbolic:-Bsymbolic} \

%{G*} \

%{YP,*} \

%{Qy:} %{!Qn:-Qy} \

-init __init -fini __fini "

/* Generate DSP instructions, like DSP halfword loads */

#define TARGET_DSP                      (1)

#define TARGET_DEFAULT (MASK_SPECLD_ANOMALY | MASK_CSYNC_ANOMALY)

/* Maximum number of library ids we permit */

#define MAX_LIBRARY_ID 255

extern const char *bfin_library_id_string;

/* Sometimes certain combinations of command options do not make

   sense on a particular target machine.  You can define a macro

   `OVERRIDE_OPTIONS' to take account of this.  This macro, if

   defined, is executed once just after all the command options have

   been parsed.

   Don't use this macro to turn on various extra optimizations for

   `-O'.  That is what `OPTIMIZATION_OPTIONS' is for.  */

#define OVERRIDE_OPTIONS override_options ()

#define FUNCTION_MODE    SImode

#define Pmode            SImode

/* store-condition-codes instructions store 0 for false

   This is the value stored for true.  */

#define STORE_FLAG_VALUE 1

/* Define this if pushing a word on the stack

   makes the stack pointer a smaller address.  */

#define STACK_GROWS_DOWNWARD

#define STACK_PUSH_CODE PRE_DEC

/* Define this to nonzero if the nominal address of the stack frame

   is at the high-address end of the local variables;

   that is, each additional local variable allocated

   goes at a more negative offset in the frame.  */

#define FRAME_GROWS_DOWNWARD 1

/* We define a dummy ARGP register; the parameters start at offset 0 from

   it. */

#define FIRST_PARM_OFFSET(DECL) 0

/* Offset within stack frame to start allocating local variables at.

   If FRAME_GROWS_DOWNWARD, this is the offset to the END of the

   first local allocated.  Otherwise, it is the offset to the BEGINNING

   of the first local allocated.  */

#define STARTING_FRAME_OFFSET 0

/* Register to use for pushing function arguments.  */

#define STACK_POINTER_REGNUM REG_P6

/* Base register for access to local variables of the function.  */

#define FRAME_POINTER_REGNUM REG_P7

/* A dummy register that will be eliminated to either FP or SP.  */

#define ARG_POINTER_REGNUM REG_ARGP

/* `PIC_OFFSET_TABLE_REGNUM'

     The register number of the register used to address a table of

     static data addresses in memory.  In some cases this register is

     defined by a processor's "application binary interface" (ABI).

     When this macro is defined, RTL is generated for this register

     once, as with the stack pointer and frame pointer registers.  If

     this macro is not defined, it is up to the machine-dependent files

     to allocate such a register (if necessary). */

#define PIC_OFFSET_TABLE_REGNUM (REG_P5)

#define FDPIC_FPTR_REGNO REG_P1

#define FDPIC_REGNO REG_P3

#define OUR_FDPIC_REG   get_hard_reg_initial_val (SImode, FDPIC_REGNO)

/* A static chain register for nested functions.  We need to use a

   call-clobbered register for this.  */

#define STATIC_CHAIN_REGNUM REG_P2

/* Define this if functions should assume that stack space has been

   allocated for arguments even when their values are passed in

   registers.

   The value of this macro is the size, in bytes, of the area reserved for

   arguments passed in registers.

   This space can either be allocated by the caller or be a part of the

   machine-dependent stack frame: `OUTGOING_REG_PARM_STACK_SPACE'

   says which.  */

#define FIXED_STACK_AREA 12

#define REG_PARM_STACK_SPACE(FNDECL) FIXED_STACK_AREA

/* Define this if the above stack space is to be considered part of the

 * space allocated by the caller.  */

#define OUTGOING_REG_PARM_STACK_SPACE

/* Define this if the maximum size of all the outgoing args is to be

   accumulated and pushed during the prologue.  The amount can be

   found in the variable current_function_outgoing_args_size. */

#define ACCUMULATE_OUTGOING_ARGS 1

/* Value should be nonzero if functions must have frame pointers.

   Zero means the frame pointer need not be set up (and parms

   may be accessed via the stack pointer) in functions that seem suitable.

   This is computed in `reload', in reload1.c.

*/

#define FRAME_POINTER_REQUIRED (bfin_frame_pointer_required ())

/*#define DATA_ALIGNMENT(TYPE, BASIC-ALIGN) for arrays.. */

/* Make strings word-aligned so strcpy from constants will be faster.  */

#define CONSTANT_ALIGNMENT(EXP, ALIGN)  \

  (TREE_CODE (EXP) == STRING_CST        \

   && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))

#define TRAMPOLINE_SIZE (TARGET_FDPIC ? 30 : 18)

#define TRAMPOLINE_TEMPLATE(FILE)                                       \

  if (TARGET_FDPIC)                                                     \

    {                                                                   \

      fprintf(FILE, "\t.dd\t0x00000000\n"); /* 0 */                     \

      fprintf(FILE, "\t.dd\t0x00000000\n"); /* 0 */                     \

      fprintf(FILE, "\t.dd\t0x0000e109\n"); /* p1.l = fn low */         \

      fprintf(FILE, "\t.dd\t0x0000e149\n"); /* p1.h = fn high */        \

      fprintf(FILE, "\t.dd\t0x0000e10a\n"); /* p2.l = sc low */         \

      fprintf(FILE, "\t.dd\t0x0000e14a\n"); /* p2.h = sc high */        \

      fprintf(FILE, "\t.dw\t0xac4b\n"); /* p3 = [p1 + 4] */             \

      fprintf(FILE, "\t.dw\t0x9149\n"); /* p1 = [p1] */                 \

      fprintf(FILE, "\t.dw\t0x0051\n"); /* jump (p1)*/                  \

    }                                                                   \

  else                                                                  \

    {                                                                   \

      fprintf(FILE, "\t.dd\t0x0000e109\n"); /* p1.l = fn low */         \

      fprintf(FILE, "\t.dd\t0x0000e149\n"); /* p1.h = fn high */        \

      fprintf(FILE, "\t.dd\t0x0000e10a\n"); /* p2.l = sc low */         \

      fprintf(FILE, "\t.dd\t0x0000e14a\n"); /* p2.h = sc high */        \

      fprintf(FILE, "\t.dw\t0x0051\n"); /* jump (p1)*/                  \

    }

#define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \

  initialize_trampoline (TRAMP, FNADDR, CXT)

/* Definitions for register eliminations.

   This is an array of structures.  Each structure initializes one pair

   of eliminable registers.  The "from" register number is given first,

   followed by "to".  Eliminations of the same "from" register are listed

   in order of preference.

   There are two registers that can always be eliminated on the i386.

   The frame pointer and the arg pointer can be replaced by either the

   hard frame pointer or to the stack pointer, depending upon the

   circumstances.  The hard frame pointer is not used before reload and

   so it is not eligible for elimination.  */

#define ELIMINABLE_REGS                         \

{{ ARG_POINTER_REGNUM, STACK_POINTER_REGNUM},   \

 { ARG_POINTER_REGNUM, FRAME_POINTER_REGNUM},   \

 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}} \

/* Given FROM and TO register numbers, say whether this elimination is

   allowed.  Frame pointer elimination is automatically handled.

   All other eliminations are valid.  */

#define CAN_ELIMINATE(FROM, TO) \

  ((TO) == STACK_POINTER_REGNUM ? ! frame_pointer_needed : 1)

/* Define the offset between two registers, one to be eliminated, and the other

   its replacement, at the start of a routine.  */

#define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \

  ((OFFSET) = bfin_initial_elimination_offset ((FROM), (TO)))

/* This processor has

   8 data register for doing arithmetic

   8  pointer register for doing addressing, including

      1  stack pointer P6

      1  frame pointer P7

   4 sets of indexing registers (I0-3, B0-3, L0-3, M0-3)

   1  condition code flag register CC

   5  return address registers RETS/I/X/N/E

   1  arithmetic status register (ASTAT).  */

#define FIRST_PSEUDO_REGISTER 50

#define D_REGNO_P(X) ((X) <= REG_R7)

#define P_REGNO_P(X) ((X) >= REG_P0 && (X) <= REG_P7)

#define I_REGNO_P(X) ((X) >= REG_I0 && (X) <= REG_I3)

#define DP_REGNO_P(X) (D_REGNO_P (X) || P_REGNO_P (X))

#define ADDRESS_REGNO_P(X) ((X) >= REG_P0 && (X) <= REG_M3)

#define DREG_P(X) (REG_P (X) && D_REGNO_P (REGNO (X)))

#define PREG_P(X) (REG_P (X) && P_REGNO_P (REGNO (X)))

#define IREG_P(X) (REG_P (X) && I_REGNO_P (REGNO (X)))

#define DPREG_P(X) (REG_P (X) && DP_REGNO_P (REGNO (X)))

#define REGISTER_NAMES { \

  "R0", "R1", "R2", "R3", "R4", "R5", "R6", "R7", \

  "P0", "P1", "P2", "P3", "P4", "P5", "SP", "FP", \

  "I0", "I1", "I2", "I3", "B0", "B1", "B2", "B3", \

  "L0", "L1", "L2", "L3", "M0", "M1", "M2", "M3", \

  "A0", "A1", \

  "CC", \

  "RETS", "RETI", "RETX", "RETN", "RETE", "ASTAT", "SEQSTAT", "USP", \

  "ARGP", \

  "LT0", "LT1", "LC0", "LC1", "LB0", "LB1" \

}

#define SHORT_REGISTER_NAMES { \

        "R0.L", "R1.L", "R2.L", "R3.L", "R4.L", "R5.L", "R6.L", "R7.L", \

        "P0.L", "P1.L", "P2.L", "P3.L", "P4.L", "P5.L", "SP.L", "FP.L", \

        "I0.L", "I1.L", "I2.L", "I3.L", "B0.L", "B1.L", "B2.L", "B3.L", \

        "L0.L", "L1.L", "L2.L", "L3.L", "M0.L", "M1.L", "M2.L", "M3.L", }

#define HIGH_REGISTER_NAMES { \

        "R0.H", "R1.H", "R2.H", "R3.H", "R4.H", "R5.H", "R6.H", "R7.H", \

        "P0.H", "P1.H", "P2.H", "P3.H", "P4.H", "P5.H", "SP.H", "FP.H", \

        "I0.H", "I1.H", "I2.H", "I3.H", "B0.H", "B1.H", "B2.H", "B3.H", \

        "L0.H", "L1.H", "L2.H", "L3.H", "M0.H", "M1.H", "M2.H", "M3.H", }

#define DREGS_PAIR_NAMES { \

  "R1:0.p", 0, "R3:2.p", 0, "R5:4.p", 0, "R7:6.p", 0,  }

#define BYTE_REGISTER_NAMES { \

  "R0.B", "R1.B", "R2.B", "R3.B", "R4.B", "R5.B", "R6.B", "R7.B",  }

/* 1 for registers that have pervasive standard uses

   and are not available for the register allocator.  */

#define FIXED_REGISTERS \

/*r0 r1 r2 r3 r4 r5 r6 r7   p0 p1 p2 p3 p4 p5 p6 p7 */ \

{ 0, 0, 0, 0, 0, 0, 0, 0,   0, 0, 0, 0, 0, 0, 1, 0,    \

/*i0 i1 i2 i3 b0 b1 b2 b3   l0 l1 l2 l3 m0 m1 m2 m3 */ \

  0, 0, 0, 0, 0, 0, 0, 0,   1, 1, 1, 1, 0, 0, 0, 0,    \

/*a0 a1 cc rets/i/x/n/e     astat seqstat usp argp lt0/1 lc0/1 */ \

  0, 0, 0, 1, 1, 1, 1, 1,   1, 1, 1, 1, 1, 1, 1, 1,    \

/*lb0/1 */ \

  1, 1  \

}

/* 1 for registers not available across function calls.

   These must include the FIXED_REGISTERS and also any

   registers that can be used without being saved.

   The latter must include the registers where values are returned

   and the register where structure-value addresses are passed.

   Aside from that, you can include as many other registers as you like.  */

#define CALL_USED_REGISTERS \

/*r0 r1 r2 r3 r4 r5 r6 r7   p0 p1 p2 p3 p4 p5 p6 p7 */ \

{ 1, 1, 1, 1, 0, 0, 0, 0,   1, 1, 1, 0, 0, 0, 1, 0, \

/*i0 i1 i2 i3 b0 b1 b2 b3   l0 l1 l2 l3 m0 m1 m2 m3 */ \

  1, 1, 1, 1, 1, 1, 1, 1,   1, 1, 1, 1, 1, 1, 1, 1,   \

/*a0 a1 cc rets/i/x/n/e     astat seqstat usp argp lt0/1 lc0/1 */ \

  1, 1, 1, 1, 1, 1, 1, 1,   1, 1, 1, 1, 1, 1, 1, 1, \

/*lb0/1 */ \

  1, 1  \

}

/* Order in which to allocate registers.  Each register must be

   listed once, even those in FIXED_REGISTERS.  List frame pointer

   late and fixed registers last.  Note that, in general, we prefer

   registers listed in CALL_USED_REGISTERS, keeping the others

   available for storage of persistent values. */

#define REG_ALLOC_ORDER \

{ REG_R0, REG_R1, REG_R2, REG_R3, REG_R7, REG_R6, REG_R5, REG_R4, \

  REG_P2, REG_P1, REG_P0, REG_P5, REG_P4, REG_P3, REG_P6, REG_P7, \

  REG_A0, REG_A1, \

  REG_I0, REG_I1, REG_I2, REG_I3, REG_B0, REG_B1, REG_B2, REG_B3, \

  REG_L0, REG_L1, REG_L2, REG_L3, REG_M0, REG_M1, REG_M2, REG_M3, \

  REG_RETS, REG_RETI, REG_RETX, REG_RETN, REG_RETE,               \

  REG_ASTAT, REG_SEQSTAT, REG_USP,                                \

  REG_CC, REG_ARGP,                                               \

  REG_LT0, REG_LT1, REG_LC0, REG_LC1, REG_LB0, REG_LB1            \

}

/* Macro to conditionally modify fixed_regs/call_used_regs.  */

#define CONDITIONAL_REGISTER_USAGE                      \

  {                                                     \

    conditional_register_usage();                       \

    if (TARGET_FDPIC)                                   \

      call_used_regs[FDPIC_REGNO] = 1;                  \

    if (!TARGET_FDPIC && flag_pic)                      \

      {                                                 \

        fixed_regs[PIC_OFFSET_TABLE_REGNUM] = 1;        \

        call_used_regs[PIC_OFFSET_TABLE_REGNUM] = 1;    \

      }                                                 \

  }

/* Define the classes of registers for register constraints in the

   machine description.  Also define ranges of constants.

   One of the classes must always be named ALL_REGS and include all hard regs.

   If there is more than one class, another class must be named NO_REGS

   and contain no registers.

   The name GENERAL_REGS must be the name of a class (or an alias for

   another name such as ALL_REGS).  This is the class of registers

   that is allowed by "g" or "r" in a register constraint.

   Also, registers outside this class are allocated only when

   instructions express preferences for them.

   The classes must be numbered in nondecreasing order; that is,

   a larger-numbered class must never be contained completely

   in a smaller-numbered class.

   For any two classes, it is very desirable that there be another

   class that represents their union. */

enum reg_class

{

  NO_REGS,

  IREGS,

  BREGS,

  LREGS,

  MREGS,

  CIRCREGS, /* Circular buffering registers, Ix, Bx, Lx together form.  See Automatic Circular Buffering.  */

  DAGREGS,

  EVEN_AREGS,

  ODD_AREGS,

  AREGS,

  CCREGS,

  EVEN_DREGS,

  ODD_DREGS,

  DREGS,

  FDPIC_REGS,

  FDPIC_FPTR_REGS,

  PREGS_CLOBBERED,

  PREGS,

  IPREGS,

  DPREGS,

  MOST_REGS,

  LT_REGS,

  LC_REGS,

  LB_REGS,

  PROLOGUE_REGS,

  NON_A_CC_REGS,

  ALL_REGS, LIM_REG_CLASSES

};

#define N_REG_CLASSES ((int)LIM_REG_CLASSES)

#define GENERAL_REGS DPREGS

/* Give names of register classes as strings for dump file.   */

#define REG_CLASS_NAMES \

{  "NO_REGS",           \

   "IREGS",             \

   "BREGS",             \

   "LREGS",             \

   "MREGS",             \

   "CIRCREGS",          \

   "DAGREGS",           \

   "EVEN_AREGS",        \

   "ODD_AREGS",         \

   "AREGS",             \

   "CCREGS",            \

   "EVEN_DREGS",        \

   "ODD_DREGS",         \

   "DREGS",             \

   "FDPIC_REGS",        \

   "FDPIC_FPTR_REGS",   \

   "PREGS_CLOBBERED",   \

   "PREGS",             \

   "IPREGS",            \

   "DPREGS",            \

   "MOST_REGS",         \

   "LT_REGS",           \

   "LC_REGS",           \

   "LB_REGS",           \

   "PROLOGUE_REGS",     \

   "NON_A_CC_REGS",     \

   "ALL_REGS" }

/* An initializer containing the contents of the register classes, as integers

   which are bit masks.  The Nth integer specifies the contents of class N.

   The way the integer MASK is interpreted is that register R is in the class

   if `MASK & (1 << R)' is 1.

   When the machine has more than 32 registers, an integer does not suffice.

   Then the integers are replaced by sub-initializers, braced groupings

   containing several integers.  Each sub-initializer must be suitable as an

   initializer for the type `HARD_REG_SET' which is defined in

   `hard-reg-set.h'.  */

/* NOTE: DSP registers, IREGS - AREGS, are not GENERAL_REGS.  We use

   MOST_REGS as the union of DPREGS and DAGREGS.  */

#define REG_CLASS_CONTENTS \

    /* 31 - 0       63-32   */ \

{   { 0x00000000,    0 },               /* NO_REGS */   \

    { 0x000f0000,    0 },               /* IREGS */     \

    { 0x00f00000,    0 },               /* BREGS */             \

    { 0x0f000000,    0 },               /* LREGS */     \

    { 0xf0000000,    0 },               /* MREGS */   \

    { 0x0fff0000,    0 },               /* CIRCREGS */   \

    { 0xffff0000,    0 },               /* DAGREGS */   \

    { 0x00000000,    0x1 },             /* EVEN_AREGS */   \

    { 0x00000000,    0x2 },             /* ODD_AREGS */   \

    { 0x00000000,    0x3 },             /* AREGS */   \

    { 0x00000000,    0x4 },             /* CCREGS */  \

    { 0x00000055,    0 },               /* EVEN_DREGS */   \

    { 0x000000aa,    0 },               /* ODD_DREGS */   \

    { 0x000000ff,    0 },               /* DREGS */   \

    { 0x00000800,    0x000 },           /* FDPIC_REGS */   \

    { 0x00000200,    0x000 },           /* FDPIC_FPTR_REGS */   \

    { 0x00004700,    0x800 },           /* PREGS_CLOBBERED */   \

    { 0x0000ff00,    0x800 },           /* PREGS */   \

    { 0x000fff00,    0x800 },           /* IPREGS */    \

    { 0x0000ffff,    0x800 },           /* DPREGS */   \

    { 0xffffffff,    0x800 },           /* MOST_REGS */\

    { 0x00000000,    0x3000 },          /* LT_REGS */\

    { 0x00000000,    0xc000 },          /* LC_REGS */\

    { 0x00000000,    0x30000 },         /* LB_REGS */\

    { 0x00000000,    0x3f7f8 },         /* PROLOGUE_REGS */\

    { 0xffffffff,    0x3fff8 },         /* NON_A_CC_REGS */\

    { 0xffffffff,    0x3ffff }}         /* ALL_REGS */

#define IREG_POSSIBLE_P(OUTER)                               \

  ((OUTER) == POST_INC || (OUTER) == PRE_INC                 \

   || (OUTER) == POST_DEC || (OUTER) == PRE_DEC              \

   || (OUTER) == MEM || (OUTER) == ADDRESS)

#define MODE_CODE_BASE_REG_CLASS(MODE, OUTER, INDEX)                    \

  ((MODE) == HImode && IREG_POSSIBLE_P (OUTER) ? IPREGS : PREGS)

#define INDEX_REG_CLASS         PREGS

#define REGNO_OK_FOR_BASE_STRICT_P(X, MODE, OUTER, INDEX)       \

  (P_REGNO_P (X) || (X) == REG_ARGP                             \

   || (IREG_POSSIBLE_P (OUTER) && (MODE) == HImode              \

       && I_REGNO_P (X)))

#define REGNO_OK_FOR_BASE_NONSTRICT_P(X, MODE, OUTER, INDEX)    \

  ((X) >= FIRST_PSEUDO_REGISTER                                 \

   || REGNO_OK_FOR_BASE_STRICT_P (X, MODE, OUTER, INDEX))

#ifdef REG_OK_STRICT

#define REGNO_MODE_CODE_OK_FOR_BASE_P(X, MODE, OUTER, INDEX) \

  REGNO_OK_FOR_BASE_STRICT_P (X, MODE, OUTER, INDEX)

#else

#define REGNO_MODE_CODE_OK_FOR_BASE_P(X, MODE, OUTER, INDEX) \

  REGNO_OK_FOR_BASE_NONSTRICT_P (X, MODE, OUTER, INDEX)

#endif

#define REGNO_OK_FOR_INDEX_P(X)   0

/* Get reg_class from a letter such as appears in the machine description.  */

#define REG_CLASS_FROM_LETTER(LETTER)   \

  ((LETTER) == 'a' ? PREGS :            \

   (LETTER) == 'Z' ? FDPIC_REGS :       \

   (LETTER) == 'Y' ? FDPIC_FPTR_REGS :  \

   (LETTER) == 'd' ? DREGS :            \

   (LETTER) == 'z' ? PREGS_CLOBBERED :  \

   (LETTER) == 'D' ? EVEN_DREGS :       \

   (LETTER) == 'W' ? ODD_DREGS :        \

   (LETTER) == 'e' ? AREGS :            \

   (LETTER) == 'A' ? EVEN_AREGS :       \

   (LETTER) == 'B' ? ODD_AREGS :        \

   (LETTER) == 'b' ? IREGS :            \

   (LETTER) == 'v' ? BREGS :            \

   (LETTER) == 'f' ? MREGS :            \

   (LETTER) == 'c' ? CIRCREGS :         \

   (LETTER) == 'C' ? CCREGS :           \

   (LETTER) == 't' ? LT_REGS :          \

   (LETTER) == 'k' ? LC_REGS :          \

   (LETTER) == 'u' ? LB_REGS :          \

   (LETTER) == 'x' ? MOST_REGS :        \

   (LETTER) == 'y' ? PROLOGUE_REGS :    \

   (LETTER) == 'w' ? NON_A_CC_REGS :    \

   NO_REGS)

/* The same information, inverted:

   Return the class number of the smallest class containing

   reg number REGNO.  This could be a conditional expression

   or could index an array.  */

#define REGNO_REG_CLASS(REGNO) \

 ((REGNO) < REG_P0 ? DREGS                              \

 : (REGNO) < REG_I0 ? PREGS                             \

 : (REGNO) == REG_ARGP ? PREGS                          \

 : (REGNO) >= REG_I0 && (REGNO) <= REG_I3 ? IREGS       \

 : (REGNO) >= REG_L0 && (REGNO) <= REG_L3 ? LREGS       \

 : (REGNO) >= REG_B0 && (REGNO) <= REG_B3 ? BREGS       \

 : (REGNO) >= REG_M0 && (REGNO) <= REG_M3 ? MREGS       \

 : (REGNO) == REG_A0 || (REGNO) == REG_A1 ? AREGS       \

 : (REGNO) == REG_LT0 || (REGNO) == REG_LT1 ? LT_REGS   \

 : (REGNO) == REG_LC0 || (REGNO) == REG_LC1 ? LC_REGS   \

 : (REGNO) == REG_LB0 || (REGNO) == REG_LB1 ? LB_REGS   \

 : (REGNO) == REG_CC ? CCREGS                           \

 : (REGNO) >= REG_RETS ? PROLOGUE_REGS                  \

 : NO_REGS)

/* When defined, the compiler allows registers explicitly used in the

   rtl to be used as spill registers but prevents the compiler from

   extending the lifetime of these registers. */

#define SMALL_REGISTER_CLASSES 1

#define CLASS_LIKELY_SPILLED_P(CLASS) \

    ((CLASS) == PREGS_CLOBBERED \

     || (CLASS) == PROLOGUE_REGS \

     || (CLASS) == CCREGS)

/* Do not allow to store a value in REG_CC for any mode */

/* Do not allow to store value in pregs if mode is not SI*/

#define HARD_REGNO_MODE_OK(REGNO, MODE) hard_regno_mode_ok((REGNO), (MODE))

/* Return the maximum number of consecutive registers

   needed to represent mode MODE in a register of class CLASS.  */

#define CLASS_MAX_NREGS(CLASS, MODE)                                    \

  ((MODE) == V2PDImode && (CLASS) == AREGS ? 2                          \

   : ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD))

#define HARD_REGNO_NREGS(REGNO, MODE) \

  ((MODE) == PDImode && ((REGNO) == REG_A0 || (REGNO) == REG_A1) ? 1    \

   : (MODE) == V2PDImode && ((REGNO) == REG_A0 || (REGNO) == REG_A1) ? 2 \

   : CLASS_MAX_NREGS (GENERAL_REGS, MODE))

/* A C expression that is nonzero if hard register TO can be

   considered for use as a rename register for FROM register */

#define HARD_REGNO_RENAME_OK(FROM, TO) bfin_hard_regno_rename_ok (FROM, TO)

/* A C expression that is nonzero if it is desirable to choose

   register allocation so as to avoid move instructions between a

   value of mode MODE1 and a value of mode MODE2.

   If `HARD_REGNO_MODE_OK (R, MODE1)' and `HARD_REGNO_MODE_OK (R,

   MODE2)' are ever different for any R, then `MODES_TIEABLE_P (MODE1,

   MODE2)' must be zero. */

#define MODES_TIEABLE_P(MODE1, MODE2) ((MODE1) == (MODE2))

/* `PREFERRED_RELOAD_CLASS (X, CLASS)'

   A C expression that places additional restrictions on the register

   class to use when it is necessary to copy value X into a register

   in class CLASS.  The value is a register class; perhaps CLASS, or

   perhaps another, smaller class.  */

#define PREFERRED_RELOAD_CLASS(X, CLASS) (CLASS)

/* Function Calling Conventions. */

/* The type of the current function; normal functions are of type

   SUBROUTINE.  */

typedef enum {

  SUBROUTINE, INTERRUPT_HANDLER, EXCPT_HANDLER, NMI_HANDLER

} e_funkind;

#define FUNCTION_ARG_REGISTERS { REG_R0, REG_R1, REG_R2, -1 }

/* Flags for the call/call_value rtl operations set up by function_arg */

#define CALL_NORMAL             0x00000000      /* no special processing */

#define CALL_LONG               0x00000001      /* always call indirect */

#define CALL_SHORT              0x00000002      /* always call by symbol */

typedef struct {

  int words;                    /* # words passed so far */

  int nregs;                    /* # registers available for passing */

  int *arg_regs;                /* array of register -1 terminated */

  int call_cookie;              /* Do special things for this call */

} CUMULATIVE_ARGS;

/* Define where to put the arguments to a function.

   Value is zero to push the argument on the stack,

   or a hard register in which to store the argument.

   MODE is the argument's machine mode.

   TYPE is the data type of the argument (as a tree).

    This is null for libcalls where that information may

    not be available.

   CUM is a variable of type CUMULATIVE_ARGS which gives info about

    the preceding args and about the function being called.

   NAMED is nonzero if this argument is a named parameter

    (otherwise it is an extra parameter matching an ellipsis).  */

#define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \

  (function_arg (&CUM, MODE, TYPE, NAMED))

#define FUNCTION_ARG_REGNO_P(REGNO) function_arg_regno_p (REGNO)

/* Initialize a variable CUM of type CUMULATIVE_ARGS

   for a call to a function whose data type is FNTYPE.

   For a library call, FNTYPE is 0.  */

#define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT, N_NAMED_ARGS) \

  (init_cumulative_args (&CUM, FNTYPE, LIBNAME))

/* Update the data in CUM to advance over an argument

   of mode MODE and data type TYPE.

   (TYPE is null for libcalls where that information may not be available.)  */

#define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED)    \

  (function_arg_advance (&CUM, MODE, TYPE, NAMED))

#define RETURN_POPS_ARGS(FDECL, FUNTYPE, STKSIZE) 0

/* Define how to find the value returned by a function.

   VALTYPE is the data type of the value (as a tree).

   If the precise function being called is known, FUNC is its FUNCTION_DECL;

   otherwise, FUNC is 0.

*/

#define VALUE_REGNO(MODE) (REG_R0)

#define FUNCTION_VALUE(VALTYPE, FUNC)           \

  gen_rtx_REG (TYPE_MODE (VALTYPE),             \

               VALUE_REGNO(TYPE_MODE(VALTYPE)))

/* Define how to find the value returned by a library function

   assuming the value has mode MODE.  */

#define LIBCALL_VALUE(MODE)  gen_rtx_REG (MODE, VALUE_REGNO(MODE))

#define FUNCTION_VALUE_REGNO_P(N) ((N) == REG_R0)

#define DEFAULT_PCC_STRUCT_RETURN 0

#define RETURN_IN_MEMORY(TYPE) bfin_return_in_memory(TYPE)

/* Before the prologue, the return address is in the RETS register.  */

#define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, REG_RETS)

#define RETURN_ADDR_RTX(COUNT, FRAME) bfin_return_addr_rtx (COUNT)

#define DWARF_FRAME_RETURN_COLUMN DWARF_FRAME_REGNUM (REG_RETS)

/* Call instructions don't modify the stack pointer on the Blackfin.  */

#define INCOMING_FRAME_SP_OFFSET 0

/* Describe how we implement __builtin_eh_return.  */

#define EH_RETURN_DATA_REGNO(N) ((N) < 2 ? (N) : INVALID_REGNUM)

#define EH_RETURN_STACKADJ_RTX  gen_rtx_REG (Pmode, REG_P2)

#define EH_RETURN_HANDLER_RTX \

    gen_rtx_MEM (Pmode, plus_constant (frame_pointer_rtx, UNITS_PER_WORD))

/* Addressing Modes */

/* Recognize any constant value that is a valid address.  */

#define CONSTANT_ADDRESS_P(X)   (CONSTANT_P (X))

/* Nonzero if the constant value X is a legitimate general operand.

   symbol_ref are not legitimate and will be put into constant pool.

   See force_const_mem().

   If -mno-pool, all constants are legitimate.

 */

#define LEGITIMATE_CONSTANT_P(x) 1

/*   A number, the maximum number of registers that can appear in a

     valid memory address.  Note that it is up to you to specify a

     value equal to the maximum number that `GO_IF_LEGITIMATE_ADDRESS'

     would ever accept. */

#define MAX_REGS_PER_ADDRESS 1

/* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression

   that is a valid memory address for an instruction.

   The MODE argument is the machine mode for the MEM expression

   that wants to use this address.

   Blackfin addressing modes are as follows:

      [preg]

      [preg + imm16]

      B [ Preg + uimm15 ]

      W [ Preg + uimm16m2 ]

      [ Preg + uimm17m4 ]

      [preg++]

      [preg--]

      [--sp]

*/

#define LEGITIMATE_MODE_FOR_AUTOINC_P(MODE) \

      (GET_MODE_SIZE (MODE) <= 4 || (MODE) == PDImode)

#ifdef REG_OK_STRICT

#define GO_IF_LEGITIMATE_ADDRESS(MODE, X, WIN)          \

  do {                                                  \

    if (bfin_legitimate_address_p (MODE, X, 1))         \

      goto WIN;                                         \

  } while (0);

#else

#define GO_IF_LEGITIMATE_ADDRESS(MODE, X, WIN)          \

  do {                                                  \

    if (bfin_legitimate_address_p (MODE, X, 0))         \

      goto WIN;                                         \

  } while (0);

#endif

/* Try machine-dependent ways of modifying an illegitimate address

   to be legitimate.  If we find one, return the new, valid address.

   This macro is used in only one place: `memory_address' in explow.c.

   OLDX is the address as it was before break_out_memory_refs was called.

   In some cases it is useful to look at this to decide what needs to be done.

   MODE and WIN are passed so that this macro can use

   GO_IF_LEGITIMATE_ADDRESS.

   It is always safe for this macro to do nothing.  It exists to recognize

   opportunities to optimize the output.

 */

#define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN)    \

do {                                           \

   rtx _q = legitimize_address(X, OLDX, MODE); \

   if (_q) { X = _q; goto WIN; }               \

} while (0)

#define HAVE_POST_INCREMENT 1

#define HAVE_POST_DECREMENT 1

#define HAVE_PRE_DECREMENT  1

/* `LEGITIMATE_PIC_OPERAND_P (X)'

     A C expression that is nonzero if X is a legitimate immediate

     operand on the target machine when generating position independent

     code.  You can assume that X satisfies `CONSTANT_P', so you need

     not check this.  You can also assume FLAG_PIC is true, so you need

     not check it either.  You need not define this macro if all

     constants (including `SYMBOL_REF') can be immediate operands when

     generating position independent code. */

#define LEGITIMATE_PIC_OPERAND_P(X) ! SYMBOLIC_CONST (X)

#define SYMBOLIC_CONST(X)       \

(GET_CODE (X) == SYMBOL_REF                                             \

 || GET_CODE (X) == LABEL_REF                                           \

 || (GET_CODE (X) == CONST && symbolic_reference_mentioned_p (X)))

/*

     A C statement or compound statement with a conditional `goto

     LABEL;' executed if memory address X (an RTX) can have different

     meanings depending on the machine mode of the memory reference it

     is used for or if the address is valid for some modes but not

     others.

     Autoincrement and autodecrement addresses typically have

     mode-dependent effects because the amount of the increment or

     decrement is the size of the operand being addressed.  Some

     machines have other mode-dependent addresses.  Many RISC machines

     have no mode-dependent addresses.

     You may assume that ADDR is a valid address for the machine.

*/

#define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL)  \

do {                                              \

 if (GET_CODE (ADDR) == POST_INC                  \

     || GET_CODE (ADDR) == POST_DEC               \

     || GET_CODE (ADDR) == PRE_DEC)               \

   goto LABEL;                                    \

} while (0)

#define NOTICE_UPDATE_CC(EXPR, INSN) 0

/* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits

   is done just by pretending it is already truncated.  */