1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_update.h"
5 #include "btree_iter.h"
6 #include "btree_journal_iter.h"
7 #include "btree_locking.h"
17 static inline int btree_insert_entry_cmp(const struct btree_insert_entry *l,
18 const struct btree_insert_entry *r)
20 return cmp_int(l->btree_id, r->btree_id) ?:
21 cmp_int(l->cached, r->cached) ?:
22 -cmp_int(l->level, r->level) ?:
23 bpos_cmp(l->k->k.p, r->k->k.p);
26 static int __must_check
27 bch2_trans_update_by_path(struct btree_trans *, struct btree_path *,
28 struct bkey_i *, enum btree_update_flags,
31 static noinline int extent_front_merge(struct btree_trans *trans,
32 struct btree_iter *iter,
34 struct bkey_i **insert,
35 enum btree_update_flags flags)
37 struct bch_fs *c = trans->c;
38 struct bkey_i *update;
41 update = bch2_bkey_make_mut_noupdate(trans, k);
42 ret = PTR_ERR_OR_ZERO(update);
46 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert)))
49 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, k.k->p) ?:
50 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p);
56 ret = bch2_btree_delete_at(trans, iter, flags);
64 static noinline int extent_back_merge(struct btree_trans *trans,
65 struct btree_iter *iter,
66 struct bkey_i *insert,
69 struct bch_fs *c = trans->c;
72 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?:
73 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, k.k->p);
79 bch2_bkey_merge(c, bkey_i_to_s(insert), k);
84 * When deleting, check if we need to emit a whiteout (because we're overwriting
85 * something in an ancestor snapshot)
87 static int need_whiteout_for_snapshot(struct btree_trans *trans,
88 enum btree_id btree_id, struct bpos pos)
90 struct btree_iter iter;
92 u32 snapshot = pos.snapshot;
95 if (!bch2_snapshot_parent(trans->c, pos.snapshot))
100 for_each_btree_key_norestart(trans, iter, btree_id, pos,
101 BTREE_ITER_ALL_SNAPSHOTS|
102 BTREE_ITER_NOPRESERVE, k, ret) {
103 if (!bkey_eq(k.k->p, pos))
106 if (bch2_snapshot_is_ancestor(trans->c, snapshot,
108 ret = !bkey_whiteout(k.k);
112 bch2_trans_iter_exit(trans, &iter);
117 int __bch2_insert_snapshot_whiteouts(struct btree_trans *trans,
122 struct bch_fs *c = trans->c;
123 struct btree_iter old_iter, new_iter = { NULL };
124 struct bkey_s_c old_k, new_k;
126 struct bkey_i *update;
129 if (!bch2_snapshot_has_children(c, old_pos.snapshot))
134 bch2_trans_iter_init(trans, &old_iter, id, old_pos,
135 BTREE_ITER_NOT_EXTENTS|
136 BTREE_ITER_ALL_SNAPSHOTS);
137 while ((old_k = bch2_btree_iter_prev(&old_iter)).k &&
138 !(ret = bkey_err(old_k)) &&
139 bkey_eq(old_pos, old_k.k->p)) {
140 struct bpos whiteout_pos =
141 SPOS(new_pos.inode, new_pos.offset, old_k.k->p.snapshot);;
143 if (!bch2_snapshot_is_ancestor(c, old_k.k->p.snapshot, old_pos.snapshot) ||
144 snapshot_list_has_ancestor(c, &s, old_k.k->p.snapshot))
147 new_k = bch2_bkey_get_iter(trans, &new_iter, id, whiteout_pos,
148 BTREE_ITER_NOT_EXTENTS|
150 ret = bkey_err(new_k);
154 if (new_k.k->type == KEY_TYPE_deleted) {
155 update = bch2_trans_kmalloc(trans, sizeof(struct bkey_i));
156 ret = PTR_ERR_OR_ZERO(update);
160 bkey_init(&update->k);
161 update->k.p = whiteout_pos;
162 update->k.type = KEY_TYPE_whiteout;
164 ret = bch2_trans_update(trans, &new_iter, update,
165 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
167 bch2_trans_iter_exit(trans, &new_iter);
169 ret = snapshot_list_add(c, &s, old_k.k->p.snapshot);
173 bch2_trans_iter_exit(trans, &new_iter);
174 bch2_trans_iter_exit(trans, &old_iter);
180 int bch2_trans_update_extent_overwrite(struct btree_trans *trans,
181 struct btree_iter *iter,
182 enum btree_update_flags flags,
186 enum btree_id btree_id = iter->btree_id;
187 struct bkey_i *update;
188 struct bpos new_start = bkey_start_pos(new.k);
189 bool front_split = bkey_lt(bkey_start_pos(old.k), new_start);
190 bool back_split = bkey_gt(old.k->p, new.k->p);
191 int ret = 0, compressed_sectors;
194 * If we're going to be splitting a compressed extent, note it
195 * so that __bch2_trans_commit() can increase our disk
198 if (((front_split && back_split) ||
199 ((front_split || back_split) && old.k->p.snapshot != new.k->p.snapshot)) &&
200 (compressed_sectors = bch2_bkey_sectors_compressed(old)))
201 trans->extra_journal_res += compressed_sectors;
204 update = bch2_bkey_make_mut_noupdate(trans, old);
205 if ((ret = PTR_ERR_OR_ZERO(update)))
208 bch2_cut_back(new_start, update);
210 ret = bch2_insert_snapshot_whiteouts(trans, btree_id,
211 old.k->p, update->k.p) ?:
212 bch2_btree_insert_nonextent(trans, btree_id, update,
213 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
218 /* If we're overwriting in a different snapshot - middle split: */
219 if (old.k->p.snapshot != new.k->p.snapshot &&
220 (front_split || back_split)) {
221 update = bch2_bkey_make_mut_noupdate(trans, old);
222 if ((ret = PTR_ERR_OR_ZERO(update)))
225 bch2_cut_front(new_start, update);
226 bch2_cut_back(new.k->p, update);
228 ret = bch2_insert_snapshot_whiteouts(trans, btree_id,
229 old.k->p, update->k.p) ?:
230 bch2_btree_insert_nonextent(trans, btree_id, update,
231 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
236 if (bkey_le(old.k->p, new.k->p)) {
237 update = bch2_trans_kmalloc(trans, sizeof(*update));
238 if ((ret = PTR_ERR_OR_ZERO(update)))
241 bkey_init(&update->k);
242 update->k.p = old.k->p;
243 update->k.p.snapshot = new.k->p.snapshot;
245 if (new.k->p.snapshot != old.k->p.snapshot) {
246 update->k.type = KEY_TYPE_whiteout;
247 } else if (btree_type_has_snapshots(btree_id)) {
248 ret = need_whiteout_for_snapshot(trans, btree_id, update->k.p);
252 update->k.type = KEY_TYPE_whiteout;
255 ret = bch2_btree_insert_nonextent(trans, btree_id, update,
256 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
262 update = bch2_bkey_make_mut_noupdate(trans, old);
263 if ((ret = PTR_ERR_OR_ZERO(update)))
266 bch2_cut_front(new.k->p, update);
268 ret = bch2_trans_update_by_path(trans, iter->path, update,
269 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
278 static int bch2_trans_update_extent(struct btree_trans *trans,
279 struct btree_iter *orig_iter,
280 struct bkey_i *insert,
281 enum btree_update_flags flags)
283 struct btree_iter iter;
285 enum btree_id btree_id = orig_iter->btree_id;
288 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k),
290 BTREE_ITER_WITH_UPDATES|
291 BTREE_ITER_NOT_EXTENTS);
292 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
293 if ((ret = bkey_err(k)))
298 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {
299 if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {
300 ret = extent_front_merge(trans, &iter, k, &insert, flags);
308 while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {
309 bool done = bkey_lt(insert->k.p, k.k->p);
311 ret = bch2_trans_update_extent_overwrite(trans, &iter, flags, k, bkey_i_to_s_c(insert));
318 bch2_btree_iter_advance(&iter);
319 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
320 if ((ret = bkey_err(k)))
326 if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {
327 ret = extent_back_merge(trans, &iter, insert, k);
332 if (!bkey_deleted(&insert->k))
333 ret = bch2_btree_insert_nonextent(trans, btree_id, insert, flags);
335 bch2_trans_iter_exit(trans, &iter);
340 static noinline int flush_new_cached_update(struct btree_trans *trans,
341 struct btree_path *path,
342 struct btree_insert_entry *i,
343 enum btree_update_flags flags,
346 struct btree_path *btree_path;
350 btree_path = bch2_path_get(trans, path->btree_id, path->pos, 1, 0,
351 BTREE_ITER_INTENT, _THIS_IP_);
352 ret = bch2_btree_path_traverse(trans, btree_path, 0);
357 * The old key in the insert entry might actually refer to an existing
358 * key in the btree that has been deleted from cache and not yet
359 * flushed. Check for this and skip the flush so we don't run triggers
360 * against a stale key.
362 bch2_btree_path_peek_slot_exact(btree_path, &k);
363 if (!bkey_deleted(&k))
366 i->key_cache_already_flushed = true;
367 i->flags |= BTREE_TRIGGER_NORUN;
369 btree_path_set_should_be_locked(btree_path);
370 ret = bch2_trans_update_by_path(trans, btree_path, i->k, flags, ip);
372 bch2_path_put(trans, btree_path, true);
376 static int __must_check
377 bch2_trans_update_by_path(struct btree_trans *trans, struct btree_path *path,
378 struct bkey_i *k, enum btree_update_flags flags,
381 struct bch_fs *c = trans->c;
382 struct btree_insert_entry *i, n;
385 EBUG_ON(!path->should_be_locked);
386 EBUG_ON(trans->nr_updates >= BTREE_ITER_MAX);
387 EBUG_ON(!bpos_eq(k->k.p, path->pos));
389 n = (struct btree_insert_entry) {
391 .bkey_type = __btree_node_type(path->level, path->btree_id),
392 .btree_id = path->btree_id,
393 .level = path->level,
394 .cached = path->cached,
400 #ifdef CONFIG_BCACHEFS_DEBUG
401 trans_for_each_update(trans, i)
402 BUG_ON(i != trans->updates &&
403 btree_insert_entry_cmp(i - 1, i) >= 0);
407 * Pending updates are kept sorted: first, find position of new update,
408 * then delete/trim any updates the new update overwrites:
410 trans_for_each_update(trans, i) {
411 cmp = btree_insert_entry_cmp(&n, i);
416 if (!cmp && i < trans->updates + trans->nr_updates) {
417 EBUG_ON(i->insert_trigger_run || i->overwrite_trigger_run);
419 bch2_path_put(trans, i->path, true);
421 i->cached = n.cached;
424 i->ip_allocated = n.ip_allocated;
426 array_insert_item(trans->updates, trans->nr_updates,
427 i - trans->updates, n);
429 i->old_v = bch2_btree_path_peek_slot_exact(path, &i->old_k).v;
430 i->old_btree_u64s = !bkey_deleted(&i->old_k) ? i->old_k.u64s : 0;
432 if (unlikely(trans->journal_replay_not_finished)) {
434 bch2_journal_keys_peek_slot(c, n.btree_id, n.level, k->k.p);
443 __btree_path_get(i->path, true);
446 * If a key is present in the key cache, it must also exist in the
447 * btree - this is necessary for cache coherency. When iterating over
448 * a btree that's cached in the key cache, the btree iter code checks
449 * the key cache - but the key has to exist in the btree for that to
452 if (path->cached && bkey_deleted(&i->old_k))
453 return flush_new_cached_update(trans, path, i, flags, ip);
458 static noinline int bch2_trans_update_get_key_cache(struct btree_trans *trans,
459 struct btree_iter *iter,
460 struct btree_path *path)
462 if (!iter->key_cache_path ||
463 !iter->key_cache_path->should_be_locked ||
464 !bpos_eq(iter->key_cache_path->pos, iter->pos)) {
465 struct bkey_cached *ck;
468 if (!iter->key_cache_path)
469 iter->key_cache_path =
470 bch2_path_get(trans, path->btree_id, path->pos, 1, 0,
472 BTREE_ITER_CACHED, _THIS_IP_);
474 iter->key_cache_path =
475 bch2_btree_path_set_pos(trans, iter->key_cache_path, path->pos,
476 iter->flags & BTREE_ITER_INTENT,
479 ret = bch2_btree_path_traverse(trans, iter->key_cache_path,
484 ck = (void *) iter->key_cache_path->l[0].b;
486 if (test_bit(BKEY_CACHED_DIRTY, &ck->flags)) {
487 trace_and_count(trans->c, trans_restart_key_cache_raced, trans, _RET_IP_);
488 return btree_trans_restart(trans, BCH_ERR_transaction_restart_key_cache_raced);
491 btree_path_set_should_be_locked(iter->key_cache_path);
497 int __must_check bch2_trans_update(struct btree_trans *trans, struct btree_iter *iter,
498 struct bkey_i *k, enum btree_update_flags flags)
500 struct btree_path *path = iter->update_path ?: iter->path;
503 if (iter->flags & BTREE_ITER_IS_EXTENTS)
504 return bch2_trans_update_extent(trans, iter, k, flags);
506 if (bkey_deleted(&k->k) &&
507 !(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
508 (iter->flags & BTREE_ITER_FILTER_SNAPSHOTS)) {
509 ret = need_whiteout_for_snapshot(trans, iter->btree_id, k->k.p);
510 if (unlikely(ret < 0))
514 k->k.type = KEY_TYPE_whiteout;
518 * Ensure that updates to cached btrees go to the key cache:
520 if (!(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
523 btree_id_cached(trans->c, path->btree_id)) {
524 ret = bch2_trans_update_get_key_cache(trans, iter, path);
528 path = iter->key_cache_path;
531 return bch2_trans_update_by_path(trans, path, k, flags, _RET_IP_);
534 static noinline int bch2_btree_insert_clone_trans(struct btree_trans *trans,
538 struct bkey_i *n = bch2_trans_kmalloc(trans, bkey_bytes(&k->k));
539 int ret = PTR_ERR_OR_ZERO(n);
544 return bch2_btree_insert_trans(trans, btree, n, 0);
547 int __must_check bch2_trans_update_buffered(struct btree_trans *trans,
551 struct btree_write_buffered_key *i;
554 EBUG_ON(trans->nr_wb_updates > trans->wb_updates_size);
555 EBUG_ON(k->k.u64s > BTREE_WRITE_BUFERED_U64s_MAX);
557 if (unlikely(trans->journal_replay_not_finished))
558 return bch2_btree_insert_clone_trans(trans, btree, k);
560 trans_for_each_wb_update(trans, i) {
561 if (i->btree == btree && bpos_eq(i->k.k.p, k->k.p)) {
567 if (!trans->wb_updates ||
568 trans->nr_wb_updates == trans->wb_updates_size) {
569 struct btree_write_buffered_key *u;
571 if (trans->nr_wb_updates == trans->wb_updates_size) {
572 struct btree_transaction_stats *s = btree_trans_stats(trans);
574 BUG_ON(trans->wb_updates_size > U8_MAX / 2);
575 trans->wb_updates_size = max(1, trans->wb_updates_size * 2);
577 s->wb_updates_size = trans->wb_updates_size;
580 u = bch2_trans_kmalloc_nomemzero(trans,
581 trans->wb_updates_size *
582 sizeof(struct btree_write_buffered_key));
583 ret = PTR_ERR_OR_ZERO(u);
587 if (trans->nr_wb_updates)
588 memcpy(u, trans->wb_updates, trans->nr_wb_updates *
589 sizeof(struct btree_write_buffered_key));
590 trans->wb_updates = u;
593 trans->wb_updates[trans->nr_wb_updates] = (struct btree_write_buffered_key) {
597 bkey_copy(&trans->wb_updates[trans->nr_wb_updates].k, k);
598 trans->nr_wb_updates++;
603 int bch2_bkey_get_empty_slot(struct btree_trans *trans, struct btree_iter *iter,
604 enum btree_id btree, struct bpos end)
609 bch2_trans_iter_init(trans, iter, btree, POS_MAX, BTREE_ITER_INTENT);
610 k = bch2_btree_iter_prev(iter);
615 bch2_btree_iter_advance(iter);
616 k = bch2_btree_iter_peek_slot(iter);
621 BUG_ON(k.k->type != KEY_TYPE_deleted);
623 if (bkey_gt(k.k->p, end)) {
624 ret = -BCH_ERR_ENOSPC_btree_slot;
630 bch2_trans_iter_exit(trans, iter);
634 void bch2_trans_commit_hook(struct btree_trans *trans,
635 struct btree_trans_commit_hook *h)
637 h->next = trans->hooks;
641 int bch2_btree_insert_nonextent(struct btree_trans *trans,
642 enum btree_id btree, struct bkey_i *k,
643 enum btree_update_flags flags)
645 struct btree_iter iter;
648 bch2_trans_iter_init(trans, &iter, btree, k->k.p,
650 BTREE_ITER_NOT_EXTENTS|
652 ret = bch2_btree_iter_traverse(&iter) ?:
653 bch2_trans_update(trans, &iter, k, flags);
654 bch2_trans_iter_exit(trans, &iter);
658 int bch2_btree_insert_trans(struct btree_trans *trans, enum btree_id id,
659 struct bkey_i *k, enum btree_update_flags flags)
661 struct btree_iter iter;
664 bch2_trans_iter_init(trans, &iter, id, bkey_start_pos(&k->k),
667 ret = bch2_btree_iter_traverse(&iter) ?:
668 bch2_trans_update(trans, &iter, k, flags);
669 bch2_trans_iter_exit(trans, &iter);
674 * bch2_btree_insert - insert keys into the extent btree
675 * @c: pointer to struct bch_fs
676 * @id: btree to insert into
678 * @disk_res: must be non-NULL whenever inserting or potentially
679 * splitting data extents
680 * @flags: transaction commit flags
682 * Returns: 0 on success, error code on failure
684 int bch2_btree_insert(struct bch_fs *c, enum btree_id id, struct bkey_i *k,
685 struct disk_reservation *disk_res, int flags)
687 return bch2_trans_do(c, disk_res, NULL, flags,
688 bch2_btree_insert_trans(trans, id, k, 0));
691 int bch2_btree_delete_extent_at(struct btree_trans *trans, struct btree_iter *iter,
692 unsigned len, unsigned update_flags)
696 k = bch2_trans_kmalloc(trans, sizeof(*k));
702 bch2_key_resize(&k->k, len);
703 return bch2_trans_update(trans, iter, k, update_flags);
706 int bch2_btree_delete_at(struct btree_trans *trans,
707 struct btree_iter *iter, unsigned update_flags)
709 return bch2_btree_delete_extent_at(trans, iter, 0, update_flags);
712 int bch2_btree_delete(struct btree_trans *trans,
713 enum btree_id btree, struct bpos pos,
714 unsigned update_flags)
716 struct btree_iter iter;
719 bch2_trans_iter_init(trans, &iter, btree, pos,
722 ret = bch2_btree_iter_traverse(&iter) ?:
723 bch2_btree_delete_at(trans, &iter, update_flags);
724 bch2_trans_iter_exit(trans, &iter);
729 int bch2_btree_delete_range_trans(struct btree_trans *trans, enum btree_id id,
730 struct bpos start, struct bpos end,
731 unsigned update_flags,
734 u32 restart_count = trans->restart_count;
735 struct btree_iter iter;
739 bch2_trans_iter_init(trans, &iter, id, start, BTREE_ITER_INTENT);
740 while ((k = bch2_btree_iter_peek_upto(&iter, end)).k) {
741 struct disk_reservation disk_res =
742 bch2_disk_reservation_init(trans->c, 0);
743 struct bkey_i delete;
749 bkey_init(&delete.k);
752 * This could probably be more efficient for extents:
756 * For extents, iter.pos won't necessarily be the same as
757 * bkey_start_pos(k.k) (for non extents they always will be the
758 * same). It's important that we delete starting from iter.pos
759 * because the range we want to delete could start in the middle
762 * (bch2_btree_iter_peek() does guarantee that iter.pos >=
763 * bkey_start_pos(k.k)).
765 delete.k.p = iter.pos;
767 if (iter.flags & BTREE_ITER_IS_EXTENTS)
768 bch2_key_resize(&delete.k,
769 bpos_min(end, k.k->p).offset -
772 ret = bch2_trans_update(trans, &iter, &delete, update_flags) ?:
773 bch2_trans_commit(trans, &disk_res, journal_seq,
774 BCH_TRANS_COMMIT_no_enospc);
775 bch2_disk_reservation_put(trans->c, &disk_res);
778 * the bch2_trans_begin() call is in a weird place because we
779 * need to call it after every transaction commit, to avoid path
780 * overflow, but don't want to call it if the delete operation
781 * is a no-op and we have no work to do:
783 bch2_trans_begin(trans);
785 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
790 bch2_trans_iter_exit(trans, &iter);
792 return ret ?: trans_was_restarted(trans, restart_count);
796 * bch_btree_delete_range - delete everything within a given range
798 * Range is a half open interval - [start, end)
800 int bch2_btree_delete_range(struct bch_fs *c, enum btree_id id,
801 struct bpos start, struct bpos end,
802 unsigned update_flags,
805 int ret = bch2_trans_run(c,
806 bch2_btree_delete_range_trans(trans, id, start, end,
807 update_flags, journal_seq));
808 if (ret == -BCH_ERR_transaction_restart_nested)
813 int bch2_btree_bit_mod(struct btree_trans *trans, enum btree_id btree,
814 struct bpos pos, bool set)
819 k.k.type = set ? KEY_TYPE_set : KEY_TYPE_deleted;
822 return bch2_trans_update_buffered(trans, btree, &k);
826 static int __bch2_trans_log_msg(darray_u64 *entries, const char *fmt, va_list args)
828 struct printbuf buf = PRINTBUF;
829 struct jset_entry_log *l;
833 prt_vprintf(&buf, fmt, args);
834 ret = buf.allocation_failure ? -BCH_ERR_ENOMEM_trans_log_msg : 0;
838 u64s = DIV_ROUND_UP(buf.pos, sizeof(u64));
840 ret = darray_make_room(entries, jset_u64s(u64s));
844 l = (void *) &darray_top(*entries);
845 l->entry.u64s = cpu_to_le16(u64s);
846 l->entry.btree_id = 0;
848 l->entry.type = BCH_JSET_ENTRY_log;
852 memcpy(l->d, buf.buf, buf.pos);
854 l->d[buf.pos++] = '\0';
856 entries->nr += jset_u64s(u64s);
864 __bch2_fs_log_msg(struct bch_fs *c, unsigned commit_flags, const char *fmt,
869 if (!test_bit(JOURNAL_STARTED, &c->journal.flags)) {
870 ret = __bch2_trans_log_msg(&c->journal.early_journal_entries, fmt, args);
872 ret = bch2_trans_do(c, NULL, NULL,
873 BCH_TRANS_COMMIT_lazy_rw|commit_flags,
874 __bch2_trans_log_msg(&trans->extra_journal_entries, fmt, args));
881 int bch2_fs_log_msg(struct bch_fs *c, const char *fmt, ...)
887 ret = __bch2_fs_log_msg(c, 0, fmt, args);
893 * Use for logging messages during recovery to enable reserved space and avoid
897 int bch2_journal_log_msg(struct bch_fs *c, const char *fmt, ...)
903 ret = __bch2_fs_log_msg(c, BCH_WATERMARK_reclaim, fmt, args);