/*
 * Copyright (c) 2008 The DragonFly Project.  All rights reserved.
 *
 * This code is derived from software contributed to The DragonFly Project
 * by Matthew Dillon <dillon@backplane.com>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 3. Neither the name of The DragonFly Project nor the names of its
 *    contributors may be used to endorse or promote products derived
 *    from this software without specific, prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <libutil.h>

#include "hammer.h"

#define FLAG_TOOFARLEFT		0x0001
#define FLAG_TOOFARRIGHT	0x0002
#define FLAG_BADTYPE		0x0004
#define FLAG_BADCHILDPARENT	0x0008
#define FLAG_BADMIRRORTID	0x0010

typedef struct btree_search {
	struct hammer_base_elm base;
	int		limit;   /* # of fields to test */
	int		filter;  /* filter type (default -1) */
} *btree_search_t;

static void print_btree_node(hammer_off_t node_offset, btree_search_t search,
			int depth, hammer_tid_t mirror_tid,
			hammer_base_elm_t left_bound,
			hammer_base_elm_t right_bound,
			struct zone_stat *stats);
static const char *check_data_crc(hammer_btree_elm_t elm);
static void print_record(hammer_btree_elm_t elm);
static void print_btree_elm(hammer_node_ondisk_t node, hammer_off_t node_offset,
			hammer_btree_elm_t elm,
			hammer_base_elm_t left_bound,
			hammer_base_elm_t right_bound,
			const char *ext, struct zone_stat *stats);
static int get_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
			hammer_btree_elm_t elm,
			hammer_base_elm_t left_bound,
			hammer_base_elm_t right_bound);
static int test_lr(hammer_btree_elm_t elm,
			hammer_base_elm_t left_bound,
			hammer_base_elm_t right_bound);
static int test_rbn_lr(hammer_btree_elm_t elm,
			hammer_base_elm_t left_bound,
			hammer_base_elm_t right_bound);
static void print_bigblock_fill(hammer_off_t offset);
static int init_btree_search(const char *arg, int filter,
			btree_search_t search);
static int test_btree_search(hammer_btree_elm_t elm, btree_search_t search);
static int test_btree_match(hammer_btree_elm_t elm, btree_search_t search);
static int test_btree_out_of_range(hammer_btree_elm_t elm, btree_search_t search);

static int num_bad_node = 0;
static int num_bad_elm = 0;
static int do_obfuscate = 0;

