#include "postgres_fe.h"
#include "fe_utils/conditional.h"
#include "getopt_long.h"
#include "libpq-fe.h"
#include "portability/instr_time.h"
#include <ctype.h>
#include <float.h>
#include <limits.h>
#include <math.h>
#include <signal.h>
#include <time.h>
#include "pgbench.h"

Include dependency graph for pgbench.c:

Data Structures
struct	Variable

struct	SimpleStats

struct	StatsData

struct	CState

struct	ZipfCell

struct	ZipfCache

struct	TState

struct	Command

struct	ParsedScript

struct	BuiltinScript

Macros
#define	M_PI 3.14159265358979323846

#define	ERRCODE_UNDEFINED_TABLE "42P01"

#define	FNV_PRIME UINT64CONST(0x100000001b3)

#define	FNV_OFFSET_BASIS UINT64CONST(0xcbf29ce484222325)

#define	MM2_MUL UINT64CONST(0xc6a4a7935bd1e995)

#define	MM2_ROT 47

#define	pthread_t void *

#define	MAXCLIENTS 1024

#define	DEFAULT_INIT_STEPS "dtgvp" /* default -I setting */

#define	LOG_STEP_SECONDS 5 /* seconds between log messages */

#define	DEFAULT_NXACTS 10 /* default nxacts */

#define	ZIPF_CACHE_SIZE 15 /* cache cells number */

#define	MIN_GAUSSIAN_PARAM 2.0 /* minimum parameter for gauss */

#define	MAX_ZIPFIAN_PARAM 1000 /* maximum parameter for zipfian */

#define	nbranches

#define	ntellers 10

#define	naccounts 100000

#define	SCALE_32BIT_THRESHOLD 20000

#define	WSEP '@' /* weight separator */

#define	MAX_SCRIPTS 128 /* max number of SQL scripts allowed */

#define	SHELL_COMMAND_SIZE 256 /* maximum size allowed for shell command */

#define	INVALID_THREAD ((pthread_t) 0)

#define	SQL_COMMAND 1

#define	META_COMMAND 2

#define	MAX_ARGS 10

#define	PARAMS_ARRAY_SIZE 7

#define	MAX_FARGS 16

#define	MAX_PREPARE_NAME 32

#define	SCALE_32BIT_THRESHOLD 20000

#define	COMMANDS_ALLOC_NUM 128

Typedefs
typedef struct SimpleStats	SimpleStats

typedef struct StatsData	StatsData

typedef enum MetaCommand	MetaCommand

typedef enum QueryMode	QueryMode

typedef struct ParsedScript	ParsedScript

typedef struct BuiltinScript	BuiltinScript

Enumerations
enum	ConnectionStateEnum { CSTATE_CHOOSE_SCRIPT, CSTATE_START_THROTTLE, CSTATE_THROTTLE, CSTATE_START_TX, CSTATE_START_COMMAND, CSTATE_SKIP_COMMAND, CSTATE_WAIT_RESULT, CSTATE_SLEEP, CSTATE_END_COMMAND, CSTATE_END_TX, CSTATE_ABORTED, CSTATE_FINISHED }

enum	MetaCommand { META_NONE, META_SET, META_SETSHELL, META_SHELL, META_SLEEP, META_IF, META_ELIF, META_ELSE, META_ENDIF }

enum	QueryMode { QUERY_SIMPLE, QUERY_EXTENDED, QUERY_PREPARED, NUM_QUERYMODE }

Functions
static void	setNullValue (PgBenchValue *pv)

static void	setBoolValue (PgBenchValue *pv, bool bval)

static void	setIntValue (PgBenchValue *pv, int64 ival)

static void	setDoubleValue (PgBenchValue *pv, double dval)

static bool	evaluateExpr (TState , CState , PgBenchExpr , PgBenchValue )

static void	doLog (TState thread, CState st, StatsData *agg, bool skipped, double latency, double lag)

static void	processXactStats (TState thread, CState st, instr_time now, bool skipped, StatsData agg)

