Coverage Report

Created: 2026-06-01 18:35

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