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 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, 59 Temple Place - Suite 330,
23 Boston, MA 02111-1307, 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 const char *pa_cpu_string;
50 extern enum processor_type pa_cpu;
52 #define pa_cpu_attr ((enum attr_cpu)pa_cpu)
54 /* Which architecture to generate code for. */
56 enum architecture_type
65 /* For -march= option. */
66 extern const char *pa_arch_string;
67 extern enum architecture_type pa_arch;
69 /* Print subsidiary information on the compiler version in use. */
71 #define TARGET_VERSION fputs (" (hppa)", stderr);
73 /* Run-time compilation parameters selecting different hardware subsets. */
75 extern int target_flags;
77 /* compile code for HP-PA 1.1 ("Snake"). */
81 /* Disable all FP registers (they all become fixed). This may be necessary
82 for compiling kernels which perform lazy context switching of FP regs.
83 Note if you use this option and try to perform floating point operations
84 the compiler will abort! */
86 #define MASK_DISABLE_FPREGS 2
87 #define TARGET_DISABLE_FPREGS (target_flags & MASK_DISABLE_FPREGS)
89 /* Generate code which assumes that all space register are equivalent.
90 Triggers aggressive unscaled index addressing and faster
91 builtin_return_address. */
92 #define MASK_NO_SPACE_REGS 4
93 #define TARGET_NO_SPACE_REGS (target_flags & MASK_NO_SPACE_REGS)
95 /* Allow unconditional jumps in the delay slots of call instructions. */
96 #define MASK_JUMP_IN_DELAY 8
97 #define TARGET_JUMP_IN_DELAY (target_flags & MASK_JUMP_IN_DELAY)
99 /* Disable indexed addressing modes. */
100 #define MASK_DISABLE_INDEXING 32
101 #define TARGET_DISABLE_INDEXING (target_flags & MASK_DISABLE_INDEXING)
103 /* Emit code which follows the new portable runtime calling conventions
104 HP wants everyone to use for ELF objects. If at all possible you want
105 to avoid this since it's a performance loss for non-prototyped code.
107 Note TARGET_PORTABLE_RUNTIME also forces all calls to use inline
108 long-call stubs which is quite expensive. */
109 #define MASK_PORTABLE_RUNTIME 64
110 #define TARGET_PORTABLE_RUNTIME (target_flags & MASK_PORTABLE_RUNTIME)
112 /* Emit directives only understood by GAS. This allows parameter
113 relocations to work for static functions. There is no way
114 to make them work the HP assembler at this time. */
116 #define TARGET_GAS (target_flags & MASK_GAS)
118 /* Emit code for processors which do not have an FPU. */
119 #define MASK_SOFT_FLOAT 256
120 #define TARGET_SOFT_FLOAT (target_flags & MASK_SOFT_FLOAT)
122 /* Use 3-insn load/store sequences for access to large data segments
123 in shared libraries on hpux10. */
124 #define MASK_LONG_LOAD_STORE 512
125 #define TARGET_LONG_LOAD_STORE (target_flags & MASK_LONG_LOAD_STORE)
127 /* Use a faster sequence for indirect calls. This assumes that calls
128 through function pointers will never cross a space boundary, and
129 that the executable is not dynamically linked. Such assumptions
130 are generally safe for building kernels and statically linked
131 executables. Code compiled with this option will fail miserably if
132 the executable is dynamically linked or uses nested functions! */
133 #define MASK_FAST_INDIRECT_CALLS 1024
134 #define TARGET_FAST_INDIRECT_CALLS (target_flags & MASK_FAST_INDIRECT_CALLS)
136 /* Generate code with big switch statements to avoid out of range branches
137 occurring within the switch table. */
138 #define MASK_BIG_SWITCH 2048
139 #define TARGET_BIG_SWITCH (target_flags & MASK_BIG_SWITCH)
141 /* Generate code for the HPPA 2.0 architecture. TARGET_PA_11 should also be
142 true when this is true. */
143 #define MASK_PA_20 4096
145 /* Generate cpp defines for server I/O. */
146 #define MASK_SIO 8192
147 #define TARGET_SIO (target_flags & MASK_SIO)
149 /* Assume GNU linker by default. */
150 #define MASK_GNU_LD 16384
151 #ifndef TARGET_GNU_LD
152 #define TARGET_GNU_LD (target_flags & MASK_GNU_LD)
155 /* Force generation of long calls. */
156 #define MASK_LONG_CALLS 32768
157 #ifndef TARGET_LONG_CALLS
158 #define TARGET_LONG_CALLS (target_flags & MASK_LONG_CALLS)
162 #define TARGET_PA_10 (target_flags & (MASK_PA_11 | MASK_PA_20) == 0)
166 #define TARGET_PA_11 (target_flags & MASK_PA_11)
170 #define TARGET_PA_20 (target_flags & MASK_PA_20)
173 /* Generate code for the HPPA 2.0 architecture in 64bit mode. */
175 #define TARGET_64BIT 0
178 /* Generate code for ELF32 ABI. */
180 #define TARGET_ELF32 0
183 /* Generate code for SOM 32bit ABI. */
188 /* The following three defines are potential target switches. The current
189 defines are optimal given the current capabilities of GAS and GNU ld. */
191 /* Define to a C expression evaluating to true to use long absolute calls.
192 Currently, only the HP assembler and SOM linker support long absolute
193 calls. They are used only in non-pic code. */
194 #define TARGET_LONG_ABS_CALL (TARGET_SOM && !TARGET_GAS)
196 /* Define to a C expression evaluating to true to use long pic symbol
197 difference calls. This is a call variant similar to the long pic
198 pc-relative call. Long pic symbol difference calls are only used with
199 the HP SOM linker. Currently, only the HP assembler supports these
200 calls. GAS doesn't allow an arbitrary difference of two symbols. */
201 #define TARGET_LONG_PIC_SDIFF_CALL (!TARGET_GAS)
203 /* Define to a C expression evaluating to true to use long pic
204 pc-relative calls. Long pic pc-relative calls are only used with
205 GAS. Currently, they are usable for calls within a module but
206 not for external calls. */
207 #define TARGET_LONG_PIC_PCREL_CALL 0
209 /* Define to a C expression evaluating to true to use SOM secondary
210 definition symbols for weak support. Linker support for secondary
211 definition symbols is buggy prior to HP-UX 11.X. */
212 #define TARGET_SOM_SDEF 0
214 /* Define to a C expression evaluating to true to save the entry value
215 of SP in the current frame marker. This is normally unnecessary.
216 However, the HP-UX unwind library looks at the SAVE_SP callinfo flag.
217 HP compilers don't use this flag but it is supported by the assembler.
218 We set this flag to indicate that register %r3 has been saved at the
219 start of the frame. Thus, when the HP unwind library is used, we
220 need to generate additional code to save SP into the frame marker. */
221 #define TARGET_HPUX_UNWIND_LIBRARY 0
223 /* Macro to define tables used to set the flags. This is a
224 list in braces of target switches with each switch being
225 { "NAME", VALUE, "HELP_STRING" }. VALUE is the bits to set,
226 or minus the bits to clear. An empty string NAME is used to
227 identify the default VALUE. Do not mark empty strings for
230 #define TARGET_SWITCHES \
231 {{ "snake", MASK_PA_11, \
232 N_("Generate PA1.1 code") }, \
233 { "nosnake", -(MASK_PA_11 | MASK_PA_20), \
234 N_("Generate PA1.0 code") }, \
235 { "pa-risc-1-0", -(MASK_PA_11 | MASK_PA_20), \
236 N_("Generate PA1.0 code") }, \
237 { "pa-risc-1-1", MASK_PA_11, \
238 N_("Generate PA1.1 code") }, \
239 { "pa-risc-2-0", MASK_PA_20, \
240 N_("Generate PA2.0 code (requires binutils 2.10 or later)") }, \
241 { "disable-fpregs", MASK_DISABLE_FPREGS, \
242 N_("Disable FP regs") }, \
243 { "no-disable-fpregs", -MASK_DISABLE_FPREGS, \
244 N_("Do not disable FP regs") }, \
245 { "no-space-regs", MASK_NO_SPACE_REGS, \
246 N_("Disable space regs") }, \
247 { "space-regs", -MASK_NO_SPACE_REGS, \
248 N_("Do not disable space regs") }, \
249 { "jump-in-delay", MASK_JUMP_IN_DELAY, \
250 N_("Put jumps in call delay slots") }, \
251 { "no-jump-in-delay", -MASK_JUMP_IN_DELAY, \
252 N_("Do not put jumps in call delay slots") }, \
253 { "disable-indexing", MASK_DISABLE_INDEXING, \
254 N_("Disable indexed addressing") }, \
255 { "no-disable-indexing", -MASK_DISABLE_INDEXING, \
256 N_("Do not disable indexed addressing") }, \
257 { "portable-runtime", MASK_PORTABLE_RUNTIME, \
258 N_("Use portable calling conventions") }, \
259 { "no-portable-runtime", -MASK_PORTABLE_RUNTIME, \
260 N_("Do not use portable calling conventions") }, \
262 N_("Assume code will be assembled by GAS") }, \
263 { "no-gas", -MASK_GAS, \
264 N_("Do not assume code will be assembled by GAS") }, \
265 { "soft-float", MASK_SOFT_FLOAT, \
266 N_("Use software floating point") }, \
267 { "no-soft-float", -MASK_SOFT_FLOAT, \
268 N_("Do not use software floating point") }, \
269 { "long-load-store", MASK_LONG_LOAD_STORE, \
270 N_("Emit long load/store sequences") }, \
271 { "no-long-load-store", -MASK_LONG_LOAD_STORE, \
272 N_("Do not emit long load/store sequences") }, \
273 { "fast-indirect-calls", MASK_FAST_INDIRECT_CALLS, \
274 N_("Generate fast indirect calls") }, \
275 { "no-fast-indirect-calls", -MASK_FAST_INDIRECT_CALLS, \
276 N_("Do not generate fast indirect calls") }, \
277 { "big-switch", MASK_BIG_SWITCH, \
278 N_("Generate code for huge switch statements") }, \
279 { "no-big-switch", -MASK_BIG_SWITCH, \
280 N_("Do not generate code for huge switch statements") }, \
281 { "long-calls", MASK_LONG_CALLS, \
282 N_("Always generate long calls") }, \
283 { "no-long-calls", -MASK_LONG_CALLS, \
284 N_("Generate long calls only when needed") }, \
286 N_("Enable linker optimizations") }, \
288 { "", TARGET_DEFAULT | TARGET_CPU_DEFAULT, \
291 #ifndef TARGET_DEFAULT
292 #define TARGET_DEFAULT (MASK_GAS | MASK_JUMP_IN_DELAY)
295 #ifndef TARGET_CPU_DEFAULT
296 #define TARGET_CPU_DEFAULT 0
299 #ifndef SUBTARGET_SWITCHES
300 #define SUBTARGET_SWITCHES
303 #ifndef TARGET_SCHED_DEFAULT
304 #define TARGET_SCHED_DEFAULT "8000"
307 #define TARGET_OPTIONS \
309 { "schedule=", &pa_cpu_string, \
310 N_("Specify CPU for scheduling purposes"), 0}, \
311 { "arch=", &pa_arch_string, \
312 N_("Specify architecture for code generation. Values are 1.0, 1.1, and 2.0. 2.0 requires gas snapshot 19990413 or later."), 0}\
315 /* Support for a compile-time default CPU, et cetera. The rules are:
316 --with-schedule is ignored if -mschedule is specified.
317 --with-arch is ignored if -march is specified. */
318 #define OPTION_DEFAULT_SPECS \
319 {"arch", "%{!march=*:-march=%(VALUE)}" }, \
320 {"schedule", "%{!mschedule=*:-mschedule=%(VALUE)}" }
322 /* Specify the dialect of assembler to use. New mnemonics is dialect one
323 and the old mnemonics are dialect zero. */
324 #define ASSEMBLER_DIALECT (TARGET_PA_20 ? 1 : 0)
326 #define OVERRIDE_OPTIONS override_options ()
328 /* Override some settings from dbxelf.h. */
330 /* We do not have to be compatible with dbx, so we enable gdb extensions
332 #define DEFAULT_GDB_EXTENSIONS 1
334 /* This used to be zero (no max length), but big enums and such can
335 cause huge strings which killed gas.
337 We also have to avoid lossage in dbxout.c -- it does not compute the
338 string size accurately, so we are real conservative here. */
339 #undef DBX_CONTIN_LENGTH
340 #define DBX_CONTIN_LENGTH 3000
342 /* Only labels should ever begin in column zero. */
343 #define ASM_STABS_OP "\t.stabs\t"
344 #define ASM_STABN_OP "\t.stabn\t"
346 /* GDB always assumes the current function's frame begins at the value
347 of the stack pointer upon entry to the current function. Accessing
348 local variables and parameters passed on the stack is done using the
349 base of the frame + an offset provided by GCC.
351 For functions which have frame pointers this method works fine;
352 the (frame pointer) == (stack pointer at function entry) and GCC provides
353 an offset relative to the frame pointer.
355 This loses for functions without a frame pointer; GCC provides an offset
356 which is relative to the stack pointer after adjusting for the function's
357 frame size. GDB would prefer the offset to be relative to the value of
358 the stack pointer at the function's entry. Yuk! */
359 #define DEBUGGER_AUTO_OFFSET(X) \
360 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
361 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
363 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
364 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
365 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
367 #define TARGET_CPU_CPP_BUILTINS() \
369 builtin_assert("cpu=hppa"); \
370 builtin_assert("machine=hppa"); \
371 builtin_define("__hppa"); \
372 builtin_define("__hppa__"); \
374 builtin_define("_PA_RISC2_0"); \
375 else if (TARGET_PA_11) \
376 builtin_define("_PA_RISC1_1"); \
378 builtin_define("_PA_RISC1_0"); \
381 /* An old set of OS defines for various BSD-like systems. */
382 #define TARGET_OS_CPP_BUILTINS() \
385 builtin_define_std ("REVARGV"); \
386 builtin_define_std ("hp800"); \
387 builtin_define_std ("hp9000"); \
388 builtin_define_std ("hp9k8"); \
389 if (!c_dialect_cxx () && !flag_iso) \
390 builtin_define ("hppa"); \
391 builtin_define_std ("spectrum"); \
392 builtin_define_std ("unix"); \
393 builtin_assert ("system=bsd"); \
394 builtin_assert ("system=unix"); \
398 #define CC1_SPEC "%{pg:} %{p:}"
400 #define LINK_SPEC "%{mlinker-opt:-O} %{!shared:-u main} %{shared:-b}"
402 /* We don't want -lg. */
404 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
407 /* This macro defines command-line switches that modify the default
410 The definition is be an initializer for an array of structures. Each
411 array element has have three elements: the switch name, one of the
412 enumeration codes ADD or DELETE to indicate whether the string should be
413 inserted or deleted, and the string to be inserted or deleted. */
414 #define MODIFY_TARGET_NAME {{"-32", DELETE, "64"}, {"-64", ADD, "64"}}
416 /* Make gcc agree with <machine/ansi.h> */
418 #define SIZE_TYPE "unsigned int"
419 #define PTRDIFF_TYPE "int"
420 #define WCHAR_TYPE "unsigned int"
421 #define WCHAR_TYPE_SIZE 32
423 /* Show we can debug even without a frame pointer. */
424 #define CAN_DEBUG_WITHOUT_FP
426 /* target machine storage layout */
428 /* Define this macro if it is advisable to hold scalars in registers
429 in a wider mode than that declared by the program. In such cases,
430 the value is constrained to be within the bounds of the declared
431 type, but kept valid in the wider mode. The signedness of the
432 extension may differ from that of the type. */
434 #define PROMOTE_MODE(MODE,UNSIGNEDP,TYPE) \
435 if (GET_MODE_CLASS (MODE) == MODE_INT \
436 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
439 /* Define this if most significant bit is lowest numbered
440 in instructions that operate on numbered bit-fields. */
441 #define BITS_BIG_ENDIAN 1
443 /* Define this if most significant byte of a word is the lowest numbered. */
444 /* That is true on the HP-PA. */
445 #define BYTES_BIG_ENDIAN 1
447 /* Define this if most significant word of a multiword number is lowest
449 #define WORDS_BIG_ENDIAN 1
451 #define MAX_BITS_PER_WORD 64
452 #define MAX_LONG_TYPE_SIZE 32
454 /* Width of a word, in units (bytes). */
455 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
456 #define MIN_UNITS_PER_WORD 4
458 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
459 #define PARM_BOUNDARY BITS_PER_WORD
461 /* Largest alignment required for any stack parameter, in bits.
462 Don't define this if it is equal to PARM_BOUNDARY */
463 #define MAX_PARM_BOUNDARY BIGGEST_ALIGNMENT
465 /* Boundary (in *bits*) on which stack pointer is always aligned;
466 certain optimizations in combine depend on this.
468 The HP-UX runtime documents mandate 64-byte and 16-byte alignment for
469 the stack on the 32 and 64-bit ports, respectively. However, we
470 are only guaranteed that the stack is aligned to BIGGEST_ALIGNMENT
471 in main. Thus, we treat the former as the preferred alignment. */
472 #define STACK_BOUNDARY BIGGEST_ALIGNMENT
473 #define PREFERRED_STACK_BOUNDARY (TARGET_64BIT ? 128 : 512)
475 /* Allocation boundary (in *bits*) for the code of a function. */
476 #define FUNCTION_BOUNDARY BITS_PER_WORD
478 /* Alignment of field after `int : 0' in a structure. */
479 #define EMPTY_FIELD_BOUNDARY 32
481 /* Every structure's size must be a multiple of this. */
482 #define STRUCTURE_SIZE_BOUNDARY 8
484 /* A bit-field declared as `int' forces `int' alignment for the struct. */
485 #define PCC_BITFIELD_TYPE_MATTERS 1
487 /* No data type wants to be aligned rounder than this. */
488 #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
490 /* Get around hp-ux assembler bug, and make strcpy of constants fast. */
491 #define CONSTANT_ALIGNMENT(CODE, TYPEALIGN) \
492 ((TYPEALIGN) < 32 ? 32 : (TYPEALIGN))
494 /* Make arrays of chars word-aligned for the same reasons. */
495 #define DATA_ALIGNMENT(TYPE, ALIGN) \
496 (TREE_CODE (TYPE) == ARRAY_TYPE \
497 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
498 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
500 /* Set this nonzero if move instructions will actually fail to work
501 when given unaligned data. */
502 #define STRICT_ALIGNMENT 1
504 /* Generate calls to memcpy, memcmp and memset. */
505 #define TARGET_MEM_FUNCTIONS
507 /* Value is 1 if it is a good idea to tie two pseudo registers
508 when one has mode MODE1 and one has mode MODE2.
509 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
510 for any hard reg, then this must be 0 for correct output. */
511 #define MODES_TIEABLE_P(MODE1, MODE2) \
512 (GET_MODE_CLASS (MODE1) == GET_MODE_CLASS (MODE2))
514 /* Specify the registers used for certain standard purposes.
515 The values of these macros are register numbers. */
517 /* The HP-PA pc isn't overloaded on a register that the compiler knows about. */
518 /* #define PC_REGNUM */
520 /* Register to use for pushing function arguments. */
521 #define STACK_POINTER_REGNUM 30
523 /* Base register for access to local variables of the function. */
524 #define FRAME_POINTER_REGNUM 3
526 /* Value should be nonzero if functions must have frame pointers. */
527 #define FRAME_POINTER_REQUIRED \
528 (current_function_calls_alloca)
530 /* C statement to store the difference between the frame pointer
531 and the stack pointer values immediately after the function prologue.
533 Note, we always pretend that this is a leaf function because if
534 it's not, there's no point in trying to eliminate the
535 frame pointer. If it is a leaf function, we guessed right! */
536 #define INITIAL_FRAME_POINTER_OFFSET(VAR) \
537 do {(VAR) = - compute_frame_size (get_frame_size (), 0);} while (0)
539 /* Base register for access to arguments of the function. */
540 #define ARG_POINTER_REGNUM 3
542 /* Register in which static-chain is passed to a function. */
543 #define STATIC_CHAIN_REGNUM 29
545 /* Register which holds offset table for position-independent
548 #define PIC_OFFSET_TABLE_REGNUM (TARGET_64BIT ? 27 : 19)
549 #define PIC_OFFSET_TABLE_REG_CALL_CLOBBERED 1
551 /* Function to return the rtx used to save the pic offset table register
552 across function calls. */
553 extern struct rtx_def *hppa_pic_save_rtx (void);
555 #define DEFAULT_PCC_STRUCT_RETURN 0
557 /* Register in which address to store a structure value
558 is passed to a function. */
559 #define PA_STRUCT_VALUE_REGNUM 28
561 /* Describe how we implement __builtin_eh_return. */
562 #define EH_RETURN_DATA_REGNO(N) \
563 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
564 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
565 #define EH_RETURN_HANDLER_RTX \
566 gen_rtx_MEM (word_mode, \
567 gen_rtx_PLUS (word_mode, frame_pointer_rtx, \
568 TARGET_64BIT ? GEN_INT (-16) : GEN_INT (-20)))
571 /* Offset from the argument pointer register value to the top of
572 stack. This is different from FIRST_PARM_OFFSET because of the
574 #define ARG_POINTER_CFA_OFFSET(FNDECL) 0
576 /* The letters I, J, K, L and M in a register constraint string
577 can be used to stand for particular ranges of immediate operands.
578 This macro defines what the ranges are.
579 C is the letter, and VALUE is a constant value.
580 Return 1 if VALUE is in the range specified by C.
582 `I' is used for the 11 bit constants.
583 `J' is used for the 14 bit constants.
584 `K' is used for values that can be moved with a zdepi insn.
585 `L' is used for the 5 bit constants.
587 `N' is used for values with the least significant 11 bits equal to zero
588 and when sign extended from 32 to 64 bits the
589 value does not change.
590 `O' is used for numbers n such that n+1 is a power of 2.
593 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
594 ((C) == 'I' ? VAL_11_BITS_P (VALUE) \
595 : (C) == 'J' ? VAL_14_BITS_P (VALUE) \
596 : (C) == 'K' ? zdepi_cint_p (VALUE) \
597 : (C) == 'L' ? VAL_5_BITS_P (VALUE) \
598 : (C) == 'M' ? (VALUE) == 0 \
599 : (C) == 'N' ? (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) == 0 \
600 || (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) \
601 == (HOST_WIDE_INT) -1 << 31)) \
602 : (C) == 'O' ? (((VALUE) & ((VALUE) + 1)) == 0) \
603 : (C) == 'P' ? and_mask_p (VALUE) \
606 /* Similar, but for floating or large integer constants, and defining letters
607 G and H. Here VALUE is the CONST_DOUBLE rtx itself.
609 For PA, `G' is the floating-point constant zero. `H' is undefined. */
611 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
612 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
613 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) \
616 /* The class value for index registers, and the one for base regs. */
617 #define INDEX_REG_CLASS GENERAL_REGS
618 #define BASE_REG_CLASS GENERAL_REGS
620 #define FP_REG_CLASS_P(CLASS) \
621 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
623 /* True if register is floating-point. */
624 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
626 /* Given an rtx X being reloaded into a reg required to be
627 in class CLASS, return the class of reg to actually use.
628 In general this is just CLASS; but on some machines
629 in some cases it is preferable to use a more restrictive class. */
630 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
632 /* Return the register class of a scratch register needed to copy
633 IN into a register in CLASS in MODE, or a register in CLASS in MODE
634 to IN. If it can be done directly NO_REGS is returned.
636 Avoid doing any work for the common case calls. */
637 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
638 ((CLASS == BASE_REG_CLASS && GET_CODE (IN) == REG \
639 && REGNO (IN) < FIRST_PSEUDO_REGISTER) \
640 ? NO_REGS : secondary_reload_class (CLASS, MODE, IN))
642 #define MAYBE_FP_REG_CLASS_P(CLASS) \
643 reg_classes_intersect_p ((CLASS), FP_REGS)
645 /* On the PA it is not possible to directly move data between
646 GENERAL_REGS and FP_REGS. */
647 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
648 (MAYBE_FP_REG_CLASS_P (CLASS1) != FP_REG_CLASS_P (CLASS2) \
649 || MAYBE_FP_REG_CLASS_P (CLASS2) != FP_REG_CLASS_P (CLASS1))
651 /* Return the stack location to use for secondary memory needed reloads. */
652 #define SECONDARY_MEMORY_NEEDED_RTX(MODE) \
653 gen_rtx_MEM (MODE, gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (-16)))
656 /* Stack layout; function entry, exit and calling. */
658 /* Define this if pushing a word on the stack
659 makes the stack pointer a smaller address. */
660 /* #define STACK_GROWS_DOWNWARD */
662 /* Believe it or not. */
663 #define ARGS_GROW_DOWNWARD
665 /* Define this if the nominal address of the stack frame
666 is at the high-address end of the local variables;
667 that is, each additional local variable allocated
668 goes at a more negative offset in the frame. */
669 /* #define FRAME_GROWS_DOWNWARD */
671 /* Offset within stack frame to start allocating local variables at.
672 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
673 first local allocated. Otherwise, it is the offset to the BEGINNING
674 of the first local allocated.
676 On the 32-bit ports, we reserve one slot for the previous frame
677 pointer and one fill slot. The fill slot is for compatibility
678 with HP compiled programs. On the 64-bit ports, we reserve one
679 slot for the previous frame pointer. */
680 #define STARTING_FRAME_OFFSET 8
682 /* Define STACK_ALIGNMENT_NEEDED to zero to disable final alignment
683 of the stack. The default is to align it to STACK_BOUNDARY. */
684 #define STACK_ALIGNMENT_NEEDED 0
686 /* If we generate an insn to push BYTES bytes,
687 this says how many the stack pointer really advances by.
688 On the HP-PA, don't define this because there are no push insns. */
689 /* #define PUSH_ROUNDING(BYTES) */
691 /* Offset of first parameter from the argument pointer register value.
692 This value will be negated because the arguments grow down.
693 Also note that on STACK_GROWS_UPWARD machines (such as this one)
694 this is the distance from the frame pointer to the end of the first
695 argument, not it's beginning. To get the real offset of the first
696 argument, the size of the argument must be added. */
698 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
700 /* When a parameter is passed in a register, stack space is still
702 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
704 /* Define this if the above stack space is to be considered part of the
705 space allocated by the caller. */
706 #define OUTGOING_REG_PARM_STACK_SPACE
708 /* Keep the stack pointer constant throughout the function.
709 This is both an optimization and a necessity: longjmp
710 doesn't behave itself when the stack pointer moves within
712 #define ACCUMULATE_OUTGOING_ARGS 1
714 /* The weird HPPA calling conventions require a minimum of 48 bytes on
715 the stack: 16 bytes for register saves, and 32 bytes for magic.
716 This is the difference between the logical top of stack and the
719 On the 64-bit port, the HP C compiler allocates a 48-byte frame
720 marker, although the runtime documentation only describes a 16
721 byte marker. For compatibility, we allocate 48 bytes. */
722 #define STACK_POINTER_OFFSET \
723 (TARGET_64BIT ? -(current_function_outgoing_args_size + 48): -32)
725 #define STACK_DYNAMIC_OFFSET(FNDECL) \
727 ? (STACK_POINTER_OFFSET) \
728 : ((STACK_POINTER_OFFSET) - current_function_outgoing_args_size))
730 /* Value is 1 if returning from a function call automatically
731 pops the arguments described by the number-of-args field in the call.
732 FUNDECL is the declaration node of the function (as a tree),
733 FUNTYPE is the data type of the function (as a tree),
734 or for a library call it is an identifier node for the subroutine name. */
736 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
738 /* Define how to find the value returned by a function.
739 VALTYPE is the data type of the value (as a tree).
740 If the precise function being called is known, FUNC is its FUNCTION_DECL;
741 otherwise, FUNC is 0. */
743 #define FUNCTION_VALUE(VALTYPE, FUNC) function_value (VALTYPE, FUNC)
745 /* Define how to find the value returned by a library function
746 assuming the value has mode MODE. */
748 #define LIBCALL_VALUE(MODE) \
750 (! TARGET_SOFT_FLOAT \
751 && ((MODE) == SFmode || (MODE) == DFmode) ? 32 : 28))
753 /* 1 if N is a possible register number for a function value
754 as seen by the caller. */
756 #define FUNCTION_VALUE_REGNO_P(N) \
757 ((N) == 28 || (! TARGET_SOFT_FLOAT && (N) == 32))
760 /* Define a data type for recording info about an argument list
761 during the scan of that argument list. This data type should
762 hold all necessary information about the function itself
763 and about the args processed so far, enough to enable macros
764 such as FUNCTION_ARG to determine where the next arg should go.
766 On the HP-PA, the WORDS field holds the number of words
767 of arguments scanned so far (including the invisible argument,
768 if any, which holds the structure-value-address). Thus, 4 or
769 more means all following args should go on the stack.
771 The INCOMING field tracks whether this is an "incoming" or
774 The INDIRECT field indicates whether this is is an indirect
777 The NARGS_PROTOTYPE field indicates that an argument does not
778 have a prototype when it less than or equal to 0. */
780 struct hppa_args {int words, nargs_prototype, incoming, indirect; };
782 #define CUMULATIVE_ARGS struct hppa_args
784 /* Initialize a variable CUM of type CUMULATIVE_ARGS
785 for a call to a function whose data type is FNTYPE.
786 For a library call, FNTYPE is 0. */
788 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, FNDECL, N_NAMED_ARGS) \
790 (CUM).incoming = 0, \
791 (CUM).indirect = (FNTYPE) && !(FNDECL), \
792 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
793 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
794 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
795 || pa_return_in_memory (TREE_TYPE (FNTYPE), 0))) \
800 /* Similar, but when scanning the definition of a procedure. We always
801 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
803 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
805 (CUM).incoming = 1, \
806 (CUM).indirect = 0, \
807 (CUM).nargs_prototype = 1000
809 /* Figure out the size in words of the function argument. The size
810 returned by this macro should always be greater than zero because
811 we pass variable and zero sized objects by reference. */
813 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
814 ((((MODE) != BLKmode \
815 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
816 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
818 /* Update the data in CUM to advance over an argument
819 of mode MODE and data type TYPE.
820 (TYPE is null for libcalls where that information may not be available.) */
822 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
823 { (CUM).nargs_prototype--; \
824 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
825 + (((CUM).words & 01) && (TYPE) != 0 \
826 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
829 /* Determine where to put an argument to a function.
830 Value is zero to push the argument on the stack,
831 or a hard register in which to store the argument.
833 MODE is the argument's machine mode.
834 TYPE is the data type of the argument (as a tree).
835 This is null for libcalls where that information may
837 CUM is a variable of type CUMULATIVE_ARGS which gives info about
838 the preceding args and about the function being called.
839 NAMED is nonzero if this argument is a named parameter
840 (otherwise it is an extra parameter matching an ellipsis).
842 On the HP-PA the first four words of args are normally in registers
843 and the rest are pushed. But any arg that won't entirely fit in regs
846 Arguments passed in registers are either 1 or 2 words long.
848 The caller must make a distinction between calls to explicitly named
849 functions and calls through pointers to functions -- the conventions
850 are different! Calls through pointers to functions only use general
851 registers for the first four argument words.
853 Of course all this is different for the portable runtime model
854 HP wants everyone to use for ELF. Ugh. Here's a quick description
855 of how it's supposed to work.
857 1) callee side remains unchanged. It expects integer args to be
858 in the integer registers, float args in the float registers and
859 unnamed args in integer registers.
861 2) caller side now depends on if the function being called has
862 a prototype in scope (rather than if it's being called indirectly).
864 2a) If there is a prototype in scope, then arguments are passed
865 according to their type (ints in integer registers, floats in float
866 registers, unnamed args in integer registers.
868 2b) If there is no prototype in scope, then floating point arguments
869 are passed in both integer and float registers. egad.
871 FYI: The portable parameter passing conventions are almost exactly like
872 the standard parameter passing conventions on the RS6000. That's why
873 you'll see lots of similar code in rs6000.h. */
875 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
877 /* Do not expect to understand this without reading it several times. I'm
878 tempted to try and simply it, but I worry about breaking something. */
880 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
881 function_arg (&CUM, MODE, TYPE, NAMED)
883 /* Nonzero if we do not know how to pass TYPE solely in registers. */
884 #define MUST_PASS_IN_STACK(MODE,TYPE) \
886 && (TREE_CODE (TYPE_SIZE (TYPE)) != INTEGER_CST \
887 || TREE_ADDRESSABLE (TYPE)))
889 /* For an arg passed partly in registers and partly in memory,
890 this is the number of registers used.
891 For args passed entirely in registers or entirely in memory, zero. */
893 /* For PA32 there are never split arguments. PA64, on the other hand, can
894 pass arguments partially in registers and partially in memory. */
895 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
896 (TARGET_64BIT ? function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED) : 0)
898 /* If defined, a C expression that gives the alignment boundary, in
899 bits, of an argument with the specified mode and type. If it is
900 not defined, `PARM_BOUNDARY' is used for all arguments. */
902 /* Arguments larger than one word are double word aligned. */
904 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
906 ? (integer_zerop (TYPE_SIZE (TYPE)) \
907 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
908 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
909 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
910 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
912 /* In the 32-bit runtime, arguments larger than eight bytes are passed
913 by invisible reference. As a GCC extension, we also pass anything
914 with a zero or variable size by reference.
916 The 64-bit runtime does not describe passing any types by invisible
917 reference. The internals of GCC can't currently handle passing
918 empty structures, and zero or variable length arrays when they are
919 not passed entirely on the stack or by reference. Thus, as a GCC
920 extension, we pass these types by reference. The HP compiler doesn't
921 support these types, so hopefully there shouldn't be any compatibility
922 issues. This may have to be revisited when HP releases a C99 compiler
923 or updates the ABI. */
924 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
926 ? ((TYPE) && int_size_in_bytes (TYPE) <= 0) \
927 : (((TYPE) && (int_size_in_bytes (TYPE) > 8 \
928 || int_size_in_bytes (TYPE) <= 0)) \
929 || ((MODE) && GET_MODE_SIZE (MODE) > 8)))
931 #define FUNCTION_ARG_CALLEE_COPIES(CUM, MODE, TYPE, NAMED) \
932 FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)
935 extern GTY(()) rtx hppa_compare_op0;
936 extern GTY(()) rtx hppa_compare_op1;
937 extern enum cmp_type hppa_branch_type;
939 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
940 as assembly via FUNCTION_PROFILER. Just output a local label.
941 We can't use the function label because the GAS SOM target can't
942 handle the difference of a global symbol and a local symbol. */
944 #ifndef FUNC_BEGIN_PROLOG_LABEL
945 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
948 #define FUNCTION_PROFILER(FILE, LABEL) \
949 (*targetm.asm_out.internal_label) (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
951 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
952 void hppa_profile_hook (int label_no);
954 /* The profile counter if emitted must come before the prologue. */
955 #define PROFILE_BEFORE_PROLOGUE 1
957 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
958 the stack pointer does not matter. The value is tested only in
959 functions that have frame pointers.
960 No definition is equivalent to always zero. */
962 extern int may_call_alloca;
964 #define EXIT_IGNORE_STACK \
965 (get_frame_size () != 0 \
966 || current_function_calls_alloca || current_function_outgoing_args_size)
968 /* Output assembler code for a block containing the constant parts
969 of a trampoline, leaving space for the variable parts.\
971 The trampoline sets the static chain pointer to STATIC_CHAIN_REGNUM
972 and then branches to the specified routine.
974 This code template is copied from text segment to stack location
975 and then patched with INITIALIZE_TRAMPOLINE to contain
976 valid values, and then entered as a subroutine.
978 It is best to keep this as small as possible to avoid having to
979 flush multiple lines in the cache. */
981 #define TRAMPOLINE_TEMPLATE(FILE) \
985 fputs ("\tldw 36(%r22),%r21\n", FILE); \
986 fputs ("\tbb,>=,n %r21,30,.+16\n", FILE); \
987 if (ASSEMBLER_DIALECT == 0) \
988 fputs ("\tdepi 0,31,2,%r21\n", FILE); \
990 fputs ("\tdepwi 0,31,2,%r21\n", FILE); \
991 fputs ("\tldw 4(%r21),%r19\n", FILE); \
992 fputs ("\tldw 0(%r21),%r21\n", FILE); \
995 fputs ("\tbve (%r21)\n", FILE); \
996 fputs ("\tldw 40(%r22),%r29\n", FILE); \
997 fputs ("\t.word 0\n", FILE); \
998 fputs ("\t.word 0\n", FILE); \
1002 fputs ("\tldsid (%r21),%r1\n", FILE); \
1003 fputs ("\tmtsp %r1,%sr0\n", FILE); \
1004 fputs ("\tbe 0(%sr0,%r21)\n", FILE); \
1005 fputs ("\tldw 40(%r22),%r29\n", FILE); \
1007 fputs ("\t.word 0\n", FILE); \
1008 fputs ("\t.word 0\n", FILE); \
1009 fputs ("\t.word 0\n", FILE); \
1010 fputs ("\t.word 0\n", FILE); \
1014 fputs ("\t.dword 0\n", FILE); \
1015 fputs ("\t.dword 0\n", FILE); \
1016 fputs ("\t.dword 0\n", FILE); \
1017 fputs ("\t.dword 0\n", FILE); \
1018 fputs ("\tmfia %r31\n", FILE); \
1019 fputs ("\tldd 24(%r31),%r1\n", FILE); \
1020 fputs ("\tldd 24(%r1),%r27\n", FILE); \
1021 fputs ("\tldd 16(%r1),%r1\n", FILE); \
1022 fputs ("\tbve (%r1)\n", FILE); \
1023 fputs ("\tldd 32(%r31),%r31\n", FILE); \
1024 fputs ("\t.dword 0 ; fptr\n", FILE); \
1025 fputs ("\t.dword 0 ; static link\n", FILE); \
1029 /* Length in units of the trampoline for entering a nested function. */
1031 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
1033 /* Length in units of the trampoline instruction code. */
1035 #define TRAMPOLINE_CODE_SIZE (TARGET_64BIT ? 24 : (TARGET_PA_20 ? 32 : 40))
1037 /* Minimum length of a cache line. A length of 16 will work on all
1038 PA-RISC processors. All PA 1.1 processors have a cache line of
1039 32 bytes. Most but not all PA 2.0 processors have a cache line
1040 of 64 bytes. As cache flushes are expensive and we don't support
1041 PA 1.0, we use a minimum length of 32. */
1043 #define MIN_CACHELINE_SIZE 32
1045 /* Emit RTL insns to initialize the variable parts of a trampoline.
1046 FNADDR is an RTX for the address of the function's pure code.
1047 CXT is an RTX for the static chain value for the function.
1049 Move the function address to the trampoline template at offset 36.
1050 Move the static chain value to trampoline template at offset 40.
1051 Move the trampoline address to trampoline template at offset 44.
1052 Move r19 to trampoline template at offset 48. The latter two
1053 words create a plabel for the indirect call to the trampoline.
1055 A similar sequence is used for the 64-bit port but the plabel is
1056 at the beginning of the trampoline.
1058 Finally, the cache entries for the trampoline code are flushed.
1059 This is necessary to ensure that the trampoline instruction sequence
1060 is written to memory prior to any attempts at prefetching the code
1063 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1065 rtx start_addr = gen_reg_rtx (Pmode); \
1066 rtx end_addr = gen_reg_rtx (Pmode); \
1067 rtx line_length = gen_reg_rtx (Pmode); \
1070 if (!TARGET_64BIT) \
1072 tmp = memory_address (Pmode, plus_constant ((TRAMP), 36)); \
1073 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
1074 tmp = memory_address (Pmode, plus_constant ((TRAMP), 40)); \
1075 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
1077 /* Create a fat pointer for the trampoline. */ \
1078 tmp = memory_address (Pmode, plus_constant ((TRAMP), 44)); \
1079 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (TRAMP)); \
1080 tmp = memory_address (Pmode, plus_constant ((TRAMP), 48)); \
1081 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1082 gen_rtx_REG (Pmode, 19)); \
1084 /* fdc and fic only use registers for the address to flush, \
1085 they do not accept integer displacements. We align the \
1086 start and end addresses to the beginning of their respective \
1087 cache lines to minimize the number of lines flushed. */ \
1088 tmp = force_reg (Pmode, (TRAMP)); \
1089 emit_insn (gen_andsi3 (start_addr, tmp, \
1090 GEN_INT (-MIN_CACHELINE_SIZE))); \
1091 tmp = force_reg (Pmode, \
1092 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
1093 emit_insn (gen_andsi3 (end_addr, tmp, \
1094 GEN_INT (-MIN_CACHELINE_SIZE))); \
1095 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
1096 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
1097 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
1098 gen_reg_rtx (Pmode), \
1099 gen_reg_rtx (Pmode), \
1100 gen_reg_rtx (Pmode))); \
1104 tmp = memory_address (Pmode, plus_constant ((TRAMP), 56)); \
1105 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
1106 tmp = memory_address (Pmode, plus_constant ((TRAMP), 64)); \
1107 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
1109 /* Create a fat pointer for the trampoline. */ \
1110 tmp = memory_address (Pmode, plus_constant ((TRAMP), 16)); \
1111 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1112 force_reg (Pmode, plus_constant ((TRAMP), 32))); \
1113 tmp = memory_address (Pmode, plus_constant ((TRAMP), 24)); \
1114 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1115 gen_rtx_REG (Pmode, 27)); \
1117 /* fdc and fic only use registers for the address to flush, \
1118 they do not accept integer displacements. We align the \
1119 start and end addresses to the beginning of their respective \
1120 cache lines to minimize the number of lines flushed. */ \
1121 tmp = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1122 emit_insn (gen_anddi3 (start_addr, tmp, \
1123 GEN_INT (-MIN_CACHELINE_SIZE))); \
1124 tmp = force_reg (Pmode, \
1125 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
1126 emit_insn (gen_anddi3 (end_addr, tmp, \
1127 GEN_INT (-MIN_CACHELINE_SIZE))); \
1128 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
1129 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
1130 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
1131 gen_reg_rtx (Pmode), \
1132 gen_reg_rtx (Pmode), \
1133 gen_reg_rtx (Pmode))); \
1137 /* Perform any machine-specific adjustment in the address of the trampoline.
1138 ADDR contains the address that was passed to INITIALIZE_TRAMPOLINE.
1139 Adjust the trampoline address to point to the plabel at offset 44. */
1141 #define TRAMPOLINE_ADJUST_ADDRESS(ADDR) \
1142 if (!TARGET_64BIT) (ADDR) = memory_address (Pmode, plus_constant ((ADDR), 46))
1144 /* Implement `va_start' for varargs and stdarg. */
1146 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
1147 hppa_va_start (valist, nextarg)
1149 /* Implement `va_arg'. */
1151 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
1152 hppa_va_arg (valist, type)
1154 /* Addressing modes, and classification of registers for them.
1156 Using autoincrement addressing modes on PA8000 class machines is
1159 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
1160 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
1162 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
1163 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
1165 /* Macros to check register numbers against specific register classes. */
1167 /* These assume that REGNO is a hard or pseudo reg number.
1168 They give nonzero only if REGNO is a hard reg of the suitable class
1169 or a pseudo reg currently allocated to a suitable hard reg.
1170 Since they use reg_renumber, they are safe only once reg_renumber
1171 has been allocated, which happens in local-alloc.c. */
1173 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1174 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1175 #define REGNO_OK_FOR_BASE_P(REGNO) \
1176 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1177 #define REGNO_OK_FOR_FP_P(REGNO) \
1178 (FP_REGNO_P (REGNO) || FP_REGNO_P (reg_renumber[REGNO]))
1180 /* Now macros that check whether X is a register and also,
1181 strictly, whether it is in a specified class.
1183 These macros are specific to the HP-PA, and may be used only
1184 in code for printing assembler insns and in conditions for
1185 define_optimization. */
1187 /* 1 if X is an fp register. */
1189 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
1191 /* Maximum number of registers that can appear in a valid memory address. */
1193 #define MAX_REGS_PER_ADDRESS 2
1195 /* Recognize any constant value that is a valid address except
1196 for symbolic addresses. We get better CSE by rejecting them
1197 here and allowing hppa_legitimize_address to break them up. We
1198 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
1200 #define CONSTANT_ADDRESS_P(X) \
1201 ((GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1202 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
1203 || GET_CODE (X) == HIGH) \
1204 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
1206 /* A C expression that is nonzero if we are using the new HP assembler. */
1208 #ifndef NEW_HP_ASSEMBLER
1209 #define NEW_HP_ASSEMBLER 0
1212 /* The macros below define the immediate range for CONST_INTS on
1213 the 64-bit port. Constants in this range can be loaded in three
1214 instructions using a ldil/ldo/depdi sequence. Constants outside
1215 this range are forced to the constant pool prior to reload. */
1217 #define MAX_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) 32 << 31)
1218 #define MIN_LEGIT_64BIT_CONST_INT ((HOST_WIDE_INT) -32 << 31)
1219 #define LEGITIMATE_64BIT_CONST_INT_P(X) \
1220 ((X) >= MIN_LEGIT_64BIT_CONST_INT && (X) < MAX_LEGIT_64BIT_CONST_INT)
1222 /* A C expression that is nonzero if X is a legitimate constant for an
1225 We include all constant integers and constant doubles, but not
1226 floating-point, except for floating-point zero. We reject LABEL_REFs
1227 if we're not using gas or the new HP assembler.
1229 In 64-bit mode, we reject CONST_DOUBLES. We also reject CONST_INTS
1230 that need more than three instructions to load prior to reload. This
1231 limit is somewhat arbitrary. It takes three instructions to load a
1232 CONST_INT from memory but two are memory accesses. It may be better
1233 to increase the allowed range for CONST_INTS. We may also be able
1234 to handle CONST_DOUBLES. */
1236 #define LEGITIMATE_CONSTANT_P(X) \
1237 ((GET_MODE_CLASS (GET_MODE (X)) != MODE_FLOAT \
1238 || (X) == CONST0_RTX (GET_MODE (X))) \
1239 && (NEW_HP_ASSEMBLER || TARGET_GAS || GET_CODE (X) != LABEL_REF) \
1240 && !(TARGET_64BIT && GET_CODE (X) == CONST_DOUBLE) \
1241 && !(TARGET_64BIT && GET_CODE (X) == CONST_INT \
1242 && !(HOST_BITS_PER_WIDE_INT <= 32 \
1243 || (reload_in_progress || reload_completed) \
1244 || LEGITIMATE_64BIT_CONST_INT_P (INTVAL (X)) \
1245 || cint_ok_for_move (INTVAL (X)))) \
1246 && !function_label_operand (X, VOIDmode))
1248 /* Subroutines for EXTRA_CONSTRAINT.
1250 Return 1 iff OP is a pseudo which did not get a hard register and
1251 we are running the reload pass. */
1252 #define IS_RELOADING_PSEUDO_P(OP) \
1253 ((reload_in_progress \
1254 && GET_CODE (OP) == REG \
1255 && REGNO (OP) >= FIRST_PSEUDO_REGISTER \
1256 && reg_renumber [REGNO (OP)] < 0))
1258 /* Return 1 iff OP is a scaled or unscaled index address. */
1259 #define IS_INDEX_ADDR_P(OP) \
1260 (GET_CODE (OP) == PLUS \
1261 && GET_MODE (OP) == Pmode \
1262 && (GET_CODE (XEXP (OP, 0)) == MULT \
1263 || GET_CODE (XEXP (OP, 1)) == MULT \
1264 || (REG_P (XEXP (OP, 0)) \
1265 && REG_P (XEXP (OP, 1)))))
1267 /* Return 1 iff OP is a LO_SUM DLT address. */
1268 #define IS_LO_SUM_DLT_ADDR_P(OP) \
1269 (GET_CODE (OP) == LO_SUM \
1270 && GET_MODE (OP) == Pmode \
1271 && REG_P (XEXP (OP, 0)) \
1272 && REG_OK_FOR_BASE_P (XEXP (OP, 0)) \
1273 && GET_CODE (XEXP (OP, 1)) == UNSPEC)
1275 /* Optional extra constraints for this machine. Borrowed from sparc.h.
1277 `A' is a LO_SUM DLT memory operand.
1279 `Q' is any memory operand that isn't a symbolic, indexed or lo_sum
1280 memory operand. Note that an unassigned pseudo register is such a
1281 memory operand. Needed because reload will generate these things
1282 and then not re-recognize the insn, causing constrain_operands to
1285 `R' is a scaled/unscaled indexed memory operand.
1287 `S' is the constant 31.
1289 `T' is for fp loads and stores.
1291 `U' is the constant 63. */
1293 #define EXTRA_CONSTRAINT(OP, C) \
1295 (IS_RELOADING_PSEUDO_P (OP) \
1296 || (GET_CODE (OP) == MEM \
1297 && (reload_in_progress \
1298 || memory_address_p (GET_MODE (OP), XEXP (OP, 0))) \
1299 && !symbolic_memory_operand (OP, VOIDmode) \
1300 && !IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0)) \
1301 && !IS_INDEX_ADDR_P (XEXP (OP, 0)))) \
1303 (GET_CODE (OP) == MEM \
1304 && IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0))) \
1306 (GET_CODE (OP) == MEM \
1307 && IS_INDEX_ADDR_P (XEXP (OP, 0))) \
1309 (GET_CODE (OP) == MEM \
1310 && !IS_LO_SUM_DLT_ADDR_P (XEXP (OP, 0)) \
1311 && !IS_INDEX_ADDR_P (XEXP (OP, 0)) \
1312 /* Using DFmode forces only short displacements \
1313 to be recognized as valid in reg+d addresses. \
1314 However, this is not necessary for PA2.0 since \
1315 it has long FP loads/stores. \
1317 FIXME: the ELF32 linker clobbers the LSB of \
1318 the FP register number in {fldw,fstw} insns. \
1319 Thus, we only allow long FP loads/stores on \
1321 && memory_address_p ((TARGET_PA_20 && !TARGET_ELF32 \
1326 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 31) \
1328 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 63) : 0))))))
1331 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1332 and check its validity for a certain class.
1333 We have two alternate definitions for each of them.
1334 The usual definition accepts all pseudo regs; the other rejects
1335 them unless they have been allocated suitable hard regs.
1336 The symbol REG_OK_STRICT causes the latter definition to be used.
1338 Most source files want to accept pseudo regs in the hope that
1339 they will get allocated to the class that the insn wants them to be in.
1340 Source files for reload pass need to be strict.
1341 After reload, it makes no difference, since pseudo regs have
1342 been eliminated by then. */
1344 #ifndef REG_OK_STRICT
1346 /* Nonzero if X is a hard reg that can be used as an index
1347 or if it is a pseudo reg. */
1348 #define REG_OK_FOR_INDEX_P(X) \
1349 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1350 /* Nonzero if X is a hard reg that can be used as a base reg
1351 or if it is a pseudo reg. */
1352 #define REG_OK_FOR_BASE_P(X) \
1353 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1357 /* Nonzero if X is a hard reg that can be used as an index. */
1358 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1359 /* Nonzero if X is a hard reg that can be used as a base reg. */
1360 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1364 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression that is a
1365 valid memory address for an instruction. The MODE argument is the
1366 machine mode for the MEM expression that wants to use this address.
1368 On HP PA-RISC, the legitimate address forms are REG+SMALLINT,
1369 REG+REG, and REG+(REG*SCALE). The indexed address forms are only
1370 available with floating point loads and stores, and integer loads.
1371 We get better code by allowing indexed addresses in the initial
1374 The acceptance of indexed addresses as legitimate implies that we
1375 must provide patterns for doing indexed integer stores, or the move
1376 expanders must force the address of an indexed store to a register.
1377 We have adopted the latter approach.
1379 Another function of GO_IF_LEGITIMATE_ADDRESS is to ensure that
1380 the base register is a valid pointer for indexed instructions.
1381 On targets that have non-equivalent space registers, we have to
1382 know at the time of assembler output which register in a REG+REG
1383 pair is the base register. The REG_POINTER flag is sometimes lost
1384 in reload and the following passes, so it can't be relied on during
1385 code generation. Thus, we either have to canonicalize the order
1386 of the registers in REG+REG indexed addresses, or treat REG+REG
1387 addresses separately and provide patterns for both permutations.
1389 The latter approach requires several hundred additional lines of
1390 code in pa.md. The downside to canonicalizing is that a PLUS
1391 in the wrong order can't combine to form to make a scaled indexed
1392 memory operand. As we won't need to canonicalize the operands if
1393 the REG_POINTER lossage can be fixed, it seems better canonicalize.
1395 We initially break out scaled indexed addresses in canonical order
1396 in emit_move_sequence. LEGITIMIZE_ADDRESS also canonicalizes
1397 scaled indexed addresses during RTL generation. However, fold_rtx
1398 has its own opinion on how the operands of a PLUS should be ordered.
1399 If one of the operands is equivalent to a constant, it will make
1400 that operand the second operand. As the base register is likely to
1401 be equivalent to a SYMBOL_REF, we have made it the second operand.
1403 GO_IF_LEGITIMATE_ADDRESS accepts REG+REG as legitimate when the
1404 operands are in the order INDEX+BASE on targets with non-equivalent
1405 space registers, and in any order on targets with equivalent space
1406 registers. It accepts both MULT+BASE and BASE+MULT for scaled indexing.
1408 We treat a SYMBOL_REF as legitimate if it is part of the current
1409 function's constant-pool, because such addresses can actually be
1410 output as REG+SMALLINT.
1412 Note we only allow 5 bit immediates for access to a constant address;
1413 doing so avoids losing for loading/storing a FP register at an address
1414 which will not fit in 5 bits. */
1416 #define VAL_5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x10 < 0x20)
1417 #define INT_5_BITS(X) VAL_5_BITS_P (INTVAL (X))
1419 #define VAL_U5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) < 0x20)
1420 #define INT_U5_BITS(X) VAL_U5_BITS_P (INTVAL (X))
1422 #define VAL_11_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x400 < 0x800)
1423 #define INT_11_BITS(X) VAL_11_BITS_P (INTVAL (X))
1425 #define VAL_14_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x2000 < 0x4000)
1426 #define INT_14_BITS(X) VAL_14_BITS_P (INTVAL (X))
1428 #if HOST_BITS_PER_WIDE_INT > 32
1429 #define VAL_32_BITS_P(X) \
1430 ((unsigned HOST_WIDE_INT)(X) + ((unsigned HOST_WIDE_INT) 1 << 31) \
1431 < (unsigned HOST_WIDE_INT) 2 << 31)
1433 #define VAL_32_BITS_P(X) 1
1435 #define INT_32_BITS(X) VAL_32_BITS_P (INTVAL (X))
1437 /* These are the modes that we allow for scaled indexing. */
1438 #define MODE_OK_FOR_SCALED_INDEXING_P(MODE) \
1439 ((TARGET_64BIT && (MODE) == DImode) \
1440 || (MODE) == SImode \
1441 || (MODE) == HImode \
1442 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1444 /* These are the modes that we allow for unscaled indexing. */
1445 #define MODE_OK_FOR_UNSCALED_INDEXING_P(MODE) \
1446 ((TARGET_64BIT && (MODE) == DImode) \
1447 || (MODE) == SImode \
1448 || (MODE) == HImode \
1449 || (MODE) == QImode \
1450 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1452 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1454 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1455 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1456 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1457 && REG_P (XEXP (X, 0)) \
1458 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1460 else if (GET_CODE (X) == PLUS) \
1462 rtx base = 0, index = 0; \
1463 if (REG_P (XEXP (X, 1)) \
1464 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1465 base = XEXP (X, 1), index = XEXP (X, 0); \
1466 else if (REG_P (XEXP (X, 0)) \
1467 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1468 base = XEXP (X, 0), index = XEXP (X, 1); \
1470 && GET_CODE (index) == CONST_INT \
1471 && ((INT_14_BITS (index) \
1472 && (TARGET_SOFT_FLOAT \
1474 && ((MODE == SFmode \
1475 && (INTVAL (index) % 4) == 0) \
1476 || (MODE == DFmode \
1477 && (INTVAL (index) % 8) == 0))) \
1478 || ((MODE) != SFmode && (MODE) != DFmode))) \
1479 || INT_5_BITS (index))) \
1481 if (!TARGET_DISABLE_INDEXING \
1482 /* Only accept the "canonical" INDEX+BASE operand order \
1483 on targets with non-equivalent space registers. */ \
1484 && (TARGET_NO_SPACE_REGS \
1485 ? (base && REG_P (index)) \
1486 : (base == XEXP (X, 1) && REG_P (index) \
1487 && REG_POINTER (base) && !REG_POINTER (index))) \
1488 && MODE_OK_FOR_UNSCALED_INDEXING_P (MODE) \
1489 && REG_OK_FOR_INDEX_P (index) \
1490 && borx_reg_operand (base, Pmode) \
1491 && borx_reg_operand (index, Pmode)) \
1493 if (!TARGET_DISABLE_INDEXING \
1495 && GET_CODE (index) == MULT \
1496 && MODE_OK_FOR_SCALED_INDEXING_P (MODE) \
1497 && REG_P (XEXP (index, 0)) \
1498 && GET_MODE (XEXP (index, 0)) == Pmode \
1499 && REG_OK_FOR_INDEX_P (XEXP (index, 0)) \
1500 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1501 && INTVAL (XEXP (index, 1)) \
1502 == (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
1503 && borx_reg_operand (base, Pmode)) \
1506 else if (GET_CODE (X) == LO_SUM \
1507 && GET_CODE (XEXP (X, 0)) == REG \
1508 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1509 && CONSTANT_P (XEXP (X, 1)) \
1510 && (TARGET_SOFT_FLOAT \
1511 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1514 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1515 || ((MODE) != SFmode \
1516 && (MODE) != DFmode))) \
1518 else if (GET_CODE (X) == LO_SUM \
1519 && GET_CODE (XEXP (X, 0)) == SUBREG \
1520 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG \
1521 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0))) \
1522 && CONSTANT_P (XEXP (X, 1)) \
1523 && (TARGET_SOFT_FLOAT \
1524 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1527 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1528 || ((MODE) != SFmode \
1529 && (MODE) != DFmode))) \
1531 else if (GET_CODE (X) == LABEL_REF \
1532 || (GET_CODE (X) == CONST_INT \
1533 && INT_5_BITS (X))) \
1535 /* Needed for -fPIC */ \
1536 else if (GET_CODE (X) == LO_SUM \
1537 && GET_CODE (XEXP (X, 0)) == REG \
1538 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1539 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1540 && (TARGET_SOFT_FLOAT \
1541 || (TARGET_PA_20 && !TARGET_ELF32) \
1542 || ((MODE) != SFmode \
1543 && (MODE) != DFmode))) \
1547 /* Look for machine dependent ways to make the invalid address AD a
1550 For the PA, transform:
1552 memory(X + <large int>)
1556 if (<large int> & mask) >= 16
1557 Y = (<large int> & ~mask) + mask + 1 Round up.
1559 Y = (<large int> & ~mask) Round down.
1561 memory (Z + (<large int> - Y));
1563 This makes reload inheritance and reload_cse work better since Z
1566 There may be more opportunities to improve code with this hook. */
1567 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1569 long offset, newoffset, mask; \
1570 rtx new, temp = NULL_RTX; \
1572 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1573 ? (TARGET_PA_20 && !TARGET_ELF32 ? 0x3fff : 0x1f) : 0x3fff); \
1575 if (optimize && GET_CODE (AD) == PLUS) \
1576 temp = simplify_binary_operation (PLUS, Pmode, \
1577 XEXP (AD, 0), XEXP (AD, 1)); \
1579 new = temp ? temp : AD; \
1582 && GET_CODE (new) == PLUS \
1583 && GET_CODE (XEXP (new, 0)) == REG \
1584 && GET_CODE (XEXP (new, 1)) == CONST_INT) \
1586 offset = INTVAL (XEXP ((new), 1)); \
1588 /* Choose rounding direction. Round up if we are >= halfway. */ \
1589 if ((offset & mask) >= ((mask + 1) / 2)) \
1590 newoffset = (offset & ~mask) + mask + 1; \
1592 newoffset = offset & ~mask; \
1594 if (newoffset != 0 && VAL_14_BITS_P (newoffset)) \
1596 temp = gen_rtx_PLUS (Pmode, XEXP (new, 0), \
1597 GEN_INT (newoffset)); \
1598 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1599 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1600 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1610 /* Try machine-dependent ways of modifying an illegitimate address
1611 to be legitimate. If we find one, return the new, valid address.
1612 This macro is used in only one place: `memory_address' in explow.c.
1614 OLDX is the address as it was before break_out_memory_refs was called.
1615 In some cases it is useful to look at this to decide what needs to be done.
1617 MODE and WIN are passed so that this macro can use
1618 GO_IF_LEGITIMATE_ADDRESS.
1620 It is always safe for this macro to do nothing. It exists to recognize
1621 opportunities to optimize the output. */
1623 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1624 { rtx orig_x = (X); \
1625 (X) = hppa_legitimize_address (X, OLDX, MODE); \
1626 if ((X) != orig_x && memory_address_p (MODE, X)) \
1629 /* Go to LABEL if ADDR (a legitimate address expression)
1630 has an effect that depends on the machine mode it is used for. */
1632 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1633 if (GET_CODE (ADDR) == PRE_DEC \
1634 || GET_CODE (ADDR) == POST_DEC \
1635 || GET_CODE (ADDR) == PRE_INC \
1636 || GET_CODE (ADDR) == POST_INC) \
1639 #define TARGET_ASM_SELECT_SECTION pa_select_section
1641 /* Return a nonzero value if DECL has a section attribute. */
1642 #define IN_NAMED_SECTION_P(DECL) \
1643 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
1644 && DECL_SECTION_NAME (DECL) != NULL_TREE)
1646 /* Define this macro if references to a symbol must be treated
1647 differently depending on something about the variable or
1648 function named by the symbol (such as what section it is in).
1650 The macro definition, if any, is executed immediately after the
1651 rtl for DECL or other node is created.
1652 The value of the rtl will be a `mem' whose address is a
1655 The usual thing for this macro to do is to a flag in the
1656 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1657 name string in the `symbol_ref' (if one bit is not enough
1660 On the HP-PA we use this to indicate if a symbol is in text or
1661 data space. Also, function labels need special treatment. */
1663 #define TEXT_SPACE_P(DECL)\
1664 (TREE_CODE (DECL) == FUNCTION_DECL \
1665 || (TREE_CODE (DECL) == VAR_DECL \
1666 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1667 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1669 || (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'c' \
1670 && !(TREE_CODE (DECL) == STRING_CST && flag_writable_strings)))
1672 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1674 /* Specify the machine mode that this machine uses for the index in the
1675 tablejump instruction. For small tables, an element consists of a
1676 ia-relative branch and its delay slot. When -mbig-switch is specified,
1677 we use a 32-bit absolute address for non-pic code, and a 32-bit offset
1678 for both 32 and 64-bit pic code. */
1679 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? SImode : DImode)
1681 /* Jump tables must be 32-bit aligned, no matter the size of the element. */
1682 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1684 /* Define this as 1 if `char' should by default be signed; else as 0. */
1685 #define DEFAULT_SIGNED_CHAR 1
1687 /* Max number of bytes we can move from memory to memory
1688 in one reasonably fast instruction. */
1691 /* Higher than the default as we prefer to use simple move insns
1692 (better scheduling and delay slot filling) and because our
1693 built-in block move is really a 2X unrolled loop.
1695 Believe it or not, this has to be big enough to allow for copying all
1696 arguments passed in registers to avoid infinite recursion during argument
1697 setup for a function call. Why? Consider how we copy the stack slots
1698 reserved for parameters when they may be trashed by a call. */
1699 #define MOVE_RATIO (TARGET_64BIT ? 8 : 4)
1701 /* Define if operations between registers always perform the operation
1702 on the full register even if a narrower mode is specified. */
1703 #define WORD_REGISTER_OPERATIONS
1705 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1706 will either zero-extend or sign-extend. The value of this macro should
1707 be the code that says which one of the two operations is implicitly
1708 done, NIL if none. */
1709 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1711 /* Nonzero if access to memory by bytes is slow and undesirable. */
1712 #define SLOW_BYTE_ACCESS 1
1714 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1715 is done just by pretending it is already truncated. */
1716 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1718 /* Specify the machine mode that pointers have.
1719 After generation of rtl, the compiler makes no further distinction
1720 between pointers and any other objects of this machine mode. */
1721 #define Pmode word_mode
1723 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1724 return the mode to be used for the comparison. For floating-point, CCFPmode
1725 should be used. CC_NOOVmode should be used when the first operand is a
1726 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1728 #define SELECT_CC_MODE(OP,X,Y) \
1729 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1731 /* A function address in a call instruction
1732 is a byte address (for indexing purposes)
1733 so give the MEM rtx a byte's mode. */
1734 #define FUNCTION_MODE SImode
1736 /* Define this if addresses of constant functions
1737 shouldn't be put through pseudo regs where they can be cse'd.
1738 Desirable on machines where ordinary constants are expensive
1739 but a CALL with constant address is cheap. */
1740 #define NO_FUNCTION_CSE
1742 /* Define this to be nonzero if shift instructions ignore all but the low-order
1744 #define SHIFT_COUNT_TRUNCATED 1
1746 /* Compute extra cost of moving data between one register class
1749 Make moves from SAR so expensive they should never happen. We used to
1750 have 0xffff here, but that generates overflow in rare cases.
1752 Copies involving a FP register and a non-FP register are relatively
1753 expensive because they must go through memory.
1755 Other copies are reasonably cheap. */
1756 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1757 (CLASS1 == SHIFT_REGS ? 0x100 \
1758 : FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16 \
1759 : FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16 \
1762 /* Adjust the cost of branches. */
1763 #define BRANCH_COST (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1765 /* Handling the special cases is going to get too complicated for a macro,
1766 just call `pa_adjust_insn_length' to do the real work. */
1767 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1768 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1770 /* Millicode insns are actually function calls with some special
1771 constraints on arguments and register usage.
1773 Millicode calls always expect their arguments in the integer argument
1774 registers, and always return their result in %r29 (ret1). They
1775 are expected to clobber their arguments, %r1, %r29, and the return
1776 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1778 This macro tells reorg that the references to arguments and
1779 millicode calls do not appear to happen until after the millicode call.
1780 This allows reorg to put insns which set the argument registers into the
1781 delay slot of the millicode call -- thus they act more like traditional
1784 Note we can not consider side effects of the insn to be delayed because
1785 the branch and link insn will clobber the return pointer. If we happened
1786 to use the return pointer in the delay slot of the call, then we lose.
1788 get_attr_type will try to recognize the given insn, so make sure to
1789 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1791 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1794 /* Control the assembler format that we output. */
1796 /* A C string constant describing how to begin a comment in the target
1797 assembler language. The compiler assumes that the comment will end at
1798 the end of the line. */
1800 #define ASM_COMMENT_START ";"
1802 /* Output to assembler file text saying following lines
1803 may contain character constants, extra white space, comments, etc. */
1805 #define ASM_APP_ON ""
1807 /* Output to assembler file text saying following lines
1808 no longer contain unusual constructs. */
1810 #define ASM_APP_OFF ""
1812 /* This is how to output the definition of a user-level label named NAME,
1813 such as the label on a static function or variable NAME. */
1815 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1816 do { assemble_name (FILE, NAME); \
1817 fputc ('\n', FILE); } while (0)
1819 /* This is how to output a reference to a user-level label named NAME.
1820 `assemble_name' uses this. */
1822 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1824 const char *xname = (NAME); \
1825 if (FUNCTION_NAME_P (NAME)) \
1827 if (xname[0] == '*') \
1830 fputs (user_label_prefix, FILE); \
1831 fputs (xname, FILE); \
1834 /* This is how to store into the string LABEL
1835 the symbol_ref name of an internal numbered label where
1836 PREFIX is the class of label and NUM is the number within the class.
1837 This is suitable for output with `assemble_name'. */
1839 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1840 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1842 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1844 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1845 output_ascii ((FILE), (P), (SIZE))
1847 /* Jump tables are always placed in the text section. Technically, it
1848 is possible to put them in the readonly data section when -mbig-switch
1849 is specified. This has the benefit of getting the table out of .text
1850 and reducing branch lengths as a result. The downside is that an
1851 additional insn (addil) is needed to access the table when generating
1852 PIC code. The address difference table also has to use 32-bit
1853 pc-relative relocations. Currently, GAS does not support these
1854 relocations, although it is easily modified to do this operation.
1855 The table entries need to look like "$L1+(.+8-$L0)-$PIC_pcrel$0"
1856 when using ELF GAS. A simple difference can be used when using
1857 SOM GAS or the HP assembler. The final downside is GDB complains
1858 about the nesting of the label for the table when debugging. */
1860 #define JUMP_TABLES_IN_TEXT_SECTION 1
1862 /* This is how to output an element of a case-vector that is absolute. */
1864 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1865 if (TARGET_BIG_SWITCH) \
1866 fprintf (FILE, "\t.word L$%04d\n", VALUE); \
1868 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1870 /* This is how to output an element of a case-vector that is relative.
1871 Since we always place jump tables in the text section, the difference
1872 is absolute and requires no relocation. */
1874 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1875 if (TARGET_BIG_SWITCH) \
1876 fprintf (FILE, "\t.word L$%04d-L$%04d\n", VALUE, REL); \
1878 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1880 /* This is how to output an assembler line that says to advance the
1881 location counter to a multiple of 2**LOG bytes. */
1883 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1884 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1886 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1887 fprintf (FILE, "\t.blockz "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1888 (unsigned HOST_WIDE_INT)(SIZE))
1890 /* This says how to output an assembler line to define a global common symbol
1891 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1893 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGNED) \
1895 assemble_name ((FILE), (NAME)); \
1896 fprintf ((FILE), "\t.comm "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1897 MAX ((unsigned HOST_WIDE_INT)(SIZE), \
1898 ((unsigned HOST_WIDE_INT)(ALIGNED) / BITS_PER_UNIT)));}
1900 /* This says how to output an assembler line to define a local common symbol
1901 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1903 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGNED) \
1905 fprintf ((FILE), "\t.align %d\n", ((ALIGNED) / BITS_PER_UNIT)); \
1906 assemble_name ((FILE), (NAME)); \
1907 fprintf ((FILE), "\n\t.block "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1908 (unsigned HOST_WIDE_INT)(SIZE));}
1910 #define ASM_PN_FORMAT "%s___%lu"
1912 /* All HP assemblers use "!" to separate logical lines. */
1913 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == '!')
1915 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
1916 ((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
1918 /* Print operand X (an rtx) in assembler syntax to file FILE.
1919 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1920 For `%' followed by punctuation, CODE is the punctuation and X is null.
1922 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1923 and an immediate zero should be represented as `r0'.
1925 Several % codes are defined:
1927 C compare conditions
1928 N extract conditions
1929 M modifier to handle preincrement addressing for memory refs.
1930 F modifier to handle preincrement addressing for fp memory refs */
1932 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1935 /* Print a memory address as an operand to reference that memory location. */
1937 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1938 { register rtx addr = ADDR; \
1939 register rtx base; \
1941 switch (GET_CODE (addr)) \
1944 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1947 if (GET_CODE (XEXP (addr, 0)) == CONST_INT) \
1948 offset = INTVAL (XEXP (addr, 0)), base = XEXP (addr, 1); \
1949 else if (GET_CODE (XEXP (addr, 1)) == CONST_INT) \
1950 offset = INTVAL (XEXP (addr, 1)), base = XEXP (addr, 0); \
1953 fprintf (FILE, "%d(%s)", offset, reg_names [REGNO (base)]); \
1956 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1957 fputs ("R'", FILE); \
1958 else if (flag_pic == 0) \
1959 fputs ("RR'", FILE); \
1961 fputs ("RT'", FILE); \
1962 output_global_address (FILE, XEXP (addr, 1), 0); \
1963 fputs ("(", FILE); \
1964 output_operand (XEXP (addr, 0), 0); \
1965 fputs (")", FILE); \
1968 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC "(%%r0)", INTVAL (addr)); \
1971 output_addr_const (FILE, addr); \
1975 /* Find the return address associated with the frame given by
1977 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1978 (return_addr_rtx (COUNT, FRAMEADDR))
1980 /* Used to mask out junk bits from the return address, such as
1981 processor state, interrupt status, condition codes and the like. */
1982 #define MASK_RETURN_ADDR \
1983 /* The privilege level is in the two low order bits, mask em out \
1984 of the return address. */ \
1987 /* The number of Pmode words for the setjmp buffer. */
1988 #define JMP_BUF_SIZE 50
1990 #define PREDICATE_CODES \
1991 {"reg_or_0_operand", {SUBREG, REG, CONST_INT, CONST_DOUBLE}}, \
1992 {"call_operand_address", {LABEL_REF, SYMBOL_REF, CONST_INT, \
1993 CONST_DOUBLE, CONST, HIGH, CONSTANT_P_RTX}}, \
1994 {"indexed_memory_operand", {SUBREG, MEM}}, \
1995 {"symbolic_operand", {SYMBOL_REF, LABEL_REF, CONST}}, \
1996 {"symbolic_memory_operand", {SUBREG, MEM}}, \
1997 {"reg_before_reload_operand", {REG, MEM}}, \
1998 {"reg_or_0_or_nonsymb_mem_operand", {SUBREG, REG, MEM, CONST_INT, \
2000 {"move_dest_operand", {SUBREG, REG, MEM}}, \
2001 {"move_src_operand", {SUBREG, REG, CONSTANT_P_RTX, CONST_INT, MEM}}, \
2002 {"reg_or_cint_move_operand", {SUBREG, REG, CONST_INT}}, \
2003 {"pic_label_operand", {LABEL_REF, CONST}}, \
2004 {"fp_reg_operand", {REG}}, \
2005 {"arith_operand", {SUBREG, REG, CONST_INT}}, \
2006 {"arith11_operand", {SUBREG, REG, CONST_INT}}, \
2007 {"pre_cint_operand", {CONST_INT}}, \
2008 {"post_cint_operand", {CONST_INT}}, \
2009 {"arith_double_operand", {SUBREG, REG, CONST_DOUBLE}}, \
2010 {"ireg_or_int5_operand", {CONST_INT, REG}}, \
2011 {"int5_operand", {CONST_INT}}, \
2012 {"uint5_operand", {CONST_INT}}, \
2013 {"int11_operand", {CONST_INT}}, \
2014 {"uint32_operand", {CONST_INT, \
2015 HOST_BITS_PER_WIDE_INT > 32 ? 0 : CONST_DOUBLE}}, \
2016 {"arith5_operand", {SUBREG, REG, CONST_INT}}, \
2017 {"and_operand", {SUBREG, REG, CONST_INT}}, \
2018 {"ior_operand", {CONST_INT}}, \
2019 {"lhs_lshift_cint_operand", {CONST_INT}}, \
2020 {"lhs_lshift_operand", {SUBREG, REG, CONST_INT}}, \
2021 {"arith32_operand", {SUBREG, REG, CONST_INT}}, \
2022 {"pc_or_label_operand", {PC, LABEL_REF}}, \
2023 {"plus_xor_ior_operator", {PLUS, XOR, IOR}}, \
2024 {"shadd_operand", {CONST_INT}}, \
2025 {"div_operand", {REG, CONST_INT}}, \
2026 {"ireg_operand", {REG}}, \
2027 {"cmpib_comparison_operator", {EQ, NE, LT, LE, LEU, \
2029 {"movb_comparison_operator", {EQ, NE, LT, GE}},
2031 /* We need a libcall to canonicalize function pointers on TARGET_ELF32. */
2032 #define CANONICALIZE_FUNCPTR_FOR_COMPARE_LIBCALL \
2033 "__canonicalize_funcptr_for_compare"
OSDN Git Service
