2 * Copyright (c) 2011-2014 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
36 #ifndef _VFS_HAMMER2_DISK_H_
37 #define _VFS_HAMMER2_DISK_H_
47 * The structures below represent the on-disk media structures for the HAMMER2
48 * filesystem. Note that all fields for on-disk structures are naturally
49 * aligned. The host endian format is typically used - compatibility is
50 * possible if the implementation detects reversed endian and adjusts accesses
53 * HAMMER2 primarily revolves around the directory topology: inodes,
54 * directory entries, and block tables. Block device buffer cache buffers
55 * are always 64KB. Logical file buffers are typically 16KB. All data
56 * references utilize 64-bit byte offsets.
58 * Free block management is handled independently using blocks reserved by
63 * The data at the end of a file or directory may be a fragment in order
64 * to optimize storage efficiency. The minimum fragment size is 1KB.
65 * Since allocations are in powers of 2 fragments must also be sized in
66 * powers of 2 (1024, 2048, ... 65536).
68 * For the moment the maximum allocation size is HAMMER2_PBUFSIZE (64K),
69 * which is 2^16. Larger extents may be supported in the future. Smaller
70 * fragments might be supported in the future (down to 64 bytes is possible),
71 * but probably will not be.
73 * A full indirect block use supports 1024 x 64-byte blockrefs in a 64KB
74 * buffer. Indirect blocks down to 1KB are supported to keep small
77 * A maximally sized file (2^64-1 bytes) requires 5 indirect block levels.
78 * The hammer2_blockset in the volume header or file inode has another 8
79 * entries, giving us 66+3 = 69 bits of address space. However, some bits
80 * are taken up by (potentially) requests for redundant copies. HAMMER2
81 * currently supports up to 8 copies, which brings the address space down
82 * to 66 bits and gives us 2 bits of leeway.
84 #define HAMMER2_ALLOC_MIN 1024 /* minimum allocation size */
85 #define HAMMER2_RADIX_MIN 10 /* minimum allocation size 2^N */
86 #define HAMMER2_ALLOC_MAX 65536 /* maximum allocation size */
87 #define HAMMER2_RADIX_MAX 16 /* maximum allocation size 2^N */
88 #define HAMMER2_RADIX_KEY 64 /* number of bits in key */
91 * MINALLOCSIZE - The minimum allocation size. This can be smaller
92 * or larger than the minimum physical IO size.
94 * NOTE: Should not be larger than 1K since inodes
97 * MINIOSIZE - The minimum IO size. This must be less than
98 * or equal to HAMMER2_LBUFSIZE.
100 * HAMMER2_LBUFSIZE - Nominal buffer size for I/O rollups.
102 * HAMMER2_PBUFSIZE - Topological block size used by files for all
103 * blocks except the block straddling EOF.
105 * HAMMER2_SEGSIZE - Allocation map segment size, typically 2MB
106 * (space represented by a level0 bitmap).
109 #define HAMMER2_SEGSIZE (1 << HAMMER2_FREEMAP_LEVEL0_RADIX)
110 #define HAMMER2_SEGRADIX HAMMER2_FREEMAP_LEVEL0_RADIX
112 #define HAMMER2_PBUFRADIX 16 /* physical buf (1<<16) bytes */
113 #define HAMMER2_PBUFSIZE 65536
114 #define HAMMER2_LBUFRADIX 14 /* logical buf (1<<14) bytes */
115 #define HAMMER2_LBUFSIZE 16384
118 * Generally speaking we want to use 16K and 64K I/Os
120 #define HAMMER2_MINIORADIX HAMMER2_LBUFRADIX
121 #define HAMMER2_MINIOSIZE HAMMER2_LBUFSIZE
123 #define HAMMER2_IND_BYTES_MIN HAMMER2_LBUFSIZE
124 #define HAMMER2_IND_BYTES_MAX HAMMER2_PBUFSIZE
125 #define HAMMER2_IND_COUNT_MIN (HAMMER2_IND_BYTES_MIN / \
126 sizeof(hammer2_blockref_t))
127 #define HAMMER2_IND_COUNT_MAX (HAMMER2_IND_BYTES_MAX / \
128 sizeof(hammer2_blockref_t))
131 * In HAMMER2, arrays of blockrefs are fully set-associative, meaning that
132 * any element can occur at any index and holes can be anywhere. As a
133 * future optimization we will be able to flag that such arrays are sorted
134 * and thus optimize lookups, but for now we don't.
136 * Inodes embed either 512 bytes of direct data or an array of 8 blockrefs,
137 * resulting in highly efficient storage for files <= 512 bytes and for files
138 * <= 512KB. Up to 8 directory entries can be referenced from a directory
139 * without requiring an indirect block.
141 * Indirect blocks are typically either 4KB (64 blockrefs / ~4MB represented),
142 * or 64KB (1024 blockrefs / ~64MB represented).
144 #define HAMMER2_SET_COUNT 8 /* direct entries */
145 #define HAMMER2_SET_RADIX 3
146 #define HAMMER2_EMBEDDED_BYTES 512 /* inode blockset/dd size */
147 #define HAMMER2_EMBEDDED_RADIX 9
149 #define HAMMER2_PBUFMASK (HAMMER2_PBUFSIZE - 1)
150 #define HAMMER2_LBUFMASK (HAMMER2_LBUFSIZE - 1)
151 #define HAMMER2_SEGMASK (HAMMER2_SEGSIZE - 1)
153 #define HAMMER2_LBUFMASK64 ((hammer2_off_t)HAMMER2_LBUFMASK)
154 #define HAMMER2_PBUFSIZE64 ((hammer2_off_t)HAMMER2_PBUFSIZE)
155 #define HAMMER2_PBUFMASK64 ((hammer2_off_t)HAMMER2_PBUFMASK)
156 #define HAMMER2_SEGSIZE64 ((hammer2_off_t)HAMMER2_SEGSIZE)
157 #define HAMMER2_SEGMASK64 ((hammer2_off_t)HAMMER2_SEGMASK)
159 #define HAMMER2_UUID_STRING "5cbb9ad1-862d-11dc-a94d-01301bb8a9f5"
162 * A HAMMER2 filesystem is always sized in multiples of 8MB.
164 * A 4MB segment is reserved at the beginning of each 2GB zone. This segment
165 * contains the volume header (or backup volume header), the free block
166 * table, and possibly other information in the future.
168 * 4MB = 64 x 64K blocks. Each 4MB segment is broken down as follows:
170 * +-----------------------+
171 * | Volume Hdr | block 0 volume header & alternates
172 * +-----------------------+ (first four zones only)
173 * | FreeBlk Section A | block 1-4
174 * +-----------------------+
175 * | FreeBlk Section B | block 5-8
176 * +-----------------------+
177 * | FreeBlk Section C | block 9-12
178 * +-----------------------+
179 * | FreeBlk Section D | block 13-16
180 * +-----------------------+
184 * +-----------------------+
186 * The first few 2GB zones contain volume headers and volume header backups.
187 * After that the volume header block# is reserved for future use. Similarly,
188 * there are many blocks related to various Freemap levels which are not
189 * used in every segment and those are also reserved for future use.
191 * Freemap (see the FREEMAP document)
193 * The freemap utilizes blocks #1-16 in 8 sets of 4 blocks. Each block in
194 * a set represents a level of depth in the freemap topology. Eight sets
195 * exist to prevent live updates from disturbing the state of the freemap
196 * were a crash/reboot to occur. That is, a live update is not committed
197 * until the update's flush reaches the volume root. There are FOUR volume
198 * roots representing the last four synchronization points, so the freemap
199 * must be consistent no matter which volume root is chosen by the mount
202 * Each freemap set is 4 x 64K blocks and represents the 2GB, 2TB, 2PB,
203 * and 2EB indirect map. The volume header itself has a set of 8 freemap
204 * blockrefs representing another 3 bits, giving us a total 64 bits of
205 * representable address space.
207 * The Level 0 64KB block represents 2GB of storage represented by
208 * (64 x struct hammer2_bmap_data). Each structure represents 2MB of storage
209 * and has a 256 bit bitmap, using 2 bits to represent a 16KB chunk of
210 * storage. These 2 bits represent the following states:
213 * 01 (reserved) (Possibly partially allocated)
217 * One important thing to note here is that the freemap resolution is 16KB,
218 * but the minimum storage allocation size is 1KB. The hammer2 vfs keeps
219 * track of sub-allocations in memory, which means that on a unmount or reboot
220 * the entire 16KB of a partially allocated block will be considered fully
221 * allocated. It is possible for fragmentation to build up over time, but
222 * defragmentation is fairly easy to accomplish since all modifications
223 * allocate a new block.
225 * The Second thing to note is that due to the way snapshots and inode
226 * replication works, deleting a file cannot immediately free the related
227 * space. Furthermore, deletions often do not bother to traverse the
228 * block subhierarchy being deleted. And to go even further, whole
229 * sub-directory trees can be deleted simply by deleting the directory inode
230 * at the top. So even though we have a symbol to represent a 'possibly free'
231 * block (binary 10), only the bulk free scanning code can actually use it.
232 * Normal 'rm's or other deletions do not.
234 * WARNING! ZONE_SEG and VOLUME_ALIGN must be a multiple of 1<<LEVEL0_RADIX
235 * (i.e. a multiple of 2MB). VOLUME_ALIGN must be >= ZONE_SEG.
239 * (1) Modifications to freemap blocks 'allocate' a new copy (aka use a block
240 * from the next set). The new copy is reused until a flush occurs at
241 * which point the next modification will then rotate to the next set.
243 * (2) A total of 10 freemap sets is required.
245 * - 8 sets - 2 sets per volume header backup x 4 volume header backups
246 * - 2 sets used as backing store for the bulk freemap scan.
247 * - The freemap recovery scan which runs on-mount just uses the inactive
248 * set for whichever volume header was selected by the mount code.
251 #define HAMMER2_VOLUME_ALIGN (8 * 1024 * 1024)
252 #define HAMMER2_VOLUME_ALIGN64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGN)
253 #define HAMMER2_VOLUME_ALIGNMASK (HAMMER2_VOLUME_ALIGN - 1)
254 #define HAMMER2_VOLUME_ALIGNMASK64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGNMASK)
256 #define HAMMER2_NEWFS_ALIGN (HAMMER2_VOLUME_ALIGN)
257 #define HAMMER2_NEWFS_ALIGN64 ((hammer2_off_t)HAMMER2_VOLUME_ALIGN)
258 #define HAMMER2_NEWFS_ALIGNMASK (HAMMER2_VOLUME_ALIGN - 1)
259 #define HAMMER2_NEWFS_ALIGNMASK64 ((hammer2_off_t)HAMMER2_NEWFS_ALIGNMASK)
261 #define HAMMER2_ZONE_BYTES64 (2LLU * 1024 * 1024 * 1024)
262 #define HAMMER2_ZONE_MASK64 (HAMMER2_ZONE_BYTES64 - 1)
263 #define HAMMER2_ZONE_SEG (4 * 1024 * 1024)
264 #define HAMMER2_ZONE_SEG64 ((hammer2_off_t)HAMMER2_ZONE_SEG)
265 #define HAMMER2_ZONE_BLOCKS_SEG (HAMMER2_ZONE_SEG / HAMMER2_PBUFSIZE)
267 #define HAMMER2_ZONE_VOLHDR 0 /* volume header or backup */
268 #define HAMMER2_ZONE_FREEMAP_00 1 /* normal freemap rotation */
269 #define HAMMER2_ZONE_FREEMAP_01 5 /* normal freemap rotation */
270 #define HAMMER2_ZONE_FREEMAP_02 9 /* normal freemap rotation */
271 #define HAMMER2_ZONE_FREEMAP_03 13 /* normal freemap rotation */
272 #define HAMMER2_ZONE_FREEMAP_04 17 /* normal freemap rotation */
273 #define HAMMER2_ZONE_FREEMAP_05 21 /* normal freemap rotation */
274 #define HAMMER2_ZONE_FREEMAP_06 25 /* normal freemap rotation */
275 #define HAMMER2_ZONE_FREEMAP_07 29 /* normal freemap rotation */
276 #define HAMMER2_ZONE_FREEMAP_END 33 /* (non-inclusive) */
278 #define HAMMER2_ZONE_UNUSED33 33
279 #define HAMMER2_ZONE_UNUSED34 34
280 #define HAMMER2_ZONE_UNUSED35 35
281 #define HAMMER2_ZONE_UNUSED36 36
282 #define HAMMER2_ZONE_UNUSED37 37
283 #define HAMMER2_ZONE_UNUSED38 38
284 #define HAMMER2_ZONE_UNUSED39 39
285 #define HAMMER2_ZONE_UNUSED40 40
286 #define HAMMER2_ZONE_UNUSED41 41
287 #define HAMMER2_ZONE_UNUSED42 42
288 #define HAMMER2_ZONE_UNUSED43 43
289 #define HAMMER2_ZONE_UNUSED44 44
290 #define HAMMER2_ZONE_UNUSED45 45
291 #define HAMMER2_ZONE_UNUSED46 46
292 #define HAMMER2_ZONE_UNUSED47 47
293 #define HAMMER2_ZONE_UNUSED48 48
294 #define HAMMER2_ZONE_UNUSED49 49
295 #define HAMMER2_ZONE_UNUSED50 50
296 #define HAMMER2_ZONE_UNUSED51 51
297 #define HAMMER2_ZONE_UNUSED52 52
298 #define HAMMER2_ZONE_UNUSED53 53
299 #define HAMMER2_ZONE_UNUSED54 54
300 #define HAMMER2_ZONE_UNUSED55 55
301 #define HAMMER2_ZONE_UNUSED56 56
302 #define HAMMER2_ZONE_UNUSED57 57
303 #define HAMMER2_ZONE_UNUSED58 58
304 #define HAMMER2_ZONE_UNUSED59 59
305 #define HAMMER2_ZONE_UNUSED60 60
306 #define HAMMER2_ZONE_UNUSED61 61
307 #define HAMMER2_ZONE_UNUSED62 62
308 #define HAMMER2_ZONE_UNUSED63 63
309 #define HAMMER2_ZONE_END 64 /* non-inclusive */
311 #define HAMMER2_NFREEMAPS 8 /* FREEMAP_00 - FREEMAP_07 */
313 /* relative to FREEMAP_x */
314 #define HAMMER2_ZONEFM_LEVEL1 0 /* 2GB leafmap */
315 #define HAMMER2_ZONEFM_LEVEL2 1 /* 2TB indmap */
316 #define HAMMER2_ZONEFM_LEVEL3 2 /* 2PB indmap */
317 #define HAMMER2_ZONEFM_LEVEL4 3 /* 2EB indmap */
318 /* LEVEL5 is a set of 8 blockrefs in the volume header 16EB */
321 * Freemap radii. Note that the LEVEL 1 blockref points to a 64KB freemap
322 * block containing 1024 x LEVEL0 hammer2_bmap_data structures. LEVEL 0
323 * represents one structure.
325 #define HAMMER2_FREEMAP_LEVEL5_RADIX 64 /* 16EB (end) */
326 #define HAMMER2_FREEMAP_LEVEL4_RADIX 61 /* 2EB */
327 #define HAMMER2_FREEMAP_LEVEL3_RADIX 51 /* 2PB */
328 #define HAMMER2_FREEMAP_LEVEL2_RADIX 41 /* 2TB */
329 #define HAMMER2_FREEMAP_LEVEL1_RADIX 31 /* 2GB */
330 #define HAMMER2_FREEMAP_LEVEL0_RADIX 21 /* 2MB (entry in l-1 leaf) */
332 #define HAMMER2_FREEMAP_LEVELN_PSIZE 65536 /* physical bytes */
334 #define HAMMER2_FREEMAP_LEVEL4_SIZE ((hammer2_off_t)1 << \
335 HAMMER2_FREEMAP_LEVEL4_RADIX)
336 #define HAMMER2_FREEMAP_LEVEL3_SIZE ((hammer2_off_t)1 << \
337 HAMMER2_FREEMAP_LEVEL3_RADIX)
338 #define HAMMER2_FREEMAP_LEVEL2_SIZE ((hammer2_off_t)1 << \
339 HAMMER2_FREEMAP_LEVEL2_RADIX)
340 #define HAMMER2_FREEMAP_LEVEL1_SIZE ((hammer2_off_t)1 << \
341 HAMMER2_FREEMAP_LEVEL1_RADIX)
342 #define HAMMER2_FREEMAP_LEVEL0_SIZE ((hammer2_off_t)1 << \
343 HAMMER2_FREEMAP_LEVEL0_RADIX)
345 #define HAMMER2_FREEMAP_LEVEL4_MASK (HAMMER2_FREEMAP_LEVEL4_SIZE - 1)
346 #define HAMMER2_FREEMAP_LEVEL3_MASK (HAMMER2_FREEMAP_LEVEL3_SIZE - 1)
347 #define HAMMER2_FREEMAP_LEVEL2_MASK (HAMMER2_FREEMAP_LEVEL2_SIZE - 1)
348 #define HAMMER2_FREEMAP_LEVEL1_MASK (HAMMER2_FREEMAP_LEVEL1_SIZE - 1)
349 #define HAMMER2_FREEMAP_LEVEL0_MASK (HAMMER2_FREEMAP_LEVEL0_SIZE - 1)
351 #define HAMMER2_FREEMAP_COUNT (int)(HAMMER2_FREEMAP_LEVELN_PSIZE / \
352 sizeof(hammer2_bmap_data_t))
353 #define HAMMER2_FREEMAP_BLOCK_RADIX 14
354 #define HAMMER2_FREEMAP_BLOCK_SIZE (1 << HAMMER2_FREEMAP_BLOCK_RADIX)
355 #define HAMMER2_FREEMAP_BLOCK_MASK (HAMMER2_FREEMAP_BLOCK_SIZE - 1)
358 * bitmap[] structure. 2 bits per HAMMER2_FREEMAP_BLOCK_SIZE. Each bitmap[]
359 * element is 32 bits and thus represents 16 blocks (radix 4).
361 #define HAMMER2_BMAP_INDEX_RADIX 4
362 #define HAMMER2_BMAP_INDEX_SIZE (HAMMER2_FREEMAP_BLOCK_SIZE * 16)
363 #define HAMMER2_BMAP_INDEX_MASK (HAMMER2_BMAP_INDEX_SIZE - 1)
366 * Two linear areas can be reserved after the initial 2MB segment in the base
367 * zone (the one starting at offset 0). These areas are NOT managed by the
368 * block allocator and do not fall under HAMMER2 crc checking rules based
369 * at the volume header (but can be self-CRCd internally, depending).
371 #define HAMMER2_BOOT_MIN_BYTES HAMMER2_VOLUME_ALIGN
372 #define HAMMER2_BOOT_NOM_BYTES (64*1024*1024)
373 #define HAMMER2_BOOT_MAX_BYTES (256*1024*1024)
375 #define HAMMER2_REDO_MIN_BYTES HAMMER2_VOLUME_ALIGN
376 #define HAMMER2_REDO_NOM_BYTES (256*1024*1024)
377 #define HAMMER2_REDO_MAX_BYTES (1024*1024*1024)
380 * Most HAMMER2 types are implemented as unsigned 64-bit integers.
381 * Transaction ids are monotonic.
383 * We utilize 32-bit iSCSI CRCs.
385 typedef uint64_t hammer2_tid_t;
386 typedef uint64_t hammer2_off_t;
387 typedef uint64_t hammer2_key_t;
388 typedef uint32_t hammer2_crc32_t;
391 * Miscellanious ranges (all are unsigned).
393 #define HAMMER2_TID_MIN 1ULL
394 #define HAMMER2_TID_MAX 0xFFFFFFFFFFFFFFFFULL
395 #define HAMMER2_KEY_MIN 0ULL
396 #define HAMMER2_KEY_MAX 0xFFFFFFFFFFFFFFFFULL
397 #define HAMMER2_OFFSET_MIN 0ULL
398 #define HAMMER2_OFFSET_MAX 0xFFFFFFFFFFFFFFFFULL
401 * HAMMER2 data offset special cases and masking.
403 * All HAMMER2 data offsets have to be broken down into a 64K buffer base
404 * offset (HAMMER2_OFF_MASK_HI) and a 64K buffer index (HAMMER2_OFF_MASK_LO).
406 * Indexes into physical buffers are always 64-byte aligned. The low 6 bits
407 * of the data offset field specifies how large the data chunk being pointed
408 * to as a power of 2. The theoretical minimum radix is thus 6 (The space
409 * needed in the low bits of the data offset field). However, the practical
410 * minimum allocation chunk size is 1KB (a radix of 10), so HAMMER2 sets
411 * HAMMER2_RADIX_MIN to 10. The maximum radix is currently 16 (64KB), but
412 * we fully intend to support larger extents in the future.
414 #define HAMMER2_OFF_BAD ((hammer2_off_t)-1)
415 #define HAMMER2_OFF_MASK 0xFFFFFFFFFFFFFFC0ULL
416 #define HAMMER2_OFF_MASK_LO (HAMMER2_OFF_MASK & HAMMER2_PBUFMASK64)
417 #define HAMMER2_OFF_MASK_HI (~HAMMER2_PBUFMASK64)
418 #define HAMMER2_OFF_MASK_RADIX 0x000000000000003FULL
419 #define HAMMER2_MAX_COPIES 6
422 * HAMMER2 directory support and pre-defined keys
424 #define HAMMER2_DIRHASH_VISIBLE 0x8000000000000000ULL
425 #define HAMMER2_DIRHASH_USERMSK 0x7FFFFFFFFFFFFFFFULL
426 #define HAMMER2_DIRHASH_LOMASK 0x0000000000007FFFULL
427 #define HAMMER2_DIRHASH_HIMASK 0xFFFFFFFFFFFF0000ULL
428 #define HAMMER2_DIRHASH_FORCED 0x0000000000008000ULL /* bit forced on */
430 #define HAMMER2_SROOT_KEY 0x0000000000000000ULL /* volume to sroot */
432 /************************************************************************
434 ************************************************************************
437 * All HAMMER2 directories directly under the super-root on your local
438 * media can be mounted separately, even if they share the same physical
441 * When you do a HAMMER2 mount you are effectively tying into a HAMMER2
442 * cluster via local media. The local media does not have to participate
443 * in the cluster, other than to provide the hammer2_volconf[] array and
444 * root inode for the mount.
446 * This is important: The mount device path you specify serves to bootstrap
447 * your entry into the cluster, but your mount will make active connections
448 * to ALL copy elements in the hammer2_volconf[] array which match the
449 * PFSID of the directory in the super-root that you specified. The local
450 * media path does not have to be mentioned in this array but becomes part
451 * of the cluster based on its type and access rights. ALL ELEMENTS ARE
452 * TREATED ACCORDING TO TYPE NO MATTER WHICH ONE YOU MOUNT FROM.
454 * The actual cluster may be far larger than the elements you list in the
455 * hammer2_volconf[] array. You list only the elements you wish to
456 * directly connect to and you are able to access the rest of the cluster
457 * indirectly through those connections.
459 * WARNING! This structure must be exactly 128 bytes long for its config
460 * array to fit in the volume header.
462 struct hammer2_volconf {
463 uint8_t copyid; /* 00 copyid 0-255 (must match slot) */
464 uint8_t inprog; /* 01 operation in progress, or 0 */
465 uint8_t chain_to; /* 02 operation chaining to, or 0 */
466 uint8_t chain_from; /* 03 operation chaining from, or 0 */
467 uint16_t flags; /* 04-05 flags field */
468 uint8_t error; /* 06 last operational error */
469 uint8_t priority; /* 07 priority and round-robin flag */
470 uint8_t remote_pfs_type;/* 08 probed direct remote PFS type */
471 uint8_t reserved08[23]; /* 09-1F */
472 uuid_t pfs_clid; /* 20-2F copy target must match this uuid */
473 uint8_t label[16]; /* 30-3F import/export label */
474 uint8_t path[64]; /* 40-7F target specification string or key */
477 typedef struct hammer2_volconf hammer2_volconf_t;
479 #define DMSG_VOLF_ENABLED 0x0001
480 #define DMSG_VOLF_INPROG 0x0002
481 #define DMSG_VOLF_CONN_RR 0x80 /* round-robin at same priority */
482 #define DMSG_VOLF_CONN_EF 0x40 /* media errors flagged */
483 #define DMSG_VOLF_CONN_PRI 0x0F /* select priority 0-15 (15=best) */
485 struct dmsg_lnk_hammer2_volconf {
487 hammer2_volconf_t copy; /* copy spec */
491 int64_t reserved02[32];
494 typedef struct dmsg_lnk_hammer2_volconf dmsg_lnk_hammer2_volconf_t;
496 #define DMSG_LNK_HAMMER2_VOLCONF DMSG_LNK(DMSG_LNK_CMD_HAMMER2_VOLCONF, \
497 dmsg_lnk_hammer2_volconf)
499 #define H2_LNK_VOLCONF(msg) ((dmsg_lnk_hammer2_volconf_t *)(msg)->any.buf)
502 * The media block reference structure. This forms the core of the HAMMER2
503 * media topology recursion. This 64-byte data structure is embedded in the
504 * volume header, in inodes (which are also directory entries), and in
507 * A blockref references a single media item, which typically can be a
508 * directory entry (aka inode), indirect block, or data block.
510 * The primary feature a blockref represents is the ability to validate
511 * the entire tree underneath it via its check code. Any modification to
512 * anything propagates up the blockref tree all the way to the root, replacing
513 * the related blocks. Propagations can shortcut to the volume root to
514 * implement the 'fast syncing' feature but this only delays the eventual
517 * The check code can be a simple 32-bit iscsi code, a 64-bit crc,
518 * or as complex as a 192 bit cryptographic hash. 192 bits is the maximum
519 * supported check code size, which is not sufficient for unverified dedup
520 * UNLESS one doesn't mind once-in-a-blue-moon data corruption (such as when
521 * farming web data). HAMMER2 has an unverified dedup feature for just this
526 * NOTE: The range of keys represented by the blockref is (key) to
527 * ((key) + (1LL << keybits) - 1). HAMMER2 usually populates
528 * blocks bottom-up, inserting a new root when radix expansion
532 * FUTURE BLOCKREF EXPANSION
534 * In order to implement a 256-bit content addressable index we want to
535 * have a 256-bit key which essentially represents the cryptographic hash.
536 * (so, 64-bit key + 192-bit crypto-hash or 256-bit key-is-the-hash +
537 * 32-bit consistency check for indirect block layers).
539 * THIS IS POSSIBLE in a 64-byte blockref structure. Of course, any number
540 * of bits can be represented by sizing the blockref. For the purposes of
541 * HAMMER2 though my limit is 256 bits. Not only that, but it will be an
542 * optimal construction because H2 already uses a variably-sized radix to
543 * pack the blockrefs at each level. A 256-bit mechanic would allow us
544 * to implement a content-addressable index.
546 struct hammer2_blockref { /* MUST BE EXACTLY 64 BYTES */
547 uint8_t type; /* type of underlying item */
548 uint8_t methods; /* check method & compression method */
549 uint8_t copyid; /* specify which copy this is */
550 uint8_t keybits; /* #of keybits masked off 0=leaf */
551 uint8_t vradix; /* virtual data/meta-data size */
552 uint8_t flags; /* blockref flags */
555 hammer2_key_t key; /* key specification */
556 hammer2_tid_t mirror_tid; /* propagate for mirror scan */
557 hammer2_tid_t modify_tid; /* modifications sans propagation */
558 hammer2_off_t data_off; /* low 6 bits is phys size (radix)*/
559 union { /* check info */
574 * Freemap hints are embedded in addition to the icrc32.
576 * bigmask - Radixes available for allocation (0-31).
577 * Heuristical (may be permissive but not
578 * restrictive). Typically only radix values
579 * 10-16 are used (i.e. (1<<10) through (1<<16)).
581 * avail - Total available space remaining, in bytes
585 uint32_t bigmask; /* available radixes */
586 uint64_t avail; /* total available bytes */
587 uint64_t unused; /* unused must be 0 */
592 typedef struct hammer2_blockref hammer2_blockref_t;
594 #define HAMMER2_BLOCKREF_BYTES 64 /* blockref struct in bytes */
597 * On-media and off-media blockref types.
599 #define HAMMER2_BREF_TYPE_EMPTY 0
600 #define HAMMER2_BREF_TYPE_INODE 1
601 #define HAMMER2_BREF_TYPE_INDIRECT 2
602 #define HAMMER2_BREF_TYPE_DATA 3
603 #define HAMMER2_BREF_TYPE_UNUSED04 4
604 #define HAMMER2_BREF_TYPE_FREEMAP_NODE 5
605 #define HAMMER2_BREF_TYPE_FREEMAP_LEAF 6
606 #define HAMMER2_BREF_TYPE_FREEMAP 254 /* pseudo-type */
607 #define HAMMER2_BREF_TYPE_VOLUME 255 /* pseudo-type */
609 #define HAMMER2_BREF_FLAG_PFSROOT 0x01 /* see also related opflag */
610 #define HAMMER2_BREF_FLAG_ZERO 0x02
613 * Encode/decode check mode and compression mode for
614 * bref.methods. The compression level is not encoded in
617 #define HAMMER2_ENC_CHECK(n) (((n) & 15) << 4)
618 #define HAMMER2_DEC_CHECK(n) (((n) >> 4) & 15)
619 #define HAMMER2_ENC_COMP(n) ((n) & 15)
620 #define HAMMER2_DEC_COMP(n) ((n) & 15)
622 #define HAMMER2_CHECK_NONE 0
623 #define HAMMER2_CHECK_DISABLED 1
624 #define HAMMER2_CHECK_ISCSI32 2
625 #define HAMMER2_CHECK_CRC64 3
626 #define HAMMER2_CHECK_SHA192 4
627 #define HAMMER2_CHECK_FREEMAP 5
629 /* user-specifiable check modes only */
630 #define HAMMER2_CHECK_STRINGS { "none", "disabled", "crc32", \
632 #define HAMMER2_CHECK_STRINGS_COUNT 5
635 * Encode/decode check or compression algorithm request in
636 * ipdata->check_algo and ipdata->comp_algo.
638 #define HAMMER2_ENC_ALGO(n) (n)
639 #define HAMMER2_DEC_ALGO(n) ((n) & 15)
640 #define HAMMER2_ENC_LEVEL(n) ((n) << 4)
641 #define HAMMER2_DEC_LEVEL(n) (((n) >> 4) & 15)
643 #define HAMMER2_COMP_NONE 0
644 #define HAMMER2_COMP_AUTOZERO 1
645 #define HAMMER2_COMP_LZ4 2
646 #define HAMMER2_COMP_ZLIB 3
648 #define HAMMER2_COMP_NEWFS_DEFAULT HAMMER2_COMP_LZ4
649 #define HAMMER2_COMP_STRINGS { "none", "autozero", "lz4", "zlib" }
650 #define HAMMER2_COMP_STRINGS_COUNT 4
654 * HAMMER2 block references are collected into sets of 8 blockrefs. These
655 * sets are fully associative, meaning the elements making up a set are
656 * not sorted in any way and may contain duplicate entries, holes, or
657 * entries which shortcut multiple levels of indirection. Sets are used
660 * (1) When redundancy is desired a set may contain several duplicate
661 * entries pointing to different copies of the same data. Up to 8 copies
662 * are supported but the set structure becomes a bit inefficient once
665 * (2) The blockrefs in a set can shortcut multiple levels of indirections
666 * within the bounds imposed by the parent of set.
668 * When a set fills up another level of indirection is inserted, moving
669 * some or all of the set's contents into indirect blocks placed under the
670 * set. This is a top-down approach in that indirect blocks are not created
671 * until the set actually becomes full (that is, the entries in the set can
672 * shortcut the indirect blocks when the set is not full). Depending on how
673 * things are filled multiple indirect blocks will eventually be created.
675 * Indirect blocks are typically 4KB (64 entres) or 64KB (1024 entries) and
676 * are also treated as fully set-associative.
678 struct hammer2_blockset {
679 hammer2_blockref_t blockref[HAMMER2_SET_COUNT];
682 typedef struct hammer2_blockset hammer2_blockset_t;
685 * Catch programmer snafus
687 #if (1 << HAMMER2_SET_RADIX) != HAMMER2_SET_COUNT
688 #error "hammer2 direct radix is incorrect"
690 #if (1 << HAMMER2_PBUFRADIX) != HAMMER2_PBUFSIZE
691 #error "HAMMER2_PBUFRADIX and HAMMER2_PBUFSIZE are inconsistent"
693 #if (1 << HAMMER2_RADIX_MIN) != HAMMER2_ALLOC_MIN
694 #error "HAMMER2_RADIX_MIN and HAMMER2_ALLOC_MIN are inconsistent"
698 * hammer2_bmap_data - A freemap entry in the LEVEL1 block.
700 * Each 64-byte entry contains the bitmap and meta-data required to manage
701 * a LEVEL0 (2MB) block of storage. The storage is managed in 128 x 16KB
702 * chunks. Smaller allocation granularity is supported via a linear iterator
703 * and/or must otherwise be tracked in ram.
705 * (data structure must be 64 bytes exactly)
707 * linear - A BYTE linear allocation offset used for sub-16KB allocations
708 * only. May contain values between 0 and 2MB. Must be ignored
709 * if 16KB-aligned (i.e. force bitmap scan), otherwise may be
710 * used to sub-allocate within the 16KB block (which is already
711 * marked as allocated in the bitmap).
713 * Sub-allocations need only be 1KB-aligned and do not have to be
714 * size-aligned, and 16KB or larger allocations do not update this
715 * field, resulting in pretty good packing.
717 * Please note that file data granularity may be limited by
718 * other issues such as buffer cache direct-mapping and the
719 * desire to support sector sizes up to 16KB (so H2 only issues
720 * I/O's in multiples of 16KB anyway).
722 * class - Clustering class. Cleared to 0 only if the entire leaf becomes
723 * free. Used to cluster device buffers so all elements must have
724 * the same device block size, but may mix logical sizes.
726 * Typically integrated with the blockref type in the upper 8 bits
727 * to localize inodes and indrect blocks, improving bulk free scans
728 * and directory scans.
730 * bitmap - Two bits per 16KB allocation block arranged in arrays of
731 * 32-bit elements, 128x2 bits representing ~2MB worth of media
732 * storage. Bit patterns are as follows:
739 struct hammer2_bmap_data {
740 int32_t linear; /* 00 linear sub-granular allocation offset */
741 uint16_t class; /* 04-05 clustering class ((type<<8)|radix) */
742 uint8_t reserved06; /* 06 */
743 uint8_t reserved07; /* 07 */
744 uint32_t reserved08; /* 08 */
745 uint32_t reserved0C; /* 0C */
746 uint32_t reserved10; /* 10 */
747 uint32_t reserved14; /* 14 */
748 uint32_t reserved18; /* 18 */
749 uint32_t avail; /* 1C */
750 uint32_t bitmap[8]; /* 20-3F 256 bits manages 2MB/16KB/2-bits */
753 typedef struct hammer2_bmap_data hammer2_bmap_data_t;
756 * In HAMMER2 inodes ARE directory entries, with a special exception for
757 * hardlinks. The inode number is stored in the inode rather than being
758 * based on the location of the inode (since the location moves every time
759 * the inode or anything underneath the inode is modified).
761 * The inode is 1024 bytes, made up of 256 bytes of meta-data, 256 bytes
762 * for the filename, and 512 bytes worth of direct file data OR an embedded
765 * Directories represent one inode per blockref. Inodes are not laid out
766 * as a file but instead are represented by the related blockrefs. The
767 * blockrefs, in turn, are indexed by the 64-bit directory hash key. Remember
768 * that blocksets are fully associative, so a certain degree efficiency is
769 * achieved just from that.
771 * Up to 512 bytes of direct data can be embedded in an inode, and since
772 * inodes are essentially directory entries this also means that small data
773 * files end up simply being laid out linearly in the directory, resulting
774 * in fewer seeks and highly optimal access.
776 * The compression mode can be changed at any time in the inode and is
777 * recorded on a blockref-by-blockref basis.
779 * Hardlinks are supported via the inode map. Essentially the way a hardlink
780 * works is that all individual directory entries representing the same file
781 * are special cased and specify the same inode number. The actual file
782 * is placed in the nearest parent directory that is parent to all instances
783 * of the hardlink. If all hardlinks to a file are in the same directory
784 * the actual file will also be placed in that directory. This file uses
785 * the inode number as the directory entry key and is invisible to normal
786 * directory scans. Real directory entry keys are differentiated from the
787 * inode number key via bit 63. Access to the hardlink silently looks up
788 * the real file and forwards all operations to that file. Removal of the
789 * last hardlink also removes the real file.
791 * (attr_tid) is only updated when the inode's specific attributes or regular
792 * file size has changed, and affects path lookups and stat. (attr_tid)
793 * represents a special cache coherency lock under the inode. The inode
794 * blockref's modify_tid will always cover it.
796 * (dirent_tid) is only updated when an entry under a directory inode has
797 * been created, deleted, renamed, or had its attributes change, and affects
798 * directory lookups and scans. (dirent_tid) represents another special cache
799 * coherency lock under the inode. The inode blockref's modify_tid will
802 #define HAMMER2_INODE_BYTES 1024 /* (asserted by code) */
803 #define HAMMER2_INODE_MAXNAME 256 /* maximum name in bytes */
804 #define HAMMER2_INODE_VERSION_ONE 1
806 #define HAMMER2_INODE_HIDDENDIR 16 /* special inode */
807 #define HAMMER2_INODE_START 1024 /* dynamically allocated */
809 struct hammer2_inode_data {
810 uint16_t version; /* 0000 inode data version */
811 uint16_t reserved02; /* 0002 */
814 * core inode attributes, inode type, misc flags
816 uint32_t uflags; /* 0004 chflags */
817 uint32_t rmajor; /* 0008 available for device nodes */
818 uint32_t rminor; /* 000C available for device nodes */
819 uint64_t ctime; /* 0010 inode change time */
820 uint64_t mtime; /* 0018 modified time */
821 uint64_t atime; /* 0020 access time (unsupported) */
822 uint64_t btime; /* 0028 birth time */
823 uuid_t uid; /* 0030 uid / degenerate unix uid */
824 uuid_t gid; /* 0040 gid / degenerate unix gid */
826 uint8_t type; /* 0050 object type */
827 uint8_t op_flags; /* 0051 operational flags */
828 uint16_t cap_flags; /* 0052 capability flags */
829 uint32_t mode; /* 0054 unix modes (typ low 16 bits) */
832 * inode size, identification, localized recursive configuration
833 * for compression and backup copies.
835 hammer2_tid_t inum; /* 0058 inode number */
836 hammer2_off_t size; /* 0060 size of file */
837 uint64_t nlinks; /* 0068 hard links (typ only dirs) */
838 hammer2_tid_t iparent; /* 0070 parent inum (recovery only) */
839 hammer2_key_t name_key; /* 0078 full filename key */
840 uint16_t name_len; /* 0080 filename length */
841 uint8_t ncopies; /* 0082 ncopies to local media */
842 uint8_t comp_algo; /* 0083 compression request & algo */
845 * These fields are currently only applicable to PFSROOTs.
847 * NOTE: We can't use {volume_data->fsid, pfs_clid} to uniquely
848 * identify an instance of a PFS in the cluster because
849 * a mount may contain more than one copy of the PFS as
850 * a separate node. {pfs_clid, pfs_fsid} must be used for
851 * registration in the cluster.
853 uint8_t target_type; /* 0084 hardlink target type */
854 uint8_t check_algo; /* 0085 check code request & algo */
855 uint8_t pfs_nmasters; /* 0086 (if PFSROOT) if multi-master */
856 uint8_t pfs_type; /* 0087 (if PFSROOT) node type */
857 uint64_t pfs_inum; /* 0088 (if PFSROOT) inum allocator */
858 uuid_t pfs_clid; /* 0090 (if PFSROOT) cluster uuid */
859 uuid_t pfs_fsid; /* 00A0 (if PFSROOT) unique uuid */
862 * Quotas and aggregate sub-tree inode and data counters. Note that
863 * quotas are not replicated downward, they are explicitly set by
864 * the sysop and in-memory structures keep track of inheritence.
866 hammer2_key_t data_quota; /* 00B0 subtree quota in bytes */
867 hammer2_key_t data_count; /* 00B8 subtree byte count */
868 hammer2_key_t inode_quota; /* 00C0 subtree quota inode count */
869 hammer2_key_t inode_count; /* 00C8 subtree inode count */
870 hammer2_tid_t attr_tid; /* 00D0 attributes changed */
871 hammer2_tid_t dirent_tid; /* 00D8 directory/attr changed */
874 * Tracks (possibly degenerate) free areas covering all sub-tree
875 * allocations under inode, not counting the inode itself.
876 * 0/0 indicates empty entry. fully set-associative.
878 * (not yet implemented)
880 hammer2_off_t reservedE0[4]; /* 00E0/E8/F0/F8 */
882 unsigned char filename[HAMMER2_INODE_MAXNAME];
883 /* 0100-01FF (256 char, unterminated) */
884 union { /* 0200-03FF (64x8 = 512 bytes) */
885 struct hammer2_blockset blockset;
886 char data[HAMMER2_EMBEDDED_BYTES];
890 typedef struct hammer2_inode_data hammer2_inode_data_t;
892 #define HAMMER2_OPFLAG_DIRECTDATA 0x01
893 #define HAMMER2_OPFLAG_PFSROOT 0x02 /* (see also bref flag) */
894 #define HAMMER2_OPFLAG_COPYIDS 0x04 /* copyids override parent */
896 #define HAMMER2_OBJTYPE_UNKNOWN 0
897 #define HAMMER2_OBJTYPE_DIRECTORY 1
898 #define HAMMER2_OBJTYPE_REGFILE 2
899 #define HAMMER2_OBJTYPE_FIFO 4
900 #define HAMMER2_OBJTYPE_CDEV 5
901 #define HAMMER2_OBJTYPE_BDEV 6
902 #define HAMMER2_OBJTYPE_SOFTLINK 7
903 #define HAMMER2_OBJTYPE_HARDLINK 8 /* dummy entry for hardlink */
904 #define HAMMER2_OBJTYPE_SOCKET 9
905 #define HAMMER2_OBJTYPE_WHITEOUT 10
907 #define HAMMER2_COPYID_NONE 0
908 #define HAMMER2_COPYID_LOCAL ((uint8_t)-1)
910 #define HAMMER2_COPYID_COUNT 256
913 * PFS types identify a PFS on media and in LNK_SPAN messages.
915 * PFS types >= 16 belong to HAMMER, 0-15 are defined in sys/dmsg.h
917 /* 0-15 reserved by sys/dmsg.h */
918 #define HAMMER2_PFSTYPE_CACHE 16
919 #define HAMMER2_PFSTYPE_COPY 17
920 #define HAMMER2_PFSTYPE_SLAVE 18
921 #define HAMMER2_PFSTYPE_SOFT_SLAVE 19
922 #define HAMMER2_PFSTYPE_SOFT_MASTER 20
923 #define HAMMER2_PFSTYPE_MASTER 21
924 #define HAMMER2_PFSTYPE_SNAPSHOT 22
925 #define HAMMER2_PFSTYPE_SUPROOT 23
926 #define HAMMER2_PFSTYPE_MAX 32
935 * Flags (8 bits) - blockref, for freemap only
937 * Note that the minimum chunk size is 1KB so we could theoretically have
938 * 10 bits here, but we might have some future extension that allows a
939 * chunk size down to 256 bytes and if so we will need bits 8 and 9.
941 #define HAMMER2_AVF_SELMASK 0x03 /* select group */
942 #define HAMMER2_AVF_ALL_ALLOC 0x04 /* indicate all allocated */
943 #define HAMMER2_AVF_ALL_FREE 0x08 /* indicate all free */
944 #define HAMMER2_AVF_RESERVED10 0x10
945 #define HAMMER2_AVF_RESERVED20 0x20
946 #define HAMMER2_AVF_RESERVED40 0x40
947 #define HAMMER2_AVF_RESERVED80 0x80
948 #define HAMMER2_AVF_AVMASK32 ((uint32_t)0xFFFFFF00LU)
949 #define HAMMER2_AVF_AVMASK64 ((uint64_t)0xFFFFFFFFFFFFFF00LLU)
951 #define HAMMER2_AV_SELECT_A 0x00
952 #define HAMMER2_AV_SELECT_B 0x01
953 #define HAMMER2_AV_SELECT_C 0x02
954 #define HAMMER2_AV_SELECT_D 0x03
957 * The volume header eats a 64K block. There is currently an issue where
958 * we want to try to fit all nominal filesystem updates in a 512-byte section
959 * but it may be a lost cause due to the need for a blockset.
961 * All information is stored in host byte order. The volume header's magic
962 * number may be checked to determine the byte order. If you wish to mount
963 * between machines w/ different endian modes you'll need filesystem code
964 * which acts on the media data consistently (either all one way or all the
965 * other). Our code currently does not do that.
967 * A read-write mount may have to recover missing allocations by doing an
968 * incremental mirror scan looking for modifications made after alloc_tid.
969 * If alloc_tid == last_tid then no recovery operation is needed. Recovery
970 * operations are usually very, very fast.
972 * Read-only mounts do not need to do any recovery, access to the filesystem
973 * topology is always consistent after a crash (is always consistent, period).
974 * However, there may be shortcutted blockref updates present from deep in
975 * the tree which are stored in the volumeh eader and must be tracked on
978 * NOTE: The copyinfo[] array contains the configuration for both the
979 * cluster connections and any local media copies. The volume
980 * header will be replicated for each local media copy.
982 * The mount command may specify multiple medias or just one and
983 * allow HAMMER2 to pick up the others when it checks the copyinfo[]
986 * NOTE: root_blockref points to the super-root directory, not the root
987 * directory. The root directory will be a subdirectory under the
990 * The super-root directory contains all root directories and all
991 * snapshots (readonly or writable). It is possible to do a
992 * null-mount of the super-root using special path constructions
993 * relative to your mounted root.
995 * NOTE: HAMMER2 allows any subdirectory tree to be managed as if it were
996 * a PFS, including mirroring and storage quota operations, and this is
997 * prefered over creating discrete PFSs in the super-root. Instead
998 * the super-root is most typically used to create writable snapshots,
999 * alternative roots, and so forth. The super-root is also used by
1000 * the automatic snapshotting mechanism.
1002 #define HAMMER2_VOLUME_ID_HBO 0x48414d3205172011LLU
1003 #define HAMMER2_VOLUME_ID_ABO 0x11201705324d4148LLU
1005 struct hammer2_volume_data {
1007 * sector #0 - 512 bytes
1009 uint64_t magic; /* 0000 Signature */
1010 hammer2_off_t boot_beg; /* 0008 Boot area (future) */
1011 hammer2_off_t boot_end; /* 0010 (size = end - beg) */
1012 hammer2_off_t aux_beg; /* 0018 Aux area (future) */
1013 hammer2_off_t aux_end; /* 0020 (size = end - beg) */
1014 hammer2_off_t volu_size; /* 0028 Volume size, bytes */
1016 uint32_t version; /* 0030 */
1017 uint32_t flags; /* 0034 */
1018 uint8_t copyid; /* 0038 copyid of phys vol */
1019 uint8_t freemap_version; /* 0039 freemap algorithm */
1020 uint8_t peer_type; /* 003A HAMMER2_PEER_xxx */
1021 uint8_t reserved003B; /* 003B */
1022 uint32_t reserved003C; /* 003C */
1024 uuid_t fsid; /* 0040 */
1025 uuid_t fstype; /* 0050 */
1028 * allocator_size is precalculated at newfs time and does not include
1029 * reserved blocks, boot, or redo areas.
1031 * Initial non-reserved-area allocations do not use the freemap
1032 * but instead adjust alloc_iterator. Dynamic allocations take
1033 * over starting at (allocator_beg). This makes newfs_hammer2's
1034 * job a lot easier and can also serve as a testing jig.
1036 hammer2_off_t allocator_size; /* 0060 Total data space */
1037 hammer2_off_t allocator_free; /* 0068 Free space */
1038 hammer2_off_t allocator_beg; /* 0070 Initial allocations */
1041 * mirror_tid reflects the highest committed super-root change
1042 * freemap_tid reflects the highest committed freemap change
1044 * NOTE: mirror_tid does not track (and should not track) changes
1045 * made to or under PFS roots.
1047 hammer2_tid_t mirror_tid; /* 0078 committed tid (vol) */
1048 hammer2_tid_t reserved0080; /* 0080 */
1049 hammer2_tid_t reserved0088; /* 0088 */
1050 hammer2_tid_t freemap_tid; /* 0090 committed tid (fmap) */
1051 hammer2_tid_t bulkfree_tid; /* 0098 bulkfree incremental */
1052 hammer2_tid_t reserved00A0[5]; /* 00A0-00C7 */
1055 * Copyids are allocated dynamically from the copyexists bitmap.
1056 * An id from the active copies set (up to 8, see copyinfo later on)
1057 * may still exist after the copy set has been removed from the
1058 * volume header and its bit will remain active in the bitmap and
1059 * cannot be reused until it is 100% removed from the hierarchy.
1061 uint32_t copyexists[8]; /* 00C8-00E7 copy exists bmap */
1062 char reserved0140[248]; /* 00E8-01DF */
1065 * 32 bit CRC array at the end of the first 512 byte sector.
1067 * icrc_sects[7] - First 512-4 bytes of volume header (including all
1068 * the other icrc's except this one).
1070 * icrc_sects[6] - Sector 1 (512 bytes) of volume header, which is
1071 * the blockset for the root.
1073 * icrc_sects[5] - Sector 2
1074 * icrc_sects[4] - Sector 3
1075 * icrc_sects[3] - Sector 4 (the freemap blockset)
1077 hammer2_crc32_t icrc_sects[8]; /* 01E0-01FF */
1080 * sector #1 - 512 bytes
1082 * The entire sector is used by a blockset.
1084 hammer2_blockset_t sroot_blockset; /* 0200-03FF Superroot dir */
1089 char sector2[512]; /* 0400-05FF reserved */
1090 char sector3[512]; /* 0600-07FF reserved */
1091 hammer2_blockset_t freemap_blockset; /* 0800-09FF freemap */
1092 char sector5[512]; /* 0A00-0BFF reserved */
1093 char sector6[512]; /* 0C00-0DFF reserved */
1094 char sector7[512]; /* 0E00-0FFF reserved */
1097 * sector #8-71 - 32768 bytes
1099 * Contains the configuration for up to 256 copyinfo targets. These
1100 * specify local and remote copies operating as masters or slaves.
1101 * copyid's 0 and 255 are reserved (0 indicates an empty slot and 255
1102 * indicates the local media).
1104 * Each inode contains a set of up to 8 copyids, either inherited
1105 * from its parent or explicitly specified in the inode, which
1106 * indexes into this array.
1108 /* 1000-8FFF copyinfo config */
1109 hammer2_volconf_t copyinfo[HAMMER2_COPYID_COUNT];
1112 * Remaining sections are reserved for future use.
1114 char reserved0400[0x6FFC]; /* 9000-FFFB reserved */
1117 * icrc on entire volume header
1119 hammer2_crc32_t icrc_volheader; /* FFFC-FFFF full volume icrc*/
1122 typedef struct hammer2_volume_data hammer2_volume_data_t;
1125 * Various parts of the volume header have their own iCRCs.
1127 * The first 512 bytes has its own iCRC stored at the end of the 512 bytes
1128 * and not included the icrc calculation.
1130 * The second 512 bytes also has its own iCRC but it is stored in the first
1131 * 512 bytes so it covers the entire second 512 bytes.
1133 * The whole volume block (64KB) has an iCRC covering all but the last 4 bytes,
1134 * which is where the iCRC for the whole volume is stored. This is currently
1135 * a catch-all for anything not individually iCRCd.
1137 #define HAMMER2_VOL_ICRC_SECT0 7
1138 #define HAMMER2_VOL_ICRC_SECT1 6
1140 #define HAMMER2_VOLUME_BYTES 65536
1142 #define HAMMER2_VOLUME_ICRC0_OFF 0
1143 #define HAMMER2_VOLUME_ICRC1_OFF 512
1144 #define HAMMER2_VOLUME_ICRCVH_OFF 0
1146 #define HAMMER2_VOLUME_ICRC0_SIZE (512 - 4)
1147 #define HAMMER2_VOLUME_ICRC1_SIZE (512)
1148 #define HAMMER2_VOLUME_ICRCVH_SIZE (65536 - 4)
1150 #define HAMMER2_VOL_VERSION_MIN 1
1151 #define HAMMER2_VOL_VERSION_DEFAULT 1
1152 #define HAMMER2_VOL_VERSION_WIP 2
1154 #define HAMMER2_NUM_VOLHDRS 4
1156 union hammer2_media_data {
1157 hammer2_volume_data_t voldata;
1158 hammer2_inode_data_t ipdata;
1159 hammer2_blockref_t npdata[HAMMER2_IND_COUNT_MAX];
1160 hammer2_bmap_data_t bmdata[HAMMER2_FREEMAP_COUNT];
1161 char buf[HAMMER2_PBUFSIZE];
1164 typedef union hammer2_media_data hammer2_media_data_t;
1166 #endif /* !_VFS_HAMMER2_DISK_H_ */