Coverage Report

Created: 2026-07-14 18:13

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