|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1987, 1991 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms, with or without ! 6: * modification, are permitted provided that the following conditions ! 7: * are met: ! 8: * 1. Redistributions of source code must retain the above copyright ! 9: * notice, this list of conditions and the following disclaimer. ! 10: * 2. Redistributions in binary form must reproduce the above copyright ! 11: * notice, this list of conditions and the following disclaimer in the ! 12: * documentation and/or other materials provided with the distribution. ! 13: * 3. All advertising materials mentioning features or use of this software ! 14: * must display the following acknowledgement: ! 15: * This product includes software developed by the University of ! 16: * California, Berkeley and its contributors. ! 17: * 4. Neither the name of the University nor the names of its contributors ! 18: * may be used to endorse or promote products derived from this software ! 19: * without specific prior written permission. ! 20: * ! 21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 31: * SUCH DAMAGE. ! 32: * ! 33: * @(#)endian.h 7.7 (Berkeley) 4/3/91 ! 34: */ ! 35: ! 36: /* ! 37: * Definitions for byte order, according to byte significance from low ! 38: * address to high. ! 39: */ ! 40: #define LITTLE_ENDIAN 1234 /* LSB first: i386, vax */ ! 41: #define BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */ ! 42: #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */ ! 43: ! 44: #define BYTE_ORDER BIG_ENDIAN ! 45: ! 46: #ifndef KERNEL ! 47: #include <sys/cdefs.h> ! 48: #endif ! 49: ! 50: __BEGIN_DECLS ! 51: unsigned long htonl __P((unsigned long)); ! 52: unsigned short htons __P((unsigned short)); ! 53: unsigned long ntohl __P((unsigned long)); ! 54: unsigned short ntohs __P((unsigned short)); ! 55: __END_DECLS ! 56: ! 57: /* ! 58: * Macros for network/external number representation conversion. ! 59: */ ! 60: #if BYTE_ORDER == BIG_ENDIAN && !defined(lint) ! 61: #define ntohl(x) (x) ! 62: #define ntohs(x) (x) ! 63: #define htonl(x) (x) ! 64: #define htons(x) (x) ! 65: ! 66: #define NTOHL(x) (x) ! 67: #define NTOHS(x) (x) ! 68: #define HTONL(x) (x) ! 69: #define HTONS(x) (x) ! 70: ! 71: #else ! 72: ! 73: #define NTOHL(x) (x) = ntohl((u_long)x) ! 74: #define NTOHS(x) (x) = ntohs((u_short)x) ! 75: #define HTONL(x) (x) = htonl((u_long)x) ! 76: #define HTONS(x) (x) = htons((u_short)x) ! 77: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.