bcachefs: Assorted fixes for clang
authorKent Overstreet <kent.overstreet@linux.dev>
Wed, 2 Aug 2023 00:06:45 +0000 (20:06 -0400)
committerKent Overstreet <kent.overstreet@linux.dev>
Sun, 22 Oct 2023 21:10:09 +0000 (17:10 -0400)
clang had a few more warnings about enum conversion, and also didn't
like the opts.c initializer.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
14 files changed:
fs/bcachefs/alloc_background.c
fs/bcachefs/alloc_foreground.c
fs/bcachefs/alloc_types.h
fs/bcachefs/bcachefs_format.h
fs/bcachefs/btree_iter.c
fs/bcachefs/btree_locking.c
fs/bcachefs/btree_locking.h
fs/bcachefs/btree_update_interior.c
fs/bcachefs/btree_update_leaf.c
fs/bcachefs/darray.h
fs/bcachefs/ec.c
fs/bcachefs/ec.h
fs/bcachefs/opts.c
fs/bcachefs/super-io.c

index 1f6a518cbe366a85b5e1c6eeb9d4a6e46ad61ca4..18b97416750fd68b9f01eb16228bfeafff9eaa40 100644 (file)
@@ -79,36 +79,6 @@ static inline u64 alloc_field_v1_get(const struct bch_alloc *a,
        return v;
 }
 
