Replace fuzz DENSITY with explicit OPS in tests
This sort of inverts the previous logic. Tests can still define OPS='2*N' to scale the number of ops roughly with the number of entries, but this fits better into the test framework, allows overriding, scaling can be more easily tweaked, can be swapped out with a constant (like in test_wl), etc. Also tweaked some of the related N constants/filter conditions in tests since these are now being effectively doubled... This should leave the resulting number of ops unchanged.
This commit is contained in:
+18
-18
@@ -761,7 +761,7 @@ code = '''
|
||||
[cases.test_files_fuzz]
|
||||
defines.N = [1, 2, 4, 8, 16, 32, 64]
|
||||
# do more ops than files to encourage file rewrites
|
||||
defines.DENSITY = 2
|
||||
defines.OPS = '2*N'
|
||||
defines.SIZE = [
|
||||
'0',
|
||||
'FBUFFER_SIZE/2',
|
||||
@@ -773,7 +773,7 @@ defines.SIZE = [
|
||||
]
|
||||
defines.REMOUNT = [false, true]
|
||||
defines.SEED = 'range(20)'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 32'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 16'
|
||||
code = '''
|
||||
lfs_t lfs;
|
||||
lfsr_format(&lfs, CFG) => 0;
|
||||
@@ -785,9 +785,9 @@ code = '''
|
||||
lfs_size_t sim_size = 0;
|
||||
|
||||
uint32_t prng = SEED;
|
||||
for (lfs_size_t i = 0; i < N; i++) {
|
||||
for (lfs_size_t i = 0; i < OPS; i++) {
|
||||
// choose a pseudo-random number
|
||||
lfs_size_t x = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t x = TEST_PRNG(&prng) % N;
|
||||
// associate each file with a prng that generates its contents
|
||||
uint32_t wprng = TEST_PRNG(&prng);
|
||||
|
||||
@@ -1111,7 +1111,7 @@ code = '''
|
||||
[cases.test_files_rm_fuzz]
|
||||
defines.N = [1, 2, 4, 8, 16, 32, 64]
|
||||
# do more ops than files to encourage file rewrites
|
||||
defines.DENSITY = 2
|
||||
defines.OPS = '2*N'
|
||||
defines.SIZE = [
|
||||
'0',
|
||||
'FBUFFER_SIZE/2',
|
||||
@@ -1123,7 +1123,7 @@ defines.SIZE = [
|
||||
]
|
||||
defines.REMOUNT = [false, true]
|
||||
defines.SEED = 'range(20)'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 32'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 16'
|
||||
code = '''
|
||||
lfs_t lfs;
|
||||
lfsr_format(&lfs, CFG) => 0;
|
||||
@@ -1135,14 +1135,14 @@ code = '''
|
||||
lfs_size_t sim_size = 0;
|
||||
|
||||
uint32_t prng = SEED;
|
||||
for (lfs_size_t i = 0; i < N; i++) {
|
||||
for (lfs_size_t i = 0; i < OPS; i++) {
|
||||
// choose which operation to do
|
||||
uint8_t op = TEST_PRNG(&prng) % 2;
|
||||
|
||||
// creating a new file?
|
||||
if (op == 0 || sim_size == 0) {
|
||||
// choose a pseudo-random number
|
||||
lfs_size_t x = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t x = TEST_PRNG(&prng) % N;
|
||||
// associate each file with a prng that generates its contents
|
||||
uint32_t wprng = TEST_PRNG(&prng);
|
||||
|
||||
@@ -2200,7 +2200,7 @@ code = '''
|
||||
[cases.test_files_mv_fuzz]
|
||||
defines.N = [1, 2, 4, 8, 16, 32, 64]
|
||||
# do more ops than files to encourage file rewrites
|
||||
defines.DENSITY = 2
|
||||
defines.OPS = '2*N'
|
||||
defines.SIZE = [
|
||||
'0',
|
||||
'FBUFFER_SIZE/2',
|
||||
@@ -2212,7 +2212,7 @@ defines.SIZE = [
|
||||
]
|
||||
defines.REMOUNT = [false, true]
|
||||
defines.SEED = 'range(20)'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 32'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 16'
|
||||
code = '''
|
||||
lfs_t lfs;
|
||||
lfsr_format(&lfs, CFG) => 0;
|
||||
@@ -2224,14 +2224,14 @@ code = '''
|
||||
lfs_size_t sim_size = 0;
|
||||
|
||||
uint32_t prng = SEED;
|
||||
for (lfs_size_t i = 0; i < N; i++) {
|
||||
for (lfs_size_t i = 0; i < OPS; i++) {
|
||||
// choose which operation to do
|
||||
uint8_t op = TEST_PRNG(&prng) % 2;
|
||||
|
||||
// creating a new file?
|
||||
if (op == 0 || sim_size == 0) {
|
||||
// choose a pseudo-random number
|
||||
lfs_size_t x = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t x = TEST_PRNG(&prng) % N;
|
||||
// associate each file with a prng that generates its contents
|
||||
uint32_t wprng = TEST_PRNG(&prng);
|
||||
|
||||
@@ -2276,7 +2276,7 @@ code = '''
|
||||
// rename to
|
||||
lfs_size_t j = TEST_PRNG(&prng) % sim_size;
|
||||
lfs_size_t x = sim[j];
|
||||
lfs_size_t y = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t y = TEST_PRNG(&prng) % N;
|
||||
uint32_t wprng = sim_prngs[j];
|
||||
|
||||
// update our sim
|
||||
@@ -2395,7 +2395,7 @@ code = '''
|
||||
[cases.test_files_mvrm_fuzz]
|
||||
defines.N = [1, 2, 4, 8, 16, 32, 64]
|
||||
# do more ops than files to encourage file rewrites
|
||||
defines.DENSITY = 2
|
||||
defines.OPS = '2*N'
|
||||
defines.SIZE = [
|
||||
'0',
|
||||
'FBUFFER_SIZE/2',
|
||||
@@ -2407,7 +2407,7 @@ defines.SIZE = [
|
||||
]
|
||||
defines.REMOUNT = [false, true]
|
||||
defines.SEED = 'range(20)'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 32'
|
||||
if = '(SIZE*N)/BLOCK_SIZE <= 16'
|
||||
code = '''
|
||||
lfs_t lfs;
|
||||
lfsr_format(&lfs, CFG) => 0;
|
||||
@@ -2419,14 +2419,14 @@ code = '''
|
||||
lfs_size_t sim_size = 0;
|
||||
|
||||
uint32_t prng = SEED;
|
||||
for (lfs_size_t i = 0; i < N; i++) {
|
||||
for (lfs_size_t i = 0; i < OPS; i++) {
|
||||
// choose which operation to do
|
||||
uint8_t op = TEST_PRNG(&prng) % 3;
|
||||
|
||||
// creating a new file?
|
||||
if (op == 0 || sim_size == 0) {
|
||||
// choose a pseudo-random number
|
||||
lfs_size_t x = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t x = TEST_PRNG(&prng) % N;
|
||||
// associate each file with a prng that generates its contents
|
||||
uint32_t wprng = TEST_PRNG(&prng);
|
||||
|
||||
@@ -2488,7 +2488,7 @@ code = '''
|
||||
// rename to
|
||||
lfs_size_t j = TEST_PRNG(&prng) % sim_size;
|
||||
lfs_size_t x = sim[j];
|
||||
lfs_size_t y = TEST_PRNG(&prng) % ((N+DENSITY-1) / DENSITY);
|
||||
lfs_size_t y = TEST_PRNG(&prng) % N;
|
||||
uint32_t wprng = sim_prngs[j];
|
||||
|
||||
// update our sim
|
||||
|
||||
Reference in New Issue
Block a user