X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=libbcachefs%2Fbkey_sort.h;h=7c0f0b160f18533302ebc0e5568c7599f2f6cffd;hb=06ff8b55b70fda44d91b31b5511fafd1680a8934;hp=458a051fdac523fd5833c89a3769de2b2ee93a43;hpb=92d34f6ed29e90d48c40a4c31816df805edfe483;p=bcachefs-tools-debian

diff --git a/libbcachefs/bkey_sort.h b/libbcachefs/bkey_sort.h
deleted file mode 100644
index 458a051..0000000
--- a/libbcachefs/bkey_sort.h
+++ /dev/null
@@ -1,57 +0,0 @@
-/* SPDX-License-Identifier: GPL-2.0 */
-#ifndef _BCACHEFS_BKEY_SORT_H
-#define _BCACHEFS_BKEY_SORT_H
-
-struct sort_iter {
-	struct btree		*b;
-	unsigned		used;
-	unsigned		size;
-
-	struct sort_iter_set {
-		struct bkey_packed *k, *end;
-	} data[MAX_BSETS + 1];
-};
-
-static inline void sort_iter_init(struct sort_iter *iter, struct btree *b)
-{
-	iter->b = b;
-	iter->used = 0;
-	iter->size = ARRAY_SIZE(iter->data);
-}
-
-static inline void sort_iter_add(struct sort_iter *iter,
-				 struct bkey_packed *k,
-				 struct bkey_packed *end)
-{
-	BUG_ON(iter->used >= iter->size);
-
-	if (k != end)
-		iter->data[iter->used++] = (struct sort_iter_set) { k, end };
-}
-
-struct btree_nr_keys
-bch2_key_sort_fix_overlapping(struct bch_fs *, struct bset *,
-			      struct sort_iter *);
-struct btree_nr_keys
-bch2_extent_sort_fix_overlapping(struct bch_fs *, struct bset *,
-				 struct sort_iter *);
-
-struct btree_nr_keys
-bch2_sort_repack(struct bset *, struct btree *,
-		 struct btree_node_iter *,
-		 struct bkey_format *, bool);
-struct btree_nr_keys
-bch2_sort_repack_merge(struct bch_fs *,
-		       struct bset *, struct btree *,
-		       struct btree_node_iter *,
-		       struct bkey_format *, bool);
-
-unsigned bch2_sort_keys(struct bkey_packed *,
-			struct sort_iter *, bool);
-unsigned bch2_sort_extents(struct bkey_packed *,
-			   struct sort_iter *, bool);
-
-unsigned bch2_sort_extent_whiteouts(struct bkey_packed *,
-				    struct sort_iter *);
-
-#endif /* _BCACHEFS_BKEY_SORT_H */