mirror/borg
1
0
Fork 0
mirror of https://github.com/borgbackup/borg.git synced 2025-01-04 06:21:46 +00:00
Code Issues Releases Wiki Activity

hashindex.py: make .compact tests independent of order

Browse source
This commit is contained in:
Dan Christensen 2023-02-11 17:37:53 -05:00
parent 133ffebc8d
commit 51b29ab426
1 changed files with 35 additions and 43 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

78
src/borg/testsuite/hashindex.py
View file

@ -464,17 +464,6 @@ def index_from_data(self):
index = ChunkIndex.read(self.index_data)
return index
def index_to_data(self, index):
data = io.BytesIO()
index.write(data)
return data.getvalue()
def index_from_data_compact_to_data(self):
index = self.index_from_data()
index.compact()
compact_index = self.index_to_data(index)
return compact_index
def write_entry(self, key, *values):
self.index_data.write(key)
for value in values:
@ -486,6 +475,11 @@ def write_empty(self, key):
def write_deleted(self, key):
self.write_entry(key, 0xFFFFFFFE, 0, 0)
def compare_indexes(self, idx1, idx2):
for k, v in idx1.iteritems():
assert v == idx2[k]
assert len(idx1) == len(idx2)
def test_simple(self):
self.index(num_entries=3, num_buckets=6, num_empty=2)
self.write_entry(H2(0), 1, 2, 3)
@ -495,13 +489,12 @@ def test_simple(self):
self.write_entry(H2(4), 8, 9, 10)
self.write_empty(H2(5))
compact_index = self.index_from_data_compact_to_data()
self.index(num_entries=3, num_buckets=3, num_empty=0)
self.write_entry(H2(0), 1, 2, 3)
self.write_entry(H2(3), 5, 6, 7)
self.write_entry(H2(4), 8, 9, 10)
assert compact_index == self.index_data.getvalue()
idx = self.index_from_data()
cpt = self.index_from_data()
cpt.compact()
assert idx.size() == 1024 + 6 * (32 + 3 * 4)
assert cpt.size() == 1024 + 3 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_first_empty(self):
self.index(num_entries=3, num_buckets=6, num_empty=2)
@ -512,13 +505,12 @@ def test_first_empty(self):
self.write_entry(H2(4), 8, 9, 10)
self.write_empty(H2(5))
compact_index = self.index_from_data_compact_to_data()
self.index(num_entries=3, num_buckets=3, num_empty=0)
self.write_entry(H2(0), 1, 2, 3)
self.write_entry(H2(3), 5, 6, 7)
self.write_entry(H2(4), 8, 9, 10)
assert compact_index == self.index_data.getvalue()
idx = self.index_from_data()
cpt = self.index_from_data()
cpt.compact()
assert idx.size() == 1024 + 6 * (32 + 3 * 4)
assert cpt.size() == 1024 + 3 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_last_used(self):
self.index(num_entries=3, num_buckets=6, num_empty=2)
@ -529,13 +521,12 @@ def test_last_used(self):
self.write_empty(H2(5))
self.write_entry(H2(4), 8, 9, 10)
compact_index = self.index_from_data_compact_to_data()
self.index(num_entries=3, num_buckets=3, num_empty=0)
self.write_entry(H2(0), 1, 2, 3)
self.write_entry(H2(3), 5, 6, 7)
self.write_entry(H2(4), 8, 9, 10)
assert compact_index == self.index_data.getvalue()
idx = self.index_from_data()
cpt = self.index_from_data()
cpt.compact()
assert idx.size() == 1024 + 6 * (32 + 3 * 4)
assert cpt.size() == 1024 + 3 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_too_few_empty_slots(self):
self.index(num_entries=3, num_buckets=6, num_empty=2)
@ -546,13 +537,12 @@ def test_too_few_empty_slots(self):
self.write_empty(H2(5))
self.write_entry(H2(4), 8, 9, 10)
compact_index = self.index_from_data_compact_to_data()
self.index(num_entries=3, num_buckets=3, num_empty=0)
self.write_entry(H2(0), 1, 2, 3)
self.write_entry(H2(3), 5, 6, 7)
self.write_entry(H2(4), 8, 9, 10)
assert compact_index == self.index_data.getvalue()
idx = self.index_from_data()
cpt = self.index_from_data()
cpt.compact()
assert idx.size() == 1024 + 6 * (32 + 3 * 4)
assert cpt.size() == 1024 + 3 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_empty(self):
self.index(num_entries=0, num_buckets=6, num_empty=3)
@ -563,10 +553,12 @@ def test_empty(self):
self.write_empty(H2(5))
self.write_deleted(H2(4))
compact_index = self.index_from_data_compact_to_data()
self.index(num_entries=0, num_buckets=0, num_empty=0)
assert compact_index == self.index_data.getvalue()
idx = self.index_from_data()
cpt = self.index_from_data()
cpt.compact()
assert idx.size() == 1024 + 6 * (32 + 3 * 4)
assert cpt.size() == 1024 + 0 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_merge(self):
master = ChunkIndex()