mirror of
https://github.com/urbit/shrub.git
synced 2024-12-22 18:31:44 +03:00
145 lines
3.8 KiB
C
145 lines
3.8 KiB
C
/*-
|
|
* Copyright 2007-2009 Colin Percival
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* This file was originally written by Colin Percival as part of the Tarsnap
|
|
* online backup system.
|
|
*/
|
|
#ifndef _SYSENDIAN_H_
|
|
#define _SYSENDIAN_H_
|
|
|
|
|
|
/* If we don't have be64enc, the <sys/endian.h> we have isn't usable. */
|
|
#if !HAVE_DECL_BE64ENC
|
|
#undef HAVE_SYS_ENDIAN_H
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_ENDIAN_H
|
|
|
|
#include <sys/endian.h>
|
|
|
|
#else
|
|
|
|
#include <stdint.h>
|
|
#ifdef _MSC_VER
|
|
#define INLINE __inline
|
|
#else
|
|
#define INLINE inline
|
|
#endif
|
|
|
|
static INLINE uint32_t
|
|
be32dec(const void *pp)
|
|
{
|
|
const uint8_t *p = (uint8_t const *)pp;
|
|
|
|
return ((uint32_t)(p[3]) + ((uint32_t)(p[2]) << 8) +
|
|
((uint32_t)(p[1]) << 16) + ((uint32_t)(p[0]) << 24));
|
|
}
|
|
|
|
static INLINE void
|
|
be32enc(void *pp, uint32_t x)
|
|
{
|
|
uint8_t * p = (uint8_t *)pp;
|
|
|
|
p[3] = x & 0xff;
|
|
p[2] = (x >> 8) & 0xff;
|
|
p[1] = (x >> 16) & 0xff;
|
|
p[0] = (x >> 24) & 0xff;
|
|
}
|
|
|
|
static INLINE uint64_t
|
|
be64dec(const void *pp)
|
|
{
|
|
const uint8_t *p = (uint8_t const *)pp;
|
|
|
|
return ((uint64_t)(p[7]) + ((uint64_t)(p[6]) << 8) +
|
|
((uint64_t)(p[5]) << 16) + ((uint64_t)(p[4]) << 24) +
|
|
((uint64_t)(p[3]) << 32) + ((uint64_t)(p[2]) << 40) +
|
|
((uint64_t)(p[1]) << 48) + ((uint64_t)(p[0]) << 56));
|
|
}
|
|
|
|
static INLINE void
|
|
be64enc(void *pp, uint64_t x)
|
|
{
|
|
uint8_t * p = (uint8_t *)pp;
|
|
|
|
p[7] = x & 0xff;
|
|
p[6] = (x >> 8) & 0xff;
|
|
p[5] = (x >> 16) & 0xff;
|
|
p[4] = (x >> 24) & 0xff;
|
|
p[3] = (x >> 32) & 0xff;
|
|
p[2] = (x >> 40) & 0xff;
|
|
p[1] = (x >> 48) & 0xff;
|
|
p[0] = (x >> 56) & 0xff;
|
|
}
|
|
|
|
static INLINE uint32_t
|
|
le32dec(const void *pp)
|
|
{
|
|
const uint8_t *p = (uint8_t const *)pp;
|
|
|
|
return ((uint32_t)(p[0]) + ((uint32_t)(p[1]) << 8) +
|
|
((uint32_t)(p[2]) << 16) + ((uint32_t)(p[3]) << 24));
|
|
}
|
|
|
|
static INLINE void
|
|
le32enc(void *pp, uint32_t x)
|
|
{
|
|
uint8_t * p = (uint8_t *)pp;
|
|
|
|
p[0] = x & 0xff;
|
|
p[1] = (x >> 8) & 0xff;
|
|
p[2] = (x >> 16) & 0xff;
|
|
p[3] = (x >> 24) & 0xff;
|
|
}
|
|
|
|
static INLINE uint64_t
|
|
le64dec(const void *pp)
|
|
{
|
|
const uint8_t *p = (uint8_t const *)pp;
|
|
|
|
return ((uint64_t)(p[0]) + ((uint64_t)(p[1]) << 8) +
|
|
((uint64_t)(p[2]) << 16) + ((uint64_t)(p[3]) << 24) +
|
|
((uint64_t)(p[4]) << 32) + ((uint64_t)(p[5]) << 40) +
|
|
((uint64_t)(p[6]) << 48) + ((uint64_t)(p[7]) << 56));
|
|
}
|
|
|
|
static INLINE void
|
|
le64enc(void *pp, uint64_t x)
|
|
{
|
|
uint8_t * p = (uint8_t *)pp;
|
|
|
|
p[0] = x & 0xff;
|
|
p[1] = (x >> 8) & 0xff;
|
|
p[2] = (x >> 16) & 0xff;
|
|
p[3] = (x >> 24) & 0xff;
|
|
p[4] = (x >> 32) & 0xff;
|
|
p[5] = (x >> 40) & 0xff;
|
|
p[6] = (x >> 48) & 0xff;
|
|
p[7] = (x >> 56) & 0xff;
|
|
}
|
|
#endif /* !HAVE_SYS_ENDIAN_H */
|
|
|
|
#endif /* !_SYSENDIAN_H_ */
|