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  * $DragonFly: src/sbin/hammer/cmd_show.c,v 1.9 2008/05/12 21:17:16 dillon Exp $
  35  */
  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
  44 static void print_btree_node(hammer_off_t node_offset, int depth, int spike,
  45                         hammer_base_elm_t left_bound,
  46                         hammer_base_elm_t right_bound);
  47 static void print_record(hammer_btree_elm_t elm);
  48 static void print_btree_elm(hammer_btree_elm_t elm, int i, u_int8_t type,
  49                         int flags, const char *label);
  50 static int print_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
  51                         hammer_btree_elm_t elm, u_int8_t btype,
  52                         hammer_base_elm_t left_bound,
  53                         hammer_base_elm_t right_bound);
  54 static void print_bigblock_fill(hammer_off_t offset);
  55
  56 void
  57 hammer_cmd_show(hammer_off_t node_offset, int depth,
  58                 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
  59 {
  60         struct volume_info *volume;
  61
  62         if (node_offset == (hammer_off_t)-1) {
  63                 volume = get_volume(RootVolNo);
  64                 node_offset = volume->ondisk->vol0_btree_root;
  65                 if (VerboseOpt) {
  66                         printf("\trecords=%lld\n",
  67                                volume->ondisk->vol0_stat_records);
  68                 }
  69                 rel_volume(volume);
  70         }
  71         printf("show %016llx depth %d\n", node_offset, depth);
  72         print_btree_node(node_offset, depth, 0, left_bound, right_bound);
  73         print_btree_node(node_offset, depth, 1, left_bound, right_bound);
  74 }
  75
  76 static void
  77 print_btree_node(hammer_off_t node_offset, int depth, int spike,
  78                  hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
  79 {
  80         struct buffer_info *buffer = NULL;
  81         hammer_node_ondisk_t node;
  82         hammer_btree_elm_t elm;
  83         int i;
  84         int flags;
  85
  86         node = get_node(node_offset, &buffer);
  87
  88         if (spike == 0) {
  89                 printf("    NODE %016llx count=%d parent=%016llx "
  90                        "type=%c depth=%d fill=",
  91                        node_offset, node->count, node->parent,
  92                        (node->type ? node->type : '?'), depth);
  93                 if (VerboseOpt)
  94                         print_bigblock_fill(node_offset);
  95                 printf(" {\n");
  96
  97                 for (i = 0; i < node->count; ++i) {
  98                         elm = &node->elms[i];
  99                         flags = print_elm_flags(node, node_offset,
 100                                                 elm, elm->base.btype,
 101                                                 left_bound, right_bound);
 102                         print_btree_elm(elm, i, node->type, flags, "ELM");
 103                 }
 104                 if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
 105                         elm = &node->elms[i];
 106                         flags = print_elm_flags(node, node_offset,
 107                                                 elm, 'I',
 108                                                 left_bound, right_bound);
 109                         print_btree_elm(elm, i, node->type, flags, "RBN");
 110                 }
 111                 printf("    }\n");
 112         }
 113
 114         for (i = 0; i < node->count; ++i) {
 115                 elm = &node->elms[i];
 116
 117                 switch(node->type) {
 118                 case HAMMER_BTREE_TYPE_INTERNAL:
 119                         if (elm->internal.subtree_offset) {
 120                                 print_btree_node(elm->internal.subtree_offset,
 121                                                  depth + 1, spike,
 122                                                  &elm[0].base, &elm[1].base);
 123                         }
 124                         break;
 125                 default:
 126                         break;
 127                 }
 128         }
 129         rel_buffer(buffer);
 130 }
 131
 132 static
 133 void
 134 print_btree_elm(hammer_btree_elm_t elm, int i, u_int8_t type,
 135                 int flags, const char *label)
 136 {
 137         char flagstr[8] = { 0, '-', '-', '-', '-', '-', '-', 0 };
 138
 139         flagstr[0] = flags ? 'B' : 'G';
 140         if (flags & FLAG_TOOFARLEFT)
 141                 flagstr[2] = 'L';
 142         if (flags & FLAG_TOOFARRIGHT)
 143                 flagstr[3] = 'R';
 144         if (flags & FLAG_BADTYPE)
 145                 flagstr[4] = 'T';
 146         if (flags & FLAG_BADCHILDPARENT)
 147                 flagstr[4] = 'C';
 148
 149         printf("%s\t%s %2d %c ",
 150                flagstr, label, i,
 151                (elm->base.btype ? elm->base.btype : '?'));
 152         printf("obj=%016llx key=%016llx rt=%02x ot=%02x\n",
 153                elm->base.obj_id,
 154                elm->base.key,
 155                elm->base.rec_type,
 156                elm->base.obj_type);
 157         printf("\t       %c tids %016llx:%016llx ",
 158                 (elm->base.delete_tid ? 'd' : ' '),
 159                elm->base.create_tid,
 160                elm->base.delete_tid);
 161
 162         switch(type) {
 163         case HAMMER_BTREE_TYPE_INTERNAL:
 164                 printf("suboff=%016llx", elm->internal.subtree_offset);
 165                 break;
 166         case HAMMER_BTREE_TYPE_LEAF:
 167                 switch(elm->base.btype) {
 168                 case HAMMER_BTREE_TYPE_RECORD:
 169                         printf("\n\t         ");
 170                         printf(" dataoff=%016llx/%d",
 171                                 elm->leaf.data_offset, elm->leaf.data_len);
 172                         if (VerboseOpt) {
 173                                 printf("\n\t         fills=");
 174                                 print_bigblock_fill(elm->leaf.data_offset);
 175                         }
 176                         if (VerboseOpt > 1)
 177                                 print_record(elm);
 178                         break;
 179                 }
 180                 break;
 181         default:
 182                 break;
 183         }
 184         printf("\n");
 185 }
 186
 187 static
 188 int
 189 print_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
 190                 hammer_btree_elm_t elm, u_int8_t btype,
 191                 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
 192 {
 193         int flags = 0;
 194
 195         switch(node->type) {
 196         case HAMMER_BTREE_TYPE_INTERNAL:
 197                 if (elm->internal.subtree_offset) {
 198                         struct buffer_info *buffer = NULL;
 199                         hammer_node_ondisk_t subnode;
 200
 201                         subnode = get_node(elm->internal.subtree_offset,
 202                                            &buffer);
 203                         if (subnode->parent != node_offset)
 204                                 flags |= FLAG_BADCHILDPARENT;
 205                         rel_buffer(buffer);
 206                 }
 207
 208                 switch(btype) {
 209                 case HAMMER_BTREE_TYPE_INTERNAL:
 210                         if (left_bound == NULL || right_bound == NULL)
 211                                 break;
 212                         if (hammer_btree_cmp(&elm->base, left_bound) < 0)
 213                                 flags |= FLAG_TOOFARLEFT;
 214                         if (hammer_btree_cmp(&elm->base, right_bound) > 0)
 215                                 flags |= FLAG_TOOFARRIGHT;
 216                         break;
 217                 case HAMMER_BTREE_TYPE_LEAF:
 218                         if (left_bound == NULL || right_bound == NULL)
 219                                 break;
 220                         if (hammer_btree_cmp(&elm->base, left_bound) < 0)
 221                                 flags |= FLAG_TOOFARLEFT;
 222                         if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
 223                                 flags |= FLAG_TOOFARRIGHT;
 224                         break;
 225                 default:
 226                         flags |= FLAG_BADTYPE;
 227                         break;
 228                 }
 229                 break;
 230         case HAMMER_BTREE_TYPE_LEAF:
 231                 switch(btype) {
 232                 case HAMMER_BTREE_TYPE_RECORD:
 233                         if (left_bound == NULL || right_bound == NULL)
 234                                 break;
 235                         if (hammer_btree_cmp(&elm->base, left_bound) < 0)
 236                                 flags |= FLAG_TOOFARLEFT;
 237                         if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
 238                                 flags |= FLAG_TOOFARRIGHT;
 239                         break;
 240                 default:
 241                         flags |= FLAG_BADTYPE;
 242                         break;
 243                 }
 244                 break;
 245         default:
 246                 flags |= FLAG_BADTYPE;
 247                 break;
 248         }
 249         return(flags);
 250 }
 251
 252 static
 253 void
 254 print_bigblock_fill(hammer_off_t offset)
 255 {
 256         struct hammer_blockmap_layer1 layer1;
 257         struct hammer_blockmap_layer2 layer2;
 258         int fill;
 259
 260         blockmap_lookup(offset, &layer1, &layer2);
 261         fill = layer2.bytes_free * 100 / HAMMER_LARGEBLOCK_SIZE;
 262         fill = 100 - fill;
 263
 264         printf("z%d:%lld=%d%%",
 265                 HAMMER_ZONE_DECODE(offset),
 266                 (offset & ~HAMMER_OFF_ZONE_MASK) / HAMMER_LARGEBLOCK_SIZE,
 267                 fill
 268         );
 269 }
 270
 271 static
 272 void
 273 print_record(hammer_btree_elm_t elm)
 274 {
 275         struct buffer_info *data_buffer;
 276         hammer_off_t data_offset;
 277         int32_t data_len;
 278         hammer_data_ondisk_t data;
 279
 280         data_offset = elm->leaf.data_offset;
 281         data_len = elm->leaf.data_len;
 282         data_buffer = NULL;
 283
 284         if (data_offset)
 285                 data = get_buffer_data(data_offset, &data_buffer, 0);
 286         else
 287                 data = NULL;
 288
 289         switch(elm->leaf.base.rec_type) {
 290         case HAMMER_RECTYPE_INODE:
 291                 printf("\n%17s", "");
 292                 printf("size=%lld nlinks=%lld",
 293                        data->inode.size, data->inode.nlinks);
 294                 break;
 295         case HAMMER_RECTYPE_DIRENTRY:
 296                 printf("\n%17s", "");
 297                 printf("dir-entry ino=%016llx name=\"%*.*s\"",
 298                        data->entry.obj_id,
 299                        data_len, data_len, data->entry.name);
 300                 break;
 301         case HAMMER_RECTYPE_FIX:
 302                 switch(elm->leaf.base.key) {
 303                 case HAMMER_FIXKEY_SYMLINK:
 304                         printf("\n%17s", "");
 305                         printf("symlink=\"%*.*s\"", data_len, data_len,
 306                                 data->symlink.name);
 307                         break;
 308                 default:
 309                         break;
 310                 }
 311                 break;
 312         default:
 313                 break;
 314         }
 315         if (data_buffer)
 316                 rel_buffer(data_buffer);
 317 }
 318