diff options
| author | David Robillard <d@drobilla.net> | 2024-12-11 11:51:37 -0500 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2024-12-11 11:51:37 -0500 |
| commit | f6dbeb256e6bef656b4f535f8de4256b9b608669 (patch) | |
| tree | f684800c6e36d94c806e0226344dabcf0eaeed89 | |
| parent | 3f5e1a5466d60054d3abb52e82eec53f19ed7bc6 (diff) | |
| download | zix-f6dbeb256e6bef656b4f535f8de4256b9b608669.tar.gz zix-f6dbeb256e6bef656b4f535f8de4256b9b608669.tar.bz2 zix-f6dbeb256e6bef656b4f535f8de4256b9b608669.zip | |
Add assertion to ensure integer overflow is avoided
| -rw-r--r-- | src/btree.c | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/btree.c b/src/btree.c index f276e5f..093d0c3 100644 --- a/src/btree.c +++ b/src/btree.c @@ -680,6 +680,7 @@ zix_btree_fatten_child(ZixBTree* const t, ZixBTreeIter* const iter) assert(n); assert(!n->is_leaf); + assert(n->n_vals); ZixBTreeNode* const* const children = n->data.inode.children; if (i > 0U && zix_btree_can_remove_from(children[i - 1U])) { |