blob: efa1f1ef48c909badbf00d977343ec916e539c99 (
plain)
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
|
#!/usr/bin/python
# This file is part of the dvisvgm package and published under the
# terms of the GNU General Public License version 3 or later.
# See file COPYING for further details.
# Copyright (C) 2016-2023 Martin Gieseking <martin.gieseking@uos.de>
import re
import sys
def extract_hashes (fname):
with open(fname) as f:
lines = f.readlines()
found = False
for line in lines:
if ' hash2unicode {{\n' in line:
found = True
elif found:
match = re.match(r'\s*{(0x[0-9a-f]{8}),\s*0x[0-9a-f]{4}}, //\s*(.+)\s*$', line)
if match:
hashval = match.group(1)
name = match.group(2)
print('\t{}{}, "{}"{},'.format('{', hashval, name, '}'))
else:
found = False
if (len(sys.argv) < 2):
sys.exit(1)
print("""\
#include <xxhash.h>
#include <cstdint>
#include <iterator>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
struct NameHash {
uint32_t hash;
string name;
} nameHashes[] = {\
""")
extract_hashes(sys.argv[1])
print(r"""};
int main () {
if (distance(begin(nameHashes), end(nameHashes)) == 0) {
cout << "hash table is empty\n";
return 1;
}
uint32_t prev_hash=0;
for (NameHash &nameHash : nameHashes) {
const string &name = nameHash.name;
const uint32_t hash = nameHash.hash;
if (XXH32(&name[0], name.length(), 0) != hash) {
cout << "hash of '" << name << "' doesn't match\n";
return 1;
}
if (hash < prev_hash) {
cout << "misplaced hash value " << hex << setw(8) << setfill('0') << hash << "\n";
return 1;
}
if (hash == prev_hash) {
cout << "colliding hash values " << hex << setw(8) << setfill('0') << hash << "\n";
return 1;
}
prev_hash = hash;
}
cout << "hash check passed\n";
return 0;
}
""")
|
