1 /* Definitions of target machine for GNU compiler. Vax version.
2 Copyright (C) 1987, 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Names to predefine in the preprocessor for this target machine. */
25 #define CPP_PREDEFINES "-Dvax -D__vax__ -Dunix -Asystem=unix -Asystem=bsd -Acpu=vax -Amachine=vax"
27 /* Use -J option for long branch support with Unix assembler. */
31 /* If using g-format floating point, alter math.h. */
33 #define CPP_SPEC "%{mg:%{!ansi:-DGFLOAT} -D__GFLOAT}"
35 /* Choose proper libraries depending on float format.
36 Note that there are no profiling libraries for g-format.
37 Also use -lg for the sake of dbx. */
39 #define LIB_SPEC "%{g:-lg}\
40 %{mg:%{lm:-lmg} -lcg \
41 %{p:%eprofiling not supported with -mg\n}\
42 %{pg:%eprofiling not supported with -mg\n}}\
43 %{!mg:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
45 /* Print subsidiary information on the compiler version in use. */
47 #ifndef TARGET_NAME /* A more specific value might be supplied via -D. */
48 #define TARGET_NAME "vax"
50 #define TARGET_VERSION fprintf (stderr, " (%s)", TARGET_NAME)
52 /* Run-time compilation parameters selecting different hardware subsets. */
54 extern int target_flags;
56 /* Macros used in the machine description to test the flags. */
58 /* Nonzero if compiling code that Unix assembler can assemble. */
59 #define TARGET_UNIX_ASM (target_flags & 1)
61 /* Nonzero if compiling with VAX-11 "C" style structure alignment */
62 #define TARGET_VAXC_ALIGNMENT (target_flags & 2)
64 /* Nonzero if compiling with `G'-format floating point */
65 #define TARGET_G_FLOAT (target_flags & 4)
67 /* Macro to define tables used to set the flags.
68 This is a list in braces of pairs in braces,
69 each pair being { "NAME", VALUE }
70 where VALUE is the bits to set or minus the bits to clear.
71 An empty string NAME is used to identify the default VALUE. */
73 #define TARGET_SWITCHES \
74 { {"unix", 1, "Generate code for UNIX assembler"}, \
75 {"gnu", -1, "Generate code for GNU assembler (gas)"}, \
76 {"vaxc-alignment", 2, "Use VAXC structure conventions"}, \
77 {"g", 4, "Generate GFLOAT double precision code"}, \
78 {"g-float", 4, "Generate GFLOAT double precision code"}, \
79 {"d", -4, "Generate DFLOAT double precision code"}, \
80 {"d-float", -4, "Generate DFLOAT double precision code"}, \
81 { "", TARGET_DEFAULT, 0}}
83 /* Default target_flags if no switches specified. */
85 #ifndef TARGET_DEFAULT
86 #define TARGET_DEFAULT 1
89 /* Target machine storage layout */
91 /* Define for software floating point emulation of VAX format
92 when cross compiling from a non-VAX host. */
93 /* #define REAL_ARITHMETIC */
95 /* Define this if most significant bit is lowest numbered
96 in instructions that operate on numbered bit-fields.
97 This is not true on the vax. */
98 #define BITS_BIG_ENDIAN 0
100 /* Define this if most significant byte of a word is the lowest numbered. */
101 /* That is not true on the vax. */
102 #define BYTES_BIG_ENDIAN 0
104 /* Define this if most significant word of a multiword number is the lowest
106 /* This is not true on the vax. */
107 #define WORDS_BIG_ENDIAN 0
109 /* Number of bits in an addressable storage unit */
110 #define BITS_PER_UNIT 8
112 /* Width in bits of a "word", which is the contents of a machine register.
113 Note that this is not necessarily the width of data type `int';
114 if using 16-bit ints on a 68000, this would still be 32.
115 But on a machine with 16-bit registers, this would be 16. */
116 #define BITS_PER_WORD 32
118 /* Width of a word, in units (bytes). */
119 #define UNITS_PER_WORD 4
121 /* Width in bits of a pointer.
122 See also the macro `Pmode' defined below. */
123 #define POINTER_SIZE 32
125 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
126 #define PARM_BOUNDARY 32
128 /* Allocation boundary (in *bits*) for the code of a function. */
129 #define FUNCTION_BOUNDARY 16
131 /* Alignment of field after `int : 0' in a structure. */
132 #define EMPTY_FIELD_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
134 /* Every structure's size must be a multiple of this. */
135 #define STRUCTURE_SIZE_BOUNDARY 8
137 /* A bitfield declared as `int' forces `int' alignment for the struct. */
138 #define PCC_BITFIELD_TYPE_MATTERS (! TARGET_VAXC_ALIGNMENT)
140 /* No data type wants to be aligned rounder than this. */
141 #define BIGGEST_ALIGNMENT 32
143 /* No structure field wants to be aligned rounder than this. */
144 #define BIGGEST_FIELD_ALIGNMENT (TARGET_VAXC_ALIGNMENT ? 8 : 32)
146 /* Set this nonzero if move instructions will actually fail to work
147 when given unaligned data. */
148 #define STRICT_ALIGNMENT 0
150 /* Let's keep the stack somewhat aligned. */
151 #define STACK_BOUNDARY 32
153 /* The table of an ADDR_DIFF_VEC must be contiguous with the case
154 opcode, it is part of the case instruction. */
155 #define ADDR_VEC_ALIGN(ADDR_VEC) 0
157 /* Standard register usage. */
159 /* Number of actual hardware registers.
160 The hardware registers are assigned numbers for the compiler
161 from 0 to just below FIRST_PSEUDO_REGISTER.
162 All registers that the compiler knows about must be given numbers,
163 even those that are not normally considered general registers. */
164 #define FIRST_PSEUDO_REGISTER 16
166 /* 1 for registers that have pervasive standard uses
167 and are not available for the register allocator.
168 On the vax, these are the AP, FP, SP and PC. */
169 #define FIXED_REGISTERS {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
171 /* 1 for registers not available across function calls.
172 These must include the FIXED_REGISTERS and also any
173 registers that can be used without being saved.
174 The latter must include the registers where values are returned
175 and the register where structure-value addresses are passed.
176 Aside from that, you can include as many other registers as you like. */
177 #define CALL_USED_REGISTERS {1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
179 /* Return number of consecutive hard regs needed starting at reg REGNO
180 to hold something of mode MODE.
181 This is ordinarily the length in words of a value of mode MODE
182 but can be less for certain modes in special long registers.
183 On the vax, all registers are one word long. */
184 #define HARD_REGNO_NREGS(REGNO, MODE) \
185 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
187 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
188 On the vax, all registers can hold all modes. */
189 #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
191 /* Value is 1 if it is a good idea to tie two pseudo registers
192 when one has mode MODE1 and one has mode MODE2.
193 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
194 for any hard reg, then this must be 0 for correct output. */
195 #define MODES_TIEABLE_P(MODE1, MODE2) 1
197 /* Specify the registers used for certain standard purposes.
198 The values of these macros are register numbers. */
200 /* Vax pc is overloaded on a register. */
203 /* Register to use for pushing function arguments. */
204 #define STACK_POINTER_REGNUM 14
206 /* Base register for access to local variables of the function. */
207 #define FRAME_POINTER_REGNUM 13
209 /* Value should be nonzero if functions must have frame pointers.
210 Zero means the frame pointer need not be set up (and parms
211 may be accessed via the stack pointer) in functions that seem suitable.
212 This is computed in `reload', in reload1.c. */
213 #define FRAME_POINTER_REQUIRED 1
215 /* Base register for access to arguments of the function. */
216 #define ARG_POINTER_REGNUM 12
218 /* Register in which static-chain is passed to a function. */
219 #define STATIC_CHAIN_REGNUM 0
221 /* Register in which address to store a structure value
222 is passed to a function. */
223 #define STRUCT_VALUE_REGNUM 1
225 /* Define the classes of registers for register constraints in the
226 machine description. Also define ranges of constants.
228 One of the classes must always be named ALL_REGS and include all hard regs.
229 If there is more than one class, another class must be named NO_REGS
230 and contain no registers.
232 The name GENERAL_REGS must be the name of a class (or an alias for
233 another name such as ALL_REGS). This is the class of registers
234 that is allowed by "g" or "r" in a register constraint.
235 Also, registers outside this class are allocated only when
236 instructions express preferences for them.
238 The classes must be numbered in nondecreasing order; that is,
239 a larger-numbered class must never be contained completely
240 in a smaller-numbered class.
242 For any two classes, it is very desirable that there be another
243 class that represents their union. */
245 /* The vax has only one kind of registers, so NO_REGS and ALL_REGS
246 are the only classes. */
248 enum reg_class { NO_REGS, ALL_REGS, LIM_REG_CLASSES };
250 #define N_REG_CLASSES (int) LIM_REG_CLASSES
252 /* Since GENERAL_REGS is the same class as ALL_REGS,
253 don't give it a different class number; just make it an alias. */
255 #define GENERAL_REGS ALL_REGS
257 /* Give names of register classes as strings for dump file. */
259 #define REG_CLASS_NAMES \
260 {"NO_REGS", "ALL_REGS" }
262 /* Define which registers fit in which classes.
263 This is an initializer for a vector of HARD_REG_SET
264 of length N_REG_CLASSES. */
266 #define REG_CLASS_CONTENTS {{0}, {0xffff}}
268 /* The same information, inverted:
269 Return the class number of the smallest class containing
270 reg number REGNO. This could be a conditional expression
271 or could index an array. */
273 #define REGNO_REG_CLASS(REGNO) ALL_REGS
275 /* The class value for index registers, and the one for base regs. */
277 #define INDEX_REG_CLASS ALL_REGS
278 #define BASE_REG_CLASS ALL_REGS
280 /* Get reg_class from a letter such as appears in the machine description. */
282 #define REG_CLASS_FROM_LETTER(C) NO_REGS
284 /* The letters I, J, K, L and M in a register constraint string
285 can be used to stand for particular ranges of immediate operands.
286 This macro defines what the ranges are.
287 C is the letter, and VALUE is a constant value.
288 Return 1 if VALUE is in the range specified by C.
290 `I' is the constant zero. */
292 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
293 ((C) == 'I' ? (VALUE) == 0 \
296 /* Similar, but for floating constants, and defining letters G and H.
297 Here VALUE is the CONST_DOUBLE rtx itself.
299 `G' is a floating-point zero. */
301 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
302 ((C) == 'G' ? ((VALUE) == CONST0_RTX (DFmode) \
303 || (VALUE) == CONST0_RTX (SFmode)) \
306 /* Optional extra constraints for this machine.
308 For the VAX, `Q' means that OP is a MEM that does not have a mode-dependent
311 #define EXTRA_CONSTRAINT(OP, C) \
313 ? GET_CODE (OP) == MEM && ! mode_dependent_address_p (XEXP (OP, 0)) \
316 /* Given an rtx X being reloaded into a reg required to be
317 in class CLASS, return the class of reg to actually use.
318 In general this is just CLASS; but on some machines
319 in some cases it is preferable to use a more restrictive class. */
321 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
323 /* Return the maximum number of consecutive registers
324 needed to represent mode MODE in a register of class CLASS. */
325 /* On the vax, this is always the size of MODE in words,
326 since all registers are the same size. */
327 #define CLASS_MAX_NREGS(CLASS, MODE) \
328 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
330 /* Stack layout; function entry, exit and calling. */
332 /* Define this if pushing a word on the stack
333 makes the stack pointer a smaller address. */
334 #define STACK_GROWS_DOWNWARD
336 /* Define this if longjmp restores from saved registers
337 rather than from what setjmp saved. */
338 #define LONGJMP_RESTORE_FROM_STACK
340 /* Define this if the nominal address of the stack frame
341 is at the high-address end of the local variables;
342 that is, each additional local variable allocated
343 goes at a more negative offset in the frame. */
344 #define FRAME_GROWS_DOWNWARD
346 /* Offset within stack frame to start allocating local variables at.
347 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
348 first local allocated. Otherwise, it is the offset to the BEGINNING
349 of the first local allocated. */
350 #define STARTING_FRAME_OFFSET 0
352 /* Given an rtx for the address of a frame,
353 return an rtx for the address of the word in the frame
354 that holds the dynamic chain--the previous frame's address. */
355 #define DYNAMIC_CHAIN_ADDRESS(FRAME) plus_constant ((FRAME), 12)
357 /* If we generate an insn to push BYTES bytes,
358 this says how many the stack pointer really advances by.
359 On the vax, -(sp) pushes only the bytes of the operands. */
360 #define PUSH_ROUNDING(BYTES) (BYTES)
362 /* Offset of first parameter from the argument pointer register value. */
363 #define FIRST_PARM_OFFSET(FNDECL) 4
365 /* Value is the number of bytes of arguments automatically
366 popped when returning from a subroutine call.
367 FUNDECL is the declaration node of the function (as a tree),
368 FUNTYPE is the data type of the function (as a tree),
369 or for a library call it is an identifier node for the subroutine name.
370 SIZE is the number of bytes of arguments passed on the stack.
372 On the Vax, the RET insn pops a maximum of 255 args for any function. */
374 #define RETURN_POPS_ARGS(FUNDECL,FUNTYPE,SIZE) \
375 ((SIZE) > 255*4 ? 0 : (SIZE))
377 /* Define how to find the value returned by a function.
378 VALTYPE is the data type of the value (as a tree).
379 If the precise function being called is known, FUNC is its FUNCTION_DECL;
380 otherwise, FUNC is 0. */
382 /* On the Vax the return value is in R0 regardless. */
384 #define FUNCTION_VALUE(VALTYPE, FUNC) \
385 gen_rtx_REG (TYPE_MODE (VALTYPE), 0)
387 /* Define how to find the value returned by a library function
388 assuming the value has mode MODE. */
390 /* On the Vax the return value is in R0 regardless. */
392 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, 0)
394 /* Define this if PCC uses the nonreentrant convention for returning
395 structure and union values. */
397 #define PCC_STATIC_STRUCT_RETURN
399 /* 1 if N is a possible register number for a function value.
400 On the Vax, R0 is the only register thus used. */
402 #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
404 /* 1 if N is a possible register number for function argument passing.
405 On the Vax, no registers are used in this way. */
407 #define FUNCTION_ARG_REGNO_P(N) 0
409 /* Define a data type for recording info about an argument list
410 during the scan of that argument list. This data type should
411 hold all necessary information about the function itself
412 and about the args processed so far, enough to enable macros
413 such as FUNCTION_ARG to determine where the next arg should go.
415 On the vax, this is a single integer, which is a number of bytes
416 of arguments scanned so far. */
418 #define CUMULATIVE_ARGS int
420 /* Initialize a variable CUM of type CUMULATIVE_ARGS
421 for a call to a function whose data type is FNTYPE.
422 For a library call, FNTYPE is 0.
424 On the vax, the offset starts at 0. */
426 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME,INDIRECT) \
429 /* Update the data in CUM to advance over an argument
430 of mode MODE and data type TYPE.
431 (TYPE is null for libcalls where that information may not be available.) */
433 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
434 ((CUM) += ((MODE) != BLKmode \
435 ? (GET_MODE_SIZE (MODE) + 3) & ~3 \
436 : (int_size_in_bytes (TYPE) + 3) & ~3))
438 /* Define where to put the arguments to a function.
439 Value is zero to push the argument on the stack,
440 or a hard register in which to store the argument.
442 MODE is the argument's machine mode.
443 TYPE is the data type of the argument (as a tree).
444 This is null for libcalls where that information may
446 CUM is a variable of type CUMULATIVE_ARGS which gives info about
447 the preceding args and about the function being called.
448 NAMED is nonzero if this argument is a named parameter
449 (otherwise it is an extra parameter matching an ellipsis). */
451 /* On the vax all args are pushed. */
453 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) 0
455 /* This macro generates the assembly code for function entry.
456 FILE is a stdio stream to output the code to.
457 SIZE is an int: how many units of temporary storage to allocate,
458 adjusted by STARTING_FRAME_OFFSET to accommodate vms.h.
459 Refer to the array `regs_ever_live' to determine which registers
460 to save; `regs_ever_live[I]' is nonzero if register number I
461 is ever used in the function. This macro is responsible for
462 knowing which registers should not be saved even if used. */
464 #define FUNCTION_PROLOGUE(FILE, SIZE) \
465 { register int regno; \
466 register int mask = 0; \
467 register int size = SIZE - STARTING_FRAME_OFFSET; \
468 extern char call_used_regs[]; \
469 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) \
470 if (regs_ever_live[regno] && !call_used_regs[regno]) \
471 mask |= 1 << regno; \
472 fprintf (FILE, "\t.word 0x%x\n", mask); \
473 MAYBE_VMS_FUNCTION_PROLOGUE(FILE) \
474 if ((size) >= 64) fprintf (FILE, "\tmovab %d(sp),sp\n", -size);\
475 else if (size) fprintf (FILE, "\tsubl2 $%d,sp\n", (size)); }
477 /* vms.h redefines this. */
478 #define MAYBE_VMS_FUNCTION_PROLOGUE(FILE)
480 /* Output assembler code to FILE to increment profiler label # LABELNO
481 for profiling a function entry. */
483 #define FUNCTION_PROFILER(FILE, LABELNO) \
484 fprintf (FILE, "\tmovab LP%d,r0\n\tjsb mcount\n", (LABELNO));
486 /* Output assembler code to FILE to initialize this source file's
487 basic block profiling info, if that has not already been done. */
489 #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
490 fprintf (FILE, "\ttstl LPBX0\n\tjneq LPI%d\n\tpushal LPBX0\n\tcalls $1,__bb_init_func\nLPI%d:\n", \
493 /* Output assembler code to FILE to increment the entry-count for
494 the BLOCKNO'th basic block in this source file. This is a real pain in the
495 sphincter on a VAX, since we do not want to change any of the bits in the
496 processor status word. The way it is done here, it is pushed onto the stack
497 before any flags have changed, and then the stack is fixed up to account for
498 the fact that the instruction to restore the flags only reads a word.
499 It may seem a bit clumsy, but at least it works.
502 #define BLOCK_PROFILER(FILE, BLOCKNO) \
503 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", \
506 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
507 the stack pointer does not matter. The value is tested only in
508 functions that have frame pointers.
509 No definition is equivalent to always zero. */
511 #define EXIT_IGNORE_STACK 1
513 /* This macro generates the assembly code for function exit,
514 on machines that need it. If FUNCTION_EPILOGUE is not defined
515 then individual return instructions are generated for each
516 return statement. Args are same as for FUNCTION_PROLOGUE. */
518 /* #define FUNCTION_EPILOGUE(FILE, SIZE) */
520 /* Store in the variable DEPTH the initial difference between the
521 frame pointer reg contents and the stack pointer reg contents,
522 as of the start of the function body. This depends on the layout
523 of the fixed parts of the stack frame and on how registers are saved.
525 On the Vax, FRAME_POINTER_REQUIRED is always 1, so the definition of this
526 macro doesn't matter. But it must be defined. */
528 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH) (DEPTH) = 0;
530 /* Output assembler code for a block containing the constant parts
531 of a trampoline, leaving space for the variable parts. */
533 /* On the vax, the trampoline contains an entry mask and two instructions:
535 movl $STATIC,r0 (store the functions static chain)
536 jmp *$FUNCTION (jump to function code at address FUNCTION) */
538 #define TRAMPOLINE_TEMPLATE(FILE) \
540 ASM_OUTPUT_SHORT (FILE, const0_rtx); \
541 ASM_OUTPUT_SHORT (FILE, GEN_INT (0x8fd0)); \
542 ASM_OUTPUT_INT (FILE, const0_rtx); \
543 ASM_OUTPUT_BYTE (FILE, 0x50 + STATIC_CHAIN_REGNUM); \
544 ASM_OUTPUT_SHORT (FILE, GEN_INT (0x9f17)); \
545 ASM_OUTPUT_INT (FILE, const0_rtx); \
548 /* Length in units of the trampoline for entering a nested function. */
550 #define TRAMPOLINE_SIZE 15
552 /* Emit RTL insns to initialize the variable parts of a trampoline.
553 FNADDR is an RTX for the address of the function's pure code.
554 CXT is an RTX for the static chain value for the function. */
556 /* We copy the register-mask from the function's pure code
557 to the start of the trampoline. */
558 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
560 emit_insn (gen_rtx_ASM_INPUT (VOIDmode, \
561 "movpsl -(sp)\n\tpushal 1(pc)\n\trei")); \
562 emit_move_insn (gen_rtx_MEM (HImode, TRAMP), \
563 gen_rtx_MEM (HImode, FNADDR)); \
564 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 4)), CXT);\
565 emit_move_insn (gen_rtx_MEM (SImode, plus_constant (TRAMP, 11)), \
566 plus_constant (FNADDR, 2)); \
569 /* Byte offset of return address in a stack frame. The "saved PC" field
570 is in element [4] when treating the frame as an array of longwords. */
572 #define RETURN_ADDRESS_OFFSET (4 * UNITS_PER_WORD) /* 16 */
574 /* A C expression whose value is RTL representing the value of the return
575 address for the frame COUNT steps up from the current frame.
576 FRAMEADDR is already the frame pointer of the COUNT frame, so we
579 #define RETURN_ADDR_RTX(COUNT, FRAME) \
581 ? gen_rtx_MEM (Pmode, plus_constant (FRAME, RETURN_ADDRESS_OFFSET)) \
585 /* Addressing modes, and classification of registers for them. */
587 #define HAVE_POST_INCREMENT 1
588 /* #define HAVE_POST_DECREMENT 0 */
590 #define HAVE_PRE_DECREMENT 1
591 /* #define HAVE_PRE_INCREMENT 0 */
593 /* Macros to check register numbers against specific register classes. */
595 /* These assume that REGNO is a hard or pseudo reg number.
596 They give nonzero only if REGNO is a hard reg of the suitable class
597 or a pseudo reg currently allocated to a suitable hard reg.
598 Since they use reg_renumber, they are safe only once reg_renumber
599 has been allocated, which happens in local-alloc.c. */
601 #define REGNO_OK_FOR_INDEX_P(regno) \
602 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
603 #define REGNO_OK_FOR_BASE_P(regno) \
604 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
606 /* Maximum number of registers that can appear in a valid memory address. */
608 #define MAX_REGS_PER_ADDRESS 2
610 /* 1 if X is an rtx for a constant that is a valid address. */
612 #define CONSTANT_ADDRESS_P(X) \
613 (GET_CODE (X) == LABEL_REF || GET_CODE (X) == SYMBOL_REF \
614 || GET_CODE (X) == CONST_INT || GET_CODE (X) == CONST \
615 || GET_CODE (X) == HIGH)
617 /* Nonzero if the constant value X is a legitimate general operand.
618 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
620 #define LEGITIMATE_CONSTANT_P(X) 1
622 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
623 and check its validity for a certain class.
624 We have two alternate definitions for each of them.
625 The usual definition accepts all pseudo regs; the other rejects
626 them unless they have been allocated suitable hard regs.
627 The symbol REG_OK_STRICT causes the latter definition to be used.
629 Most source files want to accept pseudo regs in the hope that
630 they will get allocated to the class that the insn wants them to be in.
631 Source files for reload pass need to be strict.
632 After reload, it makes no difference, since pseudo regs have
633 been eliminated by then. */
635 #ifndef REG_OK_STRICT
637 /* Nonzero if X is a hard reg that can be used as an index
638 or if it is a pseudo reg. */
639 #define REG_OK_FOR_INDEX_P(X) 1
640 /* Nonzero if X is a hard reg that can be used as a base reg
641 or if it is a pseudo reg. */
642 #define REG_OK_FOR_BASE_P(X) 1
646 /* Nonzero if X is a hard reg that can be used as an index. */
647 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
648 /* Nonzero if X is a hard reg that can be used as a base reg. */
649 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
653 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
654 that is a valid memory address for an instruction.
655 The MODE argument is the machine mode for the MEM expression
656 that wants to use this address.
658 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
659 except for CONSTANT_ADDRESS_P which is actually machine-independent. */
661 #ifdef NO_EXTERNAL_INDIRECT_ADDRESS
663 /* Zero if this contains a (CONST (PLUS (SYMBOL_REF) (...))) and the
664 symbol in the SYMBOL_REF is an external symbol. */
666 #define INDIRECTABLE_CONSTANT_P(X) \
667 (! (GET_CODE ((X)) == CONST \
668 && GET_CODE (XEXP ((X), 0)) == PLUS \
669 && GET_CODE (XEXP (XEXP ((X), 0), 0)) == SYMBOL_REF \
670 && SYMBOL_REF_FLAG (XEXP (XEXP ((X), 0), 0))))
672 /* Re-definition of CONSTANT_ADDRESS_P, which is true only when there
673 are no SYMBOL_REFs for external symbols present. */
675 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) \
676 (GET_CODE (X) == LABEL_REF \
677 || (GET_CODE (X) == SYMBOL_REF && !SYMBOL_REF_FLAG (X)) \
678 || (GET_CODE (X) == CONST && INDIRECTABLE_CONSTANT_P(X)) \
679 || GET_CODE (X) == CONST_INT)
682 /* Non-zero if X is an address which can be indirected. External symbols
683 could be in a sharable image library, so we disallow those. */
685 #define INDIRECTABLE_ADDRESS_P(X) \
686 (INDIRECTABLE_CONSTANT_ADDRESS_P (X) \
687 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
688 || (GET_CODE (X) == PLUS \
689 && GET_CODE (XEXP (X, 0)) == REG \
690 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
691 && INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))))
693 #else /* not NO_EXTERNAL_INDIRECT_ADDRESS */
695 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) CONSTANT_ADDRESS_P(X)
697 /* Non-zero if X is an address which can be indirected. */
698 #define INDIRECTABLE_ADDRESS_P(X) \
699 (CONSTANT_ADDRESS_P (X) \
700 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
701 || (GET_CODE (X) == PLUS \
702 && GET_CODE (XEXP (X, 0)) == REG \
703 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
704 && CONSTANT_ADDRESS_P (XEXP (X, 1))))
706 #endif /* not NO_EXTERNAL_INDIRECT_ADDRESS */
708 /* Go to ADDR if X is a valid address not using indexing.
709 (This much is the easy part.) */
710 #define GO_IF_NONINDEXED_ADDRESS(X, ADDR) \
711 { register rtx xfoob = (X); \
712 if (GET_CODE (xfoob) == REG) \
714 extern rtx *reg_equiv_mem; \
715 if (! reload_in_progress \
716 || reg_equiv_mem[REGNO (xfoob)] == 0 \
717 || INDIRECTABLE_ADDRESS_P (reg_equiv_mem[REGNO (xfoob)])) \
720 if (CONSTANT_ADDRESS_P (xfoob)) goto ADDR; \
721 if (INDIRECTABLE_ADDRESS_P (xfoob)) goto ADDR; \
722 xfoob = XEXP (X, 0); \
723 if (GET_CODE (X) == MEM && INDIRECTABLE_ADDRESS_P (xfoob)) \
725 if ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_INC) \
726 && GET_CODE (xfoob) == REG && REG_OK_FOR_BASE_P (xfoob)) \
729 /* 1 if PROD is either a reg times size of mode MODE
730 or just a reg, if MODE is just one byte.
731 This macro's expansion uses the temporary variables xfoo0 and xfoo1
732 that must be declared in the surrounding context. */
733 #define INDEX_TERM_P(PROD, MODE) \
734 (GET_MODE_SIZE (MODE) == 1 \
735 ? (GET_CODE (PROD) == REG && REG_OK_FOR_BASE_P (PROD)) \
736 : (GET_CODE (PROD) == MULT \
738 (xfoo0 = XEXP (PROD, 0), xfoo1 = XEXP (PROD, 1), \
739 ((((GET_CODE (xfoo0) == CONST_INT \
740 && GET_CODE (xfoo1) == REG) \
741 && INTVAL (xfoo0) == (int)GET_MODE_SIZE (MODE)) \
742 && REG_OK_FOR_INDEX_P (xfoo1)) \
744 (((GET_CODE (xfoo1) == CONST_INT \
745 && GET_CODE (xfoo0) == REG) \
746 && INTVAL (xfoo1) == (int)GET_MODE_SIZE (MODE)) \
747 && REG_OK_FOR_INDEX_P (xfoo0))))))
749 /* Go to ADDR if X is the sum of a register
750 and a valid index term for mode MODE. */
751 #define GO_IF_REG_PLUS_INDEX(X, MODE, ADDR) \
752 { register rtx xfooa; \
753 if (GET_CODE (X) == PLUS) \
754 { if (GET_CODE (XEXP (X, 0)) == REG \
755 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
756 && (xfooa = XEXP (X, 1), \
757 INDEX_TERM_P (xfooa, MODE))) \
759 if (GET_CODE (XEXP (X, 1)) == REG \
760 && REG_OK_FOR_BASE_P (XEXP (X, 1)) \
761 && (xfooa = XEXP (X, 0), \
762 INDEX_TERM_P (xfooa, MODE))) \
765 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
766 { register rtx xfoo, xfoo0, xfoo1; \
767 GO_IF_NONINDEXED_ADDRESS (X, ADDR); \
768 if (GET_CODE (X) == PLUS) \
769 { /* Handle <address>[index] represented with index-sum outermost */\
770 xfoo = XEXP (X, 0); \
771 if (INDEX_TERM_P (xfoo, MODE)) \
772 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 1), ADDR); } \
773 xfoo = XEXP (X, 1); \
774 if (INDEX_TERM_P (xfoo, MODE)) \
775 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 0), ADDR); } \
776 /* Handle offset(reg)[index] with offset added outermost */ \
777 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 0))) \
778 { if (GET_CODE (XEXP (X, 1)) == REG \
779 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
781 GO_IF_REG_PLUS_INDEX (XEXP (X, 1), MODE, ADDR); } \
782 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))) \
783 { if (GET_CODE (XEXP (X, 0)) == REG \
784 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
786 GO_IF_REG_PLUS_INDEX (XEXP (X, 0), MODE, ADDR); } } }
788 /* Try machine-dependent ways of modifying an illegitimate address
789 to be legitimate. If we find one, return the new, valid address.
790 This macro is used in only one place: `memory_address' in explow.c.
792 OLDX is the address as it was before break_out_memory_refs was called.
793 In some cases it is useful to look at this to decide what needs to be done.
795 MODE and WIN are passed so that this macro can use
796 GO_IF_LEGITIMATE_ADDRESS.
798 It is always safe for this macro to do nothing. It exists to recognize
799 opportunities to optimize the output.
801 For the vax, nothing needs to be done. */
803 #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) {}
805 /* Go to LABEL if ADDR (a legitimate address expression)
806 has an effect that depends on the machine mode it is used for.
807 On the VAX, the predecrement and postincrement address depend thus
808 (the amount of decrement or increment being the length of the operand)
809 and all indexed address depend thus (because the index scale factor
810 is the length of the operand). */
811 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
812 { if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == PRE_DEC) \
814 if (GET_CODE (ADDR) == PLUS) \
815 { if (CONSTANT_ADDRESS_P (XEXP (ADDR, 0)) \
816 && GET_CODE (XEXP (ADDR, 1)) == REG); \
817 else if (CONSTANT_ADDRESS_P (XEXP (ADDR, 1)) \
818 && GET_CODE (XEXP (ADDR, 0)) == REG); \
821 /* Specify the machine mode that this machine uses
822 for the index in the tablejump instruction. */
823 #define CASE_VECTOR_MODE HImode
825 /* Define as C expression which evaluates to nonzero if the tablejump
826 instruction expects the table to contain offsets from the address of the
828 Do not define this if the table should contain absolute addresses. */
829 #define CASE_VECTOR_PC_RELATIVE 1
831 /* Define this if the case instruction drops through after the table
832 when the index is out of range. Don't define it if the case insn
833 jumps to the default label instead. */
834 #define CASE_DROPS_THROUGH
836 /* Specify the tree operation to be used to convert reals to integers. */
837 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
839 /* This is the kind of divide that is easiest to do in the general case. */
840 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
842 /* Define this as 1 if `char' should by default be signed; else as 0. */
843 #define DEFAULT_SIGNED_CHAR 1
845 /* This flag, if defined, says the same insns that convert to a signed fixnum
846 also convert validly to an unsigned one. */
847 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
849 /* Max number of bytes we can move from memory to memory
850 in one reasonably fast instruction. */
853 /* Define this if zero-extension is slow (more than one real instruction). */
854 /* #define SLOW_ZERO_EXTEND */
856 /* Nonzero if access to memory by bytes is slow and undesirable. */
857 #define SLOW_BYTE_ACCESS 0
859 /* Define if shifts truncate the shift count
860 which implies one can omit a sign-extension or zero-extension
862 /* #define SHIFT_COUNT_TRUNCATED */
864 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
865 is done just by pretending it is already truncated. */
866 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
868 /* Specify the machine mode that pointers have.
869 After generation of rtl, the compiler makes no further distinction
870 between pointers and any other objects of this machine mode. */
873 /* A function address in a call instruction
874 is a byte address (for indexing purposes)
875 so give the MEM rtx a byte's mode. */
876 #define FUNCTION_MODE QImode
878 /* This machine doesn't use IEEE floats. */
880 #define TARGET_FLOAT_FORMAT VAX_FLOAT_FORMAT
882 /* Compute the cost of computing a constant rtl expression RTX
883 whose rtx-code is CODE. The body of this macro is a portion
884 of a switch statement. If the code is computed here,
885 return it with a return statement. Otherwise, break from the switch. */
887 /* On a VAX, constants from 0..63 are cheap because they can use the
888 1 byte literal constant format. compare to -1 should be made cheap
889 so that decrement-and-branch insns can be formed more easily (if
890 the value -1 is copied to a register some decrement-and-branch patterns
893 #define CONST_COSTS(RTX,CODE,OUTER_CODE) \
895 if (INTVAL (RTX) == 0) return 0; \
896 if ((OUTER_CODE) == AND) \
897 return ((unsigned) ~INTVAL (RTX) <= 077) ? 1 : 2; \
898 if ((unsigned) INTVAL (RTX) <= 077) return 1; \
899 if ((OUTER_CODE) == COMPARE && INTVAL (RTX) == -1) \
901 if ((OUTER_CODE) == PLUS && (unsigned) -INTVAL (RTX) <= 077)\
908 if (GET_MODE_CLASS (GET_MODE (RTX)) == MODE_FLOAT) \
909 return vax_float_literal (RTX) ? 5 : 8; \
911 return (((CONST_DOUBLE_HIGH (RTX) == 0 \
912 && (unsigned) CONST_DOUBLE_LOW (RTX) < 64) \
913 || ((OUTER_CODE) == PLUS \
914 && CONST_DOUBLE_HIGH (RTX) == -1 \
915 && (unsigned)-CONST_DOUBLE_LOW (RTX) < 64)) \
918 #define RTX_COSTS(RTX,CODE,OUTER_CODE) case FIX: case FLOAT: \
919 case MULT: case DIV: case UDIV: case MOD: case UMOD: \
920 case ASHIFT: case LSHIFTRT: case ASHIFTRT: \
921 case ROTATE: case ROTATERT: case PLUS: case MINUS: case IOR: \
922 case XOR: case AND: case NEG: case NOT: case ZERO_EXTRACT: \
923 case SIGN_EXTRACT: case MEM: return vax_rtx_cost(RTX)
925 #define ADDRESS_COST(RTX) (1 + (GET_CODE (RTX) == REG ? 0 : vax_address_cost(RTX)))
927 /* Specify the cost of a branch insn; roughly the number of extra insns that
928 should be added to avoid a branch.
930 Branches are extremely cheap on the VAX while the shift insns often
931 used to replace branches can be expensive. */
933 #define BRANCH_COST 0
936 * We can use the BSD C library routines for the libgcc calls that are
937 * still generated, since that's what they boil down to anyways.
940 #define UDIVSI3_LIBCALL "*udiv"
941 #define UMODSI3_LIBCALL "*urem"
943 /* Check a `double' value for validity for a particular machine mode. */
945 /* note that it is very hard to accidentally create a number that fits in a
946 double but not in a float, since their ranges are almost the same */
948 #define CHECK_FLOAT_VALUE(MODE, D, OVERFLOW) \
949 ((OVERFLOW) = check_float_value (MODE, &D, OVERFLOW))
951 /* For future reference:
952 D Float: 9 bit, sign magnitude, excess 128 binary exponent
953 normalized 56 bit fraction, redundant bit not represented
954 approximately 16 decimal digits of precision
956 The values to use if we trust decimal to binary conversions:
957 #define MAX_D_FLOAT 1.7014118346046923e+38
958 #define MIN_D_FLOAT .29387358770557188e-38
960 G float: 12 bit, sign magnitude, excess 1024 binary exponent
961 normalized 53 bit fraction, redundant bit not represented
962 approximately 15 decimal digits precision
964 The values to use if we trust decimal to binary conversions:
965 #define MAX_G_FLOAT .898846567431157e+308
966 #define MIN_G_FLOAT .556268464626800e-308
969 /* Tell final.c how to eliminate redundant test instructions. */
971 /* Here we define machine-dependent flags and fields in cc_status
972 (see `conditions.h'). No extra ones are needed for the vax. */
974 /* Store in cc_status the expressions
975 that the condition codes will describe
976 after execution of an instruction whose pattern is EXP.
977 Do not alter them if the instruction would not alter the cc's. */
979 #define NOTICE_UPDATE_CC(EXP, INSN) \
980 { if (GET_CODE (EXP) == SET) \
981 { if (GET_CODE (SET_SRC (EXP)) == CALL) \
983 else if (GET_CODE (SET_DEST (EXP)) != ZERO_EXTRACT \
984 && GET_CODE (SET_DEST (EXP)) != PC) \
985 { cc_status.flags = 0; \
986 cc_status.value1 = SET_DEST (EXP); \
987 cc_status.value2 = SET_SRC (EXP); } } \
988 else if (GET_CODE (EXP) == PARALLEL \
989 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
991 if (GET_CODE (SET_SRC (XVECEXP (EXP, 0, 0))) == CALL) \
993 else if (GET_CODE (SET_DEST (XVECEXP (EXP, 0, 0))) != PC) \
994 { cc_status.flags = 0; \
995 cc_status.value1 = SET_DEST (XVECEXP (EXP, 0, 0)); \
996 cc_status.value2 = SET_SRC (XVECEXP (EXP, 0, 0)); } \
998 /* PARALLELs whose first element sets the PC are aob, \
999 sob insns. They do change the cc's. */ \
1001 else CC_STATUS_INIT; \
1002 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
1003 && cc_status.value2 \
1004 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
1005 cc_status.value2 = 0; \
1006 if (cc_status.value1 && GET_CODE (cc_status.value1) == MEM \
1007 && cc_status.value2 \
1008 && GET_CODE (cc_status.value2) == MEM) \
1009 cc_status.value2 = 0; }
1010 /* Actual condition, one line up, should be that value2's address
1011 depends on value1, but that is too much of a pain. */
1013 #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
1014 { if (cc_status.flags & CC_NO_OVERFLOW) \
1018 /* Control the assembler format that we output. */
1020 /* Output at beginning of assembler file. */
1022 #define ASM_FILE_START(FILE) fprintf (FILE, "#NO_APP\n");
1024 /* Output to assembler file text saying following lines
1025 may contain character constants, extra white space, comments, etc. */
1027 #define ASM_APP_ON "#APP\n"
1029 /* Output to assembler file text saying following lines
1030 no longer contain unusual constructs. */
1032 #define ASM_APP_OFF "#NO_APP\n"
1034 /* Output before read-only data. */
1036 #define TEXT_SECTION_ASM_OP "\t.text"
1038 /* Output before writable data. */
1040 #define DATA_SECTION_ASM_OP "\t.data"
1042 /* How to refer to registers in assembler output.
1043 This sequence is indexed by compiler's hard-register-number (see above). */
1045 #define REGISTER_NAMES \
1046 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \
1047 "r9", "r10", "r11", "ap", "fp", "sp", "pc"}
1049 /* This is BSD, so it wants DBX format. */
1051 #define DBX_DEBUGGING_INFO
1053 /* How to renumber registers for dbx and gdb.
1054 Vax needs no change in the numeration. */
1056 #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1058 /* Do not break .stabs pseudos into continuations. */
1060 #define DBX_CONTIN_LENGTH 0
1062 /* This is the char to use for continuation (in case we need to turn
1063 continuation back on). */
1065 #define DBX_CONTIN_CHAR '?'
1067 /* Don't use the `xsfoo;' construct in DBX output; this system
1068 doesn't support it. */
1070 #define DBX_NO_XREFS
1072 /* Output the .stabs for a C `static' variable in the data section. */
1073 #define DBX_STATIC_STAB_DATA_SECTION
1075 /* Vax specific: which type character is used for type double? */
1077 #define ASM_DOUBLE_CHAR (TARGET_G_FLOAT ? 'g' : 'd')
1079 /* This is how to output the definition of a user-level label named NAME,
1080 such as the label on a static function or variable NAME. */
1082 #define ASM_OUTPUT_LABEL(FILE,NAME) \
1083 do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
1085 /* This is how to output a command to make the user-level label named NAME
1086 defined for reference from other files. */
1088 #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
1089 do { fputs (".globl ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
1091 /* The prefix to add to user-visible assembler symbols. */
1093 #define USER_LABEL_PREFIX "_"
1095 /* This is how to output an internal numbered label where
1096 PREFIX is the class of label and NUM is the number within the class. */
1098 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1099 fprintf (FILE, "%s%d:\n", PREFIX, NUM)
1101 /* This is how to store into the string LABEL
1102 the symbol_ref name of an internal numbered label where
1103 PREFIX is the class of label and NUM is the number within the class.
1104 This is suitable for output with `assemble_name'. */
1106 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1107 sprintf (LABEL, "*%s%d", PREFIX, NUM)
1109 /* This is how to output an assembler line defining a `double' constant.
1110 It is .dfloat or .gfloat, depending. */
1112 #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
1113 do { char dstr[30]; \
1114 REAL_VALUE_TO_DECIMAL (VALUE, "%.20e", dstr); \
1115 fprintf (FILE, "\t.%cfloat 0%c%s\n", ASM_DOUBLE_CHAR, \
1116 ASM_DOUBLE_CHAR, dstr); \
1119 /* This is how to output an assembler line defining a `float' constant. */
1121 #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
1122 do { char dstr[30]; \
1123 REAL_VALUE_TO_DECIMAL (VALUE, "%.20e", dstr); \
1124 fprintf (FILE, "\t.float 0f%s\n", dstr); } while (0);
1126 /* This is how to output an assembler line defining an `int' constant. */
1128 #define ASM_OUTPUT_INT(FILE,VALUE) \
1129 ( fprintf (FILE, "\t.long "), \
1130 output_addr_const (FILE, (VALUE)), \
1131 fprintf (FILE, "\n"))
1133 /* Likewise for `char' and `short' constants. */
1135 #define ASM_OUTPUT_SHORT(FILE,VALUE) \
1136 ( fprintf (FILE, "\t.word "), \
1137 output_addr_const (FILE, (VALUE)), \
1138 fprintf (FILE, "\n"))
1140 #define ASM_OUTPUT_CHAR(FILE,VALUE) \
1141 ( fprintf (FILE, "\t.byte "), \
1142 output_addr_const (FILE, (VALUE)), \
1143 fprintf (FILE, "\n"))
1145 /* This is how to output an assembler line for a numeric constant byte. */
1147 #define ASM_OUTPUT_BYTE(FILE,VALUE) \
1148 fprintf (FILE, "\t.byte 0x%x\n", (VALUE))
1150 /* This is how to output an insn to push a register on the stack.
1151 It need not be very fast code. */
1153 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
1154 fprintf (FILE, "\tpushl %s\n", reg_names[REGNO])
1156 /* This is how to output an insn to pop a register from the stack.
1157 It need not be very fast code. */
1159 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
1160 fprintf (FILE, "\tmovl (sp)+,%s\n", reg_names[REGNO])
1162 /* This is how to output an element of a case-vector that is absolute.
1163 (The Vax does not use such vectors,
1164 but we must define this macro anyway.) */
1166 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1167 fprintf (FILE, "\t.long L%d\n", VALUE)
1169 /* This is how to output an element of a case-vector that is relative. */
1171 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
1172 fprintf (FILE, "\t.word L%d-L%d\n", VALUE, REL)
1174 /* This is how to output an assembler line
1175 that says to advance the location counter
1176 to a multiple of 2**LOG bytes. */
1178 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1179 fprintf (FILE, "\t.align %d\n", (LOG))
1181 /* This is how to output an assembler line
1182 that says to advance the location counter by SIZE bytes. */
1184 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1185 fprintf (FILE, "\t.space %u\n", (SIZE))
1187 /* This says how to output an assembler line
1188 to define a global common symbol. */
1190 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1191 ( fputs (".comm ", (FILE)), \
1192 assemble_name ((FILE), (NAME)), \
1193 fprintf ((FILE), ",%u\n", (ROUNDED)))
1195 /* This says how to output an assembler line
1196 to define a local common symbol. */
1198 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1199 ( fputs (".lcomm ", (FILE)), \
1200 assemble_name ((FILE), (NAME)), \
1201 fprintf ((FILE), ",%u\n", (ROUNDED)))
1203 /* Store in OUTPUT a string (made with alloca) containing
1204 an assembler-name for a local static variable named NAME.
1205 LABELNO is an integer which is different for each call. */
1207 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1208 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
1209 sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
1211 /* When debugging, we want to output an extra dummy label so that gas
1212 can distinguish between D_float and G_float prior to processing the
1213 .stabs directive identifying type double. */
1215 #define ASM_IDENTIFY_LANGUAGE(FILE) \
1217 output_lang_identify (FILE); \
1218 if (write_symbols == DBX_DEBUG) \
1219 fprintf (FILE, "___vax_%c_doubles:\n", ASM_DOUBLE_CHAR); \
1222 /* Output code to add DELTA to the first argument, and then jump to FUNCTION.
1223 Used for C++ multiple inheritance.
1224 .mask ^m<r2,r3,r4,r5,r6,r7,r8,r9,r10,r11> #conservative entry mask
1225 addl2 $DELTA, 4(ap) #adjust first argument
1226 jmp FUNCTION+2 #jump beyond FUNCTION's entry mask
1228 #define ASM_OUTPUT_MI_THUNK(FILE, THUNK_FNDECL, DELTA, FUNCTION) \
1230 fprintf (FILE, "\t.word 0x0ffc\n"); \
1231 fprintf (FILE, "\taddl2 $%d,4(ap)\n", DELTA); \
1232 fprintf (FILE, "\tjmp "); \
1233 assemble_name (FILE, XSTR (XEXP (DECL_RTL (FUNCTION), 0), 0)); \
1234 fprintf (FILE, "+2\n"); \
1237 /* Define the parentheses used to group arithmetic operations
1238 in assembler code. */
1240 #define ASM_OPEN_PAREN "("
1241 #define ASM_CLOSE_PAREN ")"
1243 /* Define results of standard character escape sequences. */
1244 #define TARGET_BELL 007
1245 #define TARGET_BS 010
1246 #define TARGET_TAB 011
1247 #define TARGET_NEWLINE 012
1248 #define TARGET_VT 013
1249 #define TARGET_FF 014
1250 #define TARGET_CR 015
1252 /* Print an instruction operand X on file FILE.
1253 CODE is the code from the %-spec that requested printing this operand;
1254 if `%z3' was used to print operand 3, then CODE is 'z'.
1256 VAX operand formatting codes:
1259 C reverse branch condition
1260 D 64-bit immediate operand
1261 B the low 8 bits of the complement of a constant operand
1262 H the low 16 bits of the complement of a constant operand
1263 M a mask for the N highest bits of a word
1264 N the complement of a constant integer operand
1265 P constant operand plus 1
1266 R 32 - constant operand
1267 b the low 8 bits of a negated constant operand
1268 h the low 16 bits of a negated constant operand
1269 # 'd' or 'g' depending on whether dfloat or gfloat is used */
1271 /* The purpose of D is to get around a quirk or bug in vax assembler
1272 whereby -1 in a 64-bit immediate operand means 0x00000000ffffffff,
1273 which is not a 64-bit minus one. */
1275 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
1278 #define PRINT_OPERAND(FILE, X, CODE) \
1279 { if (CODE == '#') fputc (ASM_DOUBLE_CHAR, FILE); \
1280 else if (CODE == 'C') \
1281 fputs (rev_cond_name (X), FILE); \
1282 else if (CODE == 'D' && GET_CODE (X) == CONST_INT && INTVAL (X) < 0) \
1283 fprintf (FILE, "$0xffffffff%08x", INTVAL (X)); \
1284 else if (CODE == 'P' && GET_CODE (X) == CONST_INT) \
1285 fprintf (FILE, "$%d", INTVAL (X) + 1); \
1286 else if (CODE == 'N' && GET_CODE (X) == CONST_INT) \
1287 fprintf (FILE, "$%d", ~ INTVAL (X)); \
1288 /* rotl instruction cannot deal with negative arguments. */ \
1289 else if (CODE == 'R' && GET_CODE (X) == CONST_INT) \
1290 fprintf (FILE, "$%d", 32 - INTVAL (X)); \
1291 else if (CODE == 'H' && GET_CODE (X) == CONST_INT) \
1292 fprintf (FILE, "$%d", 0xffff & ~ INTVAL (X)); \
1293 else if (CODE == 'h' && GET_CODE (X) == CONST_INT) \
1294 fprintf (FILE, "$%d", (short) - INTVAL (x)); \
1295 else if (CODE == 'B' && GET_CODE (X) == CONST_INT) \
1296 fprintf (FILE, "$%d", 0xff & ~ INTVAL (X)); \
1297 else if (CODE == 'b' && GET_CODE (X) == CONST_INT) \
1298 fprintf (FILE, "$%d", 0xff & - INTVAL (X)); \
1299 else if (CODE == 'M' && GET_CODE (X) == CONST_INT) \
1300 fprintf (FILE, "$%d", ~((1 << INTVAL (x)) - 1)); \
1301 else if (GET_CODE (X) == REG) \
1302 fprintf (FILE, "%s", reg_names[REGNO (X)]); \
1303 else if (GET_CODE (X) == MEM) \
1304 output_address (XEXP (X, 0)); \
1305 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) == SFmode) \
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, "$0f%s", dstr); } \
1310 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) == DFmode) \
1311 { REAL_VALUE_TYPE r; char dstr[30]; \
1312 REAL_VALUE_FROM_CONST_DOUBLE (r, X); \
1313 REAL_VALUE_TO_DECIMAL (r, "%.20e", dstr); \
1314 fprintf (FILE, "$0%c%s", ASM_DOUBLE_CHAR, dstr); } \
1315 else { putc ('$', FILE); output_addr_const (FILE, X); }}
1317 /* Print a memory operand whose address is X, on file FILE.
1318 This uses a function in output-vax.c. */
1320 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1321 print_operand_address (FILE, ADDR)