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 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 /* SOM ABI says that objects larger than 64 bits are returned in memory.
558 PA64 ABI says that objects larger than 128 bits are returned in memory.
559 Note, int_size_in_bytes can return -1 if the size of the object is
560 variable or larger than the maximum value that can be expressed as
561 a HOST_WIDE_INT. It can also return zero for an empty type. The
562 simplest way to handle variable and empty types is to pass them in
563 memory. This avoids problems in defining the boundaries of argument
564 slots, allocating registers, etc. */
565 #define RETURN_IN_MEMORY(TYPE) \
566 (int_size_in_bytes (TYPE) > (TARGET_64BIT ? 16 : 8) \
567 || int_size_in_bytes (TYPE) <= 0)
569 /* Register in which address to store a structure value
570 is passed to a function. */
571 #define STRUCT_VALUE_REGNUM 28
573 /* Describe how we implement __builtin_eh_return. */
574 #define EH_RETURN_DATA_REGNO(N) \
575 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
576 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
577 #define EH_RETURN_HANDLER_RTX \
578 gen_rtx_MEM (word_mode, \
579 gen_rtx_PLUS (word_mode, frame_pointer_rtx, \
580 TARGET_64BIT ? GEN_INT (-16) : GEN_INT (-20)))
583 /* Offset from the argument pointer register value to the top of
584 stack. This is different from FIRST_PARM_OFFSET because of the
586 #define ARG_POINTER_CFA_OFFSET(FNDECL) 0
588 /* The letters I, J, K, L and M in a register constraint string
589 can be used to stand for particular ranges of immediate operands.
590 This macro defines what the ranges are.
591 C is the letter, and VALUE is a constant value.
592 Return 1 if VALUE is in the range specified by C.
594 `I' is used for the 11 bit constants.
595 `J' is used for the 14 bit constants.
596 `K' is used for values that can be moved with a zdepi insn.
597 `L' is used for the 5 bit constants.
599 `N' is used for values with the least significant 11 bits equal to zero
600 and when sign extended from 32 to 64 bits the
601 value does not change.
602 `O' is used for numbers n such that n+1 is a power of 2.
605 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
606 ((C) == 'I' ? VAL_11_BITS_P (VALUE) \
607 : (C) == 'J' ? VAL_14_BITS_P (VALUE) \
608 : (C) == 'K' ? zdepi_cint_p (VALUE) \
609 : (C) == 'L' ? VAL_5_BITS_P (VALUE) \
610 : (C) == 'M' ? (VALUE) == 0 \
611 : (C) == 'N' ? (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) == 0 \
612 || (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) \
613 == (HOST_WIDE_INT) -1 << 31)) \
614 : (C) == 'O' ? (((VALUE) & ((VALUE) + 1)) == 0) \
615 : (C) == 'P' ? and_mask_p (VALUE) \
618 /* Similar, but for floating or large integer constants, and defining letters
619 G and H. Here VALUE is the CONST_DOUBLE rtx itself.
621 For PA, `G' is the floating-point constant zero. `H' is undefined. */
623 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
624 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
625 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) \
628 /* The class value for index registers, and the one for base regs. */
629 #define INDEX_REG_CLASS GENERAL_REGS
630 #define BASE_REG_CLASS GENERAL_REGS
632 #define FP_REG_CLASS_P(CLASS) \
633 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
635 /* True if register is floating-point. */
636 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
638 /* Given an rtx X being reloaded into a reg required to be
639 in class CLASS, return the class of reg to actually use.
640 In general this is just CLASS; but on some machines
641 in some cases it is preferable to use a more restrictive class. */
642 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
644 /* Return the register class of a scratch register needed to copy
645 IN into a register in CLASS in MODE, or a register in CLASS in MODE
646 to IN. If it can be done directly NO_REGS is returned.
648 Avoid doing any work for the common case calls. */
650 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
651 ((CLASS == BASE_REG_CLASS && GET_CODE (IN) == REG \
652 && REGNO (IN) < FIRST_PSEUDO_REGISTER) \
653 ? NO_REGS : secondary_reload_class (CLASS, MODE, IN))
655 #define MAYBE_FP_REG_CLASS_P(CLASS) \
656 reg_classes_intersect_p ((CLASS), FP_REGS)
658 /* On the PA it is not possible to directly move data between
659 GENERAL_REGS and FP_REGS. */
660 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
661 (MAYBE_FP_REG_CLASS_P (CLASS1) != FP_REG_CLASS_P (CLASS2) \
662 || MAYBE_FP_REG_CLASS_P (CLASS2) != FP_REG_CLASS_P (CLASS1))
664 /* Return the stack location to use for secondary memory needed reloads. */
665 #define SECONDARY_MEMORY_NEEDED_RTX(MODE) \
666 gen_rtx_MEM (MODE, gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (-16)))
669 /* Stack layout; function entry, exit and calling. */
671 /* Define this if pushing a word on the stack
672 makes the stack pointer a smaller address. */
673 /* #define STACK_GROWS_DOWNWARD */
675 /* Believe it or not. */
676 #define ARGS_GROW_DOWNWARD
678 /* Define this if the nominal address of the stack frame
679 is at the high-address end of the local variables;
680 that is, each additional local variable allocated
681 goes at a more negative offset in the frame. */
682 /* #define FRAME_GROWS_DOWNWARD */
684 /* Offset within stack frame to start allocating local variables at.
685 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
686 first local allocated. Otherwise, it is the offset to the BEGINNING
687 of the first local allocated.
689 On the 32-bit ports, we reserve one slot for the previous frame
690 pointer and one fill slot. The fill slot is for compatibility
691 with HP compiled programs. On the 64-bit ports, we reserve one
692 slot for the previous frame pointer. */
693 #define STARTING_FRAME_OFFSET 8
695 /* Define STACK_ALIGNMENT_NEEDED to zero to disable final alignment
696 of the stack. The default is to align it to STACK_BOUNDARY. */
697 #define STACK_ALIGNMENT_NEEDED 0
699 /* If we generate an insn to push BYTES bytes,
700 this says how many the stack pointer really advances by.
701 On the HP-PA, don't define this because there are no push insns. */
702 /* #define PUSH_ROUNDING(BYTES) */
704 /* Offset of first parameter from the argument pointer register value.
705 This value will be negated because the arguments grow down.
706 Also note that on STACK_GROWS_UPWARD machines (such as this one)
707 this is the distance from the frame pointer to the end of the first
708 argument, not it's beginning. To get the real offset of the first
709 argument, the size of the argument must be added. */
711 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
713 /* When a parameter is passed in a register, stack space is still
715 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
717 /* Define this if the above stack space is to be considered part of the
718 space allocated by the caller. */
719 #define OUTGOING_REG_PARM_STACK_SPACE
721 /* Keep the stack pointer constant throughout the function.
722 This is both an optimization and a necessity: longjmp
723 doesn't behave itself when the stack pointer moves within
725 #define ACCUMULATE_OUTGOING_ARGS 1
727 /* The weird HPPA calling conventions require a minimum of 48 bytes on
728 the stack: 16 bytes for register saves, and 32 bytes for magic.
729 This is the difference between the logical top of stack and the
732 On the 64-bit port, the HP C compiler allocates a 48-byte frame
733 marker, although the runtime documentation only describes a 16
734 byte marker. For compatibility, we allocate 48 bytes. */
735 #define STACK_POINTER_OFFSET \
736 (TARGET_64BIT ? -(current_function_outgoing_args_size + 48): -32)
738 #define STACK_DYNAMIC_OFFSET(FNDECL) \
740 ? (STACK_POINTER_OFFSET) \
741 : ((STACK_POINTER_OFFSET) - current_function_outgoing_args_size))
743 /* Value is 1 if returning from a function call automatically
744 pops the arguments described by the number-of-args field in the call.
745 FUNDECL is the declaration node of the function (as a tree),
746 FUNTYPE is the data type of the function (as a tree),
747 or for a library call it is an identifier node for the subroutine name. */
749 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
751 /* Define how to find the value returned by a function.
752 VALTYPE is the data type of the value (as a tree).
753 If the precise function being called is known, FUNC is its FUNCTION_DECL;
754 otherwise, FUNC is 0. */
756 #define FUNCTION_VALUE(VALTYPE, FUNC) function_value (VALTYPE, FUNC)
758 /* Define how to find the value returned by a library function
759 assuming the value has mode MODE. */
761 #define LIBCALL_VALUE(MODE) \
763 (! TARGET_SOFT_FLOAT \
764 && ((MODE) == SFmode || (MODE) == DFmode) ? 32 : 28))
766 /* 1 if N is a possible register number for a function value
767 as seen by the caller. */
769 #define FUNCTION_VALUE_REGNO_P(N) \
770 ((N) == 28 || (! TARGET_SOFT_FLOAT && (N) == 32))
773 /* Define a data type for recording info about an argument list
774 during the scan of that argument list. This data type should
775 hold all necessary information about the function itself
776 and about the args processed so far, enough to enable macros
777 such as FUNCTION_ARG to determine where the next arg should go.
779 On the HP-PA, the WORDS field holds the number of words
780 of arguments scanned so far (including the invisible argument,
781 if any, which holds the structure-value-address). Thus, 4 or
782 more means all following args should go on the stack.
784 The INCOMING field tracks whether this is an "incoming" or
787 The INDIRECT field indicates whether this is is an indirect
790 The NARGS_PROTOTYPE field indicates that an argument does not
791 have a prototype when it less than or equal to 0. */
793 struct hppa_args {int words, nargs_prototype, incoming, indirect; };
795 #define CUMULATIVE_ARGS struct hppa_args
797 /* Initialize a variable CUM of type CUMULATIVE_ARGS
798 for a call to a function whose data type is FNTYPE.
799 For a library call, FNTYPE is 0. */
801 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,FNDECL) \
803 (CUM).incoming = 0, \
804 (CUM).indirect = (FNTYPE) && !(FNDECL), \
805 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
806 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
807 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
808 || RETURN_IN_MEMORY (TREE_TYPE (FNTYPE)))) \
813 /* Similar, but when scanning the definition of a procedure. We always
814 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
816 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
818 (CUM).incoming = 1, \
819 (CUM).indirect = 0, \
820 (CUM).nargs_prototype = 1000
822 /* Figure out the size in words of the function argument. The size
823 returned by this macro should always be greater than zero because
824 we pass variable and zero sized objects by reference. */
826 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
827 ((((MODE) != BLKmode \
828 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
829 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
831 /* Update the data in CUM to advance over an argument
832 of mode MODE and data type TYPE.
833 (TYPE is null for libcalls where that information may not be available.) */
835 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
836 { (CUM).nargs_prototype--; \
837 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
838 + (((CUM).words & 01) && (TYPE) != 0 \
839 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
842 /* Determine where to put an argument to a function.
843 Value is zero to push the argument on the stack,
844 or a hard register in which to store the argument.
846 MODE is the argument's machine mode.
847 TYPE is the data type of the argument (as a tree).
848 This is null for libcalls where that information may
850 CUM is a variable of type CUMULATIVE_ARGS which gives info about
851 the preceding args and about the function being called.
852 NAMED is nonzero if this argument is a named parameter
853 (otherwise it is an extra parameter matching an ellipsis).
855 On the HP-PA the first four words of args are normally in registers
856 and the rest are pushed. But any arg that won't entirely fit in regs
859 Arguments passed in registers are either 1 or 2 words long.
861 The caller must make a distinction between calls to explicitly named
862 functions and calls through pointers to functions -- the conventions
863 are different! Calls through pointers to functions only use general
864 registers for the first four argument words.
866 Of course all this is different for the portable runtime model
867 HP wants everyone to use for ELF. Ugh. Here's a quick description
868 of how it's supposed to work.
870 1) callee side remains unchanged. It expects integer args to be
871 in the integer registers, float args in the float registers and
872 unnamed args in integer registers.
874 2) caller side now depends on if the function being called has
875 a prototype in scope (rather than if it's being called indirectly).
877 2a) If there is a prototype in scope, then arguments are passed
878 according to their type (ints in integer registers, floats in float
879 registers, unnamed args in integer registers.
881 2b) If there is no prototype in scope, then floating point arguments
882 are passed in both integer and float registers. egad.
884 FYI: The portable parameter passing conventions are almost exactly like
885 the standard parameter passing conventions on the RS6000. That's why
886 you'll see lots of similar code in rs6000.h. */
888 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
890 /* Do not expect to understand this without reading it several times. I'm
891 tempted to try and simply it, but I worry about breaking something. */
893 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
894 function_arg (&CUM, MODE, TYPE, NAMED)
896 /* Nonzero if we do not know how to pass TYPE solely in registers. */
897 #define MUST_PASS_IN_STACK(MODE,TYPE) \
899 && (TREE_CODE (TYPE_SIZE (TYPE)) != INTEGER_CST \
900 || TREE_ADDRESSABLE (TYPE)))
902 /* For an arg passed partly in registers and partly in memory,
903 this is the number of registers used.
904 For args passed entirely in registers or entirely in memory, zero. */
906 /* For PA32 there are never split arguments. PA64, on the other hand, can
907 pass arguments partially in registers and partially in memory. */
908 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
909 (TARGET_64BIT ? function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED) : 0)
911 /* If defined, a C expression that gives the alignment boundary, in
912 bits, of an argument with the specified mode and type. If it is
913 not defined, `PARM_BOUNDARY' is used for all arguments. */
915 /* Arguments larger than one word are double word aligned. */
917 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
919 ? (integer_zerop (TYPE_SIZE (TYPE)) \
920 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
921 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
922 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
923 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
925 /* In the 32-bit runtime, arguments larger than eight bytes are passed
926 by invisible reference. As a GCC extension, we also pass anything
927 with a zero or variable size by reference.
929 The 64-bit runtime does not describe passing any types by invisible
930 reference. The internals of GCC can't currently handle passing
931 empty structures, and zero or variable length arrays when they are
932 not passed entirely on the stack or by reference. Thus, as a GCC
933 extension, we pass these types by reference. The HP compiler doesn't
934 support these types, so hopefully there shouldn't be any compatibility
935 issues. This may have to be revisited when HP releases a C99 compiler
936 or updates the ABI. */
937 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
939 ? ((TYPE) && int_size_in_bytes (TYPE) <= 0) \
940 : (((TYPE) && (int_size_in_bytes (TYPE) > 8 \
941 || int_size_in_bytes (TYPE) <= 0)) \
942 || ((MODE) && GET_MODE_SIZE (MODE) > 8)))
944 #define FUNCTION_ARG_CALLEE_COPIES(CUM, MODE, TYPE, NAMED) \
945 FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)
948 extern GTY(()) rtx hppa_compare_op0;
949 extern GTY(()) rtx hppa_compare_op1;
950 extern enum cmp_type hppa_branch_type;
952 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
953 as assembly via FUNCTION_PROFILER. Just output a local label.
954 We can't use the function label because the GAS SOM target can't
955 handle the difference of a global symbol and a local symbol. */
957 #ifndef FUNC_BEGIN_PROLOG_LABEL
958 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
961 #define FUNCTION_PROFILER(FILE, LABEL) \
962 (*targetm.asm_out.internal_label) (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
964 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
965 void hppa_profile_hook (int label_no);
967 /* The profile counter if emitted must come before the prologue. */
968 #define PROFILE_BEFORE_PROLOGUE 1
970 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
971 the stack pointer does not matter. The value is tested only in
972 functions that have frame pointers.
973 No definition is equivalent to always zero. */
975 extern int may_call_alloca;
977 #define EXIT_IGNORE_STACK \
978 (get_frame_size () != 0 \
979 || current_function_calls_alloca || current_function_outgoing_args_size)
981 /* Output assembler code for a block containing the constant parts
982 of a trampoline, leaving space for the variable parts.\
984 The trampoline sets the static chain pointer to STATIC_CHAIN_REGNUM
985 and then branches to the specified routine.
987 This code template is copied from text segment to stack location
988 and then patched with INITIALIZE_TRAMPOLINE to contain
989 valid values, and then entered as a subroutine.
991 It is best to keep this as small as possible to avoid having to
992 flush multiple lines in the cache. */
994 #define TRAMPOLINE_TEMPLATE(FILE) \
998 fputs ("\tldw 36(%r22),%r21\n", FILE); \
999 fputs ("\tbb,>=,n %r21,30,.+16\n", FILE); \
1000 if (ASSEMBLER_DIALECT == 0) \
1001 fputs ("\tdepi 0,31,2,%r21\n", FILE); \
1003 fputs ("\tdepwi 0,31,2,%r21\n", FILE); \
1004 fputs ("\tldw 4(%r21),%r19\n", FILE); \
1005 fputs ("\tldw 0(%r21),%r21\n", FILE); \
1008 fputs ("\tbve (%r21)\n", FILE); \
1009 fputs ("\tldw 40(%r22),%r29\n", FILE); \
1010 fputs ("\t.word 0\n", FILE); \
1011 fputs ("\t.word 0\n", FILE); \
1015 fputs ("\tldsid (%r21),%r1\n", FILE); \
1016 fputs ("\tmtsp %r1,%sr0\n", FILE); \
1017 fputs ("\tbe 0(%sr0,%r21)\n", FILE); \
1018 fputs ("\tldw 40(%r22),%r29\n", FILE); \
1020 fputs ("\t.word 0\n", FILE); \
1021 fputs ("\t.word 0\n", FILE); \
1022 fputs ("\t.word 0\n", FILE); \
1023 fputs ("\t.word 0\n", FILE); \
1027 fputs ("\t.dword 0\n", FILE); \
1028 fputs ("\t.dword 0\n", FILE); \
1029 fputs ("\t.dword 0\n", FILE); \
1030 fputs ("\t.dword 0\n", FILE); \
1031 fputs ("\tmfia %r31\n", FILE); \
1032 fputs ("\tldd 24(%r31),%r1\n", FILE); \
1033 fputs ("\tldd 24(%r1),%r27\n", FILE); \
1034 fputs ("\tldd 16(%r1),%r1\n", FILE); \
1035 fputs ("\tbve (%r1)\n", FILE); \
1036 fputs ("\tldd 32(%r31),%r31\n", FILE); \
1037 fputs ("\t.dword 0 ; fptr\n", FILE); \
1038 fputs ("\t.dword 0 ; static link\n", FILE); \
1042 /* Length in units of the trampoline for entering a nested function. */
1044 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
1046 /* Length in units of the trampoline instruction code. */
1048 #define TRAMPOLINE_CODE_SIZE (TARGET_64BIT ? 24 : (TARGET_PA_20 ? 32 : 40))
1050 /* Minimum length of a cache line. A length of 16 will work on all
1051 PA-RISC processors. All PA 1.1 processors have a cache line of
1052 32 bytes. Most but not all PA 2.0 processors have a cache line
1053 of 64 bytes. As cache flushes are expensive and we don't support
1054 PA 1.0, we use a minimum length of 32. */
1056 #define MIN_CACHELINE_SIZE 32
1058 /* Emit RTL insns to initialize the variable parts of a trampoline.
1059 FNADDR is an RTX for the address of the function's pure code.
1060 CXT is an RTX for the static chain value for the function.
1062 Move the function address to the trampoline template at offset 36.
1063 Move the static chain value to trampoline template at offset 40.
1064 Move the trampoline address to trampoline template at offset 44.
1065 Move r19 to trampoline template at offset 48. The latter two
1066 words create a plabel for the indirect call to the trampoline.
1068 A similar sequence is used for the 64-bit port but the plabel is
1069 at the beginning of the trampoline.
1071 Finally, the cache entries for the trampoline code are flushed.
1072 This is necessary to ensure that the trampoline instruction sequence
1073 is written to memory prior to any attempts at prefetching the code
1076 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1078 rtx start_addr = gen_reg_rtx (Pmode); \
1079 rtx end_addr = gen_reg_rtx (Pmode); \
1080 rtx line_length = gen_reg_rtx (Pmode); \
1083 if (!TARGET_64BIT) \
1085 tmp = memory_address (Pmode, plus_constant ((TRAMP), 36)); \
1086 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
1087 tmp = memory_address (Pmode, plus_constant ((TRAMP), 40)); \
1088 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
1090 /* Create a fat pointer for the trampoline. */ \
1091 tmp = memory_address (Pmode, plus_constant ((TRAMP), 44)); \
1092 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (TRAMP)); \
1093 tmp = memory_address (Pmode, plus_constant ((TRAMP), 48)); \
1094 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1095 gen_rtx_REG (Pmode, 19)); \
1097 /* fdc and fic only use registers for the address to flush, \
1098 they do not accept integer displacements. We align the \
1099 start and end addresses to the beginning of their respective \
1100 cache lines to minimize the number of lines flushed. */ \
1101 tmp = force_reg (Pmode, (TRAMP)); \
1102 emit_insn (gen_andsi3 (start_addr, tmp, \
1103 GEN_INT (-MIN_CACHELINE_SIZE))); \
1104 tmp = force_reg (Pmode, \
1105 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
1106 emit_insn (gen_andsi3 (end_addr, tmp, \
1107 GEN_INT (-MIN_CACHELINE_SIZE))); \
1108 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
1109 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
1110 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
1111 gen_reg_rtx (Pmode), \
1112 gen_reg_rtx (Pmode), \
1113 gen_reg_rtx (Pmode))); \
1117 tmp = memory_address (Pmode, plus_constant ((TRAMP), 56)); \
1118 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (FNADDR)); \
1119 tmp = memory_address (Pmode, plus_constant ((TRAMP), 64)); \
1120 emit_move_insn (gen_rtx_MEM (Pmode, tmp), (CXT)); \
1122 /* Create a fat pointer for the trampoline. */ \
1123 tmp = memory_address (Pmode, plus_constant ((TRAMP), 16)); \
1124 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1125 force_reg (Pmode, plus_constant ((TRAMP), 32))); \
1126 tmp = memory_address (Pmode, plus_constant ((TRAMP), 24)); \
1127 emit_move_insn (gen_rtx_MEM (Pmode, tmp), \
1128 gen_rtx_REG (Pmode, 27)); \
1130 /* fdc and fic only use registers for the address to flush, \
1131 they do not accept integer displacements. We align the \
1132 start and end addresses to the beginning of their respective \
1133 cache lines to minimize the number of lines flushed. */ \
1134 tmp = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1135 emit_insn (gen_anddi3 (start_addr, tmp, \
1136 GEN_INT (-MIN_CACHELINE_SIZE))); \
1137 tmp = force_reg (Pmode, \
1138 plus_constant (tmp, TRAMPOLINE_CODE_SIZE - 1)); \
1139 emit_insn (gen_anddi3 (end_addr, tmp, \
1140 GEN_INT (-MIN_CACHELINE_SIZE))); \
1141 emit_move_insn (line_length, GEN_INT (MIN_CACHELINE_SIZE)); \
1142 emit_insn (gen_dcacheflush (start_addr, end_addr, line_length)); \
1143 emit_insn (gen_icacheflush (start_addr, end_addr, line_length, \
1144 gen_reg_rtx (Pmode), \
1145 gen_reg_rtx (Pmode), \
1146 gen_reg_rtx (Pmode))); \
1150 /* Perform any machine-specific adjustment in the address of the trampoline.
1151 ADDR contains the address that was passed to INITIALIZE_TRAMPOLINE.
1152 Adjust the trampoline address to point to the plabel at offset 44. */
1154 #define TRAMPOLINE_ADJUST_ADDRESS(ADDR) \
1155 if (!TARGET_64BIT) (ADDR) = memory_address (Pmode, plus_constant ((ADDR), 46))
1157 /* Emit code for a call to builtin_saveregs. We must emit USE insns which
1158 reference the 4 integer arg registers and 4 fp arg registers.
1159 Ordinarily they are not call used registers, but they are for
1160 _builtin_saveregs, so we must make this explicit. */
1162 #define EXPAND_BUILTIN_SAVEREGS() hppa_builtin_saveregs ()
1164 /* Implement `va_start' for varargs and stdarg. */
1166 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
1167 hppa_va_start (valist, nextarg)
1169 /* Implement `va_arg'. */
1171 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
1172 hppa_va_arg (valist, type)
1174 /* Addressing modes, and classification of registers for them.
1176 Using autoincrement addressing modes on PA8000 class machines is
1179 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
1180 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
1182 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
1183 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
1185 /* Macros to check register numbers against specific register classes. */
1187 /* These assume that REGNO is a hard or pseudo reg number.
1188 They give nonzero only if REGNO is a hard reg of the suitable class
1189 or a pseudo reg currently allocated to a suitable hard reg.
1190 Since they use reg_renumber, they are safe only once reg_renumber
1191 has been allocated, which happens in local-alloc.c. */
1193 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1194 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1195 #define REGNO_OK_FOR_BASE_P(REGNO) \
1196 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1197 #define REGNO_OK_FOR_FP_P(REGNO) \
1198 (FP_REGNO_P (REGNO) || FP_REGNO_P (reg_renumber[REGNO]))
1200 /* Now macros that check whether X is a register and also,
1201 strictly, whether it is in a specified class.
1203 These macros are specific to the HP-PA, and may be used only
1204 in code for printing assembler insns and in conditions for
1205 define_optimization. */
1207 /* 1 if X is an fp register. */
1209 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
1211 /* Maximum number of registers that can appear in a valid memory address. */
1213 #define MAX_REGS_PER_ADDRESS 2
1215 /* Recognize any constant value that is a valid address except
1216 for symbolic addresses. We get better CSE by rejecting them
1217 here and allowing hppa_legitimize_address to break them up. We
1218 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
1220 #define CONSTANT_ADDRESS_P(X) \
1221 ((GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1222 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
1223 || GET_CODE (X) == HIGH) \
1224 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
1226 /* Include all constant integers and constant doubles, but not
1227 floating-point, except for floating-point zero.
1229 Reject LABEL_REFs if we're not using gas or the new HP assembler.
1231 ?!? For now also reject CONST_DOUBLES in 64bit mode. This will need
1233 #ifndef NEW_HP_ASSEMBLER
1234 #define NEW_HP_ASSEMBLER 0
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 || (INTVAL (X) >= (HOST_WIDE_INT) -32 << 31 \
1244 && INTVAL (X) < (HOST_WIDE_INT) 32 << 31) \
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 /* These are the modes that we allow for scaled indexing. */
1429 #define MODE_OK_FOR_SCALED_INDEXING_P(MODE) \
1430 ((TARGET_64BIT && (MODE) == DImode) \
1431 || (MODE) == SImode \
1432 || (MODE) == HImode \
1433 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1435 /* These are the modes that we allow for unscaled indexing. */
1436 #define MODE_OK_FOR_UNSCALED_INDEXING_P(MODE) \
1437 ((TARGET_64BIT && (MODE) == DImode) \
1438 || (MODE) == SImode \
1439 || (MODE) == HImode \
1440 || (MODE) == QImode \
1441 || (!TARGET_SOFT_FLOAT && ((MODE) == DFmode || (MODE) == SFmode)))
1443 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1445 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1446 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1447 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1448 && REG_P (XEXP (X, 0)) \
1449 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1451 else if (GET_CODE (X) == PLUS) \
1453 rtx base = 0, index = 0; \
1454 if (REG_P (XEXP (X, 1)) \
1455 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1456 base = XEXP (X, 1), index = XEXP (X, 0); \
1457 else if (REG_P (XEXP (X, 0)) \
1458 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1459 base = XEXP (X, 0), index = XEXP (X, 1); \
1461 && GET_CODE (index) == CONST_INT \
1462 && ((INT_14_BITS (index) \
1463 && (TARGET_SOFT_FLOAT \
1465 && ((MODE == SFmode \
1466 && (INTVAL (index) % 4) == 0) \
1467 || (MODE == DFmode \
1468 && (INTVAL (index) % 8) == 0))) \
1469 || ((MODE) != SFmode && (MODE) != DFmode))) \
1470 || INT_5_BITS (index))) \
1472 if (!TARGET_DISABLE_INDEXING \
1473 /* Only accept the "canonical" INDEX+BASE operand order \
1474 on targets with non-equivalent space registers. */ \
1475 && (TARGET_NO_SPACE_REGS \
1476 ? (base && REG_P (index)) \
1477 : (base == XEXP (X, 1) && REG_P (index) \
1478 && REG_POINTER (base) && !REG_POINTER (index))) \
1479 && MODE_OK_FOR_UNSCALED_INDEXING_P (MODE) \
1480 && REG_OK_FOR_INDEX_P (index) \
1481 && borx_reg_operand (base, Pmode) \
1482 && borx_reg_operand (index, Pmode)) \
1484 if (!TARGET_DISABLE_INDEXING \
1486 && GET_CODE (index) == MULT \
1487 && MODE_OK_FOR_SCALED_INDEXING_P (MODE) \
1488 && REG_P (XEXP (index, 0)) \
1489 && GET_MODE (XEXP (index, 0)) == Pmode \
1490 && REG_OK_FOR_INDEX_P (XEXP (index, 0)) \
1491 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1492 && INTVAL (XEXP (index, 1)) \
1493 == (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
1494 && borx_reg_operand (base, Pmode)) \
1497 else if (GET_CODE (X) == LO_SUM \
1498 && GET_CODE (XEXP (X, 0)) == REG \
1499 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1500 && CONSTANT_P (XEXP (X, 1)) \
1501 && (TARGET_SOFT_FLOAT \
1502 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1505 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1506 || ((MODE) != SFmode \
1507 && (MODE) != DFmode))) \
1509 else if (GET_CODE (X) == LO_SUM \
1510 && GET_CODE (XEXP (X, 0)) == SUBREG \
1511 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG \
1512 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0))) \
1513 && CONSTANT_P (XEXP (X, 1)) \
1514 && (TARGET_SOFT_FLOAT \
1515 /* We can allow symbolic LO_SUM addresses for PA2.0. */ \
1518 && GET_CODE (XEXP (X, 1)) != CONST_INT) \
1519 || ((MODE) != SFmode \
1520 && (MODE) != DFmode))) \
1522 else if (GET_CODE (X) == LABEL_REF \
1523 || (GET_CODE (X) == CONST_INT \
1524 && INT_5_BITS (X))) \
1526 /* Needed for -fPIC */ \
1527 else if (GET_CODE (X) == LO_SUM \
1528 && GET_CODE (XEXP (X, 0)) == REG \
1529 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1530 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1531 && (TARGET_SOFT_FLOAT \
1532 || (TARGET_PA_20 && !TARGET_ELF32) \
1533 || ((MODE) != SFmode \
1534 && (MODE) != DFmode))) \
1538 /* Look for machine dependent ways to make the invalid address AD a
1541 For the PA, transform:
1543 memory(X + <large int>)
1547 if (<large int> & mask) >= 16
1548 Y = (<large int> & ~mask) + mask + 1 Round up.
1550 Y = (<large int> & ~mask) Round down.
1552 memory (Z + (<large int> - Y));
1554 This makes reload inheritance and reload_cse work better since Z
1557 There may be more opportunities to improve code with this hook. */
1558 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1560 int offset, newoffset, mask; \
1561 rtx new, temp = NULL_RTX; \
1563 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1564 ? (TARGET_PA_20 && !TARGET_ELF32 ? 0x3fff : 0x1f) : 0x3fff); \
1567 && GET_CODE (AD) == PLUS) \
1568 temp = simplify_binary_operation (PLUS, Pmode, \
1569 XEXP (AD, 0), XEXP (AD, 1)); \
1571 new = temp ? temp : AD; \
1574 && GET_CODE (new) == PLUS \
1575 && GET_CODE (XEXP (new, 0)) == REG \
1576 && GET_CODE (XEXP (new, 1)) == CONST_INT) \
1578 offset = INTVAL (XEXP ((new), 1)); \
1580 /* Choose rounding direction. Round up if we are >= halfway. */ \
1581 if ((offset & mask) >= ((mask + 1) / 2)) \
1582 newoffset = (offset & ~mask) + mask + 1; \
1584 newoffset = offset & ~mask; \
1586 if (newoffset != 0 \
1587 && VAL_14_BITS_P (newoffset)) \
1590 temp = gen_rtx_PLUS (Pmode, XEXP (new, 0), \
1591 GEN_INT (newoffset)); \
1592 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1593 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1594 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1604 /* Try machine-dependent ways of modifying an illegitimate address
1605 to be legitimate. If we find one, return the new, valid address.
1606 This macro is used in only one place: `memory_address' in explow.c.
1608 OLDX is the address as it was before break_out_memory_refs was called.
1609 In some cases it is useful to look at this to decide what needs to be done.
1611 MODE and WIN are passed so that this macro can use
1612 GO_IF_LEGITIMATE_ADDRESS.
1614 It is always safe for this macro to do nothing. It exists to recognize
1615 opportunities to optimize the output. */
1617 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1618 { rtx orig_x = (X); \
1619 (X) = hppa_legitimize_address (X, OLDX, MODE); \
1620 if ((X) != orig_x && memory_address_p (MODE, X)) \
1623 /* Go to LABEL if ADDR (a legitimate address expression)
1624 has an effect that depends on the machine mode it is used for. */
1626 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1627 if (GET_CODE (ADDR) == PRE_DEC \
1628 || GET_CODE (ADDR) == POST_DEC \
1629 || GET_CODE (ADDR) == PRE_INC \
1630 || GET_CODE (ADDR) == POST_INC) \
1633 #define TARGET_ASM_SELECT_SECTION pa_select_section
1635 /* Return a nonzero value if DECL has a section attribute. */
1636 #define IN_NAMED_SECTION_P(DECL) \
1637 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
1638 && DECL_SECTION_NAME (DECL) != NULL_TREE)
1640 /* Define this macro if references to a symbol must be treated
1641 differently depending on something about the variable or
1642 function named by the symbol (such as what section it is in).
1644 The macro definition, if any, is executed immediately after the
1645 rtl for DECL or other node is created.
1646 The value of the rtl will be a `mem' whose address is a
1649 The usual thing for this macro to do is to a flag in the
1650 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1651 name string in the `symbol_ref' (if one bit is not enough
1654 On the HP-PA we use this to indicate if a symbol is in text or
1655 data space. Also, function labels need special treatment. */
1657 #define TEXT_SPACE_P(DECL)\
1658 (TREE_CODE (DECL) == FUNCTION_DECL \
1659 || (TREE_CODE (DECL) == VAR_DECL \
1660 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1661 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1663 || (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'c' \
1664 && !(TREE_CODE (DECL) == STRING_CST && flag_writable_strings)))
1666 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1668 /* Specify the machine mode that this machine uses for the index in the
1669 tablejump instruction. For small tables, an element consists of a
1670 ia-relative branch and its delay slot. When -mbig-switch is specified,
1671 we use a 32-bit absolute address for non-pic code, and a 32-bit offset
1672 for both 32 and 64-bit pic code. */
1673 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? SImode : DImode)
1675 /* Jump tables must be 32-bit aligned, no matter the size of the element. */
1676 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1678 /* Define this as 1 if `char' should by default be signed; else as 0. */
1679 #define DEFAULT_SIGNED_CHAR 1
1681 /* Max number of bytes we can move from memory to memory
1682 in one reasonably fast instruction. */
1685 /* Higher than the default as we prefer to use simple move insns
1686 (better scheduling and delay slot filling) and because our
1687 built-in block move is really a 2X unrolled loop.
1689 Believe it or not, this has to be big enough to allow for copying all
1690 arguments passed in registers to avoid infinite recursion during argument
1691 setup for a function call. Why? Consider how we copy the stack slots
1692 reserved for parameters when they may be trashed by a call. */
1693 #define MOVE_RATIO (TARGET_64BIT ? 8 : 4)
1695 /* Define if operations between registers always perform the operation
1696 on the full register even if a narrower mode is specified. */
1697 #define WORD_REGISTER_OPERATIONS
1699 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1700 will either zero-extend or sign-extend. The value of this macro should
1701 be the code that says which one of the two operations is implicitly
1702 done, NIL if none. */
1703 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1705 /* Nonzero if access to memory by bytes is slow and undesirable. */
1706 #define SLOW_BYTE_ACCESS 1
1708 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1709 is done just by pretending it is already truncated. */
1710 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1712 /* When a prototype says `char' or `short', really pass an `int'. */
1713 #define PROMOTE_PROTOTYPES 1
1714 #define PROMOTE_FUNCTION_RETURN 1
1716 /* Specify the machine mode that pointers have.
1717 After generation of rtl, the compiler makes no further distinction
1718 between pointers and any other objects of this machine mode. */
1719 #define Pmode word_mode
1721 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1722 return the mode to be used for the comparison. For floating-point, CCFPmode
1723 should be used. CC_NOOVmode should be used when the first operand is a
1724 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1726 #define SELECT_CC_MODE(OP,X,Y) \
1727 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1729 /* A function address in a call instruction
1730 is a byte address (for indexing purposes)
1731 so give the MEM rtx a byte's mode. */
1732 #define FUNCTION_MODE SImode
1734 /* Define this if addresses of constant functions
1735 shouldn't be put through pseudo regs where they can be cse'd.
1736 Desirable on machines where ordinary constants are expensive
1737 but a CALL with constant address is cheap. */
1738 #define NO_FUNCTION_CSE
1740 /* Define this to be nonzero if shift instructions ignore all but the low-order
1742 #define SHIFT_COUNT_TRUNCATED 1
1744 /* Compute extra cost of moving data between one register class
1747 Make moves from SAR so expensive they should never happen. We used to
1748 have 0xffff here, but that generates overflow in rare cases.
1750 Copies involving a FP register and a non-FP register are relatively
1751 expensive because they must go through memory.
1753 Other copies are reasonably cheap. */
1754 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1755 (CLASS1 == SHIFT_REGS ? 0x100 \
1756 : FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16 \
1757 : FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16 \
1760 /* Adjust the cost of branches. */
1761 #define BRANCH_COST (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1763 /* Handling the special cases is going to get too complicated for a macro,
1764 just call `pa_adjust_insn_length' to do the real work. */
1765 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1766 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1768 /* Millicode insns are actually function calls with some special
1769 constraints on arguments and register usage.
1771 Millicode calls always expect their arguments in the integer argument
1772 registers, and always return their result in %r29 (ret1). They
1773 are expected to clobber their arguments, %r1, %r29, and the return
1774 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1776 This macro tells reorg that the references to arguments and
1777 millicode calls do not appear to happen until after the millicode call.
1778 This allows reorg to put insns which set the argument registers into the
1779 delay slot of the millicode call -- thus they act more like traditional
1782 Note we can not consider side effects of the insn to be delayed because
1783 the branch and link insn will clobber the return pointer. If we happened
1784 to use the return pointer in the delay slot of the call, then we lose.
1786 get_attr_type will try to recognize the given insn, so make sure to
1787 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1789 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1792 /* Control the assembler format that we output. */
1794 /* A C string constant describing how to begin a comment in the target
1795 assembler language. The compiler assumes that the comment will end at
1796 the end of the line. */
1798 #define ASM_COMMENT_START ";"
1800 /* Output to assembler file text saying following lines
1801 may contain character constants, extra white space, comments, etc. */
1803 #define ASM_APP_ON ""
1805 /* Output to assembler file text saying following lines
1806 no longer contain unusual constructs. */
1808 #define ASM_APP_OFF ""
1810 /* This is how to output the definition of a user-level label named NAME,
1811 such as the label on a static function or variable NAME. */
1813 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1814 do { assemble_name (FILE, NAME); \
1815 fputc ('\n', FILE); } while (0)
1817 /* This is how to output a reference to a user-level label named NAME.
1818 `assemble_name' uses this. */
1820 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1822 const char *xname = (NAME); \
1823 if (FUNCTION_NAME_P (NAME)) \
1825 if (xname[0] == '*') \
1828 fputs (user_label_prefix, FILE); \
1829 fputs (xname, FILE); \
1832 /* This is how to store into the string LABEL
1833 the symbol_ref name of an internal numbered label where
1834 PREFIX is the class of label and NUM is the number within the class.
1835 This is suitable for output with `assemble_name'. */
1837 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1838 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1840 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1842 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1843 output_ascii ((FILE), (P), (SIZE))
1845 /* Jump tables are always placed in the text section. Technically, it
1846 is possible to put them in the readonly data section when -mbig-switch
1847 is specified. This has the benefit of getting the table out of .text
1848 and reducing branch lengths as a result. The downside is that an
1849 additional insn (addil) is needed to access the table when generating
1850 PIC code. The address difference table also has to use 32-bit
1851 pc-relative relocations. Currently, GAS does not support these
1852 relocations, although it is easily modified to do this operation.
1853 The table entries need to look like "$L1+(.+8-$L0)-$PIC_pcrel$0"
1854 when using ELF GAS. A simple difference can be used when using
1855 SOM GAS or the HP assembler. The final downside is GDB complains
1856 about the nesting of the label for the table when debugging. */
1858 #define JUMP_TABLES_IN_TEXT_SECTION 1
1860 /* This is how to output an element of a case-vector that is absolute. */
1862 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1863 if (TARGET_BIG_SWITCH) \
1864 fprintf (FILE, "\t.word L$%04d\n", VALUE); \
1866 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1868 /* This is how to output an element of a case-vector that is relative.
1869 Since we always place jump tables in the text section, the difference
1870 is absolute and requires no relocation. */
1872 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1873 if (TARGET_BIG_SWITCH) \
1874 fprintf (FILE, "\t.word L$%04d-L$%04d\n", VALUE, REL); \
1876 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1878 /* This is how to output an assembler line that says to advance the
1879 location counter to a multiple of 2**LOG bytes. */
1881 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1882 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1884 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1885 fprintf (FILE, "\t.blockz "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1886 (unsigned HOST_WIDE_INT)(SIZE))
1888 /* This says how to output an assembler line to define a global common symbol
1889 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1891 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGNED) \
1893 assemble_name ((FILE), (NAME)); \
1894 fprintf ((FILE), "\t.comm "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1895 MAX ((unsigned HOST_WIDE_INT)(SIZE), \
1896 ((unsigned HOST_WIDE_INT)(ALIGNED) / BITS_PER_UNIT)));}
1898 /* This says how to output an assembler line to define a local common symbol
1899 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1901 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGNED) \
1903 fprintf ((FILE), "\t.align %d\n", ((ALIGNED) / BITS_PER_UNIT)); \
1904 assemble_name ((FILE), (NAME)); \
1905 fprintf ((FILE), "\n\t.block "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1906 (unsigned HOST_WIDE_INT)(SIZE));}
1908 #define ASM_PN_FORMAT "%s___%lu"
1910 /* All HP assemblers use "!" to separate logical lines. */
1911 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == '!')
1913 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
1914 ((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
1916 /* Print operand X (an rtx) in assembler syntax to file FILE.
1917 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1918 For `%' followed by punctuation, CODE is the punctuation and X is null.
1920 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1921 and an immediate zero should be represented as `r0'.
1923 Several % codes are defined:
1925 C compare conditions
1926 N extract conditions
1927 M modifier to handle preincrement addressing for memory refs.
1928 F modifier to handle preincrement addressing for fp memory refs */
1930 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1933 /* Print a memory address as an operand to reference that memory location. */
1935 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1936 { register rtx addr = ADDR; \
1937 register rtx base; \
1939 switch (GET_CODE (addr)) \
1942 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1945 if (GET_CODE (XEXP (addr, 0)) == CONST_INT) \
1946 offset = INTVAL (XEXP (addr, 0)), base = XEXP (addr, 1); \
1947 else if (GET_CODE (XEXP (addr, 1)) == CONST_INT) \
1948 offset = INTVAL (XEXP (addr, 1)), base = XEXP (addr, 0); \
1951 fprintf (FILE, "%d(%s)", offset, reg_names [REGNO (base)]); \
1954 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1955 fputs ("R'", FILE); \
1956 else if (flag_pic == 0) \
1957 fputs ("RR'", FILE); \
1959 fputs ("RT'", FILE); \
1960 output_global_address (FILE, XEXP (addr, 1), 0); \
1961 fputs ("(", FILE); \
1962 output_operand (XEXP (addr, 0), 0); \
1963 fputs (")", FILE); \
1966 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC "(%%r0)", INTVAL (addr)); \
1969 output_addr_const (FILE, addr); \
1973 /* Find the return address associated with the frame given by
1975 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1976 (return_addr_rtx (COUNT, FRAMEADDR))
1978 /* Used to mask out junk bits from the return address, such as
1979 processor state, interrupt status, condition codes and the like. */
1980 #define MASK_RETURN_ADDR \
1981 /* The privilege level is in the two low order bits, mask em out \
1982 of the return address. */ \
1985 /* The number of Pmode words for the setjmp buffer. */
1986 #define JMP_BUF_SIZE 50
1988 #define PREDICATE_CODES \
1989 {"reg_or_0_operand", {SUBREG, REG, CONST_INT, CONST_DOUBLE}}, \
1990 {"call_operand_address", {LABEL_REF, SYMBOL_REF, CONST_INT, \
1991 CONST_DOUBLE, CONST, HIGH, CONSTANT_P_RTX}}, \
1992 {"indexed_memory_operand", {SUBREG, MEM}}, \
1993 {"symbolic_operand", {SYMBOL_REF, LABEL_REF, CONST}}, \
1994 {"symbolic_memory_operand", {SUBREG, MEM}}, \
1995 {"reg_before_reload_operand", {REG, MEM}}, \
1996 {"reg_or_0_or_nonsymb_mem_operand", {SUBREG, REG, MEM, CONST_INT, \
1998 {"move_dest_operand", {SUBREG, REG, MEM}}, \
1999 {"move_src_operand", {SUBREG, REG, CONSTANT_P_RTX, CONST_INT, MEM}}, \
2000 {"reg_or_cint_move_operand", {SUBREG, REG, CONST_INT}}, \
2001 {"pic_label_operand", {LABEL_REF, CONST}}, \
2002 {"fp_reg_operand", {REG}}, \
2003 {"arith_operand", {SUBREG, REG, CONST_INT}}, \
2004 {"arith11_operand", {SUBREG, REG, CONST_INT}}, \
2005 {"pre_cint_operand", {CONST_INT}}, \
2006 {"post_cint_operand", {CONST_INT}}, \
2007 {"arith_double_operand", {SUBREG, REG, CONST_DOUBLE}}, \
2008 {"ireg_or_int5_operand", {CONST_INT, REG}}, \
2009 {"int5_operand", {CONST_INT}}, \
2010 {"uint5_operand", {CONST_INT}}, \
2011 {"int11_operand", {CONST_INT}}, \
2012 {"uint32_operand", {CONST_INT, \
2013 HOST_BITS_PER_WIDE_INT > 32 ? 0 : CONST_DOUBLE}}, \
2014 {"arith5_operand", {SUBREG, REG, CONST_INT}}, \
2015 {"and_operand", {SUBREG, REG, CONST_INT}}, \
2016 {"ior_operand", {CONST_INT}}, \
2017 {"lhs_lshift_cint_operand", {CONST_INT}}, \
2018 {"lhs_lshift_operand", {SUBREG, REG, CONST_INT}}, \
2019 {"arith32_operand", {SUBREG, REG, CONST_INT}}, \
2020 {"pc_or_label_operand", {PC, LABEL_REF}}, \
2021 {"plus_xor_ior_operator", {PLUS, XOR, IOR}}, \
2022 {"shadd_operand", {CONST_INT}}, \
2023 {"div_operand", {REG, CONST_INT}}, \
2024 {"ireg_operand", {REG}}, \
2025 {"cmpib_comparison_operator", {EQ, NE, LT, LE, LEU, \
2027 {"movb_comparison_operator", {EQ, NE, LT, GE}},
2029 /* We need a libcall to canonicalize function pointers on TARGET_ELF32. */
2030 #define CANONICALIZE_FUNCPTR_FOR_COMPARE_LIBCALL \
2031 "__canonicalize_funcptr_for_compare"
OSDN Git Service
