There is important information about booting non-ack images in docs/UPDATING. ack/aout-format images can't be built any more, and booting clang/ELF-format ones is a little different. Updating to the new boot monitor is recommended. Changes in this commit: . drop boot monitor -> allowing dropping ack support . facility to copy ELF boot files to /boot so that old boot monitor can still boot fairly easily, see UPDATING . no more ack-format libraries -> single-case libraries . some cleanup of OBJECT_FMT, COMPILER_TYPE, etc cases . drop several ack toolchain commands, but not all support commands (e.g. aal is gone but acksize is not yet). . a few libc files moved to netbsd libc dir . new /bin/date as minix date used code in libc/ . test compile fix . harmonize includes . /usr/lib is no longer special: without ack, /usr/lib plays no kind of special bootstrapping role any more and bootstrapping is done exclusively through packages, so releases depend even less on the state of the machine making them now. . rename nbsd_lib* to lib* . reduce mtree
324 lines
8.6 KiB
C
324 lines
8.6 KiB
C
/* $NetBSD: bt_debug.c,v 1.15 2008/09/10 17:52:35 joerg Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1990, 1993, 1994
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Mike Olson.
|
|
*
|
|
* 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 University 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 REGENTS 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 REGENTS 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.
|
|
*/
|
|
|
|
#if HAVE_NBTOOL_CONFIG_H
|
|
#include "nbtool_config.h"
|
|
#endif
|
|
|
|
#include <sys/cdefs.h>
|
|
__RCSID("$NetBSD: bt_debug.c,v 1.15 2008/09/10 17:52:35 joerg Exp $");
|
|
|
|
#include <assert.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include <db.h>
|
|
#include "btree.h"
|
|
|
|
#ifdef DEBUG
|
|
/*
|
|
* BT_DUMP -- Dump the tree
|
|
*
|
|
* Parameters:
|
|
* dbp: pointer to the DB
|
|
*/
|
|
void
|
|
__bt_dump(DB *dbp)
|
|
{
|
|
BTREE *t;
|
|
PAGE *h;
|
|
pgno_t i;
|
|
const char *sep;
|
|
|
|
t = dbp->internal;
|
|
(void)fprintf(stderr, "%s: pgsz %d",
|
|
F_ISSET(t, B_INMEM) ? "memory" : "disk", t->bt_psize);
|
|
if (F_ISSET(t, R_RECNO))
|
|
(void)fprintf(stderr, " keys %lu", (unsigned long) t->bt_nrecs);
|
|
#undef X
|
|
#define X(flag, name) \
|
|
if (F_ISSET(t, flag)) { \
|
|
(void)fprintf(stderr, "%s%s", sep, name); \
|
|
sep = ", "; \
|
|
}
|
|
if (t->flags != 0) {
|
|
sep = " flags (";
|
|
X(R_FIXLEN, "FIXLEN");
|
|
X(B_INMEM, "INMEM");
|
|
X(B_NODUPS, "NODUPS");
|
|
X(B_RDONLY, "RDONLY");
|
|
X(R_RECNO, "RECNO");
|
|
X(B_METADIRTY,"METADIRTY");
|
|
(void)fprintf(stderr, ")\n");
|
|
}
|
|
#undef X
|
|
|
|
for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) {
|
|
__bt_dpage(h);
|
|
(void)mpool_put(t->bt_mp, h, 0);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* BT_DMPAGE -- Dump the meta page
|
|
*
|
|
* Parameters:
|
|
* h: pointer to the PAGE
|
|
*/
|
|
void
|
|
__bt_dmpage(PAGE *h)
|
|
{
|
|
BTMETA *m;
|
|
const char *sep;
|
|
|
|
m = (BTMETA *)(void *)h;
|
|
(void)fprintf(stderr, "magic %lx\n", (unsigned long) m->magic);
|
|
(void)fprintf(stderr, "version %lu\n", (unsigned long) m->version);
|
|
(void)fprintf(stderr, "psize %lu\n", (unsigned long) m->psize);
|
|
(void)fprintf(stderr, "free %lu\n", (unsigned long) m->free);
|
|
(void)fprintf(stderr, "nrecs %lu\n", (unsigned long) m->nrecs);
|
|
(void)fprintf(stderr, "flags %lu", (unsigned long) m->flags);
|
|
#undef X
|
|
#define X(flag, name) \
|
|
if (m->flags & flag) { \
|
|
(void)fprintf(stderr, "%s%s", sep, name); \
|
|
sep = ", "; \
|
|
}
|
|
if (m->flags) {
|
|
sep = " (";
|
|
X(B_NODUPS, "NODUPS");
|
|
X(R_RECNO, "RECNO");
|
|
(void)fprintf(stderr, ")");
|
|
}
|
|
}
|
|
|
|
/*
|
|
* BT_DNPAGE -- Dump the page
|
|
*
|
|
* Parameters:
|
|
* n: page number to dump.
|
|
*/
|
|
void
|
|
__bt_dnpage(DB *dbp, pgno_t pgno)
|
|
{
|
|
BTREE *t;
|
|
PAGE *h;
|
|
|
|
t = dbp->internal;
|
|
if ((h = mpool_get(t->bt_mp, pgno, 0)) != NULL) {
|
|
__bt_dpage(h);
|
|
(void)mpool_put(t->bt_mp, h, 0);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* BT_DPAGE -- Dump the page
|
|
*
|
|
* Parameters:
|
|
* h: pointer to the PAGE
|
|
*/
|
|
void
|
|
__bt_dpage(PAGE *h)
|
|
{
|
|
BINTERNAL *bi;
|
|
BLEAF *bl;
|
|
RINTERNAL *ri;
|
|
RLEAF *rl;
|
|
indx_t cur, top;
|
|
const char *sep;
|
|
|
|
(void)fprintf(stderr, " page %d: (", h->pgno);
|
|
#undef X
|
|
#define X(flag, name) \
|
|
if (h->flags & flag) { \
|
|
(void)fprintf(stderr, "%s%s", sep, name); \
|
|
sep = ", "; \
|
|
}
|
|
sep = "";
|
|
X(P_BINTERNAL, "BINTERNAL") /* types */
|
|
X(P_BLEAF, "BLEAF")
|
|
X(P_RINTERNAL, "RINTERNAL") /* types */
|
|
X(P_RLEAF, "RLEAF")
|
|
X(P_OVERFLOW, "OVERFLOW")
|
|
X(P_PRESERVE, "PRESERVE");
|
|
(void)fprintf(stderr, ")\n");
|
|
#undef X
|
|
|
|
(void)fprintf(stderr, "\tprev %2d next %2d", h->prevpg, h->nextpg);
|
|
if (h->flags & P_OVERFLOW)
|
|
return;
|
|
|
|
top = NEXTINDEX(h);
|
|
(void)fprintf(stderr, " lower %3d upper %3d nextind %d\n",
|
|
h->lower, h->upper, top);
|
|
for (cur = 0; cur < top; cur++) {
|
|
(void)fprintf(stderr, "\t[%03d] %4d ", cur, h->linp[cur]);
|
|
switch (h->flags & P_TYPE) {
|
|
case P_BINTERNAL:
|
|
bi = GETBINTERNAL(h, cur);
|
|
(void)fprintf(stderr,
|
|
"size %03d pgno %03d", bi->ksize, bi->pgno);
|
|
if (bi->flags & P_BIGKEY)
|
|
(void)fprintf(stderr, " (indirect)");
|
|
else if (bi->ksize)
|
|
(void)fprintf(stderr,
|
|
" {%.*s}", (int)bi->ksize, bi->bytes);
|
|
break;
|
|
case P_RINTERNAL:
|
|
ri = GETRINTERNAL(h, cur);
|
|
(void)fprintf(stderr, "entries %03d pgno %03d",
|
|
ri->nrecs, ri->pgno);
|
|
break;
|
|
case P_BLEAF:
|
|
bl = GETBLEAF(h, cur);
|
|
if (bl->flags & P_BIGKEY)
|
|
(void)fprintf(stderr,
|
|
"big key page %lu size %u/",
|
|
(unsigned long) *(pgno_t *)(void *)bl->bytes,
|
|
*(uint32_t *)(void *)(bl->bytes + sizeof(pgno_t)));
|
|
else if (bl->ksize)
|
|
(void)fprintf(stderr, "%s/", bl->bytes);
|
|
if (bl->flags & P_BIGDATA)
|
|
(void)fprintf(stderr,
|
|
"big data page %lu size %u",
|
|
(unsigned long) *(pgno_t *)(void *)(bl->bytes + bl->ksize),
|
|
*(uint32_t *)(void *)(bl->bytes + bl->ksize +
|
|
sizeof(pgno_t)));
|
|
else if (bl->dsize)
|
|
(void)fprintf(stderr, "%.*s",
|
|
(int)bl->dsize, bl->bytes + bl->ksize);
|
|
break;
|
|
case P_RLEAF:
|
|
rl = GETRLEAF(h, cur);
|
|
if (rl->flags & P_BIGDATA)
|
|
(void)fprintf(stderr,
|
|
"big data page %lu size %u",
|
|
(unsigned long) *(pgno_t *)(void *)rl->bytes,
|
|
*(uint32_t *)(void *)(rl->bytes + sizeof(pgno_t)));
|
|
else if (rl->dsize)
|
|
(void)fprintf(stderr,
|
|
"%.*s", (int)rl->dsize, rl->bytes);
|
|
break;
|
|
}
|
|
(void)fprintf(stderr, "\n");
|
|
}
|
|
}
|
|
#endif
|
|
|
|
#ifdef STATISTICS
|
|
/*
|
|
* BT_STAT -- Gather/print the tree statistics
|
|
*
|
|
* Parameters:
|
|
* dbp: pointer to the DB
|
|
*/
|
|
void
|
|
__bt_stat(DB *dbp)
|
|
{
|
|
extern unsigned long bt_cache_hit, bt_cache_miss, bt_pfxsaved, bt_rootsplit;
|
|
extern unsigned long bt_sortsplit, bt_split;
|
|
BTREE *t;
|
|
PAGE *h;
|
|
pgno_t i, pcont, pinternal, pleaf;
|
|
unsigned long ifree, lfree, nkeys;
|
|
int levels;
|
|
|
|
t = dbp->internal;
|
|
pcont = pinternal = pleaf = 0;
|
|
nkeys = ifree = lfree = 0;
|
|
for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) {
|
|
switch (h->flags & P_TYPE) {
|
|
case P_BINTERNAL:
|
|
case P_RINTERNAL:
|
|
++pinternal;
|
|
ifree += h->upper - h->lower;
|
|
break;
|
|
case P_BLEAF:
|
|
case P_RLEAF:
|
|
++pleaf;
|
|
lfree += h->upper - h->lower;
|
|
nkeys += NEXTINDEX(h);
|
|
break;
|
|
case P_OVERFLOW:
|
|
++pcont;
|
|
break;
|
|
}
|
|
(void)mpool_put(t->bt_mp, h, 0);
|
|
}
|
|
|
|
/* Count the levels of the tree. */
|
|
for (i = P_ROOT, levels = 0 ;; ++levels) {
|
|
h = mpool_get(t->bt_mp, i, 0);
|
|
if (h->flags & (P_BLEAF|P_RLEAF)) {
|
|
if (levels == 0)
|
|
levels = 1;
|
|
(void)mpool_put(t->bt_mp, h, 0);
|
|
break;
|
|
}
|
|
i = F_ISSET(t, R_RECNO) ?
|
|
GETRINTERNAL(h, 0)->pgno :
|
|
GETBINTERNAL(h, 0)->pgno;
|
|
(void)mpool_put(t->bt_mp, h, 0);
|
|
}
|
|
|
|
(void)fprintf(stderr, "%d level%s with %ld keys",
|
|
levels, levels == 1 ? "" : "s", nkeys);
|
|
if (F_ISSET(t, R_RECNO))
|
|
(void)fprintf(stderr, " (%ld header count)", (long)t->bt_nrecs);
|
|
(void)fprintf(stderr,
|
|
"\n%lu pages (leaf %ld, internal %ld, overflow %ld)\n",
|
|
(long)pinternal + pleaf + pcont, (long)pleaf, (long)pinternal,
|
|
(long)pcont);
|
|
(void)fprintf(stderr, "%ld cache hits, %ld cache misses\n",
|
|
bt_cache_hit, bt_cache_miss);
|
|
(void)fprintf(stderr, "%ld splits (%ld root splits, %ld sort splits)\n",
|
|
bt_split, bt_rootsplit, bt_sortsplit);
|
|
pleaf *= t->bt_psize - BTDATAOFF;
|
|
if (pleaf)
|
|
(void)fprintf(stderr,
|
|
"%.0f%% leaf fill (%ld bytes used, %ld bytes free)\n",
|
|
((double)(pleaf - lfree) / pleaf) * 100,
|
|
pleaf - lfree, lfree);
|
|
pinternal *= t->bt_psize - BTDATAOFF;
|
|
if (pinternal)
|
|
(void)fprintf(stderr,
|
|
"%.0f%% internal fill (%ld bytes used, %ld bytes free\n",
|
|
((double)(pinternal - ifree) / pinternal) * 100,
|
|
pinternal - ifree, ifree);
|
|
if (bt_pfxsaved)
|
|
(void)fprintf(stderr, "prefix checking removed %lu bytes.\n",
|
|
bt_pfxsaved);
|
|
}
|
|
#endif
|