|
446
|
1 /* RTPC machine dependent defines
|
|
|
2 Copyright (C) 1986 Free Software Foundation, Inc.
|
|
|
3
|
|
|
4 This file is part of GNU Emacs.
|
|
|
5
|
|
|
6 GNU Emacs 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 Emacs 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 Emacs; see the file COPYING. If not, write to
|
|
|
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
19
|
|
|
20
|
|
|
21 /* The following line tells the configuration script what sort of
|
|
|
22 operating system this machine is likely to run.
|
|
|
23 USUAL-OPSYS="bsd4-2" */
|
|
|
24
|
|
|
25 /* The following three symbols give information on
|
|
|
26 the size of various data types. */
|
|
|
27
|
|
|
28 #define SHORTBITS 16 /* Number of bits in a short */
|
|
|
29
|
|
|
30 #define INTBITS 32 /* Number of bits in an int */
|
|
|
31
|
|
|
32 #define LONGBITS 32 /* Number of bits in a long */
|
|
|
33
|
|
|
34 /* Define BIG_ENDIAN iff lowest-numbered byte in a word
|
|
|
35 is the most significant byte. */
|
|
|
36
|
|
|
37 #define BIG_ENDIAN
|
|
|
38
|
|
|
39 /* Define NO_ARG_ARRAY if you cannot take the address of the first of a
|
|
|
40 * group of arguments and treat it as an array of the arguments. */
|
|
|
41
|
|
|
42 #define NO_ARG_ARRAY
|
|
|
43
|
|
|
44 /* Define WORD_MACHINE if addresses and such have
|
|
|
45 * to be corrected before they can be used as byte counts. */
|
|
|
46
|
|
|
47 #define WORD_MACHINE
|
|
|
48
|
|
|
49 /* Now define a symbol for the cpu type, if your compiler
|
|
|
50 does not define it automatically. */
|
|
|
51
|
|
|
52 #define ibmrt
|
|
|
53 #define romp /* unfortunately old include files are hanging around. */
|
|
|
54
|
|
|
55 /* Use type int rather than a union, to represent Lisp_Object */
|
|
|
56 /* This is desirable for most machines. */
|
|
|
57
|
|
|
58 #define NO_UNION_TYPE
|
|
|
59
|
|
|
60 /* Define EXPLICIT_SIGN_EXTEND if XINT must explicitly sign-extend
|
|
|
61 the 24-bit bit field into an int. In other words, if bit fields
|
|
|
62 are always unsigned.
|
|
|
63
|
|
|
64 If you use NO_UNION_TYPE, this flag does not matter. */
|
|
|
65
|
|
|
66 #define EXPLICIT_SIGN_EXTEND
|
|
|
67
|
|
|
68 /* Data type of load average, as read out of kmem. */
|
|
|
69
|
|
|
70 #define LOAD_AVE_TYPE double /* For AIS (sysV) */
|
|
|
71
|
|
|
72 /* Convert that into an integer that is 100 for a load average of 1.0 */
|
|
|
73
|
|
|
74 #define LOAD_AVE_CVT(x) (int) (((double) (x)) * 100.0)
|
|
|
75
|
|
|
76 /* Define CANNOT_DUMP on machines where unexec does not work.
|
|
|
77 Then the function dump-emacs will not be defined
|
|
|
78 and temacs will do (load "loadup") automatically unless told otherwise. */
|
|
|
79
|
|
|
80 /* #define CANNOT_DUMP */
|
|
|
81
|
|
|
82 /* Define VIRT_ADDR_VARIES if the virtual addresses of
|
|
|
83 pure and impure space as loaded can vary, and even their
|
|
|
84 relative order cannot be relied on.
|
|
|
85
|
|
|
86 Otherwise Emacs assumes that text space precedes data space,
|
|
|
87 numerically. */
|
|
|
88
|
|
|
89 #undef VIRT_ADDR_VARIES
|
|
|
90
|
|
|
91 /* Define C_ALLOCA if this machine does not support a true alloca
|
|
|
92 and the one written in C should be used instead.
|
|
|
93 Define HAVE_ALLOCA to say that the system provides a properly
|
|
|
94 working alloca function and it should be used.
|
|
|
95 Define neither one if an assembler-language alloca
|
|
|
96 in the file alloca.s should be used. */
|
|
|
97
|
|
|
98 #define HAVE_ALLOCA
|
|
|
99
|
|
|
100 /* The data segment in this machine starts at a fixed address.
|
|
|
101 An address of data cannot be stored correctly in a Lisp object;
|
|
|
102 we always lose the high bits. We must tell XPNTR to add them back. */
|
|
|
103
|
|
|
104 #define DATA_SEG_BITS 0x10000000
|
|
|
105 #define DATA_START 0x10000000
|
|
|
106
|
|
|
107 /* The text segment always starts at a fixed address.
|
|
|
108 This way we don't need to have a label _start defined. */
|
|
|
109 #define TEXT_START 0
|
|
|
110
|
|
|
111 #define VALBITS 26
|
|
|
112 #define GCTYPEBITS 5
|
|
|
113
|
|
|
114 /* Taking a pointer to a char casting it as int pointer */
|
|
|
115 /* and then taking the int which the int pointer points to */
|
|
|
116 /* is practically guaranteed to give erroneous results */
|
|
|
117
|
|
|
118 #define NEED_ERRNO
|
|
|
119
|
|
|
120 #define SKTPAIR
|
|
|
121
|
|
|
122 /* BSD has BSTRING. */
|
|
|
123
|
|
|
124 #define BSTRING
|
|
|
125
|
|
|
126 /* Special switches to give the C compiler. */
|
|
|
127
|
|
|
128 #define C_SWITCH_MACHINE -Dalloca=_Alloca
|
|
|
129
|
|
|
130 /* Don't attempt to relabel some of the data as text when dumping.
|
|
|
131 It does not work because their virtual addresses are not consecutive.
|
|
|
132 This enables us to use the standard crt0.o. */
|
|
|
133
|
|
|
134 #define NO_REMAP
|
