CbC/CbC_gcc: gcc/config/pa/pa.h comparison

comparison gcc/config/pa/pa.h @ 67:f6334be47118

update gcc from gcc-4.6-20100522 to gcc-4.6-20110318

author	nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
date	Tue, 22 Mar 2011 17:18:12 +0900
parents	77e2b8dfacca
children	04ced10e8804

comparison

equal deleted inserted replaced

-:65488c3d617d
+:f6334be47118
 /* Definitions of target machine for GNU compiler, for the HP Spectrum.
 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
-2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
+2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
 Free Software Foundation, Inc.
 Contributed by Michael Tiemann (tiemann@cygnus.com) of Cygnus Support
 and Tim Moore (moore@defmacro.cs.utah.edu) of the Center for
 Software Science at the University of Utah.
 /* HP-UX 11i multibyte and UNIX 98 extensions.  */
 #ifndef TARGET_HPUX_11_11
 #define TARGET_HPUX_11_11 0
 #endif
+/* HP-UX long double library.  */
+#ifndef HPUX_LONG_DOUBLE_LIBRARY
+#define HPUX_LONG_DOUBLE_LIBRARY 0
+#endif
 /* The following three defines are potential target switches.  The current
 defines are optimal given the current capabilities of GAS and GNU ld.  */
 /* Define to a C expression evaluating to true to use long absolute calls.
 Currently, only the HP assembler and SOM linker support long absolute
 {"schedule", "%{!mschedule=*:-mschedule=%(VALUE)}" }
 /* Specify the dialect of assembler to use.  New mnemonics is dialect one
 and the old mnemonics are dialect zero.  */
 #define ASSEMBLER_DIALECT (TARGET_PA_20 ? 1 : 0)
-#define OVERRIDE_OPTIONS override_options ()
 /* Override some settings from dbxelf.h.  */
 /* We do not have to be compatible with dbx, so we enable gdb extensions
 by default.  */
 /* We don't want -lg.  */
 #ifndef LIB_SPEC
 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
 #endif
-/* This macro defines command-line switches that modify the default
-target name.
-The definition is be an initializer for an array of structures.  Each
-array element has have three elements: the switch name, one of the
-enumeration codes ADD or DELETE to indicate whether the string should be
-inserted or deleted, and the string to be inserted or deleted.  */
-#define MODIFY_TARGET_NAME {{"-32", DELETE, "64"}, {"-64", ADD, "64"}}
 /* Make gcc agree with <machine/ansi.h> */
 #define SIZE_TYPE "unsigned int"
 #define PTRDIFF_TYPE "int"
 #define WCHAR_TYPE "unsigned int"
 #define WCHAR_TYPE_SIZE 32
