bcachefs hotfixes
cover bcachefs hotfixes
couple hotfixes to be sent to Linus this week: mostly syzbot, but the "topology errors on split after merge" was found by looping the single_device small_nodes test
Kent Overstreet (5):
bcachefs: Fix null ptr deref in bucket_gen_get()
bcachefs: Fix error handling in bch2_btree_node_prefetch()
bcachefs: Ancient versions with bad bkey_formats are no longer
supported
bcachefs: Fix topology errors on split after merge
bcachefs: Ensure BCH_FS_may_go_rw is set before exiting recovery
fs/bcachefs/bkey.c | 7 +++---- fs/bcachefs/btree_cache.c | 7 +++++-- fs/bcachefs/btree_node_scan.c | 2 +- fs/bcachefs/btree_update_interior.c | 17 ++++++++++++++--- fs/bcachefs/buckets.h | 19 +++++++++++-------- fs/bcachefs/io_read.c | 7 +++---- fs/bcachefs/io_write.c | 7 ++----- fs/bcachefs/recovery.c | 7 +++++++ fs/bcachefs/recovery_passes.c | 6 ++++++ 9 files changed, 52 insertions(+), 27 deletions(-)
Signature · 1 line
2.46.0
PATCH 1/5 bcachefs: Fix null ptr deref in bucket_gen_get()
bucket_gen() checks if we're lookup up a valid bucket and returns NULL otherwise, but bucket_gen_get() was failing to check; other callers were correct.
Also do a bit of cleanup on callers.
--- fs/bcachefs/btree_node_scan.c | 2 +- fs/bcachefs/buckets.h | 19 +++++++++++-------- fs/bcachefs/io_read.c | 7 +++---- fs/bcachefs/io_write.c | 7 ++----- 4 files changed, 17 insertions(+), 18 deletions(-)
fs/bcachefs/btree_node_scan.c +1 -1
@@ -186,7 +186,7 @@ static void try_read_btree_node(struct find_btree_nodes *f, struct bch_dev *ca, .ptrs[0].type = 1 << BCH_EXTENT_ENTRY_ptr, .ptrs[0].offset = offset, .ptrs[0].dev = ca->dev_idx, - .ptrs[0].gen = *bucket_gen(ca, sector_to_bucket(ca, offset)), + .ptrs[0].gen = bucket_gen_get(ca, sector_to_bucket(ca, offset)), };rcu_read_unlock ();
fs/bcachefs/buckets.h +11 -8
@@ -103,12 +103,18 @@ static inline u8 *bucket_gen(struct bch_dev *ca, size_t b)return gens->b + b; } -static inline u8 bucket_gen_get (struct bch_dev *ca,size_t b) +static inline int bucket_gen_get_rcu (struct bch_dev *ca,size_t b) +{ +u8 *gen =bucket_gen (ca, b); +return gen ? *gen :-1 ; +} + +static inline int bucket_gen_get (struct bch_dev *ca,size_t b) {rcu_read_lock (); -u8 gen = *bucket_gen (ca, b); +int ret =bucket_gen_get_rcu (ca, b);rcu_read_unlock (); -return gen; +return ret; } static inline size_t PTR_BUCKET_NR(const struct bch_dev *ca,
@@ -169,10 +175,8 @@ static inline int gen_after(u8 a, u8 b)static inline int dev_ptr_stale_rcu (struct bch_dev *ca,const struct bch_extent_ptr *ptr) { -u8 *gen =bucket_gen (ca,PTR_BUCKET_NR (ca, ptr)); -if (!gen) -return -1 ; -return gen_after (*gen, ptr->gen); +int gen =bucket_gen_get_rcu (ca,PTR_BUCKET_NR (ca, ptr)); +return gen <0 ? gen :gen_after (gen, ptr->gen); }/**
@@ -184,7 +188,6 @@ static inline int dev_ptr_stale(struct bch_dev *ca, const struct bch_extent_ptrrcu_read_lock ();int ret =dev_ptr_stale_rcu (ca, ptr);rcu_read_unlock (); -return ret; }
fs/bcachefs/io_read.c +3 -4
@@ -802,16 +802,15 @@ static noinline void read_from_stale_dirty_pointer(struct btree_trans *trans,PTR_BUCKET_POS (ca, &ptr), BTREE_ITER_cached); -u8 *gen =bucket_gen (ca, iter.pos.offset); -if (gen) { - +int gen =bucket_gen_get (ca, iter.pos.offset); +if (gen >=0 ) {prt_printf (&buf,"Attempting to read from stale dirty pointer:\n" );printbuf_indent_add (&buf,2 );bch2_bkey_val_to_text (&buf, c, k);prt_newline (&buf); -prt_printf (&buf,"memory gen: %u" , *gen); +prt_printf (&buf,"memory gen: %u" , gen); ret =lockrestart_do (trans,bkey_err (k =bch2_btree_iter_peek_slot (&iter)));if (!ret) {
fs/bcachefs/io_write.c +2 -5
@@ -1300,11 +1300,8 @@ static void bch2_nocow_write(struct bch_write_op *op)bucket_to_u64 (i->b), BUCKET_NOCOW_LOCK_UPDATE); -rcu_read_lock (); -u8 *gen =bucket_gen (ca, i->b.offset); - stale = !gen ?-1 :gen_after (*gen, i->gen); -rcu_read_unlock (); - +int gen =bucket_gen_get (ca, i->b.offset); + stale = gen <0 ? gen :gen_after (gen, i->gen);if (unlikely (stale)) { stale_at = i; goto err_bucket_stale;
Signature · 1 line
2.46.0
PATCH 2/5 bcachefs: Fix error handling in bch2_btree_node_prefetch()
In reply to Kent Overstreet--- fs/bcachefs/btree_cache.c | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-)
fs/bcachefs/btree_cache.c +5 -2
@@ -1312,9 +1312,12 @@ int bch2_btree_node_prefetch(struct btree_trans *trans, b =bch2_btree_node_fill (trans, path, k, btree_id, level, SIX_LOCK_read, false); -if (!IS_ERR_OR_NULL (b)) +int ret =PTR_ERR_OR_ZERO (b); +if (ret) +return ret; +if (b)six_unlock_read (&b->c.lock); -return bch2_trans_relock (trans) ?:PTR_ERR_OR_ZERO (b); +return 0 ; }void bch2_btree_node_evict (struct btree_trans *trans,const struct bkey_i *k)
Signature · 1 line
2.46.0
PATCH 3/5 bcachefs: Ancient versions with bad bkey_formats are no longer supported
In reply to Kent OverstreetSyzbot found an assertion pop, by generating an ancient filesystem version with an invalid bkey_format (with fields that can overflow) as well as packed keys that aren't representable unpacked.
This breaks key comparisons in all sorts of painful ways.
Filesystems have been automatically rewriting nodes with such invalid formats for years; we can safely drop support for them.
--- fs/bcachefs/bkey.c | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-)
fs/bcachefs/bkey.c +3 -4
@@ -643,7 +643,7 @@ int bch2_bkey_format_invalid(struct bch_fs *c,enum bch_validate_flags flags, struct printbuf *err) { - unsigned i, bits = KEY_PACKED_BITS_START; + unsigned bits = KEY_PACKED_BITS_START;if (f->nr_fields !=BKEY_NR_FIELDS ) { prt_printf(err, "incorrect number of fields: got %u, should be %u",
@@ -655,9 +655,8 @@ int bch2_bkey_format_invalid(struct bch_fs *c,* Verify that the packed format can't represent fields larger than the * unpacked format: */ -for (i =0 ; i < f->nr_fields; i++) { -if ((!c || c->sb.version_min >= bcachefs_metadata_version_snapshot) && -bch2_bkey_format_field_overflows (f, i)) { +for (unsigned i =0 ; i < f->nr_fields; i++) { +if (bch2_bkey_format_field_overflows (f, i)) {unsigned unpacked_bits = bch2_bkey_format_current.bits_per_field[i];u64 unpacked_max = ~((~0ULL <<1 ) << (unpacked_bits -1 ));unsigned packed_bits =min (64 , f->bits_per_field[i]);
Signature · 1 line
2.46.0
PATCH 4/5 bcachefs: Fix topology errors on split after merge
In reply to Kent OverstreetIf a btree split picks a pivot that's being deleted by a btree node merge, we're going to have problems.
Fix this by checking if the pivot is being deleted, the same as we check for deletions in journal replay keys.
Found by single_devic.ktest small_nodes.
--- fs/bcachefs/btree_update_interior.c | 17 ++++++++++++++--- 1 file changed, 14 insertions(+), 3 deletions(-)
fs/bcachefs/btree_update_interior.c +14 -3
@@ -1434,6 +1434,15 @@ bch2_btree_insert_keys_interior(struct btree_update *as, } } +static bool key_deleted_in_insert (struct keylist *insert_keys,struct bpos pos) +{ +if (insert_keys) +for_each_keylist_key (insert_keys, k) +if (bkey_deleted (&k->k) &&bpos_eq (k->k.p, pos)) +return true; +return false; +} +/* * Move keys from n1 (original replacement node, now lower node) to n2 (higher * node)
@@ -1441,7 +1450,8 @@ bch2_btree_insert_keys_interior(struct btree_update *as,static void __btree_split_node (struct btree_update *as,struct btree_trans *trans,struct btree *b, -struct btree *n[2 ]) +struct btree *n[2 ], +struct keylist *insert_keys) {struct bkey_packed *k;struct bpos n1_pos =POS_MIN ;
@@ -1476,7 +1486,8 @@ static void __btree_split_node(struct btree_update *as,if (b->c.level && u64s < n1_u64s && u64s + k->u64s >= n1_u64s && -bch2_key_deleted_in_journal (trans, b->c.btree_id, b->c.level, uk.p)) + (bch2_key_deleted_in_journal (trans, b->c.btree_id, b->c.level, uk.p) || +key_deleted_in_insert (insert_keys, uk.p))) n1_u64s += k->u64s; i = u64s >= n1_u64s;
@@ -1603,7 +1614,7 @@ static int btree_split(struct btree_update *as, struct btree_trans *trans, n[0 ] = n1 =bch2_btree_node_alloc (as, trans, b->c.level); n[1 ] = n2 =bch2_btree_node_alloc (as, trans, b->c.level); -__btree_split_node (as, trans, b, n); +__btree_split_node (as, trans, b, n, keys);if (keys) {btree_split_insert_keys (as, trans, path, n1, keys);
Signature · 1 line
2.46.0
PATCH 5/5 bcachefs: Ensure BCH_FS_may_go_rw is set before exiting recovery
In reply to Kent OverstreetIf BCH_FS_may_go_rw is not yet set, it indicates to the transaction commit path that updates should be done via the list of journal replay keys.
This must be set before multithreaded use commences.
--- fs/bcachefs/recovery.c | 7 +++++++ fs/bcachefs/recovery_passes.c | 6 ++++++ 2 files changed, 13 insertions(+)
fs/bcachefs/recovery.c +7 -0
@@ -862,6 +862,13 @@ int bch2_fs_recovery(struct bch_fs *c)if (ret) goto err; +/* +* Normally set by the appropriate recovery pass: when cleared, this +* indicates we're in early recovery and btree updates should be done by +* being applied to the journal replay keys. _Must_ be cleared before +* multithreaded use: +*/ +set_bit (BCH_FS_may_go_rw, &c->flags);clear_bit (BCH_FS_fsck_running, &c->flags);/* in case we don't run journal replay, i.e. norecovery mode */
fs/bcachefs/recovery_passes.c +6 -0
@@ -221,6 +221,12 @@ int bch2_run_recovery_passes(struct bch_fs *c) {int ret =0 ; +/* +* We can't allow set_may_go_rw to be excluded; that would cause us to +* use the journal replay keys for updates where it's not expected. +*/ + c->opts.recovery_passes_exclude &= ~BCH_RECOVERY_PASS_set_may_go_rw; +while (c->curr_recovery_pass <ARRAY_SIZE (recovery_pass_fns)) {if (c->opts.recovery_pass_last && c->curr_recovery_pass > c->opts.recovery_pass_last)
Signature · 1 line
2.46.0