Annotation of kernel/bsd/i386/endian.h, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
                      3:  *
                      4:  * @APPLE_LICENSE_HEADER_START@
                      5:  * 
                      6:  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
                      7:  * Reserved.  This file contains Original Code and/or Modifications of
                      8:  * Original Code as defined in and that are subject to the Apple Public
                      9:  * Source License Version 1.1 (the "License").  You may not use this file
                     10:  * except in compliance with the License.  Please obtain a copy of the
                     11:  * License at http://www.apple.com/publicsource and read it before using
                     12:  * this file.
                     13:  * 
                     14:  * The Original Code and all software distributed under the License are
                     15:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
                     16:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
                     17:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
                     18:  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
                     19:  * License for the specific language governing rights and limitations
                     20:  * under the License.
                     21:  * 
                     22:  * @APPLE_LICENSE_HEADER_END@
                     23:  */
                     24: 
                     25: /*
                     26:  * Copyright 1995 NeXT Computer, Inc. All rights reserved.
                     27:  */
                     28: /*
                     29:  * Copyright (c) 1987, 1991, 1993
                     30:  *     The Regents of the University of California.  All rights reserved.
                     31:  *
                     32:  * Redistribution and use in source and binary forms, with or without
                     33:  * modification, are permitted provided that the following conditions
                     34:  * are met:
                     35:  * 1. Redistributions of source code must retain the above copyright
                     36:  *    notice, this list of conditions and the following disclaimer.
                     37:  * 2. Redistributions in binary form must reproduce the above copyright
                     38:  *    notice, this list of conditions and the following disclaimer in the
                     39:  *    documentation and/or other materials provided with the distribution.
                     40:  * 3. All advertising materials mentioning features or use of this software
                     41:  *    must display the following acknowledgement:
                     42:  *     This product includes software developed by the University of
                     43:  *     California, Berkeley and its contributors.
                     44:  * 4. Neither the name of the University nor the names of its contributors
                     45:  *    may be used to endorse or promote products derived from this software
                     46:  *    without specific prior written permission.
                     47:  *
                     48:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
                     49:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
                     50:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
                     51:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
                     52:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
                     53:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
                     54:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
                     55:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
                     56:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
                     57:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
                     58:  * SUCH DAMAGE.
                     59:  *
                     60:  *     @(#)endian.h    8.1 (Berkeley) 6/11/93
                     61:  */
                     62: 
                     63: #ifndef _I386__ENDIAN_H_
                     64: #define        _I386__ENDIAN_H_
                     65: 
                     66: /*
                     67:  * Define _NOQUAD if the compiler does NOT support 64-bit integers.
                     68:  */
                     69: /* #define _NOQUAD */
                     70: 
                     71: /*
                     72:  * Define the order of 32-bit words in 64-bit words.
                     73:  */
                     74: #define _QUAD_HIGHWORD 1
                     75: #define _QUAD_LOWWORD 0
                     76: 
                     77: #if    defined(KERNEL) || !defined(_POSIX_SOURCE)
                     78: /*
                     79:  * Definitions for byte order, according to byte significance from low
                     80:  * address to high.
                     81:  */
                     82: #define        LITTLE_ENDIAN   1234    /* LSB first: i386, vax */
                     83: #define        BIG_ENDIAN      4321    /* MSB first: 68000, ibm, net */
                     84: #define        PDP_ENDIAN      3412    /* LSB first in word, MSW first in long */
                     85: 
                     86: #define        BYTE_ORDER      LITTLE_ENDIAN
                     87: 
                     88: #include <sys/cdefs.h>
                     89: 
                     90: __BEGIN_DECLS
                     91: unsigned long  htonl __P((unsigned long));
                     92: unsigned short htons __P((unsigned short));
                     93: unsigned long  ntohl __P((unsigned long));
                     94: unsigned short ntohs __P((unsigned short));
                     95: __END_DECLS
                     96: 
                     97: /*
                     98:  * Macros for network/external number representation conversion.
                     99:  */
                    100: #if BYTE_ORDER == BIG_ENDIAN && !defined(lint)
                    101: #define        ntohl(x)        (x)
                    102: #define        ntohs(x)        (x)
                    103: #define        htonl(x)        (x)
                    104: #define        htons(x)        (x)
                    105: 
                    106: #define        NTOHL(x)        (x)
                    107: #define        NTOHS(x)        (x)
                    108: #define        HTONL(x)        (x)
                    109: #define        HTONS(x)        (x)
                    110: 
                    111: #else
                    112: #include <machine/byte_order.h>
                    113:  
                    114: #define ntohl(x)       NXSwapBigLongToHost(x)
                    115: #define ntohs(x)       NXSwapBigShortToHost(x)
                    116: #define htonl(x)       NXSwapHostLongToBig(x)
                    117: #define htons(x)       NXSwapHostShortToBig(x)
                    118: 
                    119: #define        NTOHL(x)        (x) = ntohl((u_long)x)
                    120: #define        NTOHS(x)        (x) = ntohs((u_short)x)
                    121: #define        HTONL(x)        (x) = htonl((u_long)x)
                    122: #define        HTONS(x)        (x) = htons((u_short)x)
                    123: #endif
                    124: #endif /* defined(KERNEL) || !defined(_POSIX_SOURCE) */
                    125: #endif /* !_I386__ENDIAN_H_ */

unix.superglobalmegacorp.com

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