|
|
1.1 root 1: /* m- file for Cydrome's CYDRA 5 mini super computer
2: Copyright (C) 1988 Free Software Foundation, Inc.
3:
4: This file is part of GNU Emacs.
5:
6: GNU Emacs is distributed in the hope that it will be useful,
7: but WITHOUT ANY WARRANTY. No author or distributor
8: accepts responsibility to anyone for the consequences of using it
9: or for whether it serves any particular purpose or works at all,
10: unless he says so in writing. Refer to the GNU Emacs General Public
11: License for full details.
12:
13: Everyone is granted permission to copy, modify and redistribute
14: GNU Emacs, but only under the conditions described in the
15: GNU Emacs General Public License. A copy of this license is
16: supposed to have been given to you along with GNU Emacs so you
17: can know your rights and responsibilities. It should be in a
18: file named COPYING. Among other things, the copyright notice
19: and this notice must be preserved on all copies. */
20:
21:
22: /* The following three symbols give information on
23: the size of various data types. */
24:
25: #define SHORTBITS 16 /* Number of bits in a short */
26:
27: #define INTBITS 32 /* Number of bits in an int */
28:
29: #define LONGBITS 32 /* Number of bits in a long */
30:
31: /* Define BIG_ENDIAN iff lowest-numbered byte in a word
32: is the most significant byte. */
33:
34: #define BIG_ENDIAN
35:
36: /* Define NO_ARG_ARRAY if you cannot take the address of the first of a
37: * group of arguments and treat it as an array of the arguments. */
38:
39: #undef NO_ARG_ARRAY
40:
41: /* Define WORD_MACHINE if addresses and such have
42: * to be corrected before they can be used as byte counts. */
43:
44: #undef WORD_MACHINE
45:
46: /* Define how to take a char and sign-extend into an int.
47: On machines where char is signed, this is a no-op. */
48:
49: #define SIGN_EXTEND_CHAR(c) (c)
50:
51: /* Now define a symbol for the cpu type, if your compiler
52: does not define it automatically:
53: Ones defined so far include vax, m68000, ns16000, pyramid,
54: orion, tahoe, APOLLO and many others */
55:
56: /* Use type int rather than a union, to represent Lisp_Object */
57: /* This is desirable for most machines. */
58:
59: #define NO_UNION_TYPE
60:
61: /* Define EXPLICIT_SIGN_EXTEND if XINT must explicitly sign-extend
62: the 24-bit bit field into an int. In other words, if bit fields
63: are always unsigned.
64:
65: If you use NO_UNION_TYPE, this flag does not matter. */
66:
67: #define EXPLICIT_SIGN_EXTEND
68:
69: /* Data type of load average, as read out of kmem. */
70:
71: #define LOAD_AVE_TYPE long
72:
73: /* Convert that into an integer that is 100 for a load average of 1.0 */
74:
75: #define LOAD_AVE_CVT(x) x
76:
77: /* Define CANNOT_DUMP on machines where unexec does not work.
78: Then the function dump-emacs will not be defined
79: and temacs will do (load "loadup") automatically unless told otherwise. */
80:
81: /*#define CANNOT_DUMP*/
82:
83: /* Define VIRT_ADDR_VARIES if the virtual addresses of
84: pure and impure space as loaded can vary, and even their
85: relative order cannot be relied on.
86:
87: Otherwise Emacs assumes that data space precedes text space,
88: numerically. */
89:
90: #undef VIRT_ADDR_VARIES
91:
92: /* Define C_ALLOCA if this machine does not support a true alloca
93: and the one written in C should be used instead.
94: Define HAVE_ALLOCA to say that the system provides a properly
95: working alloca function and it should be used.
96: Define neither one if an assembler-language alloca
97: in the file alloca.s should be used. */
98:
99: #define C_ALLOCA
100: #undef HAVE_ALLOCA
101:
102: /* The data segment in this machine always starts at address 0x10000000.
103: An address of data cannot be stored correctly in a Lisp object;
104: we always lose the high bits. We must tell XPNTR to add them back. */
105:
106: #define DATA_SEG_BITS 0x20000000
107: #define DATA_START 0x20000000
108:
109: /* Define NO_REMAP if memory segmentation makes it not work well
110: to change the boundary between the text section and data section
111: when Emacs is dumped. If you define this, the preloaded Lisp
112: code will not be sharable; but that's better than failing completely. */
113:
114: #define NO_REMAP
115: #define BROKEN_FIONREAD /* We son't even have it */
116: #define LIBS_MACHINE -lsocket -lnsl
117:
118: /* Stack grows downward in memory. */
119: #define STACK_DIRECTION -1
120:
121: /* The data section in a coff file must be aligned in the file. */
122: #define DATA_SECTION_ALIGNMENT 0xFFF
123:
124: /* Compiler won't allow switch (x) when x is an enum. */
125: #define SWITCH_ENUM_BUG
126:
127:
128: /* Explain how pty filenames work. */
129:
130: #define PTY_ITERATION for (i = 47; i >= 0; i--)
131: #define PTY_NAME_SPRINTF sprintf (ptyname, "/dev/pty%03x", i);
132: #define PTY_TTY_NAME_SPRINTF sprintf (ptyname, "/dev/ptm%03x", i);
133:
134: /* We can't do interrupt-driven input, so don't let user try. */
135:
136: #undef SIGIO
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.