williamr@2
|
1 |
/*-
|
williamr@2
|
2 |
* Copyright (c) 1987, 1991 Regents of the University of California.
|
williamr@2
|
3 |
* All rights reserved.
|
williamr@2
|
4 |
*
|
williamr@2
|
5 |
* Redistribution and use in source and binary forms, with or without
|
williamr@2
|
6 |
* modification, are permitted provided that the following conditions
|
williamr@2
|
7 |
* are met:
|
williamr@2
|
8 |
* 1. Redistributions of source code must retain the above copyright
|
williamr@2
|
9 |
* notice, this list of conditions and the following disclaimer.
|
williamr@2
|
10 |
* 2. Redistributions in binary form must reproduce the above copyright
|
williamr@2
|
11 |
* notice, this list of conditions and the following disclaimer in the
|
williamr@2
|
12 |
* documentation and/or other materials provided with the distribution.
|
williamr@2
|
13 |
* 4. Neither the name of the University nor the names of its contributors
|
williamr@2
|
14 |
* may be used to endorse or promote products derived from this software
|
williamr@2
|
15 |
* without specific prior written permission.
|
williamr@2
|
16 |
*
|
williamr@2
|
17 |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
williamr@2
|
18 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
williamr@2
|
19 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
williamr@2
|
20 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
williamr@2
|
21 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
williamr@2
|
22 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
williamr@2
|
23 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
williamr@2
|
24 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
williamr@2
|
25 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
williamr@2
|
26 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
williamr@2
|
27 |
* SUCH DAMAGE.
|
williamr@2
|
28 |
*
|
williamr@2
|
29 |
* @(#)endian.h 7.8 (Berkeley) 4/3/91
|
williamr@2
|
30 |
* $FreeBSD: src/sys/i386/include/endian.h,v 1.41 2005/03/02 21:33:26 joerg Exp $
|
williamr@2
|
31 |
*/
|
williamr@2
|
32 |
|
williamr@2
|
33 |
#ifndef _MACHINE_ENDIAN_H_
|
williamr@2
|
34 |
#define _MACHINE_ENDIAN_H_
|
williamr@2
|
35 |
|
williamr@2
|
36 |
#include <sys/cdefs.h>
|
williamr@2
|
37 |
#include <sys/_types.h>
|
williamr@2
|
38 |
|
williamr@2
|
39 |
#ifdef __cplusplus
|
williamr@2
|
40 |
extern "C" {
|
williamr@2
|
41 |
#endif
|
williamr@2
|
42 |
|
williamr@2
|
43 |
/*
|
williamr@2
|
44 |
* Define the order of 32-bit words in 64-bit words.
|
williamr@2
|
45 |
*/
|
williamr@2
|
46 |
#define _QUAD_HIGHWORD 1
|
williamr@2
|
47 |
#define _QUAD_LOWWORD 0
|
williamr@2
|
48 |
|
williamr@2
|
49 |
/*
|
williamr@2
|
50 |
* Definitions for byte order, according to byte significance from low
|
williamr@2
|
51 |
* address to high.
|
williamr@2
|
52 |
*/
|
williamr@2
|
53 |
#define _LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
|
williamr@2
|
54 |
#define _BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
|
williamr@2
|
55 |
#define _PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
|
williamr@2
|
56 |
|
williamr@2
|
57 |
#define _BYTE_ORDER _LITTLE_ENDIAN
|
williamr@2
|
58 |
|
williamr@2
|
59 |
/*
|
williamr@2
|
60 |
* Deprecated variants that don't have enough underscores to be useful in more
|
williamr@2
|
61 |
* strict namespaces.
|
williamr@2
|
62 |
*/
|
williamr@2
|
63 |
#if __BSD_VISIBLE
|
williamr@2
|
64 |
#define LITTLE_ENDIAN _LITTLE_ENDIAN
|
williamr@2
|
65 |
#define BIG_ENDIAN _BIG_ENDIAN
|
williamr@2
|
66 |
#define PDP_ENDIAN _PDP_ENDIAN
|
williamr@2
|
67 |
#define BYTE_ORDER _BYTE_ORDER
|
williamr@2
|
68 |
#endif
|
williamr@2
|
69 |
|
williamr@2
|
70 |
#ifdef __SYMBIAN32__
|
williamr@2
|
71 |
|
williamr@2
|
72 |
#define _BYTEORDER_FUNC_DEFINED
|
williamr@2
|
73 |
|
williamr@2
|
74 |
#else /* __SYMBIAN32__ */
|
williamr@2
|
75 |
|
williamr@2
|
76 |
#if defined(__GNUCLIKE_ASM) && defined(__GNUCLIKE_BUILTIN_CONSTANT_P)
|
williamr@2
|
77 |
|
williamr@2
|
78 |
#define __word_swap_int_var(x) \
|
williamr@2
|
79 |
__extension__ ({ register __uint32_t __X = (x); \
|
williamr@2
|
80 |
__asm ("rorl $16, %0" : "+r" (__X)); \
|
williamr@2
|
81 |
__X; })
|
williamr@2
|
82 |
|
williamr@2
|
83 |
#ifdef __OPTIMIZE__
|
williamr@2
|
84 |
|
williamr@2
|
85 |
#define __word_swap_int_const(x) \
|
williamr@2
|
86 |
((((x) & 0xffff0000) >> 16) | \
|
williamr@2
|
87 |
(((x) & 0x0000ffff) << 16))
|
williamr@2
|
88 |
#define __word_swap_int(x) (__builtin_constant_p(x) ? \
|
williamr@2
|
89 |
__word_swap_int_const(x) : __word_swap_int_var(x))
|
williamr@2
|
90 |
|
williamr@2
|
91 |
#else /* __OPTIMIZE__ */
|
williamr@2
|
92 |
|
williamr@2
|
93 |
#define __word_swap_int(x) __word_swap_int_var(x)
|
williamr@2
|
94 |
|
williamr@2
|
95 |
#endif /* __OPTIMIZE__ */
|
williamr@2
|
96 |
|
williamr@2
|
97 |
#define __byte_swap_int_var(x) \
|
williamr@2
|
98 |
__extension__ ({ register __uint32_t __X = (x); \
|
williamr@2
|
99 |
__asm ("bswap %0" : "+r" (__X)); \
|
williamr@2
|
100 |
__X; })
|
williamr@2
|
101 |
|
williamr@2
|
102 |
#ifdef __OPTIMIZE__
|
williamr@2
|
103 |
|
williamr@2
|
104 |
#define __byte_swap_int_const(x) \
|
williamr@2
|
105 |
((((x) & 0xff000000) >> 24) | \
|
williamr@2
|
106 |
(((x) & 0x00ff0000) >> 8) | \
|
williamr@2
|
107 |
(((x) & 0x0000ff00) << 8) | \
|
williamr@2
|
108 |
(((x) & 0x000000ff) << 24))
|
williamr@2
|
109 |
#define __byte_swap_int(x) (__builtin_constant_p(x) ? \
|
williamr@2
|
110 |
__byte_swap_int_const(x) : __byte_swap_int_var(x))
|
williamr@2
|
111 |
|
williamr@2
|
112 |
#else /* __OPTIMIZE__ */
|
williamr@2
|
113 |
|
williamr@2
|
114 |
#define __byte_swap_int(x) __byte_swap_int_var(x)
|
williamr@2
|
115 |
|
williamr@2
|
116 |
#endif /* __OPTIMIZE__ */
|
williamr@2
|
117 |
|
williamr@2
|
118 |
#define __byte_swap_word_var(x) \
|
williamr@2
|
119 |
__extension__ ({ register __uint16_t __X = (x); \
|
williamr@2
|
120 |
__asm ("xchgb %h0, %b0" : "+q" (__X)); \
|
williamr@2
|
121 |
__X; })
|
williamr@2
|
122 |
|
williamr@2
|
123 |
#ifdef __OPTIMIZE__
|
williamr@2
|
124 |
|
williamr@2
|
125 |
#define __byte_swap_word_const(x) \
|
williamr@2
|
126 |
((((x) & 0xff00) >> 8) | \
|
williamr@2
|
127 |
(((x) & 0x00ff) << 8))
|
williamr@2
|
128 |
|
williamr@2
|
129 |
#define __byte_swap_word(x) (__builtin_constant_p(x) ? \
|
williamr@2
|
130 |
__byte_swap_word_const(x) : __byte_swap_word_var(x))
|
williamr@2
|
131 |
|
williamr@2
|
132 |
#else /* __OPTIMIZE__ */
|
williamr@2
|
133 |
|
williamr@2
|
134 |
#define __byte_swap_word(x) __byte_swap_word_var(x)
|
williamr@2
|
135 |
|
williamr@2
|
136 |
#endif /* __OPTIMIZE__ */
|
williamr@2
|
137 |
|
williamr@2
|
138 |
static __inline __uint64_t
|
williamr@2
|
139 |
__bswap64(__uint64_t _x)
|
williamr@2
|
140 |
{
|
williamr@2
|
141 |
|
williamr@2
|
142 |
return ((_x >> 56) | ((_x >> 40) & 0xff00) | ((_x >> 24) & 0xff0000) |
|
williamr@2
|
143 |
((_x >> 8) & 0xff000000) | ((_x << 8) & ((__uint64_t)0xff << 32)) |
|
williamr@2
|
144 |
((_x << 24) & ((__uint64_t)0xff << 40)) |
|
williamr@2
|
145 |
((_x << 40) & ((__uint64_t)0xff << 48)) | ((_x << 56)));
|
williamr@2
|
146 |
}
|
williamr@2
|
147 |
|
williamr@2
|
148 |
static __inline __uint32_t
|
williamr@2
|
149 |
__bswap32(__uint32_t _x)
|
williamr@2
|
150 |
{
|
williamr@2
|
151 |
|
williamr@2
|
152 |
return (__byte_swap_int(_x));
|
williamr@2
|
153 |
}
|
williamr@2
|
154 |
|
williamr@2
|
155 |
static __inline __uint16_t
|
williamr@2
|
156 |
__bswap16(__uint16_t _x)
|
williamr@2
|
157 |
{
|
williamr@2
|
158 |
|
williamr@2
|
159 |
return (__byte_swap_word(_x));
|
williamr@2
|
160 |
}
|
williamr@2
|
161 |
|
williamr@2
|
162 |
#define __htonl(x) __bswap32(x)
|
williamr@2
|
163 |
#define __htons(x) __bswap16(x)
|
williamr@2
|
164 |
#define __ntohl(x) __bswap32(x)
|
williamr@2
|
165 |
#define __ntohs(x) __bswap16(x)
|
williamr@2
|
166 |
|
williamr@2
|
167 |
#else /* !(__GNUCLIKE_ASM && __GNUCLIKE_BUILTIN_CONSTANT_P) */
|
williamr@2
|
168 |
|
williamr@2
|
169 |
/*
|
williamr@2
|
170 |
* No optimizations are available for this compiler. Fall back to
|
williamr@2
|
171 |
* non-optimized functions by defining the constant usually used to prevent
|
williamr@2
|
172 |
* redefinition.
|
williamr@2
|
173 |
*/
|
williamr@2
|
174 |
#define _BYTEORDER_FUNC_DEFINED
|
williamr@2
|
175 |
|
williamr@2
|
176 |
#endif /* __GNUCLIKE_ASM && __GNUCLIKE_BUILTIN_CONSTANT_P */
|
williamr@2
|
177 |
#endif /* __SYMBIAN32__ */
|
williamr@2
|
178 |
|
williamr@2
|
179 |
#ifdef __cplusplus
|
williamr@2
|
180 |
}
|
williamr@2
|
181 |
#endif
|
williamr@2
|
182 |
|
williamr@2
|
183 |
#endif /* !_MACHINE_ENDIAN_H_ */
|