-static inline void alloc_field_v1_put(struct bkey_i_alloc *a, void **p,
-                                     unsigned field, u64 v)
-{
-       unsigned bytes = BCH_ALLOC_V1_FIELD_BYTES[field];
-
-       if (!v)
-               return;
-
-       a->v.fields |= 1 << field;
-
-       switch (bytes) {
-       case 1:
-               *((u8 *) *p) = v;
-               break;
-       case 2:
-               *((__le16 *) *p) = cpu_to_le16(v);
-               break;
-       case 4:
-               *((__le32 *) *p) = cpu_to_le32(v);
-               break;
-       case 8:
-               *((__le64 *) *p) = cpu_to_le64(v);
-               break;
-       default:
-               BUG();
-       }
-
-       *p += bytes;
-}
-
 static void bch2_alloc_unpack_v1(struct bkey_alloc_unpacked *out,
                                 struct bkey_s_c k)
 {
@@ -1334,7 +1304,7 @@ static int bch2_check_discard_freespace_key(struct btree_trans *trans,
                                            struct btree_iter *iter,
                                            struct bpos end)
 {
-       if (!btree_node_type_is_extents(iter->btree_id)) {
+       if (!btree_id_is_extents(iter->btree_id)) {
                return __bch2_check_discard_freespace_key(trans, iter);
        } else {
                int ret = 0;
index fcb7311b184463313b965b01ef1785c1bdc09c43..1f4c5b38562d9cabb4b886b794c9750d7e64b1a8 100644 (file)
@@ -1042,8 +1042,12 @@ static bool should_drop_bucket(struct open_bucket *ob, struct bch_fs *c,
                unsigned i;
 
                if (!drop && ob->ec) {
+                       unsigned nr_blocks;
+
                        mutex_lock(&ob->ec->lock);
-                       for (i = 0; i < ob->ec->new_stripe.key.v.nr_blocks; i++) {
+                       nr_blocks = bkey_i_to_stripe(&ob->ec->new_stripe.key)->v.nr_blocks;
+
+                       for (i = 0; i < nr_blocks; i++) {
                                if (!ob->ec->blocks[i])
                                        continue;
 
index c33a29954e59a4f25f374f11a1003bed9c7dacfb..804a843f23c16ea4100baba6690d589ab98368e1 100644 (file)
@@ -32,7 +32,7 @@ enum bch_watermark {
 };
 
 #define BCH_WATERMARK_BITS     3
-#define BCH_WATERMARK_MASK     ~(~0 << BCH_WATERMARK_BITS)
+#define BCH_WATERMARK_MASK     ~(~0U << BCH_WATERMARK_BITS)
 
 #define OPEN_BUCKETS_COUNT     1024
 
index 4e0673c668d35d5149d080fa41c62bd54299c812..b771d80f636186f27bb524efc0fb0b06088f45f3 100644 (file)
@@ -2138,7 +2138,7 @@ struct jset_entry_dev_usage {
        __le64                  _buckets_unavailable; /* No longer used */
 
        struct jset_entry_dev_usage_type d[];
-} __packed;
+};
 
 static inline unsigned jset_entry_dev_usage_nr_types(struct jset_entry_dev_usage *u)
 {
index d16331620ab98c7039e8e149e6cf44bad428c493..ecc123b2d1b356d4f25ee8473d2f583c87f79df6 100644 (file)
@@ -35,18 +35,6 @@ static inline unsigned long btree_iter_ip_allocated(struct btree_iter *iter)
 
 static struct btree_path *btree_path_alloc(struct btree_trans *, struct btree_path *);
 
-/*
- * Unlocks before scheduling
- * Note: does not revalidate iterator
- */
-static inline int bch2_trans_cond_resched(struct btree_trans *trans)
-{
-       if (need_resched() || race_fault())
-               return drop_locks_do(trans, (schedule(), 0));
-       else
-               return 0;
-}
-
 static inline int __btree_path_cmp(const struct btree_path *l,
                                   enum btree_id        r_btree_id,
                                   bool                 r_cached,
@@ -2732,16 +2720,6 @@ void bch2_trans_iter_exit(struct btree_trans *trans, struct btree_iter *iter)
        iter->key_cache_path = NULL;
 }
 
-static inline void bch2_trans_iter_init_inlined(struct btree_trans *trans,
-                         struct btree_iter *iter,
-                         unsigned btree_id, struct bpos pos,
-                         unsigned flags)
-{
-       bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
-                              bch2_btree_iter_flags(trans, btree_id, flags),
-                              _RET_IP_);
-}
-
 void bch2_trans_iter_init_outlined(struct btree_trans *trans,
                          struct btree_iter *iter,
                          enum btree_id btree_id, struct bpos pos,
index dfdf46eb3e6d71560ac52476070e55e6cf916a37..40c8ed8f7bf187ddd83974bce2d32236b5942973 100644 (file)
@@ -388,7 +388,7 @@ int __bch2_btree_node_lock_write(struct btree_trans *trans, struct btree_path *p
        six_lock_readers_add(&b->lock, readers);
 
        if (ret)
-               mark_btree_node_locked_noreset(path, b->level, SIX_LOCK_intent);
+               mark_btree_node_locked_noreset(path, b->level, BTREE_NODE_INTENT_LOCKED);
 
        return ret;
 }
@@ -552,7 +552,7 @@ bool bch2_btree_node_upgrade(struct btree_trans *trans,
        trace_and_count(trans->c, btree_path_upgrade_fail, trans, _RET_IP_, path, level);
        return false;
 success:
-       mark_btree_node_locked_noreset(path, level, SIX_LOCK_intent);
+       mark_btree_node_locked_noreset(path, level, BTREE_NODE_INTENT_LOCKED);
        return true;
 }
 
@@ -667,7 +667,7 @@ void __bch2_btree_path_downgrade(struct btree_trans *trans,
                } else {
                        if (btree_node_intent_locked(path, l)) {
                                six_lock_downgrade(&path->l[l].b->c.lock);
-                               mark_btree_node_locked_noreset(path, l, SIX_LOCK_read);
+                               mark_btree_node_locked_noreset(path, l, BTREE_NODE_READ_LOCKED);
                        }
                        break;
                }
index 78daa494c9141b5335109124054a066143e1bad8..22e2cd3914a524c574bbf9e07451a5d13df7d159 100644 (file)
@@ -180,7 +180,7 @@ bch2_btree_node_unlock_write_inlined(struct btree_trans *trans, struct btree_pat
        EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock));
        EBUG_ON(btree_node_locked_type(path, b->c.level) != SIX_LOCK_write);
 
-       mark_btree_node_locked_noreset(path, b->c.level, SIX_LOCK_intent);
+       mark_btree_node_locked_noreset(path, b->c.level, BTREE_NODE_INTENT_LOCKED);
 
        trans_for_each_path_with_node(trans, b, linked)
                linked->l[b->c.level].lock_seq++;
@@ -293,7 +293,7 @@ static inline int __btree_node_lock_write(struct btree_trans *trans,
         * write lock: thus, we need to tell the cycle detector we have a write
         * lock _before_ taking the lock:
         */
-       mark_btree_node_locked_noreset(path, b->level, SIX_LOCK_write);
+       mark_btree_node_locked_noreset(path, b->level, BTREE_NODE_WRITE_LOCKED);
 
        return likely(six_trylock_write(&b->lock))
                ? 0
index 3659b2c08109b71bb09e5d7fc166b6f049e92ab2..f42ef46c59df6f423b524d4d0056e89af72f041b 100644 (file)
@@ -188,7 +188,7 @@ static void bch2_btree_node_free_inmem(struct btree_trans *trans,
        bch2_btree_node_hash_remove(&c->btree_cache, b);
        __btree_node_free(c, b);
        six_unlock_write(&b->c.lock);
-       mark_btree_node_locked_noreset(path, level, SIX_LOCK_intent);
+       mark_btree_node_locked_noreset(path, level, BTREE_NODE_INTENT_LOCKED);
 
        trans_for_each_path(trans, path)
                if (path->l[level].b == b) {
@@ -720,7 +720,7 @@ err:
 
                mutex_unlock(&c->btree_interior_update_lock);
 
-               mark_btree_node_locked_noreset(path, b->c.level, SIX_LOCK_intent);
+               mark_btree_node_locked_noreset(path, b->c.level, BTREE_NODE_INTENT_LOCKED);
                six_unlock_write(&b->c.lock);
 
                btree_node_write_if_need(c, b, SIX_LOCK_intent);
index afe89324dfef267f17f1bbf41ba4cfd2ea7b83bf..369e37a415f3c61733ff83a494c07d0cb9b3a34c 100644 (file)
@@ -413,7 +413,7 @@ static int run_one_mem_trigger(struct btree_trans *trans,
        if (unlikely(flags & BTREE_TRIGGER_NORUN))
                return 0;
 
-       if (!btree_node_type_needs_gc(i->btree_id))
+       if (!btree_node_type_needs_gc((enum btree_node_type) i->btree_id))
                return 0;
 
        if (old_ops->atomic_trigger == new_ops->atomic_trigger &&
index d4485fa01b2aeec465a2f1a8bf94079aef16b3f6..114f86b45fd52ffc0e3be365f7eb4109e0358fdc 100644 (file)
@@ -59,13 +59,13 @@ static inline int __darray_make_room(darray_void *d, size_t t_size, size_t more,
 #define darray_first(_d)       ((_d).data[0])
 #define darray_last(_d)                ((_d).data[(_d).nr - 1])
 
-#define darray_insert_item(_d, _pos, _item)                            \
+#define darray_insert_item(_d, pos, _item)                             \
 ({                                                                     \
-       size_t pos = (_pos);                                            \
+       size_t _pos = (pos);                                            \
        int _ret = darray_make_room((_d), 1);                           \
                                                                        \
        if (!_ret)                                                      \
-               array_insert_item((_d)->data, (_d)->nr, pos, (_item));  \
+               array_insert_item((_d)->data, (_d)->nr, _pos, (_item)); \
        _ret;                                                           \
 })
 
index efbb7cf7a5d00365d06ecf9b999bb60addf1026f..f58e84a2bf88eb09772d5da414ebdb29906f93b7 100644 (file)
@@ -200,11 +200,14 @@ static bool extent_has_stripe_ptr(struct bkey_s_c k, u64 idx)
 
 static void ec_stripe_buf_exit(struct ec_stripe_buf *buf)
 {
-       unsigned i;
+       if (buf->key.k.type == KEY_TYPE_stripe) {
+               struct bkey_i_stripe *s = bkey_i_to_stripe(&buf->key);
+               unsigned i;
 
-       for (i = 0; i < buf->key.v.nr_blocks; i++) {
-               kvpfree(buf->data[i], buf->size << 9);
-               buf->data[i] = NULL;
+               for (i = 0; i < s->v.nr_blocks; i++) {
+                       kvpfree(buf->data[i], buf->size << 9);
+                       buf->data[i] = NULL;
+               }
        }
 }
 
@@ -212,7 +215,7 @@ static void ec_stripe_buf_exit(struct ec_stripe_buf *buf)
 static int ec_stripe_buf_init(struct ec_stripe_buf *buf,
                              unsigned offset, unsigned size)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned csum_granularity = 1U << v->csum_granularity_bits;
        unsigned end = offset + size;
        unsigned i;
@@ -228,7 +231,7 @@ static int ec_stripe_buf_init(struct ec_stripe_buf *buf,
 
        memset(buf->valid, 0xFF, sizeof(buf->valid));
 
-       for (i = 0; i < buf->key.v.nr_blocks; i++) {
+       for (i = 0; i < v->nr_blocks; i++) {
                buf->data[i] = kvpmalloc(buf->size << 9, GFP_KERNEL);
                if (!buf->data[i])
                        goto err;
@@ -245,7 +248,7 @@ err:
 static struct bch_csum ec_block_checksum(struct ec_stripe_buf *buf,
                                         unsigned block, unsigned offset)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned csum_granularity = 1 << v->csum_granularity_bits;
        unsigned end = buf->offset + buf->size;
        unsigned len = min(csum_granularity, end - offset);
@@ -264,7 +267,7 @@ static struct bch_csum ec_block_checksum(struct ec_stripe_buf *buf,
 
 static void ec_generate_checksums(struct ec_stripe_buf *buf)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned i, j, csums_per_device = stripe_csums_per_device(v);
 
        if (!v->csum_type)
@@ -281,7 +284,7 @@ static void ec_generate_checksums(struct ec_stripe_buf *buf)
 
 static void ec_validate_checksums(struct bch_fs *c, struct ec_stripe_buf *buf)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned csum_granularity = 1 << v->csum_granularity_bits;
        unsigned i;
 
@@ -304,7 +307,7 @@ static void ec_validate_checksums(struct bch_fs *c, struct ec_stripe_buf *buf)
                        if (bch2_crc_cmp(want, got)) {
                                struct printbuf buf2 = PRINTBUF;
 
-                               bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(&buf->key.k_i));
+                               bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(&buf->key));
 
                                bch_err_ratelimited(c,
                                        "stripe checksum error for %ps at %u:%u: csum type %u, expected %llx got %llx\n%s",
@@ -324,7 +327,7 @@ static void ec_validate_checksums(struct bch_fs *c, struct ec_stripe_buf *buf)
 
 static void ec_generate_ec(struct ec_stripe_buf *buf)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned nr_data = v->nr_blocks - v->nr_redundant;
        unsigned bytes = le16_to_cpu(v->sectors) << 9;
 
@@ -333,13 +336,14 @@ static void ec_generate_ec(struct ec_stripe_buf *buf)
 
 static unsigned ec_nr_failed(struct ec_stripe_buf *buf)
 {
-       return buf->key.v.nr_blocks -
-               bitmap_weight(buf->valid, buf->key.v.nr_blocks);
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
+
+       return v->nr_blocks - bitmap_weight(buf->valid, v->nr_blocks);
 }
 
 static int ec_do_recov(struct bch_fs *c, struct ec_stripe_buf *buf)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned i, failed[BCH_BKEY_PTRS_MAX], nr_failed = 0;
        unsigned nr_data = v->nr_blocks - v->nr_redundant;
        unsigned bytes = buf->size << 9;
@@ -363,7 +367,7 @@ static int ec_do_recov(struct bch_fs *c, struct ec_stripe_buf *buf)
 static void ec_block_endio(struct bio *bio)
 {
        struct ec_bio *ec_bio = container_of(bio, struct ec_bio, bio);
-       struct bch_stripe *v = &ec_bio->buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&ec_bio->buf->key)->v;
        struct bch_extent_ptr *ptr = &v->ptrs[ec_bio->idx];
        struct bch_dev *ca = ec_bio->ca;
        struct closure *cl = bio->bi_private;
@@ -388,11 +392,11 @@ static void ec_block_endio(struct bio *bio)
 static void ec_block_io(struct bch_fs *c, struct ec_stripe_buf *buf,
                        blk_opf_t opf, unsigned idx, struct closure *cl)
 {
-       struct bch_stripe *v = &buf->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&buf->key)->v;
        unsigned offset = 0, bytes = buf->size << 9;
        struct bch_extent_ptr *ptr = &v->ptrs[idx];
        struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
-       enum bch_data_type data_type = idx < buf->key.v.nr_blocks - buf->key.v.nr_redundant
+       enum bch_data_type data_type = idx < v->nr_blocks - v->nr_redundant
                ? BCH_DATA_user
                : BCH_DATA_parity;
        int rw = op_is_write(opf);
@@ -463,7 +467,7 @@ static int get_stripe_key_trans(struct btree_trans *trans, u64 idx,
                ret = -ENOENT;
                goto err;
        }
-       bkey_reassemble(&stripe->key.k_i, k);
+       bkey_reassemble(&stripe->key, k);
 err:
        bch2_trans_iter_exit(trans, &iter);
        return ret;
@@ -499,7 +503,7 @@ int bch2_ec_read_extent(struct bch_fs *c, struct bch_read_bio *rbio)
                return -EIO;
        }
 
-       v = &buf->key.v;
+       v = &bkey_i_to_stripe(&buf->key)->v;
 
        if (!bch2_ptr_matches_stripe(v, rbio->pick)) {
                bch_err_ratelimited(c,
@@ -875,6 +879,7 @@ static int ec_stripe_update_extent(struct btree_trans *trans,
                                   struct ec_stripe_buf *s,
                                   struct bpos *bp_pos)
 {
+       struct bch_stripe *v = &bkey_i_to_stripe(&s->key)->v;
        struct bch_fs *c = trans->c;
        struct bch_backpointer bp;
        struct btree_iter iter;
@@ -926,7 +931,7 @@ static int ec_stripe_update_extent(struct btree_trans *trans,
        if (extent_has_stripe_ptr(k, s->key.k.p.offset))
                goto out;
 
-       ptr_c = bkey_matches_stripe(&s->key.v, k, &block);
+       ptr_c = bkey_matches_stripe(v, k, &block);
        /*
         * It doesn't generally make sense to erasure code cached ptrs:
         * XXX: should we be incrementing a counter?
@@ -934,7 +939,7 @@ static int ec_stripe_update_extent(struct btree_trans *trans,
        if (!ptr_c || ptr_c->cached)
                goto out;
 
-       dev = s->key.v.ptrs[block].dev;
+       dev = v->ptrs[block].dev;
 
        n = bch2_trans_kmalloc(trans, bkey_bytes(k.k) + sizeof(stripe_ptr));
        ret = PTR_ERR_OR_ZERO(n);
@@ -950,7 +955,7 @@ static int ec_stripe_update_extent(struct btree_trans *trans,
        stripe_ptr = (struct bch_extent_stripe_ptr) {
                .type = 1 << BCH_EXTENT_ENTRY_stripe_ptr,
                .block          = block,
-               .redundancy     = s->key.v.nr_redundant,
+               .redundancy     = v->nr_redundant,
                .idx            = s->key.k.p.offset,
        };
 
@@ -968,7 +973,8 @@ static int ec_stripe_update_bucket(struct btree_trans *trans, struct ec_stripe_b
                                   unsigned block)
 {
        struct bch_fs *c = trans->c;
-       struct bch_extent_ptr bucket = s->key.v.ptrs[block];
+       struct bch_stripe *v = &bkey_i_to_stripe(&s->key)->v;
+       struct bch_extent_ptr bucket = v->ptrs[block];
        struct bpos bucket_pos = PTR_BUCKET_POS(c, &bucket);
        struct bpos bp_pos = POS_MIN;
        int ret = 0;
@@ -993,7 +999,7 @@ static int ec_stripe_update_bucket(struct btree_trans *trans, struct ec_stripe_b
 static int ec_stripe_update_extents(struct bch_fs *c, struct ec_stripe_buf *s)
 {
        struct btree_trans trans;
-       struct bch_stripe *v = &s->key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&s->key)->v;
        unsigned i, nr_data = v->nr_blocks - v->nr_redundant;
        int ret = 0;
 
@@ -1057,7 +1063,7 @@ static void ec_stripe_create(struct ec_stripe_new *s)
 {
        struct bch_fs *c = s->c;
        struct open_bucket *ob;
-       struct bch_stripe *v = &s->new_stripe.key.v;
+       struct bch_stripe *v = &bkey_i_to_stripe(&s->new_stripe.key)->v;
        unsigned i, nr_data = v->nr_blocks - v->nr_redundant;
        int ret;
 
@@ -1090,7 +1096,7 @@ static void ec_stripe_create(struct ec_stripe_new *s)
                }
 
                for (i = 0; i < nr_data; i++)
-                       if (stripe_blockcount_get(&s->existing_stripe.key.v, i))
+                       if (stripe_blockcount_get(&bkey_i_to_stripe(&s->existing_stripe.key)->v, i))
                                swap(s->new_stripe.data[i],
                                     s->existing_stripe.data[i]);
 
@@ -1117,8 +1123,9 @@ static void ec_stripe_create(struct ec_stripe_new *s)
        ret = bch2_trans_do(c, &s->res, NULL,
                            BTREE_INSERT_NOCHECK_RW|
                            BTREE_INSERT_NOFAIL,
-                           ec_stripe_key_update(&trans, &s->new_stripe.key,
-                                                !s->have_existing_stripe));
+                           ec_stripe_key_update(&trans,
+                                       bkey_i_to_stripe(&s->new_stripe.key),
+                                       !s->have_existing_stripe));
        if (ret) {
                bch_err(c, "error creating stripe: error creating stripe key");
                goto err;
@@ -1279,14 +1286,14 @@ static bool may_create_new_stripe(struct bch_fs *c)
 }
 
 static void ec_stripe_key_init(struct bch_fs *c,
-                              struct bkey_i_stripe *s,
+                              struct bkey_i *k,
                               unsigned nr_data,
                               unsigned nr_parity,
                               unsigned stripe_size)
 {
+       struct bkey_i_stripe *s = bkey_stripe_init(k);
        unsigned u64s;
 
-       bkey_stripe_init(&s->k_i);
        s->v.sectors                    = cpu_to_le16(stripe_size);
        s->v.algorithm                  = 0;
        s->v.nr_blocks                  = nr_data + nr_parity;
@@ -1325,8 +1332,8 @@ static int ec_new_stripe_alloc(struct bch_fs *c, struct ec_stripe_head *h)
                                BCH_BKEY_PTRS_MAX) - h->redundancy;
        s->nr_parity    = h->redundancy;
 
-       ec_stripe_key_init(c, &s->new_stripe.key, s->nr_data,
-                          s->nr_parity, h->blocksize);
+       ec_stripe_key_init(c, &s->new_stripe.key,
+                          s->nr_data, s->nr_parity, h->blocksize);
 
        h->s = s;
        return 0;
@@ -1429,15 +1436,16 @@ static int new_stripe_alloc_buckets(struct btree_trans *trans, struct ec_stripe_
        struct bch_devs_mask devs = h->devs;
        struct open_bucket *ob;
        struct open_buckets buckets;
+       struct bch_stripe *v = &bkey_i_to_stripe(&h->s->new_stripe.key)->v;
        unsigned i, j, nr_have_parity = 0, nr_have_data = 0;
        bool have_cache = true;
        int ret = 0;
 
-       BUG_ON(h->s->new_stripe.key.v.nr_blocks         != h->s->nr_data + h->s->nr_parity);
-       BUG_ON(h->s->new_stripe.key.v.nr_redundant      != h->s->nr_parity);
+       BUG_ON(v->nr_blocks     != h->s->nr_data + h->s->nr_parity);
+       BUG_ON(v->nr_redundant  != h->s->nr_parity);
 
-       for_each_set_bit(i, h->s->blocks_gotten, h->s->new_stripe.key.v.nr_blocks) {
-               __clear_bit(h->s->new_stripe.key.v.ptrs[i].dev, devs.d);
+       for_each_set_bit(i, h->s->blocks_gotten, v->nr_blocks) {
+               __clear_bit(v->ptrs[i].dev, devs.d);
                if (i < h->s->nr_data)
                        nr_have_data++;
                else
@@ -1466,7 +1474,7 @@ static int new_stripe_alloc_buckets(struct btree_trans *trans, struct ec_stripe_
                        BUG_ON(j >= h->s->nr_data + h->s->nr_parity);
 
                        h->s->blocks[j] = buckets.v[i];
-                       h->s->new_stripe.key.v.ptrs[j] = bch2_ob_ptr(c, ob);
+                       v->ptrs[j] = bch2_ob_ptr(c, ob);
                        __set_bit(j, h->s->blocks_gotten);
                }
 
@@ -1492,7 +1500,7 @@ static int new_stripe_alloc_buckets(struct btree_trans *trans, struct ec_stripe_
                        BUG_ON(j >= h->s->nr_data);
 
                        h->s->blocks[j] = buckets.v[i];
-                       h->s->new_stripe.key.v.ptrs[j] = bch2_ob_ptr(c, ob);
+                       v->ptrs[j] = bch2_ob_ptr(c, ob);
                        __set_bit(j, h->s->blocks_gotten);
                }
 
@@ -1542,6 +1550,8 @@ static s64 get_existing_stripe(struct bch_fs *c,
 static int __bch2_ec_stripe_head_reuse(struct btree_trans *trans, struct ec_stripe_head *h)
 {
        struct bch_fs *c = trans->c;
+       struct bch_stripe *new_v = &bkey_i_to_stripe(&h->s->new_stripe.key)->v;
+       struct bch_stripe *existing_v;
        unsigned i;
        s64 idx;
        int ret;
@@ -1562,9 +1572,11 @@ static int __bch2_ec_stripe_head_reuse(struct btree_trans *trans, struct ec_stri
                return ret;
        }
 
-       BUG_ON(h->s->existing_stripe.key.v.nr_redundant != h->s->nr_parity);
-       h->s->nr_data = h->s->existing_stripe.key.v.nr_blocks -
-               h->s->existing_stripe.key.v.nr_redundant;
+       existing_v = &bkey_i_to_stripe(&h->s->existing_stripe.key)->v;
+
+       BUG_ON(existing_v->nr_redundant != h->s->nr_parity);
+       h->s->nr_data = existing_v->nr_blocks -
+               existing_v->nr_redundant;
 
        ret = ec_stripe_buf_init(&h->s->existing_stripe, 0, h->blocksize);
        if (ret) {
@@ -1573,21 +1585,21 @@ static int __bch2_ec_stripe_head_reuse(struct btree_trans *trans, struct ec_stri
        }
 
        BUG_ON(h->s->existing_stripe.size != h->blocksize);
-       BUG_ON(h->s->existing_stripe.size != le16_to_cpu(h->s->existing_stripe.key.v.sectors));
+       BUG_ON(h->s->existing_stripe.size != le16_to_cpu(existing_v->sectors));
 
        /*
         * Free buckets we initially allocated - they might conflict with
         * blocks from the stripe we're reusing:
         */
-       for_each_set_bit(i, h->s->blocks_gotten, h->s->new_stripe.key.v.nr_blocks) {
+       for_each_set_bit(i, h->s->blocks_gotten, new_v->nr_blocks) {
                bch2_open_bucket_put(c, c->open_buckets + h->s->blocks[i]);
                h->s->blocks[i] = 0;
        }
        memset(h->s->blocks_gotten, 0, sizeof(h->s->blocks_gotten));
        memset(h->s->blocks_allocated, 0, sizeof(h->s->blocks_allocated));
 
-       for (i = 0; i < h->s->existing_stripe.key.v.nr_blocks; i++) {
-               if (stripe_blockcount_get(&h->s->existing_stripe.key.v, i)) {
+       for (i = 0; i < existing_v->nr_blocks; i++) {
+               if (stripe_blockcount_get(existing_v, i)) {
                        __set_bit(i, h->s->blocks_gotten);
                        __set_bit(i, h->s->blocks_allocated);
                }
@@ -1595,7 +1607,7 @@ static int __bch2_ec_stripe_head_reuse(struct btree_trans *trans, struct ec_stri
                ec_block_io(c, &h->s->existing_stripe, READ, i, &h->s->iodone);
        }
 
-       bkey_copy(&h->s->new_stripe.key.k_i, &h->s->existing_stripe.key.k_i);
+       bkey_copy(&h->s->new_stripe.key, &h->s->existing_stripe.key);
        h->s->have_existing_stripe = true;
 
        return 0;
@@ -1764,7 +1776,7 @@ static void __bch2_ec_stop(struct bch_fs *c, struct bch_dev *ca)
                if (!ca)
                        goto found;
 
-               for (i = 0; i < h->s->new_stripe.key.v.nr_blocks; i++) {
+               for (i = 0; i < bkey_i_to_stripe(&h->s->new_stripe.key)->v.nr_blocks; i++) {
                        if (!h->s->blocks[i])
                                continue;
 
@@ -1922,7 +1934,7 @@ void bch2_fs_ec_exit(struct bch_fs *c)
                        break;
 
                if (h->s) {
-                       for (i = 0; i < h->s->new_stripe.key.v.nr_blocks; i++)
+                       for (i = 0; i < bkey_i_to_stripe(&h->s->new_stripe.key)->v.nr_blocks; i++)
                                BUG_ON(h->s->blocks[i]);
 
                        kfree(h->s);
index 1b1848e5fa5e78facd340cf194264f575c2952b0..885ae5d5165587e4f72312401edcf1b67dcff964 100644 (file)
@@ -138,10 +138,7 @@ struct ec_stripe_buf {
 
        void                    *data[BCH_BKEY_PTRS_MAX];
 
-       union {
-               struct bkey_i_stripe    key;
-               u64                     pad[255];
-       };
+       __BKEY_PADDED(key, 255);
 };
 
 struct ec_stripe_head;
index 3a6fd1d96ed27cc47e23ec61602c216089674d36..4d0daeba6f597212228cd3c2beba12c27eaa9ff6 100644 (file)
@@ -121,10 +121,10 @@ static void bch2_opt_fix_errors_to_text(struct printbuf *out,
        prt_str(out, bch2_fsck_fix_opts[v]);
 }
 
-static const struct bch_opt_fn bch2_opt_fix_errors = {
-       .parse = bch2_opt_fix_errors_parse,
-       .to_text = bch2_opt_fix_errors_to_text,
-};
+#define bch2_opt_fix_errors (struct bch_opt_fn) {      \
+       .parse = bch2_opt_fix_errors_parse,             \
+       .to_text = bch2_opt_fix_errors_to_text,         \
+}
 
 const char * const bch2_d_types[BCH_DT_MAX] = {
        [DT_UNKNOWN]    = "unknown",
index cea7c7caa1c0641441eaed9362f5fe6141a22e55..beb00f799fe4a4fefb0d3fedfedc6ed626b4adab 100644 (file)
@@ -265,16 +265,13 @@ struct bch_sb_field *bch2_sb_field_resize(struct bch_sb_handle *sb,
 
 /* Superblock validate: */
 
-static inline void __bch2_sb_layout_size_assert(void)
-{
-       BUILD_BUG_ON(sizeof(struct bch_sb_layout) != 512);
-}
-
 static int validate_sb_layout(struct bch_sb_layout *layout, struct printbuf *out)
 {
        u64 offset, prev_offset, max_sectors;
        unsigned i;
 
+       BUILD_BUG_ON(sizeof(struct bch_sb_layout) != 512);
+
        if (!uuid_equal(&layout->magic, &BCACHE_MAGIC) &&
            !uuid_equal(&layout->magic, &BCHFS_MAGIC)) {
                prt_printf(out, "Not a bcachefs superblock layout");