1 // SPDX-License-Identifier: GPL-2.0
4 #include "alloc_foreground.h"
5 #include "bkey_methods.h"
6 #include "btree_cache.h"
8 #include "btree_update.h"
9 #include "btree_update_interior.h"
11 #include "btree_iter.h"
12 #include "btree_locking.h"
17 #include "journal_reclaim.h"
23 #include <linux/random.h>
24 #include <trace/events/bcachefs.h>
26 static int bch2_btree_insert_node(struct btree_update *, struct btree_trans *,
27 struct btree_path *, struct btree *,
28 struct keylist *, unsigned);
29 static void bch2_btree_update_add_new_node(struct btree_update *, struct btree *);
31 static struct btree_path *get_unlocked_mut_path(struct btree_trans *trans,
32 enum btree_id btree_id,
36 struct btree_path *path;
38 path = bch2_path_get(trans, btree_id, pos, level + 1, level,
39 BTREE_ITER_NOPRESERVE|
40 BTREE_ITER_INTENT, _RET_IP_);
41 path = bch2_btree_path_make_mut(trans, path, true, _RET_IP_);
42 bch2_btree_path_downgrade(trans, path);
43 __bch2_btree_path_unlock(trans, path);
50 * Verify that child nodes correctly span parent node's range:
52 static void btree_node_interior_verify(struct bch_fs *c, struct btree *b)
54 #ifdef CONFIG_BCACHEFS_DEBUG
55 struct bpos next_node = b->data->min_key;
56 struct btree_node_iter iter;
58 struct bkey_s_c_btree_ptr_v2 bp;
60 struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF;
64 if (!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags))
67 bch2_btree_node_iter_init_from_start(&iter, b);
70 k = bch2_btree_node_iter_peek_unpack(&iter, b, &unpacked);
71 if (k.k->type != KEY_TYPE_btree_ptr_v2)
73 bp = bkey_s_c_to_btree_ptr_v2(k);
75 if (!bpos_eq(next_node, bp.v->min_key)) {
76 bch2_dump_btree_node(c, b);
77 bch2_bpos_to_text(&buf1, next_node);
78 bch2_bpos_to_text(&buf2, bp.v->min_key);
79 panic("expected next min_key %s got %s\n", buf1.buf, buf2.buf);
82 bch2_btree_node_iter_advance(&iter, b);
84 if (bch2_btree_node_iter_end(&iter)) {
85 if (!bpos_eq(k.k->p, b->key.k.p)) {
86 bch2_dump_btree_node(c, b);
87 bch2_bpos_to_text(&buf1, b->key.k.p);
88 bch2_bpos_to_text(&buf2, k.k->p);
89 panic("expected end %s got %s\n", buf1.buf, buf2.buf);
94 next_node = bpos_successor(k.k->p);
99 /* Calculate ideal packed bkey format for new btree nodes: */
101 void __bch2_btree_calc_format(struct bkey_format_state *s, struct btree *b)
103 struct bkey_packed *k;
108 bset_tree_for_each_key(b, t, k)
109 if (!bkey_deleted(k)) {
110 uk = bkey_unpack_key(b, k);
111 bch2_bkey_format_add_key(s, &uk);
115 static struct bkey_format bch2_btree_calc_format(struct btree *b)
117 struct bkey_format_state s;
119 bch2_bkey_format_init(&s);
120 bch2_bkey_format_add_pos(&s, b->data->min_key);
121 bch2_bkey_format_add_pos(&s, b->data->max_key);
122 __bch2_btree_calc_format(&s, b);
124 return bch2_bkey_format_done(&s);
127 static size_t btree_node_u64s_with_format(struct btree *b,
128 struct bkey_format *new_f)
130 struct bkey_format *old_f = &b->format;
132 /* stupid integer promotion rules */
134 (((int) new_f->key_u64s - old_f->key_u64s) *
135 (int) b->nr.packed_keys) +
136 (((int) new_f->key_u64s - BKEY_U64s) *
137 (int) b->nr.unpacked_keys);
139 BUG_ON(delta + b->nr.live_u64s < 0);
141 return b->nr.live_u64s + delta;
145 * btree_node_format_fits - check if we could rewrite node with a new format
147 * This assumes all keys can pack with the new format -- it just checks if
148 * the re-packed keys would fit inside the node itself.
150 bool bch2_btree_node_format_fits(struct bch_fs *c, struct btree *b,
151 struct bkey_format *new_f)
153 size_t u64s = btree_node_u64s_with_format(b, new_f);
155 return __vstruct_bytes(struct btree_node, u64s) < btree_bytes(c);
158 /* Btree node freeing/allocation: */
160 static void __btree_node_free(struct bch_fs *c, struct btree *b)
162 trace_and_count(c, btree_node_free, c, b);
164 BUG_ON(btree_node_write_blocked(b));
165 BUG_ON(btree_node_dirty(b));
166 BUG_ON(btree_node_need_write(b));
167 BUG_ON(b == btree_node_root(c, b));
169 BUG_ON(!list_empty(&b->write_blocked));
170 BUG_ON(b->will_make_reachable);
172 clear_btree_node_noevict(b);
174 mutex_lock(&c->btree_cache.lock);
175 list_move(&b->list, &c->btree_cache.freeable);
176 mutex_unlock(&c->btree_cache.lock);
179 static void bch2_btree_node_free_inmem(struct btree_trans *trans,
180 struct btree_path *path,
183 struct bch_fs *c = trans->c;
184 unsigned level = b->c.level;
186 bch2_btree_node_lock_write_nofail(trans, path, &b->c);
187 bch2_btree_node_hash_remove(&c->btree_cache, b);
188 __btree_node_free(c, b);
189 six_unlock_write(&b->c.lock);
190 mark_btree_node_locked_noreset(path, level, SIX_LOCK_intent);
192 trans_for_each_path(trans, path)
193 if (path->l[level].b == b) {
194 btree_node_unlock(trans, path, level);
195 path->l[level].b = ERR_PTR(-BCH_ERR_no_btree_node_init);
199 static void bch2_btree_node_free_never_used(struct btree_update *as,
200 struct btree_trans *trans,
203 struct bch_fs *c = as->c;
204 struct prealloc_nodes *p = &as->prealloc_nodes[b->c.lock.readers != NULL];
205 struct btree_path *path;
206 unsigned level = b->c.level;
208 BUG_ON(!list_empty(&b->write_blocked));
209 BUG_ON(b->will_make_reachable != (1UL|(unsigned long) as));
211 b->will_make_reachable = 0;
212 closure_put(&as->cl);
214 clear_btree_node_will_make_reachable(b);
215 clear_btree_node_accessed(b);
216 clear_btree_node_dirty_acct(c, b);
217 clear_btree_node_need_write(b);
219 mutex_lock(&c->btree_cache.lock);
220 list_del_init(&b->list);
221 bch2_btree_node_hash_remove(&c->btree_cache, b);
222 mutex_unlock(&c->btree_cache.lock);
224 BUG_ON(p->nr >= ARRAY_SIZE(p->b));
227 six_unlock_intent(&b->c.lock);
229 trans_for_each_path(trans, path)
230 if (path->l[level].b == b) {
231 btree_node_unlock(trans, path, level);
232 path->l[level].b = ERR_PTR(-BCH_ERR_no_btree_node_init);
236 static struct btree *__bch2_btree_node_alloc(struct btree_trans *trans,
237 struct disk_reservation *res,
242 struct bch_fs *c = trans->c;
243 struct write_point *wp;
245 __BKEY_PADDED(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
246 struct open_buckets ob = { .nr = 0 };
247 struct bch_devs_list devs_have = (struct bch_devs_list) { 0 };
249 enum alloc_reserve alloc_reserve;
252 if (flags & BTREE_INSERT_USE_RESERVE) {
254 alloc_reserve = RESERVE_btree_movinggc;
256 nr_reserve = BTREE_NODE_RESERVE;
257 alloc_reserve = RESERVE_btree;
260 mutex_lock(&c->btree_reserve_cache_lock);
261 if (c->btree_reserve_cache_nr > nr_reserve) {
262 struct btree_alloc *a =
263 &c->btree_reserve_cache[--c->btree_reserve_cache_nr];
266 bkey_copy(&tmp.k, &a->k);
267 mutex_unlock(&c->btree_reserve_cache_lock);
270 mutex_unlock(&c->btree_reserve_cache_lock);
273 ret = bch2_alloc_sectors_start_trans(trans,
274 c->opts.metadata_target ?:
275 c->opts.foreground_target,
277 writepoint_ptr(&c->btree_write_point),
280 c->opts.metadata_replicas_required,
281 alloc_reserve, 0, cl, &wp);
285 if (wp->sectors_free < btree_sectors(c)) {
286 struct open_bucket *ob;
289 open_bucket_for_each(c, &wp->ptrs, ob, i)
290 if (ob->sectors_free < btree_sectors(c))
291 ob->sectors_free = 0;
293 bch2_alloc_sectors_done(c, wp);
297 bkey_btree_ptr_v2_init(&tmp.k);
298 bch2_alloc_sectors_append_ptrs(c, wp, &tmp.k, btree_sectors(c), false);
300 bch2_open_bucket_get(c, wp, &ob);
301 bch2_alloc_sectors_done(c, wp);
303 b = bch2_btree_node_mem_alloc(trans, interior_node);
304 six_unlock_write(&b->c.lock);
305 six_unlock_intent(&b->c.lock);
307 /* we hold cannibalize_lock: */
311 bkey_copy(&b->key, &tmp.k);
317 static struct btree *bch2_btree_node_alloc(struct btree_update *as,
318 struct btree_trans *trans,
321 struct bch_fs *c = as->c;
323 struct prealloc_nodes *p = &as->prealloc_nodes[!!level];
326 BUG_ON(level >= BTREE_MAX_DEPTH);
331 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_intent);
332 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_write);
334 set_btree_node_accessed(b);
335 set_btree_node_dirty_acct(c, b);
336 set_btree_node_need_write(b);
338 bch2_bset_init_first(b, &b->data->keys);
340 b->c.btree_id = as->btree_id;
341 b->version_ondisk = c->sb.version;
343 memset(&b->nr, 0, sizeof(b->nr));
344 b->data->magic = cpu_to_le64(bset_magic(c));
345 memset(&b->data->_ptr, 0, sizeof(b->data->_ptr));
347 SET_BTREE_NODE_ID(b->data, as->btree_id);
348 SET_BTREE_NODE_LEVEL(b->data, level);
350 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
351 struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(&b->key);
354 bp->v.seq = b->data->keys.seq;
355 bp->v.sectors_written = 0;
358 SET_BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data, true);
360 bch2_btree_build_aux_trees(b);
362 ret = bch2_btree_node_hash_insert(&c->btree_cache, b, level, as->btree_id);
365 trace_and_count(c, btree_node_alloc, c, b);
369 static void btree_set_min(struct btree *b, struct bpos pos)
371 if (b->key.k.type == KEY_TYPE_btree_ptr_v2)
372 bkey_i_to_btree_ptr_v2(&b->key)->v.min_key = pos;
373 b->data->min_key = pos;
376 static void btree_set_max(struct btree *b, struct bpos pos)
379 b->data->max_key = pos;
382 static struct btree *bch2_btree_node_alloc_replacement(struct btree_update *as,
383 struct btree_trans *trans,
386 struct btree *n = bch2_btree_node_alloc(as, trans, b->c.level);
387 struct bkey_format format = bch2_btree_calc_format(b);
390 * The keys might expand with the new format - if they wouldn't fit in
391 * the btree node anymore, use the old format for now:
393 if (!bch2_btree_node_format_fits(as->c, b, &format))
396 SET_BTREE_NODE_SEQ(n->data, BTREE_NODE_SEQ(b->data) + 1);
398 btree_set_min(n, b->data->min_key);
399 btree_set_max(n, b->data->max_key);
401 n->data->format = format;
402 btree_node_set_format(n, format);
404 bch2_btree_sort_into(as->c, n, b);
406 btree_node_reset_sib_u64s(n);
410 static struct btree *__btree_root_alloc(struct btree_update *as,
411 struct btree_trans *trans, unsigned level)
413 struct btree *b = bch2_btree_node_alloc(as, trans, level);
415 btree_set_min(b, POS_MIN);
416 btree_set_max(b, SPOS_MAX);
417 b->data->format = bch2_btree_calc_format(b);
419 btree_node_set_format(b, b->data->format);
420 bch2_btree_build_aux_trees(b);
425 static void bch2_btree_reserve_put(struct btree_update *as, struct btree_trans *trans)
427 struct bch_fs *c = as->c;
428 struct prealloc_nodes *p;
430 for (p = as->prealloc_nodes;
431 p < as->prealloc_nodes + ARRAY_SIZE(as->prealloc_nodes);
434 struct btree *b = p->b[--p->nr];
436 mutex_lock(&c->btree_reserve_cache_lock);
438 if (c->btree_reserve_cache_nr <
439 ARRAY_SIZE(c->btree_reserve_cache)) {
440 struct btree_alloc *a =
441 &c->btree_reserve_cache[c->btree_reserve_cache_nr++];
445 bkey_copy(&a->k, &b->key);
447 bch2_open_buckets_put(c, &b->ob);
450 mutex_unlock(&c->btree_reserve_cache_lock);
452 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_intent);
453 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_write);
454 __btree_node_free(c, b);
455 six_unlock_write(&b->c.lock);
456 six_unlock_intent(&b->c.lock);
461 static int bch2_btree_reserve_get(struct btree_trans *trans,
462 struct btree_update *as,
463 unsigned nr_nodes[2],
467 struct bch_fs *c = as->c;
472 BUG_ON(nr_nodes[0] + nr_nodes[1] > BTREE_RESERVE_MAX);
475 * Protects reaping from the btree node cache and using the btree node
476 * open bucket reserve:
478 * BTREE_INSERT_NOWAIT only applies to btree node allocation, not
479 * blocking on this lock:
481 ret = bch2_btree_cache_cannibalize_lock(c, cl);
485 for (interior = 0; interior < 2; interior++) {
486 struct prealloc_nodes *p = as->prealloc_nodes + interior;
488 while (p->nr < nr_nodes[interior]) {
489 b = __bch2_btree_node_alloc(trans, &as->disk_res,
490 flags & BTREE_INSERT_NOWAIT ? NULL : cl,
501 bch2_btree_cache_cannibalize_unlock(c);
505 /* Asynchronous interior node update machinery */
507 static void bch2_btree_update_free(struct btree_update *as, struct btree_trans *trans)
509 struct bch_fs *c = as->c;
511 if (as->took_gc_lock)
512 up_read(&c->gc_lock);
513 as->took_gc_lock = false;
515 bch2_journal_preres_put(&c->journal, &as->journal_preres);
517 bch2_journal_pin_drop(&c->journal, &as->journal);
518 bch2_journal_pin_flush(&c->journal, &as->journal);
519 bch2_disk_reservation_put(c, &as->disk_res);
520 bch2_btree_reserve_put(as, trans);
522 bch2_time_stats_update(&c->times[BCH_TIME_btree_interior_update_total],
525 mutex_lock(&c->btree_interior_update_lock);
526 list_del(&as->unwritten_list);
529 closure_debug_destroy(&as->cl);
530 mempool_free(as, &c->btree_interior_update_pool);
533 * Have to do the wakeup with btree_interior_update_lock still held,
534 * since being on btree_interior_update_list is our ref on @c:
536 closure_wake_up(&c->btree_interior_update_wait);
538 mutex_unlock(&c->btree_interior_update_lock);
541 static void btree_update_add_key(struct btree_update *as,
542 struct keylist *keys, struct btree *b)
544 struct bkey_i *k = &b->key;
546 BUG_ON(bch2_keylist_u64s(keys) + k->k.u64s >
547 ARRAY_SIZE(as->_old_keys));
549 bkey_copy(keys->top, k);
550 bkey_i_to_btree_ptr_v2(keys->top)->v.mem_ptr = b->c.level + 1;
552 bch2_keylist_push(keys);
556 * The transactional part of an interior btree node update, where we journal the
557 * update we did to the interior node and update alloc info:
559 static int btree_update_nodes_written_trans(struct btree_trans *trans,
560 struct btree_update *as)
565 ret = darray_make_room(&trans->extra_journal_entries, as->journal_u64s);
569 memcpy(&darray_top(trans->extra_journal_entries),
571 as->journal_u64s * sizeof(u64));
572 trans->extra_journal_entries.nr += as->journal_u64s;
574 trans->journal_pin = &as->journal;
576 for_each_keylist_key(&as->old_keys, k) {
577 unsigned level = bkey_i_to_btree_ptr_v2(k)->v.mem_ptr;
579 ret = bch2_trans_mark_old(trans, as->btree_id, level, bkey_i_to_s_c(k), 0);
584 for_each_keylist_key(&as->new_keys, k) {
585 unsigned level = bkey_i_to_btree_ptr_v2(k)->v.mem_ptr;
587 ret = bch2_trans_mark_new(trans, as->btree_id, level, k, 0);
595 static void btree_update_nodes_written(struct btree_update *as)
597 struct bch_fs *c = as->c;
599 struct btree_trans trans;
604 bch2_trans_init(&trans, c, 0, 512);
606 * If we're already in an error state, it might be because a btree node
607 * was never written, and we might be trying to free that same btree
608 * node here, but it won't have been marked as allocated and we'll see
609 * spurious disk usage inconsistencies in the transactional part below
610 * if we don't skip it:
612 ret = bch2_journal_error(&c->journal);
617 * Wait for any in flight writes to finish before we free the old nodes
620 for (i = 0; i < as->nr_old_nodes; i++) {
623 b = as->old_nodes[i];
625 btree_node_lock_nopath_nofail(&trans, &b->c, SIX_LOCK_read);
626 seq = b->data ? b->data->keys.seq : 0;
627 six_unlock_read(&b->c.lock);
629 if (seq == as->old_nodes_seq[i])
630 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight_inner,
631 TASK_UNINTERRUPTIBLE);
635 * We did an update to a parent node where the pointers we added pointed
636 * to child nodes that weren't written yet: now, the child nodes have
637 * been written so we can write out the update to the interior node.
641 * We can't call into journal reclaim here: we'd block on the journal
642 * reclaim lock, but we may need to release the open buckets we have
643 * pinned in order for other btree updates to make forward progress, and
644 * journal reclaim does btree updates when flushing bkey_cached entries,
645 * which may require allocations as well.
647 ret = commit_do(&trans, &as->disk_res, &journal_seq,
649 BTREE_INSERT_NOCHECK_RW|
650 BTREE_INSERT_USE_RESERVE|
651 BTREE_INSERT_JOURNAL_RECLAIM|
652 JOURNAL_WATERMARK_reserved,
653 btree_update_nodes_written_trans(&trans, as));
654 bch2_trans_unlock(&trans);
656 bch2_fs_fatal_err_on(ret && !bch2_journal_error(&c->journal), c,
657 "%s(): error %s", __func__, bch2_err_str(ret));
660 struct btree_path *path;
663 path = get_unlocked_mut_path(&trans, as->btree_id, b->c.level, b->key.k.p);
665 * @b is the node we did the final insert into:
667 * On failure to get a journal reservation, we still have to
668 * unblock the write and allow most of the write path to happen
669 * so that shutdown works, but the i->journal_seq mechanism
670 * won't work to prevent the btree write from being visible (we
671 * didn't get a journal sequence number) - instead
672 * __bch2_btree_node_write() doesn't do the actual write if
673 * we're in journal error state:
677 * Ensure transaction is unlocked before using
678 * btree_node_lock_nopath() (the use of which is always suspect,
679 * we need to work on removing this in the future)
681 * It should be, but get_unlocked_mut_path() -> bch2_path_get()
682 * calls bch2_path_upgrade(), before we call path_make_mut(), so
683 * we may rarely end up with a locked path besides the one we
686 bch2_trans_unlock(&trans);
687 btree_node_lock_nopath_nofail(&trans, &b->c, SIX_LOCK_intent);
688 mark_btree_node_locked(&trans, path, b->c.level, SIX_LOCK_intent);
689 bch2_btree_path_level_init(&trans, path, b);
691 bch2_btree_node_lock_write_nofail(&trans, path, &b->c);
693 mutex_lock(&c->btree_interior_update_lock);
695 list_del(&as->write_blocked_list);
696 if (list_empty(&b->write_blocked))
697 clear_btree_node_write_blocked(b);
700 * Node might have been freed, recheck under
701 * btree_interior_update_lock:
704 struct bset *i = btree_bset_last(b);
707 BUG_ON(!btree_node_dirty(b));
710 i->journal_seq = cpu_to_le64(
712 le64_to_cpu(i->journal_seq)));
714 bch2_btree_add_journal_pin(c, b, journal_seq);
717 * If we didn't get a journal sequence number we
718 * can't write this btree node, because recovery
719 * won't know to ignore this write:
721 set_btree_node_never_write(b);
725 mutex_unlock(&c->btree_interior_update_lock);
727 mark_btree_node_locked_noreset(path, b->c.level, SIX_LOCK_intent);
728 six_unlock_write(&b->c.lock);
730 btree_node_write_if_need(c, b, SIX_LOCK_intent);
731 btree_node_unlock(&trans, path, b->c.level);
732 bch2_path_put(&trans, path, true);
735 bch2_journal_pin_drop(&c->journal, &as->journal);
737 bch2_journal_preres_put(&c->journal, &as->journal_preres);
739 mutex_lock(&c->btree_interior_update_lock);
740 for (i = 0; i < as->nr_new_nodes; i++) {
741 b = as->new_nodes[i];
743 BUG_ON(b->will_make_reachable != (unsigned long) as);
744 b->will_make_reachable = 0;
745 clear_btree_node_will_make_reachable(b);
747 mutex_unlock(&c->btree_interior_update_lock);
749 for (i = 0; i < as->nr_new_nodes; i++) {
750 b = as->new_nodes[i];
752 btree_node_lock_nopath_nofail(&trans, &b->c, SIX_LOCK_read);
753 btree_node_write_if_need(c, b, SIX_LOCK_read);
754 six_unlock_read(&b->c.lock);
757 for (i = 0; i < as->nr_open_buckets; i++)
758 bch2_open_bucket_put(c, c->open_buckets + as->open_buckets[i]);
760 bch2_btree_update_free(as, &trans);
761 bch2_trans_exit(&trans);
764 static void btree_interior_update_work(struct work_struct *work)
767 container_of(work, struct bch_fs, btree_interior_update_work);
768 struct btree_update *as;
771 mutex_lock(&c->btree_interior_update_lock);
772 as = list_first_entry_or_null(&c->btree_interior_updates_unwritten,
773 struct btree_update, unwritten_list);
774 if (as && !as->nodes_written)
776 mutex_unlock(&c->btree_interior_update_lock);
781 btree_update_nodes_written(as);
785 static void btree_update_set_nodes_written(struct closure *cl)
787 struct btree_update *as = container_of(cl, struct btree_update, cl);
788 struct bch_fs *c = as->c;
790 mutex_lock(&c->btree_interior_update_lock);
791 as->nodes_written = true;
792 mutex_unlock(&c->btree_interior_update_lock);
794 queue_work(c->btree_interior_update_worker, &c->btree_interior_update_work);
798 * We're updating @b with pointers to nodes that haven't finished writing yet:
799 * block @b from being written until @as completes
801 static void btree_update_updated_node(struct btree_update *as, struct btree *b)
803 struct bch_fs *c = as->c;
805 mutex_lock(&c->btree_interior_update_lock);
806 list_add_tail(&as->unwritten_list, &c->btree_interior_updates_unwritten);
808 BUG_ON(as->mode != BTREE_INTERIOR_NO_UPDATE);
809 BUG_ON(!btree_node_dirty(b));
812 as->mode = BTREE_INTERIOR_UPDATING_NODE;
815 set_btree_node_write_blocked(b);
816 list_add(&as->write_blocked_list, &b->write_blocked);
818 mutex_unlock(&c->btree_interior_update_lock);
821 static void btree_update_reparent(struct btree_update *as,
822 struct btree_update *child)
824 struct bch_fs *c = as->c;
826 lockdep_assert_held(&c->btree_interior_update_lock);
829 child->mode = BTREE_INTERIOR_UPDATING_AS;
831 bch2_journal_pin_copy(&c->journal, &as->journal, &child->journal, NULL);
834 static void btree_update_updated_root(struct btree_update *as, struct btree *b)
836 struct bkey_i *insert = &b->key;
837 struct bch_fs *c = as->c;
839 BUG_ON(as->mode != BTREE_INTERIOR_NO_UPDATE);
841 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
842 ARRAY_SIZE(as->journal_entries));
845 journal_entry_set((void *) &as->journal_entries[as->journal_u64s],
846 BCH_JSET_ENTRY_btree_root,
847 b->c.btree_id, b->c.level,
848 insert, insert->k.u64s);
850 mutex_lock(&c->btree_interior_update_lock);
851 list_add_tail(&as->unwritten_list, &c->btree_interior_updates_unwritten);
853 as->mode = BTREE_INTERIOR_UPDATING_ROOT;
854 mutex_unlock(&c->btree_interior_update_lock);
858 * bch2_btree_update_add_new_node:
860 * This causes @as to wait on @b to be written, before it gets to
861 * bch2_btree_update_nodes_written
863 * Additionally, it sets b->will_make_reachable to prevent any additional writes
864 * to @b from happening besides the first until @b is reachable on disk
866 * And it adds @b to the list of @as's new nodes, so that we can update sector
867 * counts in bch2_btree_update_nodes_written:
869 static void bch2_btree_update_add_new_node(struct btree_update *as, struct btree *b)
871 struct bch_fs *c = as->c;
873 closure_get(&as->cl);
875 mutex_lock(&c->btree_interior_update_lock);
876 BUG_ON(as->nr_new_nodes >= ARRAY_SIZE(as->new_nodes));
877 BUG_ON(b->will_make_reachable);
879 as->new_nodes[as->nr_new_nodes++] = b;
880 b->will_make_reachable = 1UL|(unsigned long) as;
881 set_btree_node_will_make_reachable(b);
883 mutex_unlock(&c->btree_interior_update_lock);
885 btree_update_add_key(as, &as->new_keys, b);
887 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
888 unsigned bytes = vstruct_end(&b->data->keys) - (void *) b->data;
889 unsigned sectors = round_up(bytes, block_bytes(c)) >> 9;
891 bkey_i_to_btree_ptr_v2(&b->key)->v.sectors_written =
892 cpu_to_le16(sectors);
897 * returns true if @b was a new node
899 static void btree_update_drop_new_node(struct bch_fs *c, struct btree *b)
901 struct btree_update *as;
905 mutex_lock(&c->btree_interior_update_lock);
907 * When b->will_make_reachable != 0, it owns a ref on as->cl that's
908 * dropped when it gets written by bch2_btree_complete_write - the
909 * xchg() is for synchronization with bch2_btree_complete_write:
911 v = xchg(&b->will_make_reachable, 0);
912 clear_btree_node_will_make_reachable(b);
913 as = (struct btree_update *) (v & ~1UL);
916 mutex_unlock(&c->btree_interior_update_lock);
920 for (i = 0; i < as->nr_new_nodes; i++)
921 if (as->new_nodes[i] == b)
926 array_remove_item(as->new_nodes, as->nr_new_nodes, i);
927 mutex_unlock(&c->btree_interior_update_lock);
930 closure_put(&as->cl);
933 static void bch2_btree_update_get_open_buckets(struct btree_update *as, struct btree *b)
936 as->open_buckets[as->nr_open_buckets++] =
941 * @b is being split/rewritten: it may have pointers to not-yet-written btree
942 * nodes and thus outstanding btree_updates - redirect @b's
943 * btree_updates to point to this btree_update:
945 static void bch2_btree_interior_update_will_free_node(struct btree_update *as,
948 struct bch_fs *c = as->c;
949 struct btree_update *p, *n;
950 struct btree_write *w;
952 set_btree_node_dying(b);
954 if (btree_node_fake(b))
957 mutex_lock(&c->btree_interior_update_lock);
960 * Does this node have any btree_update operations preventing
961 * it from being written?
963 * If so, redirect them to point to this btree_update: we can
964 * write out our new nodes, but we won't make them visible until those
965 * operations complete
967 list_for_each_entry_safe(p, n, &b->write_blocked, write_blocked_list) {
968 list_del_init(&p->write_blocked_list);
969 btree_update_reparent(as, p);
972 * for flush_held_btree_writes() waiting on updates to flush or
973 * nodes to be writeable:
975 closure_wake_up(&c->btree_interior_update_wait);
978 clear_btree_node_dirty_acct(c, b);
979 clear_btree_node_need_write(b);
980 clear_btree_node_write_blocked(b);
983 * Does this node have unwritten data that has a pin on the journal?
985 * If so, transfer that pin to the btree_update operation -
986 * note that if we're freeing multiple nodes, we only need to keep the
987 * oldest pin of any of the nodes we're freeing. We'll release the pin
988 * when the new nodes are persistent and reachable on disk:
990 w = btree_current_write(b);
991 bch2_journal_pin_copy(&c->journal, &as->journal, &w->journal, NULL);
992 bch2_journal_pin_drop(&c->journal, &w->journal);
994 w = btree_prev_write(b);
995 bch2_journal_pin_copy(&c->journal, &as->journal, &w->journal, NULL);
996 bch2_journal_pin_drop(&c->journal, &w->journal);
998 mutex_unlock(&c->btree_interior_update_lock);
1001 * Is this a node that isn't reachable on disk yet?
1003 * Nodes that aren't reachable yet have writes blocked until they're
1004 * reachable - now that we've cancelled any pending writes and moved
1005 * things waiting on that write to wait on this update, we can drop this
1006 * node from the list of nodes that the other update is making
1007 * reachable, prior to freeing it:
1009 btree_update_drop_new_node(c, b);
1011 btree_update_add_key(as, &as->old_keys, b);
1013 as->old_nodes[as->nr_old_nodes] = b;
1014 as->old_nodes_seq[as->nr_old_nodes] = b->data->keys.seq;
1018 static void bch2_btree_update_done(struct btree_update *as, struct btree_trans *trans)
1020 struct bch_fs *c = as->c;
1021 u64 start_time = as->start_time;
1023 BUG_ON(as->mode == BTREE_INTERIOR_NO_UPDATE);
1025 if (as->took_gc_lock)
1026 up_read(&as->c->gc_lock);
1027 as->took_gc_lock = false;
1029 bch2_btree_reserve_put(as, trans);
1031 continue_at(&as->cl, btree_update_set_nodes_written,
1032 as->c->btree_interior_update_worker);
1034 bch2_time_stats_update(&c->times[BCH_TIME_btree_interior_update_foreground],
1038 static struct btree_update *
1039 bch2_btree_update_start(struct btree_trans *trans, struct btree_path *path,
1040 unsigned level, bool split, unsigned flags)
1042 struct bch_fs *c = trans->c;
1043 struct btree_update *as;
1044 u64 start_time = local_clock();
1045 int disk_res_flags = (flags & BTREE_INSERT_NOFAIL)
1046 ? BCH_DISK_RESERVATION_NOFAIL : 0;
1047 unsigned nr_nodes[2] = { 0, 0 };
1048 unsigned update_level = level;
1049 int journal_flags = flags & JOURNAL_WATERMARK_MASK;
1051 u32 restart_count = trans->restart_count;
1053 BUG_ON(!path->should_be_locked);
1055 if (flags & BTREE_INSERT_JOURNAL_RECLAIM)
1056 journal_flags |= JOURNAL_RES_GET_NONBLOCK;
1059 nr_nodes[!!update_level] += 1 + split;
1062 ret = bch2_btree_path_upgrade(trans, path, update_level + 1);
1064 return ERR_PTR(ret);
1066 if (!btree_path_node(path, update_level)) {
1067 /* Allocating new root? */
1068 nr_nodes[1] += split;
1069 update_level = BTREE_MAX_DEPTH;
1073 if (bch2_btree_node_insert_fits(c, path->l[update_level].b,
1074 BKEY_BTREE_PTR_U64s_MAX * (1 + split)))
1080 if (flags & BTREE_INSERT_GC_LOCK_HELD)
1081 lockdep_assert_held(&c->gc_lock);
1082 else if (!down_read_trylock(&c->gc_lock)) {
1083 bch2_trans_unlock(trans);
1084 down_read(&c->gc_lock);
1085 ret = bch2_trans_relock(trans);
1087 up_read(&c->gc_lock);
1088 return ERR_PTR(ret);
1092 as = mempool_alloc(&c->btree_interior_update_pool, GFP_NOIO);
1093 memset(as, 0, sizeof(*as));
1094 closure_init(&as->cl, NULL);
1096 as->start_time = start_time;
1097 as->mode = BTREE_INTERIOR_NO_UPDATE;
1098 as->took_gc_lock = !(flags & BTREE_INSERT_GC_LOCK_HELD);
1099 as->btree_id = path->btree_id;
1100 as->update_level = update_level;
1101 INIT_LIST_HEAD(&as->list);
1102 INIT_LIST_HEAD(&as->unwritten_list);
1103 INIT_LIST_HEAD(&as->write_blocked_list);
1104 bch2_keylist_init(&as->old_keys, as->_old_keys);
1105 bch2_keylist_init(&as->new_keys, as->_new_keys);
1106 bch2_keylist_init(&as->parent_keys, as->inline_keys);
1108 mutex_lock(&c->btree_interior_update_lock);
1109 list_add_tail(&as->list, &c->btree_interior_update_list);
1110 mutex_unlock(&c->btree_interior_update_lock);
1113 * We don't want to allocate if we're in an error state, that can cause
1114 * deadlock on emergency shutdown due to open buckets getting stuck in
1115 * the btree_reserve_cache after allocator shutdown has cleared it out.
1116 * This check needs to come after adding us to the btree_interior_update
1117 * list but before calling bch2_btree_reserve_get, to synchronize with
1118 * __bch2_fs_read_only().
1120 ret = bch2_journal_error(&c->journal);
1124 ret = bch2_journal_preres_get(&c->journal, &as->journal_preres,
1125 BTREE_UPDATE_JOURNAL_RES,
1126 journal_flags|JOURNAL_RES_GET_NONBLOCK);
1128 bch2_trans_unlock(trans);
1130 if (flags & BTREE_INSERT_JOURNAL_RECLAIM) {
1131 ret = -BCH_ERR_journal_reclaim_would_deadlock;
1135 ret = bch2_journal_preres_get(&c->journal, &as->journal_preres,
1136 BTREE_UPDATE_JOURNAL_RES,
1139 trace_and_count(c, trans_restart_journal_preres_get, trans, _RET_IP_, journal_flags);
1140 ret = btree_trans_restart(trans, BCH_ERR_transaction_restart_journal_preres_get);
1144 ret = bch2_trans_relock(trans);
1149 ret = bch2_disk_reservation_get(c, &as->disk_res,
1150 (nr_nodes[0] + nr_nodes[1]) * btree_sectors(c),
1151 c->opts.metadata_replicas,
1156 ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, NULL);
1157 if (bch2_err_matches(ret, ENOSPC) ||
1158 bch2_err_matches(ret, ENOMEM)) {
1161 closure_init_stack(&cl);
1164 ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, &cl);
1166 bch2_trans_unlock(trans);
1168 } while (bch2_err_matches(ret, BCH_ERR_operation_blocked));
1172 trace_and_count(c, btree_reserve_get_fail, trans->fn,
1173 _RET_IP_, nr_nodes[0] + nr_nodes[1], ret);
1177 ret = bch2_trans_relock(trans);
1181 bch2_trans_verify_not_restarted(trans, restart_count);
1184 bch2_btree_update_free(as, trans);
1185 return ERR_PTR(ret);
1188 /* Btree root updates: */
1190 static void bch2_btree_set_root_inmem(struct bch_fs *c, struct btree *b)
1192 /* Root nodes cannot be reaped */
1193 mutex_lock(&c->btree_cache.lock);
1194 list_del_init(&b->list);
1195 mutex_unlock(&c->btree_cache.lock);
1197 mutex_lock(&c->btree_root_lock);
1198 BUG_ON(btree_node_root(c, b) &&
1199 (b->c.level < btree_node_root(c, b)->c.level ||
1200 !btree_node_dying(btree_node_root(c, b))));
1202 btree_node_root(c, b) = b;
1203 mutex_unlock(&c->btree_root_lock);
1205 bch2_recalc_btree_reserve(c);
1209 * bch_btree_set_root - update the root in memory and on disk
1211 * To ensure forward progress, the current task must not be holding any
1212 * btree node write locks. However, you must hold an intent lock on the
1215 * Note: This allocates a journal entry but doesn't add any keys to
1216 * it. All the btree roots are part of every journal write, so there
1217 * is nothing new to be done. This just guarantees that there is a
1220 static void bch2_btree_set_root(struct btree_update *as,
1221 struct btree_trans *trans,
1222 struct btree_path *path,
1225 struct bch_fs *c = as->c;
1228 trace_and_count(c, btree_node_set_root, c, b);
1230 old = btree_node_root(c, b);
1233 * Ensure no one is using the old root while we switch to the
1236 bch2_btree_node_lock_write_nofail(trans, path, &old->c);
1238 bch2_btree_set_root_inmem(c, b);
1240 btree_update_updated_root(as, b);
1243 * Unlock old root after new root is visible:
1245 * The new root isn't persistent, but that's ok: we still have
1246 * an intent lock on the new root, and any updates that would
1247 * depend on the new root would have to update the new root.
1249 bch2_btree_node_unlock_write(trans, path, old);
1252 /* Interior node updates: */
1254 static void bch2_insert_fixup_btree_ptr(struct btree_update *as,
1255 struct btree_trans *trans,
1256 struct btree_path *path,
1258 struct btree_node_iter *node_iter,
1259 struct bkey_i *insert)
1261 struct bch_fs *c = as->c;
1262 struct bkey_packed *k;
1263 struct printbuf buf = PRINTBUF;
1264 unsigned long old, new, v;
1266 BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 &&
1267 !btree_ptr_sectors_written(insert));
1269 if (unlikely(!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags)))
1270 bch2_journal_key_overwritten(c, b->c.btree_id, b->c.level, insert->k.p);
1272 if (bch2_bkey_invalid(c, bkey_i_to_s_c(insert),
1273 btree_node_type(b), WRITE, &buf) ?:
1274 bch2_bkey_in_btree_node(b, bkey_i_to_s_c(insert), &buf)) {
1275 printbuf_reset(&buf);
1276 prt_printf(&buf, "inserting invalid bkey\n ");
1277 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert));
1278 prt_printf(&buf, "\n ");
1279 bch2_bkey_invalid(c, bkey_i_to_s_c(insert),
1280 btree_node_type(b), WRITE, &buf);
1281 bch2_bkey_in_btree_node(b, bkey_i_to_s_c(insert), &buf);
1283 bch2_fs_inconsistent(c, "%s", buf.buf);
1287 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) >
1288 ARRAY_SIZE(as->journal_entries));
1291 journal_entry_set((void *) &as->journal_entries[as->journal_u64s],
1292 BCH_JSET_ENTRY_btree_keys,
1293 b->c.btree_id, b->c.level,
1294 insert, insert->k.u64s);
1296 while ((k = bch2_btree_node_iter_peek_all(node_iter, b)) &&
1297 bkey_iter_pos_cmp(b, k, &insert->k.p) < 0)
1298 bch2_btree_node_iter_advance(node_iter, b);
1300 bch2_btree_bset_insert_key(trans, path, b, node_iter, insert);
1301 set_btree_node_dirty_acct(c, b);
1303 v = READ_ONCE(b->flags);
1307 new &= ~BTREE_WRITE_TYPE_MASK;
1308 new |= BTREE_WRITE_interior;
1309 new |= 1 << BTREE_NODE_need_write;
1310 } while ((v = cmpxchg(&b->flags, old, new)) != old);
1312 printbuf_exit(&buf);
1316 __bch2_btree_insert_keys_interior(struct btree_update *as,
1317 struct btree_trans *trans,
1318 struct btree_path *path,
1320 struct btree_node_iter node_iter,
1321 struct keylist *keys)
1323 struct bkey_i *insert = bch2_keylist_front(keys);
1324 struct bkey_packed *k;
1326 BUG_ON(btree_node_type(b) != BKEY_TYPE_btree);
1328 while ((k = bch2_btree_node_iter_prev_all(&node_iter, b)) &&
1329 (bkey_cmp_left_packed(b, k, &insert->k.p) >= 0))
1332 while (!bch2_keylist_empty(keys)) {
1333 struct bkey_i *k = bch2_keylist_front(keys);
1335 if (bpos_gt(k->k.p, b->key.k.p))
1338 bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, k);
1339 bch2_keylist_pop_front(keys);
1344 * Move keys from n1 (original replacement node, now lower node) to n2 (higher
1347 static void __btree_split_node(struct btree_update *as,
1348 struct btree_trans *trans,
1352 struct bkey_packed *k;
1353 struct bpos n1_pos = POS_MIN;
1354 struct btree_node_iter iter;
1355 struct bset *bsets[2];
1356 struct bkey_format_state format[2];
1357 struct bkey_packed *out[2];
1359 unsigned u64s, n1_u64s = (b->nr.live_u64s * 3) / 5;
1362 for (i = 0; i < 2; i++) {
1363 BUG_ON(n[i]->nsets != 1);
1365 bsets[i] = btree_bset_first(n[i]);
1366 out[i] = bsets[i]->start;
1368 SET_BTREE_NODE_SEQ(n[i]->data, BTREE_NODE_SEQ(b->data) + 1);
1369 bch2_bkey_format_init(&format[i]);
1373 for_each_btree_node_key(b, k, &iter) {
1374 if (bkey_deleted(k))
1377 i = u64s >= n1_u64s;
1379 uk = bkey_unpack_key(b, k);
1382 bch2_bkey_format_add_key(&format[i], &uk);
1385 btree_set_min(n[0], b->data->min_key);
1386 btree_set_max(n[0], n1_pos);
1387 btree_set_min(n[1], bpos_successor(n1_pos));
1388 btree_set_max(n[1], b->data->max_key);
1390 for (i = 0; i < 2; i++) {
1391 bch2_bkey_format_add_pos(&format[i], n[i]->data->min_key);
1392 bch2_bkey_format_add_pos(&format[i], n[i]->data->max_key);
1394 n[i]->data->format = bch2_bkey_format_done(&format[i]);
1395 btree_node_set_format(n[i], n[i]->data->format);
1399 for_each_btree_node_key(b, k, &iter) {
1400 if (bkey_deleted(k))
1403 i = u64s >= n1_u64s;
1406 if (bch2_bkey_transform(&n[i]->format, out[i], bkey_packed(k)
1407 ? &b->format: &bch2_bkey_format_current, k))
1408 out[i]->format = KEY_FORMAT_LOCAL_BTREE;
1410 bch2_bkey_unpack(b, (void *) out[i], k);
1412 out[i]->needs_whiteout = false;
1414 btree_keys_account_key_add(&n[i]->nr, 0, out[i]);
1415 out[i] = bkey_next(out[i]);
1418 for (i = 0; i < 2; i++) {
1419 bsets[i]->u64s = cpu_to_le16((u64 *) out[i] - bsets[i]->_data);
1421 BUG_ON(!bsets[i]->u64s);
1423 set_btree_bset_end(n[i], n[i]->set);
1425 btree_node_reset_sib_u64s(n[i]);
1427 bch2_verify_btree_nr_keys(n[i]);
1430 btree_node_interior_verify(as->c, n[i]);
1435 * For updates to interior nodes, we've got to do the insert before we split
1436 * because the stuff we're inserting has to be inserted atomically. Post split,
1437 * the keys might have to go in different nodes and the split would no longer be
1440 * Worse, if the insert is from btree node coalescing, if we do the insert after
1441 * we do the split (and pick the pivot) - the pivot we pick might be between
1442 * nodes that were coalesced, and thus in the middle of a child node post
1445 static void btree_split_insert_keys(struct btree_update *as,
1446 struct btree_trans *trans,
1447 struct btree_path *path,
1449 struct keylist *keys)
1451 if (!bch2_keylist_empty(keys) &&
1452 bpos_le(bch2_keylist_front(keys)->k.p, b->data->max_key)) {
1453 struct btree_node_iter node_iter;
1455 bch2_btree_node_iter_init(&node_iter, b, &bch2_keylist_front(keys)->k.p);
1457 __bch2_btree_insert_keys_interior(as, trans, path, b, node_iter, keys);
1459 btree_node_interior_verify(as->c, b);
1463 static int btree_split(struct btree_update *as, struct btree_trans *trans,
1464 struct btree_path *path, struct btree *b,
1465 struct keylist *keys, unsigned flags)
1467 struct bch_fs *c = as->c;
1468 struct btree *parent = btree_node_parent(path, b);
1469 struct btree *n1, *n2 = NULL, *n3 = NULL;
1470 struct btree_path *path1 = NULL, *path2 = NULL;
1471 u64 start_time = local_clock();
1474 BUG_ON(!parent && (b != btree_node_root(c, b)));
1475 BUG_ON(parent && !btree_node_intent_locked(path, b->c.level + 1));
1477 bch2_btree_interior_update_will_free_node(as, b);
1479 if (b->nr.live_u64s > BTREE_SPLIT_THRESHOLD(c)) {
1482 trace_and_count(c, btree_node_split, c, b);
1484 n[0] = n1 = bch2_btree_node_alloc(as, trans, b->c.level);
1485 n[1] = n2 = bch2_btree_node_alloc(as, trans, b->c.level);
1487 __btree_split_node(as, trans, b, n);
1490 btree_split_insert_keys(as, trans, path, n1, keys);
1491 btree_split_insert_keys(as, trans, path, n2, keys);
1492 BUG_ON(!bch2_keylist_empty(keys));
1495 bch2_btree_build_aux_trees(n2);
1496 bch2_btree_build_aux_trees(n1);
1498 bch2_btree_update_add_new_node(as, n1);
1499 bch2_btree_update_add_new_node(as, n2);
1500 six_unlock_write(&n2->c.lock);
1501 six_unlock_write(&n1->c.lock);
1503 path1 = get_unlocked_mut_path(trans, path->btree_id, n1->c.level, n1->key.k.p);
1504 six_lock_increment(&n1->c.lock, SIX_LOCK_intent);
1505 mark_btree_node_locked(trans, path1, n1->c.level, SIX_LOCK_intent);
1506 bch2_btree_path_level_init(trans, path1, n1);
1508 path2 = get_unlocked_mut_path(trans, path->btree_id, n2->c.level, n2->key.k.p);
1509 six_lock_increment(&n2->c.lock, SIX_LOCK_intent);
1510 mark_btree_node_locked(trans, path2, n2->c.level, SIX_LOCK_intent);
1511 bch2_btree_path_level_init(trans, path2, n2);
1514 * Note that on recursive parent_keys == keys, so we
1515 * can't start adding new keys to parent_keys before emptying it
1516 * out (which we did with btree_split_insert_keys() above)
1518 bch2_keylist_add(&as->parent_keys, &n1->key);
1519 bch2_keylist_add(&as->parent_keys, &n2->key);
1522 /* Depth increases, make a new root */
1523 n3 = __btree_root_alloc(as, trans, b->c.level + 1);
1525 bch2_btree_update_add_new_node(as, n3);
1526 six_unlock_write(&n3->c.lock);
1528 path2->locks_want++;
1529 BUG_ON(btree_node_locked(path2, n3->c.level));
1530 six_lock_increment(&n3->c.lock, SIX_LOCK_intent);
1531 mark_btree_node_locked(trans, path2, n3->c.level, SIX_LOCK_intent);
1532 bch2_btree_path_level_init(trans, path2, n3);
1534 n3->sib_u64s[0] = U16_MAX;
1535 n3->sib_u64s[1] = U16_MAX;
1537 btree_split_insert_keys(as, trans, path, n3, &as->parent_keys);
1540 trace_and_count(c, btree_node_compact, c, b);
1542 n1 = bch2_btree_node_alloc_replacement(as, trans, b);
1545 btree_split_insert_keys(as, trans, path, n1, keys);
1546 BUG_ON(!bch2_keylist_empty(keys));
1549 bch2_btree_build_aux_trees(n1);
1550 bch2_btree_update_add_new_node(as, n1);
1551 six_unlock_write(&n1->c.lock);
1553 path1 = get_unlocked_mut_path(trans, path->btree_id, n1->c.level, n1->key.k.p);
1554 six_lock_increment(&n1->c.lock, SIX_LOCK_intent);
1555 mark_btree_node_locked(trans, path1, n1->c.level, SIX_LOCK_intent);
1556 bch2_btree_path_level_init(trans, path1, n1);
1559 bch2_keylist_add(&as->parent_keys, &n1->key);
1562 /* New nodes all written, now make them visible: */
1565 /* Split a non root node */
1566 ret = bch2_btree_insert_node(as, trans, path, parent, &as->parent_keys, flags);
1570 bch2_btree_set_root(as, trans, path, n3);
1572 /* Root filled up but didn't need to be split */
1573 bch2_btree_set_root(as, trans, path, n1);
1577 bch2_btree_update_get_open_buckets(as, n3);
1578 bch2_btree_node_write(c, n3, SIX_LOCK_intent, 0);
1581 bch2_btree_update_get_open_buckets(as, n2);
1582 bch2_btree_node_write(c, n2, SIX_LOCK_intent, 0);
1584 bch2_btree_update_get_open_buckets(as, n1);
1585 bch2_btree_node_write(c, n1, SIX_LOCK_intent, 0);
1588 * The old node must be freed (in memory) _before_ unlocking the new
1589 * nodes - else another thread could re-acquire a read lock on the old
1590 * node after another thread has locked and updated the new node, thus
1591 * seeing stale data:
1593 bch2_btree_node_free_inmem(trans, path, b);
1596 bch2_trans_node_add(trans, n3);
1598 bch2_trans_node_add(trans, n2);
1599 bch2_trans_node_add(trans, n1);
1602 six_unlock_intent(&n3->c.lock);
1604 six_unlock_intent(&n2->c.lock);
1605 six_unlock_intent(&n1->c.lock);
1608 __bch2_btree_path_unlock(trans, path2);
1609 bch2_path_put(trans, path2, true);
1612 __bch2_btree_path_unlock(trans, path1);
1613 bch2_path_put(trans, path1, true);
1616 bch2_trans_verify_locks(trans);
1618 bch2_time_stats_update(&c->times[n2
1619 ? BCH_TIME_btree_node_split
1620 : BCH_TIME_btree_node_compact],
1625 bch2_btree_node_free_never_used(as, trans, n3);
1627 bch2_btree_node_free_never_used(as, trans, n2);
1628 bch2_btree_node_free_never_used(as, trans, n1);
1633 bch2_btree_insert_keys_interior(struct btree_update *as,
1634 struct btree_trans *trans,
1635 struct btree_path *path,
1637 struct keylist *keys)
1639 struct btree_path *linked;
1641 __bch2_btree_insert_keys_interior(as, trans, path, b,
1642 path->l[b->c.level].iter, keys);
1644 btree_update_updated_node(as, b);
1646 trans_for_each_path_with_node(trans, b, linked)
1647 bch2_btree_node_iter_peek(&linked->l[b->c.level].iter, b);
1649 bch2_trans_verify_paths(trans);
1653 * bch_btree_insert_node - insert bkeys into a given btree node
1655 * @iter: btree iterator
1656 * @keys: list of keys to insert
1657 * @hook: insert callback
1658 * @persistent: if not null, @persistent will wait on journal write
1660 * Inserts as many keys as it can into a given btree node, splitting it if full.
1661 * If a split occurred, this function will return early. This can only happen
1662 * for leaf nodes -- inserts into interior nodes have to be atomic.
1664 static int bch2_btree_insert_node(struct btree_update *as, struct btree_trans *trans,
1665 struct btree_path *path, struct btree *b,
1666 struct keylist *keys, unsigned flags)
1668 struct bch_fs *c = as->c;
1669 int old_u64s = le16_to_cpu(btree_bset_last(b)->u64s);
1670 int old_live_u64s = b->nr.live_u64s;
1671 int live_u64s_added, u64s_added;
1674 lockdep_assert_held(&c->gc_lock);
1675 BUG_ON(!btree_node_intent_locked(path, b->c.level));
1676 BUG_ON(!b->c.level);
1677 BUG_ON(!as || as->b);
1678 bch2_verify_keylist_sorted(keys);
1680 if (!(local_clock() & 63))
1681 return btree_trans_restart(trans, BCH_ERR_transaction_restart_split_race);
1683 ret = bch2_btree_node_lock_write(trans, path, &b->c);
1687 bch2_btree_node_prep_for_write(trans, path, b);
1689 if (!bch2_btree_node_insert_fits(c, b, bch2_keylist_u64s(keys))) {
1690 bch2_btree_node_unlock_write(trans, path, b);
1694 btree_node_interior_verify(c, b);
1696 bch2_btree_insert_keys_interior(as, trans, path, b, keys);
1698 live_u64s_added = (int) b->nr.live_u64s - old_live_u64s;
1699 u64s_added = (int) le16_to_cpu(btree_bset_last(b)->u64s) - old_u64s;
1701 if (b->sib_u64s[0] != U16_MAX && live_u64s_added < 0)
1702 b->sib_u64s[0] = max(0, (int) b->sib_u64s[0] + live_u64s_added);
1703 if (b->sib_u64s[1] != U16_MAX && live_u64s_added < 0)
1704 b->sib_u64s[1] = max(0, (int) b->sib_u64s[1] + live_u64s_added);
1706 if (u64s_added > live_u64s_added &&
1707 bch2_maybe_compact_whiteouts(c, b))
1708 bch2_trans_node_reinit_iter(trans, b);
1710 bch2_btree_node_unlock_write(trans, path, b);
1712 btree_node_interior_verify(c, b);
1716 * We could attempt to avoid the transaction restart, by calling
1717 * bch2_btree_path_upgrade() and allocating more nodes:
1719 if (b->c.level >= as->update_level) {
1720 trace_and_count(c, trans_restart_split_race, trans, _THIS_IP_);
1721 return btree_trans_restart(trans, BCH_ERR_transaction_restart_split_race);
1724 return btree_split(as, trans, path, b, keys, flags);
1727 int bch2_btree_split_leaf(struct btree_trans *trans,
1728 struct btree_path *path,
1731 struct btree *b = path_l(path)->b;
1732 struct btree_update *as;
1736 as = bch2_btree_update_start(trans, path, path->level,
1741 ret = btree_split(as, trans, path, b, NULL, flags);
1743 bch2_btree_update_free(as, trans);
1747 bch2_btree_update_done(as, trans);
1749 for (l = path->level + 1; btree_node_intent_locked(path, l) && !ret; l++)
1750 ret = bch2_foreground_maybe_merge(trans, path, l, flags);
1755 int __bch2_foreground_maybe_merge(struct btree_trans *trans,
1756 struct btree_path *path,
1759 enum btree_node_sibling sib)
1761 struct bch_fs *c = trans->c;
1762 struct btree_path *sib_path = NULL, *new_path = NULL;
1763 struct btree_update *as;
1764 struct bkey_format_state new_s;
1765 struct bkey_format new_f;
1766 struct bkey_i delete;
1767 struct btree *b, *m, *n, *prev, *next, *parent;
1768 struct bpos sib_pos;
1770 u64 start_time = local_clock();
1773 BUG_ON(!path->should_be_locked);
1774 BUG_ON(!btree_node_locked(path, level));
1776 b = path->l[level].b;
1778 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) ||
1779 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) {
1780 b->sib_u64s[sib] = U16_MAX;
1784 sib_pos = sib == btree_prev_sib
1785 ? bpos_predecessor(b->data->min_key)
1786 : bpos_successor(b->data->max_key);
1788 sib_path = bch2_path_get(trans, path->btree_id, sib_pos,
1789 U8_MAX, level, BTREE_ITER_INTENT, _THIS_IP_);
1790 ret = bch2_btree_path_traverse(trans, sib_path, false);
1794 btree_path_set_should_be_locked(sib_path);
1796 m = sib_path->l[level].b;
1798 if (btree_node_parent(path, b) !=
1799 btree_node_parent(sib_path, m)) {
1800 b->sib_u64s[sib] = U16_MAX;
1804 if (sib == btree_prev_sib) {
1812 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) {
1813 struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF;
1815 bch2_bpos_to_text(&buf1, prev->data->max_key);
1816 bch2_bpos_to_text(&buf2, next->data->min_key);
1818 "%s(): btree topology error:\n"
1819 " prev ends at %s\n"
1820 " next starts at %s",
1821 __func__, buf1.buf, buf2.buf);
1822 printbuf_exit(&buf1);
1823 printbuf_exit(&buf2);
1824 bch2_topology_error(c);
1829 bch2_bkey_format_init(&new_s);
1830 bch2_bkey_format_add_pos(&new_s, prev->data->min_key);
1831 __bch2_btree_calc_format(&new_s, prev);
1832 __bch2_btree_calc_format(&new_s, next);
1833 bch2_bkey_format_add_pos(&new_s, next->data->max_key);
1834 new_f = bch2_bkey_format_done(&new_s);
1836 sib_u64s = btree_node_u64s_with_format(b, &new_f) +
1837 btree_node_u64s_with_format(m, &new_f);
1839 if (sib_u64s > BTREE_FOREGROUND_MERGE_HYSTERESIS(c)) {
1840 sib_u64s -= BTREE_FOREGROUND_MERGE_HYSTERESIS(c);
1842 sib_u64s += BTREE_FOREGROUND_MERGE_HYSTERESIS(c);
1845 sib_u64s = min(sib_u64s, btree_max_u64s(c));
1846 sib_u64s = min(sib_u64s, (size_t) U16_MAX - 1);
1847 b->sib_u64s[sib] = sib_u64s;
1849 if (b->sib_u64s[sib] > c->btree_foreground_merge_threshold)
1852 parent = btree_node_parent(path, b);
1853 as = bch2_btree_update_start(trans, path, level, false,
1854 BTREE_INSERT_NOFAIL|
1855 BTREE_INSERT_USE_RESERVE|
1857 ret = PTR_ERR_OR_ZERO(as);
1861 trace_and_count(c, btree_node_merge, c, b);
1863 bch2_btree_interior_update_will_free_node(as, b);
1864 bch2_btree_interior_update_will_free_node(as, m);
1866 n = bch2_btree_node_alloc(as, trans, b->c.level);
1868 SET_BTREE_NODE_SEQ(n->data,
1869 max(BTREE_NODE_SEQ(b->data),
1870 BTREE_NODE_SEQ(m->data)) + 1);
1872 btree_set_min(n, prev->data->min_key);
1873 btree_set_max(n, next->data->max_key);
1875 n->data->format = new_f;
1876 btree_node_set_format(n, new_f);
1878 bch2_btree_sort_into(c, n, prev);
1879 bch2_btree_sort_into(c, n, next);
1881 bch2_btree_build_aux_trees(n);
1882 bch2_btree_update_add_new_node(as, n);
1883 six_unlock_write(&n->c.lock);
1885 new_path = get_unlocked_mut_path(trans, path->btree_id, n->c.level, n->key.k.p);
1886 six_lock_increment(&n->c.lock, SIX_LOCK_intent);
1887 mark_btree_node_locked(trans, new_path, n->c.level, SIX_LOCK_intent);
1888 bch2_btree_path_level_init(trans, new_path, n);
1890 bkey_init(&delete.k);
1891 delete.k.p = prev->key.k.p;
1892 bch2_keylist_add(&as->parent_keys, &delete);
1893 bch2_keylist_add(&as->parent_keys, &n->key);
1895 bch2_trans_verify_paths(trans);
1897 ret = bch2_btree_insert_node(as, trans, path, parent, &as->parent_keys, flags);
1899 goto err_free_update;
1901 bch2_trans_verify_paths(trans);
1903 bch2_btree_update_get_open_buckets(as, n);
1904 bch2_btree_node_write(c, n, SIX_LOCK_intent, 0);
1906 bch2_btree_node_free_inmem(trans, path, b);
1907 bch2_btree_node_free_inmem(trans, sib_path, m);
1909 bch2_trans_node_add(trans, n);
1911 bch2_trans_verify_paths(trans);
1913 six_unlock_intent(&n->c.lock);
1915 bch2_btree_update_done(as, trans);
1917 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_merge], start_time);
1921 bch2_path_put(trans, new_path, true);
1922 bch2_path_put(trans, sib_path, true);
1923 bch2_trans_verify_locks(trans);
1926 bch2_btree_node_free_never_used(as, trans, n);
1927 bch2_btree_update_free(as, trans);
1932 * bch_btree_node_rewrite - Rewrite/move a btree node
1934 int bch2_btree_node_rewrite(struct btree_trans *trans,
1935 struct btree_iter *iter,
1939 struct bch_fs *c = trans->c;
1940 struct btree_path *new_path = NULL;
1941 struct btree *n, *parent;
1942 struct btree_update *as;
1945 flags |= BTREE_INSERT_NOFAIL;
1947 parent = btree_node_parent(iter->path, b);
1948 as = bch2_btree_update_start(trans, iter->path, b->c.level,
1950 ret = PTR_ERR_OR_ZERO(as);
1954 bch2_btree_interior_update_will_free_node(as, b);
1956 n = bch2_btree_node_alloc_replacement(as, trans, b);
1958 bch2_btree_build_aux_trees(n);
1959 bch2_btree_update_add_new_node(as, n);
1960 six_unlock_write(&n->c.lock);
1962 new_path = get_unlocked_mut_path(trans, iter->btree_id, n->c.level, n->key.k.p);
1963 six_lock_increment(&n->c.lock, SIX_LOCK_intent);
1964 mark_btree_node_locked(trans, new_path, n->c.level, SIX_LOCK_intent);
1965 bch2_btree_path_level_init(trans, new_path, n);
1967 trace_and_count(c, btree_node_rewrite, c, b);
1970 bch2_keylist_add(&as->parent_keys, &n->key);
1971 ret = bch2_btree_insert_node(as, trans, iter->path, parent,
1972 &as->parent_keys, flags);
1976 bch2_btree_set_root(as, trans, iter->path, n);
1979 bch2_btree_update_get_open_buckets(as, n);
1980 bch2_btree_node_write(c, n, SIX_LOCK_intent, 0);
1982 bch2_btree_node_free_inmem(trans, iter->path, b);
1984 bch2_trans_node_add(trans, n);
1985 six_unlock_intent(&n->c.lock);
1987 bch2_btree_update_done(as, trans);
1990 bch2_path_put(trans, new_path, true);
1991 bch2_btree_path_downgrade(trans, iter->path);
1994 bch2_btree_node_free_never_used(as, trans, n);
1995 bch2_btree_update_free(as, trans);
1999 struct async_btree_rewrite {
2001 struct work_struct work;
2002 struct list_head list;
2003 enum btree_id btree_id;
2009 static int async_btree_node_rewrite_trans(struct btree_trans *trans,
2010 struct async_btree_rewrite *a)
2012 struct bch_fs *c = trans->c;
2013 struct btree_iter iter;
2017 bch2_trans_node_iter_init(trans, &iter, a->btree_id, a->pos,
2018 BTREE_MAX_DEPTH, a->level, 0);
2019 b = bch2_btree_iter_peek_node(&iter);
2020 ret = PTR_ERR_OR_ZERO(b);
2024 if (!b || b->data->keys.seq != a->seq) {
2025 struct printbuf buf = PRINTBUF;
2028 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
2030 prt_str(&buf, "(null");
2031 bch_info(c, "%s: node to rewrite not found:, searching for seq %llu, got\n%s",
2032 __func__, a->seq, buf.buf);
2033 printbuf_exit(&buf);
2037 ret = bch2_btree_node_rewrite(trans, &iter, b, 0);
2039 bch2_trans_iter_exit(trans, &iter);
2044 void async_btree_node_rewrite_work(struct work_struct *work)
2046 struct async_btree_rewrite *a =
2047 container_of(work, struct async_btree_rewrite, work);
2048 struct bch_fs *c = a->c;
2051 ret = bch2_trans_do(c, NULL, NULL, 0,
2052 async_btree_node_rewrite_trans(&trans, a));
2054 bch_err(c, "%s: error %s", __func__, bch2_err_str(ret));
2055 bch2_write_ref_put(c, BCH_WRITE_REF_node_rewrite);
2059 void bch2_btree_node_rewrite_async(struct bch_fs *c, struct btree *b)
2061 struct async_btree_rewrite *a;
2064 a = kmalloc(sizeof(*a), GFP_NOFS);
2066 bch_err(c, "%s: error allocating memory", __func__);
2071 a->btree_id = b->c.btree_id;
2072 a->level = b->c.level;
2073 a->pos = b->key.k.p;
2074 a->seq = b->data->keys.seq;
2075 INIT_WORK(&a->work, async_btree_node_rewrite_work);
2077 if (unlikely(!test_bit(BCH_FS_MAY_GO_RW, &c->flags))) {
2078 mutex_lock(&c->pending_node_rewrites_lock);
2079 list_add(&a->list, &c->pending_node_rewrites);
2080 mutex_unlock(&c->pending_node_rewrites_lock);
2084 if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_node_rewrite)) {
2085 if (test_bit(BCH_FS_STARTED, &c->flags)) {
2086 bch_err(c, "%s: error getting c->writes ref", __func__);
2091 ret = bch2_fs_read_write_early(c);
2093 bch_err(c, "%s: error going read-write: %s",
2094 __func__, bch2_err_str(ret));
2099 bch2_write_ref_get(c, BCH_WRITE_REF_node_rewrite);
2102 queue_work(c->btree_interior_update_worker, &a->work);
2105 void bch2_do_pending_node_rewrites(struct bch_fs *c)
2107 struct async_btree_rewrite *a, *n;
2109 mutex_lock(&c->pending_node_rewrites_lock);
2110 list_for_each_entry_safe(a, n, &c->pending_node_rewrites, list) {
2113 bch2_write_ref_get(c, BCH_WRITE_REF_node_rewrite);
2114 queue_work(c->btree_interior_update_worker, &a->work);
2116 mutex_unlock(&c->pending_node_rewrites_lock);
2119 void bch2_free_pending_node_rewrites(struct bch_fs *c)
2121 struct async_btree_rewrite *a, *n;
2123 mutex_lock(&c->pending_node_rewrites_lock);
2124 list_for_each_entry_safe(a, n, &c->pending_node_rewrites, list) {
2129 mutex_unlock(&c->pending_node_rewrites_lock);
2132 static int __bch2_btree_node_update_key(struct btree_trans *trans,
2133 struct btree_iter *iter,
2134 struct btree *b, struct btree *new_hash,
2135 struct bkey_i *new_key,
2138 struct bch_fs *c = trans->c;
2139 struct btree_iter iter2 = { NULL };
2140 struct btree *parent;
2143 if (!skip_triggers) {
2144 ret = bch2_trans_mark_old(trans, b->c.btree_id, b->c.level + 1,
2145 bkey_i_to_s_c(&b->key), 0);
2149 ret = bch2_trans_mark_new(trans, b->c.btree_id, b->c.level + 1,
2156 bkey_copy(&new_hash->key, new_key);
2157 ret = bch2_btree_node_hash_insert(&c->btree_cache,
2158 new_hash, b->c.level, b->c.btree_id);
2162 parent = btree_node_parent(iter->path, b);
2164 bch2_trans_copy_iter(&iter2, iter);
2166 iter2.path = bch2_btree_path_make_mut(trans, iter2.path,
2167 iter2.flags & BTREE_ITER_INTENT,
2170 BUG_ON(iter2.path->level != b->c.level);
2171 BUG_ON(!bpos_eq(iter2.path->pos, new_key->k.p));
2173 btree_path_set_level_up(trans, iter2.path);
2175 trans->paths_sorted = false;
2177 ret = bch2_btree_iter_traverse(&iter2) ?:
2178 bch2_trans_update(trans, &iter2, new_key, BTREE_TRIGGER_NORUN);
2182 BUG_ON(btree_node_root(c, b) != b);
2184 ret = darray_make_room(&trans->extra_journal_entries,
2185 jset_u64s(new_key->k.u64s));
2189 journal_entry_set((void *) &darray_top(trans->extra_journal_entries),
2190 BCH_JSET_ENTRY_btree_root,
2191 b->c.btree_id, b->c.level,
2192 new_key, new_key->k.u64s);
2193 trans->extra_journal_entries.nr += jset_u64s(new_key->k.u64s);
2196 ret = bch2_trans_commit(trans, NULL, NULL,
2197 BTREE_INSERT_NOFAIL|
2198 BTREE_INSERT_NOCHECK_RW|
2199 BTREE_INSERT_USE_RESERVE|
2200 BTREE_INSERT_JOURNAL_RECLAIM|
2201 JOURNAL_WATERMARK_reserved);
2205 bch2_btree_node_lock_write_nofail(trans, iter->path, &b->c);
2208 mutex_lock(&c->btree_cache.lock);
2209 bch2_btree_node_hash_remove(&c->btree_cache, new_hash);
2210 bch2_btree_node_hash_remove(&c->btree_cache, b);
2212 bkey_copy(&b->key, new_key);
2213 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
2215 mutex_unlock(&c->btree_cache.lock);
2217 bkey_copy(&b->key, new_key);
2220 bch2_btree_node_unlock_write(trans, iter->path, b);
2222 bch2_trans_iter_exit(trans, &iter2);
2226 mutex_lock(&c->btree_cache.lock);
2227 bch2_btree_node_hash_remove(&c->btree_cache, b);
2228 mutex_unlock(&c->btree_cache.lock);
2233 int bch2_btree_node_update_key(struct btree_trans *trans, struct btree_iter *iter,
2234 struct btree *b, struct bkey_i *new_key,
2237 struct bch_fs *c = trans->c;
2238 struct btree *new_hash = NULL;
2239 struct btree_path *path = iter->path;
2243 ret = bch2_btree_path_upgrade(trans, path, b->c.level + 1);
2247 closure_init_stack(&cl);
2250 * check btree_ptr_hash_val() after @b is locked by
2251 * btree_iter_traverse():
2253 if (btree_ptr_hash_val(new_key) != b->hash_val) {
2254 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
2256 bch2_trans_unlock(trans);
2258 ret = bch2_trans_relock(trans);
2263 new_hash = bch2_btree_node_mem_alloc(trans, false);
2267 ret = __bch2_btree_node_update_key(trans, iter, b, new_hash,
2268 new_key, skip_triggers);
2272 mutex_lock(&c->btree_cache.lock);
2273 list_move(&new_hash->list, &c->btree_cache.freeable);
2274 mutex_unlock(&c->btree_cache.lock);
2276 six_unlock_write(&new_hash->c.lock);
2277 six_unlock_intent(&new_hash->c.lock);
2280 bch2_btree_cache_cannibalize_unlock(c);
2284 int bch2_btree_node_update_key_get_iter(struct btree_trans *trans,
2285 struct btree *b, struct bkey_i *new_key,
2288 struct btree_iter iter;
2291 bch2_trans_node_iter_init(trans, &iter, b->c.btree_id, b->key.k.p,
2292 BTREE_MAX_DEPTH, b->c.level,
2294 ret = bch2_btree_iter_traverse(&iter);
2298 /* has node been freed? */
2299 if (iter.path->l[b->c.level].b != b) {
2300 /* node has been freed: */
2301 BUG_ON(!btree_node_dying(b));
2305 BUG_ON(!btree_node_hashed(b));
2307 ret = bch2_btree_node_update_key(trans, &iter, b, new_key, skip_triggers);
2309 bch2_trans_iter_exit(trans, &iter);
2316 * Only for filesystem bringup, when first reading the btree roots or allocating
2317 * btree roots when initializing a new filesystem:
2319 void bch2_btree_set_root_for_read(struct bch_fs *c, struct btree *b)
2321 BUG_ON(btree_node_root(c, b));
2323 bch2_btree_set_root_inmem(c, b);
2326 static int __bch2_btree_root_alloc(struct btree_trans *trans, enum btree_id id)
2328 struct bch_fs *c = trans->c;
2333 closure_init_stack(&cl);
2336 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
2340 b = bch2_btree_node_mem_alloc(trans, false);
2341 bch2_btree_cache_cannibalize_unlock(c);
2343 set_btree_node_fake(b);
2344 set_btree_node_need_rewrite(b);
2348 bkey_btree_ptr_init(&b->key);
2349 b->key.k.p = SPOS_MAX;
2350 *((u64 *) bkey_i_to_btree_ptr(&b->key)->v.start) = U64_MAX - id;
2352 bch2_bset_init_first(b, &b->data->keys);
2353 bch2_btree_build_aux_trees(b);
2356 btree_set_min(b, POS_MIN);
2357 btree_set_max(b, SPOS_MAX);
2358 b->data->format = bch2_btree_calc_format(b);
2359 btree_node_set_format(b, b->data->format);
2361 ret = bch2_btree_node_hash_insert(&c->btree_cache, b,
2362 b->c.level, b->c.btree_id);
2365 bch2_btree_set_root_inmem(c, b);
2367 six_unlock_write(&b->c.lock);
2368 six_unlock_intent(&b->c.lock);
2372 void bch2_btree_root_alloc(struct bch_fs *c, enum btree_id id)
2374 bch2_trans_run(c, __bch2_btree_root_alloc(&trans, id));
2377 void bch2_btree_updates_to_text(struct printbuf *out, struct bch_fs *c)
2379 struct btree_update *as;
2381 mutex_lock(&c->btree_interior_update_lock);
2382 list_for_each_entry(as, &c->btree_interior_update_list, list)
2383 prt_printf(out, "%p m %u w %u r %u j %llu\n",
2387 atomic_read(&as->cl.remaining) & CLOSURE_REMAINING_MASK,
2389 mutex_unlock(&c->btree_interior_update_lock);
2392 static bool bch2_btree_interior_updates_pending(struct bch_fs *c)
2396 mutex_lock(&c->btree_interior_update_lock);
2397 ret = !list_empty(&c->btree_interior_update_list);
2398 mutex_unlock(&c->btree_interior_update_lock);
2403 bool bch2_btree_interior_updates_flush(struct bch_fs *c)
2405 bool ret = bch2_btree_interior_updates_pending(c);
2408 closure_wait_event(&c->btree_interior_update_wait,
2409 !bch2_btree_interior_updates_pending(c));
2413 void bch2_journal_entry_to_btree_root(struct bch_fs *c, struct jset_entry *entry)
2415 struct btree_root *r = &c->btree_roots[entry->btree_id];
2417 mutex_lock(&c->btree_root_lock);
2419 r->level = entry->level;
2421 bkey_copy(&r->key, &entry->start[0]);
2423 mutex_unlock(&c->btree_root_lock);
2427 bch2_btree_roots_to_journal_entries(struct bch_fs *c,
2428 struct jset_entry *start,
2429 struct jset_entry *end)
2431 struct jset_entry *entry;
2432 unsigned long have = 0;
2435 for (entry = start; entry < end; entry = vstruct_next(entry))
2436 if (entry->type == BCH_JSET_ENTRY_btree_root)
2437 __set_bit(entry->btree_id, &have);
2439 mutex_lock(&c->btree_root_lock);
2441 for (i = 0; i < BTREE_ID_NR; i++)
2442 if (c->btree_roots[i].alive && !test_bit(i, &have)) {
2443 journal_entry_set(end,
2444 BCH_JSET_ENTRY_btree_root,
2445 i, c->btree_roots[i].level,
2446 &c->btree_roots[i].key,
2447 c->btree_roots[i].key.u64s);
2448 end = vstruct_next(end);
2451 mutex_unlock(&c->btree_root_lock);
2456 void bch2_fs_btree_interior_update_exit(struct bch_fs *c)
2458 if (c->btree_interior_update_worker)
2459 destroy_workqueue(c->btree_interior_update_worker);
2460 mempool_exit(&c->btree_interior_update_pool);
2463 int bch2_fs_btree_interior_update_init(struct bch_fs *c)
2465 mutex_init(&c->btree_reserve_cache_lock);
2466 INIT_LIST_HEAD(&c->btree_interior_update_list);
2467 INIT_LIST_HEAD(&c->btree_interior_updates_unwritten);
2468 mutex_init(&c->btree_interior_update_lock);
2469 INIT_WORK(&c->btree_interior_update_work, btree_interior_update_work);
2471 INIT_LIST_HEAD(&c->pending_node_rewrites);
2472 mutex_init(&c->pending_node_rewrites_lock);
2474 c->btree_interior_update_worker =
2475 alloc_workqueue("btree_update", WQ_UNBOUND|WQ_MEM_RECLAIM, 1);
2476 if (!c->btree_interior_update_worker)
2479 return mempool_init_kmalloc_pool(&c->btree_interior_update_pool, 1,
2480 sizeof(struct btree_update));