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