1 /* Definitions of target machine for GNU compiler, for the HP Spectrum.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com) of Cygnus Support
5 and Tim Moore (moore@defmacro.cs.utah.edu) of the Center for
6 Software Science at the University of Utah.
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING. If not, write to
22 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
23 Boston, MA 02110-1301, USA. */
25 enum cmp_type /* comparison type */
27 CMP_SI, /* compare integers */
28 CMP_SF, /* compare single precision floats */
29 CMP_DF, /* compare double precision floats */
30 CMP_MAX /* max comparison type */
33 /* For long call handling. */
34 extern unsigned long total_code_bytes;
36 /* Which processor to schedule for. */
48 /* For -mschedule= option. */
49 extern enum processor_type pa_cpu;
51 /* For -munix= option. */
52 extern int flag_pa_unix;
54 #define pa_cpu_attr ((enum attr_cpu)pa_cpu)
56 /* Print subsidiary information on the compiler version in use. */
58 #define TARGET_VERSION fputs (" (hppa)", stderr);
60 #define TARGET_PA_10 (!TARGET_PA_11 && !TARGET_PA_20)
62 /* Generate code for the HPPA 2.0 architecture in 64bit mode. */
64 #define TARGET_64BIT 0
67 /* Generate code for ELF32 ABI. */
69 #define TARGET_ELF32 0
72 /* Generate code for SOM 32bit ABI. */
77 /* HP-UX UNIX features. */
82 /* HP-UX 10.10 UNIX 95 features. */
83 #ifndef TARGET_HPUX_10_10
84 #define TARGET_HPUX_10_10 0
87 /* HP-UX 11i multibyte and UNIX 98 extensions. */
88 #ifndef TARGET_HPUX_11_11
89 #define TARGET_HPUX_11_11 0
92 /* The following three defines are potential target switches. The current
93 defines are optimal given the current capabilities of GAS and GNU ld. */
95 /* Define to a C expression evaluating to true to use long absolute calls.
96 Currently, only the HP assembler and SOM linker support long absolute
97 calls. They are used only in non-pic code. */
98 #define TARGET_LONG_ABS_CALL (TARGET_SOM && !TARGET_GAS)
100 /* Define to a C expression evaluating to true to use long pic symbol
101 difference calls. This is a call variant similar to the long pic
102 pc-relative call. Long pic symbol difference calls are only used with
103 the HP SOM linker. Currently, only the HP assembler supports these
104 calls. GAS doesn't allow an arbitrary difference of two symbols. */
105 #define TARGET_LONG_PIC_SDIFF_CALL (!TARGET_GAS)
107 /* Define to a C expression evaluating to true to use long pic
108 pc-relative calls. Long pic pc-relative calls are only used with
109 GAS. Currently, they are usable for calls within a module but
110 not for external calls. */
111 #define TARGET_LONG_PIC_PCREL_CALL 0
113 /* Define to a C expression evaluating to true to use SOM secondary
114 definition symbols for weak support. Linker support for secondary
115 definition symbols is buggy prior to HP-UX 11.X. */
116 #define TARGET_SOM_SDEF 0
118 /* Define to a C expression evaluating to true to save the entry value
119 of SP in the current frame marker. This is normally unnecessary.
120 However, the HP-UX unwind library looks at the SAVE_SP callinfo flag.
121 HP compilers don't use this flag but it is supported by the assembler.
122 We set this flag to indicate that register %r3 has been saved at the
123 start of the frame. Thus, when the HP unwind library is used, we
124 need to generate additional code to save SP into the frame marker. */
125 #define TARGET_HPUX_UNWIND_LIBRARY 0
127 #ifndef TARGET_DEFAULT
128 #define TARGET_DEFAULT (MASK_GAS | MASK_JUMP_IN_DELAY | MASK_BIG_SWITCH)
131 #ifndef TARGET_CPU_DEFAULT
132 #define TARGET_CPU_DEFAULT 0
135 #ifndef TARGET_SCHED_DEFAULT
136 #define TARGET_SCHED_DEFAULT PROCESSOR_8000
139 /* Support for a compile-time default CPU, et cetera. The rules are:
140 --with-schedule is ignored if -mschedule is specified.
141 --with-arch is ignored if -march is specified. */
142 #define OPTION_DEFAULT_SPECS \
143 {"arch", "%{!march=*:-march=%(VALUE)}" }, \
144 {"schedule", "%{!mschedule=*:-mschedule=%(VALUE)}" }
146 /* Specify the dialect of assembler to use. New mnemonics is dialect one
147 and the old mnemonics are dialect zero. */
148 #define ASSEMBLER_DIALECT (TARGET_PA_20 ? 1 : 0)
150 #define OVERRIDE_OPTIONS override_options ()
152 /* Override some settings from dbxelf.h. */
154 /* We do not have to be compatible with dbx, so we enable gdb extensions
156 #define DEFAULT_GDB_EXTENSIONS 1
158 /* This used to be zero (no max length), but big enums and such can
159 cause huge strings which killed gas.
161 We also have to avoid lossage in dbxout.c -- it does not compute the
162 string size accurately, so we are real conservative here. */
163 #undef DBX_CONTIN_LENGTH
164 #define DBX_CONTIN_LENGTH 3000
166 /* GDB always assumes the current function's frame begins at the value
167 of the stack pointer upon entry to the current function. Accessing
168 local variables and parameters passed on the stack is done using the
169 base of the frame + an offset provided by GCC.
171 For functions which have frame pointers this method works fine;
172 the (frame pointer) == (stack pointer at function entry) and GCC provides
173 an offset relative to the frame pointer.
175 This loses for functions without a frame pointer; GCC provides an offset
176 which is relative to the stack pointer after adjusting for the function's
177 frame size. GDB would prefer the offset to be relative to the value of
178 the stack pointer at the function's entry. Yuk! */
179 #define DEBUGGER_AUTO_OFFSET(X) \
180 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
181 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
183 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
184 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
185 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
187 #define TARGET_CPU_CPP_BUILTINS() \
189 builtin_assert("cpu=hppa"); \
190 builtin_assert("machine=hppa"); \
191 builtin_define("__hppa"); \
192 builtin_define("__hppa__"); \
194 builtin_define("_PA_RISC2_0"); \
195 else if (TARGET_PA_11) \
196 builtin_define("_PA_RISC1_1"); \
198 builtin_define("_PA_RISC1_0"); \
201 /* An old set of OS defines for various BSD-like systems. */
202 #define TARGET_OS_CPP_BUILTINS() \
205 builtin_define_std ("REVARGV"); \
206 builtin_define_std ("hp800"); \
207 builtin_define_std ("hp9000"); \
208 builtin_define_std ("hp9k8"); \
209 if (!c_dialect_cxx () && !flag_iso) \
210 builtin_define ("hppa"); \
211 builtin_define_std ("spectrum"); \
212 builtin_define_std ("unix"); \
213 builtin_assert ("system=bsd"); \
214 builtin_assert ("system=unix"); \
218 #define CC1_SPEC "%{pg:} %{p:}"
220 #define LINK_SPEC "%{mlinker-opt:-O} %{!shared:-u main} %{shared:-b}"
222 /* We don't want -lg. */
224 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
227 /* This macro defines command-line switches that modify the default
230 The definition is be an initializer for an array of structures. Each
231 array element has have three elements: the switch name, one of the
232 enumeration codes ADD or DELETE to indicate whether the string should be
233 inserted or deleted, and the string to be inserted or deleted. */
234 #define MODIFY_TARGET_NAME {{"-32", DELETE, "64"}, {"-64", ADD, "64"}}
236 /* Make gcc agree with <machine/ansi.h> */
238 #define SIZE_TYPE "unsigned int"
239 #define PTRDIFF_TYPE "int"
240 #define WCHAR_TYPE "unsigned int"
241 #define WCHAR_TYPE_SIZE 32
243 /* Show we can debug even without a frame pointer. */
244 #define CAN_DEBUG_WITHOUT_FP
246 /* target machine storage layout */
247 typedef struct machine_function GTY(())
249 /* Flag indicating that a .NSUBSPA directive has been output for
254 /* Define this macro if it is advisable to hold scalars in registers
255 in a wider mode than that declared by the program. In such cases,
256 the value is constrained to be within the bounds of the declared
257 type, but kept valid in the wider mode. The signedness of the
258 extension may differ from that of the type. */
260 #define PROMOTE_MODE(MODE,UNSIGNEDP,TYPE) \
261 if (GET_MODE_CLASS (MODE) == MODE_INT \
262 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
265 /* Define this if most significant bit is lowest numbered
266 in instructions that operate on numbered bit-fields. */
267 #define BITS_BIG_ENDIAN 1
269 /* Define this if most significant byte of a word is the lowest numbered. */
270 /* That is true on the HP-PA. */
271 #define BYTES_BIG_ENDIAN 1
273 /* Define this if most significant word of a multiword number is lowest
275 #define WORDS_BIG_ENDIAN 1
277 #define MAX_BITS_PER_WORD 64
279 /* Width of a word, in units (bytes). */
280 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
282 /* Minimum number of units in a word. If this is undefined, the default
283 is UNITS_PER_WORD. Otherwise, it is the constant value that is the
284 smallest value that UNITS_PER_WORD can have at run-time.
286 FIXME: This needs to be 4 when TARGET_64BIT is true to suppress the
287 building of various TImode routines in libgcc. The HP runtime
288 specification doesn't provide the alignment requirements and calling
289 conventions for TImode variables. */
290 #define MIN_UNITS_PER_WORD 4
292 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
293 #define PARM_BOUNDARY BITS_PER_WORD
295 /* Largest alignment required for any stack parameter, in bits.
296 Don't define this if it is equal to PARM_BOUNDARY */
297 #define MAX_PARM_BOUNDARY BIGGEST_ALIGNMENT
299 /* Boundary (in *bits*) on which stack pointer is always aligned;
300 certain optimizations in combine depend on this.
302 The HP-UX runtime documents mandate 64-byte and 16-byte alignment for
303 the stack on the 32 and 64-bit ports, respectively. However, we
304 are only guaranteed that the stack is aligned to BIGGEST_ALIGNMENT
305 in main. Thus, we treat the former as the preferred alignment. */
306 #define STACK_BOUNDARY BIGGEST_ALIGNMENT
307 #define PREFERRED_STACK_BOUNDARY (TARGET_64BIT ? 128 : 512)
309 /* Allocation boundary (in *bits*) for the code of a function. */
310 #define FUNCTION_BOUNDARY BITS_PER_WORD
312 /* Alignment of field after `int : 0' in a structure. */
313 #define EMPTY_FIELD_BOUNDARY 32
315 /* Every structure's size must be a multiple of this. */
316 #define STRUCTURE_SIZE_BOUNDARY 8
318 /* A bit-field declared as `int' forces `int' alignment for the struct. */
319 #define PCC_BITFIELD_TYPE_MATTERS 1
321 /* No data type wants to be aligned rounder than this. */
322 #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
324 /* Get around hp-ux assembler bug, and make strcpy of constants fast. */
325 #define CONSTANT_ALIGNMENT(CODE, TYPEALIGN) \
326 ((TYPEALIGN) < 32 ? 32 : (TYPEALIGN))
328 /* Make arrays of chars word-aligned for the same reasons. */
329 #define DATA_ALIGNMENT(TYPE, ALIGN) \
330 (TREE_CODE (TYPE) == ARRAY_TYPE \
331 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
332 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
334 /* Set this nonzero if move instructions will actually fail to work
335 when given unaligned data. */
336 #define STRICT_ALIGNMENT 1
338 /* Value is 1 if it is a good idea to tie two pseudo registers
339 when one has mode MODE1 and one has mode MODE2.
340 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
341 for any hard reg, then this must be 0 for correct output. */
342 #define MODES_TIEABLE_P(MODE1, MODE2) \
343 (GET_MODE_CLASS (MODE1) == GET_MODE_CLASS (MODE2))
345 /* Specify the registers used for certain standard purposes.
346 The values of these macros are register numbers. */
348 /* The HP-PA pc isn't overloaded on a register that the compiler knows about. */
349 /* #define PC_REGNUM */
351 /* Register to use for pushing function arguments. */
352 #define STACK_POINTER_REGNUM 30
354 /* Base register for access to local variables of the function. */
355 #define FRAME_POINTER_REGNUM 3
357 /* Value should be nonzero if functions must have frame pointers. */
358 #define FRAME_POINTER_REQUIRED \
359 (current_function_calls_alloca)
361 /* Don't allow hard registers to be renamed into r2 unless r2
362 is already live or already being saved (due to eh). */
364 #define HARD_REGNO_RENAME_OK(OLD_REG, NEW_REG) \
365 ((NEW_REG) != 2 || regs_ever_live[2] || current_function_calls_eh_return)
367 /* C statement to store the difference between the frame pointer
368 and the stack pointer values immediately after the function prologue.
370 Note, we always pretend that this is a leaf function because if
371 it's not, there's no point in trying to eliminate the
372 frame pointer. If it is a leaf function, we guessed right! */
373 #define INITIAL_FRAME_POINTER_OFFSET(VAR) \
374 do {(VAR) = - compute_frame_size (get_frame_size (), 0);} while (0)
376 /* Base register for access to arguments of the function. */
377 #define ARG_POINTER_REGNUM (TARGET_64BIT ? 29 : 3)
379 /* Register in which static-chain is passed to a function. */
380 #define STATIC_CHAIN_REGNUM (TARGET_64BIT ? 31 : 29)
382 /* Register used to address the offset table for position-independent
384 #define PIC_OFFSET_TABLE_REGNUM \
385 (flag_pic ? (TARGET_64BIT ? 27 : 19) : INVALID_REGNUM)
387 #define PIC_OFFSET_TABLE_REG_CALL_CLOBBERED 1
389 /* Function to return the rtx used to save the pic offset table register
390 across function calls. */
391 extern struct rtx_def *hppa_pic_save_rtx (void);
393 #define DEFAULT_PCC_STRUCT_RETURN 0
395 /* Register in which address to store a structure value
396 is passed to a function. */
397 #define PA_STRUCT_VALUE_REGNUM 28
399 /* Describe how we implement __builtin_eh_return. */
400 #define EH_RETURN_DATA_REGNO(N) \
401 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
402 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
403 #define EH_RETURN_HANDLER_RTX \
404 gen_rtx_MEM (word_mode, \
405 gen_rtx_PLUS (word_mode, frame_pointer_rtx, \
406 TARGET_64BIT ? GEN_INT (-16) : GEN_INT (-20)))
409 /* Offset from the argument pointer register value to the top of
410 stack. This is different from FIRST_PARM_OFFSET because of the
412 #define ARG_POINTER_CFA_OFFSET(FNDECL) 0
414 /* The letters I, J, K, L and M in a register constraint string
415 can be used to stand for particular ranges of immediate operands.
416 This macro defines what the ranges are.
417 C is the letter, and VALUE is a constant value.
418 Return 1 if VALUE is in the range specified by C.
420 `I' is used for the 11 bit constants.
421 `J' is used for the 14 bit constants.
422 `K' is used for values that can be moved with a zdepi insn.
423 `L' is used for the 5 bit constants.
425 `N' is used for values with the least significant 11 bits equal to zero
426 and when sign extended from 32 to 64 bits the
427 value does not change.
428 `O' is used for numbers n such that n+1 is a power of 2.
431 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
432 ((C) == 'I' ? VAL_11_BITS_P (VALUE) \
433 : (C) == 'J' ? VAL_14_BITS_P (VALUE) \
434 : (C) == 'K' ? zdepi_cint_p (VALUE) \
435 : (C) == 'L' ? VAL_5_BITS_P (VALUE) \
436 : (C) == 'M' ? (VALUE) == 0 \
437 : (C) == 'N' ? (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) == 0 \
438 || (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) \
439 == (HOST_WIDE_INT) -1 << 31)) \
440 : (C) == 'O' ? (((VALUE) & ((VALUE) + 1)) == 0) \
441 : (C) == 'P' ? and_mask_p (VALUE) \
444 /* Similar, but for floating or large integer constants, and defining letters
445 G and H. Here VALUE is the CONST_DOUBLE rtx itself.
447 For PA, `G' is the floating-point constant zero. `H' is undefined. */
449 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
450 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
451 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) \
454 /* The class value for index registers, and the one for base regs. */
455 #define INDEX_REG_CLASS GENERAL_REGS
456 #define BASE_REG_CLASS GENERAL_REGS
458 #define FP_REG_CLASS_P(CLASS) \
459 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
461 /* True if register is floating-point. */
462 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
464 /* Given an rtx X being reloaded into a reg required to be
465 in class CLASS, return the class of reg to actually use.
466 In general this is just CLASS; but on some machines
467 in some cases it is preferable to use a more restrictive class. */
468 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
470 /* Return the register class of a scratch register needed to copy
471 IN into a register in CLASS in MODE, or a register in CLASS in MODE
472 to IN. If it can be done directly NO_REGS is returned.
474 Avoid doing any work for the common case calls. */
475 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
476 ((CLASS == BASE_REG_CLASS && GET_CODE (IN) == REG \
477 && REGNO (IN) < FIRST_PSEUDO_REGISTER) \
478 ? NO_REGS : secondary_reload_class (CLASS, MODE, IN))
480 #define MAYBE_FP_REG_CLASS_P(CLASS) \
481 reg_classes_intersect_p ((CLASS), FP_REGS)
483 /* On the PA it is not possible to directly move data between
484 GENERAL_REGS and FP_REGS. */
485 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
486 (MAYBE_FP_REG_CLASS_P (CLASS1) != FP_REG_CLASS_P (CLASS2) \
487 || MAYBE_FP_REG_CLASS_P (CLASS2) != FP_REG_CLASS_P (CLASS1))
489 /* Return the stack location to use for secondary memory needed reloads. */
490 #define SECONDARY_MEMORY_NEEDED_RTX(MODE) \
491 gen_rtx_MEM (MODE, gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (-16)))
494 /* Stack layout; function entry, exit and calling. */
496 /* Define this if pushing a word on the stack
497 makes the stack pointer a smaller address. */
498 /* #define STACK_GROWS_DOWNWARD */
500 /* Believe it or not. */
501 #define ARGS_GROW_DOWNWARD
503 /* Define this to nonzero if the nominal address of the stack frame
504 is at the high-address end of the local variables;
505 that is, each additional local variable allocated
506 goes at a more negative offset in the frame. */
507 #define FRAME_GROWS_DOWNWARD 0
509 /* Offset within stack frame to start allocating local variables at.
510 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
511 first local allocated. Otherwise, it is the offset to the BEGINNING
512 of the first local allocated.
514 On the 32-bit ports, we reserve one slot for the previous frame
515 pointer and one fill slot. The fill slot is for compatibility
516 with HP compiled programs. On the 64-bit ports, we reserve one
517 slot for the previous frame pointer. */
518 #define STARTING_FRAME_OFFSET 8
520 /* Define STACK_ALIGNMENT_NEEDED to zero to disable final alignment
521 of the stack. The default is to align it to STACK_BOUNDARY. */
522 #define STACK_ALIGNMENT_NEEDED 0
524 /* If we generate an insn to push BYTES bytes,
525 this says how many the stack pointer really advances by.
526 On the HP-PA, don't define this because there are no push insns. */
527 /* #define PUSH_ROUNDING(BYTES) */
529 /* Offset of first parameter from the argument pointer register value.
530 This value will be negated because the arguments grow down.
531 Also note that on STACK_GROWS_UPWARD machines (such as this one)
532 this is the distance from the frame pointer to the end of the first
533 argument, not it's beginning. To get the real offset of the first
534 argument, the size of the argument must be added. */
536 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
538 /* When a parameter is passed in a register, stack space is still
540 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
542 /* Define this if the above stack space is to be considered part of the
543 space allocated by the caller. */
544 #define OUTGOING_REG_PARM_STACK_SPACE
546 /* Keep the stack pointer constant throughout the function.
547 This is both an optimization and a necessity: longjmp
548 doesn't behave itself when the stack pointer moves within
550 #define ACCUMULATE_OUTGOING_ARGS 1
552 /* The weird HPPA calling conventions require a minimum of 48 bytes on
553 the stack: 16 bytes for register saves, and 32 bytes for magic.
554 This is the difference between the logical top of stack and the
557 On the 64-bit port, the HP C compiler allocates a 48-byte frame
558 marker, although the runtime documentation only describes a 16
559 byte marker. For compatibility, we allocate 48 bytes. */
560 #define STACK_POINTER_OFFSET \
561 (TARGET_64BIT ? -(current_function_outgoing_args_size + 48): -32)
563 #define STACK_DYNAMIC_OFFSET(FNDECL) \
565 ? (STACK_POINTER_OFFSET) \
566 : ((STACK_POINTER_OFFSET) - current_function_outgoing_args_size))
568 /* Value is 1 if returning from a function call automatically
569 pops the arguments described by the number-of-args field in the call.
570 FUNDECL is the declaration node of the function (as a tree),
571 FUNTYPE is the data type of the function (as a tree),
572 or for a library call it is an identifier node for the subroutine name. */
574 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
576 /* Define how to find the value returned by a function.
577 VALTYPE is the data type of the value (as a tree).
578 If the precise function being called is known, FUNC is its FUNCTION_DECL;
579 otherwise, FUNC is 0. */
581 #define FUNCTION_VALUE(VALTYPE, FUNC) function_value (VALTYPE, FUNC)
583 /* Define how to find the value returned by a library function
584 assuming the value has mode MODE. */
586 #define LIBCALL_VALUE(MODE) \
588 (! TARGET_SOFT_FLOAT \
589 && ((MODE) == SFmode || (MODE) == DFmode) ? 32 : 28))
591 /* 1 if N is a possible register number for a function value
592 as seen by the caller. */
594 #define FUNCTION_VALUE_REGNO_P(N) \
595 ((N) == 28 || (! TARGET_SOFT_FLOAT && (N) == 32))
598 /* Define a data type for recording info about an argument list
599 during the scan of that argument list. This data type should
600 hold all necessary information about the function itself
601 and about the args processed so far, enough to enable macros
602 such as FUNCTION_ARG to determine where the next arg should go.
604 On the HP-PA, the WORDS field holds the number of words
605 of arguments scanned so far (including the invisible argument,
606 if any, which holds the structure-value-address). Thus, 4 or
607 more means all following args should go on the stack.
609 The INCOMING field tracks whether this is an "incoming" or
612 The INDIRECT field indicates whether this is is an indirect
615 The NARGS_PROTOTYPE field indicates that an argument does not
616 have a prototype when it less than or equal to 0. */
618 struct hppa_args {int words, nargs_prototype, incoming, indirect; };
620 #define CUMULATIVE_ARGS struct hppa_args
622 /* Initialize a variable CUM of type CUMULATIVE_ARGS
623 for a call to a function whose data type is FNTYPE.
624 For a library call, FNTYPE is 0. */
626 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
628 (CUM).incoming = 0, \
629 (CUM).indirect = (FNTYPE) && !(FNDECL), \
630 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
631 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
632 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
633 || pa_return_in_memory (TREE_TYPE (FNTYPE), 0))) \
638 /* Similar, but when scanning the definition of a procedure. We always
639 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
641 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
643 (CUM).incoming = 1, \
644 (CUM).indirect = 0, \
645 (CUM).nargs_prototype = 1000
647 /* Figure out the size in words of the function argument. The size
648 returned by this macro should always be greater than zero because
649 we pass variable and zero sized objects by reference. */
651 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
652 ((((MODE) != BLKmode \
653 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
654 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
656 /* Update the data in CUM to advance over an argument
657 of mode MODE and data type TYPE.
658 (TYPE is null for libcalls where that information may not be available.) */
660 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
661 { (CUM).nargs_prototype--; \
662 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
663 + (((CUM).words & 01) && (TYPE) != 0 \
664 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
667 /* Determine where to put an argument to a function.
668 Value is zero to push the argument on the stack,
669 or a hard register in which to store the argument.
671 MODE is the argument's machine mode.
672 TYPE is the data type of the argument (as a tree).
673 This is null for libcalls where that information may
675 CUM is a variable of type CUMULATIVE_ARGS which gives info about
676 the preceding args and about the function being called.
677 NAMED is nonzero if this argument is a named parameter
678 (otherwise it is an extra parameter matching an ellipsis).
680 On the HP-PA the first four words of args are normally in registers
681 and the rest are pushed. But any arg that won't entirely fit in regs
684 Arguments passed in registers are either 1 or 2 words long.
686 The caller must make a distinction between calls to explicitly named
687 functions and calls through pointers to functions -- the conventions
688 are different! Calls through pointers to functions only use general
689 registers for the first four argument words.
691 Of course all this is different for the portable runtime model
692 HP wants everyone to use for ELF. Ugh. Here's a quick description
693 of how it's supposed to work.
695 1) callee side remains unchanged. It expects integer args to be
696 in the integer registers, float args in the float registers and
697 unnamed args in integer registers.
699 2) caller side now depends on if the function being called has
700 a prototype in scope (rather than if it's being called indirectly).
702 2a) If there is a prototype in scope, then arguments are passed
703 according to their type (ints in integer registers, floats in float
704 registers, unnamed args in integer registers.
706 2b) If there is no prototype in scope, then floating point arguments
707 are passed in both integer and float registers. egad.
709 FYI: The portable parameter passing conventions are almost exactly like
710 the standard parameter passing conventions on the RS6000. That's why
711 you'll see lots of similar code in rs6000.h. */
713 /* If defined, a C expression which determines whether, and in which
714 direction, to pad out an argument with extra space. */
715 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
717 /* Specify padding for the last element of a block move between registers
720 The 64-bit runtime specifies that objects need to be left justified
721 (i.e., the normal justification for a big endian target). The 32-bit
722 runtime specifies right justification for objects smaller than 64 bits.
723 We use a DImode register in the parallel for 5 to 7 byte structures
724 so that there is only one element. This allows the object to be
726 #define BLOCK_REG_PADDING(MODE, TYPE, FIRST) \
727 function_arg_padding ((MODE), (TYPE))
729 /* Do not expect to understand this without reading it several times. I'm
730 tempted to try and simply it, but I worry about breaking something. */
732 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
733 function_arg (&CUM, MODE, TYPE, NAMED)
735 /* If defined, a C expression that gives the alignment boundary, in
736 bits, of an argument with the specified mode and type. If it is
737 not defined, `PARM_BOUNDARY' is used for all arguments. */
739 /* Arguments larger than one word are double word aligned. */
741 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
743 ? (integer_zerop (TYPE_SIZE (TYPE)) \
744 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
745 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
746 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
747 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
750 extern GTY(()) rtx hppa_compare_op0;
751 extern GTY(()) rtx hppa_compare_op1;
752 extern enum cmp_type hppa_branch_type;
754 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
755 as assembly via FUNCTION_PROFILER. Just output a local label.
756 We can't use the function label because the GAS SOM target can't
757 handle the difference of a global symbol and a local symbol. */
759 #ifndef FUNC_BEGIN_PROLOG_LABEL
760 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
763 #define FUNCTION_PROFILER(FILE, LABEL) \
764 (*targetm.asm_out.internal_label) (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
766 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
767 void hppa_profile_hook (int label_no);
769 /* The profile counter if emitted must come before the prologue. */
770 #define PROFILE_BEFORE_PROLOGUE 1
772 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
773 the stack pointer does not matter. The value is tested only in
774 functions that have frame pointers.
775 No definition is equivalent to always zero. */
777 extern int may_call_alloca;
779 #define EXIT_IGNORE_STACK \
780 (get_frame_size () != 0 \
781 || current_function_calls_alloca || current_function_outgoing_args_size)
783 /* Output assembler code for a block containing the constant parts
784 of a trampoline, leaving space for the variable parts.\
786 The trampoline sets the static chain pointer to STATIC_CHAIN_REGNUM
787 and then branches to the specified routine.
789 This code template is copied from text segment to stack location
790 and then patched with INITIALIZE_TRAMPOLINE to contain
791 valid values, and then entered as a subroutine.
793 It is best to keep this as small as possible to avoid having to
794 flush multiple lines in the cache. */
796 #define TRAMPOLINE_TEMPLATE(FILE) \
800 fputs ("\tldw 36(%r22),%r21\n", FILE); \
801 fputs ("\tbb,>=,n %r21,30,.+16\n", FILE); \
802 if (ASSEMBLER_DIALECT == 0) \
803 fputs ("\tdepi 0,31,2,%r21\n", FILE); \
805 fputs ("\tdepwi 0,31,2,%r21\n", FILE); \
806 fputs ("\tldw 4(%r21),%r19\n", FILE); \
807 fputs ("\tldw 0(%r21),%r21\n", FILE); \
810 fputs ("\tbve (%r21)\n", FILE); \
811 fputs ("\tldw 40(%r22),%r29\n", FILE); \
812 fputs ("\t.word 0\n", FILE); \
813 fputs ("\t.word 0\n", FILE); \
817 fputs ("\tldsid (%r21),%r1\n", FILE); \
818 fputs ("\tmtsp %r1,%sr0\n", FILE); \
819 fputs ("\tbe 0(%sr0,%r21)\n", FILE); \
820 fputs ("\tldw 40(%r22),%r29\n", FILE); \
822 fputs ("\t.word 0\n", FILE); \
823 fputs ("\t.word 0\n", FILE); \
824 fputs ("\t.word 0\n", FILE); \
825 fputs ("\t.word 0\n", FILE); \
829 fputs ("\t.dword 0\n", FILE); \
830 fputs ("\t.dword 0\n", FILE); \
831 fputs ("\t.dword 0\n", FILE); \
832 fputs ("\t.dword 0\n", FILE); \
833 fputs ("\tmfia %r31\n", FILE); \
834 fputs ("\tldd 24(%r31),%r1\n", FILE); \
835 fputs ("\tldd 24(%r1),%r27\n", FILE); \
836 fputs ("\tldd 16(%r1),%r1\n", FILE); \
837 fputs ("\tbve (%r1)\n", FILE); \
838 fputs ("\tldd 32(%r31),%r31\n", FILE); \
839 fputs ("\t.dword 0 ; fptr\n", FILE); \
840 fputs ("\t.dword 0 ; static link\n", FILE); \
844 /* Length in units of the trampoline for entering a nested function. */
846 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
848 /* Length in units of the trampoline instruction code. */
850 #define TRAMPOLINE_CODE_SIZE (TARGET_64BIT ? 24 : (TARGET_PA_20 ? 32 : 40))
852 /* Minimum length of a cache line. A length of 16 will work on all
853 PA-RISC processors. All PA 1.1 processors have a cache line of
854 32 bytes. Most but not all PA 2.0 processors have a cache line
855 of 64 bytes. As cache flushes are expensive and we don't support
856 PA 1.0, we use a minimum length of 32. */
858 #define MIN_CACHELINE_SIZE 32
860 /* Emit RTL insns to initialize the variable parts of a trampoline.
861 FNADDR is an RTX for the address of the function's pure code.
862 CXT is an RTX for the static chain value for the function.
864 Move the function address to the trampoline template at offset 36.
865 Move the static chain value to trampoline template at offset 40.
866 Move the trampoline address to trampoline template at offset 44.
867 Move r19 to trampoline template at offset 48. The latter two
868 words create a plabel for the indirect call to the trampoline.
870 A similar sequence is used for the 64-bit port but the plabel is
871 at the beginning of the trampoline.
873 Finally, the cache entries for the trampoline code are flushed.
874 This is necessary to ensure that the trampoline instruction sequence
875 is written to memory prior to any attempts at prefetching the code
878 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
880 rtx start_addr = gen_reg_rtx (Pmode); \
881 rtx end_addr = gen_reg_rtx (Pmode); \
882 rtx line_length = gen_reg_rtx (Pmode); \
887 tmp = memory_address (Pmode, plus_constant ((TRAMP), 36)); \
888 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
889 tmp = memory_address (Pmode, plus_constant ((TRAMP), 40)); \
890 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
892 /* Create a fat pointer for the trampoline. */ \
893 tmp = memory_address (Pmode, plus_constant ((TRAMP), 44)); \
894 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (TRAMP)); \
895 tmp = memory_address (Pmode, plus_constant ((TRAMP), 48)); \
896 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
897 gen_rtx_REG (Pmode, 19)); \
899 /* fdc and fic only use registers for the address to flush, \
900 they do not accept integer displacements. We align the \
901 start and end addresses to the beginning of their respective \
902 cache lines to minimize the number of lines flushed. */ \
903 tmp = force_reg (Pmode, (TRAMP)); \
904 emit_insn (gen_andsi3 (start_addr, tmp, \
905 GEN_INT (-MIN_CACHELINE_SIZE))); \
906 tmp = force_reg (Pmode, \
907 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
908 emit_insn (gen_andsi3 (end_addr, tmp, \
909 GEN_INT (-MIN_CACHELINE_SIZE))); \
910 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
911 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
912 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
913 gen_reg_rtx (Pmode), \
914 gen_reg_rtx (Pmode))); \
918 tmp = memory_address (Pmode, plus_constant ((TRAMP), 56)); \
919 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
920 tmp = memory_address (Pmode, plus_constant ((TRAMP), 64)); \
921 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
923 /* Create a fat pointer for the trampoline. */ \
924 tmp = memory_address (Pmode, plus_constant ((TRAMP), 16)); \
925 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
926 force_reg (Pmode, plus_constant ((TRAMP), 32))); \
927 tmp = memory_address (Pmode, plus_constant ((TRAMP), 24)); \
928 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
929 gen_rtx_REG (Pmode, 27)); \
931 /* fdc and fic only use registers for the address to flush, \
932 they do not accept integer displacements. We align the \
933 start and end addresses to the beginning of their respective \
934 cache lines to minimize the number of lines flushed. */ \
935 tmp = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
936 emit_insn (gen_anddi3 (start_addr, tmp, \
937 GEN_INT (-MIN_CACHELINE_SIZE))); \
938 tmp = force_reg (Pmode, \
939 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
940 emit_insn (gen_anddi3 (end_addr, tmp, \
941 GEN_INT (-MIN_CACHELINE_SIZE))); \
942 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
943 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
944 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
945 gen_reg_rtx (Pmode), \
946 gen_reg_rtx (Pmode))); \
950 /* Perform any machine-specific adjustment in the address of the trampoline.
951 ADDR contains the address that was passed to INITIALIZE_TRAMPOLINE.
952 Adjust the trampoline address to point to the plabel at offset 44. */
954 #define TRAMPOLINE_ADJUST_ADDRESS(ADDR) \
955 if (!TARGET_64BIT) (ADDR) = memory_address (Pmode, plus_constant ((ADDR), 46))
957 /* Implement `va_start' for varargs and stdarg. */
959 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
960 hppa_va_start (valist, nextarg)
962 /* Addressing modes, and classification of registers for them.
964 Using autoincrement addressing modes on PA8000 class machines is
967 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
968 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
970 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
971 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
973 /* Macros to check register numbers against specific register classes. */
975 /* The following macros assume that X is a hard or pseudo reg number.
976 They give nonzero only if X is a hard reg of the suitable class
977 or a pseudo reg currently allocated to a suitable hard reg.
978 Since they use reg_renumber, they are safe only once reg_renumber
979 has been allocated, which happens in local-alloc.c. */
981 #define REGNO_OK_FOR_INDEX_P(X) \
983 || (X >= FIRST_PSEUDO_REGISTER \
985 && (unsigned) reg_renumber[X] < 32)))
986 #define REGNO_OK_FOR_BASE_P(X) \
988 || (X >= FIRST_PSEUDO_REGISTER \
990 && (unsigned) reg_renumber[X] < 32)))
991 #define REGNO_OK_FOR_FP_P(X) \
993 || (X >= FIRST_PSEUDO_REGISTER \
995 && FP_REGNO_P (reg_renumber[X])))
997 /* Now macros that check whether X is a register and also,
998 strictly, whether it is in a specified class.
1000 These macros are specific to the HP-PA, and may be used only
1001 in code for printing assembler insns and in conditions for
1002 define_optimization. */
1004 /* 1 if X is an fp register. */
1006 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
1008 /* Maximum number of registers that can appear in a valid memory address. */
1010 #define MAX_REGS_PER_ADDRESS 2
1012 /* Non-TLS symbolic references. */
1013 #define PA_SYMBOL_REF_TLS_P(RTX) \
1014 (GET_CODE (RTX) == SYMBOL_REF && SYMBOL_REF_TLS_MODEL (RTX) != 0)
1016 /* Recognize any constant value that is a valid address except
1017 for symbolic addresses. We get better CSE by rejecting them
1018 here and allowing hppa_legitimize_address to break them up. We
1019 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
1021 #define CONSTANT_ADDRESS_P(X) \
1022 ((GET_CODE (X) == LABEL_REF \
1023 || (GET_CODE (X) == SYMBOL_REF && !SYMBOL_REF_TLS_MODEL (X)) \
1024 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
1025 || GET_CODE (X) == HIGH) \
1026 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
1028 /* A C expression that is nonzero if we are using the new HP assembler. */
1030 #ifndef NEW_HP_ASSEMBLER
1031 #define NEW_HP_ASSEMBLER 0
1034 /* The macros below define the immediate range for CONST_INTS on
1035 the 64-bit port. Constants in this range can be loaded in three
1036 instructions using a ldil/ldo/depdi sequence. Constants outside
1037 this range are forced to the constant pool prior to reload. */
1039 #define MAX_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) 32 << 31)
1040 #define MIN_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) -32 << 31)
1041 #define LEGITIMATE_64BIT_CONST_INT_P(X) \
1042 ((X) >= MIN_LEGIT_64BIT_CONST_INT && (X) < MAX_LEGIT_64BIT_CONST_INT)
1044 /* A C expression that is nonzero if X is a legitimate constant for an
1047 We include all constant integers and constant doubles, but not
1048 floating-point, except for floating-point zero. We reject LABEL_REFs
1049 if we're not using gas or the new HP assembler.
1051 In 64-bit mode, we reject CONST_DOUBLES. We also reject CONST_INTS
1052 that need more than three instructions to load prior to reload. This
1053 limit is somewhat arbitrary. It takes three instructions to load a
1054 CONST_INT from memory but two are memory accesses. It may be better
1055 to increase the allowed range for CONST_INTS. We may also be able
1056 to handle CONST_DOUBLES. */
1058 #define LEGITIMATE_CONSTANT_P(X) \
1059 ((GET_MODE_CLASS (GET_MODE (X)) != MODE_FLOAT \
1060 || (X) == CONST0_RTX (GET_MODE (X))) \
1061 && (NEW_HP_ASSEMBLER || TARGET_GAS || GET_CODE (X) != LABEL_REF) \
1062 && !(TARGET_64BIT && GET_CODE (X) == CONST_DOUBLE) \
1063 && !(TARGET_64BIT && GET_CODE (X) == CONST_INT \
1064 && !(HOST_BITS_PER_WIDE_INT <= 32 \
1065 || (reload_in_progress || reload_completed) \
1066 || LEGITIMATE_64BIT_CONST_INT_P (INTVAL (X)) \
1067 || cint_ok_for_move (INTVAL (X)))) \
1068 && !function_label_operand (X, VOIDmode))
1070 /* Target flags set on a symbol_ref. */
1072 /* Set by ASM_OUTPUT_SYMBOL_REF when a symbol_ref is output. */
1073 #define SYMBOL_FLAG_REFERENCED (1 << SYMBOL_FLAG_MACH_DEP_SHIFT)
1074 #define SYMBOL_REF_REFERENCED_P(RTX) \
1075 ((SYMBOL_REF_FLAGS (RTX) & SYMBOL_FLAG_REFERENCED) != 0)
1077 /* Subroutines for EXTRA_CONSTRAINT.
1079 Return 1 iff OP is a pseudo which did not get a hard register and
1080 we are running the reload pass. */
1081 #define IS_RELOADING_PSEUDO_P(OP) \
1082 ((reload_in_progress \
1083 && GET_CODE (OP) == REG \
1084 && REGNO (OP) >= FIRST_PSEUDO_REGISTER \
1085 && reg_renumber [REGNO (OP)] < 0))
1087 /* Return 1 iff OP is a scaled or unscaled index address. */
1088 #define IS_INDEX_ADDR_P(OP) \
1089 (GET_CODE (OP) == PLUS \
1090 && GET_MODE (OP) == Pmode \
1091 && (GET_CODE (XEXP (OP, 0)) == MULT \
1092 || GET_CODE (XEXP (OP, 1)) == MULT \
1093 || (REG_P (XEXP (OP, 0)) \
1094 && REG_P (XEXP (OP, 1)))))
1096 /* Return 1 iff OP is a LO_SUM DLT address. */
1097 #define IS_LO_SUM_DLT_ADDR_P(OP) \
1098 (GET_CODE (OP) == LO_SUM \
1099 && GET_MODE (OP) == Pmode \
1100 && REG_P (XEXP (OP, 0)) \
1101 && REG_OK_FOR_BASE_P (XEXP (OP, 0)) \
1102 && GET_CODE (XEXP (OP, 1)) == UNSPEC)
1104 /* Optional extra constraints for this machine. Borrowed from sparc.h.
1106 `A' is a LO_SUM DLT memory operand.
1108 `Q' is any memory operand that isn't a symbolic, indexed or lo_sum
1109 memory operand. Note that an unassigned pseudo register is such a
1110 memory operand. Needed because reload will generate these things
1111 and then not re-recognize the insn, causing constrain_operands to
1114 `R' is a scaled/unscaled indexed memory operand.
1116 `S' is the constant 31.
1118 `T' is for floating-point loads and stores.
1120 `U' is the constant 63.
1122 `W' is a register indirect memory operand. We could allow short
1123 displacements but GO_IF_LEGITIMATE_ADDRESS can't tell when a
1124 long displacement is valid. This is only used for prefetch
1125 instructions with the `sl' completer. */
1127 #define EXTRA_CONSTRAINT(OP, C) \
1129 (IS_RELOADING_PSEUDO_P (OP) \
1130 || (GET_CODE (OP) == MEM \
1131 && (reload_in_progress \
1132 || memory_address_p (GET_MODE (OP), XEXP (OP, 0))) \
1133 && !symbolic_memory_operand (OP, VOIDmode) \
1134 && !IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0)) \
1135 && !IS_INDEX_ADDR_P (XEXP (OP, 0)))) \
1137 (GET_CODE (OP) == MEM \
1138 && REG_P (XEXP (OP, 0)) \
1139 && REG_OK_FOR_BASE_P (XEXP (OP, 0))) \
1141 (GET_CODE (OP) == MEM \
1142 && IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0))) \
1144 (GET_CODE (OP) == MEM \
1145 && IS_INDEX_ADDR_P (XEXP (OP, 0))) \
1147 (GET_CODE (OP) == MEM \
1148 && !IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0)) \
1149 && !IS_INDEX_ADDR_P (XEXP (OP, 0)) \
1150 /* Floating-point loads and stores are used to load \
1151 integer values as well as floating-point values. \
1152 They don't have the same set of REG+D address modes \
1153 as integer loads and stores. PA 1.x supports only \
1154 short displacements. PA 2.0 supports long displacements \
1155 but the base register needs to be aligned. \
1157 The checks in GO_IF_LEGITIMATE_ADDRESS for SFmode and \
1158 DFmode test the validity of an address for use in a \
1159 floating point load or store. So, we use SFmode/DFmode \
1160 to see if the address is valid for a floating-point \
1161 load/store operation. */ \
1162 && memory_address_p ((GET_MODE_SIZE (GET_MODE (OP)) == 4 \
1167 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 31) \
1169 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 63) : 0)))))))
1172 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1173 and check its validity for a certain class.
1174 We have two alternate definitions for each of them.
1175 The usual definition accepts all pseudo regs; the other rejects
1176 them unless they have been allocated suitable hard regs.
1177 The symbol REG_OK_STRICT causes the latter definition to be used.
1179 Most source files want to accept pseudo regs in the hope that
1180 they will get allocated to the class that the insn wants them to be in.
1181 Source files for reload pass need to be strict.
1182 After reload, it makes no difference, since pseudo regs have
1183 been eliminated by then. */
1185 #ifndef REG_OK_STRICT
1187 /* Nonzero if X is a hard reg that can be used as an index
1188 or if it is a pseudo reg. */
1189 #define REG_OK_FOR_INDEX_P(X) \
1190 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1191 /* Nonzero if X is a hard reg that can be used as a base reg
1192 or if it is a pseudo reg. */
1193 #define REG_OK_FOR_BASE_P(X) \
1194 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1198 /* Nonzero if X is a hard reg that can be used as an index. */
1199 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1200 /* Nonzero if X is a hard reg that can be used as a base reg. */
1201 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1205 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression that is a
1206 valid memory address for an instruction. The MODE argument is the
1207 machine mode for the MEM expression that wants to use this address.
1209 On HP PA-RISC, the legitimate address forms are REG+SMALLINT,
1210 REG+REG, and REG+(REG*SCALE). The indexed address forms are only
1211 available with floating point loads and stores, and integer loads.
1212 We get better code by allowing indexed addresses in the initial
1215 The acceptance of indexed addresses as legitimate implies that we
1216 must provide patterns for doing indexed integer stores, or the move
1217 expanders must force the address of an indexed store to a register.
1218 We have adopted the latter approach.
1220 Another function of GO_IF_LEGITIMATE_ADDRESS is to ensure that
1221 the base register is a valid pointer for indexed instructions.
1222 On targets that have non-equivalent space registers, we have to
1223 know at the time of assembler output which register in a REG+REG
1224 pair is the base register. The REG_POINTER flag is sometimes lost
1225 in reload and the following passes, so it can't be relied on during
1226 code generation. Thus, we either have to canonicalize the order
1227 of the registers in REG+REG indexed addresses, or treat REG+REG
1228 addresses separately and provide patterns for both permutations.
1230 The latter approach requires several hundred additional lines of
1231 code in pa.md. The downside to canonicalizing is that a PLUS
1232 in the wrong order can't combine to form to make a scaled indexed
1233 memory operand. As we won't need to canonicalize the operands if
1234 the REG_POINTER lossage can be fixed, it seems better canonicalize.
1236 We initially break out scaled indexed addresses in canonical order
1237 in emit_move_sequence. LEGITIMIZE_ADDRESS also canonicalizes
1238 scaled indexed addresses during RTL generation. However, fold_rtx
1239 has its own opinion on how the operands of a PLUS should be ordered.
1240 If one of the operands is equivalent to a constant, it will make
1241 that operand the second operand. As the base register is likely to
1242 be equivalent to a SYMBOL_REF, we have made it the second operand.
1244 GO_IF_LEGITIMATE_ADDRESS accepts REG+REG as legitimate when the
1245 operands are in the order INDEX+BASE on targets with non-equivalent
1246 space registers, and in any order on targets with equivalent space
1247 registers. It accepts both MULT+BASE and BASE+MULT for scaled indexing.
1249 We treat a SYMBOL_REF as legitimate if it is part of the current
1250 function's constant-pool, because such addresses can actually be
1251 output as REG+SMALLINT.
1253 Note we only allow 5 bit immediates for access to a constant address;
1254 doing so avoids losing for loading/storing a FP register at an address
1255 which will not fit in 5 bits. */
1257 #define VAL_5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x10 < 0x20)
1258 #define INT_5_BITS(X) VAL_5_BITS_P (INTVAL (X))
1260 #define VAL_U5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) < 0x20)
1261 #define INT_U5_BITS(X) VAL_U5_BITS_P (INTVAL (X))
1263 #define VAL_11_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x400 < 0x800)
1264 #define INT_11_BITS(X) VAL_11_BITS_P (INTVAL (X))
1266 #define VAL_14_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x2000 < 0x4000)
1267 #define INT_14_BITS(X) VAL_14_BITS_P (INTVAL (X))
1269 #if HOST_BITS_PER_WIDE_INT > 32
1270 #define VAL_32_BITS_P(X) \
1271 ((unsigned HOST_WIDE_INT)(X) + ((unsigned HOST_WIDE_INT) 1 << 31) \
1272 < (unsigned HOST_WIDE_INT) 2 << 31)
1274 #define VAL_32_BITS_P(X) 1
1276 #define INT_32_BITS(X) VAL_32_BITS_P (INTVAL (X))
1278 /* These are the modes that we allow for scaled indexing. */
1279 #define MODE_OK_FOR_SCALED_INDEXING_P(MODE) \
1280 ((TARGET_64BIT && (MODE) == DImode) \
1281 || (MODE) == SImode \
1282 || (MODE) == HImode \
1283 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1285 /* These are the modes that we allow for unscaled indexing. */
1286 #define MODE_OK_FOR_UNSCALED_INDEXING_P(MODE) \
1287 ((TARGET_64BIT && (MODE) == DImode) \
1288 || (MODE) == SImode \
1289 || (MODE) == HImode \
1290 || (MODE) == QImode \
1291 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1293 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1295 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1296 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1297 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1298 && REG_P (XEXP (X, 0)) \
1299 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1301 else if (GET_CODE (X) == PLUS) \
1303 rtx base = 0, index = 0; \
1304 if (REG_P (XEXP (X, 1)) \
1305 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1306 base = XEXP (X, 1), index = XEXP (X, 0); \
1307 else if (REG_P (XEXP (X, 0)) \
1308 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1309 base = XEXP (X, 0), index = XEXP (X, 1); \
1311 && GET_CODE (index) == CONST_INT \
1312 && ((INT_14_BITS (index) \
1313 && (((MODE) != DImode \
1314 && (MODE) != SFmode \
1315 && (MODE) != DFmode) \
1316 /* The base register for DImode loads and stores \
1317 with long displacements must be aligned because \
1318 the lower three bits in the displacement are \
1319 assumed to be zero. */ \
1320 || ((MODE) == DImode \
1322 || (INTVAL (index) % 8) == 0)) \
1323 /* Similarly, the base register for SFmode/DFmode \
1324 loads and stores with long displacements must \
1327 FIXME: the ELF32 linker clobbers the LSB of \
1328 the FP register number in PA 2.0 floating-point \
1329 insns with long displacements. This is because \
1330 R_PARISC_DPREL14WR and other relocations like \
1331 it are not supported. For now, we reject long \
1332 displacements on this target. */ \
1333 || (((MODE) == SFmode || (MODE) == DFmode) \
1334 && (TARGET_SOFT_FLOAT \
1337 && (INTVAL (index) \
1338 % GET_MODE_SIZE (MODE)) == 0))))) \
1339 || INT_5_BITS (index))) \
1341 if (!TARGET_DISABLE_INDEXING \
1342 /* Only accept the "canonical" INDEX+BASE operand order \
1343 on targets with non-equivalent space registers. */ \
1344 && (TARGET_NO_SPACE_REGS \
1345 ? (base && REG_P (index)) \
1346 : (base == XEXP (X, 1) && REG_P (index) \
1347 && (reload_completed \
1348 || (reload_in_progress && HARD_REGISTER_P (base)) \
1349 || REG_POINTER (base)) \
1350 && (reload_completed \
1351 || (reload_in_progress && HARD_REGISTER_P (index)) \
1352 || !REG_POINTER (index)))) \
1353 && MODE_OK_FOR_UNSCALED_INDEXING_P (MODE) \
1354 && REG_OK_FOR_INDEX_P (index) \
1355 && borx_reg_operand (base, Pmode) \
1356 && borx_reg_operand (index, Pmode)) \
1358 if (!TARGET_DISABLE_INDEXING \
1360 && GET_CODE (index) == MULT \
1361 && MODE_OK_FOR_SCALED_INDEXING_P (MODE) \
1362 && REG_P (XEXP (index, 0)) \
1363 && GET_MODE (XEXP (index, 0)) == Pmode \
1364 && REG_OK_FOR_INDEX_P (XEXP (index, 0)) \
1365 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1366 && INTVAL (XEXP (index, 1)) \
1367 == (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
1368 && borx_reg_operand (base, Pmode)) \
1371 else if (GET_CODE (X) == LO_SUM \
1372 && GET_CODE (XEXP (X, 0)) == REG \
1373 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1374 && CONSTANT_P (XEXP (X, 1)) \
1375 && (TARGET_SOFT_FLOAT \
1376 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1379 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1380 || ((MODE) != SFmode \
1381 && (MODE) != DFmode))) \
1383 else if (GET_CODE (X) == LO_SUM \
1384 && GET_CODE (XEXP (X, 0)) == SUBREG \
1385 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG \
1386 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0))) \
1387 && CONSTANT_P (XEXP (X, 1)) \
1388 && (TARGET_SOFT_FLOAT \
1389 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1392 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1393 || ((MODE) != SFmode \
1394 && (MODE) != DFmode))) \
1396 else if (GET_CODE (X) == LABEL_REF \
1397 || (GET_CODE (X) == CONST_INT \
1398 && INT_5_BITS (X))) \
1400 /* Needed for -fPIC */ \
1401 else if (GET_CODE (X) == LO_SUM \
1402 && GET_CODE (XEXP (X, 0)) == REG \
1403 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1404 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1405 && (TARGET_SOFT_FLOAT \
1406 || (TARGET_PA_20 && !TARGET_ELF32) \
1407 || ((MODE) != SFmode \
1408 && (MODE) != DFmode))) \
1412 /* Look for machine dependent ways to make the invalid address AD a
1415 For the PA, transform:
1417 memory(X + <large int>)
1421 if (<large int> & mask) >= 16
1422 Y = (<large int> & ~mask) + mask + 1 Round up.
1424 Y = (<large int> & ~mask) Round down.
1426 memory (Z + (<large int> - Y));
1428 This makes reload inheritance and reload_cse work better since Z
1431 There may be more opportunities to improve code with this hook. */
1432 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1434 long offset, newoffset, mask; \
1435 rtx new, temp = NULL_RTX; \
1437 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1438 ? (TARGET_PA_20 && !TARGET_ELF32 ? 0x3fff : 0x1f) : 0x3fff); \
1440 if (optimize && GET_CODE (AD) == PLUS) \
1441 temp = simplify_binary_operation (PLUS, Pmode, \
1442 XEXP (AD, 0), XEXP (AD, 1)); \
1444 new = temp ? temp : AD; \
1447 && GET_CODE (new) == PLUS \
1448 && GET_CODE (XEXP (new, 0)) == REG \
1449 && GET_CODE (XEXP (new, 1)) == CONST_INT) \
1451 offset = INTVAL (XEXP ((new), 1)); \
1453 /* Choose rounding direction. Round up if we are >= halfway. */ \
1454 if ((offset & mask) >= ((mask + 1) / 2)) \
1455 newoffset = (offset & ~mask) + mask + 1; \
1457 newoffset = offset & ~mask; \
1459 /* Ensure that long displacements are aligned. */ \
1460 if (!VAL_5_BITS_P (newoffset) \
1461 && GET_MODE_CLASS (MODE) == MODE_FLOAT) \
1462 newoffset &= ~(GET_MODE_SIZE (MODE) -1); \
1464 if (newoffset != 0 && VAL_14_BITS_P (newoffset)) \
1466 temp = gen_rtx_PLUS (Pmode, XEXP (new, 0), \
1467 GEN_INT (newoffset)); \
1468 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1469 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1470 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1480 /* Try machine-dependent ways of modifying an illegitimate address
1481 to be legitimate. If we find one, return the new, valid address.
1482 This macro is used in only one place: `memory_address' in explow.c.
1484 OLDX is the address as it was before break_out_memory_refs was called.
1485 In some cases it is useful to look at this to decide what needs to be done.
1487 MODE and WIN are passed so that this macro can use
1488 GO_IF_LEGITIMATE_ADDRESS.
1490 It is always safe for this macro to do nothing. It exists to recognize
1491 opportunities to optimize the output. */
1493 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1494 { rtx orig_x = (X); \
1495 (X) = hppa_legitimize_address (X, OLDX, MODE); \
1496 if ((X) != orig_x && memory_address_p (MODE, X)) \
1499 /* Go to LABEL if ADDR (a legitimate address expression)
1500 has an effect that depends on the machine mode it is used for. */
1502 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1503 if (GET_CODE (ADDR) == PRE_DEC \
1504 || GET_CODE (ADDR) == POST_DEC \
1505 || GET_CODE (ADDR) == PRE_INC \
1506 || GET_CODE (ADDR) == POST_INC) \
1509 #define TARGET_ASM_SELECT_SECTION pa_select_section
1511 /* Return a nonzero value if DECL has a section attribute. */
1512 #define IN_NAMED_SECTION_P(DECL) \
1513 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
1514 && DECL_SECTION_NAME (DECL) != NULL_TREE)
1516 /* The following extra sections and extra section functions are only used
1517 for SOM, but they must be provided unconditionally because pa.c's calls
1518 to the functions might not get optimized out when other object formats
1521 #define EXTRA_SECTIONS \
1522 in_som_readonly_data, \
1523 in_som_one_only_readonly_data, \
1524 in_som_one_only_data
1526 #define EXTRA_SECTION_FUNCTIONS \
1527 SOM_READONLY_DATA_SECTION_FUNCTION \
1528 SOM_ONE_ONLY_READONLY_DATA_SECTION_FUNCTION \
1529 SOM_ONE_ONLY_DATA_SECTION_FUNCTION \
1530 FORGET_SECTION_FUNCTION
1532 /* SOM puts readonly data in the default $LIT$ subspace when PIC code
1533 is not being generated. */
1534 #define SOM_READONLY_DATA_SECTION_FUNCTION \
1536 som_readonly_data_section (void) \
1540 if (in_section != in_som_readonly_data) \
1542 in_section = in_som_readonly_data; \
1543 fputs ("\t.SPACE $TEXT$\n\t.SUBSPA $LIT$\n", asm_out_file); \
1547 /* When secondary definitions are not supported, SOM makes readonly data one
1548 only by creating a new $LIT$ subspace in $TEXT$ with the comdat flag. */
1549 #define SOM_ONE_ONLY_READONLY_DATA_SECTION_FUNCTION \
1551 som_one_only_readonly_data_section (void) \
1555 in_section = in_som_one_only_readonly_data; \
1556 fputs ("\t.SPACE $TEXT$\n" \
1557 "\t.NSUBSPA $LIT$,QUAD=0,ALIGN=8,ACCESS=0x2c,SORT=16,COMDAT\n",\
1561 /* When secondary definitions are not supported, SOM makes data one only by
1562 creating a new $DATA$ subspace in $PRIVATE$ with the comdat flag. */
1563 #define SOM_ONE_ONLY_DATA_SECTION_FUNCTION \
1565 som_one_only_data_section (void) \
1569 in_section = in_som_one_only_data; \
1570 fputs ("\t.SPACE $PRIVATE$\n" \
1571 "\t.NSUBSPA $DATA$,QUAD=1,ALIGN=8,ACCESS=31,SORT=24,COMDAT\n", \
1575 #define FORGET_SECTION_FUNCTION \
1577 forget_section (void) \
1579 in_section = no_section; \
1582 /* Define this macro if references to a symbol must be treated
1583 differently depending on something about the variable or
1584 function named by the symbol (such as what section it is in).
1586 The macro definition, if any, is executed immediately after the
1587 rtl for DECL or other node is created.
1588 The value of the rtl will be a `mem' whose address is a
1591 The usual thing for this macro to do is to a flag in the
1592 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1593 name string in the `symbol_ref' (if one bit is not enough
1596 On the HP-PA we use this to indicate if a symbol is in text or
1597 data space. Also, function labels need special treatment. */
1599 #define TEXT_SPACE_P(DECL)\
1600 (TREE_CODE (DECL) == FUNCTION_DECL \
1601 || (TREE_CODE (DECL) == VAR_DECL \
1602 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1603 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1605 || CONSTANT_CLASS_P (DECL))
1607 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1609 /* Specify the machine mode that this machine uses for the index in the
1610 tablejump instruction. For small tables, an element consists of a
1611 ia-relative branch and its delay slot. When -mbig-switch is specified,
1612 we use a 32-bit absolute address for non-pic code, and a 32-bit offset
1613 for both 32 and 64-bit pic code. */
1614 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? SImode : DImode)
1616 /* Jump tables must be 32-bit aligned, no matter the size of the element. */
1617 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1619 /* Define this as 1 if `char' should by default be signed; else as 0. */
1620 #define DEFAULT_SIGNED_CHAR 1
1622 /* Max number of bytes we can move from memory to memory
1623 in one reasonably fast instruction. */
1626 /* Higher than the default as we prefer to use simple move insns
1627 (better scheduling and delay slot filling) and because our
1628 built-in block move is really a 2X unrolled loop.
1630 Believe it or not, this has to be big enough to allow for copying all
1631 arguments passed in registers to avoid infinite recursion during argument
1632 setup for a function call. Why? Consider how we copy the stack slots
1633 reserved for parameters when they may be trashed by a call. */
1634 #define MOVE_RATIO (TARGET_64BIT ? 8 : 4)
1636 /* Define if operations between registers always perform the operation
1637 on the full register even if a narrower mode is specified. */
1638 #define WORD_REGISTER_OPERATIONS
1640 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1641 will either zero-extend or sign-extend. The value of this macro should
1642 be the code that says which one of the two operations is implicitly
1643 done, UNKNOWN if none. */
1644 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1646 /* Nonzero if access to memory by bytes is slow and undesirable. */
1647 #define SLOW_BYTE_ACCESS 1
1649 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1650 is done just by pretending it is already truncated. */
1651 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1653 /* Specify the machine mode that pointers have.
1654 After generation of rtl, the compiler makes no further distinction
1655 between pointers and any other objects of this machine mode. */
1656 #define Pmode word_mode
1658 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1659 return the mode to be used for the comparison. For floating-point, CCFPmode
1660 should be used. CC_NOOVmode should be used when the first operand is a
1661 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1663 #define SELECT_CC_MODE(OP,X,Y) \
1664 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1666 /* A function address in a call instruction
1667 is a byte address (for indexing purposes)
1668 so give the MEM rtx a byte's mode. */
1669 #define FUNCTION_MODE SImode
1671 /* Define this if addresses of constant functions
1672 shouldn't be put through pseudo regs where they can be cse'd.
1673 Desirable on machines where ordinary constants are expensive
1674 but a CALL with constant address is cheap. */
1675 #define NO_FUNCTION_CSE
1677 /* Define this to be nonzero if shift instructions ignore all but the low-order
1679 #define SHIFT_COUNT_TRUNCATED 1
1681 /* Compute extra cost of moving data between one register class
1684 Make moves from SAR so expensive they should never happen. We used to
1685 have 0xffff here, but that generates overflow in rare cases.
1687 Copies involving a FP register and a non-FP register are relatively
1688 expensive because they must go through memory.
1690 Other copies are reasonably cheap. */
1691 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1692 (CLASS1 == SHIFT_REGS ? 0x100 \
1693 : FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16 \
1694 : FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16 \
1697 /* Adjust the cost of branches. */
1698 #define BRANCH_COST (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1700 /* Handling the special cases is going to get too complicated for a macro,
1701 just call `pa_adjust_insn_length' to do the real work. */
1702 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1703 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1705 /* Millicode insns are actually function calls with some special
1706 constraints on arguments and register usage.
1708 Millicode calls always expect their arguments in the integer argument
1709 registers, and always return their result in %r29 (ret1). They
1710 are expected to clobber their arguments, %r1, %r29, and the return
1711 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1713 This macro tells reorg that the references to arguments and
1714 millicode calls do not appear to happen until after the millicode call.
1715 This allows reorg to put insns which set the argument registers into the
1716 delay slot of the millicode call -- thus they act more like traditional
1719 Note we cannot consider side effects of the insn to be delayed because
1720 the branch and link insn will clobber the return pointer. If we happened
1721 to use the return pointer in the delay slot of the call, then we lose.
1723 get_attr_type will try to recognize the given insn, so make sure to
1724 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1726 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1729 /* Control the assembler format that we output. */
1731 /* A C string constant describing how to begin a comment in the target
1732 assembler language. The compiler assumes that the comment will end at
1733 the end of the line. */
1735 #define ASM_COMMENT_START ";"
1737 /* Output to assembler file text saying following lines
1738 may contain character constants, extra white space, comments, etc. */
1740 #define ASM_APP_ON ""
1742 /* Output to assembler file text saying following lines
1743 no longer contain unusual constructs. */
1745 #define ASM_APP_OFF ""
1747 /* This is how to output the definition of a user-level label named NAME,
1748 such as the label on a static function or variable NAME. */
1750 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1751 do { assemble_name (FILE, NAME); \
1752 fputc ('\n', FILE); } while (0)
1754 /* This is how to output a reference to a user-level label named NAME.
1755 `assemble_name' uses this. */
1757 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1759 const char *xname = (NAME); \
1760 if (FUNCTION_NAME_P (NAME)) \
1762 if (xname[0] == '*') \
1765 fputs (user_label_prefix, FILE); \
1766 fputs (xname, FILE); \
1769 /* This how we output the symbol_ref X. */
1771 #define ASM_OUTPUT_SYMBOL_REF(FILE,X) \
1773 SYMBOL_REF_FLAGS (X) |= SYMBOL_FLAG_REFERENCED; \
1774 assemble_name (FILE, XSTR (X, 0)); \
1777 /* This is how to store into the string LABEL
1778 the symbol_ref name of an internal numbered label where
1779 PREFIX is the class of label and NUM is the number within the class.
1780 This is suitable for output with `assemble_name'. */
1782 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1783 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1785 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1787 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1788 output_ascii ((FILE), (P), (SIZE))
1790 /* Jump tables are always placed in the text section. Technically, it
1791 is possible to put them in the readonly data section when -mbig-switch
1792 is specified. This has the benefit of getting the table out of .text
1793 and reducing branch lengths as a result. The downside is that an
1794 additional insn (addil) is needed to access the table when generating
1795 PIC code. The address difference table also has to use 32-bit
1796 pc-relative relocations. Currently, GAS does not support these
1797 relocations, although it is easily modified to do this operation.
1798 The table entries need to look like "$L1+(.+8-$L0)-$PIC_pcrel$0"
1799 when using ELF GAS. A simple difference can be used when using
1800 SOM GAS or the HP assembler. The final downside is GDB complains
1801 about the nesting of the label for the table when debugging. */
1803 #define JUMP_TABLES_IN_TEXT_SECTION 1
1805 /* This is how to output an element of a case-vector that is absolute. */
1807 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1808 if (TARGET_BIG_SWITCH) \
1809 fprintf (FILE, "\t.word L$%04d\n", VALUE); \
1811 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1813 /* This is how to output an element of a case-vector that is relative.
1814 Since we always place jump tables in the text section, the difference
1815 is absolute and requires no relocation. */
1817 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1818 if (TARGET_BIG_SWITCH) \
1819 fprintf (FILE, "\t.word L$%04d-L$%04d\n", VALUE, REL); \
1821 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1823 /* This is how to output an assembler line that says to advance the
1824 location counter to a multiple of 2**LOG bytes. */
1826 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1827 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1829 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1830 fprintf (FILE, "\t.blockz "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1831 (unsigned HOST_WIDE_INT)(SIZE))
1833 /* This says how to output an assembler line to define an uninitialized
1834 global variable with size SIZE (in bytes) and alignment ALIGN (in bits).
1835 This macro exists to properly support languages like C++ which do not
1836 have common data. */
1838 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
1839 pa_asm_output_aligned_bss (FILE, NAME, SIZE, ALIGN)
1841 /* This says how to output an assembler line to define a global common symbol
1842 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1844 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGN) \
1845 pa_asm_output_aligned_common (FILE, NAME, SIZE, ALIGN)
1847 /* This says how to output an assembler line to define a local common symbol
1848 with size SIZE (in bytes) and alignment ALIGN (in bits). This macro
1849 controls how the assembler definitions of uninitialized static variables
1852 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGN) \
1853 pa_asm_output_aligned_local (FILE, NAME, SIZE, ALIGN)
1856 #define ASM_PN_FORMAT "%s___%lu"
1858 /* All HP assemblers use "!" to separate logical lines. */
1859 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == '!')
1861 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
1862 ((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
1864 /* Print operand X (an rtx) in assembler syntax to file FILE.
1865 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1866 For `%' followed by punctuation, CODE is the punctuation and X is null.
1868 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1869 and an immediate zero should be represented as `r0'.
1871 Several % codes are defined:
1873 C compare conditions
1874 N extract conditions
1875 M modifier to handle preincrement addressing for memory refs.
1876 F modifier to handle preincrement addressing for fp memory refs */
1878 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1881 /* Print a memory address as an operand to reference that memory location. */
1883 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1884 { rtx addr = ADDR; \
1885 switch (GET_CODE (addr)) \
1888 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1891 gcc_assert (GET_CODE (XEXP (addr, 1)) == CONST_INT); \
1892 fprintf (FILE, "%d(%s)", (int)INTVAL (XEXP (addr, 1)), \
1893 reg_names [REGNO (XEXP (addr, 0))]); \
1896 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1897 fputs ("R'", FILE); \
1898 else if (flag_pic == 0) \
1899 fputs ("RR'", FILE); \
1901 fputs ("RT'", FILE); \
1902 output_global_address (FILE, XEXP (addr, 1), 0); \
1903 fputs ("(", FILE); \
1904 output_operand (XEXP (addr, 0), 0); \
1905 fputs (")", FILE); \
1908 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC "(%%r0)", INTVAL (addr)); \
1911 output_addr_const (FILE, addr); \
1915 /* Find the return address associated with the frame given by
1917 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1918 (return_addr_rtx (COUNT, FRAMEADDR))
1920 /* Used to mask out junk bits from the return address, such as
1921 processor state, interrupt status, condition codes and the like. */
1922 #define MASK_RETURN_ADDR \
1923 /* The privilege level is in the two low order bits, mask em out \
1924 of the return address. */ \
1927 /* The number of Pmode words for the setjmp buffer. */
1928 #define JMP_BUF_SIZE 50
1930 /* We need a libcall to canonicalize function pointers on TARGET_ELF32. */
1931 #define CANONICALIZE_FUNCPTR_FOR_COMPARE_LIBCALL \
1932 "__canonicalize_funcptr_for_compare"
1935 #undef TARGET_HAVE_TLS
1936 #define TARGET_HAVE_TLS true
OSDN Git Service
