Coverage Report

Created: 2026-07-08 14:14

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