-/* Show we can debug even without a frame pointer.  */
-#define CAN_DEBUG_WITHOUT_FP
 /* target machine storage layout */
 typedef struct GTY(()) machine_function
 {
 /* Flag indicating that a .NSUBSPA directive has been output for
 /* No data type wants to be aligned rounder than this.  */
 #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
 /* Get around hp-ux assembler bug, and make strcpy of constants fast.  */
-#define CONSTANT_ALIGNMENT(CODE, TYPEALIGN) \
+#define CONSTANT_ALIGNMENT(EXP, ALIGN)		\
-((TYPEALIGN) < 32 ? 32 : (TYPEALIGN))
+(TREE_CODE (EXP) == STRING_CST		\
+&& (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
 /* Make arrays of chars word-aligned for the same reasons.  */
 #define DATA_ALIGNMENT(TYPE, ALIGN)		\
 (TREE_CODE (TYPE) == ARRAY_TYPE		\
 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode	\
 /* #define PC_REGNUM  */
 /* Register to use for pushing function arguments.  */
 #define STACK_POINTER_REGNUM 30
+/* Fixed register for local variable access.  Always eliminated.  */
+#define FRAME_POINTER_REGNUM (TARGET_64BIT ? 61 : 89)
 /* Base register for access to local variables of the function.  */
-#define FRAME_POINTER_REGNUM 3
+#define HARD_FRAME_POINTER_REGNUM 3
 /* Don't allow hard registers to be renamed into r2 unless r2
 is already live or already being saved (due to eh).  */
 #define HARD_REGNO_RENAME_OK(OLD_REG, NEW_REG) \
 ((NEW_REG) != 2 || df_regs_ever_live_p (2) || crtl->calls_eh_return)
-/* C statement to store the difference between the frame pointer
-and the stack pointer values immediately after the function prologue.
-Note, we always pretend that this is a leaf function because if
-it's not, there's no point in trying to eliminate the
-frame pointer.  If it is a leaf function, we guessed right!  */
-#define INITIAL_FRAME_POINTER_OFFSET(VAR) \
-do {(VAR) = - compute_frame_size (get_frame_size (), 0);} while (0)
 /* Base register for access to arguments of the function.  */
 #define ARG_POINTER_REGNUM (TARGET_64BIT ? 29 : 3)
 /* Register in which static-chain is passed to a function.  */
 #define DEFAULT_PCC_STRUCT_RETURN 0
 /* Register in which address to store a structure value
 is passed to a function.  */
 #define PA_STRUCT_VALUE_REGNUM 28
+/* Definitions for register eliminations.
+We have two registers that can be eliminated.  First, the frame pointer
+register can often be eliminated in favor of the stack pointer register.
+Secondly, the argument pointer register can always be eliminated in the
+32-bit runtimes.  */
+/* 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.
+The argument pointer cannot be eliminated in the 64-bit runtime.  It
+is the same register as the hard frame pointer in the 32-bit runtime.
+So, it does not need to be listed.  */
+#define ELIMINABLE_REGS                                 \
+{{ HARD_FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM},    \
+{ FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM},         \
+{ FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM} }
+/* 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) = pa_initial_elimination_offset(FROM, TO))
 /* Describe how we implement __builtin_eh_return.  */
 #define EH_RETURN_DATA_REGNO(N)	\
 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
 #define EH_RETURN_STACKADJ_RTX	gen_rtx_REG (Pmode, 29)
 #define EH_RETURN_HANDLER_RTX pa_eh_return_handler_rtx ()
 /* Offset from the frame pointer register value to the top of stack.  */
 #define FRAME_POINTER_CFA_OFFSET(FNDECL) 0
+/* The maximum number of hard registers that can be saved in the call
+frame.  The soft frame pointer is not included.  */
+#define DWARF_FRAME_REGISTERS (FIRST_PSEUDO_REGISTER - 1)
 /* A C expression whose value is RTL representing the location of the
 incoming return address at the beginning of any function, before the
 prologue.  You only need to define this macro if you want to support
 call frame debugging information like that provided by DWARF 2.  */
 be defined only if DWARF_FRAME_RETURN_COLUMN is set to a general
 register, but an alternate column needs to be used for signal frames.
 Column 0 is not used but unfortunately its register size is set to
 4 bytes (sizeof CCmode) so it can't be used on 64-bit targets.  */
-#define DWARF_ALT_FRAME_RETURN_COLUMN FIRST_PSEUDO_REGISTER
+#define DWARF_ALT_FRAME_RETURN_COLUMN (FIRST_PSEUDO_REGISTER - 1)
 /* This macro chooses the encoding of pointers embedded in the exception
 handling sections.  If at all possible, this should be defined such
 that the exception handling section will not require dynamic relocations,
 and so may be read-only.
 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
 /* True if register is floating-point.  */
 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
-/* Given an rtx X being reloaded into a reg required to be
-in class CLASS, return the class of reg to actually use.
-In general this is just CLASS; but on some machines
-in some cases it is preferable to use a more restrictive class.  */
-#define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
 #define MAYBE_FP_REG_CLASS_P(CLASS) \
 reg_classes_intersect_p ((CLASS), FP_REGS)
 /* Stack layout; function entry, exit and calling.  */
 #define STACK_DYNAMIC_OFFSET(FNDECL)	\
 (TARGET_64BIT				\
 ? (STACK_POINTER_OFFSET)		\
 : ((STACK_POINTER_OFFSET) - crtl->outgoing_args_size))
-/* Value is 1 if returning from a function call automatically
-pops the arguments described by the number-of-args field in the call.
-FUNDECL is the declaration node of the function (as a tree),
-FUNTYPE is the data type of the function (as a tree),
-or for a library call it is an identifier node for the subroutine name.  */
-#define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
-/* 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,							\
-	       (! TARGET_SOFT_FLOAT					\
-		&& ((MODE) == SFmode || (MODE) == DFmode) ? 32 : 28))
-/* 1 if N is a possible register number for a function value
-as seen by the caller.  */
-#define FUNCTION_VALUE_REGNO_P(N) \
-((N) == 28 || (! TARGET_SOFT_FLOAT && (N) == 32))
 /* Define a data type for recording info about an argument list
 during the scan of that argument list.  This data type should
 hold all necessary information about the function itself
 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
 (CUM).words = 0, 							\
 (CUM).incoming = 0,							\
 (CUM).indirect = (FNTYPE) && !(FNDECL),				\
-(CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE)		\
+(CUM).nargs_prototype = (FNTYPE && prototype_p (FNTYPE)		\
 			   ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1	\
 			      + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
 				 || pa_return_in_memory (TREE_TYPE (FNTYPE), 0))) \
 			   : 0)
 #define FUNCTION_ARG_SIZE(MODE, TYPE)	\
 ((((MODE) != BLKmode \
 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
-/* 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)			\
-{ (CUM).nargs_prototype--;						\
-(CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE)	 			\
-+ (((CUM).words & 01) && (TYPE) != 0				\
-	&& FUNCTION_ARG_SIZE(MODE, TYPE) > 1);				\
-}
 /* Determine where to put an argument to a function.
 Value is zero to push the argument on the stack,
 or a hard register in which to store the argument.
 so that there is only one element.  This allows the object to be
 correctly padded.  */
 #define BLOCK_REG_PADDING(MODE, TYPE, FIRST) \
 function_arg_padding ((MODE), (TYPE))
-/* Do not expect to understand this without reading it several times.  I'm
-tempted to try and simply it, but I worry about breaking something.  */
-#define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
-function_arg (&CUM, MODE, TYPE, NAMED)
-/* If defined, a C expression that gives the alignment boundary, in
-bits, of an argument with the specified mode and type.  If it is
-not defined,  `PARM_BOUNDARY' is used for all arguments.  */
-/* Arguments larger than one word are double word aligned.  */
-#define FUNCTION_ARG_BOUNDARY(MODE, TYPE)				\
-(((TYPE)								\
-? (integer_zerop (TYPE_SIZE (TYPE))					\
-|| !TREE_CONSTANT (TYPE_SIZE (TYPE))				\
-|| int_size_in_bytes (TYPE) <= UNITS_PER_WORD)			\
-: GET_MODE_SIZE(MODE) <= UNITS_PER_WORD)				\
-? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
 as assembly via FUNCTION_PROFILER.  Just output a local label.
 We can't use the function label because the GAS SOM target can't
 handle the difference of a global symbol and a local symbol.  */
 Since they use reg_renumber, they are safe only once reg_renumber
 has been allocated, which happens in local-alloc.c.  */
 #define REGNO_OK_FOR_INDEX_P(X) \
 ((X) && ((X) < 32							\
-|| (X >= FIRST_PSEUDO_REGISTER					\
+|| ((X) == FRAME_POINTER_REGNUM)					\
+|| ((X) >= FIRST_PSEUDO_REGISTER					\
 && reg_renumber							\
 && (unsigned) reg_renumber[X] < 32)))
 #define REGNO_OK_FOR_BASE_P(X) \
 ((X) && ((X) < 32							\
-|| (X >= FIRST_PSEUDO_REGISTER					\
+|| ((X) == FRAME_POINTER_REGNUM)					\
+|| ((X) >= FIRST_PSEUDO_REGISTER					\
 && reg_renumber							\
 && (unsigned) reg_renumber[X] < 32)))
 #define REGNO_OK_FOR_FP_P(X) \
 (FP_REGNO_P (X)							\
 || (X >= FIRST_PSEUDO_REGISTER					\
 #ifndef REG_OK_STRICT
 /* Nonzero if X is a hard reg that can be used as an index
 or if it is a pseudo reg.  */
 #define REG_OK_FOR_INDEX_P(X) \
-(REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
+(REGNO (X) && (REGNO (X) < 32 				\
+|| REGNO (X) == FRAME_POINTER_REGNUM				\
+|| REGNO (X) >= FIRST_PSEUDO_REGISTER))
 /* Nonzero if X is a hard reg that can be used as a base reg
 or if it is a pseudo reg.  */
 #define REG_OK_FOR_BASE_P(X) \
-(REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
+(REGNO (X) && (REGNO (X) < 32 				\
+|| REGNO (X) == FRAME_POINTER_REGNUM				\
+|| REGNO (X) >= FIRST_PSEUDO_REGISTER))
 #else
 /* Nonzero if X is a hard reg that can be used as an index.  */
 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
 		   && !TARGET_ELF32					\
 	           && GET_CODE (XEXP (X, 1)) != CONST_INT)		\
 	       || ((MODE) != SFmode					\
 		   && (MODE) != DFmode)))				\
 goto ADDR;								\
-else if (GET_CODE (X) == LABEL_REF					\
+else if (GET_CODE (X) == CONST_INT && INT_5_BITS (X))			\
-	   || (GET_CODE (X) == CONST_INT				\
-	       && INT_5_BITS (X)))					\
 goto ADDR;								\
 /* Needed for -fPIC */						\
 else if (GET_CODE (X) == LO_SUM					\
 	   && GET_CODE (XEXP (X, 0)) == REG             		\
 	   && REG_OK_FOR_BASE_P (XEXP (X, 0))				\
 /* Define this to be nonzero if shift instructions ignore all but the low-order
 few bits.  */
 #define SHIFT_COUNT_TRUNCATED 1
-/* Compute extra cost of moving data between one register class
-and another.
-Make moves from SAR so expensive they should never happen.  We used to
-have 0xffff here, but that generates overflow in rare cases.
-Copies involving a FP register and a non-FP register are relatively
-expensive because they must go through memory.
-Other copies are reasonably cheap.  */
-#define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
-(CLASS1 == SHIFT_REGS ? 0x100					\
-: FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16	\
-: FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16	\
-: 2)
 /* Adjust the cost of branches.  */
 #define BRANCH_COST(speed_p, predictable_p) (pa_cpu == PROCESSOR_8000 ? 2 : 1)
 /* Handling the special cases is going to get too complicated for a macro,
 just call `pa_adjust_insn_length' to do the real work.  */
 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGN)		\
 pa_asm_output_aligned_local (FILE, NAME, SIZE, ALIGN)
 /* All HP assemblers use "!" to separate logical lines.  */
 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == '!')
-#define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
-((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
 /* Print operand X (an rtx) in assembler syntax to file FILE.
 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
 For `%' followed by punctuation, CODE is the punctuation and X is null.

Mercurial > hg > CbC > CbC_gcc

comparison gcc/config/pa/pa.h @ 67:f6334be47118