1 /* Definitions of target machine for GNU compiler, for the HP Spectrum.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
3 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) of Cygnus Support
6 and Tim Moore (moore@defmacro.cs.utah.edu) of the Center for
7 Software Science at the University of Utah.
9 This file is part of GCC.
11 GCC is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 3, or (at your option)
16 GCC is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with GCC; see the file COPYING3. If not see
23 <http://www.gnu.org/licenses/>. */
25 /* For long call handling. */
26 extern unsigned long total_code_bytes;
28 /* Which processor to schedule for. */
40 /* For -mschedule= option. */
41 extern enum processor_type pa_cpu;
43 /* For -munix= option. */
44 extern int flag_pa_unix;
46 #define pa_cpu_attr ((enum attr_cpu)pa_cpu)
48 /* Print subsidiary information on the compiler version in use. */
50 #define TARGET_VERSION fputs (" (hppa)", stderr);
52 #define TARGET_PA_10 (!TARGET_PA_11 && !TARGET_PA_20)
54 /* Generate code for the HPPA 2.0 architecture in 64bit mode. */
56 #define TARGET_64BIT 0
59 /* Generate code for ELF32 ABI. */
61 #define TARGET_ELF32 0
64 /* Generate code for SOM 32bit ABI. */
69 /* HP-UX UNIX features. */
74 /* HP-UX 10.10 UNIX 95 features. */
75 #ifndef TARGET_HPUX_10_10
76 #define TARGET_HPUX_10_10 0
79 /* HP-UX 11.* features (11.00, 11.11, 11.23, etc.) */
80 #ifndef TARGET_HPUX_11
81 #define TARGET_HPUX_11 0
84 /* HP-UX 11i multibyte and UNIX 98 extensions. */
85 #ifndef TARGET_HPUX_11_11
86 #define TARGET_HPUX_11_11 0
89 /* The following three defines are potential target switches. The current
90 defines are optimal given the current capabilities of GAS and GNU ld. */
92 /* Define to a C expression evaluating to true to use long absolute calls.
93 Currently, only the HP assembler and SOM linker support long absolute
94 calls. They are used only in non-pic code. */
95 #define TARGET_LONG_ABS_CALL (TARGET_SOM && !TARGET_GAS)
97 /* Define to a C expression evaluating to true to use long PIC symbol
98 difference calls. Long PIC symbol difference calls are only used with
99 the HP assembler and linker. The HP assembler detects this instruction
100 sequence and treats it as long pc-relative call. Currently, GAS only
101 allows a difference of two symbols in the same subspace, and it doesn't
102 detect the sequence as a pc-relative call. */
103 #define TARGET_LONG_PIC_SDIFF_CALL (!TARGET_GAS && TARGET_HPUX)
105 /* Define to a C expression evaluating to true to use long PIC
106 pc-relative calls. Long PIC pc-relative calls are only used with
107 GAS. Currently, they are usable for calls which bind local to a
108 module but not for external calls. */
109 #define TARGET_LONG_PIC_PCREL_CALL 0
111 /* Define to a C expression evaluating to true to use SOM secondary
112 definition symbols for weak support. Linker support for secondary
113 definition symbols is buggy prior to HP-UX 11.X. */
114 #define TARGET_SOM_SDEF 0
116 /* Define to a C expression evaluating to true to save the entry value
117 of SP in the current frame marker. This is normally unnecessary.
118 However, the HP-UX unwind library looks at the SAVE_SP callinfo flag.
119 HP compilers don't use this flag but it is supported by the assembler.
120 We set this flag to indicate that register %r3 has been saved at the
121 start of the frame. Thus, when the HP unwind library is used, we
122 need to generate additional code to save SP into the frame marker. */
123 #define TARGET_HPUX_UNWIND_LIBRARY 0
125 #ifndef TARGET_DEFAULT
126 #define TARGET_DEFAULT (MASK_GAS | MASK_JUMP_IN_DELAY | MASK_BIG_SWITCH)
129 #ifndef TARGET_CPU_DEFAULT
130 #define TARGET_CPU_DEFAULT 0
133 #ifndef TARGET_SCHED_DEFAULT
134 #define TARGET_SCHED_DEFAULT PROCESSOR_8000
137 /* Support for a compile-time default CPU, et cetera. The rules are:
138 --with-schedule is ignored if -mschedule is specified.
139 --with-arch is ignored if -march is specified. */
140 #define OPTION_DEFAULT_SPECS \
141 {"arch", "%{!march=*:-march=%(VALUE)}" }, \
142 {"schedule", "%{!mschedule=*:-mschedule=%(VALUE)}" }
144 /* Specify the dialect of assembler to use. New mnemonics is dialect one
145 and the old mnemonics are dialect zero. */
146 #define ASSEMBLER_DIALECT (TARGET_PA_20 ? 1 : 0)
148 /* Override some settings from dbxelf.h. */
150 /* We do not have to be compatible with dbx, so we enable gdb extensions
152 #define DEFAULT_GDB_EXTENSIONS 1
154 /* This used to be zero (no max length), but big enums and such can
155 cause huge strings which killed gas.
157 We also have to avoid lossage in dbxout.c -- it does not compute the
158 string size accurately, so we are real conservative here. */
159 #undef DBX_CONTIN_LENGTH
160 #define DBX_CONTIN_LENGTH 3000
162 /* GDB always assumes the current function's frame begins at the value
163 of the stack pointer upon entry to the current function. Accessing
164 local variables and parameters passed on the stack is done using the
165 base of the frame + an offset provided by GCC.
167 For functions which have frame pointers this method works fine;
168 the (frame pointer) == (stack pointer at function entry) and GCC provides
169 an offset relative to the frame pointer.
171 This loses for functions without a frame pointer; GCC provides an offset
172 which is relative to the stack pointer after adjusting for the function's
173 frame size. GDB would prefer the offset to be relative to the value of
174 the stack pointer at the function's entry. Yuk! */
175 #define DEBUGGER_AUTO_OFFSET(X) \
176 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
177 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
179 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
180 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
181 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
183 #define TARGET_CPU_CPP_BUILTINS() \
185 builtin_assert("cpu=hppa"); \
186 builtin_assert("machine=hppa"); \
187 builtin_define("__hppa"); \
188 builtin_define("__hppa__"); \
190 builtin_define("_PA_RISC2_0"); \
191 else if (TARGET_PA_11) \
192 builtin_define("_PA_RISC1_1"); \
194 builtin_define("_PA_RISC1_0"); \
197 /* An old set of OS defines for various BSD-like systems. */
198 #define TARGET_OS_CPP_BUILTINS() \
201 builtin_define_std ("REVARGV"); \
202 builtin_define_std ("hp800"); \
203 builtin_define_std ("hp9000"); \
204 builtin_define_std ("hp9k8"); \
205 if (!c_dialect_cxx () && !flag_iso) \
206 builtin_define ("hppa"); \
207 builtin_define_std ("spectrum"); \
208 builtin_define_std ("unix"); \
209 builtin_assert ("system=bsd"); \
210 builtin_assert ("system=unix"); \
214 #define CC1_SPEC "%{pg:} %{p:}"
216 #define LINK_SPEC "%{mlinker-opt:-O} %{!shared:-u main} %{shared:-b}"
218 /* We don't want -lg. */
220 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
223 /* Make gcc agree with <machine/ansi.h> */
225 #define SIZE_TYPE "unsigned int"
226 #define PTRDIFF_TYPE "int"
227 #define WCHAR_TYPE "unsigned int"
228 #define WCHAR_TYPE_SIZE 32
230 /* Show we can debug even without a frame pointer. */
231 #define CAN_DEBUG_WITHOUT_FP
233 /* target machine storage layout */
234 typedef struct GTY(()) machine_function
236 /* Flag indicating that a .NSUBSPA directive has been output for
241 /* Define this macro if it is advisable to hold scalars in registers
242 in a wider mode than that declared by the program. In such cases,
243 the value is constrained to be within the bounds of the declared
244 type, but kept valid in the wider mode. The signedness of the
245 extension may differ from that of the type. */
247 #define PROMOTE_MODE(MODE,UNSIGNEDP,TYPE) \
248 if (GET_MODE_CLASS (MODE) == MODE_INT \
249 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
252 /* Define this if most significant bit is lowest numbered
253 in instructions that operate on numbered bit-fields. */
254 #define BITS_BIG_ENDIAN 1
256 /* Define this if most significant byte of a word is the lowest numbered. */
257 /* That is true on the HP-PA. */
258 #define BYTES_BIG_ENDIAN 1
260 /* Define this if most significant word of a multiword number is lowest
262 #define WORDS_BIG_ENDIAN 1
264 #define MAX_BITS_PER_WORD 64
266 /* Width of a word, in units (bytes). */
267 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
269 /* Minimum number of units in a word. If this is undefined, the default
270 is UNITS_PER_WORD. Otherwise, it is the constant value that is the
271 smallest value that UNITS_PER_WORD can have at run-time.
273 FIXME: This needs to be 4 when TARGET_64BIT is true to suppress the
274 building of various TImode routines in libgcc. The HP runtime
275 specification doesn't provide the alignment requirements and calling
276 conventions for TImode variables. */
277 #define MIN_UNITS_PER_WORD 4
279 /* The widest floating point format supported by the hardware. Note that
280 setting this influences some Ada floating point type sizes, currently
281 required for GNAT to operate properly. */
282 #define WIDEST_HARDWARE_FP_SIZE 64
284 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
285 #define PARM_BOUNDARY BITS_PER_WORD
287 /* Largest alignment required for any stack parameter, in bits.
288 Don't define this if it is equal to PARM_BOUNDARY */
289 #define MAX_PARM_BOUNDARY BIGGEST_ALIGNMENT
291 /* Boundary (in *bits*) on which stack pointer is always aligned;
292 certain optimizations in combine depend on this.
294 The HP-UX runtime documents mandate 64-byte and 16-byte alignment for
295 the stack on the 32 and 64-bit ports, respectively. However, we
296 are only guaranteed that the stack is aligned to BIGGEST_ALIGNMENT
297 in main. Thus, we treat the former as the preferred alignment. */
298 #define STACK_BOUNDARY BIGGEST_ALIGNMENT
299 #define PREFERRED_STACK_BOUNDARY (TARGET_64BIT ? 128 : 512)
301 /* Allocation boundary (in *bits*) for the code of a function. */
302 #define FUNCTION_BOUNDARY BITS_PER_WORD
304 /* Alignment of field after `int : 0' in a structure. */
305 #define EMPTY_FIELD_BOUNDARY 32
307 /* Every structure's size must be a multiple of this. */
308 #define STRUCTURE_SIZE_BOUNDARY 8
310 /* A bit-field declared as `int' forces `int' alignment for the struct. */
311 #define PCC_BITFIELD_TYPE_MATTERS 1
313 /* No data type wants to be aligned rounder than this. */
314 #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
316 /* Get around hp-ux assembler bug, and make strcpy of constants fast. */
317 #define CONSTANT_ALIGNMENT(EXP, ALIGN) \
318 (TREE_CODE (EXP) == STRING_CST \
319 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
321 /* Make arrays of chars word-aligned for the same reasons. */
322 #define DATA_ALIGNMENT(TYPE, ALIGN) \
323 (TREE_CODE (TYPE) == ARRAY_TYPE \
324 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
325 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
327 /* Set this nonzero if move instructions will actually fail to work
328 when given unaligned data. */
329 #define STRICT_ALIGNMENT 1
331 /* Value is 1 if it is a good idea to tie two pseudo registers
332 when one has mode MODE1 and one has mode MODE2.
333 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
334 for any hard reg, then this must be 0 for correct output. */
335 #define MODES_TIEABLE_P(MODE1, MODE2) \
336 pa_modes_tieable_p (MODE1, MODE2)
338 /* Specify the registers used for certain standard purposes.
339 The values of these macros are register numbers. */
341 /* The HP-PA pc isn't overloaded on a register that the compiler knows about. */
342 /* #define PC_REGNUM */
344 /* Register to use for pushing function arguments. */
345 #define STACK_POINTER_REGNUM 30
347 /* Fixed register for local variable access. Always eliminated. */
348 #define FRAME_POINTER_REGNUM (TARGET_64BIT ? 61 : 89)
350 /* Base register for access to local variables of the function. */
351 #define HARD_FRAME_POINTER_REGNUM 3
353 /* Don't allow hard registers to be renamed into r2 unless r2
354 is already live or already being saved (due to eh). */
356 #define HARD_REGNO_RENAME_OK(OLD_REG, NEW_REG) \
357 ((NEW_REG) != 2 || df_regs_ever_live_p (2) || crtl->calls_eh_return)
359 /* Base register for access to arguments of the function. */
360 #define ARG_POINTER_REGNUM (TARGET_64BIT ? 29 : 3)
362 /* Register in which static-chain is passed to a function. */
363 #define STATIC_CHAIN_REGNUM (TARGET_64BIT ? 31 : 29)
365 /* Register used to address the offset table for position-independent
367 #define PIC_OFFSET_TABLE_REGNUM \
368 (flag_pic ? (TARGET_64BIT ? 27 : 19) : INVALID_REGNUM)
370 #define PIC_OFFSET_TABLE_REG_CALL_CLOBBERED 1
372 /* Function to return the rtx used to save the pic offset table register
373 across function calls. */
374 extern struct rtx_def *hppa_pic_save_rtx (void);
376 #define DEFAULT_PCC_STRUCT_RETURN 0
378 /* Register in which address to store a structure value
379 is passed to a function. */
380 #define PA_STRUCT_VALUE_REGNUM 28
382 /* Definitions for register eliminations.
384 We have two registers that can be eliminated. First, the frame pointer
385 register can often be eliminated in favor of the stack pointer register.
386 Secondly, the argument pointer register can always be eliminated in the
389 /* This is an array of structures. Each structure initializes one pair
390 of eliminable registers. The "from" register number is given first,
391 followed by "to". Eliminations of the same "from" register are listed
392 in order of preference.
394 The argument pointer cannot be eliminated in the 64-bit runtime. It
395 is the same register as the hard frame pointer in the 32-bit runtime.
396 So, it does not need to be listed. */
397 #define ELIMINABLE_REGS \
398 {{ HARD_FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
399 { FRAME_POINTER_REGNUM, STACK_POINTER_REGNUM}, \
400 { FRAME_POINTER_REGNUM, HARD_FRAME_POINTER_REGNUM} }
402 /* Define the offset between two registers, one to be eliminated,
403 and the other its replacement, at the start of a routine. */
404 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
405 ((OFFSET) = pa_initial_elimination_offset(FROM, TO))
407 /* Describe how we implement __builtin_eh_return. */
408 #define EH_RETURN_DATA_REGNO(N) \
409 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
410 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
411 #define EH_RETURN_HANDLER_RTX pa_eh_return_handler_rtx ()
413 /* Offset from the frame pointer register value to the top of stack. */
414 #define FRAME_POINTER_CFA_OFFSET(FNDECL) 0
416 /* The maximum number of hard registers that can be saved in the call
417 frame. The soft frame pointer is not included. */
418 #define DWARF_FRAME_REGISTERS (FIRST_PSEUDO_REGISTER - 1)
420 /* A C expression whose value is RTL representing the location of the
421 incoming return address at the beginning of any function, before the
422 prologue. You only need to define this macro if you want to support
423 call frame debugging information like that provided by DWARF 2. */
424 #define INCOMING_RETURN_ADDR_RTX (gen_rtx_REG (word_mode, 2))
425 #define DWARF_FRAME_RETURN_COLUMN (DWARF_FRAME_REGNUM (2))
427 /* A C expression whose value is an integer giving a DWARF 2 column
428 number that may be used as an alternate return column. This should
429 be defined only if DWARF_FRAME_RETURN_COLUMN is set to a general
430 register, but an alternate column needs to be used for signal frames.
432 Column 0 is not used but unfortunately its register size is set to
433 4 bytes (sizeof CCmode) so it can't be used on 64-bit targets. */
434 #define DWARF_ALT_FRAME_RETURN_COLUMN (FIRST_PSEUDO_REGISTER - 1)
436 /* This macro chooses the encoding of pointers embedded in the exception
437 handling sections. If at all possible, this should be defined such
438 that the exception handling section will not require dynamic relocations,
439 and so may be read-only.
441 Because the HP assembler auto aligns, it is necessary to use
442 DW_EH_PE_aligned. It's not possible to make the data read-only
443 on the HP-UX SOM port since the linker requires fixups for label
444 differences in different sections to be word aligned. However,
445 the SOM linker can do unaligned fixups for absolute pointers.
446 We also need aligned pointers for global and function pointers.
448 Although the HP-UX 64-bit ELF linker can handle unaligned pc-relative
449 fixups, the runtime doesn't have a consistent relationship between
450 text and data for dynamically loaded objects. Thus, it's not possible
451 to use pc-relative encoding for pointers on this target. It may be
452 possible to use segment relative encodings but GAS doesn't currently
453 have a mechanism to generate these encodings. For other targets, we
454 use pc-relative encoding for pointers. If the pointer might require
455 dynamic relocation, we make it indirect. */
456 #define ASM_PREFERRED_EH_DATA_FORMAT(CODE,GLOBAL) \
457 (TARGET_GAS && !TARGET_HPUX \
459 | ((GLOBAL) || (CODE) == 2 ? DW_EH_PE_indirect : 0) \
460 | (TARGET_64BIT ? DW_EH_PE_sdata8 : DW_EH_PE_sdata4)) \
461 : (!TARGET_GAS || (GLOBAL) || (CODE) == 2 \
462 ? DW_EH_PE_aligned : DW_EH_PE_absptr))
464 /* Handle special EH pointer encodings. Absolute, pc-relative, and
465 indirect are handled automatically. We output pc-relative, and
466 indirect pc-relative ourself since we need some special magic to
467 generate pc-relative relocations, and to handle indirect function
469 #define ASM_MAYBE_OUTPUT_ENCODED_ADDR_RTX(FILE, ENCODING, SIZE, ADDR, DONE) \
471 if (((ENCODING) & 0x70) == DW_EH_PE_pcrel) \
473 fputs (integer_asm_op (SIZE, FALSE), FILE); \
474 if ((ENCODING) & DW_EH_PE_indirect) \
475 output_addr_const (FILE, get_deferred_plabel (ADDR)); \
477 assemble_name (FILE, XSTR ((ADDR), 0)); \
478 fputs ("+8-$PIC_pcrel$0", FILE); \
484 /* The class value for index registers, and the one for base regs. */
485 #define INDEX_REG_CLASS GENERAL_REGS
486 #define BASE_REG_CLASS GENERAL_REGS
488 #define FP_REG_CLASS_P(CLASS) \
489 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
491 /* True if register is floating-point. */
492 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
494 /* Given an rtx X being reloaded into a reg required to be
495 in class CLASS, return the class of reg to actually use.
496 In general this is just CLASS; but on some machines
497 in some cases it is preferable to use a more restrictive class. */
498 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
500 #define MAYBE_FP_REG_CLASS_P(CLASS) \
501 reg_classes_intersect_p ((CLASS), FP_REGS)
504 /* Stack layout; function entry, exit and calling. */
506 /* Define this if pushing a word on the stack
507 makes the stack pointer a smaller address. */
508 /* #define STACK_GROWS_DOWNWARD */
510 /* Believe it or not. */
511 #define ARGS_GROW_DOWNWARD
513 /* Define this to nonzero if the nominal address of the stack frame
514 is at the high-address end of the local variables;
515 that is, each additional local variable allocated
516 goes at a more negative offset in the frame. */
517 #define FRAME_GROWS_DOWNWARD 0
519 /* Offset within stack frame to start allocating local variables at.
520 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
521 first local allocated. Otherwise, it is the offset to the BEGINNING
522 of the first local allocated.
524 On the 32-bit ports, we reserve one slot for the previous frame
525 pointer and one fill slot. The fill slot is for compatibility
526 with HP compiled programs. On the 64-bit ports, we reserve one
527 slot for the previous frame pointer. */
528 #define STARTING_FRAME_OFFSET 8
530 /* Define STACK_ALIGNMENT_NEEDED to zero to disable final alignment
531 of the stack. The default is to align it to STACK_BOUNDARY. */
532 #define STACK_ALIGNMENT_NEEDED 0
534 /* If we generate an insn to push BYTES bytes,
535 this says how many the stack pointer really advances by.
536 On the HP-PA, don't define this because there are no push insns. */
537 /* #define PUSH_ROUNDING(BYTES) */
539 /* Offset of first parameter from the argument pointer register value.
540 This value will be negated because the arguments grow down.
541 Also note that on STACK_GROWS_UPWARD machines (such as this one)
542 this is the distance from the frame pointer to the end of the first
543 argument, not it's beginning. To get the real offset of the first
544 argument, the size of the argument must be added. */
546 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
548 /* When a parameter is passed in a register, stack space is still
550 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
552 /* Define this if the above stack space is to be considered part of the
553 space allocated by the caller. */
554 #define OUTGOING_REG_PARM_STACK_SPACE(FNTYPE) 1
556 /* Keep the stack pointer constant throughout the function.
557 This is both an optimization and a necessity: longjmp
558 doesn't behave itself when the stack pointer moves within
560 #define ACCUMULATE_OUTGOING_ARGS 1
562 /* The weird HPPA calling conventions require a minimum of 48 bytes on
563 the stack: 16 bytes for register saves, and 32 bytes for magic.
564 This is the difference between the logical top of stack and the
567 On the 64-bit port, the HP C compiler allocates a 48-byte frame
568 marker, although the runtime documentation only describes a 16
569 byte marker. For compatibility, we allocate 48 bytes. */
570 #define STACK_POINTER_OFFSET \
571 (TARGET_64BIT ? -(crtl->outgoing_args_size + 48): -32)
573 #define STACK_DYNAMIC_OFFSET(FNDECL) \
575 ? (STACK_POINTER_OFFSET) \
576 : ((STACK_POINTER_OFFSET) - crtl->outgoing_args_size))
579 /* Define a data type for recording info about an argument list
580 during the scan of that argument list. This data type should
581 hold all necessary information about the function itself
582 and about the args processed so far, enough to enable macros
583 such as FUNCTION_ARG to determine where the next arg should go.
585 On the HP-PA, the WORDS field holds the number of words
586 of arguments scanned so far (including the invisible argument,
587 if any, which holds the structure-value-address). Thus, 4 or
588 more means all following args should go on the stack.
590 The INCOMING field tracks whether this is an "incoming" or
593 The INDIRECT field indicates whether this is is an indirect
596 The NARGS_PROTOTYPE field indicates that an argument does not
597 have a prototype when it less than or equal to 0. */
599 struct hppa_args {int words, nargs_prototype, incoming, indirect; };
601 #define CUMULATIVE_ARGS struct hppa_args
603 /* Initialize a variable CUM of type CUMULATIVE_ARGS
604 for a call to a function whose data type is FNTYPE.
605 For a library call, FNTYPE is 0. */
607 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
609 (CUM).incoming = 0, \
610 (CUM).indirect = (FNTYPE) && !(FNDECL), \
611 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
612 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
613 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
614 || pa_return_in_memory (TREE_TYPE (FNTYPE), 0))) \
619 /* Similar, but when scanning the definition of a procedure. We always
620 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
622 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
624 (CUM).incoming = 1, \
625 (CUM).indirect = 0, \
626 (CUM).nargs_prototype = 1000
628 /* Figure out the size in words of the function argument. The size
629 returned by this macro should always be greater than zero because
630 we pass variable and zero sized objects by reference. */
632 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
633 ((((MODE) != BLKmode \
634 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
635 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
637 /* Update the data in CUM to advance over an argument
638 of mode MODE and data type TYPE.
639 (TYPE is null for libcalls where that information may not be available.) */
641 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
642 { (CUM).nargs_prototype--; \
643 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
644 + (((CUM).words & 01) && (TYPE) != 0 \
645 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
648 /* Determine where to put an argument to a function.
649 Value is zero to push the argument on the stack,
650 or a hard register in which to store the argument.
652 MODE is the argument's machine mode.
653 TYPE is the data type of the argument (as a tree).
654 This is null for libcalls where that information may
656 CUM is a variable of type CUMULATIVE_ARGS which gives info about
657 the preceding args and about the function being called.
658 NAMED is nonzero if this argument is a named parameter
659 (otherwise it is an extra parameter matching an ellipsis).
661 On the HP-PA the first four words of args are normally in registers
662 and the rest are pushed. But any arg that won't entirely fit in regs
665 Arguments passed in registers are either 1 or 2 words long.
667 The caller must make a distinction between calls to explicitly named
668 functions and calls through pointers to functions -- the conventions
669 are different! Calls through pointers to functions only use general
670 registers for the first four argument words.
672 Of course all this is different for the portable runtime model
673 HP wants everyone to use for ELF. Ugh. Here's a quick description
674 of how it's supposed to work.
676 1) callee side remains unchanged. It expects integer args to be
677 in the integer registers, float args in the float registers and
678 unnamed args in integer registers.
680 2) caller side now depends on if the function being called has
681 a prototype in scope (rather than if it's being called indirectly).
683 2a) If there is a prototype in scope, then arguments are passed
684 according to their type (ints in integer registers, floats in float
685 registers, unnamed args in integer registers.
687 2b) If there is no prototype in scope, then floating point arguments
688 are passed in both integer and float registers. egad.
690 FYI: The portable parameter passing conventions are almost exactly like
691 the standard parameter passing conventions on the RS6000. That's why
692 you'll see lots of similar code in rs6000.h. */
694 /* If defined, a C expression which determines whether, and in which
695 direction, to pad out an argument with extra space. */
696 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
698 /* Specify padding for the last element of a block move between registers
701 The 64-bit runtime specifies that objects need to be left justified
702 (i.e., the normal justification for a big endian target). The 32-bit
703 runtime specifies right justification for objects smaller than 64 bits.
704 We use a DImode register in the parallel for 5 to 7 byte structures
705 so that there is only one element. This allows the object to be
707 #define BLOCK_REG_PADDING(MODE, TYPE, FIRST) \
708 function_arg_padding ((MODE), (TYPE))
710 /* Do not expect to understand this without reading it several times. I'm
711 tempted to try and simply it, but I worry about breaking something. */
713 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
714 function_arg (&CUM, MODE, TYPE, NAMED)
716 /* If defined, a C expression that gives the alignment boundary, in
717 bits, of an argument with the specified mode and type. If it is
718 not defined, `PARM_BOUNDARY' is used for all arguments. */
720 /* Arguments larger than one word are double word aligned. */
722 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
724 ? (integer_zerop (TYPE_SIZE (TYPE)) \
725 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
726 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
727 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
728 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
731 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
732 as assembly via FUNCTION_PROFILER. Just output a local label.
733 We can't use the function label because the GAS SOM target can't
734 handle the difference of a global symbol and a local symbol. */
736 #ifndef FUNC_BEGIN_PROLOG_LABEL
737 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
740 #define FUNCTION_PROFILER(FILE, LABEL) \
741 (*targetm.asm_out.internal_label) (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
743 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
744 void hppa_profile_hook (int label_no);
746 /* The profile counter if emitted must come before the prologue. */
747 #define PROFILE_BEFORE_PROLOGUE 1
749 /* We never want final.c to emit profile counters. When profile
750 counters are required, we have to defer emitting them to the end
751 of the current file. */
752 #define NO_PROFILE_COUNTERS 1
754 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
755 the stack pointer does not matter. The value is tested only in
756 functions that have frame pointers.
757 No definition is equivalent to always zero. */
759 extern int may_call_alloca;
761 #define EXIT_IGNORE_STACK \
762 (get_frame_size () != 0 \
763 || cfun->calls_alloca || crtl->outgoing_args_size)
765 /* Length in units of the trampoline for entering a nested function. */
767 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
769 /* Alignment required by the trampoline. */
771 #define TRAMPOLINE_ALIGNMENT BITS_PER_WORD
773 /* Minimum length of a cache line. A length of 16 will work on all
774 PA-RISC processors. All PA 1.1 processors have a cache line of
775 32 bytes. Most but not all PA 2.0 processors have a cache line
776 of 64 bytes. As cache flushes are expensive and we don't support
777 PA 1.0, we use a minimum length of 32. */
779 #define MIN_CACHELINE_SIZE 32
782 /* Addressing modes, and classification of registers for them.
784 Using autoincrement addressing modes on PA8000 class machines is
787 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
788 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
790 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
791 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
793 /* Macros to check register numbers against specific register classes. */
795 /* The following macros assume that X is a hard or pseudo reg number.
796 They give nonzero only if X is a hard reg of the suitable class
797 or a pseudo reg currently allocated to a suitable hard reg.
798 Since they use reg_renumber, they are safe only once reg_renumber
799 has been allocated, which happens in local-alloc.c. */
801 #define REGNO_OK_FOR_INDEX_P(X) \
803 || ((X) == FRAME_POINTER_REGNUM) \
804 || ((X) >= FIRST_PSEUDO_REGISTER \
806 && (unsigned) reg_renumber[X] < 32)))
807 #define REGNO_OK_FOR_BASE_P(X) \
809 || ((X) == FRAME_POINTER_REGNUM) \
810 || ((X) >= FIRST_PSEUDO_REGISTER \
812 && (unsigned) reg_renumber[X] < 32)))
813 #define REGNO_OK_FOR_FP_P(X) \
815 || (X >= FIRST_PSEUDO_REGISTER \
817 && FP_REGNO_P (reg_renumber[X])))
819 /* Now macros that check whether X is a register and also,
820 strictly, whether it is in a specified class.
822 These macros are specific to the HP-PA, and may be used only
823 in code for printing assembler insns and in conditions for
824 define_optimization. */
826 /* 1 if X is an fp register. */
828 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
830 /* Maximum number of registers that can appear in a valid memory address. */
832 #define MAX_REGS_PER_ADDRESS 2
834 /* Non-TLS symbolic references. */
835 #define PA_SYMBOL_REF_TLS_P(RTX) \
836 (GET_CODE (RTX) == SYMBOL_REF && SYMBOL_REF_TLS_MODEL (RTX) != 0)
838 /* Recognize any constant value that is a valid address except
839 for symbolic addresses. We get better CSE by rejecting them
840 here and allowing hppa_legitimize_address to break them up. We
841 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
843 #define CONSTANT_ADDRESS_P(X) \
844 ((GET_CODE (X) == LABEL_REF \
845 || (GET_CODE (X) == SYMBOL_REF && !SYMBOL_REF_TLS_MODEL (X)) \
846 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
847 || GET_CODE (X) == HIGH) \
848 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
850 /* A C expression that is nonzero if we are using the new HP assembler. */
852 #ifndef NEW_HP_ASSEMBLER
853 #define NEW_HP_ASSEMBLER 0
856 /* The macros below define the immediate range for CONST_INTS on
857 the 64-bit port. Constants in this range can be loaded in three
858 instructions using a ldil/ldo/depdi sequence. Constants outside
859 this range are forced to the constant pool prior to reload. */
861 #define MAX_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) 32 << 31)
862 #define MIN_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) -32 << 31)
863 #define LEGITIMATE_64BIT_CONST_INT_P(X) \
864 ((X) >= MIN_LEGIT_64BIT_CONST_INT && (X) < MAX_LEGIT_64BIT_CONST_INT)
866 /* A C expression that is nonzero if X is a legitimate constant for an
869 We include all constant integers and constant doubles, but not
870 floating-point, except for floating-point zero. We reject LABEL_REFs
871 if we're not using gas or the new HP assembler.
873 In 64-bit mode, we reject CONST_DOUBLES. We also reject CONST_INTS
874 that need more than three instructions to load prior to reload. This
875 limit is somewhat arbitrary. It takes three instructions to load a
876 CONST_INT from memory but two are memory accesses. It may be better
877 to increase the allowed range for CONST_INTS. We may also be able
878 to handle CONST_DOUBLES. */
880 #define LEGITIMATE_CONSTANT_P(X) \
881 ((GET_MODE_CLASS (GET_MODE (X)) != MODE_FLOAT \
882 || (X) == CONST0_RTX (GET_MODE (X))) \
883 && (NEW_HP_ASSEMBLER \
885 || GET_CODE (X) != LABEL_REF) \
887 || GET_CODE (X) != CONST_DOUBLE) \
889 || HOST_BITS_PER_WIDE_INT <= 32 \
890 || GET_CODE (X) != CONST_INT \
891 || reload_in_progress \
892 || reload_completed \
893 || LEGITIMATE_64BIT_CONST_INT_P (INTVAL (X)) \
894 || cint_ok_for_move (INTVAL (X))) \
895 && !function_label_operand (X, VOIDmode))
897 /* Target flags set on a symbol_ref. */
899 /* Set by ASM_OUTPUT_SYMBOL_REF when a symbol_ref is output. */
900 #define SYMBOL_FLAG_REFERENCED (1 << SYMBOL_FLAG_MACH_DEP_SHIFT)
901 #define SYMBOL_REF_REFERENCED_P(RTX) \
902 ((SYMBOL_REF_FLAGS (RTX) & SYMBOL_FLAG_REFERENCED) != 0)
904 /* Defines for constraints.md. */
906 /* Return 1 iff OP is a scaled or unscaled index address. */
907 #define IS_INDEX_ADDR_P(OP) \
908 (GET_CODE (OP) == PLUS \
909 && GET_MODE (OP) == Pmode \
910 && (GET_CODE (XEXP (OP, 0)) == MULT \
911 || GET_CODE (XEXP (OP, 1)) == MULT \
912 || (REG_P (XEXP (OP, 0)) \
913 && REG_P (XEXP (OP, 1)))))
915 /* Return 1 iff OP is a LO_SUM DLT address. */
916 #define IS_LO_SUM_DLT_ADDR_P(OP) \
917 (GET_CODE (OP) == LO_SUM \
918 && GET_MODE (OP) == Pmode \
919 && REG_P (XEXP (OP, 0)) \
920 && REG_OK_FOR_BASE_P (XEXP (OP, 0)) \
921 && GET_CODE (XEXP (OP, 1)) == UNSPEC)
923 /* Nonzero if 14-bit offsets can be used for all loads and stores.
924 This is not possible when generating PA 1.x code as floating point
925 loads and stores only support 5-bit offsets. Note that we do not
926 forbid the use of 14-bit offsets in GO_IF_LEGITIMATE_ADDRESS.
927 Instead, we use pa_secondary_reload() to reload integer mode
928 REG+D memory addresses used in floating point loads and stores.
930 FIXME: the ELF32 linker clobbers the LSB of the FP register number
931 in PA 2.0 floating-point insns with long displacements. This is
932 because R_PARISC_DPREL14WR and other relocations like it are not
933 yet supported by GNU ld. For now, we reject long displacements
936 #define INT14_OK_STRICT \
938 || TARGET_DISABLE_FPREGS \
939 || (TARGET_PA_20 && !TARGET_ELF32))
941 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
942 and check its validity for a certain class.
943 We have two alternate definitions for each of them.
944 The usual definition accepts all pseudo regs; the other rejects
945 them unless they have been allocated suitable hard regs.
946 The symbol REG_OK_STRICT causes the latter definition to be used.
948 Most source files want to accept pseudo regs in the hope that
949 they will get allocated to the class that the insn wants them to be in.
950 Source files for reload pass need to be strict.
951 After reload, it makes no difference, since pseudo regs have
952 been eliminated by then. */
954 #ifndef REG_OK_STRICT
956 /* Nonzero if X is a hard reg that can be used as an index
957 or if it is a pseudo reg. */
958 #define REG_OK_FOR_INDEX_P(X) \
959 (REGNO (X) && (REGNO (X) < 32 \
960 || REGNO (X) == FRAME_POINTER_REGNUM \
961 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
963 /* Nonzero if X is a hard reg that can be used as a base reg
964 or if it is a pseudo reg. */
965 #define REG_OK_FOR_BASE_P(X) \
966 (REGNO (X) && (REGNO (X) < 32 \
967 || REGNO (X) == FRAME_POINTER_REGNUM \
968 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
972 /* Nonzero if X is a hard reg that can be used as an index. */
973 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
975 /* Nonzero if X is a hard reg that can be used as a base reg. */
976 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
980 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression that is a
981 valid memory address for an instruction. The MODE argument is the
982 machine mode for the MEM expression that wants to use this address.
984 On HP PA-RISC, the legitimate address forms are REG+SMALLINT,
985 REG+REG, and REG+(REG*SCALE). The indexed address forms are only
986 available with floating point loads and stores, and integer loads.
987 We get better code by allowing indexed addresses in the initial
990 The acceptance of indexed addresses as legitimate implies that we
991 must provide patterns for doing indexed integer stores, or the move
992 expanders must force the address of an indexed store to a register.
993 We have adopted the latter approach.
995 Another function of GO_IF_LEGITIMATE_ADDRESS is to ensure that
996 the base register is a valid pointer for indexed instructions.
997 On targets that have non-equivalent space registers, we have to
998 know at the time of assembler output which register in a REG+REG
999 pair is the base register. The REG_POINTER flag is sometimes lost
1000 in reload and the following passes, so it can't be relied on during
1001 code generation. Thus, we either have to canonicalize the order
1002 of the registers in REG+REG indexed addresses, or treat REG+REG
1003 addresses separately and provide patterns for both permutations.
1005 The latter approach requires several hundred additional lines of
1006 code in pa.md. The downside to canonicalizing is that a PLUS
1007 in the wrong order can't combine to form to make a scaled indexed
1008 memory operand. As we won't need to canonicalize the operands if
1009 the REG_POINTER lossage can be fixed, it seems better canonicalize.
1011 We initially break out scaled indexed addresses in canonical order
1012 in emit_move_sequence. LEGITIMIZE_ADDRESS also canonicalizes
1013 scaled indexed addresses during RTL generation. However, fold_rtx
1014 has its own opinion on how the operands of a PLUS should be ordered.
1015 If one of the operands is equivalent to a constant, it will make
1016 that operand the second operand. As the base register is likely to
1017 be equivalent to a SYMBOL_REF, we have made it the second operand.
1019 GO_IF_LEGITIMATE_ADDRESS accepts REG+REG as legitimate when the
1020 operands are in the order INDEX+BASE on targets with non-equivalent
1021 space registers, and in any order on targets with equivalent space
1022 registers. It accepts both MULT+BASE and BASE+MULT for scaled indexing.
1024 We treat a SYMBOL_REF as legitimate if it is part of the current
1025 function's constant-pool, because such addresses can actually be
1026 output as REG+SMALLINT. */
1028 #define VAL_5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x10 < 0x20)
1029 #define INT_5_BITS(X) VAL_5_BITS_P (INTVAL (X))
1031 #define VAL_U5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) < 0x20)
1032 #define INT_U5_BITS(X) VAL_U5_BITS_P (INTVAL (X))
1034 #define VAL_11_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x400 < 0x800)
1035 #define INT_11_BITS(X) VAL_11_BITS_P (INTVAL (X))
1037 #define VAL_14_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x2000 < 0x4000)
1038 #define INT_14_BITS(X) VAL_14_BITS_P (INTVAL (X))
1040 #if HOST_BITS_PER_WIDE_INT > 32
1041 #define VAL_32_BITS_P(X) \
1042 ((unsigned HOST_WIDE_INT)(X) + ((unsigned HOST_WIDE_INT) 1 << 31) \
1043 < (unsigned HOST_WIDE_INT) 2 << 31)
1045 #define VAL_32_BITS_P(X) 1
1047 #define INT_32_BITS(X) VAL_32_BITS_P (INTVAL (X))
1049 /* These are the modes that we allow for scaled indexing. */
1050 #define MODE_OK_FOR_SCALED_INDEXING_P(MODE) \
1051 ((TARGET_64BIT && (MODE) == DImode) \
1052 || (MODE) == SImode \
1053 || (MODE) == HImode \
1054 || (MODE) == SFmode \
1055 || (MODE) == DFmode)
1057 /* These are the modes that we allow for unscaled indexing. */
1058 #define MODE_OK_FOR_UNSCALED_INDEXING_P(MODE) \
1059 ((TARGET_64BIT && (MODE) == DImode) \
1060 || (MODE) == SImode \
1061 || (MODE) == HImode \
1062 || (MODE) == QImode \
1063 || (MODE) == SFmode \
1064 || (MODE) == DFmode)
1066 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1068 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1069 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1070 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1071 && REG_P (XEXP (X, 0)) \
1072 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1074 else if (GET_CODE (X) == PLUS) \
1076 rtx base = 0, index = 0; \
1077 if (REG_P (XEXP (X, 1)) \
1078 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1079 base = XEXP (X, 1), index = XEXP (X, 0); \
1080 else if (REG_P (XEXP (X, 0)) \
1081 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1082 base = XEXP (X, 0), index = XEXP (X, 1); \
1084 && GET_CODE (index) == CONST_INT \
1085 && ((INT_14_BITS (index) \
1086 && (((MODE) != DImode \
1087 && (MODE) != SFmode \
1088 && (MODE) != DFmode) \
1089 /* The base register for DImode loads and stores \
1090 with long displacements must be aligned because \
1091 the lower three bits in the displacement are \
1092 assumed to be zero. */ \
1093 || ((MODE) == DImode \
1095 || (INTVAL (index) % 8) == 0)) \
1096 /* Similarly, the base register for SFmode/DFmode \
1097 loads and stores with long displacements must \
1099 || (((MODE) == SFmode || (MODE) == DFmode) \
1100 && INT14_OK_STRICT \
1101 && (INTVAL (index) % GET_MODE_SIZE (MODE)) == 0))) \
1102 || INT_5_BITS (index))) \
1104 if (!TARGET_DISABLE_INDEXING \
1105 /* Only accept the "canonical" INDEX+BASE operand order \
1106 on targets with non-equivalent space registers. */ \
1107 && (TARGET_NO_SPACE_REGS \
1108 ? (base && REG_P (index)) \
1109 : (base == XEXP (X, 1) && REG_P (index) \
1110 && (reload_completed \
1111 || (reload_in_progress && HARD_REGISTER_P (base)) \
1112 || REG_POINTER (base)) \
1113 && (reload_completed \
1114 || (reload_in_progress && HARD_REGISTER_P (index)) \
1115 || !REG_POINTER (index)))) \
1116 && MODE_OK_FOR_UNSCALED_INDEXING_P (MODE) \
1117 && REG_OK_FOR_INDEX_P (index) \
1118 && borx_reg_operand (base, Pmode) \
1119 && borx_reg_operand (index, Pmode)) \
1121 if (!TARGET_DISABLE_INDEXING \
1123 && GET_CODE (index) == MULT \
1124 && MODE_OK_FOR_SCALED_INDEXING_P (MODE) \
1125 && REG_P (XEXP (index, 0)) \
1126 && GET_MODE (XEXP (index, 0)) == Pmode \
1127 && REG_OK_FOR_INDEX_P (XEXP (index, 0)) \
1128 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1129 && INTVAL (XEXP (index, 1)) \
1130 == (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
1131 && borx_reg_operand (base, Pmode)) \
1134 else if (GET_CODE (X) == LO_SUM \
1135 && GET_CODE (XEXP (X, 0)) == REG \
1136 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1137 && CONSTANT_P (XEXP (X, 1)) \
1138 && (TARGET_SOFT_FLOAT \
1139 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1142 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1143 || ((MODE) != SFmode \
1144 && (MODE) != DFmode))) \
1146 else if (GET_CODE (X) == LO_SUM \
1147 && GET_CODE (XEXP (X, 0)) == SUBREG \
1148 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG \
1149 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0))) \
1150 && CONSTANT_P (XEXP (X, 1)) \
1151 && (TARGET_SOFT_FLOAT \
1152 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1155 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1156 || ((MODE) != SFmode \
1157 && (MODE) != DFmode))) \
1159 else if (GET_CODE (X) == CONST_INT && INT_5_BITS (X)) \
1161 /* Needed for -fPIC */ \
1162 else if (GET_CODE (X) == LO_SUM \
1163 && GET_CODE (XEXP (X, 0)) == REG \
1164 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1165 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1166 && (TARGET_SOFT_FLOAT \
1167 || (TARGET_PA_20 && !TARGET_ELF32) \
1168 || ((MODE) != SFmode \
1169 && (MODE) != DFmode))) \
1173 /* Look for machine dependent ways to make the invalid address AD a
1176 For the PA, transform:
1178 memory(X + <large int>)
1182 if (<large int> & mask) >= 16
1183 Y = (<large int> & ~mask) + mask + 1 Round up.
1185 Y = (<large int> & ~mask) Round down.
1187 memory (Z + (<large int> - Y));
1189 This makes reload inheritance and reload_cse work better since Z
1192 There may be more opportunities to improve code with this hook. */
1193 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1195 long offset, newoffset, mask; \
1196 rtx new_rtx, temp = NULL_RTX; \
1198 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1199 ? (INT14_OK_STRICT ? 0x3fff : 0x1f) : 0x3fff); \
1201 if (optimize && GET_CODE (AD) == PLUS) \
1202 temp = simplify_binary_operation (PLUS, Pmode, \
1203 XEXP (AD, 0), XEXP (AD, 1)); \
1205 new_rtx = temp ? temp : AD; \
1208 && GET_CODE (new_rtx) == PLUS \
1209 && GET_CODE (XEXP (new_rtx, 0)) == REG \
1210 && GET_CODE (XEXP (new_rtx, 1)) == CONST_INT) \
1212 offset = INTVAL (XEXP ((new_rtx), 1)); \
1214 /* Choose rounding direction. Round up if we are >= halfway. */ \
1215 if ((offset & mask) >= ((mask + 1) / 2)) \
1216 newoffset = (offset & ~mask) + mask + 1; \
1218 newoffset = offset & ~mask; \
1220 /* Ensure that long displacements are aligned. */ \
1221 if (mask == 0x3fff \
1222 && (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1223 || (TARGET_64BIT && (MODE) == DImode))) \
1224 newoffset &= ~(GET_MODE_SIZE (MODE) - 1); \
1226 if (newoffset != 0 && VAL_14_BITS_P (newoffset)) \
1228 temp = gen_rtx_PLUS (Pmode, XEXP (new_rtx, 0), \
1229 GEN_INT (newoffset)); \
1230 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1231 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1232 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1241 #define TARGET_ASM_SELECT_SECTION pa_select_section
1243 /* Return a nonzero value if DECL has a section attribute. */
1244 #define IN_NAMED_SECTION_P(DECL) \
1245 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
1246 && DECL_SECTION_NAME (DECL) != NULL_TREE)
1248 /* Define this macro if references to a symbol must be treated
1249 differently depending on something about the variable or
1250 function named by the symbol (such as what section it is in).
1252 The macro definition, if any, is executed immediately after the
1253 rtl for DECL or other node is created.
1254 The value of the rtl will be a `mem' whose address is a
1257 The usual thing for this macro to do is to a flag in the
1258 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1259 name string in the `symbol_ref' (if one bit is not enough
1262 On the HP-PA we use this to indicate if a symbol is in text or
1263 data space. Also, function labels need special treatment. */
1265 #define TEXT_SPACE_P(DECL)\
1266 (TREE_CODE (DECL) == FUNCTION_DECL \
1267 || (TREE_CODE (DECL) == VAR_DECL \
1268 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1269 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1271 || CONSTANT_CLASS_P (DECL))
1273 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1275 /* Specify the machine mode that this machine uses for the index in the
1276 tablejump instruction. For small tables, an element consists of a
1277 ia-relative branch and its delay slot. When -mbig-switch is specified,
1278 we use a 32-bit absolute address for non-pic code, and a 32-bit offset
1279 for both 32 and 64-bit pic code. */
1280 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? SImode : DImode)
1282 /* Jump tables must be 32-bit aligned, no matter the size of the element. */
1283 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1285 /* Define this as 1 if `char' should by default be signed; else as 0. */
1286 #define DEFAULT_SIGNED_CHAR 1
1288 /* Max number of bytes we can move from memory to memory
1289 in one reasonably fast instruction. */
1292 /* Higher than the default as we prefer to use simple move insns
1293 (better scheduling and delay slot filling) and because our
1294 built-in block move is really a 2X unrolled loop.
1296 Believe it or not, this has to be big enough to allow for copying all
1297 arguments passed in registers to avoid infinite recursion during argument
1298 setup for a function call. Why? Consider how we copy the stack slots
1299 reserved for parameters when they may be trashed by a call. */
1300 #define MOVE_RATIO(speed) (TARGET_64BIT ? 8 : 4)
1302 /* Define if operations between registers always perform the operation
1303 on the full register even if a narrower mode is specified. */
1304 #define WORD_REGISTER_OPERATIONS
1306 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1307 will either zero-extend or sign-extend. The value of this macro should
1308 be the code that says which one of the two operations is implicitly
1309 done, UNKNOWN if none. */
1310 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1312 /* Nonzero if access to memory by bytes is slow and undesirable. */
1313 #define SLOW_BYTE_ACCESS 1
1315 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1316 is done just by pretending it is already truncated. */
1317 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1319 /* Specify the machine mode that pointers have.
1320 After generation of rtl, the compiler makes no further distinction
1321 between pointers and any other objects of this machine mode. */
1322 #define Pmode word_mode
1324 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1325 return the mode to be used for the comparison. For floating-point, CCFPmode
1326 should be used. CC_NOOVmode should be used when the first operand is a
1327 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1329 #define SELECT_CC_MODE(OP,X,Y) \
1330 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1332 /* A function address in a call instruction
1333 is a byte address (for indexing purposes)
1334 so give the MEM rtx a byte's mode. */
1335 #define FUNCTION_MODE SImode
1337 /* Define this if addresses of constant functions
1338 shouldn't be put through pseudo regs where they can be cse'd.
1339 Desirable on machines where ordinary constants are expensive
1340 but a CALL with constant address is cheap. */
1341 #define NO_FUNCTION_CSE
1343 /* Define this to be nonzero if shift instructions ignore all but the low-order
1345 #define SHIFT_COUNT_TRUNCATED 1
1347 /* Adjust the cost of branches. */
1348 #define BRANCH_COST(speed_p, predictable_p) (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1350 /* Handling the special cases is going to get too complicated for a macro,
1351 just call `pa_adjust_insn_length' to do the real work. */
1352 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1353 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1355 /* Millicode insns are actually function calls with some special
1356 constraints on arguments and register usage.
1358 Millicode calls always expect their arguments in the integer argument
1359 registers, and always return their result in %r29 (ret1). They
1360 are expected to clobber their arguments, %r1, %r29, and the return
1361 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1363 This macro tells reorg that the references to arguments and
1364 millicode calls do not appear to happen until after the millicode call.
1365 This allows reorg to put insns which set the argument registers into the
1366 delay slot of the millicode call -- thus they act more like traditional
1369 Note we cannot consider side effects of the insn to be delayed because
1370 the branch and link insn will clobber the return pointer. If we happened
1371 to use the return pointer in the delay slot of the call, then we lose.
1373 get_attr_type will try to recognize the given insn, so make sure to
1374 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1376 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1379 /* Control the assembler format that we output. */
1381 /* A C string constant describing how to begin a comment in the target
1382 assembler language. The compiler assumes that the comment will end at
1383 the end of the line. */
1385 #define ASM_COMMENT_START ";"
1387 /* Output to assembler file text saying following lines
1388 may contain character constants, extra white space, comments, etc. */
1390 #define ASM_APP_ON ""
1392 /* Output to assembler file text saying following lines
1393 no longer contain unusual constructs. */
1395 #define ASM_APP_OFF ""
1397 /* This is how to output the definition of a user-level label named NAME,
1398 such as the label on a static function or variable NAME. */
1400 #define ASM_OUTPUT_LABEL(FILE,NAME) \
1402 assemble_name ((FILE), (NAME)); \
1404 fputs (":\n", (FILE)); \
1406 fputc ('\n', (FILE)); \
1409 /* This is how to output a reference to a user-level label named NAME.
1410 `assemble_name' uses this. */
1412 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1414 const char *xname = (NAME); \
1415 if (FUNCTION_NAME_P (NAME)) \
1417 if (xname[0] == '*') \
1420 fputs (user_label_prefix, FILE); \
1421 fputs (xname, FILE); \
1424 /* This how we output the symbol_ref X. */
1426 #define ASM_OUTPUT_SYMBOL_REF(FILE,X) \
1428 SYMBOL_REF_FLAGS (X) |= SYMBOL_FLAG_REFERENCED; \
1429 assemble_name (FILE, XSTR (X, 0)); \
1432 /* This is how to store into the string LABEL
1433 the symbol_ref name of an internal numbered label where
1434 PREFIX is the class of label and NUM is the number within the class.
1435 This is suitable for output with `assemble_name'. */
1437 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1438 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1440 /* Output the definition of a compiler-generated label named NAME. */
1442 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,NAME) \
1444 assemble_name_raw ((FILE), (NAME)); \
1446 fputs (":\n", (FILE)); \
1448 fputc ('\n', (FILE)); \
1451 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1453 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1454 output_ascii ((FILE), (P), (SIZE))
1456 /* Jump tables are always placed in the text section. Technically, it
1457 is possible to put them in the readonly data section when -mbig-switch
1458 is specified. This has the benefit of getting the table out of .text
1459 and reducing branch lengths as a result. The downside is that an
1460 additional insn (addil) is needed to access the table when generating
1461 PIC code. The address difference table also has to use 32-bit
1462 pc-relative relocations. Currently, GAS does not support these
1463 relocations, although it is easily modified to do this operation.
1464 The table entries need to look like "$L1+(.+8-$L0)-$PIC_pcrel$0"
1465 when using ELF GAS. A simple difference can be used when using
1466 SOM GAS or the HP assembler. The final downside is GDB complains
1467 about the nesting of the label for the table when debugging. */
1469 #define JUMP_TABLES_IN_TEXT_SECTION 1
1471 /* This is how to output an element of a case-vector that is absolute. */
1473 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1474 if (TARGET_BIG_SWITCH) \
1475 fprintf (FILE, "\t.word L$%04d\n", VALUE); \
1477 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1479 /* This is how to output an element of a case-vector that is relative.
1480 Since we always place jump tables in the text section, the difference
1481 is absolute and requires no relocation. */
1483 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1484 if (TARGET_BIG_SWITCH) \
1485 fprintf (FILE, "\t.word L$%04d-L$%04d\n", VALUE, REL); \
1487 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1489 /* This is how to output an assembler line that says to advance the
1490 location counter to a multiple of 2**LOG bytes. */
1492 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1493 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1495 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1496 fprintf (FILE, "\t.blockz "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1497 (unsigned HOST_WIDE_INT)(SIZE))
1499 /* This says how to output an assembler line to define an uninitialized
1500 global variable with size SIZE (in bytes) and alignment ALIGN (in bits).
1501 This macro exists to properly support languages like C++ which do not
1502 have common data. */
1504 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
1505 pa_asm_output_aligned_bss (FILE, NAME, SIZE, ALIGN)
1507 /* This says how to output an assembler line to define a global common symbol
1508 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1510 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGN) \
1511 pa_asm_output_aligned_common (FILE, NAME, SIZE, ALIGN)
1513 /* This says how to output an assembler line to define a local common symbol
1514 with size SIZE (in bytes) and alignment ALIGN (in bits). This macro
1515 controls how the assembler definitions of uninitialized static variables
1518 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGN) \
1519 pa_asm_output_aligned_local (FILE, NAME, SIZE, ALIGN)
1521 /* All HP assemblers use "!" to separate logical lines. */
1522 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == '!')
1524 /* Print operand X (an rtx) in assembler syntax to file FILE.
1525 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1526 For `%' followed by punctuation, CODE is the punctuation and X is null.
1528 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1529 and an immediate zero should be represented as `r0'.
1531 Several % codes are defined:
1533 C compare conditions
1534 N extract conditions
1535 M modifier to handle preincrement addressing for memory refs.
1536 F modifier to handle preincrement addressing for fp memory refs */
1538 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1541 /* Print a memory address as an operand to reference that memory location. */
1543 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1544 { rtx addr = ADDR; \
1545 switch (GET_CODE (addr)) \
1548 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1551 gcc_assert (GET_CODE (XEXP (addr, 1)) == CONST_INT); \
1552 fprintf (FILE, "%d(%s)", (int)INTVAL (XEXP (addr, 1)), \
1553 reg_names [REGNO (XEXP (addr, 0))]); \
1556 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1557 fputs ("R'", FILE); \
1558 else if (flag_pic == 0) \
1559 fputs ("RR'", FILE); \
1561 fputs ("RT'", FILE); \
1562 output_global_address (FILE, XEXP (addr, 1), 0); \
1563 fputs ("(", FILE); \
1564 output_operand (XEXP (addr, 0), 0); \
1565 fputs (")", FILE); \
1568 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC "(%%r0)", INTVAL (addr)); \
1571 output_addr_const (FILE, addr); \
1575 /* Find the return address associated with the frame given by
1577 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1578 (return_addr_rtx (COUNT, FRAMEADDR))
1580 /* Used to mask out junk bits from the return address, such as
1581 processor state, interrupt status, condition codes and the like. */
1582 #define MASK_RETURN_ADDR \
1583 /* The privilege level is in the two low order bits, mask em out \
1584 of the return address. */ \
1587 /* The number of Pmode words for the setjmp buffer. */
1588 #define JMP_BUF_SIZE 50
1590 /* We need a libcall to canonicalize function pointers on TARGET_ELF32. */
1591 #define CANONICALIZE_FUNCPTR_FOR_COMPARE_LIBCALL \
1592 "__canonicalize_funcptr_for_compare"
1595 #undef TARGET_HAVE_TLS
1596 #define TARGET_HAVE_TLS true