sbin/hammer/cmd_blockmap.c

   1 /*
   2  * Copyright (c) 2008 The DragonFly Project.  All rights reserved.
   3  *
   4  * This code is derived from software contributed to The DragonFly Project
   5  * by Matthew Dillon <dillon@backplane.com>
   6  *
   7  * Redistribution and use in source and binary forms, with or without
   8  * modification, are permitted provided that the following conditions
   9  * are met:
  10  *
  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
  16  *    distribution.
  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.
  20  *
  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
  32  * SUCH DAMAGE.
  33  *
  34  * $DragonFly: src/sbin/hammer/cmd_blockmap.c,v 1.4 2008/07/19 18:48:14 dillon Exp $
  35  */
  36
  37 #include "hammer.h"
  38
  39 /*
  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).
  42  */
  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 */
  50 } *collect_t;
  51
  52 static int
  53 collect_compare(struct collect *c1, struct collect *c2)
  54 {
  55         if (c1->phys_offset < c2->phys_offset)
  56                 return(-1);
  57         if (c1->phys_offset > c2->phys_offset)
  58                 return(1);
  59         return(0);
  60 }
  61
  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,
  65         phys_offset);
  66
  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);
  85
  86 static int num_bad_layer1 = 0;
  87 static int num_bad_layer2 = 0;
  88 static int num_bad_node = 0;
  89
  90 void
  91 hammer_cmd_blockmap(void)
  92 {
  93         dump_blockmap("freemap", HAMMER_ZONE_FREEMAP_INDEX);
  94 }
  95
  96 static
  97 void
  98 dump_blockmap(const char *label, int zone)
  99 {
 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;
 109         hammer_off_t phys_offset;
 110         hammer_off_t block_offset;
 111         struct zone_stat *stats = NULL;
 112         int xerr;
 113         int i;
 114
 115         root_volume = get_root_volume();
 116         rootmap = &root_volume->ondisk->vol0_blockmap[zone];
 117         assert(rootmap->phys_offset != 0);
 118
 119         printf("                   "
 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);
 130                 }
 131         }
 132
 133         if (VerboseOpt)
 134                 stats = hammer_init_zone_stat();
 135
 136         for (phys_offset = HAMMER_ZONE_ENCODE(zone, 0);
 137              phys_offset < HAMMER_ZONE_ENCODE(zone, HAMMER_OFF_LONG_MASK);
 138              phys_offset += HAMMER_BLOCKMAP_LAYER2) {
 139                 /*
 140                  * Dive layer 1.
 141                  */
 142                 layer1_offset = rootmap->phys_offset +
 143                                 HAMMER_BLOCKMAP_LAYER1_OFFSET(phys_offset);
 144                 layer1 = get_buffer_data(layer1_offset, &buffer1, 0);
 145
 146                 xerr = ' ';  /* good */
 147                 if (layer1->layer1_crc !=
 148                     crc32(layer1, HAMMER_LAYER1_CRCSIZE)) {
 149                         xerr = 'B';
 150                         ++num_bad_layer1;
 151                 }
 152                 if (xerr == ' ' &&
 153                     layer1->phys_offset == HAMMER_BLOCKMAP_UNAVAIL) {
 154                         continue;
 155                 }
 156                 printf("%c layer1 %016jx @%016jx blocks-free %jd\n",
 157                         xerr,
 158                         (uintmax_t)phys_offset,
 159                         (uintmax_t)layer1->phys_offset,
 160                         (intmax_t)layer1->blocks_free);
 161
 162                 for (block_offset = 0;
 163                      block_offset < HAMMER_BLOCKMAP_LAYER2;
 164                      block_offset += HAMMER_BIGBLOCK_SIZE) {
 165                         hammer_off_t zone_offset = phys_offset + block_offset;
 166                         /*
 167                          * Dive layer 2, each entry represents a big-block.
 168                          */
 169                         layer2_offset = layer1->phys_offset +
 170                                         HAMMER_BLOCKMAP_LAYER2_OFFSET(block_offset);
 171                         layer2 = get_buffer_data(layer2_offset, &buffer2, 0);
 172
 173                         xerr = ' ';  /* good */
 174                         if (layer2->entry_crc !=
 175                             crc32(layer2, HAMMER_LAYER2_CRCSIZE)) {
 176                                 xerr = 'B';
 177                                 ++num_bad_layer2;
 178                         }
 179                         if (VerboseOpt < 2 && xerr == ' ' &&
 180                             layer2->zone == HAMMER_ZONE_UNAVAIL_INDEX) {
 181                                 break;
 182                         }
 183                         printf("%c       %016jx zone=%-2d ",
 184                                 xerr, (uintmax_t)zone_offset, layer2->zone);
 185                         if (VerboseOpt) {
 186                                 printf("vol=%-3d L1#=%-6d L2#=%-6d L1=%-7lu L2=%-7lu ",
 187                                         HAMMER_VOL_DECODE(zone_offset),
 188                                         HAMMER_BLOCKMAP_LAYER1_INDEX(zone_offset),
 189                                         HAMMER_BLOCKMAP_LAYER2_INDEX(zone_offset),
 190                                         HAMMER_BLOCKMAP_LAYER1_OFFSET(zone_offset),
 191                                         HAMMER_BLOCKMAP_LAYER2_OFFSET(zone_offset));
 192                         }
 193                         printf("app=%-7d free=%-7d",
 194                                 layer2->append_off,
 195                                 layer2->bytes_free);
 196                         if (VerboseOpt) {
 197                                 double bytes_used;
 198                                 if (layer2->zone != HAMMER_ZONE_UNAVAIL_INDEX) {
 199                                         bytes_used = HAMMER_BIGBLOCK_SIZE -
 200                                                 layer2->bytes_free;
 201                                 } else {
 202                                         /* UNAVAIL zone has 0 for bytes_free */
 203                                         bytes_used = 0;
 204                                 }
 205                                 printf(" fill=%-5.1lf crc=%08x-%08x\n",
 206                                         bytes_used * 100 / HAMMER_BIGBLOCK_SIZE,
 207                                         layer1->layer1_crc,
 208                                         layer2->entry_crc);
 209                         } else {
 210                                 printf("\n");
 211                         }
 212
 213                         if (VerboseOpt)
 214                                 hammer_add_zone_stat_layer2(stats, layer2);
 215                 }
 216         }
 217         rel_buffer(buffer1);
 218         rel_buffer(buffer2);
 219         rel_volume(root_volume);
 220
 221         if (VerboseOpt) {
 222                 hammer_print_zone_stat(stats);
 223                 hammer_cleanup_zone_stat(stats);
 224         }
 225
 226         if (num_bad_layer1 || VerboseOpt) {
 227                 printf("%d bad layer1\n", num_bad_layer1);
 228         }
 229         if (num_bad_layer2 || VerboseOpt) {
 230                 printf("%d bad layer2\n", num_bad_layer1);
 231         }
 232 }
 233
 234 void
 235 hammer_cmd_checkmap(void)
 236 {
 237         struct volume_info *volume;
 238         hammer_blockmap_t freemap;
 239         hammer_blockmap_t undomap;
 240         hammer_off_t node_offset;
 241
 242         volume = get_root_volume();
 243         node_offset = volume->ondisk->vol0_btree_root;
 244         freemap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_FREEMAP_INDEX];
 245         undomap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_UNDO_INDEX];
 246
 247         if (QuietOpt < 3) {
 248                 printf("Volume header\tnext_tid=%016jx\n",
 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)
 254                         / (1024 * 1024)));
 255         }
 256         rel_volume(volume);
 257
 258         AssertOnFailure = (DebugOpt != 0);
 259
 260         printf("Collecting allocation info from freemap: ");
 261         fflush(stdout);
 262         check_freemap(freemap);
 263         printf("done\n");
 264
 265         printf("Collecting allocation info from B-Tree: ");
 266         fflush(stdout);
 267         check_btree_node(node_offset, 0);
 268         printf("done\n");
 269
 270         printf("Collecting allocation info from UNDO: ");
 271         fflush(stdout);
 272         check_undo(undomap);
 273         printf("done\n");
 274
 275         dump_collect_table();
 276 }
 277
 278 static void
 279 check_freemap(hammer_blockmap_t freemap)
 280 {
 281         hammer_off_t offset;
 282         struct buffer_info *buffer1 = NULL;
 283         struct hammer_blockmap_layer1 *layer1;
 284         int i;
 285
 286         collect_freemap_layer1(freemap);
 287
 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);
 293         }
 294         rel_buffer(buffer1);
 295 }
 296
 297 static void
 298 check_btree_node(hammer_off_t node_offset, int depth)
 299 {
 300         struct buffer_info *buffer = NULL;
 301         hammer_node_ondisk_t node;
 302         hammer_btree_elm_t elm;
 303         int i;
 304         char badc = ' ';  /* good */
 305         char badm = ' ';  /* good */
 306
 307         if (depth == 0)
 308                 collect_btree_root(node_offset);
 309         node = get_node(node_offset, &buffer);
 310
 311         if (node == NULL) {
 312                 badc = 'B';
 313                 badm = 'I';
 314         } else if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) != node->crc) {
 315                 badc = 'B';
 316         }
 317
 318         if (badm != ' ' || badc != ' ') {  /* not good */
 319                 ++num_bad_node;
 320                 printf("%c%c   NODE %016jx ",
 321                         badc, badm, (uintmax_t)node_offset);
 322                 if (node == NULL) {
 323                         printf("(IO ERROR)\n");
 324                         rel_buffer(buffer);
 325                         return;
 326                 } else {
 327                         printf("cnt=%02d p=%016jx type=%c depth=%d mirror=%016jx\n",
 328                                node->count,
 329                                (uintmax_t)node->parent,
 330                                (node->type ? node->type : '?'),
 331                                depth,
 332                                (uintmax_t)node->mirror_tid);
 333                 }
 334         }
 335
 336         for (i = 0; i < node->count; ++i) {
 337                 elm = &node->elms[i];
 338
 339                 switch(node->type) {
 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,
 344                                                  depth + 1);
 345                         }
 346                         break;
 347                 case HAMMER_BTREE_TYPE_LEAF:
 348                         if (elm->leaf.data_offset)
 349                                 collect_btree_leaf(elm);
 350                         break;
 351                 default:
 352                         assert(!AssertOnFailure);
 353                         break;
 354                 }
 355         }
 356         rel_buffer(buffer);
 357 }
 358
 359 static void
 360 check_undo(hammer_blockmap_t undomap)
 361 {
 362         struct buffer_info *buffer = NULL;
 363         hammer_off_t scan_offset;
 364         hammer_fifo_head_t head;
 365
 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);
 375                         break;
 376                 default:
 377                         assert(!AssertOnFailure);
 378                         break;
 379                 }
 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) &
 386                                         ~HAMMER_UNDO_MASK64;
 387                 } else {
 388                         scan_offset += head->hdr_size;
 389                 }
 390         }
 391         rel_buffer(buffer);
 392 }
 393
 394 static __inline
 395 void
 396 collect_freemap_layer1(hammer_blockmap_t freemap)
 397 {
 398         /*
 399          * This translation is necessary to do checkmap properly
 400          * as zone4 is really just zone2 address space.
 401          */
 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);
 406 }
 407
 408 static __inline
 409 void
 410 collect_freemap_layer2(struct hammer_blockmap_layer1 *layer1)
 411 {
 412         /*
 413          * This translation is necessary to do checkmap properly
 414          * as zone4 is really just zone2 address space.
 415          */
 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);
 420 }
 421
 422 static __inline
 423 void
 424 collect_btree_root(hammer_off_t node_offset)
 425 {
 426         collect_blockmap(node_offset,
 427                 sizeof(struct hammer_node_ondisk),  /* 4KB */
 428                 HAMMER_ZONE_BTREE_INDEX);
 429 }
 430
 431 static __inline
 432 void
 433 collect_btree_internal(hammer_btree_elm_t elm)
 434 {
 435         collect_blockmap(elm->internal.subtree_offset,
 436                 sizeof(struct hammer_node_ondisk),  /* 4KB */
 437                 HAMMER_ZONE_BTREE_INDEX);
 438 }
 439
 440 static __inline
 441 void
 442 collect_btree_leaf(hammer_btree_elm_t elm)
 443 {
 444         int zone;
 445
 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;
 455                 break;
 456         case HAMMER_RECTYPE_DATA:
 457         case HAMMER_RECTYPE_DB:
 458                 zone = hammer_data_zone_index(elm->leaf.data_len);
 459                 break;
 460         default:
 461                 zone = HAMMER_ZONE_UNAVAIL_INDEX;
 462                 break;
 463         }
 464         collect_blockmap(elm->leaf.data_offset,
 465                 (elm->leaf.data_len + 15) & ~15, zone);
 466 }
 467
 468 static __inline
 469 void
 470 collect_undo(hammer_off_t scan_offset, hammer_fifo_head_t head)
 471 {
 472         collect_blockmap(scan_offset, head->hdr_size,
 473                 HAMMER_ZONE_UNDO_INDEX);
 474 }
 475
 476 static
 477 void
 478 collect_blockmap(hammer_off_t offset, int32_t length, int zone)
 479 {
 480         struct hammer_blockmap_layer1 layer1;
 481         struct hammer_blockmap_layer2 layer2;
 482         struct hammer_blockmap_layer2 *track2;
 483         hammer_off_t result_offset;
 484         collect_t collect;
 485         int error;
 486
 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);
 492                 assert(error == 0);
 493         }
 494         collect = collect_get(layer1.phys_offset); /* layer2 address */
 495         track2 = collect_get_track(collect, result_offset, zone, &layer2);
 496         track2->bytes_free -= length;
 497 }
 498
 499 static
 500 collect_t
 501 collect_get(hammer_off_t phys_offset)
 502 {
 503         collect_t collect;
 504
 505         collect = RB_LOOKUP(collect_rb_tree, &CollectTree, phys_offset);
 506         if (collect)
 507                 return(collect);
 508
 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);
 517
 518         return (collect);
 519 }
 520
 521 static
 522 void
 523 collect_rel(collect_t collect)
 524 {
 525         free(collect->offsets);
 526         free(collect->layer2);
 527         free(collect->track2);
 528         free(collect);
 529 }
 530
 531 static
 532 struct hammer_blockmap_layer2 *
 533 collect_get_track(collect_t collect, hammer_off_t offset, int zone,
 534                   struct hammer_blockmap_layer2 *layer2)
 535 {
 536         struct hammer_blockmap_layer2 *track2;
 537         size_t i;
 538
 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;
 544                 track2->zone = zone;
 545                 track2->bytes_free = HAMMER_BIGBLOCK_SIZE;
 546                 track2->entry_crc = 1;  /* steal field to tag track load */
 547         }
 548         return (track2);
 549 }
 550
 551 static
 552 void
 553 dump_collect_table(void)
 554 {
 555         collect_t collect;
 556         int error = 0;
 557         struct zone_stat *stats = NULL;
 558
 559         if (VerboseOpt)
 560                 stats = hammer_init_zone_stat();
 561
 562         RB_FOREACH(collect, collect_rb_tree, &CollectTree) {
 563                 dump_collect(collect, stats);
 564                 error += collect->error;
 565         }
 566
 567         while ((collect = RB_ROOT(&CollectTree)) != NULL) {
 568                 RB_REMOVE(collect_rb_tree, &CollectTree, collect);
 569                 collect_rel(collect);
 570         }
 571         assert(RB_EMPTY(&CollectTree));
 572
 573         if (VerboseOpt) {
 574                 hammer_print_zone_stat(stats);
 575                 hammer_cleanup_zone_stat(stats);
 576         }
 577
 578         if (num_bad_node || VerboseOpt) {
 579                 printf("%d bad nodes\n", num_bad_node);
 580         }
 581         if (error || VerboseOpt) {
 582                 printf("%d errors\n", error);
 583         }
 584 }
 585
 586 static
 587 void
 588 dump_collect(collect_t collect, struct zone_stat *stats)
 589 {
 590         struct hammer_blockmap_layer2 *track2;
 591         struct hammer_blockmap_layer2 *layer2;
 592         hammer_off_t offset;
 593         int i, zone;
 594
 595         for (i = 0; i < HAMMER_BLOCKMAP_RADIX2; ++i) {
 596                 track2 = &collect->track2[i];
 597                 layer2 = &collect->layer2[i];
 598                 offset = collect->offsets[i];
 599
 600                 /*
 601                  * Check big-blocks referenced by freemap, data,
 602                  * B-Tree nodes and UNDO fifo.
 603                  */
 604                 if (track2->entry_crc == 0)
 605                         continue;
 606
 607                 zone = layer2->zone;
 608                 if (AssertOnFailure) {
 609                         assert((zone == HAMMER_ZONE_UNDO_INDEX) ||
 610                                 (zone == HAMMER_ZONE_FREEMAP_INDEX) ||
 611                                 hammer_is_zone2_mapped_index(zone));
 612                 }
 613                 if (VerboseOpt)
 614                         hammer_add_zone_stat_layer2(stats, layer2);
 615
 616                 if (track2->zone != layer2->zone) {
 617                         printf("BZ\tblock=%016jx calc zone=%-2d, got zone=%-2d\n",
 618                                 (intmax_t)offset,
 619                                 track2->zone,
 620                                 layer2->zone);
 621                         collect->error++;
 622                 } else if (track2->bytes_free != layer2->bytes_free) {
 623                         printf("BM\tblock=%016jx zone=%-2d calc %d free, got %d\n",
 624                                 (intmax_t)offset,
 625                                 layer2->zone,
 626                                 track2->bytes_free,
 627                                 layer2->bytes_free);
 628                         collect->error++;
 629                 } else if (VerboseOpt) {
 630                         printf("\tblock=%016jx zone=%-2d %d free (correct)\n",
 631                                 (intmax_t)offset,
 632                                 layer2->zone,
 633                                 track2->bytes_free);
 634                 }
 635         }
 636 }