]> git.ipfire.org Git - thirdparty/gcc.git/blob - gcc/config/vax/vax.h
tm.texi.in (TARGET_CLASS_LIKELY_SPILLED_P): Update documentation.
[thirdparty/gcc.git] / gcc / config / vax / vax.h
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, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5
6 This file is part of GCC.
7
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
12
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
21
22
23 /* Target CPU builtins. */
24 #define TARGET_CPU_CPP_BUILTINS() \
25 do \
26 { \
27 builtin_define ("__vax__"); \
28 builtin_assert ("cpu=vax"); \
29 builtin_assert ("machine=vax"); \
30 if (TARGET_G_FLOAT) \
31 { \
32 builtin_define ("__GFLOAT"); \
33 builtin_define ("__GFLOAT__"); \
34 } \
35 } \
36 while (0)
37
38 /* Use -J option for long branch support with Unix assembler. */
39
40 #define ASM_SPEC "-J"
41
42 /* Choose proper libraries depending on float format.
43 Note that there are no profiling libraries for g-format.
44 Also use -lg for the sake of dbx. */
45
46 #define LIB_SPEC "%{g:-lg}\
47 %{mg:%{lm:-lmg} -lcg \
48 %{p:%eprofiling not supported with -mg\n}\
49 %{pg:%eprofiling not supported with -mg\n}}\
50 %{!mg:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
51
52 /* Run-time compilation parameters selecting different hardware subsets. */
53
54 /* Nonzero if ELF. Redefined by vax/elf.h. */
55 #define TARGET_ELF 0
56
57 /* Use BSD names for udiv and umod libgcc calls. */
58 #define TARGET_BSD_DIVMOD 1
59
60 /* Default target_flags if no switches specified. */
61
62 #ifndef TARGET_DEFAULT
63 #define TARGET_DEFAULT (MASK_UNIX_ASM)
64 #endif
65
66 \f
67 /* Target machine storage layout */
68
69 /* Define this if most significant bit is lowest numbered
70 in instructions that operate on numbered bit-fields.
71 This is not true on the VAX. */
72 #define BITS_BIG_ENDIAN 0
73
74 /* Define this if most significant byte of a word is the lowest numbered. */
75 /* That is not true on the VAX. */
76 #define BYTES_BIG_ENDIAN 0
77
78 /* Define this if most significant word of a multiword number is the lowest
79 numbered. */
80 /* This is not true on the VAX. */
81 #define WORDS_BIG_ENDIAN 0
82
83 /* Width of a word, in units (bytes). */
84 #define UNITS_PER_WORD 4
85
86 /* Allocation boundary (in *bits*) for storing arguments in argument list. */
87 #define PARM_BOUNDARY 32
88
89 /* Allocation boundary (in *bits*) for the code of a function. */
90 #define FUNCTION_BOUNDARY 16
91
92 /* Alignment of field after `int : 0' in a structure. */
93 #define EMPTY_FIELD_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
94
95 /* Every structure's size must be a multiple of this. */
96 #define STRUCTURE_SIZE_BOUNDARY 8
97
98 /* A bit-field declared as `int' forces `int' alignment for the struct. */
99 #define PCC_BITFIELD_TYPE_MATTERS (! TARGET_VAXC_ALIGNMENT)
100
101 /* No data type wants to be aligned rounder than this. */
102 #define BIGGEST_ALIGNMENT 32
103
104 /* No structure field wants to be aligned rounder than this. */
105 #define BIGGEST_FIELD_ALIGNMENT (TARGET_VAXC_ALIGNMENT ? 8 : 32)
106
107 /* Set this nonzero if move instructions will actually fail to work
108 when given unaligned data. */
109 #define STRICT_ALIGNMENT 0
110
111 /* Let's keep the stack somewhat aligned. */
112 #define STACK_BOUNDARY 32
113
114 /* The table of an ADDR_DIFF_VEC must be contiguous with the case
115 opcode, it is part of the case instruction. */
116 #define ADDR_VEC_ALIGN(ADDR_VEC) 0
117 \f
118 /* Standard register usage. */
119
120 /* Number of actual hardware registers.
121 The hardware registers are assigned numbers for the compiler
122 from 0 to just below FIRST_PSEUDO_REGISTER.
123 All registers that the compiler knows about must be given numbers,
124 even those that are not normally considered general registers. */
125 #define FIRST_PSEUDO_REGISTER 16
126
127 /* 1 for registers that have pervasive standard uses
128 and are not available for the register allocator.
129 On the VAX, these are the AP, FP, SP and PC. */
130 #define FIXED_REGISTERS {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
131
132 /* 1 for registers not available across function calls.
133 These must include the FIXED_REGISTERS and also any
134 registers that can be used without being saved.
135 The latter must include the registers where values are returned
136 and the register where structure-value addresses are passed.
137 Aside from that, you can include as many other registers as you like. */
138 #define CALL_USED_REGISTERS {1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
139
140 /* Return number of consecutive hard regs needed starting at reg REGNO
141 to hold something of mode MODE.
142 This is ordinarily the length in words of a value of mode MODE
143 but can be less for certain modes in special long registers.
144 On the VAX, all registers are one word long. */
145 #define HARD_REGNO_NREGS(REGNO, MODE) \
146 ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
147
148 /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
149 On the VAX, all registers can hold all modes. */
150 #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
151
152 /* Value is 1 if it is a good idea to tie two pseudo registers
153 when one has mode MODE1 and one has mode MODE2.
154 If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
155 for any hard reg, then this must be 0 for correct output. */
156 #define MODES_TIEABLE_P(MODE1, MODE2) 1
157
158 /* Specify the registers used for certain standard purposes.
159 The values of these macros are register numbers. */
160
161 /* VAX pc is overloaded on a register. */
162 #define PC_REGNUM VAX_PC_REGNUM
163
164 /* Register to use for pushing function arguments. */
165 #define STACK_POINTER_REGNUM VAX_SP_REGNUM
166
167 /* Base register for access to local variables of the function. */
168 #define FRAME_POINTER_REGNUM VAX_FP_REGNUM
169
170 /* Offset from the frame pointer register value to the top of stack. */
171 #define FRAME_POINTER_CFA_OFFSET(FNDECL) 0
172
173 /* Base register for access to arguments of the function. */
174 #define ARG_POINTER_REGNUM VAX_AP_REGNUM
175
176 /* Register in which static-chain is passed to a function. */
177 #define STATIC_CHAIN_REGNUM 0
178
179 /* Register in which address to store a structure value
180 is passed to a function. */
181 #define VAX_STRUCT_VALUE_REGNUM 1
182 \f
183 /* Define the classes of registers for register constraints in the
184 machine description. Also define ranges of constants.
185
186 One of the classes must always be named ALL_REGS and include all hard regs.
187 If there is more than one class, another class must be named NO_REGS
188 and contain no registers.
189
190 The name GENERAL_REGS must be the name of a class (or an alias for
191 another name such as ALL_REGS). This is the class of registers
192 that is allowed by "g" or "r" in a register constraint.
193 Also, registers outside this class are allocated only when
194 instructions express preferences for them.
195
196 The classes must be numbered in nondecreasing order; that is,
197 a larger-numbered class must never be contained completely
198 in a smaller-numbered class.
199
200 For any two classes, it is very desirable that there be another
201 class that represents their union. */
202
203 /* The VAX has only one kind of registers, so NO_REGS and ALL_REGS
204 are the only classes. */
205
206 enum reg_class { NO_REGS, ALL_REGS, LIM_REG_CLASSES };
207
208 #define N_REG_CLASSES (int) LIM_REG_CLASSES
209
210 /* Since GENERAL_REGS is the same class as ALL_REGS,
211 don't give it a different class number; just make it an alias. */
212
213 #define GENERAL_REGS ALL_REGS
214
215 /* Give names of register classes as strings for dump file. */
216
217 #define REG_CLASS_NAMES \
218 { "NO_REGS", "ALL_REGS" }
219
220 /* Define which registers fit in which classes.
221 This is an initializer for a vector of HARD_REG_SET
222 of length N_REG_CLASSES. */
223
224 #define REG_CLASS_CONTENTS {{0}, {0xffff}}
225
226 /* The same information, inverted:
227 Return the class number of the smallest class containing
228 reg number REGNO. This could be a conditional expression
229 or could index an array. */
230
231 #define REGNO_REG_CLASS(REGNO) ALL_REGS
232
233 /* The class value for index registers, and the one for base regs. */
234
235 #define INDEX_REG_CLASS ALL_REGS
236 #define BASE_REG_CLASS ALL_REGS
237
238 \f
239 /* Stack layout; function entry, exit and calling. */
240
241 /* Define this if pushing a word on the stack
242 makes the stack pointer a smaller address. */
243 #define STACK_GROWS_DOWNWARD
244
245 /* Define this to nonzero if the nominal address of the stack frame
246 is at the high-address end of the local variables;
247 that is, each additional local variable allocated
248 goes at a more negative offset in the frame. */
249 #define FRAME_GROWS_DOWNWARD 1
250
251 /* Offset within stack frame to start allocating local variables at.
252 If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
253 first local allocated. Otherwise, it is the offset to the BEGINNING
254 of the first local allocated. */
255 #define STARTING_FRAME_OFFSET 0
256
257 /* Given an rtx for the address of a frame,
258 return an rtx for the address of the word in the frame
259 that holds the dynamic chain--the previous frame's address. */
260 #define DYNAMIC_CHAIN_ADDRESS(FRAME) plus_constant (Pmode, (FRAME), 12)
261
262 /* If we generate an insn to push BYTES bytes,
263 this says how many the stack pointer really advances by.
264 On the VAX, -(sp) pushes only the bytes of the operands. */
265 #define PUSH_ROUNDING(BYTES) (BYTES)
266
267 /* Offset of first parameter from the argument pointer register value. */
268 #define FIRST_PARM_OFFSET(FNDECL) 4
269
270 /* Define how to find the value returned by a function.
271 VALTYPE is the data type of the value (as a tree).
272 If the precise function being called is known, FUNC is its FUNCTION_DECL;
273 otherwise, FUNC is 0. */
274
275 /* On the VAX the return value is in R0 regardless. */
276
277 #define FUNCTION_VALUE(VALTYPE, FUNC) \
278 gen_rtx_REG (TYPE_MODE (VALTYPE), 0)
279
280 /* Define how to find the value returned by a library function
281 assuming the value has mode MODE. */
282
283 /* On the VAX the return value is in R0 regardless. */
284
285 #define LIBCALL_VALUE(MODE) gen_rtx_REG (MODE, 0)
286
287 /* Define this if PCC uses the nonreentrant convention for returning
288 structure and union values. */
289
290 #define PCC_STATIC_STRUCT_RETURN
291
292 /* 1 if N is a possible register number for a function value.
293 On the VAX, R0 is the only register thus used. */
294
295 #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
296
297 /* 1 if N is a possible register number for function argument passing.
298 On the VAX, no registers are used in this way. */
299
300 #define FUNCTION_ARG_REGNO_P(N) 0
301 \f
302 /* Define a data type for recording info about an argument list
303 during the scan of that argument list. This data type should
304 hold all necessary information about the function itself
305 and about the args processed so far, enough to enable macros
306 such as FUNCTION_ARG to determine where the next arg should go.
307
308 On the VAX, this is a single integer, which is a number of bytes
309 of arguments scanned so far. */
310
311 #define CUMULATIVE_ARGS int
312
313 /* Initialize a variable CUM of type CUMULATIVE_ARGS
314 for a call to a function whose data type is FNTYPE.
315 For a library call, FNTYPE is 0.
316
317 On the VAX, the offset starts at 0. */
318
319 #define INIT_CUMULATIVE_ARGS(CUM, FNTYPE, LIBNAME, INDIRECT, N_NAMED_ARGS) \
320 ((CUM) = 0)
321
322 /* Output assembler code to FILE to increment profiler label # LABELNO
323 for profiling a function entry. */
324
325 #define VAX_FUNCTION_PROFILER_NAME "mcount"
326 #define FUNCTION_PROFILER(FILE, LABELNO) \
327 do \
328 { \
329 char label[256]; \
330 ASM_GENERATE_INTERNAL_LABEL (label, "LP", (LABELNO)); \
331 fprintf (FILE, "\tmovab "); \
332 assemble_name (FILE, label); \
333 asm_fprintf (FILE, ",%Rr0\n\tjsb %s\n", \
334 VAX_FUNCTION_PROFILER_NAME); \
335 } \
336 while (0)
337
338 /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
339 the stack pointer does not matter. The value is tested only in
340 functions that have frame pointers.
341 No definition is equivalent to always zero. */
342
343 #define EXIT_IGNORE_STACK 1
344
345 /* Store in the variable DEPTH the initial difference between the
346 frame pointer reg contents and the stack pointer reg contents,
347 as of the start of the function body. This depends on the layout
348 of the fixed parts of the stack frame and on how registers are saved.
349
350 On the VAX, FRAME_POINTER_REQUIRED is always 1, so the definition of this
351 macro doesn't matter. But it must be defined. */
352
353 #define INITIAL_FRAME_POINTER_OFFSET(DEPTH) (DEPTH) = 0;
354
355 /* Length in units of the trampoline for entering a nested function. */
356
357 #define TRAMPOLINE_SIZE 15
358
359 /* Byte offset of return address in a stack frame. The "saved PC" field
360 is in element [4] when treating the frame as an array of longwords. */
361
362 #define RETURN_ADDRESS_OFFSET (4 * UNITS_PER_WORD) /* 16 */
363
364 /* A C expression whose value is RTL representing the value of the return
365 address for the frame COUNT steps up from the current frame.
366 FRAMEADDR is already the frame pointer of the COUNT frame, so we
367 can ignore COUNT. */
368
369 #define RETURN_ADDR_RTX(COUNT, FRAME) \
370 ((COUNT == 0) \
371 ? gen_rtx_MEM (Pmode, plus_constant (Pmode, FRAME, \
372 RETURN_ADDRESS_OFFSET)) \
373 : (rtx) 0)
374
375 \f
376 /* Addressing modes, and classification of registers for them. */
377
378 #define HAVE_POST_INCREMENT 1
379
380 #define HAVE_PRE_DECREMENT 1
381
382 /* Macros to check register numbers against specific register classes. */
383
384 /* These assume that REGNO is a hard or pseudo reg number.
385 They give nonzero only if REGNO is a hard reg of the suitable class
386 or a pseudo reg currently allocated to a suitable hard reg.
387 Since they use reg_renumber, they are safe only once reg_renumber
388 has been allocated, which happens in reginfo.c during register
389 allocation. */
390
391 #define REGNO_OK_FOR_INDEX_P(regno) \
392 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
393 #define REGNO_OK_FOR_BASE_P(regno) \
394 ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
395 \f
396 /* Maximum number of registers that can appear in a valid memory address. */
397
398 #define MAX_REGS_PER_ADDRESS 2
399
400 /* 1 if X is an rtx for a constant that is a valid address. */
401
402 #define CONSTANT_ADDRESS_P(X) legitimate_constant_address_p (X)
403
404 /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
405 and check its validity for a certain class.
406 We have two alternate definitions for each of them.
407 The usual definition accepts all pseudo regs; the other rejects
408 them unless they have been allocated suitable hard regs.
409 The symbol REG_OK_STRICT causes the latter definition to be used.
410
411 Most source files want to accept pseudo regs in the hope that
412 they will get allocated to the class that the insn wants them to be in.
413 Source files for reload pass need to be strict.
414 After reload, it makes no difference, since pseudo regs have
415 been eliminated by then. */
416
417 #ifndef REG_OK_STRICT
418
419 /* Nonzero if X is a hard reg that can be used as an index
420 or if it is a pseudo reg. */
421 #define REG_OK_FOR_INDEX_P(X) 1
422
423 /* Nonzero if X is a hard reg that can be used as a base reg
424 or if it is a pseudo reg. */
425 #define REG_OK_FOR_BASE_P(X) 1
426
427 #else
428
429 /* Nonzero if X is a hard reg that can be used as an index. */
430 #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
431
432 /* Nonzero if X is a hard reg that can be used as a base reg. */
433 #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
434
435 #endif
436 \f
437 /* Specify the machine mode that this machine uses
438 for the index in the tablejump instruction. */
439 #define CASE_VECTOR_MODE HImode
440
441 /* Define as C expression which evaluates to nonzero if the tablejump
442 instruction expects the table to contain offsets from the address of the
443 table.
444 Do not define this if the table should contain absolute addresses. */
445 #define CASE_VECTOR_PC_RELATIVE 1
446
447 /* Indicate that jump tables go in the text section. This is
448 necessary when compiling PIC code. */
449 #define JUMP_TABLES_IN_TEXT_SECTION 1
450
451 /* Define this as 1 if `char' should by default be signed; else as 0. */
452 #define DEFAULT_SIGNED_CHAR 1
453
454 /* Max number of bytes we can move from memory to memory
455 in one reasonably fast instruction. */
456 #define MOVE_MAX 8
457
458 /* If a memory-to-memory move would take MOVE_RATIO or more simple
459 move-instruction pairs, we will do a movmem or libcall instead. */
460 #define MOVE_RATIO(speed) ((speed) ? 6 : 3)
461 #define CLEAR_RATIO(speed) ((speed) ? 6 : 2)
462
463 /* Nonzero if access to memory by bytes is slow and undesirable. */
464 #define SLOW_BYTE_ACCESS 0
465
466 /* Define if shifts truncate the shift count
467 which implies one can omit a sign-extension or zero-extension
468 of a shift count. */
469 /* #define SHIFT_COUNT_TRUNCATED */
470
471 /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
472 is done just by pretending it is already truncated. */
473 #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
474
475 /* Specify the machine mode that pointers have.
476 After generation of rtl, the compiler makes no further distinction
477 between pointers and any other objects of this machine mode. */
478 #define Pmode SImode
479
480 /* A function address in a call instruction
481 is a byte address (for indexing purposes)
482 so give the MEM rtx a byte's mode. */
483 #define FUNCTION_MODE QImode
484
485 /* Specify the cost of a branch insn; roughly the number of extra insns that
486 should be added to avoid a branch.
487
488 Branches are extremely cheap on the VAX while the shift insns often
489 used to replace branches can be expensive. */
490
491 #define BRANCH_COST(speed_p, predictable_p) 0
492 \f
493 /* Tell final.c how to eliminate redundant test instructions. */
494
495 /* Here we define machine-dependent flags and fields in cc_status
496 (see `conditions.h'). No extra ones are needed for the VAX. */
497
498 /* Store in cc_status the expressions
499 that the condition codes will describe
500 after execution of an instruction whose pattern is EXP.
501 Do not alter them if the instruction would not alter the cc's. */
502
503 #define NOTICE_UPDATE_CC(EXP, INSN) \
504 vax_notice_update_cc ((EXP), (INSN))
505
506 #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
507 { if (cc_status.flags & CC_NO_OVERFLOW) \
508 return NO_OV; \
509 return NORMAL; \
510 }
511 \f
512 /* Control the assembler format that we output. */
513
514 /* A C string constant describing how to begin a comment in the target
515 assembler language. The compiler assumes that the comment will end at
516 the end of the line. */
517
518 #define ASM_COMMENT_START "#"
519
520 /* Output to assembler file text saying following lines
521 may contain character constants, extra white space, comments, etc. */
522
523 #define ASM_APP_ON "#APP\n"
524
525 /* Output to assembler file text saying following lines
526 no longer contain unusual constructs. */
527
528 #define ASM_APP_OFF "#NO_APP\n"
529
530 /* Output before read-only data. */
531
532 #define TEXT_SECTION_ASM_OP "\t.text"
533
534 /* Output before writable data. */
535
536 #define DATA_SECTION_ASM_OP "\t.data"
537
538 /* How to refer to registers in assembler output.
539 This sequence is indexed by compiler's hard-register-number (see above).
540 The register names will be prefixed by REGISTER_PREFIX, if any. */
541
542 #define REGISTER_PREFIX ""
543 #define REGISTER_NAMES \
544 { "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \
545 "r8", "r9", "r10", "r11", "ap", "fp", "sp", "pc", }
546
547 /* This is BSD, so it wants DBX format. */
548
549 #define DBX_DEBUGGING_INFO 1
550
551 /* Do not break .stabs pseudos into continuations. */
552
553 #define DBX_CONTIN_LENGTH 0
554
555 /* This is the char to use for continuation (in case we need to turn
556 continuation back on). */
557
558 #define DBX_CONTIN_CHAR '?'
559
560 /* Don't use the `xsfoo;' construct in DBX output; this system
561 doesn't support it. */
562
563 #define DBX_NO_XREFS
564
565 /* Output the .stabs for a C `static' variable in the data section. */
566 #define DBX_STATIC_STAB_DATA_SECTION
567
568 /* VAX specific: which type character is used for type double? */
569
570 #define ASM_DOUBLE_CHAR (TARGET_G_FLOAT ? 'g' : 'd')
571
572 /* This is how to output a command to make the user-level label named NAME
573 defined for reference from other files. */
574
575 /* Globalizing directive for a label. */
576 #define GLOBAL_ASM_OP ".globl "
577
578 /* The prefix to add to user-visible assembler symbols. */
579
580 #define USER_LABEL_PREFIX "_"
581
582 /* This is how to store into the string LABEL
583 the symbol_ref name of an internal numbered label where
584 PREFIX is the class of label and NUM is the number within the class.
585 This is suitable for output with `assemble_name'. */
586
587 #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
588 sprintf (LABEL, "*%s%ld", PREFIX, (long)(NUM))
589
590 /* This is how to output an insn to push a register on the stack.
591 It need not be very fast code. */
592
593 #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
594 fprintf (FILE, "\tpushl %s\n", reg_names[REGNO])
595
596 /* This is how to output an insn to pop a register from the stack.
597 It need not be very fast code. */
598
599 #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
600 fprintf (FILE, "\tmovl (%s)+,%s\n", reg_names[STACK_POINTER_REGNUM], \
601 reg_names[REGNO])
602
603 /* This is how to output an element of a case-vector that is absolute.
604 (The VAX does not use such vectors,
605 but we must define this macro anyway.) */
606
607 #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
608 do \
609 { \
610 char label[256]; \
611 ASM_GENERATE_INTERNAL_LABEL (label, "L", (VALUE));\
612 fprintf (FILE, "\t.long "); \
613 assemble_name (FILE, label); \
614 fprintf (FILE, "\n"); \
615 } \
616 while (0)
617
618 /* This is how to output an element of a case-vector that is relative. */
619
620 #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, BODY, VALUE, REL) \
621 do \
622 { \
623 char label[256]; \
624 ASM_GENERATE_INTERNAL_LABEL (label, "L", (VALUE)); \
625 fprintf (FILE, "\t.word "); \
626 assemble_name (FILE, label); \
627 ASM_GENERATE_INTERNAL_LABEL (label, "L", (REL)); \
628 fprintf (FILE, "-"); \
629 assemble_name (FILE, label); \
630 fprintf (FILE, "\n"); \
631 } \
632 while (0)
633
634 /* This is how to output an assembler line
635 that says to advance the location counter
636 to a multiple of 2**LOG bytes. */
637
638 #define ASM_OUTPUT_ALIGN(FILE,LOG) \
639 fprintf (FILE, "\t.align %d\n", (LOG))
640
641 /* This is how to output an assembler line
642 that says to advance the location counter by SIZE bytes. */
643
644 #define ASM_OUTPUT_SKIP(FILE,SIZE) \
645 fprintf (FILE, "\t.space %u\n", (int)(SIZE))
646
647 /* This says how to output an assembler line
648 to define a global common symbol. */
649
650 #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
651 ( fputs (".comm ", (FILE)), \
652 assemble_name ((FILE), (NAME)), \
653 fprintf ((FILE), ",%u\n", (int)(ROUNDED)))
654
655 /* This says how to output an assembler line
656 to define a local common symbol. */
657
658 #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
659 ( fputs (".lcomm ", (FILE)), \
660 assemble_name ((FILE), (NAME)), \
661 fprintf ((FILE), ",%u\n", (int)(ROUNDED)))
662
663 /* Print an instruction operand X on file FILE.
664 CODE is the code from the %-spec that requested printing this operand;
665 if `%z3' was used to print operand 3, then CODE is 'z'.
666
667 VAX operand formatting codes:
668
669 letter print
670 c direct branch condition
671 C reverse branch condition
672 D 64-bit immediate operand
673 B the low 8 bits of the complement of a constant operand
674 H the low 16 bits of the complement of a constant operand
675 M a mask for the N highest bits of a word
676 N the complement of a constant integer operand
677 P constant operand plus 1
678 R 32 - constant operand
679 b the low 8 bits of a negated constant operand
680 h the low 16 bits of a negated constant operand
681 # 'd' or 'g' depending on whether dfloat or gfloat is used
682 | register prefix */
683
684 /* The purpose of D is to get around a quirk or bug in VAX assembler
685 whereby -1 in a 64-bit immediate operand means 0x00000000ffffffff,
686 which is not a 64-bit minus one. As a workaround, we output negative
687 values in hex. */
688 #if HOST_BITS_PER_WIDE_INT == 64
689 # define NEG_HWI_PRINT_HEX16 HOST_WIDE_INT_PRINT_HEX
690 #else
691 # define NEG_HWI_PRINT_HEX16 "0xffffffff%08lx"
692 #endif
693
694 #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
695 ((CODE) == '#' || (CODE) == '|')
696
697 #define PRINT_OPERAND(FILE, X, CODE) \
698 print_operand (FILE, X, CODE)
699
700 /* Print a memory operand whose address is X, on file FILE.
701 This uses a function in output-vax.c. */
702
703 #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
704 print_operand_address (FILE, ADDR)
705
706 /* This is a blatent lie. However, it's good enough, since we don't
707 actually have any code whatsoever for which this isn't overridden
708 by the proper FDE definition. */
709 #define INCOMING_RETURN_ADDR_RTX gen_rtx_REG (Pmode, PC_REGNUM)
710