mirror of
https://sourceware.org/git/glibc.git
synced 2025-07-28 00:21:52 +03:00
Update.
1997-08-10 19:17 Philip Blundell <Philip.Blundell@pobox.com> * nss/nss_db/db-XXX.c: Include <db_185.h> not <db.h>. Somebody should update this to use the new db API. * nss/nss_db/db-netgrp.c: Likewise. * nss/nss_db/db-alias.c: Likewise. * db2/Makefile: Makefile for db-2.x in glibc. 1997-08-27 21:20 Ulrich Drepper <drepper@cygnus.com> * csu/Makefile (before-compile): New goal. Make sure abi-tag.h is generated. [$(elf)=yes] (asm-CPPFLAGS): Make sure abi-tag.h file can be found. * Makeconfig [$(build-omitfp)=yes] (CFLAGS-.o): Add -D__USE_STRING_INLINES. * string/string.f: Move strnlen optimization after inclusion of <bits/string.h>. Include <bits/string.h> only if __USE_STRING_INLINES is defined. * sysdeps/generic/memcpy.c: Undef memcpy to allow macro of this name in <bits/string.h>. * sysdeps/generic/memset.c: Likewise. * sysdeps/i386/string.h: i386 optimized string functions. * sysdeps/i386/i486string.h: i486+ optimized string functions. * Makefile (subdirs): Change db to db2. * shlib-versions: Bump libdb verion number to 3. * include/db.h: Include from db2 directory. * include/db_185.h: New file. * sysdeps/i386/Makefile [$(subdirs)=db2] (CPPFLAGS): Add macros to provide spinlock information for db2. * sysdeps/m68k/m68020/Makefile: New file. Likewise. * sysdeps/sparc/Makefile: New file. Likewise. * sysdeps/unix/sysv/linux/Makefile [$(subdirs)=db2] (CPPFLAGS): Add -DHAVE_LLSEEK. * db2/config.h: Hand-edited config file for db2 in glibc. * db2/compat.h: New file from db-2.3.4. * db2/db.h: Likewise. * db2/db_185.h: Likewise. * db2/db_int.h: Likewise. * db2/makedb.c: Likewise. * db2/btree/bt_close.c: Likewise. * db2/btree/bt_compare.c: Likewise. * db2/btree/bt_conv.c: Likewise. * db2/btree/bt_cursor.c: Likewise. * db2/btree/bt_delete.c: Likewise. * db2/btree/bt_open.c: Likewise. * db2/btree/bt_page.c: Likewise. * db2/btree/bt_put.c: Likewise. * db2/btree/bt_rec.c: Likewise. * db2/btree/bt_recno.c: Likewise. * db2/btree/btree_auto.c: Likewise. * db2/btree/bt_rsearch.c: Likewise. * db2/btree/bt_search.c: Likewise. * db2/btree/bt_split.c: Likewise. * db2/btree/bt_stat.c: Likewise. * db2/btree/btree.src: Likewise. * db2/common/db_appinit.c: Likewise. * db2/common/db_err.c: Likewise. * db2/common/db_byteorder.c: Likewise. * db2/common/db_apprec.c: Likewise. * db2/common/db_salloc.c: Likewise. * db2/common/db_log2.c: Likewise. * db2/common/db_region.c: Likewise. * db2/common/db_shash.c: Likewise. * db2/db/db.c: Likewise. * db2/db/db.src: Likewise. * db2/db/db_conv.c: Likewise. * db2/db/db_dispatch.c: Likewise. * db2/db/db_dup.c: Likewise. * db2/db/db_overflow.c: Likewise. * db2/db/db_pr.c: Likewise. * db2/db/db_rec.c: Likewise. * db2/db/db_ret.c: Likewise. * db2/db/db_thread.c: Likewise. * db2/db/db_auto.c: Likewise. * db2/db185/db185.c: Likewise. * db2/db185/db185_int.h: Likewise. * db2/dbm/dbm.c: Likewise. * db2/hash/hash.c: Likewise. * db2/hash/hash.src: Likewise. * db2/hash/hash_page.c: Likewise. * db2/hash/hash_conv.c: Likewise. * db2/hash/hash_debug.c: Likewise. * db2/hash/hash_stat.c: Likewise. * db2/hash/hash_rec.c: Likewise. * db2/hash/hash_dup.c: Likewise. * db2/hash/hash_func.c: Likewise. * db2/hash/hash_auto.c: Likewise. * db2/include/mp.h: Likewise. * db2/include/btree.h: Likewise. * db2/include/db.h.src: Likewise. * db2/include/db_int.h.src: Likewise. * db2/include/db_shash.h: Likewise. * db2/include/db_swap.h: Likewise. * db2/include/db_185.h.src: Likewise. * db2/include/txn.h: Likewise. * db2/include/db_am.h: Likewise. * db2/include/shqueue.h: Likewise. * db2/include/hash.h: Likewise. * db2/include/db_dispatch.h: Likewise. * db2/include/lock.h: Likewise. * db2/include/db_page.h: Likewise. * db2/include/log.h: Likewise. * db2/include/db_auto.h: Likewise. * db2/include/btree_auto.h: Likewise. * db2/include/hash_auto.h: Likewise. * db2/include/log_auto.h: Likewise. * db2/include/txn_auto.h: Likewise. * db2/include/db_ext.h: Likewise. * db2/include/btree_ext.h: Likewise. * db2/include/clib_ext.h: Likewise. * db2/include/common_ext.h: Likewise. * db2/include/hash_ext.h: Likewise. * db2/include/lock_ext.h: Likewise. * db2/include/log_ext.h: Likewise. * db2/include/mp_ext.h: Likewise. * db2/include/mutex_ext.h: Likewise. * db2/include/os_ext.h: Likewise. * db2/include/txn_ext.h: Likewise. * db2/include/cxx_int.h: Likewise. * db2/include/db_cxx.h: Likewise. * db2/include/queue.h: Likewise. * db2/lock/lock.c: Likewise. * db2/lock/lock_conflict.c: Likewise. * db2/lock/lock_util.c: Likewise. * db2/lock/lock_deadlock.c: Likewise. * db2/log/log.c: Likewise. * db2/log/log_get.c: Likewise. * db2/log/log.src: Likewise. * db2/log/log_compare.c: Likewise. * db2/log/log_put.c: Likewise. * db2/log/log_rec.c: Likewise. * db2/log/log_archive.c: Likewise. * db2/log/log_register.c: Likewise. * db2/log/log_auto.c: Likewise. * db2/log/log_findckp.c: Likewise. * db2/mp/mp_bh.c: Likewise. * db2/mp/mp_fget.c: Likewise. * db2/mp/mp_fopen.c: Likewise. * db2/mp/mp_fput.c: Likewise. * db2/mp/mp_fset.c: Likewise. * db2/mp/mp_open.c: Likewise. * db2/mp/mp_region.c: Likewise. * db2/mp/mp_pr.c: Likewise. * db2/mp/mp_sync.c: Likewise. * db2/mutex/68020.gcc: Likewise. * db2/mutex/mutex.c: Likewise. * db2/mutex/README: Likewise. * db2/mutex/x86.gcc: Likewise. * db2/mutex/sparc.gcc: Likewise. * db2/mutex/uts4.cc.s: Likewise. * db2/mutex/alpha.dec: Likewise. * db2/mutex/alpha.gcc: Likewise. * db2/mutex/parisc.gcc: Likewise. * db2/mutex/parisc.hp: Likewise. * db2/os/db_os_abs.c: Likewise. * db2/os/db_os_dir.c: Likewise. * db2/os/db_os_fid.c: Likewise. * db2/os/db_os_lseek.c: Likewise. * db2/os/db_os_mmap.c: Likewise. * db2/os/db_os_open.c: Likewise. * db2/os/db_os_rw.c: Likewise. * db2/os/db_os_sleep.c: Likewise. * db2/os/db_os_stat.c: Likewise. * db2/os/db_os_unlink.c: Likewise. * db2/txn/txn.c: Likewise. * db2/txn/txn.src: Likewise. * db2/txn/txn_rec.c: Likewise. * db2/txn/txn_auto.c: Likewise. * db2/clib/getlong.c: Likewise. * db2/progs/db_archive/db_archive.c: Likewise. * db2/progs/db_checkpoint/db_checkpoint.c: Likewise. * db2/progs/db_deadlock/db_deadlock.c: Likewise. * db2/progs/db_dump/db_dump.c: Likewise. * db2/progs/db_dump185/db_dump185.c: Likewise. * db2/progs/db_load/db_load.c: Likewise. * db2/progs/db_printlog/db_printlog.c: Likewise. * db2/progs/db_recover/db_recover.c: Likewise. * db2/progs/db_stat/db_stat.c: Likewise. * libio/stdio.h [__cplusplus] (__STDIO_INLINE): Define as inline. * po/de.po, po/sv.po: Update from 2.0.5 translations. * sysdeps/unix/sysv/linux/netinet/tcp.h: Pretty print. * sunrpc/rpc/xdr.h (XDR): Don't define argument of x_destroy callback as const. * sunrpc/xdr_mem.c (xdrmem_destroy): Don't define argument as const. * sunrpx/xdr_rec.c (xdrrec_destroy): Likewise. * sunrpx/xdr_stdio.c (xdrstdio_destroy): Likewise. 1997-08-27 18:47 Ulrich Drepper <drepper@cygnus.com> * sysdeps/unix/sysv/linux/if_index.c: Include <errno.h>. Reported by Benjamin Kosnik <bkoz@cygnus.com>. 1997-08-27 02:27 Roland McGrath <roland@baalperazim.frob.com> * abi-tags: New file. * csu/Makefile (distribute): Remove abi-tag.h. ($(objpfx)abi-tag.h): New target. * Makefile (distribute): Add abi-tags. * sysdeps/unix/sysv/linux/abi-tag.h: File removed. * sysdeps/mach/hurd/abi-tag.h: File removed. * sysdeps/stub/abi-tag.h: File removed. 1997-08-25 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * sysdeps/unix/make-syscalls.sh: Change output so that it generates compilation rules only for the currently selected object suffixes. 1997-08-25 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * sysdeps/m68k/dl-machine.h (RTLD_START): Switch back to previous section to avoid confusing the compiler. * sysdeps/alpha/dl-machine.h (RTLD_START): Likewise. * sysdeps/i386/dl-machine.h (RTLD_START): Likewise. * sysdeps/mips/dl-machine.h (RTLD_START): Likewise. * sysdeps/mips/mips64/dl-machine.h (RTLD_START): Likewise. * sysdeps/sparc/sparc32/dl-machine.h (RTLD_START): Likewise. * sysdeps/m68k/dl-machine.h (elf_machine_load_address): Use a GOT relocation instead of a constant to avoid text relocation. (ELF_MACHINE_BEFORE_RTLD_RELOC): Removed. (RTLD_START): Declare global labels as functions and add size directive. 1997-08-25 17:01 Ulrich Drepper <drepper@cygnus.com> * sysdeps/i386/bits/select.h: Correct assembler versions to work even for descriptors >= 32. * stdlib/alloca.h: Don't define alloca to __alloca since if gcc is used __alloca is not defined to __builtin_alloca and so might not be available. Reported by Uwe Ohse <uwe@ohse.de>. * sysdeps/unix/sysv/linux/sys/sysmacros.h: Define macros in a special way if gcc is not used and so dev_t is an array. Reported by Uwe Ohse <uwe@ohse.de>. 1997-08-23 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * manual/libc.texinfo: Reorder chapters to match logical order. 1997-08-25 12:22 Ulrich Drepper <drepper@cygnus.com> * sunrpc/rpc/xdr.h: Change name of parameters in prototypes of xdr_reference, xdrmem_create, and xdrstdio_create because of clash with g++ internal symbols. Patch by Sudish Joseph <sj@eng.mindspring.net>. * elf/dl-deps.c: Implement handling of DT_FILTER.
This commit is contained in:
Ulrich Drepper
434
db2/progs/db_stat/db_stat.c
Normal file
434
db2/progs/db_stat/db_stat.c
Normal file
@ -0,0 +1,434 @@
|
||||
/*-
|
||||
* See the file LICENSE for redistribution information.
|
||||
*
|
||||
* Copyright (c) 1996, 1997
|
||||
* Sleepycat Software. All rights reserved.
|
||||
*/
|
||||
|
||||
#include "config.h"
|
||||
|
||||
#ifndef lint
|
||||
static const char copyright[] =
|
||||
"@(#) Copyright (c) 1997\n\
|
||||
Sleepycat Software Inc. All rights reserved.\n";
|
||||
static const char sccsid[] = "@(#)db_stat.c 8.17 (Sleepycat) 8/24/97";
|
||||
#endif
|
||||
|
||||
#ifndef NO_SYSTEM_INCLUDES
|
||||
#include <sys/types.h>
|
||||
|
||||
#include <ctype.h>
|
||||
#include <errno.h>
|
||||
#include <signal.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include <unistd.h>
|
||||
#endif
|
||||
|
||||
#include "db_int.h"
|
||||
#include "clib_ext.h"
|
||||
|
||||
#define DIVIDER "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-="
|
||||
|
||||
typedef enum { T_NOTSET, T_DB, T_MPOOL, T_TXN } test_t;
|
||||
|
||||
void bstat __P((DB *));
|
||||
DB_ENV *db_init __P((char *, test_t));
|
||||
void hstat __P((DB *));
|
||||
void mstat __P((DB_ENV *));
|
||||
void prflags __P((u_int32_t, const FN *));
|
||||
void onint __P((int));
|
||||
void tstat __P((DB_ENV *));
|
||||
int txn_compare __P((const void *, const void *));
|
||||
void usage __P((void));
|
||||
int main __P((int, char *[]));
|
||||
|
||||
int interrupted;
|
||||
const char *progname = "db_stat"; /* Program name. */
|
||||
|
||||
int
|
||||
main(argc, argv)
|
||||
int argc;
|
||||
char *argv[];
|
||||
{
|
||||
extern char *optarg;
|
||||
extern int optind;
|
||||
DB *dbp;
|
||||
DB_ENV *dbenv;
|
||||
test_t ttype;
|
||||
int ch;
|
||||
char *db, *home;
|
||||
|
||||
ttype = T_NOTSET;
|
||||
db = home = NULL;
|
||||
while ((ch = getopt(argc, argv, "d:h:mt")) != EOF)
|
||||
switch (ch) {
|
||||
case 'd':
|
||||
db = optarg;
|
||||
ttype = T_DB;
|
||||
break;
|
||||
case 'h':
|
||||
home = optarg;
|
||||
break;
|
||||
case 'm':
|
||||
ttype = T_MPOOL;
|
||||
break;
|
||||
case 't':
|
||||
ttype = T_TXN;
|
||||
break;
|
||||
case '?':
|
||||
default:
|
||||
usage();
|
||||
}
|
||||
argc -= optind;
|
||||
argv += optind;
|
||||
|
||||
if (argc != 0 || ttype == T_NOTSET)
|
||||
usage();
|
||||
|
||||
dbenv = db_init(home, ttype);
|
||||
|
||||
(void)signal(SIGINT, onint);
|
||||
|
||||
switch (ttype) {
|
||||
case T_DB:
|
||||
if ((errno = db_open(db, DB_UNKNOWN,
|
||||
DB_RDONLY, 0, dbenv, NULL, &dbp)) != 0)
|
||||
return (1);
|
||||
switch (dbp->type) {
|
||||
case DB_BTREE:
|
||||
case DB_RECNO:
|
||||
bstat(dbp);
|
||||
break;
|
||||
case DB_HASH:
|
||||
hstat(dbp);
|
||||
break;
|
||||
case DB_UNKNOWN:
|
||||
abort(); /* Impossible. */
|
||||
/* NOTREACHED */
|
||||
}
|
||||
(void)dbp->close(dbp, 0);
|
||||
break;
|
||||
case T_MPOOL:
|
||||
mstat(dbenv);
|
||||
break;
|
||||
case T_TXN:
|
||||
tstat(dbenv);
|
||||
break;
|
||||
case T_NOTSET:
|
||||
abort(); /* Impossible. */
|
||||
/* NOTREACHED */
|
||||
}
|
||||
|
||||
(void)db_appexit(dbenv);
|
||||
|
||||
if (interrupted) {
|
||||
(void)signal(SIGINT, SIG_DFL);
|
||||
(void)raise(SIGINT);
|
||||
/* NOTREACHED */
|
||||
}
|
||||
return (0);
|
||||
}
|
||||
|
||||
/*
|
||||
* bstat --
|
||||
* Display btree/recno statistics.
|
||||
*/
|
||||
void
|
||||
bstat(dbp)
|
||||
DB *dbp;
|
||||
{
|
||||
static const FN fn[] = {
|
||||
{ DB_DUP, "DB_DUP" },
|
||||
{ DB_FIXEDLEN, "DB_FIXEDLEN" },
|
||||
{ DB_RECNUM, "DB_RECNUM" },
|
||||
{ DB_RENUMBER, "DB_RENUMBER" },
|
||||
{ 0 }
|
||||
};
|
||||
DB_BTREE_STAT *sp;
|
||||
|
||||
if (dbp->stat(dbp, &sp, NULL, 0))
|
||||
err(1, "dbp->stat");
|
||||
|
||||
#define PCT(f, t) \
|
||||
(t == 0 ? 0 : \
|
||||
(((double)((t * sp->bt_pagesize) - f) / (t * sp->bt_pagesize)) * 100))
|
||||
|
||||
prflags(sp->bt_flags, fn);
|
||||
if (dbp->type == DB_BTREE) {
|
||||
#ifdef NOT_IMPLEMENTED
|
||||
printf("%lu\tMaximum keys per-page.\n", (u_long)sp->bt_maxkey);
|
||||
#endif
|
||||
printf("%lu\tMinimum keys per-page.\n", (u_long)sp->bt_minkey);
|
||||
}
|
||||
if (dbp->type == DB_RECNO) {
|
||||
printf("%lu\tFixed-length record size.\n",
|
||||
(u_long)sp->bt_re_len);
|
||||
if (isprint(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);
|
||||
}
|
||||
printf("%lu\tUnderlying tree page size.\n", (u_long)sp->bt_pagesize);
|
||||
printf("%lu\tNumber of levels in the tree.\n", (u_long)sp->bt_levels);
|
||||
printf("%lu\tNumber of keys in the tree.\n", (u_long)sp->bt_nrecs);
|
||||
printf("%lu\tNumber of tree internal pages.\n", (u_long)sp->bt_int_pg);
|
||||
printf("%lu\tNumber of tree leaf pages.\n", (u_long)sp->bt_leaf_pg);
|
||||
printf("%lu\tNumber of tree duplicate pages.\n",
|
||||
(u_long)sp->bt_dup_pg);
|
||||
printf("%lu\tNumber of tree overflow pages.\n",
|
||||
(u_long)sp->bt_over_pg);
|
||||
printf("%lu\tNumber of pages on the free list.\n",
|
||||
(u_long)sp->bt_free);
|
||||
printf("%lu\tNumber of pages freed for reuse.\n",
|
||||
(u_long)sp->bt_freed);
|
||||
printf("%lu\tNumber of bytes free in tree internal pages (%.0f%% ff)\n",
|
||||
(u_long)sp->bt_int_pgfree,
|
||||
PCT(sp->bt_int_pgfree, sp->bt_int_pg));
|
||||
printf("%lu\tNumber of bytes free in tree leaf pages (%.0f%% ff).\n",
|
||||
(u_long)sp->bt_leaf_pgfree,
|
||||
PCT(sp->bt_leaf_pgfree, sp->bt_leaf_pg));
|
||||
printf("%lu\tNumber of bytes free in tree duplicate pages (%.0f%% ff).\n",
|
||||
(u_long)sp->bt_dup_pgfree,
|
||||
PCT(sp->bt_dup_pgfree, sp->bt_dup_pg));
|
||||
printf("%lu\tNumber of bytes free in tree overflow pages (%.0f%% ff).\n",
|
||||
(u_long)sp->bt_over_pgfree,
|
||||
PCT(sp->bt_over_pgfree, sp->bt_over_pg));
|
||||
printf("%lu\tNumber of bytes saved by prefix compression.\n",
|
||||
(u_long)sp->bt_pfxsaved);
|
||||
printf("%lu\tTotal number of tree page splits.\n",
|
||||
(u_long)sp->bt_split);
|
||||
printf("%lu\tNumber of root page splits.\n", (u_long)sp->bt_rootsplit);
|
||||
printf("%lu\tNumber of fast splits.\n", (u_long)sp->bt_fastsplit);
|
||||
printf("%lu\tNumber of hits in tree fast-insert code.\n",
|
||||
(u_long)sp->bt_cache_hit);
|
||||
printf("%lu\tNumber of misses in tree fast-insert code.\n",
|
||||
(u_long)sp->bt_cache_miss);
|
||||
printf("%lu\tNumber of keys added.\n", (u_long)sp->bt_added);
|
||||
printf("%lu\tNumber of keys deleted.\n", (u_long)sp->bt_deleted);
|
||||
}
|
||||
|
||||
/*
|
||||
* hstat --
|
||||
* Display hash statistics.
|
||||
*/
|
||||
void
|
||||
hstat(dbp)
|
||||
DB *dbp;
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
/*
|
||||
* mstat --
|
||||
* Display mpool statistics.
|
||||
*/
|
||||
void
|
||||
mstat(dbenv)
|
||||
DB_ENV *dbenv;
|
||||
{
|
||||
DB_MPOOL_FSTAT **fsp;
|
||||
DB_MPOOL_STAT *gsp;
|
||||
|
||||
if (memp_stat(dbenv->mp_info, &gsp, &fsp, NULL))
|
||||
err(1, NULL);
|
||||
|
||||
printf("%lu\tCache size (%luK).\n",
|
||||
(u_long)gsp->st_cachesize, (u_long)gsp->st_cachesize / 1024);
|
||||
printf("%lu\tRequested pages found in the cache", 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");
|
||||
printf("%lu\tRequested pages mapped into the process' address space.\n",
|
||||
gsp->st_map);
|
||||
printf("%lu\tRequested pages not found in the cache.\n",
|
||||
gsp->st_cache_miss);
|
||||
printf("%lu\tPages created in the cache.\n", gsp->st_page_create);
|
||||
printf("%lu\tPages read into the cache.\n", gsp->st_page_in);
|
||||
printf("%lu\tPages written from the cache to the backing file.\n",
|
||||
gsp->st_page_out);
|
||||
printf("%lu\tRead-only pages forced from the cache.\n",
|
||||
gsp->st_ro_evict);
|
||||
printf("%lu\tRead-write pages forced from the cache.\n",
|
||||
gsp->st_rw_evict);
|
||||
printf("%lu\tNumber of hash buckets used for page location.\n",
|
||||
gsp->st_hash_buckets);
|
||||
printf("%lu\tTotal number of times hash chains searched for a page.\n",
|
||||
gsp->st_hash_searches);
|
||||
printf("%lu\tThe longest hash chain searched for a page.\n",
|
||||
gsp->st_hash_longest);
|
||||
printf(
|
||||
"%lu\tTotal number of hash buckets examined for page location.\n",
|
||||
gsp->st_hash_examined);
|
||||
|
||||
for (; fsp != NULL && *fsp != NULL; ++fsp) {
|
||||
printf("%s\n", DIVIDER);
|
||||
printf("%s\n", (*fsp)->file_name);
|
||||
printf("%lu\tPage size.\n", (u_long)(*fsp)->st_pagesize);
|
||||
printf("%lu\tRequested pages found in the cache",
|
||||
(*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");
|
||||
printf("%lu\tRequested pages mapped into the process' address space.\n",
|
||||
(*fsp)->st_map);
|
||||
printf("%lu\tRequested pages not found in the cache.\n",
|
||||
(*fsp)->st_cache_miss);
|
||||
printf("%lu\tPages created in the cache.\n",
|
||||
(*fsp)->st_page_create);
|
||||
printf("%lu\tPages read into the cache.\n", (*fsp)->st_page_in);
|
||||
printf("%lu\tPages written from the cache to the backing file.\n",
|
||||
(*fsp)->st_page_out);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* tstat --
|
||||
* Display transaction statistics.
|
||||
*/
|
||||
void
|
||||
tstat(dbenv)
|
||||
DB_ENV *dbenv;
|
||||
{
|
||||
DB_TXN_STAT *tstat;
|
||||
unsigned int i;
|
||||
const char *p;
|
||||
|
||||
if (txn_stat(dbenv->tx_info, &tstat, NULL))
|
||||
err(1, NULL);
|
||||
|
||||
p = tstat->st_last_ckp.file == 0 ?
|
||||
"No checkpoint LSN." : "File/offset for last checkpoint LSN.";
|
||||
printf("%lu/%lu\t%s\n", (u_long)tstat->st_last_ckp.file,
|
||||
(u_long)tstat->st_last_ckp.offset, p);
|
||||
p = tstat->st_pending_ckp.file == 0 ?
|
||||
"No pending checkpoint LSN." :
|
||||
"File/offset for last pending checkpoint LSN.";
|
||||
printf("%lu/%lu\t%s.\n",
|
||||
(u_long)tstat->st_pending_ckp.file,
|
||||
(u_long)tstat->st_pending_ckp.offset, p);
|
||||
if (tstat->st_time_ckp == 0)
|
||||
printf("0\tNo checkpoint timestamp.\n");
|
||||
else
|
||||
printf("%.24s\tCheckpoint timestamp.\n",
|
||||
ctime(&tstat->st_time_ckp));
|
||||
printf("%lx\tLast transaction ID allocated.\n",
|
||||
(u_long)tstat->st_last_txnid);
|
||||
printf("%lu\tMaximum number of active transactions.\n",
|
||||
(u_long)tstat->st_maxtxns);
|
||||
printf("%lu\tNumber of transactions begun.\n",
|
||||
(u_long)tstat->st_nbegins);
|
||||
printf("%lu\tNumber of transactions aborted.\n",
|
||||
(u_long)tstat->st_naborts);
|
||||
printf("%lu\tNumber of transactions committed.\n",
|
||||
(u_long)tstat->st_ncommits);
|
||||
printf("%lu\tActive transactions.\n", (u_long)tstat->st_nactive);
|
||||
qsort(tstat->st_txnarray,
|
||||
tstat->st_nactive, sizeof(tstat->st_txnarray[0]), txn_compare);
|
||||
for (i = 0; i < tstat->st_nactive; ++i)
|
||||
printf("\tid: %lx; initial LSN file/offest %lu/%lu\n",
|
||||
(u_long)tstat->st_txnarray[i].txnid,
|
||||
(u_long)tstat->st_txnarray[i].lsn.file,
|
||||
(u_long)tstat->st_txnarray[i].lsn.offset);
|
||||
}
|
||||
|
||||
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);
|
||||
}
|
||||
|
||||
/*
|
||||
* prflags --
|
||||
* Print out flag values.
|
||||
*/
|
||||
void
|
||||
prflags(flags, fn)
|
||||
u_int32_t flags;
|
||||
FN const *fn;
|
||||
{
|
||||
const FN *fnp;
|
||||
int found;
|
||||
const char *sep;
|
||||
|
||||
sep = " ";
|
||||
printf("Flags:");
|
||||
for (found = 0, fnp = fn; fnp->mask != 0; ++fnp)
|
||||
if (fnp->mask & flags) {
|
||||
printf("%s%s", sep, fnp->name);
|
||||
sep = ", ";
|
||||
found = 1;
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
/*
|
||||
* db_init --
|
||||
* Initialize the environment.
|
||||
*/
|
||||
DB_ENV *
|
||||
db_init(home, ttype)
|
||||
char *home;
|
||||
test_t ttype;
|
||||
{
|
||||
DB_ENV *dbenv;
|
||||
int flags;
|
||||
|
||||
flags = DB_USE_ENVIRON;
|
||||
switch (ttype) {
|
||||
case T_MPOOL:
|
||||
flags |= DB_INIT_MPOOL;
|
||||
break;
|
||||
case T_TXN:
|
||||
flags |= DB_INIT_TXN;
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
if ((dbenv = (DB_ENV *)calloc(sizeof(DB_ENV), 1)) == NULL) {
|
||||
errno = ENOMEM;
|
||||
err(1, NULL);
|
||||
}
|
||||
dbenv->db_errfile = stderr;
|
||||
dbenv->db_errpfx = progname;
|
||||
|
||||
if ((errno = db_appinit(home, NULL, dbenv, flags)) != 0)
|
||||
err(1, "db_appinit");
|
||||
return (dbenv);
|
||||
}
|
||||
|
||||
/*
|
||||
* oninit --
|
||||
* Interrupt signal handler.
|
||||
*/
|
||||
void
|
||||
onint(signo)
|
||||
int signo;
|
||||
{
|
||||
signo = 1; /* XXX: Shut the compiler up. */
|
||||
interrupted = 1;
|
||||
}
|
||||
|
||||
void
|
||||
usage()
|
||||
{
|
||||
fprintf(stderr, "usage: db_stat [-mt] [-d file] [-h home]\n");
|
||||
exit (1);
|
||||
}
|
||||
Reference in New Issue
Block a user