mirror of
https://github.com/bitcoin/bitcoin.git
synced 2026-02-01 03:01:05 +00:00
9ca52a4cbe
Replaces standalone `SipHashUint256` with an `operator()` overload in `PresaltedSipHasher`. Updates all hasher classes (`SaltedUint256Hasher`, `SaltedTxidHasher`, `SaltedWtxidHasher`) to use `PresaltedSipHasher` internally, enabling the same constant-state caching optimization while keeping behavior unchanged. Benchmark was also adjusted to cache the salting part.
171 lines
3.2 KiB
C++
171 lines
3.2 KiB
C++
// Copyright (c) 2016-present The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <crypto/siphash.h>
|
|
|
|
#include <uint256.h>
|
|
|
|
#include <bit>
|
|
#include <cassert>
|
|
#include <span>
|
|
|
|
#define SIPROUND do { \
|
|
v0 += v1; v1 = std::rotl(v1, 13); v1 ^= v0; \
|
|
v0 = std::rotl(v0, 32); \
|
|
v2 += v3; v3 = std::rotl(v3, 16); v3 ^= v2; \
|
|
v0 += v3; v3 = std::rotl(v3, 21); v3 ^= v0; \
|
|
v2 += v1; v1 = std::rotl(v1, 17); v1 ^= v2; \
|
|
v2 = std::rotl(v2, 32); \
|
|
} while (0)
|
|
|
|
CSipHasher::CSipHasher(uint64_t k0, uint64_t k1)
|
|
{
|
|
v[0] = C0 ^ k0;
|
|
v[1] = C1 ^ k1;
|
|
v[2] = C2 ^ k0;
|
|
v[3] = C3 ^ k1;
|
|
count = 0;
|
|
tmp = 0;
|
|
}
|
|
|
|
CSipHasher& CSipHasher::Write(uint64_t data)
|
|
{
|
|
uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
|
|
|
|
assert(count % 8 == 0);
|
|
|
|
v3 ^= data;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= data;
|
|
|
|
v[0] = v0;
|
|
v[1] = v1;
|
|
v[2] = v2;
|
|
v[3] = v3;
|
|
|
|
count += 8;
|
|
return *this;
|
|
}
|
|
|
|
CSipHasher& CSipHasher::Write(std::span<const unsigned char> data)
|
|
{
|
|
uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
|
|
uint64_t t = tmp;
|
|
uint8_t c = count;
|
|
|
|
while (data.size() > 0) {
|
|
t |= uint64_t{data.front()} << (8 * (c % 8));
|
|
c++;
|
|
if ((c & 7) == 0) {
|
|
v3 ^= t;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= t;
|
|
t = 0;
|
|
}
|
|
data = data.subspan(1);
|
|
}
|
|
|
|
v[0] = v0;
|
|
v[1] = v1;
|
|
v[2] = v2;
|
|
v[3] = v3;
|
|
count = c;
|
|
tmp = t;
|
|
|
|
return *this;
|
|
}
|
|
|
|
uint64_t CSipHasher::Finalize() const
|
|
{
|
|
uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
|
|
|
|
uint64_t t = tmp | (((uint64_t)count) << 56);
|
|
|
|
v3 ^= t;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= t;
|
|
v2 ^= 0xFF;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
return v0 ^ v1 ^ v2 ^ v3;
|
|
}
|
|
|
|
uint64_t PresaltedSipHasher::operator()(const uint256& val) const noexcept
|
|
{
|
|
uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
|
|
uint64_t d = val.GetUint64(0);
|
|
v3 ^= d;
|
|
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(1);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(2);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(3);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
v3 ^= (uint64_t{4}) << 59;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= (uint64_t{4}) << 59;
|
|
v2 ^= 0xFF;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
return v0 ^ v1 ^ v2 ^ v3;
|
|
}
|
|
|
|
/** Specialized implementation for efficiency */
|
|
uint64_t PresaltedSipHasher::operator()(const uint256& val, uint32_t extra) const noexcept
|
|
{
|
|
uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
|
|
uint64_t d = val.GetUint64(0);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(1);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(2);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = val.GetUint64(3);
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
d = ((uint64_t{36}) << 56) | extra;
|
|
v3 ^= d;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
v0 ^= d;
|
|
v2 ^= 0xFF;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
SIPROUND;
|
|
return v0 ^ v1 ^ v2 ^ v3;
|
|
}
|