1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include "rfc_sha1.h"
#include <vespa/vespalib/util/sha1.h>
#include <vespa/vespalib/stllike/string.h>
using namespace vespalib;
struct Digest {
char buf[20];
Digest() {
for (size_t i = 0; i < 20; ++i) {
buf[i] = ((rand() >> 12) & 0xff);
}
}
vespalib::string as_string() const {
const char *sym = "0123456789ABCDEF";
vespalib::string res;
for (size_t i = 0; i < 20; ++i) {
res.append(sym[(buf[i] >> 4) & 0xf]);
res.append(sym[buf[i] & 0xf]);
}
return ("0x" + res);
}
bool operator==(const Digest &rhs) const {
for (size_t i = 0; i < 20; ++i) {
if (buf[i] != rhs.buf[i]) {
return false;
}
}
return true;
}
};
std::ostream &operator <<(std::ostream &out, const Digest &digest) {
out << digest.as_string();
return out;
}
Digest digest(const char *data, size_t size) {
Digest result;
Sha1::hash(data, size, result.buf, 20);
return result;
}
Digest rfc_digest(const char *data, size_t size) {
Digest result;
SHA1Context ctx;
SHA1Reset(&ctx);
SHA1Input(&ctx, (const uint8_t *)data, size);
SHA1Result(&ctx, (unsigned char *)result.buf);
return result;
}
struct Data {
char buf[5000];
Data() {
srand(42);
for (size_t i = 0; i < sizeof(buf); ++i) {
buf[i] = ((rand() >> 12) & 0xff);
}
}
size_t max() const { return sizeof(buf); }
Digest inc_digest(std::initializer_list<size_t> chunks) const {
Digest result;
Sha1 sha;
uint32_t ofs = 0;
for (auto chunk: chunks) {
ASSERT_LESS_EQUAL(ofs + chunk, max());
sha.process(buf + ofs, chunk);
ofs += chunk;
}
ASSERT_EQUAL(ofs, max());
sha.get_digest(result.buf);
return result;
}
};
TEST("require that reference implementation passes SHA1 smoke test") {
EXPECT_EQUAL("0xA9993E364706816ABA3E25717850C26C9CD0D89D", rfc_digest("abc", 3).as_string());
}
TEST("require that production implementation passes SHA1 smoke test") {
EXPECT_EQUAL("0xA9993E364706816ABA3E25717850C26C9CD0D89D", digest("abc", 3).as_string());
}
TEST_F("require that random data hashes to the same as reference implementation", Data()) {
for (size_t size = 0; size <= f1.max(); ++size) {
EXPECT_EQUAL(rfc_digest(f1.buf, size), digest(f1.buf, size));
}
}
TEST_F("require that incremental and all-in-one hashing produces the same result", Data()) {
EXPECT_EQUAL(digest(f1.buf, f1.max()),
f1.inc_digest({ 1000, 1000, 1000, 1000, 1000 }));
EXPECT_EQUAL(digest(f1.buf, f1.max()),
f1.inc_digest({ 10, 10, 10, 10, 10, 10, 4, 64, 64, 64, 128, 75, 75, 2500, 1966 }));
EXPECT_EQUAL(digest(f1.buf, f1.max()),
f1.inc_digest({ 64, 64, 128, 256, 10, 10, 10, 10, 10, 10, 10, 100, 4318 }));
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
