|
|
1.1 root 1: /* m-targon31 file template.
2: Copyright (C) 1985, 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 three symbols give information on
22: the size of various data types. */
23:
24: #define SHORTBITS 16 /* Number of bits in a short */
25:
26: #define INTBITS 32 /* Number of bits in an int */
27:
28: #define LONGBITS 32 /* Number of bits in a long */
29:
30: /* Define BIG_ENDIAN iff lowest-numbered byte in a word
31: is the most significant byte. */
32:
33: #define BIG_ENDIAN
34:
35: /* Define NO_ARG_ARRAY if you cannot take the address of the first of a
36: * group of arguments and treat it as an array of the arguments. */
37:
38: /* #define NO_ARG_ARRAY */
39:
40: /* Define WORD_MACHINE if addresses and such have
41: * to be corrected before they can be used as byte counts. */
42:
43: #define WORD_MACHINE
44:
45: /* Define how to take a char and sign-extend into an int.
46: On machines where char is signed, this is a no-op. */
47:
48: #define SIGN_EXTEND_CHAR(c) (c)
49:
50: /* Now define a symbol for the cpu type, if your compiler
51: does not define it automatically:
52: vax, m68000, ns16000, pyramid, orion, tahoe and APOLLO
53: are the ones defined so far. */
54:
55: /* #define m68k is defined by the Compiler */
56: /* #define m68000 */
57:
58: /* Use type int rather than a union, to represent Lisp_Object */
59: /* This is desirable for most machines. */
60:
61: #define NO_UNION_TYPE
62:
63: /* Define EXPLICIT_SIGN_EXTEND if XINT must explicitly sign-extend
64: the 24-bit bit field into an int. In other words, if bit fields
65: are always unsigned.
66:
67: If you use NO_UNION_TYPE, this flag does not matter. */
68:
69: #define EXPLICIT_SIGN_EXTEND
70:
71: /* Data type of load average, as read out of kmem. */
72:
73: /* #define LOAD_AVE_TYPE double */
74:
75: /* Convert that into an integer that is 100 for a load average of 1.0 */
76:
77: #define LOAD_AVE_CVT(x) (int) (((double) (x)) * 100.0)
78:
79: /* Define CANNOT_DUMP on machines where unexec does not work.
80: Then the function dump-emacs will not be defined
81: and temacs will do (load "loadup") automatically unless told otherwise. */
82:
83: /* #define CANNOT_DUMP */
84:
85: /* Define VIRT_ADDR_VARIES if the virtual addresses of
86: pure and impure space as loaded can vary, and even their
87: relative order cannot be relied on.
88:
89: Otherwise Emacs assumes that text space precedes data space,
90: numerically. */
91:
92: /* #define VIRT_ADDR_VARIES */
93:
94: /* Define C_ALLOCA if this machine does not support a true alloca
95: and the one written in C should be used instead.
96: Define HAVE_ALLOCA to say that the system provides a properly
97: working alloca function and it should be used.
98: Define neither one if an assembler-language alloca
99: in the file alloca.s should be used. */
100:
101: /* #define C_ALLOCA */
102: /* #define HAVE_ALLOCA */
103: #ifdef __GNUC__
104: #define SYSTEM_MALLOC
105: #define HAVE_ALLOCA
106: #define alloca(a) __builtin_alloca(a)
107: #endif
108:
109: #define SWITCH_ENUM_BUG 1
110:
111: /* #define NO_REMAP */
112: /* NO_REMAP was an alternative to defining SEGMENT_MASK. */
113: #define SEGMENT_MASK 0xffff
114:
115: /* Some additional system facilities. */
116: #define HAVE_SYSVIPC
117: #define HAVE_PTYS
118: #define HAVE_SOCKETS
119: #define BSTRING
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.