⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ex_tpcb.c

📁 File system using stacked.
💻 C
📖 第 1 页 / 共 2 页
字号:
/*- * See the file LICENSE for redistribution information. * * Copyright (c) 1997-2002 *	Sleepycat Software.  All rights reserved. * * $Id: ex_tpcb.c,v 1.1.1.1 2004/08/19 23:53:56 gopalan Exp $ */#include <sys/types.h>#include <errno.h>#include <stdlib.h>#include <string.h>#include <time.h>#ifdef _WIN32extern int getopt(int, char * const *, const char *);#else#include <unistd.h>#endif#include <db.h>typedef enum { ACCOUNT, BRANCH, TELLER } FTYPE;DB_ENV	 *db_init __P((const char *, const char *, int, int, u_int32_t));int	  hpopulate __P((DB *, int, int, int, int));int	  populate __P((DB *, u_int32_t, u_int32_t, int, const char *));u_int32_t random_id __P((FTYPE, int, int, int));u_int32_t random_int __P((u_int32_t, u_int32_t));int	  tp_populate __P((DB_ENV *, int, int, int, int, int));int	  tp_run __P((DB_ENV *, int, int, int, int, int));int	  tp_txn __P((DB_ENV *, DB *, DB *, DB *, DB *, int, int, int, int));int	  invarg __P((const char *, int, const char *));int	  main __P((int, char *[]));int	  usage __P((const char *));/* * This program implements a basic TPC/B driver program.  To create the * TPC/B database, run with the -i (init) flag.  The number of records * with which to populate the account, history, branch, and teller tables * is specified by the a, s, b, and t flags respectively.  To run a TPC/B * test, use the n flag to indicate a number of transactions to run (note * that you can run many of these processes in parallel to simulate a * multiuser test run). */#define	TELLERS_PER_BRANCH	10#define	ACCOUNTS_PER_TELLER	10000#define	HISTORY_PER_BRANCH	2592000/* * The default configuration that adheres to TPCB scaling rules requires * nearly 3 GB of space.  To avoid requiring that much space for testing, * we set the parameters much lower.  If you want to run a valid 10 TPS * configuration, define VALID_SCALING. */#ifdef	VALID_SCALING#define	ACCOUNTS	 1000000#define	BRANCHES	      10#define	TELLERS		     100#define	HISTORY		25920000#endif#ifdef	TINY#define	ACCOUNTS	    1000#define	BRANCHES	      10#define	TELLERS		     100#define	HISTORY		   10000#endif#ifdef	VERY_TINY#define	ACCOUNTS	     500#define	BRANCHES	      10#define	TELLERS		      50#define	HISTORY		    5000#endif#if !defined(VALID_SCALING) && !defined(TINY) && !defined(VERY_TINY)#define	ACCOUNTS	  100000#define	BRANCHES	      10#define	TELLERS		     100#define	HISTORY		  259200#endif#define	HISTORY_LEN	    100#define	RECLEN		    100#define	BEGID		1000000typedef struct _defrec {	u_int32_t	id;	u_int32_t	balance;	u_int8_t	pad[RECLEN - sizeof(u_int32_t) - sizeof(u_int32_t)];} defrec;typedef struct _histrec {	u_int32_t	aid;	u_int32_t	bid;	u_int32_t	tid;	u_int32_t	amount;	u_int8_t	pad[RECLEN - 4 * sizeof(u_int32_t)];} histrec;intmain(argc, argv)	int argc;	char *argv[];{	extern char *optarg;	extern int optind;	DB_ENV *dbenv;	int accounts, branches, seed, tellers, history;	int ch, iflag, mpool, ntxns, ret, txn_no_sync, verbose;	const char *home, *progname;	home = "TESTDIR";	progname = "ex_tpcb";	accounts = branches = history = tellers = 0;	iflag = mpool = ntxns = txn_no_sync = verbose = 0;	seed = (int)time(NULL);	while ((ch = getopt(argc, argv, "a:b:c:fh:in:S:s:t:v")) != EOF)		switch (ch) {		case 'a':			/* Number of account records */			if ((accounts = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 'b':			/* Number of branch records */			if ((branches = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 'c':			/* Cachesize in bytes */			if ((mpool = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 'f':			/* Fast mode: no txn sync. */			txn_no_sync = 1;			break;		case 'h':			/* DB  home. */			home = optarg;			break;		case 'i':			/* Initialize the test. */			iflag = 1;			break;		case 'n':			/* Number of transactions */			if ((ntxns = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 'S':			/* Random number seed. */			if ((seed = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 's':			/* Number of history records */			if ((history = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 't':			/* Number of teller records */			if ((tellers = atoi(optarg)) <= 0)				return (invarg(progname, ch, optarg));			break;		case 'v':			/* Verbose option. */			verbose = 1;			break;		case '?':		default:			return (usage(progname));		}	argc -= optind;	argv += optind;	srand((u_int)seed);	/* Initialize the database environment. */	if ((dbenv = db_init(home,	    progname, mpool, iflag, txn_no_sync ? DB_TXN_NOSYNC : 0)) == NULL)		return (EXIT_FAILURE);	accounts = accounts == 0 ? ACCOUNTS : accounts;	branches = branches == 0 ? BRANCHES : branches;	tellers = tellers == 0 ? TELLERS : tellers;	history = history == 0 ? HISTORY : history;	if (verbose)		printf("%ld Accounts, %ld Branches, %ld Tellers, %ld History\n",		    (long)accounts, (long)branches,		    (long)tellers, (long)history);	if (iflag) {		if (ntxns != 0)			return (usage(progname));		tp_populate(dbenv,		    accounts, branches, history, tellers, verbose);	} else {		if (ntxns == 0)			return (usage(progname));		tp_run(dbenv, ntxns, accounts, branches, tellers, verbose);	}	if ((ret = dbenv->close(dbenv, 0)) != 0) {		fprintf(stderr, "%s: dbenv->close failed: %s\n",		    progname, db_strerror(ret));		return (EXIT_FAILURE);	}	return (EXIT_SUCCESS);}intinvarg(progname, arg, str)	const char *progname;	int arg;	const char *str;{	(void)fprintf(stderr,	    "%s: invalid argument for -%c: %s\n", progname, arg, str);	return (EXIT_FAILURE);}intusage(progname)	const char *progname;{	const char *a1, *a2;	a1 = "[-fv] [-a accounts] [-b branches]\n";	a2 = "\t[-c cache_size] [-h home] [-S seed] [-s history] [-t tellers]";	(void)fprintf(stderr, "usage: %s -i %s %s\n", progname, a1, a2);	(void)fprintf(stderr,	    "       %s -n transactions %s %s\n", progname, a1, a2);	return (EXIT_FAILURE);}/* * db_init -- *	Initialize the environment. */DB_ENV *db_init(home, prefix, cachesize, initializing, flags)	const char *home, *prefix;	int cachesize, initializing;	u_int32_t flags;{	DB_ENV *dbenv;	u_int32_t local_flags;	int ret;	if ((ret = db_env_create(&dbenv, 0)) != 0) {		dbenv->err(dbenv, ret, "db_env_create");		return (NULL);	}	dbenv->set_errfile(dbenv, stderr);	dbenv->set_errpfx(dbenv, prefix);	(void)dbenv->set_cachesize(dbenv, 0,	    cachesize == 0 ? 4 * 1024 * 1024 : (u_int32_t)cachesize, 0);	if (flags & (DB_TXN_NOSYNC))		(void)dbenv->set_flags(dbenv, DB_TXN_NOSYNC, 1);	flags &= ~(DB_TXN_NOSYNC);	local_flags = flags | DB_CREATE | (initializing ? DB_INIT_MPOOL :	    DB_INIT_TXN | DB_INIT_LOCK | DB_INIT_LOG | DB_INIT_MPOOL);	if ((ret = dbenv->open(dbenv, home, local_flags, 0)) != 0) {		dbenv->err(dbenv, ret, "DB_ENV->open: %s", home);		(void)dbenv->close(dbenv, 0);		return (NULL);	}	return (dbenv);}/* * Initialize the database to the specified number of accounts, branches, * history records, and tellers. */inttp_populate(env, accounts, branches, history, tellers, verbose)	DB_ENV *env;	int accounts, branches, history, tellers, verbose;{	DB *dbp;	u_int32_t balance, idnum, oflags;	u_int32_t end_anum, end_bnum, end_tnum;	u_int32_t start_anum, start_bnum, start_tnum;	int ret;	idnum = BEGID;	balance = 500000;	oflags = DB_CREATE | DB_TRUNCATE;	if ((ret = db_create(&dbp, env, 0)) != 0) {		env->err(env, ret, "db_create");		return (1);	}	(void)dbp->set_h_nelem(dbp, (u_int32_t)accounts);	if ((ret = dbp->open(dbp, NULL, "account", NULL,	    DB_HASH, oflags, 0644)) != 0) {		env->err(env, ret, "DB->open: account");		return (1);	}	start_anum = idnum;	populate(dbp, idnum, balance, accounts, "account");	idnum += accounts;	end_anum = idnum - 1;	if ((ret = dbp->close(dbp, 0)) != 0) {		env->err(env, ret, "DB->close: account");		return (1);	}	if (verbose)		printf("Populated accounts: %ld - %ld\n",		    (long)start_anum, (long)end_anum);	/*	 * Since the number of branches is very small, we want to use very	 * small pages and only 1 key per page, i.e., key-locking instead	 * of page locking.	 */	if ((ret = db_create(&dbp, env, 0)) != 0) {		env->err(env, ret, "db_create");		return (1);	}	(void)dbp->set_h_ffactor(dbp, 1);	(void)dbp->set_h_nelem(dbp, (u_int32_t)branches);	(void)dbp->set_pagesize(dbp, 512);	if ((ret = dbp->open(dbp, NULL, "branch", NULL,	    DB_HASH, oflags, 0644)) != 0) {		env->err(env, ret, "DB->open: branch");		return (1);	}	start_bnum = idnum;	populate(dbp, idnum, balance, branches, "branch");	idnum += branches;	end_bnum = idnum - 1;	if ((ret = dbp->close(dbp, 0)) != 0) {		env->err(env, ret, "DB->close: branch");		return (1);	}	if (verbose)		printf("Populated branches: %ld - %ld\n",		    (long)start_bnum, (long)end_bnum);	/*	 * In the case of tellers, we also want small pages, but we'll let	 * the fill factor dynamically adjust itself.	 */	if ((ret = db_create(&dbp, env, 0)) != 0) {		env->err(env, ret, "db_create");		return (1);	}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -