Github/littlefs
1
Fork 0
Code Actions Activity

Enabled btree tests on all geometries, fixed some revealed bugs

Browse Source 
The main issue with the btree tests cross-geometry is the number of ways
large btrees can run out of memory without garbage collection.

- Large progs => A lot of padding on non-compacting commits
- Small blocks => Deeper trees and more compacts

Rather than figure out every precondition, I've just added code that
ignores out-of-space errors.

As a plus this is now also testing that errors don't corrupt the btree
being modified.

Bugs found:

- Thanks to lazy merges, it's possible for an in-btree rbyd weight to
  equal the total btree weight even when it's not the child of the root
  of the btree.

  The behavior is the same (collapse all degenerate parent), but the
  assert that we were the root's child is incorrect.

- Thanks again to lazy merges, it's possible to merge siblings where one
  of the blocks has no entries. Attempting to reintroduce the split name
  in this case can lead to LFS_ERR_NOENT issues.

  Fortunately we can simply skip the reintroduction of the split name in
  this case.

Also added more asserts for LFS_ERR_RANGE in lfsr_btree_commit. This is
still a rather fragile part of the algorithm so the asserts here help
identify when the pending attribute size is the problem.
This commit is contained in:
Christopher Haster
2023-04-16 01:31:08 -05:00
parent da8fa4b133
commit 3a470f9d73
2 changed files with 442 additions and 140 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lfs.c
+31 -23
View File
@@ -3169,6 +3169,7 @@ static int lfsr_btree_commit(lfs_t *lfs,
attrs[i].id, attrs[i].tag, attrs[i].delta, attrs[i].id, attrs[i].tag, attrs[i].delta,
attrs[i].data); attrs[i].data);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
} }
@@ -3183,6 +3184,7 @@ static int lfsr_btree_commit(lfs_t *lfs,
// finalize commit // finalize commit
err = lfsr_rbyd_commit(lfs, &rbyd_, NULL, 0); err = lfsr_rbyd_commit(lfs, &rbyd_, NULL, 0);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
@@ -3307,6 +3309,7 @@ static int lfsr_btree_commit(lfs_t *lfs,
attrs[i].id, attrs[i].tag, attrs[i].delta, attrs[i].id, attrs[i].tag, attrs[i].delta,
attrs[i].data); attrs[i].data);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
} }
@@ -3365,6 +3368,7 @@ static int lfsr_btree_commit(lfs_t *lfs,
attrs[i].id-split_id_, attrs[i].tag, attrs[i].delta, attrs[i].id-split_id_, attrs[i].tag, attrs[i].delta,
attrs[i].data); attrs[i].data);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
} }
@@ -3378,6 +3382,7 @@ static int lfsr_btree_commit(lfs_t *lfs,
// finalize commit // finalize commit
err = lfsr_rbyd_commit(lfs, &sibling, NULL, 0); err = lfsr_rbyd_commit(lfs, &sibling, NULL, 0);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
@@ -3555,36 +3560,41 @@ static int lfsr_btree_commit(lfs_t *lfs,
} }
} }
// bring in name that previously split the siblings if (sweight > 0 && rweight_ > 0) {
lfsr_tag_t split_tag; // bring in name that previously split the siblings
lfsr_data_t split_data; lfsr_tag_t split_tag;
err = lfsr_rbyd_lookup(lfs, &parent, lfsr_data_t split_data;
(sdelta == 0 ? pid : sid), LFSR_TAG_NAME, err = lfsr_rbyd_lookup(lfs, &parent,
NULL, &split_tag, NULL, &split_data); (sdelta == 0 ? pid : sid), LFSR_TAG_NAME,
if (err) { NULL, &split_tag, NULL, &split_data);
return err;
}
if (lfsr_tag_suptype(split_tag) == LFSR_TAG_NAME) {
// lookup the id (weight really) of the previously-split entry
lfs_ssize_t split_id;
err = lfsr_rbyd_lookup(lfs, &rbyd_,
(sdelta == 0 ? sweight : rweight_), LFSR_TAG_NAME,
&split_id, NULL, NULL, NULL);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_NOENT); LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
err = lfsr_rbyd_append(lfs, &rbyd_, if (lfsr_tag_suptype(split_tag) == LFSR_TAG_NAME) {
split_id, LFSR_TAG_BNAME, 0, split_data); // lookup the id (weight really) of the previously-split entry
if (err) { lfs_ssize_t split_id;
return err; err = lfsr_rbyd_lookup(lfs, &rbyd_,
(sdelta == 0 ? sweight : rweight_), LFSR_TAG_NAME,
&split_id, NULL, NULL, NULL);
if (err) {
LFS_ASSERT(err != LFS_ERR_NOENT);
return err;
}
err = lfsr_rbyd_append(lfs, &rbyd_,
split_id, LFSR_TAG_BNAME, 0, split_data);
if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err;
}
} }
} }
err = lfsr_rbyd_commit(lfs, &rbyd_, NULL, 0); err = lfsr_rbyd_commit(lfs, &rbyd_, NULL, 0);
if (err) { if (err) {
LFS_ASSERT(err != LFS_ERR_RANGE);
return err; return err;
} }
@@ -3592,8 +3602,6 @@ static int lfsr_btree_commit(lfs_t *lfs,
LFS_ASSERT(pid != -1); LFS_ASSERT(pid != -1);
if (pweight+sweight == lfsr_btree_weight(btree)) { if (pweight+sweight == lfsr_btree_weight(btree)) {
// collapse our parent, decreasing the height of the tree // collapse our parent, decreasing the height of the tree
LFS_ASSERT(btree->root.block == parent.block
&& btree->root.trunk == parent.trunk);
*rbyd = rbyd_; *rbyd = rbyd_;
break; break;
tests/test_btree.toml
+411 -117
View File
@@ -1,7 +1,7 @@
# maximize lookahead buffer, we don't actually gc so we only get one pass # maximize lookahead buffer, we don't actually gc so we only get one pass
# of the disk for these tests # of the disk for these tests
defines.LOOKAHEAD_SIZE = 'BLOCK_COUNT / 8' defines.LOOKAHEAD_SIZE = 'lfs_alignup(BLOCK_COUNT / 8, 8)'
# test an empty tree # test an empty tree
@@ -325,15 +325,22 @@ code = '''
// create a tree with N elements // create a tree with N elements
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
lfs_size_t n = 0;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N); assert(lfsr_btree_weight(&btree) == n);
// check that the elements are in the tree // check that the elements are in the tree
uint8_t buffer[4]; uint8_t buffer[4];
@@ -341,7 +348,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, i, lfsr_btree_get(&lfs, &btree, i,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
@@ -352,7 +359,7 @@ code = '''
} }
// and check that we can't lookup elements that aren't in the tree // and check that we can't lookup elements that aren't in the tree
lfsr_btree_get(&lfs, &btree, N, lfsr_btree_get(&lfs, &btree, n,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => LFS_ERR_NOENT; buffer, 4, VALIDATE) => LFS_ERR_NOENT;
''' '''
@@ -375,15 +382,22 @@ code = '''
// create a tree with N elements // create a tree with N elements
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
lfs_size_t n = 0;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1,
&alphas[(N-1-i) % 26], 1) => 0; &alphas[(N-1-i) % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N); assert(lfsr_btree_weight(&btree) == n);
// check that the elements are in the tree // check that the elements are in the tree
uint8_t buffer[4]; uint8_t buffer[4];
@@ -391,18 +405,18 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, i, lfsr_btree_get(&lfs, &btree, n-1-i,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
assert(tag_ == LFSR_TAG_INLINED); assert(tag_ == LFSR_TAG_INLINED);
assert(id_ == i); assert(id_ == n-1-i);
assert(weight_ == 1); assert(weight_ == 1);
assert(memcmp(buffer, &alphas[i % 26], 1) == 0); assert(memcmp(buffer, &alphas[(N-1-i) % 26], 1) == 0);
} }
// and check that we can't lookup elements that aren't in the tree // and check that we can't lookup elements that aren't in the tree
lfsr_btree_get(&lfs, &btree, N, lfsr_btree_get(&lfs, &btree, n,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => LFS_ERR_NOENT; buffer, 4, VALIDATE) => LFS_ERR_NOENT;
''' '''
@@ -452,8 +466,13 @@ code = '''
lfs_size_t id = TEST_PRNG(&prng) % (sim_size+1); lfs_size_t id = TEST_PRNG(&prng) % (sim_size+1);
// add to btree // add to btree
lfsr_btree_push(&lfs, &btree, id, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, id, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// add to sim // add to sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -522,15 +541,22 @@ code = '''
// create a tree with N elements // create a tree with N elements
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
lfs_size_t n = 0;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W, int err = lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N*W); assert(lfsr_btree_weight(&btree) == n*W);
// check that the elements are in the tree // check that the elements are in the tree
uint8_t buffer[4]; uint8_t buffer[4];
@@ -538,7 +564,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, i*W+W-1, lfsr_btree_get(&lfs, &btree, i*W+W-1,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
@@ -549,13 +575,13 @@ code = '''
} }
// and check that we can't lookup elements that aren't in the tree // and check that we can't lookup elements that aren't in the tree
lfsr_btree_get(&lfs, &btree, N*W, lfsr_btree_get(&lfs, &btree, n*W,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => LFS_ERR_NOENT; buffer, 4, VALIDATE) => LFS_ERR_NOENT;
// also test that we can traverse the tree without prior knowledge // also test that we can traverse the tree without prior knowledge
id_ = -1; id_ = -1;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, id_+1, lfsr_btree_get(&lfs, &btree, id_+1,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
@@ -625,8 +651,14 @@ code = '''
} }
// add to btree // add to btree
lfsr_btree_push(&lfs, &btree, weighted_id, LFSR_TAG_INLINED, weight, int err = lfsr_btree_push(&lfs, &btree,
&alphas[i % 26], 1) => 0; weighted_id, LFSR_TAG_INLINED, weight,
&alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// add to sim // add to sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -903,13 +935,31 @@ code = '''
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
const char *uppers = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const char *uppers = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// update the tree // update the tree
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_update(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_update(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&uppers[i % 26], 1) => 0; &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
@@ -971,8 +1021,17 @@ code = '''
// create a btree // create a btree
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// set up a simulation to compare against // set up a simulation to compare against
@@ -990,8 +1049,13 @@ code = '''
lfs_size_t id = TEST_PRNG(&prng) % N; lfs_size_t id = TEST_PRNG(&prng) % N;
// update btree // update btree
lfsr_btree_update(&lfs, &btree, id, LFSR_TAG_INLINED, 1, int err = lfsr_btree_update(&lfs, &btree, id, LFSR_TAG_INLINED, 1,
&uppers[i % 26], 1) => 0; &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = uppers[i % 26]; sim[id] = uppers[i % 26];
@@ -1059,13 +1123,31 @@ code = '''
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
const char *uppers = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const char *uppers = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W, int err = lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// update the tree // update the tree
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_update(&lfs, &btree, i*W+W-1, LFSR_TAG_INLINED, W, int err = lfsr_btree_update(&lfs, &btree, i*W+W-1, LFSR_TAG_INLINED, W,
&uppers[i % 26], 1) => 0; &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
@@ -1143,8 +1225,17 @@ code = '''
// create a btree // create a btree
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W, int err = lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// set up a simulation to compare against // set up a simulation to compare against
@@ -1172,9 +1263,14 @@ code = '''
} }
// update btree // update btree
lfsr_btree_update(&lfs, &btree, int err = lfsr_btree_update(&lfs, &btree,
weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight, weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight,
&uppers[i % 26], 1) => 0; &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = uppers[i % 26]; sim[id] = uppers[i % 26];
@@ -1583,12 +1679,30 @@ code = '''
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// drain the tree // drain the tree
for (lfs_size_t i = 0; i < N-REMAINING; i++) { for (lfs_size_t i = 0; i < N-REMAINING; i++) {
lfsr_btree_pop(&lfs, &btree, N-1-i) => 0; int err = lfsr_btree_pop(&lfs, &btree, N-1-i);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
@@ -1666,14 +1780,31 @@ code = '''
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// drain the tree // drain the tree
for (lfs_size_t i = 0; i < N-REMAINING; i++) { for (lfs_size_t i = 0; i < N-REMAINING; i++) {
lfsr_btree_pop(&lfs, &btree, 0) => 0; int err = lfsr_btree_pop(&lfs, &btree, 0);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
@@ -1761,8 +1892,17 @@ code = '''
// create a btree // create a btree
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1, int err = lfsr_btree_push(&lfs, &btree, i, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// set up a simulation to compare against // set up a simulation to compare against
@@ -1781,7 +1921,12 @@ code = '''
lfs_size_t id = TEST_PRNG(&prng) % sim_size; lfs_size_t id = TEST_PRNG(&prng) % sim_size;
// remove from btree // remove from btree
lfsr_btree_pop(&lfs, &btree, id) => 0; int err = lfsr_btree_pop(&lfs, &btree, id);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// remove from sim // remove from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));
@@ -1831,9 +1976,9 @@ code = '''
[cases.test_btree_pop_sparse] [cases.test_btree_pop_sparse]
defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024] defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024]
defines.W = 5
defines.REMAINING = [64, 2, 1, 0] defines.REMAINING = [64, 2, 1, 0]
defines.VALIDATE = [1, 0] defines.VALIDATE = [1, 0]
defines.W = 5
if = 'N > REMAINING' if = 'N > REMAINING'
in = 'lfs.c' in = 'lfs.c'
code = ''' code = '''
@@ -1851,14 +1996,31 @@ code = '''
lfsr_btree_t btree = LFSR_BTREE_NULL; lfsr_btree_t btree = LFSR_BTREE_NULL;
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < N; i++) {
lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W, int err = lfsr_btree_push(&lfs, &btree, i*W, LFSR_TAG_INLINED, W,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
// drain the tree // drain the tree
for (lfs_size_t i = 0; i < N-REMAINING; i++) { for (lfs_size_t i = 0; i < N-REMAINING; i++) {
lfsr_btree_pop(&lfs, &btree, (N-1-i)*W+W-1) => 0; int err = lfsr_btree_pop(&lfs, &btree, (N-1-i)*W+W-1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
@@ -1939,8 +2101,8 @@ code = '''
[cases.test_btree_pop_sparse_fuzz] [cases.test_btree_pop_sparse_fuzz]
defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512] defines.N = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]
defines.REMAINING = [64, 2, 1, 0]
defines.W = 5 defines.W = 5
defines.REMAINING = [64, 2, 1, 0]
defines.VALIDATE = [1, 0] defines.VALIDATE = [1, 0]
defines.SAMPLES = 10 defines.SAMPLES = 10
# -1 => all pseudo-random seeds # -1 => all pseudo-random seeds
@@ -1991,8 +2153,18 @@ code = '''
weighted_id += sim_weights[j]; weighted_id += sim_weights[j];
} }
lfsr_btree_push(&lfs, &btree, weighted_id, LFSR_TAG_INLINED, weight, int err = lfsr_btree_push(&lfs, &btree,
&alphas[i % 26], 1) => 0; weighted_id, LFSR_TAG_INLINED, weight,
&alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
printf("btree: w%d 0x%x.%x\n",
btree.weight,
btree.root.block,
btree.root.trunk);
return;
}
assert(err == 0);
sim[i] = alphas[i % 26]; sim[i] = alphas[i % 26];
sim_weights[i] = weight; sim_weights[i] = weight;
@@ -2010,7 +2182,13 @@ code = '''
} }
// remove from btree // remove from btree
lfsr_btree_pop(&lfs, &btree, weighted_id+sim_weights[id]-1) => 0; int err = lfsr_btree_pop(&lfs, &btree,
weighted_id+sim_weights[id]-1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// remove from sim // remove from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));
@@ -2121,16 +2299,23 @@ code = '''
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1, lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1,
&alphas[0 % 26], 1) => 0; &alphas[0 % 26], 1) => 0;
lfs_size_t n = 1;
for (lfs_size_t i = 1; i < N; i++) { for (lfs_size_t i = 1; i < N; i++) {
lfsr_btree_split(&lfs, &btree, i-1, NULL, 0, int err = lfsr_btree_split(&lfs, &btree, i-1, NULL, 0,
LFSR_TAG_INLINED, 1, &alphas[(i-1) % 26], 1, LFSR_TAG_INLINED, 1, &alphas[(i-1) % 26], 1,
LFSR_TAG_INLINED, 1, &alphas[(i-0) % 26], 1) => 0; LFSR_TAG_INLINED, 1, &alphas[(i-0) % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N); assert(lfsr_btree_weight(&btree) == n);
// check that the elements are in the tree // check that the elements are in the tree
uint8_t buffer[4]; uint8_t buffer[4];
@@ -2138,7 +2323,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, i, lfsr_btree_get(&lfs, &btree, i,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
@@ -2149,7 +2334,7 @@ code = '''
} }
// and check that we can't lookup elements that aren't in the tree // and check that we can't lookup elements that aren't in the tree
lfsr_btree_get(&lfs, &btree, N, lfsr_btree_get(&lfs, &btree, n,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => LFS_ERR_NOENT; buffer, 4, VALIDATE) => LFS_ERR_NOENT;
''' '''
@@ -2203,9 +2388,14 @@ code = '''
lfs_size_t id = TEST_PRNG(&prng) % sim_size; lfs_size_t id = TEST_PRNG(&prng) % sim_size;
// split btree // split btree
lfsr_btree_split(&lfs, &btree, id, NULL, 0, int err = lfsr_btree_split(&lfs, &btree, id, NULL, 0,
LFSR_TAG_INLINED, 1, &alphas[i % 26], 1, LFSR_TAG_INLINED, 1, &alphas[i % 26], 1,
LFSR_TAG_INLINED, 1, &uppers[i % 26], 1) => 0; LFSR_TAG_INLINED, 1, &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// split sim // split sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -2277,16 +2467,23 @@ code = '''
const char *alphas = "abcdefghijklmnopqrstuvwxyz"; const char *alphas = "abcdefghijklmnopqrstuvwxyz";
lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, W, lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, W,
&alphas[0 % 26], 1) => 0; &alphas[0 % 26], 1) => 0;
lfs_size_t n = 1;
for (lfs_size_t i = 1; i < N; i++) { for (lfs_size_t i = 1; i < N; i++) {
lfsr_btree_split(&lfs, &btree, (i-1)*W+W-1, NULL, 0, int err = lfsr_btree_split(&lfs, &btree, (i-1)*W+W-1, NULL, 0,
LFSR_TAG_INLINED, W, &alphas[(i-1) % 26], 1, LFSR_TAG_INLINED, W, &alphas[(i-1) % 26], 1,
LFSR_TAG_INLINED, W, &alphas[(i-0) % 26], 1) => 0; LFSR_TAG_INLINED, W, &alphas[(i-0) % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N*W); assert(lfsr_btree_weight(&btree) == n*W);
// check that the elements are in the tree // check that the elements are in the tree
uint8_t buffer[4]; uint8_t buffer[4];
@@ -2294,7 +2491,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
lfsr_btree_get(&lfs, &btree, i*W+W-1, lfsr_btree_get(&lfs, &btree, i*W+W-1,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => 1; buffer, 4, VALIDATE) => 1;
@@ -2305,7 +2502,7 @@ code = '''
} }
// and check that we can't lookup elements that aren't in the tree // and check that we can't lookup elements that aren't in the tree
lfsr_btree_get(&lfs, &btree, N*W, lfsr_btree_get(&lfs, &btree, n*W,
&id_, &tag_, &weight_, &id_, &tag_, &weight_,
buffer, 4, VALIDATE) => LFS_ERR_NOENT; buffer, 4, VALIDATE) => LFS_ERR_NOENT;
''' '''
@@ -2372,10 +2569,15 @@ code = '''
} }
// split btree // split btree
lfsr_btree_split(&lfs, &btree, weighted_id+sim_weights[id]-1, int err = lfsr_btree_split(&lfs, &btree,
NULL, 0, weighted_id+sim_weights[id]-1, NULL, 0,
LFSR_TAG_INLINED, weight1, &alphas[i % 26], 1, LFSR_TAG_INLINED, weight1, &alphas[i % 26], 1,
LFSR_TAG_INLINED, weight2, &uppers[i % 26], 1) => 0; LFSR_TAG_INLINED, weight2, &uppers[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// add to sim // add to sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -2421,7 +2623,7 @@ code = '''
lfsr_tag_t tag_; lfsr_tag_t tag_;
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < sim_size; i++) {
// calculate actual id in btree space // calculate actual id in btree space
lfs_size_t weighted_id = 0; lfs_size_t weighted_id = 0;
for (lfs_size_t j = 0; j < i; j++) { for (lfs_size_t j = 0; j < i; j++) {
@@ -2444,7 +2646,7 @@ code = '''
// also test that we can traverse the tree without prior knowledge // also test that we can traverse the tree without prior knowledge
id_ = -1; id_ = -1;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < sim_size; i++) {
// calculate actual id in btree space // calculate actual id in btree space
lfs_size_t weighted_id = 0; lfs_size_t weighted_id = 0;
for (lfs_size_t j = 0; j < i; j++) { for (lfs_size_t j = 0; j < i; j++) {
@@ -2519,9 +2721,14 @@ code = '''
if (op == 0 || id == sim_size) { if (op == 0 || id == sim_size) {
// push to btree // push to btree
lfsr_btree_push(&lfs, &btree, id, int err = lfsr_btree_push(&lfs, &btree, id,
LFSR_TAG_INLINED, 1, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// push to sim // push to sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -2530,16 +2737,26 @@ code = '''
} else if (op == 1) { } else if (op == 1) {
// update btree // update btree
lfsr_btree_update(&lfs, &btree, id, int err = lfsr_btree_update(&lfs, &btree, id,
LFSR_TAG_INLINED, 1, LFSR_TAG_INLINED, 1,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = alphas[i % 26]; sim[id] = alphas[i % 26];
} else { } else {
// pop from btree // pop from btree
lfsr_btree_pop(&lfs, &btree, id) => 0; int err = lfsr_btree_pop(&lfs, &btree, id);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// pop from sim // pop from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));
@@ -2647,9 +2864,14 @@ code = '''
if (op == 0 || id == sim_size) { if (op == 0 || id == sim_size) {
// push to btree // push to btree
lfsr_btree_push(&lfs, &btree, weighted_id, int err = lfsr_btree_push(&lfs, &btree, weighted_id,
LFSR_TAG_INLINED, weight, LFSR_TAG_INLINED, weight,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// push to sim // push to sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -2661,9 +2883,14 @@ code = '''
} else if (op == 1) { } else if (op == 1) {
// update btree // update btree
lfsr_btree_update(&lfs, &btree, int err = lfsr_btree_update(&lfs, &btree,
weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight, weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight,
&alphas[i % 26], 1) => 0; &alphas[i % 26], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = alphas[i % 26]; sim[id] = alphas[i % 26];
@@ -2671,8 +2898,13 @@ code = '''
} else { } else {
// remove from btree // remove from btree
lfsr_btree_pop(&lfs, &btree, int err = lfsr_btree_pop(&lfs, &btree,
weighted_id+sim_weights[id]-1) => 0; weighted_id+sim_weights[id]-1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// remove from sim // remove from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));
@@ -3051,19 +3283,26 @@ code = '''
const char *nums = "0123456789"; const char *nums = "0123456789";
lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1, lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, 1,
&nums[0 % 10], 1) => 0; &nums[0 % 10], 1) => 0;
lfs_size_t n = 1;
for (lfs_size_t i = 1; i < N; i++) { for (lfs_size_t i = 1; i < N; i++) {
char name[3] = { char name[3] = {
alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26] alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26]
}; };
lfsr_btree_split(&lfs, &btree, i-1, name, 3, int err = lfsr_btree_split(&lfs, &btree, i-1, name, 3,
LFSR_TAG_INLINED, 1, &nums[(i-1) % 10], 1, LFSR_TAG_INLINED, 1, &nums[(i-1) % 10], 1,
LFSR_TAG_INLINED, 1, &nums[(i-0) % 10], 1) => 0; LFSR_TAG_INLINED, 1, &nums[(i-0) % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N); assert(lfsr_btree_weight(&btree) == n);
// try to find tags // try to find tags
uint8_t buffer[4]; uint8_t buffer[4];
@@ -3071,7 +3310,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
char name[3] = { char name[3] = {
alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26] alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26]
}; };
@@ -3150,9 +3389,14 @@ code = '''
} }
// split btree // split btree
lfsr_btree_split(&lfs, &btree, id, name, 3, int err = lfsr_btree_split(&lfs, &btree, id, name, 3,
LFSR_TAG_INLINED, 1, &nums[i % 10], 1, LFSR_TAG_INLINED, 1, &nums[i % 10], 1,
LFSR_TAG_INLINED, 1, &nums[i % 10], 1) => 0; LFSR_TAG_INLINED, 1, &nums[i % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// split sim // split sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -3222,19 +3466,26 @@ code = '''
const char *nums = "0123456789"; const char *nums = "0123456789";
lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, W, lfsr_btree_push(&lfs, &btree, 0, LFSR_TAG_INLINED, W,
&nums[0 % 10], 1) => 0; &nums[0 % 10], 1) => 0;
lfs_size_t n = 1;
for (lfs_size_t i = 1; i < N; i++) { for (lfs_size_t i = 1; i < N; i++) {
char name[3] = { char name[3] = {
alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26] alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26]
}; };
lfsr_btree_split(&lfs, &btree, (i-1)*W+W-1, name, 3, int err = lfsr_btree_split(&lfs, &btree, (i-1)*W+W-1, name, 3,
LFSR_TAG_INLINED, W, &nums[(i-1) % 10], 1, LFSR_TAG_INLINED, W, &nums[(i-1) % 10], 1,
LFSR_TAG_INLINED, W, &nums[(i-0) % 10], 1) => 0; LFSR_TAG_INLINED, W, &nums[(i-0) % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
n += 1;
} }
printf("btree: w%d 0x%x.%x\n", printf("btree: w%d 0x%x.%x\n",
btree.weight, btree.weight,
btree.root.block, btree.root.block,
btree.root.trunk); btree.root.trunk);
assert(lfsr_btree_weight(&btree) == N*W); assert(lfsr_btree_weight(&btree) == n*W);
// try to find tags // try to find tags
uint8_t buffer[4]; uint8_t buffer[4];
@@ -3242,7 +3493,7 @@ code = '''
lfs_size_t id_; lfs_size_t id_;
lfs_size_t weight_; lfs_size_t weight_;
for (lfs_size_t i = 0; i < N; i++) { for (lfs_size_t i = 0; i < n; i++) {
char name[3] = { char name[3] = {
alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26] alphas[(i/26/26) % 26], alphas[(i/26) % 26], alphas[i % 26]
}; };
@@ -3334,10 +3585,15 @@ code = '''
} }
// split btree // split btree
lfsr_btree_split(&lfs, &btree, weighted_id+sim_weights[id]-1, int err = lfsr_btree_split(&lfs, &btree,
name, 3, weighted_id+sim_weights[id]-1, name, 3,
LFSR_TAG_INLINED, weight1, &nums[i % 10], 1, LFSR_TAG_INLINED, weight1, &nums[i % 10], 1,
LFSR_TAG_INLINED, weight2, &nums[i % 10], 1) => 0; LFSR_TAG_INLINED, weight2, &nums[i % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// split sim // split sim
memmove(&sim[id+1], &sim[id], sim_size-id); memmove(&sim[id+1], &sim[id], sim_size-id);
@@ -3489,15 +3745,25 @@ code = '''
lfsr_btree_nameget(&lfs, &btree, name, 3, lfsr_btree_nameget(&lfs, &btree, name, 3,
&split_id, NULL, NULL, split_buf, 4) => 1; &split_id, NULL, NULL, split_buf, 4) => 1;
if (split_id > id) { if (split_id > id) {
lfsr_btree_split(&lfs, &btree, int err = lfsr_btree_split(&lfs, &btree,
split_id, sim_names[id+1], 3, split_id, sim_names[id+1], 3,
LFSR_TAG_INLINED, 1, &nums[i % 10], 1, LFSR_TAG_INLINED, 1, &nums[i % 10], 1,
LFSR_TAG_INLINED, 1, split_buf, 1) => 0; LFSR_TAG_INLINED, 1, split_buf, 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
} else { } else {
lfsr_btree_split(&lfs, &btree, int err = lfsr_btree_split(&lfs, &btree,
split_id, name, 3, split_id, name, 3,
LFSR_TAG_INLINED, 1, split_buf, 1, LFSR_TAG_INLINED, 1, split_buf, 1,
LFSR_TAG_INLINED, 1, &nums[i % 10], 1) => 0; LFSR_TAG_INLINED, 1, &nums[i % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
} }
// split sim // split sim
@@ -3509,16 +3775,26 @@ code = '''
} else if (op == 1) { } else if (op == 1) {
// update btree // update btree
lfsr_btree_update(&lfs, &btree, id, int err = lfsr_btree_update(&lfs, &btree, id,
LFSR_TAG_INLINED, 1, LFSR_TAG_INLINED, 1,
&nums[i % 10], 1) => 0; &nums[i % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = nums[i % 10]; sim[id] = nums[i % 10];
} else { } else {
// pop from btree // pop from btree
lfsr_btree_pop(&lfs, &btree, id) => 0; int err = lfsr_btree_pop(&lfs, &btree, id);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// pop from sim // pop from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));
@@ -3665,17 +3941,25 @@ code = '''
lfsr_btree_nameget(&lfs, &btree, name, 3, lfsr_btree_nameget(&lfs, &btree, name, 3,
&split_id, NULL, &split_weight, split_buf, 4) => 1; &split_id, NULL, &split_weight, split_buf, 4) => 1;
if (split_id > weighted_id+sim_weights[id]-1) { if (split_id > weighted_id+sim_weights[id]-1) {
lfsr_btree_split(&lfs, &btree, int err = lfsr_btree_split(&lfs, &btree,
split_id, sim_names[id+1], 3, split_id, sim_names[id+1], 3,
LFSR_TAG_INLINED, weight, &nums[i % 10], 1, LFSR_TAG_INLINED, weight, &nums[i % 10], 1,
LFSR_TAG_INLINED, split_weight, split_buf, 1) LFSR_TAG_INLINED, split_weight, split_buf, 1);
=> 0; // ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
} else { } else {
lfsr_btree_split(&lfs, &btree, int err = lfsr_btree_split(&lfs, &btree,
split_id, name, 3, split_id, name, 3,
LFSR_TAG_INLINED, split_weight, split_buf, 1, LFSR_TAG_INLINED, split_weight, split_buf, 1,
LFSR_TAG_INLINED, weight, &nums[i % 10], 1) LFSR_TAG_INLINED, weight, &nums[i % 10], 1);
=> 0; // ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
} }
// split sim // split sim
@@ -3690,9 +3974,14 @@ code = '''
} else if (op == 1) { } else if (op == 1) {
// update btree // update btree
lfsr_btree_update(&lfs, &btree, int err = lfsr_btree_update(&lfs, &btree,
weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight, weighted_id+sim_weights[id]-1, LFSR_TAG_INLINED, weight,
&nums[i % 10], 1) => 0; &nums[i % 10], 1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// update sim // update sim
sim[id] = nums[i % 10]; sim[id] = nums[i % 10];
@@ -3700,8 +3989,13 @@ code = '''
} else { } else {
// pop from btree // pop from btree
lfsr_btree_pop(&lfs, &btree, int err = lfsr_btree_pop(&lfs, &btree,
weighted_id+sim_weights[id]-1) => 0; weighted_id+sim_weights[id]-1);
// ignore space issues
if (err == LFS_ERR_NOSPC) {
break;
}
assert(err == 0);
// pop from sim // pop from sim
memmove(&sim[id], &sim[id+1], sim_size-(id+1)); memmove(&sim[id], &sim[id+1], sim_size-(id+1));