mirror
/
borg
mirror of https://github.com/borgbackup/borg.git
1
0
Fork 0
Code Issues Releases Wiki Activity

hashindex_pytest: move hashtable create into separate function

This commit is contained in:
Thomas Waldmann 2023-02-09 00:12:29 +01:00
parent e556233e30
commit 1ed8ac0408
No known key found for this signature in database
GPG Key ID: 243ACFA951F78E01
1 changed files with 15 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/borg/testsuite/hashindex_pytest.py
View File

@ -8,21 +8,12 @@ import pytest
from ..hashindex import NSIndex
@pytest.mark.skipif("BORG_TESTS_SLOW" not in os.environ, reason="slow tests not enabled, use BORG_TESTS_SLOW=1")
def test_hashindex_stress():
"""checks if the hashtable behaves as expected
This can be used in _hashindex.c before running this test to provoke more collisions (don't forget to compile):
#define HASH_MAX_LOAD .99
#define HASH_MAX_EFF_LOAD .999
"""
ENTRIES = 10000
LOOPS = 1000
def make_hashtables(*, entries, loops):
idx = NSIndex()
kv = {}
for i in range(LOOPS):
for i in range(loops):
# put some entries
for j in range(ENTRIES):
for j in range(entries):
k = random.randbytes(32)
v = random.randint(0, NSIndex.MAX_VALUE - 1)
idx[k] = (v, v, v)
@ -37,3 +28,15 @@ def test_hashindex_stress():
assert idx[k] == (v, v, v)
# check entry count
assert len(kv) == len(idx)
return idx, kv
@pytest.mark.skipif("BORG_TESTS_SLOW" not in os.environ, reason="slow tests not enabled, use BORG_TESTS_SLOW=1")
def test_hashindex_stress():
"""checks if the hashtable behaves as expected
This can be used in _hashindex.c before running this test to provoke more collisions (don't forget to compile):
#define HASH_MAX_LOAD .99
#define HASH_MAX_EFF_LOAD .999
"""
make_hashtables(entries=10000, loops=1000) # we do quite some assertions while making them