hashable-1.2.0.0: cbits/siphash.c

/* Almost a verbatim copy of the reference implementation. */

#include <stddef.h>
#include "siphash.h"

#define ROTL(x,b) (u64)(((x) << (b)) | ((x) >> (64 - (b))))

#define SIPROUND \
    do { \
	v0 += v1; v1=ROTL(v1,13); v1 ^= v0; v0=ROTL(v0,32); \
	v2 += v3; v3=ROTL(v3,16); v3 ^= v2; \
	v0 += v3; v3=ROTL(v3,21); v3 ^= v0; \
	v2 += v1; v1=ROTL(v1,17); v1 ^= v2; v2=ROTL(v2,32); \
    } while(0)

#if defined(__i386)
# define _siphash24 plain_siphash24
#endif

static inline u64 odd_read(const u8 *p, int count, u64 val, int shift)
{
    switch (count) {
    case 7: val |= ((u64)p[6]) << (shift + 48);
    case 6: val |= ((u64)p[5]) << (shift + 40);
    case 5: val |= ((u64)p[4]) << (shift + 32);
    case 4: val |= ((u64)p[3]) << (shift + 24);
    case 3: val |= ((u64)p[2]) << (shift + 16);
    case 2: val |= ((u64)p[1]) << (shift + 8);
    case 1: val |= ((u64)p[0]) << shift;
    }
    return val;
}

static inline u64 _siphash(int c, int d, u64 k0, u64 k1,
			   const u8 *str, size_t len)
{
    u64 v0 = 0x736f6d6570736575ull ^ k0;
    u64 v1 = 0x646f72616e646f6dull ^ k1;
    u64 v2 = 0x6c7967656e657261ull ^ k0;
    u64 v3 = 0x7465646279746573ull ^ k1;
    const u8 *end, *p;
    u64 b;
    int i;

    for (p = str, end = str + (len & ~7); p < end; p += 8) {
	u64 m = *(u64 *) p;
	v3 ^= m;
	if (c == 2) {
	    SIPROUND;
	    SIPROUND;
	} else {
	    for (i = 0; i < c; i++)
		SIPROUND;
	}
	v0 ^= m;
    }

    b = odd_read(p, len & 7, ((u64) len) << 56, 0);

    v3 ^= b;
    if (c == 2) {
	SIPROUND;
	SIPROUND;
    } else {
	for (i = 0; i < c; i++)
	    SIPROUND;
    }
    v0 ^= b;

    v2 ^= 0xff;
    if (d == 4) {
	SIPROUND;
	SIPROUND;
	SIPROUND;
	SIPROUND;
    } else {
	for (i = 0; i < d; i++)
	    SIPROUND;
    }
    b = v0 ^ v1 ^ v2  ^ v3;
    return b;
}


static inline u64 _siphash24(u64 k0, u64 k1, const u8 *str, size_t len)
{
    return _siphash(2, 4, k0, k1, str, len);
}

#if defined(__i386)
# undef _siphash24

static u64 (*_siphash24)(u64 k0, u64 k1, const u8 *, size_t);

static void maybe_use_sse()
    __attribute__((constructor));

static void maybe_use_sse()
{
    uint32_t eax = 1, ebx, ecx, edx;

    __asm volatile
	("mov %%ebx, %%edi;" /* 32bit PIC: don't clobber ebx */
	 "cpuid;"
	 "mov %%ebx, %%esi;"
	 "mov %%edi, %%ebx;"
	 :"+a" (eax), "=S" (ebx), "=c" (ecx), "=d" (edx)
	 : :"edi");

    if (edx & (1 << 26))
	_siphash24 = hashable_siphash24_sse2;
    if (ecx & (1 << 19))
	_siphash24 = hashable_siphash24_sse41;
    else
	_siphash24 = plain_siphash24;
}

#endif

u64 hashable_siphash(int c, int d, u64 k0, u64 k1, const u8 *str, size_t len)
{
    return _siphash(c, d, k0, k1, str, len);
}

u64 hashable_siphash24(u64 k0, u64 k1, const u8 *str, size_t len)
{
    return _siphash24(k0, k1, str, len);
}

/* Used for ByteArray#s. We can't treat them like pointers in
   native Haskell, but we can in unsafe FFI calls.
 */
u64 hashable_siphash24_offset(u64 k0, u64 k1,
			      const u8 *str, size_t off, size_t len)
{
    return _siphash24(k0, k1, str + off, len);
}

static int _siphash_chunk(int c, int d, int buffered, u64 v[5],
			  const u8 *str, size_t len, size_t totallen)
{
    u64 v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3], m, b;
    const u8 *p, *end;
    u64 carry = 0;
    int i;

    if (buffered > 0) {
	int unbuffered = 8 - buffered;
	int tobuffer = unbuffered > len ? len : unbuffered;
	int shift = buffered << 3;

	m = odd_read(str, tobuffer, v[4], shift);
	str += tobuffer;
	buffered += tobuffer;
	len -= tobuffer;

	if (buffered < 8)
	    carry = m;
	else {
	    v3 ^= m;
	    if (c == 2) {
		SIPROUND;
		SIPROUND;
	    } else {
		for (i = 0; i < c; i++)
		    SIPROUND;
	    }
	    v0 ^= m;
	    buffered = 0;
	    m = 0;
	}
    }

    for (p = str, end = str + (len & ~7); p < end; p += 8) {
	m = *(u64 *) p;
	v3 ^= m;
	if (c == 2) {
	    SIPROUND;
	    SIPROUND;
	} else {
	    for (i = 0; i < c; i++)
		SIPROUND;
	}
	v0 ^= m;
    }

    b = odd_read(p, len & 7, 0, 0);

    if (totallen == -1) {
	v[0] = v0;
	v[1] = v1;
	v[2] = v2;
	v[3] = v3;
	v[4] = b | carry;

	return buffered + (len & 7);
    }

    b |= ((u64) totallen) << 56;

    v3 ^= b;
    if (c == 2) {
	SIPROUND;
	SIPROUND;
    } else {
	for (i = 0; i < c; i++)
	    SIPROUND;
    }
    v0 ^= b;

    v2 ^= 0xff;
    if (d == 4) {
	SIPROUND;
	SIPROUND;
	SIPROUND;
	SIPROUND;
    } else {
	for (i = 0; i < d; i++)
	    SIPROUND;
    }
    v[4] = v0 ^ v1 ^ v2  ^ v3;
    return 0;
}

void hashable_siphash_init(u64 k0, u64 k1, u64 *v)
{
    v[0] = 0x736f6d6570736575ull ^ k0;
    v[1] = 0x646f72616e646f6dull ^ k1;
    v[2] = 0x6c7967656e657261ull ^ k0;
    v[3] = 0x7465646279746573ull ^ k1;
    v[4] = 0;
}

int hashable_siphash24_chunk(int buffered, u64 v[5], const u8 *str,
			     size_t len, size_t totallen)
{
    return _siphash_chunk(2, 4, buffered, v, str, len, totallen);
}

/*
 * Used for ByteArray#.
 */
int hashable_siphash24_chunk_offset(int buffered, u64 v[5], const u8 *str,
				    size_t off, size_t len, size_t totallen)
{
    return _siphash_chunk(2, 4, buffered, v, str + off, len, totallen);
}