void
hammer_cmd_show(hammer_off_t node_offset, const char *arg,
		int filter, int obfuscate, int depth,
		hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
{
	struct volume_info *volume;
	struct btree_search search;
	struct zone_stat *stats = NULL;
	int zone;

	AssertOnFailure = (DebugOpt != 0);

	if (VerboseOpt)
		stats = hammer_init_zone_stat_bits();

	if (node_offset == HAMMER_OFF_BAD) {
		volume = get_volume(RootVolNo);
		node_offset = volume->ondisk->vol0_btree_root;
		if (QuietOpt < 3) {
			printf("Volume header\trecords=%jd next_tid=%016jx\n",
			       (intmax_t)volume->ondisk->vol0_stat_records,
			       (uintmax_t)volume->ondisk->vol0_next_tid);
			printf("\t\tbufoffset=%016jx\n",
			       (uintmax_t)volume->ondisk->vol_buf_beg);
			for (zone = 0; zone < HAMMER_MAX_ZONES; ++zone) {
				printf("\t\tzone %d\tnext_offset=%016jx\n",
					zone,
					(uintmax_t)volume->ondisk->vol0_blockmap[zone].next_offset
				);
			}
		}
		rel_volume(volume);
	}

	printf("show %016jx", (uintmax_t)node_offset);

	do_obfuscate = obfuscate;
	init_btree_search(arg, filter, &search);
	if (arg) {
		if (search.limit >= 1)
			printf(" lo %08x", search.base.localization);
		if (search.limit >= 2)
			printf(" obj_id %016jx", (uintmax_t)search.base.obj_id);
		if (search.limit >= 3)
			printf(" rec_type %02x", search.base.rec_type);
		if (search.limit >= 4)
			printf(" key %016jx", (uintmax_t)search.base.key);
		if (search.limit == 5)
			printf(" create_tid %016jx\n",
				(uintmax_t)search.base.create_tid);
	}
	printf(" depth %d\n", depth);
	print_btree_node(node_offset, &search, depth, HAMMER_MAX_TID,
			 left_bound, right_bound, stats);

	AssertOnFailure = 1;

	if (VerboseOpt) {
		hammer_print_zone_stat(stats);
		hammer_cleanup_zone_stat(stats);
	}

	if (num_bad_node || VerboseOpt) {
		printf("%d bad nodes\n", num_bad_node);
	}
	if (num_bad_elm || VerboseOpt) {
		printf("%d bad elms\n", num_bad_elm);
	}
}

static void
print_btree_node(hammer_off_t node_offset, btree_search_t search,
		int depth, hammer_tid_t mirror_tid,
		hammer_base_elm_t left_bound, hammer_base_elm_t right_bound,
		struct zone_stat *stats)
{
	struct buffer_info *buffer = NULL;
	hammer_node_ondisk_t node;
	hammer_btree_elm_t elm;
	int i;
	int maxcount;
	char badc = ' ';  /* good */
	char badm = ' ';  /* good */
	const char *ext;

	node = get_node(node_offset, &buffer);

	if (node == NULL) {
		badc = 'B';
		badm = 'I';
	} else {
		if (crc32(&node->crc + 1, HAMMER_BTREE_CRCSIZE) != node->crc)
			badc = 'B';
		if (node->mirror_tid > mirror_tid) {
			badc = 'B';
			badm = 'M';
		}
		maxcount = hammer_node_max_elements(node->type);
		if (maxcount == -1) {
			badc = 'B';
			badm = 'U';
		} else if (node->count == 0 || node->count > maxcount) {
			badc = 'B';
			badm = 'C';
		}
	}

	if (badm != ' ' || badc != ' ')  /* not good */
		++num_bad_node;

	printf("%c%c   NODE %016jx ", badc, badm, (uintmax_t)node_offset);
	if (node == NULL) {
		printf("(IO ERROR)\n");
		rel_buffer(buffer);
		return;
	}

	printf("cnt=%02d p=%016jx type=%c depth=%d mirror=%016jx",
	       node->count,
	       (uintmax_t)node->parent,
	       (node->type ? node->type : '?'),
	       depth,
	       (uintmax_t)node->mirror_tid);
	if (QuietOpt < 3) {
		printf(" fill=");
		print_bigblock_fill(node_offset);
	}
	printf(" {\n");

	if (VerboseOpt)
		hammer_add_zone_stat(stats, node_offset, sizeof(*node));

	for (i = 0; i < node->count; ++i) {
		elm = &node->elms[i];
		ext = NULL;

		if (search->limit) {
			switch (node->type) {
			case HAMMER_BTREE_TYPE_INTERNAL:
				if (!test_btree_out_of_range(elm, search))
					ext = "*";
				break;
			case HAMMER_BTREE_TYPE_LEAF:
				if (test_btree_match(elm, search))
					ext = "*";
				break;
			}
		}
		print_btree_elm(node, node_offset,
				elm, left_bound, right_bound,
				ext, stats);
	}
	if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
		assert(i == node->count);  /* boundary */
		elm = &node->elms[i];
		print_btree_elm(node, node_offset,
				elm, left_bound, right_bound,
				NULL, stats);
	}
	printf("     }\n");

	if (node->type == HAMMER_BTREE_TYPE_INTERNAL) {
		for (i = 0; i < node->count; ++i) {
			elm = &node->elms[i];
			if (search->limit && search->filter) {
				if (test_btree_out_of_range(elm, search))
					continue;
			}
			if (elm->internal.subtree_offset) {
				print_btree_node(elm->internal.subtree_offset,
						 search, depth + 1,
						 elm->internal.mirror_tid,
						 &elm[0].base, &elm[1].base,
						 stats);
				/*
				 * Cause show to do normal iteration after
				 * seeking to the lo:objid:rectype:key:tid
				 * by default
				 */
				if (search->limit && search->filter == -1)  /* default */
					search->filter = 0;
			}
		}
	}
	rel_buffer(buffer);
}

