2 * Copyright (c) 2007 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #include <sys/diskslice.h>
36 #include <sys/diskmbr.h>
38 #include "hammer_util.h"
40 static void check_volume(struct volume_info
*volume
);
41 static void get_buffer_readahead(struct buffer_info
*base
);
42 static __inline
int readhammervol(struct volume_info
*volume
);
43 static __inline
int readhammerbuf(struct buffer_info
*buffer
);
44 static __inline
int writehammervol(struct volume_info
*volume
);
45 static __inline
int writehammerbuf(struct buffer_info
*buffer
);
49 int UseReadBehind
= -4;
52 uint32_t HammerVersion
= -1;
54 TAILQ_HEAD(volume_list
, volume_info
);
55 static struct volume_list VolList
= TAILQ_HEAD_INITIALIZER(VolList
);
56 static int valid_hammer_volumes
;
60 buffer_hash(hammer_off_t zone2_offset
)
64 hi
= (int)(zone2_offset
/ HAMMER_BUFSIZE
) & HAMMER_BUFLISTMASK
;
68 static struct buffer_info
*
69 find_buffer(hammer_off_t zone2_offset
)
71 struct volume_info
*volume
;
72 struct buffer_info
*buffer
;
75 volume
= get_volume(HAMMER_VOL_DECODE(zone2_offset
));
78 hi
= buffer_hash(zone2_offset
);
79 TAILQ_FOREACH(buffer
, &volume
->buffer_lists
[hi
], entry
)
80 if (buffer
->zone2_offset
== zone2_offset
)
87 __alloc_volume(const char *volname
, int oflags
)
89 struct volume_info
*volume
;
92 volume
= calloc(1, sizeof(*volume
));
94 volume
->rdonly
= (oflags
== O_RDONLY
);
95 volume
->name
= strdup(volname
);
96 volume
->fd
= open(volume
->name
, oflags
);
98 err(1, "alloc_volume: Failed to open %s", volume
->name
);
101 volume
->ondisk
= calloc(1, HAMMER_BUFSIZE
);
103 for (i
= 0; i
< HAMMER_BUFLISTS
; ++i
)
104 TAILQ_INIT(&volume
->buffer_lists
[i
]);
110 __add_volume(struct volume_info
*volume
)
112 struct volume_info
*scan
;
113 struct stat st1
, st2
;
115 if (fstat(volume
->fd
, &st1
) != 0)
116 errx(1, "add_volume: %s: Failed to stat", volume
->name
);
118 TAILQ_FOREACH(scan
, &VolList
, entry
) {
119 if (scan
->vol_no
== volume
->vol_no
) {
120 errx(1, "add_volume: %s: Duplicate volume number %d "
122 volume
->name
, volume
->vol_no
, scan
->name
);
124 if (fstat(scan
->fd
, &st2
) != 0) {
125 errx(1, "add_volume: %s: Failed to stat %s",
126 volume
->name
, scan
->name
);
128 if ((st1
.st_ino
== st2
.st_ino
) && (st1
.st_dev
== st2
.st_dev
)) {
129 errx(1, "add_volume: %s: Specified more than once",
134 TAILQ_INSERT_TAIL(&VolList
, volume
, entry
);
138 __verify_volume(struct volume_info
*volume
)
140 hammer_volume_ondisk_t ondisk
= volume
->ondisk
;
142 if (ondisk
->vol_signature
!= HAMMER_FSBUF_VOLUME
) {
143 errx(1, "verify_volume: Invalid volume signature %016jx",
144 ondisk
->vol_signature
);
146 if (ondisk
->vol_rootvol
!= HAMMER_ROOT_VOLNO
) {
147 errx(1, "verify_volume: Invalid root volume# %d",
148 ondisk
->vol_rootvol
);
150 if (bcmp(&Hammer_FSType
, &ondisk
->vol_fstype
, sizeof(Hammer_FSType
))) {
151 errx(1, "verify_volume: %s: Header does not indicate "
152 "that this is a HAMMER volume", volume
->name
);
154 if (bcmp(&Hammer_FSId
, &ondisk
->vol_fsid
, sizeof(Hammer_FSId
))) {
155 errx(1, "verify_volume: %s: FSId does not match other volumes!",
161 * Initialize a volume structure and ondisk vol_no field.
164 init_volume(const char *filename
, int oflags
, int32_t vol_no
)
166 struct volume_info
*volume
;
168 volume
= __alloc_volume(filename
, oflags
);
169 volume
->vol_no
= volume
->ondisk
->vol_no
= vol_no
;
171 __add_volume(volume
);
177 * Initialize a volume structure and read ondisk volume header.
180 load_volume(const char *filename
, int oflags
, int verify
)
182 struct volume_info
*volume
;
185 volume
= __alloc_volume(filename
, oflags
);
187 n
= readhammervol(volume
);
189 err(1, "load_volume: %s: Read failed at offset 0",
192 volume
->vol_no
= volume
->ondisk
->vol_no
;
193 HammerVersion
= volume
->ondisk
->vol_version
;
195 if (valid_hammer_volumes
++ == 0)
196 Hammer_FSId
= volume
->ondisk
->vol_fsid
;
198 __verify_volume(volume
);
200 __add_volume(volume
);
206 * Check basic volume characteristics.
209 check_volume(struct volume_info
*volume
)
211 struct partinfo pinfo
;
215 * Get basic information about the volume
217 if (ioctl(volume
->fd
, DIOCGPART
, &pinfo
) < 0) {
219 * Allow the formatting of regular files as HAMMER volumes
221 if (fstat(volume
->fd
, &st
) < 0)
222 err(1, "Unable to stat %s", volume
->name
);
223 volume
->size
= st
.st_size
;
224 volume
->type
= "REGFILE";
227 * When formatting a block device as a HAMMER volume the
228 * sector size must be compatible. HAMMER uses 16384 byte
229 * filesystem buffers.
231 if (pinfo
.reserved_blocks
) {
232 errx(1, "HAMMER cannot be placed in a partition "
233 "which overlaps the disklabel or MBR");
235 if (pinfo
.media_blksize
> HAMMER_BUFSIZE
||
236 HAMMER_BUFSIZE
% pinfo
.media_blksize
) {
237 errx(1, "A media sector size of %d is not supported",
238 pinfo
.media_blksize
);
241 volume
->size
= pinfo
.media_size
;
242 volume
->device_offset
= pinfo
.media_offset
;
243 volume
->type
= "DEVICE";
248 assert_volume_offset(struct volume_info
*volume
)
250 assert(hammer_is_zone_raw_buffer(volume
->vol_free_off
));
251 assert(hammer_is_zone_raw_buffer(volume
->vol_free_end
));
252 if (volume
->vol_free_off
>= volume
->vol_free_end
)
253 errx(1, "Ran out of room, filesystem too small");
257 get_volume(int32_t vol_no
)
259 struct volume_info
*volume
;
261 TAILQ_FOREACH(volume
, &VolList
, entry
) {
262 if (volume
->vol_no
== vol_no
)
270 get_root_volume(void)
272 return(get_volume(HAMMER_ROOT_VOLNO
));
276 __blockmap_xlate_to_zone2(hammer_off_t buf_offset
)
278 hammer_off_t zone2_offset
;
281 if (hammer_is_zone_raw_buffer(buf_offset
))
282 zone2_offset
= buf_offset
;
284 zone2_offset
= blockmap_lookup(buf_offset
, &error
);
287 return(HAMMER_OFF_BAD
);
288 assert(hammer_is_zone_raw_buffer(zone2_offset
));
290 return(zone2_offset
);
293 static struct buffer_info
*
294 __alloc_buffer(hammer_off_t zone2_offset
, int isnew
)
296 struct volume_info
*volume
;
297 struct buffer_info
*buffer
;
300 volume
= get_volume(HAMMER_VOL_DECODE(zone2_offset
));
301 assert(volume
!= NULL
);
303 buffer
= calloc(1, sizeof(*buffer
));
304 buffer
->zone2_offset
= zone2_offset
;
305 buffer
->raw_offset
= hammer_xlate_to_phys(volume
->ondisk
, zone2_offset
);
306 buffer
->volume
= volume
;
307 buffer
->ondisk
= calloc(1, HAMMER_BUFSIZE
);
310 if (readhammerbuf(buffer
) == -1) {
311 err(1, "Failed to read %s:%016jx at %016jx",
313 (intmax_t)buffer
->zone2_offset
,
314 (intmax_t)buffer
->raw_offset
);
318 hi
= buffer_hash(zone2_offset
);
319 TAILQ_INSERT_TAIL(&volume
->buffer_lists
[hi
], buffer
, entry
);
320 hammer_cache_add(&buffer
->cache
);
326 * Acquire the 16KB buffer for specified zone offset.
328 static struct buffer_info
*
329 get_buffer(hammer_off_t buf_offset
, int isnew
)
331 struct buffer_info
*buffer
;
332 hammer_off_t zone2_offset
;
335 zone2_offset
= __blockmap_xlate_to_zone2(buf_offset
);
336 if (zone2_offset
== HAMMER_OFF_BAD
)
339 zone2_offset
&= ~HAMMER_BUFMASK64
;
340 buffer
= find_buffer(zone2_offset
);
342 if (buffer
== NULL
) {
343 buffer
= __alloc_buffer(zone2_offset
, isnew
);
347 hammer_cache_used(&buffer
->cache
);
349 assert(buffer
->ondisk
!= NULL
);
351 ++buffer
->cache
.refs
;
352 hammer_cache_flush();
355 assert(buffer
->cache
.modified
== 0);
356 bzero(buffer
->ondisk
, HAMMER_BUFSIZE
);
357 buffer
->cache
.modified
= 1;
360 get_buffer_readahead(buffer
);
365 get_buffer_readahead(struct buffer_info
*base
)
367 struct buffer_info
*buffer
;
368 struct volume_info
*volume
;
369 hammer_off_t zone2_offset
;
371 int ri
= UseReadBehind
;
372 int re
= UseReadAhead
;
374 raw_offset
= base
->raw_offset
+ ri
* HAMMER_BUFSIZE
;
375 volume
= base
->volume
;
378 if (raw_offset
>= volume
->ondisk
->vol_buf_end
)
380 if (raw_offset
< volume
->ondisk
->vol_buf_beg
|| ri
== 0) {
382 raw_offset
+= HAMMER_BUFSIZE
;
385 zone2_offset
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
,
386 raw_offset
- volume
->ondisk
->vol_buf_beg
);
387 buffer
= find_buffer(zone2_offset
);
388 if (buffer
== NULL
) {
389 /* call with -1 to prevent another readahead */
390 buffer
= get_buffer(zone2_offset
, -1);
394 raw_offset
+= HAMMER_BUFSIZE
;
399 rel_buffer(struct buffer_info
*buffer
)
401 struct volume_info
*volume
;
406 assert(buffer
->cache
.refs
> 0);
407 if (--buffer
->cache
.refs
== 0) {
408 if (buffer
->cache
.delete) {
409 hi
= buffer_hash(buffer
->zone2_offset
);
410 volume
= buffer
->volume
;
411 if (buffer
->cache
.modified
)
412 flush_buffer(buffer
);
413 TAILQ_REMOVE(&volume
->buffer_lists
[hi
], buffer
, entry
);
414 hammer_cache_del(&buffer
->cache
);
415 free(buffer
->ondisk
);
422 * Retrieve a pointer to a buffer data given a buffer offset. The underlying
423 * bufferp is freed if isnew or the offset is out of range of the cached data.
424 * If bufferp is freed a referenced buffer is loaded into it.
427 get_buffer_data(hammer_off_t buf_offset
, struct buffer_info
**bufferp
,
432 if (*bufferp
!= NULL
) {
433 /* XXX xor is always non zero for indirect zones */
434 xor = HAMMER_OFF_LONG_ENCODE(buf_offset
) ^
435 HAMMER_OFF_LONG_ENCODE((*bufferp
)->zone2_offset
);
436 if (isnew
> 0 || (xor & ~HAMMER_BUFMASK64
)) {
437 rel_buffer(*bufferp
);
442 if (*bufferp
== NULL
) {
443 *bufferp
= get_buffer(buf_offset
, isnew
);
444 if (*bufferp
== NULL
)
448 return(((char *)(*bufferp
)->ondisk
) +
449 ((int32_t)buf_offset
& HAMMER_BUFMASK
));
453 * Allocate HAMMER elements - B-Tree nodes
456 alloc_btree_node(hammer_off_t
*offp
, struct buffer_info
**data_bufferp
)
458 hammer_node_ondisk_t node
;
460 node
= alloc_blockmap(HAMMER_ZONE_BTREE_INDEX
, sizeof(*node
),
462 bzero(node
, sizeof(*node
));
467 * Allocate HAMMER elements - meta data (inode, direntry, PFS, etc)
470 alloc_meta_element(hammer_off_t
*offp
, int32_t data_len
,
471 struct buffer_info
**data_bufferp
)
475 data
= alloc_blockmap(HAMMER_ZONE_META_INDEX
, data_len
,
477 bzero(data
, data_len
);
482 * Format a new blockmap. This is mostly a degenerate case because
483 * all allocations are now actually done from the freemap.
486 format_blockmap(struct volume_info
*root_vol
, int zone
, hammer_off_t offset
)
488 hammer_blockmap_t blockmap
;
489 hammer_off_t zone_base
;
491 /* Only root volume needs formatting */
492 assert(root_vol
->vol_no
== HAMMER_ROOT_VOLNO
);
494 assert(hammer_is_index_record(zone
));
496 blockmap
= &root_vol
->ondisk
->vol0_blockmap
[zone
];
497 zone_base
= HAMMER_ZONE_ENCODE(zone
, offset
);
499 bzero(blockmap
, sizeof(*blockmap
));
500 blockmap
->phys_offset
= 0;
501 blockmap
->first_offset
= zone_base
;
502 blockmap
->next_offset
= zone_base
;
503 blockmap
->alloc_offset
= HAMMER_ENCODE(zone
, 255, -1);
504 hammer_crc_set_blockmap(HammerVersion
, blockmap
);
508 * Format a new freemap. Set all layer1 entries to UNAVAIL. The initialize
509 * code will load each volume's freemap.
512 format_freemap(struct volume_info
*root_vol
)
514 struct buffer_info
*buffer
= NULL
;
515 hammer_off_t layer1_offset
;
516 hammer_blockmap_t blockmap
;
517 hammer_blockmap_layer1_t layer1
;
520 /* Only root volume needs formatting */
521 assert(root_vol
->vol_no
== HAMMER_ROOT_VOLNO
);
523 layer1_offset
= bootstrap_bigblock(root_vol
);
524 for (i
= 0; i
< HAMMER_BIGBLOCK_SIZE
; i
+= sizeof(*layer1
)) {
525 isnew
= ((i
% HAMMER_BUFSIZE
) == 0);
526 layer1
= get_buffer_data(layer1_offset
+ i
, &buffer
, isnew
);
527 bzero(layer1
, sizeof(*layer1
));
528 layer1
->phys_offset
= HAMMER_BLOCKMAP_UNAVAIL
;
529 layer1
->blocks_free
= 0;
530 hammer_crc_set_layer1(HammerVersion
, layer1
);
532 assert(i
== HAMMER_BIGBLOCK_SIZE
);
535 blockmap
= &root_vol
->ondisk
->vol0_blockmap
[HAMMER_ZONE_FREEMAP_INDEX
];
536 bzero(blockmap
, sizeof(*blockmap
));
537 blockmap
->phys_offset
= layer1_offset
;
538 blockmap
->first_offset
= 0;
539 blockmap
->next_offset
= HAMMER_ENCODE_RAW_BUFFER(0, 0);
540 blockmap
->alloc_offset
= HAMMER_ENCODE_RAW_BUFFER(255, -1);
541 hammer_crc_set_blockmap(HammerVersion
, blockmap
);
545 * Load the volume's remaining free space into the freemap.
547 * Returns the number of big-blocks available.
550 initialize_freemap(struct volume_info
*volume
)
552 struct volume_info
*root_vol
;
553 struct buffer_info
*buffer1
= NULL
;
554 struct buffer_info
*buffer2
= NULL
;
555 hammer_blockmap_layer1_t layer1
;
556 hammer_blockmap_layer2_t layer2
;
557 hammer_off_t layer1_offset
;
558 hammer_off_t layer2_offset
;
559 hammer_off_t phys_offset
;
560 hammer_off_t block_offset
;
561 hammer_off_t aligned_vol_free_end
;
562 hammer_blockmap_t freemap
;
564 int64_t layer1_count
= 0;
566 root_vol
= get_root_volume();
568 assert_volume_offset(volume
);
569 aligned_vol_free_end
= HAMMER_BLOCKMAP_LAYER2_DOALIGN(volume
->vol_free_end
);
571 printf("initialize freemap volume %d\n", volume
->vol_no
);
574 * Initialize the freemap. First preallocate the big-blocks required
575 * to implement layer2. This preallocation is a bootstrap allocation
576 * using blocks from the target volume.
578 freemap
= &root_vol
->ondisk
->vol0_blockmap
[HAMMER_ZONE_FREEMAP_INDEX
];
580 for (phys_offset
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
, 0);
581 phys_offset
< aligned_vol_free_end
;
582 phys_offset
+= HAMMER_BLOCKMAP_LAYER2
) {
583 layer1_offset
= freemap
->phys_offset
+
584 HAMMER_BLOCKMAP_LAYER1_OFFSET(phys_offset
);
585 layer1
= get_buffer_data(layer1_offset
, &buffer1
, 0);
586 if (layer1
->phys_offset
== HAMMER_BLOCKMAP_UNAVAIL
) {
587 layer1
->phys_offset
= bootstrap_bigblock(volume
);
588 layer1
->blocks_free
= 0;
589 buffer1
->cache
.modified
= 1;
590 hammer_crc_set_layer1(HammerVersion
, layer1
);
595 * Now fill everything in.
597 for (phys_offset
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
, 0);
598 phys_offset
< aligned_vol_free_end
;
599 phys_offset
+= HAMMER_BLOCKMAP_LAYER2
) {
601 layer1_offset
= freemap
->phys_offset
+
602 HAMMER_BLOCKMAP_LAYER1_OFFSET(phys_offset
);
603 layer1
= get_buffer_data(layer1_offset
, &buffer1
, 0);
604 assert(layer1
->phys_offset
!= HAMMER_BLOCKMAP_UNAVAIL
);
606 for (block_offset
= 0;
607 block_offset
< HAMMER_BLOCKMAP_LAYER2
;
608 block_offset
+= HAMMER_BIGBLOCK_SIZE
) {
609 layer2_offset
= layer1
->phys_offset
+
610 HAMMER_BLOCKMAP_LAYER2_OFFSET(block_offset
);
611 layer2
= get_buffer_data(layer2_offset
, &buffer2
, 0);
612 bzero(layer2
, sizeof(*layer2
));
614 if (phys_offset
+ block_offset
< volume
->vol_free_off
) {
616 * Big-blocks already allocated as part
617 * of the freemap bootstrap.
619 layer2
->zone
= HAMMER_ZONE_FREEMAP_INDEX
;
620 layer2
->append_off
= HAMMER_BIGBLOCK_SIZE
;
621 layer2
->bytes_free
= 0;
622 } else if (phys_offset
+ block_offset
< volume
->vol_free_end
) {
624 layer2
->append_off
= 0;
625 layer2
->bytes_free
= HAMMER_BIGBLOCK_SIZE
;
629 layer2
->zone
= HAMMER_ZONE_UNAVAIL_INDEX
;
630 layer2
->append_off
= HAMMER_BIGBLOCK_SIZE
;
631 layer2
->bytes_free
= 0;
633 hammer_crc_set_layer2(HammerVersion
, layer2
);
634 buffer2
->cache
.modified
= 1;
637 layer1
->blocks_free
+= layer1_count
;
638 hammer_crc_set_layer1(HammerVersion
, layer1
);
639 buffer1
->cache
.modified
= 1;
648 * Returns the number of big-blocks available for filesystem data and undos
649 * without formatting.
652 count_freemap(struct volume_info
*volume
)
654 hammer_off_t phys_offset
;
655 hammer_off_t vol_free_off
;
656 hammer_off_t aligned_vol_free_end
;
659 vol_free_off
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
, 0);
661 assert_volume_offset(volume
);
662 aligned_vol_free_end
= HAMMER_BLOCKMAP_LAYER2_DOALIGN(volume
->vol_free_end
);
664 if (volume
->vol_no
== HAMMER_ROOT_VOLNO
)
665 vol_free_off
+= HAMMER_BIGBLOCK_SIZE
;
667 for (phys_offset
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
, 0);
668 phys_offset
< aligned_vol_free_end
;
669 phys_offset
+= HAMMER_BLOCKMAP_LAYER2
) {
670 vol_free_off
+= HAMMER_BIGBLOCK_SIZE
;
673 for (phys_offset
= HAMMER_ENCODE_RAW_BUFFER(volume
->vol_no
, 0);
674 phys_offset
< aligned_vol_free_end
;
675 phys_offset
+= HAMMER_BIGBLOCK_SIZE
) {
676 if (phys_offset
< vol_free_off
)
678 else if (phys_offset
< volume
->vol_free_end
)
686 * Format the undomap for the root volume.
689 format_undomap(struct volume_info
*root_vol
, int64_t *undo_buffer_size
)
691 hammer_off_t undo_limit
;
692 hammer_blockmap_t blockmap
;
693 hammer_volume_ondisk_t ondisk
;
694 struct buffer_info
*buffer
= NULL
;
700 /* Only root volume needs formatting */
701 assert(root_vol
->vol_no
== HAMMER_ROOT_VOLNO
);
702 ondisk
= root_vol
->ondisk
;
705 * Size the undo buffer in multiples of HAMMER_BIGBLOCK_SIZE,
706 * up to HAMMER_MAX_UNDO_BIGBLOCKS big-blocks.
707 * Size to approximately 0.1% of the disk.
709 * The minimum UNDO fifo size is 512MB, or approximately 1% of
710 * the recommended 50G disk.
712 * Changing this minimum is rather dangerous as complex filesystem
713 * operations can cause the UNDO FIFO to fill up otherwise.
715 undo_limit
= *undo_buffer_size
;
716 if (undo_limit
== 0) {
717 undo_limit
= HAMMER_VOL_BUF_SIZE(ondisk
) / 1000;
718 if (undo_limit
< HAMMER_BIGBLOCK_SIZE
* HAMMER_MIN_UNDO_BIGBLOCKS
)
719 undo_limit
= HAMMER_BIGBLOCK_SIZE
* HAMMER_MIN_UNDO_BIGBLOCKS
;
721 undo_limit
= HAMMER_BIGBLOCK_DOALIGN(undo_limit
);
722 if (undo_limit
< HAMMER_BIGBLOCK_SIZE
)
723 undo_limit
= HAMMER_BIGBLOCK_SIZE
;
724 if (undo_limit
> HAMMER_BIGBLOCK_SIZE
* HAMMER_MAX_UNDO_BIGBLOCKS
)
725 undo_limit
= HAMMER_BIGBLOCK_SIZE
* HAMMER_MAX_UNDO_BIGBLOCKS
;
726 *undo_buffer_size
= undo_limit
;
728 blockmap
= &ondisk
->vol0_blockmap
[HAMMER_ZONE_UNDO_INDEX
];
729 bzero(blockmap
, sizeof(*blockmap
));
730 blockmap
->phys_offset
= HAMMER_BLOCKMAP_UNAVAIL
;
731 blockmap
->first_offset
= HAMMER_ENCODE_UNDO(0);
732 blockmap
->next_offset
= blockmap
->first_offset
;
733 blockmap
->alloc_offset
= HAMMER_ENCODE_UNDO(undo_limit
);
734 hammer_crc_set_blockmap(HammerVersion
, blockmap
);
736 limit_index
= undo_limit
/ HAMMER_BIGBLOCK_SIZE
;
737 assert(limit_index
<= HAMMER_MAX_UNDO_BIGBLOCKS
);
739 for (n
= 0; n
< limit_index
; ++n
)
740 ondisk
->vol0_undo_array
[n
] = alloc_undo_bigblock(root_vol
);
741 while (n
< HAMMER_MAX_UNDO_BIGBLOCKS
)
742 ondisk
->vol0_undo_array
[n
++] = HAMMER_BLOCKMAP_UNAVAIL
;
745 * Pre-initialize the UNDO blocks (HAMMER version 4+)
747 printf("initializing the undo map (%jd MB)\n",
748 (intmax_t)HAMMER_OFF_LONG_ENCODE(blockmap
->alloc_offset
) /
751 scan
= blockmap
->first_offset
;
754 while (scan
< blockmap
->alloc_offset
) {
755 hammer_fifo_head_t head
;
756 hammer_fifo_tail_t tail
;
758 int bytes
= HAMMER_UNDO_ALIGN
;
760 isnew
= ((scan
& HAMMER_BUFMASK64
) == 0);
761 head
= get_buffer_data(scan
, &buffer
, isnew
);
762 buffer
->cache
.modified
= 1;
763 tail
= (void *)((char *)head
+ bytes
- sizeof(*tail
));
766 head
->hdr_signature
= HAMMER_HEAD_SIGNATURE
;
767 head
->hdr_type
= HAMMER_HEAD_TYPE_DUMMY
;
768 head
->hdr_size
= bytes
;
769 head
->hdr_seq
= seqno
++;
771 tail
->tail_signature
= HAMMER_TAIL_SIGNATURE
;
772 tail
->tail_type
= HAMMER_HEAD_TYPE_DUMMY
;
773 tail
->tail_size
= bytes
;
775 hammer_crc_set_fifo_head(HammerVersion
, head
, bytes
);
782 const char *zone_labels
[] = {
784 "raw_volume", /* 1 */
785 "raw_buffer", /* 2 */
793 "large_data", /* 10 */
794 "small_data", /* 11 */
802 print_blockmap(const struct volume_info
*volume
)
804 hammer_blockmap_t blockmap
;
805 hammer_volume_ondisk_t ondisk
;
810 ondisk
= volume
->ondisk
;
811 printf(INDENT
"vol_label\t%s\n", ondisk
->vol_label
);
812 printf(INDENT
"vol_count\t%d\n", ondisk
->vol_count
);
813 printf(INDENT
"vol_bot_beg\t%s\n", sizetostr(ondisk
->vol_bot_beg
));
814 printf(INDENT
"vol_mem_beg\t%s\n", sizetostr(ondisk
->vol_mem_beg
));
815 printf(INDENT
"vol_buf_beg\t%s\n", sizetostr(ondisk
->vol_buf_beg
));
816 printf(INDENT
"vol_buf_end\t%s\n", sizetostr(ondisk
->vol_buf_end
));
817 printf(INDENT
"vol0_next_tid\t%016jx\n",
818 (uintmax_t)ondisk
->vol0_next_tid
);
820 blockmap
= &ondisk
->vol0_blockmap
[HAMMER_ZONE_UNDO_INDEX
];
821 size
= HAMMER_OFF_LONG_ENCODE(blockmap
->alloc_offset
);
822 if (blockmap
->first_offset
<= blockmap
->next_offset
)
823 used
= blockmap
->next_offset
- blockmap
->first_offset
;
825 used
= blockmap
->alloc_offset
- blockmap
->first_offset
+
826 HAMMER_OFF_LONG_ENCODE(blockmap
->next_offset
);
827 printf(INDENT
"undo_size\t%s\n", sizetostr(size
));
828 printf(INDENT
"undo_used\t%s\n", sizetostr(used
));
830 printf(INDENT
"zone # "
831 "phys first next alloc\n");
832 for (i
= 0; i
< HAMMER_MAX_ZONES
; i
++) {
833 blockmap
= &ondisk
->vol0_blockmap
[i
];
834 printf(INDENT
"zone %-2d %-10s %016jx %016jx %016jx %016jx\n",
836 (uintmax_t)blockmap
->phys_offset
,
837 (uintmax_t)blockmap
->first_offset
,
838 (uintmax_t)blockmap
->next_offset
,
839 (uintmax_t)blockmap
->alloc_offset
);
844 * Flush various tracking structures to disk
847 flush_all_volumes(void)
849 struct volume_info
*volume
;
851 TAILQ_FOREACH(volume
, &VolList
, entry
)
852 flush_volume(volume
);
856 flush_volume(struct volume_info
*volume
)
858 struct buffer_info
*buffer
;
861 for (i
= 0; i
< HAMMER_BUFLISTS
; ++i
) {
862 TAILQ_FOREACH(buffer
, &volume
->buffer_lists
[i
], entry
)
863 flush_buffer(buffer
);
865 if (writehammervol(volume
) == -1)
866 err(1, "Write volume %d (%s)", volume
->vol_no
, volume
->name
);
870 flush_buffer(struct buffer_info
*buffer
)
872 struct volume_info
*volume
;
874 volume
= buffer
->volume
;
875 if (writehammerbuf(buffer
) == -1)
876 err(1, "Write volume %d (%s)", volume
->vol_no
, volume
->name
);
877 buffer
->cache
.modified
= 0;
881 * Core I/O operations
884 __read(struct volume_info
*volume
, void *data
, int64_t offset
, int size
)
888 n
= pread(volume
->fd
, data
, size
, offset
);
895 readhammervol(struct volume_info
*volume
)
897 return(__read(volume
, volume
->ondisk
, 0, HAMMER_BUFSIZE
));
901 readhammerbuf(struct buffer_info
*buffer
)
903 return(__read(buffer
->volume
, buffer
->ondisk
, buffer
->raw_offset
,
908 __write(struct volume_info
*volume
, const void *data
, int64_t offset
, int size
)
915 n
= pwrite(volume
->fd
, data
, size
, offset
);
922 writehammervol(struct volume_info
*volume
)
924 return(__write(volume
, volume
->ondisk
, 0, HAMMER_BUFSIZE
));
928 writehammerbuf(struct buffer_info
*buffer
)
930 return(__write(buffer
->volume
, buffer
->ondisk
, buffer
->raw_offset
,
934 int64_t init_boot_area_size(int64_t value
, off_t avg_vol_size
)
937 value
= HAMMER_BOOT_NOMBYTES
;
938 while (value
> avg_vol_size
/ HAMMER_MAX_VOLUMES
)
942 if (value
< HAMMER_BOOT_MINBYTES
)
943 value
= HAMMER_BOOT_MINBYTES
;
944 else if (value
> HAMMER_BOOT_MAXBYTES
)
945 value
= HAMMER_BOOT_MAXBYTES
;
950 int64_t init_memory_log_size(int64_t value
, off_t avg_vol_size
)
953 value
= HAMMER_MEM_NOMBYTES
;
954 while (value
> avg_vol_size
/ HAMMER_MAX_VOLUMES
)
958 if (value
< HAMMER_MEM_MINBYTES
)
959 value
= HAMMER_MEM_MINBYTES
;
960 else if (value
> HAMMER_MEM_MAXBYTES
)
961 value
= HAMMER_MEM_MAXBYTES
;