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 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 GNU CC.
10 GNU CC 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 GNU CC 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 GNU CC; 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 arbritrary 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 /* Macro to define tables used to set the flags. This is a
210 list in braces of target switches with each switch being
211 { "NAME", VALUE, "HELP_STRING" }. VALUE is the bits to set,
212 or minus the bits to clear. An empty string NAME is used to
213 identify the default VALUE. Do not mark empty strings for
216 #define TARGET_SWITCHES \
217 {{ "snake", MASK_PA_11, \
218 N_("Generate PA1.1 code") }, \
219 { "nosnake", -(MASK_PA_11 | MASK_PA_20), \
220 N_("Generate PA1.0 code") }, \
221 { "pa-risc-1-0", -(MASK_PA_11 | MASK_PA_20), \
222 N_("Generate PA1.0 code") }, \
223 { "pa-risc-1-1", MASK_PA_11, \
224 N_("Generate PA1.1 code") }, \
225 { "pa-risc-2-0", MASK_PA_20, \
226 N_("Generate PA2.0 code (requires binutils 2.10 or later)") }, \
227 { "disable-fpregs", MASK_DISABLE_FPREGS, \
228 N_("Disable FP regs") }, \
229 { "no-disable-fpregs", -MASK_DISABLE_FPREGS, \
230 N_("Do not disable FP regs") }, \
231 { "no-space-regs", MASK_NO_SPACE_REGS, \
232 N_("Disable space regs") }, \
233 { "space-regs", -MASK_NO_SPACE_REGS, \
234 N_("Do not disable space regs") }, \
235 { "jump-in-delay", MASK_JUMP_IN_DELAY, \
236 N_("Put jumps in call delay slots") }, \
237 { "no-jump-in-delay", -MASK_JUMP_IN_DELAY, \
238 N_("Do not put jumps in call delay slots") }, \
239 { "disable-indexing", MASK_DISABLE_INDEXING, \
240 N_("Disable indexed addressing") }, \
241 { "no-disable-indexing", -MASK_DISABLE_INDEXING, \
242 N_("Do not disable indexed addressing") }, \
243 { "portable-runtime", MASK_PORTABLE_RUNTIME, \
244 N_("Use portable calling conventions") }, \
245 { "no-portable-runtime", -MASK_PORTABLE_RUNTIME, \
246 N_("Do not use portable calling conventions") }, \
248 N_("Assume code will be assembled by GAS") }, \
249 { "no-gas", -MASK_GAS, \
250 N_("Do not assume code will be assembled by GAS") }, \
251 { "soft-float", MASK_SOFT_FLOAT, \
252 N_("Use software floating point") }, \
253 { "no-soft-float", -MASK_SOFT_FLOAT, \
254 N_("Do not use software floating point") }, \
255 { "long-load-store", MASK_LONG_LOAD_STORE, \
256 N_("Emit long load/store sequences") }, \
257 { "no-long-load-store", -MASK_LONG_LOAD_STORE, \
258 N_("Do not emit long load/store sequences") }, \
259 { "fast-indirect-calls", MASK_FAST_INDIRECT_CALLS, \
260 N_("Generate fast indirect calls") }, \
261 { "no-fast-indirect-calls", -MASK_FAST_INDIRECT_CALLS, \
262 N_("Do not generate fast indirect calls") }, \
263 { "big-switch", MASK_BIG_SWITCH, \
264 N_("Generate code for huge switch statements") }, \
265 { "no-big-switch", -MASK_BIG_SWITCH, \
266 N_("Do not generate code for huge switch statements") }, \
267 { "long-calls", MASK_LONG_CALLS, \
268 N_("Always generate long calls") }, \
269 { "no-long-calls", -MASK_LONG_CALLS, \
270 N_("Generate long calls only when needed") }, \
272 N_("Enable linker optimizations") }, \
274 { "", TARGET_DEFAULT | TARGET_CPU_DEFAULT, \
277 #ifndef TARGET_DEFAULT
278 #define TARGET_DEFAULT (MASK_GAS | MASK_JUMP_IN_DELAY)
281 #ifndef TARGET_CPU_DEFAULT
282 #define TARGET_CPU_DEFAULT 0
285 #ifndef SUBTARGET_SWITCHES
286 #define SUBTARGET_SWITCHES
289 #ifndef TARGET_SCHED_DEFAULT
290 #define TARGET_SCHED_DEFAULT "8000"
293 #define TARGET_OPTIONS \
295 { "schedule=", &pa_cpu_string, \
296 N_("Specify CPU for scheduling purposes") }, \
297 { "arch=", &pa_arch_string, \
298 N_("Specify architecture for code generation. Values are 1.0, 1.1, and 2.0. 2.0 requires gas snapshot 19990413 or later.") }\
301 /* Specify the dialect of assembler to use. New mnemonics is dialect one
302 and the old mnemonics are dialect zero. */
303 #define ASSEMBLER_DIALECT (TARGET_PA_20 ? 1 : 0)
305 #define OVERRIDE_OPTIONS override_options ()
307 /* stabs-in-som is nearly identical to stabs-in-elf. To avoid useless
308 code duplication we simply include this file and override as needed. */
311 /* We do not have to be compatible with dbx, so we enable gdb extensions
313 #define DEFAULT_GDB_EXTENSIONS 1
315 /* This used to be zero (no max length), but big enums and such can
316 cause huge strings which killed gas.
318 We also have to avoid lossage in dbxout.c -- it does not compute the
319 string size accurately, so we are real conservative here. */
320 #undef DBX_CONTIN_LENGTH
321 #define DBX_CONTIN_LENGTH 3000
323 /* Only labels should ever begin in column zero. */
324 #define ASM_STABS_OP "\t.stabs\t"
325 #define ASM_STABN_OP "\t.stabn\t"
327 /* GDB always assumes the current function's frame begins at the value
328 of the stack pointer upon entry to the current function. Accessing
329 local variables and parameters passed on the stack is done using the
330 base of the frame + an offset provided by GCC.
332 For functions which have frame pointers this method works fine;
333 the (frame pointer) == (stack pointer at function entry) and GCC provides
334 an offset relative to the frame pointer.
336 This loses for functions without a frame pointer; GCC provides an offset
337 which is relative to the stack pointer after adjusting for the function's
338 frame size. GDB would prefer the offset to be relative to the value of
339 the stack pointer at the function's entry. Yuk! */
340 #define DEBUGGER_AUTO_OFFSET(X) \
341 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
342 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
344 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
345 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
346 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
348 #define TARGET_CPU_CPP_BUILTINS() \
350 builtin_assert("cpu=hppa"); \
351 builtin_assert("machine=hppa"); \
352 builtin_define("__hppa"); \
353 builtin_define("__hppa__"); \
356 builtin_define("_LP64"); \
357 builtin_define("__LP64__"); \
360 builtin_define("_PA_RISC2_0"); \
361 else if (TARGET_PA_11) \
362 builtin_define("_PA_RISC1_1"); \
364 builtin_define("_PA_RISC1_0"); \
367 /* An old set of OS defines for various BSD-like systems. */
368 #define TARGET_OS_CPP_BUILTINS() \
371 builtin_define_std ("REVARGV"); \
372 builtin_define_std ("hp800"); \
373 builtin_define_std ("hp9000"); \
374 builtin_define_std ("hp9k8"); \
375 if (c_language != clk_cplusplus \
377 builtin_define ("hppa"); \
378 builtin_define_std ("spectrum"); \
379 builtin_define_std ("unix"); \
380 builtin_assert ("system=bsd"); \
381 builtin_assert ("system=unix"); \
385 #define CC1_SPEC "%{pg:} %{p:}"
387 #define LINK_SPEC "%{mlinker-opt:-O} %{!shared:-u main} %{shared:-b}"
389 /* We don't want -lg. */
391 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
394 /* This macro defines command-line switches that modify the default
397 The definition is be an initializer for an array of structures. Each
398 array element has have three elements: the switch name, one of the
399 enumeration codes ADD or DELETE to indicate whether the string should be
400 inserted or deleted, and the string to be inserted or deleted. */
401 #define MODIFY_TARGET_NAME {{"-32", DELETE, "64"}, {"-64", ADD, "64"}}
403 /* Make gcc agree with <machine/ansi.h> */
405 #define SIZE_TYPE "unsigned int"
406 #define PTRDIFF_TYPE "int"
407 #define WCHAR_TYPE "unsigned int"
408 #define WCHAR_TYPE_SIZE 32
410 /* Show we can debug even without a frame pointer. */
411 #define CAN_DEBUG_WITHOUT_FP
413 /* Machine dependent reorg pass. */
414 #define MACHINE_DEPENDENT_REORG(X) pa_reorg(X)
417 /* target machine storage layout */
419 /* Define this macro if it is advisable to hold scalars in registers
420 in a wider mode than that declared by the program. In such cases,
421 the value is constrained to be within the bounds of the declared
422 type, but kept valid in the wider mode. The signedness of the
423 extension may differ from that of the type. */
425 #define PROMOTE_MODE(MODE,UNSIGNEDP,TYPE) \
426 if (GET_MODE_CLASS (MODE) == MODE_INT \
427 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
430 /* Define this if most significant bit is lowest numbered
431 in instructions that operate on numbered bit-fields. */
432 #define BITS_BIG_ENDIAN 1
434 /* Define this if most significant byte of a word is the lowest numbered. */
435 /* That is true on the HP-PA. */
436 #define BYTES_BIG_ENDIAN 1
438 /* Define this if most significant word of a multiword number is lowest
440 #define WORDS_BIG_ENDIAN 1
442 #define MAX_BITS_PER_WORD 64
443 #define MAX_LONG_TYPE_SIZE 32
445 /* Width of a word, in units (bytes). */
446 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
447 #define MIN_UNITS_PER_WORD 4
449 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
450 #define PARM_BOUNDARY BITS_PER_WORD
452 /* Largest alignment required for any stack parameter, in bits.
453 Don't define this if it is equal to PARM_BOUNDARY */
454 #define MAX_PARM_BOUNDARY (2 * PARM_BOUNDARY)
456 /* Boundary (in *bits*) on which stack pointer is always aligned;
457 certain optimizations in combine depend on this.
459 GCC for the PA always rounds its stacks to a 512bit boundary,
460 but that happens late in the compilation process. */
461 #define STACK_BOUNDARY (TARGET_64BIT ? 128 : 64)
463 #define PREFERRED_STACK_BOUNDARY 512
465 /* Allocation boundary (in *bits*) for the code of a function. */
466 #define FUNCTION_BOUNDARY (TARGET_64BIT ? 64 : 32)
468 /* Alignment of field after `int : 0' in a structure. */
469 #define EMPTY_FIELD_BOUNDARY 32
471 /* Every structure's size must be a multiple of this. */
472 #define STRUCTURE_SIZE_BOUNDARY 8
474 /* A bit-field declared as `int' forces `int' alignment for the struct. */
475 #define PCC_BITFIELD_TYPE_MATTERS 1
477 /* No data type wants to be aligned rounder than this. This is set
478 to 128 bits to allow for lock semaphores in the stack frame.*/
479 #define BIGGEST_ALIGNMENT 128
481 /* Get around hp-ux assembler bug, and make strcpy of constants fast. */
482 #define CONSTANT_ALIGNMENT(CODE, TYPEALIGN) \
483 ((TYPEALIGN) < 32 ? 32 : (TYPEALIGN))
485 /* Make arrays of chars word-aligned for the same reasons. */
486 #define DATA_ALIGNMENT(TYPE, ALIGN) \
487 (TREE_CODE (TYPE) == ARRAY_TYPE \
488 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
489 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
492 /* Set this nonzero if move instructions will actually fail to work
493 when given unaligned data. */
494 #define STRICT_ALIGNMENT 1
496 /* Generate calls to memcpy, memcmp and memset. */
497 #define TARGET_MEM_FUNCTIONS
499 /* Value is 1 if it is a good idea to tie two pseudo registers
500 when one has mode MODE1 and one has mode MODE2.
501 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
502 for any hard reg, then this must be 0 for correct output. */
503 #define MODES_TIEABLE_P(MODE1, MODE2) \
504 (GET_MODE_CLASS (MODE1) == GET_MODE_CLASS (MODE2))
506 /* Specify the registers used for certain standard purposes.
507 The values of these macros are register numbers. */
509 /* The HP-PA pc isn't overloaded on a register that the compiler knows about. */
510 /* #define PC_REGNUM */
512 /* Register to use for pushing function arguments. */
513 #define STACK_POINTER_REGNUM 30
515 /* Base register for access to local variables of the function. */
516 #define FRAME_POINTER_REGNUM 3
518 /* Value should be nonzero if functions must have frame pointers. */
519 #define FRAME_POINTER_REQUIRED \
520 (current_function_calls_alloca)
522 /* C statement to store the difference between the frame pointer
523 and the stack pointer values immediately after the function prologue.
525 Note, we always pretend that this is a leaf function because if
526 it's not, there's no point in trying to eliminate the
527 frame pointer. If it is a leaf function, we guessed right! */
528 #define INITIAL_FRAME_POINTER_OFFSET(VAR) \
529 do {(VAR) = - compute_frame_size (get_frame_size (), 0);} while (0)
531 /* Base register for access to arguments of the function. */
532 #define ARG_POINTER_REGNUM 3
534 /* Register in which static-chain is passed to a function. */
535 #define STATIC_CHAIN_REGNUM 29
537 /* Register which holds offset table for position-independent
540 #define PIC_OFFSET_TABLE_REGNUM (TARGET_64BIT ? 27 : 19)
541 #define PIC_OFFSET_TABLE_REG_CALL_CLOBBERED 1
543 /* Function to return the rtx used to save the pic offset table register
544 across function calls. */
545 extern struct rtx_def *hppa_pic_save_rtx PARAMS ((void));
547 #define DEFAULT_PCC_STRUCT_RETURN 0
549 /* SOM ABI says that objects larger than 64 bits are returned in memory.
550 PA64 ABI says that objects larger than 128 bits are returned in memory.
551 Note, int_size_in_bytes can return -1 if the size of the object is
552 variable or larger than the maximum value that can be expressed as
553 a HOST_WIDE_INT. It can also return zero for an empty type. The
554 simplest way to handle variable and empty types is to pass them in
555 memory. This avoids problems in defining the boundaries of argument
556 slots, allocating registers, etc. */
557 #define RETURN_IN_MEMORY(TYPE) \
558 (int_size_in_bytes (TYPE) > (TARGET_64BIT ? 16 : 8) \
559 || int_size_in_bytes (TYPE) <= 0)
561 /* Register in which address to store a structure value
562 is passed to a function. */
563 #define STRUCT_VALUE_REGNUM 28
565 /* Describe how we implement __builtin_eh_return. */
566 #define EH_RETURN_DATA_REGNO(N) \
567 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
568 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
569 #define EH_RETURN_HANDLER_RTX \
570 gen_rtx_MEM (word_mode, \
571 gen_rtx_PLUS (word_mode, frame_pointer_rtx, \
572 TARGET_64BIT ? GEN_INT (-16) : GEN_INT (-20)))
575 /* Offset from the argument pointer register value to the top of
576 stack. This is different from FIRST_PARM_OFFSET because of the
578 #define ARG_POINTER_CFA_OFFSET(FNDECL) 0
580 /* The letters I, J, K, L and M in a register constraint string
581 can be used to stand for particular ranges of immediate operands.
582 This macro defines what the ranges are.
583 C is the letter, and VALUE is a constant value.
584 Return 1 if VALUE is in the range specified by C.
586 `I' is used for the 11 bit constants.
587 `J' is used for the 14 bit constants.
588 `K' is used for values that can be moved with a zdepi insn.
589 `L' is used for the 5 bit constants.
591 `N' is used for values with the least significant 11 bits equal to zero
592 and when sign extended from 32 to 64 bits the
593 value does not change.
594 `O' is used for numbers n such that n+1 is a power of 2.
597 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
598 ((C) == 'I' ? VAL_11_BITS_P (VALUE) \
599 : (C) == 'J' ? VAL_14_BITS_P (VALUE) \
600 : (C) == 'K' ? zdepi_cint_p (VALUE) \
601 : (C) == 'L' ? VAL_5_BITS_P (VALUE) \
602 : (C) == 'M' ? (VALUE) == 0 \
603 : (C) == 'N' ? (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) == 0 \
604 || (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) \
605 == (HOST_WIDE_INT) -1 << 31)) \
606 : (C) == 'O' ? (((VALUE) & ((VALUE) + 1)) == 0) \
607 : (C) == 'P' ? and_mask_p (VALUE) \
610 /* Similar, but for floating or large integer constants, and defining letters
611 G and H. Here VALUE is the CONST_DOUBLE rtx itself.
613 For PA, `G' is the floating-point constant zero. `H' is undefined. */
615 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
616 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
617 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) \
620 /* The class value for index registers, and the one for base regs. */
621 #define INDEX_REG_CLASS GENERAL_REGS
622 #define BASE_REG_CLASS GENERAL_REGS
624 #define FP_REG_CLASS_P(CLASS) \
625 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
627 /* True if register is floating-point. */
628 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
630 /* Given an rtx X being reloaded into a reg required to be
631 in class CLASS, return the class of reg to actually use.
632 In general this is just CLASS; but on some machines
633 in some cases it is preferable to use a more restrictive class. */
634 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
636 /* Return the register class of a scratch register needed to copy IN into
637 or out of a register in CLASS in MODE. If it can be done directly
640 Avoid doing any work for the common case calls. */
642 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
643 ((CLASS == BASE_REG_CLASS && GET_CODE (IN) == REG \
644 && REGNO (IN) < FIRST_PSEUDO_REGISTER) \
645 ? NO_REGS : secondary_reload_class (CLASS, MODE, IN))
647 /* On the PA it is not possible to directly move data between
648 GENERAL_REGS and FP_REGS. */
649 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
650 (FP_REG_CLASS_P (CLASS1) != FP_REG_CLASS_P (CLASS2))
652 /* Return the stack location to use for secondary memory needed reloads. */
653 #define SECONDARY_MEMORY_NEEDED_RTX(MODE) \
654 gen_rtx_MEM (MODE, gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (-16)))
657 /* Stack layout; function entry, exit and calling. */
659 /* Define this if pushing a word on the stack
660 makes the stack pointer a smaller address. */
661 /* #define STACK_GROWS_DOWNWARD */
663 /* Believe it or not. */
664 #define ARGS_GROW_DOWNWARD
666 /* Define this if the nominal address of the stack frame
667 is at the high-address end of the local variables;
668 that is, each additional local variable allocated
669 goes at a more negative offset in the frame. */
670 /* #define FRAME_GROWS_DOWNWARD */
672 /* Offset within stack frame to start allocating local variables at.
673 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
674 first local allocated. Otherwise, it is the offset to the BEGINNING
675 of the first local allocated. */
676 #define STARTING_FRAME_OFFSET 8
678 /* If we generate an insn to push BYTES bytes,
679 this says how many the stack pointer really advances by.
680 On the HP-PA, don't define this because there are no push insns. */
681 /* #define PUSH_ROUNDING(BYTES) */
683 /* Offset of first parameter from the argument pointer register value.
684 This value will be negated because the arguments grow down.
685 Also note that on STACK_GROWS_UPWARD machines (such as this one)
686 this is the distance from the frame pointer to the end of the first
687 argument, not it's beginning. To get the real offset of the first
688 argument, the size of the argument must be added. */
690 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
692 /* When a parameter is passed in a register, stack space is still
694 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
696 /* Define this if the above stack space is to be considered part of the
697 space allocated by the caller. */
698 #define OUTGOING_REG_PARM_STACK_SPACE
700 /* Keep the stack pointer constant throughout the function.
701 This is both an optimization and a necessity: longjmp
702 doesn't behave itself when the stack pointer moves within
704 #define ACCUMULATE_OUTGOING_ARGS 1
706 /* The weird HPPA calling conventions require a minimum of 48 bytes on
707 the stack: 16 bytes for register saves, and 32 bytes for magic.
708 This is the difference between the logical top of stack and the
710 #define STACK_POINTER_OFFSET \
711 (TARGET_64BIT ? -(current_function_outgoing_args_size + 16): -32)
713 #define STACK_DYNAMIC_OFFSET(FNDECL) \
715 ? (STACK_POINTER_OFFSET) \
716 : ((STACK_POINTER_OFFSET) - current_function_outgoing_args_size))
718 /* Value is 1 if returning from a function call automatically
719 pops the arguments described by the number-of-args field in the call.
720 FUNDECL is the declaration node of the function (as a tree),
721 FUNTYPE is the data type of the function (as a tree),
722 or for a library call it is an identifier node for the subroutine name. */
724 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
726 /* Define how to find the value returned by a function.
727 VALTYPE is the data type of the value (as a tree).
728 If the precise function being called is known, FUNC is its FUNCTION_DECL;
729 otherwise, FUNC is 0. */
731 /* On the HP-PA the value is found in register(s) 28(-29), unless
732 the mode is SF or DF. Then the value is returned in fr4 (32). */
734 /* This must perform the same promotions as PROMOTE_MODE, else
735 PROMOTE_FUNCTION_RETURN will not work correctly. */
736 #define FUNCTION_VALUE(VALTYPE, FUNC) \
737 gen_rtx_REG (((INTEGRAL_TYPE_P (VALTYPE) \
738 && TYPE_PRECISION (VALTYPE) < BITS_PER_WORD) \
739 || POINTER_TYPE_P (VALTYPE)) \
740 ? word_mode : TYPE_MODE (VALTYPE), \
741 (TREE_CODE (VALTYPE) == REAL_TYPE \
742 && TYPE_MODE (VALTYPE) != TFmode \
743 && !TARGET_SOFT_FLOAT) ? 32 : 28)
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, this is a single integer, which is a number of words
767 of arguments scanned so far (including the invisible argument,
768 if any, which holds the structure-value-address).
769 Thus 4 or more means all following args should go on the stack. */
771 struct hppa_args {int words, nargs_prototype, indirect; };
773 #define CUMULATIVE_ARGS struct hppa_args
775 /* Initialize a variable CUM of type CUMULATIVE_ARGS
776 for a call to a function whose data type is FNTYPE.
777 For a library call, FNTYPE is 0. */
779 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \
781 (CUM).indirect = INDIRECT, \
782 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
783 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
784 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
785 || RETURN_IN_MEMORY (TREE_TYPE (FNTYPE)))) \
790 /* Similar, but when scanning the definition of a procedure. We always
791 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
793 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
795 (CUM).indirect = 0, \
796 (CUM).nargs_prototype = 1000
798 /* Figure out the size in words of the function argument. The size
799 returned by this macro should always be greater than zero because
800 we pass variable and zero sized objects by reference. */
802 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
803 ((((MODE) != BLKmode \
804 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
805 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
807 /* Update the data in CUM to advance over an argument
808 of mode MODE and data type TYPE.
809 (TYPE is null for libcalls where that information may not be available.) */
811 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
812 { (CUM).nargs_prototype--; \
813 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
814 + (((CUM).words & 01) && (TYPE) != 0 \
815 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
818 /* Determine where to put an argument to a function.
819 Value is zero to push the argument on the stack,
820 or a hard register in which to store the argument.
822 MODE is the argument's machine mode.
823 TYPE is the data type of the argument (as a tree).
824 This is null for libcalls where that information may
826 CUM is a variable of type CUMULATIVE_ARGS which gives info about
827 the preceding args and about the function being called.
828 NAMED is nonzero if this argument is a named parameter
829 (otherwise it is an extra parameter matching an ellipsis).
831 On the HP-PA the first four words of args are normally in registers
832 and the rest are pushed. But any arg that won't entirely fit in regs
835 Arguments passed in registers are either 1 or 2 words long.
837 The caller must make a distinction between calls to explicitly named
838 functions and calls through pointers to functions -- the conventions
839 are different! Calls through pointers to functions only use general
840 registers for the first four argument words.
842 Of course all this is different for the portable runtime model
843 HP wants everyone to use for ELF. Ugh. Here's a quick description
844 of how it's supposed to work.
846 1) callee side remains unchanged. It expects integer args to be
847 in the integer registers, float args in the float registers and
848 unnamed args in integer registers.
850 2) caller side now depends on if the function being called has
851 a prototype in scope (rather than if it's being called indirectly).
853 2a) If there is a prototype in scope, then arguments are passed
854 according to their type (ints in integer registers, floats in float
855 registers, unnamed args in integer registers.
857 2b) If there is no prototype in scope, then floating point arguments
858 are passed in both integer and float registers. egad.
860 FYI: The portable parameter passing conventions are almost exactly like
861 the standard parameter passing conventions on the RS6000. That's why
862 you'll see lots of similar code in rs6000.h. */
864 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
866 /* Do not expect to understand this without reading it several times. I'm
867 tempted to try and simply it, but I worry about breaking something. */
869 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
870 function_arg (&CUM, MODE, TYPE, NAMED, 0)
872 /* Nonzero if we do not know how to pass TYPE solely in registers. */
873 #define MUST_PASS_IN_STACK(MODE,TYPE) \
875 && (TREE_CODE (TYPE_SIZE (TYPE)) != INTEGER_CST \
876 || TREE_ADDRESSABLE (TYPE)))
878 #define FUNCTION_INCOMING_ARG(CUM, MODE, TYPE, NAMED) \
879 function_arg (&CUM, MODE, TYPE, NAMED, 1)
881 /* For an arg passed partly in registers and partly in memory,
882 this is the number of registers used.
883 For args passed entirely in registers or entirely in memory, zero. */
885 /* For PA32 there are never split arguments. PA64, on the other hand, can
886 pass arguments partially in registers and partially in memory. */
887 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
888 (TARGET_64BIT ? function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED) : 0)
890 /* If defined, a C expression that gives the alignment boundary, in
891 bits, of an argument with the specified mode and type. If it is
892 not defined, `PARM_BOUNDARY' is used for all arguments. */
894 /* Arguments larger than one word are double word aligned. */
896 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
898 ? (integer_zerop (TYPE_SIZE (TYPE)) \
899 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
900 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
901 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
902 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
904 /* In the 32-bit runtime, arguments larger than eight bytes are passed
905 by invisible reference. As a GCC extension, we also pass anything
906 with a zero or variable size by reference.
908 The 64-bit runtime does not describe passing any types by invisible
909 reference. The internals of GCC can't currently handle passing
910 empty structures, and zero or variable length arrays when they are
911 not passed entirely on the stack or by reference. Thus, as a GCC
912 extension, we pass these types by reference. The HP compiler doesn't
913 support these types, so hopefully there shouldn't be any compatibility
914 issues. This may have to be revisited when HP releases a C99 compiler
915 or updates the ABI. */
916 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
918 ? ((TYPE) && int_size_in_bytes (TYPE) <= 0) \
919 : (((TYPE) && (int_size_in_bytes (TYPE) > 8 \
920 || int_size_in_bytes (TYPE) <= 0)) \
921 || ((MODE) && GET_MODE_SIZE (MODE) > 8)))
923 #define FUNCTION_ARG_CALLEE_COPIES(CUM, MODE, TYPE, NAMED) \
924 FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)
927 extern GTY(()) rtx hppa_compare_op0;
928 extern GTY(()) rtx hppa_compare_op1;
929 extern enum cmp_type hppa_branch_type;
931 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
932 as assembly via FUNCTION_PROFILER. Just output a local label.
933 We can't use the function label because the GAS SOM target can't
934 handle the difference of a global symbol and a local symbol. */
936 #ifndef FUNC_BEGIN_PROLOG_LABEL
937 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
940 #define FUNCTION_PROFILER(FILE, LABEL) \
941 ASM_OUTPUT_INTERNAL_LABEL (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
943 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
944 void hppa_profile_hook PARAMS ((int label_no));
946 /* The profile counter if emitted must come before the prologue. */
947 #define PROFILE_BEFORE_PROLOGUE 1
949 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
950 the stack pointer does not matter. The value is tested only in
951 functions that have frame pointers.
952 No definition is equivalent to always zero. */
954 extern int may_call_alloca;
956 #define EXIT_IGNORE_STACK \
957 (get_frame_size () != 0 \
958 || current_function_calls_alloca || current_function_outgoing_args_size)
960 /* Output assembler code for a block containing the constant parts
961 of a trampoline, leaving space for the variable parts.\
963 The trampoline sets the static chain pointer to STATIC_CHAIN_REGNUM
964 and then branches to the specified routine.
966 This code template is copied from text segment to stack location
967 and then patched with INITIALIZE_TRAMPOLINE to contain
968 valid values, and then entered as a subroutine.
970 It is best to keep this as small as possible to avoid having to
971 flush multiple lines in the cache. */
973 #define TRAMPOLINE_TEMPLATE(FILE) \
975 if (! TARGET_64BIT) \
977 fputs ("\tldw 36(%r22),%r21\n", FILE); \
978 fputs ("\tbb,>=,n %r21,30,.+16\n", FILE); \
979 if (ASSEMBLER_DIALECT == 0) \
980 fputs ("\tdepi 0,31,2,%r21\n", FILE); \
982 fputs ("\tdepwi 0,31,2,%r21\n", FILE); \
983 fputs ("\tldw 4(%r21),%r19\n", FILE); \
984 fputs ("\tldw 0(%r21),%r21\n", FILE); \
985 fputs ("\tldsid (%r21),%r1\n", FILE); \
986 fputs ("\tmtsp %r1,%sr0\n", FILE); \
987 fputs ("\tbe 0(%sr0,%r21)\n", FILE); \
988 fputs ("\tldw 40(%r22),%r29\n", FILE); \
989 fputs ("\t.word 0\n", FILE); \
990 fputs ("\t.word 0\n", FILE); \
991 fputs ("\t.word 0\n", FILE); \
992 fputs ("\t.word 0\n", FILE); \
996 fputs ("\t.dword 0\n", FILE); \
997 fputs ("\t.dword 0\n", FILE); \
998 fputs ("\t.dword 0\n", FILE); \
999 fputs ("\t.dword 0\n", FILE); \
1000 fputs ("\tmfia %r31\n", FILE); \
1001 fputs ("\tldd 24(%r31),%r1\n", FILE); \
1002 fputs ("\tldd 24(%r1),%r27\n", FILE); \
1003 fputs ("\tldd 16(%r1),%r1\n", FILE); \
1004 fputs ("\tbve (%r1)\n", FILE); \
1005 fputs ("\tldd 32(%r31),%r31\n", FILE); \
1006 fputs ("\t.dword 0 ; fptr\n", FILE); \
1007 fputs ("\t.dword 0 ; static link\n", FILE); \
1011 /* Length in units of the trampoline for entering a nested function.
1013 Flush the cache entries corresponding to the first and last addresses
1014 of the trampoline. This is necessary as the trampoline may cross two
1017 If the code part of the trampoline ever grows to > 32 bytes, then it
1018 will become necessary to hack on the cacheflush pattern in pa.md. */
1020 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
1022 /* Emit RTL insns to initialize the variable parts of a trampoline.
1023 FNADDR is an RTX for the address of the function's pure code.
1024 CXT is an RTX for the static chain value for the function.
1026 Move the function address to the trampoline template at offset 36.
1027 Move the static chain value to trampoline template at offset 40.
1028 Move the trampoline address to trampoline template at offset 44.
1029 Move r19 to trampoline template at offset 48. The latter two
1030 words create a plabel for the indirect call to the trampoline. */
1032 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1034 if (! TARGET_64BIT) \
1036 rtx start_addr, end_addr; \
1038 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 36)); \
1039 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (FNADDR)); \
1040 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 40)); \
1041 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (CXT)); \
1042 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 44)); \
1043 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (TRAMP)); \
1044 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 48)); \
1045 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), \
1046 gen_rtx_REG (Pmode, 19)); \
1047 /* fdc and fic only use registers for the address to flush, \
1048 they do not accept integer displacements. */ \
1049 start_addr = force_reg (Pmode, (TRAMP)); \
1050 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1051 emit_insn (gen_dcacheflush (start_addr, end_addr)); \
1052 end_addr = force_reg (Pmode, plus_constant (start_addr, 32)); \
1053 emit_insn (gen_icacheflush (start_addr, end_addr, start_addr, \
1054 gen_reg_rtx (Pmode), gen_reg_rtx (Pmode)));\
1058 rtx start_addr, end_addr; \
1060 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 56)); \
1061 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (FNADDR)); \
1062 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 64)); \
1063 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (CXT)); \
1064 /* Create a fat pointer for the trampoline. */ \
1065 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1066 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 16)); \
1067 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), end_addr); \
1068 end_addr = gen_rtx_REG (Pmode, 27); \
1069 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 24)); \
1070 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), end_addr); \
1071 /* fdc and fic only use registers for the address to flush, \
1072 they do not accept integer displacements. */ \
1073 start_addr = force_reg (Pmode, (TRAMP)); \
1074 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1075 emit_insn (gen_dcacheflush (start_addr, end_addr)); \
1076 end_addr = force_reg (Pmode, plus_constant (start_addr, 32)); \
1077 emit_insn (gen_icacheflush (start_addr, end_addr, start_addr, \
1078 gen_reg_rtx (Pmode), gen_reg_rtx (Pmode)));\
1082 /* Perform any machine-specific adjustment in the address of the trampoline.
1083 ADDR contains the address that was passed to INITIALIZE_TRAMPOLINE.
1084 Adjust the trampoline address to point to the plabel at offset 44. */
1086 #define TRAMPOLINE_ADJUST_ADDRESS(ADDR) \
1087 if (!TARGET_64BIT) (ADDR) = memory_address (Pmode, plus_constant ((ADDR), 46))
1089 /* Emit code for a call to builtin_saveregs. We must emit USE insns which
1090 reference the 4 integer arg registers and 4 fp arg registers.
1091 Ordinarily they are not call used registers, but they are for
1092 _builtin_saveregs, so we must make this explicit. */
1094 #define EXPAND_BUILTIN_SAVEREGS() hppa_builtin_saveregs ()
1096 /* Implement `va_start' for varargs and stdarg. */
1098 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
1099 hppa_va_start (valist, nextarg)
1101 /* Implement `va_arg'. */
1103 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
1104 hppa_va_arg (valist, type)
1106 /* Addressing modes, and classification of registers for them.
1108 Using autoincrement addressing modes on PA8000 class machines is
1111 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
1112 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
1114 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
1115 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
1117 /* Macros to check register numbers against specific register classes. */
1119 /* These assume that REGNO is a hard or pseudo reg number.
1120 They give nonzero only if REGNO is a hard reg of the suitable class
1121 or a pseudo reg currently allocated to a suitable hard reg.
1122 Since they use reg_renumber, they are safe only once reg_renumber
1123 has been allocated, which happens in local-alloc.c. */
1125 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1126 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1127 #define REGNO_OK_FOR_BASE_P(REGNO) \
1128 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1129 #define REGNO_OK_FOR_FP_P(REGNO) \
1130 (FP_REGNO_P (REGNO) || FP_REGNO_P (reg_renumber[REGNO]))
1132 /* Now macros that check whether X is a register and also,
1133 strictly, whether it is in a specified class.
1135 These macros are specific to the HP-PA, and may be used only
1136 in code for printing assembler insns and in conditions for
1137 define_optimization. */
1139 /* 1 if X is an fp register. */
1141 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
1143 /* Maximum number of registers that can appear in a valid memory address. */
1145 #define MAX_REGS_PER_ADDRESS 2
1147 /* Recognize any constant value that is a valid address except
1148 for symbolic addresses. We get better CSE by rejecting them
1149 here and allowing hppa_legitimize_address to break them up. We
1150 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
1152 #define CONSTANT_ADDRESS_P(X) \
1153 ((GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1154 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
1155 || GET_CODE (X) == HIGH) \
1156 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
1158 /* Include all constant integers and constant doubles, but not
1159 floating-point, except for floating-point zero.
1161 Reject LABEL_REFs if we're not using gas or the new HP assembler.
1163 ?!? For now also reject CONST_DOUBLES in 64bit mode. This will need
1165 #ifndef NEW_HP_ASSEMBLER
1166 #define NEW_HP_ASSEMBLER 0
1168 #define LEGITIMATE_CONSTANT_P(X) \
1169 ((GET_MODE_CLASS (GET_MODE (X)) != MODE_FLOAT \
1170 || (X) == CONST0_RTX (GET_MODE (X))) \
1171 && (NEW_HP_ASSEMBLER || TARGET_GAS || GET_CODE (X) != LABEL_REF) \
1172 && !(TARGET_64BIT && GET_CODE (X) == CONST_DOUBLE) \
1173 && !(TARGET_64BIT && GET_CODE (X) == CONST_INT \
1174 && !(HOST_BITS_PER_WIDE_INT <= 32 \
1175 || (INTVAL (X) >= (HOST_WIDE_INT) -32 << 31 \
1176 && INTVAL (X) < (HOST_WIDE_INT) 32 << 31) \
1177 || cint_ok_for_move (INTVAL (X)))) \
1178 && !function_label_operand (X, VOIDmode))
1180 /* Subroutine for EXTRA_CONSTRAINT.
1182 Return 1 iff OP is a pseudo which did not get a hard register and
1183 we are running the reload pass. */
1185 #define IS_RELOADING_PSEUDO_P(OP) \
1186 ((reload_in_progress \
1187 && GET_CODE (OP) == REG \
1188 && REGNO (OP) >= FIRST_PSEUDO_REGISTER \
1189 && reg_renumber [REGNO (OP)] < 0))
1191 /* Optional extra constraints for this machine. Borrowed from sparc.h.
1193 For the HPPA, `Q' means that this is a memory operand but not a
1194 symbolic memory operand. Note that an unassigned pseudo register
1195 is such a memory operand. Needed because reload will generate
1196 these things in insns and then not re-recognize the insns, causing
1197 constrain_operands to fail.
1199 `R' is used for scaled indexed addresses.
1201 `S' is the constant 31.
1203 `T' is for fp loads and stores. */
1204 #define EXTRA_CONSTRAINT(OP, C) \
1206 (IS_RELOADING_PSEUDO_P (OP) \
1207 || (GET_CODE (OP) == MEM \
1208 && (memory_address_p (GET_MODE (OP), XEXP (OP, 0))\
1209 || reload_in_progress) \
1210 && ! symbolic_memory_operand (OP, VOIDmode) \
1211 && !(GET_CODE (XEXP (OP, 0)) == PLUS \
1212 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT\
1213 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT))))\
1215 (GET_CODE (OP) == MEM \
1216 && GET_CODE (XEXP (OP, 0)) == PLUS \
1217 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT \
1218 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT) \
1219 && (move_operand (OP, GET_MODE (OP)) \
1220 || memory_address_p (GET_MODE (OP), XEXP (OP, 0))\
1221 || reload_in_progress)) \
1223 (GET_CODE (OP) == MEM \
1224 /* Using DFmode forces only short displacements \
1225 to be recognized as valid in reg+d addresses. \
1226 However, this is not necessary for PA2.0 since\
1227 it has long FP loads/stores. \
1229 FIXME: the ELF32 linker clobbers the LSB of \
1230 the FP register number in {fldw,fstw} insns. \
1231 Thus, we only allow long FP loads/stores on \
1233 && memory_address_p ((TARGET_PA_20 \
1238 && !(GET_CODE (XEXP (OP, 0)) == LO_SUM \
1239 && GET_CODE (XEXP (XEXP (OP, 0), 0)) == REG \
1240 && REG_OK_FOR_BASE_P (XEXP (XEXP (OP, 0), 0))\
1241 && GET_CODE (XEXP (XEXP (OP, 0), 1)) == UNSPEC\
1242 && GET_MODE (XEXP (OP, 0)) == Pmode) \
1243 && !(GET_CODE (XEXP (OP, 0)) == PLUS \
1244 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT\
1245 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT)))\
1247 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 63) \
1249 (GET_CODE (OP) == MEM \
1250 && GET_CODE (XEXP (OP, 0)) == LO_SUM \
1251 && GET_CODE (XEXP (XEXP (OP, 0), 0)) == REG \
1252 && REG_OK_FOR_BASE_P (XEXP (XEXP (OP, 0), 0)) \
1253 && GET_CODE (XEXP (XEXP (OP, 0), 1)) == UNSPEC \
1254 && GET_MODE (XEXP (OP, 0)) == Pmode) \
1256 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 31) : 0))))))
1259 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1260 and check its validity for a certain class.
1261 We have two alternate definitions for each of them.
1262 The usual definition accepts all pseudo regs; the other rejects
1263 them unless they have been allocated suitable hard regs.
1264 The symbol REG_OK_STRICT causes the latter definition to be used.
1266 Most source files want to accept pseudo regs in the hope that
1267 they will get allocated to the class that the insn wants them to be in.
1268 Source files for reload pass need to be strict.
1269 After reload, it makes no difference, since pseudo regs have
1270 been eliminated by then. */
1272 #ifndef REG_OK_STRICT
1274 /* Nonzero if X is a hard reg that can be used as an index
1275 or if it is a pseudo reg. */
1276 #define REG_OK_FOR_INDEX_P(X) \
1277 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1278 /* Nonzero if X is a hard reg that can be used as a base reg
1279 or if it is a pseudo reg. */
1280 #define REG_OK_FOR_BASE_P(X) \
1281 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1285 /* Nonzero if X is a hard reg that can be used as an index. */
1286 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1287 /* Nonzero if X is a hard reg that can be used as a base reg. */
1288 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1292 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1293 that is a valid memory address for an instruction.
1294 The MODE argument is the machine mode for the MEM expression
1295 that wants to use this address.
1297 On the HP-PA, the actual legitimate addresses must be
1298 REG+REG, REG+(REG*SCALE) or REG+SMALLINT.
1299 But we can treat a SYMBOL_REF as legitimate if it is part of this
1300 function's constant-pool, because such addresses can actually
1301 be output as REG+SMALLINT.
1303 Note we only allow 5 bit immediates for access to a constant address;
1304 doing so avoids losing for loading/storing a FP register at an address
1305 which will not fit in 5 bits. */
1307 #define VAL_5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x10 < 0x20)
1308 #define INT_5_BITS(X) VAL_5_BITS_P (INTVAL (X))
1310 #define VAL_U5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) < 0x20)
1311 #define INT_U5_BITS(X) VAL_U5_BITS_P (INTVAL (X))
1313 #define VAL_11_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x400 < 0x800)
1314 #define INT_11_BITS(X) VAL_11_BITS_P (INTVAL (X))
1316 #define VAL_14_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x2000 < 0x4000)
1317 #define INT_14_BITS(X) VAL_14_BITS_P (INTVAL (X))
1319 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1321 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1322 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1323 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1324 && REG_P (XEXP (X, 0)) \
1325 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1327 else if (GET_CODE (X) == PLUS) \
1329 rtx base = 0, index = 0; \
1330 if (REG_P (XEXP (X, 0)) \
1331 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1332 base = XEXP (X, 0), index = XEXP (X, 1); \
1333 else if (REG_P (XEXP (X, 1)) \
1334 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1335 base = XEXP (X, 1), index = XEXP (X, 0); \
1337 if (GET_CODE (index) == CONST_INT \
1338 && ((INT_14_BITS (index) \
1339 && (TARGET_SOFT_FLOAT \
1341 && ((MODE == SFmode \
1342 && (INTVAL (index) % 4) == 0)\
1343 || (MODE == DFmode \
1344 && (INTVAL (index) % 8) == 0)))\
1345 || ((MODE) != SFmode && (MODE) != DFmode))) \
1346 || INT_5_BITS (index))) \
1348 if (! TARGET_SOFT_FLOAT \
1349 && ! TARGET_DISABLE_INDEXING \
1351 && ((MODE) == SFmode || (MODE) == DFmode) \
1352 && GET_CODE (index) == MULT \
1353 && GET_CODE (XEXP (index, 0)) == REG \
1354 && REG_OK_FOR_BASE_P (XEXP (index, 0)) \
1355 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1356 && INTVAL (XEXP (index, 1)) == ((MODE) == SFmode ? 4 : 8))\
1359 else if (GET_CODE (X) == LO_SUM \
1360 && GET_CODE (XEXP (X, 0)) == REG \
1361 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1362 && CONSTANT_P (XEXP (X, 1)) \
1363 && (TARGET_SOFT_FLOAT \
1364 /* We can allow symbolic LO_SUM addresses\
1368 && GET_CODE (XEXP (X, 1)) != CONST_INT)\
1369 || ((MODE) != SFmode \
1370 && (MODE) != DFmode))) \
1372 else if (GET_CODE (X) == LO_SUM \
1373 && GET_CODE (XEXP (X, 0)) == SUBREG \
1374 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG\
1375 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0)))\
1376 && CONSTANT_P (XEXP (X, 1)) \
1377 && (TARGET_SOFT_FLOAT \
1378 /* We can allow symbolic LO_SUM addresses\
1382 && GET_CODE (XEXP (X, 1)) != CONST_INT)\
1383 || ((MODE) != SFmode \
1384 && (MODE) != DFmode))) \
1386 else if (GET_CODE (X) == LABEL_REF \
1387 || (GET_CODE (X) == CONST_INT \
1388 && INT_5_BITS (X))) \
1390 /* Needed for -fPIC */ \
1391 else if (GET_CODE (X) == LO_SUM \
1392 && GET_CODE (XEXP (X, 0)) == REG \
1393 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1394 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1395 && (TARGET_SOFT_FLOAT \
1396 || (TARGET_PA_20 && !TARGET_ELF32) \
1397 || ((MODE) != SFmode \
1398 && (MODE) != DFmode))) \
1402 /* Look for machine dependent ways to make the invalid address AD a
1405 For the PA, transform:
1407 memory(X + <large int>)
1411 if (<large int> & mask) >= 16
1412 Y = (<large int> & ~mask) + mask + 1 Round up.
1414 Y = (<large int> & ~mask) Round down.
1416 memory (Z + (<large int> - Y));
1418 This makes reload inheritance and reload_cse work better since Z
1421 There may be more opportunities to improve code with this hook. */
1422 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1424 int offset, newoffset, mask; \
1425 rtx new, temp = NULL_RTX; \
1427 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1428 ? (TARGET_PA_20 && !TARGET_ELF32 ? 0x3fff : 0x1f) : 0x3fff); \
1431 && GET_CODE (AD) == PLUS) \
1432 temp = simplify_binary_operation (PLUS, Pmode, \
1433 XEXP (AD, 0), XEXP (AD, 1)); \
1435 new = temp ? temp : AD; \
1438 && GET_CODE (new) == PLUS \
1439 && GET_CODE (XEXP (new, 0)) == REG \
1440 && GET_CODE (XEXP (new, 1)) == CONST_INT) \
1442 offset = INTVAL (XEXP ((new), 1)); \
1444 /* Choose rounding direction. Round up if we are >= halfway. */ \
1445 if ((offset & mask) >= ((mask + 1) / 2)) \
1446 newoffset = (offset & ~mask) + mask + 1; \
1448 newoffset = offset & ~mask; \
1450 if (newoffset != 0 \
1451 && VAL_14_BITS_P (newoffset)) \
1454 temp = gen_rtx_PLUS (Pmode, XEXP (new, 0), \
1455 GEN_INT (newoffset)); \
1456 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1457 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1458 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1468 /* Try machine-dependent ways of modifying an illegitimate address
1469 to be legitimate. If we find one, return the new, valid address.
1470 This macro is used in only one place: `memory_address' in explow.c.
1472 OLDX is the address as it was before break_out_memory_refs was called.
1473 In some cases it is useful to look at this to decide what needs to be done.
1475 MODE and WIN are passed so that this macro can use
1476 GO_IF_LEGITIMATE_ADDRESS.
1478 It is always safe for this macro to do nothing. It exists to recognize
1479 opportunities to optimize the output. */
1481 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1482 { rtx orig_x = (X); \
1483 (X) = hppa_legitimize_address (X, OLDX, MODE); \
1484 if ((X) != orig_x && memory_address_p (MODE, X)) \
1487 /* Go to LABEL if ADDR (a legitimate address expression)
1488 has an effect that depends on the machine mode it is used for. */
1490 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1491 if (GET_CODE (ADDR) == PRE_DEC \
1492 || GET_CODE (ADDR) == POST_DEC \
1493 || GET_CODE (ADDR) == PRE_INC \
1494 || GET_CODE (ADDR) == POST_INC) \
1497 #define TARGET_ASM_SELECT_SECTION pa_select_section
1499 /* Define this macro if references to a symbol must be treated
1500 differently depending on something about the variable or
1501 function named by the symbol (such as what section it is in).
1503 The macro definition, if any, is executed immediately after the
1504 rtl for DECL or other node is created.
1505 The value of the rtl will be a `mem' whose address is a
1508 The usual thing for this macro to do is to a flag in the
1509 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1510 name string in the `symbol_ref' (if one bit is not enough
1513 On the HP-PA we use this to indicate if a symbol is in text or
1514 data space. Also, function labels need special treatment. */
1516 #define TEXT_SPACE_P(DECL)\
1517 (TREE_CODE (DECL) == FUNCTION_DECL \
1518 || (TREE_CODE (DECL) == VAR_DECL \
1519 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1520 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1522 || (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'c' \
1523 && !(TREE_CODE (DECL) == STRING_CST && flag_writable_strings)))
1525 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1527 /* Specify the machine mode that this machine uses
1528 for the index in the tablejump instruction. */
1529 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? TImode : DImode)
1531 /* Jump tables must be 32 bit aligned, no matter the size of the element. */
1532 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1534 /* Define this as 1 if `char' should by default be signed; else as 0. */
1535 #define DEFAULT_SIGNED_CHAR 1
1537 /* Max number of bytes we can move from memory to memory
1538 in one reasonably fast instruction. */
1541 /* Higher than the default as we prefer to use simple move insns
1542 (better scheduling and delay slot filling) and because our
1543 built-in block move is really a 2X unrolled loop.
1545 Believe it or not, this has to be big enough to allow for copying all
1546 arguments passed in registers to avoid infinite recursion during argument
1547 setup for a function call. Why? Consider how we copy the stack slots
1548 reserved for parameters when they may be trashed by a call. */
1549 #define MOVE_RATIO (TARGET_64BIT ? 8 : 4)
1551 /* Define if operations between registers always perform the operation
1552 on the full register even if a narrower mode is specified. */
1553 #define WORD_REGISTER_OPERATIONS
1555 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1556 will either zero-extend or sign-extend. The value of this macro should
1557 be the code that says which one of the two operations is implicitly
1558 done, NIL if none. */
1559 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1561 /* Nonzero if access to memory by bytes is slow and undesirable. */
1562 #define SLOW_BYTE_ACCESS 1
1564 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1565 is done just by pretending it is already truncated. */
1566 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1568 /* We assume that the store-condition-codes instructions store 0 for false
1569 and some other value for true. This is the value stored for true. */
1571 #define STORE_FLAG_VALUE 1
1573 /* When a prototype says `char' or `short', really pass an `int'. */
1574 #define PROMOTE_PROTOTYPES 1
1575 #define PROMOTE_FUNCTION_RETURN 1
1577 /* Specify the machine mode that pointers have.
1578 After generation of rtl, the compiler makes no further distinction
1579 between pointers and any other objects of this machine mode. */
1580 #define Pmode word_mode
1582 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1583 return the mode to be used for the comparison. For floating-point, CCFPmode
1584 should be used. CC_NOOVmode should be used when the first operand is a
1585 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1587 #define SELECT_CC_MODE(OP,X,Y) \
1588 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1590 /* A function address in a call instruction
1591 is a byte address (for indexing purposes)
1592 so give the MEM rtx a byte's mode. */
1593 #define FUNCTION_MODE SImode
1595 /* Define this if addresses of constant functions
1596 shouldn't be put through pseudo regs where they can be cse'd.
1597 Desirable on machines where ordinary constants are expensive
1598 but a CALL with constant address is cheap. */
1599 #define NO_FUNCTION_CSE
1601 /* Define this to be nonzero if shift instructions ignore all but the low-order
1603 #define SHIFT_COUNT_TRUNCATED 1
1605 /* Compute the cost of computing a constant rtl expression RTX
1606 whose rtx-code is CODE. The body of this macro is a portion
1607 of a switch statement. If the code is computed here,
1608 return it with a return statement. Otherwise, break from the switch. */
1610 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
1612 if (INTVAL (RTX) == 0) return 0; \
1613 if (INT_14_BITS (RTX)) return 1; \
1620 case CONST_DOUBLE: \
1621 if ((RTX == CONST0_RTX (DFmode) || RTX == CONST0_RTX (SFmode)) \
1622 && OUTER_CODE != SET) \
1627 #define ADDRESS_COST(RTX) \
1628 (GET_CODE (RTX) == REG ? 1 : hppa_address_cost (RTX))
1630 /* Compute extra cost of moving data between one register class
1633 Make moves from SAR so expensive they should never happen. We used to
1634 have 0xffff here, but that generates overflow in rare cases.
1636 Copies involving a FP register and a non-FP register are relatively
1637 expensive because they must go through memory.
1639 Other copies are reasonably cheap. */
1640 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1641 (CLASS1 == SHIFT_REGS ? 0x100 \
1642 : FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16 \
1643 : FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16 \
1647 /* Provide the costs of a rtl expression. This is in the body of a
1648 switch on CODE. The purpose for the cost of MULT is to encourage
1649 `synth_mult' to find a synthetic multiply when reasonable. */
1651 #define RTX_COSTS(X,CODE,OUTER_CODE) \
1653 if (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT) \
1654 return COSTS_N_INSNS (3); \
1655 return (TARGET_PA_11 && ! TARGET_DISABLE_FPREGS && ! TARGET_SOFT_FLOAT) \
1656 ? COSTS_N_INSNS (8) : COSTS_N_INSNS (20); \
1658 if (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT) \
1659 return COSTS_N_INSNS (14); \
1663 return COSTS_N_INSNS (60); \
1664 case PLUS: /* this includes shNadd insns */ \
1666 if (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT) \
1667 return COSTS_N_INSNS (3); \
1668 return COSTS_N_INSNS (1); \
1672 return COSTS_N_INSNS (1);
1674 /* Adjust the cost of branches. */
1675 #define BRANCH_COST (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1677 /* Handling the special cases is going to get too complicated for a macro,
1678 just call `pa_adjust_insn_length' to do the real work. */
1679 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1680 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1682 /* Millicode insns are actually function calls with some special
1683 constraints on arguments and register usage.
1685 Millicode calls always expect their arguments in the integer argument
1686 registers, and always return their result in %r29 (ret1). They
1687 are expected to clobber their arguments, %r1, %r29, and the return
1688 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1690 This macro tells reorg that the references to arguments and
1691 millicode calls do not appear to happen until after the millicode call.
1692 This allows reorg to put insns which set the argument registers into the
1693 delay slot of the millicode call -- thus they act more like traditional
1696 Note we can not consider side effects of the insn to be delayed because
1697 the branch and link insn will clobber the return pointer. If we happened
1698 to use the return pointer in the delay slot of the call, then we lose.
1700 get_attr_type will try to recognize the given insn, so make sure to
1701 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1703 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1706 /* Control the assembler format that we output. */
1708 /* Output to assembler file text saying following lines
1709 may contain character constants, extra white space, comments, etc. */
1711 #define ASM_APP_ON ""
1713 /* Output to assembler file text saying following lines
1714 no longer contain unusual constructs. */
1716 #define ASM_APP_OFF ""
1718 /* Output deferred plabels at the end of the file. */
1720 #define ASM_FILE_END(FILE) output_deferred_plabels (FILE)
1722 /* This is how to output the definition of a user-level label named NAME,
1723 such as the label on a static function or variable NAME. */
1725 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1726 do { assemble_name (FILE, NAME); \
1727 fputc ('\n', FILE); } while (0)
1729 /* This is how to output a reference to a user-level label named NAME.
1730 `assemble_name' uses this. */
1732 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1734 const char *xname = (NAME); \
1735 if (FUNCTION_NAME_P (NAME)) \
1737 if (xname[0] == '*') \
1740 fputs (user_label_prefix, FILE); \
1741 fputs (xname, FILE); \
1744 /* This is how to output an internal numbered label where
1745 PREFIX is the class of label and NUM is the number within the class. */
1747 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1748 {fprintf (FILE, "%c$%s%04d\n", (PREFIX)[0], (PREFIX) + 1, NUM);}
1750 /* This is how to store into the string LABEL
1751 the symbol_ref name of an internal numbered label where
1752 PREFIX is the class of label and NUM is the number within the class.
1753 This is suitable for output with `assemble_name'. */
1755 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1756 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1758 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1760 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1761 output_ascii ((FILE), (P), (SIZE))
1763 /* This is how to output an element of a case-vector that is absolute.
1764 Note that this method makes filling these branch delay slots
1767 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1768 if (TARGET_BIG_SWITCH) \
1769 fprintf (FILE, "\tstw %%r1,-16(%%r30)\n\tldil LR'L$%04d,%%r1\n\tbe RR'L$%04d(%%sr4,%%r1)\n\tldw -16(%%r30),%%r1\n", VALUE, VALUE); \
1771 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1773 /* Jump tables are executable code and live in the TEXT section on the PA. */
1774 #define JUMP_TABLES_IN_TEXT_SECTION 1
1776 /* This is how to output an element of a case-vector that is relative.
1777 This must be defined correctly as it is used when generating PIC code.
1779 I believe it safe to use the same definition as ASM_OUTPUT_ADDR_VEC_ELT
1780 on the PA since ASM_OUTPUT_ADDR_VEC_ELT uses pc-relative jump instructions
1781 rather than a table of absolute addresses. */
1783 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1784 if (TARGET_BIG_SWITCH) \
1785 fprintf (FILE, "\tstw %%r1,-16(%%r30)\n\tldw T'L$%04d(%%r19),%%r1\n\tbv %%r0(%%r1)\n\tldw -16(%%r30),%%r1\n", VALUE); \
1787 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1789 /* This is how to output an assembler line
1790 that says to advance the location counter
1791 to a multiple of 2**LOG bytes. */
1793 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1794 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1796 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1797 fprintf (FILE, "\t.blockz %d\n", (SIZE))
1799 /* This says how to output an assembler line to define a global common symbol
1800 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1802 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGNED) \
1804 assemble_name ((FILE), (NAME)); \
1805 fputs ("\t.comm ", (FILE)); \
1806 fprintf ((FILE), "%d\n", MAX ((SIZE), ((ALIGNED) / BITS_PER_UNIT)));}
1808 /* This says how to output an assembler line to define a local common symbol
1809 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1811 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGNED) \
1813 fprintf ((FILE), "\t.align %d\n", ((ALIGNED) / BITS_PER_UNIT)); \
1814 assemble_name ((FILE), (NAME)); \
1815 fprintf ((FILE), "\n\t.block %d\n", (SIZE));}
1817 /* Store in OUTPUT a string (made with alloca) containing
1818 an assembler-name for a local static variable named NAME.
1819 LABELNO is an integer which is different for each call. */
1821 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1822 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 12), \
1823 sprintf ((OUTPUT), "%s___%d", (NAME), (LABELNO)))
1825 /* All HP assemblers use "!" to separate logical lines. */
1826 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == '!')
1828 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
1829 ((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
1831 /* Print operand X (an rtx) in assembler syntax to file FILE.
1832 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1833 For `%' followed by punctuation, CODE is the punctuation and X is null.
1835 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1836 and an immediate zero should be represented as `r0'.
1838 Several % codes are defined:
1840 C compare conditions
1841 N extract conditions
1842 M modifier to handle preincrement addressing for memory refs.
1843 F modifier to handle preincrement addressing for fp memory refs */
1845 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1848 /* Print a memory address as an operand to reference that memory location. */
1850 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1851 { register rtx addr = ADDR; \
1852 register rtx base; \
1854 switch (GET_CODE (addr)) \
1857 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1860 if (GET_CODE (XEXP (addr, 0)) == CONST_INT) \
1861 offset = INTVAL (XEXP (addr, 0)), base = XEXP (addr, 1); \
1862 else if (GET_CODE (XEXP (addr, 1)) == CONST_INT) \
1863 offset = INTVAL (XEXP (addr, 1)), base = XEXP (addr, 0); \
1866 fprintf (FILE, "%d(%s)", offset, reg_names [REGNO (base)]); \
1869 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1870 fputs ("R'", FILE); \
1871 else if (flag_pic == 0) \
1872 fputs ("RR'", FILE); \
1874 fputs ("RT'", FILE); \
1875 output_global_address (FILE, XEXP (addr, 1), 0); \
1876 fputs ("(", FILE); \
1877 output_operand (XEXP (addr, 0), 0); \
1878 fputs (")", FILE); \
1881 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC, INTVAL (addr)); \
1882 fprintf (FILE, "(%%r0)"); \
1885 output_addr_const (FILE, addr); \
1889 /* Find the return address associated with the frame given by
1891 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1892 (return_addr_rtx (COUNT, FRAMEADDR))
1894 /* Used to mask out junk bits from the return address, such as
1895 processor state, interrupt status, condition codes and the like. */
1896 #define MASK_RETURN_ADDR \
1897 /* The privilege level is in the two low order bits, mask em out \
1898 of the return address. */ \
1901 /* The number of Pmode words for the setjmp buffer. */
1902 #define JMP_BUF_SIZE 50
1904 /* Only direct calls to static functions are allowed to be sibling (tail)
1907 This restriction is necessary because some linker generated stubs will
1908 store return pointers into rp' in some cases which might clobber a
1909 live value already in rp'.
1911 In a sibcall the current function and the target function share stack
1912 space. Thus if the path to the current function and the path to the
1913 target function save a value in rp', they save the value into the
1914 same stack slot, which has undesirable consequences.
1916 Because of the deferred binding nature of shared libraries any function
1917 with external scope could be in a different load module and thus require
1918 rp' to be saved when calling that function. So sibcall optimizations
1919 can only be safe for static function.
1921 Note that GCC never needs return value relocations, so we don't have to
1922 worry about static calls with return value relocations (which require
1925 It is safe to perform a sibcall optimization when the target function
1926 will never return. */
1927 #define FUNCTION_OK_FOR_SIBCALL(DECL) \
1929 && ! TARGET_PORTABLE_RUNTIME \
1931 && ! TREE_PUBLIC (DECL))
1933 #define PREDICATE_CODES \
1934 {"reg_or_0_operand", {SUBREG, REG, CONST_INT}}, \
1935 {"call_operand_address", {LABEL_REF, SYMBOL_REF, CONST_INT, \
1936 CONST_DOUBLE, CONST, HIGH, CONSTANT_P_RTX}}, \
1937 {"symbolic_operand", {SYMBOL_REF, LABEL_REF, CONST}}, \
1938 {"symbolic_memory_operand", {SUBREG, MEM}}, \
1939 {"reg_before_reload_operand", {REG, MEM}}, \
1940 {"reg_or_nonsymb_mem_operand", {SUBREG, REG, MEM}}, \
1941 {"reg_or_0_or_nonsymb_mem_operand", {SUBREG, REG, MEM, CONST_INT, \
1943 {"move_operand", {SUBREG, REG, CONSTANT_P_RTX, CONST_INT, MEM}}, \
1944 {"reg_or_cint_move_operand", {SUBREG, REG, CONST_INT}}, \
1945 {"pic_label_operand", {LABEL_REF, CONST}}, \
1946 {"fp_reg_operand", {REG}}, \
1947 {"arith_operand", {SUBREG, REG, CONST_INT}}, \
1948 {"arith11_operand", {SUBREG, REG, CONST_INT}}, \
1949 {"pre_cint_operand", {CONST_INT}}, \
1950 {"post_cint_operand", {CONST_INT}}, \
1951 {"arith_double_operand", {SUBREG, REG, CONST_DOUBLE}}, \
1952 {"ireg_or_int5_operand", {CONST_INT, REG}}, \
1953 {"int5_operand", {CONST_INT}}, \
1954 {"uint5_operand", {CONST_INT}}, \
1955 {"int11_operand", {CONST_INT}}, \
1956 {"uint32_operand", {CONST_INT, \
1957 HOST_BITS_PER_WIDE_INT > 32 ? 0 : CONST_DOUBLE}}, \
1958 {"arith5_operand", {SUBREG, REG, CONST_INT}}, \
1959 {"and_operand", {SUBREG, REG, CONST_INT}}, \
1960 {"ior_operand", {CONST_INT}}, \
1961 {"lhs_lshift_cint_operand", {CONST_INT}}, \
1962 {"lhs_lshift_operand", {SUBREG, REG, CONST_INT}}, \
1963 {"arith32_operand", {SUBREG, REG, CONST_INT}}, \
1964 {"pc_or_label_operand", {PC, LABEL_REF}}, \
1965 {"plus_xor_ior_operator", {PLUS, XOR, IOR}}, \
1966 {"shadd_operand", {CONST_INT}}, \
1967 {"basereg_operand", {REG}}, \
1968 {"div_operand", {REG, CONST_INT}}, \
1969 {"ireg_operand", {REG}}, \
1970 {"cmpib_comparison_operator", {EQ, NE, LT, LE, LEU, \
1972 {"movb_comparison_operator", {EQ, NE, LT, GE}},
OSDN Git Service
