260N/A/*-
260N/A * See the file LICENSE for redistribution information.
260N/A *
260N/A * Copyright (c) 1996, 1997, 1998
260N/A * Sleepycat Software. All rights reserved.
260N/A */
260N/A
260N/A#include "config.h"
260N/A
260N/A#ifndef lint
260N/Astatic const char sccsid[] = "@(#)bt_stat.c 10.27 (Sleepycat) 11/25/98";
260N/A#endif /* not lint */
260N/A
260N/A#ifndef NO_SYSTEM_INCLUDES
260N/A#include <sys/types.h>
260N/A
260N/A#include <errno.h>
260N/A#include <string.h>
260N/A#endif
260N/A
260N/A#include "db_int.h"
260N/A#include "db_page.h"
260N/A#include "btree.h"
260N/A
260N/A/*
260N/A * __bam_stat --
260N/A * Gather/print the btree statistics
260N/A *
260N/A * PUBLIC: int __bam_stat __P((DB *, void *, void *(*)(size_t), u_int32_t));
260N/A */
260N/Aint
260N/A__bam_stat(dbp, spp, db_malloc, flags)
260N/A DB *dbp;
364N/A void *spp;
260N/A void *(*db_malloc) __P((size_t));
260N/A u_int32_t flags;
260N/A{
260N/A BTMETA *meta;
344N/A BTREE *t;
260N/A DBC *dbc;
260N/A DB_BTREE_STAT *sp;
260N/A DB_LOCK lock;
260N/A PAGE *h;
260N/A db_pgno_t lastpgno, pgno;
260N/A int ret, t_ret;
260N/A
260N/A DB_PANIC_CHECK(dbp);
260N/A
260N/A /* Check for invalid flags. */
260N/A if ((ret = __db_statchk(dbp, flags)) != 0)
260N/A return (ret);
260N/A
260N/A if ((ret = dbp->cursor(dbp, NULL, &dbc, 0)) != 0)
260N/A return (ret);
260N/A
260N/A DEBUG_LWRITE(dbc, NULL, "bam_stat", NULL, NULL, flags);
260N/A
260N/A t = dbp->internal;
260N/A
260N/A if (spp == NULL)
260N/A return (0);
260N/A
260N/A /* Allocate and clear the structure. */
260N/A if ((ret = __os_malloc(sizeof(*sp), db_malloc, &sp)) != 0)
260N/A goto err;
260N/A memset(sp, 0, sizeof(*sp));
260N/A
260N/A /* If the app just wants the record count, make it fast. */
260N/A if (flags == DB_RECORDCOUNT) {
260N/A pgno = PGNO_ROOT;
272N/A if ((ret = __bam_lget(dbc, 0, pgno, DB_LOCK_READ, &lock)) != 0)
260N/A goto err;
260N/A if ((ret = memp_fget(dbp->mpf, &pgno, 0, (PAGE **)&h)) != 0)
260N/A goto err;
260N/A
260N/A sp->bt_nrecs = RE_NREC(h);
260N/A
260N/A (void)memp_fput(dbp->mpf, h, 0);
260N/A (void)__BT_LPUT(dbc, lock);
260N/A goto done;
260N/A }
260N/A
260N/A /* Get the meta-data page. */
296N/A pgno = PGNO_METADATA;
260N/A if ((ret = __bam_lget(dbc, 0, pgno, DB_LOCK_READ, &lock)) != 0)
260N/A goto err;
260N/A if ((ret = memp_fget(dbp->mpf, &pgno, 0, (PAGE **)&meta)) != 0)
260N/A goto err;
260N/A
260N/A /* Translate the metadata flags. */
260N/A if (F_ISSET(meta, BTM_DUP))
260N/A sp->bt_flags |= DB_DUP;
260N/A if (F_ISSET(meta, BTM_FIXEDLEN))
261N/A sp->bt_flags |= DB_FIXEDLEN;
260N/A if (F_ISSET(meta, BTM_RECNUM))
260N/A sp->bt_flags |= DB_RECNUM;
260N/A if (F_ISSET(meta, BTM_RENUMBER))
260N/A sp->bt_flags |= DB_RENUMBER;
260N/A
260N/A /* Get the remaining metadata fields. */
260N/A sp->bt_minkey = meta->minkey;
260N/A sp->bt_maxkey = meta->maxkey;
260N/A sp->bt_re_len = meta->re_len;
260N/A sp->bt_re_pad = meta->re_pad;
260N/A sp->bt_magic = meta->magic;
260N/A sp->bt_version = meta->version;
260N/A
260N/A /* Get the page size from the DB. */
260N/A sp->bt_pagesize = dbp->pgsize;
260N/A
260N/A /* Walk the free list, counting pages. */
260N/A for (sp->bt_free = 0, pgno = meta->free; pgno != PGNO_INVALID;) {
260N/A ++sp->bt_free;
260N/A
260N/A if ((ret = memp_fget(dbp->mpf, &pgno, 0, &h)) != 0) {
260N/A (void)memp_fput(dbp->mpf, meta, 0);
260N/A (void)__BT_TLPUT(dbc, lock);
260N/A goto err;
260N/A }
260N/A pgno = h->next_pgno;
260N/A (void)memp_fput(dbp->mpf, h, 0);
260N/A }
260N/A
260N/A /* Discard the meta-data page. */
260N/A (void)memp_fput(dbp->mpf, meta, 0);
260N/A (void)__BT_TLPUT(dbc, lock);
260N/A
260N/A /* Determine the last page of the database. */
260N/A if ((ret = memp_fget(dbp->mpf, &lastpgno, DB_MPOOL_LAST, &h)) != 0)
260N/A goto err;
260N/A (void)memp_fput(dbp->mpf, h, 0);
260N/A
260N/A /* Get the root page. */
260N/A pgno = PGNO_ROOT;
260N/A if ((ret = __bam_lget(dbc, 0, PGNO_ROOT, DB_LOCK_READ, &lock)) != 0)
260N/A goto err;
260N/A if ((ret = memp_fget(dbp->mpf, &pgno, 0, &h)) != 0) {
260N/A (void)__BT_LPUT(dbc, lock);
260N/A goto err;
260N/A }
260N/A
260N/A /* Get the levels from the root page. */
260N/A sp->bt_levels = h->level;
260N/A
260N/A /* Walk the page list, counting things. */
260N/A for (;;) {
260N/A switch (TYPE(h)) {
260N/A case P_INVALID:
345N/A break;
260N/A case P_IBTREE:
260N/A case P_IRECNO:
260N/A ++sp->bt_int_pg;
260N/A sp->bt_int_pgfree += HOFFSET(h) - LOFFSET(h);
260N/A break;
260N/A case P_LBTREE:
260N/A ++sp->bt_leaf_pg;
260N/A sp->bt_leaf_pgfree += HOFFSET(h) - LOFFSET(h);
260N/A sp->bt_nrecs += NUM_ENT(h) / P_INDX;
260N/A break;
260N/A case P_LRECNO:
260N/A ++sp->bt_leaf_pg;
260N/A sp->bt_leaf_pgfree += HOFFSET(h) - LOFFSET(h);
260N/A sp->bt_nrecs += NUM_ENT(h);
260N/A break;
260N/A case P_DUPLICATE:
260N/A ++sp->bt_dup_pg;
260N/A /* XXX MARGO: sp->bt_dup_pgfree; */
260N/A break;
260N/A case P_OVERFLOW:
260N/A ++sp->bt_over_pg;
260N/A /* XXX MARGO: sp->bt_over_pgfree; */
260N/A break;
260N/A default:
260N/A (void)memp_fput(dbp->mpf, h, 0);
260N/A (void)__BT_LPUT(dbc, lock);
260N/A return (__db_pgfmt(dbp, pgno));
260N/A }
260N/A
260N/A (void)memp_fput(dbp->mpf, h, 0);
260N/A (void)__BT_LPUT(dbc, lock);
260N/A
260N/A if (++pgno > lastpgno)
260N/A break;
260N/A if (__bam_lget(dbc, 0, pgno, DB_LOCK_READ, &lock))
364N/A break;
364N/A if (memp_fget(dbp->mpf, &pgno, 0, &h) != 0) {
364N/A (void)__BT_LPUT(dbc, lock);
364N/A break;
364N/A }
364N/A }
364N/A
364N/Adone: *(DB_BTREE_STAT **)spp = sp;
364N/A ret = 0;
364N/A
260N/Aerr: if ((t_ret = dbc->c_close(dbc)) != 0 && ret == 0)
260N/A ret = t_ret;
260N/A return (ret);
260N/A}
260N/A