upstream/borgbackup
1
0
Fork 0
mirror of https://github.com/borgbackup/borg.git synced 2026-06-15 12:34:34 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

testsuite/hashindex.py: add two more tests

Browse source
This commit is contained in:
Dan Christensen 2023-02-11 19:44:56 -05:00
parent 6aa53a5627
commit cc78ef8939
1 changed files with 32 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -461,7 +461,9 @@ class HashIndexCompactTestCase(HashIndexDataTestCase):
def index_from_data(self):
self.index_data.seek(0)
index = ChunkIndex.read(self.index_data)
# Since we are trying to carefully control the layout of the hashindex,
# we set permit_compact to prevent hashindex_read from resizing the hash table.
index = ChunkIndex.read(self.index_data, permit_compact=True)
return index
def write_entry(self, key, *values):
@ -560,6 +562,35 @@ class HashIndexCompactTestCase(HashIndexDataTestCase):
assert cpt.size() == 1024 + 0 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_already_compact(self):
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)
idx = self.index_from_data()
cpt = self.index_from_data()
#cpt.compact()
assert idx.size() == 1024 + 3 * (32 + 3 * 4)
assert cpt.size() == 1024 + 3 * (32 + 3 * 4)
self.compare_indexes(idx, cpt)
def test_all_at_front(self):
self.index(num_entries=3, num_buckets=6, num_empty=2)
self.write_entry(H2(0), 1, 2, 3)
self.write_entry(H2(3), 5, 6, 7)
self.write_entry(H2(4), 8, 9, 10)
self.write_empty(H2(2))
self.write_empty(H2(5))
self.write_deleted(H2(1))
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_merge(self):
master = ChunkIndex()
idx1 = ChunkIndex()