sbin/hammer/cmd_show.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
  35 #include <libutil.h>
  36
  37 #include "hammer.h"
  38
  39 #define FLAG_TOOFARLEFT         0x0001
  40 #define FLAG_TOOFARRIGHT        0x0002
  41 #define FLAG_BADTYPE            0x0004
  42 #define FLAG_BADCHILDPARENT     0x0008
  43 #define FLAG_BADMIRRORTID       0x0010
  44
  45 typedef struct btree_search {
  46         struct hammer_base_elm base;
  47         int             limit;   /* # of fields to test */
  48         int             filter;  /* filter type (default -1) */
  49 } *btree_search_t;
  50
  51 static void print_btree_node(hammer_off_t node_offset, btree_search_t search,
  52                         int depth, hammer_tid_t mirror_tid,
  53                         hammer_base_elm_t left_bound,
  54                         hammer_base_elm_t right_bound,
  55                         struct zone_stat *stats);
  56 static const char *check_data_crc(hammer_btree_elm_t elm);
  57 static void print_record(hammer_btree_elm_t elm);
  58 static void print_btree_elm(hammer_node_ondisk_t node, hammer_off_t node_offset,
  59                         hammer_btree_elm_t elm,
  60                         hammer_base_elm_t left_bound,
  61                         hammer_base_elm_t right_bound,
  62                         const char *ext, struct zone_stat *stats);
  63 static int get_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
  64                         hammer_btree_elm_t elm,
  65                         hammer_base_elm_t left_bound,
  66                         hammer_base_elm_t right_bound);
  67 static int test_lr(hammer_btree_elm_t elm,
  68                         hammer_base_elm_t left_bound,
  69                         hammer_base_elm_t right_bound);
  70 static int test_rbn_lr(hammer_btree_elm_t elm,
  71                         hammer_base_elm_t left_bound,
  72                         hammer_base_elm_t right_bound);
  73 static void print_bigblock_fill(hammer_off_t offset);
  74 static int init_btree_search(const char *arg, int filter,
  75                         btree_search_t search);
  76 static int test_btree_search(hammer_btree_elm_t elm, btree_search_t search);
  77 static int test_btree_match(hammer_btree_elm_t elm, btree_search_t search);
  78 static int test_btree_out_of_range(hammer_btree_elm_t elm, btree_search_t search);
  79
  80 static int num_bad_node = 0;
  81 static int num_bad_elm = 0;
  82
  83 void
  84 hammer_cmd_show(hammer_off_t node_offset, const char *arg,
  85                 int filter, int depth,
  86                 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
  87 {
  88         struct volume_info *volume;
  89         struct btree_search search;
  90         struct zone_stat *stats = NULL;
  91         int zone;
  92
  93         AssertOnFailure = (DebugOpt != 0);
  94
  95         if (VerboseOpt)
  96                 stats = hammer_init_zone_stat_bits();
  97
  98         if (node_offset == (hammer_off_t)-1) {
  99                 volume = get_volume(RootVolNo);
 100                 node_offset = volume->ondisk->vol0_btree_root;
 101                 if (QuietOpt < 3) {
 102                         printf("Volume header\trecords=%jd next_tid=%016jx\n",
 103                                (intmax_t)volume->ondisk->vol0_stat_records,
 104                                (uintmax_t)volume->ondisk->vol0_next_tid);
 105                         printf("\t\tbufoffset=%016jx\n",
 106                                (uintmax_t)volume->ondisk->vol_buf_beg);
 107                         for (zone = 0; zone < HAMMER_MAX_ZONES; ++zone) {
 108                                 printf("\t\tzone %d\tnext_offset=%016jx\n",
 109                                         zone,
 110                                         (uintmax_t)volume->ondisk->vol0_blockmap[zone].next_offset
 111                                 );
 112                         }
 113                 }
 114                 rel_volume(volume);
 115         }
 116
 117         printf("show %016jx", (uintmax_t)node_offset);
 118         init_btree_search(arg, filter, &search);
 119         if (arg) {
 120                 if (search.limit >= 1)
 121                         printf(" lo %08x", search.base.localization);
 122                 if (search.limit >= 2)
 123                         printf(" obj_id %016jx", (uintmax_t)search.base.obj_id);
 124                 if (search.limit >= 3)
 125                         printf(" rec_type %02x", search.base.rec_type);
 126                 if (search.limit >= 4)
 127                         printf(" key %016jx", (uintmax_t)search.base.key);
 128                 if (search.limit == 5)
 129                         printf(" create_tid %016jx\n",
 130                                 (uintmax_t)search.base.create_tid);
 131         }
 132         printf(" depth %d\n", depth);
 133         print_btree_node(node_offset, &search, depth, HAMMER_MAX_TID,
 134                          left_bound, right_bound, stats);
 135
 136         AssertOnFailure = 1;
 137
 138         if (VerboseOpt) {
 139                 hammer_print_zone_stat(stats);
 140                 hammer_cleanup_zone_stat(stats);
 141         }
 142
 143         if (num_bad_node || VerboseOpt) {
 144                 printf("%d bad nodes\n", num_bad_node);
 145         }
 146         if (num_bad_elm || VerboseOpt) {
 147                 printf("%d bad elms\n", num_bad_elm);
 148         }
 149 }
 150
 151 static void
 152 print_btree_node(hammer_off_t node_offset, btree_search_t search,
 153                 int depth, hammer_tid_t mirror_tid,
 154                 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound,
 155                 struct zone_stat *stats)
 156 {
 157         struct buffer_info *buffer = NULL;
 158         hammer_node_ondisk_t node;
 159         hammer_btree_elm_t elm;
 160         int i;
 161         int maxcount;
 162         char badc = ' ';  /* good */
 163         char badm = ' ';  /* good */
 164         const char *ext;
 165
 166         node = get_node(node_offset, &buffer);
 167
 168         if (node == NULL) {
 169                 badc = 'B';
 170                 badm = 'I';
 171         } else {
 172                 if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) != node->crc)
 173                         badc = 'B';
 174                 if (node->mirror_tid > mirror_tid) {
 175                         badc = 'B';
 176                         badm = 'M';
 177                 }
 178                 maxcount = hammer_node_max_elements(node->type);
 179                 if (maxcount == -1) {
 180                         badc = 'B';
 181                         badm = 'U';
 182                 } else if (node->count == 0 || node->count > maxcount) {
 183                         badc = 'B';
 184                         badm = 'C';
 185                 }
 186         }
 187
 188         if (badm != ' ' || badc != ' ')  /* not good */
 189                 ++num_bad_node;
 190
 191         printf("%c%c   NODE %016jx ", badc, badm, (uintmax_t)node_offset);
 192         if (node == NULL) {
 193                 printf("(IO ERROR)\n");
 194                 rel_buffer(buffer);
 195                 return;
 196         }
 197
 198         printf("cnt=%02d p=%016jx type=%c depth=%d mirror=%016jx",
 199                node->count,
 200                (uintmax_t)node->parent,
 201                (node->type ? node->type : '?'),
 202                depth,
 203                (uintmax_t)node->mirror_tid);
 204         if (QuietOpt < 3) {
 205                 printf(" fill=");
 206                 print_bigblock_fill(node_offset);
 207         }
 208         printf(" {\n");
 209
 210         if (VerboseOpt)
 211                 hammer_add_zone_stat(stats, node_offset, sizeof(*node));
 212
 213         for (i = 0; i < node->count; ++i) {
 214                 elm = &node->elms[i];
 215                 ext = NULL;
 216
 217                 if (search->limit) {
 218                         switch (node->type) {
 219                         case HAMMER_BTREE_TYPE_INTERNAL:
 220                                 if (!test_btree_out_of_range(elm, search))
 221                                         ext = "*";
 222                                 break;
 223                         case HAMMER_BTREE_TYPE_LEAF:
 224                                 if (test_btree_match(elm, search))
 225                                         ext = "*";
 226                                 break;
 227                         }
 228                 }
 229                 print_btree_elm(node, node_offset,
 230                                 elm, left_bound, right_bound,
 231                                 ext, stats);
 232         }
 233         if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
 234                 assert(i == node->count);  /* boundary */
 235                 elm = &node->elms[i];
 236                 print_btree_elm(node, node_offset,
 237                                 elm, left_bound, right_bound,
 238                                 NULL, stats);
 239         }
 240         printf("     }\n");
 241
 242         if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
 243                 for (i = 0; i < node->count; ++i) {
 244                         elm = &node->elms[i];
 245                         if (search->limit && search->filter) {
 246                                 if (test_btree_out_of_range(elm, search))
 247                                         continue;
 248                         }
 249                         if (elm->internal.subtree_offset) {
 250                                 print_btree_node(elm->internal.subtree_offset,
 251                                                  search, depth + 1,
 252                                                  elm->internal.mirror_tid,
 253                                                  &elm[0].base, &elm[1].base,
 254                                                  stats);
 255                                 /*
 256                                  * Cause show to do normal iteration after
 257                                  * seeking to the lo:objid:rectype:key:tid
 258                                  * by default
 259                                  */
 260                                 if (search->limit && search->filter == -1)  /* default */
 261                                         search->filter = 0;
 262                         }
 263                 }
 264         }
 265         rel_buffer(buffer);
 266 }
 267
 268 static __inline
 269 int
 270 is_root_btree_beg(uint8_t type, int i, hammer_btree_elm_t elm)
 271 {
 272         /*
 273          * elm->base.btype depends on what the original node had
 274          * so it could be anything but HAMMER_BTREE_TYPE_NONE.
 275          */
 276         return (type == HAMMER_BTREE_TYPE_INTERNAL &&
 277                 i == 0 &&
 278                 elm->base.localization == 0 &&
 279                 elm->base.obj_id == (int64_t)-0x8000000000000000LL &&
 280                 elm->base.key == (int64_t)-0x8000000000000000LL &&
 281                 elm->base.create_tid == 1 &&
 282                 elm->base.delete_tid == 1 &&
 283                 elm->base.rec_type == 0 &&
 284                 elm->base.obj_type == 0 &&
 285                 elm->base.btype != HAMMER_BTREE_TYPE_NONE);
 286 }
 287
 288 static __inline
 289 int
 290 is_root_btree_end(uint8_t type, int i, hammer_btree_elm_t elm)
 291 {
 292         return (type == HAMMER_BTREE_TYPE_INTERNAL &&
 293                 i != 0 &&
 294                 elm->base.localization == 0xFFFFFFFFU &&
 295                 elm->base.obj_id == 0x7FFFFFFFFFFFFFFFLL &&
 296                 elm->base.key == 0x7FFFFFFFFFFFFFFFLL &&
 297                 elm->base.create_tid == 0xFFFFFFFFFFFFFFFFULL &&
 298                 elm->base.delete_tid == 0 &&
 299                 elm->base.rec_type == 0xFFFFU &&
 300                 elm->base.obj_type == 0 &&
 301                 elm->base.btype == HAMMER_BTREE_TYPE_NONE);
 302 }
 303
 304 static
 305 void
 306 print_btree_elm(hammer_node_ondisk_t node, hammer_off_t node_offset,
 307                 hammer_btree_elm_t elm,
 308                 hammer_base_elm_t left_bound,
 309                 hammer_base_elm_t right_bound,
 310                 const char *ext, struct zone_stat *stats)
 311 {
 312         char flagstr[8] = { 0, '-', '-', '-', '-', '-', '-', 0 };
 313         char deleted;
 314         char rootelm;
 315         const char *label;
 316         int flags;
 317         int i = ((char*)elm - (char*)node) / 64 - 1;
 318
 319         flags = get_elm_flags(node, node_offset, elm, left_bound, right_bound);
 320         flagstr[0] = flags ? 'B' : 'G';
 321         if (flags & FLAG_TOOFARLEFT)
 322                 flagstr[2] = 'L';
 323         if (flags & FLAG_TOOFARRIGHT)
 324                 flagstr[3] = 'R';
 325         if (flags & FLAG_BADTYPE)
 326                 flagstr[4] = 'T';
 327         if (flags & FLAG_BADCHILDPARENT)
 328                 flagstr[5] = 'C';
 329         if (flags & FLAG_BADMIRRORTID)
 330                 flagstr[6] = 'M';
 331         if (flagstr[0] == 'B')
 332                 ++num_bad_elm;
 333
 334         /*
 335          * Check if elm is derived from root split
 336          */
 337         if (is_root_btree_beg(node->type, i, elm))
 338                 rootelm = '>';
 339         else if (is_root_btree_end(node->type, i, elm))
 340                 rootelm = '<';
 341         else
 342                 rootelm = ' ';
 343
 344         if (elm->base.delete_tid)
 345                 deleted = 'd';
 346         else
 347                 deleted = ' ';
 348
 349         if (node->type == HAMMER_BTREE_TYPE_INTERNAL && node->count == i)
 350                 label = "RBN";
 351         else
 352                 label = "ELM";
 353
 354         printf("%s\t%s %2d %c ", flagstr, label, i, hammer_elm_btype(elm));
 355         printf("lo=%08x obj=%016jx rt=%02x key=%016jx tid=%016jx\n",
 356                elm->base.localization,
 357                (uintmax_t)elm->base.obj_id,
 358                elm->base.rec_type,
 359                (uintmax_t)elm->base.key,
 360                (uintmax_t)elm->base.create_tid);
 361         printf("\t       %c del=%016jx ot=%02x ",
 362                (rootelm == ' ' ? deleted : rootelm),
 363                (uintmax_t)elm->base.delete_tid,
 364                elm->base.obj_type);
 365
 366         switch(node->type) {
 367         case HAMMER_BTREE_TYPE_INTERNAL:
 368                 printf("suboff=%016jx",
 369                        (uintmax_t)elm->internal.subtree_offset);
 370                 if (QuietOpt < 3) {
 371                         printf(" mirror=%016jx",
 372                                (uintmax_t)elm->internal.mirror_tid);
 373                 }
 374                 if (ext)
 375                         printf(" %s", ext);
 376                 break;
 377         case HAMMER_BTREE_TYPE_LEAF:
 378                 switch(elm->base.btype) {
 379                 case HAMMER_BTREE_TYPE_RECORD:
 380                         if (QuietOpt < 3)
 381                                 printf("\n%s\t         ", check_data_crc(elm));
 382                         else
 383                                 printf("\n\t         ");
 384                         printf("dataoff=%016jx/%d",
 385                                (uintmax_t)elm->leaf.data_offset,
 386                                elm->leaf.data_len);
 387                         if (QuietOpt < 3) {
 388                                 printf(" crc=%04x", elm->leaf.data_crc);
 389                                 printf("\n\t         fill=");
 390                                 print_bigblock_fill(elm->leaf.data_offset);
 391                         }
 392                         if (QuietOpt < 2)
 393                                 print_record(elm);
 394                         if (VerboseOpt)
 395                                 hammer_add_zone_stat(stats,
 396                                         elm->leaf.data_offset,
 397                                         elm->leaf.data_len);
 398                         break;
 399                 default:
 400                         printf("\n\t         ");
 401                         printf("badtype=%d", elm->base.btype);
 402                         break;
 403                 }
 404                 if (ext)
 405                         printf(" %s", ext);
 406                 break;
 407         }
 408         printf("\n");
 409 }
 410
 411 static
 412 int
 413 get_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
 414                 hammer_btree_elm_t elm,
 415                 hammer_base_elm_t left_bound,
 416                 hammer_base_elm_t right_bound)
 417 {
 418         hammer_off_t child_offset;
 419         int flags = 0;
 420         int i = ((char*)elm - (char*)node) / 64 - 1;
 421
 422         switch(node->type) {
 423         case HAMMER_BTREE_TYPE_INTERNAL:
 424                 child_offset = elm->internal.subtree_offset;
 425                 if (elm->internal.mirror_tid > node->mirror_tid)
 426                         flags |= FLAG_BADMIRRORTID;
 427
 428                 if (i == node->count) {
 429                         if (child_offset != 0)
 430                                 flags |= FLAG_BADCHILDPARENT;
 431                         switch(elm->base.btype) {
 432                         case HAMMER_BTREE_TYPE_NONE:
 433                                 flags |= test_rbn_lr(elm, left_bound, right_bound);
 434                                 break;
 435                         default:
 436                                 flags |= FLAG_BADTYPE;
 437                                 break;
 438                         }
 439                 } else {
 440                         if (child_offset == 0) {
 441                                 flags |= FLAG_BADCHILDPARENT;
 442                         } else {
 443                                 struct buffer_info *buffer = NULL;
 444                                 hammer_node_ondisk_t subnode;
 445                                 subnode = get_node(child_offset, &buffer);
 446                                 if (subnode == NULL)
 447                                         flags |= FLAG_BADCHILDPARENT;
 448                                 else if (subnode->parent != node_offset)
 449                                         flags |= FLAG_BADCHILDPARENT;
 450                                 rel_buffer(buffer);
 451                         }
 452                         switch(elm->base.btype) {
 453                         case HAMMER_BTREE_TYPE_INTERNAL:
 454                         case HAMMER_BTREE_TYPE_LEAF:
 455                                 flags |= test_lr(elm, left_bound, right_bound);
 456                                 break;
 457                         default:
 458                                 flags |= FLAG_BADTYPE;
 459                                 break;
 460                         }
 461                 }
 462                 break;
 463         case HAMMER_BTREE_TYPE_LEAF:
 464                 if (elm->leaf.data_offset == 0) {
 465                         flags |= FLAG_BADCHILDPARENT;
 466                 }
 467                 if (elm->leaf.data_len == 0) {
 468                         flags |= FLAG_BADCHILDPARENT;
 469                 }
 470
 471                 if (node->mirror_tid == 0 &&
 472                     !(node->parent == 0 && node->count == 2)) {
 473                         flags |= FLAG_BADMIRRORTID;
 474                 }
 475                 if (elm->base.create_tid && node->mirror_tid &&
 476                     elm->base.create_tid > node->mirror_tid) {
 477                         flags |= FLAG_BADMIRRORTID;
 478                 }
 479                 if (elm->base.delete_tid && node->mirror_tid &&
 480                     elm->base.delete_tid > node->mirror_tid) {
 481                         flags |= FLAG_BADMIRRORTID;
 482                 }
 483                 switch(elm->base.btype) {
 484                 case HAMMER_BTREE_TYPE_RECORD:
 485                         flags |= test_lr(elm, left_bound, right_bound);
 486                         break;
 487                 default:
 488                         flags |= FLAG_BADTYPE;
 489                         break;
 490                 }
 491                 break;
 492         default:
 493                 flags |= FLAG_BADTYPE;
 494                 break;
 495         }
 496         return(flags);
 497 }
 498
 499 static
 500 int
 501 test_lr(hammer_btree_elm_t elm,
 502         hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
 503 {
 504         if (left_bound == NULL || right_bound == NULL)
 505                 return(0);
 506         if (hammer_btree_cmp(&elm->base, left_bound) < 0)
 507                 return(FLAG_TOOFARLEFT);
 508         if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
 509                 return(FLAG_TOOFARRIGHT);
 510         return(0);
 511 }
 512
 513 static
 514 int
 515 test_rbn_lr(hammer_btree_elm_t rbn,
 516         hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
 517 {
 518         if (left_bound == NULL || right_bound == NULL)
 519                 return(0);
 520         if (hammer_btree_cmp(&rbn->base, left_bound) < 0)
 521                 return(FLAG_TOOFARLEFT);
 522         if (hammer_btree_cmp(&rbn->base, right_bound) > 0)
 523                 return(FLAG_TOOFARRIGHT);
 524         return(0);
 525 }
 526
 527 static
 528 void
 529 print_bigblock_fill(hammer_off_t offset)
 530 {
 531         struct hammer_blockmap_layer1 layer1;
 532         struct hammer_blockmap_layer2 layer2;
 533         int fill;
 534         int error;
 535
 536         blockmap_lookup(offset, &layer1, &layer2, &error);
 537         printf("z%d:v%d:%d:%d:%lu=",
 538                 HAMMER_ZONE_DECODE(offset),
 539                 HAMMER_VOL_DECODE(offset),
 540                 HAMMER_BLOCKMAP_LAYER1_INDEX(offset),
 541                 HAMMER_BLOCKMAP_LAYER2_INDEX(offset),
 542                 offset & HAMMER_BIGBLOCK_MASK64);
 543
 544         if (error) {
 545                 printf("B%d", error);
 546         } else {
 547                 fill = layer2.bytes_free * 100 / HAMMER_BIGBLOCK_SIZE;
 548                 fill = 100 - fill;
 549                 printf("%d%%", fill);
 550         }
 551 }
 552
 553 /*
 554  * Check the generic crc on a data element.  Inodes record types are
 555  * special in that some of their fields are not CRCed.
 556  *
 557  * Also check that the zone is valid.
 558  */
 559 static
 560 const char *
 561 check_data_crc(hammer_btree_elm_t elm)
 562 {
 563         struct buffer_info *data_buffer;
 564         hammer_off_t data_offset;
 565         int32_t data_len;
 566         int32_t len;
 567         uint32_t crc;
 568         int error;
 569         char *ptr;
 570
 571         data_offset = elm->leaf.data_offset;
 572         data_len = elm->leaf.data_len;
 573         data_buffer = NULL;
 574         if (data_offset == 0 || data_len == 0)
 575                 return("Z");
 576
 577         crc = 0;
 578         error = 0;
 579         while (data_len) {
 580                 blockmap_lookup(data_offset, NULL, NULL, &error);
 581                 if (error)
 582                         break;
 583
 584                 ptr = get_buffer_data(data_offset, &data_buffer, 0);
 585                 len = HAMMER_BUFSIZE - ((int)data_offset & HAMMER_BUFMASK);
 586                 if (len > data_len)
 587                         len = (int)data_len;
 588                 if (elm->leaf.base.rec_type == HAMMER_RECTYPE_INODE &&
 589                     data_len == sizeof(struct hammer_inode_data)) {
 590                         crc = crc32_ext(ptr, HAMMER_INODE_CRCSIZE, crc);
 591                 } else {
 592                         crc = crc32_ext(ptr, len, crc);
 593                 }
 594                 data_len -= len;
 595                 data_offset += len;
 596         }
 597         rel_buffer(data_buffer);
 598         if (error) {
 599                 switch (error) {        /* bad offset */
 600                 case -1:
 601                         return("BO-ZL");
 602                 case -2:
 603                         return("BO-ZG");
 604                 case -3:
 605                         return("BO-RV");
 606                 case -4:
 607                         return("BO-AO");
 608                 case -5:
 609                         return("BO-DE");
 610                 case -6:
 611                         return("BO-L1");
 612                 case -7:
 613                         return("BO-LU");
 614                 case -8:
 615                         return("BO-L2");
 616                 case -9:
 617                         return("BO-LZ");
 618                 default:
 619                         return("BO-??");
 620                 }
 621         }
 622         if (crc == elm->leaf.data_crc)
 623                 return("");
 624         return("BX");                   /* bad crc */
 625 }
 626
 627 static
 628 void
 629 print_config(char *cfgtxt)
 630 {
 631         char *token;
 632
 633         printf("\n%17stext=\"\n", "");
 634         while((token = strsep(&cfgtxt, "\r\n")) != NULL) {
 635                 printf("%17s  %s\n", "", token);
 636         }
 637         printf("%17s\"", "");
 638 }
 639
 640 static
 641 void
 642 print_record(hammer_btree_elm_t elm)
 643 {
 644         struct buffer_info *data_buffer;
 645         hammer_off_t data_offset;
 646         int32_t data_len;
 647         hammer_data_ondisk_t data;
 648         uint32_t status;
 649         char *str1 = NULL;
 650         char *str2 = NULL;
 651
 652         data_offset = elm->leaf.data_offset;
 653         data_len = elm->leaf.data_len;
 654         assert(data_offset != 0);
 655         assert(data_len != 0);
 656
 657         data_buffer = NULL;
 658         data = get_buffer_data(data_offset, &data_buffer, 0);
 659         assert(data != NULL);
 660
 661         switch(elm->leaf.base.rec_type) {
 662         case HAMMER_RECTYPE_UNKNOWN:
 663                 printf("\n%17s", "");
 664                 printf("unknown");
 665                 break;
 666         case HAMMER_RECTYPE_INODE:
 667                 printf("\n%17s", "");
 668                 printf("size=%jd nlinks=%jd",
 669                        (intmax_t)data->inode.size,
 670                        (intmax_t)data->inode.nlinks);
 671                 if (QuietOpt < 1) {
 672                         printf(" mode=%05o uflags=%08x\n",
 673                                 data->inode.mode,
 674                                 data->inode.uflags);
 675                         printf("%17s", "");
 676                         printf("ctime=%016jx pobjid=%016jx ot=%02x\n",
 677                                 (uintmax_t)data->inode.ctime,
 678                                 (uintmax_t)data->inode.parent_obj_id,
 679                                 data->inode.obj_type);
 680                         printf("%17s", "");
 681                         printf("mtime=%016jx caps=%02x",
 682                                 (uintmax_t)data->inode.mtime,
 683                                 data->inode.cap_flags);
 684                 }
 685                 break;
 686         case HAMMER_RECTYPE_DIRENTRY:
 687                 data_len -= HAMMER_ENTRY_NAME_OFF;
 688                 printf("\n%17s", "");
 689                 printf("dir-entry ino=%016jx lo=%08x name=\"%*.*s\"",
 690                        (uintmax_t)data->entry.obj_id,
 691                        data->entry.localization,
 692                        data_len, data_len, data->entry.name);
 693                 break;
 694         case HAMMER_RECTYPE_FIX:
 695                 switch(elm->leaf.base.key) {
 696                 case HAMMER_FIXKEY_SYMLINK:
 697                         data_len -= HAMMER_SYMLINK_NAME_OFF;
 698                         printf("\n%17s", "");
 699                         printf("symlink=\"%*.*s\"", data_len, data_len,
 700                                 data->symlink.name);
 701                         break;
 702                 }
 703                 break;
 704         case HAMMER_RECTYPE_PFS:
 705                 printf("\n%17s", "");
 706                 printf("sync_beg_tid=%016jx sync_end_tid=%016jx\n",
 707                         (intmax_t)data->pfsd.sync_beg_tid,
 708                         (intmax_t)data->pfsd.sync_end_tid);
 709                 uuid_to_string(&data->pfsd.shared_uuid, &str1, &status);
 710                 uuid_to_string(&data->pfsd.unique_uuid, &str2, &status);
 711                 printf("%17s", "");
 712                 printf("shared_uuid=%s\n", str1);
 713                 printf("%17s", "");
 714                 printf("unique_uuid=%s\n", str2);
 715                 printf("%17s", "");
 716                 printf("mirror_flags=%08x label=\"%s\"",
 717                         data->pfsd.mirror_flags, data->pfsd.label);
 718                 if (data->pfsd.snapshots[0])
 719                         printf(" snapshots=\"%s\"", data->pfsd.snapshots);
 720                 free(str1);
 721                 free(str2);
 722                 break;
 723         case HAMMER_RECTYPE_SNAPSHOT:
 724                 printf("\n%17s", "");
 725                 printf("tid=%016jx label=\"%s\"",
 726                         (intmax_t)data->snap.tid, data->snap.label);
 727                 break;
 728         case HAMMER_RECTYPE_CONFIG:
 729                 if (VerboseOpt > 2) {
 730                         print_config(data->config.text);
 731                 }
 732                 break;
 733         case HAMMER_RECTYPE_DATA:
 734                 if (VerboseOpt > 3) {
 735                         printf("\n");
 736                         hexdump(data, data_len, "\t\t  ", 0);
 737                 }
 738                 break;
 739         case HAMMER_RECTYPE_EXT:
 740         case HAMMER_RECTYPE_DB:
 741                 if (VerboseOpt > 2) {
 742                         printf("\n");
 743                         hexdump(data, data_len, "\t\t  ", 0);
 744                 }
 745                 break;
 746         default:
 747                 assert(0);
 748                 break;
 749         }
 750         rel_buffer(data_buffer);
 751 }
 752
 753 static __inline
 754 unsigned long
 755 _strtoul(const char *p, int base)
 756 {
 757         unsigned long retval;
 758
 759         errno = 0;  /* clear */
 760         retval = strtoul(p, NULL, base);
 761         if (errno == ERANGE && retval == ULONG_MAX)
 762                 err(1, "strtoul");
 763         return retval;
 764 }
 765
 766 static __inline
 767 unsigned long long
 768 _strtoull(const char *p, int base)
 769 {
 770         unsigned long long retval;
 771
 772         errno = 0;  /* clear */
 773         retval = strtoull(p, NULL, base);
 774         if (errno == ERANGE && retval == ULLONG_MAX)
 775                 err(1, "strtoull");
 776         return retval;
 777 }
 778
 779 static int
 780 init_btree_search(const char *arg, int filter, btree_search_t search)
 781 {
 782         char *s, *p;
 783         int i = 0;
 784
 785         bzero(&search->base, sizeof(search->base));
 786         search->limit = 0;
 787         search->filter = filter;
 788
 789         if (arg == NULL)
 790                 return(-1);
 791
 792         s = strdup(arg);
 793         if (s == NULL)
 794                 return(-1);
 795
 796         while ((p = s) != NULL) {
 797                 if ((s = strchr(s, ':')) != NULL)
 798                         *s++ = 0;
 799                 if (++i == 1) {
 800                         search->base.localization = _strtoul(p, 16);
 801                 } else if (i == 2) {
 802                         search->base.obj_id = _strtoull(p, 16);
 803                 } else if (i == 3) {
 804                         search->base.rec_type = _strtoul(p, 16);
 805                 } else if (i == 4) {
 806                         search->base.key = _strtoull(p, 16);
 807                 } else if (i == 5) {
 808                         search->base.create_tid = _strtoull(p, 16);
 809                         break;
 810                 }
 811         }
 812         search->limit = i;
 813         free(s);
 814
 815         return(i);
 816 }
 817
 818 static int
 819 test_btree_search(hammer_btree_elm_t elm, btree_search_t search)
 820 {
 821         hammer_base_elm_t base1 = &elm->base;
 822         hammer_base_elm_t base2 = &search->base;
 823         assert(search);
 824
 825         if (base1->localization < base2->localization)
 826                 return(-1);
 827         if (base1->localization > base2->localization)
 828                 return(1);
 829         if (search->limit == 1)
 830                 return(0);  /* ignore below */
 831
 832         if (base1->obj_id < base2->obj_id)
 833                 return(-2);
 834         if (base1->obj_id > base2->obj_id)
 835                 return(2);
 836         if (search->limit == 2)
 837                 return(0);  /* ignore below */
 838
 839         if (base1->rec_type < base2->rec_type)
 840                 return(-3);
 841         if (base1->rec_type > base2->rec_type)
 842                 return(3);
 843         if (search->limit == 3)
 844                 return(0);  /* ignore below */
 845
 846         if (base1->key < base2->key)
 847                 return(-4);
 848         if (base1->key > base2->key)
 849                 return(4);
 850         if (search->limit == 4)
 851                 return(0);  /* ignore below */
 852
 853         if (base1->create_tid == 0) {
 854                 if (base2->create_tid == 0)
 855                         return(0);
 856                 return(5);
 857         }
 858         if (base2->create_tid == 0)
 859                 return(-5);
 860         if (base1->create_tid < base2->create_tid)
 861                 return(-5);
 862         if (base1->create_tid > base2->create_tid)
 863                 return(5);
 864         return(0);
 865 }
 866
 867 static __inline
 868 int
 869 test_btree_match(hammer_btree_elm_t elm, btree_search_t search)
 870 {
 871         if (test_btree_search(elm, search) == 0)
 872                 return(1);
 873         return(0);
 874 }
 875
 876 static
 877 int
 878 test_btree_out_of_range(hammer_btree_elm_t elm, btree_search_t search)
 879 {
 880         if (test_btree_search(elm, search) > 0)
 881                 return(1);  /* search < this elm */
 882
 883         if (search->limit >= 5) {
 884                 if (test_btree_search(elm + 1, search) <= 0)
 885                         return(1);  /* next elm <= search */
 886         } else {
 887                 if (test_btree_search(elm + 1, search) < 0)
 888                         return(1);  /* next elm < search */
 889         }
 890         return(0);
 891 }
 892
 893 /*
 894  * Dump the UNDO FIFO
 895  */
 896 void
 897 hammer_cmd_show_undo(void)
 898 {
 899         struct volume_info *volume;
 900         hammer_blockmap_t rootmap;
 901         hammer_off_t scan_offset;
 902         hammer_fifo_any_t head;
 903         struct buffer_info *data_buffer = NULL;
 904         int64_t bytes;
 905
 906         volume = get_volume(RootVolNo);
 907         rootmap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_UNDO_INDEX];
 908         if (rootmap->first_offset <= rootmap->next_offset)
 909                 bytes = rootmap->next_offset - rootmap->first_offset;
 910         else
 911                 bytes = rootmap->alloc_offset - rootmap->first_offset +
 912                         (rootmap->next_offset & HAMMER_OFF_LONG_MASK);
 913
 914         printf("Volume header UNDO %016jx-%016jx/%016jx\n",
 915                 (intmax_t)rootmap->first_offset,
 916                 (intmax_t)rootmap->next_offset,
 917                 (intmax_t)rootmap->alloc_offset);
 918         printf("UNDO map is %jdMB\n",
 919                 (intmax_t)((rootmap->alloc_offset & HAMMER_OFF_LONG_MASK) /
 920                            (1024 * 1024)));
 921         printf("UNDO being used is %jdB\n", (intmax_t)bytes);
 922
 923         scan_offset = HAMMER_ZONE_ENCODE(HAMMER_ZONE_UNDO_INDEX, 0);
 924         while (scan_offset < rootmap->alloc_offset) {
 925                 head = get_buffer_data(scan_offset, &data_buffer, 0);
 926                 printf("%016jx ", scan_offset);
 927
 928                 switch(head->head.hdr_type) {
 929                 case HAMMER_HEAD_TYPE_PAD:
 930                         printf("PAD(%04x)", head->head.hdr_size);
 931                         break;
 932                 case HAMMER_HEAD_TYPE_DUMMY:
 933                         printf("DUMMY(%04x) seq=%08x",
 934                                 head->head.hdr_size, head->head.hdr_seq);
 935                         break;
 936                 case HAMMER_HEAD_TYPE_UNDO:
 937                         printf("UNDO(%04x) seq=%08x "
 938                                "dataoff=%016jx bytes=%d",
 939                                 head->head.hdr_size, head->head.hdr_seq,
 940                                 (intmax_t)head->undo.undo_offset,
 941                                 head->undo.undo_data_bytes);
 942                         break;
 943                 case HAMMER_HEAD_TYPE_REDO:
 944                         printf("REDO(%04x) seq=%08x flags=%08x "
 945                                "objid=%016jx logoff=%016jx bytes=%d",
 946                                 head->head.hdr_size, head->head.hdr_seq,
 947                                 head->redo.redo_flags,
 948                                 (intmax_t)head->redo.redo_objid,
 949                                 (intmax_t)head->redo.redo_offset,
 950                                 head->redo.redo_data_bytes);
 951                         break;
 952                 default:
 953                         printf("UNKNOWN(%04x,%04x) seq=%08x",
 954                                 head->head.hdr_type,
 955                                 head->head.hdr_size,
 956                                 head->head.hdr_seq);
 957                         break;
 958                 }
 959
 960                 if (scan_offset == rootmap->first_offset)
 961                         printf(" >");
 962                 if (scan_offset == rootmap->next_offset)
 963                         printf(" <");
 964                 printf("\n");
 965
 966                 if ((head->head.hdr_size & HAMMER_HEAD_ALIGN_MASK) ||
 967                     head->head.hdr_size == 0 ||
 968                     head->head.hdr_size > HAMMER_UNDO_ALIGN -
 969                                     ((u_int)scan_offset & HAMMER_UNDO_MASK)) {
 970                         printf("Illegal size field, skipping to "
 971                                "next boundary\n");
 972                         scan_offset = (scan_offset + HAMMER_UNDO_MASK) &
 973                                         ~HAMMER_UNDO_MASK64;
 974                 } else {
 975                         scan_offset += head->head.hdr_size;
 976                 }
 977         }
 978         rel_buffer(data_buffer);
 979 }