1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_UPDATE_H
3 #define _BCACHEFS_BTREE_UPDATE_H
5 #include "btree_iter.h"
11 void bch2_btree_node_prep_for_write(struct btree_trans *,
12 struct btree_path *, struct btree *);
13 bool bch2_btree_bset_insert_key(struct btree_trans *, struct btree_path *,
14 struct btree *, struct btree_node_iter *,
17 int bch2_btree_node_flush0(struct journal *, struct journal_entry_pin *, u64);
18 int bch2_btree_node_flush1(struct journal *, struct journal_entry_pin *, u64);
19 void bch2_btree_add_journal_pin(struct bch_fs *, struct btree *, u64);
21 void bch2_btree_insert_key_leaf(struct btree_trans *, struct btree_path *,
22 struct bkey_i *, u64);
24 enum btree_insert_flags {
25 /* First bits for bch_watermark: */
26 __BTREE_INSERT_NOFAIL = BCH_WATERMARK_BITS,
27 __BTREE_INSERT_NOCHECK_RW,
28 __BTREE_INSERT_LAZY_RW,
29 __BTREE_INSERT_JOURNAL_REPLAY,
30 __BTREE_INSERT_JOURNAL_RECLAIM,
31 __BTREE_INSERT_NOWAIT,
32 __BTREE_INSERT_GC_LOCK_HELD,
33 __BCH_HASH_SET_MUST_CREATE,
34 __BCH_HASH_SET_MUST_REPLACE,
37 /* Don't check for -ENOSPC: */
38 #define BTREE_INSERT_NOFAIL BIT(__BTREE_INSERT_NOFAIL)
40 #define BTREE_INSERT_NOCHECK_RW BIT(__BTREE_INSERT_NOCHECK_RW)
41 #define BTREE_INSERT_LAZY_RW BIT(__BTREE_INSERT_LAZY_RW)
43 /* Insert is for journal replay - don't get journal reservations: */
44 #define BTREE_INSERT_JOURNAL_REPLAY BIT(__BTREE_INSERT_JOURNAL_REPLAY)
46 /* Insert is being called from journal reclaim path: */
47 #define BTREE_INSERT_JOURNAL_RECLAIM BIT(__BTREE_INSERT_JOURNAL_RECLAIM)
49 /* Don't block on allocation failure (for new btree nodes: */
50 #define BTREE_INSERT_NOWAIT BIT(__BTREE_INSERT_NOWAIT)
51 #define BTREE_INSERT_GC_LOCK_HELD BIT(__BTREE_INSERT_GC_LOCK_HELD)
53 #define BCH_HASH_SET_MUST_CREATE BIT(__BCH_HASH_SET_MUST_CREATE)
54 #define BCH_HASH_SET_MUST_REPLACE BIT(__BCH_HASH_SET_MUST_REPLACE)
56 int bch2_btree_delete_extent_at(struct btree_trans *, struct btree_iter *,
58 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
59 int bch2_btree_delete_at_buffered(struct btree_trans *, enum btree_id, struct bpos);
60 int bch2_btree_delete(struct btree_trans *, enum btree_id, struct bpos, unsigned);
62 int bch2_btree_insert_nonextent(struct btree_trans *, enum btree_id,
63 struct bkey_i *, enum btree_update_flags);
65 int bch2_btree_insert_trans(struct btree_trans *, enum btree_id, struct bkey_i *,
66 enum btree_update_flags);
67 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
68 struct disk_reservation *, int flags);
70 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
71 struct bpos, struct bpos, unsigned, u64 *);
72 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
73 struct bpos, struct bpos, unsigned, u64 *);
75 int bch2_btree_bit_mod(struct btree_trans *, enum btree_id, struct bpos, bool);
77 int __bch2_insert_snapshot_whiteouts(struct btree_trans *, enum btree_id,
78 struct bpos, struct bpos);
81 * For use when splitting extents in existing snapshots:
83 * If @old_pos is an interior snapshot node, iterate over descendent snapshot
84 * nodes: for every descendent snapshot in whiche @old_pos is overwritten and
85 * not visible, emit a whiteout at @new_pos.
87 static inline int bch2_insert_snapshot_whiteouts(struct btree_trans *trans,
92 if (!btree_type_has_snapshots(btree) ||
93 bkey_eq(old_pos, new_pos))
96 return __bch2_insert_snapshot_whiteouts(trans, btree, old_pos, new_pos);
99 int bch2_trans_update_extent_overwrite(struct btree_trans *, struct btree_iter *,
100 enum btree_update_flags,
101 struct bkey_s_c, struct bkey_s_c);
103 int bch2_bkey_get_empty_slot(struct btree_trans *, struct btree_iter *,
104 enum btree_id, struct bpos);
106 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
107 struct bkey_i *, enum btree_update_flags);
108 int __must_check bch2_trans_update_seq(struct btree_trans *, u64, struct btree_iter *,
109 struct bkey_i *, enum btree_update_flags);
110 int __must_check bch2_trans_update_buffered(struct btree_trans *,
111 enum btree_id, struct bkey_i *);
113 void bch2_trans_commit_hook(struct btree_trans *,
114 struct btree_trans_commit_hook *);
115 int __bch2_trans_commit(struct btree_trans *, unsigned);
117 __printf(2, 3) int bch2_fs_log_msg(struct bch_fs *, const char *, ...);
118 __printf(2, 3) int bch2_journal_log_msg(struct bch_fs *, const char *, ...);
121 * bch2_trans_commit - insert keys at given iterator positions
123 * This is main entry point for btree updates.
126 * -EROFS: filesystem read only
127 * -EIO: journal or btree node IO error
129 static inline int bch2_trans_commit(struct btree_trans *trans,
130 struct disk_reservation *disk_res,
134 trans->disk_res = disk_res;
135 trans->journal_seq = journal_seq;
137 return __bch2_trans_commit(trans, flags);
140 #define commit_do(_trans, _disk_res, _journal_seq, _flags, _do) \
141 lockrestart_do(_trans, _do ?: bch2_trans_commit(_trans, (_disk_res),\
142 (_journal_seq), (_flags)))
144 #define nested_commit_do(_trans, _disk_res, _journal_seq, _flags, _do) \
145 nested_lockrestart_do(_trans, _do ?: bch2_trans_commit(_trans, (_disk_res),\
146 (_journal_seq), (_flags)))
148 #define bch2_trans_run(_c, _do) \
150 struct btree_trans *trans = bch2_trans_get(_c); \
152 bch2_trans_put(trans); \
156 #define bch2_trans_do(_c, _disk_res, _journal_seq, _flags, _do) \
157 bch2_trans_run(_c, commit_do(trans, _disk_res, _journal_seq, _flags, _do))
159 #define trans_for_each_update(_trans, _i) \
160 for ((_i) = (_trans)->updates; \
161 (_i) < (_trans)->updates + (_trans)->nr_updates; \
164 #define trans_for_each_wb_update(_trans, _i) \
165 for ((_i) = (_trans)->wb_updates; \
166 (_i) < (_trans)->wb_updates + (_trans)->nr_wb_updates; \
169 static inline void bch2_trans_reset_updates(struct btree_trans *trans)
171 struct btree_insert_entry *i;
173 trans_for_each_update(trans, i)
174 bch2_path_put(trans, i->path, true);
176 trans->extra_journal_res = 0;
177 trans->nr_updates = 0;
178 trans->nr_wb_updates = 0;
179 trans->wb_updates = NULL;
181 trans->extra_journal_entries.nr = 0;
183 if (trans->fs_usage_deltas) {
184 trans->fs_usage_deltas->used = 0;
185 memset((void *) trans->fs_usage_deltas +
186 offsetof(struct replicas_delta_list, memset_start), 0,
187 (void *) &trans->fs_usage_deltas->memset_end -
188 (void *) &trans->fs_usage_deltas->memset_start);
192 static inline struct bkey_i *__bch2_bkey_make_mut_noupdate(struct btree_trans *trans, struct bkey_s_c k,
193 unsigned type, unsigned min_bytes)
195 unsigned bytes = max_t(unsigned, min_bytes, bkey_bytes(k.k));
198 if (type && k.k->type != type)
199 return ERR_PTR(-ENOENT);
201 mut = bch2_trans_kmalloc_nomemzero(trans, bytes);
203 bkey_reassemble(mut, k);
205 if (unlikely(bytes > bkey_bytes(k.k))) {
206 memset((void *) mut + bkey_bytes(k.k), 0,
207 bytes - bkey_bytes(k.k));
208 mut->k.u64s = DIV_ROUND_UP(bytes, sizeof(u64));
214 static inline struct bkey_i *bch2_bkey_make_mut_noupdate(struct btree_trans *trans, struct bkey_s_c k)
216 return __bch2_bkey_make_mut_noupdate(trans, k, 0, 0);
219 #define bch2_bkey_make_mut_noupdate_typed(_trans, _k, _type) \
220 bkey_i_to_##_type(__bch2_bkey_make_mut_noupdate(_trans, _k, \
221 KEY_TYPE_##_type, sizeof(struct bkey_i_##_type)))
223 static inline struct bkey_i *__bch2_bkey_make_mut(struct btree_trans *trans, struct btree_iter *iter,
224 struct bkey_s_c *k, unsigned flags,
225 unsigned type, unsigned min_bytes)
227 struct bkey_i *mut = __bch2_bkey_make_mut_noupdate(trans, *k, type, min_bytes);
233 ret = bch2_trans_update(trans, iter, mut, flags);
237 *k = bkey_i_to_s_c(mut);
241 static inline struct bkey_i *bch2_bkey_make_mut(struct btree_trans *trans, struct btree_iter *iter,
242 struct bkey_s_c *k, unsigned flags)
244 return __bch2_bkey_make_mut(trans, iter, k, flags, 0, 0);
247 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \
248 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
249 KEY_TYPE_##_type, sizeof(struct bkey_i_##_type)))
251 static inline struct bkey_i *__bch2_bkey_get_mut_noupdate(struct btree_trans *trans,
252 struct btree_iter *iter,
253 unsigned btree_id, struct bpos pos,
254 unsigned flags, unsigned type, unsigned min_bytes)
256 struct bkey_s_c k = __bch2_bkey_get_iter(trans, iter,
257 btree_id, pos, flags|BTREE_ITER_INTENT, type);
258 struct bkey_i *ret = IS_ERR(k.k)
260 : __bch2_bkey_make_mut_noupdate(trans, k, 0, min_bytes);
262 bch2_trans_iter_exit(trans, iter);
266 static inline struct bkey_i *bch2_bkey_get_mut_noupdate(struct btree_trans *trans,
267 struct btree_iter *iter,
268 unsigned btree_id, struct bpos pos,
271 return __bch2_bkey_get_mut_noupdate(trans, iter, btree_id, pos, flags, 0, 0);
274 static inline struct bkey_i *__bch2_bkey_get_mut(struct btree_trans *trans,
275 struct btree_iter *iter,
276 unsigned btree_id, struct bpos pos,
277 unsigned flags, unsigned type, unsigned min_bytes)
279 struct bkey_i *mut = __bch2_bkey_get_mut_noupdate(trans, iter,
280 btree_id, pos, flags|BTREE_ITER_INTENT, type, min_bytes);
286 ret = bch2_trans_update(trans, iter, mut, flags);
288 bch2_trans_iter_exit(trans, iter);
295 static inline struct bkey_i *bch2_bkey_get_mut_minsize(struct btree_trans *trans,
296 struct btree_iter *iter,
297 unsigned btree_id, struct bpos pos,
298 unsigned flags, unsigned min_bytes)
300 return __bch2_bkey_get_mut(trans, iter, btree_id, pos, flags, 0, min_bytes);
303 static inline struct bkey_i *bch2_bkey_get_mut(struct btree_trans *trans,
304 struct btree_iter *iter,
305 unsigned btree_id, struct bpos pos,
308 return __bch2_bkey_get_mut(trans, iter, btree_id, pos, flags, 0, 0);
311 #define bch2_bkey_get_mut_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
312 bkey_i_to_##_type(__bch2_bkey_get_mut(_trans, _iter, \
313 _btree_id, _pos, _flags, \
314 KEY_TYPE_##_type, sizeof(struct bkey_i_##_type)))
316 static inline struct bkey_i *__bch2_bkey_alloc(struct btree_trans *trans, struct btree_iter *iter,
317 unsigned flags, unsigned type, unsigned val_size)
319 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(*k) + val_size);
328 set_bkey_val_bytes(&k->k, val_size);
330 ret = bch2_trans_update(trans, iter, k, flags);
336 #define bch2_bkey_alloc(_trans, _iter, _flags, _type) \
337 bkey_i_to_##_type(__bch2_bkey_alloc(_trans, _iter, _flags, \
338 KEY_TYPE_##_type, sizeof(struct bch_##_type)))
340 #endif /* _BCACHEFS_BTREE_UPDATE_H */