Coverage Report

Created: 2026-05-06 07:53

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