1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_SUBVOLUME_H
3 #define _BCACHEFS_SUBVOLUME_H
6 #include "subvolume_types.h"
8 void bch2_snapshot_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
9 int bch2_snapshot_invalid(const struct bch_fs *, struct bkey_s_c,
10 int rw, struct printbuf *);
12 #define bch2_bkey_ops_snapshot (struct bkey_ops) { \
13 .key_invalid = bch2_snapshot_invalid, \
14 .val_to_text = bch2_snapshot_to_text, \
17 int bch2_mark_snapshot(struct btree_trans *, struct bkey_s_c,
18 struct bkey_s_c, unsigned);
20 static inline struct snapshot_t *snapshot_t(struct bch_fs *c, u32 id)
22 return genradix_ptr(&c->snapshots, U32_MAX - id);
25 static inline u32 bch2_snapshot_parent(struct bch_fs *c, u32 id)
27 return snapshot_t(c, id)->parent;
30 static inline u32 bch2_snapshot_internal_node(struct bch_fs *c, u32 id)
32 struct snapshot_t *s = snapshot_t(c, id);
34 return s->children[0] || s->children[1];
37 static inline u32 bch2_snapshot_sibling(struct bch_fs *c, u32 id)
40 u32 parent = bch2_snapshot_parent(c, id);
45 s = snapshot_t(c, bch2_snapshot_parent(c, id));
46 if (id == s->children[0])
47 return s->children[1];
48 if (id == s->children[1])
49 return s->children[0];
53 static inline bool bch2_snapshot_is_ancestor(struct bch_fs *c, u32 id, u32 ancestor)
55 while (id && id < ancestor)
56 id = bch2_snapshot_parent(c, id);
58 return id == ancestor;
61 struct snapshots_seen {
66 static inline void snapshots_seen_exit(struct snapshots_seen *s)
72 static inline void snapshots_seen_init(struct snapshots_seen *s)
74 memset(s, 0, sizeof(*s));
77 static inline int snapshots_seen_add(struct bch_fs *c, struct snapshots_seen *s, u32 id)
79 int ret = darray_push(&s->ids, id);
81 bch_err(c, "error reallocating snapshots_seen table (size %zu)",
86 static inline bool snapshot_list_has_id(snapshot_id_list *s, u32 id)
90 darray_for_each(*s, i)
96 int bch2_fs_snapshots_check(struct bch_fs *);
97 void bch2_fs_snapshots_exit(struct bch_fs *);
98 int bch2_fs_snapshots_start(struct bch_fs *);
100 int bch2_subvolume_invalid(const struct bch_fs *, struct bkey_s_c,
101 int rw, struct printbuf *);
102 void bch2_subvolume_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
104 #define bch2_bkey_ops_subvolume (struct bkey_ops) { \
105 .key_invalid = bch2_subvolume_invalid, \
106 .val_to_text = bch2_subvolume_to_text, \
109 int bch2_subvolume_get(struct btree_trans *, unsigned,
110 bool, int, struct bch_subvolume *);
111 int bch2_snapshot_get_subvol(struct btree_trans *, u32,
112 struct bch_subvolume *);
113 int bch2_subvolume_get_snapshot(struct btree_trans *, u32, u32 *);
115 /* only exported for tests: */
116 int bch2_snapshot_node_create(struct btree_trans *, u32,
117 u32 *, u32 *, unsigned);
119 int bch2_subvolume_delete(struct btree_trans *, u32);
120 int bch2_subvolume_unlink(struct btree_trans *, u32);
121 int bch2_subvolume_create(struct btree_trans *, u64, u32,
124 int bch2_fs_subvolumes_init(struct bch_fs *);
126 #endif /* _BCACHEFS_SUBVOLUME_H */