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 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 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 /* stabs-in-som is nearly identical to stabs-in-elf. To avoid useless
329 code duplication we simply include this file and override as needed. */
332 /* We do not have to be compatible with dbx, so we enable gdb extensions
334 #define DEFAULT_GDB_EXTENSIONS 1
336 /* This used to be zero (no max length), but big enums and such can
337 cause huge strings which killed gas.
339 We also have to avoid lossage in dbxout.c -- it does not compute the
340 string size accurately, so we are real conservative here. */
341 #undef DBX_CONTIN_LENGTH
342 #define DBX_CONTIN_LENGTH 3000
344 /* Only labels should ever begin in column zero. */
345 #define ASM_STABS_OP "\t.stabs\t"
346 #define ASM_STABN_OP "\t.stabn\t"
348 /* GDB always assumes the current function's frame begins at the value
349 of the stack pointer upon entry to the current function. Accessing
350 local variables and parameters passed on the stack is done using the
351 base of the frame + an offset provided by GCC.
353 For functions which have frame pointers this method works fine;
354 the (frame pointer) == (stack pointer at function entry) and GCC provides
355 an offset relative to the frame pointer.
357 This loses for functions without a frame pointer; GCC provides an offset
358 which is relative to the stack pointer after adjusting for the function's
359 frame size. GDB would prefer the offset to be relative to the value of
360 the stack pointer at the function's entry. Yuk! */
361 #define DEBUGGER_AUTO_OFFSET(X) \
362 ((GET_CODE (X) == PLUS ? INTVAL (XEXP (X, 1)) : 0) \
363 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
365 #define DEBUGGER_ARG_OFFSET(OFFSET, X) \
366 ((GET_CODE (X) == PLUS ? OFFSET : 0) \
367 + (frame_pointer_needed ? 0 : compute_frame_size (get_frame_size (), 0)))
369 #define TARGET_CPU_CPP_BUILTINS() \
371 builtin_assert("cpu=hppa"); \
372 builtin_assert("machine=hppa"); \
373 builtin_define("__hppa"); \
374 builtin_define("__hppa__"); \
376 builtin_define("_PA_RISC2_0"); \
377 else if (TARGET_PA_11) \
378 builtin_define("_PA_RISC1_1"); \
380 builtin_define("_PA_RISC1_0"); \
383 /* An old set of OS defines for various BSD-like systems. */
384 #define TARGET_OS_CPP_BUILTINS() \
387 builtin_define_std ("REVARGV"); \
388 builtin_define_std ("hp800"); \
389 builtin_define_std ("hp9000"); \
390 builtin_define_std ("hp9k8"); \
391 if (!c_dialect_cxx () && !flag_iso) \
392 builtin_define ("hppa"); \
393 builtin_define_std ("spectrum"); \
394 builtin_define_std ("unix"); \
395 builtin_assert ("system=bsd"); \
396 builtin_assert ("system=unix"); \
400 #define CC1_SPEC "%{pg:} %{p:}"
402 #define LINK_SPEC "%{mlinker-opt:-O} %{!shared:-u main} %{shared:-b}"
404 /* We don't want -lg. */
406 #define LIB_SPEC "%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}"
409 /* This macro defines command-line switches that modify the default
412 The definition is be an initializer for an array of structures. Each
413 array element has have three elements: the switch name, one of the
414 enumeration codes ADD or DELETE to indicate whether the string should be
415 inserted or deleted, and the string to be inserted or deleted. */
416 #define MODIFY_TARGET_NAME {{"-32", DELETE, "64"}, {"-64", ADD, "64"}}
418 /* Make gcc agree with <machine/ansi.h> */
420 #define SIZE_TYPE "unsigned int"
421 #define PTRDIFF_TYPE "int"
422 #define WCHAR_TYPE "unsigned int"
423 #define WCHAR_TYPE_SIZE 32
425 /* Show we can debug even without a frame pointer. */
426 #define CAN_DEBUG_WITHOUT_FP
428 /* target machine storage layout */
430 /* Define this macro if it is advisable to hold scalars in registers
431 in a wider mode than that declared by the program. In such cases,
432 the value is constrained to be within the bounds of the declared
433 type, but kept valid in the wider mode. The signedness of the
434 extension may differ from that of the type. */
436 #define PROMOTE_MODE(MODE,UNSIGNEDP,TYPE) \
437 if (GET_MODE_CLASS (MODE) == MODE_INT \
438 && GET_MODE_SIZE (MODE) < UNITS_PER_WORD) \
441 /* Define this if most significant bit is lowest numbered
442 in instructions that operate on numbered bit-fields. */
443 #define BITS_BIG_ENDIAN 1
445 /* Define this if most significant byte of a word is the lowest numbered. */
446 /* That is true on the HP-PA. */
447 #define BYTES_BIG_ENDIAN 1
449 /* Define this if most significant word of a multiword number is lowest
451 #define WORDS_BIG_ENDIAN 1
453 #define MAX_BITS_PER_WORD 64
454 #define MAX_LONG_TYPE_SIZE 32
456 /* Width of a word, in units (bytes). */
457 #define UNITS_PER_WORD (TARGET_64BIT ? 8 : 4)
458 #define MIN_UNITS_PER_WORD 4
460 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
461 #define PARM_BOUNDARY BITS_PER_WORD
463 /* Largest alignment required for any stack parameter, in bits.
464 Don't define this if it is equal to PARM_BOUNDARY */
465 #define MAX_PARM_BOUNDARY BIGGEST_ALIGNMENT
467 /* Boundary (in *bits*) on which stack pointer is always aligned;
468 certain optimizations in combine depend on this.
470 The HP-UX runtime documents mandate 64-byte and 16-byte alignment for
471 the stack on the 32 and 64-bit ports, respectively. However, we
472 are only guaranteed that the stack is aligned to BIGGEST_ALIGNMENT
473 in main. Thus, we treat the former as the preferred alignment. */
474 #define STACK_BOUNDARY BIGGEST_ALIGNMENT
475 #define PREFERRED_STACK_BOUNDARY (TARGET_64BIT ? 128 : 512)
477 /* Allocation boundary (in *bits*) for the code of a function. */
478 #define FUNCTION_BOUNDARY BITS_PER_WORD
480 /* Alignment of field after `int : 0' in a structure. */
481 #define EMPTY_FIELD_BOUNDARY 32
483 /* Every structure's size must be a multiple of this. */
484 #define STRUCTURE_SIZE_BOUNDARY 8
486 /* A bit-field declared as `int' forces `int' alignment for the struct. */
487 #define PCC_BITFIELD_TYPE_MATTERS 1
489 /* No data type wants to be aligned rounder than this. */
490 #define BIGGEST_ALIGNMENT (2 * BITS_PER_WORD)
492 /* Get around hp-ux assembler bug, and make strcpy of constants fast. */
493 #define CONSTANT_ALIGNMENT(CODE, TYPEALIGN) \
494 ((TYPEALIGN) < 32 ? 32 : (TYPEALIGN))
496 /* Make arrays of chars word-aligned for the same reasons. */
497 #define DATA_ALIGNMENT(TYPE, ALIGN) \
498 (TREE_CODE (TYPE) == ARRAY_TYPE \
499 && TYPE_MODE (TREE_TYPE (TYPE)) == QImode \
500 && (ALIGN) < BITS_PER_WORD ? BITS_PER_WORD : (ALIGN))
502 /* Set this nonzero if move instructions will actually fail to work
503 when given unaligned data. */
504 #define STRICT_ALIGNMENT 1
506 /* Generate calls to memcpy, memcmp and memset. */
507 #define TARGET_MEM_FUNCTIONS
509 /* Value is 1 if it is a good idea to tie two pseudo registers
510 when one has mode MODE1 and one has mode MODE2.
511 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
512 for any hard reg, then this must be 0 for correct output. */
513 #define MODES_TIEABLE_P(MODE1, MODE2) \
514 (GET_MODE_CLASS (MODE1) == GET_MODE_CLASS (MODE2))
516 /* Specify the registers used for certain standard purposes.
517 The values of these macros are register numbers. */
519 /* The HP-PA pc isn't overloaded on a register that the compiler knows about. */
520 /* #define PC_REGNUM */
522 /* Register to use for pushing function arguments. */
523 #define STACK_POINTER_REGNUM 30
525 /* Base register for access to local variables of the function. */
526 #define FRAME_POINTER_REGNUM 3
528 /* Value should be nonzero if functions must have frame pointers. */
529 #define FRAME_POINTER_REQUIRED \
530 (current_function_calls_alloca)
532 /* C statement to store the difference between the frame pointer
533 and the stack pointer values immediately after the function prologue.
535 Note, we always pretend that this is a leaf function because if
536 it's not, there's no point in trying to eliminate the
537 frame pointer. If it is a leaf function, we guessed right! */
538 #define INITIAL_FRAME_POINTER_OFFSET(VAR) \
539 do {(VAR) = - compute_frame_size (get_frame_size (), 0);} while (0)
541 /* Base register for access to arguments of the function. */
542 #define ARG_POINTER_REGNUM 3
544 /* Register in which static-chain is passed to a function. */
545 #define STATIC_CHAIN_REGNUM 29
547 /* Register which holds offset table for position-independent
550 #define PIC_OFFSET_TABLE_REGNUM (TARGET_64BIT ? 27 : 19)
551 #define PIC_OFFSET_TABLE_REG_CALL_CLOBBERED 1
553 /* Function to return the rtx used to save the pic offset table register
554 across function calls. */
555 extern struct rtx_def *hppa_pic_save_rtx PARAMS ((void));
557 #define DEFAULT_PCC_STRUCT_RETURN 0
559 /* SOM ABI says that objects larger than 64 bits are returned in memory.
560 PA64 ABI says that objects larger than 128 bits are returned in memory.
561 Note, int_size_in_bytes can return -1 if the size of the object is
562 variable or larger than the maximum value that can be expressed as
563 a HOST_WIDE_INT. It can also return zero for an empty type. The
564 simplest way to handle variable and empty types is to pass them in
565 memory. This avoids problems in defining the boundaries of argument
566 slots, allocating registers, etc. */
567 #define RETURN_IN_MEMORY(TYPE) \
568 (int_size_in_bytes (TYPE) > (TARGET_64BIT ? 16 : 8) \
569 || int_size_in_bytes (TYPE) <= 0)
571 /* Register in which address to store a structure value
572 is passed to a function. */
573 #define STRUCT_VALUE_REGNUM 28
575 /* Describe how we implement __builtin_eh_return. */
576 #define EH_RETURN_DATA_REGNO(N) \
577 ((N) < 3 ? (N) + 20 : (N) == 3 ? 31 : INVALID_REGNUM)
578 #define EH_RETURN_STACKADJ_RTX gen_rtx_REG (Pmode, 29)
579 #define EH_RETURN_HANDLER_RTX \
580 gen_rtx_MEM (word_mode, \
581 gen_rtx_PLUS (word_mode, frame_pointer_rtx, \
582 TARGET_64BIT ? GEN_INT (-16) : GEN_INT (-20)))
585 /* Offset from the argument pointer register value to the top of
586 stack. This is different from FIRST_PARM_OFFSET because of the
588 #define ARG_POINTER_CFA_OFFSET(FNDECL) 0
590 /* The letters I, J, K, L and M in a register constraint string
591 can be used to stand for particular ranges of immediate operands.
592 This macro defines what the ranges are.
593 C is the letter, and VALUE is a constant value.
594 Return 1 if VALUE is in the range specified by C.
596 `I' is used for the 11 bit constants.
597 `J' is used for the 14 bit constants.
598 `K' is used for values that can be moved with a zdepi insn.
599 `L' is used for the 5 bit constants.
601 `N' is used for values with the least significant 11 bits equal to zero
602 and when sign extended from 32 to 64 bits the
603 value does not change.
604 `O' is used for numbers n such that n+1 is a power of 2.
607 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
608 ((C) == 'I' ? VAL_11_BITS_P (VALUE) \
609 : (C) == 'J' ? VAL_14_BITS_P (VALUE) \
610 : (C) == 'K' ? zdepi_cint_p (VALUE) \
611 : (C) == 'L' ? VAL_5_BITS_P (VALUE) \
612 : (C) == 'M' ? (VALUE) == 0 \
613 : (C) == 'N' ? (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) == 0 \
614 || (((VALUE) & (((HOST_WIDE_INT) -1 << 31) | 0x7ff)) \
615 == (HOST_WIDE_INT) -1 << 31)) \
616 : (C) == 'O' ? (((VALUE) & ((VALUE) + 1)) == 0) \
617 : (C) == 'P' ? and_mask_p (VALUE) \
620 /* Similar, but for floating or large integer constants, and defining letters
621 G and H. Here VALUE is the CONST_DOUBLE rtx itself.
623 For PA, `G' is the floating-point constant zero. `H' is undefined. */
625 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
626 ((C) == 'G' ? (GET_MODE_CLASS (GET_MODE (VALUE)) == MODE_FLOAT \
627 && (VALUE) == CONST0_RTX (GET_MODE (VALUE))) \
630 /* The class value for index registers, and the one for base regs. */
631 #define INDEX_REG_CLASS GENERAL_REGS
632 #define BASE_REG_CLASS GENERAL_REGS
634 #define FP_REG_CLASS_P(CLASS) \
635 ((CLASS) == FP_REGS || (CLASS) == FPUPPER_REGS)
637 /* True if register is floating-point. */
638 #define FP_REGNO_P(N) ((N) >= FP_REG_FIRST && (N) <= FP_REG_LAST)
640 /* Given an rtx X being reloaded into a reg required to be
641 in class CLASS, return the class of reg to actually use.
642 In general this is just CLASS; but on some machines
643 in some cases it is preferable to use a more restrictive class. */
644 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
646 /* Return the register class of a scratch register needed to copy IN into
647 or out of a register in CLASS in MODE. If it can be done directly
650 Avoid doing any work for the common case calls. */
652 #define SECONDARY_RELOAD_CLASS(CLASS,MODE,IN) \
653 ((CLASS == BASE_REG_CLASS && GET_CODE (IN) == REG \
654 && REGNO (IN) < FIRST_PSEUDO_REGISTER) \
655 ? NO_REGS : secondary_reload_class (CLASS, MODE, IN))
657 /* On the PA it is not possible to directly move data between
658 GENERAL_REGS and FP_REGS. */
659 #define SECONDARY_MEMORY_NEEDED(CLASS1, CLASS2, MODE) \
660 (FP_REG_CLASS_P (CLASS1) != FP_REG_CLASS_P (CLASS2))
662 /* Return the stack location to use for secondary memory needed reloads. */
663 #define SECONDARY_MEMORY_NEEDED_RTX(MODE) \
664 gen_rtx_MEM (MODE, gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (-16)))
667 /* Stack layout; function entry, exit and calling. */
669 /* Define this if pushing a word on the stack
670 makes the stack pointer a smaller address. */
671 /* #define STACK_GROWS_DOWNWARD */
673 /* Believe it or not. */
674 #define ARGS_GROW_DOWNWARD
676 /* Define this if the nominal address of the stack frame
677 is at the high-address end of the local variables;
678 that is, each additional local variable allocated
679 goes at a more negative offset in the frame. */
680 /* #define FRAME_GROWS_DOWNWARD */
682 /* Offset within stack frame to start allocating local variables at.
683 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
684 first local allocated. Otherwise, it is the offset to the BEGINNING
685 of the first local allocated.
687 On the 32-bit ports, we reserve one slot for the previous frame
688 pointer and one fill slot. The fill slot is for compatibility
689 with HP compiled programs. On the 64-bit ports, we reserve one
690 slot for the previous frame pointer. */
691 #define STARTING_FRAME_OFFSET 8
693 /* Define STACK_ALIGNMENT_NEEDED to zero to disable final alignment
694 of the stack. The default is to align it to STACK_BOUNDARY. */
695 #define STACK_ALIGNMENT_NEEDED 0
697 /* If we generate an insn to push BYTES bytes,
698 this says how many the stack pointer really advances by.
699 On the HP-PA, don't define this because there are no push insns. */
700 /* #define PUSH_ROUNDING(BYTES) */
702 /* Offset of first parameter from the argument pointer register value.
703 This value will be negated because the arguments grow down.
704 Also note that on STACK_GROWS_UPWARD machines (such as this one)
705 this is the distance from the frame pointer to the end of the first
706 argument, not it's beginning. To get the real offset of the first
707 argument, the size of the argument must be added. */
709 #define FIRST_PARM_OFFSET(FNDECL) (TARGET_64BIT ? -64 : -32)
711 /* When a parameter is passed in a register, stack space is still
713 #define REG_PARM_STACK_SPACE(DECL) (TARGET_64BIT ? 64 : 16)
715 /* Define this if the above stack space is to be considered part of the
716 space allocated by the caller. */
717 #define OUTGOING_REG_PARM_STACK_SPACE
719 /* Keep the stack pointer constant throughout the function.
720 This is both an optimization and a necessity: longjmp
721 doesn't behave itself when the stack pointer moves within
723 #define ACCUMULATE_OUTGOING_ARGS 1
725 /* The weird HPPA calling conventions require a minimum of 48 bytes on
726 the stack: 16 bytes for register saves, and 32 bytes for magic.
727 This is the difference between the logical top of stack and the
730 On the 64-bit port, the HP C compiler allocates a 48-byte frame
731 marker, although the runtime documentation only describes a 16
732 byte marker. For compatibility, we allocate 48 bytes. */
733 #define STACK_POINTER_OFFSET \
734 (TARGET_64BIT ? -(current_function_outgoing_args_size + 48): -32)
736 #define STACK_DYNAMIC_OFFSET(FNDECL) \
738 ? (STACK_POINTER_OFFSET) \
739 : ((STACK_POINTER_OFFSET) - current_function_outgoing_args_size))
741 /* Value is 1 if returning from a function call automatically
742 pops the arguments described by the number-of-args field in the call.
743 FUNDECL is the declaration node of the function (as a tree),
744 FUNTYPE is the data type of the function (as a tree),
745 or for a library call it is an identifier node for the subroutine name. */
747 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) 0
749 /* Define how to find the value returned by a function.
750 VALTYPE is the data type of the value (as a tree).
751 If the precise function being called is known, FUNC is its FUNCTION_DECL;
752 otherwise, FUNC is 0. */
754 #define FUNCTION_VALUE(VALTYPE, FUNC) function_value (VALTYPE, FUNC)
756 /* Define how to find the value returned by a library function
757 assuming the value has mode MODE. */
759 #define LIBCALL_VALUE(MODE) \
761 (! TARGET_SOFT_FLOAT \
762 && ((MODE) == SFmode || (MODE) == DFmode) ? 32 : 28))
764 /* 1 if N is a possible register number for a function value
765 as seen by the caller. */
767 #define FUNCTION_VALUE_REGNO_P(N) \
768 ((N) == 28 || (! TARGET_SOFT_FLOAT && (N) == 32))
771 /* Define a data type for recording info about an argument list
772 during the scan of that argument list. This data type should
773 hold all necessary information about the function itself
774 and about the args processed so far, enough to enable macros
775 such as FUNCTION_ARG to determine where the next arg should go.
777 On the HP-PA, the WORDS field holds the number of words
778 of arguments scanned so far (including the invisible argument,
779 if any, which holds the structure-value-address). Thus, 4 or
780 more means all following args should go on the stack.
782 The INCOMING field tracks whether this is an "incoming" or
785 The INDIRECT field indicates whether this is is an indirect
788 The NARGS_PROTOTYPE field indicates that an argument does not
789 have a prototype when it less than or equal to 0. */
791 struct hppa_args {int words, nargs_prototype, incoming, indirect; };
793 #define CUMULATIVE_ARGS struct hppa_args
795 /* Initialize a variable CUM of type CUMULATIVE_ARGS
796 for a call to a function whose data type is FNTYPE.
797 For a library call, FNTYPE is 0. */
799 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,FNDECL) \
801 (CUM).incoming = 0, \
802 (CUM).indirect = (FNTYPE) && !(FNDECL), \
803 (CUM).nargs_prototype = (FNTYPE && TYPE_ARG_TYPES (FNTYPE) \
804 ? (list_length (TYPE_ARG_TYPES (FNTYPE)) - 1 \
805 + (TYPE_MODE (TREE_TYPE (FNTYPE)) == BLKmode \
806 || RETURN_IN_MEMORY (TREE_TYPE (FNTYPE)))) \
811 /* Similar, but when scanning the definition of a procedure. We always
812 set NARGS_PROTOTYPE large so we never return a PARALLEL. */
814 #define INIT_CUMULATIVE_INCOMING_ARGS(CUM,FNTYPE,IGNORE) \
816 (CUM).incoming = 1, \
817 (CUM).indirect = 0, \
818 (CUM).nargs_prototype = 1000
820 /* Figure out the size in words of the function argument. The size
821 returned by this macro should always be greater than zero because
822 we pass variable and zero sized objects by reference. */
824 #define FUNCTION_ARG_SIZE(MODE, TYPE) \
825 ((((MODE) != BLKmode \
826 ? (HOST_WIDE_INT) GET_MODE_SIZE (MODE) \
827 : int_size_in_bytes (TYPE)) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
829 /* Update the data in CUM to advance over an argument
830 of mode MODE and data type TYPE.
831 (TYPE is null for libcalls where that information may not be available.) */
833 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
834 { (CUM).nargs_prototype--; \
835 (CUM).words += FUNCTION_ARG_SIZE(MODE, TYPE) \
836 + (((CUM).words & 01) && (TYPE) != 0 \
837 && FUNCTION_ARG_SIZE(MODE, TYPE) > 1); \
840 /* Determine where to put an argument to a function.
841 Value is zero to push the argument on the stack,
842 or a hard register in which to store the argument.
844 MODE is the argument's machine mode.
845 TYPE is the data type of the argument (as a tree).
846 This is null for libcalls where that information may
848 CUM is a variable of type CUMULATIVE_ARGS which gives info about
849 the preceding args and about the function being called.
850 NAMED is nonzero if this argument is a named parameter
851 (otherwise it is an extra parameter matching an ellipsis).
853 On the HP-PA the first four words of args are normally in registers
854 and the rest are pushed. But any arg that won't entirely fit in regs
857 Arguments passed in registers are either 1 or 2 words long.
859 The caller must make a distinction between calls to explicitly named
860 functions and calls through pointers to functions -- the conventions
861 are different! Calls through pointers to functions only use general
862 registers for the first four argument words.
864 Of course all this is different for the portable runtime model
865 HP wants everyone to use for ELF. Ugh. Here's a quick description
866 of how it's supposed to work.
868 1) callee side remains unchanged. It expects integer args to be
869 in the integer registers, float args in the float registers and
870 unnamed args in integer registers.
872 2) caller side now depends on if the function being called has
873 a prototype in scope (rather than if it's being called indirectly).
875 2a) If there is a prototype in scope, then arguments are passed
876 according to their type (ints in integer registers, floats in float
877 registers, unnamed args in integer registers.
879 2b) If there is no prototype in scope, then floating point arguments
880 are passed in both integer and float registers. egad.
882 FYI: The portable parameter passing conventions are almost exactly like
883 the standard parameter passing conventions on the RS6000. That's why
884 you'll see lots of similar code in rs6000.h. */
886 #define FUNCTION_ARG_PADDING(MODE, TYPE) function_arg_padding ((MODE), (TYPE))
888 /* Do not expect to understand this without reading it several times. I'm
889 tempted to try and simply it, but I worry about breaking something. */
891 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) \
892 function_arg (&CUM, MODE, TYPE, NAMED)
894 /* Nonzero if we do not know how to pass TYPE solely in registers. */
895 #define MUST_PASS_IN_STACK(MODE,TYPE) \
897 && (TREE_CODE (TYPE_SIZE (TYPE)) != INTEGER_CST \
898 || TREE_ADDRESSABLE (TYPE)))
900 /* For an arg passed partly in registers and partly in memory,
901 this is the number of registers used.
902 For args passed entirely in registers or entirely in memory, zero. */
904 /* For PA32 there are never split arguments. PA64, on the other hand, can
905 pass arguments partially in registers and partially in memory. */
906 #define FUNCTION_ARG_PARTIAL_NREGS(CUM, MODE, TYPE, NAMED) \
907 (TARGET_64BIT ? function_arg_partial_nregs (&CUM, MODE, TYPE, NAMED) : 0)
909 /* If defined, a C expression that gives the alignment boundary, in
910 bits, of an argument with the specified mode and type. If it is
911 not defined, `PARM_BOUNDARY' is used for all arguments. */
913 /* Arguments larger than one word are double word aligned. */
915 #define FUNCTION_ARG_BOUNDARY(MODE, TYPE) \
917 ? (integer_zerop (TYPE_SIZE (TYPE)) \
918 || !TREE_CONSTANT (TYPE_SIZE (TYPE)) \
919 || int_size_in_bytes (TYPE) <= UNITS_PER_WORD) \
920 : GET_MODE_SIZE(MODE) <= UNITS_PER_WORD) \
921 ? PARM_BOUNDARY : MAX_PARM_BOUNDARY)
923 /* In the 32-bit runtime, arguments larger than eight bytes are passed
924 by invisible reference. As a GCC extension, we also pass anything
925 with a zero or variable size by reference.
927 The 64-bit runtime does not describe passing any types by invisible
928 reference. The internals of GCC can't currently handle passing
929 empty structures, and zero or variable length arrays when they are
930 not passed entirely on the stack or by reference. Thus, as a GCC
931 extension, we pass these types by reference. The HP compiler doesn't
932 support these types, so hopefully there shouldn't be any compatibility
933 issues. This may have to be revisited when HP releases a C99 compiler
934 or updates the ABI. */
935 #define FUNCTION_ARG_PASS_BY_REFERENCE(CUM, MODE, TYPE, NAMED) \
937 ? ((TYPE) && int_size_in_bytes (TYPE) <= 0) \
938 : (((TYPE) && (int_size_in_bytes (TYPE) > 8 \
939 || int_size_in_bytes (TYPE) <= 0)) \
940 || ((MODE) && GET_MODE_SIZE (MODE) > 8)))
942 #define FUNCTION_ARG_CALLEE_COPIES(CUM, MODE, TYPE, NAMED) \
943 FUNCTION_ARG_PASS_BY_REFERENCE (CUM, MODE, TYPE, NAMED)
946 extern GTY(()) rtx hppa_compare_op0;
947 extern GTY(()) rtx hppa_compare_op1;
948 extern enum cmp_type hppa_branch_type;
950 /* On HPPA, we emit profiling code as rtl via PROFILE_HOOK rather than
951 as assembly via FUNCTION_PROFILER. Just output a local label.
952 We can't use the function label because the GAS SOM target can't
953 handle the difference of a global symbol and a local symbol. */
955 #ifndef FUNC_BEGIN_PROLOG_LABEL
956 #define FUNC_BEGIN_PROLOG_LABEL "LFBP"
959 #define FUNCTION_PROFILER(FILE, LABEL) \
960 (*targetm.asm_out.internal_label) (FILE, FUNC_BEGIN_PROLOG_LABEL, LABEL)
962 #define PROFILE_HOOK(label_no) hppa_profile_hook (label_no)
963 void hppa_profile_hook PARAMS ((int label_no));
965 /* The profile counter if emitted must come before the prologue. */
966 #define PROFILE_BEFORE_PROLOGUE 1
968 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
969 the stack pointer does not matter. The value is tested only in
970 functions that have frame pointers.
971 No definition is equivalent to always zero. */
973 extern int may_call_alloca;
975 #define EXIT_IGNORE_STACK \
976 (get_frame_size () != 0 \
977 || current_function_calls_alloca || current_function_outgoing_args_size)
979 /* Output assembler code for a block containing the constant parts
980 of a trampoline, leaving space for the variable parts.\
982 The trampoline sets the static chain pointer to STATIC_CHAIN_REGNUM
983 and then branches to the specified routine.
985 This code template is copied from text segment to stack location
986 and then patched with INITIALIZE_TRAMPOLINE to contain
987 valid values, and then entered as a subroutine.
989 It is best to keep this as small as possible to avoid having to
990 flush multiple lines in the cache. */
992 #define TRAMPOLINE_TEMPLATE(FILE) \
994 if (! TARGET_64BIT) \
996 fputs ("\tldw 36(%r22),%r21\n", FILE); \
997 fputs ("\tbb,>=,n %r21,30,.+16\n", FILE); \
998 if (ASSEMBLER_DIALECT == 0) \
999 fputs ("\tdepi 0,31,2,%r21\n", FILE); \
1001 fputs ("\tdepwi 0,31,2,%r21\n", FILE); \
1002 fputs ("\tldw 4(%r21),%r19\n", FILE); \
1003 fputs ("\tldw 0(%r21),%r21\n", FILE); \
1004 fputs ("\tldsid (%r21),%r1\n", FILE); \
1005 fputs ("\tmtsp %r1,%sr0\n", FILE); \
1006 fputs ("\tbe 0(%sr0,%r21)\n", FILE); \
1007 fputs ("\tldw 40(%r22),%r29\n", FILE); \
1008 fputs ("\t.word 0\n", FILE); \
1009 fputs ("\t.word 0\n", FILE); \
1010 fputs ("\t.word 0\n", FILE); \
1011 fputs ("\t.word 0\n", FILE); \
1015 fputs ("\t.dword 0\n", FILE); \
1016 fputs ("\t.dword 0\n", FILE); \
1017 fputs ("\t.dword 0\n", FILE); \
1018 fputs ("\t.dword 0\n", FILE); \
1019 fputs ("\tmfia %r31\n", FILE); \
1020 fputs ("\tldd 24(%r31),%r1\n", FILE); \
1021 fputs ("\tldd 24(%r1),%r27\n", FILE); \
1022 fputs ("\tldd 16(%r1),%r1\n", FILE); \
1023 fputs ("\tbve (%r1)\n", FILE); \
1024 fputs ("\tldd 32(%r31),%r31\n", FILE); \
1025 fputs ("\t.dword 0 ; fptr\n", FILE); \
1026 fputs ("\t.dword 0 ; static link\n", FILE); \
1030 /* Length in units of the trampoline for entering a nested function.
1032 Flush the cache entries corresponding to the first and last addresses
1033 of the trampoline. This is necessary as the trampoline may cross two
1036 If the code part of the trampoline ever grows to > 32 bytes, then it
1037 will become necessary to hack on the cacheflush pattern in pa.md. */
1039 #define TRAMPOLINE_SIZE (TARGET_64BIT ? 72 : 52)
1041 /* Emit RTL insns to initialize the variable parts of a trampoline.
1042 FNADDR is an RTX for the address of the function's pure code.
1043 CXT is an RTX for the static chain value for the function.
1045 Move the function address to the trampoline template at offset 36.
1046 Move the static chain value to trampoline template at offset 40.
1047 Move the trampoline address to trampoline template at offset 44.
1048 Move r19 to trampoline template at offset 48. The latter two
1049 words create a plabel for the indirect call to the trampoline. */
1051 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
1053 if (! TARGET_64BIT) \
1055 rtx start_addr, end_addr; \
1057 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 36)); \
1058 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (FNADDR)); \
1059 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 40)); \
1060 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (CXT)); \
1061 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 44)); \
1062 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (TRAMP)); \
1063 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 48)); \
1064 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), \
1065 gen_rtx_REG (Pmode, 19)); \
1066 /* fdc and fic only use registers for the address to flush, \
1067 they do not accept integer displacements. */ \
1068 start_addr = force_reg (Pmode, (TRAMP)); \
1069 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1070 emit_insn (gen_dcacheflush (start_addr, end_addr)); \
1071 end_addr = force_reg (Pmode, plus_constant (start_addr, 32)); \
1072 emit_insn (gen_icacheflush (start_addr, end_addr, start_addr, \
1073 gen_reg_rtx (Pmode), gen_reg_rtx (Pmode)));\
1077 rtx start_addr, end_addr; \
1079 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 56)); \
1080 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (FNADDR)); \
1081 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 64)); \
1082 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), (CXT)); \
1083 /* Create a fat pointer for the trampoline. */ \
1084 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1085 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 16)); \
1086 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), end_addr); \
1087 end_addr = gen_rtx_REG (Pmode, 27); \
1088 start_addr = memory_address (Pmode, plus_constant ((TRAMP), 24)); \
1089 emit_move_insn (gen_rtx_MEM (Pmode, start_addr), end_addr); \
1090 /* fdc and fic only use registers for the address to flush, \
1091 they do not accept integer displacements. */ \
1092 start_addr = force_reg (Pmode, (TRAMP)); \
1093 end_addr = force_reg (Pmode, plus_constant ((TRAMP), 32)); \
1094 emit_insn (gen_dcacheflush (start_addr, end_addr)); \
1095 end_addr = force_reg (Pmode, plus_constant (start_addr, 32)); \
1096 emit_insn (gen_icacheflush (start_addr, end_addr, start_addr, \
1097 gen_reg_rtx (Pmode), gen_reg_rtx (Pmode)));\
1101 /* Perform any machine-specific adjustment in the address of the trampoline.
1102 ADDR contains the address that was passed to INITIALIZE_TRAMPOLINE.
1103 Adjust the trampoline address to point to the plabel at offset 44. */
1105 #define TRAMPOLINE_ADJUST_ADDRESS(ADDR) \
1106 if (!TARGET_64BIT) (ADDR) = memory_address (Pmode, plus_constant ((ADDR), 46))
1108 /* Emit code for a call to builtin_saveregs. We must emit USE insns which
1109 reference the 4 integer arg registers and 4 fp arg registers.
1110 Ordinarily they are not call used registers, but they are for
1111 _builtin_saveregs, so we must make this explicit. */
1113 #define EXPAND_BUILTIN_SAVEREGS() hppa_builtin_saveregs ()
1115 /* Implement `va_start' for varargs and stdarg. */
1117 #define EXPAND_BUILTIN_VA_START(valist, nextarg) \
1118 hppa_va_start (valist, nextarg)
1120 /* Implement `va_arg'. */
1122 #define EXPAND_BUILTIN_VA_ARG(valist, type) \
1123 hppa_va_arg (valist, type)
1125 /* Addressing modes, and classification of registers for them.
1127 Using autoincrement addressing modes on PA8000 class machines is
1130 #define HAVE_POST_INCREMENT (pa_cpu < PROCESSOR_8000)
1131 #define HAVE_POST_DECREMENT (pa_cpu < PROCESSOR_8000)
1133 #define HAVE_PRE_DECREMENT (pa_cpu < PROCESSOR_8000)
1134 #define HAVE_PRE_INCREMENT (pa_cpu < PROCESSOR_8000)
1136 /* Macros to check register numbers against specific register classes. */
1138 /* These assume that REGNO is a hard or pseudo reg number.
1139 They give nonzero only if REGNO is a hard reg of the suitable class
1140 or a pseudo reg currently allocated to a suitable hard reg.
1141 Since they use reg_renumber, they are safe only once reg_renumber
1142 has been allocated, which happens in local-alloc.c. */
1144 #define REGNO_OK_FOR_INDEX_P(REGNO) \
1145 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1146 #define REGNO_OK_FOR_BASE_P(REGNO) \
1147 ((REGNO) && ((REGNO) < 32 || (unsigned) reg_renumber[REGNO] < 32))
1148 #define REGNO_OK_FOR_FP_P(REGNO) \
1149 (FP_REGNO_P (REGNO) || FP_REGNO_P (reg_renumber[REGNO]))
1151 /* Now macros that check whether X is a register and also,
1152 strictly, whether it is in a specified class.
1154 These macros are specific to the HP-PA, and may be used only
1155 in code for printing assembler insns and in conditions for
1156 define_optimization. */
1158 /* 1 if X is an fp register. */
1160 #define FP_REG_P(X) (REG_P (X) && REGNO_OK_FOR_FP_P (REGNO (X)))
1162 /* Maximum number of registers that can appear in a valid memory address. */
1164 #define MAX_REGS_PER_ADDRESS 2
1166 /* Recognize any constant value that is a valid address except
1167 for symbolic addresses. We get better CSE by rejecting them
1168 here and allowing hppa_legitimize_address to break them up. We
1169 use most of the constants accepted by CONSTANT_P, except CONST_DOUBLE. */
1171 #define CONSTANT_ADDRESS_P(X) \
1172 ((GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
1173 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
1174 || GET_CODE (X) == HIGH) \
1175 && (reload_in_progress || reload_completed || ! symbolic_expression_p (X)))
1177 /* Include all constant integers and constant doubles, but not
1178 floating-point, except for floating-point zero.
1180 Reject LABEL_REFs if we're not using gas or the new HP assembler.
1182 ?!? For now also reject CONST_DOUBLES in 64bit mode. This will need
1184 #ifndef NEW_HP_ASSEMBLER
1185 #define NEW_HP_ASSEMBLER 0
1187 #define LEGITIMATE_CONSTANT_P(X) \
1188 ((GET_MODE_CLASS (GET_MODE (X)) != MODE_FLOAT \
1189 || (X) == CONST0_RTX (GET_MODE (X))) \
1190 && (NEW_HP_ASSEMBLER || TARGET_GAS || GET_CODE (X) != LABEL_REF) \
1191 && !(TARGET_64BIT && GET_CODE (X) == CONST_DOUBLE) \
1192 && !(TARGET_64BIT && GET_CODE (X) == CONST_INT \
1193 && !(HOST_BITS_PER_WIDE_INT <= 32 \
1194 || (INTVAL (X) >= (HOST_WIDE_INT) -32 << 31 \
1195 && INTVAL (X) < (HOST_WIDE_INT) 32 << 31) \
1196 || cint_ok_for_move (INTVAL (X)))) \
1197 && !function_label_operand (X, VOIDmode))
1199 /* Subroutine for EXTRA_CONSTRAINT.
1201 Return 1 iff OP is a pseudo which did not get a hard register and
1202 we are running the reload pass. */
1204 #define IS_RELOADING_PSEUDO_P(OP) \
1205 ((reload_in_progress \
1206 && GET_CODE (OP) == REG \
1207 && REGNO (OP) >= FIRST_PSEUDO_REGISTER \
1208 && reg_renumber [REGNO (OP)] < 0))
1210 /* Optional extra constraints for this machine. Borrowed from sparc.h.
1212 For the HPPA, `Q' means that this is a memory operand but not a
1213 symbolic memory operand. Note that an unassigned pseudo register
1214 is such a memory operand. Needed because reload will generate
1215 these things in insns and then not re-recognize the insns, causing
1216 constrain_operands to fail.
1218 `R' is used for scaled indexed addresses.
1220 `S' is the constant 31.
1222 `T' is for fp loads and stores. */
1223 #define EXTRA_CONSTRAINT(OP, C) \
1225 (IS_RELOADING_PSEUDO_P (OP) \
1226 || (GET_CODE (OP) == MEM \
1227 && (memory_address_p (GET_MODE (OP), XEXP (OP, 0))\
1228 || reload_in_progress) \
1229 && ! symbolic_memory_operand (OP, VOIDmode) \
1230 && !(GET_CODE (XEXP (OP, 0)) == PLUS \
1231 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT\
1232 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT))))\
1234 (GET_CODE (OP) == MEM \
1235 && GET_CODE (XEXP (OP, 0)) == PLUS \
1236 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT \
1237 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT) \
1238 && (move_operand (OP, GET_MODE (OP)) \
1239 || memory_address_p (GET_MODE (OP), XEXP (OP, 0))\
1240 || reload_in_progress)) \
1242 (GET_CODE (OP) == MEM \
1243 /* Using DFmode forces only short displacements \
1244 to be recognized as valid in reg+d addresses. \
1245 However, this is not necessary for PA2.0 since\
1246 it has long FP loads/stores. \
1248 FIXME: the ELF32 linker clobbers the LSB of \
1249 the FP register number in {fldw,fstw} insns. \
1250 Thus, we only allow long FP loads/stores on \
1252 && memory_address_p ((TARGET_PA_20 \
1257 && !(GET_CODE (XEXP (OP, 0)) == LO_SUM \
1258 && GET_CODE (XEXP (XEXP (OP, 0), 0)) == REG \
1259 && REG_OK_FOR_BASE_P (XEXP (XEXP (OP, 0), 0))\
1260 && GET_CODE (XEXP (XEXP (OP, 0), 1)) == UNSPEC\
1261 && GET_MODE (XEXP (OP, 0)) == Pmode) \
1262 && !(GET_CODE (XEXP (OP, 0)) == PLUS \
1263 && (GET_CODE (XEXP (XEXP (OP, 0), 0)) == MULT\
1264 || GET_CODE (XEXP (XEXP (OP, 0), 1)) == MULT)))\
1266 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 63) \
1268 (GET_CODE (OP) == MEM \
1269 && GET_CODE (XEXP (OP, 0)) == LO_SUM \
1270 && GET_CODE (XEXP (XEXP (OP, 0), 0)) == REG \
1271 && REG_OK_FOR_BASE_P (XEXP (XEXP (OP, 0), 0)) \
1272 && GET_CODE (XEXP (XEXP (OP, 0), 1)) == UNSPEC \
1273 && GET_MODE (XEXP (OP, 0)) == Pmode) \
1275 (GET_CODE (OP) == CONST_INT && INTVAL (OP) == 31) : 0))))))
1278 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
1279 and check its validity for a certain class.
1280 We have two alternate definitions for each of them.
1281 The usual definition accepts all pseudo regs; the other rejects
1282 them unless they have been allocated suitable hard regs.
1283 The symbol REG_OK_STRICT causes the latter definition to be used.
1285 Most source files want to accept pseudo regs in the hope that
1286 they will get allocated to the class that the insn wants them to be in.
1287 Source files for reload pass need to be strict.
1288 After reload, it makes no difference, since pseudo regs have
1289 been eliminated by then. */
1291 #ifndef REG_OK_STRICT
1293 /* Nonzero if X is a hard reg that can be used as an index
1294 or if it is a pseudo reg. */
1295 #define REG_OK_FOR_INDEX_P(X) \
1296 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1297 /* Nonzero if X is a hard reg that can be used as a base reg
1298 or if it is a pseudo reg. */
1299 #define REG_OK_FOR_BASE_P(X) \
1300 (REGNO (X) && (REGNO (X) < 32 || REGNO (X) >= FIRST_PSEUDO_REGISTER))
1304 /* Nonzero if X is a hard reg that can be used as an index. */
1305 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
1306 /* Nonzero if X is a hard reg that can be used as a base reg. */
1307 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
1311 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
1312 that is a valid memory address for an instruction.
1313 The MODE argument is the machine mode for the MEM expression
1314 that wants to use this address.
1316 On the HP-PA, the actual legitimate addresses must be
1317 REG+REG, REG+(REG*SCALE) or REG+SMALLINT.
1318 But we can treat a SYMBOL_REF as legitimate if it is part of this
1319 function's constant-pool, because such addresses can actually
1320 be output as REG+SMALLINT.
1322 Note we only allow 5 bit immediates for access to a constant address;
1323 doing so avoids losing for loading/storing a FP register at an address
1324 which will not fit in 5 bits. */
1326 #define VAL_5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x10 < 0x20)
1327 #define INT_5_BITS(X) VAL_5_BITS_P (INTVAL (X))
1329 #define VAL_U5_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) < 0x20)
1330 #define INT_U5_BITS(X) VAL_U5_BITS_P (INTVAL (X))
1332 #define VAL_11_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x400 < 0x800)
1333 #define INT_11_BITS(X) VAL_11_BITS_P (INTVAL (X))
1335 #define VAL_14_BITS_P(X) ((unsigned HOST_WIDE_INT)(X) + 0x2000 < 0x4000)
1336 #define INT_14_BITS(X) VAL_14_BITS_P (INTVAL (X))
1338 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
1340 if ((REG_P (X) && REG_OK_FOR_BASE_P (X)) \
1341 || ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_DEC \
1342 || GET_CODE (X) == PRE_INC || GET_CODE (X) == POST_INC) \
1343 && REG_P (XEXP (X, 0)) \
1344 && REG_OK_FOR_BASE_P (XEXP (X, 0)))) \
1346 else if (GET_CODE (X) == PLUS) \
1348 rtx base = 0, index = 0; \
1349 if (REG_P (XEXP (X, 0)) \
1350 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
1351 base = XEXP (X, 0), index = XEXP (X, 1); \
1352 else if (REG_P (XEXP (X, 1)) \
1353 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
1354 base = XEXP (X, 1), index = XEXP (X, 0); \
1356 if (GET_CODE (index) == CONST_INT \
1357 && ((INT_14_BITS (index) \
1358 && (TARGET_SOFT_FLOAT \
1360 && ((MODE == SFmode \
1361 && (INTVAL (index) % 4) == 0)\
1362 || (MODE == DFmode \
1363 && (INTVAL (index) % 8) == 0)))\
1364 || ((MODE) != SFmode && (MODE) != DFmode))) \
1365 || INT_5_BITS (index))) \
1367 if (! TARGET_SOFT_FLOAT \
1368 && ! TARGET_DISABLE_INDEXING \
1370 && ((MODE) == SFmode || (MODE) == DFmode) \
1371 && GET_CODE (index) == MULT \
1372 && GET_CODE (XEXP (index, 0)) == REG \
1373 && REG_OK_FOR_BASE_P (XEXP (index, 0)) \
1374 && GET_CODE (XEXP (index, 1)) == CONST_INT \
1375 && INTVAL (XEXP (index, 1)) == ((MODE) == SFmode ? 4 : 8))\
1378 else if (GET_CODE (X) == LO_SUM \
1379 && GET_CODE (XEXP (X, 0)) == REG \
1380 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1381 && CONSTANT_P (XEXP (X, 1)) \
1382 && (TARGET_SOFT_FLOAT \
1383 /* We can allow symbolic LO_SUM addresses\
1387 && GET_CODE (XEXP (X, 1)) != CONST_INT)\
1388 || ((MODE) != SFmode \
1389 && (MODE) != DFmode))) \
1391 else if (GET_CODE (X) == LO_SUM \
1392 && GET_CODE (XEXP (X, 0)) == SUBREG \
1393 && GET_CODE (SUBREG_REG (XEXP (X, 0))) == REG\
1394 && REG_OK_FOR_BASE_P (SUBREG_REG (XEXP (X, 0)))\
1395 && CONSTANT_P (XEXP (X, 1)) \
1396 && (TARGET_SOFT_FLOAT \
1397 /* We can allow symbolic LO_SUM addresses\
1401 && GET_CODE (XEXP (X, 1)) != CONST_INT)\
1402 || ((MODE) != SFmode \
1403 && (MODE) != DFmode))) \
1405 else if (GET_CODE (X) == LABEL_REF \
1406 || (GET_CODE (X) == CONST_INT \
1407 && INT_5_BITS (X))) \
1409 /* Needed for -fPIC */ \
1410 else if (GET_CODE (X) == LO_SUM \
1411 && GET_CODE (XEXP (X, 0)) == REG \
1412 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
1413 && GET_CODE (XEXP (X, 1)) == UNSPEC \
1414 && (TARGET_SOFT_FLOAT \
1415 || (TARGET_PA_20 && !TARGET_ELF32) \
1416 || ((MODE) != SFmode \
1417 && (MODE) != DFmode))) \
1421 /* Look for machine dependent ways to make the invalid address AD a
1424 For the PA, transform:
1426 memory(X + <large int>)
1430 if (<large int> & mask) >= 16
1431 Y = (<large int> & ~mask) + mask + 1 Round up.
1433 Y = (<large int> & ~mask) Round down.
1435 memory (Z + (<large int> - Y));
1437 This makes reload inheritance and reload_cse work better since Z
1440 There may be more opportunities to improve code with this hook. */
1441 #define LEGITIMIZE_RELOAD_ADDRESS(AD, MODE, OPNUM, TYPE, IND, WIN) \
1443 int offset, newoffset, mask; \
1444 rtx new, temp = NULL_RTX; \
1446 mask = (GET_MODE_CLASS (MODE) == MODE_FLOAT \
1447 ? (TARGET_PA_20 && !TARGET_ELF32 ? 0x3fff : 0x1f) : 0x3fff); \
1450 && GET_CODE (AD) == PLUS) \
1451 temp = simplify_binary_operation (PLUS, Pmode, \
1452 XEXP (AD, 0), XEXP (AD, 1)); \
1454 new = temp ? temp : AD; \
1457 && GET_CODE (new) == PLUS \
1458 && GET_CODE (XEXP (new, 0)) == REG \
1459 && GET_CODE (XEXP (new, 1)) == CONST_INT) \
1461 offset = INTVAL (XEXP ((new), 1)); \
1463 /* Choose rounding direction. Round up if we are >= halfway. */ \
1464 if ((offset & mask) >= ((mask + 1) / 2)) \
1465 newoffset = (offset & ~mask) + mask + 1; \
1467 newoffset = offset & ~mask; \
1469 if (newoffset != 0 \
1470 && VAL_14_BITS_P (newoffset)) \
1473 temp = gen_rtx_PLUS (Pmode, XEXP (new, 0), \
1474 GEN_INT (newoffset)); \
1475 AD = gen_rtx_PLUS (Pmode, temp, GEN_INT (offset - newoffset));\
1476 push_reload (XEXP (AD, 0), 0, &XEXP (AD, 0), 0, \
1477 BASE_REG_CLASS, Pmode, VOIDmode, 0, 0, \
1487 /* Try machine-dependent ways of modifying an illegitimate address
1488 to be legitimate. If we find one, return the new, valid address.
1489 This macro is used in only one place: `memory_address' in explow.c.
1491 OLDX is the address as it was before break_out_memory_refs was called.
1492 In some cases it is useful to look at this to decide what needs to be done.
1494 MODE and WIN are passed so that this macro can use
1495 GO_IF_LEGITIMATE_ADDRESS.
1497 It is always safe for this macro to do nothing. It exists to recognize
1498 opportunities to optimize the output. */
1500 #define LEGITIMIZE_ADDRESS(X, OLDX, MODE, WIN) \
1501 { rtx orig_x = (X); \
1502 (X) = hppa_legitimize_address (X, OLDX, MODE); \
1503 if ((X) != orig_x && memory_address_p (MODE, X)) \
1506 /* Go to LABEL if ADDR (a legitimate address expression)
1507 has an effect that depends on the machine mode it is used for. */
1509 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
1510 if (GET_CODE (ADDR) == PRE_DEC \
1511 || GET_CODE (ADDR) == POST_DEC \
1512 || GET_CODE (ADDR) == PRE_INC \
1513 || GET_CODE (ADDR) == POST_INC) \
1516 #define TARGET_ASM_SELECT_SECTION pa_select_section
1518 /* Define this macro if references to a symbol must be treated
1519 differently depending on something about the variable or
1520 function named by the symbol (such as what section it is in).
1522 The macro definition, if any, is executed immediately after the
1523 rtl for DECL or other node is created.
1524 The value of the rtl will be a `mem' whose address is a
1527 The usual thing for this macro to do is to a flag in the
1528 `symbol_ref' (such as `SYMBOL_REF_FLAG') or to store a modified
1529 name string in the `symbol_ref' (if one bit is not enough
1532 On the HP-PA we use this to indicate if a symbol is in text or
1533 data space. Also, function labels need special treatment. */
1535 #define TEXT_SPACE_P(DECL)\
1536 (TREE_CODE (DECL) == FUNCTION_DECL \
1537 || (TREE_CODE (DECL) == VAR_DECL \
1538 && TREE_READONLY (DECL) && ! TREE_SIDE_EFFECTS (DECL) \
1539 && (! DECL_INITIAL (DECL) || ! reloc_needed (DECL_INITIAL (DECL))) \
1541 || (TREE_CODE_CLASS (TREE_CODE (DECL)) == 'c' \
1542 && !(TREE_CODE (DECL) == STRING_CST && flag_writable_strings)))
1544 #define FUNCTION_NAME_P(NAME) (*(NAME) == '@')
1546 /* Specify the machine mode that this machine uses
1547 for the index in the tablejump instruction. */
1548 #define CASE_VECTOR_MODE (TARGET_BIG_SWITCH ? TImode : DImode)
1550 /* Jump tables must be 32 bit aligned, no matter the size of the element. */
1551 #define ADDR_VEC_ALIGN(ADDR_VEC) 2
1553 /* Define this as 1 if `char' should by default be signed; else as 0. */
1554 #define DEFAULT_SIGNED_CHAR 1
1556 /* Max number of bytes we can move from memory to memory
1557 in one reasonably fast instruction. */
1560 /* Higher than the default as we prefer to use simple move insns
1561 (better scheduling and delay slot filling) and because our
1562 built-in block move is really a 2X unrolled loop.
1564 Believe it or not, this has to be big enough to allow for copying all
1565 arguments passed in registers to avoid infinite recursion during argument
1566 setup for a function call. Why? Consider how we copy the stack slots
1567 reserved for parameters when they may be trashed by a call. */
1568 #define MOVE_RATIO (TARGET_64BIT ? 8 : 4)
1570 /* Define if operations between registers always perform the operation
1571 on the full register even if a narrower mode is specified. */
1572 #define WORD_REGISTER_OPERATIONS
1574 /* Define if loading in MODE, an integral mode narrower than BITS_PER_WORD
1575 will either zero-extend or sign-extend. The value of this macro should
1576 be the code that says which one of the two operations is implicitly
1577 done, NIL if none. */
1578 #define LOAD_EXTEND_OP(MODE) ZERO_EXTEND
1580 /* Nonzero if access to memory by bytes is slow and undesirable. */
1581 #define SLOW_BYTE_ACCESS 1
1583 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
1584 is done just by pretending it is already truncated. */
1585 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
1587 /* When a prototype says `char' or `short', really pass an `int'. */
1588 #define PROMOTE_PROTOTYPES 1
1589 #define PROMOTE_FUNCTION_RETURN 1
1591 /* Specify the machine mode that pointers have.
1592 After generation of rtl, the compiler makes no further distinction
1593 between pointers and any other objects of this machine mode. */
1594 #define Pmode word_mode
1596 /* Given a comparison code (EQ, NE, etc.) and the first operand of a COMPARE,
1597 return the mode to be used for the comparison. For floating-point, CCFPmode
1598 should be used. CC_NOOVmode should be used when the first operand is a
1599 PLUS, MINUS, or NEG. CCmode should be used when no special processing is
1601 #define SELECT_CC_MODE(OP,X,Y) \
1602 (GET_MODE_CLASS (GET_MODE (X)) == MODE_FLOAT ? CCFPmode : CCmode) \
1604 /* A function address in a call instruction
1605 is a byte address (for indexing purposes)
1606 so give the MEM rtx a byte's mode. */
1607 #define FUNCTION_MODE SImode
1609 /* Define this if addresses of constant functions
1610 shouldn't be put through pseudo regs where they can be cse'd.
1611 Desirable on machines where ordinary constants are expensive
1612 but a CALL with constant address is cheap. */
1613 #define NO_FUNCTION_CSE
1615 /* Define this to be nonzero if shift instructions ignore all but the low-order
1617 #define SHIFT_COUNT_TRUNCATED 1
1619 /* Compute extra cost of moving data between one register class
1622 Make moves from SAR so expensive they should never happen. We used to
1623 have 0xffff here, but that generates overflow in rare cases.
1625 Copies involving a FP register and a non-FP register are relatively
1626 expensive because they must go through memory.
1628 Other copies are reasonably cheap. */
1629 #define REGISTER_MOVE_COST(MODE, CLASS1, CLASS2) \
1630 (CLASS1 == SHIFT_REGS ? 0x100 \
1631 : FP_REG_CLASS_P (CLASS1) && ! FP_REG_CLASS_P (CLASS2) ? 16 \
1632 : FP_REG_CLASS_P (CLASS2) && ! FP_REG_CLASS_P (CLASS1) ? 16 \
1635 /* Adjust the cost of branches. */
1636 #define BRANCH_COST (pa_cpu == PROCESSOR_8000 ? 2 : 1)
1638 /* Handling the special cases is going to get too complicated for a macro,
1639 just call `pa_adjust_insn_length' to do the real work. */
1640 #define ADJUST_INSN_LENGTH(INSN, LENGTH) \
1641 LENGTH += pa_adjust_insn_length (INSN, LENGTH);
1643 /* Millicode insns are actually function calls with some special
1644 constraints on arguments and register usage.
1646 Millicode calls always expect their arguments in the integer argument
1647 registers, and always return their result in %r29 (ret1). They
1648 are expected to clobber their arguments, %r1, %r29, and the return
1649 pointer which is %r31 on 32-bit and %r2 on 64-bit, and nothing else.
1651 This macro tells reorg that the references to arguments and
1652 millicode calls do not appear to happen until after the millicode call.
1653 This allows reorg to put insns which set the argument registers into the
1654 delay slot of the millicode call -- thus they act more like traditional
1657 Note we can not consider side effects of the insn to be delayed because
1658 the branch and link insn will clobber the return pointer. If we happened
1659 to use the return pointer in the delay slot of the call, then we lose.
1661 get_attr_type will try to recognize the given insn, so make sure to
1662 filter out things it will not accept -- SEQUENCE, USE and CLOBBER insns
1664 #define INSN_REFERENCES_ARE_DELAYED(X) (insn_refs_are_delayed (X))
1667 /* Control the assembler format that we output. */
1669 /* Output to assembler file text saying following lines
1670 may contain character constants, extra white space, comments, etc. */
1672 #define ASM_APP_ON ""
1674 /* Output to assembler file text saying following lines
1675 no longer contain unusual constructs. */
1677 #define ASM_APP_OFF ""
1679 /* This is how to output the definition of a user-level label named NAME,
1680 such as the label on a static function or variable NAME. */
1682 #define ASM_OUTPUT_LABEL(FILE, NAME) \
1683 do { assemble_name (FILE, NAME); \
1684 fputc ('\n', FILE); } while (0)
1686 /* This is how to output a reference to a user-level label named NAME.
1687 `assemble_name' uses this. */
1689 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1691 const char *xname = (NAME); \
1692 if (FUNCTION_NAME_P (NAME)) \
1694 if (xname[0] == '*') \
1697 fputs (user_label_prefix, FILE); \
1698 fputs (xname, FILE); \
1701 /* This is how to store into the string LABEL
1702 the symbol_ref name of an internal numbered label where
1703 PREFIX is the class of label and NUM is the number within the class.
1704 This is suitable for output with `assemble_name'. */
1706 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1707 sprintf (LABEL, "*%c$%s%04ld", (PREFIX)[0], (PREFIX) + 1, (long)(NUM))
1709 #define TARGET_ASM_GLOBALIZE_LABEL pa_globalize_label
1711 #define ASM_OUTPUT_ASCII(FILE, P, SIZE) \
1712 output_ascii ((FILE), (P), (SIZE))
1714 /* This is how to output an element of a case-vector that is absolute.
1715 Note that this method makes filling these branch delay slots
1718 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1719 if (TARGET_BIG_SWITCH) \
1720 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); \
1722 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1724 /* Jump tables are executable code and live in the TEXT section on the PA. */
1725 #define JUMP_TABLES_IN_TEXT_SECTION 1
1727 /* This is how to output an element of a case-vector that is relative.
1728 This must be defined correctly as it is used when generating PIC code.
1730 I believe it safe to use the same definition as ASM_OUTPUT_ADDR_VEC_ELT
1731 on the PA since ASM_OUTPUT_ADDR_VEC_ELT uses pc-relative jump instructions
1732 rather than a table of absolute addresses. */
1734 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1735 if (TARGET_BIG_SWITCH) \
1736 fprintf (FILE, "\tstw %%r1,-16(%%r30)\n\tldw T'L$%04d(%%r19),%%r1\n\tbv %%r0(%%r1)\n\tldw -16(%%r30),%%r1\n", VALUE); \
1738 fprintf (FILE, "\tb L$%04d\n\tnop\n", VALUE)
1740 /* This is how to output an assembler line
1741 that says to advance the location counter
1742 to a multiple of 2**LOG bytes. */
1744 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1745 fprintf (FILE, "\t.align %d\n", (1<<(LOG)))
1747 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1748 fprintf (FILE, "\t.blockz "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1749 (unsigned HOST_WIDE_INT)(SIZE))
1751 /* This says how to output an assembler line to define a global common symbol
1752 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1754 #define ASM_OUTPUT_ALIGNED_COMMON(FILE, NAME, SIZE, ALIGNED) \
1756 assemble_name ((FILE), (NAME)); \
1757 fprintf ((FILE), "\t.comm "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1758 MAX ((unsigned HOST_WIDE_INT)(SIZE), \
1759 ((unsigned HOST_WIDE_INT)(ALIGNED) / BITS_PER_UNIT)));}
1761 /* This says how to output an assembler line to define a local common symbol
1762 with size SIZE (in bytes) and alignment ALIGN (in bits). */
1764 #define ASM_OUTPUT_ALIGNED_LOCAL(FILE, NAME, SIZE, ALIGNED) \
1766 fprintf ((FILE), "\t.align %d\n", ((ALIGNED) / BITS_PER_UNIT)); \
1767 assemble_name ((FILE), (NAME)); \
1768 fprintf ((FILE), "\n\t.block "HOST_WIDE_INT_PRINT_UNSIGNED"\n", \
1769 (unsigned HOST_WIDE_INT)(SIZE));}
1771 #define ASM_PN_FORMAT "%s___%lu"
1773 /* All HP assemblers use "!" to separate logical lines. */
1774 #define IS_ASM_LOGICAL_LINE_SEPARATOR(C) ((C) == '!')
1776 #define PRINT_OPERAND_PUNCT_VALID_P(CHAR) \
1777 ((CHAR) == '@' || (CHAR) == '#' || (CHAR) == '*' || (CHAR) == '^')
1779 /* Print operand X (an rtx) in assembler syntax to file FILE.
1780 CODE is a letter or dot (`z' in `%z0') or 0 if no letter was specified.
1781 For `%' followed by punctuation, CODE is the punctuation and X is null.
1783 On the HP-PA, the CODE can be `r', meaning this is a register-only operand
1784 and an immediate zero should be represented as `r0'.
1786 Several % codes are defined:
1788 C compare conditions
1789 N extract conditions
1790 M modifier to handle preincrement addressing for memory refs.
1791 F modifier to handle preincrement addressing for fp memory refs */
1793 #define PRINT_OPERAND(FILE, X, CODE) print_operand (FILE, X, CODE)
1796 /* Print a memory address as an operand to reference that memory location. */
1798 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1799 { register rtx addr = ADDR; \
1800 register rtx base; \
1802 switch (GET_CODE (addr)) \
1805 fprintf (FILE, "0(%s)", reg_names [REGNO (addr)]); \
1808 if (GET_CODE (XEXP (addr, 0)) == CONST_INT) \
1809 offset = INTVAL (XEXP (addr, 0)), base = XEXP (addr, 1); \
1810 else if (GET_CODE (XEXP (addr, 1)) == CONST_INT) \
1811 offset = INTVAL (XEXP (addr, 1)), base = XEXP (addr, 0); \
1814 fprintf (FILE, "%d(%s)", offset, reg_names [REGNO (base)]); \
1817 if (!symbolic_operand (XEXP (addr, 1), VOIDmode)) \
1818 fputs ("R'", FILE); \
1819 else if (flag_pic == 0) \
1820 fputs ("RR'", FILE); \
1822 fputs ("RT'", FILE); \
1823 output_global_address (FILE, XEXP (addr, 1), 0); \
1824 fputs ("(", FILE); \
1825 output_operand (XEXP (addr, 0), 0); \
1826 fputs (")", FILE); \
1829 fprintf (FILE, HOST_WIDE_INT_PRINT_DEC "(%%r0)", INTVAL (addr)); \
1832 output_addr_const (FILE, addr); \
1836 /* Find the return address associated with the frame given by
1838 #define RETURN_ADDR_RTX(COUNT, FRAMEADDR) \
1839 (return_addr_rtx (COUNT, FRAMEADDR))
1841 /* Used to mask out junk bits from the return address, such as
1842 processor state, interrupt status, condition codes and the like. */
1843 #define MASK_RETURN_ADDR \
1844 /* The privilege level is in the two low order bits, mask em out \
1845 of the return address. */ \
1848 /* The number of Pmode words for the setjmp buffer. */
1849 #define JMP_BUF_SIZE 50
1851 #define PREDICATE_CODES \
1852 {"reg_or_0_operand", {SUBREG, REG, CONST_INT}}, \
1853 {"call_operand_address", {LABEL_REF, SYMBOL_REF, CONST_INT, \
1854 CONST_DOUBLE, CONST, HIGH, CONSTANT_P_RTX}}, \
1855 {"symbolic_operand", {SYMBOL_REF, LABEL_REF, CONST}}, \
1856 {"symbolic_memory_operand", {SUBREG, MEM}}, \
1857 {"reg_before_reload_operand", {REG, MEM}}, \
1858 {"reg_or_nonsymb_mem_operand", {SUBREG, REG, MEM}}, \
1859 {"reg_or_0_or_nonsymb_mem_operand", {SUBREG, REG, MEM, CONST_INT, \
1861 {"move_operand", {SUBREG, REG, CONSTANT_P_RTX, CONST_INT, MEM}}, \
1862 {"reg_or_cint_move_operand", {SUBREG, REG, CONST_INT}}, \
1863 {"pic_label_operand", {LABEL_REF, CONST}}, \
1864 {"fp_reg_operand", {REG}}, \
1865 {"arith_operand", {SUBREG, REG, CONST_INT}}, \
1866 {"arith11_operand", {SUBREG, REG, CONST_INT}}, \
1867 {"pre_cint_operand", {CONST_INT}}, \
1868 {"post_cint_operand", {CONST_INT}}, \
1869 {"arith_double_operand", {SUBREG, REG, CONST_DOUBLE}}, \
1870 {"ireg_or_int5_operand", {CONST_INT, REG}}, \
1871 {"int5_operand", {CONST_INT}}, \
1872 {"uint5_operand", {CONST_INT}}, \
1873 {"int11_operand", {CONST_INT}}, \
1874 {"uint32_operand", {CONST_INT, \
1875 HOST_BITS_PER_WIDE_INT > 32 ? 0 : CONST_DOUBLE}}, \
1876 {"arith5_operand", {SUBREG, REG, CONST_INT}}, \
1877 {"and_operand", {SUBREG, REG, CONST_INT}}, \
1878 {"ior_operand", {CONST_INT}}, \
1879 {"lhs_lshift_cint_operand", {CONST_INT}}, \
1880 {"lhs_lshift_operand", {SUBREG, REG, CONST_INT}}, \
1881 {"arith32_operand", {SUBREG, REG, CONST_INT}}, \
1882 {"pc_or_label_operand", {PC, LABEL_REF}}, \
1883 {"plus_xor_ior_operator", {PLUS, XOR, IOR}}, \
1884 {"shadd_operand", {CONST_INT}}, \
1885 {"basereg_operand", {REG}}, \
1886 {"div_operand", {REG, CONST_INT}}, \
1887 {"ireg_operand", {REG}}, \
1888 {"cmpib_comparison_operator", {EQ, NE, LT, LE, LEU, \
1890 {"movb_comparison_operator", {EQ, NE, LT, GE}},
1892 /* We need a libcall to canonicalize function pointers on TARGET_ELF32. */
1893 #define CANONICALIZE_FUNCPTR_FOR_COMPARE_LIBCALL \
1894 "__canonicalize_funcptr_for_compare"
OSDN Git Service
