database/mariadb
1
0
Fork 0
mirror of https://github.com/MariaDB/server.git synced 2025-10-31 15:50:51 +03:00
Code Activity
Files
aadcf0d35b49a411547bcccdcb1516ca5711b1b0
mariadb/storage/bdb/db_stat/db_stat.c
brian@zim.(none) 2a7c71e309 Changes to create storage directory for storage engines.
2005-04-26 18:19:54 -07:00

1268 lines
33 KiB
C
Raw Blame History

/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996-2002
* Sleepycat Software. All rights reserved.
*/
#include "db_config.h"
#ifndef lint
static const char copyright[] =
"Copyright (c) 1996-2002\nSleepycat Software Inc. All rights reserved.\n";
static const char revid[] =
"$Id: db_stat.c,v 11.125 2002/08/08 15:26:15 bostic Exp $";
#endif
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#if TIME_WITH_SYS_TIME
#include <sys/time.h>
#include <time.h>
#else
#if HAVE_SYS_TIME_H
#include <sys/time.h>
#else
#include <time.h>
#endif
#endif
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#endif
#include "db_int.h"
#include "dbinc/db_page.h"
#define PCT(f, t, pgsize) \
((t) == 0 ? 0 : \
(((double)(((t) * (pgsize)) - (f)) / ((t) * (pgsize))) * 100))
typedef enum { T_NOTSET,
T_DB, T_ENV, T_LOCK, T_LOG, T_MPOOL, T_REP, T_TXN } test_t;
int argcheck __P((char *, const char *));
int btree_stats __P((DB_ENV *, DB *, DB_BTREE_STAT *, int));
int db_init __P((DB_ENV *, char *, test_t, u_int32_t, int *));
void dl __P((const char *, u_long));
void dl_bytes __P((const char *, u_long, u_long, u_long));
int env_stats __P((DB_ENV *, u_int32_t));
int hash_stats __P((DB_ENV *, DB *, int));
int lock_stats __P((DB_ENV *, char *, u_int32_t));
int log_stats __P((DB_ENV *, u_int32_t));
int main __P((int, char *[]));
int mpool_stats __P((DB_ENV *, char *, u_int32_t));
void prflags __P((u_int32_t, const FN *));
int queue_stats __P((DB_ENV *, DB *, int));
int rep_stats __P((DB_ENV *, u_int32_t));
int txn_compare __P((const void *, const void *));
int txn_stats __P((DB_ENV *, u_int32_t));
int usage __P((void));
int version_check __P((const char *));
int
main(argc, argv)
int argc;
char *argv[];
{
extern char *optarg;
extern int optind;
const char *progname = "db_stat";
DB_ENV *dbenv;
DB_BTREE_STAT *sp;
DB *alt_dbp, *dbp;
test_t ttype;
u_int32_t cache;
int ch, checked, d_close, e_close, exitval, fast, flags;
int nflag, private, resize, ret;
char *db, *home, *internal, *passwd, *subdb;
if ((ret = version_check(progname)) != 0)
return (ret);
dbp = NULL;
ttype = T_NOTSET;
cache = MEGABYTE;
d_close = e_close = exitval = fast = flags = nflag = private = 0;
db = home = internal = passwd = subdb = NULL;
while ((ch = getopt(argc, argv, "C:cd:efh:lM:mNP:rs:tVZ")) != EOF)
switch (ch) {
case 'C':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_LOCK;
if (!argcheck(internal = optarg, "Aclmop"))
return (usage());
break;
case 'c':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_LOCK;
break;
case 'd':
if (ttype != T_DB && ttype != T_NOTSET)
goto argcombo;
ttype = T_DB;
db = optarg;
break;
case 'e':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_ENV;
break;
case 'f':
fast = DB_FAST_STAT;
break;
case 'h':
home = optarg;
break;
case 'l':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_LOG;
break;
case 'M':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_MPOOL;
if (!argcheck(internal = optarg, "Ahm"))
return (usage());
break;
case 'm':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_MPOOL;
break;
case 'N':
nflag = 1;
break;
case 'P':
passwd = strdup(optarg);
memset(optarg, 0, strlen(optarg));
if (passwd == NULL) {
fprintf(stderr, "%s: strdup: %s\n",
progname, strerror(errno));
return (EXIT_FAILURE);
}
break;
case 'r':
if (ttype != T_NOTSET)
goto argcombo;
ttype = T_REP;
break;
case 's':
if (ttype != T_DB && ttype != T_NOTSET)
goto argcombo;
ttype = T_DB;
subdb = optarg;
break;
case 't':
if (ttype != T_NOTSET) {
argcombo: fprintf(stderr,
"%s: illegal option combination\n",
progname);
return (EXIT_FAILURE);
}
ttype = T_TXN;
break;
case 'V':
printf("%s\n", db_version(NULL, NULL, NULL));
return (EXIT_SUCCESS);
case 'Z':
flags |= DB_STAT_CLEAR;
break;
case '?':
default:
return (usage());
}
argc -= optind;
argv += optind;
switch (ttype) {
case T_DB:
if (db == NULL)
return (usage());
break;
case T_NOTSET:
return (usage());
/* NOTREACHED */
default:
if (fast != 0)
return (usage());
break;
}
/* Handle possible interruptions. */
__db_util_siginit();
/*
* Create an environment object and initialize it for error
* reporting.
*/
retry: if ((ret = db_env_create(&dbenv, 0)) != 0) {
fprintf(stderr,
"%s: db_env_create: %s\n", progname, db_strerror(ret));
goto shutdown;
}
e_close = 1;
dbenv->set_errfile(dbenv, stderr);
dbenv->set_errpfx(dbenv, progname);
if (nflag) {
if ((ret = dbenv->set_flags(dbenv, DB_NOLOCKING, 1)) != 0) {
dbenv->err(dbenv, ret, "set_flags: DB_NOLOCKING");
goto shutdown;
}
if ((ret = dbenv->set_flags(dbenv, DB_NOPANIC, 1)) != 0) {
dbenv->err(dbenv, ret, "set_flags: DB_NOPANIC");
goto shutdown;
}
}
if (passwd != NULL &&
(ret = dbenv->set_encrypt(dbenv, passwd, DB_ENCRYPT_AES)) != 0) {
dbenv->err(dbenv, ret, "set_passwd");
goto shutdown;
}
/* Initialize the environment. */
if (db_init(dbenv, home, ttype, cache, &private) != 0)
goto shutdown;
switch (ttype) {
case T_DB:
/* Create the DB object and open the file. */
if (flags != 0)
return (usage());
if ((ret = db_create(&dbp, dbenv, 0)) != 0) {
dbenv->err(dbenv, ret, "db_create");
goto shutdown;
}
d_close = 1;
if ((ret = dbp->open(dbp,
NULL, db, subdb, DB_UNKNOWN, DB_RDONLY, 0)) != 0) {
dbp->err(dbp, ret, "DB->open: %s", db);
goto shutdown;
}
/* Check if cache is too small for this DB's pagesize. */
if (private) {
if ((ret =
__db_util_cache(dbenv, dbp, &cache, &resize)) != 0)
goto shutdown;
if (resize) {
(void)dbp->close(dbp, 0);
d_close = 0;
(void)dbenv->close(dbenv, 0);
e_close = 0;
goto retry;
}
}
/*
* See if we can open this db read/write to update counts.
* If its a master-db then we cannot. So check to see,
* if its btree then it might be.
*/
checked = 0;
if (subdb == NULL && dbp->type == DB_BTREE) {
if ((ret = dbp->stat(dbp, &sp, DB_FAST_STAT)) != 0) {
dbp->err(dbp, ret, "DB->stat");
goto shutdown;
}
checked = 1;
}
if (subdb != NULL ||
dbp->type != DB_BTREE ||
(sp->bt_metaflags & BTM_SUBDB) == 0) {
if ((ret = db_create(&alt_dbp, dbenv, 0)) != 0) {
dbenv->err(dbenv, ret, "db_create");
goto shutdown;
}
if ((ret = dbp->open(alt_dbp, NULL,
db, subdb, DB_UNKNOWN, 0, 0)) != 0) {
dbenv->err(dbenv,
ret, "DB->open: %s:%s", db, subdb);
(void)alt_dbp->close(alt_dbp, 0);
goto shutdown;
}
(void)dbp->close(dbp, 0);
dbp = alt_dbp;
/* Need to run again to update counts */
checked = 0;
}
switch (dbp->type) {
case DB_BTREE:
case DB_RECNO:
if (btree_stats(
dbenv, dbp, checked == 1 ? sp : NULL, fast))
goto shutdown;
break;
case DB_HASH:
if (hash_stats(dbenv, dbp, fast))
goto shutdown;
break;
case DB_QUEUE:
if (queue_stats(dbenv, dbp, fast))
goto shutdown;
break;
case DB_UNKNOWN:
dbenv->errx(dbenv, "Unknown database type.");
goto shutdown;
}
break;
case T_ENV:
if (env_stats(dbenv, flags))
goto shutdown;
break;
case T_LOCK:
if (lock_stats(dbenv, internal, flags))
goto shutdown;
break;
case T_LOG:
if (log_stats(dbenv, flags))
goto shutdown;
break;
case T_MPOOL:
if (mpool_stats(dbenv, internal, flags))
goto shutdown;
break;
case T_REP:
if (rep_stats(dbenv, flags))
goto shutdown;
break;
case T_TXN:
if (txn_stats(dbenv, flags))
goto shutdown;
break;
case T_NOTSET:
dbenv->errx(dbenv, "Unknown statistics flag.");
goto shutdown;
}
if (0) {
shutdown: exitval = 1;
}
if (d_close && (ret = dbp->close(dbp, 0)) != 0) {
exitval = 1;
dbenv->err(dbenv, ret, "close");
}
if (e_close && (ret = dbenv->close(dbenv, 0)) != 0) {
exitval = 1;
fprintf(stderr,
"%s: dbenv->close: %s\n", progname, db_strerror(ret));
}
/* Resend any caught signal. */
__db_util_sigresend();
return (exitval == 0 ? EXIT_SUCCESS : EXIT_FAILURE);
}
/*
* env_stats --
* Display environment statistics.
*/
int
env_stats(dbenv, flags)
DB_ENV *dbenv;
u_int32_t flags;
{
REGENV renv;
REGION *rp, regs[1024];
int n, ret;
const char *lable;
n = sizeof(regs) / sizeof(regs[0]);
if ((ret = __db_e_stat(dbenv, &renv, regs, &n, flags)) != 0) {
dbenv->err(dbenv, ret, "__db_e_stat");
return (1);
}
printf("%d.%d.%d\tEnvironment version.\n",
renv.majver, renv.minver, renv.patch);
printf("%lx\tMagic number.\n", (u_long)renv.magic);
printf("%d\tPanic value.\n", renv.envpanic);
/* Adjust the reference count for us... */
printf("%d\tReferences.\n", renv.refcnt - 1);
dl("Locks granted without waiting.\n",
(u_long)renv.mutex.mutex_set_nowait);
dl("Locks granted after waiting.\n",
(u_long)renv.mutex.mutex_set_wait);
while (n > 0) {
printf("%s\n", DB_LINE);
rp = &regs[--n];
switch (rp->type) {
case REGION_TYPE_ENV:
lable = "Environment";
break;
case REGION_TYPE_LOCK:
lable = "Lock";
break;
case REGION_TYPE_LOG:
lable = "Log";
break;
case REGION_TYPE_MPOOL:
lable = "Mpool";
break;
case REGION_TYPE_MUTEX:
lable = "Mutex";
break;
case REGION_TYPE_TXN:
lable = "Txn";
break;
case INVALID_REGION_TYPE:
default:
lable = "Invalid";
break;
}
printf("%s Region: %d.\n", lable, rp->id);
dl_bytes("Size", (u_long)0, (u_long)0, (u_long)rp->size);
printf("%ld\tSegment ID.\n", rp->segid);
dl("Locks granted without waiting.\n",
(u_long)rp->mutex.mutex_set_nowait);
dl("Locks granted after waiting.\n",
(u_long)rp->mutex.mutex_set_wait);
}
return (0);
}
/*
* btree_stats --
* Display btree/recno statistics.
*/
int
btree_stats(dbenv, dbp, msp, fast)
DB_ENV *dbenv;
DB *dbp;
DB_BTREE_STAT *msp;
int fast;
{
static const FN fn[] = {
{ BTM_DUP, "duplicates" },
{ BTM_FIXEDLEN, "fixed-length" },
{ BTM_RECNO, "recno" },
{ BTM_RECNUM, "record-numbers" },
{ BTM_RENUMBER, "renumber" },
{ BTM_SUBDB, "multiple-databases" },
{ 0, NULL }
};
DB_BTREE_STAT *sp;
int ret;
COMPQUIET(dbenv, NULL);
if (msp != NULL)
sp = msp;
else if ((ret = dbp->stat(dbp, &sp, fast)) != 0) {
dbp->err(dbp, ret, "DB->stat");
return (1);
}
printf("%lx\tBtree magic number.\n", (u_long)sp->bt_magic);
printf("%lu\tBtree version number.\n", (u_long)sp->bt_version);
prflags(sp->bt_metaflags, fn);
if (dbp->type == DB_BTREE) {
#ifdef NOT_IMPLEMENTED
dl("Maximum keys per-page.\n", (u_long)sp->bt_maxkey);
#endif
dl("Minimum keys per-page.\n", (u_long)sp->bt_minkey);
}
if (dbp->type == DB_RECNO) {
dl("Fixed-length record size.\n", (u_long)sp->bt_re_len);
if (isprint(sp->bt_re_pad) && !isspace(sp->bt_re_pad))
printf("%c\tFixed-length record pad.\n",
(int)sp->bt_re_pad);
else
printf("0x%x\tFixed-length record pad.\n",
(int)sp->bt_re_pad);
}
dl("Underlying database page size.\n", (u_long)sp->bt_pagesize);
dl("Number of levels in the tree.\n", (u_long)sp->bt_levels);
dl(dbp->type == DB_BTREE ?
"Number of unique keys in the tree.\n" :
"Number of records in the tree.\n", (u_long)sp->bt_nkeys);
dl("Number of data items in the tree.\n", (u_long)sp->bt_ndata);
dl("Number of tree internal pages.\n", (u_long)sp->bt_int_pg);
dl("Number of bytes free in tree internal pages",
(u_long)sp->bt_int_pgfree);
printf(" (%.0f%% ff).\n",
PCT(sp->bt_int_pgfree, sp->bt_int_pg, sp->bt_pagesize));
dl("Number of tree leaf pages.\n", (u_long)sp->bt_leaf_pg);
dl("Number of bytes free in tree leaf pages",
(u_long)sp->bt_leaf_pgfree);
printf(" (%.0f%% ff).\n",
PCT(sp->bt_leaf_pgfree, sp->bt_leaf_pg, sp->bt_pagesize));
dl("Number of tree duplicate pages.\n", (u_long)sp->bt_dup_pg);
dl("Number of bytes free in tree duplicate pages",
(u_long)sp->bt_dup_pgfree);
printf(" (%.0f%% ff).\n",
PCT(sp->bt_dup_pgfree, sp->bt_dup_pg, sp->bt_pagesize));
dl("Number of tree overflow pages.\n", (u_long)sp->bt_over_pg);
dl("Number of bytes free in tree overflow pages",
(u_long)sp->bt_over_pgfree);
printf(" (%.0f%% ff).\n",
PCT(sp->bt_over_pgfree, sp->bt_over_pg, sp->bt_pagesize));
dl("Number of pages on the free list.\n", (u_long)sp->bt_free);
free(sp);
return (0);
}
/*
* hash_stats --
* Display hash statistics.
*/
int
hash_stats(dbenv, dbp, fast)
DB_ENV *dbenv;
DB *dbp;
int fast;
{
static const FN fn[] = {
{ DB_HASH_DUP, "duplicates" },
{ DB_HASH_SUBDB,"multiple-databases" },
{ 0, NULL }
};
DB_HASH_STAT *sp;
int ret;
COMPQUIET(dbenv, NULL);
if ((ret = dbp->stat(dbp, &sp, fast)) != 0) {
dbp->err(dbp, ret, "DB->stat");
return (1);
}
printf("%lx\tHash magic number.\n", (u_long)sp->hash_magic);
printf("%lu\tHash version number.\n", (u_long)sp->hash_version);
prflags(sp->hash_metaflags, fn);
dl("Underlying database page size.\n", (u_long)sp->hash_pagesize);
dl("Specified fill factor.\n", (u_long)sp->hash_ffactor);
dl("Number of keys in the database.\n", (u_long)sp->hash_nkeys);
dl("Number of data items in the database.\n", (u_long)sp->hash_ndata);
dl("Number of hash buckets.\n", (u_long)sp->hash_buckets);
dl("Number of bytes free on bucket pages", (u_long)sp->hash_bfree);
printf(" (%.0f%% ff).\n",
PCT(sp->hash_bfree, sp->hash_buckets, sp->hash_pagesize));
dl("Number of overflow pages.\n", (u_long)sp->hash_bigpages);
dl("Number of bytes free in overflow pages",
(u_long)sp->hash_big_bfree);
printf(" (%.0f%% ff).\n",
PCT(sp->hash_big_bfree, sp->hash_bigpages, sp->hash_pagesize));
dl("Number of bucket overflow pages.\n", (u_long)sp->hash_overflows);
dl("Number of bytes free in bucket overflow pages",
(u_long)sp->hash_ovfl_free);
printf(" (%.0f%% ff).\n",
PCT(sp->hash_ovfl_free, sp->hash_overflows, sp->hash_pagesize));
dl("Number of duplicate pages.\n", (u_long)sp->hash_dup);
dl("Number of bytes free in duplicate pages",
(u_long)sp->hash_dup_free);
printf(" (%.0f%% ff).\n",
PCT(sp->hash_dup_free, sp->hash_dup, sp->hash_pagesize));
dl("Number of pages on the free list.\n", (u_long)sp->hash_free);
free(sp);
return (0);
}
/*
* queue_stats --
* Display queue statistics.
*/
int
queue_stats(dbenv, dbp, fast)
DB_ENV *dbenv;
DB *dbp;
int fast;
{
DB_QUEUE_STAT *sp;
int ret;
COMPQUIET(dbenv, NULL);
if ((ret = dbp->stat(dbp, &sp, fast)) != 0) {
dbp->err(dbp, ret, "DB->stat");
return (1);
}
printf("%lx\tQueue magic number.\n", (u_long)sp->qs_magic);
printf("%lu\tQueue version number.\n", (u_long)sp->qs_version);
dl("Fixed-length record size.\n", (u_long)sp->qs_re_len);
if (isprint(sp->qs_re_pad) && !isspace(sp->qs_re_pad))
printf("%c\tFixed-length record pad.\n", (int)sp->qs_re_pad);
else
printf("0x%x\tFixed-length record pad.\n", (int)sp->qs_re_pad);
dl("Underlying database page size.\n", (u_long)sp->qs_pagesize);
if (sp->qs_extentsize != 0)
dl("Underlying database extent size.\n",
(u_long)sp->qs_extentsize);
dl("Number of records in the database.\n", (u_long)sp->qs_nkeys);
dl("Number of database pages.\n", (u_long)sp->qs_pages);
dl("Number of bytes free in database pages", (u_long)sp->qs_pgfree);
printf(" (%.0f%% ff).\n",
PCT(sp->qs_pgfree, sp->qs_pages, sp->qs_pagesize));
printf("%lu\tFirst undeleted record.\n", (u_long)sp->qs_first_recno);
printf(
"%lu\tNext available record number.\n", (u_long)sp->qs_cur_recno);
free(sp);
return (0);
}
/*
* lock_stats --
* Display lock statistics.
*/
int
lock_stats(dbenv, internal, flags)
DB_ENV *dbenv;
char *internal;
u_int32_t flags;
{
DB_LOCK_STAT *sp;
int ret;
if (internal != NULL) {
if ((ret =
dbenv->lock_dump_region(dbenv, internal, stdout)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
return (0);
}
if ((ret = dbenv->lock_stat(dbenv, &sp, flags)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
dl("Last allocated locker ID.\n", (u_long)sp->st_id);
dl("Current maximum unused locker ID.\n", (u_long)sp->st_cur_maxid);
dl("Number of lock modes.\n", (u_long)sp->st_nmodes);
dl("Maximum number of locks possible.\n", (u_long)sp->st_maxlocks);
dl("Maximum number of lockers possible.\n", (u_long)sp->st_maxlockers);
dl("Maximum number of lock objects possible.\n",
(u_long)sp->st_maxobjects);
dl("Number of current locks.\n", (u_long)sp->st_nlocks);
dl("Maximum number of locks at any one time.\n",
(u_long)sp->st_maxnlocks);
dl("Number of current lockers.\n", (u_long)sp->st_nlockers);
dl("Maximum number of lockers at any one time.\n",
(u_long)sp->st_maxnlockers);
dl("Number of current lock objects.\n", (u_long)sp->st_nobjects);
dl("Maximum number of lock objects at any one time.\n",
(u_long)sp->st_maxnobjects);
dl("Total number of locks requested.\n", (u_long)sp->st_nrequests);
dl("Total number of locks released.\n", (u_long)sp->st_nreleases);
dl(
"Total number of lock requests failing because DB_LOCK_NOWAIT was set.\n",
(u_long)sp->st_nnowaits);
dl(
"Total number of locks not immediately available due to conflicts.\n",
(u_long)sp->st_nconflicts);
dl("Number of deadlocks.\n", (u_long)sp->st_ndeadlocks);
dl("Lock timeout value.\n", (u_long)sp->st_locktimeout);
dl("Number of locks that have timed out.\n",
(u_long)sp->st_nlocktimeouts);
dl("Transaction timeout value.\n", (u_long)sp->st_txntimeout);
dl("Number of transactions that have timed out.\n",
(u_long)sp->st_ntxntimeouts);
dl_bytes("The size of the lock region.",
(u_long)0, (u_long)0, (u_long)sp->st_regsize);
dl("The number of region locks granted after waiting.\n",
(u_long)sp->st_region_wait);
dl("The number of region locks granted without waiting.\n",
(u_long)sp->st_region_nowait);
free(sp);
return (0);
}
/*
* log_stats --
* Display log statistics.
*/
int
log_stats(dbenv, flags)
DB_ENV *dbenv;
u_int32_t flags;
{
DB_LOG_STAT *sp;
int ret;
if ((ret = dbenv->log_stat(dbenv, &sp, flags)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
printf("%lx\tLog magic number.\n", (u_long)sp->st_magic);
printf("%lu\tLog version number.\n", (u_long)sp->st_version);
dl_bytes("Log record cache size",
(u_long)0, (u_long)0, (u_long)sp->st_lg_bsize);
printf("%#o\tLog file mode.\n", sp->st_mode);
if (sp->st_lg_size % MEGABYTE == 0)
printf("%luMb\tCurrent log file size.\n",
(u_long)sp->st_lg_size / MEGABYTE);
else if (sp->st_lg_size % 1024 == 0)
printf("%luKb\tCurrent log file size.\n",
(u_long)sp->st_lg_size / 1024);
else
printf("%lu\tCurrent log file size.\n",
(u_long)sp->st_lg_size);
dl_bytes("Log bytes written",
(u_long)0, (u_long)sp->st_w_mbytes, (u_long)sp->st_w_bytes);
dl_bytes("Log bytes written since last checkpoint",
(u_long)0, (u_long)sp->st_wc_mbytes, (u_long)sp->st_wc_bytes);
dl("Total log file writes.\n", (u_long)sp->st_wcount);
dl("Total log file write due to overflow.\n",
(u_long)sp->st_wcount_fill);
dl("Total log file flushes.\n", (u_long)sp->st_scount);
printf("%lu\tCurrent log file number.\n", (u_long)sp->st_cur_file);
printf("%lu\tCurrent log file offset.\n", (u_long)sp->st_cur_offset);
printf("%lu\tOn-disk log file number.\n", (u_long)sp->st_disk_file);
printf("%lu\tOn-disk log file offset.\n", (u_long)sp->st_disk_offset);
dl("Max commits in a log flush.\n", (u_long)sp->st_maxcommitperflush);
dl("Min commits in a log flush.\n", (u_long)sp->st_mincommitperflush);
dl_bytes("Log region size",
(u_long)0, (u_long)0, (u_long)sp->st_regsize);
dl("The number of region locks granted after waiting.\n",
(u_long)sp->st_region_wait);
dl("The number of region locks granted without waiting.\n",
(u_long)sp->st_region_nowait);
free(sp);
return (0);
}
/*
* mpool_stats --
* Display mpool statistics.
*/
int
mpool_stats(dbenv, internal, flags)
DB_ENV *dbenv;
char *internal;
u_int32_t flags;
{
DB_MPOOL_FSTAT **fsp;
DB_MPOOL_STAT *gsp;
int ret;
if (internal != NULL) {
if ((ret =
dbenv->memp_dump_region(dbenv, internal, stdout)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
return (0);
}
if ((ret = dbenv->memp_stat(dbenv, &gsp, &fsp, flags)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
dl_bytes("Total cache size",
(u_long)gsp->st_gbytes, (u_long)0, (u_long)gsp->st_bytes);
dl("Number of caches.\n", (u_long)gsp->st_ncache);
dl_bytes("Pool individual cache size",
(u_long)0, (u_long)0, (u_long)gsp->st_regsize);
dl("Requested pages mapped into the process' address space.\n",
(u_long)gsp->st_map);
dl("Requested pages found in the cache", (u_long)gsp->st_cache_hit);
if (gsp->st_cache_hit + gsp->st_cache_miss != 0)
printf(" (%.0f%%)", ((double)gsp->st_cache_hit /
(gsp->st_cache_hit + gsp->st_cache_miss)) * 100);
printf(".\n");
dl("Requested pages not found in the cache.\n",
(u_long)gsp->st_cache_miss);
dl("Pages created in the cache.\n", (u_long)gsp->st_page_create);
dl("Pages read into the cache.\n", (u_long)gsp->st_page_in);
dl("Pages written from the cache to the backing file.\n",
(u_long)gsp->st_page_out);
dl("Clean pages forced from the cache.\n",
(u_long)gsp->st_ro_evict);
dl("Dirty pages forced from the cache.\n",
(u_long)gsp->st_rw_evict);
dl("Dirty pages written by trickle-sync thread.\n",
(u_long)gsp->st_page_trickle);
dl("Current total page count.\n",
(u_long)gsp->st_pages);
dl("Current clean page count.\n",
(u_long)gsp->st_page_clean);
dl("Current dirty page count.\n",
(u_long)gsp->st_page_dirty);
dl("Number of hash buckets used for page location.\n",
(u_long)gsp->st_hash_buckets);
dl("Total number of times hash chains searched for a page.\n",
(u_long)gsp->st_hash_searches);
dl("The longest hash chain searched for a page.\n",
(u_long)gsp->st_hash_longest);
dl("Total number of hash buckets examined for page location.\n",
(u_long)gsp->st_hash_examined);
dl("The number of hash bucket locks granted without waiting.\n",
(u_long)gsp->st_hash_nowait);
dl("The number of hash bucket locks granted after waiting.\n",
(u_long)gsp->st_hash_wait);
dl("The maximum number of times any hash bucket lock was waited for.\n",
(u_long)gsp->st_hash_max_wait);
dl("The number of region locks granted without waiting.\n",
(u_long)gsp->st_region_nowait);
dl("The number of region locks granted after waiting.\n",
(u_long)gsp->st_region_wait);
dl("The number of page allocations.\n",
(u_long)gsp->st_alloc);
dl("The number of hash buckets examined during allocations\n",
(u_long)gsp->st_alloc_buckets);
dl("The max number of hash buckets examined for an allocation\n",
(u_long)gsp->st_alloc_max_buckets);
dl("The number of pages examined during allocations\n",
(u_long)gsp->st_alloc_pages);
dl("The max number of pages examined for an allocation\n",
(u_long)gsp->st_alloc_max_pages);
for (; fsp != NULL && *fsp != NULL; ++fsp) {
printf("%s\n", DB_LINE);
printf("Pool File: %s\n", (*fsp)->file_name);
dl("Page size.\n", (u_long)(*fsp)->st_pagesize);
dl("Requested pages mapped into the process' address space.\n",
(u_long)(*fsp)->st_map);
dl("Requested pages found in the cache",
(u_long)(*fsp)->st_cache_hit);
if ((*fsp)->st_cache_hit + (*fsp)->st_cache_miss != 0)
printf(" (%.0f%%)", ((double)(*fsp)->st_cache_hit /
((*fsp)->st_cache_hit + (*fsp)->st_cache_miss)) *
100);
printf(".\n");
dl("Requested pages not found in the cache.\n",
(u_long)(*fsp)->st_cache_miss);
dl("Pages created in the cache.\n",
(u_long)(*fsp)->st_page_create);
dl("Pages read into the cache.\n",
(u_long)(*fsp)->st_page_in);
dl("Pages written from the cache to the backing file.\n",
(u_long)(*fsp)->st_page_out);
}
free(gsp);
return (0);
}
/*
* rep_stats --
* Display replication statistics.
*/
int
rep_stats(dbenv, flags)
DB_ENV *dbenv;
u_int32_t flags;
{
DB_REP_STAT *sp;
int is_client, ret;
const char *p;
if ((ret = dbenv->rep_stat(dbenv, &sp, flags)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
is_client = 0;
switch (sp->st_status) {
case DB_REP_MASTER:
printf("Environment configured as a replication master.\n");
break;
case DB_REP_CLIENT:
printf("Environment configured as a replication client.\n");
is_client = 1;
break;
case DB_REP_LOGSONLY:
printf("Environment configured as a logs-only replica.\n");
is_client = 1;
break;
default:
printf("Environment not configured for replication.\n");
break;
}
printf("%lu/%lu\t%s\n",
(u_long)sp->st_next_lsn.file, (u_long)sp->st_next_lsn.offset,
is_client ? "Next LSN expected." : "Next LSN to be used.");
p = sp->st_waiting_lsn.file == 0 ?
"Not waiting for any missed log records." :
"LSN of first missed log record being waited for.";
printf("%lu/%lu\t%s\n",
(u_long)sp->st_waiting_lsn.file, (u_long)sp->st_waiting_lsn.offset,
p);
dl("Number of duplicate master conditions detected.\n",
(u_long)sp->st_dupmasters);
if (sp->st_env_id != DB_EID_INVALID)
dl("Current environment ID.\n", (u_long)sp->st_env_id);
else
printf("No current environment ID.\n");
dl("Current environment priority.\n", (u_long)sp->st_env_priority);
dl("Current generation number.\n", (u_long)sp->st_gen);
dl("Number of duplicate log records received.\n",
(u_long)sp->st_log_duplicated);
dl("Number of log records currently queued.\n",
(u_long)sp->st_log_queued);
dl("Maximum number of log records ever queued at once.\n",
(u_long)sp->st_log_queued_max);
dl("Total number of log records queued.\n",
(u_long)sp->st_log_queued_total);
dl("Number of log records received and appended to the log.\n",
(u_long)sp->st_log_records);
dl("Number of log records missed and requested.\n",
(u_long)sp->st_log_requested);
if (sp->st_master != DB_EID_INVALID)
dl("Current master ID.\n", (u_long)sp->st_master);
else
printf("No current master ID.\n");
dl("Number of times the master has changed.\n",
(u_long)sp->st_master_changes);
dl("Number of messages received with a bad generation number.\n",
(u_long)sp->st_msgs_badgen);
dl("Number of messages received and processed.\n",
(u_long)sp->st_msgs_processed);
dl("Number of messages ignored due to pending recovery.\n",
(u_long)sp->st_msgs_recover);
dl("Number of failed message sends.\n",
(u_long)sp->st_msgs_send_failures);
dl("Number of messages sent.\n", (u_long)sp->st_msgs_sent);
dl("Number of new site messages received.\n", (u_long)sp->st_newsites);
dl("Transmission limited.\n", (u_long)sp->st_nthrottles);
dl("Number of outdated conditions detected.\n",
(u_long)sp->st_outdated);
dl("Number of transactions applied.\n", (u_long)sp->st_txns_applied);
dl("Number of elections held.\n", (u_long)sp->st_elections);
dl("Number of elections won.\n", (u_long)sp->st_elections_won);
if (sp->st_election_status == 0)
printf("No election in progress.\n");
else {
dl("Current election phase.\n", (u_long)sp->st_election_status);
dl("Election winner.\n",
(u_long)sp->st_election_cur_winner);
dl("Election generation number.\n",
(u_long)sp->st_election_gen);
printf("%lu/%lu\tMaximum LSN of election winner.\n",
(u_long)sp->st_election_lsn.file,
(u_long)sp->st_election_lsn.offset);
dl("Number of sites expected to participate in elections.\n",
(u_long)sp->st_election_nsites);
dl("Election priority.\n", (u_long)sp->st_election_priority);
dl("Election tiebreaker value.\n",
(u_long)sp->st_election_tiebreaker);
dl("Votes received this election round.\n",
(u_long)sp->st_election_votes);
}
free(sp);
return (0);
}
/*
* txn_stats --
* Display transaction statistics.
*/
int
txn_stats(dbenv, flags)
DB_ENV *dbenv;
u_int32_t flags;
{
DB_TXN_STAT *sp;
u_int32_t i;
int ret;
const char *p;
if ((ret = dbenv->txn_stat(dbenv, &sp, flags)) != 0) {
dbenv->err(dbenv, ret, NULL);
return (1);
}
p = sp->st_last_ckp.file == 0 ?
"No checkpoint LSN." : "File/offset for last checkpoint LSN.";
printf("%lu/%lu\t%s\n",
(u_long)sp->st_last_ckp.file, (u_long)sp->st_last_ckp.offset, p);
if (sp->st_time_ckp == 0)
printf("0\tNo checkpoint timestamp.\n");
else
printf("%.24s\tCheckpoint timestamp.\n",
ctime(&sp->st_time_ckp));
printf("%lx\tLast transaction ID allocated.\n",
(u_long)sp->st_last_txnid);
dl("Maximum number of active transactions possible.\n",
(u_long)sp->st_maxtxns);
dl("Active transactions.\n", (u_long)sp->st_nactive);
dl("Maximum active transactions.\n", (u_long)sp->st_maxnactive);
dl("Number of transactions begun.\n", (u_long)sp->st_nbegins);
dl("Number of transactions aborted.\n", (u_long)sp->st_naborts);
dl("Number of transactions committed.\n", (u_long)sp->st_ncommits);
dl("Number of transactions restored.\n", (u_long)sp->st_nrestores);
dl_bytes("Transaction region size",
(u_long)0, (u_long)0, (u_long)sp->st_regsize);
dl("The number of region locks granted after waiting.\n",
(u_long)sp->st_region_wait);
dl("The number of region locks granted without waiting.\n",
(u_long)sp->st_region_nowait);
qsort(sp->st_txnarray,
sp->st_nactive, sizeof(sp->st_txnarray[0]), txn_compare);
for (i = 0; i < sp->st_nactive; ++i) {
printf("\tid: %lx; begin LSN: file/offset %lu/%lu",
(u_long)sp->st_txnarray[i].txnid,
(u_long)sp->st_txnarray[i].lsn.file,
(u_long)sp->st_txnarray[i].lsn.offset);
if (sp->st_txnarray[i].parentid == 0)
printf("\n");
else
printf(" parent: %lx\n",
(u_long)sp->st_txnarray[i].parentid);
}
free(sp);
return (0);
}
int
txn_compare(a1, b1)
const void *a1, *b1;
{
const DB_TXN_ACTIVE *a, *b;
a = a1;
b = b1;
if (a->txnid > b->txnid)
return (1);
if (a->txnid < b->txnid)
return (-1);
return (0);
}
/*
* dl --
* Display a big value.
*/
void
dl(msg, value)
const char *msg;
u_long value;
{
/*
* Two formats: if less than 10 million, display as the number, if
* greater than 10 million display as ###M.
*/
if (value < 10000000)
printf("%lu\t%s", value, msg);
else
printf("%luM\t%s", value / 1000000, msg);
}
/*
* dl_bytes --
* Display a big number of bytes.
*/
void
dl_bytes(msg, gbytes, mbytes, bytes)
const char *msg;
u_long gbytes, mbytes, bytes;
{
const char *sep;
/* Normalize the values. */
while (bytes >= MEGABYTE) {
++mbytes;
bytes -= MEGABYTE;
}
while (mbytes >= GIGABYTE / MEGABYTE) {
++gbytes;
mbytes -= GIGABYTE / MEGABYTE;
}
sep = "";
if (gbytes > 0) {
printf("%luGB", gbytes);
sep = " ";
}
if (mbytes > 0) {
printf("%s%luMB", sep, mbytes);
sep = " ";
}
if (bytes >= 1024) {
printf("%s%luKB", sep, bytes / 1024);
bytes %= 1024;
sep = " ";
}
if (bytes > 0)
printf("%s%luB", sep, bytes);
printf("\t%s.\n", msg);
}
/*
* prflags --
* Print out flag values.
*/
void
prflags(flags, fnp)
u_int32_t flags;
const FN *fnp;
{
const char *sep;
sep = "\t";
printf("Flags:");
for (; fnp->mask != 0; ++fnp)
if (fnp->mask & flags) {
printf("%s%s", sep, fnp->name);
sep = ", ";
}
printf("\n");
}
/*
* db_init --
* Initialize the environment.
*/
int
db_init(dbenv, home, ttype, cache, is_private)
DB_ENV *dbenv;
char *home;
test_t ttype;
u_int32_t cache;
int *is_private;
{
u_int32_t oflags;
int ret;
/*
* If our environment open fails, and we're trying to look at a
* shared region, it's a hard failure.
*
* We will probably just drop core if the environment we join does
* not include a memory pool. This is probably acceptable; trying
* to use an existing environment that does not contain a memory
* pool to look at a database can be safely construed as operator
* error, I think.
*/
*is_private = 0;
if ((ret =
dbenv->open(dbenv, home, DB_JOINENV | DB_USE_ENVIRON, 0)) == 0)
return (0);
if (ttype != T_DB && ttype != T_LOG) {
dbenv->err(dbenv, ret, "DB_ENV->open%s%s",
home == NULL ? "" : ": ", home == NULL ? "" : home);
return (1);
}
/*
* We're looking at a database or set of log files and no environment
* exists. Create one, but make it private so no files are actually
* created. Declare a reasonably large cache so that we don't fail
* when reporting statistics on large databases.
*
* An environment is required to look at databases because we may be
* trying to look at databases in directories other than the current
* one.
*/
if ((ret = dbenv->set_cachesize(dbenv, 0, cache, 1)) != 0) {
dbenv->err(dbenv, ret, "set_cachesize");
return (1);
}
*is_private = 1;
oflags = DB_CREATE | DB_PRIVATE | DB_USE_ENVIRON;
if (ttype == T_DB)
oflags |= DB_INIT_MPOOL;
if (ttype == T_LOG)
oflags |= DB_INIT_LOG;
if ((ret = dbenv->open(dbenv, home, oflags, 0)) == 0)
return (0);
/* An environment is required. */
dbenv->err(dbenv, ret, "open");
return (1);
}
/*
* argcheck --
* Return if argument flags are okay.
*/
int
argcheck(arg, ok_args)
char *arg;
const char *ok_args;
{
for (; *arg != '\0'; ++arg)
if (strchr(ok_args, *arg) == NULL)
return (0);
return (1);
}
int
usage()
{
fprintf(stderr, "%s\n\t%s\n",
"usage: db_stat [-celmNrtVZ] [-C Aclmop]",
"[-d file [-f] [-s database]] [-h home] [-M Ahlm] [-P password]");
return (EXIT_FAILURE);
}
int
version_check(progname)
const char *progname;
{
int v_major, v_minor, v_patch;
/* Make sure we're loaded with the right version of the DB library. */
(void)db_version(&v_major, &v_minor, &v_patch);
if (v_major != DB_VERSION_MAJOR ||
v_minor != DB_VERSION_MINOR || v_patch != DB_VERSION_PATCH) {
fprintf(stderr,
"%s: version %d.%d.%d doesn't match library version %d.%d.%d\n",
progname, DB_VERSION_MAJOR, DB_VERSION_MINOR,
DB_VERSION_PATCH, v_major, v_minor, v_patch);
return (EXIT_FAILURE);
}
return (0);
}
View Git Blame Copy Permalink