Coverage Report

Created: 2026-06-03 10:44

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/tmp/bitcoin/src/crypto/siphash.cpp
Line
Count
Source
1
// Copyright (c) 2016-present The Bitcoin Core developers
2
// Distributed under the MIT software license, see the accompanying
3
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
4
5
#include <crypto/siphash.h>
6
7
#include <uint256.h>
8
9
#include <bit>
10
#include <cassert>
11
#include <span>
12
13
4.48G
#define SIPROUND do { \
14
4.48G
    v0 += v1; v1 = std::rotl(v1, 13); v1 ^= v0; \
15
4.48G
    v0 = std::rotl(v0, 32); \
16
4.48G
    v2 += v3; v3 = std::rotl(v3, 16); v3 ^= v2; \
17
4.48G
    v0 += v3; v3 = std::rotl(v3, 21); v3 ^= v0; \
18
4.48G
    v2 += v1; v1 = std::rotl(v1, 17); v1 ^= v2; \
19
4.48G
    v2 = std::rotl(v2, 32); \
20
4.48G
} while (0)
21
22
6.35M
CSipHasher::CSipHasher(uint64_t k0, uint64_t k1) : m_state{k0, k1} {}
23
24
CSipHasher& CSipHasher::Write(uint64_t data)
25
4.48M
{
26
4.48M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
27
28
4.48M
    assert(m_count % 8 == 0);
29
30
4.48M
    v3 ^= data;
31
4.48M
    SIPROUND;
32
4.48M
    SIPROUND;
33
4.48M
    v0 ^= data;
34
35
4.48M
    m_state.v[0] = v0;
36
4.48M
    m_state.v[1] = v1;
37
4.48M
    m_state.v[2] = v2;
38
4.48M
    m_state.v[3] = v3;
39
40
4.48M
    m_count += 8;
41
4.48M
    return *this;
42
4.48M
}
43
44
CSipHasher& CSipHasher::Write(std::span<const unsigned char> data)
45
6.35M
{
46
6.35M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
47
6.35M
    uint64_t t = m_tmp;
48
6.35M
    uint8_t c = m_count;
49
50
211M
    while (data.size() > 0) {
51
205M
        t |= uint64_t{data.front()} << (8 * (c % 8));
52
205M
        c++;
53
205M
        if ((c & 7) == 0) {
54
24.3M
            v3 ^= t;
55
24.3M
            SIPROUND;
56
24.3M
            SIPROUND;
57
24.3M
            v0 ^= t;
58
24.3M
            t = 0;
59
24.3M
        }
60
205M
        data = data.subspan(1);
61
205M
    }
62
63
6.35M
    m_state.v[0] = v0;
64
6.35M
    m_state.v[1] = v1;
65
6.35M
    m_state.v[2] = v2;
66
6.35M
    m_state.v[3] = v3;
67
6.35M
    m_count = c;
68
6.35M
    m_tmp = t;
69
70
6.35M
    return *this;
71
6.35M
}
72
73
uint64_t CSipHasher::Finalize() const
74
6.35M
{
75
6.35M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
76
77
6.35M
    uint64_t t = m_tmp | (((uint64_t)m_count) << 56);
78
79
6.35M
    v3 ^= t;
80
6.35M
    SIPROUND;
81
6.35M
    SIPROUND;
82
6.35M
    v0 ^= t;
83
6.35M
    v2 ^= 0xFF;
84
6.35M
    SIPROUND;
85
6.35M
    SIPROUND;
86
6.35M
    SIPROUND;
87
6.35M
    SIPROUND;
88
6.35M
    return v0 ^ v1 ^ v2 ^ v3;
89
6.35M
}
90
91
uint64_t PresaltedSipHasher::operator()(const uint256& val) const noexcept
92
47.4M
{
93
47.4M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
94
47.4M
    uint64_t d = val.GetUint64(0);
95
47.4M
    v3 ^= d;
96
97
47.4M
    SIPROUND;
98
47.4M
    SIPROUND;
99
47.4M
    v0 ^= d;
100
47.4M
    d = val.GetUint64(1);
101
47.4M
    v3 ^= d;
102
47.4M
    SIPROUND;
103
47.4M
    SIPROUND;
104
47.4M
    v0 ^= d;
105
47.4M
    d = val.GetUint64(2);
106
47.4M
    v3 ^= d;
107
47.4M
    SIPROUND;
108
47.4M
    SIPROUND;
109
47.4M
    v0 ^= d;
110
47.4M
    d = val.GetUint64(3);
111
47.4M
    v3 ^= d;
112
47.4M
    SIPROUND;
113
47.4M
    SIPROUND;
114
47.4M
    v0 ^= d;
115
47.4M
    v3 ^= (uint64_t{4}) << 59;
116
47.4M
    SIPROUND;
117
47.4M
    SIPROUND;
118
47.4M
    v0 ^= (uint64_t{4}) << 59;
119
47.4M
    v2 ^= 0xFF;
120
47.4M
    SIPROUND;
121
47.4M
    SIPROUND;
122
47.4M
    SIPROUND;
123
47.4M
    SIPROUND;
124
47.4M
    return v0 ^ v1 ^ v2 ^ v3;
125
47.4M
}
126
127
/** Specialized implementation for efficiency */
128
uint64_t PresaltedSipHasher::operator()(const uint256& val, uint32_t extra) const noexcept
129
266M
{
130
266M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
131
266M
    uint64_t d = val.GetUint64(0);
132
266M
    v3 ^= d;
133
266M
    SIPROUND;
134
266M
    SIPROUND;
135
266M
    v0 ^= d;
136
266M
    d = val.GetUint64(1);
137
266M
    v3 ^= d;
138
266M
    SIPROUND;
139
266M
    SIPROUND;
140
266M
    v0 ^= d;
141
266M
    d = val.GetUint64(2);
142
266M
    v3 ^= d;
143
266M
    SIPROUND;
144
266M
    SIPROUND;
145
266M
    v0 ^= d;
146
266M
    d = val.GetUint64(3);
147
266M
    v3 ^= d;
148
266M
    SIPROUND;
149
266M
    SIPROUND;
150
266M
    v0 ^= d;
151
266M
    d = ((uint64_t{36}) << 56) | extra;
152
266M
    v3 ^= d;
153
266M
    SIPROUND;
154
266M
    SIPROUND;
155
266M
    v0 ^= d;
156
266M
    v2 ^= 0xFF;
157
266M
    SIPROUND;
158
266M
    SIPROUND;
159
266M
    SIPROUND;
160
266M
    SIPROUND;
161
266M
    return v0 ^ v1 ^ v2 ^ v3;
162
266M
}