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
|
---|
34 | * $FreeBSD: src/sys/i386/include/endian.h,v 1.35 2002/09/23 04:32:16 mike Exp $
|
---|
35 | */
|
---|
36 |
|
---|
37 | /** @file
|
---|
38 | * FreeBSD 5.1
|
---|
39 | * @changed bird: Mixed in older stuff for toolkit compatibility. Not sure how successfull that is.
|
---|
40 | */
|
---|
41 |
|
---|
42 | #ifndef _MACHINE_ENDIAN_H_
|
---|
43 | #define _MACHINE_ENDIAN_H_
|
---|
44 |
|
---|
45 | #include <sys/cdefs.h>
|
---|
46 | #include <sys/_types.h>
|
---|
47 |
|
---|
48 | /*
|
---|
49 | * Define the order of 32-bit words in 64-bit words.
|
---|
50 | */
|
---|
51 | #define _QUAD_HIGHWORD 1
|
---|
52 | #define _QUAD_LOWWORD 0
|
---|
53 |
|
---|
54 | /*
|
---|
55 | * Definitions for byte order, according to byte significance from low
|
---|
56 | * address to high.
|
---|
57 | */
|
---|
58 | #define _LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
|
---|
59 | #define _BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
|
---|
60 | #define _PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
|
---|
61 |
|
---|
62 | #define _BYTE_ORDER _LITTLE_ENDIAN
|
---|
63 |
|
---|
64 | /*
|
---|
65 | * Deprecated variants that don't have enough underscores to be useful in more
|
---|
66 | * strict namespaces.
|
---|
67 | */
|
---|
68 | #if __BSD_VISIBLE
|
---|
69 | #define LITTLE_ENDIAN _LITTLE_ENDIAN
|
---|
70 | #define BIG_ENDIAN _BIG_ENDIAN
|
---|
71 | #define PDP_ENDIAN _PDP_ENDIAN
|
---|
72 | #define BYTE_ORDER _BYTE_ORDER
|
---|
73 | #endif
|
---|
74 |
|
---|
75 | #ifdef __GNUC__
|
---|
76 |
|
---|
77 | #define __word_swap_int(x) \
|
---|
78 | __extension__ ({ register __uint32_t __X = (x); \
|
---|
79 | __asm ("rorl $16, %0" : "+r" (__X)); \
|
---|
80 | __X; })
|
---|
81 |
|
---|
82 | #if defined(_KERNEL) && (defined(I486_CPU) || defined(I586_CPU) || defined(I686_CPU)) && !defined(I386_CPU)
|
---|
83 |
|
---|
84 | #define __byte_swap_int(x) \
|
---|
85 | __extension__ ({ register __uint32_t __X = (x); \
|
---|
86 | __asm ("bswap %0" : "+r" (__X)); \
|
---|
87 | __X; })
|
---|
88 | #else
|
---|
89 |
|
---|
90 | #define __byte_swap_int(x) \
|
---|
91 | __extension__ ({ register __uint32_t __X = (x); \
|
---|
92 | __asm ("xchgb %h0, %b0\n\trorl $16, %0\n\txchgb %h0, %b0" \
|
---|
93 | : "+q" (__X)); \
|
---|
94 | __X; })
|
---|
95 | #endif
|
---|
96 |
|
---|
97 | #define __byte_swap_word(x) \
|
---|
98 | __extension__ ({ register __uint16_t __X = (x); \
|
---|
99 | __asm ("xchgb %h0, %b0" : "+q" (__X)); \
|
---|
100 | __X; })
|
---|
101 |
|
---|
102 | static __inline __uint64_t
|
---|
103 | __bswap64(__uint64_t _x)
|
---|
104 | {
|
---|
105 | return ((_x >> 56) | ((_x >> 40) & 0xff00) | ((_x >> 24) & 0xff0000) |
|
---|
106 | ((_x >> 8) & 0xff000000) | ((_x << 8) & ((__uint64_t)0xff << 32)) |
|
---|
107 | ((_x << 24) & ((__uint64_t)0xff << 40)) |
|
---|
108 | ((_x << 40) & ((__uint64_t)0xff << 48)) | ((_x << 56)));
|
---|
109 | }
|
---|
110 |
|
---|
111 | static __inline __uint32_t
|
---|
112 | __bswap32(__uint32_t _x)
|
---|
113 | {
|
---|
114 |
|
---|
115 | return (__byte_swap_int(_x));
|
---|
116 | }
|
---|
117 |
|
---|
118 | static __inline __uint16_t
|
---|
119 | __bswap16(__uint16_t _x)
|
---|
120 | {
|
---|
121 |
|
---|
122 | return (__byte_swap_word(_x));
|
---|
123 | }
|
---|
124 |
|
---|
125 | #define __htonl(x) __bswap32(x)
|
---|
126 | #define __htons(x) __bswap16(x)
|
---|
127 | #define __ntohl(x) __bswap32(x)
|
---|
128 | #define __ntohs(x) __bswap16(x)
|
---|
129 |
|
---|
130 | #else /* !__GNUC__ */
|
---|
131 |
|
---|
132 | /*
|
---|
133 | * No optimizations are available for this compiler. Fall back to
|
---|
134 | * non-optimized functions by defining the constant usually used to prevent
|
---|
135 | * redefinition.
|
---|
136 | */
|
---|
137 | #define _BYTEORDER_FUNC_DEFINED
|
---|
138 |
|
---|
139 | #endif /* __GNUC__ */
|
---|
140 |
|
---|
141 |
|
---|
142 | /* bird:
|
---|
143 | * For toolkit compatibility we must do this stuff here.
|
---|
144 | * Not sure how correct this is now. And mixing 4 versions
|
---|
145 | * of (Free)BSD doesn't help....
|
---|
146 | */
|
---|
147 | #ifndef _POSIX_SOURCE
|
---|
148 |
|
---|
149 | #ifndef _KERNEL
|
---|
150 | #include <sys/cdefs.h>
|
---|
151 | #endif
|
---|
152 |
|
---|
153 | __BEGIN_DECLS
|
---|
154 | unsigned long _System htonl __P((unsigned long));
|
---|
155 | unsigned short _System htons __P((unsigned short));
|
---|
156 | unsigned long _System ntohl __P((unsigned long));
|
---|
157 | unsigned short _System ntohs __P((unsigned short));
|
---|
158 | __END_DECLS
|
---|
159 |
|
---|
160 | #ifndef _BYTEORDER_FUNC_DEFINED
|
---|
161 | #define _BYTEORDER_FUNC_DEFINED
|
---|
162 | #define htonl(x) __htonl(x)
|
---|
163 | #define htons(x) __htons(x)
|
---|
164 | #define ntohl(x) __ntohl(x)
|
---|
165 | #define ntohs(x) __ntohs(x)
|
---|
166 | #endif
|
---|
167 |
|
---|
168 | /*
|
---|
169 | * Macros for network/external number representation conversion.
|
---|
170 | */
|
---|
171 | #define NTOHL(x) ((x) = ntohl((u_long)(x)))
|
---|
172 | #define NTOHS(x) ((x) = ntohs((u_short)(x)))
|
---|
173 | #define HTONL(x) ((x) = htonl((u_long)(x)))
|
---|
174 | #define HTONS(x) ((x) = htons((u_short)(x)))
|
---|
175 |
|
---|
176 | #endif /*!_POSIX_SOURCE*/
|
---|
177 |
|
---|
178 |
|
---|
179 | #endif /* _MACHINE_ENDIAN_H_ */
|
---|