void dump_leaf (
tree_s *tree,
leaf_s *leaf,
unint depth)
{
rec_s *end = &leaf->l_rec[leaf->l_num];
rec_s *r;
char *c;
unint i;
if (!leaf) return;
printf("%sleaf: num keys = %d end = %d total = %d current = %ld\n",
indent(depth),
leaf->l_num, leaf->l_end, leaf->l_total,
free_space(leaf));
for (r = leaf->l_rec, i = 0; r < end; r++, i++) {
c = (char *)leaf + r->r_start;
printf("%s %4lu. %8x %4d:%4d %s\n",
indent(depth),
i, r->r_key, r->r_start, r->r_size,
dump_rec(tree, r->r_key, c, r->r_size));
}
}
void dump_leaf (
tree_s *tree,
leaf_s *leaf,
unint indent)
{
rec_s *end = &leaf->l_rec[leaf->l_num];
rec_s *r;
char *c;
unsigned i;
//unsigned j;
//FN;
if (!leaf) return;
pr_indent(indent);
printf("leaf: num keys = %d end = %d total = %d current = %u\n",
leaf->l_num, leaf->l_end, leaf->l_total,
free_space(leaf));
fflush(stdout);
for (r = leaf->l_rec, i = 0; r < end; r++, i++) {
c = (char *)leaf + r->r_start;
pr_indent(indent);
printf("\t%4d. %16llx %4d:%4d ",
i, r->r_key, r->r_start, r->r_len);
dump_rec(tree, r->r_key, c, r->r_len);
printf("\n");
fflush(stdout);
}
fflush(stdout);
}
void
dump_db(
char * host,
char * disk)
{
info_t info;
int rc;
if((rc = get_info(host, disk, &info)) == 0) {
dump_rec(&info);
} else {
g_printf(_("cannot fetch information for %s:%s rc=%d\n"), host, disk, rc);
}
}
static void dump_rec (tree23_t *T, int depth, int extra) {
int i;
if (!T) return;
printf ("[ ");
if (depth--) {
dump_rec (T->left, depth, extra);
printf ("%d", T->x1);
for (i = -extra; i < 0; i++) {
printf (":%d", T->extra[i]);
}
putchar (' ');
if (T->x2 > T->x1) {
dump_rec (T->middle, depth, extra);
printf ("%d", T->x2);
for (i = -2*extra; i < -extra; i++) {
printf (":%d", T->extra[i]);
}
putchar (' ');
}
dump_rec (T->right, depth, extra);
} else {
printf ("%d", T->x1);
for (i = -extra; i < 0; i++) {
printf (":%d", ((tree23_leaf_t *) T)->extra[i]);
}
putchar (' ');
if (T->x2 > T->x1) {
printf ("%d", T->x2);
for (i = -2*extra; i < -extra; i++) {
printf (":%d", ((tree23_leaf_t *) T)->extra[i]);
}
putchar (' ');
}
}
printf ("] ");
}
void dump_tab(const char* var, struct initrec** inittab)
{
const char* rec = "irec";
struct initrec *p, **pp;
int i, n;
for(i = 0, pp = inittab; (p = *pp); pp++, i++)
dump_rec(rec, i, p);
n = i;
printf("static struct initrec* %s[] = {\n", var);
printf("\tNULL,\n");
for(i = 0; i < n; i++)
printf("\t&%s%i,\n", rec, i);
printf("\tNULL\n");
printf("};\n\n");
}
static void
dump_rec(Trie *t, int d) {
if(isbranch(t)) {
printf("Tdump%*s branch %p\n", d, "", t);
for(uint i = 0; i < 64; i++) {
uint64_t b = twigbit(i);
if(hastwig(t, b)) {
printf("Tdump%*s twig %d\n", d, "", i);
dump_rec(twig(t, twigoff(t, b)), d+1);
}
}
} else {
printf("Tdump%*s leaf %p\n", d, "", t);
printf("Tdump%*s leaf key %p %s\n", d, "",
t->leaf.key, t->leaf.key);
printf("Tdump%*s leaf val %p\n", d, "",
t->leaf.val);
}
}
void
Tdump(Tbl *tbl) {
printf("Tdump root %p\n", tbl);
if(tbl != NULL)
dump_rec(&tbl->root, 0);
}
static void dump (tree23_root_t *R) {
dump_rec (R->root, R->depth, R->extra_words);
}
