1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BKEY_SORT_H
3 #define _BCACHEFS_BKEY_SORT_H
5 struct btree_node_iter_large {
8 struct btree_node_iter_set data[MAX_BSETS];
11 void bch2_btree_node_iter_large_push(struct btree_node_iter_large *,
13 const struct bkey_packed *,
14 const struct bkey_packed *);
20 struct sort_iter_set {
21 struct bkey_packed *k, *end;
22 } data[MAX_BSETS + 1];
25 static inline void sort_iter_init(struct sort_iter *iter, struct btree *b)
27 memset(iter, 0, sizeof(*iter));
31 static inline void sort_iter_add(struct sort_iter *iter,
32 struct bkey_packed *k,
33 struct bkey_packed *end)
35 BUG_ON(iter->used >= ARRAY_SIZE(iter->data));
38 iter->data[iter->used++] = (struct sort_iter_set) { k, end };
42 bch2_key_sort_fix_overlapping(struct bset *, struct btree *,
43 struct btree_node_iter_large *);
45 bch2_extent_sort_fix_overlapping(struct bch_fs *, struct bset *,
47 struct btree_node_iter_large *);
50 bch2_sort_repack(struct bset *, struct btree *,
51 struct btree_node_iter *,
52 struct bkey_format *, bool);
54 bch2_sort_repack_merge(struct bch_fs *,
55 struct bset *, struct btree *,
56 struct btree_node_iter *,
57 struct bkey_format *, bool);
59 unsigned bch2_sort_keys(struct bkey_packed *,
60 struct sort_iter *, bool);
61 unsigned bch2_sort_extents(struct bkey_packed *,
62 struct sort_iter *, bool);
64 unsigned bch2_sort_key_whiteouts(struct bkey_packed *,
66 unsigned bch2_sort_extent_whiteouts(struct bkey_packed *,
69 #endif /* _BCACHEFS_BKEY_SORT_H */