Return to m-apollo.h CVS log

Up to [CSRG BSD Unix] / 43BSD / contrib / emacs / src

Annotation of 43BSD/contrib/emacs/src/m-apollo.h, revision 1.1

1.1     ! root        1: /* m- file for Apollo machine.
        !             2:    Copyright (C) 1985 Richard M. Stallman.
        !             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: /* 68000 has lowest-numbered byte as most significant */
        !            32: 
        !            33: #define BIG_ENDIAN
        !            34: 
        !            35: /* Define how to take a char and sign-extend into an int.
        !            36:    On machines where char is signed, this is a no-op.  */
        !            37: 
        !            38: #define SIGN_EXTEND_CHAR(c) (c)
        !            39: 
        !            40: /* Say this machine is a 68000 */
        !            41: 
        !            42: /* #define m68000 */   /* Done by the C compiler */
        !            43: 
        !            44: #define APOLLO
        !            45: 
        !            46: /* Use type int rather than a union, to represent Lisp_Object */
        !            47: 
        !            48: #define NO_UNION_TYPE
        !            49: 
        !            50: /* Do not define LOAD_AVE_TYPE or LOAD_AVE_CVT
        !            51:    since there is no /dev/kmem */
        !            52: 
        !            53: /* Define CANNOT_DUMP because it is impossible to do unexec.  */
        !            54: 
        !            55: #define CANNOT_DUMP
        !            56: 
        !            57: /* Define VIRT_ADDR_VARIES because the virtual addresses of
        !            58:    pure and impure space as loaded can vary, and even their
        !            59:    relative order cannot be relied on.  */
        !            60: 
        !            61: #define VIRT_ADDR_VARIES
        !            62: 
        !            63: /* Define HAVE_ALLOCA because we use the system's version of alloca.  */
        !            64: 
        !            65: #define HAVE_ALLOCA
        !            66: 
        !            67: /* DN460 has a 28 bit virtual address space, and 26 bits are often used */
        !            68: 
        !            69: #define VALBITS 26
        !            70: #define GCTYPEBITS 5

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.