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