2 * Copyright (c) 2011-2012 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@dragonflybsd.org>
6 * by Venkatesh Srinivas <vsrinivas@dragonflybsd.org>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
18 * 3. Neither the name of The DragonFly Project nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific, prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
31 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #ifndef VFS_HAMMER2_DISK_H_
36 #define VFS_HAMMER2_DISK_H_
39 * The structures below represent the on-disk media structures for the HAMMER2
40 * filesystem. Note that all fields for on-disk structures are naturally
41 * aligned. The host endian format is typically used - compatibility is
42 * possible if the implementation detects reversed endian and adjusts accesses
45 * HAMMER2 primarily revolves around the directory topology: inodes,
46 * directory entries, and block tables. Block device buffer cache buffers
47 * are always 64KB. Logical file buffers are typically 16KB. All data
48 * references utilize 64-bit byte offsets.
50 * Free block management is handled independently using blocks reserved by
55 * The data at the end of a file or directory may be a fragment in order
56 * to optimize storage efficiency. The minimum fragment size is 64 bytes.
57 * Since allocations are in powers of 2 fragments must also be sized in
58 * powers of 2 (64, 128, 256, ... 65536).
60 * For the moment the maximum allocation size is HAMMER2_PBUFSIZE (64K),
61 * which is 2^16. Larger extents may be supported in the future.
63 * A full indirect block uses supports 1024 x 64-byte blockrefs.
65 * A maximally sized file (2^64-1 bytes) requires 5 indirect block levels.
66 * The hammer2_blockset in the volume header or file inode has another 8
67 * entries, giving us 66+3 = 69 bits of address space. However, some bits
68 * are taken up by (potentially) requests for redundant copies. HAMMER2
69 * currently supports up to 8 copies, which brings the address space down
70 * to 66 bits and gives us 2 bits of leeway.
72 #define HAMMER2_MIN_ALLOC 64 /* minimum allocation size */
73 #define HAMMER2_MIN_RADIX 6 /* minimum allocation size 2^N */
74 #define HAMMER2_MAX_RADIX 16 /* maximum allocation size 2^N */
75 #define HAMMER2_KEY_RADIX 64 /* number of bits in key */
78 * HAMMER2 utilizes 64K physical buffers and 16K logical filesystem buffers.
79 * The smaller logical filesystem buffers reduce ram waste when the OS is
80 * caching lots of small files.
82 #define HAMMER2_PBUFRADIX 16 /* physical buf (1<<16) bytes */
83 #define HAMMER2_PBUFSIZE 65536 /* fixed physical device buffer size */
84 #define HAMMER2_LBUFRADIX 14 /* logical buf (1<<14) bytes */
85 #define HAMMER2_LBUFSIZE 16384 /* vnode/logical file buffer size */
88 * HAMMER2 processes blockrefs in sets of 8. The set is fully associative,
89 * is not sorted, and may contain holes.
91 * A full indirect block supports 1024 blockrefs.
93 * An inode embeds one set of blockrefs but may also use the data area for
94 * up to 512 bytes of direct data.
96 #define HAMMER2_SET_COUNT 8 /* direct entries & associativity */
97 #define HAMMER2_SET_RADIX 3
98 #define HAMMER2_IND_COUNT 1024 /* 1 << HAMMER2_IND_RADIX */
99 #define HAMMER2_IND_RADIX 10
100 #define HAMMER2_EMBEDDED_BYTES 512
101 #define HAMMER2_EMBEDDED_RADIX 9
103 #define HAMMER2_PBUFMASK (HAMMER2_PBUFSIZE - 1)
104 #define HAMMER2_LBUFMASK (HAMMER2_LBUFSIZE - 1)
106 #define HAMMER2_PBUFSIZE64 ((hammer2_off_t)HAMMER2_PBUFSIZE)
107 #define HAMMER2_PBUFMASK64 ((hammer2_off_t)HAMMER2_PBUFMASK)
108 #define HAMMER2_LBUFMASK64 ((hammer2_off_t)HAMMER2_LBUFMASK)
110 #define HAMMER2_UUID_STRING "5cbb9ad1-862d-11dc-a94d-01301bb8a9f5"
113 * A HAMMER2 filesystem is always sized in multiples of 8MB.
115 * A 4MB segment is reserved at the beginning of each 2GB zone. This segment
116 * contains the volume header, the free block table, and possibly other
117 * information in the future. 4MB = 64 x 64K blocks.
119 #define HAMMER2_VOLUME_ALIGN (8 * 1024 * 1024)
120 #define HAMMER2_VOLUME_ALIGN64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGN)
121 #define HAMMER2_VOLUME_ALIGNMASK (HAMMER2_VOLUME_ALIGN - 1)
122 #define HAMMER2_VOLUME_ALIGNMASK64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGNMASK)
124 #define HAMMER2_NEWFS_ALIGN (HAMMER2_VOLUME_ALIGN)
125 #define HAMMER2_NEWFS_ALIGN64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGN)
126 #define HAMMER2_NEWFS_ALIGNMASK (HAMMER2_VOLUME_ALIGN - 1)
127 #define HAMMER2_NEWFS_ALIGNMASK64 ((hammer2_off_t)HAMMER2_NEWFS_ALIGNMASK)
129 #define HAMMER2_RESERVE_BYTES64 (2LLU * 1024 * 1024 * 1024)
130 #define HAMMER2_RESERVE_MASK64 (HAMMER2_RESERVE_BYTES64 - 1)
131 #define HAMMER2_RESERVE_SEG (4 * 1024 * 1024)
132 #define HAMMER2_RESERVE_SEG64 ((hammer2_off_t)HAMMER2_RESERVE_SEG)
133 #define HAMMER2_RESERVE_BLOCKS (HAMMER2_RESERVE_SEG / HAMMER2_PBUFSIZE)
136 * Two linear areas can be reserved after the initial 2MB segment in the base
137 * zone (the one starting at offset 0). These areas are NOT managed by the
138 * block allocator and do not fall under HAMMER2 crc checking rules based
139 * at the volume header (but can be self-CRCd internally, depending).
141 #define HAMMER2_BOOT_MIN_BYTES HAMMER2_VOLUME_ALIGN
142 #define HAMMER2_BOOT_NOM_BYTES (64*1024*1024)
143 #define HAMMER2_BOOT_MAX_BYTES (256*1024*1024)
145 #define HAMMER2_REDO_MIN_BYTES HAMMER2_VOLUME_ALIGN
146 #define HAMMER2_REDO_NOM_BYTES (256*1024*1024)
147 #define HAMMER2_REDO_MAX_BYTES (1024*1024*1024)
150 * Most HAMMER2 types are implemented as unsigned 64-bit integers.
151 * Transaction ids are monotonic.
153 * We utilize 32-bit iSCSI CRCs.
155 typedef uint64_t hammer2_tid_t;
156 typedef uint64_t hammer2_off_t;
157 typedef uint64_t hammer2_key_t;
158 typedef uint32_t hammer2_crc32_t;
161 * Miscellanious ranges (all are unsigned).
163 #define HAMMER2_MIN_TID 1ULL
164 #define HAMMER2_MAX_TID 0xFFFFFFFFFFFFFFFFULL
165 #define HAMMER2_MIN_KEY 0ULL
166 #define HAMMER2_MAX_KEY 0xFFFFFFFFFFFFFFFFULL
167 #define HAMMER2_MIN_OFFSET 0ULL
168 #define HAMMER2_MAX_OFFSET 0xFFFFFFFFFFFFFFFFULL
171 * HAMMER2 data offset special cases and masking.
173 * All HAMMER2 data offsets have to be broken down into a 64K buffer base
174 * offset (HAMMER2_OFF_MASK_HI) and a 64K buffer index (HAMMER2_OFF_MASK_LO).
176 * Indexes into physical buffers are always 64-byte aligned. The low 6 bits
177 * of the data offset field specifies how large the data chunk being pointed
178 * to as a power of 2. This value typically ranges from HAMMER2_MIN_RADIX
179 * to HAMMER2_MAX_RADIX (6-16). Larger values may be supported in the future
180 * to support file extents.
182 #define HAMMER2_OFF_BAD ((hammer2_off_t)-1)
183 #define HAMMER2_OFF_MASK 0xFFFFFFFFFFFFFFC0ULL
184 #define HAMMER2_OFF_MASK_LO (HAMMER2_OFF_MASK & HAMMER2_PBUFMASK64)
185 #define HAMMER2_OFF_MASK_HI (~HAMMER2_PBUFMASK64)
186 #define HAMMER2_OFF_MASK_RADIX 0x000000000000003FULL
187 #define HAMMER2_MAX_COPIES 6
190 * HAMMER2 directory support and pre-defined keys
192 #define HAMMER2_DIRHASH_VISIBLE 0x8000000000000000ULL
193 #define HAMMER2_DIRHASH_USERMSK 0x7FFFFFFFFFFFFFFFULL
194 #define HAMMER2_DIRHASH_LOMASK 0x0000000000007FFFULL
195 #define HAMMER2_DIRHASH_HIMASK 0xFFFFFFFFFFFF0000ULL
196 #define HAMMER2_DIRHASH_FORCED 0x0000000000008000ULL /* bit forced on */
198 #define HAMMER2_SROOT_KEY 0x0000000000000000ULL /* volume to sroot */
201 * The media block reference structure. This forms the core of the HAMMER2
202 * media topology recursion. This 64-byte data structure is embedded in the
203 * volume header, in inodes (which are also directory entries), and in
206 * A blockref references a single media item, which typically can be a
207 * directory entry (aka inode), indirect block, or data block.
209 * The primary feature a blockref represents is the ability to validate
210 * the entire tree underneath it via its check code. Any modification to
211 * anything propagates up the blockref tree all the way to the root, replacing
212 * the related blocks. Propagations can shortcut to the volume root to
213 * implement the 'fast syncing' feature but this only delays the eventual
216 * The check code can be a simple 32-bit iscsi code, a 64-bit crc,
217 * or as complex as a 192 bit cryptographic hash. 192 bits is the maximum
218 * supported check code size, which is not sufficient for unverified dedup
219 * UNLESS one doesn't mind once-in-a-blue-moon data corruption (such as when
220 * farming web data). HAMMER2 has an unverified dedup feature for just this
223 struct hammer2_blockref { /* MUST BE EXACTLY 64 BYTES */
224 uint8_t type; /* type of underlying item */
225 uint8_t methods; /* check method & compression method */
226 uint8_t copyid; /* specify which copy this is */
227 uint8_t keybits; /* #of keybits masked off 0=leaf */
228 uint8_t vradix; /* virtual data/meta-data size */
229 uint8_t flags; /* blockref flags */
232 hammer2_key_t key; /* key specification */
233 hammer2_tid_t mirror_tid; /* propagate for mirror scan */
234 hammer2_tid_t modify_tid; /* modifications sans propagation */
235 hammer2_off_t data_off; /* low 6 bits is phys size (radix)*/
236 union { /* check info */
252 typedef struct hammer2_blockref hammer2_blockref_t;
254 #define HAMMER2_BREF_SYNC1 0x01 /* modification synchronized */
255 #define HAMMER2_BREF_SYNC2 0x02 /* modification committed */
256 #define HAMMER2_BREF_DESYNCCHLD 0x04 /* desynchronize children */
257 #define HAMMER2_BREF_DELETED 0x80 /* indicates a deletion */
259 #define HAMMER2_BLOCKREF_BYTES 64 /* blockref struct in bytes */
261 #define HAMMER2_BREF_TYPE_EMPTY 0
262 #define HAMMER2_BREF_TYPE_INODE 1
263 #define HAMMER2_BREF_TYPE_INDIRECT 2
264 #define HAMMER2_BREF_TYPE_DATA 3
265 #define HAMMER2_BREF_TYPE_VOLUME 255 /* pseudo-type */
267 #define HAMMER2_ENC_COMPMETHOD(n) (n)
268 #define HAMMER2_ENC_CHECKMETHOD(n) ((n) << 4)
269 #define HAMMER2_DEC_COMPMETHOD(n) ((n) & 15)
270 #define HAMMER2_DEC_CHECKMETHOD(n) (((n) >> 4) & 15)
273 * HAMMER2 block references are collected into sets of 8 blockrefs. These
274 * sets are fully associative, meaning the elements making up a set are
275 * not sorted in any way and may contain duplicate entries, holes, or
276 * entries which shortcut multiple levels of indirection. Sets are used
279 * (1) When redundancy is desired a set may contain several duplicate
280 * entries pointing to different copies of the same data. Up to 8 copies
281 * are supported but the set structure becomes a bit inefficient once
284 * (2) The blockrefs in a set can shortcut multiple levels of indirections
285 * within the bounds imposed by the parent of set.
287 * When a set fills up another level of indirection is inserted, moving
288 * some or all of the set's contents into indirect blocks placed under the
289 * set. This is a top-down approach in that indirect blocks are not created
290 * until the set actually becomes full (that is, the entries in the set can
291 * shortcut the indirect blocks when the set is not full). Depending on how
292 * things are filled multiple indirect blocks will eventually be created.
294 struct hammer2_blockset {
295 hammer2_blockref_t blockref[HAMMER2_SET_COUNT];
298 typedef struct hammer2_blockset hammer2_blockset_t;
301 * Catch programmer snafus
303 #if (1 << HAMMER2_IND_RADIX) != HAMMER2_IND_COUNT
304 #error "hammer2 indirect radix is incorrect"
306 #if (HAMMER2_IND_COUNT * 64) != HAMMER2_PBUFSIZE
307 #error "hammer2 indirect entries is incorrect"
309 #if (1 << HAMMER2_SET_RADIX) != HAMMER2_SET_COUNT
310 #error "hammer2 direct radix is incorrect"
312 #if (1 << HAMMER2_PBUFRADIX) != HAMMER2_PBUFSIZE
313 #error "HAMMER2_PBUFRADIX and HAMMER2_PBUFSIZE are inconsistent"
315 #if (1 << HAMMER2_MIN_RADIX) != HAMMER2_MIN_ALLOC
316 #error "HAMMER2_MIN_RADIX and HAMMER2_MIN_ALLOC are inconsistent"
320 * The media indirect block structure.
322 struct hammer2_indblock_data {
323 hammer2_blockref_t blockref[HAMMER2_IND_COUNT];
326 typedef struct hammer2_indblock_data hammer2_indblock_data_t;
329 * In HAMMER2 inodes ARE directory entries, with a special exception for
330 * hardlinks. The inode number is stored in the inode rather than being
331 * based on the location of the inode (since the location moves every time
332 * the inode or anything underneath the inode is modified).
334 * The inode is 1024 bytes, made up of 256 bytes of meta-data, 256 bytes
335 * for the filename, and 512 bytes worth of direct file data OR an embedded
338 * Directories represent one inode per blockref. Inodes are not laid out
339 * as a file but instead are represented by the related blockrefs. The
340 * blockrefs, in turn, are indexed by the 64-bit directory hash key. Remember
341 * that blocksets are fully associative, so a certain degree efficiency is
342 * achieved just from that.
344 * Up to 512 bytes of direct data can be embedded in an inode, and since
345 * inodes are essentially directory entries this also means that small data
346 * files end up simply being laid out linearly in the directory, resulting
347 * in fewer seeks and highly optimal access.
349 * The compression mode can be changed at any time in the inode and is
350 * recorded on a blockref-by-blockref basis.
352 * Hardlinks are supported via the inode map. Essentially the way a hardlink
353 * works is that all individual directory entries representing the same file
354 * are special cased and specify the same inode number. The actual file
355 * is placed in the nearest parent directory that is parent to all instances
356 * of the hardlink. If all hardlinks to a file are in the same directory
357 * the actual file will also be placed in that directory. This file uses
358 * the inode number as the directory entry key and is invisible to normal
359 * directory scans. Real directory entry keys are differentiated from the
360 * inode number key via bit 63. Access to the hardlink silently looks up
361 * the real file and forwards all operations to that file. Removal of the
362 * last hardlink also removes the real file.
364 #define HAMMER2_INODE_BYTES 1024 /* (asserted by code) */
365 #define HAMMER2_INODE_MAXNAME 256 /* maximum name in bytes */
366 #define HAMMER2_INODE_VERSION_ONE 1
368 struct hammer2_inode_data {
369 uint16_t version; /* 0000 inode data version */
370 uint16_t reserved02; /* 0002 */
371 uint32_t uflags; /* 0004 chflags */
372 uint32_t rmajor; /* 0008 available for device nodes */
373 uint32_t rminor; /* 000C available for device nodes */
374 uint64_t ctime; /* 0010 inode change time */
375 uint64_t mtime; /* 0018 modified time */
376 uint64_t atime; /* 0020 access time (unsupported) */
377 uint64_t btime; /* 0028 birth time */
378 uuid_t uid; /* 0030 uid / degenerate unix uid */
379 uuid_t gid; /* 0040 gid / degenerate unix gid */
381 uint8_t type; /* 0050 object type */
382 uint8_t op_flags; /* 0051 operational flags */
383 uint16_t cap_flags; /* 0052 capability flags */
384 uint32_t mode; /* 0054 unix modes (typ low 16 bits) */
386 hammer2_tid_t inum; /* 0058 inode number */
387 hammer2_off_t size; /* 0060 size of file */
388 uint64_t nlinks; /* 0068 hard links (typ only dirs) */
389 hammer2_tid_t iparent; /* 0070 parent inum (recovery only) */
390 uint64_t reserved78; /* 0078 */
392 hammer2_off_t data_quota; /* 0080 subtree quota in bytes */
393 hammer2_off_t data_count; /* 0088 subtree byte count */
394 hammer2_off_t inode_quota; /* 0090 subtree quota inode count */
395 hammer2_off_t inode_count; /* 0098 subtree inode count */
396 uint16_t name_len; /* 00A0 filename length */
397 uint8_t comp_algo; /* 00A2 compression request & algo */
398 uint8_t reservedA3; /* 00A3 */
399 uint32_t reservedA4; /* 00A4 */
400 hammer2_key_t name_key; /* 00A8 full filename key */
401 uint8_t copyids[8]; /* 00B0 request copies to (up to 8) */
402 uuid_t pfsid; /* 00B8 pfs uuid if PFSROOT */
403 uint64_t pfsinum; /* 00C8 pfs inum allocator */
404 uint64_t reservedD0; /* 00D0 */
405 uint64_t reservedD8; /* 00D8 */
406 uint64_t reservedE0; /* 00E0 */
407 uint64_t reservedE8; /* 00E8 */
408 uint64_t reservedF0; /* 00F0 */
409 uint64_t reservedF8; /* 00F8 */
411 unsigned char filename[HAMMER2_INODE_MAXNAME];
412 /* 0100-01FF (256 char, unterminated) */
413 union { /* 0200-03FF (64x8 = 512 bytes) */
414 struct hammer2_blockset blockset;
415 char data[HAMMER2_EMBEDDED_BYTES];
419 typedef struct hammer2_inode_data hammer2_inode_data_t;
421 #define HAMMER2_OPFLAG_DIRECTDATA 0x01
422 #define HAMMER2_OPFLAG_PFSROOT 0x02
424 #define HAMMER2_OBJTYPE_UNKNOWN 0
425 #define HAMMER2_OBJTYPE_DIRECTORY 1
426 #define HAMMER2_OBJTYPE_REGFILE 2
427 #define HAMMER2_OBJTYPE_FIFO 4
428 #define HAMMER2_OBJTYPE_CDEV 5
429 #define HAMMER2_OBJTYPE_BDEV 6
430 #define HAMMER2_OBJTYPE_SOFTLINK 7
431 #define HAMMER2_OBJTYPE_HARDLINK 8 /* dummy entry for hardlink */
432 #define HAMMER2_OBJTYPE_SOCKET 9
433 #define HAMMER2_OBJTYPE_WHITEOUT 10
435 #define HAMMER2_COPYID_NONE 0
436 #define HAMMER2_COPYID_LOCAL ((uint8_t)-1)
438 #define HAMMER2_COMP_NONE 0
439 #define HAMMER2_COMP_AUTOZERO 1
441 #define HAMMER2_CHECK_NONE 0
442 #define HAMMER2_CHECK_ICRC 1
445 * The allocref structure represents the allocation table. One 64K block
446 * is broken down into 4096 x 16 byte entries. Each indirect block chops
447 * 11 bits off the 64-bit storage space, with leaf entries representing
448 * 64KB blocks. So: (12, 12, 12, 12, 16) = 64 bit storage space.
450 * Each 64K freemap block breaks the 4096 entries into a 64x64 tree with
451 * big_hint1 representing the top level every 64th entry and big_hint2
452 * representing the lower level in each entry. These fields specify the
453 * largest contiguous radix (1-63) available for allocation in the related
454 * sub-tree. The largest contiguous radix available for the entire block
455 * is saved in the parent (for the root this will be alloc_blockref in the
456 * volume header). The hints may be larger than actual and will be corrected
457 * on the fly but must not be smaller. The allocator uses the hints to
458 * very quickly locate nearby blocks of the desired size.
460 * In indirect blocks the 64-bit free[_or_mask] field stores the total free
461 * space for each of the 4096 sub-nodes in bytes. The total free space
462 * represented by the indirect block is stored in its parent.
464 * Each leaf element represents a 64K block. A bitmap replaces the free space
465 * count, giving us a 1KB allocation resolution. A micro-allocation append
466 * offset replaces the icrc field. The micro-allocation feature is not
467 * currently implemented and the field will be set to 65536.
469 * The allocation map uses reserved blocks so no data block reference is
470 * required, only a bit in the flags field to specify which of two possible
471 * reserved blocks to use. This allows the allocation map to be flushed to
472 * disk with minimal synchronization.
474 struct hammer2_allocref {
475 uint32_t icrc_or_app; /* node: icrc, leaf: append offset */
477 uint8_t big_hint1; /* upper level hint */
478 uint8_t big_hint2; /* lower level hint */
479 uint64_t free_or_mask; /* node: free bytes, leaf: bitmask */
482 typedef struct hammer2_allocref hammer2_allocref_t;
485 * WARNING - allocref size x entries must equate to the hammer buffer size,
486 * and 12 bits per recursion is assumed by the allocator.
488 * ALTA-D Since no data_offset is specified flags are needed to select
489 * which sub-block to recurse down into for root & internal nodes.
490 * (only ALTA and ALTB is currently supported).
492 * LEAF Terminal entry, always set for leafs. May be used to support
493 * 4MB extent allocations and early termination in the future.
494 * (not required to shortcut allocation scans as the big_hint1/2
495 * fields are used for this).
497 #define HAMMER2_ALLOCREF_BYTES 16 /* structure size */
498 #define HAMMER2_ALLOCREF_ENTRIES 4096 /* entries */
499 #define HAMMER2_ALLOCREF_RADIX 12 /* log2(entries) */
501 #if (HAMMER2_ALLOCREF_BYTES * HAMMER2_ALLOCREF_ENTRIES) != HAMMER2_PBUFSIZE
502 #error "allocref parameters do not fit in hammer buffer"
504 #if (1 << HAMMER2_ALLOCREF_RADIX) != HAMMER2_ALLOCREF_ENTRIES
505 #error "allocref parameters are inconsistent"
508 #define HAMMER2_ALLOCREF_ALTMASK 0x0003 /* select block for recurse */
509 #define HAMMER2_ALLOCREF_ALTA 0x0000
510 #define HAMMER2_ALLOCREF_ALTB 0x0001
511 #define HAMMER2_ALLOCREF_ALTC 0x0002 /* unsupported */
512 #define HAMMER2_ALLOCREF_ALTD 0x0003 /* unsupported */
513 #define HAMMER2_ALLOCREF_LEAF 0x0004
516 * Copies information stored in the volume header. Typically formatted
517 * e.g. like 'serno/A21343249.s1d'
519 * There are 8 copy_data[]'s in the volume header but up to 256 copyid's.
520 * When a copy is removed its copyid remains reserved in the copyid bitmap
521 * (copyexists[] bitmap in volume_data) until the copy references have
522 * been removed from the entire filesystem and cannot be reused until the
523 * removal is complete. However, new copy entries with other ids can be
524 * instantly added, replacing the original copy_data[]... which is fine as
525 * long as the copyid does not conflict.
527 * This structure must be exactly 64 bytes long.
529 struct hammer2_copy_data {
530 uint8_t copyid; /* 0-255 */
534 uint8_t path[60]; /* up to 59-char string, nul-terminated */
537 typedef struct hammer2_copy_data hammer2_copy_data_t;
539 #define COPYDATAF_OUTOFSYNC 0x0001
542 * The volume header eats a 64K block. There is currently an issue where
543 * we want to try to fit all nominal filesystem updates in a 512-byte section
544 * but it may be a lost cause due to the need for a blockset.
546 * All information is stored in host byte order. The volume header's magic
547 * number may be checked to determine the byte order. If you wish to mount
548 * between machines w/ different endian modes you'll need filesystem code
549 * which acts on the media data consistently (either all one way or all the
550 * other). Our code currently does not do that.
552 * A read-write mount may have to recover missing allocations by doing an
553 * incremental mirror scan looking for modifications made after alloc_tid.
554 * If alloc_tid == last_tid then no recovery operation is needed. Recovery
555 * operations are usually very, very fast.
557 * Read-only mounts do not need to do any recovery, access to the filesystem
558 * topology is always consistent after a crash (is always consistent, period).
559 * However, there may be shortcutted blockref updates present from deep in
560 * the tree which are stored in the volumeh eader and must be tracked on
563 * COPIES: Multiple copies may be specified on the mount line AND/OR you
564 * just specify one and the mount code tries to pick up the others
565 * from copyinfo[]. The copyid field in the volume header along
566 * with the fsid validates the copies.
568 * NOTE: root_blockref points to the super-root directory, not the root
569 * directory. The root directory will be a subdirectory under the
572 * The super-root directory contains all root directories and all
573 * snapshots (readonly or writable). It is possible to do a
574 * null-mount of the super-root using special path constructions
575 * relative to your mounted root.
577 * NOTE: HAMMER2 allows any subdirectory tree to be managed as if it were
578 * a PFS, including mirroring and storage quota operations, and this is
579 * prefered over creating discrete PFSs in the super-root. Instead
580 * the super-root is most typically used to create writable snapshots,
581 * alternative roots, and so forth. The super-root is also used by
582 * the automatic snapshotting mechanism.
584 #define HAMMER2_VOLUME_ID_HBO 0x48414d3205172011LLU
585 #define HAMMER2_VOLUME_ID_ABO 0x11201705324d4148LLU
587 struct hammer2_volume_data {
591 uint64_t magic; /* 0000 Signature */
592 hammer2_off_t boot_beg; /* 0008 Boot area (future) */
593 hammer2_off_t boot_end; /* 0010 (size = end - beg) */
594 hammer2_off_t redo_beg; /* 0018 Redo area (future) */
595 hammer2_off_t redo_end; /* 0020 (size = end - beg) */
596 hammer2_off_t volu_size; /* 0028 Volume size, bytes */
598 uint32_t version; /* 0030 */
599 uint32_t flags; /* 0034 */
600 uint8_t copyid; /* 0038 copyid of phys vol */
601 uint8_t freemap_version; /* 0039 freemap algorithm */
602 uint8_t reserved003A; /* 003A */
603 uint8_t reserved003B; /* 003B */
604 uint32_t reserved003C; /* 003C */
606 uuid_t fsid; /* 0040 */
607 uuid_t fstype; /* 0050 */
610 * allocator_size is precalculated at newfs time and does not include
611 * reserved blocks, boot, or redo areas.
613 * Initial non-reserved-area allocations do not use the allocation
614 * map but instead adjust alloc_iterator. Dynamic allocations take
615 * over starting at (allocator_beg). This makes newfs_hammer2's
616 * job a lot easier and can also serve as a testing jig.
618 hammer2_off_t allocator_size; /* 0060 Total data space */
619 hammer2_off_t allocator_free; /* 0068 Free space */
620 hammer2_tid_t allocator_beg; /* 0070 Initial allocations */
621 hammer2_tid_t last_tid; /* 0078 Last transaction id */
622 hammer2_tid_t alloc_tid; /* 0080 Alloctable modify tid */
623 hammer2_blockref_t alloc_blockref; /* 0088-00C7 */
626 * Copyids are allocated dynamically from the copyexists bitmap.
627 * An id from the active copies set (up to 8, see copyinfo later on)
628 * may still exist after the copy set has been removed from the
629 * volume header and its bit will remain active in the bitmap and
630 * cannot be reused until it is 100% removed from the hierarchy.
632 uint32_t copyexists[8]; /* 00C8-00E7 copy exists bmap */
633 char reserved0140[248]; /* 00E8-01DF */
636 * 32 bit CRC array at the end of the first 512 byte sector.
638 * icrc_sects[7] - First 512-4 bytes of volume header (including all
639 * the other icrc's except the last one).
641 * icrc_sects[6] - Second 512-4 bytes of volume header, which is
642 * the blockset for the root.
644 hammer2_crc32_t icrc_sects[8]; /* 01E0-01FF */
649 * The entire sector is used by a blockset.
651 hammer2_blockset_t sroot_blockset; /* 0200 Superroot directory */
654 * 512-byte sector #2-33
656 * Up to 256 copyinfo specifications can be configured. Note that
657 * any given subdirectory tree can only use 8 of the 256. Having
658 * up to 256 configurable in the volume header allows
660 * A specification takes 64 bytes. Each specification typically
661 * configures a device path such as 'serno/<serial>.s1d'.
663 struct hammer2_copy_data copyinfo[256]; /* 0400-43FF copyinfo config */
666 * Remaining sections are reserved for future use.
668 char reserved0400[0xBBFC]; /* 4400-FFFB reserved */
671 * icrc on entire volume header
673 hammer2_crc32_t icrc_volheader; /* FFFC-FFFF full volume icrc*/
676 typedef struct hammer2_volume_data hammer2_volume_data_t;
679 * Various parts of the volume header have their own iCRCs.
681 * The first 512 bytes has its own iCRC stored at the end of the 512 bytes
682 * and not included the icrc calculation.
684 * The second 512 bytes also has its own iCRC but it is stored in the first
685 * 512 bytes so it covers the entire second 512 bytes.
687 * The whole volume block (64KB) has an iCRC covering all but the last 4 bytes,
688 * which is where the iCRC for the whole volume is stored. This is currently
689 * a catch-all for anything not individually iCRCd.
691 #define HAMMER2_VOL_ICRC_SECT0 7
692 #define HAMMER2_VOL_ICRC_SECT1 6
694 #define HAMMER2_VOLUME_BYTES 65536
696 #define HAMMER2_VOLUME_ICRC0_OFF 0
697 #define HAMMER2_VOLUME_ICRC1_OFF 512
698 #define HAMMER2_VOLUME_ICRCVH_OFF 0
700 #define HAMMER2_VOLUME_ICRC0_SIZE (512 - 4)
701 #define HAMMER2_VOLUME_ICRC1_SIZE (512)
702 #define HAMMER2_VOLUME_ICRCVH_SIZE (65536 - 4)
704 #define HAMMER2_VOL_VERSION_MIN 1
705 #define HAMMER2_VOL_VERSION_DEFAULT 1
706 #define HAMMER2_VOL_VERSION_WIP 2
708 #define HAMMER2_NUM_VOLHDRS 4
710 union hammer2_media_data {
711 hammer2_inode_data_t ipdata;
712 hammer2_indblock_data_t npdata;
713 char buf[HAMMER2_PBUFSIZE];
716 typedef union hammer2_media_data hammer2_media_data_t;
719 * Prototypes for user & kernel functions. Kernel-only prototypes are
722 uint32_t hammer2_icrc32(const void *buf, size_t size);
723 uint32_t hammer2_icrc32c(const void *buf, size_t size, uint32_t crc);