![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to endian.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / arch / i386 / include|
Return to endian.h CVS log | Up to [Net/2] / Net2 / arch / i386 / include |
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.8 (Berkeley) 4/3/91
1.1.1.2 ! root 34: *
! 35: * PATCHES MAGIC LEVEL PATCH THAT GOT US HERE
! 36: * -------------------- ----- ----------------------
! 37: * CURRENT PATCH LEVEL: 1 00093
! 38: * -------------------- ----- ----------------------
! 39: *
! 40: * 27 Feb 93 Charles Hannum Better byte-swapping macros for
! 41: * i386/i486.
1.1 root 42: */
43:
44: /*
45: * Definitions for byte order, according to byte significance from low
46: * address to high.
47: */
48: #define LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
49: #define BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
50: #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
51:
52: #define BYTE_ORDER LITTLE_ENDIAN
53:
54: #ifndef KERNEL
55: #include <sys/cdefs.h>
56: #endif
57:
1.1.1.2 ! root 58: #define __word_swap_long(x) \
! 59: ({ register u_long X = (x); \
! 60: asm ("rorl $16, %1" \
! 61: : "=r" (X) \
! 62: : "0" (X)); \
! 63: X; })
! 64: #if __GNUC__ >= 2
! 65: #define __byte_swap_long(x) \
! 66: ({ register u_long X = (x); \
! 67: asm ("xchgb %h1, %b1\n\trorl $16, %1\n\txchgb %h1, %b1" \
! 68: : "=q" (X) \
! 69: : "0" (X)); \
! 70: X; })
! 71: #define __byte_swap_word(x) \
! 72: ({ register u_short X = (x); \
! 73: asm ("xchgb %h1, %b1" \
! 74: : "=q" (X) \
! 75: : "0" (X)); \
! 76: X; })
! 77: #else /* __GNUC__ >= 2 */
! 78: #define __byte_swap_long(x) \
! 79: ({ register u_long X = (x); \
! 80: asm ("rorw $8, %w1\n\trorl $16, %1\n\trorw $8, %w1" \
! 81: : "=r" (X) \
! 82: : "0" (X)); \
! 83: X; })
! 84: #define __byte_swap_word(x) \
! 85: ({ register u_short X = (x); \
! 86: asm ("rorw $8, %w1" \
! 87: : "=r" (X) \
! 88: : "0" (X)); \
! 89: X; })
! 90: #endif /* __GNUC__ >= 2 */
1.1 root 91:
92: /*
93: * Macros for network/external number representation conversion.
94: */
95: #if BYTE_ORDER == BIG_ENDIAN && !defined(lint)
96: #define ntohl(x) (x)
97: #define ntohs(x) (x)
98: #define htonl(x) (x)
99: #define htons(x) (x)
100:
101: #define NTOHL(x) (x)
102: #define NTOHS(x) (x)
103: #define HTONL(x) (x)
104: #define HTONS(x) (x)
105:
106: #else
107:
1.1.1.2 ! root 108: #define ntohl __byte_swap_long
! 109: #define ntohs __byte_swap_word
! 110: #define htonl __byte_swap_long
! 111: #define htons __byte_swap_word
! 112:
1.1 root 113: #define NTOHL(x) (x) = ntohl((u_long)x)
114: #define NTOHS(x) (x) = ntohs((u_short)x)
115: #define HTONL(x) (x) = htonl((u_long)x)
116: #define HTONS(x) (x) = htons((u_short)x)
117: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.