1 /* 2 * Copyright (c) 1990 The 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 #ident "$Id: endian.h,v 1.1.1.1 1993/09/29 06:09:24 briggs Exp $" 34 35 /* 36 * @(#)endian.h 7.7 (Berkeley) 4/3/91 37 */ 38 39 /* 40 ALICE 41 BG 05/24/92,17:10:58 42 I don't think we need to change this very much. 43 */ 44 45 /* 46 * Definitions for byte order, according to byte significance from low 47 * address to high. 48 */ 49 #define LITTLE_ENDIAN 1234 /* LSB first: i386, vax */ 50 #define BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */ 51 #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */ 52 53 #define BYTE_ORDER BIG_ENDIAN 54 55 #ifndef KERNEL 56 #include <sys/cdefs.h> 57 #endif 58 59 #define __word_swap_long(x) \ 60 ({ register u_long X = (x); \ 61 asm ("swap %1" \ 62 : "=r" (X) \ 63 : "0" (X)); \ 64 X; }) 65 #if __GNUC__ >= 2 66 #define __byte_swap_long(x) \ 67 ({ register u_long X = (x); \ 68 asm ("xchgb %h1, %b1\n\tswap %1\n\txchgb %h1, %b1" \ 69 : "=q" (X) \ 70 : "0" (X)); \ 71 X; }) 72 #define __byte_swap_word(x) \ 73 ({ register u_short X = (x); \ 74 asm ("xchgb %h1, %b1" \ 75 : "=q" (X) \ 76 : "0" (X)); \ 77 X; }) 78 #else /* __GNUC__ >= 2 */ 79 #define __byte_swap_long(x) \ 80 ({ register u_long X = (x); \ 81 asm ("rorw #8, %w1\n\tswap %1\n\trorw #8, %w1" \ 82 : "=r" (X) \ 83 : "0" (X)); \ 84 X; }) 85 #define __byte_swap_word(x) \ 86 ({ register u_short X = (x); \ 87 asm ("rorw #8, %w1" \ 88 : "=r" (X) \ 89 : "0" (X)); \ 90 X; }) 91 #endif /* __GNUC__ >= 2 */ 92 93 __BEGIN_DECLS 94 unsigned long htonl __P((unsigned long)); 95 unsigned short htons __P((unsigned short)); 96 unsigned long ntohl __P((unsigned long)); 97 unsigned short ntohs __P((unsigned short)); 98 __END_DECLS 99 100 /* 101 * Macros for network/external number representation conversion. 102 */ 103 #if BYTE_ORDER == BIG_ENDIAN && !defined(lint) 104 #define ntohl(x) (x) 105 #define ntohs(x) (x) 106 #define htonl(x) (x) 107 #define htons(x) (x) 108 109 #define NTOHL(x) (x) 110 #define NTOHS(x) (x) 111 #define HTONL(x) (x) 112 #define HTONS(x) (x) 113 114 #else 115 116 #define ntohl __byte_swap_long 117 #define ntohs __byte_swap_word 118 #define htonl __byte_swap_long 119 #define htons __byte_swap_word 120 121 #define NTOHL(x) (x) = ntohl((u_long)x) 122 #define NTOHS(x) (x) = ntohs((u_short)x) 123 #define HTONL(x) (x) = htonl((u_long)x) 124 #define HTONS(x) (x) = htons((u_short)x) 125 #endif 126