static void	pgbench_error (const char *fmt,...) pg_attribute_printf(1

static void static void	addScript (ParsedScript script)

static void *	threadRun (void *arg)

static void	setalarm (int seconds)

static void	finishCon (CState *st)

static void	usage (void)

static bool	is_an_int (const char *str)

int64	strtoint64 (const char *str)

static int64	getrand (TState *thread, int64 min, int64 max)

static int64	getExponentialRand (TState *thread, int64 min, int64 max, double parameter)

static int64	getGaussianRand (TState *thread, int64 min, int64 max, double parameter)

static int64	getPoissonRand (TState *thread, int64 center)

static double	generalizedHarmonicNumber (int64 n, double s)

static void	zipfSetCacheCell (ZipfCell *cell, int64 n, double s)

static ZipfCell *	zipfFindOrCreateCacheCell (ZipfCache *cache, int64 n, double s)

static int64	computeIterativeZipfian (TState *thread, int64 n, double s)

static int64	computeHarmonicZipfian (TState *thread, int64 n, double s)

static int64	getZipfianRand (TState *thread, int64 min, int64 max, double s)

static int64	getHashFnv1a (int64 val, uint64 seed)

static int64	getHashMurmur2 (int64 val, uint64 seed)

static void	initSimpleStats (SimpleStats *ss)

static void	addToSimpleStats (SimpleStats *ss, double val)

static void	mergeSimpleStats (SimpleStats acc, SimpleStats ss)

static void	initStats (StatsData *sd, time_t start_time)

static void	accumStats (StatsData *stats, bool skipped, double lat, double lag)

static void	executeStatement (PGconn con, const char sql)

static void	tryExecuteStatement (PGconn con, const char sql)

static PGconn *	doConnect (void)

static void	discard_response (CState *state)

static int	compareVariableNames (const void v1, const void v2)

static Variable *	lookupVariable (CState st, char name)

static char *	getVariable (CState st, char name)

static bool	makeVariableValue (Variable *var)

static bool	valid_variable_name (const char *name)

static Variable *	lookupCreateVariable (CState st, const char context, char *name)

static bool	putVariable (CState st, const char context, char name, const char value)

static bool	putVariableValue (CState st, const char context, char name, const PgBenchValue value)

static bool	putVariableInt (CState st, const char context, char *name, int64 value)

static char *	parseVariable (const char sql, int eaten)

static char *	replaceVariable (char *sql, char param, int len, char *value)

static char *	assignVariables (CState st, char sql)

static void	getQueryParams (CState st, const Command command, const char **params)

static char *	valueTypeName (PgBenchValue *pval)

static bool	coerceToBool (PgBenchValue pval, bool bval)

static bool	valueTruth (PgBenchValue *pval)

static bool	coerceToInt (PgBenchValue pval, int64 ival)

static bool	coerceToDouble (PgBenchValue pval, double dval)

static bool	isLazyFunc (PgBenchFunction func)

static bool	evalLazyFunc (TState thread, CState st, PgBenchFunction func, PgBenchExprLink args, PgBenchValue retval)

static bool	evalStandardFunc (TState thread, CState st, PgBenchFunction func, PgBenchExprLink args, PgBenchValue retval)

static bool	evalFunc (TState thread, CState st, PgBenchFunction func, PgBenchExprLink args, PgBenchValue retval)

static MetaCommand	getMetaCommand (const char *cmd)

static bool	runShellCommand (CState st, char variable, char **argv, int argc)

static void	preparedStatementName (char *buffer, int file, int state)

static void	commandFailed (CState st, const char cmd, const char *message)

static int	chooseScript (TState *thread)

static bool	sendCommand (CState st, Command command)

static bool	evaluateSleep (CState st, int argc, char argv, int usecs)

static void	doCustom (TState thread, CState st, StatsData *agg)

static void	disconnect_all (CState *state, int length)

static void	initDropTables (PGconn *con)

static void	initCreateTables (PGconn *con)

static void	initGenerateData (PGconn *con)

static void	initVacuum (PGconn *con)

static void	initCreatePKeys (PGconn *con)

static void	initCreateFKeys (PGconn *con)

static void	checkInitSteps (const char *initialize_steps)

static void	runInitSteps (const char *initialize_steps)

static bool	parseQuery (Command *cmd)

void	syntax_error (const char source, int lineno, const char line, const char command, const char msg, const char *more, int column)

static Command *	process_sql_command (PQExpBuffer buf, const char *source)

static Command *	process_backslash_command (PsqlScanState sstate, const char *source)

static void	ConditionError (const char desc, int cmdn, const char msg)

static void	CheckConditional (ParsedScript ps)

static void	ParseScript (const char script, const char desc, int weight)

static char *	read_file_contents (FILE *fd)

static void	process_file (const char *filename, int weight)

static void	process_builtin (const BuiltinScript *bi, int weight)

static void	listAvailableScripts (void)

static const BuiltinScript *	findBuiltin (const char *name)

static int	parseScriptWeight (const char option, char *script)

static void	printSimpleStats (const char prefix, SimpleStats ss)

static void	printResults (TState threads, StatsData total, instr_time total_time, instr_time conn_total_time, int64 latency_late)

static bool	set_random_seed (const char *seed)

int	main (int argc, char **argv)

static void	handle_sig_alarm (SIGNAL_ARGS)

Variables
int	nxacts = 0

int	duration = 0

int64	end_time = 0

int	scale = 1

int	fillfactor = 100

bool	unlogged_tables = false

double	sample_rate = 0.0

int64	throttle_delay = 0

int64	latency_limit = 0

char *	tablespace = NULL

char *	index_tablespace = NULL

int64	random_seed = -1

bool	use_log

bool	use_quiet

int	agg_interval

bool	per_script_stats = false

int	progress = 0

bool	progress_timestamp = false

int	nclients = 1

int	nthreads = 1

bool	is_connect

bool	is_latencies

int	main_pid

char *	pghost = ""

char *	pgport = ""

char *	login = NULL

char *	dbName

char *	logfile_prefix = NULL

const char *	progname

volatile bool	timer_exceeded = false

static QueryMode	querymode = QUERY_SIMPLE

static const char *	QUERYMODE [] = {"simple", "extended", "prepared"}

static ParsedScript	sql_script [MAX_SCRIPTS]

static int	num_scripts

static int	num_commands = 0

static int64	total_weight = 0

static int	debug = 0

static const BuiltinScript	builtin_script []

static const PsqlScanCallbacks	pgbench_callbacks

Macro Definition Documentation

◆ COMMANDS_ALLOC_NUM

#define COMMANDS_ALLOC_NUM 128

Referenced by ParseScript().

◆ DEFAULT_INIT_STEPS

#define DEFAULT_INIT_STEPS "dtgvp" /* default -I setting */

Definition at line 102 of file pgbench.c.

Referenced by main().

◆ DEFAULT_NXACTS

#define DEFAULT_NXACTS 10 /* default nxacts */

Definition at line 105 of file pgbench.c.

Referenced by main().

◆ ERRCODE_UNDEFINED_TABLE

#define ERRCODE_UNDEFINED_TABLE "42P01"

Definition at line 62 of file pgbench.c.

Referenced by analyze_rel(), brin_desummarize_range(), brin_summarize_range(), bt_index_check_internal(), errorMissingRTE(), main(), parserOpenTable(), pg_class_aclmask(), pg_class_ownercheck(), pg_extension_config_dump(), plpgsql_parse_wordrowtype(), RangeVarGetRelidExtended(), RemoveInheritance(), transformLockingClause(), and vacuum_rel().

◆ FNV_OFFSET_BASIS

#define FNV_OFFSET_BASIS UINT64CONST(0xcbf29ce484222325)

Definition at line 68 of file pgbench.c.

Referenced by getHashFnv1a().

◆ FNV_PRIME

#define FNV_PRIME UINT64CONST(0x100000001b3)

Definition at line 67 of file pgbench.c.

Referenced by getHashFnv1a().

◆ INVALID_THREAD

#define INVALID_THREAD ((pthread_t) 0)

Definition at line 405 of file pgbench.c.

Referenced by main().

◆ LOG_STEP_SECONDS

#define LOG_STEP_SECONDS 5 /* seconds between log messages */

Definition at line 104 of file pgbench.c.

Referenced by initGenerateData().

◆ M_PI

#define M_PI 3.14159265358979323846

Definition at line 57 of file pgbench.c.

Referenced by evalStandardFunc(), and getGaussianRand().

◆ MAX_ARGS

#define MAX_ARGS 10

Definition at line 412 of file pgbench.c.

Referenced by parseQuery(), process_backslash_command(), and sendCommand().

◆ MAX_FARGS

#define MAX_FARGS 16

Definition at line 1794 of file pgbench.c.

Referenced by evalStandardFunc().

◆ MAX_PREPARE_NAME

#define MAX_PREPARE_NAME 32

Definition at line 2516 of file pgbench.c.

Referenced by sendCommand().

◆ MAX_SCRIPTS

#define MAX_SCRIPTS 128 /* max number of SQL scripts allowed */

Definition at line 220 of file pgbench.c.

Referenced by addScript().

◆ MAX_ZIPFIAN_PARAM

#define MAX_ZIPFIAN_PARAM 1000 /* maximum parameter for zipfian */

Definition at line 110 of file pgbench.c.

Referenced by evalStandardFunc(), and getZipfianRand().

◆ MAXCLIENTS

#define MAXCLIENTS 1024

Definition at line 99 of file pgbench.c.

Referenced by main().

◆ META_COMMAND

#define META_COMMAND 2

Definition at line 411 of file pgbench.c.

Referenced by CheckConditional(), doCustom(), and process_backslash_command().

◆ MIN_GAUSSIAN_PARAM

#define MIN_GAUSSIAN_PARAM 2.0 /* minimum parameter for gauss */

Definition at line 109 of file pgbench.c.

Referenced by evalStandardFunc(), and getGaussianRand().

◆ MM2_MUL

#define MM2_MUL UINT64CONST(0xc6a4a7935bd1e995)

Definition at line 69 of file pgbench.c.

Referenced by getHashMurmur2().

◆ MM2_ROT

#define MM2_ROT 47

Definition at line 70 of file pgbench.c.

Referenced by getHashMurmur2().

◆ naccounts

#define naccounts 100000

Definition at line 168 of file pgbench.c.

Referenced by initGenerateData().

◆ nbranches

#define nbranches

Value:

1 /* Makes little sense to change this. Change

* -s instead */

Definition at line 165 of file pgbench.c.

Referenced by initGenerateData().

◆ ntellers

#define ntellers 10

Definition at line 167 of file pgbench.c.

Referenced by initGenerateData().

◆ PARAMS_ARRAY_SIZE

#define PARAMS_ARRAY_SIZE 7

Referenced by doConnect().

◆ pthread_t

#define pthread_t void *

Definition at line 88 of file pgbench.c.

Referenced by main(), and setalarm().

◆ SCALE_32BIT_THRESHOLD [1/2]

#define SCALE_32BIT_THRESHOLD 20000

Definition at line 177 of file pgbench.c.

Referenced by initCreateTables().

◆ SCALE_32BIT_THRESHOLD [2/2]

#define SCALE_32BIT_THRESHOLD 20000

Definition at line 177 of file pgbench.c.

◆ SHELL_COMMAND_SIZE

#define SHELL_COMMAND_SIZE 256 /* maximum size allowed for shell command */

Definition at line 221 of file pgbench.c.

Referenced by runShellCommand().

◆ SQL_COMMAND

#define SQL_COMMAND 1

Definition at line 410 of file pgbench.c.

Referenced by doCustom(), main(), process_sql_command(), and sendCommand().

◆ WSEP

#define WSEP '@' /* weight separator */

Definition at line 199 of file pgbench.c.

Referenced by parseScriptWeight().

◆ ZIPF_CACHE_SIZE

#define ZIPF_CACHE_SIZE 15 /* cache cells number */

Definition at line 107 of file pgbench.c.

Referenced by zipfFindOrCreateCacheCell().

Typedef Documentation

◆ BuiltinScript

typedef struct BuiltinScript BuiltinScript

◆ MetaCommand

typedef enum MetaCommand MetaCommand

◆ ParsedScript

typedef struct ParsedScript ParsedScript

◆ QueryMode

typedef enum QueryMode QueryMode

◆ SimpleStats

typedef struct SimpleStats SimpleStats

◆ StatsData

typedef struct StatsData StatsData

Enumeration Type Documentation

◆ ConnectionStateEnum

enum ConnectionStateEnum

Enumerator
CSTATE_CHOOSE_SCRIPT
CSTATE_START_THROTTLE
CSTATE_THROTTLE
CSTATE_START_TX
CSTATE_START_COMMAND
CSTATE_SKIP_COMMAND
CSTATE_WAIT_RESULT
CSTATE_SLEEP
CSTATE_END_COMMAND
CSTATE_END_TX
CSTATE_ABORTED
CSTATE_FINISHED

Definition at line 255 of file pgbench.c.

 {
     /*
      * The client must first choose a script to execute.  Once chosen, it can
      * either be throttled (state CSTATE_START_THROTTLE under --rate) or start
      * right away (state CSTATE_START_TX).
      */
     CSTATE_CHOOSE_SCRIPT,
 
     /*
      * In CSTATE_START_THROTTLE state, we calculate when to begin the next
      * transaction, and advance to CSTATE_THROTTLE.  CSTATE_THROTTLE state
      * sleeps until that moment.  (If throttling is not enabled, doCustom()
      * falls directly through from CSTATE_START_THROTTLE to CSTATE_START_TX.)
      */
     CSTATE_START_THROTTLE,
     CSTATE_THROTTLE,
 
     /*
      * CSTATE_START_TX performs start-of-transaction processing.  Establishes
      * a new connection for the transaction, in --connect mode, and records
      * the transaction start time.
      */
     CSTATE_START_TX,
 
     /*
      * We loop through these states, to process each command in the script:
      *
      * CSTATE_START_COMMAND starts the execution of a command.  On a SQL
      * command, the command is sent to the server, and we move to
      * CSTATE_WAIT_RESULT state.  On a \sleep meta-command, the timer is set,
      * and we enter the CSTATE_SLEEP state to wait for it to expire. Other
      * meta-commands are executed immediately.
      *
      * CSTATE_SKIP_COMMAND for conditional branches which are not executed,
      * quickly skip commands that do not need any evaluation.
      *
      * CSTATE_WAIT_RESULT waits until we get a result set back from the server
      * for the current command.
      *
      * CSTATE_SLEEP waits until the end of \sleep.
      *
      * CSTATE_END_COMMAND records the end-of-command timestamp, increments the
      * command counter, and loops back to CSTATE_START_COMMAND state.
      */
     CSTATE_START_COMMAND,
     CSTATE_SKIP_COMMAND,
     CSTATE_WAIT_RESULT,
     CSTATE_SLEEP,
     CSTATE_END_COMMAND,
 
     /*
      * CSTATE_END_TX performs end-of-transaction processing.  Calculates
      * latency, and logs the transaction.  In --connect mode, closes the
      * current connection.  Chooses the next script to execute and starts over
      * in CSTATE_START_THROTTLE state, or enters CSTATE_FINISHED if we have no
      * more work to do.
      */
     CSTATE_END_TX,
 
     /*
      * Final states.  CSTATE_ABORTED means that the script execution was
      * aborted because a command failed, CSTATE_FINISHED means success.
      */
     CSTATE_ABORTED,
     CSTATE_FINISHED
 } ConnectionStateEnum;

◆ MetaCommand

enum MetaCommand

Enumerator
META_NONE
META_SET
META_SETSHELL
META_SHELL
META_SLEEP
META_IF
META_ELIF
META_ELSE
META_ENDIF

Definition at line 414 of file pgbench.c.

 {
     META_NONE,                  /* not a known meta-command */
     META_SET,                   /* \set */
     META_SETSHELL,              /* \setshell */
     META_SHELL,                 /* \shell */
     META_SLEEP,                 /* \sleep */
     META_IF,                    /* \if */
     META_ELIF,                  /* \elif */
     META_ELSE,                  /* \else */
     META_ENDIF                  /* \endif */
 } MetaCommand;

◆ QueryMode

enum QueryMode

Enumerator
QUERY_SIMPLE
QUERY_EXTENDED
QUERY_PREPARED
NUM_QUERYMODE

Definition at line 427 of file pgbench.c.

 {
     QUERY_SIMPLE,               /* simple query */
     QUERY_EXTENDED,             /* extended query */
     QUERY_PREPARED,             /* extended query with prepared statements */
     NUM_QUERYMODE
 } QueryMode;

Function Documentation

◆ accumStats()

static void accumStats	(	StatsData *	stats,
		bool	skipped,
		double	lat,
		double	lag
	)

static

Definition at line 1045 of file pgbench.c.

References addToSimpleStats(), StatsData::cnt, StatsData::lag, StatsData::latency, and StatsData::skipped.

Referenced by doLog(), and processXactStats().

 {
     stats->cnt++;
 
     if (skipped)
     {
         /* no latency to record on skipped transactions */
         stats->skipped++;
     }
     else
     {
         addToSimpleStats(&stats->latency, lat);
 
         /* and possibly the same for schedule lag */
         if (throttle_delay)
             addToSimpleStats(&stats->lag, lag);
     }
 }

◆ addScript()

static void addScript ( ParsedScript script )

static

Definition at line 4497 of file pgbench.c.

References CheckConditional(), ParsedScript::commands, ParsedScript::desc, MAX_SCRIPTS, and num_scripts.

Referenced by ParseScript().

 {
     if (script.commands == NULL || script.commands[0] == NULL)
     {
         fprintf(stderr, "empty command list for script \"%s\"\n", script.desc);
         exit(1);
     }
 
     if (num_scripts >= MAX_SCRIPTS)
     {
         fprintf(stderr, "at most %d SQL scripts are allowed\n", MAX_SCRIPTS);
         exit(1);
     }
 
     CheckConditional(script);
 
     sql_script[num_scripts] = script;
     num_scripts++;
 }

◆ addToSimpleStats()

static void addToSimpleStats	(	SimpleStats *	ss,
		double	val
	)

static

Definition at line 1001 of file pgbench.c.

References SimpleStats::count, SimpleStats::max, SimpleStats::min, SimpleStats::sum, SimpleStats::sum2, and val.

Referenced by accumStats(), and doCustom().

 {
     if (ss->count == 0 || val < ss->min)
         ss->min = val;
     if (ss->count == 0 || val > ss->max)
         ss->max = val;
     ss->count++;
     ss->sum += val;
     ss->sum2 += val * val;
 }

◆ assignVariables()

static char* assignVariables	(	CState *	st,
		char *	sql
	)

static

Definition at line 1492 of file pgbench.c.

References free, getVariable(), name, parseVariable(), replaceVariable(), and val.

Referenced by sendCommand().

 {
     char       *p,
                *name,
                *val;
 
     p = sql;
     while ((p = strchr(p, ':')) != NULL)
     {
         int         eaten;
 
         name = parseVariable(p, &eaten);
         if (name == NULL)
         {
             while (*p == ':')
             {
                 p++;
             }
             continue;
         }
 
         val = getVariable(st, name);
         free(name);
         if (val == NULL)
         {
             p++;
             continue;
         }
 
         p = replaceVariable(&sql, p, eaten, val);
     }
 
     return sql;
 }

◆ CheckConditional()

static void CheckConditional ( ParsedScript ps )

static

Definition at line 4183 of file pgbench.c.

References ParsedScript::commands, conditional_stack_create(), conditional_stack_destroy(), conditional_stack_empty(), conditional_stack_peek(), conditional_stack_poke(), conditional_stack_pop(), conditional_stack_push(), ConditionError(), ParsedScript::desc, i, IFSTATE_ELSE_FALSE, IFSTATE_FALSE, Command::meta, META_COMMAND, META_ELIF, META_ELSE, META_ENDIF, META_IF, and Command::type.

Referenced by addScript().

 {
     /* statically check conditional structure */
     ConditionalStack cs = conditional_stack_create();
     int i;
     for (i = 0 ; ps.commands[i] != NULL ; i++)
     {
         Command *cmd = ps.commands[i];
         if (cmd->type == META_COMMAND)
         {
             switch (cmd->meta)
             {
             case META_IF:
                 conditional_stack_push(cs, IFSTATE_FALSE);
                 break;
             case META_ELIF:
                 if (conditional_stack_empty(cs))
                     ConditionError(ps.desc, i+1, "\\elif without matching \\if");
                 if (conditional_stack_peek(cs) == IFSTATE_ELSE_FALSE)
                     ConditionError(ps.desc, i+1, "\\elif after \\else");
                 break;
             case META_ELSE:
                 if (conditional_stack_empty(cs))
                     ConditionError(ps.desc, i+1, "\\else without matching \\if");
                 if (conditional_stack_peek(cs) == IFSTATE_ELSE_FALSE)
                     ConditionError(ps.desc, i+1, "\\else after \\else");
                 conditional_stack_poke(cs, IFSTATE_ELSE_FALSE);
                 break;
             case META_ENDIF:
                 if (!conditional_stack_pop(cs))
                     ConditionError(ps.desc, i+1, "\\endif without matching \\if");
                 break;
             default:
                 /* ignore anything else... */
                 break;
             }
         }
     }
     if (!conditional_stack_empty(cs))
         ConditionError(ps.desc, i+1, "\\if without matching \\endif");
     conditional_stack_destroy(cs);
 }

◆ checkInitSteps()

static void checkInitSteps ( const char * initialize_steps )

static

Definition at line 3751 of file pgbench.c.

Referenced by main().

 {
     const char *step;
 
     if (initialize_steps[0] == '\0')
     {
         fprintf(stderr, "no initialization steps specified\n");
         exit(1);
     }
 
     for (step = initialize_steps; *step != '\0'; step++)
     {
         if (strchr("dtgvpf ", *step) == NULL)
         {
             fprintf(stderr, "unrecognized initialization step \"%c\"\n",
                     *step);
             fprintf(stderr, "allowed steps are: \"d\", \"t\", \"g\", \"v\", \"p\", \"f\"\n");
             exit(1);
         }
     }
 }

◆ chooseScript()

static int chooseScript ( TState * thread )

static

Definition at line 2533 of file pgbench.c.

References getrand(), i, and ParsedScript::weight.

Referenced by doCustom().

 {
     int         i = 0;
     int64       w;
 
     if (num_scripts == 1)
         return 0;
 
     w = getrand(thread, 0, total_weight - 1);
     do
     {
         w -= sql_script[i++].weight;
     } while (w >= 0);
 
     return i - 1;
 }

◆ coerceToBool()

static bool coerceToBool	(	PgBenchValue *	pval,
		bool *	bval
	)

static

Definition at line 1559 of file pgbench.c.

References PgBenchValue::bval, PGBT_BOOLEAN, PgBenchValue::type, PgBenchValue::u, and valueTypeName().

Referenced by evalLazyFunc(), and evalStandardFunc().

 {
     if (pval->type == PGBT_BOOLEAN)
     {
         *bval = pval->u.bval;
         return true;
     }
     else /* NULL, INT or DOUBLE */
     {
         fprintf(stderr, "cannot coerce %s to boolean\n", valueTypeName(pval));
         *bval = false;          /* suppress uninitialized-variable warnings */
         return false;
     }
 }

◆ coerceToDouble()

static bool coerceToDouble	(	PgBenchValue *	pval,
		double *	dval
	)

static

Definition at line 1628 of file pgbench.c.

References PgBenchValue::dval, PgBenchValue::ival, PGBT_DOUBLE, PGBT_INT, PgBenchValue::type, PgBenchValue::u, and valueTypeName().

Referenced by evalStandardFunc().

 {
     if (pval->type == PGBT_DOUBLE)
     {
         *dval = pval->u.dval;
         return true;
     }
     else if (pval->type == PGBT_INT)
     {
         *dval = (double) pval->u.ival;
         return true;
     }
     else /* BOOLEAN or NULL */
     {
         fprintf(stderr, "cannot coerce %s to double\n", valueTypeName(pval));
         return false;
     }
 }

◆ coerceToInt()

static bool coerceToInt	(	PgBenchValue *	pval,
		int64 *	ival
	)

static

Definition at line 1600 of file pgbench.c.

References PgBenchValue::dval, PgBenchValue::ival, PG_INT64_MAX, PG_INT64_MIN, PGBT_DOUBLE, PGBT_INT, PgBenchValue::type, PgBenchValue::u, and valueTypeName().

Referenced by evalStandardFunc().

 {
     if (pval->type == PGBT_INT)
     {
         *ival = pval->u.ival;
         return true;
     }
     else if (pval->type == PGBT_DOUBLE)
     {
         double      dval = pval->u.dval;
 
         if (dval < PG_INT64_MIN || PG_INT64_MAX < dval)
         {
             fprintf(stderr, "double to int overflow for %f\n", dval);
             return false;
         }
         *ival = (int64) dval;
         return true;
     }
     else /* BOOLEAN or NULL */
     {
         fprintf(stderr, "cannot coerce %s to int\n", valueTypeName(pval));
         return false;
     }
 }

◆ commandFailed()

static void commandFailed	(	CState *	st,
		const char *	cmd,
		const char *	message
	)

static

Definition at line 2524 of file pgbench.c.

References CState::command, CState::id, and CState::use_file.

Referenced by doCustom().

 {
     fprintf(stderr,
             "client %d aborted in command %d (%s) of script %d; %s\n",
             st->id, st->command, cmd, st->use_file, message);
 }

◆ compareVariableNames()

static int compareVariableNames	(	const void *	v1,
		const void *	v2
	)

static

Definition at line 1179 of file pgbench.c.

References name.

Referenced by lookupVariable().

 {
     return strcmp(((const Variable *) v1)->name,
                   ((const Variable *) v2)->name);
 }

◆ computeHarmonicZipfian()

static int64 computeHarmonicZipfian	(	TState *	thread,
		int64	n,
		double	s
	)

static

Definition at line 912 of file pgbench.c.

References ZipfCell::alpha, ZipfCell::eta, ZipfCell::harmonicn, ZipfCell::n, pg_erand48(), TState::random_state, TState::zipf_cache, and zipfFindOrCreateCacheCell().

Referenced by getZipfianRand().

 {
     ZipfCell   *cell = zipfFindOrCreateCacheCell(&thread->zipf_cache, n, s);
     double      uniform = pg_erand48(thread->random_state);
     double      uz = uniform * cell->harmonicn;
 
     if (uz < 1.0)
         return 1;
     if (uz < 1.0 + cell->beta)
         return 2;
     return 1 + (int64) (cell->n * pow(cell->eta * uniform - cell->eta + 1.0, cell->alpha));
 }

◆ computeIterativeZipfian()

static int64 computeIterativeZipfian	(	TState *	thread,
		int64	n,
		double	s
	)

static

Definition at line 882 of file pgbench.c.

References pg_erand48(), and TState::random_state.

Referenced by getZipfianRand().

 {
     double      b = pow(2.0, s - 1.0);
     double      x,
                 t,
                 u,
                 v;
 
     while (true)
     {
         /* random variates */
         u = pg_erand48(thread->random_state);
         v = pg_erand48(thread->random_state);
 
         x = floor(pow(u, -1.0 / (s - 1.0)));
 
         t = pow(1.0 + 1.0 / x, s - 1.0);
         /* reject if too large or out of bound */
         if (v * x * (t - 1.0) / (b - 1.0) <= t / b && x <= n)
             break;
     }
     return (int64) x;
 }

◆ ConditionError()

static void ConditionError	(	const char *	desc,
		int	cmdn,
		const char *	msg
	)

static

Definition at line 4171 of file pgbench.c.

Referenced by CheckConditional().

 {
     fprintf(stderr,
             "condition error in script \"%s\" command %d: %s\n",
             desc, cmdn, msg);
     exit(1);
 }

◆ discard_response()

static void discard_response ( CState * state )

static

Definition at line 1165 of file pgbench.c.

References CState::con, PQclear(), and PQgetResult().

Referenced by doCustom().

 {
     PGresult   *res;
 
     do
     {
         res = PQgetResult(state->con);
         if (res)
             PQclear(res);
     } while (res);
 }

◆ disconnect_all()

static void disconnect_all	(	CState *	state,
		int	length
	)

static

Definition at line 3411 of file pgbench.c.

References finishCon(), i, and length().

Referenced by main(), and threadRun().

 {
     int         i;
 
     for (i = 0; i < length; i++)
         finishCon(&state[i]);
 }

◆ doConnect()

static PGconn* doConnect ( void )

static

Definition at line 1096 of file pgbench.c.

References conn, CONNECTION_BAD, dbName, have_password, login, PARAMS_ARRAY_SIZE, password, pghost, pgport, PQconnectdbParams(), PQconnectionNeedsPassword(), PQerrorMessage(), PQfinish(), PQstatus(), progname, simple_prompt(), and values.

Referenced by doCustom(), main(), runInitSteps(), and threadRun().

 {
     PGconn     *conn;
     bool        new_pass;
     static bool have_password = false;
     static char password[100];
 
     /*
      * Start the connection.  Loop until we have a password if requested by
      * backend.
      */
     do
     {
 #define PARAMS_ARRAY_SIZE   7
 
         const char *keywords[PARAMS_ARRAY_SIZE];
         const char *values[PARAMS_ARRAY_SIZE];
 
         keywords[0] = "host";
         values[0] = pghost;
         keywords[1] = "port";
         values[1] = pgport;
         keywords[2] = "user";
         values[2] = login;
         keywords[3] = "password";
         values[3] = have_password ? password : NULL;
         keywords[4] = "dbname";
         values[4] = dbName;
         keywords[5] = "fallback_application_name";
         values[5] = progname;
         keywords[6] = NULL;
         values[6] = NULL;
 
         new_pass = false;
 
         conn = PQconnectdbParams(keywords, values, true);
 
         if (!conn)
         {
             fprintf(stderr, "connection to database \"%s\" failed\n",
                     dbName);
             return NULL;
         }
 
         if (PQstatus(conn) == CONNECTION_BAD &&
             PQconnectionNeedsPassword(conn) &&
             !have_password)
         {
             PQfinish(conn);
             simple_prompt("Password: ", password, sizeof(password), false);
             have_password = true;
             new_pass = true;
         }
     } while (new_pass);
 
     /* check to see that the backend connection was successfully made */
     if (PQstatus(conn) == CONNECTION_BAD)
     {
         fprintf(stderr, "connection to database \"%s\" failed:\n%s",
                 dbName, PQerrorMessage(conn));
         PQfinish(conn);
         return NULL;
     }
 
     return conn;
 }

◆ doCustom()

static void doCustom	(	TState *	thread,
		CState *	st,
		StatsData *	agg
	)

static

Definition at line 2671 of file pgbench.c.

References addToSimpleStats(), Command::argc, Command::argv, Assert, chooseScript(), CState::cnt, CState::command, commandFailed(), ParsedScript::commands, CState::con, conditional_active(), conditional_stack_empty(), conditional_stack_peek(), conditional_stack_poke(), conditional_stack_pop(), conditional_stack_push(), TState::conn_time, CState::cstack, CSTATE_ABORTED, CSTATE_CHOOSE_SCRIPT, CSTATE_END_COMMAND, CSTATE_END_TX, CSTATE_FINISHED, CSTATE_SKIP_COMMAND, CSTATE_SLEEP, CSTATE_START_COMMAND, CSTATE_START_THROTTLE, CSTATE_START_TX, CSTATE_THROTTLE, CSTATE_WAIT_RESULT, ParsedScript::desc, discard_response(), doConnect(), evaluateExpr(), evaluateSleep(), Command::expr, finishCon(), getPoissonRand(), i, CState::id, IFSTATE_ELSE_FALSE, IFSTATE_ELSE_TRUE, IFSTATE_FALSE, IFSTATE_IGNORED, IFSTATE_NONE, IFSTATE_TRUE, INSTR_TIME_ACCUM_DIFF, INSTR_TIME_GET_DOUBLE, INSTR_TIME_GET_MICROSEC, INSTR_TIME_IS_ZERO, INSTR_TIME_SET_CURRENT, INSTR_TIME_SET_ZERO, INT64_FORMAT, Command::meta, META_COMMAND, META_ELIF, META_ELSE, META_ENDIF, META_IF, META_SET, META_SETSHELL, META_SHELL, META_SLEEP, now(), PGRES_COMMAND_OK, PGRES_EMPTY_QUERY, PGRES_TUPLES_OK, PQclear(), PQconsumeInput(), PQerrorMessage(), PQgetResult(), PQisBusy(), PQresultStatus(), CState::prepared, processXactStats(), putVariableValue(), runShellCommand(), sendCommand(), CState::sleep_until, SQL_COMMAND, CState::state, Command::stats, CState::stmt_begin, TState::throttle_trigger, CState::txn_begin, CState::txn_scheduled, Command::type, CState::use_file, and valueTruth().

Referenced by threadRun().

 {
     PGresult   *res;
     Command    *command;
     instr_time  now;
     bool        end_tx_processed = false;
     int64       wait;
 
     /*
      * gettimeofday() isn't free, so we get the current timestamp lazily the
      * first time it's needed, and reuse the same value throughout this
      * function after that.  This also ensures that e.g. the calculated
      * latency reported in the log file and in the totals are the same. Zero
      * means "not set yet".  Reset "now" when we execute shell commands or
      * expressions, which might take a non-negligible amount of time, though.
      */
     INSTR_TIME_SET_ZERO(now);
 
     /*
      * Loop in the state machine, until we have to wait for a result from the
      * server (or have to sleep, for throttling or for \sleep).
      *
      * Note: In the switch-statement below, 'break' will loop back here,
      * meaning "continue in the state machine".  Return is used to return to
      * the caller.
      */
     for (;;)
     {
         switch (st->state)
         {
                 /*
                  * Select transaction to run.
                  */
             case CSTATE_CHOOSE_SCRIPT:
 
                 st->use_file = chooseScript(thread);
 
                 if (debug)
                     fprintf(stderr, "client %d executing script \"%s\"\n", st->id,
                             sql_script[st->use_file].desc);
 
                 if (throttle_delay > 0)
                     st->state = CSTATE_START_THROTTLE;
                 else
                     st->state = CSTATE_START_TX;
                 /* check consistency */
                 Assert(conditional_stack_empty(st->cstack));
                 break;
 
                 /*
                  * Handle throttling once per transaction by sleeping.
                  */
             case CSTATE_START_THROTTLE:
 
                 /*
                  * Generate a delay such that the series of delays will
                  * approximate a Poisson distribution centered on the
                  * throttle_delay time.
                  *
                  * If transactions are too slow or a given wait is shorter
                  * than a transaction, the next transaction will start right
                  * away.
                  */
                 Assert(throttle_delay > 0);
                 wait = getPoissonRand(thread, throttle_delay);
 
                 thread->throttle_trigger += wait;
                 st->txn_scheduled = thread->throttle_trigger;
 
                 /*
                  * stop client if next transaction is beyond pgbench end of
                  * execution
                  */
                 if (duration > 0 && st->txn_scheduled > end_time)
                 {
                     st->state = CSTATE_FINISHED;
                     break;
                 }
 
                 /*
                  * If --latency-limit is used, and this slot is already late
                  * so that the transaction will miss the latency limit even if
                  * it completed immediately, we skip this time slot and
                  * iterate till the next slot that isn't late yet.  But don't
                  * iterate beyond the -t limit, if one is given.
                  */
                 if (latency_limit)
                 {
                     int64       now_us;
 
                     if (INSTR_TIME_IS_ZERO(now))
                         INSTR_TIME_SET_CURRENT(now);
                     now_us = INSTR_TIME_GET_MICROSEC(now);
                     while (thread->throttle_trigger < now_us - latency_limit &&
                            (nxacts <= 0 || st->cnt < nxacts))
                     {
                         processXactStats(thread, st, &now, true, agg);
                         /* next rendez-vous */
                         wait = getPoissonRand(thread, throttle_delay);
                         thread->throttle_trigger += wait;
                         st->txn_scheduled = thread->throttle_trigger;
                     }
                     /* stop client if -t exceeded */
                     if (nxacts > 0 && st->cnt >= nxacts)
                     {
                         st->state = CSTATE_FINISHED;
                         break;
                     }
                 }
 
                 st->state = CSTATE_THROTTLE;
                 if (debug)
                     fprintf(stderr, "client %d throttling " INT64_FORMAT " us\n",
                             st->id, wait);
                 break;
 
                 /*
                  * Wait until it's time to start next transaction.
                  */
             case CSTATE_THROTTLE:
                 if (INSTR_TIME_IS_ZERO(now))
                     INSTR_TIME_SET_CURRENT(now);
                 if (INSTR_TIME_GET_MICROSEC(now) < st->txn_scheduled)
                     return;     /* Still sleeping, nothing to do here */
 
                 /* Else done sleeping, start the transaction */
                 st->state = CSTATE_START_TX;
                 break;
 
                 /* Start new transaction */
             case CSTATE_START_TX:
 
                 /*
                  * Establish connection on first call, or if is_connect is
                  * true.
                  */
                 if (st->con == NULL)
                 {
                     instr_time  start;
 
                     if (INSTR_TIME_IS_ZERO(now))
                         INSTR_TIME_SET_CURRENT(now);
                     start = now;
                     if ((st->con = doConnect()) == NULL)
                     {
                         fprintf(stderr, "client %d aborted while establishing connection\n",
                                 st->id);
                         st->state = CSTATE_ABORTED;
                         break;
                     }
                     INSTR_TIME_SET_CURRENT(now);
                     INSTR_TIME_ACCUM_DIFF(thread->conn_time, now, start);
 
                     /* Reset session-local state */
                     memset(st->prepared, 0, sizeof(st->prepared));
                 }
 
                 /*
                  * Record transaction start time under logging, progress or
                  * throttling.
                  */
                 if (use_log || progress || throttle_delay || latency_limit ||
                     per_script_stats)
                 {
                     if (INSTR_TIME_IS_ZERO(now))
                         INSTR_TIME_SET_CURRENT(now);
                     st->txn_begin = now;
 
                     /*
                      * When not throttling, this is also the transaction's
                      * scheduled start time.
                      */
                     if (!throttle_delay)
                         st->txn_scheduled = INSTR_TIME_GET_MICROSEC(now);
                 }
 
                 /* Begin with the first command */
                 st->command = 0;
                 st->state = CSTATE_START_COMMAND;
                 break;
 
                 /*
                  * Send a command to server (or execute a meta-command)
                  */
             case CSTATE_START_COMMAND:
                 command = sql_script[st->use_file].commands[st->command];
 
                 /*
                  * If we reached the end of the script, move to end-of-xact
                  * processing.
                  */
                 if (command == NULL)
                 {
                     st->state = CSTATE_END_TX;
                     break;
                 }
 
                 /*
                  * Record statement start time if per-command latencies are
                  * requested
                  */
                 if (is_latencies)
                 {
                     if (INSTR_TIME_IS_ZERO(now))
                         INSTR_TIME_SET_CURRENT(now);
                     st->stmt_begin = now;
                 }
 
                 if (command->type == SQL_COMMAND)
                 {
                     if (!sendCommand(st, command))
                     {
                         commandFailed(st, "SQL", "SQL command send failed");
                         st->state = CSTATE_ABORTED;
                     }
                     else
                         st->state = CSTATE_WAIT_RESULT;
                 }
                 else if (command->type == META_COMMAND)
                 {
                     int         argc = command->argc,
                                 i;
                     char      **argv = command->argv;
 
                     if (debug)
                     {
                         fprintf(stderr, "client %d executing \\%s", st->id, argv[0]);
                         for (i = 1; i < argc; i++)
                             fprintf(stderr, " %s", argv[i]);
                         fprintf(stderr, "\n");
                     }
 
                     if (command->meta == META_SLEEP)
                     {
                         /*
                          * A \sleep doesn't execute anything, we just get the
                          * delay from the argument, and enter the CSTATE_SLEEP
                          * state.  (The per-command latency will be recorded
                          * in CSTATE_SLEEP state, not here, after the delay
                          * has elapsed.)
                          */
                         int         usec;
 
                         if (!evaluateSleep(st, argc, argv, &usec))
                         {
                             commandFailed(st, "sleep", "execution of meta-command failed");
                             st->state = CSTATE_ABORTED;
                             break;
                         }
 
                         if (INSTR_TIME_IS_ZERO(now))
                             INSTR_TIME_SET_CURRENT(now);
                         st->sleep_until = INSTR_TIME_GET_MICROSEC(now) + usec;
                         st->state = CSTATE_SLEEP;
                         break;
                     }
                     else if (command->meta == META_SET ||
                              command->meta == META_IF ||
                              command->meta == META_ELIF)
                     {
                         /* backslash commands with an expression to evaluate */
                         PgBenchExpr *expr = command->expr;
                         PgBenchValue result;
 
                         if (command->meta == META_ELIF &&
                             conditional_stack_peek(st->cstack) == IFSTATE_TRUE)
                         {
                             /* elif after executed block, skip eval and wait for endif */
                             conditional_stack_poke(st->cstack, IFSTATE_IGNORED);
                             goto move_to_end_command;
                         }
 
                         if (!evaluateExpr(thread, st, expr, &result))
                         {
                             commandFailed(st, argv[0], "evaluation of meta-command failed");
                             st->state = CSTATE_ABORTED;
                             break;
                         }
 
                         if (command->meta == META_SET)
                         {
                             if (!putVariableValue(st, argv[0], argv[1], &result))
                             {
                                 commandFailed(st, "set", "assignment of meta-command failed");
                                 st->state = CSTATE_ABORTED;
                                 break;
                             }
                         }
                         else /* if and elif evaluated cases */
                         {
                             bool cond = valueTruth(&result);
 
                             /* execute or not depending on evaluated condition */
                             if (command->meta == META_IF)
                             {
                                 conditional_stack_push(st->cstack, cond ? IFSTATE_TRUE : IFSTATE_FALSE);
                             }
                             else /* elif */
                             {
                                 /* we should get here only if the "elif" needed evaluation */
                                 Assert(conditional_stack_peek(st->cstack) == IFSTATE_FALSE);
                                 conditional_stack_poke(st->cstack, cond ? IFSTATE_TRUE : IFSTATE_FALSE);
                             }
                         }
                     }
                     else if (command->meta == META_ELSE)
                     {
                         switch (conditional_stack_peek(st->cstack))
                         {
                             case IFSTATE_TRUE:
                                 conditional_stack_poke(st->cstack, IFSTATE_ELSE_FALSE);
                                 break;
                             case IFSTATE_FALSE: /* inconsistent if active */
                             case IFSTATE_IGNORED: /* inconsistent if active */
                             case IFSTATE_NONE: /* else without if */
                             case IFSTATE_ELSE_TRUE: /* else after else */
                             case IFSTATE_ELSE_FALSE: /* else after else */
                             default:
                                 /* dead code if conditional check is ok */
                                 Assert(false);
                         }
                         goto move_to_end_command;
                     }
                     else if (command->meta == META_ENDIF)
                     {
                         Assert(!conditional_stack_empty(st->cstack));
                         conditional_stack_pop(st->cstack);
                         goto move_to_end_command;
                     }
                     else if (command->meta == META_SETSHELL)
                     {
                         bool        ret = runShellCommand(st, argv[1], argv + 2, argc - 2);
 
                         if (timer_exceeded) /* timeout */
                         {
                             st->state = CSTATE_FINISHED;
                             break;
                         }
                         else if (!ret)  /* on error */
                         {
                             commandFailed(st, "setshell", "execution of meta-command failed");
                             st->state = CSTATE_ABORTED;
                             break;
                         }
                         else
                         {
                             /* succeeded */
                         }
                     }
                     else if (command->meta == META_SHELL)
                     {
                         bool        ret = runShellCommand(st, NULL, argv + 1, argc - 1);
 
                         if (timer_exceeded) /* timeout */
                         {
                             st->state = CSTATE_FINISHED;
                             break;
                         }
                         else if (!ret)  /* on error */
                         {
                             commandFailed(st, "shell", "execution of meta-command failed");
                             st->state = CSTATE_ABORTED;
                             break;
                         }
                         else
                         {
                             /* succeeded */
                         }
                     }
 
                     move_to_end_command:
                     /*
                      * executing the expression or shell command might
                      * take a non-negligible amount of time, so reset
                      * 'now'
                      */
                     INSTR_TIME_SET_ZERO(now);
 
                     st->state = CSTATE_END_COMMAND;
                 }
                 break;
 
                 /*
                  * non executed conditional branch
                  */
             case CSTATE_SKIP_COMMAND:
                 Assert(!conditional_active(st->cstack));
                 /* quickly skip commands until something to do... */
                 while (true)
                 {
                     command = sql_script[st->use_file].commands[st->command];
 
                     /* cannot reach end of script in that state */
                     Assert(command != NULL);
 
                     /* if this is conditional related, update conditional state */
                     if (command->type == META_COMMAND &&
                         (command->meta == META_IF ||
                          command->meta == META_ELIF ||
                          command->meta == META_ELSE ||
                          command->meta == META_ENDIF))
                     {
                         switch (conditional_stack_peek(st->cstack))
                         {
                         case IFSTATE_FALSE:
                             if (command->meta == META_IF || command->meta == META_ELIF)
                             {
                                 /* we must evaluate the condition */
                                 st->state = CSTATE_START_COMMAND;
                             }
                             else if (command->meta == META_ELSE)
                             {
                                 /* we must execute next command */
                                 conditional_stack_poke(st->cstack, IFSTATE_ELSE_TRUE);
                                 st->state = CSTATE_START_COMMAND;
                                 st->command++;
                             }
                             else if (command->meta == META_ENDIF)
                             {
                                 Assert(!conditional_stack_empty(st->cstack));
                                 conditional_stack_pop(st->cstack);
                                 if (conditional_active(st->cstack))
                                     st->state = CSTATE_START_COMMAND;
                                 /* else state remains in CSTATE_SKIP_COMMAND */
                                 st->command++;
                             }
                             break;
 
                         case IFSTATE_IGNORED:
                         case IFSTATE_ELSE_FALSE:
                             if (command->meta == META_IF)
                                 conditional_stack_push(st->cstack, IFSTATE_IGNORED);
                             else if (command->meta == META_ENDIF)
                             {
                                 Assert(!conditional_stack_empty(st->cstack));
                                 conditional_stack_pop(st->cstack);
                                 if (conditional_active(st->cstack))
                                     st->state = CSTATE_START_COMMAND;
                             }
                             /* could detect "else" & "elif" after "else" */
                             st->command++;
                             break;
 
                         case IFSTATE_NONE:
                         case IFSTATE_TRUE:
                         case IFSTATE_ELSE_TRUE:
                         default:
                             /* inconsistent if inactive, unreachable dead code */
                             Assert(false);
                         }
                     }
                     else
                     {
                         /* skip and consider next */
                         st->command++;
                     }
 
                     if (st->state != CSTATE_SKIP_COMMAND)
                         break;
                 }
                 break;
 
                 /*
                  * Wait for the current SQL command to complete
                  */
             case CSTATE_WAIT_RESULT:
                 command = sql_script[st->use_file].commands[st->command];
                 if (debug)
                     fprintf(stderr, "client %d receiving\n", st->id);
                 if (!PQconsumeInput(st->con))
                 {               /* there's something wrong */
                     commandFailed(st, "SQL", "perhaps the backend died while processing");
                     st->state = CSTATE_ABORTED;
                     break;
                 }
                 if (PQisBusy(st->con))
                     return;     /* don't have the whole result yet */
 
                 /*
                  * Read and discard the query result;
                  */
                 res = PQgetResult(st->con);
                 switch (PQresultStatus(res))
                 {
                     case PGRES_COMMAND_OK:
                     case PGRES_TUPLES_OK:
                     case PGRES_EMPTY_QUERY:
                         /* OK */
                         PQclear(res);
                         discard_response(st);
                         st->state = CSTATE_END_COMMAND;
                         break;
                     default:
                         commandFailed(st, "SQL", PQerrorMessage(st->con));
                         PQclear(res);
                         st->state = CSTATE_ABORTED;
                         break;
                 }
                 break;
 
                 /*
                  * Wait until sleep is done. This state is entered after a
                  * \sleep metacommand. The behavior is similar to
                  * CSTATE_THROTTLE, but proceeds to CSTATE_START_COMMAND
                  * instead of CSTATE_START_TX.
                  */
             case CSTATE_SLEEP:
                 if (INSTR_TIME_IS_ZERO(now))
                     INSTR_TIME_SET_CURRENT(now);
                 if (INSTR_TIME_GET_MICROSEC(now) < st->sleep_until)
                     return;     /* Still sleeping, nothing to do here */
                 /* Else done sleeping. */
                 st->state = CSTATE_END_COMMAND;
                 break;
 
                 /*
                  * End of command: record stats and proceed to next command.
                  */
             case CSTATE_END_COMMAND:
 
                 /*
                  * command completed: accumulate per-command execution times
                  * in thread-local data structure, if per-command latencies
                  * are requested.
                  */
                 if (is_latencies)
                 {
                     if (INSTR_TIME_IS_ZERO(now))
                         INSTR_TIME_SET_CURRENT(now);
 
                     /* XXX could use a mutex here, but we choose not to */
                     command = sql_script[st->use_file].commands[st->command];
                     addToSimpleStats(&command->stats,
                                      INSTR_TIME_GET_DOUBLE(now) -
                                      INSTR_TIME_GET_DOUBLE(st->stmt_begin));
                 }
 
                 /* Go ahead with next command, to be executed or skipped */
                 st->command++;
                 st->state = conditional_active(st->cstack) ?
                     CSTATE_START_COMMAND : CSTATE_SKIP_COMMAND;
                 break;
 
                 /*
                  * End of transaction.
                  */
             case CSTATE_END_TX:
 
                 /* transaction finished: calculate latency and do log */
                 processXactStats(thread, st, &now, false, agg);
 
                 /* conditional stack must be empty */
                 if (!conditional_stack_empty(st->cstack))
                 {
                     fprintf(stderr, "end of script reached within a conditional, missing \\endif\n");
                     exit(1);
                 }
 
                 if (is_connect)
                 {
                     finishCon(st);
                     INSTR_TIME_SET_ZERO(now);
                 }
 
                 if ((st->cnt >= nxacts && duration <= 0) || timer_exceeded)
                 {
                     /* exit success */
                     st->state = CSTATE_FINISHED;
                     break;
                 }
 
                 /*
                  * No transaction is underway anymore.
                  */
                 st->state = CSTATE_CHOOSE_SCRIPT;
 
                 /*
                  * If we paced through all commands in the script in this
                  * loop, without returning to the caller even once, do it now.
                  * This gives the thread a chance to process other
                  * connections, and to do progress reporting.  This can
                  * currently only happen if the script consists entirely of
                  * meta-commands.
                  */
                 if (end_tx_processed)
                     return;
                 else
                 {
                     end_tx_processed = true;
                     break;
                 }
 
                 /*
                  * Final states.  Close the connection if it's still open.
                  */
             case CSTATE_ABORTED:
             case CSTATE_FINISHED:
                 finishCon(st);
                 return;
         }
     }
 }

◆ doLog()

static void doLog	(	TState *	thread,
		CState *	st,
		StatsData *	agg,
		bool	skipped,
		double	latency,
		double	lag
	)

static

Definition at line 3283 of file pgbench.c.

References accumStats(), Assert, StatsData::cnt, CState::cnt, gettimeofday(), CState::id, initStats(), INT64_FORMAT, StatsData::lag, StatsData::latency, logfile, TState::logfile, SimpleStats::max, SimpleStats::min, pg_erand48(), TState::random_state, StatsData::skipped, StatsData::start_time, SimpleStats::sum, SimpleStats::sum2, and CState::use_file.

Referenced by processXactStats(), and threadRun().

 {
     FILE       *logfile = thread->logfile;
 
     Assert(use_log);
 
     /*
      * Skip the log entry if sampling is enabled and this row doesn't belong
      * to the random sample.
      */
     if (sample_rate != 0.0 &&
         pg_erand48(thread->random_state) > sample_rate)
         return;
 
     /* should we aggregate the results or not? */
     if (agg_interval > 0)
     {
         /*
          * Loop until we reach the interval of the current moment, and print
          * any empty intervals in between (this may happen with very low tps,
          * e.g. --rate=0.1).
          */
         time_t      now = time(NULL);
 
         while (agg->start_time + agg_interval <= now)
         {
             /* print aggregated report to logfile */
             fprintf(logfile, "%ld " INT64_FORMAT " %.0f %.0f %.0f %.0f",
                     (long) agg->start_time,
                     agg->cnt,
                     agg->latency.sum,
                     agg->latency.sum2,
                     agg->latency.min,
                     agg->latency.max);
             if (throttle_delay)
             {
                 fprintf(logfile, " %.0f %.0f %.0f %.0f",
                         agg->lag.sum,
                         agg->lag.sum2,
                         agg->lag.min,
                         agg->lag.max);
                 if (latency_limit)
                     fprintf(logfile, " " INT64_FORMAT, agg->skipped);
             }
             fputc('\n', logfile);
 
             /* reset data and move to next interval */
             initStats(agg, agg->start_time + agg_interval);
         }
 
         /* accumulate the current transaction */
         accumStats(agg, skipped, latency, lag);
     }
     else
     {
         /* no, print raw transactions */
         struct timeval tv;
 
         gettimeofday(&tv, NULL);
         if (skipped)
             fprintf(logfile, "%d " INT64_FORMAT " skipped %d %ld %ld",
                     st->id, st->cnt, st->use_file,
                     (long) tv.tv_sec, (long) tv.tv_usec);
         else
             fprintf(logfile, "%d " INT64_FORMAT " %.0f %d %ld %ld",
                     st->id, st->cnt, latency, st->use_file,
                     (long) tv.tv_sec, (long) tv.tv_usec);
         if (throttle_delay)
             fprintf(logfile, " %.0f", lag);
         fputc('\n', logfile);
     }
 }

◆ evalFunc()

static bool evalFunc	(	TState *	thread,
		CState *	st,
		PgBenchFunction	func,
		PgBenchExprLink *	args,
		PgBenchValue *	retval
	)

static

Definition at line 2319 of file pgbench.c.

References evalLazyFunc(), evalStandardFunc(), and isLazyFunc().

Referenced by evaluateExpr().

 {
     if (isLazyFunc(func))
         return evalLazyFunc(thread, st, func, args, retval);
     else
         return evalStandardFunc(thread, st, func, args, retval);
 }

◆ evalLazyFunc()

static bool evalLazyFunc	(	TState *	thread,
		CState *	st,
		PgBenchFunction	func,
		PgBenchExprLink *	args,
		PgBenchValue *	retval
	)

static

Definition at line 1686 of file pgbench.c.

References a1, a2, Assert, coerceToBool(), evaluateExpr(), PgBenchExprLink::expr, isLazyFunc(), PgBenchExprLink::next, PGBENCH_AND, PGBENCH_CASE, PGBENCH_OR, PGBT_NULL, setBoolValue(), setNullValue(), PgBenchValue::type, and valueTruth().

Referenced by evalFunc().

 {
     PgBenchValue a1, a2;
     bool ba1, ba2;
 
     Assert(isLazyFunc(func) && args != NULL && args->next != NULL);
 
     /* args points to first condition */
     if (!evaluateExpr(thread, st, args->expr, &a1))
         return false;
 
     /* second condition for AND/OR and corresponding branch for CASE */
     args = args->next;
 
     switch (func)
     {
     case PGBENCH_AND:
         if (a1.type == PGBT_NULL)
         {
             setNullValue(retval);
             return true;
         }
 
         if (!coerceToBool(&a1, &ba1))
             return false;
 
         if (!ba1)
         {
             setBoolValue(retval, false);
             return true;
         }
 
         if (!evaluateExpr(thread, st, args->expr, &a2))
             return false;
 
         if (a2.type == PGBT_NULL)
         {
             setNullValue(retval);
             return true;
         }
         else if (!coerceToBool(&a2, &ba2))
             return false;
         else
         {
             setBoolValue(retval, ba2);
             return true;
         }
 
         return true;
 
     case PGBENCH_OR:
 
         if (a1.type == PGBT_NULL)
         {
             setNullValue(retval);
             return true;
         }
 
         if (!coerceToBool(&a1, &ba1))
             return false;
 
         if (ba1)
         {
             setBoolValue(retval, true);
             return true;
         }
 
         if (!evaluateExpr(thread, st, args->expr, &a2))
             return false;
 
         if (a2.type == PGBT_NULL)
         {
             setNullValue(retval);
             return true;
         }
         else if (!coerceToBool(&a2, &ba2))
             return false;
         else
         {
             setBoolValue(retval, ba2);
             return true;
         }
 
     case PGBENCH_CASE:
         /* when true, execute branch */
         if (valueTruth(&a1))
             return evaluateExpr(thread, st, args->expr, retval);
 
         /* now args contains next condition or final else expression */
         args = args->next;
 
         /* final else case? */
         if (args->next == NULL)
             return evaluateExpr(thread, st, args->expr, retval);
 
         /* no, another when, proceed */
         return evalLazyFunc(thread, st, PGBENCH_CASE, args, retval);
 
     default:
         /* internal error, cannot get here */
         Assert(0);
         break;
     }
     return false;
 }

◆ evalStandardFunc()

static bool evalStandardFunc	(	TState *	thread,
		CState *	st,
		PgBenchFunction	func,
		PgBenchExprLink *	args,
		PgBenchValue *	retval
	)

static

Definition at line 1801 of file pgbench.c.

References generate_unaccent_rules::args, Assert, PgBenchValue::bval, coerceToBool(), coerceToDouble(), coerceToInt(), CState::command, PgBenchValue::dval, evaluateExpr(), getExponentialRand(), getGaussianRand(), getHashFnv1a(), getHashMurmur2(), getrand(), getZipfianRand(), i, INT64_FORMAT, PgBenchValue::ival, M_PI, Max, MAX_FARGS, MAX_ZIPFIAN_PARAM, Min, MIN_GAUSSIAN_PARAM, PgBenchExprLink::next, PG_INT64_MIN, PGBENCH_ABS, PGBENCH_ADD, PGBENCH_BITAND, PGBENCH_BITOR, PGBENCH_BITXOR, PGBENCH_DEBUG, PGBENCH_DIV, PGBENCH_DOUBLE, PGBENCH_EQ, PGBENCH_EXP, PGBENCH_GREATEST, PGBENCH_HASH_FNV1A, PGBENCH_HASH_MURMUR2, PGBENCH_INT, PGBENCH_IS, PGBENCH_LE, PGBENCH_LEAST, PGBENCH_LN, PGBENCH_LSHIFT, PGBENCH_LT, PGBENCH_MOD, PGBENCH_MUL, PGBENCH_NE, PGBENCH_NOT, PGBENCH_PI, PGBENCH_POW, PGBENCH_RANDOM, PGBENCH_RANDOM_EXPONENTIAL, PGBENCH_RANDOM_GAUSSIAN, PGBENCH_RANDOM_ZIPFIAN, PGBENCH_RSHIFT, PGBENCH_SQRT, PGBENCH_SUB, PGBT_BOOLEAN, PGBT_DOUBLE, PGBT_INT, PGBT_NULL, setBoolValue(), setDoubleValue(), setIntValue(), setNullValue(), PgBenchValue::type, generate_unaccent_rules::type, PgBenchValue::u, CState::use_file, and val.

Referenced by evalFunc().

 {
     /* evaluate all function arguments */
     int             nargs = 0;
     PgBenchValue    vargs[MAX_FARGS];
     PgBenchExprLink *l = args;
     bool            has_null = false;
 
     for (nargs = 0; nargs < MAX_FARGS && l != NULL; nargs++, l = l->next)
     {
         if (!evaluateExpr(thread, st, l->expr, &vargs[nargs]))
             return false;
         has_null |= vargs[nargs].type == PGBT_NULL;
     }
 
     if (l != NULL)
     {
         fprintf(stderr,
                 "too many function arguments, maximum is %d\n", MAX_FARGS);
         return false;
     }
 
     /* NULL arguments */
     if (has_null && func != PGBENCH_IS && func != PGBENCH_DEBUG)
     {
         setNullValue(retval);
         return true;
     }
 
     /* then evaluate function */
     switch (func)
     {
             /* overloaded operators */
         case PGBENCH_ADD:
         case PGBENCH_SUB:
         case PGBENCH_MUL:
         case PGBENCH_DIV:
         case PGBENCH_MOD:
         case PGBENCH_EQ:
         case PGBENCH_NE:
         case PGBENCH_LE:
         case PGBENCH_LT:
             {
                 PgBenchValue *lval = &vargs[0],
                            *rval = &vargs[1];
 
                 Assert(nargs == 2);
 
                 /* overloaded type management, double if some double */
                 if ((lval->type == PGBT_DOUBLE ||
                      rval->type == PGBT_DOUBLE) && func != PGBENCH_MOD)
                 {
                     double      ld,
                                 rd;
 
                     if (!coerceToDouble(lval, &ld) ||
                         !coerceToDouble(rval, &rd))
                         return false;
 
                     switch (func)
                     {
                         case PGBENCH_ADD:
                             setDoubleValue(retval, ld + rd);
                             return true;
 
                         case PGBENCH_SUB:
                             setDoubleValue(retval, ld - rd);
                             return true;
 
                         case PGBENCH_MUL:
                             setDoubleValue(retval, ld * rd);
                             return true;
 
                         case PGBENCH_DIV:
                             setDoubleValue(retval, ld / rd);
                             return true;
 
                         case PGBENCH_EQ:
                             setBoolValue(retval, ld == rd);
                             return true;
 
                         case PGBENCH_NE:
                             setBoolValue(retval, ld != rd);
                             return true;
 
                         case PGBENCH_LE:
                             setBoolValue(retval, ld <= rd);
                             return true;
 
                         case PGBENCH_LT:
                             setBoolValue(retval, ld < rd);
                             return true;
 
                         default:
                             /* cannot get here */
                             Assert(0);
                     }
                 }
                 else            /* we have integer operands, or % */
                 {
                     int64       li,
                                 ri;
 
                     if (!coerceToInt(lval, &li) ||
                         !coerceToInt(rval, &ri))
                         return false;
 
                     switch (func)
                     {
                         case PGBENCH_ADD:
                             setIntValue(retval, li + ri);
                             return true;
 
                         case PGBENCH_SUB:
                             setIntValue(retval, li - ri);
                             return true;
 
                         case PGBENCH_MUL:
                             setIntValue(retval, li * ri);
                             return true;
 
                         case PGBENCH_EQ:
                             setBoolValue(retval, li == ri);
                             return true;
 
                         case PGBENCH_NE:
                             setBoolValue(retval, li != ri);
                             return true;
 
                         case PGBENCH_LE:
                             setBoolValue(retval, li <= ri);
                             return true;
 
                         case PGBENCH_LT:
                             setBoolValue(retval, li < ri);
                             return true;
 
                         case PGBENCH_DIV:
                         case PGBENCH_MOD:
                             if (ri == 0)
                             {
                                 fprintf(stderr, "division by zero\n");
                                 return false;
                             }
                             /* special handling of -1 divisor */
                             if (ri == -1)
                             {
                                 if (func == PGBENCH_DIV)
                                 {
                                     /* overflow check (needed for INT64_MIN) */
                                     if (li == PG_INT64_MIN)
                                     {
                                         fprintf(stderr, "bigint out of range\n");
                                         return false;
                                     }
                                     else
                                         setIntValue(retval, -li);
                                 }
                                 else
                                     setIntValue(retval, 0);
                                 return true;
                             }
                             /* else divisor is not -1 */
                             if (func == PGBENCH_DIV)
                                 setIntValue(retval, li / ri);
                             else    /* func == PGBENCH_MOD */
                                 setIntValue(retval, li % ri);
 
                             return true;
 
                         default:
                             /* cannot get here */
                             Assert(0);
                     }
                 }
             }
 
             /* integer bitwise operators */
         case PGBENCH_BITAND:
         case PGBENCH_BITOR:
         case PGBENCH_BITXOR:
         case PGBENCH_LSHIFT:
         case PGBENCH_RSHIFT:
             {
                 int64 li, ri;
 
                 if (!coerceToInt(&vargs[0], &li) || !coerceToInt(&vargs[1], &ri))
                     return false;
 
                 if (func == PGBENCH_BITAND)
                     setIntValue(retval, li & ri);
                 else if (func == PGBENCH_BITOR)
                     setIntValue(retval, li | ri);
                 else if (func == PGBENCH_BITXOR)
                     setIntValue(retval, li ^ ri);
                 else if (func == PGBENCH_LSHIFT)
                     setIntValue(retval, li << ri);
                 else if (func == PGBENCH_RSHIFT)
                     setIntValue(retval, li >> ri);
                 else /* cannot get here */
                     Assert(0);
 
                 return true;
             }
 
             /* logical operators */
         case PGBENCH_NOT:
             {
                 bool b;
                 if (!coerceToBool(&vargs[0], &b))
                     return false;
 
                 setBoolValue(retval, !b);
                 return true;
             }
 
             /* no arguments */
         case PGBENCH_PI:
             setDoubleValue(retval, M_PI);
             return true;
 
             /* 1 overloaded argument */
         case PGBENCH_ABS:
             {
                 PgBenchValue *varg = &vargs[0];
 
                 Assert(nargs == 1);
 
                 if (varg->type == PGBT_INT)
                 {
                     int64       i = varg->u.ival;
 
                     setIntValue(retval, i < 0 ? -i : i);
                 }
                 else
                 {
                     double      d = varg->u.dval;
 
                     Assert(varg->type == PGBT_DOUBLE);
                     setDoubleValue(retval, d < 0.0 ? -d : d);
                 }
 
                 return true;
             }
 
         case PGBENCH_DEBUG:
             {
                 PgBenchValue *varg = &vargs[0];
 
                 Assert(nargs == 1);
 
                 fprintf(stderr, "debug(script=%d,command=%d): ",
                         st->use_file, st->command + 1);
 
                 if (varg->type == PGBT_NULL)
                     fprintf(stderr, "null\n");
                 else if (varg->type == PGBT_BOOLEAN)
                     fprintf(stderr, "boolean %s\n", varg->u.bval ? "true" : "false");
                 else if (varg->type == PGBT_INT)
                     fprintf(stderr, "int " INT64_FORMAT "\n", varg->u.ival);
                 else if (varg->type == PGBT_DOUBLE)
                     fprintf(stderr, "double %.*g\n", DBL_DIG, varg->u.dval);
                 else /* internal error, unexpected type */
                     Assert(0);
 
                 *retval = *varg;
 
                 return true;
             }
 
             /* 1 double argument */
         case PGBENCH_DOUBLE:
         case PGBENCH_SQRT:
         case PGBENCH_LN:
         case PGBENCH_EXP:
             {
                 double      dval;
 
                 Assert(nargs == 1);
 
                 if (!coerceToDouble(&vargs[0], &dval))
                     return false;
 
                 if (func == PGBENCH_SQRT)
                     dval = sqrt(dval);
                 else if (func == PGBENCH_LN)
                     dval = log(dval);
                 else if (func == PGBENCH_EXP)
                     dval = exp(dval);
                 /* else is cast: do nothing */
 
                 setDoubleValue(retval, dval);
                 return true;
             }
 
             /* 1 int argument */
         case PGBENCH_INT:
             {
                 int64       ival;
 
                 Assert(nargs == 1);
 
                 if (!coerceToInt(&vargs[0], &ival))
                     return false;
 
                 setIntValue(retval, ival);
                 return true;
             }
 
             /* variable number of arguments */
         case PGBENCH_LEAST:
         case PGBENCH_GREATEST:
             {
                 bool        havedouble;
                 int         i;
 
                 Assert(nargs >= 1);
 
                 /* need double result if any input is double */
                 havedouble = false;
                 for (i = 0; i < nargs; i++)
                 {
                     if (vargs[i].type == PGBT_DOUBLE)
                     {
                         havedouble = true;
                         break;
                     }
                 }
                 if (havedouble)
                 {
                     double      extremum;
 
                     if (!coerceToDouble(&vargs[0], &extremum))
                         return false;
                     for (i = 1; i < nargs; i++)
                     {
                         double      dval;
 
                         if (!coerceToDouble(&vargs[i], &dval))
                             return false;
                         if (func == PGBENCH_LEAST)
                             extremum = Min(extremum, dval);
                         else
                             extremum = Max(extremum, dval);
                     }
                     setDoubleValue(retval, extremum);
                 }
                 else
                 {
                     int64       extremum;
 
                     if (!coerceToInt(&vargs[0], &extremum))
                         return false;
                     for (i = 1; i < nargs; i++)
                     {
                         int64       ival;
 
                         if (!coerceToInt(&vargs[i], &ival))
                             return false;
                         if (func == PGBENCH_LEAST)
                             extremum = Min(extremum, ival);
                         else
                             extremum = Max(extremum, ival);
                     }
                     setIntValue(retval, extremum);
                 }
                 return true;
             }
 
             /* random functions */
         case PGBENCH_RANDOM:
         case PGBENCH_RANDOM_EXPONENTIAL:
         case PGBENCH_RANDOM_GAUSSIAN:
         case PGBENCH_RANDOM_ZIPFIAN:
             {
                 int64       imin,
                             imax;
 
                 Assert(nargs >= 2);
 
                 if (!coerceToInt(&vargs[0], &imin) ||
                     !coerceToInt(&vargs[1], &imax))
                     return false;
 
                 /* check random range */
                 if (imin > imax)
                 {
                     fprintf(stderr, "empty range given to random\n");
                     return false;
                 }
                 else if (imax - imin < 0 || (imax - imin) + 1 < 0)
                 {
                     /* prevent int overflows in random functions */
                     fprintf(stderr, "random range is too large\n");
                     return false;
                 }
 
                 if (func == PGBENCH_RANDOM)
                 {
                     Assert(nargs == 2);
                     setIntValue(retval, getrand(thread, imin, imax));
                 }
                 else            /* gaussian & exponential */
                 {
                     double      param;
 
                     Assert(nargs == 3);
 
                     if (!coerceToDouble(&vargs[2], &param))
                         return false;
 
                     if (func == PGBENCH_RANDOM_GAUSSIAN)
                     {
                         if (param < MIN_GAUSSIAN_PARAM)
                         {
                             fprintf(stderr,
                                     "gaussian parameter must be at least %f "
                                     "(not %f)\n", MIN_GAUSSIAN_PARAM, param);
                             return false;
                         }
 
                         setIntValue(retval,
                                     getGaussianRand(thread, imin, imax, param));
                     }
                     else if (func == PGBENCH_RANDOM_ZIPFIAN)
                     {
                         if (param <= 0.0 || param == 1.0 || param > MAX_ZIPFIAN_PARAM)
                         {
                             fprintf(stderr,
                                     "zipfian parameter must be in range (0, 1) U (1, %d]"
                                     " (got %f)\n", MAX_ZIPFIAN_PARAM, param);
                             return false;
                         }
                         setIntValue(retval,
                                     getZipfianRand(thread, imin, imax, param));
                     }
                     else        /* exponential */
                     {
                         if (param <= 0.0)
                         {
                             fprintf(stderr,
                                     "exponential parameter must be greater than zero"
                                     " (got %f)\n", param);
                             return false;
                         }
 
                         setIntValue(retval,
                                     getExponentialRand(thread, imin, imax, param));
                     }
                 }
 
                 return true;
             }
 
         case PGBENCH_POW:
             {
                 PgBenchValue *lval = &vargs[0];
                 PgBenchValue *rval = &vargs[1];
                 double      ld,
                             rd;
 
                 Assert(nargs == 2);
 
                 if (!coerceToDouble(lval, &ld) ||
                     !coerceToDouble(rval, &rd))
                     return false;
 
                 setDoubleValue(retval, pow(ld, rd));
 
                 return true;
             }
 
         case PGBENCH_IS:
             {
                 Assert(nargs == 2);
                 /* note: this simple implementation is more permissive than SQL */
                 setBoolValue(retval,
                              vargs[0].type == vargs[1].type &&
                              vargs[0].u.bval == vargs[1].u.bval);
                 return true;
             }
 
             /* hashing */
         case PGBENCH_HASH_FNV1A:
         case PGBENCH_HASH_MURMUR2:
             {
                 int64   val,
                         seed;
 
                 Assert(nargs == 2);
 
                 if (!coerceToInt(&vargs[0], &val) ||
                     !coerceToInt(&vargs[1], &seed))
                     return false;
 
                 if (func == PGBENCH_HASH_MURMUR2)
                     setIntValue(retval, getHashMurmur2(val, seed));
                 else if (func == PGBENCH_HASH_FNV1A)
                     setIntValue(retval, getHashFnv1a(val, seed));
                 else
                     /* cannot get here */
                     Assert(0);
 
                 return true;
             }
 
         default:
             /* cannot get here */
             Assert(0);
             /* dead code to avoid a compiler warning */
             return false;
     }
 }

◆ evaluateExpr()

static bool evaluateExpr	(	TState *	thread,
		CState *	st,
		PgBenchExpr *	expr,
		PgBenchValue *	retval
	)

static

Definition at line 2335 of file pgbench.c.

References PgBenchExpr::constant, ENODE_CONSTANT, ENODE_FUNCTION, ENODE_VARIABLE, PgBenchExpr::etype, evalFunc(), PgBenchExpr::function, lookupVariable(), makeVariableValue(), PgBenchExpr::u, Variable::value, and PgBenchExpr::variable.

Referenced by doCustom(), evalLazyFunc(), and evalStandardFunc().

 {
     switch (expr->etype)
     {
         case ENODE_CONSTANT:
             {
                 *retval = expr->u.constant;
                 return true;
             }
 
         case ENODE_VARIABLE:
             {
                 Variable   *var;
 
                 if ((var = lookupVariable(st, expr->u.variable.varname)) == NULL)
                 {
                     fprintf(stderr, "undefined variable \"%s\"\n",
                             expr->u.variable.varname);
                     return false;
                 }
 
                 if (!makeVariableValue(var))
                     return false;
 
                 *retval = var->value;
                 return true;
             }
 
         case ENODE_FUNCTION:
             return evalFunc(thread, st,
                             expr->u.function.function,
                             expr->u.function.args,
                             retval);
 
         default:
             /* internal error which should never occur */
             fprintf(stderr, "unexpected enode type in evaluation: %d\n",
                     expr->etype);
             exit(1);
     }
 }

◆ evaluateSleep()

static bool evaluateSleep	(	CState *	st,
		int	argc,
		char **	argv,
		int *	usecs
	)

static

Definition at line 2635 of file pgbench.c.

References getVariable(), and pg_strcasecmp().

Referenced by doCustom().

 {
     char       *var;
     int         usec;
 
     if (*argv[1] == ':')
     {
         if ((var = getVariable(st, argv[1] + 1)) == NULL)
         {
             fprintf(stderr, "%s: undefined variable \"%s\"\n",
                     argv[0], argv[1]);
             return false;
         }
         usec = atoi(var);
     }
     else
         usec = atoi(argv[1]);
 
     if (argc > 2)
     {
         if (pg_strcasecmp(argv[2], "ms") == 0)
             usec *= 1000;
         else if (pg_strcasecmp(argv[2], "s") == 0)
             usec *= 1000000;
     }
     else
         usec *= 1000000;
 
     *usecs = usec;
     return true;
 }

◆ executeStatement()

static void executeStatement	(	PGconn *	con,
		const char *	sql
	)

static

Definition at line 1066 of file pgbench.c.

References PGRES_COMMAND_OK, PQclear(), PQerrorMessage(), PQexec(), and PQresultStatus().

Referenced by initCreateFKeys(), initCreatePKeys(), initCreateTables(), initDropTables(), initGenerateData(), and initVacuum().

 {
     PGresult   *res;
 
     res = PQexec(con, sql);
     if (PQresultStatus(res) != PGRES_COMMAND_OK)
     {
         fprintf(stderr, "%s", PQerrorMessage(con));
         exit(1);
     }
     PQclear(res);
 }

◆ findBuiltin()

static const BuiltinScript* findBuiltin ( const char * name )

static

Definition at line 4416 of file pgbench.c.

References i, lengthof, and listAvailableScripts().

Referenced by main().

 {
     int         i,
                 found = 0,
                 len = strlen(name);
     const BuiltinScript *result = NULL;
 
     for (i = 0; i < lengthof(builtin_script); i++)
     {
         if (strncmp(builtin_script[i].name, name, len) == 0)
         {
             result = &builtin_script[i];
             found++;
         }
     }
 
     /* ok, unambiguous result */
     if (found == 1)
         return result;
 
     /* error cases */
     if (found == 0)
         fprintf(stderr, "no builtin script found for name \"%s\"\n", name);
     else                        /* found > 1 */
         fprintf(stderr,
                 "ambiguous builtin name: %d builtin scripts found for prefix \"%s\"\n", found, name);
 
     listAvailableScripts();
     exit(1);
 }

◆ finishCon()

static void finishCon ( CState * st )

static

Definition at line 5940 of file pgbench.c.

References CState::con, and PQfinish().

Referenced by disconnect_all(), doCustom(), and threadRun().

 {
     if (st->con != NULL)
     {
         PQfinish(st->con);
         st->con = NULL;
     }
 }

◆ generalizedHarmonicNumber()

static double generalizedHarmonicNumber	(	int64	n,
		double	s
	)

static

Definition at line 811 of file pgbench.c.

References i.

Referenced by zipfSetCacheCell().

 {
     int         i;
     double      ans = 0.0;
 
     for (i = n; i > 1; i--)
         ans += pow(i, -s);
     return ans + 1.0;
 }

◆ getExponentialRand()

static int64 getExponentialRand	(	TState *	thread,
		int64	min,
		int64	max,
		double	parameter
	)

static

Definition at line 716 of file pgbench.c.

References Assert, pg_erand48(), and TState::random_state.

Referenced by evalStandardFunc().

 {
     double      cut,
                 uniform,
                 rand;
 
     /* abort if wrong parameter, but must really be checked beforehand */
     Assert(parameter > 0.0);
     cut = exp(-parameter);
     /* erand in [0, 1), uniform in (0, 1] */
     uniform = 1.0 - pg_erand48(thread->random_state);
 
     /*
      * inner expression in (cut, 1] (if parameter > 0), rand in [0, 1)
      */
     Assert((1.0 - cut) != 0.0);
     rand = -log(cut + (1.0 - cut) * uniform) / parameter;
     /* return int64 random number within between min and max */
     return min + (int64) ((max - min + 1) * rand);
 }

◆ getGaussianRand()

static int64 getGaussianRand	(	TState *	thread,
		int64	min,
		int64	max,
		double	parameter
	)

static

Definition at line 739 of file pgbench.c.

References Assert, M_PI, MIN_GAUSSIAN_PARAM, pg_erand48(), and TState::random_state.

Referenced by evalStandardFunc().

 {
     double      stdev;
     double      rand;
 
     /* abort if parameter is too low, but must really be checked beforehand */
     Assert(parameter >= MIN_GAUSSIAN_PARAM);
 
     /*
      * Get user specified random number from this loop, with -parameter <
      * stdev <= parameter
      *
      * This loop is executed until the number is in the expected range.
      *
      * As the minimum parameter is 2.0, the probability of looping is low:
      * sqrt(-2 ln(r)) <= 2 => r >= e^{-2} ~ 0.135, then when taking the
      * average sinus multiplier as 2/pi, we have a 8.6% looping probability in
      * the worst case. For a parameter value of 5.0, the looping probability
      * is about e^{-5} * 2 / pi ~ 0.43%.
      */
     do
     {
         /*
          * pg_erand48 generates [0,1), but for the basic version of the
          * Box-Muller transform the two uniformly distributed random numbers
          * are expected in (0, 1] (see
          * http://en.wikipedia.org/wiki/Box_muller)
          */
         double      rand1 = 1.0 - pg_erand48(thread->random_state);
         double      rand2 = 1.0 - pg_erand48(thread->random_state);
 
         /* Box-Muller basic form transform */
         double      var_sqrt = sqrt(-2.0 * log(rand1));
 
         stdev = var_sqrt * sin(2.0 * M_PI * rand2);
 
         /*
          * we may try with cos, but there may be a bias induced if the
          * previous value fails the test. To be on the safe side, let us try
          * over.
          */
     }
     while (stdev < -parameter || stdev >= parameter);
 
     /* stdev is in [-parameter, parameter), normalization to [0,1) */
     rand = (stdev + parameter) / (parameter * 2.0);
 
     /* return int64 random number within between min and max */
     return min + (int64) ((max - min + 1) * rand);
 }

◆ getHashFnv1a()

static int64 getHashFnv1a	(	int64	val,
		uint64	seed
	)

static

Definition at line 944 of file pgbench.c.

References FNV_OFFSET_BASIS, FNV_PRIME, and i.

Referenced by evalStandardFunc().

 {
     int64   result;
     int     i;
 
     result = FNV_OFFSET_BASIS ^ seed;
     for (i = 0; i < 8; ++i)
     {
         int32 octet = val & 0xff;
 
         val = val >> 8;
         result = result ^ octet;
         result = result * FNV_PRIME;
     }
 
     return result;
 }

◆ getHashMurmur2()

static int64 getHashMurmur2	(	int64	val,
		uint64	seed
	)

static

Definition at line 969 of file pgbench.c.

References MM2_MUL, and MM2_ROT.

Referenced by evalStandardFunc().

 {
     uint64  result = seed ^ (sizeof(int64) * MM2_MUL);
     uint64  k = (uint64) val;
 
     k *= MM2_MUL;
     k ^= k >> MM2_ROT;
     k *= MM2_MUL;
 
     result ^= k;
     result *= MM2_MUL;
 
     result ^= result >> MM2_ROT;
     result *= MM2_MUL;
     result ^= result >> MM2_ROT;
 
     return (int64) result;
 }

◆ getMetaCommand()

static MetaCommand getMetaCommand ( const char * cmd )

static

Definition at line 2381 of file pgbench.c.

References META_ELIF, META_ELSE, META_ENDIF, META_IF, META_NONE, META_SET, META_SETSHELL, META_SHELL, META_SLEEP, and pg_strcasecmp().

Referenced by process_backslash_command().

 {
     MetaCommand mc;
 
     if (cmd == NULL)
         mc = META_NONE;
     else if (pg_strcasecmp(cmd, "set") == 0)
         mc = META_SET;
     else if (pg_strcasecmp(cmd, "setshell") == 0)
         mc = META_SETSHELL;
     else if (pg_strcasecmp(cmd, "shell") == 0)
         mc = META_SHELL;
     else if (pg_strcasecmp(cmd, "sleep") == 0)
         mc = META_SLEEP;
     else if (pg_strcasecmp(cmd, "if") == 0)
         mc = META_IF;
     else if (pg_strcasecmp(cmd, "elif") == 0)
         mc = META_ELIF;
     else if (pg_strcasecmp(cmd, "else") == 0)
         mc = META_ELSE;
     else if (pg_strcasecmp(cmd, "endif") == 0)
         mc = META_ENDIF;
     else
         mc = META_NONE;
     return mc;
 }

◆ getPoissonRand()

static int64 getPoissonRand	(	TState *	thread,
		int64	center
	)

static

Definition at line 795 of file pgbench.c.

References pg_erand48(), and TState::random_state.

Referenced by doCustom().

 {
     /*
      * Use inverse transform sampling to generate a value > 0, such that the
      * expected (i.e. average) value is the given argument.
      */
     double      uniform;
 
     /* erand in [0, 1), uniform in (0, 1] */
     uniform = 1.0 - pg_erand48(thread->random_state);
 
     return (int64) (-log(uniform) * ((double) center) + 0.5);
 }

◆ getQueryParams()

static void getQueryParams	(	CState *	st,
		const Command *	command,
		const char **	params
	)

static

Definition at line 1528 of file pgbench.c.

References Command::argc, Command::argv, getVariable(), and i.

Referenced by sendCommand().

 {
     int         i;
 
     for (i = 0; i < command->argc - 1; i++)
         params[i] = getVariable(st, command->argv[i + 1]);
 }

◆ getrand()

static int64 getrand	(	TState *	thread,
		int64	min,
		int64	max
	)

static

Definition at line 696 of file pgbench.c.

References pg_erand48(), and TState::random_state.

Referenced by chooseScript(), and evalStandardFunc().

 {
     /*
      * Odd coding is so that min and max have approximately the same chance of
      * being selected as do numbers between them.
      *
      * pg_erand48() is thread-safe and concurrent, which is why we use it
      * rather than random(), which in glibc is non-reentrant, and therefore
      * protected by a mutex, and therefore a bottleneck on machines with many
      * CPUs.
      */
     return min + (int64) ((max - min + 1) * pg_erand48(thread->random_state));
 }

◆ getVariable()

static char* getVariable	(	CState *	st,
		char *	name
	)

static

Definition at line 1214 of file pgbench.c.

References Assert, PgBenchValue::bval, PgBenchValue::dval, INT64_FORMAT, PgBenchValue::ival, lookupVariable(), pg_strdup(), PGBT_BOOLEAN, PGBT_DOUBLE, PGBT_INT, PGBT_NO_VALUE, PGBT_NULL, snprintf(), Variable::svalue, PgBenchValue::type, PgBenchValue::u, and Variable::value.

Referenced by assignVariables(), evaluateSleep(), getQueryParams(), and runShellCommand().

 {
     Variable   *var;
     char        stringform[64];
 
     var = lookupVariable(st, name);
     if (var == NULL)
         return NULL;            /* not found */
 
     if (var->svalue)
         return var->svalue;     /* we have it in string form */
 
     /* We need to produce a string equivalent of the value */
     Assert(var->value.type != PGBT_NO_VALUE);
     if (var->value.type == PGBT_NULL)
         snprintf(stringform, sizeof(stringform), "NULL");
     else if (var->value.type == PGBT_BOOLEAN)
         snprintf(stringform, sizeof(stringform),
                  "%s", var->value.u.bval ? "true" : "false");
     else if (var->value.type == PGBT_INT)
         snprintf(stringform, sizeof(stringform),
                  INT64_FORMAT, var->value.u.ival);
     else if (var->value.type == PGBT_DOUBLE)
         snprintf(stringform, sizeof(stringform),
                  "%.*g", DBL_DIG, var->value.u.dval);
     else /* internal error, unexpected type */
         Assert(0);
     var->svalue = pg_strdup(stringform);
     return var->svalue;
 }

◆ getZipfianRand()

static int64 getZipfianRand	(	TState *	thread,
		int64	min,
		int64	max,
		double	s
	)

static

Definition at line 927 of file pgbench.c.

References Assert, computeHarmonicZipfian(), computeIterativeZipfian(), and MAX_ZIPFIAN_PARAM.

Referenced by evalStandardFunc().

 {
     int64       n = max - min + 1;
 
     /* abort if parameter is invalid */
     Assert(s > 0.0 && s != 1.0 && s <= MAX_ZIPFIAN_PARAM);
 
 
     return min - 1 + ((s > 1)
                       ? computeIterativeZipfian(thread, n, s)
                       : computeHarmonicZipfian(thread, n, s));
 }

◆ handle_sig_alarm()

static void handle_sig_alarm ( SIGNAL_ARGS )

static

Definition at line 5956 of file pgbench.c.

Referenced by setalarm().

 {
     timer_exceeded = true;
 }

◆ initCreateFKeys()

static void initCreateFKeys ( PGconn * con )

static

Definition at line 3725 of file pgbench.c.

References executeStatement(), i, and lengthof.

Referenced by runInitSteps().

 {
     static const char *const DDLKEYs[] = {
         "alter table pgbench_tellers add constraint pgbench_tellers_bid_fkey foreign key (bid) references pgbench_branches",
         "alter table pgbench_accounts add constraint pgbench_accounts_bid_fkey foreign key (bid) references pgbench_branches",
         "alter table pgbench_history add constraint pgbench_history_bid_fkey foreign key (bid) references pgbench_branches",
         "alter table pgbench_history add constraint pgbench_history_tid_fkey foreign key (tid) references pgbench_tellers",
         "alter table pgbench_history add constraint pgbench_history_aid_fkey foreign key (aid) references pgbench_accounts"
     };
     int         i;
 
     fprintf(stderr, "creating foreign keys...\n");
     for (i = 0; i < lengthof(DDLKEYs); i++)
     {
         executeStatement(con, DDLKEYs[i]);
     }
 }

◆ initCreatePKeys()

static void initCreatePKeys ( PGconn * con )

static

Definition at line 3690 of file pgbench.c.

References buffer, executeStatement(), i, lengthof, PQescapeIdentifier(), PQfreemem(), snprintf(), and strlcpy().

Referenced by runInitSteps().

 {
     static const char *const DDLINDEXes[] = {
         "alter table pgbench_branches add primary key (bid)",
         "alter table pgbench_tellers add primary key (tid)",
         "alter table pgbench_accounts add primary key (aid)"
     };
     int         i;
 
     fprintf(stderr, "creating primary keys...\n");
     for (i = 0; i < lengthof(DDLINDEXes); i++)
     {
         char        buffer[256];
 
         strlcpy(buffer, DDLINDEXes[i], sizeof(buffer));
 
         if (index_tablespace != NULL)
         {
             char       *escape_tablespace;
 
             escape_tablespace = PQescapeIdentifier(con, index_tablespace,
                                                    strlen(index_tablespace));
             snprintf(buffer + strlen(buffer), sizeof(buffer) - strlen(buffer),
                      " using index tablespace %s", escape_tablespace);
             PQfreemem(escape_tablespace);
         }
 
         executeStatement(con, buffer);
     }
 }

◆ initCreateTables()

static void initCreateTables ( PGconn * con )

static

Definition at line 3442 of file pgbench.c.

References buffer, executeStatement(), i, lengthof, PQescapeIdentifier(), PQfreemem(), SCALE_32BIT_THRESHOLD, and snprintf().

Referenced by runInitSteps().

 {
     /*
      * The scale factor at/beyond which 32-bit integers are insufficient for
      * storing TPC-B account IDs.
      *
      * Although the actual threshold is 21474, we use 20000 because it is
      * easier to document and remember, and isn't that far away from the real
      * threshold.
      */
 #define SCALE_32BIT_THRESHOLD 20000
 
     /*
      * Note: TPC-B requires at least 100 bytes per row, and the "filler"
      * fields in these table declarations were intended to comply with that.
      * The pgbench_accounts table complies with that because the "filler"
      * column is set to blank-padded empty string. But for all other tables
      * the columns default to NULL and so don't actually take any space.  We
      * could fix that by giving them non-null default values.  However, that
      * would completely break comparability of pgbench results with prior
      * versions. Since pgbench has never pretended to be fully TPC-B compliant
      * anyway, we stick with the historical behavior.
      */
     struct ddlinfo
     {
         const char *table;      /* table name */
         const char *smcols;     /* column decls if accountIDs are 32 bits */
         const char *bigcols;    /* column decls if accountIDs are 64 bits */
         int         declare_fillfactor;
     };
     static const struct ddlinfo DDLs[] = {
         {
             "pgbench_history",
             "tid int,bid int,aid    int,delta int,mtime timestamp,filler char(22)",
             "tid int,bid int,aid bigint,delta int,mtime timestamp,filler char(22)",
             0
         },
         {
             "pgbench_tellers",
             "tid int not null,bid int,tbalance int,filler char(84)",
             "tid int not null,bid int,tbalance int,filler char(84)",
             1
         },
         {
             "pgbench_accounts",
             "aid    int not null,bid int,abalance int,filler char(84)",
             "aid bigint not null,bid int,abalance int,filler char(84)",
             1
         },
         {
             "pgbench_branches",
             "bid int not null,bbalance int,filler char(88)",
             "bid int not null,bbalance int,filler char(88)",
             1
         }
     };
     int         i;
 
     fprintf(stderr, "creating tables...\n");
 
     for (i = 0; i < lengthof(DDLs); i++)
     {
         char        opts[256];
         char        buffer[256];
         const struct ddlinfo *ddl = &DDLs[i];
         const char *cols;
 
         /* Construct new create table statement. */
         opts[0] = '\0';
         if (ddl->declare_fillfactor)
             snprintf(opts + strlen(opts), sizeof(opts) - strlen(opts),
                      " with (fillfactor=%d)", fillfactor);
         if (tablespace != NULL)
         {
             char       *escape_tablespace;
 
             escape_tablespace = PQescapeIdentifier(con, tablespace,
                                                    strlen(tablespace));
             snprintf(opts + strlen(opts), sizeof(opts) - strlen(opts),
                      " tablespace %s", escape_tablespace);
             PQfreemem(escape_tablespace);
         }
 
         cols = (scale >= SCALE_32BIT_THRESHOLD) ? ddl->bigcols : ddl->smcols;
 
         snprintf(buffer, sizeof(buffer), "create%s table %s(%s)%s",
                  unlogged_tables ? " unlogged" : "",
                  ddl->table, cols, opts);
 
         executeStatement(con, buffer);
     }
 }

◆ initDropTables()

static void initDropTables ( PGconn * con )

static

Definition at line 3423 of file pgbench.c.

References executeStatement().

Referenced by runInitSteps().

 {
     fprintf(stderr, "dropping old tables...\n");
 
     /*
      * We drop all the tables in one command, so that whether there are
      * foreign key dependencies or not doesn't matter.
      */
     executeStatement(con, "drop table if exists "
                      "pgbench_accounts, "
                      "pgbench_branches, "
                      "pgbench_history, "
                      "pgbench_tellers");
 }

◆ initGenerateData()

static void initGenerateData ( PGconn * con )

static

Definition at line 3539 of file pgbench.c.

References executeStatement(), i, INSTR_TIME_GET_DOUBLE, INSTR_TIME_SET_CURRENT, INSTR_TIME_SUBTRACT, INT64_FORMAT, LOG_STEP_SECONDS, naccounts, nbranches, ntellers, PGRES_COPY_IN, PQclear(), PQendcopy(), PQerrorMessage(), PQexec(), PQputline(), PQresultStatus(), scale, and snprintf().

Referenced by runInitSteps().

 {
     char        sql[256];
     PGresult   *res;
     int         i;
     int64       k;
 
     /* used to track elapsed time and estimate of the remaining time */
     instr_time  start,
                 diff;
     double      elapsed_sec,
                 remaining_sec;
     int         log_interval = 1;
 
     fprintf(stderr, "generating data...\n");
 
     /*
      * we do all of this in one transaction to enable the backend's
      * data-loading optimizations
      */
     executeStatement(con, "begin");
 
     /*
      * truncate away any old data, in one command in case there are foreign
      * keys
      */
     executeStatement(con, "truncate table "
                      "pgbench_accounts, "
                      "pgbench_branches, "
                      "pgbench_history, "
                      "pgbench_tellers");
 
     /*
      * fill branches, tellers, accounts in that order in case foreign keys
      * already exist
      */
     for (i = 0; i < nbranches * scale; i++)
     {
         /* "filler" column defaults to NULL */
         snprintf(sql, sizeof(sql),
                  "insert into pgbench_branches(bid,bbalance) values(%d,0)",
                  i + 1);
         executeStatement(con, sql);
     }
 
     for (i = 0; i < ntellers * scale; i++)
     {
         /* "filler" column defaults to NULL */
         snprintf(sql, sizeof(sql),
                  "insert into pgbench_tellers(tid,bid,tbalance) values (%d,%d,0)",
                  i + 1, i / ntellers + 1);
         executeStatement(con, sql);
     }
 
     /*
      * accounts is big enough to be worth using COPY and tracking runtime
      */
     res = PQexec(con, "copy pgbench_accounts from stdin");
     if (PQresultStatus(res) != PGRES_COPY_IN)
     {
         fprintf(stderr, "%s", PQerrorMessage(con));
         exit(1);
     }
     PQclear(res);
 
     INSTR_TIME_SET_CURRENT(start);
 
     for (k = 0; k < (int64) naccounts * scale; k++)
     {
         int64       j = k + 1;
 
         /* "filler" column defaults to blank padded empty string */
         snprintf(sql, sizeof(sql),
                  INT64_FORMAT "\t" INT64_FORMAT "\t%d\t\n",
                  j, k / naccounts + 1, 0);
         if (PQputline(con, sql))
         {
             fprintf(stderr, "PQputline failed\n");
             exit(1);
         }
 
         /*
          * If we want to stick with the original logging, print a message each
          * 100k inserted rows.
          */
         if ((!use_quiet) && (j % 100000 == 0))
         {
             INSTR_TIME_SET_CURRENT(diff);
             INSTR_TIME_SUBTRACT(diff, start);
 
             elapsed_sec = INSTR_TIME_GET_DOUBLE(diff);
             remaining_sec = ((double) scale * naccounts - j) * elapsed_sec / j;
 
             fprintf(stderr, INT64_FORMAT " of " INT64_FORMAT " tuples (%d%%) done (elapsed %.2f s, remaining %.2f s)\n",
                     j, (int64) naccounts * scale,
                     (int) (((int64) j * 100) / (naccounts * (int64) scale)),
                     elapsed_sec, remaining_sec);
         }
         /* let's not call the timing for each row, but only each 100 rows */
         else if (use_quiet && (j % 100 == 0))
         {
             INSTR_TIME_SET_CURRENT(diff);
             INSTR_TIME_SUBTRACT(diff, start);
 
             elapsed_sec = INSTR_TIME_GET_DOUBLE(diff);
             remaining_sec = ((double) scale * naccounts - j) * elapsed_sec / j;
 
             /* have we reached the next interval (or end)? */
             if ((j == scale * naccounts) || (elapsed_sec >= log_interval * LOG_STEP_SECONDS))
             {
                 fprintf(stderr, INT64_FORMAT " of " INT64_FORMAT " tuples (%d%%) done (elapsed %.2f s, remaining %.2f s)\n",
                         j, (int64) naccounts * scale,
                         (int) (((int64) j * 100) / (naccounts * (int64) scale)), elapsed_sec, remaining_sec);
 
                 /* skip to the next interval */
                 log_interval = (int) ceil(elapsed_sec / LOG_STEP_SECONDS);
             }
         }
 
     }
     if (PQputline(con, "\\.\n"))
     {
         fprintf(stderr, "very last PQputline failed\n");
         exit(1);
     }
     if (PQendcopy(con))
     {
         fprintf(stderr, "PQendcopy failed\n");
         exit(1);
     }
 
     executeStatement(con, "commit");
 }

◆ initSimpleStats()

static void initSimpleStats ( SimpleStats * ss )

static

Definition at line 992 of file pgbench.c.

Referenced by initStats(), process_backslash_command(), and process_sql_command().

 {
     memset(ss, 0, sizeof(SimpleStats));
 }

◆ initStats()

static void initStats	(	StatsData *	sd,
		time_t	start_time
	)

static

Definition at line 1032 of file pgbench.c.

References StatsData::cnt, initSimpleStats(), StatsData::lag, StatsData::latency, StatsData::skipped, start_time, and StatsData::start_time.

Referenced by doLog(), main(), ParseScript(), and threadRun().

 {
     sd->start_time = start_time;
     sd->cnt = 0;
     sd->skipped = 0;
     initSimpleStats(&sd->latency);
     initSimpleStats(&sd->lag);
 }

◆ initVacuum()

static void initVacuum ( PGconn * con )

static

Definition at line 3677 of file pgbench.c.

References executeStatement().

Referenced by runInitSteps().

 {
     fprintf(stderr, "vacuuming...\n");
     executeStatement(con, "vacuum analyze pgbench_branches");
     executeStatement(con, "vacuum analyze pgbench_tellers");
     executeStatement(con, "vacuum analyze pgbench_accounts");
     executeStatement(con, "vacuum analyze pgbench_history");
 }

◆ is_an_int()

static bool is_an_int ( const char * str )

static

Definition at line 601 of file pgbench.c.

References generate_unaccent_rules::str.

Referenced by makeVariableValue().

 {
     const char *ptr = str;
 
     /* skip leading spaces; cast is consistent with strtoint64 */
     while (*ptr && isspace((unsigned char) *ptr))
         ptr++;
 
     /* skip sign */
     if (*ptr == '+' || *ptr == '-')
         ptr++;
 
     /* at least one digit */
     if (*ptr && !isdigit((unsigned char) *ptr))
         return false;
 
     /* eat all digits */
     while (*ptr && isdigit((unsigned char) *ptr))
         ptr++;
 
     /* must have reached end of string */
     return *ptr == '\0';
 }

◆ isLazyFunc()

static bool isLazyFunc ( PgBenchFunction func )

static

Definition at line 1679 of file pgbench.c.

References PGBENCH_AND, PGBENCH_CASE, and PGBENCH_OR.

Referenced by evalFunc(), and evalLazyFunc().

 {
     return func == PGBENCH_AND || func == PGBENCH_OR || func == PGBENCH_CASE;
 }

◆ listAvailableScripts()

static void listAvailableScripts ( void )

static

Definition at line 4404 of file pgbench.c.

References i, lengthof, and name.

Referenced by findBuiltin(), and main().

 {
     int         i;
 
     fprintf(stderr, "Available builtin scripts:\n");
     for (i = 0; i < lengthof(builtin_script); i++)
         fprintf(stderr, "\t%s\n", builtin_script[i].name);
     fprintf(stderr, "\n");
 }

◆ lookupCreateVariable()

static Variable* lookupCreateVariable	(	CState *	st,
		const char *	context,
		char *	name
	)

static

Definition at line 1343 of file pgbench.c.

References lookupVariable(), Variable::name, CState::nvariables, pg_malloc(), pg_realloc(), pg_strdup(), Variable::svalue, valid_variable_name(), CState::variables, and CState::vars_sorted.

Referenced by putVariable(), and putVariableValue().

 {
     Variable   *var;
 
     var = lookupVariable(st, name);
     if (var == NULL)
     {
         Variable   *newvars;
 
         /*
          * Check for the name only when declaring a new variable to avoid
          * overhead.
          */
         if (!valid_variable_name(name))
         {
             fprintf(stderr, "%s: invalid variable name: \"%s\"\n",
                     context, name);
             return NULL;
         }
 
         /* Create variable at the end of the array */
         if (st->variables)
             newvars = (Variable *) pg_realloc(st->variables,
                                               (st->nvariables + 1) * sizeof(Variable));
         else
             newvars = (Variable *) pg_malloc(sizeof(Variable));
 
         st->variables = newvars;
 
         var = &newvars[st->nvariables];
 
         var->name = pg_strdup(name);
         var->svalue = NULL;
         /* caller is expected to initialize remaining fields */
 
         st->nvariables++;
         /* we don't re-sort the array till we have to */
         st->vars_sorted = false;
     }
 
     return var;
 }

◆ lookupVariable()

static Variable* lookupVariable	(	CState *	st,
		char *	name
	)

static

Definition at line 1187 of file pgbench.c.

References compareVariableNames(), Variable::name, name, CState::nvariables, qsort, CState::variables, and CState::vars_sorted.

Referenced by evaluateExpr(), getVariable(), lookupCreateVariable(), and main().

 {
     Variable    key;
 
     /* On some versions of Solaris, bsearch of zero items dumps core */
     if (st->nvariables <= 0)
         return NULL;
 
     /* Sort if we have to */
     if (!st->vars_sorted)
     {
         qsort((void *) st->variables, st->nvariables, sizeof(Variable),
               compareVariableNames);
         st->vars_sorted = true;
     }
 
     /* Now we can search */
     key.name = name;
     return (Variable *) bsearch((void *) &key,
                                 (void *) st->variables,
                                 st->nvariables,
                                 sizeof(Variable),
                                 compareVariableNames);
 }

◆ main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 4721 of file pgbench.c.

References _, Assert, checkInitSteps(), StatsData::cnt, ParsedScript::commands, conditional_stack_create(), TState::conn_time, CONNECTION_BAD, CState::cstack, ZipfCache::current, DEFAULT_INIT_STEPS, DEFAULT_NXACTS, disconnect_all(), doConnect(), ERRCODE_UNDEFINED_TABLE, findBuiltin(), get_progname(), getopt_long(), i, CState::id, initStats(), INSTR_TIME_ADD, INSTR_TIME_GET_MICROSEC, INSTR_TIME_SET_CURRENT, INSTR_TIME_SET_ZERO, INSTR_TIME_SUBTRACT, INVALID_THREAD, StatsData::lag, StatsData::latency, TState::latency_late, listAvailableScripts(), TState::logfile, login, lookupVariable(), MAXCLIENTS, mergeSimpleStats(), Variable::name, ZipfCache::nb_cells, nclients, no_argument, TState::nstate, nthreads, NUM_QUERYMODE, num_scripts, CState::nvariables, optarg, optind, ZipfCache::overflowCount, parseQuery(), parseScriptWeight(), PG_DIAG_SQLSTATE, pg_free(), pg_malloc(), pg_realloc(), pg_strdup(), PGBT_NO_VALUE, PGRES_TUPLES_OK, PQclear(), PQdb(), PQerrorMessage(), PQexec(), PQfinish(), PQgetvalue(), PQresultErrorField(), PQresultStatus(), PQstatus(), printResults(), process_builtin(), process_file(), putVariable(), putVariableInt(), putVariableValue(), QUERY_SIMPLE, random(), TState::random_state, required_argument, runInitSteps(), set_random_seed(), setalarm(), StatsData::skipped, SQL_COMMAND, start_time, TState::start_time, TState::state, TState::stats, strerror(), Variable::svalue, TState::thread, threadRun(), TState::tid, tryExecuteStatement(), PgBenchValue::type, generate_unaccent_rules::type, usage(), Variable::value, CState::variables, and TState::zipf_cache.

 {
     static struct option long_options[] = {
         /* systematic long/short named options */
         {"builtin", required_argument, NULL, 'b'},
         {"client", required_argument, NULL, 'c'},
         {"connect", no_argument, NULL, 'C'},
         {"debug", no_argument, NULL, 'd'},
         {"define", required_argument, NULL, 'D'},
         {"file", required_argument, NULL, 'f'},
         {"fillfactor", required_argument, NULL, 'F'},
         {"host", required_argument, NULL, 'h'},
         {"initialize", no_argument, NULL, 'i'},
         {"init-steps", required_argument, NULL, 'I'},
         {"jobs", required_argument, NULL, 'j'},
         {"log", no_argument, NULL, 'l'},
         {"latency-limit", required_argument, NULL, 'L'},
         {"no-vacuum", no_argument, NULL, 'n'},
         {"port", required_argument, NULL, 'p'},
         {"progress", required_argument, NULL, 'P'},
         {"protocol", required_argument, NULL, 'M'},
         {"quiet", no_argument, NULL, 'q'},
         {"report-latencies", no_argument, NULL, 'r'},
         {"rate", required_argument, NULL, 'R'},
         {"scale", required_argument, NULL, 's'},
         {"select-only", no_argument, NULL, 'S'},
         {"skip-some-updates", no_argument, NULL, 'N'},
         {"time", required_argument, NULL, 'T'},
         {"transactions", required_argument, NULL, 't'},
         {"username", required_argument, NULL, 'U'},
         {"vacuum-all", no_argument, NULL, 'v'},
         /* long-named only options */
         {"unlogged-tables", no_argument, NULL, 1},
         {"tablespace", required_argument, NULL, 2},
         {"index-tablespace", required_argument, NULL, 3},
         {"sampling-rate", required_argument, NULL, 4},
         {"aggregate-interval", required_argument, NULL, 5},
         {"progress-timestamp", no_argument, NULL, 6},
         {"log-prefix", required_argument, NULL, 7},
         {"foreign-keys", no_argument, NULL, 8},
         {"random-seed", required_argument, NULL, 9},
         {NULL, 0, NULL, 0}
     };
 
     int         c;
     bool        is_init_mode = false;   /* initialize mode? */
     char       *initialize_steps = NULL;
     bool        foreign_keys = false;
     bool        is_no_vacuum = false;
     bool        do_vacuum_accounts = false; /* vacuum accounts table? */
     int         optindex;
     bool        scale_given = false;
 
     bool        benchmarking_option_set = false;
     bool        initialization_option_set = false;
     bool        internal_script_used = false;
 
     CState     *state;          /* status of clients */
     TState     *threads;        /* array of thread */
 
     instr_time  start_time;     /* start up time */
     instr_time  total_time;
     instr_time  conn_total_time;
     int64       latency_late = 0;
     StatsData   stats;
     int         weight;
 
     int         i;
     int         nclients_dealt;
 
 #ifdef HAVE_GETRLIMIT
     struct rlimit rlim;
 #endif
 
     PGconn     *con;
     PGresult   *res;
     char       *env;
 
     progname = get_progname(argv[0]);
 
     if (argc > 1)
     {
         if (strcmp(argv[1], "--help") == 0 || strcmp(argv[1], "-?") == 0)
         {
             usage();
             exit(0);
         }
         if (strcmp(argv[1], "--version") == 0 || strcmp(argv[1], "-V") == 0)
         {
             puts("pgbench (PostgreSQL) " PG_VERSION);
             exit(0);
         }
     }
 
 #ifdef WIN32
     /* stderr is buffered on Win32. */
     setvbuf(stderr, NULL, _IONBF, 0);
 #endif
 
     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;
 
     state = (CState *) pg_malloc(sizeof(CState));
     memset(state, 0, sizeof(CState));
 
     /* set random seed early, because it may be used while parsing scripts. */
     if (!set_random_seed(getenv("PGBENCH_RANDOM_SEED")))
     {
         fprintf(stderr, "error while setting random seed from PGBENCH_RANDOM_SEED environment variable\n");
         exit(1);
     }
 
     while ((c = getopt_long(argc, argv, "iI:h:nvp:dqb:SNc:j:Crs:t:T:U:lf:D:F:M:P:R:L:", long_options, &optindex)) != -1)
     {
         char       *script;
 
         switch (c)
         {
             case 'i':
                 is_init_mode = true;
                 break;
             case 'I':
                 if (initialize_steps)
                     pg_free(initialize_steps);
                 initialize_steps = pg_strdup(optarg);
                 checkInitSteps(initialize_steps);
                 initialization_option_set = true;
                 break;
             case 'h':
                 pghost = pg_strdup(optarg);
                 break;
             case 'n':
                 is_no_vacuum = true;
                 break;
             case 'v':
                 benchmarking_option_set = true;
                 do_vacuum_accounts = true;
                 break;
             case 'p':
                 pgport = pg_strdup(optarg);
                 break;
             case 'd':
                 debug++;
                 break;
             case 'c':
                 benchmarking_option_set = true;
                 nclients = atoi(optarg);
                 if (nclients <= 0 || nclients > MAXCLIENTS)
                 {
                     fprintf(stderr, "invalid number of clients: \"%s\"\n",
                             optarg);
                     exit(1);
                 }
 #ifdef HAVE_GETRLIMIT
 #ifdef RLIMIT_NOFILE            /* most platforms use RLIMIT_NOFILE */
                 if (getrlimit(RLIMIT_NOFILE, &rlim) == -1)
 #else                           /* but BSD doesn't ... */
                 if (getrlimit(RLIMIT_OFILE, &rlim) == -1)
 #endif                          /* RLIMIT_NOFILE */
                 {
                     fprintf(stderr, "getrlimit failed: %s\n", strerror(errno));
                     exit(1);
                 }
                 if (rlim.rlim_cur < nclients + 3)
                 {
                     fprintf(stderr, "need at least %d open files, but system limit is %ld\n",
                             nclients + 3, (long) rlim.rlim_cur);
                     fprintf(stderr, "Reduce number of clients, or use limit/ulimit to increase the system limit.\n");
                     exit(1);
                 }
 #endif                          /* HAVE_GETRLIMIT */
                 break;
             case 'j':           /* jobs */
                 benchmarking_option_set = true;
                 nthreads = atoi(optarg);
                 if (nthreads <= 0)
                 {
                     fprintf(stderr, "invalid number of threads: \"%s\"\n",
                             optarg);
                     exit(1);
                 }
 #ifndef ENABLE_THREAD_SAFETY
                 if (nthreads != 1)
                 {
                     fprintf(stderr, "threads are not supported on this platform; use -j1\n");
                     exit(1);
                 }
 #endif                          /* !ENABLE_THREAD_SAFETY */
                 break;
             case 'C':
                 benchmarking_option_set = true;
                 is_connect = true;
                 break;
             case 'r':
                 benchmarking_option_set = true;
                 is_latencies = true;
                 break;
             case 's':
                 scale_given = true;
                 scale = atoi(optarg);
                 if (scale <= 0)
                 {
                     fprintf(stderr, "invalid scaling factor: \"%s\"\n", optarg);
                     exit(1);
                 }
                 break;
             case 't':
                 benchmarking_option_set = true;
                 nxacts = atoi(optarg);
                 if (nxacts <= 0)
                 {
                     fprintf(stderr, "invalid number of transactions: \"%s\"\n",
                             optarg);
                     exit(1);
                 }
                 break;
             case 'T':
                 benchmarking_option_set = true;
                 duration = atoi(optarg);
                 if (duration <= 0)
                 {
                     fprintf(stderr, "invalid duration: \"%s\"\n", optarg);
                     exit(1);
                 }
                 break;
             case 'U':
                 login = pg_strdup(optarg);
                 break;
             case 'l':
                 benchmarking_option_set = true;
                 use_log = true;
                 break;
             case 'q':
                 initialization_option_set = true;
                 use_quiet = true;
                 break;
             case 'b':
                 if (strcmp(optarg, "list") == 0)
                 {
                     listAvailableScripts();
                     exit(0);
                 }
                 weight = parseScriptWeight(optarg, &script);
                 process_builtin(findBuiltin(script), weight);
                 benchmarking_option_set = true;
                 internal_script_used = true;
                 break;
             case 'S':
                 process_builtin(findBuiltin("select-only"), 1);
                 benchmarking_option_set = true;
                 internal_script_used = true;
                 break;
             case 'N':
                 process_builtin(findBuiltin("simple-update"), 1);
                 benchmarking_option_set = true;
                 internal_script_used = true;
                 break;
             case 'f':
                 weight = parseScriptWeight(optarg, &script);
                 process_file(script, weight);
                 benchmarking_option_set = true;
                 break;
             case 'D':
                 {
                     char       *p;
 
                     benchmarking_option_set = true;
 
                     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], "option", optarg, p))
                         exit(1);
                 }
                 break;
             case 'F':
                 initialization_option_set = true;
                 fillfactor = atoi(optarg);
                 if (fillfactor < 10 || fillfactor > 100)
                 {
                     fprintf(stderr, "invalid fillfactor: \"%s\"\n", optarg);
                     exit(1);
                 }
                 break;
             case 'M':
                 benchmarking_option_set = true;
                 for (querymode = 0; querymode < NUM_QUERYMODE; querymode++)
                     if (strcmp(optarg, QUERYMODE[querymode]) == 0)
                         break;
                 if (querymode >= NUM_QUERYMODE)
                 {
                     fprintf(stderr, "invalid query mode (-M): \"%s\"\n",
                             optarg);
                     exit(1);
                 }
                 break;
             case 'P':
                 benchmarking_option_set = true;
                 progress = atoi(optarg);
                 if (progress <= 0)
                 {
                     fprintf(stderr, "invalid thread progress delay: \"%s\"\n",
                             optarg);
                     exit(1);
                 }
                 break;
             case 'R':
                 {
                     /* get a double from the beginning of option value */
                     double      throttle_value = atof(optarg);
 
                     benchmarking_option_set = true;
 
                     if (throttle_value <= 0.0)
                     {
                         fprintf(stderr, "invalid rate limit: \"%s\"\n", optarg);
                         exit(1);
                     }
                     /* Invert rate limit into a time offset */
                     throttle_delay = (int64) (1000000.0 / throttle_value);
                 }
                 break;
             case 'L':
                 {
                     double      limit_ms = atof(optarg);
 
                     if (limit_ms <= 0.0)
                     {
                         fprintf(stderr, "invalid latency limit: \"%s\"\n",
                                 optarg);
                         exit(1);
                     }
                     benchmarking_option_set = true;
                     latency_limit = (int64) (limit_ms * 1000);
                 }
                 break;
             case 1:             /* unlogged-tables */
                 initialization_option_set = true;
                 unlogged_tables = true;
                 break;
             case 2:             /* tablespace */
                 initialization_option_set = true;
                 tablespace = pg_strdup(optarg);
                 break;
             case 3:             /* index-tablespace */
                 initialization_option_set = true;
                 index_tablespace = pg_strdup(optarg);
                 break;
             case 4:             /* sampling-rate */
                 benchmarking_option_set = true;
                 sample_rate = atof(optarg);
                 if (sample_rate <= 0.0 || sample_rate > 1.0)
                 {
                     fprintf(stderr, "invalid sampling rate: \"%s\"\n", optarg);
                     exit(1);
                 }
                 break;
             case 5:             /* aggregate-interval */
                 benchmarking_option_set = true;
                 agg_interval = atoi(optarg);
                 if (agg_interval <= 0)
                 {
                     fprintf(stderr, "invalid number of seconds for aggregation: \"%s\"\n",
                             optarg);
                     exit(1);
                 }
                 break;
             case 6:             /* progress-timestamp */
                 progress_timestamp = true;
                 benchmarking_option_set = true;
                 break;
             case 7:             /* log-prefix */
                 benchmarking_option_set = true;
                 logfile_prefix = pg_strdup(optarg);
                 break;
             case 8:             /* foreign-keys */
                 initialization_option_set = true;
                 foreign_keys = true;
                 break;
             case 9:             /* random-seed */
                 benchmarking_option_set = true;
                 if (!set_random_seed(optarg))
                 {
                     fprintf(stderr, "error while setting random seed from --random-seed option\n");
                     exit(1);
                 }
                 break;
             default:
                 fprintf(stderr, _("Try \"%s --help\" for more information.\n"), progname);
                 exit(1);
                 break;
         }
     }
 
     /* set default script if none */
     if (num_scripts == 0 && !is_init_mode)
     {
         process_builtin(findBuiltin("tpcb-like"), 1);
         benchmarking_option_set = true;
         internal_script_used = true;
     }
 
     /* if not simple query mode, parse the script(s) to find parameters */
     if (querymode != QUERY_SIMPLE)
     {
         for (i = 0; i < num_scripts; i++)
         {
             Command   **commands = sql_script[i].commands;
             int         j;
 
             for (j = 0; commands[j] != NULL; j++)
             {
                 if (commands[j]->type != SQL_COMMAND)
                     continue;
                 if (!parseQuery(commands[j]))
                     exit(1);
             }
         }
     }
 
     /* compute total_weight */
     for (i = 0; i < num_scripts; i++)
         /* cannot overflow: weight is 32b, total_weight 64b */
         total_weight += sql_script[i].weight;
 
     if (total_weight == 0 && !is_init_mode)
     {
         fprintf(stderr, "total script weight must not be zero\n");
         exit(1);
     }
 
     /* show per script stats if several scripts are used */
     if (num_scripts > 1)
         per_script_stats = true;
 
     /*
      * Don't need more threads than there are clients.  (This is not merely an
      * optimization; throttle_delay is calculated incorrectly below if some
      * threads have no clients assigned to them.)
      */
     if (nthreads > nclients)
         nthreads = nclients;
 
     /* compute a per thread delay */
     throttle_delay *= nthreads;
 
     if (argc > optind)
         dbName = argv[optind];
     else
     {
         if ((env = getenv("PGDATABASE")) != NULL && *env != '\0')
             dbName = env;
         else if (login != NULL && *login != '\0')
             dbName = login;
         else
             dbName = "";
     }
 
     if (is_init_mode)
     {
         if (benchmarking_option_set)
         {
             fprintf(stderr, "some of the specified options cannot be used in initialization (-i) mode\n");
             exit(1);
         }
 
         if (initialize_steps == NULL)
             initialize_steps = pg_strdup(DEFAULT_INIT_STEPS);
 
         if (is_no_vacuum)
         {
             /* Remove any vacuum step in initialize_steps */
             char       *p;
 
             while ((p = strchr(initialize_steps, 'v')) != NULL)
                 *p = ' ';
         }
 
         if (foreign_keys)
         {
             /* Add 'f' to end of initialize_steps, if not already there */
             if (strchr(initialize_steps, 'f') == NULL)
             {
                 initialize_steps = (char *)
                     pg_realloc(initialize_steps,
                                strlen(initialize_steps) + 2);
                 strcat(initialize_steps, "f");
             }
         }
 
         runInitSteps(initialize_steps);
         exit(0);
     }
     else
     {
         if (initialization_option_set)
         {
             fprintf(stderr, "some of the specified options cannot be used in benchmarking mode\n");
             exit(1);
         }
     }
 
     if (nxacts > 0 && duration > 0)
     {
         fprintf(stderr, "specify either a number of transactions (-t) or a duration (-T), not both\n");
         exit(1);
     }
 
     /* Use DEFAULT_NXACTS if neither nxacts nor duration is specified. */
     if (nxacts <= 0 && duration <= 0)
         nxacts = DEFAULT_NXACTS;
 
     /* --sampling-rate may be used only with -l */
     if (sample_rate > 0.0 && !use_log)
     {
         fprintf(stderr, "log sampling (--sampling-rate) is allowed only when logging transactions (-l)\n");
         exit(1);
     }
 
     /* --sampling-rate may not be used with --aggregate-interval */
     if (sample_rate > 0.0 && agg_interval > 0)
     {
         fprintf(stderr, "log sampling (--sampling-rate) and aggregation (--aggregate-interval) cannot be used at the same time\n");
         exit(1);
     }
 
     if (agg_interval > 0 && !use_log)
     {
         fprintf(stderr, "log aggregation is allowed only when actually logging transactions\n");
         exit(1);
     }
 
     if (!use_log && logfile_prefix)
     {
         fprintf(stderr, "log file prefix (--log-prefix) is allowed only when logging transactions (-l)\n");
         exit(1);
     }
 
     if (duration > 0 && agg_interval > duration)
     {
         fprintf(stderr, "number of seconds for aggregation (%d) must not be higher than test duration (%d)\n", agg_interval, duration);
         exit(1);
     }
 
     if (duration > 0 && agg_interval > 0 && duration % agg_interval != 0)
     {
         fprintf(stderr, "duration (%d) must be a multiple of aggregation interval (%d)\n", duration, agg_interval);
         exit(1);
     }
 
     if (progress_timestamp && progress == 0)
     {
         fprintf(stderr, "--progress-timestamp is allowed only under --progress\n");
         exit(1);
     }
 
     /*
      * save main process id in the global variable because process id will be
      * changed after fork.
      */
     main_pid = (int) getpid();
 
     if (nclients > 1)
     {
         state = (CState *) pg_realloc(state, sizeof(CState) * nclients);
         memset(state + 1, 0, sizeof(CState) * (nclients - 1));
 
         /* copy any -D switch values to all clients */
         for (i = 1; i < nclients; i++)
         {
             int         j;
 
             state[i].id = i;
             for (j = 0; j < state[0].nvariables; j++)
             {
                 Variable   *var = &state[0].variables[j];
 
                 if (var->value.type != PGBT_NO_VALUE)
                 {
                     if (!putVariableValue(&state[i], "startup",
                                            var->name, &var->value))
                         exit(1);
                 }
                 else
                 {
                     if (!putVariable(&state[i], "startup",
                                      var->name, var->svalue))
                         exit(1);
                 }
             }
         }
     }
 
     /* other CState initializations */
     for (i = 0; i < nclients; i++)
     {
         state[i].cstack = conditional_stack_create();
     }
 
     if (debug)
     {
         if (duration <= 0)
             printf("pghost: %s pgport: %s nclients: %d nxacts: %d dbName: %s\n",
                    pghost, pgport, nclients, nxacts, dbName);
         else
             printf("pghost: %s pgport: %s nclients: %d duration: %d dbName: %s\n",
                    pghost, pgport, nclients, duration, dbName);
     }
 
     /* opening connection... */
     con = doConnect();
     if (con == NULL)
         exit(1);
 
     if (PQstatus(con) == CONNECTION_BAD)
     {
         fprintf(stderr, "connection to database \"%s\" failed\n", dbName);
         fprintf(stderr, "%s", PQerrorMessage(con));
         exit(1);
     }
 
     if (internal_script_used)
     {
         /*
          * get the scaling factor that should be same as count(*) from
          * pgbench_branches if this is not a custom query
          */
         res = PQexec(con, "select count(*) from pgbench_branches");
         if (PQresultStatus(res) != PGRES_TUPLES_OK)
         {
             char       *sqlState = PQresultErrorField(res, PG_DIAG_SQLSTATE);
 
             fprintf(stderr, "%s", PQerrorMessage(con));
             if (sqlState && strcmp(sqlState, ERRCODE_UNDEFINED_TABLE) == 0)
             {
                 fprintf(stderr, "Perhaps you need to do initialization (\"pgbench -i\") in database \"%s\"\n", PQdb(con));
             }
 
             exit(1);
         }
         scale = atoi(PQgetvalue(res, 0, 0));
         if (scale < 0)
         {
             fprintf(stderr, "invalid count(*) from pgbench_branches: \"%s\"\n",
                     PQgetvalue(res, 0, 0));
             exit(1);
         }
         PQclear(res);
 
         /* warn if we override user-given -s switch */
         if (scale_given)
             fprintf(stderr,
                     "scale option ignored, using count from pgbench_branches table (%d)\n",
                     scale);
     }
 
     /*
      * :scale variables normally get -s or database scale, but don't override
      * an explicit -D switch
      */
     if (lookupVariable(&state[0], "scale") == NULL)
     {
         for (i = 0; i < nclients; i++)
         {
             if (!putVariableInt(&state[i], "startup", "scale", scale))
                 exit(1);
         }
     }
 
     /*
      * Define a :client_id variable that is unique per connection. But don't
      * override an explicit -D switch.
      */
     if (lookupVariable(&state[0], "client_id") == NULL)
     {
         for (i = 0; i < nclients; i++)
             if (!putVariableInt(&state[i], "startup", "client_id", i))
                 exit(1);
     }
 
     /* set default seed for hash functions */
     if (lookupVariable(&state[0], "default_seed") == NULL)
     {
         uint64  seed = ((uint64) (random() & 0xFFFF) << 48) |
                        ((uint64) (random() & 0xFFFF) << 32) |
                        ((uint64) (random() & 0xFFFF) << 16) |
                        (uint64) (random() & 0xFFFF);
 
         for (i = 0; i < nclients; i++)
             if (!putVariableInt(&state[i], "startup", "default_seed", (int64) seed))
                 exit(1);
     }
 
     /* set random seed unless overwritten */
     if (lookupVariable(&state[0], "random_seed") == NULL)
     {
         for (i = 0; i < nclients; i++)
             if (!putVariableInt(&state[i], "startup", "random_seed", random_seed))
                 exit(1);
     }
 
     if (!is_no_vacuum)
     {
         fprintf(stderr, "starting vacuum...");
         tryExecuteStatement(con, "vacuum pgbench_branches");
         tryExecuteStatement(con, "vacuum pgbench_tellers");
         tryExecuteStatement(con, "truncate pgbench_history");
         fprintf(stderr, "end.\n");
 
         if (do_vacuum_accounts)
         {
             fprintf(stderr, "starting vacuum pgbench_accounts...");
             tryExecuteStatement(con, "vacuum analyze pgbench_accounts");
             fprintf(stderr, "end.\n");
         }
     }
     PQfinish(con);
 
     /* set up thread data structures */
     threads = (TState *) pg_malloc(sizeof(TState) * nthreads);
     nclients_dealt = 0;
 
     for (i = 0; i < nthreads; i++)
     {
         TState     *thread = &threads[i];
 
         thread->tid = i;
         thread->state = &state[nclients_dealt];
         thread->nstate =
             (nclients - nclients_dealt + nthreads - i - 1) / (nthreads - i);
         thread->random_state[0] = random();
         thread->random_state[1] = random();
         thread->random_state[2] = random();
         thread->logfile = NULL; /* filled in later */
         thread->latency_late = 0;
         thread->zipf_cache.nb_cells = 0;
         thread->zipf_cache.current = 0;
         thread->zipf_cache.overflowCount = 0;
         initStats(&thread->stats, 0);
 
         nclients_dealt += thread->nstate;
     }
 
     /* all clients must be assigned to a thread */
     Assert(nclients_dealt == nclients);
 
     /* get start up time */
     INSTR_TIME_SET_CURRENT(start_time);
 
     /* set alarm if duration is specified. */
     if (duration > 0)
         setalarm(duration);
 
     /* start threads */
 #ifdef ENABLE_THREAD_SAFETY
     for (i = 0; i < nthreads; i++)
     {
         TState     *thread = &threads[i];
 
         INSTR_TIME_SET_CURRENT(thread->start_time);
 
         /* compute when to stop */
         if (duration > 0)
             end_time = INSTR_TIME_GET_MICROSEC(thread->start_time) +
                 (int64) 1000000 * duration;
 
         /* the first thread (i = 0) is executed by main thread */
         if (i > 0)
         {
             int         err = pthread_create(&thread->thread, NULL, threadRun, thread);
 
             if (err != 0 || thread->thread == INVALID_THREAD)
             {
                 fprintf(stderr, "could not create thread: %s\n", strerror(err));
                 exit(1);
             }
         }
         else
         {
             thread->thread = INVALID_THREAD;
         }
     }
 #else
     INSTR_TIME_SET_CURRENT(threads[0].start_time);
     /* compute when to stop */
     if (duration > 0)
         end_time = INSTR_TIME_GET_MICROSEC(threads[0].start_time) +
             (int64) 1000000 * duration;
     threads[0].thread = INVALID_THREAD;
 #endif                          /* ENABLE_THREAD_SAFETY */
 
     /* wait for threads and accumulate results */
     initStats(&stats, 0);
     INSTR_TIME_SET_ZERO(conn_total_time);
     for (i = 0; i < nthreads; i++)
     {
         TState     *thread = &threads[i];
 
 #ifdef ENABLE_THREAD_SAFETY
         if (threads[i].thread == INVALID_THREAD)
             /* actually run this thread directly in the main thread */
             (void) threadRun(thread);
         else
             /* wait of other threads. should check that 0 is returned? */
             pthread_join(thread->thread, NULL);
 #else
         (void) threadRun(thread);
 #endif                          /* ENABLE_THREAD_SAFETY */
 
         /* aggregate thread level stats */
         mergeSimpleStats(&stats.latency, &thread->stats.latency);
         mergeSimpleStats(&stats.lag, &thread->stats.lag);
         stats.cnt += thread->stats.cnt;
         stats.skipped += thread->stats.skipped;
         latency_late += thread->latency_late;
         INSTR_TIME_ADD(conn_total_time, thread->conn_time);
     }
     disconnect_all(state, nclients);
 
     /*
      * XXX We compute results as though every client of every thread started
      * and finished at the same time.  That model can diverge noticeably from
      * reality for a short benchmark run involving relatively many threads.
      * The first thread may process notably many transactions before the last
      * thread begins.  Improving the model alone would bring limited benefit,
      * because performance during those periods of partial thread count can
      * easily exceed steady state performance.  This is one of the many ways
      * short runs convey deceptive performance figures.
      */
     INSTR_TIME_SET_CURRENT(total_time);
     INSTR_TIME_SUBTRACT(total_time, start_time);
     printResults(threads, &stats, total_time, conn_total_time, latency_late);
 
     return 0;
 }

