Return to m-dual.h CVS log

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

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

1.1     ! root        1: /* m- file for Dual machines using unisoft port.
        !             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: /* Define BIG_ENDIAN iff lowest-numbered byte in a word
        !            32:    is the most significant byte.  */
        !            33: 
        !            34: #define BIG_ENDIAN
        !            35: 
        !            36: /* XINT must explicitly sign-extend */
        !            37: 
        !            38: #define EXPLICIT_SIGN_EXTEND
        !            39: 
        !            40: /* Define how to take a char and sign-extend into an int.
        !            41:    On machines where char is signed, this is a no-op.  */
        !            42: 
        !            43: #define SIGN_EXTEND_CHAR(c) (c)
        !            44: 
        !            45: /* Use type int rather than a union, to represent Lisp_Object */
        !            46: 
        !            47: #define NO_UNION_TYPE
        !            48: 
        !            49: /* Now define a symbol for the cpu type, if your compiler
        !            50:    does not define it automatically:
        !            51:    vax, m68000, ns16000 are the ones defined so far.  */
        !            52: 
        !            53: #ifndef m68000
        !            54: #define m68000
        !            55: #endif
        !            56: 
        !            57: /* Data type of load average, as read out of kmem.  */
        !            58: /* These are commented out since it does not really work in uniplus */
        !            59:   
        !            60: /* #define LOAD_AVE_TYPE long */
        !            61: 
        !            62: /* Convert that into an integer that is 100 for a load average of 1.0  */
        !            63: 
        !            64: /* #define LOAD_AVE_CVT(x) (int) (((double) (x)) * 100.0) */
        !            65: 
        !            66: /* Change some things to avoid bugs in compiler */
        !            67: 
        !            68: #define SWITCH_ENUM_BUG 1

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