2 * Copyright (c) 2009 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> and
6 * Michael Neumann <mneumann@ntecs.de>
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
37 #include <sys/fcntl.h>
38 #include <sys/nlookup.h>
42 struct bigblock_stat {
43 int64_t total_bigblocks;
44 int64_t total_free_bigblocks;
49 hammer_format_volume_header(struct hammer_mount *hmp,
50 struct hammer_volume_ondisk *ondisk,
51 const char *vol_name, int vol_no, int vol_count,
52 int64_t vol_size, int64_t boot_area_size, int64_t mem_area_size);
55 hammer_update_volumes_header(hammer_transaction_t trans,
56 struct bigblock_stat *stat);
59 hammer_do_reblock(hammer_transaction_t trans, hammer_inode_t ip);
62 hammer_format_freemap(hammer_transaction_t trans, hammer_volume_t volume,
63 struct bigblock_stat *stat);
66 hammer_free_freemap(hammer_transaction_t trans, hammer_volume_t volume,
67 struct bigblock_stat *stat);
70 hammer_test_free_freemap(hammer_transaction_t trans, hammer_volume_t volume);
73 hammer_ioc_volume_add(hammer_transaction_t trans, hammer_inode_t ip,
74 struct hammer_ioc_volume *ioc)
76 struct hammer_mount *hmp = trans->hmp;
77 struct mount *mp = hmp->mp;
78 struct hammer_volume_ondisk ondisk;
79 struct bigblock_stat stat;
80 hammer_volume_t volume;
84 if (mp->mnt_flag & MNT_RDONLY) {
85 kprintf("Cannot add volume to read-only HAMMER filesystem\n");
89 if (hmp->nvolumes >= HAMMER_MAX_VOLUMES) {
90 kprintf("Max number of HAMMER volumes exceeded\n");
94 if (hammer_lock_ex_try(&hmp->volume_lock) != 0) {
95 kprintf("Another volume operation is in progress!\n");
100 * Find an unused volume number.
102 while (free_vol_no < HAMMER_MAX_VOLUMES &&
103 HAMMER_VOLUME_NUMBER_IS_SET(hmp, free_vol_no)) {
106 if (free_vol_no >= HAMMER_MAX_VOLUMES) {
107 kprintf("Max number of HAMMER volumes exceeded\n");
112 error = hammer_format_volume_header(
115 hmp->rootvol->ondisk->vol_name,
124 error = hammer_install_volume(hmp, ioc->device_name, NULL, &ondisk);
128 hammer_sync_lock_sh(trans);
129 hammer_lock_ex(&hmp->blkmap_lock);
131 volume = hammer_get_volume(hmp, free_vol_no, &error);
132 KKASSERT(volume != NULL && error == 0);
134 error = hammer_format_freemap(trans, volume, &stat);
135 KKASSERT(error == 0);
136 hammer_rel_volume(volume, 0);
139 error = hammer_update_volumes_header(trans, &stat);
140 KKASSERT(error == 0);
142 hammer_unlock(&hmp->blkmap_lock);
143 hammer_sync_unlock(trans);
145 KKASSERT(error == 0);
147 hammer_unlock(&hmp->volume_lock);
149 kprintf("An error occurred: %d\n", error);
158 hammer_ioc_volume_del(hammer_transaction_t trans, hammer_inode_t ip,
159 struct hammer_ioc_volume *ioc)
161 struct hammer_mount *hmp = trans->hmp;
162 struct mount *mp = hmp->mp;
163 struct hammer_volume_ondisk *ondisk;
164 struct bigblock_stat stat;
165 hammer_volume_t volume;
169 if (mp->mnt_flag & MNT_RDONLY) {
170 kprintf("Cannot del volume from read-only HAMMER filesystem\n");
174 if (hammer_lock_ex_try(&hmp->volume_lock) != 0) {
175 kprintf("Another volume operation is in progress!\n");
180 * find volume by volname
183 HAMMER_VOLUME_NUMBER_FOREACH(hmp, vol_no) {
184 volume = hammer_get_volume(hmp, vol_no, &error);
185 KKASSERT(volume != NULL && error == 0);
186 if (strcmp(volume->vol_name, ioc->device_name) == 0) {
189 hammer_rel_volume(volume, 0);
193 if (volume == NULL) {
194 kprintf("Couldn't find volume\n");
199 if (volume == trans->rootvol) {
200 kprintf("Cannot remove root-volume\n");
201 hammer_rel_volume(volume, 0);
207 * Reblock filesystem if the volume is not empty
209 hmp->volume_to_remove = volume->vol_no;
211 if (hammer_test_free_freemap(trans, volume)) {
212 error = hammer_do_reblock(trans, ip);
214 hmp->volume_to_remove = -1;
215 hammer_rel_volume(volume, 0);
223 hammer_flush_dirty(hmp, 30);
225 hammer_sync_lock_sh(trans);
226 hammer_lock_ex(&hmp->blkmap_lock);
229 * We use stat later to update rootvol's big-block stats
231 error = hammer_free_freemap(trans, volume, &stat);
233 kprintf("Failed to free volume: ");
235 kprintf("Volume %d not empty\n", volume->vol_no);
237 kprintf("%d\n", error);
238 hmp->volume_to_remove = -1;
239 hammer_rel_volume(volume, 0);
243 hmp->volume_to_remove = -1;
244 hammer_rel_volume(volume, 0);
249 RB_SCAN(hammer_buf_rb_tree, &hmp->rb_bufs_root, NULL,
250 hammer_unload_buffer, volume);
252 bzero(&ondisk, sizeof(ondisk));
253 error = hammer_unload_volume(volume, &ondisk);
255 kprintf("Failed to unload volume\n");
260 error = hammer_update_volumes_header(trans, &stat);
261 KKASSERT(error == 0);
264 hammer_unlock(&hmp->blkmap_lock);
265 hammer_sync_unlock(trans);
268 hammer_unlock(&hmp->volume_lock);
270 kprintf("An error occurred: %d\n", error);
276 hammer_ioc_volume_list(hammer_transaction_t trans, hammer_inode_t ip,
277 struct hammer_ioc_volume_list *ioc)
279 struct hammer_mount *hmp = trans->hmp;
280 hammer_volume_t volume;
284 if (hammer_lock_ex_try(&hmp->volume_lock) != 0) {
285 kprintf("Another volume operation is in progress!\n");
289 HAMMER_VOLUME_NUMBER_FOREACH(hmp, i) {
290 if (cnt >= ioc->nvols)
292 volume = hammer_get_volume(hmp, i, &error);
293 KKASSERT(volume != NULL && error == 0);
295 len = strlen(volume->vol_name) + 1;
296 KKASSERT(len <= MAXPATHLEN);
298 error = copyout(volume->vol_name, ioc->vols[cnt].device_name,
300 hammer_rel_volume(volume, 0);
308 hammer_unlock(&hmp->volume_lock);
314 hammer_do_reblock(hammer_transaction_t trans, hammer_inode_t ip)
318 struct hammer_ioc_reblock reblock;
319 bzero(&reblock, sizeof(reblock));
321 reblock.key_beg.localization = HAMMER_MIN_LOCALIZATION;
322 reblock.key_beg.obj_id = HAMMER_MIN_OBJID;
323 reblock.key_end.localization = HAMMER_MAX_LOCALIZATION;
324 reblock.key_end.obj_id = HAMMER_MAX_OBJID;
325 reblock.head.flags = HAMMER_IOC_DO_FLAGS;
326 reblock.free_level = 0;
329 kprintf("reblock started\n");
330 error = hammer_ioc_reblock(trans, ip, &reblock);
332 if (reblock.head.flags & HAMMER_IOC_HEAD_INTR) {
337 if (error == EINTR) {
338 kprintf("reblock was interrupted\n");
340 kprintf("reblock failed: %d\n", error);
349 * Iterate over all usable L1 entries of the volume and
350 * the corresponding L2 entries.
353 hammer_iterate_l1l2_entries(hammer_transaction_t trans, hammer_volume_t volume,
354 int (*callback)(hammer_transaction_t, hammer_volume_t, hammer_buffer_t*,
355 struct hammer_blockmap_layer1*, struct hammer_blockmap_layer2*,
356 hammer_off_t, hammer_off_t, void*),
359 struct hammer_mount *hmp = trans->hmp;
360 hammer_blockmap_t freemap = &hmp->blockmap[HAMMER_ZONE_FREEMAP_INDEX];
362 hammer_off_t phys_off;
363 hammer_off_t block_off;
364 hammer_off_t layer1_off;
365 hammer_off_t layer2_off;
366 hammer_off_t aligned_buf_end_off;
367 hammer_off_t aligned_vol_end_off;
368 struct hammer_blockmap_layer1 *layer1;
369 struct hammer_blockmap_layer2 *layer2;
370 hammer_buffer_t buffer1 = NULL;
371 hammer_buffer_t buffer2 = NULL;
374 * Calculate the usable size of the volume, which
375 * must be aligned at a big-block (8 MB) boundary.
377 aligned_buf_end_off = HAMMER_ENCODE_RAW_BUFFER(volume->ondisk->vol_no,
378 (volume->ondisk->vol_buf_end - volume->ondisk->vol_buf_beg)
379 & ~HAMMER_BIGBLOCK_MASK64);
380 aligned_vol_end_off = (aligned_buf_end_off + HAMMER_BLOCKMAP_LAYER2_MASK)
381 & ~HAMMER_BLOCKMAP_LAYER2_MASK;
384 * Iterate the volume's address space in chunks of 4 TB, where each
385 * chunk consists of at least one physically available 8 MB big-block.
387 * For each chunk we need one L1 entry and one L2 big-block.
388 * We use the first big-block of each chunk as L2 block.
390 for (phys_off = HAMMER_ENCODE_RAW_BUFFER(volume->ondisk->vol_no, 0);
391 phys_off < aligned_vol_end_off;
392 phys_off += HAMMER_BLOCKMAP_LAYER2) {
394 block_off < HAMMER_BLOCKMAP_LAYER2;
395 block_off += HAMMER_BIGBLOCK_SIZE) {
396 layer2_off = phys_off +
397 HAMMER_BLOCKMAP_LAYER2_OFFSET(block_off);
398 layer2 = hammer_bread(hmp, layer2_off, &error, &buffer2);
402 error = callback(trans, volume, &buffer2, NULL,
403 layer2, phys_off, block_off, data);
408 layer1_off = freemap->phys_offset +
409 HAMMER_BLOCKMAP_LAYER1_OFFSET(phys_off);
410 layer1 = hammer_bread(hmp, layer1_off, &error, &buffer1);
414 error = callback(trans, volume, &buffer1, layer1, NULL,
422 hammer_rel_buffer(buffer1, 0);
424 hammer_rel_buffer(buffer2, 0);
431 format_callback(hammer_transaction_t trans, hammer_volume_t volume,
432 hammer_buffer_t *bufferp,
433 struct hammer_blockmap_layer1 *layer1,
434 struct hammer_blockmap_layer2 *layer2,
435 hammer_off_t phys_off,
436 hammer_off_t block_off,
439 struct bigblock_stat *stat = (struct bigblock_stat*)data;
442 * Calculate the usable size of the volume, which must be aligned
443 * at a big-block (8 MB) boundary.
445 hammer_off_t aligned_buf_end_off;
446 aligned_buf_end_off = HAMMER_ENCODE_RAW_BUFFER(volume->ondisk->vol_no,
447 (volume->ondisk->vol_buf_end - volume->ondisk->vol_buf_beg)
448 & ~HAMMER_BIGBLOCK_MASK64);
451 KKASSERT(layer1->phys_offset == HAMMER_BLOCKMAP_UNAVAIL);
453 hammer_modify_buffer(trans, *bufferp, layer1, sizeof(*layer1));
454 bzero(layer1, sizeof(*layer1));
455 layer1->phys_offset = phys_off;
456 layer1->blocks_free = stat->counter;
457 layer1->layer1_crc = crc32(layer1, HAMMER_LAYER1_CRCSIZE);
458 hammer_modify_buffer_done(*bufferp);
459 stat->counter = 0; /* reset */
461 hammer_modify_buffer(trans, *bufferp, layer2, sizeof(*layer2));
462 bzero(layer2, sizeof(*layer2));
464 if (block_off == 0) {
466 * The first entry represents the L2 big-block itself.
467 * Note that the first entry represents the L1 big-block
468 * and the second entry represents the L2 big-block for
469 * root volume, but this function assumes the volume is
470 * non-root given that we can't add a new root volume.
472 KKASSERT(trans->rootvol && trans->rootvol != volume);
473 layer2->zone = HAMMER_ZONE_FREEMAP_INDEX;
474 layer2->append_off = HAMMER_BIGBLOCK_SIZE;
475 layer2->bytes_free = 0;
476 } else if (phys_off + block_off < aligned_buf_end_off) {
478 * Available big-block
481 layer2->append_off = 0;
482 layer2->bytes_free = HAMMER_BIGBLOCK_SIZE;
483 ++stat->total_bigblocks;
484 ++stat->total_free_bigblocks;
488 * Big-block outside of physically available
491 layer2->zone = HAMMER_ZONE_UNAVAIL_INDEX;
492 layer2->append_off = HAMMER_BIGBLOCK_SIZE;
493 layer2->bytes_free = 0;
496 layer2->entry_crc = crc32(layer2, HAMMER_LAYER2_CRCSIZE);
497 hammer_modify_buffer_done(*bufferp);
506 hammer_format_freemap(hammer_transaction_t trans, hammer_volume_t volume,
507 struct bigblock_stat *stat)
509 stat->total_bigblocks = 0;
510 stat->total_free_bigblocks = 0;
512 return hammer_iterate_l1l2_entries(trans, volume, format_callback, stat);
516 free_callback(hammer_transaction_t trans, hammer_volume_t volume __unused,
517 hammer_buffer_t *bufferp,
518 struct hammer_blockmap_layer1 *layer1,
519 struct hammer_blockmap_layer2 *layer2,
520 hammer_off_t phys_off,
521 hammer_off_t block_off __unused,
524 struct bigblock_stat *stat = (struct bigblock_stat*)data;
527 if (layer1->phys_offset == HAMMER_BLOCKMAP_UNAVAIL) {
529 * This layer1 entry is already free.
534 KKASSERT((int)HAMMER_VOL_DECODE(layer1->phys_offset) ==
535 trans->hmp->volume_to_remove);
540 hammer_modify_buffer(trans, *bufferp, layer1, sizeof(*layer1));
541 bzero(layer1, sizeof(*layer1));
542 layer1->phys_offset = HAMMER_BLOCKMAP_UNAVAIL;
543 layer1->layer1_crc = crc32(layer1, HAMMER_LAYER1_CRCSIZE);
544 hammer_modify_buffer_done(*bufferp);
548 if (layer2->zone == HAMMER_ZONE_UNAVAIL_INDEX) {
552 if (layer2->zone == HAMMER_ZONE_FREEMAP_INDEX) {
556 if (layer2->append_off == 0 &&
557 layer2->bytes_free == HAMMER_BIGBLOCK_SIZE) {
558 --stat->total_bigblocks;
559 --stat->total_free_bigblocks;
564 * We found a layer2 entry that is not empty!
575 * Non-zero return value means we can't free the volume.
578 test_free_callback(hammer_transaction_t trans, hammer_volume_t volume __unused,
579 hammer_buffer_t *bufferp,
580 struct hammer_blockmap_layer1 *layer1,
581 struct hammer_blockmap_layer2 *layer2,
582 hammer_off_t phys_off,
583 hammer_off_t block_off __unused,
586 if (layer2 == NULL) {
587 return(0); /* only layer2 needs to be tested */
590 if (layer2->zone == HAMMER_ZONE_UNAVAIL_INDEX) {
591 return(0); /* beyond physically available space */
593 if (layer2->zone == HAMMER_ZONE_FREEMAP_INDEX) {
594 return(0); /* big-block for layer1/2 */
596 if (layer2->append_off == 0 &&
597 layer2->bytes_free == HAMMER_BIGBLOCK_SIZE) {
598 return(0); /* big-block is 0% used */
601 return(EBUSY); /* big-block has data */
605 hammer_free_freemap(hammer_transaction_t trans, hammer_volume_t volume,
606 struct bigblock_stat *stat)
610 error = hammer_test_free_freemap(trans, volume);
612 return error; /* not ready to free */
614 stat->total_bigblocks = 0;
615 stat->total_free_bigblocks = 0;
617 return hammer_iterate_l1l2_entries(trans, volume, free_callback, stat);
621 hammer_test_free_freemap(hammer_transaction_t trans, hammer_volume_t volume)
623 return hammer_iterate_l1l2_entries(trans, volume, test_free_callback, NULL);
627 hammer_format_volume_header(struct hammer_mount *hmp,
628 struct hammer_volume_ondisk *ondisk,
629 const char *vol_name, int vol_no, int vol_count,
630 int64_t vol_size, int64_t boot_area_size, int64_t mem_area_size)
634 KKASSERT(HAMMER_BUFSIZE >= sizeof(struct hammer_volume_ondisk));
636 bzero(ondisk, sizeof(struct hammer_volume_ondisk));
637 ksnprintf(ondisk->vol_name, sizeof(ondisk->vol_name), "%s", vol_name);
638 ondisk->vol_fstype = hmp->rootvol->ondisk->vol_fstype;
639 ondisk->vol_signature = HAMMER_FSBUF_VOLUME;
640 ondisk->vol_fsid = hmp->fsid;
641 ondisk->vol_rootvol = hmp->rootvol->vol_no;
642 ondisk->vol_no = vol_no;
643 ondisk->vol_count = vol_count;
644 ondisk->vol_version = hmp->version;
647 * Reserve space for (future) header junk, setup our poor-man's
648 * big-block allocator.
650 vol_alloc = HAMMER_BUFSIZE * 16;
651 ondisk->vol_bot_beg = vol_alloc;
652 vol_alloc += boot_area_size;
653 ondisk->vol_mem_beg = vol_alloc;
654 vol_alloc += mem_area_size;
657 * The remaining area is the zone 2 buffer allocation area. These
660 ondisk->vol_buf_beg = vol_alloc;
661 ondisk->vol_buf_end = vol_size & ~(int64_t)HAMMER_BUFMASK;
663 if (ondisk->vol_buf_end < ondisk->vol_buf_beg) {
664 kprintf("volume %d %s is too small to hold the volume header\n",
665 ondisk->vol_no, ondisk->vol_name);
669 ondisk->vol_nblocks = (ondisk->vol_buf_end - ondisk->vol_buf_beg) /
671 ondisk->vol_blocksize = HAMMER_BUFSIZE;
676 hammer_update_volumes_header(hammer_transaction_t trans,
677 struct bigblock_stat *stat)
679 struct hammer_mount *hmp = trans->hmp;
680 struct mount *mp = hmp->mp;
681 hammer_volume_t volume;
686 * Set each volume's new value of the vol_count field.
688 HAMMER_VOLUME_NUMBER_FOREACH(hmp, vol_no) {
689 volume = hammer_get_volume(hmp, vol_no, &error);
690 KKASSERT(volume != NULL && error == 0);
691 hammer_modify_volume_field(trans, volume, vol_count);
692 volume->ondisk->vol_count = hmp->nvolumes;
693 hammer_modify_volume_done(volume);
696 * Only changes to the header of the root volume
697 * are automatically flushed to disk. For all
698 * other volumes that we modify we do it here.
700 * No interlock is needed, volume buffers are not
701 * messed with by bioops.
703 if (volume != trans->rootvol && volume->io.modified) {
704 hammer_crc_set_volume(volume->ondisk);
705 hammer_io_flush(&volume->io, 0);
708 hammer_rel_volume(volume, 0);
712 * Update the total number of big-blocks.
714 hammer_modify_volume_field(trans, trans->rootvol, vol0_stat_bigblocks);
715 trans->rootvol->ondisk->vol0_stat_bigblocks += stat->total_bigblocks;
716 hammer_modify_volume_done(trans->rootvol);
719 * Big-block count changed so recompute the total number of blocks.
721 mp->mnt_stat.f_blocks = trans->rootvol->ondisk->vol0_stat_bigblocks *
722 HAMMER_BUFFERS_PER_BIGBLOCK;
723 mp->mnt_vstat.f_blocks = trans->rootvol->ondisk->vol0_stat_bigblocks *
724 HAMMER_BUFFERS_PER_BIGBLOCK;
727 * Update the total number of free big-blocks.
729 hammer_modify_volume_field(trans, trans->rootvol,
730 vol0_stat_freebigblocks);
731 trans->rootvol->ondisk->vol0_stat_freebigblocks +=
732 stat->total_free_bigblocks;
733 hammer_modify_volume_done(trans->rootvol);
736 * Update the copy in hmp.
738 hmp->copy_stat_freebigblocks =
739 trans->rootvol->ondisk->vol0_stat_freebigblocks;