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"
16 #include "journal_reclaim.h"
21 #include <linux/random.h>
22 #include <trace/events/bcachefs.h>
24 static void btree_node_will_make_reachable(struct btree_update *,
26 static void btree_update_drop_new_node(struct bch_fs *, struct btree *);
27 static void bch2_btree_set_root_ondisk(struct bch_fs *, struct btree *, int);
31 static void btree_node_interior_verify(struct btree *b)
33 struct btree_node_iter iter;
34 struct bkey_packed *k;
38 bch2_btree_node_iter_init(&iter, b, &b->key.k.p);
40 BUG_ON(!(k = bch2_btree_node_iter_peek(&iter, b)) ||
41 bkey_cmp_left_packed(b, k, &b->key.k.p));
43 BUG_ON((bch2_btree_node_iter_advance(&iter, b),
44 !bch2_btree_node_iter_end(&iter)));
49 k = bch2_btree_node_iter_peek(&iter, b);
53 msg = "isn't what it should be";
54 if (bkey_cmp_left_packed(b, k, &b->key.k.p))
57 bch2_btree_node_iter_advance(&iter, b);
59 msg = "isn't last key";
60 if (!bch2_btree_node_iter_end(&iter))
64 bch2_dump_btree_node(b);
65 printk(KERN_ERR "last key %llu:%llu %s\n", b->key.k.p.inode,
66 b->key.k.p.offset, msg);
71 /* Calculate ideal packed bkey format for new btree nodes: */
73 void __bch2_btree_calc_format(struct bkey_format_state *s, struct btree *b)
75 struct bkey_packed *k;
79 bch2_bkey_format_add_pos(s, b->data->min_key);
82 bset_tree_for_each_key(b, t, k)
83 if (!bkey_whiteout(k)) {
84 uk = bkey_unpack_key(b, k);
85 bch2_bkey_format_add_key(s, &uk);
89 static struct bkey_format bch2_btree_calc_format(struct btree *b)
91 struct bkey_format_state s;
93 bch2_bkey_format_init(&s);
94 __bch2_btree_calc_format(&s, b);
96 return bch2_bkey_format_done(&s);
99 static size_t btree_node_u64s_with_format(struct btree *b,
100 struct bkey_format *new_f)
102 struct bkey_format *old_f = &b->format;
104 /* stupid integer promotion rules */
106 (((int) new_f->key_u64s - old_f->key_u64s) *
107 (int) b->nr.packed_keys) +
108 (((int) new_f->key_u64s - BKEY_U64s) *
109 (int) b->nr.unpacked_keys);
111 BUG_ON(delta + b->nr.live_u64s < 0);
113 return b->nr.live_u64s + delta;
117 * btree_node_format_fits - check if we could rewrite node with a new format
119 * This assumes all keys can pack with the new format -- it just checks if
120 * the re-packed keys would fit inside the node itself.
122 bool bch2_btree_node_format_fits(struct bch_fs *c, struct btree *b,
123 struct bkey_format *new_f)
125 size_t u64s = btree_node_u64s_with_format(b, new_f);
127 return __vstruct_bytes(struct btree_node, u64s) < btree_bytes(c);
130 /* Btree node freeing/allocation: */
132 static bool btree_key_matches(struct bch_fs *c,
136 struct bkey_ptrs_c ptrs1 = bch2_bkey_ptrs_c(l);
137 struct bkey_ptrs_c ptrs2 = bch2_bkey_ptrs_c(r);
138 const struct bch_extent_ptr *ptr1, *ptr2;
140 bkey_for_each_ptr(ptrs1, ptr1)
141 bkey_for_each_ptr(ptrs2, ptr2)
142 if (ptr1->dev == ptr2->dev &&
143 ptr1->gen == ptr2->gen &&
144 ptr1->offset == ptr2->offset)
151 * We're doing the index update that makes @b unreachable, update stuff to
154 * Must be called _before_ btree_update_updated_root() or
155 * btree_update_updated_node:
157 static void bch2_btree_node_free_index(struct btree_update *as, struct btree *b,
159 struct bch_fs_usage *stats)
161 struct bch_fs *c = as->c;
162 struct pending_btree_node_free *d;
164 for (d = as->pending; d < as->pending + as->nr_pending; d++)
165 if (!bkey_cmp(k.k->p, d->key.k.p) &&
166 btree_key_matches(c, k, bkey_i_to_s_c(&d->key)))
170 BUG_ON(d->index_update_done);
171 d->index_update_done = true;
174 * We're dropping @k from the btree, but it's still live until the
175 * index update is persistent so we need to keep a reference around for
176 * mark and sweep to find - that's primarily what the
177 * btree_node_pending_free list is for.
179 * So here (when we set index_update_done = true), we're moving an
180 * existing reference to a different part of the larger "gc keyspace" -
181 * and the new position comes after the old position, since GC marks
182 * the pending free list after it walks the btree.
184 * If we move the reference while mark and sweep is _between_ the old
185 * and the new position, mark and sweep will see the reference twice
186 * and it'll get double accounted - so check for that here and subtract
187 * to cancel out one of mark and sweep's markings if necessary:
190 if (gc_pos_cmp(c->gc_pos, b
191 ? gc_pos_btree_node(b)
192 : gc_pos_btree_root(as->btree_id)) >= 0 &&
193 gc_pos_cmp(c->gc_pos, gc_phase(GC_PHASE_PENDING_DELETE)) < 0)
194 bch2_mark_key_locked(c, bkey_i_to_s_c(&d->key),
196 BTREE_TRIGGER_OVERWRITE|
200 static void __btree_node_free(struct bch_fs *c, struct btree *b)
202 trace_btree_node_free(c, b);
204 BUG_ON(btree_node_dirty(b));
205 BUG_ON(btree_node_need_write(b));
206 BUG_ON(b == btree_node_root(c, b));
208 BUG_ON(!list_empty(&b->write_blocked));
209 BUG_ON(b->will_make_reachable);
211 clear_btree_node_noevict(b);
213 bch2_btree_node_hash_remove(&c->btree_cache, b);
215 mutex_lock(&c->btree_cache.lock);
216 list_move(&b->list, &c->btree_cache.freeable);
217 mutex_unlock(&c->btree_cache.lock);
220 void bch2_btree_node_free_never_inserted(struct bch_fs *c, struct btree *b)
222 struct open_buckets ob = b->ob;
224 btree_update_drop_new_node(c, b);
228 clear_btree_node_dirty(b);
230 btree_node_lock_type(c, b, SIX_LOCK_write);
231 __btree_node_free(c, b);
232 six_unlock_write(&b->lock);
234 bch2_open_buckets_put(c, &ob);
237 void bch2_btree_node_free_inmem(struct bch_fs *c, struct btree *b,
238 struct btree_iter *iter)
240 struct btree_iter *linked;
242 trans_for_each_iter(iter->trans, linked)
243 BUG_ON(linked->l[b->level].b == b);
246 * Is this a node that isn't reachable on disk yet?
248 * Nodes that aren't reachable yet have writes blocked until they're
249 * reachable - now that we've cancelled any pending writes and moved
250 * things waiting on that write to wait on this update, we can drop this
251 * node from the list of nodes that the other update is making
252 * reachable, prior to freeing it:
254 btree_update_drop_new_node(c, b);
256 six_lock_write(&b->lock);
257 __btree_node_free(c, b);
258 six_unlock_write(&b->lock);
259 six_unlock_intent(&b->lock);
262 static void bch2_btree_node_free_ondisk(struct bch_fs *c,
263 struct pending_btree_node_free *pending)
265 BUG_ON(!pending->index_update_done);
267 bch2_mark_key(c, bkey_i_to_s_c(&pending->key),
268 0, 0, NULL, 0, BTREE_TRIGGER_OVERWRITE);
270 if (gc_visited(c, gc_phase(GC_PHASE_PENDING_DELETE)))
271 bch2_mark_key(c, bkey_i_to_s_c(&pending->key),
273 BTREE_TRIGGER_OVERWRITE|
277 static struct btree *__bch2_btree_node_alloc(struct bch_fs *c,
278 struct disk_reservation *res,
282 struct write_point *wp;
285 struct open_buckets ob = { .nr = 0 };
286 struct bch_devs_list devs_have = (struct bch_devs_list) { 0 };
288 enum alloc_reserve alloc_reserve;
290 if (flags & BTREE_INSERT_USE_ALLOC_RESERVE) {
292 alloc_reserve = RESERVE_ALLOC;
293 } else if (flags & BTREE_INSERT_USE_RESERVE) {
294 nr_reserve = BTREE_NODE_RESERVE / 2;
295 alloc_reserve = RESERVE_BTREE;
297 nr_reserve = BTREE_NODE_RESERVE;
298 alloc_reserve = RESERVE_NONE;
301 mutex_lock(&c->btree_reserve_cache_lock);
302 if (c->btree_reserve_cache_nr > nr_reserve) {
303 struct btree_alloc *a =
304 &c->btree_reserve_cache[--c->btree_reserve_cache_nr];
307 bkey_copy(&tmp.k, &a->k);
308 mutex_unlock(&c->btree_reserve_cache_lock);
311 mutex_unlock(&c->btree_reserve_cache_lock);
314 wp = bch2_alloc_sectors_start(c, c->opts.foreground_target, 0,
315 writepoint_ptr(&c->btree_write_point),
318 c->opts.metadata_replicas_required,
319 alloc_reserve, 0, cl);
323 if (wp->sectors_free < c->opts.btree_node_size) {
324 struct open_bucket *ob;
327 open_bucket_for_each(c, &wp->ptrs, ob, i)
328 if (ob->sectors_free < c->opts.btree_node_size)
329 ob->sectors_free = 0;
331 bch2_alloc_sectors_done(c, wp);
335 if (c->sb.features & (1ULL << BCH_FEATURE_btree_ptr_v2))
336 bkey_btree_ptr_v2_init(&tmp.k);
338 bkey_btree_ptr_init(&tmp.k);
340 bch2_alloc_sectors_append_ptrs(c, wp, &tmp.k, c->opts.btree_node_size);
342 bch2_open_bucket_get(c, wp, &ob);
343 bch2_alloc_sectors_done(c, wp);
345 b = bch2_btree_node_mem_alloc(c);
347 /* we hold cannibalize_lock: */
351 bkey_copy(&b->key, &tmp.k);
357 static struct btree *bch2_btree_node_alloc(struct btree_update *as, unsigned level)
359 struct bch_fs *c = as->c;
363 BUG_ON(level >= BTREE_MAX_DEPTH);
364 BUG_ON(!as->reserve->nr);
366 b = as->reserve->b[--as->reserve->nr];
368 set_btree_node_accessed(b);
369 set_btree_node_dirty(b);
370 set_btree_node_need_write(b);
372 bch2_bset_init_first(b, &b->data->keys);
374 b->btree_id = as->btree_id;
376 memset(&b->nr, 0, sizeof(b->nr));
377 b->data->magic = cpu_to_le64(bset_magic(c));
379 SET_BTREE_NODE_ID(b->data, as->btree_id);
380 SET_BTREE_NODE_LEVEL(b->data, level);
381 b->data->ptr = bch2_bkey_ptrs_c(bkey_i_to_s_c(&b->key)).start->ptr;
383 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
384 struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(&b->key);
387 bp->v.seq = b->data->keys.seq;
388 bp->v.sectors_written = 0;
389 bp->v.sectors = cpu_to_le16(c->opts.btree_node_size);
392 if (c->sb.features & (1ULL << BCH_FEATURE_new_extent_overwrite))
393 SET_BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data, true);
395 if (btree_node_is_extents(b) &&
396 !BTREE_NODE_NEW_EXTENT_OVERWRITE(b->data))
397 set_btree_node_old_extent_overwrite(b);
399 bch2_btree_build_aux_trees(b);
401 btree_node_will_make_reachable(as, b);
403 ret = bch2_btree_node_hash_insert(&c->btree_cache, b, level, as->btree_id);
406 trace_btree_node_alloc(c, b);
410 static void btree_set_min(struct btree *b, struct bpos pos)
412 if (b->key.k.type == KEY_TYPE_btree_ptr_v2)
413 bkey_i_to_btree_ptr_v2(&b->key)->v.min_key = pos;
414 b->data->min_key = pos;
417 static void btree_set_max(struct btree *b, struct bpos pos)
420 b->data->max_key = pos;
423 struct btree *__bch2_btree_node_alloc_replacement(struct btree_update *as,
425 struct bkey_format format)
429 n = bch2_btree_node_alloc(as, b->level);
431 SET_BTREE_NODE_SEQ(n->data, BTREE_NODE_SEQ(b->data) + 1);
433 btree_set_min(n, b->data->min_key);
434 btree_set_max(n, b->data->max_key);
436 n->data->format = format;
437 btree_node_set_format(n, format);
439 bch2_btree_sort_into(as->c, n, b);
441 btree_node_reset_sib_u64s(n);
443 n->key.k.p = b->key.k.p;
447 static struct btree *bch2_btree_node_alloc_replacement(struct btree_update *as,
450 struct bkey_format new_f = bch2_btree_calc_format(b);
453 * The keys might expand with the new format - if they wouldn't fit in
454 * the btree node anymore, use the old format for now:
456 if (!bch2_btree_node_format_fits(as->c, b, &new_f))
459 return __bch2_btree_node_alloc_replacement(as, b, new_f);
462 static struct btree *__btree_root_alloc(struct btree_update *as, unsigned level)
464 struct btree *b = bch2_btree_node_alloc(as, level);
466 btree_set_min(b, POS_MIN);
467 btree_set_max(b, POS_MAX);
468 b->data->format = bch2_btree_calc_format(b);
470 btree_node_set_format(b, b->data->format);
471 bch2_btree_build_aux_trees(b);
473 six_unlock_write(&b->lock);
478 static void bch2_btree_reserve_put(struct bch_fs *c, struct btree_reserve *reserve)
480 bch2_disk_reservation_put(c, &reserve->disk_res);
482 mutex_lock(&c->btree_reserve_cache_lock);
484 while (reserve->nr) {
485 struct btree *b = reserve->b[--reserve->nr];
487 six_unlock_write(&b->lock);
489 if (c->btree_reserve_cache_nr <
490 ARRAY_SIZE(c->btree_reserve_cache)) {
491 struct btree_alloc *a =
492 &c->btree_reserve_cache[c->btree_reserve_cache_nr++];
496 bkey_copy(&a->k, &b->key);
498 bch2_open_buckets_put(c, &b->ob);
501 btree_node_lock_type(c, b, SIX_LOCK_write);
502 __btree_node_free(c, b);
503 six_unlock_write(&b->lock);
505 six_unlock_intent(&b->lock);
508 mutex_unlock(&c->btree_reserve_cache_lock);
510 mempool_free(reserve, &c->btree_reserve_pool);
513 static struct btree_reserve *bch2_btree_reserve_get(struct bch_fs *c,
518 struct btree_reserve *reserve;
520 struct disk_reservation disk_res = { 0, 0 };
521 unsigned sectors = nr_nodes * c->opts.btree_node_size;
522 int ret, disk_res_flags = 0;
524 if (flags & BTREE_INSERT_NOFAIL)
525 disk_res_flags |= BCH_DISK_RESERVATION_NOFAIL;
528 * This check isn't necessary for correctness - it's just to potentially
529 * prevent us from doing a lot of work that'll end up being wasted:
531 ret = bch2_journal_error(&c->journal);
535 if (bch2_disk_reservation_get(c, &disk_res, sectors,
536 c->opts.metadata_replicas,
538 return ERR_PTR(-ENOSPC);
540 BUG_ON(nr_nodes > BTREE_RESERVE_MAX);
543 * Protects reaping from the btree node cache and using the btree node
544 * open bucket reserve:
546 ret = bch2_btree_cache_cannibalize_lock(c, cl);
548 bch2_disk_reservation_put(c, &disk_res);
552 reserve = mempool_alloc(&c->btree_reserve_pool, GFP_NOIO);
554 reserve->disk_res = disk_res;
557 while (reserve->nr < nr_nodes) {
558 b = __bch2_btree_node_alloc(c, &disk_res,
559 flags & BTREE_INSERT_NOWAIT
566 ret = bch2_mark_bkey_replicas(c, bkey_i_to_s_c(&b->key));
570 reserve->b[reserve->nr++] = b;
573 bch2_btree_cache_cannibalize_unlock(c);
576 bch2_btree_reserve_put(c, reserve);
577 bch2_btree_cache_cannibalize_unlock(c);
578 trace_btree_reserve_get_fail(c, nr_nodes, cl);
582 /* Asynchronous interior node update machinery */
584 static void bch2_btree_update_free(struct btree_update *as)
586 struct bch_fs *c = as->c;
588 bch2_journal_pin_flush(&c->journal, &as->journal);
590 BUG_ON(as->nr_new_nodes);
591 BUG_ON(as->nr_pending);
594 bch2_btree_reserve_put(c, as->reserve);
596 mutex_lock(&c->btree_interior_update_lock);
599 closure_debug_destroy(&as->cl);
600 mempool_free(as, &c->btree_interior_update_pool);
602 closure_wake_up(&c->btree_interior_update_wait);
603 mutex_unlock(&c->btree_interior_update_lock);
606 static void btree_update_nodes_reachable(struct closure *cl)
608 struct btree_update *as = container_of(cl, struct btree_update, cl);
609 struct bch_fs *c = as->c;
611 bch2_journal_pin_drop(&c->journal, &as->journal);
613 mutex_lock(&c->btree_interior_update_lock);
615 while (as->nr_new_nodes) {
616 struct btree *b = as->new_nodes[--as->nr_new_nodes];
618 BUG_ON(b->will_make_reachable != (unsigned long) as);
619 b->will_make_reachable = 0;
620 mutex_unlock(&c->btree_interior_update_lock);
623 * b->will_make_reachable prevented it from being written, so
624 * write it now if it needs to be written:
626 btree_node_lock_type(c, b, SIX_LOCK_read);
627 bch2_btree_node_write_cond(c, b, btree_node_need_write(b));
628 six_unlock_read(&b->lock);
629 mutex_lock(&c->btree_interior_update_lock);
632 while (as->nr_pending)
633 bch2_btree_node_free_ondisk(c, &as->pending[--as->nr_pending]);
635 mutex_unlock(&c->btree_interior_update_lock);
637 closure_wake_up(&as->wait);
639 bch2_btree_update_free(as);
642 static void btree_update_wait_on_journal(struct closure *cl)
644 struct btree_update *as = container_of(cl, struct btree_update, cl);
645 struct bch_fs *c = as->c;
648 ret = bch2_journal_open_seq_async(&c->journal, as->journal_seq, cl);
649 if (ret == -EAGAIN) {
650 continue_at(cl, btree_update_wait_on_journal, system_wq);
656 bch2_journal_flush_seq_async(&c->journal, as->journal_seq, cl);
658 continue_at(cl, btree_update_nodes_reachable, system_wq);
661 static void btree_update_nodes_written(struct closure *cl)
663 struct btree_update *as = container_of(cl, struct btree_update, cl);
664 struct bch_fs *c = as->c;
668 * We did an update to a parent node where the pointers we added pointed
669 * to child nodes that weren't written yet: now, the child nodes have
670 * been written so we can write out the update to the interior node.
672 mutex_lock(&c->btree_interior_update_lock);
673 as->nodes_written = true;
675 as = list_first_entry_or_null(&c->btree_interior_updates_unwritten,
676 struct btree_update, unwritten_list);
677 if (!as || !as->nodes_written) {
678 mutex_unlock(&c->btree_interior_update_lock);
683 case BTREE_INTERIOR_NO_UPDATE:
685 case BTREE_INTERIOR_UPDATING_NODE:
686 /* The usual case: */
687 b = READ_ONCE(as->b);
689 if (!six_trylock_read(&b->lock)) {
690 mutex_unlock(&c->btree_interior_update_lock);
691 btree_node_lock_type(c, b, SIX_LOCK_read);
692 six_unlock_read(&b->lock);
693 mutex_lock(&c->btree_interior_update_lock);
697 BUG_ON(!btree_node_dirty(b));
698 closure_wait(&btree_current_write(b)->wait, &as->cl);
700 list_del(&as->write_blocked_list);
703 * for flush_held_btree_writes() waiting on updates to flush or
704 * nodes to be writeable:
706 closure_wake_up(&c->btree_interior_update_wait);
708 list_del(&as->unwritten_list);
709 mutex_unlock(&c->btree_interior_update_lock);
712 * b->write_blocked prevented it from being written, so
713 * write it now if it needs to be written:
715 bch2_btree_node_write_cond(c, b, true);
716 six_unlock_read(&b->lock);
717 continue_at(&as->cl, btree_update_nodes_reachable, system_wq);
720 case BTREE_INTERIOR_UPDATING_AS:
722 * The btree node we originally updated has been freed and is
723 * being rewritten - so we need to write anything here, we just
724 * need to signal to that btree_update that it's ok to make the
725 * new replacement node visible:
727 closure_put(&as->parent_as->cl);
730 * and then we have to wait on that btree_update to finish:
732 closure_wait(&as->parent_as->wait, &as->cl);
734 list_del(&as->unwritten_list);
735 mutex_unlock(&c->btree_interior_update_lock);
737 continue_at(&as->cl, btree_update_nodes_reachable, system_wq);
740 case BTREE_INTERIOR_UPDATING_ROOT:
741 /* b is the new btree root: */
742 b = READ_ONCE(as->b);
744 if (!six_trylock_read(&b->lock)) {
745 mutex_unlock(&c->btree_interior_update_lock);
746 btree_node_lock_type(c, b, SIX_LOCK_read);
747 six_unlock_read(&b->lock);
748 mutex_lock(&c->btree_interior_update_lock);
752 BUG_ON(c->btree_roots[b->btree_id].as != as);
753 c->btree_roots[b->btree_id].as = NULL;
755 bch2_btree_set_root_ondisk(c, b, WRITE);
758 * We don't have to wait anything anything here (before
759 * btree_update_nodes_reachable frees the old nodes
760 * ondisk) - we've ensured that the very next journal write will
761 * have the pointer to the new root, and before the allocator
762 * can reuse the old nodes it'll have to do a journal commit:
764 six_unlock_read(&b->lock);
766 list_del(&as->unwritten_list);
767 mutex_unlock(&c->btree_interior_update_lock);
770 * Bit of funny circularity going on here we have to break:
772 * We have to drop our journal pin before writing the journal
773 * entry that points to the new btree root: else, we could
774 * deadlock if the journal currently happens to be full.
776 * This mean we're dropping the journal pin _before_ the new
777 * nodes are technically reachable - but this is safe, because
778 * after the bch2_btree_set_root_ondisk() call above they will
779 * be reachable as of the very next journal write:
781 bch2_journal_pin_drop(&c->journal, &as->journal);
783 as->journal_seq = bch2_journal_last_unwritten_seq(&c->journal);
785 btree_update_wait_on_journal(&as->cl);
789 mutex_lock(&c->btree_interior_update_lock);
794 * We're updating @b with pointers to nodes that haven't finished writing yet:
795 * block @b from being written until @as completes
797 static void btree_update_updated_node(struct btree_update *as, struct btree *b)
799 struct bch_fs *c = as->c;
801 mutex_lock(&c->btree_interior_update_lock);
802 list_add_tail(&as->unwritten_list, &c->btree_interior_updates_unwritten);
804 BUG_ON(as->mode != BTREE_INTERIOR_NO_UPDATE);
805 BUG_ON(!btree_node_dirty(b));
807 as->mode = BTREE_INTERIOR_UPDATING_NODE;
809 list_add(&as->write_blocked_list, &b->write_blocked);
811 mutex_unlock(&c->btree_interior_update_lock);
814 * In general, when you're staging things in a journal that will later
815 * be written elsewhere, and you also want to guarantee ordering: that
816 * is, if you have updates a, b, c, after a crash you should never see c
817 * and not a or b - there's a problem:
819 * If the final destination of the update(s) (i.e. btree node) can be
820 * written/flushed _before_ the relevant journal entry - oops, that
821 * breaks ordering, since the various leaf nodes can be written in any
824 * Normally we use bset->journal_seq to deal with this - if during
825 * recovery we find a btree node write that's newer than the newest
826 * journal entry, we just ignore it - we don't need it, anything we're
827 * supposed to have (that we reported as completed via fsync()) will
828 * still be in the journal, and as far as the state of the journal is
829 * concerned that btree node write never happened.
831 * That breaks when we're rewriting/splitting/merging nodes, since we're
832 * mixing btree node writes that haven't happened yet with previously
833 * written data that has been reported as completed to the journal.
835 * Thus, before making the new nodes reachable, we have to wait the
836 * newest journal sequence number we have data for to be written (if it
839 bch2_journal_wait_on_seq(&c->journal, as->journal_seq, &as->cl);
842 static void interior_update_flush(struct journal *j,
843 struct journal_entry_pin *pin, u64 seq)
845 struct btree_update *as =
846 container_of(pin, struct btree_update, journal);
848 bch2_journal_flush_seq_async(j, as->journal_seq, NULL);
851 static void btree_update_reparent(struct btree_update *as,
852 struct btree_update *child)
854 struct bch_fs *c = as->c;
857 child->mode = BTREE_INTERIOR_UPDATING_AS;
858 child->parent_as = as;
859 closure_get(&as->cl);
862 * When we write a new btree root, we have to drop our journal pin
863 * _before_ the new nodes are technically reachable; see
864 * btree_update_nodes_written().
866 * This goes for journal pins that are recursively blocked on us - so,
867 * just transfer the journal pin to the new interior update so
868 * btree_update_nodes_written() can drop it.
870 bch2_journal_pin_copy(&c->journal, &as->journal,
871 &child->journal, interior_update_flush);
872 bch2_journal_pin_drop(&c->journal, &child->journal);
874 as->journal_seq = max(as->journal_seq, child->journal_seq);
877 static void btree_update_updated_root(struct btree_update *as)
879 struct bch_fs *c = as->c;
880 struct btree_root *r = &c->btree_roots[as->btree_id];
882 mutex_lock(&c->btree_interior_update_lock);
883 list_add_tail(&as->unwritten_list, &c->btree_interior_updates_unwritten);
885 BUG_ON(as->mode != BTREE_INTERIOR_NO_UPDATE);
888 * Old root might not be persistent yet - if so, redirect its
889 * btree_update operation to point to us:
892 btree_update_reparent(as, r->as);
894 as->mode = BTREE_INTERIOR_UPDATING_ROOT;
898 mutex_unlock(&c->btree_interior_update_lock);
901 * When we're rewriting nodes and updating interior nodes, there's an
902 * issue with updates that haven't been written in the journal getting
903 * mixed together with older data - see btree_update_updated_node()
904 * for the explanation.
906 * However, this doesn't affect us when we're writing a new btree root -
907 * because to make that new root reachable we have to write out a new
908 * journal entry, which must necessarily be newer than as->journal_seq.
912 static void btree_node_will_make_reachable(struct btree_update *as,
915 struct bch_fs *c = as->c;
917 mutex_lock(&c->btree_interior_update_lock);
918 BUG_ON(as->nr_new_nodes >= ARRAY_SIZE(as->new_nodes));
919 BUG_ON(b->will_make_reachable);
921 as->new_nodes[as->nr_new_nodes++] = b;
922 b->will_make_reachable = 1UL|(unsigned long) as;
924 closure_get(&as->cl);
925 mutex_unlock(&c->btree_interior_update_lock);
928 static void btree_update_drop_new_node(struct bch_fs *c, struct btree *b)
930 struct btree_update *as;
934 mutex_lock(&c->btree_interior_update_lock);
935 v = xchg(&b->will_make_reachable, 0);
936 as = (struct btree_update *) (v & ~1UL);
939 mutex_unlock(&c->btree_interior_update_lock);
943 for (i = 0; i < as->nr_new_nodes; i++)
944 if (as->new_nodes[i] == b)
949 array_remove_item(as->new_nodes, as->nr_new_nodes, i);
950 mutex_unlock(&c->btree_interior_update_lock);
953 closure_put(&as->cl);
956 static void btree_interior_update_add_node_reference(struct btree_update *as,
959 struct bch_fs *c = as->c;
960 struct pending_btree_node_free *d;
962 mutex_lock(&c->btree_interior_update_lock);
964 /* Add this node to the list of nodes being freed: */
965 BUG_ON(as->nr_pending >= ARRAY_SIZE(as->pending));
967 d = &as->pending[as->nr_pending++];
968 d->index_update_done = false;
969 d->seq = b->data->keys.seq;
970 d->btree_id = b->btree_id;
972 bkey_copy(&d->key, &b->key);
974 mutex_unlock(&c->btree_interior_update_lock);
978 * @b is being split/rewritten: it may have pointers to not-yet-written btree
979 * nodes and thus outstanding btree_updates - redirect @b's
980 * btree_updates to point to this btree_update:
982 void bch2_btree_interior_update_will_free_node(struct btree_update *as,
985 struct bch_fs *c = as->c;
986 struct closure *cl, *cl_n;
987 struct btree_update *p, *n;
988 struct btree_write *w;
991 set_btree_node_dying(b);
993 if (btree_node_fake(b))
996 btree_interior_update_add_node_reference(as, b);
999 * Does this node have data that hasn't been written in the journal?
1001 * If so, we have to wait for the corresponding journal entry to be
1002 * written before making the new nodes reachable - we can't just carry
1003 * over the bset->journal_seq tracking, since we'll be mixing those keys
1004 * in with keys that aren't in the journal anymore:
1007 as->journal_seq = max(as->journal_seq,
1008 le64_to_cpu(bset(b, t)->journal_seq));
1010 mutex_lock(&c->btree_interior_update_lock);
1013 * Does this node have any btree_update operations preventing
1014 * it from being written?
1016 * If so, redirect them to point to this btree_update: we can
1017 * write out our new nodes, but we won't make them visible until those
1018 * operations complete
1020 list_for_each_entry_safe(p, n, &b->write_blocked, write_blocked_list) {
1021 list_del(&p->write_blocked_list);
1022 btree_update_reparent(as, p);
1025 * for flush_held_btree_writes() waiting on updates to flush or
1026 * nodes to be writeable:
1028 closure_wake_up(&c->btree_interior_update_wait);
1031 clear_btree_node_dirty(b);
1032 clear_btree_node_need_write(b);
1033 w = btree_current_write(b);
1036 * Does this node have any btree_update operations waiting on this node
1039 * If so, wake them up when this btree_update operation is reachable:
1041 llist_for_each_entry_safe(cl, cl_n, llist_del_all(&w->wait.list), list)
1042 llist_add(&cl->list, &as->wait.list);
1045 * Does this node have unwritten data that has a pin on the journal?
1047 * If so, transfer that pin to the btree_update operation -
1048 * note that if we're freeing multiple nodes, we only need to keep the
1049 * oldest pin of any of the nodes we're freeing. We'll release the pin
1050 * when the new nodes are persistent and reachable on disk:
1052 bch2_journal_pin_copy(&c->journal, &as->journal,
1053 &w->journal, interior_update_flush);
1054 bch2_journal_pin_drop(&c->journal, &w->journal);
1056 w = btree_prev_write(b);
1057 bch2_journal_pin_copy(&c->journal, &as->journal,
1058 &w->journal, interior_update_flush);
1059 bch2_journal_pin_drop(&c->journal, &w->journal);
1061 mutex_unlock(&c->btree_interior_update_lock);
1064 void bch2_btree_update_done(struct btree_update *as)
1066 BUG_ON(as->mode == BTREE_INTERIOR_NO_UPDATE);
1068 bch2_btree_reserve_put(as->c, as->reserve);
1071 continue_at(&as->cl, btree_update_nodes_written, system_freezable_wq);
1074 struct btree_update *
1075 bch2_btree_update_start(struct bch_fs *c, enum btree_id id,
1076 unsigned nr_nodes, unsigned flags,
1079 struct btree_reserve *reserve;
1080 struct btree_update *as;
1082 reserve = bch2_btree_reserve_get(c, nr_nodes, flags, cl);
1083 if (IS_ERR(reserve))
1084 return ERR_CAST(reserve);
1086 as = mempool_alloc(&c->btree_interior_update_pool, GFP_NOIO);
1087 memset(as, 0, sizeof(*as));
1088 closure_init(&as->cl, NULL);
1090 as->mode = BTREE_INTERIOR_NO_UPDATE;
1092 as->reserve = reserve;
1093 INIT_LIST_HEAD(&as->write_blocked_list);
1095 bch2_keylist_init(&as->parent_keys, as->inline_keys);
1097 mutex_lock(&c->btree_interior_update_lock);
1098 list_add_tail(&as->list, &c->btree_interior_update_list);
1099 mutex_unlock(&c->btree_interior_update_lock);
1104 /* Btree root updates: */
1106 static void __bch2_btree_set_root_inmem(struct bch_fs *c, struct btree *b)
1108 /* Root nodes cannot be reaped */
1109 mutex_lock(&c->btree_cache.lock);
1110 list_del_init(&b->list);
1111 mutex_unlock(&c->btree_cache.lock);
1113 mutex_lock(&c->btree_root_lock);
1114 BUG_ON(btree_node_root(c, b) &&
1115 (b->level < btree_node_root(c, b)->level ||
1116 !btree_node_dying(btree_node_root(c, b))));
1118 btree_node_root(c, b) = b;
1119 mutex_unlock(&c->btree_root_lock);
1121 bch2_recalc_btree_reserve(c);
1124 static void bch2_btree_set_root_inmem(struct btree_update *as, struct btree *b)
1126 struct bch_fs *c = as->c;
1127 struct btree *old = btree_node_root(c, b);
1128 struct bch_fs_usage *fs_usage;
1130 __bch2_btree_set_root_inmem(c, b);
1132 mutex_lock(&c->btree_interior_update_lock);
1133 percpu_down_read(&c->mark_lock);
1134 fs_usage = bch2_fs_usage_scratch_get(c);
1136 bch2_mark_key_locked(c, bkey_i_to_s_c(&b->key),
1138 BTREE_TRIGGER_INSERT);
1139 if (gc_visited(c, gc_pos_btree_root(b->btree_id)))
1140 bch2_mark_key_locked(c, bkey_i_to_s_c(&b->key),
1142 BTREE_TRIGGER_INSERT|
1145 if (old && !btree_node_fake(old))
1146 bch2_btree_node_free_index(as, NULL,
1147 bkey_i_to_s_c(&old->key),
1149 bch2_fs_usage_apply(c, fs_usage, &as->reserve->disk_res, 0);
1151 bch2_fs_usage_scratch_put(c, fs_usage);
1152 percpu_up_read(&c->mark_lock);
1153 mutex_unlock(&c->btree_interior_update_lock);
1156 static void bch2_btree_set_root_ondisk(struct bch_fs *c, struct btree *b, int rw)
1158 struct btree_root *r = &c->btree_roots[b->btree_id];
1160 mutex_lock(&c->btree_root_lock);
1163 bkey_copy(&r->key, &b->key);
1164 r->level = b->level;
1167 c->btree_roots_dirty = true;
1169 mutex_unlock(&c->btree_root_lock);
1173 * bch_btree_set_root - update the root in memory and on disk
1175 * To ensure forward progress, the current task must not be holding any
1176 * btree node write locks. However, you must hold an intent lock on the
1179 * Note: This allocates a journal entry but doesn't add any keys to
1180 * it. All the btree roots are part of every journal write, so there
1181 * is nothing new to be done. This just guarantees that there is a
1184 static void bch2_btree_set_root(struct btree_update *as, struct btree *b,
1185 struct btree_iter *iter)
1187 struct bch_fs *c = as->c;
1190 trace_btree_set_root(c, b);
1191 BUG_ON(!b->written &&
1192 !test_bit(BCH_FS_HOLD_BTREE_WRITES, &c->flags));
1194 old = btree_node_root(c, b);
1197 * Ensure no one is using the old root while we switch to the
1200 bch2_btree_node_lock_write(old, iter);
1202 bch2_btree_set_root_inmem(as, b);
1204 btree_update_updated_root(as);
1207 * Unlock old root after new root is visible:
1209 * The new root isn't persistent, but that's ok: we still have
1210 * an intent lock on the new root, and any updates that would
1211 * depend on the new root would have to update the new root.
1213 bch2_btree_node_unlock_write(old, iter);
1216 /* Interior node updates: */
1218 static void bch2_insert_fixup_btree_ptr(struct btree_update *as, struct btree *b,
1219 struct btree_iter *iter,
1220 struct bkey_i *insert,
1221 struct btree_node_iter *node_iter)
1223 struct bch_fs *c = as->c;
1224 struct bch_fs_usage *fs_usage;
1225 struct bkey_packed *k;
1228 BUG_ON(insert->k.u64s > bch_btree_keys_u64s_remaining(c, b));
1230 mutex_lock(&c->btree_interior_update_lock);
1231 percpu_down_read(&c->mark_lock);
1232 fs_usage = bch2_fs_usage_scratch_get(c);
1234 bch2_mark_key_locked(c, bkey_i_to_s_c(insert),
1236 BTREE_TRIGGER_INSERT);
1238 if (gc_visited(c, gc_pos_btree_node(b)))
1239 bch2_mark_key_locked(c, bkey_i_to_s_c(insert),
1241 BTREE_TRIGGER_INSERT|
1244 while ((k = bch2_btree_node_iter_peek_all(node_iter, b)) &&
1245 bkey_iter_pos_cmp(b, k, &insert->k.p) < 0)
1246 bch2_btree_node_iter_advance(node_iter, b);
1249 * If we're overwriting, look up pending delete and mark so that gc
1250 * marks it on the pending delete list:
1252 if (k && !bkey_cmp_packed(b, k, &insert->k))
1253 bch2_btree_node_free_index(as, b,
1254 bkey_disassemble(b, k, &tmp),
1257 bch2_fs_usage_apply(c, fs_usage, &as->reserve->disk_res, 0);
1259 bch2_fs_usage_scratch_put(c, fs_usage);
1260 percpu_up_read(&c->mark_lock);
1261 mutex_unlock(&c->btree_interior_update_lock);
1263 bch2_btree_bset_insert_key(iter, b, node_iter, insert);
1264 set_btree_node_dirty(b);
1265 set_btree_node_need_write(b);
1269 * Move keys from n1 (original replacement node, now lower node) to n2 (higher
1272 static struct btree *__btree_split_node(struct btree_update *as,
1274 struct btree_iter *iter)
1276 size_t nr_packed = 0, nr_unpacked = 0;
1278 struct bset *set1, *set2;
1279 struct bkey_packed *k, *prev = NULL;
1281 n2 = bch2_btree_node_alloc(as, n1->level);
1283 n2->data->max_key = n1->data->max_key;
1284 n2->data->format = n1->format;
1285 SET_BTREE_NODE_SEQ(n2->data, BTREE_NODE_SEQ(n1->data));
1286 n2->key.k.p = n1->key.k.p;
1288 btree_node_set_format(n2, n2->data->format);
1290 set1 = btree_bset_first(n1);
1291 set2 = btree_bset_first(n2);
1294 * Has to be a linear search because we don't have an auxiliary
1299 struct bkey_packed *n = bkey_next_skip_noops(k, vstruct_last(set1));
1301 if (n == vstruct_last(set1))
1303 if (k->_data - set1->_data >= (le16_to_cpu(set1->u64s) * 3) / 5)
1317 btree_set_max(n1, bkey_unpack_pos(n1, prev));
1318 btree_set_min(n2, btree_type_successor(n1->btree_id, n1->key.k.p));
1320 set2->u64s = cpu_to_le16((u64 *) vstruct_end(set1) - (u64 *) k);
1321 set1->u64s = cpu_to_le16(le16_to_cpu(set1->u64s) - le16_to_cpu(set2->u64s));
1323 set_btree_bset_end(n1, n1->set);
1324 set_btree_bset_end(n2, n2->set);
1326 n2->nr.live_u64s = le16_to_cpu(set2->u64s);
1327 n2->nr.bset_u64s[0] = le16_to_cpu(set2->u64s);
1328 n2->nr.packed_keys = n1->nr.packed_keys - nr_packed;
1329 n2->nr.unpacked_keys = n1->nr.unpacked_keys - nr_unpacked;
1331 n1->nr.live_u64s = le16_to_cpu(set1->u64s);
1332 n1->nr.bset_u64s[0] = le16_to_cpu(set1->u64s);
1333 n1->nr.packed_keys = nr_packed;
1334 n1->nr.unpacked_keys = nr_unpacked;
1336 BUG_ON(!set1->u64s);
1337 BUG_ON(!set2->u64s);
1339 memcpy_u64s(set2->start,
1341 le16_to_cpu(set2->u64s));
1343 btree_node_reset_sib_u64s(n1);
1344 btree_node_reset_sib_u64s(n2);
1346 bch2_verify_btree_nr_keys(n1);
1347 bch2_verify_btree_nr_keys(n2);
1350 btree_node_interior_verify(n1);
1351 btree_node_interior_verify(n2);
1358 * For updates to interior nodes, we've got to do the insert before we split
1359 * because the stuff we're inserting has to be inserted atomically. Post split,
1360 * the keys might have to go in different nodes and the split would no longer be
1363 * Worse, if the insert is from btree node coalescing, if we do the insert after
1364 * we do the split (and pick the pivot) - the pivot we pick might be between
1365 * nodes that were coalesced, and thus in the middle of a child node post
1368 static void btree_split_insert_keys(struct btree_update *as, struct btree *b,
1369 struct btree_iter *iter,
1370 struct keylist *keys)
1372 struct btree_node_iter node_iter;
1373 struct bkey_i *k = bch2_keylist_front(keys);
1374 struct bkey_packed *src, *dst, *n;
1377 BUG_ON(btree_node_type(b) != BKEY_TYPE_BTREE);
1379 bch2_btree_node_iter_init(&node_iter, b, &k->k.p);
1381 while (!bch2_keylist_empty(keys)) {
1382 k = bch2_keylist_front(keys);
1384 BUG_ON(bch_keylist_u64s(keys) >
1385 bch_btree_keys_u64s_remaining(as->c, b));
1386 BUG_ON(bkey_cmp(k->k.p, b->data->min_key) < 0);
1387 BUG_ON(bkey_cmp(k->k.p, b->data->max_key) > 0);
1389 bch2_insert_fixup_btree_ptr(as, b, iter, k, &node_iter);
1390 bch2_keylist_pop_front(keys);
1394 * We can't tolerate whiteouts here - with whiteouts there can be
1395 * duplicate keys, and it would be rather bad if we picked a duplicate
1398 i = btree_bset_first(b);
1399 src = dst = i->start;
1400 while (src != vstruct_last(i)) {
1401 n = bkey_next_skip_noops(src, vstruct_last(i));
1402 if (!bkey_deleted(src)) {
1403 memmove_u64s_down(dst, src, src->u64s);
1404 dst = bkey_next(dst);
1409 i->u64s = cpu_to_le16((u64 *) dst - i->_data);
1410 set_btree_bset_end(b, b->set);
1412 BUG_ON(b->nsets != 1 ||
1413 b->nr.live_u64s != le16_to_cpu(btree_bset_first(b)->u64s));
1415 btree_node_interior_verify(b);
1418 static void btree_split(struct btree_update *as, struct btree *b,
1419 struct btree_iter *iter, struct keylist *keys,
1422 struct bch_fs *c = as->c;
1423 struct btree *parent = btree_node_parent(iter, b);
1424 struct btree *n1, *n2 = NULL, *n3 = NULL;
1425 u64 start_time = local_clock();
1427 BUG_ON(!parent && (b != btree_node_root(c, b)));
1428 BUG_ON(!btree_node_intent_locked(iter, btree_node_root(c, b)->level));
1430 bch2_btree_interior_update_will_free_node(as, b);
1432 n1 = bch2_btree_node_alloc_replacement(as, b);
1435 btree_split_insert_keys(as, n1, iter, keys);
1437 if (bset_u64s(&n1->set[0]) > BTREE_SPLIT_THRESHOLD(c)) {
1438 trace_btree_split(c, b);
1440 n2 = __btree_split_node(as, n1, iter);
1442 bch2_btree_build_aux_trees(n2);
1443 bch2_btree_build_aux_trees(n1);
1444 six_unlock_write(&n2->lock);
1445 six_unlock_write(&n1->lock);
1447 bch2_btree_node_write(c, n2, SIX_LOCK_intent);
1450 * Note that on recursive parent_keys == keys, so we
1451 * can't start adding new keys to parent_keys before emptying it
1452 * out (which we did with btree_split_insert_keys() above)
1454 bch2_keylist_add(&as->parent_keys, &n1->key);
1455 bch2_keylist_add(&as->parent_keys, &n2->key);
1458 /* Depth increases, make a new root */
1459 n3 = __btree_root_alloc(as, b->level + 1);
1461 n3->sib_u64s[0] = U16_MAX;
1462 n3->sib_u64s[1] = U16_MAX;
1464 btree_split_insert_keys(as, n3, iter, &as->parent_keys);
1466 bch2_btree_node_write(c, n3, SIX_LOCK_intent);
1469 trace_btree_compact(c, b);
1471 bch2_btree_build_aux_trees(n1);
1472 six_unlock_write(&n1->lock);
1474 bch2_keylist_add(&as->parent_keys, &n1->key);
1477 bch2_btree_node_write(c, n1, SIX_LOCK_intent);
1479 /* New nodes all written, now make them visible: */
1482 /* Split a non root node */
1483 bch2_btree_insert_node(as, parent, iter, &as->parent_keys, flags);
1485 bch2_btree_set_root(as, n3, iter);
1487 /* Root filled up but didn't need to be split */
1488 bch2_btree_set_root(as, n1, iter);
1491 bch2_open_buckets_put(c, &n1->ob);
1493 bch2_open_buckets_put(c, &n2->ob);
1495 bch2_open_buckets_put(c, &n3->ob);
1497 /* Successful split, update the iterator to point to the new nodes: */
1499 six_lock_increment(&b->lock, SIX_LOCK_intent);
1500 bch2_btree_iter_node_drop(iter, b);
1502 bch2_btree_iter_node_replace(iter, n3);
1504 bch2_btree_iter_node_replace(iter, n2);
1505 bch2_btree_iter_node_replace(iter, n1);
1508 * The old node must be freed (in memory) _before_ unlocking the new
1509 * nodes - else another thread could re-acquire a read lock on the old
1510 * node after another thread has locked and updated the new node, thus
1511 * seeing stale data:
1513 bch2_btree_node_free_inmem(c, b, iter);
1516 six_unlock_intent(&n3->lock);
1518 six_unlock_intent(&n2->lock);
1519 six_unlock_intent(&n1->lock);
1521 bch2_btree_trans_verify_locks(iter->trans);
1523 bch2_time_stats_update(&c->times[BCH_TIME_btree_node_split],
1528 bch2_btree_insert_keys_interior(struct btree_update *as, struct btree *b,
1529 struct btree_iter *iter, struct keylist *keys)
1531 struct btree_iter *linked;
1532 struct btree_node_iter node_iter;
1533 struct bkey_i *insert = bch2_keylist_front(keys);
1534 struct bkey_packed *k;
1536 /* Don't screw up @iter's position: */
1537 node_iter = iter->l[b->level].iter;
1540 * btree_split(), btree_gc_coalesce() will insert keys before
1541 * the iterator's current position - they know the keys go in
1542 * the node the iterator points to:
1544 while ((k = bch2_btree_node_iter_prev_all(&node_iter, b)) &&
1545 (bkey_cmp_packed(b, k, &insert->k) >= 0))
1548 while (!bch2_keylist_empty(keys)) {
1549 insert = bch2_keylist_front(keys);
1551 bch2_insert_fixup_btree_ptr(as, b, iter, insert, &node_iter);
1552 bch2_keylist_pop_front(keys);
1555 btree_update_updated_node(as, b);
1557 trans_for_each_iter_with_node(iter->trans, b, linked)
1558 bch2_btree_node_iter_peek(&linked->l[b->level].iter, b);
1560 bch2_btree_trans_verify_iters(iter->trans, b);
1564 * bch_btree_insert_node - insert bkeys into a given btree node
1566 * @iter: btree iterator
1567 * @keys: list of keys to insert
1568 * @hook: insert callback
1569 * @persistent: if not null, @persistent will wait on journal write
1571 * Inserts as many keys as it can into a given btree node, splitting it if full.
1572 * If a split occurred, this function will return early. This can only happen
1573 * for leaf nodes -- inserts into interior nodes have to be atomic.
1575 void bch2_btree_insert_node(struct btree_update *as, struct btree *b,
1576 struct btree_iter *iter, struct keylist *keys,
1579 struct bch_fs *c = as->c;
1580 int old_u64s = le16_to_cpu(btree_bset_last(b)->u64s);
1581 int old_live_u64s = b->nr.live_u64s;
1582 int live_u64s_added, u64s_added;
1584 BUG_ON(!btree_node_intent_locked(iter, btree_node_root(c, b)->level));
1586 BUG_ON(!as || as->b);
1587 bch2_verify_keylist_sorted(keys);
1589 if (as->must_rewrite)
1592 bch2_btree_node_lock_for_insert(c, b, iter);
1594 if (!bch2_btree_node_insert_fits(c, b, bch_keylist_u64s(keys))) {
1595 bch2_btree_node_unlock_write(b, iter);
1599 bch2_btree_insert_keys_interior(as, b, iter, keys);
1601 live_u64s_added = (int) b->nr.live_u64s - old_live_u64s;
1602 u64s_added = (int) le16_to_cpu(btree_bset_last(b)->u64s) - old_u64s;
1604 if (b->sib_u64s[0] != U16_MAX && live_u64s_added < 0)
1605 b->sib_u64s[0] = max(0, (int) b->sib_u64s[0] + live_u64s_added);
1606 if (b->sib_u64s[1] != U16_MAX && live_u64s_added < 0)
1607 b->sib_u64s[1] = max(0, (int) b->sib_u64s[1] + live_u64s_added);
1609 if (u64s_added > live_u64s_added &&
1610 bch2_maybe_compact_whiteouts(c, b))
1611 bch2_btree_iter_reinit_node(iter, b);
1613 bch2_btree_node_unlock_write(b, iter);
1615 btree_node_interior_verify(b);
1618 * when called from the btree_split path the new nodes aren't added to
1619 * the btree iterator yet, so the merge path's unlock/wait/relock dance
1622 bch2_foreground_maybe_merge(c, iter, b->level,
1623 flags|BTREE_INSERT_NOUNLOCK);
1626 btree_split(as, b, iter, keys, flags);
1629 int bch2_btree_split_leaf(struct bch_fs *c, struct btree_iter *iter,
1632 struct btree_trans *trans = iter->trans;
1633 struct btree *b = iter->l[0].b;
1634 struct btree_update *as;
1637 struct btree_iter *linked;
1640 * We already have a disk reservation and open buckets pinned; this
1641 * allocation must not block:
1643 trans_for_each_iter(trans, linked)
1644 if (linked->btree_id == BTREE_ID_EXTENTS)
1645 flags |= BTREE_INSERT_USE_RESERVE;
1647 closure_init_stack(&cl);
1649 /* Hack, because gc and splitting nodes doesn't mix yet: */
1650 if (!(flags & BTREE_INSERT_GC_LOCK_HELD) &&
1651 !down_read_trylock(&c->gc_lock)) {
1652 if (flags & BTREE_INSERT_NOUNLOCK)
1655 bch2_trans_unlock(trans);
1656 down_read(&c->gc_lock);
1658 if (!bch2_trans_relock(trans))
1663 * XXX: figure out how far we might need to split,
1664 * instead of locking/reserving all the way to the root:
1666 if (!bch2_btree_iter_upgrade(iter, U8_MAX)) {
1667 trace_trans_restart_iter_upgrade(trans->ip);
1672 as = bch2_btree_update_start(c, iter->btree_id,
1673 btree_update_reserve_required(c, b), flags,
1674 !(flags & BTREE_INSERT_NOUNLOCK) ? &cl : NULL);
1677 if (ret == -EAGAIN) {
1678 BUG_ON(flags & BTREE_INSERT_NOUNLOCK);
1679 bch2_trans_unlock(trans);
1685 btree_split(as, b, iter, NULL, flags);
1686 bch2_btree_update_done(as);
1689 * We haven't successfully inserted yet, so don't downgrade all the way
1690 * back to read locks;
1692 __bch2_btree_iter_downgrade(iter, 1);
1694 if (!(flags & BTREE_INSERT_GC_LOCK_HELD))
1695 up_read(&c->gc_lock);
1700 void __bch2_foreground_maybe_merge(struct bch_fs *c,
1701 struct btree_iter *iter,
1704 enum btree_node_sibling sib)
1706 struct btree_trans *trans = iter->trans;
1707 struct btree_update *as;
1708 struct bkey_format_state new_s;
1709 struct bkey_format new_f;
1710 struct bkey_i delete;
1711 struct btree *b, *m, *n, *prev, *next, *parent;
1716 BUG_ON(!btree_node_locked(iter, level));
1718 closure_init_stack(&cl);
1720 BUG_ON(!btree_node_locked(iter, level));
1722 b = iter->l[level].b;
1724 parent = btree_node_parent(iter, b);
1728 if (b->sib_u64s[sib] > BTREE_FOREGROUND_MERGE_THRESHOLD(c))
1731 /* XXX: can't be holding read locks */
1732 m = bch2_btree_node_get_sibling(c, iter, b, sib);
1738 /* NULL means no sibling: */
1740 b->sib_u64s[sib] = U16_MAX;
1744 if (sib == btree_prev_sib) {
1752 bch2_bkey_format_init(&new_s);
1753 __bch2_btree_calc_format(&new_s, b);
1754 __bch2_btree_calc_format(&new_s, m);
1755 new_f = bch2_bkey_format_done(&new_s);
1757 sib_u64s = btree_node_u64s_with_format(b, &new_f) +
1758 btree_node_u64s_with_format(m, &new_f);
1760 if (sib_u64s > BTREE_FOREGROUND_MERGE_HYSTERESIS(c)) {
1761 sib_u64s -= BTREE_FOREGROUND_MERGE_HYSTERESIS(c);
1763 sib_u64s += BTREE_FOREGROUND_MERGE_HYSTERESIS(c);
1766 sib_u64s = min(sib_u64s, btree_max_u64s(c));
1767 b->sib_u64s[sib] = sib_u64s;
1769 if (b->sib_u64s[sib] > BTREE_FOREGROUND_MERGE_THRESHOLD(c)) {
1770 six_unlock_intent(&m->lock);
1774 /* We're changing btree topology, doesn't mix with gc: */
1775 if (!(flags & BTREE_INSERT_GC_LOCK_HELD) &&
1776 !down_read_trylock(&c->gc_lock))
1777 goto err_cycle_gc_lock;
1779 if (!bch2_btree_iter_upgrade(iter, U8_MAX)) {
1784 as = bch2_btree_update_start(c, iter->btree_id,
1785 btree_update_reserve_required(c, parent) + 1,
1786 BTREE_INSERT_NOFAIL|
1787 BTREE_INSERT_USE_RESERVE,
1788 !(flags & BTREE_INSERT_NOUNLOCK) ? &cl : NULL);
1794 trace_btree_merge(c, b);
1796 bch2_btree_interior_update_will_free_node(as, b);
1797 bch2_btree_interior_update_will_free_node(as, m);
1799 n = bch2_btree_node_alloc(as, b->level);
1801 btree_set_min(n, prev->data->min_key);
1802 btree_set_max(n, next->data->max_key);
1803 n->data->format = new_f;
1805 btree_node_set_format(n, new_f);
1807 bch2_btree_sort_into(c, n, prev);
1808 bch2_btree_sort_into(c, n, next);
1810 bch2_btree_build_aux_trees(n);
1811 six_unlock_write(&n->lock);
1813 bkey_init(&delete.k);
1814 delete.k.p = prev->key.k.p;
1815 bch2_keylist_add(&as->parent_keys, &delete);
1816 bch2_keylist_add(&as->parent_keys, &n->key);
1818 bch2_btree_node_write(c, n, SIX_LOCK_intent);
1820 bch2_btree_insert_node(as, parent, iter, &as->parent_keys, flags);
1822 bch2_open_buckets_put(c, &n->ob);
1824 six_lock_increment(&b->lock, SIX_LOCK_intent);
1825 bch2_btree_iter_node_drop(iter, b);
1826 bch2_btree_iter_node_drop(iter, m);
1828 bch2_btree_iter_node_replace(iter, n);
1830 bch2_btree_trans_verify_iters(trans, n);
1832 bch2_btree_node_free_inmem(c, b, iter);
1833 bch2_btree_node_free_inmem(c, m, iter);
1835 six_unlock_intent(&n->lock);
1837 bch2_btree_update_done(as);
1839 if (!(flags & BTREE_INSERT_GC_LOCK_HELD))
1840 up_read(&c->gc_lock);
1842 bch2_btree_trans_verify_locks(trans);
1845 * Don't downgrade locks here: we're called after successful insert,
1846 * and the caller will downgrade locks after a successful insert
1847 * anyways (in case e.g. a split was required first)
1849 * And we're also called when inserting into interior nodes in the
1850 * split path, and downgrading to read locks in there is potentially
1857 six_unlock_intent(&m->lock);
1859 if (flags & BTREE_INSERT_NOUNLOCK)
1862 bch2_trans_unlock(trans);
1864 down_read(&c->gc_lock);
1865 up_read(&c->gc_lock);
1870 six_unlock_intent(&m->lock);
1871 if (!(flags & BTREE_INSERT_GC_LOCK_HELD))
1872 up_read(&c->gc_lock);
1874 BUG_ON(ret == -EAGAIN && (flags & BTREE_INSERT_NOUNLOCK));
1876 if ((ret == -EAGAIN || ret == -EINTR) &&
1877 !(flags & BTREE_INSERT_NOUNLOCK)) {
1878 bch2_trans_unlock(trans);
1880 ret = bch2_btree_iter_traverse(iter);
1890 static int __btree_node_rewrite(struct bch_fs *c, struct btree_iter *iter,
1891 struct btree *b, unsigned flags,
1894 struct btree *n, *parent = btree_node_parent(iter, b);
1895 struct btree_update *as;
1897 as = bch2_btree_update_start(c, iter->btree_id,
1899 ? btree_update_reserve_required(c, parent)
1903 trace_btree_gc_rewrite_node_fail(c, b);
1907 bch2_btree_interior_update_will_free_node(as, b);
1909 n = bch2_btree_node_alloc_replacement(as, b);
1911 bch2_btree_build_aux_trees(n);
1912 six_unlock_write(&n->lock);
1914 trace_btree_gc_rewrite_node(c, b);
1916 bch2_btree_node_write(c, n, SIX_LOCK_intent);
1919 bch2_keylist_add(&as->parent_keys, &n->key);
1920 bch2_btree_insert_node(as, parent, iter, &as->parent_keys, flags);
1922 bch2_btree_set_root(as, n, iter);
1925 bch2_open_buckets_put(c, &n->ob);
1927 six_lock_increment(&b->lock, SIX_LOCK_intent);
1928 bch2_btree_iter_node_drop(iter, b);
1929 bch2_btree_iter_node_replace(iter, n);
1930 bch2_btree_node_free_inmem(c, b, iter);
1931 six_unlock_intent(&n->lock);
1933 bch2_btree_update_done(as);
1938 * bch_btree_node_rewrite - Rewrite/move a btree node
1940 * Returns 0 on success, -EINTR or -EAGAIN on failure (i.e.
1941 * btree_check_reserve() has to wait)
1943 int bch2_btree_node_rewrite(struct bch_fs *c, struct btree_iter *iter,
1944 __le64 seq, unsigned flags)
1946 struct btree_trans *trans = iter->trans;
1951 flags |= BTREE_INSERT_NOFAIL;
1953 closure_init_stack(&cl);
1955 bch2_btree_iter_upgrade(iter, U8_MAX);
1957 if (!(flags & BTREE_INSERT_GC_LOCK_HELD)) {
1958 if (!down_read_trylock(&c->gc_lock)) {
1959 bch2_trans_unlock(trans);
1960 down_read(&c->gc_lock);
1965 ret = bch2_btree_iter_traverse(iter);
1969 b = bch2_btree_iter_peek_node(iter);
1970 if (!b || b->data->keys.seq != seq)
1973 ret = __btree_node_rewrite(c, iter, b, flags, &cl);
1974 if (ret != -EAGAIN &&
1978 bch2_trans_unlock(trans);
1982 bch2_btree_iter_downgrade(iter);
1984 if (!(flags & BTREE_INSERT_GC_LOCK_HELD))
1985 up_read(&c->gc_lock);
1991 static void __bch2_btree_node_update_key(struct bch_fs *c,
1992 struct btree_update *as,
1993 struct btree_iter *iter,
1994 struct btree *b, struct btree *new_hash,
1995 struct bkey_i *new_key)
1997 struct btree *parent;
2001 * Two corner cases that need to be thought about here:
2003 * @b may not be reachable yet - there might be another interior update
2004 * operation waiting on @b to be written, and we're gonna deliver the
2005 * write completion to that interior update operation _before_
2006 * persisting the new_key update
2008 * That ends up working without us having to do anything special here:
2009 * the reason is, we do kick off (and do the in memory updates) for the
2010 * update for @new_key before we return, creating a new interior_update
2013 * The new interior update operation here will in effect override the
2014 * previous one. The previous one was going to terminate - make @b
2015 * reachable - in one of two ways:
2016 * - updating the btree root pointer
2018 * no, this doesn't work. argh.
2021 if (b->will_make_reachable)
2022 as->must_rewrite = true;
2024 btree_interior_update_add_node_reference(as, b);
2027 * XXX: the rest of the update path treats this like we're actually
2028 * inserting a new node and deleting the existing node, so the
2029 * reservation needs to include enough space for @b
2031 * that is actually sketch as fuck though and I am surprised the code
2032 * seems to work like that, definitely need to go back and rework it
2033 * into something saner.
2035 * (I think @b is just getting double counted until the btree update
2036 * finishes and "deletes" @b on disk)
2038 ret = bch2_disk_reservation_add(c, &as->reserve->disk_res,
2039 c->opts.btree_node_size *
2040 bch2_bkey_nr_ptrs(bkey_i_to_s_c(new_key)),
2041 BCH_DISK_RESERVATION_NOFAIL);
2044 parent = btree_node_parent(iter, b);
2047 bkey_copy(&new_hash->key, new_key);
2048 ret = bch2_btree_node_hash_insert(&c->btree_cache,
2049 new_hash, b->level, b->btree_id);
2053 bch2_keylist_add(&as->parent_keys, new_key);
2054 bch2_btree_insert_node(as, parent, iter, &as->parent_keys, 0);
2057 mutex_lock(&c->btree_cache.lock);
2058 bch2_btree_node_hash_remove(&c->btree_cache, new_hash);
2060 bch2_btree_node_hash_remove(&c->btree_cache, b);
2062 bkey_copy(&b->key, new_key);
2063 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
2065 mutex_unlock(&c->btree_cache.lock);
2067 bkey_copy(&b->key, new_key);
2070 struct bch_fs_usage *fs_usage;
2072 BUG_ON(btree_node_root(c, b) != b);
2074 bch2_btree_node_lock_write(b, iter);
2076 mutex_lock(&c->btree_interior_update_lock);
2077 percpu_down_read(&c->mark_lock);
2078 fs_usage = bch2_fs_usage_scratch_get(c);
2080 bch2_mark_key_locked(c, bkey_i_to_s_c(new_key),
2082 BTREE_TRIGGER_INSERT);
2083 if (gc_visited(c, gc_pos_btree_root(b->btree_id)))
2084 bch2_mark_key_locked(c, bkey_i_to_s_c(new_key),
2086 BTREE_TRIGGER_INSERT||
2089 bch2_btree_node_free_index(as, NULL,
2090 bkey_i_to_s_c(&b->key),
2092 bch2_fs_usage_apply(c, fs_usage, &as->reserve->disk_res, 0);
2094 bch2_fs_usage_scratch_put(c, fs_usage);
2095 percpu_up_read(&c->mark_lock);
2096 mutex_unlock(&c->btree_interior_update_lock);
2098 if (btree_ptr_hash_val(new_key) != b->hash_val) {
2099 mutex_lock(&c->btree_cache.lock);
2100 bch2_btree_node_hash_remove(&c->btree_cache, b);
2102 bkey_copy(&b->key, new_key);
2103 ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
2105 mutex_unlock(&c->btree_cache.lock);
2107 bkey_copy(&b->key, new_key);
2110 btree_update_updated_root(as);
2111 bch2_btree_node_unlock_write(b, iter);
2114 bch2_btree_update_done(as);
2117 int bch2_btree_node_update_key(struct bch_fs *c, struct btree_iter *iter,
2119 struct bkey_i *new_key)
2121 struct btree *parent = btree_node_parent(iter, b);
2122 struct btree_update *as = NULL;
2123 struct btree *new_hash = NULL;
2127 closure_init_stack(&cl);
2129 if (!bch2_btree_iter_upgrade(iter, U8_MAX))
2132 if (!down_read_trylock(&c->gc_lock)) {
2133 bch2_trans_unlock(iter->trans);
2134 down_read(&c->gc_lock);
2136 if (!bch2_trans_relock(iter->trans)) {
2143 * check btree_ptr_hash_val() after @b is locked by
2144 * btree_iter_traverse():
2146 if (btree_ptr_hash_val(new_key) != b->hash_val) {
2147 /* bch2_btree_reserve_get will unlock */
2148 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
2150 bch2_trans_unlock(iter->trans);
2151 up_read(&c->gc_lock);
2153 down_read(&c->gc_lock);
2155 if (!bch2_trans_relock(iter->trans)) {
2161 new_hash = bch2_btree_node_mem_alloc(c);
2164 as = bch2_btree_update_start(c, iter->btree_id,
2165 parent ? btree_update_reserve_required(c, parent) : 0,
2166 BTREE_INSERT_NOFAIL|
2167 BTREE_INSERT_USE_RESERVE|
2168 BTREE_INSERT_USE_ALLOC_RESERVE,
2179 bch2_trans_unlock(iter->trans);
2180 up_read(&c->gc_lock);
2182 down_read(&c->gc_lock);
2184 if (!bch2_trans_relock(iter->trans))
2188 ret = bch2_mark_bkey_replicas(c, bkey_i_to_s_c(new_key));
2190 goto err_free_update;
2192 __bch2_btree_node_update_key(c, as, iter, b, new_hash, new_key);
2194 bch2_btree_iter_downgrade(iter);
2197 mutex_lock(&c->btree_cache.lock);
2198 list_move(&new_hash->list, &c->btree_cache.freeable);
2199 mutex_unlock(&c->btree_cache.lock);
2201 six_unlock_write(&new_hash->lock);
2202 six_unlock_intent(&new_hash->lock);
2204 up_read(&c->gc_lock);
2208 bch2_btree_update_free(as);
2215 * Only for filesystem bringup, when first reading the btree roots or allocating
2216 * btree roots when initializing a new filesystem:
2218 void bch2_btree_set_root_for_read(struct bch_fs *c, struct btree *b)
2220 BUG_ON(btree_node_root(c, b));
2222 __bch2_btree_set_root_inmem(c, b);
2225 void bch2_btree_root_alloc(struct bch_fs *c, enum btree_id id)
2231 closure_init_stack(&cl);
2234 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
2238 b = bch2_btree_node_mem_alloc(c);
2239 bch2_btree_cache_cannibalize_unlock(c);
2241 set_btree_node_fake(b);
2245 bkey_btree_ptr_init(&b->key);
2246 b->key.k.p = POS_MAX;
2247 *((u64 *) bkey_i_to_btree_ptr(&b->key)->v.start) = U64_MAX - id;
2249 bch2_bset_init_first(b, &b->data->keys);
2250 bch2_btree_build_aux_trees(b);
2253 btree_set_min(b, POS_MIN);
2254 btree_set_max(b, POS_MAX);
2255 b->data->format = bch2_btree_calc_format(b);
2256 btree_node_set_format(b, b->data->format);
2258 ret = bch2_btree_node_hash_insert(&c->btree_cache, b, b->level, b->btree_id);
2261 __bch2_btree_set_root_inmem(c, b);
2263 six_unlock_write(&b->lock);
2264 six_unlock_intent(&b->lock);
2267 ssize_t bch2_btree_updates_print(struct bch_fs *c, char *buf)
2269 struct printbuf out = _PBUF(buf, PAGE_SIZE);
2270 struct btree_update *as;
2272 mutex_lock(&c->btree_interior_update_lock);
2273 list_for_each_entry(as, &c->btree_interior_update_list, list)
2274 pr_buf(&out, "%p m %u w %u r %u j %llu\n",
2278 atomic_read(&as->cl.remaining) & CLOSURE_REMAINING_MASK,
2280 mutex_unlock(&c->btree_interior_update_lock);
2282 return out.pos - buf;
2285 size_t bch2_btree_interior_updates_nr_pending(struct bch_fs *c)
2288 struct list_head *i;
2290 mutex_lock(&c->btree_interior_update_lock);
2291 list_for_each(i, &c->btree_interior_update_list)
2293 mutex_unlock(&c->btree_interior_update_lock);