|
|
1.1 root 1: /* Definitions of target machine for GNU compiler. SEQUENT NS32000 version.
2: Copyright (C) 1987 Free Software Foundation, Inc.
3: Contributed by Michael Tiemann ([email protected])
4:
5: This file is part of GNU CC.
6:
7: GNU CC is free software; you can redistribute it and/or modify
8: it under the terms of the GNU General Public License as published by
9: the Free Software Foundation; either version 2, or (at your option)
10: any later version.
11:
12: GNU CC is distributed in the hope that it will be useful,
13: but WITHOUT ANY WARRANTY; without even the implied warranty of
14: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: GNU General Public License for more details.
16:
17: You should have received a copy of the GNU General Public License
18: along with GNU CC; see the file COPYING. If not, write to
19: the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
20:
21: /* Two flags to control how addresses are printed in assembler insns. */
22: #define SEQUENT_ADDRESS_BUG 1
23: #define SEQUENT_BASE_REGS
24:
25: #include "ns32k.h"
26:
27: /* This is BSD, so it wants DBX format. */
28: #define DBX_DEBUGGING_INFO
29:
30: /* Sequent has some changes in the format of DBX symbols. */
31: #define DBX_NO_XREFS 1
32:
33: /* Don't split DBX symbols into continuations. */
34: #define DBX_CONTIN_LENGTH 0
35:
36: #define TARGET_DEFAULT 9 /* 32332 with 32081 (guessing) */
37:
38: /* Print subsidiary information on the compiler version in use. */
39: #undef TARGET_VERSION
40: #define TARGET_VERSION fprintf (stderr, " (32000, Sequent syntax)");
41:
42: #undef CPP_PREDEFINES
43: #define CPP_PREDEFINES "-Dns32000 -Dsequent -Dunix"
44:
45: /* Link with libg.a when debugging, for dbx's sake. */
46:
47: #define LIB_SPEC "%{g:-lg} %{!p:%{!pg:-lc}}%{p:-lc_p}%{pg:-lc_p} "
48:
49: /* This is how to align the code that follows an unconditional branch.
50: Don't define it, since it confuses the assembler (we hear). */
51:
52: #undef ASM_OUTPUT_ALIGN_CODE
53:
54: /* Assember pseudo-op for shared data segment. */
55: #define SHARED_SECTION_ASM_OP ".shdata"
56:
57: /* Control how stack adjust insns are output. */
58: #define SEQUENT_ADJUST_STACK
59:
60: /* %$ means print the prefix for an immediate operand.
61: On the sequent, no prefix is used for such. */
62:
63: #undef PRINT_OPERAND
64: #define PRINT_OPERAND(FILE, X, CODE) \
65: { if (CODE == '$') ; \
66: else if (CODE == '?'); \
67: else if (GET_CODE (X) == REG) \
68: fprintf (FILE, "%s", reg_names[REGNO (X)]); \
69: else if (GET_CODE (X) == MEM) \
70: { \
71: rtx xfoo; \
72: xfoo = XEXP (X, 0); \
73: switch (GET_CODE (xfoo)) \
74: { \
75: case MEM: \
76: if (GET_CODE (XEXP (xfoo, 0)) == REG) \
77: if (REGNO (XEXP (xfoo, 0)) == STACK_POINTER_REGNUM) \
78: fprintf (FILE, "0(0(sp))"); \
79: else fprintf (FILE, "0(0(%s))", \
80: reg_names[REGNO (XEXP (xfoo, 0))]); \
81: else \
82: { \
83: fprintf (FILE, "0("); \
84: output_address (xfoo); \
85: putc (')', FILE); \
86: } \
87: break; \
88: case REG: \
89: fprintf (FILE, "0(%s)", reg_names[REGNO (xfoo)]); \
90: break; \
91: case PRE_DEC: \
92: case POST_INC: \
93: fprintf (FILE, "tos"); \
94: break; \
95: case CONST_INT: \
96: fprintf (FILE, "@%d", INTVAL (xfoo)); \
97: break; \
98: default: \
99: output_address (xfoo); \
100: break; \
101: } \
102: } \
103: else if (GET_CODE (X) == CONST_DOUBLE && GET_MODE (X) != DImode) \
104: if (GET_MODE (X) == DFmode) \
105: { union { double d; int i[2]; } u; \
106: u.i[0] = CONST_DOUBLE_LOW (X); u.i[1] = CONST_DOUBLE_HIGH (X); \
107: fprintf (FILE, "0d%.20e", u.d); } \
108: else { union { double d; int i[2]; } u; \
109: u.i[0] = CONST_DOUBLE_LOW (X); u.i[1] = CONST_DOUBLE_HIGH (X); \
110: fprintf (FILE, "0f%.20e", u.d); } \
111: else output_addr_const (FILE, X); }
112:
113: #undef PRINT_OPERAND_ADDRESS
114: #define PRINT_OPERAND_ADDRESS(FILE, ADDR) print_operand_address(FILE, ADDR)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.