diff options
author | Kent Overstreet <kent.overstreet@gmail.com> | 2016-07-22 06:05:06 +0300 |
---|---|---|
committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-10-23 00:08:09 +0300 |
commit | 271a3d3a4b30dcd9fd274a923fb382f5f113d279 (patch) | |
tree | b16887dfafd9b011a14ae842f1029ce1211c9aa5 /fs/bcachefs/btree_io.h | |
parent | 0fdf18047fd38e7b5cc6adba3a81704c88333e1c (diff) | |
download | linux-271a3d3a4b30dcd9fd274a923fb382f5f113d279.tar.xz |
bcachefs: lift ordering restriction on 0 size extents
This lifts the restriction that 0 size extents must not overlap with
other extents, which means we can now sort extents and non extents the
same way, and will let us simplify a bunch of other stuff as well.
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
Diffstat (limited to 'fs/bcachefs/btree_io.h')
-rw-r--r-- | fs/bcachefs/btree_io.h | 9 |
1 files changed, 0 insertions, 9 deletions
diff --git a/fs/bcachefs/btree_io.h b/fs/bcachefs/btree_io.h index 0688ce420610..7835f8a9e3a0 100644 --- a/fs/bcachefs/btree_io.h +++ b/fs/bcachefs/btree_io.h @@ -146,20 +146,11 @@ ssize_t bch2_dirty_btree_nodes_print(struct bch_fs *, char *); /* Sorting */ struct btree_node_iter_large { - u8 is_extents; u16 used; struct btree_node_iter_set data[MAX_BSETS]; }; -static inline void -__bch2_btree_node_iter_large_init(struct btree_node_iter_large *iter, - bool is_extents) -{ - iter->used = 0; - iter->is_extents = is_extents; -} - void bch2_btree_node_iter_large_advance(struct btree_node_iter_large *, struct btree *); |