![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to m-convex.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [CSRG BSD Unix] / 43BSDReno / contrib / emacs-18.55 / src|
Return to m-convex.h CVS log | Up to [CSRG BSD Unix] / 43BSDReno / contrib / emacs-18.55 / src |
1.1 root 1: /* m- file for convex C1.
2: Copyright (C) 1987, 1989 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: /* #define 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: /* #define 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:
54: /* convex already defined... */
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: /* crt0.c should use the vax-bsd style of entry, with no dummy args. */
62:
63: #define CRT0_DUMMIES
64:
65: /* crt0.c should define a symbol `start' and do .globl with a dot. */
66:
67: #define DOT_GLOBAL_START
68:
69: /* Data type of load average, as read out of kmem. */
70:
71: #define LOAD_AVE_TYPE double
72:
73: /* Convert that into an integer that is 100 for a load average of 1.0 */
74:
75: #define LOAD_AVE_CVT(x) (int) ((x) * 100.0)
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 text space precedes data space,
88: numerically. */
89:
90: /* #define 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: #define HAVE_ALLOCA
101:
102: #ifdef __GNUC__
103: #define alloca __builtin_alloca
104: #endif
105:
106: /* Define NO_REMAP if memory segmentation makes it not work well
107: to change the boundary between the text section and data section
108: when Emacs is dumped. If you define this, the preloaded Lisp
109: code will not be sharable; but that's better than failing completely. */
110:
111: /* #define NO_REMAP */
112:
113: /* Addresses on the Convex have the high bit set. */
114:
115: #define DATA_SEG_BITS 0x80000000
116:
117: /* Right shift is logical shift, so use this to sign-extend a lisp int. */
118:
119: #define XINT(a) ((int) ((((a) & 0x00ffffff) ^ 0x00800000) - 0x00800000))
120:
121: /* Convex uses a special version of unexec. */
122:
123: #define UNEXEC unexconvex.o
124:
125: /* you gotta define 'COFF' for post 6.1 unexec. */
126:
127: #define COFF
128: #define TEXT_START 0x80001000
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.