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