1 /* Definitions of target machine for GNU compiler. Vax version.
2 Copyright (C) 1987, 1988, 1991 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* Names to predefine in the preprocessor for this target machine. */
23 #define CPP_PREDEFINES "-Dvax -Dunix"
25 /* If using g-format floating point, alter math.h. */
27 #define CPP_SPEC "%{mg:-DGFLOAT}"
29 /* Choose proper libraries depending on float format.
30 Note that there are no profiling libraries for g-format.
31 Also use -lg for the sake of dbx. */
33 #define LIB_SPEC "%{g:-lg}\
34 %{mg:%{lm:-lmg} -lcg \
35 %{p:%eprofiling not supported with -mg\n}\
36 %{pg:%eprofiling not supported with -mg\n}}\
37 %{!mg:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
39 /* Print subsidiary information on the compiler version in use. */
41 #define TARGET_VERSION fprintf (stderr, " (vax)");
43 /* Run-time compilation parameters selecting different hardware subsets. */
45 extern int target_flags;
47 /* Macros used in the machine description to test the flags. */
49 /* Nonzero if compiling code that Unix assembler can assemble. */
50 #define TARGET_UNIX_ASM (target_flags & 1)
52 /* Nonzero if compiling with VAX-11 "C" style structure alignment */
53 #define TARGET_VAXC_ALIGNMENT (target_flags & 2)
55 /* Nonzero if compiling with `G'-format floating point */
56 #define TARGET_G_FLOAT (target_flags & 4)
58 /* Macro to define tables used to set the flags.
59 This is a list in braces of pairs in braces,
60 each pair being { "NAME", VALUE }
61 where VALUE is the bits to set or minus the bits to clear.
62 An empty string NAME is used to identify the default VALUE. */
64 #define TARGET_SWITCHES \
67 {"vaxc-alignment", 2}, \
72 { "", TARGET_DEFAULT}}
74 /* Default target_flags if no switches specified. */
76 #ifndef TARGET_DEFAULT
77 #define TARGET_DEFAULT 1
80 /* Target machine storage layout */
82 /* Define this if most significant bit is lowest numbered
83 in instructions that operate on numbered bit-fields.
84 This is not true on the vax. */
85 #define BITS_BIG_ENDIAN 0
87 /* Define this if most significant byte of a word is the lowest numbered. */
88 /* That is not true on the vax. */
89 #define BYTES_BIG_ENDIAN 0
91 /* Define this if most significant word of a multiword number is the lowest
93 /* This is not true on the vax. */
94 #define WORDS_BIG_ENDIAN 0
96 /* Number of bits in an addressable storage unit */
97 #define BITS_PER_UNIT 8
99 /* Width in bits of a "word", which is the contents of a machine register.
100 Note that this is not necessarily the width of data type `int';
101 if using 16-bit ints on a 68000, this would still be 32.
102 But on a machine with 16-bit registers, this would be 16. */
103 #define BITS_PER_WORD 32
105 /* Width of a word, in units (bytes). */
106 #define UNITS_PER_WORD 4
108 /* Width in bits of a pointer.
109 See also the macro `Pmode' defined below. */
110 #define POINTER_SIZE 32
112 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
113 #define PARM_BOUNDARY 32
115 /* Allocation boundary (in *bits*) for the code of a function. */
116 #define FUNCTION_BOUNDARY 16
118 /* Alignment of field after `int : 0' in a structure. */
119 #define EMPTY_FIELD_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
121 /* Every structure's size must be a multiple of this. */
122 #define STRUCTURE_SIZE_BOUNDARY 8
124 /* A bitfield declared as `int' forces `int' alignment for the struct. */
125 #define PCC_BITFIELD_TYPE_MATTERS (! TARGET_VAXC_ALIGNMENT)
127 /* No data type wants to be aligned rounder than this. */
128 #define BIGGEST_ALIGNMENT 32
130 /* No structure field wants to be aligned rounder than this. */
131 #define BIGGEST_FIELD_ALIGNMENT (TARGET_VAXC_ALIGNMENT ? 8 : 32)
133 /* Set this nonzero if move instructions will actually fail to work
134 when given unaligned data. */
135 #define STRICT_ALIGNMENT 0
137 /* Let's keep the stack somewhat aligned. */
138 #define STACK_BOUNDARY 32
140 /* Standard register usage. */
142 /* Number of actual hardware registers.
143 The hardware registers are assigned numbers for the compiler
144 from 0 to just below FIRST_PSEUDO_REGISTER.
145 All registers that the compiler knows about must be given numbers,
146 even those that are not normally considered general registers. */
147 #define FIRST_PSEUDO_REGISTER 16
149 /* 1 for registers that have pervasive standard uses
150 and are not available for the register allocator.
151 On the vax, these are the AP, FP, SP and PC. */
152 #define FIXED_REGISTERS {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
154 /* 1 for registers not available across function calls.
155 These must include the FIXED_REGISTERS and also any
156 registers that can be used without being saved.
157 The latter must include the registers where values are returned
158 and the register where structure-value addresses are passed.
159 Aside from that, you can include as many other registers as you like. */
160 #define CALL_USED_REGISTERS {1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
162 /* Return number of consecutive hard regs needed starting at reg REGNO
163 to hold something of mode MODE.
164 This is ordinarily the length in words of a value of mode MODE
165 but can be less for certain modes in special long registers.
166 On the vax, all registers are one word long. */
167 #define HARD_REGNO_NREGS(REGNO, MODE) \
168 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
170 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
171 On the vax, all registers can hold all modes. */
172 #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
174 /* Value is 1 if it is a good idea to tie two pseudo registers
175 when one has mode MODE1 and one has mode MODE2.
176 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
177 for any hard reg, then this must be 0 for correct output. */
178 #define MODES_TIEABLE_P(MODE1, MODE2) 1
180 /* Specify the registers used for certain standard purposes.
181 The values of these macros are register numbers. */
183 /* Vax pc is overloaded on a register. */
186 /* Register to use for pushing function arguments. */
187 #define STACK_POINTER_REGNUM 14
189 /* Base register for access to local variables of the function. */
190 #define FRAME_POINTER_REGNUM 13
192 /* Value should be nonzero if functions must have frame pointers.
193 Zero means the frame pointer need not be set up (and parms
194 may be accessed via the stack pointer) in functions that seem suitable.
195 This is computed in `reload', in reload1.c. */
196 #define FRAME_POINTER_REQUIRED 1
198 /* Base register for access to arguments of the function. */
199 #define ARG_POINTER_REGNUM 12
201 /* Register in which static-chain is passed to a function. */
202 #define STATIC_CHAIN_REGNUM 0
204 /* Register in which address to store a structure value
205 is passed to a function. */
206 #define STRUCT_VALUE_REGNUM 1
208 /* Define the classes of registers for register constraints in the
209 machine description. Also define ranges of constants.
211 One of the classes must always be named ALL_REGS and include all hard regs.
212 If there is more than one class, another class must be named NO_REGS
213 and contain no registers.
215 The name GENERAL_REGS must be the name of a class (or an alias for
216 another name such as ALL_REGS). This is the class of registers
217 that is allowed by "g" or "r" in a register constraint.
218 Also, registers outside this class are allocated only when
219 instructions express preferences for them.
221 The classes must be numbered in nondecreasing order; that is,
222 a larger-numbered class must never be contained completely
223 in a smaller-numbered class.
225 For any two classes, it is very desirable that there be another
226 class that represents their union. */
228 /* The vax has only one kind of registers, so NO_REGS and ALL_REGS
229 are the only classes. */
231 enum reg_class { NO_REGS, ALL_REGS, LIM_REG_CLASSES };
233 #define N_REG_CLASSES (int) LIM_REG_CLASSES
235 /* Since GENERAL_REGS is the same class as ALL_REGS,
236 don't give it a different class number; just make it an alias. */
238 #define GENERAL_REGS ALL_REGS
240 /* Give names of register classes as strings for dump file. */
242 #define REG_CLASS_NAMES \
243 {"NO_REGS", "ALL_REGS" }
245 /* Define which registers fit in which classes.
246 This is an initializer for a vector of HARD_REG_SET
247 of length N_REG_CLASSES. */
249 #define REG_CLASS_CONTENTS {0, 0xffff}
251 /* The same information, inverted:
252 Return the class number of the smallest class containing
253 reg number REGNO. This could be a conditional expression
254 or could index an array. */
256 #define REGNO_REG_CLASS(REGNO) ALL_REGS
258 /* The class value for index registers, and the one for base regs. */
260 #define INDEX_REG_CLASS ALL_REGS
261 #define BASE_REG_CLASS ALL_REGS
263 /* Get reg_class from a letter such as appears in the machine description. */
265 #define REG_CLASS_FROM_LETTER(C) NO_REGS
267 /* The letters I, J, K, L and M in a register constraint string
268 can be used to stand for particular ranges of immediate operands.
269 This macro defines what the ranges are.
270 C is the letter, and VALUE is a constant value.
271 Return 1 if VALUE is in the range specified by C.
273 `I' is the constant zero. */
275 #define CONST_OK_FOR_LETTER_P(VALUE, C) \
276 ((C) == 'I' ? (VALUE) == 0 \
279 /* Similar, but for floating constants, and defining letters G and H.
280 Here VALUE is the CONST_DOUBLE rtx itself.
282 `G' is a floating-point zero. */
284 #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) \
285 ((C) == 'G' ? ((VALUE) == CONST0_RTX (DFmode) \
286 || (VALUE) == CONST0_RTX (SFmode)) \
289 /* Optional extra constraints for this machine.
291 For the VAX, `Q' means that OP is a MEM that does not have a mode-dependent
294 #define EXTRA_CONSTRAINT(OP, C) \
296 ? GET_CODE (OP) == MEM && ! mode_dependent_address_p (XEXP (OP, 0)) \
299 /* Given an rtx X being reloaded into a reg required to be
300 in class CLASS, return the class of reg to actually use.
301 In general this is just CLASS; but on some machines
302 in some cases it is preferable to use a more restrictive class. */
304 #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
306 /* Return the maximum number of consecutive registers
307 needed to represent mode MODE in a register of class CLASS. */
308 /* On the vax, this is always the size of MODE in words,
309 since all registers are the same size. */
310 #define CLASS_MAX_NREGS(CLASS, MODE) \
311 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
313 /* Stack layout; function entry, exit and calling. */
315 /* Define this if pushing a word on the stack
316 makes the stack pointer a smaller address. */
317 #define STACK_GROWS_DOWNWARD
319 /* Define this if longjmp restores from saved registers
320 rather than from what setjmp saved. */
321 #define LONGJMP_RESTORE_FROM_STACK
323 /* Define this if the nominal address of the stack frame
324 is at the high-address end of the local variables;
325 that is, each additional local variable allocated
326 goes at a more negative offset in the frame. */
327 #define FRAME_GROWS_DOWNWARD
329 /* Offset within stack frame to start allocating local variables at.
330 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
331 first local allocated. Otherwise, it is the offset to the BEGINNING
332 of the first local allocated. */
333 #define STARTING_FRAME_OFFSET 0
335 /* Given an rtx for the address of a frame,
336 return an rtx for the address of the word in the frame
337 that holds the dynamic chain--the previous frame's address. */
338 #define DYNAMIC_CHAIN_ADDRESS(frame) \
339 gen_rtx (PLUS, Pmode, frame, gen_rtx (CONST_INT, VOIDmode, 12))
341 /* If we generate an insn to push BYTES bytes,
342 this says how many the stack pointer really advances by.
343 On the vax, -(sp) pushes only the bytes of the operands. */
344 #define PUSH_ROUNDING(BYTES) (BYTES)
346 /* Offset of first parameter from the argument pointer register value. */
347 #define FIRST_PARM_OFFSET(FNDECL) 4
349 /* Value is the number of bytes of arguments automatically
350 popped when returning from a subroutine call.
351 FUNTYPE is the data type of the function (as a tree),
352 or for a library call it is an identifier node for the subroutine name.
353 SIZE is the number of bytes of arguments passed on the stack.
355 On the Vax, the RET insn always pops all the args for any function. */
357 #define RETURN_POPS_ARGS(FUNTYPE,SIZE) (SIZE)
359 /* Define how to find the value returned by a function.
360 VALTYPE is the data type of the value (as a tree).
361 If the precise function being called is known, FUNC is its FUNCTION_DECL;
362 otherwise, FUNC is 0. */
364 /* On the Vax the return value is in R0 regardless. */
366 #define FUNCTION_VALUE(VALTYPE, FUNC) \
367 gen_rtx (REG, TYPE_MODE (VALTYPE), 0)
369 /* Define how to find the value returned by a library function
370 assuming the value has mode MODE. */
372 /* On the Vax the return value is in R0 regardless. */
374 #define LIBCALL_VALUE(MODE) gen_rtx (REG, MODE, 0)
376 /* Define this if PCC uses the nonreentrant convention for returning
377 structure and union values. */
379 #define PCC_STATIC_STRUCT_RETURN
381 /* 1 if N is a possible register number for a function value.
382 On the Vax, R0 is the only register thus used. */
384 #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
386 /* 1 if N is a possible register number for function argument passing.
387 On the Vax, no registers are used in this way. */
389 #define FUNCTION_ARG_REGNO_P(N) 0
391 /* Define a data type for recording info about an argument list
392 during the scan of that argument list. This data type should
393 hold all necessary information about the function itself
394 and about the args processed so far, enough to enable macros
395 such as FUNCTION_ARG to determine where the next arg should go.
397 On the vax, this is a single integer, which is a number of bytes
398 of arguments scanned so far. */
400 #define CUMULATIVE_ARGS int
402 /* Initialize a variable CUM of type CUMULATIVE_ARGS
403 for a call to a function whose data type is FNTYPE.
404 For a library call, FNTYPE is 0.
406 On the vax, the offset starts at 0. */
408 #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE,LIBNAME) \
411 /* Update the data in CUM to advance over an argument
412 of mode MODE and data type TYPE.
413 (TYPE is null for libcalls where that information may not be available.) */
415 #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
416 ((CUM) += ((MODE) != BLKmode \
417 ? (GET_MODE_SIZE (MODE) + 3) & ~3 \
418 : (int_size_in_bytes (TYPE) + 3) & ~3))
420 /* Define where to put the arguments to a function.
421 Value is zero to push the argument on the stack,
422 or a hard register in which to store the argument.
424 MODE is the argument's machine mode.
425 TYPE is the data type of the argument (as a tree).
426 This is null for libcalls where that information may
428 CUM is a variable of type CUMULATIVE_ARGS which gives info about
429 the preceding args and about the function being called.
430 NAMED is nonzero if this argument is a named parameter
431 (otherwise it is an extra parameter matching an ellipsis). */
433 /* On the vax all args are pushed. */
435 #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) 0
437 /* This macro generates the assembly code for function entry.
438 FILE is a stdio stream to output the code to.
439 SIZE is an int: how many units of temporary storage to allocate.
440 Refer to the array `regs_ever_live' to determine which registers
441 to save; `regs_ever_live[I]' is nonzero if register number I
442 is ever used in the function. This macro is responsible for
443 knowing which registers should not be saved even if used. */
445 #define FUNCTION_PROLOGUE(FILE, SIZE) \
446 { register int regno; \
447 register int mask = 0; \
448 extern char call_used_regs[]; \
449 for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) \
450 if (regs_ever_live[regno] && !call_used_regs[regno]) \
451 mask |= 1 << regno; \
452 fprintf (FILE, "\t.word 0x%x\n", mask); \
453 MAYBE_VMS_FUNCTION_PROLOGUE(FILE) \
454 if ((SIZE) >= 64) fprintf (FILE, "\tmovab %d(sp),sp\n", -SIZE);\
455 else if (SIZE) fprintf (FILE, "\tsubl2 $%d,sp\n", (SIZE)); }
457 /* vms.h redefines this. */
458 #define MAYBE_VMS_FUNCTION_PROLOGUE(FILE)
460 /* Output assembler code to FILE to increment profiler label # LABELNO
461 for profiling a function entry. */
463 #define FUNCTION_PROFILER(FILE, LABELNO) \
464 fprintf (FILE, "\tmovab LP%d,r0\n\tjsb mcount\n", (LABELNO));
466 /* Output assembler code to FILE to initialize this source file's
467 basic block profiling info, if that has not already been done. */
469 #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
470 fprintf (FILE, "\ttstl LPBX0\n\tjneq LPI%d\n\tpushal LPBX0\n\tcalls $1,__bb_init_func\nLPI%d:\n", \
473 /* Output assembler code to FILE to increment the entry-count for
474 the BLOCKNO'th basic block in this source file. This is a real pain in the
475 sphincter on a VAX, since we do not want to change any of the bits in the
476 processor status word. The way it is done here, it is pushed onto the stack
477 before any flags have changed, and then the stack is fixed up to account for
478 the fact that the instruction to restore the flags only reads a word.
479 It may seem a bit clumsy, but at least it works.
482 #define BLOCK_PROFILER(FILE, BLOCKNO) \
483 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", \
486 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
487 the stack pointer does not matter. The value is tested only in
488 functions that have frame pointers.
489 No definition is equivalent to always zero. */
491 #define EXIT_IGNORE_STACK 1
493 /* This macro generates the assembly code for function exit,
494 on machines that need it. If FUNCTION_EPILOGUE is not defined
495 then individual return instructions are generated for each
496 return statement. Args are same as for FUNCTION_PROLOGUE. */
498 /* #define FUNCTION_EPILOGUE(FILE, SIZE) */
500 /* Store in the variable DEPTH the initial difference between the
501 frame pointer reg contents and the stack pointer reg contents,
502 as of the start of the function body. This depends on the layout
503 of the fixed parts of the stack frame and on how registers are saved.
505 On the Vax, FRAME_POINTER_REQUIRED is always 1, so the definition of this
506 macro doesn't matter. But it must be defined. */
508 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH) (DEPTH) = 0;
510 /* Output assembler code for a block containing the constant parts
511 of a trampoline, leaving space for the variable parts. */
513 /* On the vax, the trampoline contains an entry mask and two instructions:
515 movl $STATIC,r0 (store the functions static chain)
516 jmp *$FUNCTION (jump to function code at address FUNCTION) */
518 #define TRAMPOLINE_TEMPLATE(FILE) \
520 ASM_OUTPUT_SHORT (FILE, const0_rtx); \
521 ASM_OUTPUT_SHORT (FILE, gen_rtx (CONST_INT, VOIDmode, 0x8fd0)); \
522 ASM_OUTPUT_INT (FILE, const0_rtx); \
523 ASM_OUTPUT_BYTE (FILE, 0x50+STATIC_CHAIN_REGNUM); \
524 ASM_OUTPUT_SHORT (FILE, gen_rtx (CONST_INT, VOIDmode, 0x9f17)); \
525 ASM_OUTPUT_INT (FILE, const0_rtx); \
528 /* Length in units of the trampoline for entering a nested function. */
530 #define TRAMPOLINE_SIZE 15
532 /* Emit RTL insns to initialize the variable parts of a trampoline.
533 FNADDR is an RTX for the address of the function's pure code.
534 CXT is an RTX for the static chain value for the function. */
536 /* We copy the register-mask from the function's pure code
537 to the start of the trampoline. */
538 #define INITIALIZE_TRAMPOLINE(TRAMP, FNADDR, CXT) \
540 emit_move_insn (gen_rtx (MEM, HImode, TRAMP), \
541 gen_rtx (MEM, HImode, FNADDR)); \
542 emit_move_insn (gen_rtx (MEM, SImode, plus_constant (TRAMP, 4)), CXT);\
543 emit_move_insn (gen_rtx (MEM, SImode, plus_constant (TRAMP, 11)), \
544 plus_constant (FNADDR, 2)); \
547 /* Addressing modes, and classification of registers for them. */
549 #define HAVE_POST_INCREMENT
550 /* #define HAVE_POST_DECREMENT */
552 #define HAVE_PRE_DECREMENT
553 /* #define HAVE_PRE_INCREMENT */
555 /* Macros to check register numbers against specific register classes. */
557 /* These assume that REGNO is a hard or pseudo reg number.
558 They give nonzero only if REGNO is a hard reg of the suitable class
559 or a pseudo reg currently allocated to a suitable hard reg.
560 Since they use reg_renumber, they are safe only once reg_renumber
561 has been allocated, which happens in local-alloc.c. */
563 #define REGNO_OK_FOR_INDEX_P(regno) \
564 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
565 #define REGNO_OK_FOR_BASE_P(regno) \
566 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
568 /* Maximum number of registers that can appear in a valid memory address. */
570 #define MAX_REGS_PER_ADDRESS 2
572 /* 1 if X is an rtx for a constant that is a valid address. */
574 #define CONSTANT_ADDRESS_P(X) CONSTANT_P (X)
576 /* Nonzero if the constant value X is a legitimate general operand.
577 It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
579 #define LEGITIMATE_CONSTANT_P(X) 1
581 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
582 and check its validity for a certain class.
583 We have two alternate definitions for each of them.
584 The usual definition accepts all pseudo regs; the other rejects
585 them unless they have been allocated suitable hard regs.
586 The symbol REG_OK_STRICT causes the latter definition to be used.
588 Most source files want to accept pseudo regs in the hope that
589 they will get allocated to the class that the insn wants them to be in.
590 Source files for reload pass need to be strict.
591 After reload, it makes no difference, since pseudo regs have
592 been eliminated by then. */
594 #ifndef REG_OK_STRICT
596 /* Nonzero if X is a hard reg that can be used as an index
597 or if it is a pseudo reg. */
598 #define REG_OK_FOR_INDEX_P(X) 1
599 /* Nonzero if X is a hard reg that can be used as a base reg
600 or if it is a pseudo reg. */
601 #define REG_OK_FOR_BASE_P(X) 1
605 /* Nonzero if X is a hard reg that can be used as an index. */
606 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
607 /* Nonzero if X is a hard reg that can be used as a base reg. */
608 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
612 /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
613 that is a valid memory address for an instruction.
614 The MODE argument is the machine mode for the MEM expression
615 that wants to use this address.
617 The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
618 except for CONSTANT_ADDRESS_P which is actually machine-independent. */
620 #ifdef NO_EXTERNAL_INDIRECT_ADDRESS
622 /* Zero if this contains a (CONST (PLUS (SYMBOL_REF) (...))) and the
623 symbol in the SYMBOL_REF is an external symbol. */
625 #define INDIRECTABLE_CONSTANT_P(X) \
626 (! (GET_CODE ((X)) == CONST \
627 && GET_CODE (XEXP ((X), 0)) == PLUS \
628 && GET_CODE (XEXP (XEXP ((X), 0), 0)) == SYMBOL_REF \
629 && SYMBOL_REF_FLAG (XEXP (XEXP ((X), 0), 0))))
631 /* Re-definition of CONSTANT_ADDRESS_P, which is true only when there
632 are no SYMBOL_REFs for external symbols present. */
634 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) \
635 (GET_CODE (X) == LABEL_REF \
636 || (GET_CODE (X) == SYMBOL_REF && !SYMBOL_REF_FLAG (X)) \
637 || (GET_CODE (X) == CONST && INDIRECTABLE_CONSTANT_P(X)) \
638 || GET_CODE (X) == CONST_INT)
641 /* Non-zero if X is an address which can be indirected. External symbols
642 could be in a sharable image library, so we disallow those. */
644 #define INDIRECTABLE_ADDRESS_P(X) \
645 (INDIRECTABLE_CONSTANT_ADDRESS_P (X) \
646 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
647 || (GET_CODE (X) == PLUS \
648 && GET_CODE (XEXP (X, 0)) == REG \
649 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
650 && INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))))
652 #else /* not NO_EXTERNAL_INDIRECT_ADDRESS */
654 #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) CONSTANT_ADDRESS_P(X)
656 /* Non-zero if X is an address which can be indirected. */
657 #define INDIRECTABLE_ADDRESS_P(X) \
658 (CONSTANT_ADDRESS_P (X) \
659 || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
660 || (GET_CODE (X) == PLUS \
661 && GET_CODE (XEXP (X, 0)) == REG \
662 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
663 && CONSTANT_ADDRESS_P (XEXP (X, 1))))
665 #endif /* not NO_EXTERNAL_INDIRECT_ADDRESS */
667 /* Go to ADDR if X is a valid address not using indexing.
668 (This much is the easy part.) */
669 #define GO_IF_NONINDEXED_ADDRESS(X, ADDR) \
670 { register rtx xfoob = (X); \
671 if (GET_CODE (xfoob) == REG) goto ADDR; \
672 if (CONSTANT_ADDRESS_P (xfoob)) goto ADDR; \
673 if (INDIRECTABLE_ADDRESS_P (xfoob)) goto ADDR; \
674 xfoob = XEXP (X, 0); \
675 if (GET_CODE (X) == MEM && INDIRECTABLE_ADDRESS_P (xfoob)) \
677 if ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_INC) \
678 && GET_CODE (xfoob) == REG && REG_OK_FOR_BASE_P (xfoob)) \
681 /* 1 if PROD is either a reg times size of mode MODE
682 or just a reg, if MODE is just one byte.
683 This macro's expansion uses the temporary variables xfoo0 and xfoo1
684 that must be declared in the surrounding context. */
685 #define INDEX_TERM_P(PROD, MODE) \
686 (GET_MODE_SIZE (MODE) == 1 \
687 ? (GET_CODE (PROD) == REG && REG_OK_FOR_BASE_P (PROD)) \
688 : (GET_CODE (PROD) == MULT \
690 (xfoo0 = XEXP (PROD, 0), xfoo1 = XEXP (PROD, 1), \
691 ((GET_CODE (xfoo0) == CONST_INT \
692 && INTVAL (xfoo0) == GET_MODE_SIZE (MODE) \
693 && GET_CODE (xfoo1) == REG \
694 && REG_OK_FOR_INDEX_P (xfoo1)) \
696 (GET_CODE (xfoo1) == CONST_INT \
697 && INTVAL (xfoo1) == GET_MODE_SIZE (MODE) \
698 && GET_CODE (xfoo0) == REG \
699 && REG_OK_FOR_INDEX_P (xfoo0))))))
701 /* Go to ADDR if X is the sum of a register
702 and a valid index term for mode MODE. */
703 #define GO_IF_REG_PLUS_INDEX(X, MODE, ADDR) \
704 { register rtx xfooa; \
705 if (GET_CODE (X) == PLUS) \
706 { if (GET_CODE (XEXP (X, 0)) == REG \
707 && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
708 && (xfooa = XEXP (X, 1), \
709 INDEX_TERM_P (xfooa, MODE))) \
711 if (GET_CODE (XEXP (X, 1)) == REG \
712 && REG_OK_FOR_BASE_P (XEXP (X, 1)) \
713 && (xfooa = XEXP (X, 0), \
714 INDEX_TERM_P (xfooa, MODE))) \
717 #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
718 { register rtx xfoo, xfoo0, xfoo1; \
719 GO_IF_NONINDEXED_ADDRESS (X, ADDR); \
720 if (GET_CODE (X) == PLUS) \
721 { /* Handle <address>[index] represented with index-sum outermost */\
722 xfoo = XEXP (X, 0); \
723 if (INDEX_TERM_P (xfoo, MODE)) \
724 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 1), ADDR); } \
725 xfoo = XEXP (X, 1); \
726 if (INDEX_TERM_P (xfoo, MODE)) \
727 { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 0), ADDR); } \
728 /* Handle offset(reg)[index] with offset added outermost */ \
729 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 0))) \
730 { if (GET_CODE (XEXP (X, 1)) == REG \
731 && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
733 GO_IF_REG_PLUS_INDEX (XEXP (X, 1), MODE, ADDR); } \
734 if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))) \
735 { if (GET_CODE (XEXP (X, 0)) == REG \
736 && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
738 GO_IF_REG_PLUS_INDEX (XEXP (X, 0), MODE, ADDR); } } }
740 /* Try machine-dependent ways of modifying an illegitimate address
741 to be legitimate. If we find one, return the new, valid address.
742 This macro is used in only one place: `memory_address' in explow.c.
744 OLDX is the address as it was before break_out_memory_refs was called.
745 In some cases it is useful to look at this to decide what needs to be done.
747 MODE and WIN are passed so that this macro can use
748 GO_IF_LEGITIMATE_ADDRESS.
750 It is always safe for this macro to do nothing. It exists to recognize
751 opportunities to optimize the output.
753 For the vax, nothing needs to be done. */
755 #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) {}
757 /* Go to LABEL if ADDR (a legitimate address expression)
758 has an effect that depends on the machine mode it is used for.
759 On the VAX, the predecrement and postincrement address depend thus
760 (the amount of decrement or increment being the length of the operand)
761 and all indexed address depend thus (because the index scale factor
762 is the length of the operand). */
763 #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
764 { if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == PRE_DEC) \
766 if (GET_CODE (ADDR) == PLUS) \
767 { if (CONSTANT_ADDRESS_P (XEXP (ADDR, 0)) \
768 && GET_CODE (XEXP (ADDR, 1)) == REG); \
769 else if (CONSTANT_ADDRESS_P (XEXP (ADDR, 1)) \
770 && GET_CODE (XEXP (ADDR, 0)) == REG); \
773 /* Specify the machine mode that this machine uses
774 for the index in the tablejump instruction. */
775 #define CASE_VECTOR_MODE HImode
777 /* Define this if the case instruction expects the table
778 to contain offsets from the address of the table.
779 Do not define this if the table should contain absolute addresses. */
780 #define CASE_VECTOR_PC_RELATIVE
782 /* Define this if the case instruction drops through after the table
783 when the index is out of range. Don't define it if the case insn
784 jumps to the default label instead. */
785 #define CASE_DROPS_THROUGH
787 /* Specify the tree operation to be used to convert reals to integers. */
788 #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
790 /* This is the kind of divide that is easiest to do in the general case. */
791 #define EASY_DIV_EXPR TRUNC_DIV_EXPR
793 /* Define this as 1 if `char' should by default be signed; else as 0. */
794 #define DEFAULT_SIGNED_CHAR 1
796 /* This flag, if defined, says the same insns that convert to a signed fixnum
797 also convert validly to an unsigned one. */
798 #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
800 /* Max number of bytes we can move from memory to memory
801 in one reasonably fast instruction. */
804 /* Define this if zero-extension is slow (more than one real instruction). */
805 /* #define SLOW_ZERO_EXTEND */
807 /* Nonzero if access to memory by bytes is slow and undesirable. */
808 #define SLOW_BYTE_ACCESS 0
810 /* Define if shifts truncate the shift count
811 which implies one can omit a sign-extension or zero-extension
813 /* #define SHIFT_COUNT_TRUNCATED */
815 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
816 is done just by pretending it is already truncated. */
817 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
819 /* Specify the machine mode that pointers have.
820 After generation of rtl, the compiler makes no further distinction
821 between pointers and any other objects of this machine mode. */
824 /* A function address in a call instruction
825 is a byte address (for indexing purposes)
826 so give the MEM rtx a byte's mode. */
827 #define FUNCTION_MODE QImode
829 /* This machine doesn't use IEEE floats. */
831 #define TARGET_FLOAT_FORMAT VAX_FLOAT_FORMAT
833 /* Compute the cost of computing a constant rtl expression RTX
834 whose rtx-code is CODE. The body of this macro is a portion
835 of a switch statement. If the code is computed here,
836 return it with a return statement. Otherwise, break from the switch. */
838 #define CONST_COSTS(RTX,CODE) \
840 /* Constant zero is super cheap due to clr instruction. */ \
841 if ((RTX) == const0_rtx) return 0; \
842 /* Constants of +/- 1 should also be super cheap since \
843 may be used in decl/incl/aob/sob insns. */ \
844 if ((RTX) == const1_rtx || (RTX) == constm1_rtx) return 0; \
845 if ((unsigned) INTVAL (RTX) < 077) return 1; \
853 /* On most VAX models, shift are almost as expensive as multiplies, so
854 we'd rather use multiply unless it can be done in an extremely small
856 #define RTX_COSTS(RTX,CODE) \
863 return COSTS_N_INSNS (4);
865 /* Specify the cost of a branch insn; roughly the number of extra insns that
866 should be added to avoid a branch.
868 Branches are extremely cheap on the VAX while the shift insns often
869 used to replace branches can be expensive. */
871 #define BRANCH_COST 0
874 * We can use the BSD C library routines for the libgcc calls that are
875 * still generated, since that's what they boil down to anyways.
878 #define UDIVSI3_LIBCALL "*udiv"
879 #define UMODSI3_LIBCALL "*urem"
881 /* Check a `double' value for validity for a particular machine mode. */
883 /* note that it is very hard to accidentally create a number that fits in a
884 double but not in a float, since their ranges are almost the same */
885 #define CHECK_FLOAT_VALUE(mode, d) \
886 if ((mode) == SFmode) \
888 if ((d) > 1.7014117331926444e+38) \
889 { error ("magnitude of constant too large for `float'"); \
890 (d) = 1.7014117331926444e+38; } \
891 else if ((d) < -1.7014117331926444e+38) \
892 { error ("magnitude of constant too large for `float'"); \
893 (d) = -1.7014117331926444e+38; } \
894 else if (((d) > 0) && ((d) < 2.9387358770557188e-39)) \
895 { warning ("`float' constant truncated to zero"); \
897 else if (((d) < 0) && ((d) > -2.9387358770557188e-39)) \
898 { warning ("`float' constant truncated to zero"); \
902 /* For future reference:
903 D Float: 9 bit, sign magnitude, excess 128 binary exponent
904 normalized 56 bit fraction, redundant bit not represented
905 approximately 16 decimal digits of precision
907 The values to use if we trust decimal to binary conversions:
908 #define MAX_D_FLOAT 1.7014118346046923e+38
909 #define MIN_D_FLOAT .29387358770557188e-38
911 G float: 12 bit, sign magnitude, excess 1024 binary exponent
912 normalized 53 bit fraction, redundant bit not represented
913 approximately 15 decimal digits precision
915 The values to use if we trust decimal to binary conversions:
916 #define MAX_G_FLOAT .898846567431157e+308
917 #define MIN_G_FLOAT .556268464626800e-308
920 /* Tell final.c how to eliminate redundant test instructions. */
922 /* Here we define machine-dependent flags and fields in cc_status
923 (see `conditions.h'). No extra ones are needed for the vax. */
925 /* Store in cc_status the expressions
926 that the condition codes will describe
927 after execution of an instruction whose pattern is EXP.
928 Do not alter them if the instruction would not alter the cc's. */
930 #define NOTICE_UPDATE_CC(EXP, INSN) \
931 { if (GET_CODE (EXP) == SET) \
932 { if (GET_CODE (SET_SRC (EXP)) == CALL) \
934 else if (GET_CODE (SET_DEST (EXP)) != PC) \
935 { cc_status.flags = 0; \
936 cc_status.value1 = SET_DEST (EXP); \
937 cc_status.value2 = SET_SRC (EXP); } } \
938 else if (GET_CODE (EXP) == PARALLEL \
939 && GET_CODE (XVECEXP (EXP, 0, 0)) == SET) \
941 if (GET_CODE (SET_SRC (XVECEXP (EXP, 0, 0))) == CALL) \
943 else if (GET_CODE (SET_DEST (XVECEXP (EXP, 0, 0))) != PC) \
944 { cc_status.flags = 0; \
945 cc_status.value1 = SET_DEST (XVECEXP (EXP, 0, 0)); \
946 cc_status.value2 = SET_SRC (XVECEXP (EXP, 0, 0)); } } \
947 /* PARALLELs whose first element sets the PC are aob, sob insns. \
948 They do change the cc's. So drop through and forget the cc's. */ \
949 else CC_STATUS_INIT; \
950 if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
951 && cc_status.value2 \
952 && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
953 cc_status.value2 = 0; \
954 if (cc_status.value1 && GET_CODE (cc_status.value1) == MEM \
955 && cc_status.value2 \
956 && GET_CODE (cc_status.value2) == MEM) \
957 cc_status.value2 = 0; }
958 /* Actual condition, one line up, should be that value2's address
959 depends on value1, but that is too much of a pain. */
961 #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
962 { if (cc_status.flags & CC_NO_OVERFLOW) \
966 /* Control the assembler format that we output. */
968 /* Output at beginning of assembler file. */
970 #define ASM_FILE_START(FILE) fprintf (FILE, "#NO_APP\n");
972 /* Output to assembler file text saying following lines
973 may contain character constants, extra white space, comments, etc. */
975 #define ASM_APP_ON "#APP\n"
977 /* Output to assembler file text saying following lines
978 no longer contain unusual constructs. */
980 #define ASM_APP_OFF "#NO_APP\n"
982 /* Output before read-only data. */
984 #define TEXT_SECTION_ASM_OP ".text"
986 /* Output before writable data. */
988 #define DATA_SECTION_ASM_OP ".data"
990 /* How to refer to registers in assembler output.
991 This sequence is indexed by compiler's hard-register-number (see above). */
993 #define REGISTER_NAMES \
994 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \
995 "r9", "r10", "r11", "ap", "fp", "sp", "pc"}
997 /* This is BSD, so it wants DBX format. */
999 #define DBX_DEBUGGING_INFO
1001 /* How to renumber registers for dbx and gdb.
1002 Vax needs no change in the numeration. */
1004 #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
1006 /* Do not break .stabs pseudos into continuations. */
1008 #define DBX_CONTIN_LENGTH 0
1010 /* This is the char to use for continuation (in case we need to turn
1011 continuation back on). */
1013 #define DBX_CONTIN_CHAR '?'
1015 /* Don't use the `xsfoo;' construct in DBX output; this system
1016 doesn't support it. */
1018 #define DBX_NO_XREFS
1020 /* Output the .stabs for a C `static' variable in the data section. */
1021 #define DBX_STATIC_STAB_DATA_SECTION
1023 /* Vax specific: which type character is used for type double? */
1025 #define ASM_DOUBLE_CHAR (TARGET_G_FLOAT ? 'g' : 'd')
1027 /* This is how to output the definition of a user-level label named NAME,
1028 such as the label on a static function or variable NAME. */
1030 #define ASM_OUTPUT_LABEL(FILE,NAME) \
1031 do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
1033 /* This is how to output a command to make the user-level label named NAME
1034 defined for reference from other files. */
1036 #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
1037 do { fputs (".globl ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
1039 /* This is how to output a reference to a user-level label named NAME. */
1041 #define ASM_OUTPUT_LABELREF(FILE,NAME) \
1042 fprintf (FILE, "_%s", NAME)
1044 /* This is how to output an internal numbered label where
1045 PREFIX is the class of label and NUM is the number within the class. */
1047 #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
1048 fprintf (FILE, "%s%d:\n", PREFIX, NUM)
1050 /* This is how to store into the string LABEL
1051 the symbol_ref name of an internal numbered label where
1052 PREFIX is the class of label and NUM is the number within the class.
1053 This is suitable for output with `assemble_name'. */
1055 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
1056 sprintf (LABEL, "*%s%d", PREFIX, NUM)
1058 /* This is how to output an assembler line defining a `double' constant.
1059 It is .dfloat or .gfloat, depending. */
1061 #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
1062 fprintf (FILE, "\t.%cfloat 0%c%.20e\n", ASM_DOUBLE_CHAR, \
1063 ASM_DOUBLE_CHAR, (VALUE))
1065 /* This is how to output an assembler line defining a `float' constant. */
1067 #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
1068 fprintf (FILE, "\t.float 0f%.20e\n", (VALUE))
1070 /* This is how to output an assembler line defining an `int' constant. */
1072 #define ASM_OUTPUT_INT(FILE,VALUE) \
1073 ( fprintf (FILE, "\t.long "), \
1074 output_addr_const (FILE, (VALUE)), \
1075 fprintf (FILE, "\n"))
1077 /* Likewise for `char' and `short' constants. */
1079 #define ASM_OUTPUT_SHORT(FILE,VALUE) \
1080 ( fprintf (FILE, "\t.word "), \
1081 output_addr_const (FILE, (VALUE)), \
1082 fprintf (FILE, "\n"))
1084 #define ASM_OUTPUT_CHAR(FILE,VALUE) \
1085 ( fprintf (FILE, "\t.byte "), \
1086 output_addr_const (FILE, (VALUE)), \
1087 fprintf (FILE, "\n"))
1089 /* This is how to output an assembler line for a numeric constant byte. */
1091 #define ASM_OUTPUT_BYTE(FILE,VALUE) \
1092 fprintf (FILE, "\t.byte 0x%x\n", (VALUE))
1094 /* This is how to output an insn to push a register on the stack.
1095 It need not be very fast code. */
1097 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
1098 fprintf (FILE, "\tpushl %s\n", reg_names[REGNO])
1100 /* This is how to output an insn to pop a register from the stack.
1101 It need not be very fast code. */
1103 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
1104 fprintf (FILE, "\tmovl (sp)+,%s\n", reg_names[REGNO])
1106 /* This is how to output an element of a case-vector that is absolute.
1107 (The Vax does not use such vectors,
1108 but we must define this macro anyway.) */
1110 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1111 fprintf (FILE, "\t.long L%d\n", VALUE)
1113 /* This is how to output an element of a case-vector that is relative. */
1115 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) \
1116 fprintf (FILE, "\t.word L%d-L%d\n", VALUE, REL)
1118 /* This is how to output an assembler line
1119 that says to advance the location counter
1120 to a multiple of 2**LOG bytes. */
1122 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1123 fprintf (FILE, "\t.align %d\n", (LOG))
1125 /* This is how to output an assembler line
1126 that says to advance the location counter by SIZE bytes. */
1128 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1129 fprintf (FILE, "\t.space %u\n", (SIZE))
1131 /* This says how to output an assembler line
1132 to define a global common symbol. */
1134 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1135 ( fputs (".comm ", (FILE)), \
1136 assemble_name ((FILE), (NAME)), \
1137 fprintf ((FILE), ",%u\n", (ROUNDED)))
1139 /* This says how to output an assembler line
1140 to define a local common symbol. */
1142 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1143 ( fputs (".lcomm ", (FILE)), \
1144 assemble_name ((FILE), (NAME)), \
1145 fprintf ((FILE), ",%u\n", (ROUNDED)))
1147 /* Store in OUTPUT a string (made with alloca) containing
1148 an assembler-name for a local static variable named NAME.
1149 LABELNO is an integer which is different for each call. */
1151 #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1152 ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
1153 sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
1155 /* Define the parentheses used to group arithmetic operations
1156 in assembler code. */
1158 #define ASM_OPEN_PAREN "("
1159 #define ASM_CLOSE_PAREN ")"
1161 /* Define results of standard character escape sequences. */
1162 #define TARGET_BELL 007
1163 #define TARGET_BS 010
1164 #define TARGET_TAB 011
1165 #define TARGET_NEWLINE 012
1166 #define TARGET_VT 013
1167 #define TARGET_FF 014
1168 #define TARGET_CR 015
1170 /* Print an instruction operand X on file FILE.
1171 CODE is the code from the %-spec that requested printing this operand;
1172 if `%z3' was used to print operand 3, then CODE is 'z'.
1173 On the Vax, the codes used are:
1174 `#', indicating that either `d' or `g' should be printed,
1175 depending on whether we're using dfloat or gfloat.
1176 `C', indicating the reverse of the condition name specified by the
1178 `P', indicating one plus a constant operand
1179 `N', indicating the one's complement of a constant operand
1180 `H', indicating the low-order 16 bits of the one's complement of a constant
1181 `B', similarly for the low-order 8 bits. */
1183 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
1186 #define PRINT_OPERAND(FILE, X, CODE) \
1187 { extern char *rev_cond_name (); \
1188 if (CODE == '#') fputc (ASM_DOUBLE_CHAR, FILE); \
1189 else if (CODE == 'C') \
1190 fputs (rev_cond_name (X), FILE); \
1191 else if (CODE == 'P' && GET_CODE (X) == CONST_INT) \
1192 fprintf (FILE, "$%d", INTVAL (X) + 1); \
1193 else if (CODE == 'N' && GET_CODE (X) == CONST_INT) \
1194 fprintf (FILE, "$%d", ~ INTVAL (X)); \
1195 /* rotl instruction cannot deal with negative arguments. */ \
1196 else if (CODE == 'R' && GET_CODE (X) == CONST_INT) \
1197 fprintf (FILE, "$%d", 32 - INTVAL (X)); \
1198 else if (CODE == 'H' && GET_CODE (X) == CONST_INT) \
1199 fprintf (FILE, "$%d", 0xffff & ~ INTVAL (X)); \
1200 else if (CODE == 'B' && GET_CODE (X) == CONST_INT) \
1201 fprintf (FILE, "$%d", 0xff & ~ INTVAL (X)); \
1202 else if (GET_CODE (X) == REG) \
1203 fprintf (FILE, "%s", reg_names[REGNO (X)]); \
1204 else if (GET_CODE (X) == MEM) \
1205 output_address (XEXP (X, 0)); \
1206 else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) != DImode) \
1207 { union { double d; int i[2]; } u; \
1208 u.i[0] = CONST_DOUBLE_LOW (X); u.i[1] = CONST_DOUBLE_HIGH (X); \
1209 fprintf (FILE, "$0%c%.20e", ASM_DOUBLE_CHAR, u.d); } \
1210 else { putc ('$', FILE); output_addr_const (FILE, X); }}
1212 /* Print a memory operand whose address is X, on file FILE.
1213 This uses a function in output-vax.c. */
1215 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1216 print_operand_address (FILE, ADDR)