1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_cache.h"
5 #include "disk_groups.h"
8 #include "sb-members.h"
11 #define x(t, n, ...) [n] = #t,
12 static const char * const bch2_iops_measurements[] = {
13 BCH_IOPS_MEASUREMENTS()
17 char * const bch2_member_error_strs[] = {
18 BCH_MEMBER_ERROR_TYPES()
23 /* Code for bch_sb_field_members_v1: */
25 struct bch_member *bch2_members_v2_get_mut(struct bch_sb *sb, int i)
27 return __bch2_members_v2_get_mut(bch2_sb_field_get(sb, members_v2), i);
30 static struct bch_member members_v2_get(struct bch_sb_field_members_v2 *mi, int i)
32 struct bch_member ret, *p = __bch2_members_v2_get_mut(mi, i);
33 memset(&ret, 0, sizeof(ret));
34 memcpy(&ret, p, min_t(size_t, le16_to_cpu(mi->member_bytes), sizeof(ret)));
38 static struct bch_member *members_v1_get_mut(struct bch_sb_field_members_v1 *mi, int i)
40 return (void *) mi->_members + (i * BCH_MEMBER_V1_BYTES);
43 static struct bch_member members_v1_get(struct bch_sb_field_members_v1 *mi, int i)
45 struct bch_member ret, *p = members_v1_get_mut(mi, i);
46 memset(&ret, 0, sizeof(ret));
47 memcpy(&ret, p, min_t(size_t, BCH_MEMBER_V1_BYTES, sizeof(ret)));
51 struct bch_member bch2_sb_member_get(struct bch_sb *sb, int i)
53 struct bch_sb_field_members_v2 *mi2 = bch2_sb_field_get(sb, members_v2);
55 return members_v2_get(mi2, i);
56 struct bch_sb_field_members_v1 *mi1 = bch2_sb_field_get(sb, members_v1);
57 return members_v1_get(mi1, i);
60 static int sb_members_v2_resize_entries(struct bch_fs *c)
62 struct bch_sb_field_members_v2 *mi = bch2_sb_field_get(c->disk_sb.sb, members_v2);
64 if (le16_to_cpu(mi->member_bytes) < sizeof(struct bch_member)) {
65 unsigned u64s = DIV_ROUND_UP((sizeof(*mi) + sizeof(mi->_members[0]) *
66 c->disk_sb.sb->nr_devices), 8);
68 mi = bch2_sb_field_resize(&c->disk_sb, members_v2, u64s);
70 return -BCH_ERR_ENOSPC_sb_members_v2;
72 for (int i = c->disk_sb.sb->nr_devices - 1; i >= 0; --i) {
73 void *dst = (void *) mi->_members + (i * sizeof(struct bch_member));
74 memmove(dst, __bch2_members_v2_get_mut(mi, i), le16_to_cpu(mi->member_bytes));
75 memset(dst + le16_to_cpu(mi->member_bytes),
76 0, (sizeof(struct bch_member) - le16_to_cpu(mi->member_bytes)));
78 mi->member_bytes = cpu_to_le16(sizeof(struct bch_member));
83 int bch2_sb_members_v2_init(struct bch_fs *c)
85 struct bch_sb_field_members_v1 *mi1;
86 struct bch_sb_field_members_v2 *mi2;
88 if (!bch2_sb_field_get(c->disk_sb.sb, members_v2)) {
89 mi2 = bch2_sb_field_resize(&c->disk_sb, members_v2,
90 DIV_ROUND_UP(sizeof(*mi2) +
91 sizeof(struct bch_member) * c->sb.nr_devices,
93 mi1 = bch2_sb_field_get(c->disk_sb.sb, members_v1);
94 memcpy(&mi2->_members[0], &mi1->_members[0],
95 BCH_MEMBER_V1_BYTES * c->sb.nr_devices);
96 memset(&mi2->pad[0], 0, sizeof(mi2->pad));
97 mi2->member_bytes = cpu_to_le16(BCH_MEMBER_V1_BYTES);
100 return sb_members_v2_resize_entries(c);
103 int bch2_sb_members_cpy_v2_v1(struct bch_sb_handle *disk_sb)
105 struct bch_sb_field_members_v1 *mi1;
106 struct bch_sb_field_members_v2 *mi2;
108 mi1 = bch2_sb_field_resize(disk_sb, members_v1,
109 DIV_ROUND_UP(sizeof(*mi1) + BCH_MEMBER_V1_BYTES *
110 disk_sb->sb->nr_devices, sizeof(u64)));
112 return -BCH_ERR_ENOSPC_sb_members;
114 mi2 = bch2_sb_field_get(disk_sb->sb, members_v2);
116 for (unsigned i = 0; i < disk_sb->sb->nr_devices; i++)
117 memcpy(members_v1_get_mut(mi1, i), __bch2_members_v2_get_mut(mi2, i), BCH_MEMBER_V1_BYTES);
122 static int validate_member(struct printbuf *err,
127 if (le64_to_cpu(m.nbuckets) > BCH_MEMBER_NBUCKETS_MAX) {
128 prt_printf(err, "device %u: too many buckets (got %llu, max %u)",
129 i, le64_to_cpu(m.nbuckets), BCH_MEMBER_NBUCKETS_MAX);
130 return -BCH_ERR_invalid_sb_members;
133 if (le64_to_cpu(m.nbuckets) -
134 le16_to_cpu(m.first_bucket) < BCH_MIN_NR_NBUCKETS) {
135 prt_printf(err, "device %u: not enough buckets (got %llu, max %u)",
136 i, le64_to_cpu(m.nbuckets), BCH_MIN_NR_NBUCKETS);
137 return -BCH_ERR_invalid_sb_members;
140 if (le16_to_cpu(m.bucket_size) <
141 le16_to_cpu(sb->block_size)) {
142 prt_printf(err, "device %u: bucket size %u smaller than block size %u",
143 i, le16_to_cpu(m.bucket_size), le16_to_cpu(sb->block_size));
144 return -BCH_ERR_invalid_sb_members;
147 if (le16_to_cpu(m.bucket_size) <
148 BCH_SB_BTREE_NODE_SIZE(sb)) {
149 prt_printf(err, "device %u: bucket size %u smaller than btree node size %llu",
150 i, le16_to_cpu(m.bucket_size), BCH_SB_BTREE_NODE_SIZE(sb));
151 return -BCH_ERR_invalid_sb_members;
157 static void member_to_text(struct printbuf *out,
159 struct bch_sb_field_disk_groups *gi,
163 unsigned data_have = bch2_sb_dev_has_data(sb, i);
164 u64 bucket_size = le16_to_cpu(m.bucket_size);
165 u64 device_size = le64_to_cpu(m.nbuckets) * bucket_size;
167 if (!bch2_member_exists(&m))
170 prt_printf(out, "Device:");
172 prt_printf(out, "%u", i);
175 printbuf_indent_add(out, 2);
177 prt_printf(out, "Label:");
179 if (BCH_MEMBER_GROUP(&m)) {
180 unsigned idx = BCH_MEMBER_GROUP(&m) - 1;
182 if (idx < disk_groups_nr(gi))
183 prt_printf(out, "%s (%u)",
184 gi->entries[idx].label, idx);
186 prt_printf(out, "(bad disk labels section)");
188 prt_printf(out, "(none)");
192 prt_printf(out, "UUID:");
194 pr_uuid(out, m.uuid.b);
197 prt_printf(out, "Size:");
199 prt_units_u64(out, device_size << 9);
202 for (unsigned i = 0; i < BCH_MEMBER_ERROR_NR; i++) {
203 prt_printf(out, "%s errors:", bch2_member_error_strs[i]);
205 prt_u64(out, le64_to_cpu(m.errors[i]));
209 for (unsigned i = 0; i < BCH_IOPS_NR; i++) {
210 prt_printf(out, "%s iops:", bch2_iops_measurements[i]);
212 prt_printf(out, "%u", le32_to_cpu(m.iops[i]));
216 prt_printf(out, "Bucket size:");
218 prt_units_u64(out, bucket_size << 9);
221 prt_printf(out, "First bucket:");
223 prt_printf(out, "%u", le16_to_cpu(m.first_bucket));
226 prt_printf(out, "Buckets:");
228 prt_printf(out, "%llu", le64_to_cpu(m.nbuckets));
231 prt_printf(out, "Last mount:");
234 bch2_prt_datetime(out, le64_to_cpu(m.last_mount));
236 prt_printf(out, "(never)");
239 prt_printf(out, "Last superblock write:");
241 prt_u64(out, le64_to_cpu(m.seq));
244 prt_printf(out, "State:");
246 prt_printf(out, "%s",
247 BCH_MEMBER_STATE(&m) < BCH_MEMBER_STATE_NR
248 ? bch2_member_states[BCH_MEMBER_STATE(&m)]
252 prt_printf(out, "Data allowed:");
254 if (BCH_MEMBER_DATA_ALLOWED(&m))
255 prt_bitflags(out, __bch2_data_types, BCH_MEMBER_DATA_ALLOWED(&m));
257 prt_printf(out, "(none)");
260 prt_printf(out, "Has data:");
263 prt_bitflags(out, __bch2_data_types, data_have);
265 prt_printf(out, "(none)");
268 prt_str(out, "Durability:");
270 prt_printf(out, "%llu", BCH_MEMBER_DURABILITY(&m) ? BCH_MEMBER_DURABILITY(&m) - 1 : 1);
273 prt_printf(out, "Discard:");
275 prt_printf(out, "%llu", BCH_MEMBER_DISCARD(&m));
278 prt_printf(out, "Freespace initialized:");
280 prt_printf(out, "%llu", BCH_MEMBER_FREESPACE_INITIALIZED(&m));
283 printbuf_indent_sub(out, 2);
286 static int bch2_sb_members_v1_validate(struct bch_sb *sb,
287 struct bch_sb_field *f,
288 struct printbuf *err)
290 struct bch_sb_field_members_v1 *mi = field_to_type(f, members_v1);
293 if ((void *) members_v1_get_mut(mi, sb->nr_devices) > vstruct_end(&mi->field)) {
294 prt_printf(err, "too many devices for section size");
295 return -BCH_ERR_invalid_sb_members;
298 for (i = 0; i < sb->nr_devices; i++) {
299 struct bch_member m = members_v1_get(mi, i);
301 int ret = validate_member(err, m, sb, i);
309 static void bch2_sb_members_v1_to_text(struct printbuf *out, struct bch_sb *sb,
310 struct bch_sb_field *f)
312 struct bch_sb_field_members_v1 *mi = field_to_type(f, members_v1);
313 struct bch_sb_field_disk_groups *gi = bch2_sb_field_get(sb, disk_groups);
316 for (i = 0; i < sb->nr_devices; i++)
317 member_to_text(out, members_v1_get(mi, i), gi, sb, i);
320 const struct bch_sb_field_ops bch_sb_field_ops_members_v1 = {
321 .validate = bch2_sb_members_v1_validate,
322 .to_text = bch2_sb_members_v1_to_text,
325 static void bch2_sb_members_v2_to_text(struct printbuf *out, struct bch_sb *sb,
326 struct bch_sb_field *f)
328 struct bch_sb_field_members_v2 *mi = field_to_type(f, members_v2);
329 struct bch_sb_field_disk_groups *gi = bch2_sb_field_get(sb, disk_groups);
332 for (i = 0; i < sb->nr_devices; i++)
333 member_to_text(out, members_v2_get(mi, i), gi, sb, i);
336 static int bch2_sb_members_v2_validate(struct bch_sb *sb,
337 struct bch_sb_field *f,
338 struct printbuf *err)
340 struct bch_sb_field_members_v2 *mi = field_to_type(f, members_v2);
341 size_t mi_bytes = (void *) __bch2_members_v2_get_mut(mi, sb->nr_devices) -
344 if (mi_bytes > vstruct_bytes(&mi->field)) {
345 prt_printf(err, "section too small (%zu > %zu)",
346 mi_bytes, vstruct_bytes(&mi->field));
347 return -BCH_ERR_invalid_sb_members;
350 for (unsigned i = 0; i < sb->nr_devices; i++) {
351 int ret = validate_member(err, members_v2_get(mi, i), sb, i);
359 const struct bch_sb_field_ops bch_sb_field_ops_members_v2 = {
360 .validate = bch2_sb_members_v2_validate,
361 .to_text = bch2_sb_members_v2_to_text,
364 void bch2_sb_members_from_cpu(struct bch_fs *c)
366 struct bch_sb_field_members_v2 *mi = bch2_sb_field_get(c->disk_sb.sb, members_v2);
369 for_each_member_device_rcu(c, ca, NULL) {
370 struct bch_member *m = __bch2_members_v2_get_mut(mi, ca->dev_idx);
372 for (unsigned e = 0; e < BCH_MEMBER_ERROR_NR; e++)
373 m->errors[e] = cpu_to_le64(atomic64_read(&ca->errors[e]));
378 void bch2_dev_io_errors_to_text(struct printbuf *out, struct bch_dev *ca)
380 struct bch_fs *c = ca->fs;
383 mutex_lock(&ca->fs->sb_lock);
384 m = bch2_sb_member_get(c->disk_sb.sb, ca->dev_idx);
385 mutex_unlock(&ca->fs->sb_lock);
387 printbuf_tabstop_push(out, 12);
389 prt_str(out, "IO errors since filesystem creation");
392 printbuf_indent_add(out, 2);
393 for (unsigned i = 0; i < BCH_MEMBER_ERROR_NR; i++) {
394 prt_printf(out, "%s:", bch2_member_error_strs[i]);
396 prt_u64(out, atomic64_read(&ca->errors[i]));
399 printbuf_indent_sub(out, 2);
401 prt_str(out, "IO errors since ");
402 bch2_pr_time_units(out, (ktime_get_real_seconds() - le64_to_cpu(m.errors_reset_time)) * NSEC_PER_SEC);
403 prt_str(out, " ago");
406 printbuf_indent_add(out, 2);
407 for (unsigned i = 0; i < BCH_MEMBER_ERROR_NR; i++) {
408 prt_printf(out, "%s:", bch2_member_error_strs[i]);
410 prt_u64(out, atomic64_read(&ca->errors[i]) - le64_to_cpu(m.errors_at_reset[i]));
413 printbuf_indent_sub(out, 2);
416 void bch2_dev_errors_reset(struct bch_dev *ca)
418 struct bch_fs *c = ca->fs;
419 struct bch_member *m;
421 mutex_lock(&c->sb_lock);
422 m = bch2_members_v2_get_mut(c->disk_sb.sb, ca->dev_idx);
423 for (unsigned i = 0; i < ARRAY_SIZE(m->errors_at_reset); i++)
424 m->errors_at_reset[i] = cpu_to_le64(atomic64_read(&ca->errors[i]));
425 m->errors_reset_time = cpu_to_le64(ktime_get_real_seconds());
428 mutex_unlock(&c->sb_lock);
432 * Per member "range has btree nodes" bitmap:
434 * This is so that if we ever have to run the btree node scan to repair we don't
435 * have to scan full devices:
438 bool bch2_dev_btree_bitmap_marked(struct bch_fs *c, struct bkey_s_c k)
440 bkey_for_each_ptr(bch2_bkey_ptrs_c(k), ptr)
441 if (!bch2_dev_btree_bitmap_marked_sectors(bch_dev_bkey_exists(c, ptr->dev),
442 ptr->offset, btree_sectors(c)))
447 static void __bch2_dev_btree_bitmap_mark(struct bch_sb_field_members_v2 *mi, unsigned dev,
448 u64 start, unsigned sectors)
450 struct bch_member *m = __bch2_members_v2_get_mut(mi, dev);
451 u64 bitmap = le64_to_cpu(m->btree_allocated_bitmap);
453 u64 end = start + sectors;
455 int resize = ilog2(roundup_pow_of_two(end)) - (m->btree_bitmap_shift + 6);
459 for (unsigned i = 0; i < 64; i++)
460 if (bitmap & BIT_ULL(i))
461 new_bitmap |= BIT_ULL(i >> resize);
463 m->btree_bitmap_shift += resize;
466 for (unsigned bit = start >> m->btree_bitmap_shift;
467 (u64) bit << m->btree_bitmap_shift < end;
469 bitmap |= BIT_ULL(bit);
471 m->btree_allocated_bitmap = cpu_to_le64(bitmap);
474 void bch2_dev_btree_bitmap_mark(struct bch_fs *c, struct bkey_s_c k)
476 lockdep_assert_held(&c->sb_lock);
478 struct bch_sb_field_members_v2 *mi = bch2_sb_field_get(c->disk_sb.sb, members_v2);
479 bkey_for_each_ptr(bch2_bkey_ptrs_c(k), ptr)
480 __bch2_dev_btree_bitmap_mark(mi, ptr->dev, ptr->offset, btree_sectors(c));