Newer
Older
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
# Copyright (C) 2017 The Software Heritage developers
# See the AUTHORS file at the top-level directory of this distribution
# License: GNU General Public License version 3, or any later version
# See top-level LICENSE file for more information
import unittest
from swh.model import merkle
class TestedMerkleNode(merkle.MerkleNode):
type = 'tested_merkle_node_type'
def __init__(self, data):
super().__init__(data)
self.compute_hash_called = 0
def compute_hash(self):
self.compute_hash_called += 1
child_data = [
child + b'=' + self[child].hash
for child in sorted(self)
]
return (
b'hash('
+ b', '.join([self.data['value']] + child_data)
+ b')'
)
class TestedMerkleLeaf(merkle.MerkleLeaf):
type = 'tested_merkle_leaf_type'
def __init__(self, data):
super().__init__(data)
self.compute_hash_called = 0
def compute_hash(self):
self.compute_hash_called += 1
return b'hash(' + self.data['value'] + b')'
class TestMerkleLeaf(unittest.TestCase):
def setUp(self):
self.data = {'value': b'value'}
self.instance = TestedMerkleLeaf(self.data)
def test_hash(self):
self.assertEqual(self.instance.compute_hash_called, 0)
instance_hash = self.instance.hash
self.assertEqual(self.instance.compute_hash_called, 1)
instance_hash2 = self.instance.hash
self.assertEqual(self.instance.compute_hash_called, 1)
self.assertEqual(instance_hash, instance_hash2)
def test_data(self):
self.assertEqual(self.instance.get_data(), self.data)
def test_collect(self):
collected = self.instance.collect()
self.assertEqual(
collected, {
self.instance.type: {
self.instance.hash: self.instance.get_data(),
},
},
)
collected2 = self.instance.collect()
self.assertEqual(collected2, {})
self.instance.reset_collect()
collected3 = self.instance.collect()
self.assertEqual(collected, collected3)
def test_leaf(self):
with self.assertRaisesRegex(ValueError, 'is a leaf'):
self.instance[b'key1'] = 'Test'
with self.assertRaisesRegex(ValueError, 'is a leaf'):
del self.instance[b'key1']
with self.assertRaisesRegex(ValueError, 'is a leaf'):
self.instance[b'key1']
with self.assertRaisesRegex(ValueError, 'is a leaf'):
self.instance.update(self.data)
class TestMerkleNode(unittest.TestCase):
maxDiff = None
def setUp(self):
self.root = TestedMerkleNode({'value': b'root'})
self.nodes = {b'root': self.root}
for i in (b'a', b'b', b'c'):
value = b'root/' + i
node = TestedMerkleNode({
'value': value,
})
self.root[i] = node
self.nodes[value] = node
for j in (b'a', b'b', b'c'):
value2 = value + b'/' + j
node2 = TestedMerkleNode({
'value': value2,
})
node[j] = node2
self.nodes[value2] = node2
for k in (b'a', b'b', b'c'):
value3 = value2 + b'/' + j
node3 = TestedMerkleNode({
'value': value3,
})
node2[j] = node3
self.nodes[value3] = node3
def test_hash(self):
for node in self.nodes.values():
self.assertEqual(node.compute_hash_called, 0)
# Root hash will compute hash for all the nodes
hash = self.root.hash
for node in self.nodes.values():
self.assertEqual(node.compute_hash_called, 1)
self.assertIn(node.data['value'], hash)
# Should use the cached value
hash2 = self.root.hash
self.assertEqual(hash, hash2)
for node in self.nodes.values():
self.assertEqual(node.compute_hash_called, 1)
# Should still use the cached value
hash3 = self.root.update_hash(force=False)
self.assertEqual(hash, hash3)
for node in self.nodes.values():
self.assertEqual(node.compute_hash_called, 1)
# Force update of the cached value for a deeply nested node
self.root[b'a'][b'b'].update_hash(force=True)
for key, node in self.nodes.items():
# update_hash rehashes all children
if key.startswith(b'root/a/b'):
self.assertEqual(node.compute_hash_called, 2)
else:
self.assertEqual(node.compute_hash_called, 1)
hash4 = self.root.hash
self.assertEqual(hash, hash4)
for key, node in self.nodes.items():
# update_hash also invalidates all parents
if key in (b'root', b'root/a') or key.startswith(b'root/a/b'):
self.assertEqual(node.compute_hash_called, 2)
else:
self.assertEqual(node.compute_hash_called, 1)
def test_collect(self):
collected = self.root.collect()
self.assertEqual(len(collected[self.root.type]), len(self.nodes))
for node in self.nodes.values():
self.assertTrue(node.collected)
collected2 = self.root.collect()
self.assertEqual(collected2, {})
def test_get(self):
for key in (b'a', b'b', b'c'):
self.assertEqual(self.root[key], self.nodes[b'root/' + key])
with self.assertRaisesRegex(KeyError, "b'nonexistent'"):
self.root[b'nonexistent']
def test_del(self):
hash_root = self.root.hash
hash_a = self.nodes[b'root/a'].hash
del self.root[b'a'][b'c']
hash_root2 = self.root.hash
hash_a2 = self.nodes[b'root/a'].hash
self.assertNotEqual(hash_root, hash_root2)
self.assertNotEqual(hash_a, hash_a2)
self.assertEqual(self.nodes[b'root/a/c'].parents, [])
with self.assertRaisesRegex(KeyError, "b'nonexistent'"):
del self.root[b'nonexistent']
def test_update(self):
hash_root = self.root.hash
hash_b = self.root[b'b'].hash
new_children = {
b'c': TestedMerkleNode({'value': b'root/b/new_c'}),
b'd': TestedMerkleNode({'value': b'root/b/d'}),
}
# collect all nodes
self.root.collect()
self.root[b'b'].update(new_children)
# Ensure everyone got reparented
self.assertEqual(new_children[b'c'].parents, [self.root[b'b']])
self.assertEqual(new_children[b'd'].parents, [self.root[b'b']])
self.assertEqual(self.nodes[b'root/b/c'].parents, [])
hash_root2 = self.root.hash
self.assertNotEqual(hash_root, hash_root2)
self.assertIn(b'root/b/new_c', hash_root2)
self.assertIn(b'root/b/d', hash_root2)
hash_b2 = self.root[b'b'].hash
self.assertNotEqual(hash_b, hash_b2)
for key, node in self.nodes.items():
if key in (b'root', b'root/b'):
self.assertEqual(node.compute_hash_called, 2)
else:
self.assertEqual(node.compute_hash_called, 1)
# Ensure we collected root, root/b, and both new children
collected_after_update = self.root.collect()
self.assertCountEqual(
collected_after_update[TestedMerkleNode.type],
[self.nodes[b'root'].hash, self.nodes[b'root/b'].hash,
new_children[b'c'].hash, new_children[b'd'].hash],
)
# test that noop updates doesn't invalidate anything
self.root[b'a'][b'b'].update({})
self.assertEqual(self.root.collect(), {})