Coverage Report

Created: 2026-06-16 16:41

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
5.23G
#define SIPROUND do { \
14
5.23G
    v0 += v1; v1 = std::rotl(v1, 13); v1 ^= v0; \
15
5.23G
    v0 = std::rotl(v0, 32); \
16
5.23G
    v2 += v3; v3 = std::rotl(v3, 16); v3 ^= v2; \
17
5.23G
    v0 += v3; v3 = std::rotl(v3, 21); v3 ^= v0; \
18
5.23G
    v2 += v1; v1 = std::rotl(v1, 17); v1 ^= v2; \
19
5.23G
    v2 = std::rotl(v2, 32); \
20
5.23G
} while (0)
21
22
6.64M
CSipHasher::CSipHasher(uint64_t k0, uint64_t k1) : m_state{k0, k1} {}
23
24
CSipHasher& CSipHasher::Write(uint64_t data)
25
4.77M
{
26
4.77M
    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.77M
    assert(m_count % 8 == 0);
29
30
4.77M
    v3 ^= data;
31
4.77M
    SIPROUND;
32
4.77M
    SIPROUND;
33
4.77M
    v0 ^= data;
34
35
4.77M
    m_state.v[0] = v0;
36
4.77M
    m_state.v[1] = v1;
37
4.77M
    m_state.v[2] = v2;
38
4.77M
    m_state.v[3] = v3;
39
40
4.77M
    m_count += 8;
41
4.77M
    return *this;
42
4.77M
}
43
44
CSipHasher& CSipHasher::Write(std::span<const unsigned char> data)
45
6.64M
{
46
6.64M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
47
6.64M
    uint64_t t = m_tmp;
48
6.64M
    uint8_t c = m_count;
49
50
221M
    while (data.size() > 0) {
51
214M
        t |= uint64_t{data.front()} << (8 * (c % 8));
52
214M
        c++;
53
214M
        if ((c & 7) == 0) {
54
25.6M
            v3 ^= t;
55
25.6M
            SIPROUND;
56
25.6M
            SIPROUND;
57
25.6M
            v0 ^= t;
58
25.6M
            t = 0;
59
25.6M
        }
60
214M
        data = data.subspan(1);
61
214M
    }
62
63
6.64M
    m_state.v[0] = v0;
64
6.64M
    m_state.v[1] = v1;
65
6.64M
    m_state.v[2] = v2;
66
6.64M
    m_state.v[3] = v3;
67
6.64M
    m_count = c;
68
6.64M
    m_tmp = t;
69
70
6.64M
    return *this;
71
6.64M
}
72
73
uint64_t CSipHasher::Finalize() const
74
6.64M
{
75
6.64M
    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.64M
    uint64_t t = m_tmp | (((uint64_t)m_count) << 56);
78
79
6.64M
    v3 ^= t;
80
6.64M
    SIPROUND;
81
6.64M
    SIPROUND;
82
6.64M
    v0 ^= t;
83
6.64M
    v2 ^= 0xFF;
84
6.64M
    SIPROUND;
85
6.64M
    SIPROUND;
86
6.64M
    SIPROUND;
87
6.64M
    SIPROUND;
88
6.64M
    return v0 ^ v1 ^ v2 ^ v3;
89
6.64M
}
90
91
uint64_t PresaltedSipHasher::operator()(const uint256& val) const noexcept
92
58.1M
{
93
58.1M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
94
58.1M
    uint64_t d = val.GetUint64(0);
95
58.1M
    v3 ^= d;
96
97
58.1M
    SIPROUND;
98
58.1M
    SIPROUND;
99
58.1M
    v0 ^= d;
100
58.1M
    d = val.GetUint64(1);
101
58.1M
    v3 ^= d;
102
58.1M
    SIPROUND;
103
58.1M
    SIPROUND;
104
58.1M
    v0 ^= d;
105
58.1M
    d = val.GetUint64(2);
106
58.1M
    v3 ^= d;
107
58.1M
    SIPROUND;
108
58.1M
    SIPROUND;
109
58.1M
    v0 ^= d;
110
58.1M
    d = val.GetUint64(3);
111
58.1M
    v3 ^= d;
112
58.1M
    SIPROUND;
113
58.1M
    SIPROUND;
114
58.1M
    v0 ^= d;
115
58.1M
    v3 ^= (uint64_t{4}) << 59;
116
58.1M
    SIPROUND;
117
58.1M
    SIPROUND;
118
58.1M
    v0 ^= (uint64_t{4}) << 59;
119
58.1M
    v2 ^= 0xFF;
120
58.1M
    SIPROUND;
121
58.1M
    SIPROUND;
122
58.1M
    SIPROUND;
123
58.1M
    SIPROUND;
124
58.1M
    return v0 ^ v1 ^ v2 ^ v3;
125
58.1M
}
126
127
/** Specialized implementation for efficiency */
128
uint64_t PresaltedSipHasher::operator()(const uint256& val, uint32_t extra) const noexcept
129
308M
{
130
308M
    uint64_t v0 = m_state.v[0], v1 = m_state.v[1], v2 = m_state.v[2], v3 = m_state.v[3];
131
308M
    uint64_t d = val.GetUint64(0);
132
308M
    v3 ^= d;
133
308M
    SIPROUND;
134
308M
    SIPROUND;
135
308M
    v0 ^= d;
136
308M
    d = val.GetUint64(1);
137
308M
    v3 ^= d;
138
308M
    SIPROUND;
139
308M
    SIPROUND;
140
308M
    v0 ^= d;
141
308M
    d = val.GetUint64(2);
142
308M
    v3 ^= d;
143
308M
    SIPROUND;
144
308M
    SIPROUND;
145
308M
    v0 ^= d;
146
308M
    d = val.GetUint64(3);
147
308M
    v3 ^= d;
148
308M
    SIPROUND;
149
308M
    SIPROUND;
150
308M
    v0 ^= d;
151
308M
    d = ((uint64_t{36}) << 56) | extra;
152
308M
    v3 ^= d;
153
308M
    SIPROUND;
154
308M
    SIPROUND;
155
308M
    v0 ^= d;
156
308M
    v2 ^= 0xFF;
157
308M
    SIPROUND;
158
308M
    SIPROUND;
159
308M
    SIPROUND;
160
308M
    SIPROUND;
161
308M
    return v0 ^ v1 ^ v2 ^ v3;
162
308M
}