2000-01-15 20:38:09 +08:00
|
|
|
/*
|
2006-09-13 08:39:19 +08:00
|
|
|
* $PostgreSQL: pgsql/contrib/pgbench/pgbench.c,v 1.54 2006/09/13 00:39:19 ishii Exp $
|
2000-01-15 20:38:09 +08:00
|
|
|
*
|
2005-10-04 21:40:45 +08:00
|
|
|
* pgbench: a simple benchmark program for PostgreSQL
|
2000-01-15 20:38:09 +08:00
|
|
|
* written by Tatsuo Ishii
|
|
|
|
*
|
2006-08-15 21:05:30 +08:00
|
|
|
* Copyright (c) 2000-2006 Tatsuo Ishii
|
2000-01-15 20:38:09 +08:00
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software and
|
|
|
|
* its documentation for any purpose and without fee is hereby
|
|
|
|
* granted, provided that the above copyright notice appear in all
|
|
|
|
* copies and that both that copyright notice and this permission
|
|
|
|
* notice appear in supporting documentation, and that the name of the
|
|
|
|
* author not be used in advertising or publicity pertaining to
|
|
|
|
* distribution of the software without specific, written prior
|
|
|
|
* permission. The author makes no representations about the
|
|
|
|
* suitability of this software for any purpose. It is provided "as
|
|
|
|
* is" without express or implied warranty.
|
|
|
|
*/
|
2001-02-10 10:31:31 +08:00
|
|
|
#include "postgres_fe.h"
|
2000-01-15 20:38:09 +08:00
|
|
|
|
|
|
|
#include "libpq-fe.h"
|
|
|
|
|
2005-10-07 23:34:17 +08:00
|
|
|
#include <ctype.h>
|
|
|
|
|
2000-01-15 20:38:09 +08:00
|
|
|
#ifdef WIN32
|
|
|
|
#include "win32.h"
|
|
|
|
#else
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
|
|
|
|
#ifdef HAVE_GETOPT_H
|
|
|
|
#include <getopt.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef HAVE_SYS_SELECT_H
|
|
|
|
#include <sys/select.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* for getrlimit */
|
|
|
|
#include <sys/resource.h>
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
#endif /* ! WIN32 */
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2003-08-01 10:21:17 +08:00
|
|
|
extern char *optarg;
|
|
|
|
extern int optind;
|
|
|
|
|
2004-09-14 11:39:55 +08:00
|
|
|
#ifdef WIN32
|
|
|
|
#undef select
|
|
|
|
#endif
|
|
|
|
|
2003-08-01 10:21:17 +08:00
|
|
|
|
2000-01-15 20:38:09 +08:00
|
|
|
/********************************************************************
|
|
|
|
* some configurable parameters */
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
#define MAXCLIENTS 1024 /* max number of clients allowed */
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
int nclients = 1; /* default number of simulated clients */
|
2005-10-15 10:49:52 +08:00
|
|
|
int nxacts = 10; /* default number of transactions per clients */
|
2000-01-15 20:38:09 +08:00
|
|
|
|
|
|
|
/*
|
2006-09-13 08:39:19 +08:00
|
|
|
* scaling factor. for example, scale = 10 will make 1000000 tuples of
|
2000-01-15 20:38:09 +08:00
|
|
|
* accounts table.
|
|
|
|
*/
|
2006-09-13 08:39:19 +08:00
|
|
|
int scale = 1;
|
2000-01-15 20:38:09 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* end of configurable parameters
|
|
|
|
*********************************************************************/
|
|
|
|
|
|
|
|
#define nbranches 1
|
|
|
|
#define ntellers 10
|
2000-04-13 01:17:23 +08:00
|
|
|
#define naccounts 100000
|
|
|
|
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
FILE *LOGFILE = NULL;
|
|
|
|
|
|
|
|
bool use_log; /* log transaction latencies to a file */
|
|
|
|
|
|
|
|
int remains; /* number of remaining clients */
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
int is_connect; /* establish connection for each transaction */
|
2001-09-09 11:15:56 +08:00
|
|
|
|
|
|
|
char *pghost = "";
|
|
|
|
char *pgport = NULL;
|
|
|
|
char *pgoptions = NULL;
|
|
|
|
char *pgtty = NULL;
|
|
|
|
char *login = NULL;
|
|
|
|
char *pwd = NULL;
|
|
|
|
char *dbName;
|
|
|
|
|
2005-10-07 23:31:49 +08:00
|
|
|
/* variable definitions */
|
|
|
|
typedef struct
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
char *name; /* variable name */
|
|
|
|
char *value; /* its value */
|
2005-10-07 23:31:49 +08:00
|
|
|
} Variable;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* structures used in custom query mode
|
|
|
|
*/
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
PGconn *con; /* connection handle to DB */
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
int id; /* client No. */
|
2000-04-13 01:17:23 +08:00
|
|
|
int state; /* state No. */
|
|
|
|
int cnt; /* xacts count */
|
|
|
|
int ecnt; /* error count */
|
2005-10-15 10:49:52 +08:00
|
|
|
int listen; /* 0 indicates that an async query has been
|
|
|
|
* sent */
|
2005-10-07 23:31:49 +08:00
|
|
|
Variable *variables; /* array of variable definitions */
|
|
|
|
int nvariables;
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
struct timeval txn_begin; /* used for measuring latencies */
|
2005-10-04 21:40:45 +08:00
|
|
|
int use_file; /* index in sql_files for this client */
|
2001-11-06 01:46:40 +08:00
|
|
|
} CState;
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
/*
|
|
|
|
* queries read from files
|
|
|
|
*/
|
|
|
|
#define SQL_COMMAND 1
|
|
|
|
#define META_COMMAND 2
|
|
|
|
#define MAX_ARGS 10
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
typedef struct
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
int type; /* command type (SQL_COMMAND or META_COMMAND) */
|
|
|
|
int argc; /* number of commands */
|
|
|
|
char *argv[MAX_ARGS]; /* command list */
|
2005-09-29 21:44:25 +08:00
|
|
|
} Command;
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
#define MAX_FILES 128 /* max number of SQL script files allowed */
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **sql_files[MAX_FILES]; /* SQL script files */
|
|
|
|
int num_files; /* its number */
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
/* default scenario */
|
|
|
|
static char *tpc_b = {
|
2006-09-13 08:39:19 +08:00
|
|
|
"\\set nbranches :scale\n"
|
|
|
|
"\\set ntellers 10 * :scale\n"
|
|
|
|
"\\set naccounts 100000 * :scale\n"
|
2006-07-29 06:58:26 +08:00
|
|
|
"\\setrandom aid 1 :naccounts\n"
|
|
|
|
"\\setrandom bid 1 :nbranches\n"
|
|
|
|
"\\setrandom tid 1 :ntellers\n"
|
|
|
|
"\\setrandom delta -5000 5000\n"
|
2005-10-15 10:49:52 +08:00
|
|
|
"BEGIN;\n"
|
|
|
|
"UPDATE accounts SET abalance = abalance + :delta WHERE aid = :aid;\n"
|
|
|
|
"SELECT abalance FROM accounts WHERE aid = :aid;\n"
|
|
|
|
"UPDATE tellers SET tbalance = tbalance + :delta WHERE tid = :tid;\n"
|
|
|
|
"UPDATE branches SET bbalance = bbalance + :delta WHERE bid = :bid;\n"
|
|
|
|
"INSERT INTO history (tid, bid, aid, delta, mtime) VALUES (:tid, :bid, :aid, :delta, CURRENT_TIMESTAMP);\n"
|
|
|
|
"END;\n"
|
2005-10-05 01:10:55 +08:00
|
|
|
};
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
/* -N case */
|
|
|
|
static char *simple_update = {
|
2006-09-13 08:39:19 +08:00
|
|
|
"\\set nbranches :scale\n"
|
|
|
|
"\\set ntellers 10 * :scale\n"
|
|
|
|
"\\set naccounts 100000 * :scale\n"
|
2006-07-29 06:58:26 +08:00
|
|
|
"\\setrandom aid 1 :naccounts\n"
|
|
|
|
"\\setrandom bid 1 :nbranches\n"
|
|
|
|
"\\setrandom tid 1 :ntellers\n"
|
|
|
|
"\\setrandom delta -5000 5000\n"
|
2005-10-15 10:49:52 +08:00
|
|
|
"BEGIN;\n"
|
|
|
|
"UPDATE accounts SET abalance = abalance + :delta WHERE aid = :aid;\n"
|
|
|
|
"SELECT abalance FROM accounts WHERE aid = :aid;\n"
|
|
|
|
"INSERT INTO history (tid, bid, aid, delta, mtime) VALUES (:tid, :bid, :aid, :delta, CURRENT_TIMESTAMP);\n"
|
|
|
|
"END;\n"
|
2005-10-05 01:10:55 +08:00
|
|
|
};
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
/* -S case */
|
|
|
|
static char *select_only = {
|
2006-09-13 08:39:19 +08:00
|
|
|
"\\set naccounts 100000 * :scale\n"
|
2006-07-29 06:58:26 +08:00
|
|
|
"\\setrandom aid 1 :naccounts\n"
|
2005-10-15 10:49:52 +08:00
|
|
|
"SELECT abalance FROM accounts WHERE aid = :aid;\n"
|
2005-10-05 01:10:55 +08:00
|
|
|
};
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
static void
|
2004-10-25 10:15:02 +08:00
|
|
|
usage(void)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2006-07-26 15:24:50 +08:00
|
|
|
fprintf(stderr, "usage: pgbench [-h hostname][-p port][-c nclients][-t ntransactions][-s scaling_factor][-D varname=value][-n][-C][-v][-S][-N][-f filename][-l][-U login][-P password][-d][dbname]\n");
|
2001-09-09 11:15:56 +08:00
|
|
|
fprintf(stderr, "(initialize mode): pgbench -i [-h hostname][-p port][-s scaling_factor][-U login][-P password][-d][dbname]\n");
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* random number generator */
|
2000-04-13 01:17:23 +08:00
|
|
|
static int
|
|
|
|
getrand(int min, int max)
|
|
|
|
{
|
2005-10-07 23:31:49 +08:00
|
|
|
return min + (int) (((max - min) * (double) random()) / MAX_RANDOM_VALUE + 0.5);
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|
|
|
|
|
2001-09-09 11:15:56 +08:00
|
|
|
/* set up a connection to the backend */
|
2001-10-25 13:50:21 +08:00
|
|
|
static PGconn *
|
2004-10-25 10:15:02 +08:00
|
|
|
doConnect(void)
|
2001-09-09 11:15:56 +08:00
|
|
|
{
|
2001-10-25 13:50:21 +08:00
|
|
|
PGconn *con;
|
2002-10-19 02:41:22 +08:00
|
|
|
PGresult *res;
|
2003-08-04 08:43:34 +08:00
|
|
|
|
2001-10-25 13:50:21 +08:00
|
|
|
con = PQsetdbLogin(pghost, pgport, pgoptions, pgtty, dbName,
|
|
|
|
login, pwd);
|
|
|
|
if (con == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Connection to database '%s' failed.\n", dbName);
|
|
|
|
fprintf(stderr, "Memory allocatin problem?\n");
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (PQstatus(con) == CONNECTION_BAD)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Connection to database '%s' failed.\n", dbName);
|
|
|
|
|
|
|
|
if (PQerrorMessage(con))
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
else
|
|
|
|
fprintf(stderr, "No explanation from the backend\n");
|
2001-09-09 11:15:56 +08:00
|
|
|
|
2001-10-25 13:50:21 +08:00
|
|
|
return (NULL);
|
|
|
|
}
|
2002-10-19 02:41:22 +08:00
|
|
|
|
|
|
|
res = PQexec(con, "SET search_path = public");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
|
2001-10-25 13:50:21 +08:00
|
|
|
return (con);
|
2001-09-09 11:15:56 +08:00
|
|
|
}
|
|
|
|
|
2000-01-15 20:38:09 +08:00
|
|
|
/* throw away response from backend */
|
2000-04-13 01:17:23 +08:00
|
|
|
static void
|
|
|
|
discard_response(CState * state)
|
|
|
|
{
|
|
|
|
PGresult *res;
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
res = PQgetResult(state->con);
|
|
|
|
if (res)
|
|
|
|
PQclear(res);
|
|
|
|
} while (res);
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|
|
|
|
|
2001-09-09 11:15:56 +08:00
|
|
|
/* check to see if the SQL result was good */
|
2000-04-13 01:17:23 +08:00
|
|
|
static int
|
|
|
|
check(CState * state, PGresult *res, int n, int good)
|
2000-01-15 20:38:09 +08:00
|
|
|
{
|
2000-04-13 01:17:23 +08:00
|
|
|
CState *st = &state[n];
|
|
|
|
|
|
|
|
if (res && PQresultStatus(res) != good)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Client %d aborted in state %d: %s", n, st->state, PQerrorMessage(st->con));
|
|
|
|
remains--; /* I've aborted */
|
|
|
|
PQfinish(st->con);
|
|
|
|
st->con = NULL;
|
|
|
|
return (-1);
|
|
|
|
}
|
2001-10-25 13:50:21 +08:00
|
|
|
return (0); /* OK */
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
static int
|
|
|
|
compareVariables(const void *v1, const void *v2)
|
|
|
|
{
|
2005-10-07 23:31:49 +08:00
|
|
|
return strcmp(((const Variable *) v1)->name,
|
|
|
|
((const Variable *) v2)->name);
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static char *
|
|
|
|
getVariable(CState * st, char *name)
|
|
|
|
{
|
2005-10-16 04:24:00 +08:00
|
|
|
Variable key,
|
|
|
|
*var;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-07 23:31:49 +08:00
|
|
|
/* On some versions of Solaris, bsearch of zero items dumps core */
|
|
|
|
if (st->nvariables <= 0)
|
|
|
|
return NULL;
|
|
|
|
|
2005-10-16 04:24:00 +08:00
|
|
|
key.name = name;
|
2005-10-07 23:31:49 +08:00
|
|
|
var = (Variable *) bsearch((void *) &key,
|
|
|
|
(void *) st->variables,
|
|
|
|
st->nvariables,
|
|
|
|
sizeof(Variable),
|
|
|
|
compareVariables);
|
2005-09-29 21:44:25 +08:00
|
|
|
if (var != NULL)
|
2005-10-07 23:31:49 +08:00
|
|
|
return var->value;
|
2005-09-29 21:44:25 +08:00
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
putVariable(CState * st, char *name, char *value)
|
|
|
|
{
|
2005-10-16 04:24:00 +08:00
|
|
|
Variable key,
|
|
|
|
*var;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-16 04:24:00 +08:00
|
|
|
key.name = name;
|
2005-10-07 23:31:49 +08:00
|
|
|
/* On some versions of Solaris, bsearch of zero items dumps core */
|
|
|
|
if (st->nvariables > 0)
|
|
|
|
var = (Variable *) bsearch((void *) &key,
|
|
|
|
(void *) st->variables,
|
|
|
|
st->nvariables,
|
|
|
|
sizeof(Variable),
|
|
|
|
compareVariables);
|
|
|
|
else
|
|
|
|
var = NULL;
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
if (var == NULL)
|
|
|
|
{
|
2005-10-07 23:31:49 +08:00
|
|
|
Variable *newvars;
|
|
|
|
|
|
|
|
if (st->variables)
|
|
|
|
newvars = (Variable *) realloc(st->variables,
|
2005-10-15 10:49:52 +08:00
|
|
|
(st->nvariables + 1) * sizeof(Variable));
|
2005-10-07 23:31:49 +08:00
|
|
|
else
|
|
|
|
newvars = (Variable *) malloc(sizeof(Variable));
|
|
|
|
|
|
|
|
if (newvars == NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
return false;
|
|
|
|
|
2005-10-07 23:31:49 +08:00
|
|
|
st->variables = newvars;
|
|
|
|
|
|
|
|
var = &newvars[st->nvariables];
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
var->name = NULL;
|
|
|
|
var->value = NULL;
|
|
|
|
|
|
|
|
if ((var->name = strdup(name)) == NULL
|
2005-10-07 23:31:49 +08:00
|
|
|
|| (var->value = strdup(value)) == NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
|
|
|
free(var->name);
|
|
|
|
free(var->value);
|
|
|
|
return false;
|
|
|
|
}
|
2005-10-07 23:31:49 +08:00
|
|
|
|
|
|
|
st->nvariables++;
|
|
|
|
|
|
|
|
qsort((void *) st->variables, st->nvariables, sizeof(Variable),
|
|
|
|
compareVariables);
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2006-09-13 08:39:19 +08:00
|
|
|
char *val;
|
|
|
|
|
|
|
|
if ((val = strdup(value)) == NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
return false;
|
2006-09-13 08:39:19 +08:00
|
|
|
|
2005-10-07 23:31:49 +08:00
|
|
|
free(var->value);
|
2006-09-13 08:39:19 +08:00
|
|
|
var->value = val;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static char *
|
|
|
|
assignVariables(CState * st, char *sql)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
int i,
|
|
|
|
j;
|
|
|
|
char *p,
|
|
|
|
*name,
|
|
|
|
*val;
|
2005-09-29 21:44:25 +08:00
|
|
|
void *tmp;
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
while ((p = strchr(&sql[i], ':')) != NULL)
|
|
|
|
{
|
|
|
|
i = j = p - sql;
|
2005-10-15 10:49:52 +08:00
|
|
|
do
|
|
|
|
{
|
2005-09-29 21:44:25 +08:00
|
|
|
i++;
|
2005-09-30 00:18:26 +08:00
|
|
|
} while (isalnum((unsigned char) sql[i]) || sql[i] == '_');
|
2005-09-29 21:44:25 +08:00
|
|
|
if (i == j + 1)
|
|
|
|
continue;
|
|
|
|
|
2005-09-30 00:18:26 +08:00
|
|
|
name = malloc(i - j);
|
|
|
|
if (name == NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
return NULL;
|
2005-09-30 00:18:26 +08:00
|
|
|
memcpy(name, &sql[j + 1], i - (j + 1));
|
|
|
|
name[i - (j + 1)] = '\0';
|
2005-09-29 21:44:25 +08:00
|
|
|
val = getVariable(st, name);
|
|
|
|
free(name);
|
|
|
|
if (val == NULL)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (strlen(val) > i - j)
|
|
|
|
{
|
|
|
|
tmp = realloc(sql, strlen(sql) - (i - j) + strlen(val) + 1);
|
|
|
|
if (tmp == NULL)
|
|
|
|
{
|
|
|
|
free(sql);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
sql = tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strlen(val) != i - j)
|
|
|
|
memmove(&sql[j + strlen(val)], &sql[i], strlen(&sql[i]) + 1);
|
|
|
|
|
|
|
|
strncpy(&sql[j], val, strlen(val));
|
|
|
|
|
|
|
|
if (strlen(val) < i - j)
|
|
|
|
{
|
|
|
|
tmp = realloc(sql, strlen(sql) + 1);
|
|
|
|
if (tmp == NULL)
|
|
|
|
{
|
|
|
|
free(sql);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
sql = tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
i = j + strlen(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
return sql;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
doCustom(CState * state, int n, int debug)
|
|
|
|
{
|
|
|
|
PGresult *res;
|
|
|
|
CState *st = &state[n];
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **commands;
|
2005-10-04 21:40:45 +08:00
|
|
|
|
2005-12-10 09:09:07 +08:00
|
|
|
top:
|
2005-10-04 21:40:45 +08:00
|
|
|
commands = sql_files[st->use_file];
|
2005-09-29 21:44:25 +08:00
|
|
|
|
|
|
|
if (st->listen)
|
|
|
|
{ /* are we receiver? */
|
|
|
|
if (commands[st->state]->type == SQL_COMMAND)
|
|
|
|
{
|
|
|
|
if (debug)
|
|
|
|
fprintf(stderr, "client %d receiving\n", n);
|
|
|
|
if (!PQconsumeInput(st->con))
|
2005-10-15 10:49:52 +08:00
|
|
|
{ /* there's something wrong */
|
2005-09-29 21:44:25 +08:00
|
|
|
fprintf(stderr, "Client %d aborted in state %d. Probably the backend died while processing.\n", n, st->state);
|
2005-10-15 10:49:52 +08:00
|
|
|
remains--; /* I've aborted */
|
2005-09-29 21:44:25 +08:00
|
|
|
PQfinish(st->con);
|
|
|
|
st->con = NULL;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (PQisBusy(st->con))
|
2005-10-15 10:49:52 +08:00
|
|
|
return; /* don't have the whole result yet */
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2005-10-15 10:49:52 +08:00
|
|
|
* transaction finished: record the time it took in the log
|
2005-09-29 21:44:25 +08:00
|
|
|
*/
|
|
|
|
if (use_log && commands[st->state + 1] == NULL)
|
|
|
|
{
|
|
|
|
double diff;
|
|
|
|
struct timeval now;
|
|
|
|
|
|
|
|
gettimeofday(&now, NULL);
|
|
|
|
diff = (int) (now.tv_sec - st->txn_begin.tv_sec) * 1000000.0 +
|
|
|
|
(int) (now.tv_usec - st->txn_begin.tv_usec);
|
|
|
|
|
|
|
|
fprintf(LOGFILE, "%d %d %.0f\n", st->id, st->cnt, diff);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (commands[st->state]->type == SQL_COMMAND)
|
|
|
|
{
|
|
|
|
res = PQgetResult(st->con);
|
|
|
|
if (strncasecmp(commands[st->state]->argv[0], "select", 6) != 0)
|
|
|
|
{
|
|
|
|
if (check(state, res, n, PGRES_COMMAND_OK))
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (check(state, res, n, PGRES_TUPLES_OK))
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
discard_response(st);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (commands[st->state + 1] == NULL)
|
|
|
|
{
|
|
|
|
if (is_connect)
|
|
|
|
{
|
|
|
|
PQfinish(st->con);
|
|
|
|
st->con = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (++st->cnt >= nxacts)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
remains--; /* I've done */
|
2005-09-29 21:44:25 +08:00
|
|
|
if (st->con != NULL)
|
|
|
|
{
|
|
|
|
PQfinish(st->con);
|
|
|
|
st->con = NULL;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* increment state counter */
|
|
|
|
st->state++;
|
|
|
|
if (commands[st->state] == NULL)
|
2005-10-04 21:40:45 +08:00
|
|
|
{
|
2005-09-29 21:44:25 +08:00
|
|
|
st->state = 0;
|
2005-10-15 10:49:52 +08:00
|
|
|
st->use_file = getrand(0, num_files - 1);
|
2005-12-10 09:09:07 +08:00
|
|
|
commands = sql_files[st->use_file];
|
2005-10-04 21:40:45 +08:00
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (st->con == NULL)
|
|
|
|
{
|
|
|
|
if ((st->con = doConnect()) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Client %d aborted in establishing connection.\n",
|
|
|
|
n);
|
|
|
|
remains--; /* I've aborted */
|
|
|
|
PQfinish(st->con);
|
|
|
|
st->con = NULL;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (use_log && st->state == 0)
|
|
|
|
gettimeofday(&(st->txn_begin), NULL);
|
|
|
|
|
|
|
|
if (commands[st->state]->type == SQL_COMMAND)
|
|
|
|
{
|
|
|
|
char *sql;
|
|
|
|
|
|
|
|
if ((sql = strdup(commands[st->state]->argv[0])) == NULL
|
|
|
|
|| (sql = assignVariables(st, sql)) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "out of memory\n");
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (debug)
|
|
|
|
fprintf(stderr, "client %d sending %s\n", n, sql);
|
|
|
|
if (PQsendQuery(st->con, sql) == 0)
|
|
|
|
{
|
|
|
|
if (debug)
|
|
|
|
fprintf(stderr, "PQsendQuery(%s)failed\n", sql);
|
|
|
|
st->ecnt++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
st->listen = 1; /* flags that should be listened */
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
2005-10-04 21:40:45 +08:00
|
|
|
free(sql);
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
else if (commands[st->state]->type == META_COMMAND)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
int argc = commands[st->state]->argc,
|
|
|
|
i;
|
2005-09-29 21:44:25 +08:00
|
|
|
char **argv = commands[st->state]->argv;
|
|
|
|
|
|
|
|
if (debug)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "client %d executing \\%s", n, argv[0]);
|
|
|
|
for (i = 1; i < argc; i++)
|
|
|
|
fprintf(stderr, " %s", argv[i]);
|
|
|
|
fprintf(stderr, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (strcasecmp(argv[0], "setrandom") == 0)
|
|
|
|
{
|
2006-07-26 15:24:50 +08:00
|
|
|
char *var;
|
|
|
|
int min,
|
|
|
|
max;
|
|
|
|
char res[64];
|
|
|
|
|
|
|
|
if (*argv[2] == ':')
|
|
|
|
{
|
|
|
|
if ((var = getVariable(st, argv[2] + 1)) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: undefined variable %s\n", argv[0], argv[2]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
min = atoi(var);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
min = atoi(argv[2]);
|
|
|
|
|
2006-07-29 06:58:26 +08:00
|
|
|
#ifdef NOT_USED
|
2006-07-26 15:24:50 +08:00
|
|
|
if (min < 0)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: invalid minimum number %d\n", argv[0], min);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
2006-07-29 06:58:26 +08:00
|
|
|
#endif
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
if (*argv[3] == ':')
|
|
|
|
{
|
|
|
|
if ((var = getVariable(st, argv[3] + 1)) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: undefined variable %s\n", argv[0], argv[3]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
max = atoi(var);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
max = atoi(argv[3]);
|
|
|
|
|
|
|
|
if (max < min || max > MAX_RANDOM_VALUE)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: invalid maximum number %d\n", argv[0], max);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-07-29 06:58:26 +08:00
|
|
|
#ifdef DEBUG
|
|
|
|
printf("min: %d max: %d random: %d\n", min, max, getrand(min, max));
|
|
|
|
#endif
|
2006-07-26 15:24:50 +08:00
|
|
|
snprintf(res, sizeof(res), "%d", getrand(min, max));
|
|
|
|
|
|
|
|
if (putVariable(st, argv[1], res) == false)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: out of memory\n", argv[0]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
st->listen = 1;
|
|
|
|
}
|
|
|
|
else if (strcasecmp(argv[0], "set") == 0)
|
|
|
|
{
|
|
|
|
char *var;
|
|
|
|
int ope1,
|
|
|
|
ope2;
|
|
|
|
char res[64];
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
if (*argv[2] == ':')
|
|
|
|
{
|
|
|
|
if ((var = getVariable(st, argv[2] + 1)) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: undefined variable %s\n", argv[0], argv[2]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ope1 = atoi(var);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ope1 = atoi(argv[2]);
|
|
|
|
|
|
|
|
if (argc < 5)
|
|
|
|
snprintf(res, sizeof(res), "%d", ope1);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (*argv[4] == ':')
|
|
|
|
{
|
|
|
|
if ((var = getVariable(st, argv[4] + 1)) == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: undefined variable %s\n", argv[0], argv[4]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ope2 = atoi(var);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ope2 = atoi(argv[4]);
|
|
|
|
|
|
|
|
if (strcmp(argv[3], "+") == 0)
|
|
|
|
snprintf(res, sizeof(res), "%d", ope1 + ope2);
|
|
|
|
else if (strcmp(argv[3], "-") == 0)
|
|
|
|
snprintf(res, sizeof(res), "%d", ope1 - ope2);
|
|
|
|
else if (strcmp(argv[3], "*") == 0)
|
|
|
|
snprintf(res, sizeof(res), "%d", ope1 * ope2);
|
|
|
|
else if (strcmp(argv[3], "/") == 0)
|
|
|
|
{
|
|
|
|
if (ope2 == 0)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: division by zero\n", argv[0]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
snprintf(res, sizeof(res), "%d", ope1 / ope2);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: unsupported operator %s\n", argv[0], argv[3]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (putVariable(st, argv[1], res) == false)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: out of memory\n", argv[0]);
|
|
|
|
st->ecnt++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
st->listen = 1;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
2005-12-10 09:09:07 +08:00
|
|
|
|
|
|
|
goto top;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-01-15 20:38:09 +08:00
|
|
|
/* discard connections */
|
2000-04-13 01:17:23 +08:00
|
|
|
static void
|
|
|
|
disconnect_all(CState * state)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
|
|
|
if (state[i].con)
|
|
|
|
PQfinish(state[i].con);
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* create tables and setup data */
|
2000-04-13 01:17:23 +08:00
|
|
|
static void
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
init(void)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
PGconn *con;
|
|
|
|
PGresult *res;
|
|
|
|
static char *DDLs[] = {
|
|
|
|
"drop table branches",
|
2003-11-26 14:53:18 +08:00
|
|
|
"create table branches(bid int not null,bbalance int,filler char(88))",
|
2000-04-13 01:17:23 +08:00
|
|
|
"drop table tellers",
|
2003-11-26 14:53:18 +08:00
|
|
|
"create table tellers(tid int not null,bid int,tbalance int,filler char(84))",
|
2000-04-13 01:17:23 +08:00
|
|
|
"drop table accounts",
|
2003-11-26 14:53:18 +08:00
|
|
|
"create table accounts(aid int not null,bid int,abalance int,filler char(84))",
|
2000-04-13 01:17:23 +08:00
|
|
|
"drop table history",
|
2001-10-24 16:07:22 +08:00
|
|
|
"create table history(tid int,bid int,aid int,delta int,mtime timestamp,filler char(22))"};
|
2003-11-26 14:53:18 +08:00
|
|
|
static char *DDLAFTERs[] = {
|
|
|
|
"alter table branches add primary key (bid)",
|
|
|
|
"alter table tellers add primary key (tid)",
|
2004-08-29 13:07:03 +08:00
|
|
|
"alter table accounts add primary key (aid)"};
|
2003-11-26 14:53:18 +08:00
|
|
|
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
char sql[256];
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
2001-09-09 11:15:56 +08:00
|
|
|
if ((con = doConnect()) == NULL)
|
2001-10-25 13:50:21 +08:00
|
|
|
exit(1);
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
for (i = 0; i < (sizeof(DDLs) / sizeof(char *)); i++)
|
|
|
|
{
|
|
|
|
res = PQexec(con, DDLs[i]);
|
|
|
|
if (strncmp(DDLs[i], "drop", 4) && PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
res = PQexec(con, "begin");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
2002-10-19 02:41:22 +08:00
|
|
|
PQclear(res);
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2006-09-13 08:39:19 +08:00
|
|
|
for (i = 0; i < nbranches * scale; i++)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2002-08-15 10:58:29 +08:00
|
|
|
snprintf(sql, 256, "insert into branches(bid,bbalance) values(%d,0)", i + 1);
|
2000-04-13 01:17:23 +08:00
|
|
|
res = PQexec(con, sql);
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2006-09-13 08:39:19 +08:00
|
|
|
for (i = 0; i < ntellers * scale; i++)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2002-08-15 10:58:29 +08:00
|
|
|
snprintf(sql, 256, "insert into tellers(tid,bid,tbalance) values (%d,%d,0)"
|
2002-09-05 04:31:48 +08:00
|
|
|
,i + 1, i / ntellers + 1);
|
2000-04-13 01:17:23 +08:00
|
|
|
res = PQexec(con, sql);
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2001-08-01 09:08:17 +08:00
|
|
|
res = PQexec(con, "end");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
2004-06-14 19:00:12 +08:00
|
|
|
PQclear(res);
|
2001-08-01 09:08:17 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* occupy accounts table with some data
|
|
|
|
*/
|
2000-04-13 01:17:23 +08:00
|
|
|
fprintf(stderr, "creating tables...\n");
|
2006-09-13 08:39:19 +08:00
|
|
|
for (i = 0; i < naccounts * scale; i++)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
int j = i + 1;
|
|
|
|
|
2001-08-01 09:08:17 +08:00
|
|
|
if (j % 10000 == 1)
|
|
|
|
{
|
|
|
|
res = PQexec(con, "copy accounts from stdin");
|
|
|
|
if (PQresultStatus(res) != PGRES_COPY_IN)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
}
|
|
|
|
|
2003-09-28 03:15:34 +08:00
|
|
|
snprintf(sql, 256, "%d\t%d\t%d\t\n", j, i / naccounts + 1, 0);
|
2000-04-13 01:17:23 +08:00
|
|
|
if (PQputline(con, sql))
|
|
|
|
{
|
|
|
|
fprintf(stderr, "PQputline failed\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2001-08-01 09:08:17 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
if (j % 10000 == 0)
|
2001-08-01 09:08:17 +08:00
|
|
|
{
|
|
|
|
/*
|
2001-10-25 13:50:21 +08:00
|
|
|
* every 10000 tuples, we commit the copy command. this should
|
|
|
|
* avoid generating too much WAL logs
|
2001-08-01 09:08:17 +08:00
|
|
|
*/
|
2000-04-13 01:17:23 +08:00
|
|
|
fprintf(stderr, "%d tuples done.\n", j);
|
2001-08-01 09:08:17 +08:00
|
|
|
if (PQputline(con, "\\.\n"))
|
|
|
|
{
|
2001-10-25 13:50:21 +08:00
|
|
|
fprintf(stderr, "very last PQputline failed\n");
|
|
|
|
exit(1);
|
2001-08-01 09:08:17 +08:00
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2001-08-01 09:08:17 +08:00
|
|
|
if (PQendcopy(con))
|
|
|
|
{
|
2001-10-25 13:50:21 +08:00
|
|
|
fprintf(stderr, "PQendcopy failed\n");
|
|
|
|
exit(1);
|
2001-08-01 09:08:17 +08:00
|
|
|
}
|
2002-02-24 08:17:57 +08:00
|
|
|
|
|
|
|
#ifdef NOT_USED
|
2002-09-05 04:31:48 +08:00
|
|
|
|
2002-02-24 08:17:57 +08:00
|
|
|
/*
|
|
|
|
* do a checkpoint to purge the old WAL logs
|
|
|
|
*/
|
|
|
|
res = PQexec(con, "checkpoint");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
2002-10-19 02:41:22 +08:00
|
|
|
PQclear(res);
|
2002-09-05 04:31:48 +08:00
|
|
|
#endif /* NOT_USED */
|
2001-08-01 09:08:17 +08:00
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
2003-11-26 14:53:18 +08:00
|
|
|
fprintf(stderr, "set primary key...\n");
|
|
|
|
for (i = 0; i < (sizeof(DDLAFTERs) / sizeof(char *)); i++)
|
|
|
|
{
|
|
|
|
res = PQexec(con, DDLAFTERs[i]);
|
2005-05-24 08:26:40 +08:00
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
2003-11-26 14:53:18 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
|
|
|
|
/* vacuum */
|
|
|
|
fprintf(stderr, "vacuum...");
|
|
|
|
res = PQexec(con, "vacuum analyze");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
2002-10-19 02:41:22 +08:00
|
|
|
PQclear(res);
|
2000-04-13 01:17:23 +08:00
|
|
|
fprintf(stderr, "done.\n");
|
|
|
|
|
|
|
|
PQfinish(con);
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
static Command *
|
2005-10-04 21:40:45 +08:00
|
|
|
process_commands(char *buf)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
|
|
|
const char delim[] = " \f\n\r\t\v";
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
Command *my_commands;
|
2005-10-04 21:40:45 +08:00
|
|
|
int j;
|
2005-10-15 10:49:52 +08:00
|
|
|
char *p,
|
|
|
|
*tok;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if ((p = strchr(buf, '\n')) != NULL)
|
2005-10-15 10:49:52 +08:00
|
|
|
*p = '\0';
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
p = buf;
|
|
|
|
while (isspace((unsigned char) *p))
|
2005-10-15 10:49:52 +08:00
|
|
|
p++;
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
if (*p == '\0' || strncmp(p, "--", 2) == 0)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
return NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
my_commands = (Command *) malloc(sizeof(Command));
|
2005-10-04 21:40:45 +08:00
|
|
|
if (my_commands == NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands->argc = 0;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if (*p == '\\')
|
|
|
|
{
|
|
|
|
my_commands->type = META_COMMAND;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
j = 0;
|
|
|
|
tok = strtok(++p, delim);
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
while (tok != NULL)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
if ((my_commands->argv[j] = strdup(tok)) == NULL)
|
|
|
|
return NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands->argc++;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
j++;
|
|
|
|
tok = strtok(NULL, delim);
|
|
|
|
}
|
2005-10-15 10:49:52 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if (strcasecmp(my_commands->argv[0], "setrandom") == 0)
|
|
|
|
{
|
|
|
|
if (my_commands->argc < 4)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
fprintf(stderr, "%s: missing argument\n", my_commands->argv[0]);
|
|
|
|
return NULL;
|
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
for (j = 4; j < my_commands->argc; j++)
|
2005-10-15 10:49:52 +08:00
|
|
|
fprintf(stderr, "%s: extra argument \"%s\" ignored\n",
|
|
|
|
my_commands->argv[0], my_commands->argv[j]);
|
2006-07-26 15:24:50 +08:00
|
|
|
}
|
|
|
|
else if (strcasecmp(my_commands->argv[0], "set") == 0)
|
|
|
|
{
|
|
|
|
if (my_commands->argc < 3)
|
2005-10-04 21:40:45 +08:00
|
|
|
{
|
2006-07-26 15:24:50 +08:00
|
|
|
fprintf(stderr, "%s: missing argument\n", my_commands->argv[0]);
|
2005-10-04 21:40:45 +08:00
|
|
|
return NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
2005-10-04 21:40:45 +08:00
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
for (j = my_commands->argc < 5 ? 3 : 5; j < my_commands->argc; j++)
|
|
|
|
fprintf(stderr, "%s: extra argument \"%s\" ignored\n",
|
|
|
|
my_commands->argv[0], my_commands->argv[j]);
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
fprintf(stderr, "invalid command %s\n", my_commands->argv[0]);
|
2005-10-04 21:40:45 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
my_commands->type = SQL_COMMAND;
|
|
|
|
|
|
|
|
if ((my_commands->argv[0] = strdup(p)) == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
my_commands->argc++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return my_commands;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
process_file(char *filename)
|
|
|
|
{
|
|
|
|
#define COMMANDS_ALLOC_NUM 128
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **my_commands;
|
2005-10-04 21:40:45 +08:00
|
|
|
FILE *fd;
|
|
|
|
int lineno;
|
|
|
|
char buf[BUFSIZ];
|
2005-10-15 10:49:52 +08:00
|
|
|
int alloc_num;
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
if (num_files >= MAX_FILES)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Up to only %d SQL files are allowed\n", MAX_FILES);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
alloc_num = COMMANDS_ALLOC_NUM;
|
2005-10-30 03:38:07 +08:00
|
|
|
my_commands = (Command **) malloc(sizeof(Command *) * alloc_num);
|
2005-10-04 21:40:45 +08:00
|
|
|
if (my_commands == NULL)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (strcmp(filename, "-") == 0)
|
|
|
|
fd = stdin;
|
|
|
|
else if ((fd = fopen(filename, "r")) == NULL)
|
|
|
|
{
|
2005-10-30 03:38:07 +08:00
|
|
|
fprintf(stderr, "%s: %s\n", filename, strerror(errno));
|
2005-10-04 21:40:45 +08:00
|
|
|
return false;
|
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
lineno = 0;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
while (fgets(buf, sizeof(buf), fd) != NULL)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
Command *commands;
|
2006-07-26 15:24:50 +08:00
|
|
|
int i;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
i = 0;
|
|
|
|
while (isspace((unsigned char) buf[i]))
|
|
|
|
i++;
|
2005-11-23 20:19:12 +08:00
|
|
|
|
2006-08-15 21:05:30 +08:00
|
|
|
if (buf[i] != '\0' && strncmp(&buf[i], "--", 2) != 0) {
|
2006-07-26 15:24:50 +08:00
|
|
|
commands = process_commands(&buf[i]);
|
2005-11-23 20:19:12 +08:00
|
|
|
if (commands == NULL)
|
|
|
|
{
|
|
|
|
fclose(fd);
|
|
|
|
return false;
|
|
|
|
}
|
2005-12-10 09:09:07 +08:00
|
|
|
} else
|
2005-11-23 20:19:12 +08:00
|
|
|
continue;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands[lineno] = commands;
|
2005-09-29 21:44:25 +08:00
|
|
|
lineno++;
|
2005-10-04 21:40:45 +08:00
|
|
|
|
|
|
|
if (lineno >= alloc_num)
|
|
|
|
{
|
|
|
|
alloc_num += COMMANDS_ALLOC_NUM;
|
2005-10-30 03:38:07 +08:00
|
|
|
my_commands = realloc(my_commands, sizeof(Command *) * alloc_num);
|
2005-10-04 21:40:45 +08:00
|
|
|
if (my_commands == NULL)
|
|
|
|
{
|
|
|
|
fclose(fd);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
fclose(fd);
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands[lineno] = NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
sql_files[num_files++] = my_commands;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
|
|
|
return true;
|
2005-10-04 21:40:45 +08:00
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
static Command **
|
|
|
|
process_builtin(char *tb)
|
|
|
|
{
|
|
|
|
#define COMMANDS_ALLOC_NUM 128
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **my_commands;
|
2005-10-04 21:40:45 +08:00
|
|
|
int lineno;
|
|
|
|
char buf[BUFSIZ];
|
2005-10-15 10:49:52 +08:00
|
|
|
int alloc_num;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if (*tb == '\0')
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
alloc_num = COMMANDS_ALLOC_NUM;
|
2005-10-30 03:38:07 +08:00
|
|
|
my_commands = (Command **) malloc(sizeof(Command *) * alloc_num);
|
2005-10-04 21:40:45 +08:00
|
|
|
if (my_commands == NULL)
|
|
|
|
return NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
lineno = 0;
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
for (;;)
|
2005-09-29 21:44:25 +08:00
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
char *p;
|
|
|
|
Command *commands;
|
2005-09-29 21:44:25 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
p = buf;
|
|
|
|
while (*tb && *tb != '\n')
|
|
|
|
*p++ = *tb++;
|
|
|
|
|
|
|
|
if (*tb == '\0')
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (*tb == '\n')
|
|
|
|
tb++;
|
|
|
|
|
|
|
|
*p = '\0';
|
|
|
|
|
|
|
|
commands = process_commands(buf);
|
|
|
|
if (commands == NULL)
|
|
|
|
{
|
|
|
|
return NULL;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands[lineno] = commands;
|
|
|
|
lineno++;
|
|
|
|
|
|
|
|
if (lineno >= alloc_num)
|
|
|
|
{
|
|
|
|
alloc_num += COMMANDS_ALLOC_NUM;
|
2005-10-30 03:38:07 +08:00
|
|
|
my_commands = realloc(my_commands, sizeof(Command *) * alloc_num);
|
2005-10-04 21:40:45 +08:00
|
|
|
if (my_commands == NULL)
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
my_commands[lineno] = NULL;
|
|
|
|
|
|
|
|
return my_commands;
|
2005-09-29 21:44:25 +08:00
|
|
|
}
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
/* print out results */
|
|
|
|
static void
|
|
|
|
printResults(
|
|
|
|
int ttype, CState * state,
|
|
|
|
struct timeval * tv1, struct timeval * tv2,
|
|
|
|
struct timeval * tv3)
|
|
|
|
{
|
|
|
|
double t1,
|
|
|
|
t2;
|
|
|
|
int i;
|
|
|
|
int normal_xacts = 0;
|
2002-09-05 04:31:48 +08:00
|
|
|
char *s;
|
2000-04-13 01:17:23 +08:00
|
|
|
|
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
normal_xacts += state[i].cnt;
|
|
|
|
|
|
|
|
t1 = (tv3->tv_sec - tv1->tv_sec) * 1000000.0 + (tv3->tv_usec - tv1->tv_usec);
|
|
|
|
t1 = normal_xacts * 1000000.0 / t1;
|
|
|
|
|
|
|
|
t2 = (tv3->tv_sec - tv2->tv_sec) * 1000000.0 + (tv3->tv_usec - tv2->tv_usec);
|
|
|
|
t2 = normal_xacts * 1000000.0 / t2;
|
|
|
|
|
2002-02-24 08:17:57 +08:00
|
|
|
if (ttype == 0)
|
2002-09-05 04:31:48 +08:00
|
|
|
s = "TPC-B (sort of)";
|
2002-02-24 08:17:57 +08:00
|
|
|
else if (ttype == 2)
|
2002-09-05 04:31:48 +08:00
|
|
|
s = "Update only accounts";
|
2005-09-29 21:44:25 +08:00
|
|
|
else if (ttype == 1)
|
2002-09-05 04:31:48 +08:00
|
|
|
s = "SELECT only";
|
2005-09-29 21:44:25 +08:00
|
|
|
else
|
|
|
|
s = "Custom query";
|
2002-02-24 08:17:57 +08:00
|
|
|
|
|
|
|
printf("transaction type: %s\n", s);
|
2006-09-13 08:39:19 +08:00
|
|
|
printf("scaling factor: %d\n", scale);
|
2000-04-13 01:17:23 +08:00
|
|
|
printf("number of clients: %d\n", nclients);
|
|
|
|
printf("number of transactions per client: %d\n", nxacts);
|
|
|
|
printf("number of transactions actually processed: %d/%d\n", normal_xacts, nxacts * nclients);
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
printf("tps = %f (including connections establishing)\n", t1);
|
|
|
|
printf("tps = %f (excluding connections establishing)\n", t2);
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
|
|
|
|
2001-09-09 11:15:56 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
int
|
|
|
|
main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
int c;
|
|
|
|
int is_init_mode = 0; /* initialize mode? */
|
2005-10-15 10:49:52 +08:00
|
|
|
int is_no_vacuum = 0; /* no vacuum at all before testing? */
|
2000-04-13 01:17:23 +08:00
|
|
|
int is_full_vacuum = 0; /* do full vacuum before testing? */
|
|
|
|
int debug = 0; /* debug flag */
|
2005-10-15 10:49:52 +08:00
|
|
|
int ttype = 0; /* transaction type. 0: TPC-B, 1: SELECT only,
|
|
|
|
* 2: skip update of branches and tellers */
|
2005-09-29 21:44:25 +08:00
|
|
|
char *filename = NULL;
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-30 03:38:07 +08:00
|
|
|
CState *state; /* status of clients */
|
2000-04-13 01:17:23 +08:00
|
|
|
|
|
|
|
struct timeval tv1; /* start up time */
|
2005-10-15 10:49:52 +08:00
|
|
|
struct timeval tv2; /* after establishing all connections to the
|
|
|
|
* backend */
|
2000-04-13 01:17:23 +08:00
|
|
|
struct timeval tv3; /* end time */
|
|
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
fd_set input_mask;
|
|
|
|
int nsocks; /* return from select(2) */
|
|
|
|
int maxsock; /* max socket number to be waited */
|
2000-01-15 20:38:09 +08:00
|
|
|
|
2004-09-14 11:39:55 +08:00
|
|
|
#if !(defined(__CYGWIN__) || defined(__MINGW32__))
|
2000-04-13 01:17:23 +08:00
|
|
|
struct rlimit rlim;
|
2000-01-15 20:38:09 +08:00
|
|
|
#endif
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
PGconn *con;
|
|
|
|
PGresult *res;
|
2003-06-10 17:07:15 +08:00
|
|
|
char *env;
|
|
|
|
|
2006-09-13 08:39:19 +08:00
|
|
|
char val[64];
|
|
|
|
|
2003-06-10 17:07:15 +08:00
|
|
|
if ((env = getenv("PGHOST")) != NULL && *env != '\0')
|
|
|
|
pghost = env;
|
|
|
|
if ((env = getenv("PGPORT")) != NULL && *env != '\0')
|
|
|
|
pgport = env;
|
|
|
|
else if ((env = getenv("PGUSER")) != NULL && *env != '\0')
|
|
|
|
login = env;
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
state = (CState *) malloc(sizeof(CState));
|
|
|
|
if (state == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for state\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
memset(state, 0, sizeof(*state));
|
|
|
|
|
|
|
|
while ((c = getopt(argc, argv, "ih:nvp:dc:t:s:U:P:CNSlf:D:")) != -1)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
switch (c)
|
|
|
|
{
|
|
|
|
case 'i':
|
|
|
|
is_init_mode++;
|
|
|
|
break;
|
|
|
|
case 'h':
|
|
|
|
pghost = optarg;
|
|
|
|
break;
|
|
|
|
case 'n':
|
|
|
|
is_no_vacuum++;
|
|
|
|
break;
|
|
|
|
case 'v':
|
|
|
|
is_full_vacuum++;
|
|
|
|
break;
|
|
|
|
case 'p':
|
|
|
|
pgport = optarg;
|
|
|
|
break;
|
|
|
|
case 'd':
|
|
|
|
debug++;
|
|
|
|
break;
|
|
|
|
case 'S':
|
|
|
|
ttype = 1;
|
|
|
|
break;
|
2002-02-24 08:17:57 +08:00
|
|
|
case 'N':
|
|
|
|
ttype = 2;
|
|
|
|
break;
|
2000-04-13 01:17:23 +08:00
|
|
|
case 'c':
|
|
|
|
nclients = atoi(optarg);
|
|
|
|
if (nclients <= 0 || nclients > MAXCLIENTS)
|
|
|
|
{
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
fprintf(stderr, "invalid number of clients: %d\n", nclients);
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(1);
|
|
|
|
}
|
2004-09-14 11:39:55 +08:00
|
|
|
#if !(defined(__CYGWIN__) || defined(__MINGW32__))
|
2000-04-13 01:17:23 +08:00
|
|
|
#ifdef RLIMIT_NOFILE /* most platform uses RLIMIT_NOFILE */
|
|
|
|
if (getrlimit(RLIMIT_NOFILE, &rlim) == -1)
|
|
|
|
#else /* but BSD doesn't ... */
|
|
|
|
if (getrlimit(RLIMIT_OFILE, &rlim) == -1)
|
2005-10-16 04:24:00 +08:00
|
|
|
#endif /* RLIMIT_NOFILE */
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-10-30 03:38:07 +08:00
|
|
|
fprintf(stderr, "getrlimit failed: %s\n", strerror(errno));
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
if (rlim.rlim_cur <= (nclients + 2))
|
|
|
|
{
|
2000-05-29 13:45:56 +08:00
|
|
|
fprintf(stderr, "You need at least %d open files resource but you are only allowed to use %ld.\n", nclients + 2, (long) rlim.rlim_cur);
|
2000-04-13 01:17:23 +08:00
|
|
|
fprintf(stderr, "Use limit/ulimt to increase the limit before using pgbench.\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-11-23 12:23:30 +08:00
|
|
|
#endif
|
2000-04-13 01:17:23 +08:00
|
|
|
break;
|
2001-10-25 13:50:21 +08:00
|
|
|
case 'C':
|
|
|
|
is_connect = 1;
|
|
|
|
break;
|
2000-04-13 01:17:23 +08:00
|
|
|
case 's':
|
2006-09-13 08:39:19 +08:00
|
|
|
scale = atoi(optarg);
|
|
|
|
if (scale <= 0)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2006-09-13 08:39:19 +08:00
|
|
|
fprintf(stderr, "invalid scaling factor: %d\n", scale);
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 't':
|
|
|
|
nxacts = atoi(optarg);
|
|
|
|
if (nxacts <= 0)
|
|
|
|
{
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
fprintf(stderr, "invalid number of transactions: %d\n", nxacts);
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
break;
|
2001-09-09 11:15:56 +08:00
|
|
|
case 'U':
|
|
|
|
login = optarg;
|
|
|
|
break;
|
|
|
|
case 'P':
|
|
|
|
pwd = optarg;
|
|
|
|
break;
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
case 'l':
|
|
|
|
use_log = true;
|
|
|
|
break;
|
2005-09-29 21:44:25 +08:00
|
|
|
case 'f':
|
|
|
|
ttype = 3;
|
|
|
|
filename = optarg;
|
2006-07-26 15:24:50 +08:00
|
|
|
if (process_file(filename) == false || *sql_files[num_files - 1] == NULL)
|
2005-10-04 21:40:45 +08:00
|
|
|
exit(1);
|
2005-09-29 21:44:25 +08:00
|
|
|
break;
|
2006-07-26 15:24:50 +08:00
|
|
|
case 'D':
|
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
if ((p = strchr(optarg, '=')) == NULL || p == optarg || *(p + 1) == '\0')
|
|
|
|
{
|
|
|
|
fprintf(stderr, "invalid variable definition: %s\n", optarg);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
*p++ = '\0';
|
|
|
|
if (putVariable(&state[0], optarg, p) == false)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for variable\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2000-04-13 01:17:23 +08:00
|
|
|
default:
|
|
|
|
usage();
|
|
|
|
exit(1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (argc > optind)
|
|
|
|
dbName = argv[optind];
|
|
|
|
else
|
|
|
|
{
|
2003-06-10 17:07:15 +08:00
|
|
|
if ((env = getenv("PGDATABASE")) != NULL && *env != '\0')
|
|
|
|
dbName = env;
|
|
|
|
else if (login != NULL && *login != '\0')
|
|
|
|
dbName = login;
|
|
|
|
else
|
2000-04-13 01:17:23 +08:00
|
|
|
dbName = "";
|
|
|
|
}
|
|
|
|
|
|
|
|
if (is_init_mode)
|
|
|
|
{
|
2001-10-25 13:50:21 +08:00
|
|
|
init();
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
remains = nclients;
|
|
|
|
|
2006-09-13 08:39:19 +08:00
|
|
|
if (getVariable(&state[0], "scale") == NULL)
|
2005-10-04 21:40:45 +08:00
|
|
|
{
|
2006-09-13 08:39:19 +08:00
|
|
|
snprintf(val, sizeof(val), "%d", scale);
|
|
|
|
if (putVariable(&state[0], "scale", val) == false)
|
2006-07-26 15:24:50 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for variable\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-10-04 21:40:45 +08:00
|
|
|
}
|
|
|
|
|
2006-07-26 15:24:50 +08:00
|
|
|
if (nclients > 1)
|
|
|
|
{
|
|
|
|
state = (CState *) realloc(state, sizeof(CState) * nclients);
|
|
|
|
if (state == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for state\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2006-07-31 13:15:14 +08:00
|
|
|
memset(state + 1, 0, sizeof(*state) * (nclients - 1));
|
2006-07-26 15:24:50 +08:00
|
|
|
|
|
|
|
for (i = 1; i < nclients; i++)
|
|
|
|
{
|
|
|
|
int j;
|
|
|
|
|
|
|
|
for (j = 0; j < state[0].nvariables; j++)
|
|
|
|
{
|
|
|
|
if (putVariable(&state[i], state[0].variables[j].name, state[0].variables[j].value) == false)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for variable\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
|
|
|
|
if (use_log)
|
|
|
|
{
|
2002-09-05 04:31:48 +08:00
|
|
|
char logpath[64];
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
|
|
|
|
snprintf(logpath, 64, "pgbench_log.%d", getpid());
|
|
|
|
LOGFILE = fopen(logpath, "w");
|
|
|
|
|
|
|
|
if (LOGFILE == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't open logfile \"%s\": %s", logpath, strerror(errno));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
if (debug)
|
|
|
|
{
|
|
|
|
printf("pghost: %s pgport: %s nclients: %d nxacts: %d dbName: %s\n",
|
|
|
|
pghost, pgport, nclients, nxacts, dbName);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* opening connection... */
|
2001-09-09 11:15:56 +08:00
|
|
|
con = doConnect();
|
|
|
|
if (con == NULL)
|
2001-10-25 13:50:21 +08:00
|
|
|
exit(1);
|
2001-09-09 11:15:56 +08:00
|
|
|
|
2000-04-13 01:17:23 +08:00
|
|
|
if (PQstatus(con) == CONNECTION_BAD)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Connection to database '%s' failed.\n", dbName);
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if (ttype != 3)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-09-29 21:44:25 +08:00
|
|
|
/*
|
|
|
|
* get the scaling factor that should be same as count(*) from
|
2005-10-04 21:40:45 +08:00
|
|
|
* branches if this is not a custom query
|
2005-09-29 21:44:25 +08:00
|
|
|
*/
|
|
|
|
res = PQexec(con, "select count(*) from branches");
|
|
|
|
if (PQresultStatus(res) != PGRES_TUPLES_OK)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
2006-09-13 08:39:19 +08:00
|
|
|
scale = atoi(PQgetvalue(res, 0, 0));
|
|
|
|
if (scale < 0)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2006-09-13 08:39:19 +08:00
|
|
|
fprintf(stderr, "count(*) from branches invalid (%d)\n", scale);
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
2006-09-13 08:39:19 +08:00
|
|
|
|
|
|
|
snprintf(val, sizeof(val), "%d", scale);
|
|
|
|
if (putVariable(&state[0], "scale", val) == false)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Couldn't allocate memory for variable\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-10-04 21:40:45 +08:00
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
if (!is_no_vacuum)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "starting vacuum...");
|
|
|
|
res = PQexec(con, "vacuum branches");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
res = PQexec(con, "vacuum tellers");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
res = PQexec(con, "delete from history");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
res = PQexec(con, "vacuum history");
|
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
|
|
|
|
fprintf(stderr, "end.\n");
|
|
|
|
|
|
|
|
if (is_full_vacuum)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "starting full vacuum...");
|
|
|
|
res = PQexec(con, "vacuum analyze accounts");
|
2000-04-13 01:17:23 +08:00
|
|
|
if (PQresultStatus(res) != PGRES_COMMAND_OK)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s", PQerrorMessage(con));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
PQclear(res);
|
|
|
|
fprintf(stderr, "end.\n");
|
|
|
|
}
|
|
|
|
}
|
2005-10-04 21:40:45 +08:00
|
|
|
PQfinish(con);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
|
|
|
/* set random seed */
|
2004-11-09 14:09:40 +08:00
|
|
|
gettimeofday(&tv1, NULL);
|
2004-09-14 11:39:55 +08:00
|
|
|
srand((unsigned int) tv1.tv_usec);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
|
|
|
/* get start up time */
|
2004-11-09 14:09:40 +08:00
|
|
|
gettimeofday(&tv1, NULL);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2001-09-09 11:15:56 +08:00
|
|
|
if (is_connect == 0)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2001-10-25 13:50:21 +08:00
|
|
|
/* make connections to the database */
|
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
state[i].id = i;
|
2001-10-25 13:50:21 +08:00
|
|
|
if ((state[i].con = doConnect()) == NULL)
|
|
|
|
exit(1);
|
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* time after connections set up */
|
2004-11-09 14:09:40 +08:00
|
|
|
gettimeofday(&tv2, NULL);
|
2000-04-13 01:17:23 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
/* process bultin SQL scripts */
|
|
|
|
switch (ttype)
|
|
|
|
{
|
|
|
|
case 0:
|
|
|
|
sql_files[0] = process_builtin(tpc_b);
|
|
|
|
num_files = 1;
|
|
|
|
break;
|
2006-07-29 06:58:26 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
case 1:
|
|
|
|
sql_files[0] = process_builtin(select_only);
|
|
|
|
num_files = 1;
|
|
|
|
break;
|
2006-07-29 06:58:26 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
case 2:
|
|
|
|
sql_files[0] = process_builtin(simple_update);
|
|
|
|
num_files = 1;
|
|
|
|
break;
|
2006-07-29 06:58:26 +08:00
|
|
|
|
2005-10-04 21:40:45 +08:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
/* send start up queries in async manner */
|
2000-04-13 01:17:23 +08:00
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
2006-07-26 15:24:50 +08:00
|
|
|
Command **commands = sql_files[state[i].use_file];
|
|
|
|
int prev_ecnt = state[i].ecnt;
|
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
state[i].use_file = getrand(0, num_files - 1);
|
2005-10-04 21:40:45 +08:00
|
|
|
doCustom(state, i, debug);
|
2006-07-26 15:24:50 +08:00
|
|
|
|
|
|
|
if (state[i].ecnt > prev_ecnt && commands[state[i].state]->type == META_COMMAND)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Client %d aborted in state %d. Execution meta-command failed.\n", i, state[i].state);
|
|
|
|
remains--; /* I've aborted */
|
|
|
|
PQfinish(state[i].con);
|
|
|
|
state[i].con = NULL;
|
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
if (remains <= 0)
|
|
|
|
{ /* all done ? */
|
|
|
|
disconnect_all(state);
|
|
|
|
/* get end time */
|
2004-11-09 14:09:40 +08:00
|
|
|
gettimeofday(&tv3, NULL);
|
2000-04-13 01:17:23 +08:00
|
|
|
printResults(ttype, state, &tv1, &tv2, &tv3);
|
Apply patches from Neil Conway.
> Hi Tatsuo,
>
> I've attached a patch for the version of pgbench in CVS. It includes the
> following changes:
>
> - fix some spelling mistakes, indentation stuff, etc.
>
> - minor code cleanup -- (void) args instead of (), etc.
>
> - allocate the state array dynamically, so that it is only as
> large as needed. This reduces the memory consumption of pgbench
> slightly, and makes a larger MAXCLIENTS setting possible
>
> - (the only controversial change) add an option "-l" to log
> transaction latencies to a file. The "transaction latency"
> is the time between when the BEGIN is issued and the transaction
> commits. This is written to a file, along with the client #
> and the transaction #. The data in the file can then be used
> for things like:
>
> - consistency analysis: is the TPS the same through the
> entire run of pgbench, or does it change?
>
> - more detailed stats: what is the average latency, worse-case
> latency, best-case latency?
>
> - graphs: feed the data to gnuplot, graph latency versus. time
>
> - etc.
>
> I was going to store this data in memory and write it to disk
> at the end of the pgbench run, but that isn't feasible because
> the data can be very large: for example, ~70MB if benchmarking
> 128 clients doing 100,000 transactions each.
>
> Cheers,
>
> Neil
2002-07-20 11:02:01 +08:00
|
|
|
if (LOGFILE)
|
|
|
|
fclose(LOGFILE);
|
2000-04-13 01:17:23 +08:00
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
FD_ZERO(&input_mask);
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
maxsock = -1;
|
2000-04-13 01:17:23 +08:00
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **commands = sql_files[state[i].use_file];
|
2005-10-04 21:40:45 +08:00
|
|
|
|
2005-10-15 10:49:52 +08:00
|
|
|
if (state[i].con && commands[state[i].state]->type != META_COMMAND)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
|
|
|
int sock = PQsocket(state[i].con);
|
|
|
|
|
|
|
|
if (sock < 0)
|
|
|
|
{
|
|
|
|
disconnect_all(state);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
FD_SET(sock, &input_mask);
|
|
|
|
if (maxsock < sock)
|
|
|
|
maxsock = sock;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
if (maxsock != -1)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-09-29 21:44:25 +08:00
|
|
|
if ((nsocks = select(maxsock + 1, &input_mask, (fd_set *) NULL,
|
|
|
|
(fd_set *) NULL, (struct timeval *) NULL)) < 0)
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-09-29 21:44:25 +08:00
|
|
|
if (errno == EINTR)
|
|
|
|
continue;
|
|
|
|
/* must be something wrong */
|
|
|
|
disconnect_all(state);
|
|
|
|
fprintf(stderr, "select failed: %s\n", strerror(errno));
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
else if (nsocks == 0)
|
2005-10-15 10:49:52 +08:00
|
|
|
{ /* timeout */
|
2005-09-29 21:44:25 +08:00
|
|
|
fprintf(stderr, "select timeout\n");
|
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "client %d:state %d cnt %d ecnt %d listen %d\n",
|
|
|
|
i, state[i].state, state[i].cnt, state[i].ecnt, state[i].listen);
|
|
|
|
}
|
|
|
|
exit(0);
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ok, backend returns reply */
|
|
|
|
for (i = 0; i < nclients; i++)
|
|
|
|
{
|
2005-10-15 10:49:52 +08:00
|
|
|
Command **commands = sql_files[state[i].use_file];
|
2006-07-26 15:24:50 +08:00
|
|
|
int prev_ecnt = state[i].ecnt;
|
2005-10-04 21:40:45 +08:00
|
|
|
|
2005-09-29 21:44:25 +08:00
|
|
|
if (state[i].con && (FD_ISSET(PQsocket(state[i].con), &input_mask)
|
2005-10-15 10:49:52 +08:00
|
|
|
|| commands[state[i].state]->type == META_COMMAND))
|
2000-04-13 01:17:23 +08:00
|
|
|
{
|
2005-10-04 21:40:45 +08:00
|
|
|
doCustom(state, i, debug);
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
2006-07-26 15:24:50 +08:00
|
|
|
|
|
|
|
if (state[i].ecnt > prev_ecnt && commands[state[i].state]->type == META_COMMAND)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Client %d aborted in state %d. Execution meta-command failed.\n", i, state[i].state);
|
|
|
|
remains--; /* I've aborted */
|
|
|
|
PQfinish(state[i].con);
|
|
|
|
state[i].con = NULL;
|
|
|
|
}
|
2000-04-13 01:17:23 +08:00
|
|
|
}
|
|
|
|
}
|
2000-01-15 20:38:09 +08:00
|
|
|
}
|