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_show.c,v 1.17 2008/09/30 23:13:08 dillon Exp $
39 #define FLAG_TOOFARLEFT 0x0001
40 #define FLAG_TOOFARRIGHT 0x0002
41 #define FLAG_BADTYPE 0x0004
42 #define FLAG_BADCHILDPARENT 0x0008
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);
57 hammer_cmd_show(hammer_off_t node_offset, int depth,
58 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
60 struct volume_info *volume;
62 if (node_offset == (hammer_off_t)-1) {
63 volume = get_volume(RootVolNo);
64 node_offset = volume->ondisk->vol0_btree_root;
66 printf("Volume header\trecords=%lld next_tid=%016llx\n",
67 volume->ondisk->vol0_stat_records,
68 volume->ondisk->vol0_next_tid);
72 printf("show %016llx depth %d\n", node_offset, depth);
73 print_btree_node(node_offset, depth, 0, left_bound, right_bound);
74 print_btree_node(node_offset, depth, 1, left_bound, right_bound);
78 print_btree_node(hammer_off_t node_offset, int depth, int spike,
79 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
81 struct buffer_info *buffer = NULL;
82 hammer_node_ondisk_t node;
83 hammer_btree_elm_t elm;
89 node = get_node(node_offset, &buffer);
91 if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) == node->crc)
97 printf("%c NODE %016llx cnt=%d p=%016llx "
100 node_offset, node->count, node->parent,
101 (node->type ? node->type : '?'), depth);
102 printf(" mirror %016llx", node->mirror_tid);
105 print_bigblock_fill(node_offset);
109 maxcount = (node->type == HAMMER_BTREE_TYPE_INTERNAL) ?
110 HAMMER_BTREE_INT_ELMS : HAMMER_BTREE_LEAF_ELMS;
112 for (i = 0; i < node->count && i < maxcount; ++i) {
113 elm = &node->elms[i];
114 flags = print_elm_flags(node, node_offset,
115 elm, elm->base.btype,
116 left_bound, right_bound);
117 print_btree_elm(elm, i, node->type, flags, "ELM");
119 if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
120 elm = &node->elms[i];
121 flags = print_elm_flags(node, node_offset,
123 left_bound, right_bound);
124 print_btree_elm(elm, i, node->type, flags, "RBN");
129 for (i = 0; i < node->count; ++i) {
130 elm = &node->elms[i];
133 case HAMMER_BTREE_TYPE_INTERNAL:
134 if (elm->internal.subtree_offset) {
135 print_btree_node(elm->internal.subtree_offset,
137 &elm[0].base, &elm[1].base);
149 print_btree_elm(hammer_btree_elm_t elm, int i, u_int8_t type,
150 int flags, const char *label)
152 char flagstr[8] = { 0, '-', '-', '-', '-', '-', '-', 0 };
154 flagstr[0] = flags ? 'B' : 'G';
155 if (flags & FLAG_TOOFARLEFT)
157 if (flags & FLAG_TOOFARRIGHT)
159 if (flags & FLAG_BADTYPE)
161 if (flags & FLAG_BADCHILDPARENT)
164 printf("%s\t%s %2d %c ",
166 (elm->base.btype ? elm->base.btype : '?'));
167 printf("obj=%016llx key=%016llx lo=%08x rt=%02x ot=%02x\n",
170 elm->base.localization,
173 printf("\t %c tids %016llx:%016llx ",
174 (elm->base.delete_tid ? 'd' : ' '),
175 elm->base.create_tid,
176 elm->base.delete_tid);
179 case HAMMER_BTREE_TYPE_INTERNAL:
180 printf("suboff=%016llx", elm->internal.subtree_offset);
182 printf(" mirror %016llx", elm->internal.mirror_tid);
184 case HAMMER_BTREE_TYPE_LEAF:
185 switch(elm->base.btype) {
186 case HAMMER_BTREE_TYPE_RECORD:
188 printf("dataoff=%016llx/%d",
189 elm->leaf.data_offset, elm->leaf.data_len);
191 printf(" crc=%04x", elm->leaf.data_crc);
192 printf("\n\t fills=");
193 print_bigblock_fill(elm->leaf.data_offset);
208 print_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
209 hammer_btree_elm_t elm, u_int8_t btype,
210 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
215 case HAMMER_BTREE_TYPE_INTERNAL:
216 if (elm->internal.subtree_offset) {
217 struct buffer_info *buffer = NULL;
218 hammer_node_ondisk_t subnode;
220 subnode = get_node(elm->internal.subtree_offset,
222 if (subnode->parent != node_offset)
223 flags |= FLAG_BADCHILDPARENT;
228 case HAMMER_BTREE_TYPE_INTERNAL:
229 if (left_bound == NULL || right_bound == NULL)
231 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
232 flags |= FLAG_TOOFARLEFT;
233 if (hammer_btree_cmp(&elm->base, right_bound) > 0)
234 flags |= FLAG_TOOFARRIGHT;
236 case HAMMER_BTREE_TYPE_LEAF:
237 if (left_bound == NULL || right_bound == NULL)
239 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
240 flags |= FLAG_TOOFARLEFT;
241 if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
242 flags |= FLAG_TOOFARRIGHT;
245 flags |= FLAG_BADTYPE;
249 case HAMMER_BTREE_TYPE_LEAF:
251 case HAMMER_BTREE_TYPE_RECORD:
252 if (left_bound == NULL || right_bound == NULL)
254 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
255 flags |= FLAG_TOOFARLEFT;
256 if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
257 flags |= FLAG_TOOFARRIGHT;
260 flags |= FLAG_BADTYPE;
265 flags |= FLAG_BADTYPE;
273 print_bigblock_fill(hammer_off_t offset)
275 struct hammer_blockmap_layer1 layer1;
276 struct hammer_blockmap_layer2 layer2;
279 blockmap_lookup(offset, &layer1, &layer2);
280 fill = layer2.bytes_free * 100 / HAMMER_LARGEBLOCK_SIZE;
283 printf("z%d:%lld=%d%%",
284 HAMMER_ZONE_DECODE(offset),
285 (offset & ~HAMMER_OFF_ZONE_MASK) / HAMMER_LARGEBLOCK_SIZE,
292 print_record(hammer_btree_elm_t elm)
294 struct buffer_info *data_buffer;
295 hammer_off_t data_offset;
297 hammer_data_ondisk_t data;
299 data_offset = elm->leaf.data_offset;
300 data_len = elm->leaf.data_len;
304 data = get_buffer_data(data_offset, &data_buffer, 0);
308 switch(elm->leaf.base.rec_type) {
309 case HAMMER_RECTYPE_INODE:
310 printf("\n%17s", "");
311 printf("size=%lld nlinks=%lld",
312 data->inode.size, data->inode.nlinks);
314 printf(" mode=%05o uflags=%08x\n",
318 printf("ctime=%016llx pobjid=%016llx obj_type=%d\n",
319 data->inode.ctime, data->inode.parent_obj_id,
320 data->inode.obj_type);
322 printf("mtime=%016llx", data->inode.mtime);
325 case HAMMER_RECTYPE_DIRENTRY:
326 printf("\n%17s", "");
327 data_len -= HAMMER_ENTRY_NAME_OFF;
328 printf("dir-entry ino=%016llx lo=%08x name=\"%*.*s\"",
330 data->entry.localization,
331 data_len, data_len, data->entry.name);
333 case HAMMER_RECTYPE_FIX:
334 switch(elm->leaf.base.key) {
335 case HAMMER_FIXKEY_SYMLINK:
336 data_len -= HAMMER_SYMLINK_NAME_OFF;
337 printf("\n%17s", "");
338 printf("symlink=\"%*.*s\"", data_len, data_len,
349 rel_buffer(data_buffer);