1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BKEY_SORT_H
3 #define _BCACHEFS_BKEY_SORT_H
10 struct sort_iter_set {
11 struct bkey_packed *k, *end;
12 } data[MAX_BSETS + 1];
15 static inline void sort_iter_init(struct sort_iter *iter, struct btree *b)
19 iter->size = ARRAY_SIZE(iter->data);
22 static inline void sort_iter_add(struct sort_iter *iter,
23 struct bkey_packed *k,
24 struct bkey_packed *end)
26 BUG_ON(iter->used >= iter->size);
29 iter->data[iter->used++] = (struct sort_iter_set) { k, end };
33 bch2_key_sort_fix_overlapping(struct bch_fs *, struct bset *,
36 bch2_extent_sort_fix_overlapping(struct bch_fs *, struct bset *,
40 bch2_sort_repack(struct bset *, struct btree *,
41 struct btree_node_iter *,
42 struct bkey_format *, bool);
44 bch2_sort_repack_merge(struct bch_fs *,
45 struct bset *, struct btree *,
46 struct btree_node_iter *,
47 struct bkey_format *, bool);
49 unsigned bch2_sort_keys(struct bkey_packed *,
50 struct sort_iter *, bool);
51 unsigned bch2_sort_extents(struct bkey_packed *,
52 struct sort_iter *, bool);
54 unsigned bch2_sort_extent_whiteouts(struct bkey_packed *,
57 #endif /* _BCACHEFS_BKEY_SORT_H */