Pre-2.0 release: Sync with HAMMER 65 - simplify PFS operations.
[dragonfly.git] / sys / cpu / amd64 / include / endian.h
blob891ea7aac53ccb5ea15b6cf40a94e3f31771a2bc
1 /*-
2 * Copyright (c) 1987, 1991 Regents of the University of California.
3 * All rights reserved.
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.
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.
33 * @(#)endian.h 7.8 (Berkeley) 4/3/91
34 * $FreeBSD: src/sys/amd64/include/endian.h,v 1.5 2003/09/22 22:37:49 peter Exp $
35 * $DragonFly: src/sys/cpu/amd64/include/endian.h,v 1.1 2007/08/21 19:40:24 corecode Exp $
38 #ifndef _CPU_ENDIAN_H_
39 #define _CPU_ENDIAN_H_
41 #ifndef _KERNEL
42 #include <sys/cdefs.h>
43 #endif
45 #include <machine/stdint.h>
48 * Define the order of 32-bit words in 64-bit words.
50 #define _QUAD_HIGHWORD 1
51 #define _QUAD_LOWWORD 0
54 * Definitions for byte order, according to byte significance from low
55 * address to high.
57 #define _LITTLE_ENDIAN 1234 /* LSB first: i386, vax */
58 #define _BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */
59 #define _PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */
61 #define _BYTE_ORDER _LITTLE_ENDIAN
64 * Deprecated variants that don't have enough underscores to be useful in more
65 * strict namespaces.
67 #if __BSD_VISIBLE
68 #define LITTLE_ENDIAN _LITTLE_ENDIAN
69 #define BIG_ENDIAN _BIG_ENDIAN
70 #define PDP_ENDIAN _PDP_ENDIAN
71 #define BYTE_ORDER _BYTE_ORDER
72 #endif
74 #ifdef __GNUC__
76 #define __word_swap_int_var(x) \
77 __extension__ ({ register __uint32_t __X = (x); \
78 __asm ("rorl $16, %0" : "+r" (__X)); \
79 __X; })
81 #ifdef __OPTIMIZE__
83 #define __word_swap_int_const(x) \
84 ((((x) & 0xffff0000) >> 16) | \
85 (((x) & 0x0000ffff) << 16))
86 #define __word_swap_int(x) (__builtin_constant_p(x) ? \
87 __word_swap_int_const(x) : __word_swap_int_var(x))
89 #else /* __OPTIMIZE__ */
91 #define __word_swap_int(x) __word_swap_int_var(x)
93 #endif /* __OPTIMIZE__ */
95 #define __byte_swap_int_var(x) \
96 __extension__ ({ register __uint32_t __X = (x); \
97 __asm ("bswap %0" : "+r" (__X)); \
98 __X; })
100 #ifdef __OPTIMIZE__
102 #define __byte_swap_int_const(x) \
103 ((((x) & 0xff000000) >> 24) | \
104 (((x) & 0x00ff0000) >> 8) | \
105 (((x) & 0x0000ff00) << 8) | \
106 (((x) & 0x000000ff) << 24))
107 #define __byte_swap_int(x) (__builtin_constant_p(x) ? \
108 __byte_swap_int_const(x) : __byte_swap_int_var(x))
110 #else /* __OPTIMIZE__ */
112 #define __byte_swap_int(x) __byte_swap_int_var(x)
114 #endif /* __OPTIMIZE__ */
116 #define __byte_swap_long_var(x) \
117 __extension__ ({ register __uint64_t __X = (x); \
118 __asm ("bswap %0" : "+r" (__X)); \
119 __X; })
121 #ifdef __OPTIMIZE__
123 #define __byte_swap_long_const(x) \
124 (((x >> 56) | \
125 ((x >> 40) & 0xff00) | \
126 ((x >> 24) & 0xff0000) | \
127 ((x >> 8) & 0xff000000) | \
128 ((x << 8) & (0xfful << 32)) | \
129 ((x << 24) & (0xfful << 40)) | \
130 ((x << 40) & (0xfful << 48)) | \
131 ((x << 56))))
133 #define __byte_swap_long(x) (__builtin_constant_p(x) ? \
134 __byte_swap_long_const(x) : __byte_swap_long_var(x))
136 #else /* __OPTIMIZE__ */
138 #define __byte_swap_long(x) __byte_swap_long_var(x)
140 #endif /* __OPTIMIZE__ */
142 #define __byte_swap_word_var(x) \
143 __extension__ ({ register __uint16_t __X = (x); \
144 __asm ("xchgb %h0, %b0" : "+Q" (__X)); \
145 __X; })
147 #ifdef __OPTIMIZE__
149 #define __byte_swap_word_const(x) \
150 ((((x) & 0xff00) >> 8) | \
151 (((x) & 0x00ff) << 8))
153 #define __byte_swap_word(x) (__builtin_constant_p(x) ? \
154 __byte_swap_word_const(x) : __byte_swap_word_var(x))
156 #else /* __OPTIMIZE__ */
158 #define __byte_swap_word(x) __byte_swap_word_var(x)
160 #endif /* __OPTIMIZE__ */
162 static __inline __uint64_t
163 __bswap64(__uint64_t _x)
166 return (__byte_swap_long(_x));
169 static __inline __uint32_t
170 __bswap32(__uint32_t _x)
173 return (__byte_swap_int(_x));
176 static __inline __uint16_t
177 __bswap16(__uint16_t _x)
180 return (__byte_swap_word(_x));
183 #define __htonl(x) __bswap32(x)
184 #define __htons(x) __bswap16(x)
185 #define __ntohl(x) __bswap32(x)
186 #define __ntohs(x) __bswap16(x)
188 #else /* !__GNUC__ */
191 * No optimizations are available for this compiler. Fall back to
192 * non-optimized functions by defining the constant usually used to prevent
193 * redefinition.
195 #define _BYTEORDER_FUNC_DEFINED
197 #endif /* __GNUC__ */
199 #endif /* !_CPU_ENDIAN_H_ */