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