dxx-rebirth/include/byteswap.h

85 lines
3.6 KiB
C
Raw Normal View History

/*
THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
COPYRIGHT 1993-1999 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
*/
/*
*
* code to swap bytes because of big/little endian problems.
* contains the macros:
* SWAP{INT64,INT,SHORT}(x): returns a swapped version of x
* INTEL_{INT64,INT,SHORT}(x): returns x after conversion to/from little endian
* GET_INTEL_{INT64,INT,SHORT}(src): gets value from little-endian buffer src
* PUT_INTEL_{INT64,INT,SHORT}(dest, src): puts src into little-endian buffer dest
*
* the GET/PUT macros are safe to use on platforms which segfault on unaligned word access
*
*/
#ifndef _BYTESWAP_H
#define _BYTESWAP_H
#include "pstypes.h"
#define SWAPSHORT(x) (((ubyte)(x) << 8) | (((ushort)(x)) >> 8))
#define SWAPINT(x) (((x)<<24) | (((uint)(x)) >> 24) | (((x) &0x0000ff00) << 8) | (((x) & 0x00ff0000) >> 8))
#ifndef macintosh
#define SWAPINT64(x) ((((x) & 0xff00000000000000LL) >> 56) | (((x) & 0x00ff000000000000LL) >> 40) | (((x) & 0x0000ff0000000000LL) >> 24) | (((x) & 0x000000ff00000000LL) >> 8) | (((x) & 0x00000000ff000000LL) << 8) | (((x) & 0x0000000000ff0000LL) << 24) | (((x) & 0x000000000000ff00LL) << 40) | (((x) & 0x00000000000000ffLL) << 56))
#else
#define SWAPINT64(x) ((((x) & 0xff00000000000000LL)/(2^56)) | (((x) & 0x00ff000000000000LL)/(2^40)) | (((x) & 0x0000ff0000000000LL)/(2^24)) | (((x) & 0x000000ff00000000LL)/(2^8)) | (((x) & 0x00000000ff000000LL)*(2^8)) | (((x) & 0x0000000000ff0000LL)*(2^24)) | (((x) & 0x000000000000ff00LL)*(2^40)) | (((x) & 0x00000000000000ffLL)*(2^56)))
#endif
#ifndef WORDS_BIGENDIAN
#define INTEL_INT64(x) x
#define INTEL_INT(x) x
#define INTEL_SHORT(x) x
#else // ! WORDS_BIGENDIAN
#define INTEL_INT64(x) SWAPINT64(x)
#define INTEL_INT(x) SWAPINT(x)
#define INTEL_SHORT(x) SWAPSHORT(x)
#endif // ! WORDS_BIGENDIAN
#ifndef WORDS_NEED_ALIGNMENT
#define GET_INTEL_INT64(s) INTEL_INT64(*(u_int64_t *)(s))
#define GET_INTEL_INT(s) INTEL_INT(*(uint *)(s))
#define GET_INTEL_SHORT(s) INTEL_SHORT(*(ushort *)(s))
#define PUT_INTEL_INT64(d, s) { *(u_int64_t *)(d) = INTEL_INT64((u_int64_t)(s)); }
#define PUT_INTEL_INT(d, s) { *(uint *)(d) = INTEL_INT((uint)(s)); }
#define PUT_INTEL_SHORT(d, s) { *(ushort *)(d) = INTEL_SHORT((ushort)(s)); }
#else // ! WORDS_NEED_ALIGNMENT
static inline u_int64_t GET_INTEL_INT64(void *s)
{
u_int64_t tmp;
memcpy((void *)&tmp, s, 8);
return INTEL_INT64(tmp);
}
static inline uint GET_INTEL_INT(void *s)
{
uint tmp;
memcpy((void *)&tmp, s, 4);
return INTEL_INT(tmp);
}
static inline uint GET_INTEL_SHORT(void *s)
{
ushort tmp;
memcpy((void *)&tmp, s, 2);
return INTEL_SHORT(tmp);
}
#define PUT_INTEL_INT64(d, s) { uint tmp = INTEL_INT64(s); \
memcpy((void *)(d), (void *)&tmp, 8); }
#define PUT_INTEL_INT(d, s) { uint tmp = INTEL_INT(s); \
memcpy((void *)(d), (void *)&tmp, 4); }
#define PUT_INTEL_SHORT(d, s) { ushort tmp = INTEL_SHORT(s); \
memcpy((void *)(d), (void *)&tmp, 2); }
#endif // ! WORDS_NEED_ALIGNMENT
#endif // ! _BYTESWAP_H