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.4 2008/07/19 18:48:14 dillon Exp $
40 * Each collect covers 1<<(19+23) bytes address space of layer 1.
41 * (plus a copy of 1<<23 bytes that holds layer2 entries in layer 1).
43 typedef struct collect {
44 RB_ENTRY(collect) entry;
45 hammer_off_t phys_offset; /* layer2 address pointed by layer1 */
46 hammer_off_t *offsets; /* big-block offset for layer2[i] */
47 struct hammer_blockmap_layer2 *track2; /* track of layer2 entries */
48 struct hammer_blockmap_layer2 *layer2; /* 1<<19 x 16 bytes entries */
49 int error; /* # of inconsistencies */
53 collect_compare(struct collect *c1, struct collect *c2)
55 if (c1->phys_offset < c2->phys_offset)
57 if (c1->phys_offset > c2->phys_offset)
62 RB_HEAD(collect_rb_tree, collect) CollectTree = RB_INITIALIZER(&CollectTree);
63 RB_PROTOTYPE2(collect_rb_tree, collect, entry, collect_compare, hammer_off_t);
64 RB_GENERATE2(collect_rb_tree, collect, entry, collect_compare, hammer_off_t,
67 static void dump_blockmap(const char *label, int zone);
68 static void check_freemap(hammer_blockmap_t freemap);
69 static void check_btree_node(hammer_off_t node_offset, int depth);
70 static void check_undo(hammer_blockmap_t undomap);
71 static __inline void collect_btree_root(hammer_off_t node_offset);
72 static __inline void collect_btree_internal(hammer_btree_elm_t elm);
73 static __inline void collect_btree_leaf(hammer_btree_elm_t elm);
74 static __inline void collect_freemap_layer1(hammer_blockmap_t freemap);
75 static __inline void collect_freemap_layer2(struct hammer_blockmap_layer1 *layer1);
76 static __inline void collect_undo(hammer_off_t scan_offset,
77 hammer_fifo_head_t head);
78 static void collect_blockmap(hammer_off_t offset, int32_t length, int zone);
79 static struct hammer_blockmap_layer2 *collect_get_track(
80 collect_t collect, hammer_off_t offset, int zone,
81 struct hammer_blockmap_layer2 *layer2);
82 static collect_t collect_get(hammer_off_t phys_offset);
83 static void dump_collect_table(void);
84 static void dump_collect(collect_t collect, struct zone_stat *stats);
86 static int num_bad_layer1 = 0;
87 static int num_bad_layer2 = 0;
88 static int num_bad_node = 0;
91 hammer_cmd_blockmap(void)
93 dump_blockmap("freemap", HAMMER_ZONE_FREEMAP_INDEX);
98 dump_blockmap(const char *label, int zone)
100 struct volume_info *root_volume;
101 hammer_blockmap_t rootmap;
102 hammer_blockmap_t blockmap;
103 struct hammer_blockmap_layer1 *layer1;
104 struct hammer_blockmap_layer2 *layer2;
105 struct buffer_info *buffer1 = NULL;
106 struct buffer_info *buffer2 = NULL;
107 hammer_off_t layer1_offset;
108 hammer_off_t layer2_offset;
111 struct zone_stat *stats = NULL;
115 root_volume = get_root_volume();
116 rootmap = &root_volume->ondisk->vol0_blockmap[zone];
117 assert(rootmap->phys_offset != 0);
120 "phys first next alloc\n");
121 for (i = 0; i < HAMMER_MAX_ZONES; i++) {
122 blockmap = &root_volume->ondisk->vol0_blockmap[i];
123 if (VerboseOpt || i == zone) {
124 printf("zone %-2d %-10s %016jx %016jx %016jx %016jx\n",
125 i, (i == zone ? label : ""),
126 (uintmax_t)blockmap->phys_offset,
127 (uintmax_t)blockmap->first_offset,
128 (uintmax_t)blockmap->next_offset,
129 (uintmax_t)blockmap->alloc_offset);
134 stats = hammer_init_zone_stat();
136 for (scan1 = HAMMER_ZONE_ENCODE(zone, 0);
137 scan1 < HAMMER_ZONE_ENCODE(zone, HAMMER_OFF_LONG_MASK);
138 scan1 += HAMMER_BLOCKMAP_LAYER2) {
142 layer1_offset = rootmap->phys_offset +
143 HAMMER_BLOCKMAP_LAYER1_OFFSET(scan1);
144 layer1 = get_buffer_data(layer1_offset, &buffer1, 0);
146 xerr = ' '; /* good */
147 if (layer1->layer1_crc !=
148 crc32(layer1, HAMMER_LAYER1_CRCSIZE)) {
153 layer1->phys_offset == HAMMER_BLOCKMAP_UNAVAIL) {
156 printf("%c layer1 %016jx @%016jx blocks-free %jd\n",
159 (uintmax_t)layer1->phys_offset,
160 (intmax_t)layer1->blocks_free);
163 scan2 < scan1 + HAMMER_BLOCKMAP_LAYER2;
164 scan2 += HAMMER_BIGBLOCK_SIZE) {
166 * Dive layer 2, each entry represents a big-block.
168 layer2_offset = layer1->phys_offset +
169 HAMMER_BLOCKMAP_LAYER2_OFFSET(scan2);
170 layer2 = get_buffer_data(layer2_offset, &buffer2, 0);
172 xerr = ' '; /* good */
173 if (layer2->entry_crc !=
174 crc32(layer2, HAMMER_LAYER2_CRCSIZE)) {
178 printf("%c %016jx zone=%-2d ",
183 printf("vol=%-3d L1=%-7lu L2=%-7lu ",
184 HAMMER_VOL_DECODE(scan2),
185 HAMMER_BLOCKMAP_LAYER1_OFFSET(scan2),
186 HAMMER_BLOCKMAP_LAYER2_OFFSET(scan2));
187 else if (VerboseOpt > 0)
188 printf("vol=%-3d L1=%-6d L2=%-6d ",
189 HAMMER_VOL_DECODE(scan2),
190 HAMMER_BLOCKMAP_LAYER1_INDEX(scan2),
191 HAMMER_BLOCKMAP_LAYER2_INDEX(scan2));
192 printf("app=%-7d free=%-7d",
197 if (layer2->zone != HAMMER_ZONE_UNAVAIL_INDEX) {
198 bytes_used = HAMMER_BIGBLOCK_SIZE -
201 /* UNAVAIL zone has 0 for bytes_free */
204 printf(" fill=%-5.1lf crc=%08x-%08x\n",
205 bytes_used * 100 / HAMMER_BIGBLOCK_SIZE,
213 hammer_add_zone_stat_layer2(stats, layer2);
218 rel_volume(root_volume);
221 hammer_print_zone_stat(stats);
222 hammer_cleanup_zone_stat(stats);
225 if (num_bad_layer1 || VerboseOpt) {
226 printf("%d bad layer1\n", num_bad_layer1);
228 if (num_bad_layer2 || VerboseOpt) {
229 printf("%d bad layer2\n", num_bad_layer1);
234 hammer_cmd_checkmap(void)
236 struct volume_info *volume;
237 hammer_blockmap_t freemap;
238 hammer_blockmap_t undomap;
239 hammer_off_t node_offset;
241 volume = get_root_volume();
242 node_offset = volume->ondisk->vol0_btree_root;
243 freemap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_FREEMAP_INDEX];
244 undomap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_UNDO_INDEX];
247 printf("Volume header\trecords=%jd next_tid=%016jx\n",
248 (intmax_t)volume->ondisk->vol0_stat_records,
249 (uintmax_t)volume->ondisk->vol0_next_tid);
250 printf("\t\tbufoffset=%016jx\n",
251 (uintmax_t)volume->ondisk->vol_buf_beg);
252 printf("\t\tundosize=%jdMB\n",
253 (intmax_t)((undomap->alloc_offset & HAMMER_OFF_LONG_MASK)
258 AssertOnFailure = (DebugOpt != 0);
260 printf("Collecting allocation info from freemap: ");
262 check_freemap(freemap);
265 printf("Collecting allocation info from B-Tree: ");
267 check_btree_node(node_offset, 0);
270 printf("Collecting allocation info from UNDO: ");
275 dump_collect_table();
279 check_freemap(hammer_blockmap_t freemap)
282 struct buffer_info *buffer1 = NULL;
283 struct hammer_blockmap_layer1 *layer1;
286 collect_freemap_layer1(freemap);
288 for (i = 0; i < HAMMER_BLOCKMAP_RADIX1; ++i) {
289 offset = freemap->phys_offset + i * sizeof(*layer1);
290 layer1 = get_buffer_data(offset, &buffer1, 0);
291 if (layer1->phys_offset != HAMMER_BLOCKMAP_UNAVAIL)
292 collect_freemap_layer2(layer1);
298 check_btree_node(hammer_off_t node_offset, int depth)
300 struct buffer_info *buffer = NULL;
301 hammer_node_ondisk_t node;
302 hammer_btree_elm_t elm;
304 char badc = ' '; /* good */
305 char badm = ' '; /* good */
308 collect_btree_root(node_offset);
309 node = get_node(node_offset, &buffer);
314 } else if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) != node->crc) {
318 if (badm != ' ' || badc != ' ') { /* not good */
320 printf("%c%c NODE %016jx ",
321 badc, badm, (uintmax_t)node_offset);
323 printf("(IO ERROR)\n");
327 printf("cnt=%02d p=%016jx type=%c depth=%d mirror=%016jx\n",
329 (uintmax_t)node->parent,
330 (node->type ? node->type : '?'),
332 (uintmax_t)node->mirror_tid);
336 for (i = 0; i < node->count; ++i) {
337 elm = &node->elms[i];
340 case HAMMER_BTREE_TYPE_INTERNAL:
341 if (elm->internal.subtree_offset) {
342 collect_btree_internal(elm);
343 check_btree_node(elm->internal.subtree_offset,
347 case HAMMER_BTREE_TYPE_LEAF:
348 if (elm->leaf.data_offset)
349 collect_btree_leaf(elm);
352 assert(!AssertOnFailure);
360 check_undo(hammer_blockmap_t undomap)
362 struct buffer_info *buffer = NULL;
363 hammer_off_t scan_offset;
364 hammer_fifo_head_t head;
366 scan_offset = HAMMER_ZONE_ENCODE(HAMMER_ZONE_UNDO_INDEX, 0);
367 while (scan_offset < undomap->alloc_offset) {
368 head = get_buffer_data(scan_offset, &buffer, 0);
369 switch (head->hdr_type) {
370 case HAMMER_HEAD_TYPE_PAD:
371 case HAMMER_HEAD_TYPE_DUMMY:
372 case HAMMER_HEAD_TYPE_UNDO:
373 case HAMMER_HEAD_TYPE_REDO:
374 collect_undo(scan_offset, head);
377 assert(!AssertOnFailure);
380 if ((head->hdr_size & HAMMER_HEAD_ALIGN_MASK) ||
381 head->hdr_size == 0 ||
382 head->hdr_size > HAMMER_UNDO_ALIGN -
383 ((u_int)scan_offset & HAMMER_UNDO_MASK)) {
384 printf("Illegal size, skipping to next boundary\n");
385 scan_offset = (scan_offset + HAMMER_UNDO_MASK) &
388 scan_offset += head->hdr_size;
396 collect_freemap_layer1(hammer_blockmap_t freemap)
399 * This translation is necessary to do checkmap properly
400 * as zone4 is really just zone2 address space.
402 hammer_off_t zone4_offset = hammer_xlate_to_zoneX(
403 HAMMER_ZONE_FREEMAP_INDEX, freemap->phys_offset);
404 collect_blockmap(zone4_offset, HAMMER_BIGBLOCK_SIZE,
405 HAMMER_ZONE_FREEMAP_INDEX);
410 collect_freemap_layer2(struct hammer_blockmap_layer1 *layer1)
413 * This translation is necessary to do checkmap properly
414 * as zone4 is really just zone2 address space.
416 hammer_off_t zone4_offset = hammer_xlate_to_zoneX(
417 HAMMER_ZONE_FREEMAP_INDEX, layer1->phys_offset);
418 collect_blockmap(zone4_offset, HAMMER_BIGBLOCK_SIZE,
419 HAMMER_ZONE_FREEMAP_INDEX);
424 collect_btree_root(hammer_off_t node_offset)
426 collect_blockmap(node_offset,
427 sizeof(struct hammer_node_ondisk), /* 4KB */
428 HAMMER_ZONE_BTREE_INDEX);
433 collect_btree_internal(hammer_btree_elm_t elm)
435 collect_blockmap(elm->internal.subtree_offset,
436 sizeof(struct hammer_node_ondisk), /* 4KB */
437 HAMMER_ZONE_BTREE_INDEX);
442 collect_btree_leaf(hammer_btree_elm_t elm)
446 switch (elm->base.rec_type) {
447 case HAMMER_RECTYPE_INODE:
448 case HAMMER_RECTYPE_DIRENTRY:
449 case HAMMER_RECTYPE_EXT:
450 case HAMMER_RECTYPE_FIX:
451 case HAMMER_RECTYPE_PFS:
452 case HAMMER_RECTYPE_SNAPSHOT:
453 case HAMMER_RECTYPE_CONFIG:
454 zone = HAMMER_ZONE_META_INDEX;
456 case HAMMER_RECTYPE_DATA:
457 case HAMMER_RECTYPE_DB:
458 zone = hammer_data_zone_index(elm->leaf.data_len);
461 zone = HAMMER_ZONE_UNAVAIL_INDEX;
464 collect_blockmap(elm->leaf.data_offset,
465 (elm->leaf.data_len + 15) & ~15, zone);
470 collect_undo(hammer_off_t scan_offset, hammer_fifo_head_t head)
472 collect_blockmap(scan_offset, head->hdr_size,
473 HAMMER_ZONE_UNDO_INDEX);
478 collect_blockmap(hammer_off_t offset, int32_t length, int zone)
480 struct hammer_blockmap_layer1 layer1;
481 struct hammer_blockmap_layer2 layer2;
482 struct hammer_blockmap_layer2 *track2;
483 hammer_off_t result_offset;
487 result_offset = blockmap_lookup(offset, &layer1, &layer2, &error);
488 if (AssertOnFailure) {
489 assert(HAMMER_ZONE_DECODE(offset) == zone);
490 assert(HAMMER_ZONE_DECODE(result_offset) ==
491 HAMMER_ZONE_RAW_BUFFER_INDEX);
494 collect = collect_get(layer1.phys_offset); /* layer2 address */
495 track2 = collect_get_track(collect, result_offset, zone, &layer2);
496 track2->bytes_free -= length;
501 collect_get(hammer_off_t phys_offset)
505 collect = RB_LOOKUP(collect_rb_tree, &CollectTree, phys_offset);
509 collect = calloc(sizeof(*collect), 1);
510 collect->track2 = malloc(HAMMER_BIGBLOCK_SIZE); /* 1<<23 bytes */
511 collect->layer2 = malloc(HAMMER_BIGBLOCK_SIZE); /* 1<<23 bytes */
512 collect->offsets = malloc(sizeof(hammer_off_t) * HAMMER_BLOCKMAP_RADIX2);
513 collect->phys_offset = phys_offset;
514 RB_INSERT(collect_rb_tree, &CollectTree, collect);
515 bzero(collect->track2, HAMMER_BIGBLOCK_SIZE);
516 bzero(collect->layer2, HAMMER_BIGBLOCK_SIZE);
523 collect_rel(collect_t collect)
525 free(collect->offsets);
526 free(collect->layer2);
527 free(collect->track2);
532 struct hammer_blockmap_layer2 *
533 collect_get_track(collect_t collect, hammer_off_t offset, int zone,
534 struct hammer_blockmap_layer2 *layer2)
536 struct hammer_blockmap_layer2 *track2;
539 i = HAMMER_BLOCKMAP_LAYER2_INDEX(offset);
540 track2 = &collect->track2[i];
541 if (track2->entry_crc == 0) {
542 collect->layer2[i] = *layer2;
543 collect->offsets[i] = offset & ~HAMMER_BIGBLOCK_MASK64;
545 track2->bytes_free = HAMMER_BIGBLOCK_SIZE;
546 track2->entry_crc = 1; /* steal field to tag track load */
553 dump_collect_table(void)
557 struct zone_stat *stats = NULL;
560 stats = hammer_init_zone_stat();
562 RB_FOREACH(collect, collect_rb_tree, &CollectTree) {
563 dump_collect(collect, stats);
564 error += collect->error;
567 while ((collect = RB_ROOT(&CollectTree)) != NULL) {
568 RB_REMOVE(collect_rb_tree, &CollectTree, collect);
569 collect_rel(collect);
571 assert(RB_EMPTY(&CollectTree));
574 hammer_print_zone_stat(stats);
575 hammer_cleanup_zone_stat(stats);
578 if (num_bad_node || VerboseOpt) {
579 printf("%d bad nodes\n", num_bad_node);
581 if (error || VerboseOpt) {
582 printf("%d errors\n", error);
588 dump_collect(collect_t collect, struct zone_stat *stats)
590 struct hammer_blockmap_layer2 *track2;
591 struct hammer_blockmap_layer2 *layer2;
595 for (i = 0; i < HAMMER_BLOCKMAP_RADIX2; ++i) {
596 track2 = &collect->track2[i];
597 layer2 = &collect->layer2[i];
598 offset = collect->offsets[i];
601 * Check big-blocks referenced by freemap, data,
602 * B-Tree nodes and UNDO fifo.
604 if (track2->entry_crc == 0)
608 if (AssertOnFailure) {
609 assert((zone == HAMMER_ZONE_UNDO_INDEX) ||
610 (zone == HAMMER_ZONE_FREEMAP_INDEX) ||
611 hammer_is_zone2_mapped_index(zone));
614 hammer_add_zone_stat_layer2(stats, layer2);
616 if (track2->zone != layer2->zone) {
617 printf("BZ\tblock=%016jx calc zone=%-2d, got zone=%-2d\n",
622 } else if (track2->bytes_free != layer2->bytes_free) {
623 printf("BM\tblock=%016jx zone=%-2d calc %d free, got %d\n",
629 } else if (VerboseOpt) {
630 printf("\tblock=%016jx zone=%-2d %d free (correct)\n",