2 * Copyright (c) 2008 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
34 * $DragonFly: src/sbin/hammer/cmd_blockmap.c,v 1.3 2008/06/17 04:03:38 dillon Exp $
40 static void dump_blockmap(const char *label, int zone);
44 hammer_cmd_blockmap(void)
47 dump_blockmap("btree", HAMMER_ZONE_BTREE_INDEX);
48 dump_blockmap("meta", HAMMER_ZONE_META_INDEX);
49 dump_blockmap("large-data", HAMMER_ZONE_LARGE_DATA_INDEX);
50 dump_blockmap("small-data", HAMMER_ZONE_SMALL_DATA_INDEX);
58 dump_blockmap(const char *label, int zone)
60 struct volume_info *root_volume;
61 hammer_blockmap_t rootmap;
62 struct hammer_blockmap_layer1 *layer1;
63 struct hammer_blockmap_layer2 *layer2;
64 struct buffer_info *buffer1 = NULL;
65 struct buffer_info *buffer2 = NULL;
66 hammer_off_t layer1_offset;
67 hammer_off_t layer2_offset;
71 assert(zone >= HAMMER_ZONE_BTREE_INDEX && zone < HAMMER_MAX_ZONES);
72 assert(RootVolNo >= 0);
73 root_volume = get_volume(RootVolNo);
74 rootmap = &root_volume->ondisk->vol0_blockmap[zone];
75 assert(rootmap->phys_offset != 0);
77 printf("zone %-16s next %016llx alloc %016llx\n",
78 label, rootmap->next_offset, rootmap->alloc_offset);
80 for (scan1 = HAMMER_ZONE_ENCODE(zone, 0);
81 scan1 < rootmap->alloc_offset;
82 scan1 += HAMMER_BLOCKMAP_LAYER1) {
86 layer1_offset = rootmap->phys_offset +
87 HAMMER_BLOCKMAP_LAYER1_OFFSET(scan1);
88 layer1 = get_buffer_data(layer1_offset, &buffer1, 0);
89 printf(" layer1 %016llx @%016llx blocks-free %lld\n",
90 scan1, layer1->phys_offset, layer1->blocks_free);
91 if (layer1->phys_offset == HAMMER_BLOCKMAP_FREE)
94 scan2 < scan1 + HAMMER_BLOCKMAP_LAYER1 &&
95 scan2 < rootmap->alloc_offset;
96 scan2 += HAMMER_LARGEBLOCK_SIZE
99 * Dive layer 2, each entry represents a large-block.
101 layer2_offset = layer1->phys_offset +
102 HAMMER_BLOCKMAP_LAYER2_OFFSET(scan2);
103 layer2 = get_buffer_data(layer2_offset, &buffer2, 0);
104 switch(layer2->u.phys_offset) {
105 case HAMMER_BLOCKMAP_FREE:
107 case HAMMER_BLOCKMAP_UNAVAIL:
110 printf(" %016llx @%016llx "
112 scan2, layer2->u.phys_offset,
113 layer2->bytes_free * 100 /
114 HAMMER_LARGEBLOCK_SIZE,
124 rel_volume(root_volume);