Data Structures

Macros

Typedefs

Enumerations

Functions

Variables

Macro Definition Documentation

◆ COMMANDS_ALLOC_NUM

◆ DEFAULT_INIT_STEPS

◆ DEFAULT_NXACTS

◆ ERRCODE_UNDEFINED_TABLE

◆ FNV_OFFSET_BASIS

◆ FNV_PRIME

◆ INVALID_THREAD

◆ LOG_STEP_SECONDS

◆ M_PI

◆ MAX_ARGS

◆ MAX_FARGS

◆ MAX_PREPARE_NAME

◆ MAX_SCRIPTS

◆ MAX_ZIPFIAN_PARAM

◆ MAXCLIENTS

◆ META_COMMAND

◆ MIN_GAUSSIAN_PARAM

◆ MM2_MUL

◆ MM2_ROT

◆ naccounts

◆ nbranches

◆ ntellers

◆ PARAMS_ARRAY_SIZE

◆ pthread_t

◆ SCALE_32BIT_THRESHOLD [1/2]

◆ SCALE_32BIT_THRESHOLD [2/2]

◆ SHELL_COMMAND_SIZE

◆ SQL_COMMAND

◆ WSEP

◆ ZIPF_CACHE_SIZE

Typedef Documentation

◆ BuiltinScript

◆ MetaCommand

◆ ParsedScript

◆ QueryMode

◆ SimpleStats

◆ StatsData

Enumeration Type Documentation

◆ ConnectionStateEnum

◆ MetaCommand

◆ QueryMode

Function Documentation

◆ accumStats()

◆ addScript()

◆ addToSimpleStats()

◆ assignVariables()

◆ CheckConditional()

◆ checkInitSteps()

◆ chooseScript()

◆ coerceToBool()

◆ coerceToDouble()

◆ coerceToInt()

◆ commandFailed()

◆ compareVariableNames()

◆ computeHarmonicZipfian()

◆ computeIterativeZipfian()

◆ ConditionError()

◆ discard_response()

◆ disconnect_all()

◆ doConnect()

◆ doCustom()

◆ doLog()

◆ evalFunc()

◆ evalLazyFunc()

◆ evalStandardFunc()

◆ evaluateExpr()

◆ evaluateSleep()

◆ executeStatement()

◆ findBuiltin()

◆ finishCon()

◆ generalizedHarmonicNumber()

◆ getExponentialRand()

◆ getGaussianRand()