Loading...
1// SPDX-License-Identifier: GPL-2.0
2
3#include "bcachefs.h"
4#include "backpointers.h"
5#include "bkey_methods.h"
6#include "btree_cache.h"
7#include "btree_types.h"
8#include "alloc_background.h"
9#include "dirent.h"
10#include "ec.h"
11#include "error.h"
12#include "extents.h"
13#include "inode.h"
14#include "io_misc.h"
15#include "lru.h"
16#include "quota.h"
17#include "reflink.h"
18#include "snapshot.h"
19#include "subvolume.h"
20#include "xattr.h"
21
22const char * const bch2_bkey_types[] = {
23#define x(name, nr) #name,
24 BCH_BKEY_TYPES()
25#undef x
26 NULL
27};
28
29static int deleted_key_invalid(struct bch_fs *c, struct bkey_s_c k,
30 enum bkey_invalid_flags flags, struct printbuf *err)
31{
32 return 0;
33}
34
35#define bch2_bkey_ops_deleted ((struct bkey_ops) { \
36 .key_invalid = deleted_key_invalid, \
37})
38
39#define bch2_bkey_ops_whiteout ((struct bkey_ops) { \
40 .key_invalid = deleted_key_invalid, \
41})
42
43static int empty_val_key_invalid(struct bch_fs *c, struct bkey_s_c k,
44 enum bkey_invalid_flags flags, struct printbuf *err)
45{
46 int ret = 0;
47
48 bkey_fsck_err_on(bkey_val_bytes(k.k), c, err,
49 bkey_val_size_nonzero,
50 "incorrect value size (%zu != 0)",
51 bkey_val_bytes(k.k));
52fsck_err:
53 return ret;
54}
55
56#define bch2_bkey_ops_error ((struct bkey_ops) { \
57 .key_invalid = empty_val_key_invalid, \
58})
59
60static int key_type_cookie_invalid(struct bch_fs *c, struct bkey_s_c k,
61 enum bkey_invalid_flags flags, struct printbuf *err)
62{
63 return 0;
64}
65
66static void key_type_cookie_to_text(struct printbuf *out, struct bch_fs *c,
67 struct bkey_s_c k)
68{
69 struct bkey_s_c_cookie ck = bkey_s_c_to_cookie(k);
70
71 prt_printf(out, "%llu", le64_to_cpu(ck.v->cookie));
72}
73
74#define bch2_bkey_ops_cookie ((struct bkey_ops) { \
75 .key_invalid = key_type_cookie_invalid, \
76 .val_to_text = key_type_cookie_to_text, \
77 .min_val_size = 8, \
78})
79
80#define bch2_bkey_ops_hash_whiteout ((struct bkey_ops) {\
81 .key_invalid = empty_val_key_invalid, \
82})
83
84static int key_type_inline_data_invalid(struct bch_fs *c, struct bkey_s_c k,
85 enum bkey_invalid_flags flags, struct printbuf *err)
86{
87 return 0;
88}
89
90static void key_type_inline_data_to_text(struct printbuf *out, struct bch_fs *c,
91 struct bkey_s_c k)
92{
93 struct bkey_s_c_inline_data d = bkey_s_c_to_inline_data(k);
94 unsigned datalen = bkey_inline_data_bytes(k.k);
95
96 prt_printf(out, "datalen %u: %*phN",
97 datalen, min(datalen, 32U), d.v->data);
98}
99
100#define bch2_bkey_ops_inline_data ((struct bkey_ops) { \
101 .key_invalid = key_type_inline_data_invalid, \
102 .val_to_text = key_type_inline_data_to_text, \
103})
104
105static bool key_type_set_merge(struct bch_fs *c, struct bkey_s l, struct bkey_s_c r)
106{
107 bch2_key_resize(l.k, l.k->size + r.k->size);
108 return true;
109}
110
111#define bch2_bkey_ops_set ((struct bkey_ops) { \
112 .key_invalid = empty_val_key_invalid, \
113 .key_merge = key_type_set_merge, \
114})
115
116const struct bkey_ops bch2_bkey_ops[] = {
117#define x(name, nr) [KEY_TYPE_##name] = bch2_bkey_ops_##name,
118 BCH_BKEY_TYPES()
119#undef x
120};
121
122const struct bkey_ops bch2_bkey_null_ops = {
123};
124
125int bch2_bkey_val_invalid(struct bch_fs *c, struct bkey_s_c k,
126 enum bkey_invalid_flags flags,
127 struct printbuf *err)
128{
129 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
130 int ret = 0;
131
132 bkey_fsck_err_on(bkey_val_bytes(k.k) < ops->min_val_size, c, err,
133 bkey_val_size_too_small,
134 "bad val size (%zu < %u)",
135 bkey_val_bytes(k.k), ops->min_val_size);
136
137 if (!ops->key_invalid)
138 return 0;
139
140 ret = ops->key_invalid(c, k, flags, err);
141fsck_err:
142 return ret;
143}
144
145static u64 bch2_key_types_allowed[] = {
146 [BKEY_TYPE_btree] =
147 BIT_ULL(KEY_TYPE_deleted)|
148 BIT_ULL(KEY_TYPE_btree_ptr)|
149 BIT_ULL(KEY_TYPE_btree_ptr_v2),
150#define x(name, nr, flags, keys) [BKEY_TYPE_##name] = BIT_ULL(KEY_TYPE_deleted)|keys,
151 BCH_BTREE_IDS()
152#undef x
153};
154
155const char *bch2_btree_node_type_str(enum btree_node_type type)
156{
157 return type == BKEY_TYPE_btree ? "internal btree node" : bch2_btree_id_str(type - 1);
158}
159
160int __bch2_bkey_invalid(struct bch_fs *c, struct bkey_s_c k,
161 enum btree_node_type type,
162 enum bkey_invalid_flags flags,
163 struct printbuf *err)
164{
165 int ret = 0;
166
167 bkey_fsck_err_on(k.k->u64s < BKEY_U64s, c, err,
168 bkey_u64s_too_small,
169 "u64s too small (%u < %zu)", k.k->u64s, BKEY_U64s);
170
171 if (type >= BKEY_TYPE_NR)
172 return 0;
173
174 bkey_fsck_err_on((flags & BKEY_INVALID_COMMIT) &&
175 !(bch2_key_types_allowed[type] & BIT_ULL(k.k->type)), c, err,
176 bkey_invalid_type_for_btree,
177 "invalid key type for btree %s (%s)",
178 bch2_btree_node_type_str(type), bch2_bkey_types[k.k->type]);
179
180 if (btree_node_type_is_extents(type) && !bkey_whiteout(k.k)) {
181 bkey_fsck_err_on(k.k->size == 0, c, err,
182 bkey_extent_size_zero,
183 "size == 0");
184
185 bkey_fsck_err_on(k.k->size > k.k->p.offset, c, err,
186 bkey_extent_size_greater_than_offset,
187 "size greater than offset (%u > %llu)",
188 k.k->size, k.k->p.offset);
189 } else {
190 bkey_fsck_err_on(k.k->size, c, err,
191 bkey_size_nonzero,
192 "size != 0");
193 }
194
195 if (type != BKEY_TYPE_btree) {
196 enum btree_id btree = type - 1;
197
198 if (btree_type_has_snapshots(btree)) {
199 bkey_fsck_err_on(!k.k->p.snapshot, c, err,
200 bkey_snapshot_zero,
201 "snapshot == 0");
202 } else if (!btree_type_has_snapshot_field(btree)) {
203 bkey_fsck_err_on(k.k->p.snapshot, c, err,
204 bkey_snapshot_nonzero,
205 "nonzero snapshot");
206 } else {
207 /*
208 * btree uses snapshot field but it's not required to be
209 * nonzero
210 */
211 }
212
213 bkey_fsck_err_on(bkey_eq(k.k->p, POS_MAX), c, err,
214 bkey_at_pos_max,
215 "key at POS_MAX");
216 }
217fsck_err:
218 return ret;
219}
220
221int bch2_bkey_invalid(struct bch_fs *c, struct bkey_s_c k,
222 enum btree_node_type type,
223 enum bkey_invalid_flags flags,
224 struct printbuf *err)
225{
226 return __bch2_bkey_invalid(c, k, type, flags, err) ?:
227 bch2_bkey_val_invalid(c, k, flags, err);
228}
229
230int bch2_bkey_in_btree_node(struct bch_fs *c, struct btree *b,
231 struct bkey_s_c k, struct printbuf *err)
232{
233 int ret = 0;
234
235 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), c, err,
236 bkey_before_start_of_btree_node,
237 "key before start of btree node");
238
239 bkey_fsck_err_on(bpos_gt(k.k->p, b->data->max_key), c, err,
240 bkey_after_end_of_btree_node,
241 "key past end of btree node");
242fsck_err:
243 return ret;
244}
245
246void bch2_bpos_to_text(struct printbuf *out, struct bpos pos)
247{
248 if (bpos_eq(pos, POS_MIN))
249 prt_printf(out, "POS_MIN");
250 else if (bpos_eq(pos, POS_MAX))
251 prt_printf(out, "POS_MAX");
252 else if (bpos_eq(pos, SPOS_MAX))
253 prt_printf(out, "SPOS_MAX");
254 else {
255 if (pos.inode == U64_MAX)
256 prt_printf(out, "U64_MAX");
257 else
258 prt_printf(out, "%llu", pos.inode);
259 prt_printf(out, ":");
260 if (pos.offset == U64_MAX)
261 prt_printf(out, "U64_MAX");
262 else
263 prt_printf(out, "%llu", pos.offset);
264 prt_printf(out, ":");
265 if (pos.snapshot == U32_MAX)
266 prt_printf(out, "U32_MAX");
267 else
268 prt_printf(out, "%u", pos.snapshot);
269 }
270}
271
272void bch2_bkey_to_text(struct printbuf *out, const struct bkey *k)
273{
274 if (k) {
275 prt_printf(out, "u64s %u type ", k->u64s);
276
277 if (k->type < KEY_TYPE_MAX)
278 prt_printf(out, "%s ", bch2_bkey_types[k->type]);
279 else
280 prt_printf(out, "%u ", k->type);
281
282 bch2_bpos_to_text(out, k->p);
283
284 prt_printf(out, " len %u ver %llu", k->size, k->version.lo);
285 } else {
286 prt_printf(out, "(null)");
287 }
288}
289
290void bch2_val_to_text(struct printbuf *out, struct bch_fs *c,
291 struct bkey_s_c k)
292{
293 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
294
295 if (likely(ops->val_to_text))
296 ops->val_to_text(out, c, k);
297}
298
299void bch2_bkey_val_to_text(struct printbuf *out, struct bch_fs *c,
300 struct bkey_s_c k)
301{
302 bch2_bkey_to_text(out, k.k);
303
304 if (bkey_val_bytes(k.k)) {
305 prt_printf(out, ": ");
306 bch2_val_to_text(out, c, k);
307 }
308}
309
310void bch2_bkey_swab_val(struct bkey_s k)
311{
312 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
313
314 if (ops->swab)
315 ops->swab(k);
316}
317
318bool bch2_bkey_normalize(struct bch_fs *c, struct bkey_s k)
319{
320 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
321
322 return ops->key_normalize
323 ? ops->key_normalize(c, k)
324 : false;
325}
326
327bool bch2_bkey_merge(struct bch_fs *c, struct bkey_s l, struct bkey_s_c r)
328{
329 const struct bkey_ops *ops = bch2_bkey_type_ops(l.k->type);
330
331 return ops->key_merge &&
332 bch2_bkey_maybe_mergable(l.k, r.k) &&
333 (u64) l.k->size + r.k->size <= KEY_SIZE_MAX &&
334 !bch2_key_merging_disabled &&
335 ops->key_merge(c, l, r);
336}
337
338static const struct old_bkey_type {
339 u8 btree_node_type;
340 u8 old;
341 u8 new;
342} bkey_renumber_table[] = {
343 {BKEY_TYPE_btree, 128, KEY_TYPE_btree_ptr },
344 {BKEY_TYPE_extents, 128, KEY_TYPE_extent },
345 {BKEY_TYPE_extents, 129, KEY_TYPE_extent },
346 {BKEY_TYPE_extents, 130, KEY_TYPE_reservation },
347 {BKEY_TYPE_inodes, 128, KEY_TYPE_inode },
348 {BKEY_TYPE_inodes, 130, KEY_TYPE_inode_generation },
349 {BKEY_TYPE_dirents, 128, KEY_TYPE_dirent },
350 {BKEY_TYPE_dirents, 129, KEY_TYPE_hash_whiteout },
351 {BKEY_TYPE_xattrs, 128, KEY_TYPE_xattr },
352 {BKEY_TYPE_xattrs, 129, KEY_TYPE_hash_whiteout },
353 {BKEY_TYPE_alloc, 128, KEY_TYPE_alloc },
354 {BKEY_TYPE_quotas, 128, KEY_TYPE_quota },
355};
356
357void bch2_bkey_renumber(enum btree_node_type btree_node_type,
358 struct bkey_packed *k,
359 int write)
360{
361 const struct old_bkey_type *i;
362
363 for (i = bkey_renumber_table;
364 i < bkey_renumber_table + ARRAY_SIZE(bkey_renumber_table);
365 i++)
366 if (btree_node_type == i->btree_node_type &&
367 k->type == (write ? i->new : i->old)) {
368 k->type = write ? i->old : i->new;
369 break;
370 }
371}
372
373void __bch2_bkey_compat(unsigned level, enum btree_id btree_id,
374 unsigned version, unsigned big_endian,
375 int write,
376 struct bkey_format *f,
377 struct bkey_packed *k)
378{
379 const struct bkey_ops *ops;
380 struct bkey uk;
381 unsigned nr_compat = 5;
382 int i;
383
384 /*
385 * Do these operations in reverse order in the write path:
386 */
387
388 for (i = 0; i < nr_compat; i++)
389 switch (!write ? i : nr_compat - 1 - i) {
390 case 0:
391 if (big_endian != CPU_BIG_ENDIAN)
392 bch2_bkey_swab_key(f, k);
393 break;
394 case 1:
395 if (version < bcachefs_metadata_version_bkey_renumber)
396 bch2_bkey_renumber(__btree_node_type(level, btree_id), k, write);
397 break;
398 case 2:
399 if (version < bcachefs_metadata_version_inode_btree_change &&
400 btree_id == BTREE_ID_inodes) {
401 if (!bkey_packed(k)) {
402 struct bkey_i *u = packed_to_bkey(k);
403
404 swap(u->k.p.inode, u->k.p.offset);
405 } else if (f->bits_per_field[BKEY_FIELD_INODE] &&
406 f->bits_per_field[BKEY_FIELD_OFFSET]) {
407 struct bkey_format tmp = *f, *in = f, *out = &tmp;
408
409 swap(tmp.bits_per_field[BKEY_FIELD_INODE],
410 tmp.bits_per_field[BKEY_FIELD_OFFSET]);
411 swap(tmp.field_offset[BKEY_FIELD_INODE],
412 tmp.field_offset[BKEY_FIELD_OFFSET]);
413
414 if (!write)
415 swap(in, out);
416
417 uk = __bch2_bkey_unpack_key(in, k);
418 swap(uk.p.inode, uk.p.offset);
419 BUG_ON(!bch2_bkey_pack_key(k, &uk, out));
420 }
421 }
422 break;
423 case 3:
424 if (version < bcachefs_metadata_version_snapshot &&
425 (level || btree_type_has_snapshots(btree_id))) {
426 struct bkey_i *u = packed_to_bkey(k);
427
428 if (u) {
429 u->k.p.snapshot = write
430 ? 0 : U32_MAX;
431 } else {
432 u64 min_packed = le64_to_cpu(f->field_offset[BKEY_FIELD_SNAPSHOT]);
433 u64 max_packed = min_packed +
434 ~(~0ULL << f->bits_per_field[BKEY_FIELD_SNAPSHOT]);
435
436 uk = __bch2_bkey_unpack_key(f, k);
437 uk.p.snapshot = write
438 ? min_packed : min_t(u64, U32_MAX, max_packed);
439
440 BUG_ON(!bch2_bkey_pack_key(k, &uk, f));
441 }
442 }
443
444 break;
445 case 4: {
446 struct bkey_s u;
447
448 if (!bkey_packed(k)) {
449 u = bkey_i_to_s(packed_to_bkey(k));
450 } else {
451 uk = __bch2_bkey_unpack_key(f, k);
452 u.k = &uk;
453 u.v = bkeyp_val(f, k);
454 }
455
456 if (big_endian != CPU_BIG_ENDIAN)
457 bch2_bkey_swab_val(u);
458
459 ops = bch2_bkey_type_ops(k->type);
460
461 if (ops->compat)
462 ops->compat(btree_id, version, big_endian, write, u);
463 break;
464 }
465 default:
466 BUG();
467 }
468}
1// SPDX-License-Identifier: GPL-2.0
2
3#include "bcachefs.h"
4#include "backpointers.h"
5#include "bkey_methods.h"
6#include "btree_cache.h"
7#include "btree_types.h"
8#include "alloc_background.h"
9#include "dirent.h"
10#include "disk_accounting.h"
11#include "ec.h"
12#include "error.h"
13#include "extents.h"
14#include "inode.h"
15#include "io_misc.h"
16#include "lru.h"
17#include "quota.h"
18#include "reflink.h"
19#include "snapshot.h"
20#include "subvolume.h"
21#include "xattr.h"
22
23const char * const bch2_bkey_types[] = {
24#define x(name, nr) #name,
25 BCH_BKEY_TYPES()
26#undef x
27 NULL
28};
29
30static int deleted_key_validate(struct bch_fs *c, struct bkey_s_c k,
31 enum bch_validate_flags flags)
32{
33 return 0;
34}
35
36#define bch2_bkey_ops_deleted ((struct bkey_ops) { \
37 .key_validate = deleted_key_validate, \
38})
39
40#define bch2_bkey_ops_whiteout ((struct bkey_ops) { \
41 .key_validate = deleted_key_validate, \
42})
43
44static int empty_val_key_validate(struct bch_fs *c, struct bkey_s_c k,
45 enum bch_validate_flags flags)
46{
47 int ret = 0;
48
49 bkey_fsck_err_on(bkey_val_bytes(k.k),
50 c, bkey_val_size_nonzero,
51 "incorrect value size (%zu != 0)",
52 bkey_val_bytes(k.k));
53fsck_err:
54 return ret;
55}
56
57#define bch2_bkey_ops_error ((struct bkey_ops) { \
58 .key_validate = empty_val_key_validate, \
59})
60
61static int key_type_cookie_validate(struct bch_fs *c, struct bkey_s_c k,
62 enum bch_validate_flags flags)
63{
64 return 0;
65}
66
67static void key_type_cookie_to_text(struct printbuf *out, struct bch_fs *c,
68 struct bkey_s_c k)
69{
70 struct bkey_s_c_cookie ck = bkey_s_c_to_cookie(k);
71
72 prt_printf(out, "%llu", le64_to_cpu(ck.v->cookie));
73}
74
75#define bch2_bkey_ops_cookie ((struct bkey_ops) { \
76 .key_validate = key_type_cookie_validate, \
77 .val_to_text = key_type_cookie_to_text, \
78 .min_val_size = 8, \
79})
80
81#define bch2_bkey_ops_hash_whiteout ((struct bkey_ops) {\
82 .key_validate = empty_val_key_validate, \
83})
84
85static int key_type_inline_data_validate(struct bch_fs *c, struct bkey_s_c k,
86 enum bch_validate_flags flags)
87{
88 return 0;
89}
90
91static void key_type_inline_data_to_text(struct printbuf *out, struct bch_fs *c,
92 struct bkey_s_c k)
93{
94 struct bkey_s_c_inline_data d = bkey_s_c_to_inline_data(k);
95 unsigned datalen = bkey_inline_data_bytes(k.k);
96
97 prt_printf(out, "datalen %u: %*phN",
98 datalen, min(datalen, 32U), d.v->data);
99}
100
101#define bch2_bkey_ops_inline_data ((struct bkey_ops) { \
102 .key_validate = key_type_inline_data_validate, \
103 .val_to_text = key_type_inline_data_to_text, \
104})
105
106static bool key_type_set_merge(struct bch_fs *c, struct bkey_s l, struct bkey_s_c r)
107{
108 bch2_key_resize(l.k, l.k->size + r.k->size);
109 return true;
110}
111
112#define bch2_bkey_ops_set ((struct bkey_ops) { \
113 .key_validate = empty_val_key_validate, \
114 .key_merge = key_type_set_merge, \
115})
116
117const struct bkey_ops bch2_bkey_ops[] = {
118#define x(name, nr) [KEY_TYPE_##name] = bch2_bkey_ops_##name,
119 BCH_BKEY_TYPES()
120#undef x
121};
122
123const struct bkey_ops bch2_bkey_null_ops = {
124};
125
126int bch2_bkey_val_validate(struct bch_fs *c, struct bkey_s_c k,
127 enum bch_validate_flags flags)
128{
129 if (test_bit(BCH_FS_no_invalid_checks, &c->flags))
130 return 0;
131
132 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
133 int ret = 0;
134
135 bkey_fsck_err_on(bkey_val_bytes(k.k) < ops->min_val_size,
136 c, bkey_val_size_too_small,
137 "bad val size (%zu < %u)",
138 bkey_val_bytes(k.k), ops->min_val_size);
139
140 if (!ops->key_validate)
141 return 0;
142
143 ret = ops->key_validate(c, k, flags);
144fsck_err:
145 return ret;
146}
147
148static u64 bch2_key_types_allowed[] = {
149 [BKEY_TYPE_btree] =
150 BIT_ULL(KEY_TYPE_deleted)|
151 BIT_ULL(KEY_TYPE_btree_ptr)|
152 BIT_ULL(KEY_TYPE_btree_ptr_v2),
153#define x(name, nr, flags, keys) [BKEY_TYPE_##name] = BIT_ULL(KEY_TYPE_deleted)|keys,
154 BCH_BTREE_IDS()
155#undef x
156};
157
158const char *bch2_btree_node_type_str(enum btree_node_type type)
159{
160 return type == BKEY_TYPE_btree ? "internal btree node" : bch2_btree_id_str(type - 1);
161}
162
163int __bch2_bkey_validate(struct bch_fs *c, struct bkey_s_c k,
164 enum btree_node_type type,
165 enum bch_validate_flags flags)
166{
167 if (test_bit(BCH_FS_no_invalid_checks, &c->flags))
168 return 0;
169
170 int ret = 0;
171
172 bkey_fsck_err_on(k.k->u64s < BKEY_U64s,
173 c, bkey_u64s_too_small,
174 "u64s too small (%u < %zu)", k.k->u64s, BKEY_U64s);
175
176 if (type >= BKEY_TYPE_NR)
177 return 0;
178
179 bkey_fsck_err_on(k.k->type < KEY_TYPE_MAX &&
180 (type == BKEY_TYPE_btree || (flags & BCH_VALIDATE_commit)) &&
181 !(bch2_key_types_allowed[type] & BIT_ULL(k.k->type)),
182 c, bkey_invalid_type_for_btree,
183 "invalid key type for btree %s (%s)",
184 bch2_btree_node_type_str(type),
185 k.k->type < KEY_TYPE_MAX
186 ? bch2_bkey_types[k.k->type]
187 : "(unknown)");
188
189 if (btree_node_type_is_extents(type) && !bkey_whiteout(k.k)) {
190 bkey_fsck_err_on(k.k->size == 0,
191 c, bkey_extent_size_zero,
192 "size == 0");
193
194 bkey_fsck_err_on(k.k->size > k.k->p.offset,
195 c, bkey_extent_size_greater_than_offset,
196 "size greater than offset (%u > %llu)",
197 k.k->size, k.k->p.offset);
198 } else {
199 bkey_fsck_err_on(k.k->size,
200 c, bkey_size_nonzero,
201 "size != 0");
202 }
203
204 if (type != BKEY_TYPE_btree) {
205 enum btree_id btree = type - 1;
206
207 if (btree_type_has_snapshots(btree)) {
208 bkey_fsck_err_on(!k.k->p.snapshot,
209 c, bkey_snapshot_zero,
210 "snapshot == 0");
211 } else if (!btree_type_has_snapshot_field(btree)) {
212 bkey_fsck_err_on(k.k->p.snapshot,
213 c, bkey_snapshot_nonzero,
214 "nonzero snapshot");
215 } else {
216 /*
217 * btree uses snapshot field but it's not required to be
218 * nonzero
219 */
220 }
221
222 bkey_fsck_err_on(bkey_eq(k.k->p, POS_MAX),
223 c, bkey_at_pos_max,
224 "key at POS_MAX");
225 }
226fsck_err:
227 return ret;
228}
229
230int bch2_bkey_validate(struct bch_fs *c, struct bkey_s_c k,
231 enum btree_node_type type,
232 enum bch_validate_flags flags)
233{
234 return __bch2_bkey_validate(c, k, type, flags) ?:
235 bch2_bkey_val_validate(c, k, flags);
236}
237
238int bch2_bkey_in_btree_node(struct bch_fs *c, struct btree *b,
239 struct bkey_s_c k, enum bch_validate_flags flags)
240{
241 int ret = 0;
242
243 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key),
244 c, bkey_before_start_of_btree_node,
245 "key before start of btree node");
246
247 bkey_fsck_err_on(bpos_gt(k.k->p, b->data->max_key),
248 c, bkey_after_end_of_btree_node,
249 "key past end of btree node");
250fsck_err:
251 return ret;
252}
253
254void bch2_bpos_to_text(struct printbuf *out, struct bpos pos)
255{
256 if (bpos_eq(pos, POS_MIN))
257 prt_printf(out, "POS_MIN");
258 else if (bpos_eq(pos, POS_MAX))
259 prt_printf(out, "POS_MAX");
260 else if (bpos_eq(pos, SPOS_MAX))
261 prt_printf(out, "SPOS_MAX");
262 else {
263 if (pos.inode == U64_MAX)
264 prt_printf(out, "U64_MAX");
265 else
266 prt_printf(out, "%llu", pos.inode);
267 prt_printf(out, ":");
268 if (pos.offset == U64_MAX)
269 prt_printf(out, "U64_MAX");
270 else
271 prt_printf(out, "%llu", pos.offset);
272 prt_printf(out, ":");
273 if (pos.snapshot == U32_MAX)
274 prt_printf(out, "U32_MAX");
275 else
276 prt_printf(out, "%u", pos.snapshot);
277 }
278}
279
280void bch2_bkey_to_text(struct printbuf *out, const struct bkey *k)
281{
282 if (k) {
283 prt_printf(out, "u64s %u type ", k->u64s);
284
285 if (k->type < KEY_TYPE_MAX)
286 prt_printf(out, "%s ", bch2_bkey_types[k->type]);
287 else
288 prt_printf(out, "%u ", k->type);
289
290 bch2_bpos_to_text(out, k->p);
291
292 prt_printf(out, " len %u ver %llu", k->size, k->bversion.lo);
293 } else {
294 prt_printf(out, "(null)");
295 }
296}
297
298void bch2_val_to_text(struct printbuf *out, struct bch_fs *c,
299 struct bkey_s_c k)
300{
301 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
302
303 if (likely(ops->val_to_text))
304 ops->val_to_text(out, c, k);
305}
306
307void bch2_bkey_val_to_text(struct printbuf *out, struct bch_fs *c,
308 struct bkey_s_c k)
309{
310 bch2_bkey_to_text(out, k.k);
311
312 if (bkey_val_bytes(k.k)) {
313 prt_printf(out, ": ");
314 bch2_val_to_text(out, c, k);
315 }
316}
317
318void bch2_bkey_swab_val(struct bkey_s k)
319{
320 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
321
322 if (ops->swab)
323 ops->swab(k);
324}
325
326bool bch2_bkey_normalize(struct bch_fs *c, struct bkey_s k)
327{
328 const struct bkey_ops *ops = bch2_bkey_type_ops(k.k->type);
329
330 return ops->key_normalize
331 ? ops->key_normalize(c, k)
332 : false;
333}
334
335bool bch2_bkey_merge(struct bch_fs *c, struct bkey_s l, struct bkey_s_c r)
336{
337 const struct bkey_ops *ops = bch2_bkey_type_ops(l.k->type);
338
339 return ops->key_merge &&
340 bch2_bkey_maybe_mergable(l.k, r.k) &&
341 (u64) l.k->size + r.k->size <= KEY_SIZE_MAX &&
342 !bch2_key_merging_disabled &&
343 ops->key_merge(c, l, r);
344}
345
346static const struct old_bkey_type {
347 u8 btree_node_type;
348 u8 old;
349 u8 new;
350} bkey_renumber_table[] = {
351 {BKEY_TYPE_btree, 128, KEY_TYPE_btree_ptr },
352 {BKEY_TYPE_extents, 128, KEY_TYPE_extent },
353 {BKEY_TYPE_extents, 129, KEY_TYPE_extent },
354 {BKEY_TYPE_extents, 130, KEY_TYPE_reservation },
355 {BKEY_TYPE_inodes, 128, KEY_TYPE_inode },
356 {BKEY_TYPE_inodes, 130, KEY_TYPE_inode_generation },
357 {BKEY_TYPE_dirents, 128, KEY_TYPE_dirent },
358 {BKEY_TYPE_dirents, 129, KEY_TYPE_hash_whiteout },
359 {BKEY_TYPE_xattrs, 128, KEY_TYPE_xattr },
360 {BKEY_TYPE_xattrs, 129, KEY_TYPE_hash_whiteout },
361 {BKEY_TYPE_alloc, 128, KEY_TYPE_alloc },
362 {BKEY_TYPE_quotas, 128, KEY_TYPE_quota },
363};
364
365void bch2_bkey_renumber(enum btree_node_type btree_node_type,
366 struct bkey_packed *k,
367 int write)
368{
369 const struct old_bkey_type *i;
370
371 for (i = bkey_renumber_table;
372 i < bkey_renumber_table + ARRAY_SIZE(bkey_renumber_table);
373 i++)
374 if (btree_node_type == i->btree_node_type &&
375 k->type == (write ? i->new : i->old)) {
376 k->type = write ? i->old : i->new;
377 break;
378 }
379}
380
381void __bch2_bkey_compat(unsigned level, enum btree_id btree_id,
382 unsigned version, unsigned big_endian,
383 int write,
384 struct bkey_format *f,
385 struct bkey_packed *k)
386{
387 const struct bkey_ops *ops;
388 struct bkey uk;
389 unsigned nr_compat = 5;
390 int i;
391
392 /*
393 * Do these operations in reverse order in the write path:
394 */
395
396 for (i = 0; i < nr_compat; i++)
397 switch (!write ? i : nr_compat - 1 - i) {
398 case 0:
399 if (big_endian != CPU_BIG_ENDIAN) {
400 bch2_bkey_swab_key(f, k);
401 } else if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) {
402 bch2_bkey_swab_key(f, k);
403 bch2_bkey_swab_key(f, k);
404 }
405 break;
406 case 1:
407 if (version < bcachefs_metadata_version_bkey_renumber)
408 bch2_bkey_renumber(__btree_node_type(level, btree_id), k, write);
409 break;
410 case 2:
411 if (version < bcachefs_metadata_version_inode_btree_change &&
412 btree_id == BTREE_ID_inodes) {
413 if (!bkey_packed(k)) {
414 struct bkey_i *u = packed_to_bkey(k);
415
416 swap(u->k.p.inode, u->k.p.offset);
417 } else if (f->bits_per_field[BKEY_FIELD_INODE] &&
418 f->bits_per_field[BKEY_FIELD_OFFSET]) {
419 struct bkey_format tmp = *f, *in = f, *out = &tmp;
420
421 swap(tmp.bits_per_field[BKEY_FIELD_INODE],
422 tmp.bits_per_field[BKEY_FIELD_OFFSET]);
423 swap(tmp.field_offset[BKEY_FIELD_INODE],
424 tmp.field_offset[BKEY_FIELD_OFFSET]);
425
426 if (!write)
427 swap(in, out);
428
429 uk = __bch2_bkey_unpack_key(in, k);
430 swap(uk.p.inode, uk.p.offset);
431 BUG_ON(!bch2_bkey_pack_key(k, &uk, out));
432 }
433 }
434 break;
435 case 3:
436 if (version < bcachefs_metadata_version_snapshot &&
437 (level || btree_type_has_snapshots(btree_id))) {
438 struct bkey_i *u = packed_to_bkey(k);
439
440 if (u) {
441 u->k.p.snapshot = write
442 ? 0 : U32_MAX;
443 } else {
444 u64 min_packed = le64_to_cpu(f->field_offset[BKEY_FIELD_SNAPSHOT]);
445 u64 max_packed = min_packed +
446 ~(~0ULL << f->bits_per_field[BKEY_FIELD_SNAPSHOT]);
447
448 uk = __bch2_bkey_unpack_key(f, k);
449 uk.p.snapshot = write
450 ? min_packed : min_t(u64, U32_MAX, max_packed);
451
452 BUG_ON(!bch2_bkey_pack_key(k, &uk, f));
453 }
454 }
455
456 break;
457 case 4: {
458 struct bkey_s u;
459
460 if (!bkey_packed(k)) {
461 u = bkey_i_to_s(packed_to_bkey(k));
462 } else {
463 uk = __bch2_bkey_unpack_key(f, k);
464 u.k = &uk;
465 u.v = bkeyp_val(f, k);
466 }
467
468 if (big_endian != CPU_BIG_ENDIAN)
469 bch2_bkey_swab_val(u);
470
471 ops = bch2_bkey_type_ops(k->type);
472
473 if (ops->compat)
474 ops->compat(btree_id, version, big_endian, write, u);
475 break;
476 }
477 default:
478 BUG();
479 }
480}