Coverage Report

Created: 2026-07-14 18:13

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/bitcoin/src/hash.cpp
Line
Count
Source
1
// Copyright (c) 2013-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 <hash.h>
6
#include <span.h>
7
#include <crypto/common.h>
8
#include <crypto/hmac_sha512.h>
9
10
#include <bit>
11
#include <string>
12
13
unsigned int MurmurHash3(unsigned int nHashSeed, std::span<const unsigned char> vDataToHash)
14
151M
{
15
    // The following is MurmurHash3 (x86_32), see https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp
16
151M
    uint32_t h1 = nHashSeed;
17
151M
    const uint32_t c1 = 0xcc9e2d51;
18
151M
    const uint32_t c2 = 0x1b873593;
19
20
151M
    const int nblocks = vDataToHash.size() / 4;
21
22
    //----------
23
    // body
24
151M
    const uint8_t* blocks = vDataToHash.data();
25
26
1.39G
    for (int i = 0; i < nblocks; ++i) {
  Branch (26:21): [True: 1.23G, False: 151M]
27
1.23G
        uint32_t k1 = ReadLE32(blocks + i*4);
28
29
1.23G
        k1 *= c1;
30
1.23G
        k1 = std::rotl(k1, 15);
31
1.23G
        k1 *= c2;
32
33
1.23G
        h1 ^= k1;
34
1.23G
        h1 = std::rotl(h1, 13);
35
1.23G
        h1 = h1 * 5 + 0xe6546b64;
36
1.23G
    }
37
38
    //----------
39
    // tail
40
151M
    const uint8_t* tail = vDataToHash.data() + nblocks * 4;
41
42
151M
    uint32_t k1 = 0;
43
44
151M
    switch (vDataToHash.size() & 3) {
  Branch (44:13): [True: 145M, False: 6.71M]
45
2.55k
        case 3:
  Branch (45:9): [True: 2.55k, False: 151M]
46
2.55k
            k1 ^= tail[2] << 16;
47
2.55k
            [[fallthrough]];
48
6.71M
        case 2:
  Branch (48:9): [True: 6.70M, False: 145M]
49
6.71M
            k1 ^= tail[1] << 8;
50
6.71M
            [[fallthrough]];
51
6.71M
        case 1:
  Branch (51:9): [True: 4.99k, False: 151M]
52
6.71M
            k1 ^= tail[0];
53
6.71M
            k1 *= c1;
54
6.71M
            k1 = std::rotl(k1, 15);
55
6.71M
            k1 *= c2;
56
6.71M
            h1 ^= k1;
57
151M
    }
58
59
    //----------
60
    // finalization
61
151M
    h1 ^= vDataToHash.size();
62
151M
    h1 ^= h1 >> 16;
63
151M
    h1 *= 0x85ebca6b;
64
151M
    h1 ^= h1 >> 13;
65
151M
    h1 *= 0xc2b2ae35;
66
151M
    h1 ^= h1 >> 16;
67
68
151M
    return h1;
69
151M
}
70
71
void BIP32Hash(const ChainCode &chainCode, unsigned int nChild, unsigned char header, const unsigned char data[32], unsigned char output[64])
72
0
{
73
0
    unsigned char num[4];
74
0
    WriteBE32(num, nChild);
75
0
    CHMAC_SHA512(chainCode.begin(), chainCode.size()).Write(&header, 1).Write(data, 32).Write(num, 4).Finalize(output);
76
0
}
77
78
uint256 SHA256Uint256(const uint256& input)
79
1.51M
{
80
1.51M
    uint256 result;
81
1.51M
    CSHA256().Write(input.begin(), 32).Finalize(result.begin());
82
1.51M
    return result;
83
1.51M
}
84
85
HashWriter TaggedHash(const std::string& tag)
86
135
{
87
135
    HashWriter writer{};
88
135
    uint256 taghash;
89
135
    CSHA256().Write((const unsigned char*)tag.data(), tag.size()).Finalize(taghash.begin());
90
135
    writer << taghash << taghash;
91
135
    return writer;
92
135
}