static __inline
int
is_root_btree_beg(uint8_t type, int i, hammer_btree_elm_t elm)
{
	/*
	 * elm->base.btype depends on what the original node had
	 * so it could be anything but HAMMER_BTREE_TYPE_NONE.
	 */
	return (type == HAMMER_BTREE_TYPE_INTERNAL &&
		i == 0 &&
		elm->base.localization == 0 &&
		elm->base.obj_id == (int64_t)-0x8000000000000000LL &&
		elm->base.key == (int64_t)-0x8000000000000000LL &&
		elm->base.create_tid == 1 &&
		elm->base.delete_tid == 1 &&
		elm->base.rec_type == 0 &&
		elm->base.obj_type == 0 &&
		elm->base.btype != HAMMER_BTREE_TYPE_NONE);
}

static __inline
int
is_root_btree_end(uint8_t type, int i, hammer_btree_elm_t elm)
{
	return (type == HAMMER_BTREE_TYPE_INTERNAL &&
		i != 0 &&
		elm->base.localization == 0xFFFFFFFFU &&
		elm->base.obj_id == 0x7FFFFFFFFFFFFFFFLL &&
		elm->base.key == 0x7FFFFFFFFFFFFFFFLL &&
		elm->base.create_tid == 0xFFFFFFFFFFFFFFFFULL &&
		elm->base.delete_tid == 0 &&
		elm->base.rec_type == 0xFFFFU &&
		elm->base.obj_type == 0 &&
		elm->base.btype == HAMMER_BTREE_TYPE_NONE);
}

static
void
print_btree_elm(hammer_node_ondisk_t node, hammer_off_t node_offset,
		hammer_btree_elm_t elm,
		hammer_base_elm_t left_bound,
		hammer_base_elm_t right_bound,
		const char *ext, struct zone_stat *stats)
{
	char flagstr[8] = { 0, '-', '-', '-', '-', '-', '-', 0 };
	char deleted;
	char rootelm;
	const char *label;
	int flags;
	int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1;

	flags = get_elm_flags(node, node_offset, elm, left_bound, right_bound);
	flagstr[0] = flags ? 'B' : 'G';
	if (flags & FLAG_TOOFARLEFT)
		flagstr[2] = 'L';
	if (flags & FLAG_TOOFARRIGHT)
		flagstr[3] = 'R';
	if (flags & FLAG_BADTYPE)
		flagstr[4] = 'T';
	if (flags & FLAG_BADCHILDPARENT)
		flagstr[5] = 'C';
	if (flags & FLAG_BADMIRRORTID)
		flagstr[6] = 'M';
	if (flagstr[0] == 'B')
		++num_bad_elm;

	/*
	 * Check if elm is derived from root split
	 */
	if (is_root_btree_beg(node->type, i, elm))
		rootelm = '>';
	else if (is_root_btree_end(node->type, i, elm))
		rootelm = '<';
	else
		rootelm = ' ';

	if (elm->base.delete_tid)
		deleted = 'd';
	else
		deleted = ' ';

	if (node->type == HAMMER_BTREE_TYPE_INTERNAL && node->count == i)
		label = "RBN";
	else
		label = "ELM";

	printf("%s\t%s %2d %c ", flagstr, label, i, hammer_elm_btype(elm));
	printf("lo=%08x obj=%016jx rt=%02x key=%016jx tid=%016jx\n",
	       elm->base.localization,
	       (uintmax_t)elm->base.obj_id,
	       elm->base.rec_type,
	       (uintmax_t)elm->base.key,
	       (uintmax_t)elm->base.create_tid);
	printf("\t       %c del=%016jx ot=%02x",
	       (rootelm == ' ' ? deleted : rootelm),
	       (uintmax_t)elm->base.delete_tid,
	       elm->base.obj_type);

	switch(node->type) {
	case HAMMER_BTREE_TYPE_INTERNAL:
		printf(" suboff=%016jx",
		       (uintmax_t)elm->internal.subtree_offset);
		if (QuietOpt < 3) {
			printf(" mirror=%016jx",
			       (uintmax_t)elm->internal.mirror_tid);
		}
		if (ext)
			printf(" %s", ext);
		break;
	case HAMMER_BTREE_TYPE_LEAF:
		switch(elm->base.btype) {
		case HAMMER_BTREE_TYPE_RECORD:
			printf(" dataoff=%016jx/%d",
			       (uintmax_t)elm->leaf.data_offset,
			       elm->leaf.data_len);
			if (QuietOpt < 3) {
				const char *p = check_data_crc(elm);
				printf(" crc=%08x", elm->leaf.data_crc);
				if (p)
					printf(" %s", p);
				printf(" fill=");
				print_bigblock_fill(elm->leaf.data_offset);
			}
			if (QuietOpt < 2)
				print_record(elm);
			if (VerboseOpt)
				hammer_add_zone_stat(stats,
					elm->leaf.data_offset,
					elm->leaf.data_len);
			break;
		default:
			printf("\n\t         ");
			printf("badtype=%d", elm->base.btype);
			break;
		}
		if (ext)
			printf(" %s", ext);
		break;
	}
	printf("\n");
}

