1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_FORMAT_H
3 #define _BCACHEFS_FORMAT_H
4
5 /*
6 * bcachefs on disk data structures
7 *
8 * OVERVIEW:
9 *
10 * There are three main types of on disk data structures in bcachefs (this is
11 * reduced from 5 in bcache)
12 *
13 * - superblock
14 * - journal
15 * - btree
16 *
17 * The btree is the primary structure; most metadata exists as keys in the
18 * various btrees. There are only a small number of btrees, they're not
19 * sharded - we have one btree for extents, another for inodes, et cetera.
20 *
21 * SUPERBLOCK:
22 *
23 * The superblock contains the location of the journal, the list of devices in
24 * the filesystem, and in general any metadata we need in order to decide
25 * whether we can start a filesystem or prior to reading the journal/btree
26 * roots.
27 *
28 * The superblock is extensible, and most of the contents of the superblock are
29 * in variable length, type tagged fields; see struct bch_sb_field.
30 *
31 * Backup superblocks do not reside in a fixed location; also, superblocks do
32 * not have a fixed size. To locate backup superblocks we have struct
33 * bch_sb_layout; we store a copy of this inside every superblock, and also
34 * before the first superblock.
35 *
36 * JOURNAL:
37 *
38 * The journal primarily records btree updates in the order they occurred;
39 * journal replay consists of just iterating over all the keys in the open
40 * journal entries and re-inserting them into the btrees.
41 *
42 * The journal also contains entry types for the btree roots, and blacklisted
43 * journal sequence numbers (see journal_seq_blacklist.c).
44 *
45 * BTREE:
46 *
47 * bcachefs btrees are copy on write b+ trees, where nodes are big (typically
48 * 128k-256k) and log structured. We use struct btree_node for writing the first
49 * entry in a given node (offset 0), and struct btree_node_entry for all
50 * subsequent writes.
51 *
52 * After the header, btree node entries contain a list of keys in sorted order.
53 * Values are stored inline with the keys; since values are variable length (and
54 * keys effectively are variable length too, due to packing) we can't do random
55 * access without building up additional in memory tables in the btree node read
56 * path.
57 *
58 * BTREE KEYS (struct bkey):
59 *
60 * The various btrees share a common format for the key - so as to avoid
61 * switching in fastpath lookup/comparison code - but define their own
62 * structures for the key values.
63 *
64 * The size of a key/value pair is stored as a u8 in units of u64s, so the max
65 * size is just under 2k. The common part also contains a type tag for the
66 * value, and a format field indicating whether the key is packed or not (and
67 * also meant to allow adding new key fields in the future, if desired).
68 *
69 * bkeys, when stored within a btree node, may also be packed. In that case, the
70 * bkey_format in that node is used to unpack it. Packed bkeys mean that we can
71 * be generous with field sizes in the common part of the key format (64 bit
72 * inode number, 64 bit offset, 96 bit version field, etc.) for negligible cost.
73 */
74
75 #include <asm/types.h>
76 #include <asm/byteorder.h>
77 #include <linux/kernel.h>
78 #include <linux/uuid.h>
79 #include <uapi/linux/magic.h>
80 #include "vstructs.h"
81
82 #ifdef __KERNEL__
83 typedef uuid_t __uuid_t;
84 #endif
85
86 #define BITMASK(name, type, field, offset, end) \
87 static const __maybe_unused unsigned name##_OFFSET = offset; \
88 static const __maybe_unused unsigned name##_BITS = (end - offset); \
89 \
90 static inline __u64 name(const type *k) \
91 { \
92 return (k->field >> offset) & ~(~0ULL << (end - offset)); \
93 } \
94 \
95 static inline void SET_##name(type *k, __u64 v) \
96 { \
97 k->field &= ~(~(~0ULL << (end - offset)) << offset); \
98 k->field |= (v & ~(~0ULL << (end - offset))) << offset; \
99 }
100
101 #define LE_BITMASK(_bits, name, type, field, offset, end) \
102 static const __maybe_unused unsigned name##_OFFSET = offset; \
103 static const __maybe_unused unsigned name##_BITS = (end - offset); \
104 static const __maybe_unused __u##_bits name##_MAX = (1ULL << (end - offset)) - 1;\
105 \
106 static inline __u64 name(const type *k) \
107 { \
108 return (__le##_bits##_to_cpu(k->field) >> offset) & \
109 ~(~0ULL << (end - offset)); \
110 } \
111 \
112 static inline void SET_##name(type *k, __u64 v) \
113 { \
114 __u##_bits new = __le##_bits##_to_cpu(k->field); \
115 \
116 new &= ~(~(~0ULL << (end - offset)) << offset); \
117 new |= (v & ~(~0ULL << (end - offset))) << offset; \
118 k->field = __cpu_to_le##_bits(new); \
119 }
120
121 #define LE16_BITMASK(n, t, f, o, e) LE_BITMASK(16, n, t, f, o, e)
122 #define LE32_BITMASK(n, t, f, o, e) LE_BITMASK(32, n, t, f, o, e)
123 #define LE64_BITMASK(n, t, f, o, e) LE_BITMASK(64, n, t, f, o, e)
124
125 struct bkey_format {
126 __u8 key_u64s;
127 __u8 nr_fields;
128 /* One unused slot for now: */
129 __u8 bits_per_field[6];
130 __le64 field_offset[6];
131 };
132
133 /* Btree keys - all units are in sectors */
134
135 struct bpos {
136 /*
137 * Word order matches machine byte order - btree code treats a bpos as a
138 * single large integer, for search/comparison purposes
139 *
140 * Note that wherever a bpos is embedded in another on disk data
141 * structure, it has to be byte swabbed when reading in metadata that
142 * wasn't written in native endian order:
143 */
144 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
145 __u32 snapshot;
146 __u64 offset;
147 __u64 inode;
148 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
149 __u64 inode;
150 __u64 offset; /* Points to end of extent - sectors */
151 __u32 snapshot;
152 #else
153 #error edit for your odd byteorder.
154 #endif
155 } __packed
156 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
157 __aligned(4)
158 #endif
159 ;
160
161 #define KEY_INODE_MAX ((__u64)~0ULL)
162 #define KEY_OFFSET_MAX ((__u64)~0ULL)
163 #define KEY_SNAPSHOT_MAX ((__u32)~0U)
164 #define KEY_SIZE_MAX ((__u32)~0U)
165
SPOS(__u64 inode,__u64 offset,__u32 snapshot)166 static inline struct bpos SPOS(__u64 inode, __u64 offset, __u32 snapshot)
167 {
168 return (struct bpos) {
169 .inode = inode,
170 .offset = offset,
171 .snapshot = snapshot,
172 };
173 }
174
175 #define POS_MIN SPOS(0, 0, 0)
176 #define POS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, 0)
177 #define SPOS_MAX SPOS(KEY_INODE_MAX, KEY_OFFSET_MAX, KEY_SNAPSHOT_MAX)
178 #define POS(_inode, _offset) SPOS(_inode, _offset, 0)
179
180 /* Empty placeholder struct, for container_of() */
181 struct bch_val {
182 __u64 __nothing[0];
183 };
184
185 struct bversion {
186 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
187 __u64 lo;
188 __u32 hi;
189 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
190 __u32 hi;
191 __u64 lo;
192 #endif
193 } __packed
194 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
195 __aligned(4)
196 #endif
197 ;
198
199 struct bkey {
200 /* Size of combined key and value, in u64s */
201 __u8 u64s;
202
203 /* Format of key (0 for format local to btree node) */
204 #if defined(__LITTLE_ENDIAN_BITFIELD)
205 __u8 format:7,
206 needs_whiteout:1;
207 #elif defined (__BIG_ENDIAN_BITFIELD)
208 __u8 needs_whiteout:1,
209 format:7;
210 #else
211 #error edit for your odd byteorder.
212 #endif
213
214 /* Type of the value */
215 __u8 type;
216
217 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
218 __u8 pad[1];
219
220 struct bversion bversion;
221 __u32 size; /* extent size, in sectors */
222 struct bpos p;
223 #elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
224 struct bpos p;
225 __u32 size; /* extent size, in sectors */
226 struct bversion bversion;
227
228 __u8 pad[1];
229 #endif
230 } __packed
231 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
232 /*
233 * The big-endian version of bkey can't be compiled by rustc with the "aligned"
234 * attr since it doesn't allow types to have both "packed" and "aligned" attrs.
235 * So for Rust compatibility, don't include this. It can be included in the LE
236 * version because the "packed" attr is redundant in that case.
237 *
238 * History: (quoting Kent)
239 *
240 * Specifically, when i was designing bkey, I wanted the header to be no
241 * bigger than necessary so that bkey_packed could use the rest. That means that
242 * decently offten extent keys will fit into only 8 bytes, instead of spilling over
243 * to 16.
244 *
245 * But packed_bkey treats the part after the header - the packed section -
246 * as a single multi word, variable length integer. And bkey, the unpacked
247 * version, is just a special case version of a bkey_packed; all the packed
248 * bkey code will work on keys in any packed format, the in-memory
249 * representation of an unpacked key also is just one type of packed key...
250 *
251 * So that constrains the key part of a bkig endian bkey to start right
252 * after the header.
253 *
254 * If we ever do a bkey_v2 and need to expand the hedaer by another byte for
255 * some reason - that will clean up this wart.
256 */
257 __aligned(8)
258 #endif
259 ;
260
261 struct bkey_packed {
262 __u64 _data[0];
263
264 /* Size of combined key and value, in u64s */
265 __u8 u64s;
266
267 /* Format of key (0 for format local to btree node) */
268
269 /*
270 * XXX: next incompat on disk format change, switch format and
271 * needs_whiteout - bkey_packed() will be cheaper if format is the high
272 * bits of the bitfield
273 */
274 #if defined(__LITTLE_ENDIAN_BITFIELD)
275 __u8 format:7,
276 needs_whiteout:1;
277 #elif defined (__BIG_ENDIAN_BITFIELD)
278 __u8 needs_whiteout:1,
279 format:7;
280 #endif
281
282 /* Type of the value */
283 __u8 type;
284 __u8 key_start[0];
285
286 /*
287 * We copy bkeys with struct assignment in various places, and while
288 * that shouldn't be done with packed bkeys we can't disallow it in C,
289 * and it's legal to cast a bkey to a bkey_packed - so padding it out
290 * to the same size as struct bkey should hopefully be safest.
291 */
292 __u8 pad[sizeof(struct bkey) - 3];
293 } __packed __aligned(8);
294
295 typedef struct {
296 __le64 lo;
297 __le64 hi;
298 } bch_le128;
299
300 #define BKEY_U64s (sizeof(struct bkey) / sizeof(__u64))
301 #define BKEY_U64s_MAX U8_MAX
302 #define BKEY_VAL_U64s_MAX (BKEY_U64s_MAX - BKEY_U64s)
303
304 #define KEY_PACKED_BITS_START 24
305
306 #define KEY_FORMAT_LOCAL_BTREE 0
307 #define KEY_FORMAT_CURRENT 1
308
309 enum bch_bkey_fields {
310 BKEY_FIELD_INODE,
311 BKEY_FIELD_OFFSET,
312 BKEY_FIELD_SNAPSHOT,
313 BKEY_FIELD_SIZE,
314 BKEY_FIELD_VERSION_HI,
315 BKEY_FIELD_VERSION_LO,
316 BKEY_NR_FIELDS,
317 };
318
319 #define bkey_format_field(name, field) \
320 [BKEY_FIELD_##name] = (sizeof(((struct bkey *) NULL)->field) * 8)
321
322 #define BKEY_FORMAT_CURRENT \
323 ((struct bkey_format) { \
324 .key_u64s = BKEY_U64s, \
325 .nr_fields = BKEY_NR_FIELDS, \
326 .bits_per_field = { \
327 bkey_format_field(INODE, p.inode), \
328 bkey_format_field(OFFSET, p.offset), \
329 bkey_format_field(SNAPSHOT, p.snapshot), \
330 bkey_format_field(SIZE, size), \
331 bkey_format_field(VERSION_HI, bversion.hi), \
332 bkey_format_field(VERSION_LO, bversion.lo), \
333 }, \
334 })
335
336 /* bkey with inline value */
337 struct bkey_i {
338 __u64 _data[0];
339
340 struct bkey k;
341 struct bch_val v;
342 };
343
344 #define POS_KEY(_pos) \
345 ((struct bkey) { \
346 .u64s = BKEY_U64s, \
347 .format = KEY_FORMAT_CURRENT, \
348 .p = _pos, \
349 })
350
351 #define KEY(_inode, _offset, _size) \
352 ((struct bkey) { \
353 .u64s = BKEY_U64s, \
354 .format = KEY_FORMAT_CURRENT, \
355 .p = POS(_inode, _offset), \
356 .size = _size, \
357 })
358
bkey_init(struct bkey * k)359 static inline void bkey_init(struct bkey *k)
360 {
361 *k = KEY(0, 0, 0);
362 }
363
364 #define bkey_bytes(_k) ((_k)->u64s * sizeof(__u64))
365
366 #define __BKEY_PADDED(key, pad) \
367 struct bkey_i key; __u64 key ## _pad[pad]
368
369 /*
370 * - DELETED keys are used internally to mark keys that should be ignored but
371 * override keys in composition order. Their version number is ignored.
372 *
373 * - DISCARDED keys indicate that the data is all 0s because it has been
374 * discarded. DISCARDs may have a version; if the version is nonzero the key
375 * will be persistent, otherwise the key will be dropped whenever the btree
376 * node is rewritten (like DELETED keys).
377 *
378 * - ERROR: any read of the data returns a read error, as the data was lost due
379 * to a failing device. Like DISCARDED keys, they can be removed (overridden)
380 * by new writes or cluster-wide GC. Node repair can also overwrite them with
381 * the same or a more recent version number, but not with an older version
382 * number.
383 *
384 * - WHITEOUT: for hash table btrees
385 */
386 #define BCH_BKEY_TYPES() \
387 x(deleted, 0) \
388 x(whiteout, 1) \
389 x(error, 2) \
390 x(cookie, 3) \
391 x(hash_whiteout, 4) \
392 x(btree_ptr, 5) \
393 x(extent, 6) \
394 x(reservation, 7) \
395 x(inode, 8) \
396 x(inode_generation, 9) \
397 x(dirent, 10) \
398 x(xattr, 11) \
399 x(alloc, 12) \
400 x(quota, 13) \
401 x(stripe, 14) \
402 x(reflink_p, 15) \
403 x(reflink_v, 16) \
404 x(inline_data, 17) \
405 x(btree_ptr_v2, 18) \
406 x(indirect_inline_data, 19) \
407 x(alloc_v2, 20) \
408 x(subvolume, 21) \
409 x(snapshot, 22) \
410 x(inode_v2, 23) \
411 x(alloc_v3, 24) \
412 x(set, 25) \
413 x(lru, 26) \
414 x(alloc_v4, 27) \
415 x(backpointer, 28) \
416 x(inode_v3, 29) \
417 x(bucket_gens, 30) \
418 x(snapshot_tree, 31) \
419 x(logged_op_truncate, 32) \
420 x(logged_op_finsert, 33) \
421 x(accounting, 34) \
422 x(inode_alloc_cursor, 35)
423
424 enum bch_bkey_type {
425 #define x(name, nr) KEY_TYPE_##name = nr,
426 BCH_BKEY_TYPES()
427 #undef x
428 KEY_TYPE_MAX,
429 };
430
431 struct bch_deleted {
432 struct bch_val v;
433 };
434
435 struct bch_whiteout {
436 struct bch_val v;
437 };
438
439 struct bch_error {
440 struct bch_val v;
441 };
442
443 struct bch_cookie {
444 struct bch_val v;
445 __le64 cookie;
446 };
447
448 struct bch_hash_whiteout {
449 struct bch_val v;
450 };
451
452 struct bch_set {
453 struct bch_val v;
454 };
455
456 /* 128 bits, sufficient for cryptographic MACs: */
457 struct bch_csum {
458 __le64 lo;
459 __le64 hi;
460 } __packed __aligned(8);
461
462 struct bch_backpointer {
463 struct bch_val v;
464 __u8 btree_id;
465 __u8 level;
466 __u8 data_type;
467 __u8 bucket_gen;
468 __u32 pad;
469 __u32 bucket_len;
470 struct bpos pos;
471 } __packed __aligned(8);
472
473 /* Optional/variable size superblock sections: */
474
475 struct bch_sb_field {
476 __u64 _data[0];
477 __le32 u64s;
478 __le32 type;
479 };
480
481 #define BCH_SB_FIELDS() \
482 x(journal, 0) \
483 x(members_v1, 1) \
484 x(crypt, 2) \
485 x(replicas_v0, 3) \
486 x(quota, 4) \
487 x(disk_groups, 5) \
488 x(clean, 6) \
489 x(replicas, 7) \
490 x(journal_seq_blacklist, 8) \
491 x(journal_v2, 9) \
492 x(counters, 10) \
493 x(members_v2, 11) \
494 x(errors, 12) \
495 x(ext, 13) \
496 x(downgrade, 14)
497
498 #include "alloc_background_format.h"
499 #include "dirent_format.h"
500 #include "disk_accounting_format.h"
501 #include "disk_groups_format.h"
502 #include "extents_format.h"
503 #include "ec_format.h"
504 #include "inode_format.h"
505 #include "journal_seq_blacklist_format.h"
506 #include "logged_ops_format.h"
507 #include "lru_format.h"
508 #include "quota_format.h"
509 #include "reflink_format.h"
510 #include "replicas_format.h"
511 #include "snapshot_format.h"
512 #include "subvolume_format.h"
513 #include "sb-counters_format.h"
514 #include "sb-downgrade_format.h"
515 #include "sb-errors_format.h"
516 #include "sb-members_format.h"
517 #include "xattr_format.h"
518
519 enum bch_sb_field_type {
520 #define x(f, nr) BCH_SB_FIELD_##f = nr,
521 BCH_SB_FIELDS()
522 #undef x
523 BCH_SB_FIELD_NR
524 };
525
526 /*
527 * Most superblock fields are replicated in all device's superblocks - a few are
528 * not:
529 */
530 #define BCH_SINGLE_DEVICE_SB_FIELDS \
531 ((1U << BCH_SB_FIELD_journal)| \
532 (1U << BCH_SB_FIELD_journal_v2))
533
534 /* BCH_SB_FIELD_journal: */
535
536 struct bch_sb_field_journal {
537 struct bch_sb_field field;
538 __le64 buckets[];
539 };
540
541 struct bch_sb_field_journal_v2 {
542 struct bch_sb_field field;
543
544 struct bch_sb_field_journal_v2_entry {
545 __le64 start;
546 __le64 nr;
547 } d[];
548 };
549
550 /* BCH_SB_FIELD_crypt: */
551
552 struct nonce {
553 __le32 d[4];
554 };
555
556 struct bch_key {
557 __le64 key[4];
558 };
559
560 #define BCH_KEY_MAGIC \
561 (((__u64) 'b' << 0)|((__u64) 'c' << 8)| \
562 ((__u64) 'h' << 16)|((__u64) '*' << 24)| \
563 ((__u64) '*' << 32)|((__u64) 'k' << 40)| \
564 ((__u64) 'e' << 48)|((__u64) 'y' << 56))
565
566 struct bch_encrypted_key {
567 __le64 magic;
568 struct bch_key key;
569 };
570
571 /*
572 * If this field is present in the superblock, it stores an encryption key which
573 * is used encrypt all other data/metadata. The key will normally be encrypted
574 * with the key userspace provides, but if encryption has been turned off we'll
575 * just store the master key unencrypted in the superblock so we can access the
576 * previously encrypted data.
577 */
578 struct bch_sb_field_crypt {
579 struct bch_sb_field field;
580
581 __le64 flags;
582 __le64 kdf_flags;
583 struct bch_encrypted_key key;
584 };
585
586 LE64_BITMASK(BCH_CRYPT_KDF_TYPE, struct bch_sb_field_crypt, flags, 0, 4);
587
588 enum bch_kdf_types {
589 BCH_KDF_SCRYPT = 0,
590 BCH_KDF_NR = 1,
591 };
592
593 /* stored as base 2 log of scrypt params: */
594 LE64_BITMASK(BCH_KDF_SCRYPT_N, struct bch_sb_field_crypt, kdf_flags, 0, 16);
595 LE64_BITMASK(BCH_KDF_SCRYPT_R, struct bch_sb_field_crypt, kdf_flags, 16, 32);
596 LE64_BITMASK(BCH_KDF_SCRYPT_P, struct bch_sb_field_crypt, kdf_flags, 32, 48);
597
598 /*
599 * On clean shutdown, store btree roots and current journal sequence number in
600 * the superblock:
601 */
602 struct jset_entry {
603 __le16 u64s;
604 __u8 btree_id;
605 __u8 level;
606 __u8 type; /* designates what this jset holds */
607 __u8 pad[3];
608
609 struct bkey_i start[0];
610 __u64 _data[];
611 };
612
613 struct bch_sb_field_clean {
614 struct bch_sb_field field;
615
616 __le32 flags;
617 __le16 _read_clock; /* no longer used */
618 __le16 _write_clock;
619 __le64 journal_seq;
620
621 struct jset_entry start[0];
622 __u64 _data[];
623 };
624
625 struct bch_sb_field_ext {
626 struct bch_sb_field field;
627 __le64 recovery_passes_required[2];
628 __le64 errors_silent[8];
629 __le64 btrees_lost_data;
630 };
631
632 /* Superblock: */
633
634 /*
635 * New versioning scheme:
636 * One common version number for all on disk data structures - superblock, btree
637 * nodes, journal entries
638 */
639 #define BCH_VERSION_MAJOR(_v) ((__u16) ((_v) >> 10))
640 #define BCH_VERSION_MINOR(_v) ((__u16) ((_v) & ~(~0U << 10)))
641 #define BCH_VERSION(_major, _minor) (((_major) << 10)|(_minor) << 0)
642
643 /*
644 * field 1: version name
645 * field 2: BCH_VERSION(major, minor)
646 * field 3: recovery passess required on upgrade
647 */
648 #define BCH_METADATA_VERSIONS() \
649 x(bkey_renumber, BCH_VERSION(0, 10)) \
650 x(inode_btree_change, BCH_VERSION(0, 11)) \
651 x(snapshot, BCH_VERSION(0, 12)) \
652 x(inode_backpointers, BCH_VERSION(0, 13)) \
653 x(btree_ptr_sectors_written, BCH_VERSION(0, 14)) \
654 x(snapshot_2, BCH_VERSION(0, 15)) \
655 x(reflink_p_fix, BCH_VERSION(0, 16)) \
656 x(subvol_dirent, BCH_VERSION(0, 17)) \
657 x(inode_v2, BCH_VERSION(0, 18)) \
658 x(freespace, BCH_VERSION(0, 19)) \
659 x(alloc_v4, BCH_VERSION(0, 20)) \
660 x(new_data_types, BCH_VERSION(0, 21)) \
661 x(backpointers, BCH_VERSION(0, 22)) \
662 x(inode_v3, BCH_VERSION(0, 23)) \
663 x(unwritten_extents, BCH_VERSION(0, 24)) \
664 x(bucket_gens, BCH_VERSION(0, 25)) \
665 x(lru_v2, BCH_VERSION(0, 26)) \
666 x(fragmentation_lru, BCH_VERSION(0, 27)) \
667 x(no_bps_in_alloc_keys, BCH_VERSION(0, 28)) \
668 x(snapshot_trees, BCH_VERSION(0, 29)) \
669 x(major_minor, BCH_VERSION(1, 0)) \
670 x(snapshot_skiplists, BCH_VERSION(1, 1)) \
671 x(deleted_inodes, BCH_VERSION(1, 2)) \
672 x(rebalance_work, BCH_VERSION(1, 3)) \
673 x(member_seq, BCH_VERSION(1, 4)) \
674 x(subvolume_fs_parent, BCH_VERSION(1, 5)) \
675 x(btree_subvolume_children, BCH_VERSION(1, 6)) \
676 x(mi_btree_bitmap, BCH_VERSION(1, 7)) \
677 x(bucket_stripe_sectors, BCH_VERSION(1, 8)) \
678 x(disk_accounting_v2, BCH_VERSION(1, 9)) \
679 x(disk_accounting_v3, BCH_VERSION(1, 10)) \
680 x(disk_accounting_inum, BCH_VERSION(1, 11)) \
681 x(rebalance_work_acct_fix, BCH_VERSION(1, 12)) \
682 x(inode_has_child_snapshots, BCH_VERSION(1, 13)) \
683 x(backpointer_bucket_gen, BCH_VERSION(1, 14)) \
684 x(disk_accounting_big_endian, BCH_VERSION(1, 15)) \
685 x(reflink_p_may_update_opts, BCH_VERSION(1, 16)) \
686 x(inode_depth, BCH_VERSION(1, 17)) \
687 x(persistent_inode_cursors, BCH_VERSION(1, 18)) \
688 x(autofix_errors, BCH_VERSION(1, 19)) \
689 x(directory_size, BCH_VERSION(1, 20)) \
690 x(cached_backpointers, BCH_VERSION(1, 21)) \
691 x(stripe_backpointers, BCH_VERSION(1, 22)) \
692 x(stripe_lru, BCH_VERSION(1, 23)) \
693 x(casefolding, BCH_VERSION(1, 24)) \
694 x(extent_flags, BCH_VERSION(1, 25))
695
696 enum bcachefs_metadata_version {
697 bcachefs_metadata_version_min = 9,
698 #define x(t, n) bcachefs_metadata_version_##t = n,
699 BCH_METADATA_VERSIONS()
700 #undef x
701 bcachefs_metadata_version_max
702 };
703
704 static const __maybe_unused
705 unsigned bcachefs_metadata_required_upgrade_below = bcachefs_metadata_version_rebalance_work;
706
707 #define bcachefs_metadata_version_current (bcachefs_metadata_version_max - 1)
708
709 #define BCH_SB_SECTOR 8
710
711 #define BCH_SB_LAYOUT_SIZE_BITS_MAX 16 /* 32 MB */
712
713 struct bch_sb_layout {
714 __uuid_t magic; /* bcachefs superblock UUID */
715 __u8 layout_type;
716 __u8 sb_max_size_bits; /* base 2 of 512 byte sectors */
717 __u8 nr_superblocks;
718 __u8 pad[5];
719 __le64 sb_offset[61];
720 } __packed __aligned(8);
721
722 #define BCH_SB_LAYOUT_SECTOR 7
723
724 /*
725 * @offset - sector where this sb was written
726 * @version - on disk format version
727 * @version_min - Oldest metadata version this filesystem contains; so we can
728 * safely drop compatibility code and refuse to mount filesystems
729 * we'd need it for
730 * @magic - identifies as a bcachefs superblock (BCHFS_MAGIC)
731 * @seq - incremented each time superblock is written
732 * @uuid - used for generating various magic numbers and identifying
733 * member devices, never changes
734 * @user_uuid - user visible UUID, may be changed
735 * @label - filesystem label
736 * @seq - identifies most recent superblock, incremented each time
737 * superblock is written
738 * @features - enabled incompatible features
739 */
740 struct bch_sb {
741 struct bch_csum csum;
742 __le16 version;
743 __le16 version_min;
744 __le16 pad[2];
745 __uuid_t magic;
746 __uuid_t uuid;
747 __uuid_t user_uuid;
748 __u8 label[BCH_SB_LABEL_SIZE];
749 __le64 offset;
750 __le64 seq;
751
752 __le16 block_size;
753 __u8 dev_idx;
754 __u8 nr_devices;
755 __le32 u64s;
756
757 __le64 time_base_lo;
758 __le32 time_base_hi;
759 __le32 time_precision;
760
761 __le64 flags[7];
762 __le64 write_time;
763 __le64 features[2];
764 __le64 compat[2];
765
766 struct bch_sb_layout layout;
767
768 struct bch_sb_field start[0];
769 __le64 _data[];
770 } __packed __aligned(8);
771
772 /*
773 * Flags:
774 * BCH_SB_INITALIZED - set on first mount
775 * BCH_SB_CLEAN - did we shut down cleanly? Just a hint, doesn't affect
776 * behaviour of mount/recovery path:
777 * BCH_SB_INODE_32BIT - limit inode numbers to 32 bits
778 * BCH_SB_128_BIT_MACS - 128 bit macs instead of 80
779 * BCH_SB_ENCRYPTION_TYPE - if nonzero encryption is enabled; overrides
780 * DATA/META_CSUM_TYPE. Also indicates encryption
781 * algorithm in use, if/when we get more than one
782 */
783
784 LE16_BITMASK(BCH_SB_BLOCK_SIZE, struct bch_sb, block_size, 0, 16);
785
786 LE64_BITMASK(BCH_SB_INITIALIZED, struct bch_sb, flags[0], 0, 1);
787 LE64_BITMASK(BCH_SB_CLEAN, struct bch_sb, flags[0], 1, 2);
788 LE64_BITMASK(BCH_SB_CSUM_TYPE, struct bch_sb, flags[0], 2, 8);
789 LE64_BITMASK(BCH_SB_ERROR_ACTION, struct bch_sb, flags[0], 8, 12);
790
791 LE64_BITMASK(BCH_SB_BTREE_NODE_SIZE, struct bch_sb, flags[0], 12, 28);
792
793 LE64_BITMASK(BCH_SB_GC_RESERVE, struct bch_sb, flags[0], 28, 33);
794 LE64_BITMASK(BCH_SB_ROOT_RESERVE, struct bch_sb, flags[0], 33, 40);
795
796 LE64_BITMASK(BCH_SB_META_CSUM_TYPE, struct bch_sb, flags[0], 40, 44);
797 LE64_BITMASK(BCH_SB_DATA_CSUM_TYPE, struct bch_sb, flags[0], 44, 48);
798
799 LE64_BITMASK(BCH_SB_META_REPLICAS_WANT, struct bch_sb, flags[0], 48, 52);
800 LE64_BITMASK(BCH_SB_DATA_REPLICAS_WANT, struct bch_sb, flags[0], 52, 56);
801
802 LE64_BITMASK(BCH_SB_POSIX_ACL, struct bch_sb, flags[0], 56, 57);
803 LE64_BITMASK(BCH_SB_USRQUOTA, struct bch_sb, flags[0], 57, 58);
804 LE64_BITMASK(BCH_SB_GRPQUOTA, struct bch_sb, flags[0], 58, 59);
805 LE64_BITMASK(BCH_SB_PRJQUOTA, struct bch_sb, flags[0], 59, 60);
806
807 LE64_BITMASK(BCH_SB_HAS_ERRORS, struct bch_sb, flags[0], 60, 61);
808 LE64_BITMASK(BCH_SB_HAS_TOPOLOGY_ERRORS,struct bch_sb, flags[0], 61, 62);
809
810 LE64_BITMASK(BCH_SB_BIG_ENDIAN, struct bch_sb, flags[0], 62, 63);
811 LE64_BITMASK(BCH_SB_PROMOTE_WHOLE_EXTENTS,
812 struct bch_sb, flags[0], 63, 64);
813
814 LE64_BITMASK(BCH_SB_STR_HASH_TYPE, struct bch_sb, flags[1], 0, 4);
815 LE64_BITMASK(BCH_SB_COMPRESSION_TYPE_LO,struct bch_sb, flags[1], 4, 8);
816 LE64_BITMASK(BCH_SB_INODE_32BIT, struct bch_sb, flags[1], 8, 9);
817
818 LE64_BITMASK(BCH_SB_128_BIT_MACS, struct bch_sb, flags[1], 9, 10);
819 LE64_BITMASK(BCH_SB_ENCRYPTION_TYPE, struct bch_sb, flags[1], 10, 14);
820
821 /*
822 * Max size of an extent that may require bouncing to read or write
823 * (checksummed, compressed): 64k
824 */
825 LE64_BITMASK(BCH_SB_ENCODED_EXTENT_MAX_BITS,
826 struct bch_sb, flags[1], 14, 20);
827
828 LE64_BITMASK(BCH_SB_META_REPLICAS_REQ, struct bch_sb, flags[1], 20, 24);
829 LE64_BITMASK(BCH_SB_DATA_REPLICAS_REQ, struct bch_sb, flags[1], 24, 28);
830
831 LE64_BITMASK(BCH_SB_PROMOTE_TARGET, struct bch_sb, flags[1], 28, 40);
832 LE64_BITMASK(BCH_SB_FOREGROUND_TARGET, struct bch_sb, flags[1], 40, 52);
833 LE64_BITMASK(BCH_SB_BACKGROUND_TARGET, struct bch_sb, flags[1], 52, 64);
834
835 LE64_BITMASK(BCH_SB_BACKGROUND_COMPRESSION_TYPE_LO,
836 struct bch_sb, flags[2], 0, 4);
837 LE64_BITMASK(BCH_SB_GC_RESERVE_BYTES, struct bch_sb, flags[2], 4, 64);
838
839 LE64_BITMASK(BCH_SB_ERASURE_CODE, struct bch_sb, flags[3], 0, 16);
840 LE64_BITMASK(BCH_SB_METADATA_TARGET, struct bch_sb, flags[3], 16, 28);
841 LE64_BITMASK(BCH_SB_SHARD_INUMS, struct bch_sb, flags[3], 28, 29);
842 LE64_BITMASK(BCH_SB_INODES_USE_KEY_CACHE,struct bch_sb, flags[3], 29, 30);
843 LE64_BITMASK(BCH_SB_JOURNAL_FLUSH_DELAY,struct bch_sb, flags[3], 30, 62);
844 LE64_BITMASK(BCH_SB_JOURNAL_FLUSH_DISABLED,struct bch_sb, flags[3], 62, 63);
845 /* one free bit */
846 LE64_BITMASK(BCH_SB_JOURNAL_RECLAIM_DELAY,struct bch_sb, flags[4], 0, 32);
847 LE64_BITMASK(BCH_SB_JOURNAL_TRANSACTION_NAMES,struct bch_sb, flags[4], 32, 33);
848 LE64_BITMASK(BCH_SB_NOCOW, struct bch_sb, flags[4], 33, 34);
849 LE64_BITMASK(BCH_SB_WRITE_BUFFER_SIZE, struct bch_sb, flags[4], 34, 54);
850 LE64_BITMASK(BCH_SB_VERSION_UPGRADE, struct bch_sb, flags[4], 54, 56);
851
852 LE64_BITMASK(BCH_SB_COMPRESSION_TYPE_HI,struct bch_sb, flags[4], 56, 60);
853 LE64_BITMASK(BCH_SB_BACKGROUND_COMPRESSION_TYPE_HI,
854 struct bch_sb, flags[4], 60, 64);
855
856 LE64_BITMASK(BCH_SB_VERSION_UPGRADE_COMPLETE,
857 struct bch_sb, flags[5], 0, 16);
858 LE64_BITMASK(BCH_SB_ALLOCATOR_STUCK_TIMEOUT,
859 struct bch_sb, flags[5], 16, 32);
860 LE64_BITMASK(BCH_SB_VERSION_INCOMPAT, struct bch_sb, flags[5], 32, 48);
861 LE64_BITMASK(BCH_SB_VERSION_INCOMPAT_ALLOWED,
862 struct bch_sb, flags[5], 48, 64);
863 LE64_BITMASK(BCH_SB_SHARD_INUMS_NBITS, struct bch_sb, flags[6], 0, 4);
864 LE64_BITMASK(BCH_SB_WRITE_ERROR_TIMEOUT,struct bch_sb, flags[6], 4, 14);
865 LE64_BITMASK(BCH_SB_CSUM_ERR_RETRY_NR, struct bch_sb, flags[6], 14, 20);
866
BCH_SB_COMPRESSION_TYPE(const struct bch_sb * sb)867 static inline __u64 BCH_SB_COMPRESSION_TYPE(const struct bch_sb *sb)
868 {
869 return BCH_SB_COMPRESSION_TYPE_LO(sb) | (BCH_SB_COMPRESSION_TYPE_HI(sb) << 4);
870 }
871
SET_BCH_SB_COMPRESSION_TYPE(struct bch_sb * sb,__u64 v)872 static inline void SET_BCH_SB_COMPRESSION_TYPE(struct bch_sb *sb, __u64 v)
873 {
874 SET_BCH_SB_COMPRESSION_TYPE_LO(sb, v);
875 SET_BCH_SB_COMPRESSION_TYPE_HI(sb, v >> 4);
876 }
877
BCH_SB_BACKGROUND_COMPRESSION_TYPE(const struct bch_sb * sb)878 static inline __u64 BCH_SB_BACKGROUND_COMPRESSION_TYPE(const struct bch_sb *sb)
879 {
880 return BCH_SB_BACKGROUND_COMPRESSION_TYPE_LO(sb) |
881 (BCH_SB_BACKGROUND_COMPRESSION_TYPE_HI(sb) << 4);
882 }
883
SET_BCH_SB_BACKGROUND_COMPRESSION_TYPE(struct bch_sb * sb,__u64 v)884 static inline void SET_BCH_SB_BACKGROUND_COMPRESSION_TYPE(struct bch_sb *sb, __u64 v)
885 {
886 SET_BCH_SB_BACKGROUND_COMPRESSION_TYPE_LO(sb, v);
887 SET_BCH_SB_BACKGROUND_COMPRESSION_TYPE_HI(sb, v >> 4);
888 }
889
890 /*
891 * Features:
892 *
893 * journal_seq_blacklist_v3: gates BCH_SB_FIELD_journal_seq_blacklist
894 * reflink: gates KEY_TYPE_reflink
895 * inline_data: gates KEY_TYPE_inline_data
896 * new_siphash: gates BCH_STR_HASH_siphash
897 * new_extent_overwrite: gates BTREE_NODE_NEW_EXTENT_OVERWRITE
898 */
899 #define BCH_SB_FEATURES() \
900 x(lz4, 0) \
901 x(gzip, 1) \
902 x(zstd, 2) \
903 x(atomic_nlink, 3) \
904 x(ec, 4) \
905 x(journal_seq_blacklist_v3, 5) \
906 x(reflink, 6) \
907 x(new_siphash, 7) \
908 x(inline_data, 8) \
909 x(new_extent_overwrite, 9) \
910 x(incompressible, 10) \
911 x(btree_ptr_v2, 11) \
912 x(extents_above_btree_updates, 12) \
913 x(btree_updates_journalled, 13) \
914 x(reflink_inline_data, 14) \
915 x(new_varint, 15) \
916 x(journal_no_flush, 16) \
917 x(alloc_v2, 17) \
918 x(extents_across_btree_nodes, 18) \
919 x(incompat_version_field, 19) \
920 x(casefolding, 20)
921
922 #define BCH_SB_FEATURES_ALWAYS \
923 (BIT_ULL(BCH_FEATURE_new_extent_overwrite)| \
924 BIT_ULL(BCH_FEATURE_extents_above_btree_updates)|\
925 BIT_ULL(BCH_FEATURE_btree_updates_journalled)|\
926 BIT_ULL(BCH_FEATURE_alloc_v2)|\
927 BIT_ULL(BCH_FEATURE_extents_across_btree_nodes))
928
929 #define BCH_SB_FEATURES_ALL \
930 (BCH_SB_FEATURES_ALWAYS| \
931 BIT_ULL(BCH_FEATURE_new_siphash)| \
932 BIT_ULL(BCH_FEATURE_btree_ptr_v2)| \
933 BIT_ULL(BCH_FEATURE_new_varint)| \
934 BIT_ULL(BCH_FEATURE_journal_no_flush)| \
935 BIT_ULL(BCH_FEATURE_incompat_version_field))
936
937 enum bch_sb_feature {
938 #define x(f, n) BCH_FEATURE_##f,
939 BCH_SB_FEATURES()
940 #undef x
941 BCH_FEATURE_NR,
942 };
943
944 #define BCH_SB_COMPAT() \
945 x(alloc_info, 0) \
946 x(alloc_metadata, 1) \
947 x(extents_above_btree_updates_done, 2) \
948 x(bformat_overflow_done, 3)
949
950 enum bch_sb_compat {
951 #define x(f, n) BCH_COMPAT_##f,
952 BCH_SB_COMPAT()
953 #undef x
954 BCH_COMPAT_NR,
955 };
956
957 /* options: */
958
959 #define BCH_VERSION_UPGRADE_OPTS() \
960 x(compatible, 0) \
961 x(incompatible, 1) \
962 x(none, 2)
963
964 enum bch_version_upgrade_opts {
965 #define x(t, n) BCH_VERSION_UPGRADE_##t = n,
966 BCH_VERSION_UPGRADE_OPTS()
967 #undef x
968 };
969
970 #define BCH_REPLICAS_MAX 4U
971
972 #define BCH_BKEY_PTRS_MAX 16U
973
974 #define BCH_ERROR_ACTIONS() \
975 x(continue, 0) \
976 x(fix_safe, 1) \
977 x(panic, 2) \
978 x(ro, 3)
979
980 enum bch_error_actions {
981 #define x(t, n) BCH_ON_ERROR_##t = n,
982 BCH_ERROR_ACTIONS()
983 #undef x
984 BCH_ON_ERROR_NR
985 };
986
987 #define BCH_STR_HASH_TYPES() \
988 x(crc32c, 0) \
989 x(crc64, 1) \
990 x(siphash_old, 2) \
991 x(siphash, 3)
992
993 enum bch_str_hash_type {
994 #define x(t, n) BCH_STR_HASH_##t = n,
995 BCH_STR_HASH_TYPES()
996 #undef x
997 BCH_STR_HASH_NR
998 };
999
1000 #define BCH_STR_HASH_OPTS() \
1001 x(crc32c, 0) \
1002 x(crc64, 1) \
1003 x(siphash, 2)
1004
1005 enum bch_str_hash_opts {
1006 #define x(t, n) BCH_STR_HASH_OPT_##t = n,
1007 BCH_STR_HASH_OPTS()
1008 #undef x
1009 BCH_STR_HASH_OPT_NR
1010 };
1011
1012 #define BCH_CSUM_TYPES() \
1013 x(none, 0) \
1014 x(crc32c_nonzero, 1) \
1015 x(crc64_nonzero, 2) \
1016 x(chacha20_poly1305_80, 3) \
1017 x(chacha20_poly1305_128, 4) \
1018 x(crc32c, 5) \
1019 x(crc64, 6) \
1020 x(xxhash, 7)
1021
1022 enum bch_csum_type {
1023 #define x(t, n) BCH_CSUM_##t = n,
1024 BCH_CSUM_TYPES()
1025 #undef x
1026 BCH_CSUM_NR
1027 };
1028
1029 static const __maybe_unused unsigned bch_crc_bytes[] = {
1030 [BCH_CSUM_none] = 0,
1031 [BCH_CSUM_crc32c_nonzero] = 4,
1032 [BCH_CSUM_crc32c] = 4,
1033 [BCH_CSUM_crc64_nonzero] = 8,
1034 [BCH_CSUM_crc64] = 8,
1035 [BCH_CSUM_xxhash] = 8,
1036 [BCH_CSUM_chacha20_poly1305_80] = 10,
1037 [BCH_CSUM_chacha20_poly1305_128] = 16,
1038 };
1039
bch2_csum_type_is_encryption(enum bch_csum_type type)1040 static inline _Bool bch2_csum_type_is_encryption(enum bch_csum_type type)
1041 {
1042 switch (type) {
1043 case BCH_CSUM_chacha20_poly1305_80:
1044 case BCH_CSUM_chacha20_poly1305_128:
1045 return true;
1046 default:
1047 return false;
1048 }
1049 }
1050
1051 #define BCH_CSUM_OPTS() \
1052 x(none, 0) \
1053 x(crc32c, 1) \
1054 x(crc64, 2) \
1055 x(xxhash, 3)
1056
1057 enum bch_csum_opt {
1058 #define x(t, n) BCH_CSUM_OPT_##t = n,
1059 BCH_CSUM_OPTS()
1060 #undef x
1061 BCH_CSUM_OPT_NR
1062 };
1063
1064 #define BCH_COMPRESSION_TYPES() \
1065 x(none, 0) \
1066 x(lz4_old, 1) \
1067 x(gzip, 2) \
1068 x(lz4, 3) \
1069 x(zstd, 4) \
1070 x(incompressible, 5)
1071
1072 enum bch_compression_type {
1073 #define x(t, n) BCH_COMPRESSION_TYPE_##t = n,
1074 BCH_COMPRESSION_TYPES()
1075 #undef x
1076 BCH_COMPRESSION_TYPE_NR
1077 };
1078
1079 #define BCH_COMPRESSION_OPTS() \
1080 x(none, 0) \
1081 x(lz4, 1) \
1082 x(gzip, 2) \
1083 x(zstd, 3)
1084
1085 enum bch_compression_opts {
1086 #define x(t, n) BCH_COMPRESSION_OPT_##t = n,
1087 BCH_COMPRESSION_OPTS()
1088 #undef x
1089 BCH_COMPRESSION_OPT_NR
1090 };
1091
1092 /*
1093 * Magic numbers
1094 *
1095 * The various other data structures have their own magic numbers, which are
1096 * xored with the first part of the cache set's UUID
1097 */
1098
1099 #define BCACHE_MAGIC \
1100 UUID_INIT(0xc68573f6, 0x4e1a, 0x45ca, \
1101 0x82, 0x65, 0xf5, 0x7f, 0x48, 0xba, 0x6d, 0x81)
1102 #define BCHFS_MAGIC \
1103 UUID_INIT(0xc68573f6, 0x66ce, 0x90a9, \
1104 0xd9, 0x6a, 0x60, 0xcf, 0x80, 0x3d, 0xf7, 0xef)
1105
1106 #define BCACHEFS_STATFS_MAGIC BCACHEFS_SUPER_MAGIC
1107
1108 #define JSET_MAGIC __cpu_to_le64(0x245235c1a3625032ULL)
1109 #define BSET_MAGIC __cpu_to_le64(0x90135c78b99e07f5ULL)
1110
__bch2_sb_magic(struct bch_sb * sb)1111 static inline __le64 __bch2_sb_magic(struct bch_sb *sb)
1112 {
1113 __le64 ret;
1114
1115 memcpy(&ret, &sb->uuid, sizeof(ret));
1116 return ret;
1117 }
1118
__jset_magic(struct bch_sb * sb)1119 static inline __u64 __jset_magic(struct bch_sb *sb)
1120 {
1121 return __le64_to_cpu(__bch2_sb_magic(sb) ^ JSET_MAGIC);
1122 }
1123
__bset_magic(struct bch_sb * sb)1124 static inline __u64 __bset_magic(struct bch_sb *sb)
1125 {
1126 return __le64_to_cpu(__bch2_sb_magic(sb) ^ BSET_MAGIC);
1127 }
1128
1129 /* Journal */
1130
1131 #define JSET_KEYS_U64s (sizeof(struct jset_entry) / sizeof(__u64))
1132
1133 #define BCH_JSET_ENTRY_TYPES() \
1134 x(btree_keys, 0) \
1135 x(btree_root, 1) \
1136 x(prio_ptrs, 2) \
1137 x(blacklist, 3) \
1138 x(blacklist_v2, 4) \
1139 x(usage, 5) \
1140 x(data_usage, 6) \
1141 x(clock, 7) \
1142 x(dev_usage, 8) \
1143 x(log, 9) \
1144 x(overwrite, 10) \
1145 x(write_buffer_keys, 11) \
1146 x(datetime, 12)
1147
1148 enum bch_jset_entry_type {
1149 #define x(f, nr) BCH_JSET_ENTRY_##f = nr,
1150 BCH_JSET_ENTRY_TYPES()
1151 #undef x
1152 BCH_JSET_ENTRY_NR
1153 };
1154
jset_entry_is_key(struct jset_entry * e)1155 static inline bool jset_entry_is_key(struct jset_entry *e)
1156 {
1157 switch (e->type) {
1158 case BCH_JSET_ENTRY_btree_keys:
1159 case BCH_JSET_ENTRY_btree_root:
1160 case BCH_JSET_ENTRY_write_buffer_keys:
1161 return true;
1162 }
1163
1164 return false;
1165 }
1166
1167 /*
1168 * Journal sequence numbers can be blacklisted: bsets record the max sequence
1169 * number of all the journal entries they contain updates for, so that on
1170 * recovery we can ignore those bsets that contain index updates newer that what
1171 * made it into the journal.
1172 *
1173 * This means that we can't reuse that journal_seq - we have to skip it, and
1174 * then record that we skipped it so that the next time we crash and recover we
1175 * don't think there was a missing journal entry.
1176 */
1177 struct jset_entry_blacklist {
1178 struct jset_entry entry;
1179 __le64 seq;
1180 };
1181
1182 struct jset_entry_blacklist_v2 {
1183 struct jset_entry entry;
1184 __le64 start;
1185 __le64 end;
1186 };
1187
1188 #define BCH_FS_USAGE_TYPES() \
1189 x(reserved, 0) \
1190 x(inodes, 1) \
1191 x(key_version, 2)
1192
1193 enum bch_fs_usage_type {
1194 #define x(f, nr) BCH_FS_USAGE_##f = nr,
1195 BCH_FS_USAGE_TYPES()
1196 #undef x
1197 BCH_FS_USAGE_NR
1198 };
1199
1200 struct jset_entry_usage {
1201 struct jset_entry entry;
1202 __le64 v;
1203 } __packed;
1204
1205 struct jset_entry_data_usage {
1206 struct jset_entry entry;
1207 __le64 v;
1208 struct bch_replicas_entry_v1 r;
1209 } __packed;
1210
1211 struct jset_entry_clock {
1212 struct jset_entry entry;
1213 __u8 rw;
1214 __u8 pad[7];
1215 __le64 time;
1216 } __packed;
1217
1218 struct jset_entry_dev_usage_type {
1219 __le64 buckets;
1220 __le64 sectors;
1221 __le64 fragmented;
1222 } __packed;
1223
1224 struct jset_entry_dev_usage {
1225 struct jset_entry entry;
1226 __le32 dev;
1227 __u32 pad;
1228
1229 __le64 _buckets_ec; /* No longer used */
1230 __le64 _buckets_unavailable; /* No longer used */
1231
1232 struct jset_entry_dev_usage_type d[];
1233 };
1234
jset_entry_dev_usage_nr_types(struct jset_entry_dev_usage * u)1235 static inline unsigned jset_entry_dev_usage_nr_types(struct jset_entry_dev_usage *u)
1236 {
1237 return (vstruct_bytes(&u->entry) - sizeof(struct jset_entry_dev_usage)) /
1238 sizeof(struct jset_entry_dev_usage_type);
1239 }
1240
1241 struct jset_entry_log {
1242 struct jset_entry entry;
1243 u8 d[];
1244 } __packed __aligned(8);
1245
jset_entry_log_msg_bytes(struct jset_entry_log * l)1246 static inline unsigned jset_entry_log_msg_bytes(struct jset_entry_log *l)
1247 {
1248 unsigned b = vstruct_bytes(&l->entry) - offsetof(struct jset_entry_log, d);
1249
1250 while (b && !l->d[b - 1])
1251 --b;
1252 return b;
1253 }
1254
1255 struct jset_entry_datetime {
1256 struct jset_entry entry;
1257 __le64 seconds;
1258 } __packed __aligned(8);
1259
1260 /*
1261 * On disk format for a journal entry:
1262 * seq is monotonically increasing; every journal entry has its own unique
1263 * sequence number.
1264 *
1265 * last_seq is the oldest journal entry that still has keys the btree hasn't
1266 * flushed to disk yet.
1267 *
1268 * version is for on disk format changes.
1269 */
1270 struct jset {
1271 struct bch_csum csum;
1272
1273 __le64 magic;
1274 __le64 seq;
1275 __le32 version;
1276 __le32 flags;
1277
1278 __le32 u64s; /* size of d[] in u64s */
1279
1280 __u8 encrypted_start[0];
1281
1282 __le16 _read_clock; /* no longer used */
1283 __le16 _write_clock;
1284
1285 /* Sequence number of oldest dirty journal entry */
1286 __le64 last_seq;
1287
1288
1289 struct jset_entry start[0];
1290 __u64 _data[];
1291 } __packed __aligned(8);
1292
1293 LE32_BITMASK(JSET_CSUM_TYPE, struct jset, flags, 0, 4);
1294 LE32_BITMASK(JSET_BIG_ENDIAN, struct jset, flags, 4, 5);
1295 LE32_BITMASK(JSET_NO_FLUSH, struct jset, flags, 5, 6);
1296
1297 #define BCH_JOURNAL_BUCKETS_MIN 8
1298
1299 /* Btree: */
1300
1301 enum btree_id_flags {
1302 BTREE_IS_extents = BIT(0),
1303 BTREE_IS_snapshots = BIT(1),
1304 BTREE_IS_snapshot_field = BIT(2),
1305 BTREE_IS_data = BIT(3),
1306 BTREE_IS_write_buffer = BIT(4),
1307 };
1308
1309 #define BCH_BTREE_IDS() \
1310 x(extents, 0, \
1311 BTREE_IS_extents| \
1312 BTREE_IS_snapshots| \
1313 BTREE_IS_data, \
1314 BIT_ULL(KEY_TYPE_whiteout)| \
1315 BIT_ULL(KEY_TYPE_error)| \
1316 BIT_ULL(KEY_TYPE_cookie)| \
1317 BIT_ULL(KEY_TYPE_extent)| \
1318 BIT_ULL(KEY_TYPE_reservation)| \
1319 BIT_ULL(KEY_TYPE_reflink_p)| \
1320 BIT_ULL(KEY_TYPE_inline_data)) \
1321 x(inodes, 1, \
1322 BTREE_IS_snapshots, \
1323 BIT_ULL(KEY_TYPE_whiteout)| \
1324 BIT_ULL(KEY_TYPE_inode)| \
1325 BIT_ULL(KEY_TYPE_inode_v2)| \
1326 BIT_ULL(KEY_TYPE_inode_v3)| \
1327 BIT_ULL(KEY_TYPE_inode_generation)) \
1328 x(dirents, 2, \
1329 BTREE_IS_snapshots, \
1330 BIT_ULL(KEY_TYPE_whiteout)| \
1331 BIT_ULL(KEY_TYPE_hash_whiteout)| \
1332 BIT_ULL(KEY_TYPE_dirent)) \
1333 x(xattrs, 3, \
1334 BTREE_IS_snapshots, \
1335 BIT_ULL(KEY_TYPE_whiteout)| \
1336 BIT_ULL(KEY_TYPE_cookie)| \
1337 BIT_ULL(KEY_TYPE_hash_whiteout)| \
1338 BIT_ULL(KEY_TYPE_xattr)) \
1339 x(alloc, 4, 0, \
1340 BIT_ULL(KEY_TYPE_alloc)| \
1341 BIT_ULL(KEY_TYPE_alloc_v2)| \
1342 BIT_ULL(KEY_TYPE_alloc_v3)| \
1343 BIT_ULL(KEY_TYPE_alloc_v4)) \
1344 x(quotas, 5, 0, \
1345 BIT_ULL(KEY_TYPE_quota)) \
1346 x(stripes, 6, 0, \
1347 BIT_ULL(KEY_TYPE_stripe)) \
1348 x(reflink, 7, \
1349 BTREE_IS_extents| \
1350 BTREE_IS_data, \
1351 BIT_ULL(KEY_TYPE_reflink_v)| \
1352 BIT_ULL(KEY_TYPE_indirect_inline_data)| \
1353 BIT_ULL(KEY_TYPE_error)) \
1354 x(subvolumes, 8, 0, \
1355 BIT_ULL(KEY_TYPE_subvolume)) \
1356 x(snapshots, 9, 0, \
1357 BIT_ULL(KEY_TYPE_snapshot)) \
1358 x(lru, 10, \
1359 BTREE_IS_write_buffer, \
1360 BIT_ULL(KEY_TYPE_set)) \
1361 x(freespace, 11, \
1362 BTREE_IS_extents, \
1363 BIT_ULL(KEY_TYPE_set)) \
1364 x(need_discard, 12, 0, \
1365 BIT_ULL(KEY_TYPE_set)) \
1366 x(backpointers, 13, \
1367 BTREE_IS_write_buffer, \
1368 BIT_ULL(KEY_TYPE_backpointer)) \
1369 x(bucket_gens, 14, 0, \
1370 BIT_ULL(KEY_TYPE_bucket_gens)) \
1371 x(snapshot_trees, 15, 0, \
1372 BIT_ULL(KEY_TYPE_snapshot_tree)) \
1373 x(deleted_inodes, 16, \
1374 BTREE_IS_snapshot_field| \
1375 BTREE_IS_write_buffer, \
1376 BIT_ULL(KEY_TYPE_set)) \
1377 x(logged_ops, 17, 0, \
1378 BIT_ULL(KEY_TYPE_logged_op_truncate)| \
1379 BIT_ULL(KEY_TYPE_logged_op_finsert)| \
1380 BIT_ULL(KEY_TYPE_inode_alloc_cursor)) \
1381 x(rebalance_work, 18, \
1382 BTREE_IS_snapshot_field| \
1383 BTREE_IS_write_buffer, \
1384 BIT_ULL(KEY_TYPE_set)|BIT_ULL(KEY_TYPE_cookie)) \
1385 x(subvolume_children, 19, 0, \
1386 BIT_ULL(KEY_TYPE_set)) \
1387 x(accounting, 20, \
1388 BTREE_IS_snapshot_field| \
1389 BTREE_IS_write_buffer, \
1390 BIT_ULL(KEY_TYPE_accounting)) \
1391
1392 enum btree_id {
1393 #define x(name, nr, ...) BTREE_ID_##name = nr,
1394 BCH_BTREE_IDS()
1395 #undef x
1396 BTREE_ID_NR
1397 };
1398
1399 /*
1400 * Maximum number of btrees that we will _ever_ have under the current scheme,
1401 * where we refer to them with 64 bit bitfields - and we also need a bit for
1402 * the interior btree node type:
1403 */
1404 #define BTREE_ID_NR_MAX 63
1405
btree_id_is_alloc(enum btree_id id)1406 static inline bool btree_id_is_alloc(enum btree_id id)
1407 {
1408 switch (id) {
1409 case BTREE_ID_alloc:
1410 case BTREE_ID_backpointers:
1411 case BTREE_ID_need_discard:
1412 case BTREE_ID_freespace:
1413 case BTREE_ID_bucket_gens:
1414 case BTREE_ID_lru:
1415 case BTREE_ID_accounting:
1416 return true;
1417 default:
1418 return false;
1419 }
1420 }
1421
1422 #define BTREE_MAX_DEPTH 4U
1423
1424 /* Btree nodes */
1425
1426 /*
1427 * Btree nodes
1428 *
1429 * On disk a btree node is a list/log of these; within each set the keys are
1430 * sorted
1431 */
1432 struct bset {
1433 __le64 seq;
1434
1435 /*
1436 * Highest journal entry this bset contains keys for.
1437 * If on recovery we don't see that journal entry, this bset is ignored:
1438 * this allows us to preserve the order of all index updates after a
1439 * crash, since the journal records a total order of all index updates
1440 * and anything that didn't make it to the journal doesn't get used.
1441 */
1442 __le64 journal_seq;
1443
1444 __le32 flags;
1445 __le16 version;
1446 __le16 u64s; /* count of d[] in u64s */
1447
1448 struct bkey_packed start[0];
1449 __u64 _data[];
1450 } __packed __aligned(8);
1451
1452 LE32_BITMASK(BSET_CSUM_TYPE, struct bset, flags, 0, 4);
1453
1454 LE32_BITMASK(BSET_BIG_ENDIAN, struct bset, flags, 4, 5);
1455 LE32_BITMASK(BSET_SEPARATE_WHITEOUTS,
1456 struct bset, flags, 5, 6);
1457
1458 /* Sector offset within the btree node: */
1459 LE32_BITMASK(BSET_OFFSET, struct bset, flags, 16, 32);
1460
1461 struct btree_node {
1462 struct bch_csum csum;
1463 __le64 magic;
1464
1465 /* this flags field is encrypted, unlike bset->flags: */
1466 __le64 flags;
1467
1468 /* Closed interval: */
1469 struct bpos min_key;
1470 struct bpos max_key;
1471 struct bch_extent_ptr _ptr; /* not used anymore */
1472 struct bkey_format format;
1473
1474 union {
1475 struct bset keys;
1476 struct {
1477 __u8 pad[22];
1478 __le16 u64s;
1479 __u64 _data[0];
1480
1481 };
1482 };
1483 } __packed __aligned(8);
1484
1485 LE64_BITMASK(BTREE_NODE_ID_LO, struct btree_node, flags, 0, 4);
1486 LE64_BITMASK(BTREE_NODE_LEVEL, struct btree_node, flags, 4, 8);
1487 LE64_BITMASK(BTREE_NODE_NEW_EXTENT_OVERWRITE,
1488 struct btree_node, flags, 8, 9);
1489 LE64_BITMASK(BTREE_NODE_ID_HI, struct btree_node, flags, 9, 25);
1490 /* 25-32 unused */
1491 LE64_BITMASK(BTREE_NODE_SEQ, struct btree_node, flags, 32, 64);
1492
BTREE_NODE_ID(struct btree_node * n)1493 static inline __u64 BTREE_NODE_ID(struct btree_node *n)
1494 {
1495 return BTREE_NODE_ID_LO(n) | (BTREE_NODE_ID_HI(n) << 4);
1496 }
1497
SET_BTREE_NODE_ID(struct btree_node * n,__u64 v)1498 static inline void SET_BTREE_NODE_ID(struct btree_node *n, __u64 v)
1499 {
1500 SET_BTREE_NODE_ID_LO(n, v);
1501 SET_BTREE_NODE_ID_HI(n, v >> 4);
1502 }
1503
1504 struct btree_node_entry {
1505 struct bch_csum csum;
1506
1507 union {
1508 struct bset keys;
1509 struct {
1510 __u8 pad[22];
1511 __le16 u64s;
1512 __u64 _data[0];
1513 };
1514 };
1515 } __packed __aligned(8);
1516
1517 #endif /* _BCACHEFS_FORMAT_H */
1518