1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_SUBVOLUME_H
3 #define _BCACHEFS_SUBVOLUME_H
6 #include "subvolume_types.h"
8 enum bkey_invalid_flags;
10 void bch2_snapshot_tree_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
11 int bch2_snapshot_tree_invalid(const struct bch_fs *, struct bkey_s_c,
12 enum bkey_invalid_flags, struct printbuf *);
14 #define bch2_bkey_ops_snapshot_tree ((struct bkey_ops) { \
15 .key_invalid = bch2_snapshot_tree_invalid, \
16 .val_to_text = bch2_snapshot_tree_to_text, \
20 int bch2_snapshot_tree_lookup(struct btree_trans *, u32, struct bch_snapshot_tree *);
22 void bch2_snapshot_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
23 int bch2_snapshot_invalid(const struct bch_fs *, struct bkey_s_c,
24 enum bkey_invalid_flags, struct printbuf *);
25 int bch2_mark_snapshot(struct btree_trans *, enum btree_id, unsigned,
26 struct bkey_s_c, struct bkey_s_c, unsigned);
28 #define bch2_bkey_ops_snapshot ((struct bkey_ops) { \
29 .key_invalid = bch2_snapshot_invalid, \
30 .val_to_text = bch2_snapshot_to_text, \
31 .atomic_trigger = bch2_mark_snapshot, \
35 static inline struct snapshot_t *__snapshot_t(struct snapshot_table *t, u32 id)
37 return &t->s[U32_MAX - id];
40 static inline const struct snapshot_t *snapshot_t(struct bch_fs *c, u32 id)
42 return __snapshot_t(rcu_dereference(c->snapshots), id);
45 static inline u32 bch2_snapshot_tree(struct bch_fs *c, u32 id)
48 id = snapshot_t(c, id)->tree;
54 static inline u32 __bch2_snapshot_parent_early(struct bch_fs *c, u32 id)
56 return snapshot_t(c, id)->parent;
59 static inline u32 bch2_snapshot_parent_early(struct bch_fs *c, u32 id)
62 id = __bch2_snapshot_parent_early(c, id);
68 static inline u32 __bch2_snapshot_parent(struct bch_fs *c, u32 id)
70 #ifdef CONFIG_BCACHEFS_DEBUG
71 u32 parent = snapshot_t(c, id)->parent;
74 snapshot_t(c, id)->depth != snapshot_t(c, parent)->depth + 1)
75 panic("id %u depth=%u parent %u depth=%u\n",
76 id, snapshot_t(c, id)->depth,
77 parent, snapshot_t(c, parent)->depth);
81 return snapshot_t(c, id)->parent;
85 static inline u32 bch2_snapshot_parent(struct bch_fs *c, u32 id)
88 id = __bch2_snapshot_parent(c, id);
94 static inline u32 bch2_snapshot_nth_parent(struct bch_fs *c, u32 id, u32 n)
98 id = __bch2_snapshot_parent(c, id);
104 static inline u32 bch2_snapshot_root(struct bch_fs *c, u32 id)
109 while ((parent = __bch2_snapshot_parent(c, id)))
116 static inline u32 __bch2_snapshot_equiv(struct bch_fs *c, u32 id)
118 return snapshot_t(c, id)->equiv;
121 static inline u32 bch2_snapshot_equiv(struct bch_fs *c, u32 id)
124 id = __bch2_snapshot_equiv(c, id);
130 static inline bool bch2_snapshot_is_equiv(struct bch_fs *c, u32 id)
132 return id == bch2_snapshot_equiv(c, id);
135 static inline bool bch2_snapshot_is_internal_node(struct bch_fs *c, u32 id)
137 const struct snapshot_t *s;
141 s = snapshot_t(c, id);
142 ret = s->children[0];
148 static inline u32 bch2_snapshot_is_leaf(struct bch_fs *c, u32 id)
150 return !bch2_snapshot_is_internal_node(c, id);
153 static inline u32 bch2_snapshot_sibling(struct bch_fs *c, u32 id)
155 const struct snapshot_t *s;
156 u32 parent = __bch2_snapshot_parent(c, id);
161 s = snapshot_t(c, __bch2_snapshot_parent(c, id));
162 if (id == s->children[0])
163 return s->children[1];
164 if (id == s->children[1])
165 return s->children[0];
169 bool __bch2_snapshot_is_ancestor(struct bch_fs *, u32, u32);
171 static inline bool bch2_snapshot_is_ancestor(struct bch_fs *c, u32 id, u32 ancestor)
173 return id == ancestor
175 : __bch2_snapshot_is_ancestor(c, id, ancestor);
178 static inline bool bch2_snapshot_has_children(struct bch_fs *c, u32 id)
180 const struct snapshot_t *t;
184 t = snapshot_t(c, id);
185 ret = (t->children[0]|t->children[1]) != 0;
191 static inline bool snapshot_list_has_id(snapshot_id_list *s, u32 id)
195 darray_for_each(*s, i)
201 static inline bool snapshot_list_has_ancestor(struct bch_fs *c, snapshot_id_list *s, u32 id)
205 darray_for_each(*s, i)
206 if (bch2_snapshot_is_ancestor(c, id, *i))
211 static inline int snapshot_list_add(struct bch_fs *c, snapshot_id_list *s, u32 id)
215 BUG_ON(snapshot_list_has_id(s, id));
216 ret = darray_push(s, id);
218 bch_err(c, "error reallocating snapshot_id_list (size %zu)", s->size);
222 int bch2_check_snapshot_trees(struct bch_fs *);
223 int bch2_check_snapshots(struct bch_fs *);
224 int bch2_check_subvols(struct bch_fs *);
226 void bch2_fs_snapshots_exit(struct bch_fs *);
227 int bch2_snapshots_read(struct bch_fs *);
229 int bch2_subvolume_invalid(const struct bch_fs *, struct bkey_s_c,
230 unsigned, struct printbuf *);
231 void bch2_subvolume_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
233 #define bch2_bkey_ops_subvolume ((struct bkey_ops) { \
234 .key_invalid = bch2_subvolume_invalid, \
235 .val_to_text = bch2_subvolume_to_text, \
236 .min_val_size = 16, \
239 int bch2_subvolume_get(struct btree_trans *, unsigned,
240 bool, int, struct bch_subvolume *);
241 int bch2_snapshot_get_subvol(struct btree_trans *, u32,
242 struct bch_subvolume *);
243 int bch2_subvolume_get_snapshot(struct btree_trans *, u32, u32 *);
245 /* only exported for tests: */
246 int bch2_snapshot_node_create(struct btree_trans *, u32,
247 u32 *, u32 *, unsigned);
249 int bch2_delete_dead_snapshots(struct bch_fs *);
250 void bch2_delete_dead_snapshots_async(struct bch_fs *);
252 int bch2_subvolume_unlink(struct btree_trans *, u32);
253 int bch2_subvolume_create(struct btree_trans *, u64, u32,
256 int bch2_fs_subvolumes_init(struct bch_fs *);
258 #endif /* _BCACHEFS_SUBVOLUME_H */