X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=folly%2FSpookyHashV2.cpp;h=0f623625a603f0364c2f82074e1c7f66cec72f18;hb=130d4f661978a9d43a5d16fefed41dd2ea213505;hp=6df4fc792ad1bc002c0a69b4f830b3ff01bf1aeb;hpb=5c77fedbef46995a71ffa268c9fcaf49efddd01b;p=folly.git diff --git a/folly/SpookyHashV2.cpp b/folly/SpookyHashV2.cpp index 6df4fc79..0f623625 100644 --- a/folly/SpookyHashV2.cpp +++ b/folly/SpookyHashV2.cpp @@ -1,5 +1,5 @@ /* - * Copyright 2013 Facebook, Inc. + * Copyright 2017 Facebook, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -23,13 +23,15 @@ // April 10 2012: buffer overflow on platforms without unaligned reads // July 12 2012: was passing out variables in final to in/out in short // July 30 2012: I reintroduced the buffer overflow -// August 5 2012: SpookyV2: d = should be d += in short hash, and remove extra mix from long hash +// August 5 2012: SpookyV2: d = should be d += in short hash, and remove +// extra mix from long hash -#include "folly/SpookyHashV2.h" +#include -#include +#include +#include -#define ALLOW_UNALIGNED_READS 1 +#include namespace folly { namespace hash { @@ -55,7 +57,7 @@ void SpookyHashV2::Short( u.p8 = (const uint8_t *)message; - if (!ALLOW_UNALIGNED_READS && (u.i & 0x7)) + if (!kHasUnalignedAccess && (u.i & 0x7)) { memcpy(buf, message, length); u.p64 = buf; @@ -97,37 +99,48 @@ void SpookyHashV2::Short( switch (remainder) { case 15: - d += ((uint64_t)u.p8[14]) << 48; + d += ((uint64_t)u.p8[14]) << 48; + FOLLY_FALLTHROUGH; case 14: d += ((uint64_t)u.p8[13]) << 40; + FOLLY_FALLTHROUGH; case 13: d += ((uint64_t)u.p8[12]) << 32; + FOLLY_FALLTHROUGH; case 12: d += u.p32[2]; c += u.p64[0]; break; case 11: d += ((uint64_t)u.p8[10]) << 16; + FOLLY_FALLTHROUGH; case 10: d += ((uint64_t)u.p8[9]) << 8; + FOLLY_FALLTHROUGH; case 9: d += (uint64_t)u.p8[8]; + FOLLY_FALLTHROUGH; case 8: c += u.p64[0]; break; case 7: c += ((uint64_t)u.p8[6]) << 48; + FOLLY_FALLTHROUGH; case 6: c += ((uint64_t)u.p8[5]) << 40; + FOLLY_FALLTHROUGH; case 5: c += ((uint64_t)u.p8[4]) << 32; + FOLLY_FALLTHROUGH; case 4: c += u.p32[0]; break; case 3: c += ((uint64_t)u.p8[2]) << 16; + FOLLY_FALLTHROUGH; case 2: c += ((uint64_t)u.p8[1]) << 8; + FOLLY_FALLTHROUGH; case 1: c += (uint64_t)u.p8[0]; break; @@ -175,7 +188,7 @@ void SpookyHashV2::Hash128( end = u.p64 + (length/sc_blockSize)*sc_numVars; // handle all whole sc_blockSize blocks of bytes - if (ALLOW_UNALIGNED_READS || ((u.i & 0x7) == 0)) + if (kHasUnalignedAccess || ((u.i & 0x7) == 0)) { while (u.p64 < end) { @@ -197,7 +210,7 @@ void SpookyHashV2::Hash128( remainder = (length - ((const uint8_t *)end-(const uint8_t *)message)); memcpy(buf, end, remainder); memset(((uint8_t *)buf)+remainder, 0, sc_blockSize-remainder); - ((uint8_t *)buf)[sc_blockSize-1] = remainder; + ((uint8_t*)buf)[sc_blockSize - 1] = uint8_t(remainder); // do some final mixing End(buf, h0,h1,h2,h3,h4,h5,h6,h7,h8,h9,h10,h11); @@ -283,7 +296,7 @@ void SpookyHashV2::Update(const void *message, size_t length) // handle all whole blocks of sc_blockSize bytes end = u.p64 + (length/sc_blockSize)*sc_numVars; remainder = (uint8_t)(length-((const uint8_t *)end-u.p8)); - if (ALLOW_UNALIGNED_READS || (u.i & 0x7) == 0) + if (kHasUnalignedAccess || (u.i & 0x7) == 0) { while (u.p64 < end) { @@ -322,7 +335,7 @@ void SpookyHashV2::Update(const void *message, size_t length) // report the hash for the concatenation of all message fragments so far -void SpookyHashV2::Final(uint64_t *hash1, uint64_t *hash2) +void SpookyHashV2::Final(uint64_t *hash1, uint64_t *hash2) const { // init the variables if (m_length < sc_bufSize) @@ -333,7 +346,9 @@ void SpookyHashV2::Final(uint64_t *hash1, uint64_t *hash2) return; } - const uint64_t *data = (const uint64_t *)m_data; + uint64_t buf[2*sc_numVars]; + memcpy(buf, m_data, sizeof(buf)); + uint64_t *data = buf; uint8_t remainder = m_remainder; uint64_t h0 = m_state[0];