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.18 2008/10/09 04:20:59 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 const char *check_data_crc(hammer_btree_elm_t elm);
48 static void print_record(hammer_btree_elm_t elm);
49 static void print_btree_elm(hammer_btree_elm_t elm, int i, u_int8_t type,
50 int flags, const char *label);
51 static int print_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
52 hammer_btree_elm_t elm, u_int8_t btype,
53 hammer_base_elm_t left_bound,
54 hammer_base_elm_t right_bound);
55 static void print_bigblock_fill(hammer_off_t offset);
58 hammer_cmd_show(hammer_off_t node_offset, int depth,
59 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
61 struct volume_info *volume;
64 if (node_offset == (hammer_off_t)-1) {
65 volume = get_volume(RootVolNo);
66 node_offset = volume->ondisk->vol0_btree_root;
68 printf("Volume header\trecords=%lld next_tid=%016llx\n",
69 volume->ondisk->vol0_stat_records,
70 volume->ondisk->vol0_next_tid);
71 printf("\t\tbufoffset=%016llx\n",
72 volume->ondisk->vol_buf_beg);
73 for (zone = 0; zone < HAMMER_MAX_ZONES; ++zone) {
74 printf("\t\tzone %d\tnext_offset=%016llx\n",
76 volume->ondisk->vol0_blockmap[zone].next_offset
82 printf("show %016llx depth %d\n", node_offset, depth);
83 print_btree_node(node_offset, depth, 0, left_bound, right_bound);
84 print_btree_node(node_offset, depth, 1, left_bound, right_bound);
88 print_btree_node(hammer_off_t node_offset, int depth, int spike,
89 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
91 struct buffer_info *buffer = NULL;
92 hammer_node_ondisk_t node;
93 hammer_btree_elm_t elm;
99 node = get_node(node_offset, &buffer);
101 if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) == node->crc)
107 printf("%c NODE %016llx cnt=%02d p=%016llx "
110 node_offset, node->count, node->parent,
111 (node->type ? node->type : '?'), depth);
112 printf(" mirror %016llx", node->mirror_tid);
115 print_bigblock_fill(node_offset);
119 maxcount = (node->type == HAMMER_BTREE_TYPE_INTERNAL) ?
120 HAMMER_BTREE_INT_ELMS : HAMMER_BTREE_LEAF_ELMS;
122 for (i = 0; i < node->count && i < maxcount; ++i) {
123 elm = &node->elms[i];
124 flags = print_elm_flags(node, node_offset,
125 elm, elm->base.btype,
126 left_bound, right_bound);
127 print_btree_elm(elm, i, node->type, flags, "ELM");
129 if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
130 elm = &node->elms[i];
131 flags = print_elm_flags(node, node_offset,
133 left_bound, right_bound);
134 print_btree_elm(elm, i, node->type, flags, "RBN");
139 for (i = 0; i < node->count; ++i) {
140 elm = &node->elms[i];
143 case HAMMER_BTREE_TYPE_INTERNAL:
144 if (elm->internal.subtree_offset) {
145 print_btree_node(elm->internal.subtree_offset,
147 &elm[0].base, &elm[1].base);
159 print_btree_elm(hammer_btree_elm_t elm, int i, u_int8_t type,
160 int flags, const char *label)
162 char flagstr[8] = { 0, '-', '-', '-', '-', '-', '-', 0 };
164 flagstr[0] = flags ? 'B' : 'G';
165 if (flags & FLAG_TOOFARLEFT)
167 if (flags & FLAG_TOOFARRIGHT)
169 if (flags & FLAG_BADTYPE)
171 if (flags & FLAG_BADCHILDPARENT)
174 printf("%s\t%s %2d %c ",
176 (elm->base.btype ? elm->base.btype : '?'));
177 printf("obj=%016llx key=%016llx lo=%08x rt=%02x ot=%02x\n",
180 elm->base.localization,
183 printf("\t %c tids %016llx:%016llx ",
184 (elm->base.delete_tid ? 'd' : ' '),
185 elm->base.create_tid,
186 elm->base.delete_tid);
189 case HAMMER_BTREE_TYPE_INTERNAL:
190 printf("suboff=%016llx", elm->internal.subtree_offset);
192 printf(" mirror %016llx", elm->internal.mirror_tid);
194 case HAMMER_BTREE_TYPE_LEAF:
195 switch(elm->base.btype) {
196 case HAMMER_BTREE_TYPE_RECORD:
198 printf("\n%s\t ", check_data_crc(elm));
201 printf("dataoff=%016llx/%d",
202 elm->leaf.data_offset, elm->leaf.data_len);
204 printf(" crc=%04x", elm->leaf.data_crc);
205 printf("\n\t fills=");
206 print_bigblock_fill(elm->leaf.data_offset);
221 print_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
222 hammer_btree_elm_t elm, u_int8_t btype,
223 hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
228 case HAMMER_BTREE_TYPE_INTERNAL:
229 if (elm->internal.subtree_offset) {
230 struct buffer_info *buffer = NULL;
231 hammer_node_ondisk_t subnode;
233 subnode = get_node(elm->internal.subtree_offset,
235 if (subnode->parent != node_offset)
236 flags |= FLAG_BADCHILDPARENT;
241 case HAMMER_BTREE_TYPE_INTERNAL:
242 if (left_bound == NULL || right_bound == NULL)
244 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
245 flags |= FLAG_TOOFARLEFT;
246 if (hammer_btree_cmp(&elm->base, right_bound) > 0)
247 flags |= FLAG_TOOFARRIGHT;
249 case HAMMER_BTREE_TYPE_LEAF:
250 if (left_bound == NULL || right_bound == NULL)
252 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
253 flags |= FLAG_TOOFARLEFT;
254 if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
255 flags |= FLAG_TOOFARRIGHT;
258 flags |= FLAG_BADTYPE;
262 case HAMMER_BTREE_TYPE_LEAF:
264 case HAMMER_BTREE_TYPE_RECORD:
265 if (left_bound == NULL || right_bound == NULL)
267 if (hammer_btree_cmp(&elm->base, left_bound) < 0)
268 flags |= FLAG_TOOFARLEFT;
269 if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
270 flags |= FLAG_TOOFARRIGHT;
273 flags |= FLAG_BADTYPE;
278 flags |= FLAG_BADTYPE;
286 print_bigblock_fill(hammer_off_t offset)
288 struct hammer_blockmap_layer1 layer1;
289 struct hammer_blockmap_layer2 layer2;
292 blockmap_lookup(offset, &layer1, &layer2);
293 fill = layer2.bytes_free * 100 / HAMMER_LARGEBLOCK_SIZE;
296 printf("z%d:%lld=%d%%",
297 HAMMER_ZONE_DECODE(offset),
298 (offset & ~HAMMER_OFF_ZONE_MASK) / HAMMER_LARGEBLOCK_SIZE,
304 * Check the generic crc on a data element. Inodes record types are
305 * special in that some of their fields are not CRCed.
309 check_data_crc(hammer_btree_elm_t elm)
311 struct buffer_info *data_buffer;
312 hammer_off_t data_offset;
318 data_offset = elm->leaf.data_offset;
319 data_len = elm->leaf.data_len;
321 if (data_offset == 0 || data_len == 0)
326 ptr = get_buffer_data(data_offset, &data_buffer, 0);
327 len = HAMMER_BUFSIZE - ((int)data_offset & HAMMER_BUFMASK);
330 if (elm->leaf.base.rec_type == HAMMER_RECTYPE_INODE &&
331 data_len == sizeof(struct hammer_inode_data)) {
332 crc = crc32_ext(ptr, HAMMER_INODE_CRCSIZE, crc);
334 crc = crc32_ext(ptr, len, crc);
340 rel_buffer(data_buffer);
341 if (crc == elm->leaf.data_crc)
348 print_record(hammer_btree_elm_t elm)
350 struct buffer_info *data_buffer;
351 hammer_off_t data_offset;
353 hammer_data_ondisk_t data;
355 data_offset = elm->leaf.data_offset;
356 data_len = elm->leaf.data_len;
360 data = get_buffer_data(data_offset, &data_buffer, 0);
364 switch(elm->leaf.base.rec_type) {
365 case HAMMER_RECTYPE_INODE:
366 printf("\n%17s", "");
367 printf("size=%lld nlinks=%lld",
368 data->inode.size, data->inode.nlinks);
370 printf(" mode=%05o uflags=%08x\n",
374 printf("ctime=%016llx pobjid=%016llx obj_type=%d\n",
375 data->inode.ctime, data->inode.parent_obj_id,
376 data->inode.obj_type);
378 printf("mtime=%016llx", data->inode.mtime);
379 printf(" caps=%02x", data->inode.cap_flags);
382 case HAMMER_RECTYPE_DIRENTRY:
383 printf("\n%17s", "");
384 data_len -= HAMMER_ENTRY_NAME_OFF;
385 printf("dir-entry ino=%016llx lo=%08x name=\"%*.*s\"",
387 data->entry.localization,
388 data_len, data_len, data->entry.name);
390 case HAMMER_RECTYPE_FIX:
391 switch(elm->leaf.base.key) {
392 case HAMMER_FIXKEY_SYMLINK:
393 data_len -= HAMMER_SYMLINK_NAME_OFF;
394 printf("\n%17s", "");
395 printf("symlink=\"%*.*s\"", data_len, data_len,
406 rel_buffer(data_buffer);