williamr@2: /*- williamr@2: * Copyright (c) 1987, 1991 Regents of the University of California. williamr@2: * All rights reserved. williamr@2: * williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the above copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 4. Neither the name of the University nor the names of its contributors williamr@2: * may be used to endorse or promote products derived from this software williamr@2: * without specific prior written permission. williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@2: * @(#)endian.h 7.8 (Berkeley) 4/3/91 williamr@2: * $FreeBSD: src/sys/i386/include/endian.h,v 1.41 2005/03/02 21:33:26 joerg Exp $ williamr@2: */ williamr@2: williamr@2: #ifndef _MACHINE_ENDIAN_H_ williamr@2: #define _MACHINE_ENDIAN_H_ williamr@2: williamr@2: #include williamr@2: #include williamr@2: williamr@2: #ifdef __cplusplus williamr@2: extern "C" { williamr@2: #endif williamr@2: williamr@2: /* williamr@2: * Define the order of 32-bit words in 64-bit words. williamr@2: */ williamr@2: #define _QUAD_HIGHWORD 1 williamr@2: #define _QUAD_LOWWORD 0 williamr@2: williamr@2: /* williamr@2: * Definitions for byte order, according to byte significance from low williamr@2: * address to high. williamr@2: */ williamr@2: #define _LITTLE_ENDIAN 1234 /* LSB first: i386, vax */ williamr@2: #define _BIG_ENDIAN 4321 /* MSB first: 68000, ibm, net */ williamr@2: #define _PDP_ENDIAN 3412 /* LSB first in word, MSW first in long */ williamr@2: williamr@2: #define _BYTE_ORDER _LITTLE_ENDIAN williamr@2: williamr@2: /* williamr@2: * Deprecated variants that don't have enough underscores to be useful in more williamr@2: * strict namespaces. williamr@2: */ williamr@2: #if __BSD_VISIBLE williamr@2: #define LITTLE_ENDIAN _LITTLE_ENDIAN williamr@2: #define BIG_ENDIAN _BIG_ENDIAN williamr@2: #define PDP_ENDIAN _PDP_ENDIAN williamr@2: #define BYTE_ORDER _BYTE_ORDER williamr@2: #endif williamr@2: williamr@2: #ifdef __SYMBIAN32__ williamr@2: williamr@2: #define _BYTEORDER_FUNC_DEFINED williamr@2: williamr@2: #else /* __SYMBIAN32__ */ williamr@2: williamr@2: #if defined(__GNUCLIKE_ASM) && defined(__GNUCLIKE_BUILTIN_CONSTANT_P) williamr@2: williamr@2: #define __word_swap_int_var(x) \ williamr@2: __extension__ ({ register __uint32_t __X = (x); \ williamr@2: __asm ("rorl $16, %0" : "+r" (__X)); \ williamr@2: __X; }) williamr@2: williamr@2: #ifdef __OPTIMIZE__ williamr@2: williamr@2: #define __word_swap_int_const(x) \ williamr@2: ((((x) & 0xffff0000) >> 16) | \ williamr@2: (((x) & 0x0000ffff) << 16)) williamr@2: #define __word_swap_int(x) (__builtin_constant_p(x) ? \ williamr@2: __word_swap_int_const(x) : __word_swap_int_var(x)) williamr@2: williamr@2: #else /* __OPTIMIZE__ */ williamr@2: williamr@2: #define __word_swap_int(x) __word_swap_int_var(x) williamr@2: williamr@2: #endif /* __OPTIMIZE__ */ williamr@2: williamr@2: #define __byte_swap_int_var(x) \ williamr@2: __extension__ ({ register __uint32_t __X = (x); \ williamr@2: __asm ("bswap %0" : "+r" (__X)); \ williamr@2: __X; }) williamr@2: williamr@2: #ifdef __OPTIMIZE__ williamr@2: williamr@2: #define __byte_swap_int_const(x) \ williamr@2: ((((x) & 0xff000000) >> 24) | \ williamr@2: (((x) & 0x00ff0000) >> 8) | \ williamr@2: (((x) & 0x0000ff00) << 8) | \ williamr@2: (((x) & 0x000000ff) << 24)) williamr@2: #define __byte_swap_int(x) (__builtin_constant_p(x) ? \ williamr@2: __byte_swap_int_const(x) : __byte_swap_int_var(x)) williamr@2: williamr@2: #else /* __OPTIMIZE__ */ williamr@2: williamr@2: #define __byte_swap_int(x) __byte_swap_int_var(x) williamr@2: williamr@2: #endif /* __OPTIMIZE__ */ williamr@2: williamr@2: #define __byte_swap_word_var(x) \ williamr@2: __extension__ ({ register __uint16_t __X = (x); \ williamr@2: __asm ("xchgb %h0, %b0" : "+q" (__X)); \ williamr@2: __X; }) williamr@2: williamr@2: #ifdef __OPTIMIZE__ williamr@2: williamr@2: #define __byte_swap_word_const(x) \ williamr@2: ((((x) & 0xff00) >> 8) | \ williamr@2: (((x) & 0x00ff) << 8)) williamr@2: williamr@2: #define __byte_swap_word(x) (__builtin_constant_p(x) ? \ williamr@2: __byte_swap_word_const(x) : __byte_swap_word_var(x)) williamr@2: williamr@2: #else /* __OPTIMIZE__ */ williamr@2: williamr@2: #define __byte_swap_word(x) __byte_swap_word_var(x) williamr@2: williamr@2: #endif /* __OPTIMIZE__ */ williamr@2: williamr@2: static __inline __uint64_t williamr@2: __bswap64(__uint64_t _x) williamr@2: { williamr@2: williamr@2: return ((_x >> 56) | ((_x >> 40) & 0xff00) | ((_x >> 24) & 0xff0000) | williamr@2: ((_x >> 8) & 0xff000000) | ((_x << 8) & ((__uint64_t)0xff << 32)) | williamr@2: ((_x << 24) & ((__uint64_t)0xff << 40)) | williamr@2: ((_x << 40) & ((__uint64_t)0xff << 48)) | ((_x << 56))); williamr@2: } williamr@2: williamr@2: static __inline __uint32_t williamr@2: __bswap32(__uint32_t _x) williamr@2: { williamr@2: williamr@2: return (__byte_swap_int(_x)); williamr@2: } williamr@2: williamr@2: static __inline __uint16_t williamr@2: __bswap16(__uint16_t _x) williamr@2: { williamr@2: williamr@2: return (__byte_swap_word(_x)); williamr@2: } williamr@2: williamr@2: #define __htonl(x) __bswap32(x) williamr@2: #define __htons(x) __bswap16(x) williamr@2: #define __ntohl(x) __bswap32(x) williamr@2: #define __ntohs(x) __bswap16(x) williamr@2: williamr@2: #else /* !(__GNUCLIKE_ASM && __GNUCLIKE_BUILTIN_CONSTANT_P) */ williamr@2: williamr@2: /* williamr@2: * No optimizations are available for this compiler. Fall back to williamr@2: * non-optimized functions by defining the constant usually used to prevent williamr@2: * redefinition. williamr@2: */ williamr@2: #define _BYTEORDER_FUNC_DEFINED williamr@2: williamr@2: #endif /* __GNUCLIKE_ASM && __GNUCLIKE_BUILTIN_CONSTANT_P */ williamr@2: #endif /* __SYMBIAN32__ */ williamr@2: williamr@2: #ifdef __cplusplus williamr@2: } williamr@2: #endif williamr@2: williamr@2: #endif /* !_MACHINE_ENDIAN_H_ */