![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to tm-vax.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [GCC 1.x] / gcc / config|
Return to tm-vax.h CVS log | Up to [GCC 1.x] / gcc / config |
1.1 root 1: /* Definitions of target machine for GNU compiler. Vax version.
2: Copyright (C) 1987, 1988 Free Software Foundation, Inc.
3:
4: This file is part of GNU CC.
5:
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 1, or (at your option)
9: any later version.
10:
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.
15:
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. */
19:
20:
21: /* Names to predefine in the preprocessor for this target machine. */
22:
23: #define CPP_PREDEFINES "-Dvax -Dunix"
24:
1.1.1.6 ! root 25: /* If using g-format floating point, alter math.h. */
! 26:
! 27: #define CPP_SPEC "%{mg:-DGFLOAT}"
! 28:
! 29: /* Choose proper libraries depending on float format.
! 30: Note that there are no profiling libraries for g-format. */
! 31:
! 32: #define LIB_SPEC "%{mg:%{lm:-lmg} -lcg \
! 33: %{p:%eprofiling not supported with -mg\n\
! 34: %{pg:%eprofiling not supported with -mg\n}\
! 35: %{!mg:%{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p}}"
! 36:
1.1 root 37: /* Print subsidiary information on the compiler version in use. */
38:
39: #define TARGET_VERSION fprintf (stderr, " (vax)");
40:
41: /* Run-time compilation parameters selecting different hardware subsets. */
42:
43: extern int target_flags;
44:
45: /* Macros used in the machine description to test the flags. */
46:
47: /* Nonzero if compiling code that Unix assembler can assemble. */
48: #define TARGET_UNIX_ASM (target_flags & 1)
49:
50: /* Nonzero if compiling with VAX-11 "C" style structure alignment */
51: #define TARGET_VAXC_ALIGNMENT (target_flags & 2)
52:
53: /* Nonzero if compiling with `G'-format floating point */
54: #define TARGET_G_FLOAT (target_flags & 4)
55:
56: /* Macro to define tables used to set the flags.
57: This is a list in braces of pairs in braces,
58: each pair being { "NAME", VALUE }
59: where VALUE is the bits to set or minus the bits to clear.
60: An empty string NAME is used to identify the default VALUE. */
61:
62: #define TARGET_SWITCHES \
63: { {"unix", 1}, \
64: {"gnu", -1}, \
65: {"vaxc-alignment", 2}, \
66: {"g", 4}, \
67: {"g-float", 4}, \
68: {"d", -4}, \
69: {"d-float", -4}, \
70: { "", TARGET_DEFAULT}}
71:
72: /* Default target_flags if no switches specified. */
73:
74: #ifndef TARGET_DEFAULT
75: #define TARGET_DEFAULT 1
76: #endif
77:
78: /* Target machine storage layout */
79:
80: /* Define this if most significant bit is lowest numbered
81: in instructions that operate on numbered bit-fields.
82: This is not true on the vax. */
83: /* #define BITS_BIG_ENDIAN */
84:
85: /* Define this if most significant byte of a word is the lowest numbered. */
86: /* That is not true on the vax. */
87: /* #define BYTES_BIG_ENDIAN */
88:
89: /* Define this if most significant word of a multiword number is numbered. */
90: /* This is not true on the vax. */
91: /* #define WORDS_BIG_ENDIAN */
92:
93: /* Number of bits in an addressible storage unit */
94: #define BITS_PER_UNIT 8
95:
96: /* Width in bits of a "word", which is the contents of a machine register.
97: Note that this is not necessarily the width of data type `int';
98: if using 16-bit ints on a 68000, this would still be 32.
99: But on a machine with 16-bit registers, this would be 16. */
100: #define BITS_PER_WORD 32
101:
102: /* Width of a word, in units (bytes). */
103: #define UNITS_PER_WORD 4
104:
105: /* Width in bits of a pointer.
106: See also the macro `Pmode' defined below. */
107: #define POINTER_SIZE 32
108:
109: /* Allocation boundary (in *bits*) for storing pointers in memory. */
110: #define POINTER_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
111:
112: /* Allocation boundary (in *bits*) for storing arguments in argument list. */
113: #define PARM_BOUNDARY 32
114:
115: /* Allocation boundary (in *bits*) for the code of a function. */
116: #define FUNCTION_BOUNDARY 16
117:
118: /* Alignment of field after `int : 0' in a structure. */
119: #define EMPTY_FIELD_BOUNDARY (TARGET_VAXC_ALIGNMENT ? 8 : 32)
120:
121: /* Every structure's size must be a multiple of this. */
122: #define STRUCTURE_SIZE_BOUNDARY 8
123:
124: /* A bitfield declared as `int' forces `int' alignment for the struct. */
1.1.1.3 root 125: #define PCC_BITFIELD_TYPE_MATTERS (! TARGET_VAXC_ALIGNMENT)
1.1 root 126:
127: /* No data type wants to be aligned rounder than this. */
128: #define BIGGEST_ALIGNMENT (TARGET_VAXC_ALIGNMENT ? 8 : 32)
129:
130: /* Define this if move instructions will actually fail to work
131: when given unaligned data. */
132: /* #define STRICT_ALIGNMENT */
133:
134: /* Standard register usage. */
135:
136: /* Number of actual hardware registers.
137: The hardware registers are assigned numbers for the compiler
138: from 0 to just below FIRST_PSEUDO_REGISTER.
139: All registers that the compiler knows about must be given numbers,
140: even those that are not normally considered general registers. */
141: #define FIRST_PSEUDO_REGISTER 16
142:
143: /* 1 for registers that have pervasive standard uses
144: and are not available for the register allocator.
145: On the vax, these are the AP, FP, SP and PC. */
146: #define FIXED_REGISTERS {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
147:
148: /* 1 for registers not available across function calls.
149: These must include the FIXED_REGISTERS and also any
150: registers that can be used without being saved.
151: The latter must include the registers where values are returned
152: and the register where structure-value addresses are passed.
153: Aside from that, you can include as many other registers as you like. */
154: #define CALL_USED_REGISTERS {1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}
155:
156: /* Return number of consecutive hard regs needed starting at reg REGNO
157: to hold something of mode MODE.
158: This is ordinarily the length in words of a value of mode MODE
159: but can be less for certain modes in special long registers.
160: On the vax, all registers are one word long. */
161: #define HARD_REGNO_NREGS(REGNO, MODE) \
162: ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
163:
164: /* Value is 1 if hard register REGNO can hold a value of machine-mode MODE.
165: On the vax, all registers can hold all modes. */
166: #define HARD_REGNO_MODE_OK(REGNO, MODE) 1
167:
168: /* Value is 1 if it is a good idea to tie two pseudo registers
169: when one has mode MODE1 and one has mode MODE2.
170: If HARD_REGNO_MODE_OK could produce different values for MODE1 and MODE2,
171: for any hard reg, then this must be 0 for correct output. */
172: #define MODES_TIEABLE_P(MODE1, MODE2) 1
173:
174: /* Specify the registers used for certain standard purposes.
175: The values of these macros are register numbers. */
176:
177: /* Vax pc is overloaded on a register. */
178: #define PC_REGNUM 15
179:
180: /* Register to use for pushing function arguments. */
181: #define STACK_POINTER_REGNUM 14
182:
183: /* Base register for access to local variables of the function. */
184: #define FRAME_POINTER_REGNUM 13
185:
186: /* Value should be nonzero if functions must have frame pointers.
187: Zero means the frame pointer need not be set up (and parms
188: may be accessed via the stack pointer) in functions that seem suitable.
189: This is computed in `reload', in reload1.c. */
190: #define FRAME_POINTER_REQUIRED 1
191:
192: /* Base register for access to arguments of the function. */
193: #define ARG_POINTER_REGNUM 12
194:
195: /* Register in which static-chain is passed to a function. */
196: #define STATIC_CHAIN_REGNUM 0
197:
198: /* Register in which address to store a structure value
199: is passed to a function. */
200: #define STRUCT_VALUE_REGNUM 1
201:
202: /* Define the classes of registers for register constraints in the
203: machine description. Also define ranges of constants.
204:
205: One of the classes must always be named ALL_REGS and include all hard regs.
206: If there is more than one class, another class must be named NO_REGS
207: and contain no registers.
208:
209: The name GENERAL_REGS must be the name of a class (or an alias for
210: another name such as ALL_REGS). This is the class of registers
211: that is allowed by "g" or "r" in a register constraint.
212: Also, registers outside this class are allocated only when
213: instructions express preferences for them.
214:
215: The classes must be numbered in nondecreasing order; that is,
216: a larger-numbered class must never be contained completely
217: in a smaller-numbered class.
218:
219: For any two classes, it is very desirable that there be another
220: class that represents their union. */
221:
222: /* The vax has only one kind of registers, so NO_REGS and ALL_REGS
223: are the only classes. */
224:
225: enum reg_class { NO_REGS, ALL_REGS, LIM_REG_CLASSES };
226:
227: #define N_REG_CLASSES (int) LIM_REG_CLASSES
228:
229: /* Since GENERAL_REGS is the same class as ALL_REGS,
230: don't give it a different class number; just make it an alias. */
231:
232: #define GENERAL_REGS ALL_REGS
233:
234: /* Give names of register classes as strings for dump file. */
235:
236: #define REG_CLASS_NAMES \
237: {"NO_REGS", "ALL_REGS" }
238:
239: /* Define which registers fit in which classes.
240: This is an initializer for a vector of HARD_REG_SET
241: of length N_REG_CLASSES. */
242:
243: #define REG_CLASS_CONTENTS {0, 0xffff}
244:
245: /* The same information, inverted:
246: Return the class number of the smallest class containing
247: reg number REGNO. This could be a conditional expression
248: or could index an array. */
249:
250: #define REGNO_REG_CLASS(REGNO) ALL_REGS
251:
252: /* The class value for index registers, and the one for base regs. */
253:
254: #define INDEX_REG_CLASS ALL_REGS
255: #define BASE_REG_CLASS ALL_REGS
256:
257: /* Get reg_class from a letter such as appears in the machine description. */
258:
259: #define REG_CLASS_FROM_LETTER(C) NO_REGS
260:
261: /* The letters I, J, K, L and M in a register constraint string
262: can be used to stand for particular ranges of immediate operands.
263: This macro defines what the ranges are.
264: C is the letter, and VALUE is a constant value.
265: Return 1 if VALUE is in the range specified by C. */
266:
267: #define CONST_OK_FOR_LETTER_P(VALUE, C) 0
268:
269: /* Similar, but for floating constants, and defining letters G and H.
270: Here VALUE is the CONST_DOUBLE rtx itself. */
271:
272: #define CONST_DOUBLE_OK_FOR_LETTER_P(VALUE, C) 1
273:
274: /* Given an rtx X being reloaded into a reg required to be
275: in class CLASS, return the class of reg to actually use.
276: In general this is just CLASS; but on some machines
277: in some cases it is preferable to use a more restrictive class. */
278:
279: #define PREFERRED_RELOAD_CLASS(X,CLASS) (CLASS)
280:
281: /* Return the maximum number of consecutive registers
282: needed to represent mode MODE in a register of class CLASS. */
283: /* On the vax, this is always the size of MODE in words,
284: since all registers are the same size. */
285: #define CLASS_MAX_NREGS(CLASS, MODE) \
286: ((GET_MODE_SIZE (MODE) + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
287:
288: /* Stack layout; function entry, exit and calling. */
289:
290: /* Define this if pushing a word on the stack
291: makes the stack pointer a smaller address. */
292: #define STACK_GROWS_DOWNWARD
293:
294: /* Define this if longjmp restores from saved registers
295: rather than from what setjmp saved. */
296: #define LONGJMP_RESTORE_FROM_STACK
297:
298: /* Define this if the nominal address of the stack frame
299: is at the high-address end of the local variables;
300: that is, each additional local variable allocated
301: goes at a more negative offset in the frame. */
302: #define FRAME_GROWS_DOWNWARD
303:
304: /* Offset within stack frame to start allocating local variables at.
305: If FRAME_GROWS_DOWNWARD, this is the offset to the END of the
306: first local allocated. Otherwise, it is the offset to the BEGINNING
307: of the first local allocated. */
308: #define STARTING_FRAME_OFFSET 0
309:
310: /* If we generate an insn to push BYTES bytes,
311: this says how many the stack pointer really advances by.
312: On the vax, -(sp) pushes only the bytes of the operands. */
313: #define PUSH_ROUNDING(BYTES) (BYTES)
314:
315: /* Offset of first parameter from the argument pointer register value. */
316: #define FIRST_PARM_OFFSET(FNDECL) 4
317:
318: /* Value is 1 if returning from a function call automatically
319: pops the arguments described by the number-of-args field in the call.
320: FUNTYPE is the data type of the function (as a tree),
321: or for a library call it is an identifier node for the subroutine name.
322:
323: On the Vax, the RET insn always pops all the args for any function. */
324:
325: #define RETURN_POPS_ARGS(FUNTYPE) 1
326:
327: /* Define how to find the value returned by a function.
328: VALTYPE is the data type of the value (as a tree).
329: If the precise function being called is known, FUNC is its FUNCTION_DECL;
330: otherwise, FUNC is 0. */
331:
332: /* On the Vax the return value is in R0 regardless. */
333:
334: #define FUNCTION_VALUE(VALTYPE, FUNC) \
335: gen_rtx (REG, TYPE_MODE (VALTYPE), 0)
336:
337: /* Define how to find the value returned by a library function
338: assuming the value has mode MODE. */
339:
340: /* On the Vax the return value is in R0 regardless. */
341:
342: #define LIBCALL_VALUE(MODE) gen_rtx (REG, MODE, 0)
343:
344: /* Define this if PCC uses the nonreentrant convention for returning
345: structure and union values. */
346:
347: #define PCC_STATIC_STRUCT_RETURN
348:
349: /* 1 if N is a possible register number for a function value.
350: On the Vax, R0 is the only register thus used. */
351:
352: #define FUNCTION_VALUE_REGNO_P(N) ((N) == 0)
353:
354: /* 1 if N is a possible register number for function argument passing.
355: On the Vax, no registers are used in this way. */
356:
357: #define FUNCTION_ARG_REGNO_P(N) 0
358:
359: /* Define a data type for recording info about an argument list
360: during the scan of that argument list. This data type should
361: hold all necessary information about the function itself
362: and about the args processed so far, enough to enable macros
363: such as FUNCTION_ARG to determine where the next arg should go.
364:
365: On the vax, this is a single integer, which is a number of bytes
366: of arguments scanned so far. */
367:
368: #define CUMULATIVE_ARGS int
369:
370: /* Initialize a variable CUM of type CUMULATIVE_ARGS
371: for a call to a function whose data type is FNTYPE.
372: For a library call, FNTYPE is 0.
373:
374: On the vax, the offset starts at 0. */
375:
376: #define INIT_CUMULATIVE_ARGS(CUM,FNTYPE) \
377: ((CUM) = 0)
378:
379: /* Update the data in CUM to advance over an argument
380: of mode MODE and data type TYPE.
381: (TYPE is null for libcalls where that information may not be available.) */
382:
383: #define FUNCTION_ARG_ADVANCE(CUM, MODE, TYPE, NAMED) \
384: ((CUM) += ((MODE) != BLKmode \
385: ? (GET_MODE_SIZE (MODE) + 3) & ~3 \
386: : (int_size_in_bytes (TYPE) + 3) & ~3))
387:
388: /* Define where to put the arguments to a function.
389: Value is zero to push the argument on the stack,
390: or a hard register in which to store the argument.
391:
392: MODE is the argument's machine mode.
393: TYPE is the data type of the argument (as a tree).
394: This is null for libcalls where that information may
395: not be available.
396: CUM is a variable of type CUMULATIVE_ARGS which gives info about
397: the preceding args and about the function being called.
398: NAMED is nonzero if this argument is a named parameter
399: (otherwise it is an extra parameter matching an ellipsis). */
400:
401: /* On the vax all args are pushed. */
402:
403: #define FUNCTION_ARG(CUM, MODE, TYPE, NAMED) 0
404:
405: /* This macro generates the assembly code for function entry.
406: FILE is a stdio stream to output the code to.
1.1.1.6 ! root 407: SIZE is an int: how many units of temporary storage to allocate,
! 408: adjusted by STARTING_FRAME_OFFSET to accomodate tm-vms.h.
1.1 root 409: Refer to the array `regs_ever_live' to determine which registers
410: to save; `regs_ever_live[I]' is nonzero if register number I
411: is ever used in the function. This macro is responsible for
412: knowing which registers should not be saved even if used. */
413:
414: #define FUNCTION_PROLOGUE(FILE, SIZE) \
415: { register int regno; \
416: register int mask = 0; \
1.1.1.6 ! root 417: register int size = SIZE - STARTING_FRAME_OFFSET; \
1.1 root 418: extern char call_used_regs[]; \
419: for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) \
420: if (regs_ever_live[regno] && !call_used_regs[regno]) \
421: mask |= 1 << regno; \
422: fprintf (FILE, "\t.word 0x%x\n", mask); \
423: MAYBE_VMS_FUNCTION_PROLOGUE(FILE) \
1.1.1.6 ! root 424: if (size >= 64) fprintf (FILE, "\tmovab %d(sp),sp\n", -size); \
! 425: else if (size) fprintf (FILE, "\tsubl2 $%d,sp\n", size); }
1.1 root 426:
427: /* tm-vms.h redefines this. */
428: #define MAYBE_VMS_FUNCTION_PROLOGUE(FILE)
429:
430: /* Output assembler code to FILE to increment profiler label # LABELNO
431: for profiling a function entry. */
432:
433: #define FUNCTION_PROFILER(FILE, LABELNO) \
434: fprintf (FILE, "\tmovab LP%d,r0\n\tjsb mcount\n", (LABELNO));
435:
1.1.1.3 root 436: /* Output assembler code to FILE to initialize this source file's
437: basic block profiling info, if that has not already been done. */
438:
439: #define FUNCTION_BLOCK_PROFILER(FILE, LABELNO) \
440: fprintf (FILE, "\ttstl LPBX0\n\tjneq LPI%d\n\tpushal LPBX0\n\tcalls $1,__bb_init_func\nLPI%d:\n", \
441: LABELNO, LABELNO);
442:
443: /* Output assembler code to FILE to increment the entry-count for
444: the BLOCKNO'th basic block in this source file. This is a real pain in the
445: sphincter on a VAX, since we do not want to change any of the bits in the
446: processor status word. The way it is done here, it is pushed onto the stack
447: before any flags have changed, and then the stack is fixed up to account for
448: the fact that the instruction to restore the flags only reads a word.
449: It may seem a bit clumsy, but at least it works.
450: */
451:
452: #define BLOCK_PROFILER(FILE, BLOCKNO) \
453: 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", \
454: 4 * BLOCKNO)
455:
1.1 root 456: /* EXIT_IGNORE_STACK should be nonzero if, when returning from a function,
457: the stack pointer does not matter. The value is tested only in
458: functions that have frame pointers.
459: No definition is equivalent to always zero. */
460:
461: #define EXIT_IGNORE_STACK 1
462:
463: /* This macro generates the assembly code for function exit,
464: on machines that need it. If FUNCTION_EPILOGUE is not defined
465: then individual return instructions are generated for each
466: return statement. Args are same as for FUNCTION_PROLOGUE. */
467:
468: /* #define FUNCTION_EPILOGUE(FILE, SIZE) */
469:
470: /* If the memory address ADDR is relative to the frame pointer,
471: correct it to be relative to the stack pointer instead.
472: This is for when we don't use a frame pointer.
473: ADDR should be a variable name. */
474:
475: #define FIX_FRAME_POINTER_ADDRESS(ADDR,DEPTH) abort ();
476:
477: /* Addressing modes, and classification of registers for them. */
478:
479: #define HAVE_POST_INCREMENT
480: /* #define HAVE_POST_DECREMENT */
481:
482: #define HAVE_PRE_DECREMENT
483: /* #define HAVE_PRE_INCREMENT */
484:
485: /* Macros to check register numbers against specific register classes. */
486:
487: /* These assume that REGNO is a hard or pseudo reg number.
488: They give nonzero only if REGNO is a hard reg of the suitable class
489: or a pseudo reg currently allocated to a suitable hard reg.
490: Since they use reg_renumber, they are safe only once reg_renumber
491: has been allocated, which happens in local-alloc.c. */
492:
493: #define REGNO_OK_FOR_INDEX_P(regno) \
494: ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
495: #define REGNO_OK_FOR_BASE_P(regno) \
496: ((regno) < FIRST_PSEUDO_REGISTER || reg_renumber[regno] >= 0)
497:
498: /* Maximum number of registers that can appear in a valid memory address. */
499:
500: #define MAX_REGS_PER_ADDRESS 2
501:
502: /* 1 if X is an rtx for a constant that is a valid address. */
503:
1.1.1.3 root 504: #define CONSTANT_ADDRESS_P(X) (CONSTANT_P (X) && LEGITIMATE_CONSTANT_P (X))
1.1 root 505:
506: /* Nonzero if the constant value X is a legitimate general operand.
507: It is given that X satisfies CONSTANT_P or is a CONST_DOUBLE. */
508:
1.1.1.3 root 509: #ifdef NO_EXTERNAL_INDIRECT_ADDRESS
510: #define LEGITIMATE_CONSTANT_P(X) \
511: (! (GET_CODE ((X)) == CONST \
512: && GET_CODE (XEXP ((X), 0)) == PLUS \
513: && GET_CODE (XEXP (XEXP ((X), 0), 0)) == SYMBOL_REF \
514: && EXTERNAL_SYMBOL_P (XEXP (XEXP ((X), 0), 0))))
515: #else
1.1 root 516: #define LEGITIMATE_CONSTANT_P(X) 1
1.1.1.3 root 517: #endif
1.1 root 518:
519: /* The macros REG_OK_FOR..._P assume that the arg is a REG rtx
520: and check its validity for a certain class.
521: We have two alternate definitions for each of them.
522: The usual definition accepts all pseudo regs; the other rejects
523: them unless they have been allocated suitable hard regs.
524: The symbol REG_OK_STRICT causes the latter definition to be used.
525:
526: Most source files want to accept pseudo regs in the hope that
527: they will get allocated to the class that the insn wants them to be in.
528: Source files for reload pass need to be strict.
529: After reload, it makes no difference, since pseudo regs have
530: been eliminated by then. */
531:
532: #ifndef REG_OK_STRICT
533:
534: /* Nonzero if X is a hard reg that can be used as an index
535: or if it is a pseudo reg. */
536: #define REG_OK_FOR_INDEX_P(X) 1
537: /* Nonzero if X is a hard reg that can be used as a base reg
538: or if it is a pseudo reg. */
539: #define REG_OK_FOR_BASE_P(X) 1
540:
541: #else
542:
543: /* Nonzero if X is a hard reg that can be used as an index. */
544: #define REG_OK_FOR_INDEX_P(X) REGNO_OK_FOR_INDEX_P (REGNO (X))
545: /* Nonzero if X is a hard reg that can be used as a base reg. */
546: #define REG_OK_FOR_BASE_P(X) REGNO_OK_FOR_BASE_P (REGNO (X))
547:
548: #endif
549:
550: /* GO_IF_LEGITIMATE_ADDRESS recognizes an RTL expression
551: that is a valid memory address for an instruction.
552: The MODE argument is the machine mode for the MEM expression
553: that wants to use this address.
554:
555: The other macros defined here are used only in GO_IF_LEGITIMATE_ADDRESS,
556: except for CONSTANT_ADDRESS_P which is actually machine-independent. */
557:
558: /* 1 if X is an address that we could indirect through. */
1.1.1.3 root 559: #ifdef NO_EXTERNAL_INDIRECT_ADDRESS
560: #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) \
561: (GET_CODE (X) == LABEL_REF \
562: || (GET_CODE (X) == SYMBOL_REF && !EXTERNAL_SYMBOL_P (X)) \
563: || (GET_CODE (X) == CONST && LEGITIMATE_CONSTANT_P(X)) \
564: || GET_CODE (X) == CONST_INT)
565:
566: #define INDIRECTABLE_ADDRESS_P(X) \
567: (INDIRECTABLE_CONSTANT_ADDRESS_P (X) \
568: || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
569: || (GET_CODE (X) == PLUS \
570: && GET_CODE (XEXP (X, 0)) == REG \
571: && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
572: && INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))))
573: #else
574: #define INDIRECTABLE_CONSTANT_ADDRESS_P(X) CONSTANT_ADDRESS_P(X)
1.1 root 575: #define INDIRECTABLE_ADDRESS_P(X) \
576: (CONSTANT_ADDRESS_P (X) \
577: || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
578: || (GET_CODE (X) == PLUS \
579: && GET_CODE (XEXP (X, 0)) == REG \
580: && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
581: && CONSTANT_ADDRESS_P (XEXP (X, 1))))
1.1.1.3 root 582: #endif
583:
584: /* Non-zero if this is a valid address without indexing or indirection. */
585: #define NONINDIRECT_ADDRESS_P(X) \
586: (CONSTANT_ADDRESS_P (X) \
587: || (GET_CODE (X) == REG && REG_OK_FOR_BASE_P (X)) \
588: || (GET_CODE (X) == PLUS \
589: && GET_CODE (XEXP (X, 0)) == REG \
590: && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
591: && CONSTANT_ADDRESS_P (XEXP (X, 1))))
1.1 root 592:
593: /* Go to ADDR if X is a valid address not using indexing.
594: (This much is the easy part.) */
595: #define GO_IF_NONINDEXED_ADDRESS(X, ADDR) \
596: { register rtx xfoob = (X); \
597: if (GET_CODE (xfoob) == REG) goto ADDR; \
1.1.1.3 root 598: if (NONINDIRECT_ADDRESS_P (xfoob)) goto ADDR; \
1.1 root 599: xfoob = XEXP (X, 0); \
600: if (GET_CODE (X) == MEM && INDIRECTABLE_ADDRESS_P (xfoob)) \
601: goto ADDR; \
602: if ((GET_CODE (X) == PRE_DEC || GET_CODE (X) == POST_INC) \
603: && GET_CODE (xfoob) == REG && REG_OK_FOR_BASE_P (xfoob)) \
604: goto ADDR; }
605:
606: /* 1 if PROD is either a reg times size of mode MODE
607: or just a reg, if MODE is just one byte.
608: This macro's expansion uses the temporary variables xfoo0 and xfoo1
609: that must be declared in the surrounding context. */
610: #define INDEX_TERM_P(PROD, MODE) \
611: (GET_MODE_SIZE (MODE) == 1 \
612: ? (GET_CODE (PROD) == REG && REG_OK_FOR_BASE_P (PROD)) \
613: : (GET_CODE (PROD) == MULT \
614: && \
615: (xfoo0 = XEXP (PROD, 0), xfoo1 = XEXP (PROD, 1), \
616: ((GET_CODE (xfoo0) == CONST_INT \
617: && INTVAL (xfoo0) == GET_MODE_SIZE (MODE) \
618: && GET_CODE (xfoo1) == REG \
619: && REG_OK_FOR_INDEX_P (xfoo1)) \
620: || \
621: (GET_CODE (xfoo1) == CONST_INT \
622: && INTVAL (xfoo1) == GET_MODE_SIZE (MODE) \
623: && GET_CODE (xfoo0) == REG \
624: && REG_OK_FOR_INDEX_P (xfoo0))))))
625:
626: /* Go to ADDR if X is the sum of a register
627: and a valid index term for mode MODE. */
628: #define GO_IF_REG_PLUS_INDEX(X, MODE, ADDR) \
629: { register rtx xfooa; \
630: if (GET_CODE (X) == PLUS) \
631: { if (GET_CODE (XEXP (X, 0)) == REG \
632: && REG_OK_FOR_BASE_P (XEXP (X, 0)) \
633: && (xfooa = XEXP (X, 1), \
634: INDEX_TERM_P (xfooa, MODE))) \
635: goto ADDR; \
636: if (GET_CODE (XEXP (X, 1)) == REG \
637: && REG_OK_FOR_BASE_P (XEXP (X, 1)) \
638: && (xfooa = XEXP (X, 0), \
639: INDEX_TERM_P (xfooa, MODE))) \
640: goto ADDR; } }
641:
642: #define GO_IF_LEGITIMATE_ADDRESS(MODE, X, ADDR) \
643: { register rtx xfoo, xfoo0, xfoo1; \
644: GO_IF_NONINDEXED_ADDRESS (X, ADDR); \
645: if (GET_CODE (X) == PLUS) \
646: { /* Handle <address>[index] represented with index-sum outermost */\
647: xfoo = XEXP (X, 0); \
648: if (INDEX_TERM_P (xfoo, MODE)) \
649: { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 1), ADDR); } \
650: xfoo = XEXP (X, 1); \
651: if (INDEX_TERM_P (xfoo, MODE)) \
652: { GO_IF_NONINDEXED_ADDRESS (XEXP (X, 0), ADDR); } \
653: /* Handle offset(reg)[index] with offset added outermost */ \
1.1.1.3 root 654: if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 0))) \
1.1 root 655: { if (GET_CODE (XEXP (X, 1)) == REG \
656: && REG_OK_FOR_BASE_P (XEXP (X, 1))) \
657: goto ADDR; \
658: GO_IF_REG_PLUS_INDEX (XEXP (X, 1), MODE, ADDR); } \
1.1.1.3 root 659: if (INDIRECTABLE_CONSTANT_ADDRESS_P (XEXP (X, 1))) \
1.1 root 660: { if (GET_CODE (XEXP (X, 0)) == REG \
661: && REG_OK_FOR_BASE_P (XEXP (X, 0))) \
662: goto ADDR; \
663: GO_IF_REG_PLUS_INDEX (XEXP (X, 0), MODE, ADDR); } } }
664:
665: /* Try machine-dependent ways of modifying an illegitimate address
666: to be legitimate. If we find one, return the new, valid address.
667: This macro is used in only one place: `memory_address' in explow.c.
668:
669: OLDX is the address as it was before break_out_memory_refs was called.
670: In some cases it is useful to look at this to decide what needs to be done.
671:
672: MODE and WIN are passed so that this macro can use
673: GO_IF_LEGITIMATE_ADDRESS.
674:
675: It is always safe for this macro to do nothing. It exists to recognize
676: opportunities to optimize the output.
677:
678: For the vax, nothing needs to be done. */
679:
680: #define LEGITIMIZE_ADDRESS(X,OLDX,MODE,WIN) {}
681:
682: /* Go to LABEL if ADDR (a legitimate address expression)
683: has an effect that depends on the machine mode it is used for.
684: On the VAX, the predecrement and postincrement address depend thus
685: (the amount of decrement or increment being the length of the operand)
686: and all indexed address depend thus (because the index scale factor
687: is the length of the operand). */
688: #define GO_IF_MODE_DEPENDENT_ADDRESS(ADDR,LABEL) \
689: { if (GET_CODE (ADDR) == POST_INC || GET_CODE (ADDR) == PRE_DEC) \
690: goto LABEL; \
691: if (GET_CODE (ADDR) == PLUS) \
692: { if (CONSTANT_ADDRESS_P (XEXP (ADDR, 0)) \
693: && GET_CODE (XEXP (ADDR, 1)) == REG); \
694: else if (CONSTANT_ADDRESS_P (XEXP (ADDR, 1)) \
695: && GET_CODE (XEXP (ADDR, 0)) == REG); \
696: else goto LABEL; }}
697:
698: /* Specify the machine mode that this machine uses
699: for the index in the tablejump instruction. */
700: #define CASE_VECTOR_MODE HImode
701:
702: /* Define this if the case instruction expects the table
703: to contain offsets from the address of the table.
704: Do not define this if the table should contain absolute addresses. */
705: #define CASE_VECTOR_PC_RELATIVE
706:
707: /* Define this if the case instruction drops through after the table
708: when the index is out of range. Don't define it if the case insn
709: jumps to the default label instead. */
710: #define CASE_DROPS_THROUGH
711:
712: /* Specify the tree operation to be used to convert reals to integers. */
713: #define IMPLICIT_FIX_EXPR FIX_ROUND_EXPR
714:
715: /* This is the kind of divide that is easiest to do in the general case. */
716: #define EASY_DIV_EXPR TRUNC_DIV_EXPR
717:
718: /* Define this as 1 if `char' should by default be signed; else as 0. */
719: #define DEFAULT_SIGNED_CHAR 1
720:
721: /* This flag, if defined, says the same insns that convert to a signed fixnum
722: also convert validly to an unsigned one. */
723: #define FIXUNS_TRUNC_LIKE_FIX_TRUNC
724:
725: /* Max number of bytes we can move from memory to memory
726: in one reasonably fast instruction. */
727: #define MOVE_MAX 8
728:
729: /* Define this if zero-extension is slow (more than one real instruction). */
730: /* #define SLOW_ZERO_EXTEND */
731:
732: /* Nonzero if access to memory by bytes is slow and undesirable. */
733: #define SLOW_BYTE_ACCESS 0
734:
735: /* Define if shifts truncate the shift count
736: which implies one can omit a sign-extension or zero-extension
737: of a shift count. */
738: /* #define SHIFT_COUNT_TRUNCATED */
739:
1.1.1.4 root 740: /* Shift counts can be negative. */
741: #define NEGATIVE_SHIFT_COUNTS 1
742:
1.1 root 743: /* Value is 1 if truncating an integer of INPREC bits to OUTPREC bits
744: is done just by pretending it is already truncated. */
745: #define TRULY_NOOP_TRUNCATION(OUTPREC, INPREC) 1
746:
747: /* Specify the machine mode that pointers have.
748: After generation of rtl, the compiler makes no further distinction
749: between pointers and any other objects of this machine mode. */
750: #define Pmode SImode
751:
752: /* A function address in a call instruction
753: is a byte address (for indexing purposes)
754: so give the MEM rtx a byte's mode. */
755: #define FUNCTION_MODE QImode
756:
757: /* Compute the cost of computing a constant rtl expression RTX
758: whose rtx-code is CODE. The body of this macro is a portion
759: of a switch statement. If the code is computed here,
760: return it with a return statement. Otherwise, break from the switch. */
761:
762: #define CONST_COSTS(RTX,CODE) \
763: case CONST_INT: \
764: /* Constant zero is super cheap due to clr instruction. */ \
765: if (RTX == const0_rtx) return 0; \
766: if ((unsigned) INTVAL (RTX) < 077) return 1; \
767: case CONST: \
768: case LABEL_REF: \
769: case SYMBOL_REF: \
770: return 3; \
771: case CONST_DOUBLE: \
772: return 5;
773:
774: /*
775: * We can use the BSD C library routines for the gnulib calls that are
776: * still generated, since that's what they boil down to anyways.
777: */
778:
779: #define UDIVSI3_LIBCALL "*udiv"
780: #define UMODSI3_LIBCALL "*urem"
781:
782: /* Check a `double' value for validity for a particular machine mode. */
783:
784: /* note that it is very hard to accidently create a number that fits in a
785: double but not in a float, since their ranges are almost the same */
786: #define CHECK_FLOAT_VALUE(mode, d) \
787: if ((mode) == SFmode) \
788: { \
1.1.1.5 root 789: if ((d) > 1.7014117331926444e+38) \
1.1 root 790: { error ("magnitude of constant too large for `float'"); \
1.1.1.5 root 791: (d) = 1.7014117331926444e+38; } \
792: else if ((d) < -1.7014117331926444e+38) \
1.1 root 793: { error ("magnitude of constant too large for `float'"); \
1.1.1.5 root 794: (d) = -1.7014117331926444e+38; } \
1.1 root 795: else if (((d) > 0) && ((d) < 2.9387358770557188e-39)) \
796: { warning ("`float' constant truncated to zero"); \
797: (d) = 0.0; } \
798: else if (((d) < 0) && ((d) > -2.9387358770557188e-39)) \
799: { warning ("`float' constant truncated to zero"); \
800: (d) = 0.0; } \
801: }
802:
803: /* For future reference:
804: D Float: 9 bit, sign magnitude, excess 128 binary exponent
805: normalized 56 bit fraction, redundant bit not represented
806: approximately 16 decimal digits of precision
807:
808: The values to use if we trust decimal to binary conversions:
809: #define MAX_D_FLOAT 1.7014118346046923e+38
810: #define MIN_D_FLOAT .29387358770557188e-38
811:
812: G float: 12 bit, sign magnitude, excess 1024 binary exponent
813: normalized 53 bit fraction, redundant bit not represented
814: approximately 15 decimal digits precision
815:
816: The values to use if we trust decimal to binary conversions:
817: #define MAX_G_FLOAT .898846567431157e+308
818: #define MIN_G_FLOAT .556268464626800e-308
819: */
820:
821: /* Tell final.c how to eliminate redundant test instructions. */
822:
823: /* Here we define machine-dependent flags and fields in cc_status
824: (see `conditions.h'). No extra ones are needed for the vax. */
825:
826: /* Store in cc_status the expressions
827: that the condition codes will describe
828: after execution of an instruction whose pattern is EXP.
829: Do not alter them if the instruction would not alter the cc's. */
830:
831: #define NOTICE_UPDATE_CC(EXP, INSN) \
832: { if (GET_CODE (EXP) == SET) \
833: { if (GET_CODE (SET_SRC (EXP)) == CALL) \
834: CC_STATUS_INIT; \
835: else if (GET_CODE (SET_DEST (EXP)) != PC) \
836: { cc_status.flags = 0; \
837: cc_status.value1 = SET_DEST (EXP); \
838: cc_status.value2 = SET_SRC (EXP); } } \
839: else if (GET_CODE (EXP) == PARALLEL \
840: && GET_CODE (XVECEXP (EXP, 0, 0)) == SET \
841: && GET_CODE (SET_DEST (XVECEXP (EXP, 0, 0))) != PC) \
842: { cc_status.flags = 0; \
843: cc_status.value1 = SET_DEST (XVECEXP (EXP, 0, 0)); \
844: cc_status.value2 = SET_SRC (XVECEXP (EXP, 0, 0)); } \
845: /* PARALLELs whose first element sets the PC are aob, sob insns. \
846: They do change the cc's. So drop through and forget the cc's. */ \
847: else CC_STATUS_INIT; \
848: if (cc_status.value1 && GET_CODE (cc_status.value1) == REG \
849: && cc_status.value2 \
850: && reg_overlap_mentioned_p (cc_status.value1, cc_status.value2)) \
851: cc_status.value2 = 0; \
852: if (cc_status.value1 && GET_CODE (cc_status.value1) == MEM \
853: && cc_status.value2 \
854: && GET_CODE (cc_status.value2) == MEM) \
855: cc_status.value2 = 0; }
856: /* Actual condition, one line up, should be that value2's address
857: depends on value1, but that is too much of a pain. */
858:
859: #define OUTPUT_JUMP(NORMAL, FLOAT, NO_OV) \
860: { if (cc_status.flags & CC_NO_OVERFLOW) \
861: return NO_OV; \
862: return NORMAL; }
863:
864: /* Control the assembler format that we output. */
865:
866: /* Output at beginning of assembler file. */
867:
868: #define ASM_FILE_START(FILE) fprintf (FILE, "#NO_APP\n");
869:
870: /* Output to assembler file text saying following lines
871: may contain character constants, extra white space, comments, etc. */
872:
873: #define ASM_APP_ON "#APP\n"
874:
875: /* Output to assembler file text saying following lines
876: no longer contain unusual constructs. */
877:
878: #define ASM_APP_OFF "#NO_APP\n"
879:
880: /* Output before read-only data. */
881:
882: #define TEXT_SECTION_ASM_OP ".text"
883:
884: /* Output before writable data. */
885:
886: #define DATA_SECTION_ASM_OP ".data"
887:
888: /* How to refer to registers in assembler output.
889: This sequence is indexed by compiler's hard-register-number (see above). */
890:
891: #define REGISTER_NAMES \
892: {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", \
893: "r9", "r10", "r11", "ap", "fp", "sp", "pc"}
894:
895: /* This is BSD, so it wants DBX format. */
896:
897: #define DBX_DEBUGGING_INFO
898:
899: /* How to renumber registers for dbx and gdb.
900: Vax needs no change in the numeration. */
901:
902: #define DBX_REGISTER_NUMBER(REGNO) (REGNO)
903:
904: /* Do not break .stabs pseudos into continuations. */
905:
906: #define DBX_CONTIN_LENGTH 0
907:
908: /* This is the char to use for continuation (in case we need to turn
909: continuation back on). */
910:
911: #define DBX_CONTIN_CHAR '?'
912:
913: /* Don't use the `xsfoo;' construct in DBX output; this system
914: doesn't support it. */
915:
916: #define DBX_NO_XREFS
917:
918: /* Output the .stabs for a C `static' variable in the data section. */
919: #define DBX_STATIC_STAB_DATA_SECTION
920:
921: /* Vax specific: which type character is used for type double? */
922:
923: #define ASM_DOUBLE_CHAR (TARGET_G_FLOAT ? 'g' : 'd')
924:
925: /* This is how to output the definition of a user-level label named NAME,
926: such as the label on a static function or variable NAME. */
927:
928: #define ASM_OUTPUT_LABEL(FILE,NAME) \
929: do { assemble_name (FILE, NAME); fputs (":\n", FILE); } while (0)
930:
931: /* This is how to output a command to make the user-level label named NAME
932: defined for reference from other files. */
933:
934: #define ASM_GLOBALIZE_LABEL(FILE,NAME) \
935: do { fputs (".globl ", FILE); assemble_name (FILE, NAME); fputs ("\n", FILE);} while (0)
936:
937: /* This is how to output a reference to a user-level label named NAME. */
938:
939: #define ASM_OUTPUT_LABELREF(FILE,NAME) \
940: fprintf (FILE, "_%s", NAME)
941:
942: /* This is how to output an internal numbered label where
943: PREFIX is the class of label and NUM is the number within the class. */
944:
945: #define ASM_OUTPUT_INTERNAL_LABEL(FILE,PREFIX,NUM) \
946: fprintf (FILE, "%s%d:\n", PREFIX, NUM)
947:
948: /* This is how to store into the string LABEL
949: the symbol_ref name of an internal numbered label where
950: PREFIX is the class of label and NUM is the number within the class.
951: This is suitable for output with `assemble_name'. */
952:
953: #define ASM_GENERATE_INTERNAL_LABEL(LABEL,PREFIX,NUM) \
954: sprintf (LABEL, "*%s%d", PREFIX, NUM)
955:
956: /* This is how to output an assembler line defining a `double' constant.
957: It is .dfloat or .gfloat, depending. */
958:
959: #define ASM_OUTPUT_DOUBLE(FILE,VALUE) \
960: fprintf (FILE, "\t.%cfloat 0%c%.20e\n", ASM_DOUBLE_CHAR, \
961: ASM_DOUBLE_CHAR, (VALUE))
962:
963: /* This is how to output an assembler line defining a `float' constant. */
964:
965: #define ASM_OUTPUT_FLOAT(FILE,VALUE) \
966: fprintf (FILE, "\t.float 0f%.20e\n", (VALUE))
967:
968: /* This is how to output an assembler line defining an `int' constant. */
969:
970: #define ASM_OUTPUT_INT(FILE,VALUE) \
971: ( fprintf (FILE, "\t.long "), \
972: output_addr_const (FILE, (VALUE)), \
973: fprintf (FILE, "\n"))
974:
975: /* Likewise for `char' and `short' constants. */
976:
977: #define ASM_OUTPUT_SHORT(FILE,VALUE) \
978: ( fprintf (FILE, "\t.word "), \
979: output_addr_const (FILE, (VALUE)), \
980: fprintf (FILE, "\n"))
981:
982: #define ASM_OUTPUT_CHAR(FILE,VALUE) \
983: ( fprintf (FILE, "\t.byte "), \
984: output_addr_const (FILE, (VALUE)), \
985: fprintf (FILE, "\n"))
986:
987: /* This is how to output an assembler line for a numeric constant byte. */
988:
989: #define ASM_OUTPUT_BYTE(FILE,VALUE) \
990: fprintf (FILE, "\t.byte 0x%x\n", (VALUE))
991:
992: /* This is how to output an insn to push a register on the stack.
993: It need not be very fast code. */
994:
995: #define ASM_OUTPUT_REG_PUSH(FILE,REGNO) \
996: fprintf (FILE, "\tpushl %s\n", reg_names[REGNO])
997:
998: /* This is how to output an insn to pop a register from the stack.
999: It need not be very fast code. */
1000:
1001: #define ASM_OUTPUT_REG_POP(FILE,REGNO) \
1002: fprintf (FILE, "\tmovl (sp)+,%s\n", reg_names[REGNO])
1003:
1004: /* This is how to output an element of a case-vector that is absolute.
1005: (The Vax does not use such vectors,
1006: but we must define this macro anyway.) */
1007:
1008: #define ASM_OUTPUT_ADDR_VEC_ELT(FILE, VALUE) \
1009: fprintf (FILE, "\t.long L%d\n", VALUE)
1010:
1011: /* This is how to output an element of a case-vector that is relative. */
1012:
1013: #define ASM_OUTPUT_ADDR_DIFF_ELT(FILE, VALUE, REL) \
1014: fprintf (FILE, "\t.word L%d-L%d\n", VALUE, REL)
1015:
1016: /* This is how to output an assembler line
1017: that says to advance the location counter
1018: to a multiple of 2**LOG bytes. */
1019:
1020: #define ASM_OUTPUT_ALIGN(FILE,LOG) \
1021: fprintf (FILE, "\t.align %d\n", (LOG))
1022:
1023: /* This is how to output an assembler line
1024: that says to advance the location counter by SIZE bytes. */
1025:
1026: #define ASM_OUTPUT_SKIP(FILE,SIZE) \
1.1.1.3 root 1027: fprintf (FILE, "\t.space %u\n", (SIZE))
1.1 root 1028:
1029: /* This says how to output an assembler line
1030: to define a global common symbol. */
1031:
1032: #define ASM_OUTPUT_COMMON(FILE, NAME, SIZE, ROUNDED) \
1033: ( fputs (".comm ", (FILE)), \
1034: assemble_name ((FILE), (NAME)), \
1.1.1.3 root 1035: fprintf ((FILE), ",%u\n", (ROUNDED)))
1.1 root 1036:
1037: /* This says how to output an assembler line
1038: to define a local common symbol. */
1039:
1040: #define ASM_OUTPUT_LOCAL(FILE, NAME, SIZE, ROUNDED) \
1041: ( fputs (".lcomm ", (FILE)), \
1042: assemble_name ((FILE), (NAME)), \
1043: fprintf ((FILE), ",%d\n", (ROUNDED)))
1044:
1045: /* Store in OUTPUT a string (made with alloca) containing
1046: an assembler-name for a local static variable named NAME.
1047: LABELNO is an integer which is different for each call. */
1048:
1049: #define ASM_FORMAT_PRIVATE_NAME(OUTPUT, NAME, LABELNO) \
1050: ( (OUTPUT) = (char *) alloca (strlen ((NAME)) + 10), \
1051: sprintf ((OUTPUT), "%s.%d", (NAME), (LABELNO)))
1052:
1053: /* Define the parentheses used to group arithmetic operations
1054: in assembler code. */
1055:
1056: #define ASM_OPEN_PAREN "("
1057: #define ASM_CLOSE_PAREN ")"
1058:
1059: /* Define results of standard character escape sequences. */
1060: #define TARGET_BELL 007
1061: #define TARGET_BS 010
1062: #define TARGET_TAB 011
1063: #define TARGET_NEWLINE 012
1064: #define TARGET_VT 013
1065: #define TARGET_FF 014
1066: #define TARGET_CR 015
1067:
1068: /* Print an instruction operand X on file FILE.
1069: CODE is the code from the %-spec that requested printing this operand;
1070: if `%z3' was used to print operand 3, then CODE is 'z'.
1071: On the Vax, the only code used is `#', indicating that either
1072: `d' or `g' should be printed, depending on whether we're using dfloat
1073: or gfloat. */
1074:
1075: #define PRINT_OPERAND_PUNCT_VALID_P(CODE) \
1076: ((CODE) == '#')
1077:
1078: #define PRINT_OPERAND(FILE, X, CODE) \
1079: { if (CODE == '#') fputc (ASM_DOUBLE_CHAR, FILE); \
1080: else if (GET_CODE (X) == REG) \
1081: fprintf (FILE, "%s", reg_names[REGNO (X)]); \
1082: else if (GET_CODE (X) == MEM) \
1083: output_address (XEXP (X, 0)); \
1084: else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) != DImode) \
1085: { union { double d; int i[2]; } u; \
1086: u.i[0] = CONST_DOUBLE_LOW (X); u.i[1] = CONST_DOUBLE_HIGH (X); \
1087: fprintf (FILE, "$0%c%.20e", ASM_DOUBLE_CHAR, u.d); } \
1088: else { putc ('$', FILE); output_addr_const (FILE, X); }}
1089:
1090: /* Print a memory operand whose address is X, on file FILE.
1091: This uses a function in output-vax.c. */
1092:
1093: #define PRINT_OPERAND_ADDRESS(FILE, ADDR) \
1094: print_operand_address (FILE, ADDR)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.