1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BACKPOINTERS_BACKGROUND_H
3 #define _BCACHEFS_BACKPOINTERS_BACKGROUND_H
5 #include "btree_iter.h"
6 #include "btree_update.h"
10 int bch2_backpointer_invalid(const struct bch_fs *, struct bkey_s_c k,
11 unsigned, struct printbuf *);
12 void bch2_backpointer_to_text(struct printbuf *, const struct bch_backpointer *);
13 void bch2_backpointer_k_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
14 void bch2_backpointer_swab(struct bkey_s);
16 #define bch2_bkey_ops_backpointer ((struct bkey_ops) { \
17 .key_invalid = bch2_backpointer_invalid, \
18 .val_to_text = bch2_backpointer_k_to_text, \
19 .swab = bch2_backpointer_swab, \
22 #define MAX_EXTENT_COMPRESS_RATIO_SHIFT 10
25 * Convert from pos in backpointer btree to pos of corresponding bucket in alloc
28 static inline struct bpos bp_pos_to_bucket(const struct bch_fs *c,
31 struct bch_dev *ca = bch_dev_bkey_exists(c, bp_pos.inode);
32 u64 bucket_sector = bp_pos.offset >> MAX_EXTENT_COMPRESS_RATIO_SHIFT;
34 return POS(bp_pos.inode, sector_to_bucket(ca, bucket_sector));
38 * Convert from pos in alloc btree + bucket offset to pos in backpointer btree:
40 static inline struct bpos bucket_pos_to_bp(const struct bch_fs *c,
44 struct bch_dev *ca = bch_dev_bkey_exists(c, bucket.inode);
47 ret = POS(bucket.inode,
48 (bucket_to_sector(ca, bucket.offset) <<
49 MAX_EXTENT_COMPRESS_RATIO_SHIFT) + bucket_offset);
51 BUG_ON(!bkey_eq(bucket, bp_pos_to_bucket(c, ret)));
56 bool bch2_bucket_backpointer_del(struct btree_trans *,
57 struct bkey_i_alloc_v4 *,
58 struct bch_backpointer);
60 int bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *,
61 struct bkey_i_alloc_v4 *,
62 struct bch_backpointer, struct bkey_s_c, bool);
64 static inline int bch2_bucket_backpointer_mod(struct btree_trans *trans,
65 struct bkey_i_alloc_v4 *a,
66 struct bch_backpointer bp,
67 struct bkey_s_c orig_k,
70 struct bch_fs *c = trans->c;
71 struct bkey_i_backpointer *bp_k;
75 unlikely(BCH_ALLOC_V4_NR_BACKPOINTERS(&a->v)) &&
76 bch2_bucket_backpointer_del(trans, a, bp))
79 if (unlikely(bch2_backpointers_no_use_write_buffer))
80 return bch2_bucket_backpointer_mod_nowritebuffer(trans, a, bp, orig_k, insert);
82 bp_k = bch2_trans_kmalloc_nomemzero(trans, sizeof(struct bkey_i_backpointer));
83 ret = PTR_ERR_OR_ZERO(bp_k);
87 bkey_backpointer_init(&bp_k->k_i);
88 bp_k->k.p = bucket_pos_to_bp(c, a->k.p, bp.bucket_offset);
92 bp_k->k.type = KEY_TYPE_deleted;
93 set_bkey_val_u64s(&bp_k->k, 0);
96 return bch2_trans_update_buffered(trans, BTREE_ID_backpointers, &bp_k->k_i);
99 static inline void bch2_extent_ptr_to_bp(struct bch_fs *c,
100 enum btree_id btree_id, unsigned level,
101 struct bkey_s_c k, struct extent_ptr_decoded p,
102 struct bpos *bucket_pos, struct bch_backpointer *bp)
104 enum bch_data_type data_type = level ? BCH_DATA_btree : BCH_DATA_user;
105 s64 sectors = level ? btree_sectors(c) : k.k->size;
108 *bucket_pos = PTR_BUCKET_POS_OFFSET(c, &p.ptr, &bucket_offset);
109 *bp = (struct bch_backpointer) {
110 .btree_id = btree_id,
112 .data_type = data_type,
113 .bucket_offset = ((u64) bucket_offset << MAX_EXTENT_COMPRESS_RATIO_SHIFT) +
115 .bucket_len = ptr_disk_sectors(sectors, p),
120 int bch2_get_next_backpointer(struct btree_trans *, struct bpos, int,
121 u64 *, struct bch_backpointer *, unsigned);
122 struct bkey_s_c bch2_backpointer_get_key(struct btree_trans *, struct btree_iter *,
123 struct bpos, u64, struct bch_backpointer);
124 struct btree *bch2_backpointer_get_node(struct btree_trans *, struct btree_iter *,
125 struct bpos, u64, struct bch_backpointer);
127 int bch2_check_btree_backpointers(struct bch_fs *);
128 int bch2_check_extents_to_backpointers(struct bch_fs *);
129 int bch2_check_backpointers_to_extents(struct bch_fs *);
131 #endif /* _BCACHEFS_BACKPOINTERS_BACKGROUND_H */