static
int
get_elm_flags(hammer_node_ondisk_t node, hammer_off_t node_offset,
		hammer_btree_elm_t elm,
		hammer_base_elm_t left_bound,
		hammer_base_elm_t right_bound)
{
	hammer_off_t child_offset;
	int flags = 0;
	int i = ((char*)elm - (char*)node) / (int)sizeof(*elm) - 1;

	switch(node->type) {
	case HAMMER_BTREE_TYPE_INTERNAL:
		child_offset = elm->internal.subtree_offset;
		if (elm->internal.mirror_tid > node->mirror_tid)
			flags |= FLAG_BADMIRRORTID;

		if (i == node->count) {
			if (child_offset != 0)
				flags |= FLAG_BADCHILDPARENT;
			switch(elm->base.btype) {
			case HAMMER_BTREE_TYPE_NONE:
				flags |= test_rbn_lr(elm, left_bound, right_bound);
				break;
			default:
				flags |= FLAG_BADTYPE;
				break;
			}
		} else {
			if (child_offset == 0) {
				flags |= FLAG_BADCHILDPARENT;
			} else {
				struct buffer_info *buffer = NULL;
				hammer_node_ondisk_t subnode;
				subnode = get_node(child_offset, &buffer);
				if (subnode == NULL)
					flags |= FLAG_BADCHILDPARENT;
				else if (subnode->parent != node_offset)
					flags |= FLAG_BADCHILDPARENT;
				rel_buffer(buffer);
			}
			switch(elm->base.btype) {
			case HAMMER_BTREE_TYPE_INTERNAL:
			case HAMMER_BTREE_TYPE_LEAF:
				flags |= test_lr(elm, left_bound, right_bound);
				break;
			default:
				flags |= FLAG_BADTYPE;
				break;
			}
		}
		break;
	case HAMMER_BTREE_TYPE_LEAF:
		if (elm->leaf.data_offset == 0) {
			flags |= FLAG_BADCHILDPARENT;
		}
		if (elm->leaf.data_len == 0) {
			flags |= FLAG_BADCHILDPARENT;
		}

		if (node->mirror_tid == 0 &&
		    !(node->parent == 0 && node->count == 2)) {
			flags |= FLAG_BADMIRRORTID;
		}
		if (elm->base.create_tid && node->mirror_tid &&
		    elm->base.create_tid > node->mirror_tid) {
			flags |= FLAG_BADMIRRORTID;
		}
		if (elm->base.delete_tid && node->mirror_tid &&
		    elm->base.delete_tid > node->mirror_tid) {
			flags |= FLAG_BADMIRRORTID;
		}
		switch(elm->base.btype) {
		case HAMMER_BTREE_TYPE_RECORD:
			flags |= test_lr(elm, left_bound, right_bound);
			break;
		default:
			flags |= FLAG_BADTYPE;
			break;
		}
		break;
	default:
		flags |= FLAG_BADTYPE;
		break;
	}
	return(flags);
}

