1 /* Definitions of target machine for GNU compiler. Vax version.
2 Copyright (C) 1987, 88, 91, 93-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* Names to predefine in the preprocessor for this target machine. */
24 #define CPP_PREDEFINES "-Dvax -D__vax__ -Dunix -Asystem(unix) -Asystem(bsd) -Acpu(vax) -Amachine(vax)"
26 /* If using g-format floating point, alter math.h. */
28 #define CPP_SPEC "%{mg:-DGFLOAT}"
30 /* Choose proper libraries depending on float format.
31 Note that there are no profiling libraries for g-format.
32 Also use -lg for the sake of dbx. */
34 #define LIB_SPEC "%{g:-lg}\
35 %{mg:%{lm:-lmg} -lcg \
36 %{p:%eprofiling not supported with -mg\n}\
37 %{pg:%eprofiling not supported with -mg\n}}\
38 %{!mg:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
40 /* Print subsidiary information on the compiler version in use. */
42 #ifndef TARGET_NAME /* A more specific value might be supplied via -D. */
43 #define TARGET_NAME "vax"
45 #define TARGET_VERSION fprintf (stderr, " (%s)", TARGET_NAME)
47 /* Run-time compilation parameters selecting different hardware subsets. */
49 extern int target_flags;
51 /* Macros used in the machine description to test the flags. */
53 /* Nonzero if compiling code that Unix assembler can assemble. */
54 #define TARGET_UNIX_ASM (target_flags & 1)
56 /* Nonzero if compiling with VAX-11 "C" style structure alignment */
57 #define TARGET_VAXC_ALIGNMENT (target_flags & 2)
59 /* Nonzero if compiling with `G'-format floating point */
60 #define TARGET_G_FLOAT (target_flags & 4)
62 /* Macro to define tables used to set the flags.
63 This is a list in braces of pairs in braces,
64 each pair being { "NAME", VALUE }
65 where VALUE is the bits to set or minus the bits to clear.
66 An empty string NAME is used to identify the default VALUE. */
68 #define TARGET_SWITCHES \
71 {"vaxc-alignment", 2}, \
76 { "", TARGET_DEFAULT}}
78 /* Default target_flags if no switches specified. */
80 #ifndef TARGET_DEFAULT
81 #define TARGET_DEFAULT 1
84 /* Target machine storage layout */
86 /* Define for software floating point emulation of VAX format
87 when cross compiling from a non-VAX host. */
88 /* #define REAL_ARITHMETIC */
90 /* Define this if most significant bit is lowest numbered
91 in instructions that operate on numbered bit-fields.
92 This is not true on the vax. */
93 #define BITS_BIG_ENDIAN 0
95 /* Define this if most significant byte of a word is the lowest numbered. */
96 /* That is not true on the vax. */
97 #define BYTES_BIG_ENDIAN 0
99 /* Define this if most significant word of a multiword number is the lowest
101 /* This is not true on the vax. */
102 #define WORDS_BIG_ENDIAN 0
104 /* Number of bits in an addressable storage unit */
105 #define BITS_PER_UNIT 8
107 /* Width in bits of a "word", which is the contents of a machine register.
108 Note that this is not necessarily the width of data type `int';
109 if using 16-bit ints on a 68000, this would still be 32.
110 But on a machine with 16-bit registers, this would be 16. */
111 #define BITS_PER_WORD 32
113 /* Width of a word, in units (bytes). */
114 #define UNITS_PER_WORD 4
116 /* Width in bits of a pointer.
117 See also the macro `Pmode' defined below. */
118 #define POINTER_SIZE 32
120 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
121 #define PARM_BOUNDARY 32
123 /* Allocation boundary (in *bits*) for the code of a function. */
124 #define FUNCTION_BOUNDARY 16
126 /* Alignment of field after `int : 0' in a structure. */
127 #define EMPTY_FIELD_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
129 /* Every structure's size must be a multiple of this. */
130 #define STRUCTURE_SIZE_BOUNDARY 8
132 /* A bitfield declared as `int' forces `int' alignment for the struct. */
133 #define PCC_BITFIELD_TYPE_MATTERS (! TARGET_VAXC_ALIGNMENT)
135 /* No data type wants to be aligned rounder than this. */
136 #define BIGGEST_ALIGNMENT 32
138 /* No structure field wants to be aligned rounder than this. */
139 #define BIGGEST_FIELD_ALIGNMENT (TARGET_VAXC_ALIGNMENT ? 8 : 32)
141 /* Set this nonzero if move instructions will actually fail to work
142 when given unaligned data. */
143 #define STRICT_ALIGNMENT 0
145 /* Let's keep the stack somewhat aligned. */
146 #define STACK_BOUNDARY 32
148 /* The table of an ADDR_DIFF_VEC must be contiguous with the case
149 opcode, it is part of the case instruction. */
150 #define ADDR_VEC_ALIGN(ADDR_VEC) 0
152 /* Standard register usage. */
154 /* Number of actual hardware registers.
155 The hardware registers are assigned numbers for the compiler
156 from 0 to just below FIRST_PSEUDO_REGISTER.
157 All registers that the compiler knows about must be given numbers,
158 even those that are not normally considered general registers. */
159 #define FIRST_PSEUDO_REGISTER 16
161 /* 1 for registers that have pervasive standard uses
162 and are not available for the register allocator.
163 On the vax, these are the AP, FP, SP and PC. */
164 #define FIXED_REGISTERS {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
166 /* 1 for registers not available across function calls.
167 These must include the FIXED_REGISTERS and also any
168 registers that can be used without being saved.
169 The latter must include the registers where values are returned
170 and the register where structure-value addresses are passed.
171 Aside from that, you can include as many other registers as you like. */
172 #define CALL_USED_REGISTERS {1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
174 /* Return number of consecutive hard regs needed starting at reg REGNO
175 to hold something of mode MODE.
176 This is ordinarily the length in words of a value of mode MODE
177 but can be less for certain modes in special long registers.
178 On the vax, all registers are one word long. */
179 #define HARD_REGNO_NREGS(REGNO, MODE) \
180 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
182 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
183 On the vax, all registers can hold all modes. */
184 #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
186 /* Value is 1 if it is a good idea to tie two pseudo registers
187 when one has mode MODE1 and one has mode MODE2.
188 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
189 for any hard reg, then this must be 0 for correct output. */
190 #define MODES_TIEABLE_P(MODE1, MODE2) 1
192 /* Specify the registers used for certain standard purposes.
193 The values of these macros are register numbers. */
195 /* Vax pc is overloaded on a register. */
198 /* Register to use for pushing function arguments. */
199 #define STACK_POINTER_REGNUM 14
201 /* Base register for access to local variables of the function. */
202 #define FRAME_POINTER_REGNUM 13
204 /* Value should be nonzero if functions must have frame pointers.
205 Zero means the frame pointer need not be set up (and parms
206 may be accessed via the stack pointer) in functions that seem suitable.
207 This is computed in `reload', in reload1.c. */
208 #define FRAME_POINTER_REQUIRED 1
210 /* Base register for access to arguments of the function. */
211 #define ARG_POINTER_REGNUM 12
213 /* Register in which static-chain is passed to a function. */
214 #define STATIC_CHAIN_REGNUM 0
216 /* Register in which address to store a structure value
217 is passed to a function. */
218 #define STRUCT_VALUE_REGNUM 1
220 /* Define the classes of registers for register constraints in the
221 machine description. Also define ranges of constants.
223 One of the classes must always be named ALL_REGS and include all hard regs.
224 If there is more than one class, another class must be named NO_REGS
225 and contain no registers.
227 The name GENERAL_REGS must be the name of a class (or an alias for
228 another name such as ALL_REGS). This is the class of registers
229 that is allowed by "g" or "r" in a register constraint.
230 Also, registers outside this class are allocated only when
231 instructions express preferences for them.
233 The classes must be numbered in nondecreasing order; that is,
234 a larger-numbered class must never be contained completely
235 in a smaller-numbered class.
237 For any two classes, it is very desirable that there be another
238 class that represents their union. */
240 /* The vax has only one kind of registers, so NO_REGS and ALL_REGS
241 are the only classes. */
243 enum reg_class { NO_REGS, ALL_REGS, LIM_REG_CLASSES };
245 #define N_REG_CLASSES (int) LIM_REG_CLASSES
247 /* Since GENERAL_REGS is the same class as ALL_REGS,
248 don't give it a different class number; just make it an alias. */
250 #define GENERAL_REGS ALL_REGS
252 /* Give names of register classes as strings for dump file. */
254 #define REG_CLASS_NAMES \
255 {"NO_REGS", "ALL_REGS" }
257 /* Define which registers fit in which classes.
258 This is an initializer for a vector of HARD_REG_SET
259 of length N_REG_CLASSES. */
261 #define REG_CLASS_CONTENTS {0, 0xffff}
263 /* The same information, inverted:
264 Return the class number of the smallest class containing
265 reg number REGNO. This could be a conditional expression
266 or could index an array. */
268 #define REGNO_REG_CLASS(REGNO) ALL_REGS
270 /* The class value for index registers, and the one for base regs. */
272 #define INDEX_REG_CLASS ALL_REGS
273 #define BASE_REG_CLASS ALL_REGS
275 /* Get reg_class from a letter such as appears in the machine description. */
277 #define REG_CLASS_FROM_LETTER(C) NO_REGS
279 /* The letters I, J, K, L and M in a register constraint string
280 can be used to stand for particular ranges of immediate operands.
281 This macro defines what the ranges are.
282 C is the letter, and VALUE is a constant value.
283 Return 1 if VALUE is in the range specified by C.
285 `I' is the constant zero. */
287 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
288 ((C) == 'I' ? (VALUE) == 0 \
291 /* Similar, but for floating constants, and defining letters G and H.
292 Here VALUE is the CONST_DOUBLE rtx itself.
294 `G' is a floating-point zero. */
296 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
297 ((C) == 'G' ? ((VALUE) == CONST0_RTX (DFmode) \
298 || (VALUE) == CONST0_RTX (SFmode)) \
301 /* Optional extra constraints for this machine.
303 For the VAX, `Q' means that OP is a MEM that does not have a mode-dependent
306 #define EXTRA_CONSTRAINT(OP, C) \
308 ? GET_CODE (OP) == MEM && ! mode_dependent_address_p (XEXP (OP, 0)) \
311 /* Given an rtx X being reloaded into a reg required to be
312 in class CLASS, return the class of reg to actually use.
313 In general this is just CLASS; but on some machines
314 in some cases it is preferable to use a more restrictive class. */
316 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
318 /* Return the maximum number of consecutive registers
319 needed to represent mode MODE in a register of class CLASS. */
320 /* On the vax, this is always the size of MODE in words,
321 since all registers are the same size. */
322 #define CLASS_MAX_NREGS(CLASS, MODE) \
323 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
325 /* Stack layout; function entry, exit and calling. */
327 /* Define this if pushing a word on the stack
328 makes the stack pointer a smaller address. */
329 #define STACK_GROWS_DOWNWARD
331 /* Define this if longjmp restores from saved registers
332 rather than from what setjmp saved. */
333 #define LONGJMP_RESTORE_FROM_STACK
335 /* Define this if the nominal address of the stack frame
336 is at the high-address end of the local variables;
337 that is, each additional local variable allocated
338 goes at a more negative offset in the frame. */
339 #define FRAME_GROWS_DOWNWARD
341 /* Offset within stack frame to start allocating local variables at.
342 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
343 first local allocated. Otherwise, it is the offset to the BEGINNING
344 of the first local allocated. */
345 #define STARTING_FRAME_OFFSET 0
347 /* Given an rtx for the address of a frame,
348 return an rtx for the address of the word in the frame
349 that holds the dynamic chain--the previous frame's address. */
350 #define DYNAMIC_CHAIN_ADDRESS(FRAME) plus_constant ((FRAME), 12)
352 /* If we generate an insn to push BYTES bytes,
353 this says how many the stack pointer really advances by.
354 On the vax, -(sp) pushes only the bytes of the operands. */
355 #define PUSH_ROUNDING(BYTES) (BYTES)
357 /* Offset of first parameter from the argument pointer register value. */
358 #define FIRST_PARM_OFFSET(FNDECL) 4
360 /* Value is the number of bytes of arguments automatically
361 popped when returning from a subroutine call.
362 FUNDECL is the declaration node of the function (as a tree),
363 FUNTYPE is the data type of the function (as a tree),
364 or for a library call it is an identifier node for the subroutine name.
365 SIZE is the number of bytes of arguments passed on the stack.
367 On the Vax, the RET insn always pops all the args for any function. */
369 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) (SIZE)
371 /* Define how to find the value returned by a function.
372 VALTYPE is the data type of the value (as a tree).
373 If the precise function being called is known, FUNC is its FUNCTION_DECL;
374 otherwise, FUNC is 0. */
376 /* On the Vax the return value is in R0 regardless. */
378 #define FUNCTION_VALUE(VALTYPE, FUNC) \
379 gen_rtx_REG (TYPE_MODE (VALTYPE), 0)
381 /* Define how to find the value returned by a library function
382 assuming the value has mode MODE. */
384 /* On the Vax the return value is in R0 regardless. */
386 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, 0)
388 /* Define this if PCC uses the nonreentrant convention for returning
389 structure and union values. */
391 #define PCC_STATIC_STRUCT_RETURN
393 /* 1 if N is a possible register number for a function value.
394 On the Vax, R0 is the only register thus used. */
396 #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
398 /* 1 if N is a possible register number for function argument passing.
399 On the Vax, no registers are used in this way. */
401 #define FUNCTION_ARG_REGNO_P(N) 0
403 /* Define a data type for recording info about an argument list
404 during the scan of that argument list. This data type should
405 hold all necessary information about the function itself
406 and about the args processed so far, enough to enable macros
407 such as FUNCTION_ARG to determine where the next arg should go.
409 On the vax, this is a single integer, which is a number of bytes
410 of arguments scanned so far. */
412 #define CUMULATIVE_ARGS int
414 /* Initialize a variable CUM of type CUMULATIVE_ARGS
415 for a call to a function whose data type is FNTYPE.
416 For a library call, FNTYPE is 0.
418 On the vax, the offset starts at 0. */
420 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \
423 /* Update the data in CUM to advance over an argument
424 of mode MODE and data type TYPE.
425 (TYPE is null for libcalls where that information may not be available.) */
427 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
428 ((CUM) += ((MODE) != BLKmode \
429 ? (GET_MODE_SIZE (MODE) + 3) & ~3 \
430 : (int_size_in_bytes (TYPE) + 3) & ~3))
432 /* Define where to put the arguments to a function.
433 Value is zero to push the argument on the stack,
434 or a hard register in which to store the argument.
436 MODE is the argument's machine mode.
437 TYPE is the data type of the argument (as a tree).
438 This is null for libcalls where that information may
440 CUM is a variable of type CUMULATIVE_ARGS which gives info about
441 the preceding args and about the function being called.
442 NAMED is nonzero if this argument is a named parameter
443 (otherwise it is an extra parameter matching an ellipsis). */
445 /* On the vax all args are pushed. */
447 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) 0
449 /* This macro generates the assembly code for function entry.
450 FILE is a stdio stream to output the code to.
451 SIZE is an int: how many units of temporary storage to allocate,
452 adjusted by STARTING_FRAME_OFFSET to accommodate vms.h.
453 Refer to the array `regs_ever_live' to determine which registers
454 to save; `regs_ever_live[I]' is nonzero if register number I
455 is ever used in the function. This macro is responsible for
456 knowing which registers should not be saved even if used. */
458 #define FUNCTION_PROLOGUE(FILE, SIZE) \
459 { register int regno; \
460 register int mask = 0; \
461 register int size = SIZE - STARTING_FRAME_OFFSET; \
462 extern char call_used_regs[]; \
463 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) \
464 if (regs_ever_live[regno] && !call_used_regs[regno]) \
465 mask |= 1 << regno; \
466 fprintf (FILE, "\t.word 0x%x\n", mask); \
467 MAYBE_VMS_FUNCTION_PROLOGUE(FILE) \
468 if ((size) >= 64) fprintf (FILE, "\tmovab %d(sp),sp\n", -size);\
469 else if (size) fprintf (FILE, "\tsubl2 $%d,sp\n", (size)); }
471 /* vms.h redefines this. */
472 #define MAYBE_VMS_FUNCTION_PROLOGUE(FILE)
474 /* Output assembler code to FILE to increment profiler label # LABELNO
475 for profiling a function entry. */
477 #define FUNCTION_PROFILER(FILE, LABELNO) \
478 fprintf (FILE, "\tmovab LP%d,r0\n\tjsb mcount\n", (LABELNO));
480 /* Output assembler code to FILE to initialize this source file's
481 basic block profiling info, if that has not already been done. */
483 #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
484 fprintf (FILE, "\ttstl LPBX0\n\tjneq LPI%d\n\tpushal LPBX0\n\tcalls $1,__bb_init_func\nLPI%d:\n", \
487 /* Output assembler code to FILE to increment the entry-count for
488 the BLOCKNO'th basic block in this source file. This is a real pain in the
489 sphincter on a VAX, since we do not want to change any of the bits in the
490 processor status word. The way it is done here, it is pushed onto the stack
491 before any flags have changed, and then the stack is fixed up to account for
492 the fact that the instruction to restore the flags only reads a word.
493 It may seem a bit clumsy, but at least it works.
496 #define BLOCK_PROFILER(FILE, BLOCKNO) \
497 fprintf (FILE, "\tmovpsl -(sp)\n\tmovw (sp),2(sp)\n\taddl2 $2,sp\n\taddl2 $1,LPBX2+%d\n\tbicpsw $255\n\tbispsw (sp)+\n", \
500 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
501 the stack pointer does not matter. The value is tested only in
502 functions that have frame pointers.
503 No definition is equivalent to always zero. */
505 #define EXIT_IGNORE_STACK 1
507 /* This macro generates the assembly code for function exit,
508 on machines that need it. If FUNCTION_EPILOGUE is not defined
509 then individual return instructions are generated for each
510 return statement. Args are same as for FUNCTION_PROLOGUE. */
512 /* #define FUNCTION_EPILOGUE(FILE, SIZE) */
514 /* Store in the variable DEPTH the initial difference between the
515 frame pointer reg contents and the stack pointer reg contents,
516 as of the start of the function body. This depends on the layout
517 of the fixed parts of the stack frame and on how registers are saved.
519 On the Vax, FRAME_POINTER_REQUIRED is always 1, so the definition of this
520 macro doesn't matter. But it must be defined. */
522 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH) (DEPTH) = 0;
524 /* Output assembler code for a block containing the constant parts
525 of a trampoline, leaving space for the variable parts. */
527 /* On the vax, the trampoline contains an entry mask and two instructions:
529 movl $STATIC,r0 (store the functions static chain)
530 jmp *$FUNCTION (jump to function code at address FUNCTION) */
532 #define TRAMPOLINE_TEMPLATE(FILE) \
534 ASM_OUTPUT_SHORT (FILE, const0_rtx); \
535 ASM_OUTPUT_SHORT (FILE, GEN_INT (0x8fd0)); \
536 ASM_OUTPUT_INT (FILE, const0_rtx); \
537 ASM_OUTPUT_BYTE (FILE, 0x50 + STATIC_CHAIN_REGNUM); \
538 ASM_OUTPUT_SHORT (FILE, GEN_INT (0x9f17)); \
539 ASM_OUTPUT_INT (FILE, const0_rtx); \
542 /* Length in units of the trampoline for entering a nested function. */
544 #define TRAMPOLINE_SIZE 15
546 /* Emit RTL insns to initialize the variable parts of a trampoline.
547 FNADDR is an RTX for the address of the function's pure code.
548 CXT is an RTX for the static chain value for the function. */
550 /* We copy the register-mask from the function's pure code
551 to the start of the trampoline. */
552 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
554 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, \
555 "movpsl -(sp)\n\tpushal 1(pc)\n\trei")); \
556 emit_move_insn (gen_rtx_MEM (HImode, TRAMP), \
557 gen_rtx_MEM (HImode, FNADDR)); \
558 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 4)), CXT);\
559 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 11)), \
560 plus_constant (FNADDR, 2)); \
563 /* Byte offset of return address in a stack frame. The "saved PC" field
564 is in element [4] when treating the frame as an array of longwords. */
566 #define RETURN_ADDRESS_OFFSET (4 * UNITS_PER_WORD) /* 16 */
568 /* A C expression whose value is RTL representing the value of the return
569 address for the frame COUNT steps up from the current frame.
570 FRAMEADDR is already the frame pointer of the COUNT frame, so we
573 #define RETURN_ADDR_RTX(COUNT, FRAME) \
575 ? gen_rtx_MEM (Pmode, plus_constant (FRAME, RETURN_ADDRESS_OFFSET)) \
579 /* Addressing modes, and classification of registers for them. */
581 #define HAVE_POST_INCREMENT 1
582 /* #define HAVE_POST_DECREMENT 0 */
584 #define HAVE_PRE_DECREMENT 1
585 /* #define HAVE_PRE_INCREMENT 0 */
587 /* Macros to check register numbers against specific register classes. */
589 /* These assume that REGNO is a hard or pseudo reg number.
590 They give nonzero only if REGNO is a hard reg of the suitable class
591 or a pseudo reg currently allocated to a suitable hard reg.
592 Since they use reg_renumber, they are safe only once reg_renumber
593 has been allocated, which happens in local-alloc.c. */
595 #define REGNO_OK_FOR_INDEX_P(regno) \
596 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
597 #define REGNO_OK_FOR_BASE_P(regno) \
598 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
600 /* Maximum number of registers that can appear in a valid memory address. */
602 #define MAX_REGS_PER_ADDRESS 2
604 /* 1 if X is an rtx for a constant that is a valid address. */
606 #define CONSTANT_ADDRESS_P(X) \
607 (GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
608 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
609 || GET_CODE (X) == HIGH)
611 /* Nonzero if the constant value X is a legitimate general operand.
612 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
614 #define LEGITIMATE_CONSTANT_P(X) 1
616 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
617 and check its validity for a certain class.
618 We have two alternate definitions for each of them.
619 The usual definition accepts all pseudo regs; the other rejects
620 them unless they have been allocated suitable hard regs.
621 The symbol REG_OK_STRICT causes the latter definition to be used.
623 Most source files want to accept pseudo regs in the hope that
624 they will get allocated to the class that the insn wants them to be in.
625 Source files for reload pass need to be strict.
626 After reload, it makes no difference, since pseudo regs have
627 been eliminated by then. */
629 #ifndef REG_OK_STRICT
631 /* Nonzero if X is a hard reg that can be used as an index
632 or if it is a pseudo reg. */
633 #define REG_OK_FOR_INDEX_P(X) 1
634 /* Nonzero if X is a hard reg that can be used as a base reg
635 or if it is a pseudo reg. */
636 #define REG_OK_FOR_BASE_P(X) 1
640 /* Nonzero if X is a hard reg that can be used as an index. */
641 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
642 /* Nonzero if X is a hard reg that can be used as a base reg. */
643 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
647 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
648 that is a valid memory address for an instruction.
649 The MODE argument is the machine mode for the MEM expression
650 that wants to use this address.
652 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
653 except for CONSTANT_ADDRESS_P which is actually machine-independent. */
655 #ifdef NO_EXTERNAL_INDIRECT_ADDRESS
657 /* Zero if this contains a (CONST (PLUS (SYMBOL_REF) (...))) and the
658 symbol in the SYMBOL_REF is an external symbol. */
660 #define INDIRECTABLE_CONSTANT_P(X) \
661 (! (GET_CODE ((X)) == CONST \
662 && GET_CODE (XEXP ((X), 0)) == PLUS \
663 && GET_CODE (XEXP (XEXP ((X), 0), 0)) == SYMBOL_REF \
664 && SYMBOL_REF_FLAG (XEXP (XEXP ((X), 0), 0))))
666 /* Re-definition of CONSTANT_ADDRESS_P, which is true only when there
667 are no SYMBOL_REFs for external symbols present. */
669 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) \
670 (GET_CODE (X) == LABEL_REF \
671 || (GET_CODE (X) == SYMBOL_REF && !SYMBOL_REF_FLAG (X)) \
672 || (GET_CODE (X) == CONST && INDIRECTABLE_CONSTANT_P(X)) \
673 || GET_CODE (X) == CONST_INT)
676 /* Non-zero if X is an address which can be indirected. External symbols
677 could be in a sharable image library, so we disallow those. */
679 #define INDIRECTABLE_ADDRESS_P(X) \
680 (INDIRECTABLE_CONSTANT_ADDRESS_P (X) \
681 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
682 || (GET_CODE (X) == PLUS \
683 && GET_CODE (XEXP (X, 0)) == REG \
684 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
685 && INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))))
687 #else /* not NO_EXTERNAL_INDIRECT_ADDRESS */
689 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) CONSTANT_ADDRESS_P(X)
691 /* Non-zero if X is an address which can be indirected. */
692 #define INDIRECTABLE_ADDRESS_P(X) \
693 (CONSTANT_ADDRESS_P (X) \
694 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
695 || (GET_CODE (X) == PLUS \
696 && GET_CODE (XEXP (X, 0)) == REG \
697 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
698 && CONSTANT_ADDRESS_P (XEXP (X, 1))))
700 #endif /* not NO_EXTERNAL_INDIRECT_ADDRESS */
702 /* Go to ADDR if X is a valid address not using indexing.
703 (This much is the easy part.) */
704 #define GO_IF_NONINDEXED_ADDRESS(X, ADDR) \
705 { register rtx xfoob = (X); \
706 if (GET_CODE (xfoob) == REG) \
708 extern rtx *reg_equiv_mem; \
709 if (! reload_in_progress \
710 || reg_equiv_mem[REGNO (xfoob)] == 0 \
711 || INDIRECTABLE_ADDRESS_P (reg_equiv_mem[REGNO (xfoob)])) \
714 if (CONSTANT_ADDRESS_P (xfoob)) goto ADDR; \
715 if (INDIRECTABLE_ADDRESS_P (xfoob)) goto ADDR; \
716 xfoob = XEXP (X, 0); \
717 if (GET_CODE (X) == MEM && INDIRECTABLE_ADDRESS_P (xfoob)) \
719 if ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_INC) \
720 && GET_CODE (xfoob) == REG && REG_OK_FOR_BASE_P (xfoob)) \
723 /* 1 if PROD is either a reg times size of mode MODE
724 or just a reg, if MODE is just one byte.
725 This macro's expansion uses the temporary variables xfoo0 and xfoo1
726 that must be declared in the surrounding context. */
727 #define INDEX_TERM_P(PROD, MODE) \
728 (GET_MODE_SIZE (MODE) == 1 \
729 ? (GET_CODE (PROD) == REG && REG_OK_FOR_BASE_P (PROD)) \
730 : (GET_CODE (PROD) == MULT \
732 (xfoo0 = XEXP (PROD, 0), xfoo1 = XEXP (PROD, 1), \
733 ((GET_CODE (xfoo0) == CONST_INT \
734 && INTVAL (xfoo0) == GET_MODE_SIZE (MODE) \
735 && GET_CODE (xfoo1) == REG \
736 && REG_OK_FOR_INDEX_P (xfoo1)) \
738 (GET_CODE (xfoo1) == CONST_INT \
739 && INTVAL (xfoo1) == GET_MODE_SIZE (MODE) \
740 && GET_CODE (xfoo0) == REG \
741 && REG_OK_FOR_INDEX_P (xfoo0))))))
743 /* Go to ADDR if X is the sum of a register
744 and a valid index term for mode MODE. */
745 #define GO_IF_REG_PLUS_INDEX(X, MODE, ADDR) \
746 { register rtx xfooa; \
747 if (GET_CODE (X) == PLUS) \
748 { if (GET_CODE (XEXP (X, 0)) == REG \
749 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
750 && (xfooa = XEXP (X, 1), \
751 INDEX_TERM_P (xfooa, MODE))) \
753 if (GET_CODE (XEXP (X, 1)) == REG \
754 && REG_OK_FOR_BASE_P (XEXP (X, 1)) \
755 && (xfooa = XEXP (X, 0), \
756 INDEX_TERM_P (xfooa, MODE))) \
759 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
760 { register rtx xfoo, xfoo0, xfoo1; \
761 GO_IF_NONINDEXED_ADDRESS (X, ADDR); \
762 if (GET_CODE (X) == PLUS) \
763 { /* Handle <address>[index] represented with index-sum outermost */\
764 xfoo = XEXP (X, 0); \
765 if (INDEX_TERM_P (xfoo, MODE)) \
766 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 1), ADDR); } \
767 xfoo = XEXP (X, 1); \
768 if (INDEX_TERM_P (xfoo, MODE)) \
769 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 0), ADDR); } \
770 /* Handle offset(reg)[index] with offset added outermost */ \
771 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 0))) \
772 { if (GET_CODE (XEXP (X, 1)) == REG \
773 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
775 GO_IF_REG_PLUS_INDEX (XEXP (X, 1), MODE, ADDR); } \
776 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))) \
777 { if (GET_CODE (XEXP (X, 0)) == REG \
778 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
780 GO_IF_REG_PLUS_INDEX (XEXP (X, 0), MODE, ADDR); } } }
782 /* Try machine-dependent ways of modifying an illegitimate address
783 to be legitimate. If we find one, return the new, valid address.
784 This macro is used in only one place: `memory_address' in explow.c.
786 OLDX is the address as it was before break_out_memory_refs was called.
787 In some cases it is useful to look at this to decide what needs to be done.
789 MODE and WIN are passed so that this macro can use
790 GO_IF_LEGITIMATE_ADDRESS.
792 It is always safe for this macro to do nothing. It exists to recognize
793 opportunities to optimize the output.
795 For the vax, nothing needs to be done. */
797 #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) {}
799 /* Go to LABEL if ADDR (a legitimate address expression)
800 has an effect that depends on the machine mode it is used for.
801 On the VAX, the predecrement and postincrement address depend thus
802 (the amount of decrement or increment being the length of the operand)
803 and all indexed address depend thus (because the index scale factor
804 is the length of the operand). */
805 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
806 { if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == PRE_DEC) \
808 if (GET_CODE (ADDR) == PLUS) \
809 { if (CONSTANT_ADDRESS_P (XEXP (ADDR, 0)) \
810 && GET_CODE (XEXP (ADDR, 1)) == REG); \
811 else if (CONSTANT_ADDRESS_P (XEXP (ADDR, 1)) \
812 && GET_CODE (XEXP (ADDR, 0)) == REG); \
815 /* Specify the machine mode that this machine uses
816 for the index in the tablejump instruction. */
817 #define CASE_VECTOR_MODE HImode
819 /* Define as C expression which evaluates to nonzero if the tablejump
820 instruction expects the table to contain offsets from the address of the
822 Do not define this if the table should contain absolute addresses. */
823 #define CASE_VECTOR_PC_RELATIVE 1
825 /* Define this if the case instruction drops through after the table
826 when the index is out of range. Don't define it if the case insn
827 jumps to the default label instead. */
828 #define CASE_DROPS_THROUGH
830 /* Specify the tree operation to be used to convert reals to integers. */
831 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
833 /* This is the kind of divide that is easiest to do in the general case. */
834 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
836 /* Define this as 1 if `char' should by default be signed; else as 0. */
837 #define DEFAULT_SIGNED_CHAR 1
839 /* This flag, if defined, says the same insns that convert to a signed fixnum
840 also convert validly to an unsigned one. */
841 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
843 /* Max number of bytes we can move from memory to memory
844 in one reasonably fast instruction. */
847 /* Define this if zero-extension is slow (more than one real instruction). */
848 /* #define SLOW_ZERO_EXTEND */
850 /* Nonzero if access to memory by bytes is slow and undesirable. */
851 #define SLOW_BYTE_ACCESS 0
853 /* Define if shifts truncate the shift count
854 which implies one can omit a sign-extension or zero-extension
856 /* #define SHIFT_COUNT_TRUNCATED */
858 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
859 is done just by pretending it is already truncated. */
860 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
862 /* Specify the machine mode that pointers have.
863 After generation of rtl, the compiler makes no further distinction
864 between pointers and any other objects of this machine mode. */
867 /* A function address in a call instruction
868 is a byte address (for indexing purposes)
869 so give the MEM rtx a byte's mode. */
870 #define FUNCTION_MODE QImode
872 /* This machine doesn't use IEEE floats. */
874 #define TARGET_FLOAT_FORMAT VAX_FLOAT_FORMAT
876 /* Compute the cost of computing a constant rtl expression RTX
877 whose rtx-code is CODE. The body of this macro is a portion
878 of a switch statement. If the code is computed here,
879 return it with a return statement. Otherwise, break from the switch. */
881 /* On a VAX, constants from 0..63 are cheap because they can use the
882 1 byte literal constant format. compare to -1 should be made cheap
883 so that decrement-and-branch insns can be formed more easily (if
884 the value -1 is copied to a register some decrement-and-branch patterns
887 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
889 if (INTVAL (RTX) == 0) return 0; \
890 if ((OUTER_CODE) == AND) \
891 return ((unsigned) ~INTVAL (RTX) <= 077) ? 1 : 2; \
892 if ((unsigned) INTVAL (RTX) <= 077) return 1; \
893 if ((OUTER_CODE) == COMPARE && INTVAL (RTX) == -1) \
895 if ((OUTER_CODE) == PLUS && (unsigned) -INTVAL (RTX) <= 077)\
902 if (GET_MODE_CLASS (GET_MODE (RTX)) == MODE_FLOAT) \
903 return vax_float_literal (RTX) ? 5 : 8; \
905 return (((CONST_DOUBLE_HIGH (RTX) == 0 \
906 && (unsigned) CONST_DOUBLE_LOW (RTX) < 64) \
907 || ((OUTER_CODE) == PLUS \
908 && CONST_DOUBLE_HIGH (RTX) == -1 \
909 && (unsigned)-CONST_DOUBLE_LOW (RTX) < 64)) \
912 #define RTX_COSTS(RTX,CODE,OUTER_CODE) case FIX: case FLOAT: \
913 case MULT: case DIV: case UDIV: case MOD: case UMOD: \
914 case ASHIFT: case LSHIFTRT: case ASHIFTRT: \
915 case ROTATE: case ROTATERT: case PLUS: case MINUS: case IOR: \
916 case XOR: case AND: case NEG: case NOT: case ZERO_EXTRACT: \
917 case SIGN_EXTRACT: case MEM: return vax_rtx_cost(RTX)
919 #define ADDRESS_COST(RTX) (1 + (GET_CODE (RTX) == REG ? 0 : vax_address_cost(RTX)))
921 /* Specify the cost of a branch insn; roughly the number of extra insns that
922 should be added to avoid a branch.
924 Branches are extremely cheap on the VAX while the shift insns often
925 used to replace branches can be expensive. */
927 #define BRANCH_COST 0
930 * We can use the BSD C library routines for the libgcc calls that are
931 * still generated, since that's what they boil down to anyways.
934 #define UDIVSI3_LIBCALL "*udiv"
935 #define UMODSI3_LIBCALL "*urem"
937 /* Check a `double' value for validity for a particular machine mode. */
939 /* note that it is very hard to accidentally create a number that fits in a
940 double but not in a float, since their ranges are almost the same */
942 #define CHECK_FLOAT_VALUE(MODE, D, OVERFLOW) \
943 ((OVERFLOW) = check_float_value (MODE, &D, OVERFLOW))
945 /* For future reference:
946 D Float: 9 bit, sign magnitude, excess 128 binary exponent
947 normalized 56 bit fraction, redundant bit not represented
948 approximately 16 decimal digits of precision
950 The values to use if we trust decimal to binary conversions:
951 #define MAX_D_FLOAT 1.7014118346046923e+38
952 #define MIN_D_FLOAT .29387358770557188e-38
954 G float: 12 bit, sign magnitude, excess 1024 binary exponent
955 normalized 53 bit fraction, redundant bit not represented
956 approximately 15 decimal digits precision
958 The values to use if we trust decimal to binary conversions:
959 #define MAX_G_FLOAT .898846567431157e+308
960 #define MIN_G_FLOAT .556268464626800e-308
963 /* Tell final.c how to eliminate redundant test instructions. */
965 /* Here we define machine-dependent flags and fields in cc_status
966 (see `conditions.h'). No extra ones are needed for the vax. */
968 /* Store in cc_status the expressions
969 that the condition codes will describe
970 after execution of an instruction whose pattern is EXP.
971 Do not alter them if the instruction would not alter the cc's. */
973 #define NOTICE_UPDATE_CC(EXP, INSN) \
974 { if (GET_CODE (EXP) == SET) \
975 { if (GET_CODE (SET_SRC (EXP)) == CALL) \
977 else if (GET_CODE (SET_DEST (EXP)) != ZERO_EXTRACT \
978 && GET_CODE (SET_DEST (EXP)) != PC) \
979 { cc_status.flags = 0; \
980 cc_status.value1 = SET_DEST (EXP); \
981 cc_status.value2 = SET_SRC (EXP); } } \
982 else if (GET_CODE (EXP) == PARALLEL \
983 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
985 if (GET_CODE (SET_SRC (XVECEXP (EXP, 0, 0))) == CALL) \
987 else if (GET_CODE (SET_DEST (XVECEXP (EXP, 0, 0))) != PC) \
988 { cc_status.flags = 0; \
989 cc_status.value1 = SET_DEST (XVECEXP (EXP, 0, 0)); \
990 cc_status.value2 = SET_SRC (XVECEXP (EXP, 0, 0)); } \
992 /* PARALLELs whose first element sets the PC are aob, \
993 sob insns. They do change the cc's. */ \
995 else CC_STATUS_INIT; \
996 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
997 && cc_status.value2 \
998 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
999 cc_status.value2 = 0; \
1000 if (cc_status.value1 && GET_CODE (cc_status.value1) == MEM \
1001 && cc_status.value2 \
1002 && GET_CODE (cc_status.value2) == MEM) \
1003 cc_status.value2 = 0; }
1004 /* Actual condition, one line up, should be that value2's address
1005 depends on value1, but that is too much of a pain. */
1007 #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
1008 { if (cc_status.flags & CC_NO_OVERFLOW) \
1012 /* Control the assembler format that we output. */
1014 /* Output at beginning of assembler file. */
1016 #define ASM_FILE_START(FILE) fprintf (FILE, "#NO_APP\n");
1018 /* Output to assembler file text saying following lines
1019 may contain character constants, extra white space, comments, etc. */
1021 #define ASM_APP_ON "#APP\n"
1023 /* Output to assembler file text saying following lines
1024 no longer contain unusual constructs. */
1026 #define ASM_APP_OFF "#NO_APP\n"
1028 /* Output before read-only data. */
1030 #define TEXT_SECTION_ASM_OP ".text"
1032 /* Output before writable data. */
1034 #define DATA_SECTION_ASM_OP ".data"
1036 /* How to refer to registers in assembler output.
1037 This sequence is indexed by compiler's hard-register-number (see above). */
1039 #define REGISTER_NAMES \
1040 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \
1041 "r9", "r10", "r11", "ap", "fp", "sp", "pc"}
1043 /* This is BSD, so it wants DBX format. */
1045 #define DBX_DEBUGGING_INFO
1047 /* How to renumber registers for dbx and gdb.
1048 Vax needs no change in the numeration. */
1050 #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1052 /* Do not break .stabs pseudos into continuations. */
1054 #define DBX_CONTIN_LENGTH 0
1056 /* This is the char to use for continuation (in case we need to turn
1057 continuation back on). */
1059 #define DBX_CONTIN_CHAR '?'
1061 /* Don't use the `xsfoo;' construct in DBX output; this system
1062 doesn't support it. */
1064 #define DBX_NO_XREFS
1066 /* Output the .stabs for a C `static' variable in the data section. */
1067 #define DBX_STATIC_STAB_DATA_SECTION
1069 /* Vax specific: which type character is used for type double? */
1071 #define ASM_DOUBLE_CHAR (TARGET_G_FLOAT ? 'g' : 'd')
1073 /* This is how to output the definition of a user-level label named NAME,
1074 such as the label on a static function or variable NAME. */
1076 #define ASM_OUTPUT_LABEL(FILE,NAME) \
1077 do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
1079 /* This is how to output a command to make the user-level label named NAME
1080 defined for reference from other files. */
1082 #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
1083 do { fputs (".globl ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
1085 /* The prefix to add to user-visible assembler symbols. */
1087 #define USER_LABEL_PREFIX "_"
1089 /* This is how to output an internal numbered label where
1090 PREFIX is the class of label and NUM is the number within the class. */
1092 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1093 fprintf (FILE, "%s%d:\n", PREFIX, NUM)
1095 /* This is how to store into the string LABEL
1096 the symbol_ref name of an internal numbered label where
1097 PREFIX is the class of label and NUM is the number within the class.
1098 This is suitable for output with `assemble_name'. */
1100 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1101 sprintf (LABEL, "*%s%d", PREFIX, NUM)
1103 /* This is how to output an assembler line defining a `double' constant.
1104 It is .dfloat or .gfloat, depending. */
1106 #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
1107 do { char dstr[30]; \
1108 REAL_VALUE_TO_DECIMAL (VALUE, "%.20e", dstr); \
1109 fprintf (FILE, "\t.%cfloat 0%c%s\n", ASM_DOUBLE_CHAR, \
1110 ASM_DOUBLE_CHAR, dstr); \
1113 /* This is how to output an assembler line defining a `float' constant. */
1115 #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
1116 do { char dstr[30]; \
1117 REAL_VALUE_TO_DECIMAL (VALUE, "%.20e", dstr); \
1118 fprintf (FILE, "\t.float 0f%s\n", dstr); } while (0);
1120 /* This is how to output an assembler line defining an `int' constant. */
1122 #define ASM_OUTPUT_INT(FILE,VALUE) \
1123 ( fprintf (FILE, "\t.long "), \
1124 output_addr_const (FILE, (VALUE)), \
1125 fprintf (FILE, "\n"))
1127 /* Likewise for `char' and `short' constants. */
1129 #define ASM_OUTPUT_SHORT(FILE,VALUE) \
1130 ( fprintf (FILE, "\t.word "), \
1131 output_addr_const (FILE, (VALUE)), \
1132 fprintf (FILE, "\n"))
1134 #define ASM_OUTPUT_CHAR(FILE,VALUE) \
1135 ( fprintf (FILE, "\t.byte "), \
1136 output_addr_const (FILE, (VALUE)), \
1137 fprintf (FILE, "\n"))
1139 /* This is how to output an assembler line for a numeric constant byte. */
1141 #define ASM_OUTPUT_BYTE(FILE,VALUE) \
1142 fprintf (FILE, "\t.byte 0x%x\n", (VALUE))
1144 /* This is how to output an insn to push a register on the stack.
1145 It need not be very fast code. */
1147 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
1148 fprintf (FILE, "\tpushl %s\n", reg_names[REGNO])
1150 /* This is how to output an insn to pop a register from the stack.
1151 It need not be very fast code. */
1153 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
1154 fprintf (FILE, "\tmovl (sp)+,%s\n", reg_names[REGNO])
1156 /* This is how to output an element of a case-vector that is absolute.
1157 (The Vax does not use such vectors,
1158 but we must define this macro anyway.) */
1160 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1161 fprintf (FILE, "\t.long L%d\n", VALUE)
1163 /* This is how to output an element of a case-vector that is relative. */
1165 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1166 fprintf (FILE, "\t.word L%d-L%d\n", VALUE, REL)
1168 /* This is how to output an assembler line
1169 that says to advance the location counter
1170 to a multiple of 2**LOG bytes. */
1172 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1173 fprintf (FILE, "\t.align %d\n", (LOG))
1175 /* This is how to output an assembler line
1176 that says to advance the location counter by SIZE bytes. */
1178 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1179 fprintf (FILE, "\t.space %u\n", (SIZE))
1181 /* This says how to output an assembler line
1182 to define a global common symbol. */
1184 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1185 ( fputs (".comm ", (FILE)), \
1186 assemble_name ((FILE), (NAME)), \
1187 fprintf ((FILE), ",%u\n", (ROUNDED)))
1189 /* This says how to output an assembler line
1190 to define a local common symbol. */
1192 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1193 ( fputs (".lcomm ", (FILE)), \
1194 assemble_name ((FILE), (NAME)), \
1195 fprintf ((FILE), ",%u\n", (ROUNDED)))
1197 /* Store in OUTPUT a string (made with alloca) containing
1198 an assembler-name for a local static variable named NAME.
1199 LABELNO is an integer which is different for each call. */
1201 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1202 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
1203 sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
1205 /* When debugging, we want to output an extra dummy label so that gas
1206 can distinguish between D_float and G_float prior to processing the
1207 .stabs directive identifying type double. */
1209 #define ASM_IDENTIFY_LANGUAGE(FILE) \
1211 output_lang_identify (FILE); \
1212 if (write_symbols == DBX_DEBUG) \
1213 fprintf (FILE, "___vax_%c_doubles:\n", ASM_DOUBLE_CHAR); \
1216 /* Output code to add DELTA to the first argument, and then jump to FUNCTION.
1217 Used for C++ multiple inheritance.
1218 .mask ^m<r2,r3,r4,r5,r6,r7,r8,r9,r10,r11> #conservative entry mask
1219 addl2 $DELTA, 4(ap) #adjust first argument
1220 jmp FUNCTION+2 #jump beyond FUNCTION's entry mask
1222 #define ASM_OUTPUT_MI_THUNK(FILE, THUNK_FNDECL, DELTA, FUNCTION) \
1224 fprintf (FILE, "\t.word 0x0ffc\n"); \
1225 fprintf (FILE, "\taddl2 $%d,4(ap)\n", DELTA); \
1226 fprintf (FILE, "\tjmp "); \
1227 assemble_name (FILE, XSTR (XEXP (DECL_RTL (FUNCTION), 0), 0)); \
1228 fprintf (FILE, "+2\n"); \
1231 /* Define the parentheses used to group arithmetic operations
1232 in assembler code. */
1234 #define ASM_OPEN_PAREN "("
1235 #define ASM_CLOSE_PAREN ")"
1237 /* Define results of standard character escape sequences. */
1238 #define TARGET_BELL 007
1239 #define TARGET_BS 010
1240 #define TARGET_TAB 011
1241 #define TARGET_NEWLINE 012
1242 #define TARGET_VT 013
1243 #define TARGET_FF 014
1244 #define TARGET_CR 015
1246 /* Print an instruction operand X on file FILE.
1247 CODE is the code from the %-spec that requested printing this operand;
1248 if `%z3' was used to print operand 3, then CODE is 'z'.
1250 VAX operand formatting codes:
1253 C reverse branch condition
1254 D 64-bit immediate operand
1255 B the low 8 bits of the complement of a constant operand
1256 H the low 16 bits of the complement of a constant operand
1257 M a mask for the N highest bits of a word
1258 N the complement of a constant integer operand
1259 P constant operand plus 1
1260 R 32 - constant operand
1261 b the low 8 bits of a negated constant operand
1262 h the low 16 bits of a negated constant operand
1263 # 'd' or 'g' depending on whether dfloat or gfloat is used */
1265 /* The purpose of D is to get around a quirk or bug in vax assembler
1266 whereby -1 in a 64-bit immediate operand means 0x00000000ffffffff,
1267 which is not a 64-bit minus one. */
1269 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
1272 #define PRINT_OPERAND(FILE, X, CODE) \
1273 { extern char *rev_cond_name (); \
1274 if (CODE == '#') fputc (ASM_DOUBLE_CHAR, FILE); \
1275 else if (CODE == 'C') \
1276 fputs (rev_cond_name (X), FILE); \
1277 else if (CODE == 'D' && GET_CODE (X) == CONST_INT && INTVAL (X) < 0) \
1278 fprintf (FILE, "$0xffffffff%08x", INTVAL (X)); \
1279 else if (CODE == 'P' && GET_CODE (X) == CONST_INT) \
1280 fprintf (FILE, "$%d", INTVAL (X) + 1); \
1281 else if (CODE == 'N' && GET_CODE (X) == CONST_INT) \
1282 fprintf (FILE, "$%d", ~ INTVAL (X)); \
1283 /* rotl instruction cannot deal with negative arguments. */ \
1284 else if (CODE == 'R' && GET_CODE (X) == CONST_INT) \
1285 fprintf (FILE, "$%d", 32 - INTVAL (X)); \
1286 else if (CODE == 'H' && GET_CODE (X) == CONST_INT) \
1287 fprintf (FILE, "$%d", 0xffff & ~ INTVAL (X)); \
1288 else if (CODE == 'h' && GET_CODE (X) == CONST_INT) \
1289 fprintf (FILE, "$%d", (short) - INTVAL (x)); \
1290 else if (CODE == 'B' && GET_CODE (X) == CONST_INT) \
1291 fprintf (FILE, "$%d", 0xff & ~ INTVAL (X)); \
1292 else if (CODE == 'b' && GET_CODE (X) == CONST_INT) \
1293 fprintf (FILE, "$%d", 0xff & - INTVAL (X)); \
1294 else if (CODE == 'M' && GET_CODE (X) == CONST_INT) \
1295 fprintf (FILE, "$%d", ~((1 << INTVAL (x)) - 1)); \
1296 else if (GET_CODE (X) == REG) \
1297 fprintf (FILE, "%s", reg_names[REGNO (X)]); \
1298 else if (GET_CODE (X) == MEM) \
1299 output_address (XEXP (X, 0)); \
1300 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) == SFmode) \
1301 { REAL_VALUE_TYPE r; char dstr[30]; \
1302 REAL_VALUE_FROM_CONST_DOUBLE (r, X); \
1303 REAL_VALUE_TO_DECIMAL (r, "%.20e", dstr); \
1304 fprintf (FILE, "$0f%s", dstr); } \
1305 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) == DFmode) \
1306 { REAL_VALUE_TYPE r; char dstr[30]; \
1307 REAL_VALUE_FROM_CONST_DOUBLE (r, X); \
1308 REAL_VALUE_TO_DECIMAL (r, "%.20e", dstr); \
1309 fprintf (FILE, "$0%c%s", ASM_DOUBLE_CHAR, dstr); } \
1310 else { putc ('$', FILE); output_addr_const (FILE, X); }}
1312 /* Print a memory operand whose address is X, on file FILE.
1313 This uses a function in output-vax.c. */
1315 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1316 print_operand_address (FILE, ADDR)