static
int
test_lr(hammer_btree_elm_t elm,
	hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
{
	if (left_bound == NULL || right_bound == NULL)
		return(0);
	if (hammer_btree_cmp(&elm->base, left_bound) < 0)
		return(FLAG_TOOFARLEFT);
	if (hammer_btree_cmp(&elm->base, right_bound) >= 0)
		return(FLAG_TOOFARRIGHT);
	return(0);
}

static
int
test_rbn_lr(hammer_btree_elm_t rbn,
	hammer_base_elm_t left_bound, hammer_base_elm_t right_bound)
{
	if (left_bound == NULL || right_bound == NULL)
		return(0);
	if (hammer_btree_cmp(&rbn->base, left_bound) < 0)
		return(FLAG_TOOFARLEFT);
	if (hammer_btree_cmp(&rbn->base, right_bound) > 0)
		return(FLAG_TOOFARRIGHT);
	return(0);
}

static
void
print_bigblock_fill(hammer_off_t offset)
{
	struct hammer_blockmap_layer1 layer1;
	struct hammer_blockmap_layer2 layer2;
	int fill;
	int error;

	blockmap_lookup(offset, &layer1, &layer2, &error);
	printf("z%d:v%d:%d:%d:%lu=",
		HAMMER_ZONE_DECODE(offset),
		HAMMER_VOL_DECODE(offset),
		HAMMER_BLOCKMAP_LAYER1_INDEX(offset),
		HAMMER_BLOCKMAP_LAYER2_INDEX(offset),
		offset & HAMMER_BIGBLOCK_MASK64);

	if (error) {
		printf("B%d", error);
	} else {
		fill = layer2.bytes_free * 100 / HAMMER_BIGBLOCK_SIZE;
		fill = 100 - fill;
		printf("%d%%", fill);
	}
}

/*
 * Check the generic crc on a data element.  Inodes record types are
 * special in that some of their fields are not CRCed.
 *
 * Also check that the zone is valid.
 */
static
const char *
check_data_crc(hammer_btree_elm_t elm)
{
	struct buffer_info *data_buffer;
	hammer_off_t data_offset;
	int32_t data_len;
	int32_t len;
	uint32_t crc;
	int error;
	char *ptr;

	data_offset = elm->leaf.data_offset;
	data_len = elm->leaf.data_len;
	data_buffer = NULL;
	if (data_offset == 0 || data_len == 0)
		return("Z");

	crc = 0;
	error = 0;
	while (data_len) {
		blockmap_lookup(data_offset, NULL, NULL, &error);
		if (error)
			break;

		ptr = get_buffer_data(data_offset, &data_buffer, 0);
		len = HAMMER_BUFSIZE - ((int)data_offset & HAMMER_BUFMASK);
		if (len > data_len)
			len = (int)data_len;
		if (elm->leaf.base.rec_type == HAMMER_RECTYPE_INODE &&
		    data_len == sizeof(struct hammer_inode_data)) {
			crc = crc32_ext(ptr, HAMMER_INODE_CRCSIZE, crc);
		} else {
			crc = crc32_ext(ptr, len, crc);
		}
		data_len -= len;
		data_offset += len;
	}
	rel_buffer(data_buffer);
	if (error) {
		switch (error) {	/* bad offset */
		case -1:
			return("BO-ZL");
		case -2:
			return("BO-ZG");
		case -3:
			return("BO-RV");
		case -4:
			return("BO-AO");
		case -5:
			return("BO-DE");
		case -6:
			return("BO-L1");
		case -7:
			return("BO-LU");
		case -8:
			return("BO-L2");
		case -9:
			return("BO-LZ");
		default:
			return("BO-??");
		}
	}
	if (crc == elm->leaf.data_crc)
		return(NULL);
	return("BX");			/* bad crc */
}

static
void
print_config(char *cfgtxt)
{
	char *token;

	printf("\n%17s", "");
	printf("config stext=\"\n");
	if (cfgtxt != NULL) {
		while((token = strsep(&cfgtxt, "\r\n")) != NULL)
			printf("%17s  %s\n", "", token);
	}
	printf("%17s\"", "");
}

static
void
print_record(hammer_btree_elm_t elm)
{
	struct buffer_info *data_buffer;
	hammer_off_t data_offset;
	int32_t data_len;
	hammer_data_ondisk_t data;
	uint32_t status;
	char *str1 = NULL;
	char *str2 = NULL;

	data_offset = elm->leaf.data_offset;
	data_len = elm->leaf.data_len;
	assert(data_offset != 0);
	assert(data_len != 0);

	data_buffer = NULL;
	data = get_buffer_data(data_offset, &data_buffer, 0);
	assert(data != NULL);

	switch(elm->leaf.base.rec_type) {
	case HAMMER_RECTYPE_UNKNOWN:
		printf("\n%17s", "");
		printf("unknown");
		break;
	case HAMMER_RECTYPE_INODE:
		printf("\n%17s", "");
		printf("inode size=%jd nlinks=%jd",
		       (intmax_t)data->inode.size,
		       (intmax_t)data->inode.nlinks);
		if (QuietOpt < 1) {
			printf(" mode=%05o uflags=%08x caps=%02x",
				data->inode.mode,
				data->inode.uflags,
				data->inode.cap_flags);
			printf(" pobjid=%016jx ot=%02x\n",
				(uintmax_t)data->inode.parent_obj_id,
				data->inode.obj_type);
			printf("%17s", "");
			printf("      ctime=%016jx mtime=%016jx atime=%016jx",
				(uintmax_t)data->inode.ctime,
				(uintmax_t)data->inode.mtime,
				(uintmax_t)data->inode.atime);
			if (data->inode.ext.symlink[0])
				printf(" symlink=\"%s\"",
					data->inode.ext.symlink);
		}
		break;
	case HAMMER_RECTYPE_DIRENTRY:
		data_len -= HAMMER_ENTRY_NAME_OFF;
		printf("\n%17s", "");
		printf("dir-entry ino=%016jx lo=%08x",
		       (uintmax_t)data->entry.obj_id,
		       data->entry.localization);
		if (!do_obfuscate)
			printf(" name=\"%*.*s\"",
			       data_len, data_len, data->entry.name);
		break;
	case HAMMER_RECTYPE_FIX:
		switch(elm->leaf.base.key) {
		case HAMMER_FIXKEY_SYMLINK:
			data_len -= HAMMER_SYMLINK_NAME_OFF;
			printf("\n%17s", "");
			printf("fix-symlink name=\"%*.*s\"",
				data_len, data_len, data->symlink.name);
			break;
		}
		break;
	case HAMMER_RECTYPE_PFS:
		printf("\n%17s", "");
		printf("pfs sync_beg_tid=%016jx sync_end_tid=%016jx\n",
			(intmax_t)data->pfsd.sync_beg_tid,
			(intmax_t)data->pfsd.sync_end_tid);
		uuid_to_string(&data->pfsd.shared_uuid, &str1, &status);
		uuid_to_string(&data->pfsd.unique_uuid, &str2, &status);
		printf("%17s", "");
		printf("    shared_uuid=%s\n", str1);
		printf("%17s", "");
		printf("    unique_uuid=%s\n", str2);
		printf("%17s", "");
		printf("    mirror_flags=%08x label=\"%s\"",
			data->pfsd.mirror_flags, data->pfsd.label);
		if (data->pfsd.snapshots[0])
			printf(" snapshots=\"%s\"", data->pfsd.snapshots);
		free(str1);
		free(str2);
		break;
	case HAMMER_RECTYPE_SNAPSHOT:
		printf("\n%17s", "");
		printf("snapshot tid=%016jx label=\"%s\"",
			(intmax_t)data->snap.tid, data->snap.label);
		break;
	case HAMMER_RECTYPE_CONFIG:
		if (VerboseOpt > 2) {
			char *p = strdup(data->config.text);
			print_config(p);
			free(p);
		}
		break;
	case HAMMER_RECTYPE_DATA:
		if (VerboseOpt > 3) {
			printf("\n");
			hexdump(data, data_len, "\t\t  ", 0);
		}
		break;
	case HAMMER_RECTYPE_EXT:
	case HAMMER_RECTYPE_DB:
		if (VerboseOpt > 2) {
			printf("\n");
			hexdump(data, data_len, "\t\t  ", 0);
		}
		break;
	default:
		assert(0);
		break;
	}
	rel_buffer(data_buffer);
}

static __inline
unsigned long
_strtoul(const char *p, int base)
{
	unsigned long retval;

	errno = 0;  /* clear */
	retval = strtoul(p, NULL, base);
	if (errno == ERANGE && retval == ULONG_MAX)
		err(1, "strtoul");
	return retval;
}

static __inline
unsigned long long
_strtoull(const char *p, int base)
{
	unsigned long long retval;

	errno = 0;  /* clear */
	retval = strtoull(p, NULL, base);
	if (errno == ERANGE && retval == ULLONG_MAX)
		err(1, "strtoull");
	return retval;
}

static int
init_btree_search(const char *arg, int filter, btree_search_t search)
{
	char *s, *p;
	int i = 0;

	bzero(&search->base, sizeof(search->base));
	search->limit = 0;
	search->filter = filter;

	if (arg == NULL)
		return(-1);
	if (strcmp(arg, "none") == 0)
		return(-1);

	s = strdup(arg);
	if (s == NULL)
		return(-1);

	while ((p = s) != NULL) {
		if ((s = strchr(s, ':')) != NULL)
			*s++ = 0;
		if (++i == 1) {
			search->base.localization = _strtoul(p, 16);
		} else if (i == 2) {
			search->base.obj_id = _strtoull(p, 16);
		} else if (i == 3) {
			search->base.rec_type = _strtoul(p, 16);
		} else if (i == 4) {
			search->base.key = _strtoull(p, 16);
		} else if (i == 5) {
			search->base.create_tid = _strtoull(p, 16);
			break;
		}
	}
	search->limit = i;
	free(s);

	return(i);
}

static int
test_btree_search(hammer_btree_elm_t elm, btree_search_t search)
{
	hammer_base_elm_t base1 = &elm->base;
	hammer_base_elm_t base2 = &search->base;
	assert(search);

	if (base1->localization < base2->localization)
		return(-1);
	if (base1->localization > base2->localization)
		return(1);
	if (search->limit == 1)
		return(0);  /* ignore below */

	if (base1->obj_id < base2->obj_id)
		return(-2);
	if (base1->obj_id > base2->obj_id)
		return(2);
	if (search->limit == 2)
		return(0);  /* ignore below */

	if (base1->rec_type < base2->rec_type)
		return(-3);
	if (base1->rec_type > base2->rec_type)
		return(3);
	if (search->limit == 3)
		return(0);  /* ignore below */

	if (base1->key < base2->key)
		return(-4);
	if (base1->key > base2->key)
		return(4);
	if (search->limit == 4)
		return(0);  /* ignore below */

	if (base1->create_tid == 0) {
		if (base2->create_tid == 0)
			return(0);
		return(5);
	}
	if (base2->create_tid == 0)
		return(-5);
	if (base1->create_tid < base2->create_tid)
		return(-5);
	if (base1->create_tid > base2->create_tid)
		return(5);
	return(0);
}

static __inline
int
test_btree_match(hammer_btree_elm_t elm, btree_search_t search)
{
	if (test_btree_search(elm, search) == 0)
		return(1);
	return(0);
}

static
int
test_btree_out_of_range(hammer_btree_elm_t elm, btree_search_t search)
{
	if (test_btree_search(elm, search) > 0)
		return(1);  /* search < this elm */

	if (search->limit >= 5) {
		if (test_btree_search(elm + 1, search) <= 0)
			return(1);  /* next elm <= search */
	} else {
		if (test_btree_search(elm + 1, search) < 0)
			return(1);  /* next elm < search */
	}
	return(0);
}

/*
 * Dump the UNDO FIFO
 */
void
hammer_cmd_show_undo(void)
{
	struct volume_info *volume;
	hammer_blockmap_t rootmap;
	hammer_off_t scan_offset;
	hammer_fifo_any_t head;
	struct buffer_info *data_buffer = NULL;
	int64_t bytes;

	volume = get_volume(RootVolNo);
	rootmap = &volume->ondisk->vol0_blockmap[HAMMER_ZONE_UNDO_INDEX];
	if (rootmap->first_offset <= rootmap->next_offset)
		bytes = rootmap->next_offset - rootmap->first_offset;
	else
		bytes = rootmap->alloc_offset - rootmap->first_offset +
			(rootmap->next_offset & HAMMER_OFF_LONG_MASK);

	printf("Volume header UNDO %016jx-%016jx/%016jx\n",
		(intmax_t)rootmap->first_offset,
		(intmax_t)rootmap->next_offset,
		(intmax_t)rootmap->alloc_offset);
	printf("UNDO map is %jdMB\n",
		(intmax_t)((rootmap->alloc_offset & HAMMER_OFF_LONG_MASK) /
			   (1024 * 1024)));
	printf("UNDO being used is %jdB\n", (intmax_t)bytes);

	scan_offset = HAMMER_ZONE_ENCODE(HAMMER_ZONE_UNDO_INDEX, 0);
	while (scan_offset < rootmap->alloc_offset) {
		head = get_buffer_data(scan_offset, &data_buffer, 0);
		printf("%016jx ", scan_offset);

		switch(head->head.hdr_type) {
		case HAMMER_HEAD_TYPE_PAD:
			printf("PAD(%04x)", head->head.hdr_size);
			break;
		case HAMMER_HEAD_TYPE_DUMMY:
			printf("DUMMY(%04x) seq=%08x",
				head->head.hdr_size, head->head.hdr_seq);
			break;
		case HAMMER_HEAD_TYPE_UNDO:
			printf("UNDO(%04x) seq=%08x "
			       "dataoff=%016jx bytes=%d",
				head->head.hdr_size, head->head.hdr_seq,
				(intmax_t)head->undo.undo_offset,
				head->undo.undo_data_bytes);
			break;
		case HAMMER_HEAD_TYPE_REDO:
			printf("REDO(%04x) seq=%08x flags=%08x "
			       "objid=%016jx logoff=%016jx bytes=%d",
				head->head.hdr_size, head->head.hdr_seq,
				head->redo.redo_flags,
				(intmax_t)head->redo.redo_objid,
				(intmax_t)head->redo.redo_offset,
				head->redo.redo_data_bytes);
			break;
		default:
			printf("UNKNOWN(%04x,%04x) seq=%08x",
				head->head.hdr_type,
				head->head.hdr_size,
				head->head.hdr_seq);
			break;
		}

		if (scan_offset == rootmap->first_offset)
			printf(" >");
		if (scan_offset == rootmap->next_offset)
			printf(" <");
		printf("\n");

		if ((head->head.hdr_size & HAMMER_HEAD_ALIGN_MASK) ||
		    head->head.hdr_size == 0 ||
		    head->head.hdr_size > HAMMER_UNDO_ALIGN -
				    ((u_int)scan_offset & HAMMER_UNDO_MASK)) {
			printf("Illegal size field, skipping to "
			       "next boundary\n");
			scan_offset = (scan_offset + HAMMER_UNDO_MASK) &
					~HAMMER_UNDO_MASK64;
		} else {
			scan_offset += head->head.hdr_size;
		}
	}
	rel_buffer(data_buffer);
}