pgstat.c 69.8 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/* ----------
 * pgstat.c
 *
 *	All the statistics collector stuff hacked up in one big, ugly file.
 *
 *	TODO:	- Separate collector, postmaster and backend stuff
 *			  into different files.
 *
 *			- Add some automatic call for pgstat vacuuming.
 *
 *			- Add a pgstat config column to pg_database, so this
12
 *			  entire thing can be enabled/disabled on a per db basis.
13
 *
14
 *	Copyright (c) 2001-2003, PostgreSQL Global Development Group
15
 *
16
 *	$PostgreSQL: pgsql/src/backend/postmaster/pgstat.c,v 1.74 2004/06/03 02:08:03 tgl Exp $
17 18
 * ----------
 */
P
Peter Eisentraut 已提交
19 20
#include "postgres.h"

21 22 23 24
#include <unistd.h>
#include <fcntl.h>
#include <sys/param.h>
#include <sys/time.h>
B
Bruce Momjian 已提交
25
#include <sys/types.h>
26
#include <sys/socket.h>
B
Bruce Momjian 已提交
27
#include <netdb.h>
28 29 30 31
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <signal.h>
32
#include <time.h>
33

34 35
#include "pgstat.h"

36
#include "access/heapam.h"
37
#include "access/xact.h"
38 39
#include "catalog/catname.h"
#include "catalog/pg_database.h"
40
#include "catalog/pg_shadow.h"
B
Bruce Momjian 已提交
41
#include "libpq/libpq.h"
42
#include "libpq/pqsignal.h"
43
#include "mb/pg_wchar.h"
44
#include "miscadmin.h"
45
#include "postmaster/postmaster.h"
46
#include "storage/backendid.h"
47
#include "storage/ipc.h"
48
#include "storage/pg_shmem.h"
49
#include "storage/pmsignal.h"
50
#include "tcop/tcopprot.h"
51
#include "utils/hsearch.h"
52
#include "utils/memutils.h"
53
#include "utils/ps_status.h"
54
#include "utils/rel.h"
55 56 57 58
#include "utils/syscache.h"


/* ----------
59
 * GUC parameters
60 61
 * ----------
 */
62 63 64 65 66
bool		pgstat_collect_startcollector = true;
bool		pgstat_collect_resetonpmstart = true;
bool		pgstat_collect_querystring = false;
bool		pgstat_collect_tuplelevel = false;
bool		pgstat_collect_blocklevel = false;
67

68 69 70 71 72 73
/* ----------
 * Other global variables
 * ----------
 */
bool		pgstat_is_running = false;

74 75 76 77
/* ----------
 * Local data
 * ----------
 */
78
NON_EXEC_STATIC int	pgStatSock = -1;
79
static int	pgStatPipe[2];
B
Bruce Momjian 已提交
80
static struct sockaddr_storage pgStatAddr;
81

82
static int	pgStatPid;
83
static time_t last_pgstat_start_time;
84

85
static long pgStatNumMessages = 0;
86

87
static bool pgStatRunningInCollector = FALSE;
88

89 90 91
static int	pgStatTabstatAlloc = 0;
static int	pgStatTabstatUsed = 0;
static PgStat_MsgTabstat **pgStatTabstatMessages = NULL;
B
Bruce Momjian 已提交
92

93 94
#define TABSTAT_QUANTUM		4	/* we alloc this many at a time */

95 96
static int	pgStatXactCommit = 0;
static int	pgStatXactRollback = 0;
97

98 99 100 101 102
static TransactionId pgStatDBHashXact = InvalidTransactionId;
static HTAB *pgStatDBHash = NULL;
static HTAB *pgStatBeDead = NULL;
static PgStat_StatBeEntry *pgStatBeTable = NULL;
static int	pgStatNumBackends = 0;
103

104
static char pgStat_fname[MAXPGPATH];
105
static char pgStat_tmpfname[MAXPGPATH];
106 107 108 109 110 111


/* ----------
 * Local function forward declarations
 * ----------
 */
112
#ifdef EXEC_BACKEND
113 114 115 116 117 118 119

typedef enum STATS_PROCESS_TYPE
{
	STAT_PROC_BUFFER,
	STAT_PROC_COLLECTOR
} STATS_PROCESS_TYPE;

120
static pid_t pgstat_forkexec(STATS_PROCESS_TYPE procType);
121 122
static void pgstat_parseArgs(int argc, char *argv[]);

123
#endif
124 125 126

NON_EXEC_STATIC void PgstatBufferMain(int argc, char *argv[]);
NON_EXEC_STATIC void PgstatCollectorMain(int argc, char *argv[]);
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
static void pgstat_recvbuffer(void);
static void pgstat_die(SIGNAL_ARGS);

static int	pgstat_add_backend(PgStat_MsgHdr *msg);
static void pgstat_sub_backend(int procpid);
static void pgstat_drop_database(Oid databaseid);
static void pgstat_write_statsfile(void);
static void pgstat_read_statsfile(HTAB **dbhash, Oid onlydb,
					  PgStat_StatBeEntry **betab,
					  int *numbackends);

static void pgstat_setheader(PgStat_MsgHdr *hdr, int mtype);
static void pgstat_send(void *msg, int len);

static void pgstat_recv_bestart(PgStat_MsgBestart *msg, int len);
static void pgstat_recv_beterm(PgStat_MsgBeterm *msg, int len);
static void pgstat_recv_activity(PgStat_MsgActivity *msg, int len);
static void pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len);
static void pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len);
static void pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len);
static void pgstat_recv_resetcounter(PgStat_MsgResetcounter *msg, int len);
148 149 150 151 152 153 154 155 156 157 158


/* ------------------------------------------------------------
 * Public functions called from postmaster follow
 * ------------------------------------------------------------
 */

/* ----------
 * pgstat_init() -
 *
 *	Called from postmaster at startup. Create the resources required
159 160 161
 *	by the statistics collector process.  If unable to do so, do not
 *	fail --- better to let the postmaster start with stats collection
 *	disabled.
162 163
 * ----------
 */
164
void
165 166
pgstat_init(void)
{
B
Bruce Momjian 已提交
167 168 169 170
	ACCEPT_TYPE_ARG3 alen;
	struct addrinfo *addrs = NULL,
			   *addr,
				hints;
B
Bruce Momjian 已提交
171
	int			ret;
172 173 174 175 176 177
	fd_set      rset;
	struct timeval tv;
	char        test_byte;
	int         sel_res;

#define TESTBYTEVAL ((char) 199)
178

179 180 181
	/*
	 * Force start of collector daemon if something to collect
	 */
182 183
	if (pgstat_collect_querystring ||
		pgstat_collect_tuplelevel ||
184
		pgstat_collect_blocklevel)
185 186
		pgstat_collect_startcollector = true;

187
	/*
188 189 190 191
	 * Initialize the filename for the status reports.  (In the EXEC_BACKEND
	 * case, this only sets the value in the postmaster.  The collector
	 * subprocess will recompute the value for itself, and individual
	 * backends must do so also if they want to access the file.)
192
	 */
193
	snprintf(pgStat_fname, MAXPGPATH, PGSTAT_STAT_FILENAME, DataDir);
194

195
	/*
196 197
	 * If we don't have to start a collector or should reset the collected
	 * statistics on postmaster start, simply remove the file.
198 199 200 201 202 203 204 205
	 */
	if (!pgstat_collect_startcollector || pgstat_collect_resetonpmstart)
		unlink(pgStat_fname);

	/*
	 * Nothing else required if collector will not get started
	 */
	if (!pgstat_collect_startcollector)
206
		return;
207

208
	/*
209
	 * Create the UDP socket for sending and receiving statistic messages
210
	 */
B
Bruce Momjian 已提交
211 212 213 214 215 216 217 218
	hints.ai_flags = AI_PASSIVE;
	hints.ai_family = PF_UNSPEC;
	hints.ai_socktype = SOCK_DGRAM;
	hints.ai_protocol = 0;
	hints.ai_addrlen = 0;
	hints.ai_addr = NULL;
	hints.ai_canonname = NULL;
	hints.ai_next = NULL;
219 220
	ret = getaddrinfo_all("localhost", NULL, &hints, &addrs);
	if (ret || !addrs)
B
Bruce Momjian 已提交
221
	{
222
		ereport(LOG,
223
				(errmsg("could not resolve \"localhost\": %s",
224
						gai_strerror(ret))));
B
Bruce Momjian 已提交
225 226
		goto startup_failed;
	}
B
Bruce Momjian 已提交
227

228 229 230 231 232 233 234 235
	/*
	 * On some platforms, getaddrinfo_all() may return multiple addresses
	 * only one of which will actually work (eg, both IPv6 and IPv4 addresses
	 * when kernel will reject IPv6).  Worse, the failure may occur at the
	 * bind() or perhaps even connect() stage.  So we must loop through the
	 * results till we find a working combination.  We will generate LOG
	 * messages, but no error, for bogus combinations.
	 */
236 237 238 239 240 241 242
	for (addr = addrs; addr; addr = addr->ai_next)
	{
#ifdef HAVE_UNIX_SOCKETS
		/* Ignore AF_UNIX sockets, if any are returned. */
		if (addr->ai_family == AF_UNIX)
			continue;
#endif
243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
		/*
		 * Create the socket.
		 */
		if ((pgStatSock = socket(addr->ai_family, SOCK_DGRAM, 0)) < 0)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not create socket for statistics collector: %m")));
			continue;
		}

		/*
		 * Bind it to a kernel assigned port on localhost and get the assigned
		 * port via getsockname().
		 */
		if (bind(pgStatSock, addr->ai_addr, addr->ai_addrlen) < 0)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not bind socket for statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

		alen = sizeof(pgStatAddr);
		if (getsockname(pgStatSock, (struct sockaddr *) &pgStatAddr, &alen) < 0)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not get address of socket for statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

		/*
		 * Connect the socket to its own address.  This saves a few cycles by
		 * not having to respecify the target address on every send. This also
		 * provides a kernel-level check that only packets from this same
		 * address will be received.
		 */
		if (connect(pgStatSock, (struct sockaddr *) &pgStatAddr, alen) < 0)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not connect socket for statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}
B
Bruce Momjian 已提交
294

295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
		/*
		 * Try to send and receive a one-byte test message on the socket.
		 * This is to catch situations where the socket can be created but
		 * will not actually pass data (for instance, because kernel packet
		 * filtering rules prevent it).
		 */
		test_byte = TESTBYTEVAL;
		if (send(pgStatSock, &test_byte, 1, 0) != 1)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not send test message on socket for statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

		/*
		 * There could possibly be a little delay before the message can be
		 * received.  We arbitrarily allow up to half a second before deciding
		 * it's broken.
		 */
		for (;;)				/* need a loop to handle EINTR */
		{
			FD_ZERO(&rset);
			FD_SET(pgStatSock, &rset);
			tv.tv_sec = 0;
			tv.tv_usec = 500000;
			sel_res = select(pgStatSock+1, &rset, NULL, NULL, &tv);
			if (sel_res >= 0 || errno != EINTR)
				break;
		}
		if (sel_res < 0)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("select() failed in statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}
		if (sel_res == 0 || !FD_ISSET(pgStatSock, &rset))
		{
			/*
			 * This is the case we actually think is likely, so take pains to
			 * give a specific message for it.
			 *
			 * errno will not be set meaningfully here, so don't use it.
			 */
			ereport(LOG,
					(ERRCODE_CONNECTION_FAILURE,
					 errmsg("test message did not get through on socket for statistics collector")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

		test_byte++;			/* just make sure variable is changed */

		if (recv(pgStatSock, &test_byte, 1, 0) != 1)
		{
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("could not receive test message on socket for statistics collector: %m")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

		if (test_byte != TESTBYTEVAL) /* strictly paranoia ... */
		{
			ereport(LOG,
					(ERRCODE_INTERNAL_ERROR,
					 errmsg("incorrect test message transmission on socket for statistics collector")));
			closesocket(pgStatSock);
			pgStatSock = -1;
			continue;
		}

374 375
		/* If we get here, we have a working socket */
		break;
376 377
	}

378 379
	/* Did we find a working address? */
	if (!addr || pgStatSock < 0)
380
	{
381 382
		ereport(LOG,
				(errcode_for_socket_access(),
383
				 errmsg("disabling statistics collector for lack of working socket")));
384
		goto startup_failed;
385 386 387 388 389 390 391
	}

	/*
	 * Set the socket to non-blocking IO.  This ensures that if the
	 * collector falls behind (despite the buffering process), statistics
	 * messages will be discarded; backends won't block waiting to send
	 * messages to the collector.
392
	 */
393
	if (!set_noblock(pgStatSock))
394
	{
395 396
		ereport(LOG,
				(errcode_for_socket_access(),
397
		errmsg("could not set statistics collector socket to nonblocking mode: %m")));
398
		goto startup_failed;
399 400
	}

401 402
	freeaddrinfo_all(hints.ai_family, addrs);

403
	return;
404 405

startup_failed:
406 407
	if (addrs)
		freeaddrinfo_all(hints.ai_family, addrs);
B
Bruce Momjian 已提交
408

409
	if (pgStatSock >= 0)
410
		closesocket(pgStatSock);
411 412 413
	pgStatSock = -1;

	/* Adjust GUC variables to suppress useless activity */
414
	pgstat_collect_startcollector = false;
415 416 417
	pgstat_collect_querystring = false;
	pgstat_collect_tuplelevel = false;
	pgstat_collect_blocklevel = false;
418 419 420
}


421 422
#ifdef EXEC_BACKEND

423
/*
424
 * pgstat_forkexec() -
425
 *
426
 * Format up the arglist for, then fork and exec, statistics
427 428
 * (buffer and collector) processes
 */
429 430
static pid_t
pgstat_forkexec(STATS_PROCESS_TYPE procType)
431
{
432
	char *av[10];
433
	int ac = 0, bufc = 0, i;
434
	char pgstatBuf[2][32];
435 436

	av[ac++] = "postgres";
437

438 439 440
	switch (procType)
	{
		case STAT_PROC_BUFFER:
441
			av[ac++] = "-forkbuf";
442 443 444
			break;

		case STAT_PROC_COLLECTOR:
445
			av[ac++] = "-forkcol";
446 447 448 449 450 451
			break;

		default:
			Assert(false);
	}

452 453 454 455 456
	av[ac++] = NULL;			/* filled in by postmaster_forkexec */

	/* postgres_exec_path is not passed by write_backend_variables */
	av[ac++] = postgres_exec_path;

457
	/* Pipe file ids (those not passed by write_backend_variables) */
458 459
	snprintf(pgstatBuf[bufc++],32,"%d",pgStatPipe[0]);
	snprintf(pgstatBuf[bufc++],32,"%d",pgStatPipe[1]);
460 461 462 463 464 465

	/* Add to the arg list */
	Assert(bufc <= lengthof(pgstatBuf));
	for (i = 0; i < bufc; i++)
		av[ac++] = pgstatBuf[i];

466 467
	av[ac] = NULL;
	Assert(ac < lengthof(av));
468

469
	return postmaster_forkexec(ac, av);
470 471 472
}


473
/*
474 475
 * pgstat_parseArgs() -
 *
476
 * Extract data from the arglist for exec'ed statistics
477 478 479
 * (buffer and collector) processes
 */
static void
480
pgstat_parseArgs(int argc, char *argv[])
481
{
482
	Assert(argc == 6);
483

484 485
	argc = 3;
	StrNCpy(postgres_exec_path,	argv[argc++], MAXPGPATH);
486 487 488 489
	pgStatPipe[0]	= atoi(argv[argc++]);
	pgStatPipe[1]	= atoi(argv[argc++]);
}

490 491
#endif /* EXEC_BACKEND */

492

493 494 495 496
/* ----------
 * pgstat_start() -
 *
 *	Called from postmaster at startup or after an existing collector
497
 *	died.  Attempt to fire up a fresh statistics collector.
498
 *
499
 *	Note: if fail, we will be called again from the postmaster main loop.
500 501
 * ----------
 */
502
void
503
pgstat_start(void)
504
{
505 506
	time_t		curtime;

507 508 509
	/*
	 * Do nothing if no collector needed
	 */
510 511
	if (pgstat_is_running || !pgstat_collect_startcollector)
		return;
512

513
	/*
514
	 * Do nothing if too soon since last collector start.  This is a
B
Bruce Momjian 已提交
515 516 517 518
	 * safety valve to protect against continuous respawn attempts if the
	 * collector is dying immediately at launch.  Note that since we will
	 * be re-called from the postmaster main loop, we will get another
	 * chance later.
519 520 521 522 523 524 525 526 527
	 */
	curtime = time(NULL);
	if ((unsigned int) (curtime - last_pgstat_start_time) <
		(unsigned int) PGSTAT_RESTART_INTERVAL)
		return;
	last_pgstat_start_time = curtime;

	/*
	 * Check that the socket is there, else pgstat_init failed.
528 529 530
	 */
	if (pgStatSock < 0)
	{
531 532
		ereport(LOG,
				(errmsg("statistics collector startup skipped")));
B
Bruce Momjian 已提交
533

534 535 536 537 538 539
		/*
		 * We can only get here if someone tries to manually turn
		 * pgstat_collect_startcollector on after it had been off.
		 */
		pgstat_collect_startcollector = false;
		return;
540 541 542
	}

	/*
B
Bruce Momjian 已提交
543 544
	 * Okay, fork off the collector.  Remember its PID for
	 * pgstat_ispgstat.
545
	 */
546 547 548 549 550 551 552 553 554

	fflush(stdout);
	fflush(stderr);

#ifdef __BEOS__
	/* Specific beos actions before backend startup */
	beos_before_backend_startup();
#endif

555
#ifdef EXEC_BACKEND
556
	switch ((pgStatPid = (int) pgstat_forkexec(STAT_PROC_BUFFER)))
557
#else
558
	switch ((pgStatPid = (int) fork()))
559
#endif
560 561
	{
		case -1:
562 563 564 565
#ifdef __BEOS__
			/* Specific beos actions */
			beos_backend_startup_failed();
#endif
566 567
			ereport(LOG,
					(errmsg("could not fork statistics buffer: %m")));
568
			return;
569

570
#ifndef EXEC_BACKEND
571
		case 0:
572 573 574 575 576
			/* in postmaster child ... */
#ifdef __BEOS__
			/* Specific beos actions after backend startup */
			beos_backend_startup();
#endif
577 578
			/* Close the postmaster's sockets */
			ClosePostmasterPorts();
579 580 581 582

			/* Drop our connection to postmaster's shared memory, as well */
			PGSharedMemoryDetach();

583
			PgstatBufferMain(0, NULL);
584
			break;
585
#endif
586 587

		default:
588 589
			pgstat_is_running = true;
			return;
590 591 592 593 594 595 596 597 598 599 600
	}
}


/* ----------
 * pgstat_ispgstat() -
 *
 *	Called from postmaster to check if a terminated child process
 *	was the statistics collector.
 * ----------
 */
601
bool
602 603
pgstat_ispgstat(int pid)
{
604 605
	if (!pgstat_is_running)
		return false;
606 607

	if (pgStatPid != pid)
608 609 610 611
		return false;

	/* Oh dear ... */
	pgstat_is_running = false;
612

613
	return true;
614 615 616 617 618 619 620 621 622 623 624 625
}


/* ----------
 * pgstat_beterm() -
 *
 *	Called from postmaster to tell collector a backend terminated.
 * ----------
 */
void
pgstat_beterm(int pid)
{
626
	PgStat_MsgBeterm msg;
627

628
	if (pgStatSock < 0)
629 630
		return;

631
	MemSet(&(msg.m_hdr), 0, sizeof(msg.m_hdr));
632 633
	msg.m_hdr.m_type = PGSTAT_MTYPE_BETERM;
	msg.m_hdr.m_procpid = pid;
634 635 636 637 638 639 640

	pgstat_send(&msg, sizeof(msg));
}


/* ------------------------------------------------------------
 * Public functions used by backends follow
641
 *------------------------------------------------------------
642 643 644 645 646 647 648 649 650 651 652 653 654
 */


/* ----------
 * pgstat_bestart() -
 *
 *	Tell the collector that this new backend is soon ready to process
 *	queries. Called from tcop/postgres.c before entering the mainloop.
 * ----------
 */
void
pgstat_bestart(void)
{
655
	PgStat_MsgBestart msg;
656

657
	if (pgStatSock < 0)
658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673
		return;

	pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_BESTART);
	pgstat_send(&msg, sizeof(msg));
}


/* ----------
 * pgstat_report_activity() -
 *
 *	Called in tcop/postgres.c to tell the collector what the backend
 *	is actually doing (usually "<IDLE>" or the start of the query to
 *	be executed).
 * ----------
 */
void
674
pgstat_report_activity(const char *what)
675
{
676 677
	PgStat_MsgActivity msg;
	int			len;
678

679
	if (!pgstat_collect_querystring || pgStatSock < 0)
680 681 682
		return;

	len = strlen(what);
683 684
	len = pg_mbcliplen((const unsigned char *) what, len,
					   PGSTAT_ACTIVITY_SIZE - 1);
685

686 687
	memcpy(msg.m_what, what, len);
	msg.m_what[len] = '\0';
688
	len += offsetof(PgStat_MsgActivity, m_what) +1;
689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704

	pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_ACTIVITY);
	pgstat_send(&msg, len);
}


/* ----------
 * pgstat_report_tabstat() -
 *
 *	Called from tcop/postgres.c to send the so far collected
 *	per table access statistics to the collector.
 * ----------
 */
void
pgstat_report_tabstat(void)
{
705
	int			i;
706

707 708 709 710 711 712 713
	if (pgStatSock < 0 ||
		!(pgstat_collect_querystring ||
		  pgstat_collect_tuplelevel ||
		  pgstat_collect_blocklevel))
	{
		/* Not reporting stats, so just flush whatever we have */
		pgStatTabstatUsed = 0;
714
		return;
715
	}
716 717

	/*
718 719
	 * For each message buffer used during the last query set the header
	 * fields and send it out.
720 721 722
	 */
	for (i = 0; i < pgStatTabstatUsed; i++)
	{
723 724 725 726 727
		PgStat_MsgTabstat *tsmsg = pgStatTabstatMessages[i];
		int			n;
		int			len;

		n = tsmsg->m_nentries;
728 729
		len = offsetof(PgStat_MsgTabstat, m_entry[0]) +
			n * sizeof(PgStat_TableEntry);
730

731 732
		tsmsg->m_xact_commit = pgStatXactCommit;
		tsmsg->m_xact_rollback = pgStatXactRollback;
733
		pgStatXactCommit = 0;
734 735
		pgStatXactRollback = 0;

736 737
		pgstat_setheader(&tsmsg->m_hdr, PGSTAT_MTYPE_TABSTAT);
		pgstat_send(tsmsg, len);
738 739 740 741 742 743 744 745 746 747 748 749 750 751 752
	}

	pgStatTabstatUsed = 0;
}


/* ----------
 * pgstat_vacuum_tabstat() -
 *
 *	Will tell the collector about objects he can get rid of.
 * ----------
 */
int
pgstat_vacuum_tabstat(void)
{
753 754 755 756 757 758 759 760 761 762 763 764 765 766
	Relation	dbrel;
	HeapScanDesc dbscan;
	HeapTuple	dbtup;
	Oid		   *dbidlist;
	int			dbidalloc;
	int			dbidused;
	HASH_SEQ_STATUS hstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	HeapTuple	reltup;
	int			nobjects = 0;
	PgStat_MsgTabpurge msg;
	int			len;
	int			i;
767 768 769 770 771 772 773 774

	if (pgStatSock < 0)
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
775
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
776
	{
777
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
778
							  &pgStatBeTable, &pgStatNumBackends);
779 780 781 782 783 784
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our own database entry
	 */
785 786 787
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
												 HASH_FIND, NULL);
788
	if (dbentry == NULL)
789 790 791 792 793 794 795 796 797 798 799 800 801
		return -1;

	if (dbentry->tables == NULL)
		return 0;

	/*
	 * Initialize our messages table counter to zero
	 */
	msg.m_nentries = 0;

	/*
	 * Check for all tables if they still exist.
	 */
802
	hash_seq_init(&hstat, dbentry->tables);
803
	while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&hstat)) != NULL)
804 805
	{
		/*
806 807
		 * Check if this relation is still alive by looking up it's
		 * pg_class tuple in the system catalog cache.
808 809
		 */
		reltup = SearchSysCache(RELOID,
810 811
								ObjectIdGetDatum(tabentry->tableid),
								0, 0, 0);
812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
		if (HeapTupleIsValid(reltup))
		{
			ReleaseSysCache(reltup);
			continue;
		}

		/*
		 * Add this tables Oid to the message
		 */
		msg.m_tableid[msg.m_nentries++] = tabentry->tableid;
		nobjects++;

		/*
		 * If the message is full, send it out and reinitialize ot zero
		 */
		if (msg.m_nentries >= PGSTAT_NUM_TABPURGE)
		{
829
			len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
830
				+msg.m_nentries * sizeof(Oid);
831 832 833 834 835 836 837 838 839 840 841 842 843

			pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_TABPURGE);
			pgstat_send(&msg, len);

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
844
		len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
845
			+msg.m_nentries * sizeof(Oid);
846 847 848 849 850 851 852 853 854 855

		pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_TABPURGE);
		pgstat_send(&msg, len);
	}

	/*
	 * Read pg_database and remember the Oid's of all existing databases
	 */
	dbidalloc = 256;
	dbidused = 0;
856
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
857 858

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
859 860
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
861 862 863 864
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
865 866
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
867
		}
868
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
869 870 871 872 873
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

	/*
874 875
	 * Search the database hash table for dead databases and tell the
	 * collector to drop them as well.
876 877
	 */
	hash_seq_init(&hstat, pgStatDBHash);
878
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
879
	{
880
		Oid			dbid = dbentry->databaseid;
881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900

		for (i = 0; i < dbidused; i++)
		{
			if (dbidlist[i] == dbid)
			{
				dbid = InvalidOid;
				break;
			}
		}

		if (dbid != InvalidOid)
		{
			nobjects++;
			pgstat_drop_database(dbid);
		}
	}

	/*
	 * Free the dbid list.
	 */
901
	pfree((char *) dbidlist);
902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921

	/*
	 * Tell the caller how many removeable objects we found
	 */
	return nobjects;
}


/* ----------
 * pgstat_drop_database() -
 *
 *	Tell the collector that we just dropped a database.
 *	This is the only message that shouldn't get lost in space. Otherwise
 *	the collector will keep the statistics for the dead DB until his
 *	stats file got removed while the postmaster is down.
 * ----------
 */
static void
pgstat_drop_database(Oid databaseid)
{
922
	PgStat_MsgDropdb msg;
923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942

	if (pgStatSock < 0)
		return;

	msg.m_databaseid = databaseid;

	pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_DROPDB);
	pgstat_send(&msg, sizeof(msg));
}


/* ----------
 * pgstat_reset_counters() -
 *
 *	Tell the statistics collector to reset counters for our database.
 * ----------
 */
void
pgstat_reset_counters(void)
{
943
	PgStat_MsgResetcounter msg;
944 945 946 947 948

	if (pgStatSock < 0)
		return;

	if (!superuser())
949 950
		ereport(ERROR,
				(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
B
Bruce Momjian 已提交
951
			  errmsg("must be superuser to reset statistics counters")));
952 953 954 955 956 957 958 959 960 961 962 963 964 965 966

	pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_RESETCOUNTER);
	pgstat_send(&msg, sizeof(msg));
}


/* ----------
 * pgstat_ping() -
 *
 *	Send some junk data to the collector to increase traffic.
 * ----------
 */
void
pgstat_ping(void)
{
967
	PgStat_MsgDummy msg;
968 969 970 971 972 973 974 975

	if (pgStatSock < 0)
		return;

	pgstat_setheader(&msg.m_hdr, PGSTAT_MTYPE_DUMMY);
	pgstat_send(&msg, sizeof(msg));
}

976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022
/*
 * Create or enlarge the pgStatTabstatMessages array
 */
static bool
more_tabstat_space(void)
{
	PgStat_MsgTabstat *newMessages;
	PgStat_MsgTabstat **msgArray;
	int			newAlloc = pgStatTabstatAlloc + TABSTAT_QUANTUM;
	int			i;

	/* Create (another) quantum of message buffers */
	newMessages = (PgStat_MsgTabstat *)
		malloc(sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
	if (newMessages == NULL)
	{
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory")));
		return false;
	}

	/* Create or enlarge the pointer array */
	if (pgStatTabstatMessages == NULL)
		msgArray = (PgStat_MsgTabstat **)
			malloc(sizeof(PgStat_MsgTabstat *) * newAlloc);
	else
		msgArray = (PgStat_MsgTabstat **)
			realloc(pgStatTabstatMessages,
					sizeof(PgStat_MsgTabstat *) * newAlloc);
	if (msgArray == NULL)
	{
		free(newMessages);
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory")));
		return false;
	}

	MemSet(newMessages, 0, sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
	for (i = 0; i < TABSTAT_QUANTUM; i++)
		msgArray[pgStatTabstatAlloc + i] = newMessages++;
	pgStatTabstatMessages = msgArray;
	pgStatTabstatAlloc = newAlloc;

	return true;
}
1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035

/* ----------
 * pgstat_initstats() -
 *
 *	Called from various places usually dealing with initialization
 *	of Relation or Scan structures. The data placed into these
 *	structures from here tell where later to count for buffer reads,
 *	scans and tuples fetched.
 * ----------
 */
void
pgstat_initstats(PgStat_Info *stats, Relation rel)
{
1036
	Oid			rel_id = rel->rd_id;
1037 1038
	PgStat_TableEntry *useent;
	PgStat_MsgTabstat *tsmsg;
1039 1040
	int			mb;
	int			i;
1041 1042 1043 1044

	/*
	 * Initialize data not to count at all.
	 */
1045 1046 1047 1048
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
1049

1050 1051 1052
	if (pgStatSock < 0 ||
		!(pgstat_collect_tuplelevel ||
		  pgstat_collect_blocklevel))
1053 1054 1055 1056 1057 1058
	{
		stats->no_stats = TRUE;
		return;
	}

	/*
1059
	 * Search the already-used message slots for this relation.
1060 1061 1062
	 */
	for (mb = 0; mb < pgStatTabstatUsed; mb++)
	{
1063 1064 1065
		tsmsg = pgStatTabstatMessages[mb];

		for (i = tsmsg->m_nentries; --i >= 0; )
1066
		{
1067
			if (tsmsg->m_entry[i].t_id == rel_id)
1068
			{
1069
				stats->tabentry = (void *) &(tsmsg->m_entry[i]);
1070 1071 1072 1073
				return;
			}
		}

1074
		if (tsmsg->m_nentries >= PGSTAT_NUM_TABENTRIES)
1075
			continue;
1076

1077 1078 1079 1080
		/*
		 * Not found, but found a message buffer with an empty slot
		 * instead. Fine, let's use this one.
		 */
1081 1082
		i = tsmsg->m_nentries++;
		useent = &tsmsg->m_entry[i];
1083
		MemSet(useent, 0, sizeof(PgStat_TableEntry));
1084
		useent->t_id = rel_id;
1085
		stats->tabentry = (void *) useent;
1086 1087 1088 1089 1090 1091 1092 1093
		return;
	}

	/*
	 * If we ran out of message buffers, we just allocate more.
	 */
	if (pgStatTabstatUsed >= pgStatTabstatAlloc)
	{
1094
		if (!more_tabstat_space())
1095
		{
1096
			stats->no_stats = TRUE;
1097
			return;
1098
		}
1099
		Assert(pgStatTabstatUsed < pgStatTabstatAlloc);
1100 1101 1102 1103 1104 1105
	}

	/*
	 * Use the first entry of the next message buffer.
	 */
	mb = pgStatTabstatUsed++;
1106 1107 1108
	tsmsg = pgStatTabstatMessages[mb];
	tsmsg->m_nentries = 1;
	useent = &tsmsg->m_entry[0];
1109
	MemSet(useent, 0, sizeof(PgStat_TableEntry));
1110
	useent->t_id = rel_id;
1111
	stats->tabentry = (void *) useent;
1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123
}


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
1124 1125 1126
	if (!(pgstat_collect_querystring ||
		  pgstat_collect_tuplelevel ||
		  pgstat_collect_blocklevel))
1127 1128
		return;

1129 1130 1131
	pgStatXactCommit++;

	/*
1132 1133 1134
	 * If there was no relation activity yet, just make one existing
	 * message buffer used without slots, causing the next report to tell
	 * new xact-counters.
1135
	 */
1136
	if (pgStatTabstatAlloc == 0)
1137
	{
1138 1139 1140 1141 1142 1143 1144
		if (!more_tabstat_space())
			return;
	}
	if (pgStatTabstatUsed == 0)
	{
		pgStatTabstatUsed++;
		pgStatTabstatMessages[0]->m_nentries = 0;
1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157
	}
}


/* ----------
 * pgstat_count_xact_rollback() -
 *
 *	Called from access/transam/xact.c to count transaction rollbacks.
 * ----------
 */
void
pgstat_count_xact_rollback(void)
{
1158 1159 1160
	if (!(pgstat_collect_querystring ||
		  pgstat_collect_tuplelevel ||
		  pgstat_collect_blocklevel))
1161 1162
		return;

1163 1164 1165
	pgStatXactRollback++;

	/*
1166 1167 1168
	 * If there was no relation activity yet, just make one existing
	 * message buffer used without slots, causing the next report to tell
	 * new xact-counters.
1169
	 */
1170
	if (pgStatTabstatAlloc == 0)
1171
	{
1172 1173 1174 1175 1176 1177 1178
		if (!more_tabstat_space())
			return;
	}
	if (pgStatTabstatUsed == 0)
	{
		pgStatTabstatUsed++;
		pgStatTabstatMessages[0]->m_nentries = 0;
1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194
	}
}


/* ----------
 * pgstat_fetch_stat_dbentry() -
 *
 *	Support function for the SQL-callable pgstat* functions. Returns
 *	the collected statistics for one database or NULL. NULL doesn't mean
 *	that the database doesn't exist, it is just not yet known by the
 *	collector, so the caller is better off to report ZERO instead.
 * ----------
 */
PgStat_StatDBEntry *
pgstat_fetch_stat_dbentry(Oid dbid)
{
1195
	PgStat_StatDBEntry *dbentry;
1196 1197 1198

	/*
	 * If not done for this transaction, read the statistics collector
1199 1200
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1201
	 */
1202
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1203
	{
1204
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1205
							  &pgStatBeTable, &pgStatNumBackends);
1206 1207 1208 1209 1210 1211
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup the requested database
	 */
1212 1213
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &dbid,
1214 1215
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233
		return NULL;

	return dbentry;
}


/* ----------
 * pgstat_fetch_stat_tabentry() -
 *
 *	Support function for the SQL-callable pgstat* functions. Returns
 *	the collected statistics for one table or NULL. NULL doesn't mean
 *	that the table doesn't exist, it is just not yet known by the
 *	collector, so the caller is better off to report ZERO instead.
 * ----------
 */
PgStat_StatTabEntry *
pgstat_fetch_stat_tabentry(Oid relid)
{
1234 1235
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
1236 1237 1238

	/*
	 * If not done for this transaction, read the statistics collector
1239 1240
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1241
	 */
1242
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1243
	{
1244
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1245
							  &pgStatBeTable, &pgStatNumBackends);
1246 1247 1248 1249 1250 1251
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our database.
	 */
1252 1253
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
1254 1255
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1256 1257 1258 1259 1260 1261 1262
		return NULL;

	/*
	 * Now inside the DB's table hash table lookup the requested one.
	 */
	if (dbentry->tables == NULL)
		return NULL;
1263 1264
	tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
												   (void *) &relid,
1265 1266
												   HASH_FIND, NULL);
	if (tabentry == NULL)
1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284
		return NULL;

	return tabentry;
}


/* ----------
 * pgstat_fetch_stat_beentry() -
 *
 *	Support function for the SQL-callable pgstat* functions. Returns
 *	the actual activity slot of one active backend. The caller is
 *	responsible for a check if the actual user is permitted to see
 *	that info (especially the querystring).
 * ----------
 */
PgStat_StatBeEntry *
pgstat_fetch_stat_beentry(int beid)
{
1285
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1286
	{
1287
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1288
							  &pgStatBeTable, &pgStatNumBackends);
1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	if (beid < 1 || beid > pgStatNumBackends)
		return NULL;

	return &pgStatBeTable[beid - 1];
}


/* ----------
 * pgstat_fetch_stat_numbackends() -
 *
 *	Support function for the SQL-callable pgstat* functions. Returns
 *	the maximum current backend id.
 * ----------
 */
int
pgstat_fetch_stat_numbackends(void)
{
1309
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1310
	{
1311
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1312
							  &pgStatBeTable, &pgStatNumBackends);
1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	return pgStatNumBackends;
}



/* ------------------------------------------------------------
 * Local support functions follow
 * ------------------------------------------------------------
 */


/* ----------
 * pgstat_setheader() -
 *
 *		Set common header fields in a statistics message
 * ----------
 */
static void
pgstat_setheader(PgStat_MsgHdr *hdr, int mtype)
{
1336 1337 1338 1339 1340
	hdr->m_type = mtype;
	hdr->m_backendid = MyBackendId;
	hdr->m_procpid = MyProcPid;
	hdr->m_databaseid = MyDatabaseId;
	hdr->m_userid = GetSessionUserId();
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355
}


/* ----------
 * pgstat_send() -
 *
 *		Send out one statistics message to the collector
 * ----------
 */
static void
pgstat_send(void *msg, int len)
{
	if (pgStatSock < 0)
		return;

1356
	((PgStat_MsgHdr *) msg)->m_size = len;
1357

1358 1359
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1360 1361 1362
}


1363 1364 1365 1366 1367 1368 1369 1370
/* ----------
 * PgstatBufferMain() -
 *
 *	Start up the statistics buffer process.  This is the body of the
 *	postmaster child process.
 *
 *	The argc/argv parameters are valid only in EXEC_BACKEND case.
 * ----------
1371
 */
1372 1373
NON_EXEC_STATIC void
PgstatBufferMain(int argc, char *argv[])
1374
{
1375
	IsUnderPostmaster = true;	/* we are a postmaster subprocess now */
1376

1377 1378 1379 1380
	MyProcPid = getpid();		/* reset MyProcPid */

	/* Lose the postmaster's on-exit routines */
	on_exit_reset();
1381 1382

	/*
1383 1384
	 * Ignore all signals usually bound to some action in the postmaster,
	 * except for SIGCHLD --- see pgstat_recvbuffer.
1385
	 */
1386 1387 1388 1389 1390 1391 1392 1393
	pqsignal(SIGHUP, SIG_IGN);
	pqsignal(SIGINT, SIG_IGN);
	pqsignal(SIGTERM, SIG_IGN);
	pqsignal(SIGQUIT, SIG_IGN);
	pqsignal(SIGALRM, SIG_IGN);
	pqsignal(SIGPIPE, SIG_IGN);
	pqsignal(SIGUSR1, SIG_IGN);
	pqsignal(SIGUSR2, SIG_IGN);
1394
	pqsignal(SIGCHLD, pgstat_die);
1395 1396 1397 1398
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
1399
	/* unblock will happen in pgstat_recvbuffer */
1400 1401 1402 1403 1404

#ifdef EXEC_BACKEND
	pgstat_parseArgs(argc,argv);
#endif

1405
	/*
1406 1407
	 * Start a buffering process to read from the socket, so we have a
	 * little more time to process incoming messages.
1408 1409
	 *
	 * NOTE: the process structure is: postmaster is parent of buffer process
1410
	 * is parent of collector process.	This way, the buffer can detect
1411
	 * collector failure via SIGCHLD, whereas otherwise it wouldn't notice
1412 1413 1414 1415
	 * collector failure until it tried to write on the pipe.  That would
	 * mean that after the postmaster started a new collector, we'd have
	 * two buffer processes competing to read from the UDP socket --- not
	 * good.
1416
	 */
1417
	if (pgpipe(pgStatPipe) < 0)
1418
	{
1419 1420
		ereport(LOG,
				(errcode_for_socket_access(),
B
Bruce Momjian 已提交
1421
			 errmsg("could not create pipe for statistics buffer: %m")));
1422 1423 1424
		exit(1);
	}

1425 1426 1427 1428
#ifdef EXEC_BACKEND
	/* child becomes collector process */
	switch (pgstat_forkexec(STAT_PROC_COLLECTOR))
#else
1429
	switch (fork())
1430
#endif
1431
	{
1432
		case -1:
1433 1434
			ereport(LOG,
					(errmsg("could not fork statistics collector: %m")));
1435
			exit(1);
1436

1437
#ifndef EXEC_BACKEND
1438
		case 0:
1439
			/* child becomes collector process */
1440
			PgstatCollectorMain(0, NULL);
1441
			break;
1442
#endif
1443 1444 1445

		default:
			/* parent becomes buffer process */
1446
			closesocket(pgStatPipe[0]);
1447
			pgstat_recvbuffer();
1448
	}
1449
	exit(0);
1450 1451 1452
}


1453 1454 1455 1456 1457 1458 1459 1460 1461
/* ----------
 * PgstatCollectorMain() -
 *
 *	Start up the statistics collector itself.  This is the body of the
 *	postmaster grandchild process.
 *
 *	The argc/argv parameters are valid only in EXEC_BACKEND case.
 * ----------
 */
1462
NON_EXEC_STATIC void
1463
PgstatCollectorMain(int argc, char *argv[])
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474
{
	PgStat_Msg	msg;
	fd_set		rfds;
	int			readPipe;
	int			nready;
	int			len = 0;
	struct timeval timeout;
	struct timeval next_statwrite;
	bool		need_statwrite;
	HASHCTL		hash_ctl;

1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497
	MyProcPid = getpid();		/* reset MyProcPid */

	/*
	 * Reset signal handling.  With the exception of restoring default
	 * SIGCHLD handling, this is a no-op in the non-EXEC_BACKEND case
	 * because we'll have inherited these settings from the buffer process;
	 * but it's not a no-op for EXEC_BACKEND.
	 */
	pqsignal(SIGHUP, SIG_IGN);
	pqsignal(SIGINT, SIG_IGN);
	pqsignal(SIGTERM, SIG_IGN);
	pqsignal(SIGQUIT, SIG_IGN);
	pqsignal(SIGALRM, SIG_IGN);
	pqsignal(SIGPIPE, SIG_IGN);
	pqsignal(SIGUSR1, SIG_IGN);
	pqsignal(SIGUSR2, SIG_IGN);
	pqsignal(SIGCHLD, SIG_DFL);
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

1498 1499 1500 1501
#ifdef EXEC_BACKEND
	pgstat_parseArgs(argc,argv);
#endif

1502
	/* Close unwanted files */
1503 1504
	closesocket(pgStatPipe[1]);
	closesocket(pgStatSock);
1505

1506 1507 1508
	/*
	 * Identify myself via ps
	 */
1509
	init_ps_display("stats collector process", "", "");
1510 1511
	set_ps_display("");

1512 1513 1514 1515 1516 1517 1518 1519
	/*
	 * Initialize filenames needed for status reports.
	 */
	snprintf(pgStat_fname, MAXPGPATH, PGSTAT_STAT_FILENAME, DataDir);
	/* tmpfname need only be set correctly in this process */
	snprintf(pgStat_tmpfname, MAXPGPATH, PGSTAT_STAT_TMPFILE,
			 DataDir, getpid());

1520 1521 1522 1523 1524 1525
	/*
	 * Arrange to write the initial status file right away
	 */
	gettimeofday(&next_statwrite, NULL);
	need_statwrite = TRUE;

1526
	/*
1527 1528
	 * Read in an existing statistics stats file or initialize the stats
	 * to zero.
1529 1530 1531 1532 1533 1534 1535 1536
	 */
	pgStatRunningInCollector = TRUE;
	pgstat_read_statsfile(&pgStatDBHash, InvalidOid, NULL, NULL);

	/*
	 * Create the dead backend hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
1537
	hash_ctl.keysize = sizeof(int);
1538
	hash_ctl.entrysize = sizeof(PgStat_StatBeDead);
1539
	hash_ctl.hash = tag_hash;
1540 1541
	pgStatBeDead = hash_create("Dead Backends", PGSTAT_BE_HASH_SIZE,
							   &hash_ctl, HASH_ELEM | HASH_FUNCTION);
1542 1543
	if (pgStatBeDead == NULL)
	{
1544 1545 1546
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
1547
				 errmsg("out of memory in statistics collector --- abort")));
1548 1549 1550 1551 1552 1553
		exit(1);
	}

	/*
	 * Create the known backends table
	 */
1554 1555
	pgStatBeTable = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * MaxBackends);
1556 1557
	if (pgStatBeTable == NULL)
	{
1558
		ereport(LOG,
1559 1560
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1561 1562 1563 1564
		exit(1);
	}
	memset(pgStatBeTable, 0, sizeof(PgStat_StatBeEntry) * MaxBackends);

1565 1566
	readPipe = pgStatPipe[0];

1567
	/*
1568 1569
	 * Process incoming messages and handle all the reporting stuff until
	 * there are no more messages.
1570 1571 1572 1573
	 */
	for (;;)
	{
		/*
1574 1575 1576
		 * If we need to write the status file again (there have been
		 * changes in the statistics since we wrote it last) calculate the
		 * timeout until we have to do so.
1577 1578 1579
		 */
		if (need_statwrite)
		{
1580 1581 1582 1583 1584 1585 1586
			struct timeval now;

			gettimeofday(&now, NULL);
			/* avoid assuming that tv_sec is signed */
			if (now.tv_sec > next_statwrite.tv_sec ||
				(now.tv_sec == next_statwrite.tv_sec &&
				 now.tv_usec >= next_statwrite.tv_usec))
1587
			{
1588
				timeout.tv_sec = 0;
1589 1590
				timeout.tv_usec = 0;
			}
1591 1592 1593 1594 1595 1596 1597 1598 1599 1600
			else
			{
				timeout.tv_sec = next_statwrite.tv_sec - now.tv_sec;
				timeout.tv_usec = next_statwrite.tv_usec - now.tv_usec;
				if (timeout.tv_usec < 0)
				{
					timeout.tv_sec--;
					timeout.tv_usec += 1000000;
				}
			}
1601 1602 1603 1604 1605 1606
		}

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1607
		FD_SET(readPipe, &rfds);
1608 1609 1610 1611

		/*
		 * Now wait for something to do.
		 */
1612
		nready = select(readPipe+1, &rfds, NULL, NULL,
1613 1614 1615
						(need_statwrite) ? &timeout : NULL);
		if (nready < 0)
		{
1616 1617
			if (errno == EINTR)
				continue;
1618 1619
			ereport(LOG,
					(errcode_for_socket_access(),
1620
				   errmsg("select() failed in statistics collector: %m")));
1621 1622 1623 1624
			exit(1);
		}

		/*
1625 1626
		 * If there are no descriptors ready, our timeout for writing the
		 * stats file happened.
1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638
		 */
		if (nready == 0)
		{
			pgstat_write_statsfile();
			need_statwrite = FALSE;

			continue;
		}

		/*
		 * Check if there is a new statistics message to collect.
		 */
1639
		if (FD_ISSET(readPipe, &rfds))
1640 1641
		{
			/*
1642 1643 1644 1645 1646
			 * We may need to issue multiple read calls in case the buffer
			 * process didn't write the message in a single write, which
			 * is possible since it dumps its buffer bytewise. In any
			 * case, we'd need two reads since we don't know the message
			 * length initially.
1647
			 */
1648 1649
			int			nread = 0;
			int			targetlen = sizeof(PgStat_MsgHdr);		/* initial */
1650
			bool		pipeEOF = false;
1651

1652
			while (nread < targetlen)
1653
			{
1654 1655
				len = piperead(readPipe, ((char *) &msg) + nread,
								targetlen - nread);
1656 1657
				if (len < 0)
				{
1658 1659
					if (errno == EINTR)
						continue;
1660 1661
					ereport(LOG,
							(errcode_for_socket_access(),
1662
							 errmsg("could not read from statistics collector pipe: %m")));
1663 1664
					exit(1);
				}
1665
				if (len == 0)	/* EOF on the pipe! */
1666 1667
				{
					pipeEOF = true;
1668
					break;
1669
				}
1670 1671
				nread += len;
				if (nread == sizeof(PgStat_MsgHdr))
1672
				{
1673 1674 1675 1676 1677 1678
					/* we have the header, compute actual msg length */
					targetlen = msg.msg_hdr.m_size;
					if (targetlen < (int) sizeof(PgStat_MsgHdr) ||
						targetlen > (int) sizeof(msg))
					{
						/*
1679 1680 1681
						 * Bogus message length implies that we got out of
						 * sync with the buffer process somehow. Abort so
						 * that we can restart both processes.
1682
						 */
1683
						ereport(LOG,
B
Bruce Momjian 已提交
1684
						  (errmsg("invalid statistics message length")));
1685 1686
						exit(1);
					}
1687 1688
				}
			}
1689

1690 1691 1692 1693
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
1694
			if (pipeEOF)
1695
				break;
1696 1697

			/*
1698 1699
			 * Distribute the message to the specific function handling
			 * it.
1700 1701 1702 1703 1704 1705 1706
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1707
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1708 1709 1710
					break;

				case PGSTAT_MTYPE_BETERM:
1711
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1712 1713 1714
					break;

				case PGSTAT_MTYPE_TABSTAT:
1715
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1716 1717 1718
					break;

				case PGSTAT_MTYPE_TABPURGE:
1719
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1720 1721 1722
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1723
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1724 1725 1726
					break;

				case PGSTAT_MTYPE_DROPDB:
1727
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1728 1729 1730
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1731
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1732
											 nread);
1733 1734 1735 1736 1737 1738 1739
					break;

				default:
					break;
			}

			/*
1740
			 * Globally count messages.
1741 1742
			 */
			pgStatNumMessages++;
1743 1744

			/*
1745 1746
			 * If this is the first message after we wrote the stats file
			 * the last time, setup the timeout that it'd be written.
1747 1748 1749 1750 1751
			 */
			if (!need_statwrite)
			{
				gettimeofday(&next_statwrite, NULL);
				next_statwrite.tv_usec += ((PGSTAT_STAT_INTERVAL) * 1000);
1752
				next_statwrite.tv_sec += (next_statwrite.tv_usec / 1000000);
1753 1754 1755
				next_statwrite.tv_usec %= 1000000;
				need_statwrite = TRUE;
			}
1756 1757 1758
		}

		/*
1759
		 * Note that we do NOT check for postmaster exit inside the loop;
1760 1761 1762
		 * only EOF on the buffer pipe causes us to fall out.  This
		 * ensures we don't exit prematurely if there are still a few
		 * messages in the buffer or pipe at postmaster shutdown.
1763 1764
		 */
	}
1765 1766

	/*
1767 1768 1769 1770 1771
	 * Okay, we saw EOF on the buffer pipe, so there are no more messages
	 * to process.	If the buffer process quit because of postmaster
	 * shutdown, we want to save the final stats to reuse at next startup.
	 * But if the buffer process failed, it seems best not to (there may
	 * even now be a new collector firing up, and we don't want it to read
1772
	 * a partially-rewritten stats file).
1773
	 */
1774
	if (!PostmasterIsAlive(false))
1775
		pgstat_write_statsfile();
1776 1777 1778 1779 1780 1781
}


/* ----------
 * pgstat_recvbuffer() -
 *
1782
 *	This is the body of the separate buffering process. Its only
1783
 *	purpose is to receive messages from the UDP socket as fast as
1784 1785
 *	possible and forward them over a pipe into the collector itself.
 *	If the collector is slow to absorb messages, they are buffered here.
1786 1787 1788
 * ----------
 */
static void
1789
pgstat_recvbuffer(void)
1790
{
1791 1792
	fd_set		rfds;
	fd_set		wfds;
1793
	struct timeval timeout;
1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805
	int			writePipe = pgStatPipe[1];
	int			maxfd;
	int			nready;
	int			len;
	int			xfr;
	int			frm;
	PgStat_Msg	input_buffer;
	char	   *msgbuffer;
	int			msg_send = 0;	/* next send index in buffer */
	int			msg_recv = 0;	/* next receive index */
	int			msg_have = 0;	/* number of bytes stored */
	bool		overflow = false;
1806

1807 1808 1809
	/*
	 * Identify myself via ps
	 */
1810
	init_ps_display("stats buffer process", "", "");
1811 1812
	set_ps_display("");

1813
	/*
1814 1815 1816 1817 1818
	 * We want to die if our child collector process does.	There are two
	 * ways we might notice that it has died: receive SIGCHLD, or get a
	 * write failure on the pipe leading to the child.	We can set SIGPIPE
	 * to kill us here.  Our SIGCHLD handler was already set up before we
	 * forked (must do it that way, else it's a race condition).
1819 1820 1821 1822 1823 1824 1825 1826
	 */
	pqsignal(SIGPIPE, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

	/*
	 * Set the write pipe to nonblock mode, so that we cannot block when
	 * the collector falls behind.
	 */
1827
	if (!set_noblock(writePipe))
1828
	{
1829 1830
		ereport(LOG,
				(errcode_for_socket_access(),
1831
		  errmsg("could not set statistics collector pipe to nonblocking mode: %m")));
1832 1833 1834
		exit(1);
	}

1835 1836 1837
	/*
	 * Allocate the message buffer
	 */
1838
	msgbuffer = (char *) malloc(PGSTAT_RECVBUFFERSZ);
1839 1840
	if (msgbuffer == NULL)
	{
1841 1842
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
1843
			 errmsg("out of memory in statistics collector --- abort")));
1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856
		exit(1);
	}

	/*
	 * Loop forever
	 */
	for (;;)
	{
		FD_ZERO(&rfds);
		FD_ZERO(&wfds);
		maxfd = -1;

		/*
1857 1858
		 * As long as we have buffer space we add the socket to the read
		 * descriptor set.
1859
		 */
1860
		if (msg_have <= (int) (PGSTAT_RECVBUFFERSZ - sizeof(PgStat_Msg)))
1861 1862 1863
		{
			FD_SET(pgStatSock, &rfds);
			maxfd = pgStatSock;
1864
			overflow = false;
1865 1866 1867
		}
		else
		{
1868
			if (!overflow)
1869
			{
1870 1871
				ereport(LOG,
						(errmsg("statistics buffer is full")));
1872
				overflow = true;
1873 1874 1875 1876
			}
		}

		/*
1877
		 * If we have messages to write out, we add the pipe to the write
1878
		 * descriptor set.
1879 1880 1881
		 */
		if (msg_have > 0)
		{
1882 1883 1884
			FD_SET(writePipe, &wfds);
			if (writePipe > maxfd)
				maxfd = writePipe;
1885 1886 1887
		}

		/*
1888 1889 1890
		 * Wait for some work to do; but not for more than 10 seconds
		 * (this determines how quickly we will shut down after postmaster
		 * termination).
1891
		 */
1892 1893 1894 1895
		timeout.tv_sec = 10;
		timeout.tv_usec = 0;

		nready = select(maxfd + 1, &rfds, &wfds, NULL, &timeout);
1896 1897
		if (nready < 0)
		{
1898 1899
			if (errno == EINTR)
				continue;
1900 1901
			ereport(LOG,
					(errcode_for_socket_access(),
1902
					 errmsg("select() failed in statistics buffer: %m")));
1903 1904 1905 1906 1907 1908 1909 1910 1911
			exit(1);
		}

		/*
		 * If there is a message on the socket, read it and check for
		 * validity.
		 */
		if (FD_ISSET(pgStatSock, &rfds))
		{
1912 1913
			len = recv(pgStatSock, (char *) &input_buffer,
					   sizeof(PgStat_Msg), 0);
1914 1915
			if (len < 0)
			{
1916 1917
				ereport(LOG,
						(errcode_for_socket_access(),
1918
					   errmsg("could not read statistics message: %m")));
1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930
				exit(1);
			}

			/*
			 * We ignore messages that are smaller than our common header
			 */
			if (len < sizeof(PgStat_MsgHdr))
				continue;

			/*
			 * The received length must match the length in the header
			 */
1931
			if (input_buffer.msg_hdr.m_size != len)
1932 1933 1934
				continue;

			/*
1935 1936
			 * O.K. - we accept this message.  Copy it to the circular
			 * msgbuffer.
1937
			 */
1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954
			frm = 0;
			while (len > 0)
			{
				xfr = PGSTAT_RECVBUFFERSZ - msg_recv;
				if (xfr > len)
					xfr = len;
				Assert(xfr > 0);
				memcpy(msgbuffer + msg_recv,
					   ((char *) &input_buffer) + frm,
					   xfr);
				msg_recv += xfr;
				if (msg_recv == PGSTAT_RECVBUFFERSZ)
					msg_recv = 0;
				msg_have += xfr;
				frm += xfr;
				len -= xfr;
			}
1955 1956 1957
		}

		/*
1958 1959 1960 1961
		 * If the collector is ready to receive, write some data into his
		 * pipe.  We may or may not be able to write all that we have.
		 *
		 * NOTE: if what we have is less than PIPE_BUF bytes but more than
1962 1963 1964 1965 1966 1967 1968
		 * the space available in the pipe buffer, most kernels will
		 * refuse to write any of it, and will return EAGAIN.  This means
		 * we will busy-loop until the situation changes (either because
		 * the collector caught up, or because more data arrives so that
		 * we have more than PIPE_BUF bytes buffered).	This is not good,
		 * but is there any way around it?	We have no way to tell when
		 * the collector has caught up...
1969
		 */
1970
		if (FD_ISSET(writePipe, &wfds))
1971
		{
1972 1973 1974 1975
			xfr = PGSTAT_RECVBUFFERSZ - msg_send;
			if (xfr > msg_have)
				xfr = msg_have;
			Assert(xfr > 0);
1976
			len = pipewrite(writePipe, msgbuffer + msg_send, xfr);
1977 1978
			if (len < 0)
			{
1979 1980
				if (errno == EINTR || errno == EAGAIN)
					continue;	/* not enough space in pipe */
1981 1982
				ereport(LOG,
						(errcode_for_socket_access(),
1983
						 errmsg("could not write to statistics collector pipe: %m")));
1984 1985
				exit(1);
			}
1986 1987
			/* NB: len < xfr is okay */
			msg_send += len;
1988 1989
			if (msg_send == PGSTAT_RECVBUFFERSZ)
				msg_send = 0;
1990
			msg_have -= len;
1991 1992 1993 1994 1995 1996
		}

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1997
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1998 1999 2000
			continue;

		/*
2001
		 * If the postmaster has terminated, we've done our job.
2002
		 */
2003
		if (!PostmasterIsAlive(true))
2004 2005 2006 2007
			exit(0);
	}
}

2008 2009 2010 2011 2012 2013
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

2014 2015 2016 2017

/* ----------
 * pgstat_add_backend() -
 *
2018
 *	Support function to keep our backend list up to date.
2019 2020 2021 2022 2023
 * ----------
 */
static int
pgstat_add_backend(PgStat_MsgHdr *msg)
{
2024 2025 2026 2027
	PgStat_StatDBEntry *dbentry;
	PgStat_StatBeEntry *beentry;
	PgStat_StatBeDead *deadbe;
	bool		found;
2028 2029 2030 2031 2032 2033

	/*
	 * Check that the backend ID is valid
	 */
	if (msg->m_backendid < 1 || msg->m_backendid > MaxBackends)
	{
2034
		ereport(LOG,
2035
				(errmsg("invalid server process ID %d", msg->m_backendid)));
2036 2037 2038 2039 2040 2041 2042 2043 2044 2045
		return -1;
	}

	/*
	 * Get the slot for this backendid.
	 */
	beentry = &pgStatBeTable[msg->m_backendid - 1];
	if (beentry->databaseid != InvalidOid)
	{
		/*
2046 2047
		 * If the slot contains the PID of this backend, everything is
		 * fine and we got nothing to do.
2048 2049 2050 2051 2052 2053
		 */
		if (beentry->procpid == msg->m_procpid)
			return 0;
	}

	/*
2054 2055 2056 2057 2058
	 * Lookup if this backend is known to be dead. This can be caused due
	 * to messages arriving in the wrong order - i.e. Postmaster's BETERM
	 * message might have arrived before we received all the backends
	 * stats messages, or even a new backend with the same backendid was
	 * faster in sending his BESTART.
2059 2060 2061
	 *
	 * If the backend is known to be dead, we ignore this add.
	 */
2062 2063
	deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
											   (void *) &(msg->m_procpid),
2064 2065
											   HASH_FIND, NULL);
	if (deadbe)
2066 2067 2068
		return 1;

	/*
2069 2070
	 * Backend isn't known to be dead. If it's slot is currently used, we
	 * have to kick out the old backend.
2071 2072 2073 2074 2075 2076 2077 2078
	 */
	if (beentry->databaseid != InvalidOid)
		pgstat_sub_backend(beentry->procpid);

	/*
	 * Put this new backend into the slot.
	 */
	beentry->databaseid = msg->m_databaseid;
2079 2080
	beentry->procpid = msg->m_procpid;
	beentry->userid = msg->m_userid;
2081 2082
	beentry->activity_start_sec = 0;
	beentry->activity_start_usec = 0;
2083
	MemSet(beentry->activity, 0, PGSTAT_ACTIVITY_SIZE);
2084 2085 2086 2087

	/*
	 * Lookup or create the database entry for this backends DB.
	 */
2088
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2089
										   (void *) &(msg->m_databaseid),
2090
												 HASH_ENTER, &found);
2091
	if (dbentry == NULL)
2092
	{
2093 2094
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
2095
			 errmsg("out of memory in statistics collector --- abort")));
2096 2097 2098 2099 2100 2101 2102 2103
		exit(1);
	}

	/*
	 * If not found, initialize the new one.
	 */
	if (!found)
	{
2104
		HASHCTL		hash_ctl;
2105

2106 2107 2108 2109 2110 2111 2112
		dbentry->tables = NULL;
		dbentry->n_xact_commit = 0;
		dbentry->n_xact_rollback = 0;
		dbentry->n_blocks_fetched = 0;
		dbentry->n_blocks_hit = 0;
		dbentry->n_connects = 0;
		dbentry->destroy = 0;
2113 2114

		memset(&hash_ctl, 0, sizeof(hash_ctl));
2115
		hash_ctl.keysize = sizeof(Oid);
2116
		hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2117
		hash_ctl.hash = tag_hash;
2118 2119 2120 2121
		dbentry->tables = hash_create("Per-database table",
									  PGSTAT_TAB_HASH_SIZE,
									  &hash_ctl,
									  HASH_ELEM | HASH_FUNCTION);
2122 2123
		if (dbentry->tables == NULL)
		{
2124 2125 2126
			/* assume the problem is out-of-memory */
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
2127
			 errmsg("out of memory in statistics collector --- abort")));
2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149
			exit(1);
		}
	}

	/*
	 * Count number of connects to the database
	 */
	dbentry->n_connects++;

	return 0;
}


/* ----------
 * pgstat_sub_backend() -
 *
 *	Remove a backend from the actual backends list.
 * ----------
 */
static void
pgstat_sub_backend(int procpid)
{
2150 2151 2152
	int			i;
	PgStat_StatBeDead *deadbe;
	bool		found;
2153 2154

	/*
2155 2156
	 * Search in the known-backends table for the slot containing this
	 * PID.
2157 2158 2159 2160 2161 2162 2163 2164
	 */
	for (i = 0; i < MaxBackends; i++)
	{
		if (pgStatBeTable[i].databaseid != InvalidOid &&
			pgStatBeTable[i].procpid == procpid)
		{
			/*
			 * That's him. Add an entry to the known to be dead backends.
2165 2166 2167 2168 2169 2170 2171
			 * Due to possible misorder in the arrival of UDP packets it's
			 * possible that even if we know the backend is dead, there
			 * could still be messages queued that arrive later. Those
			 * messages must not cause our number of backends statistics
			 * to get screwed up, so we remember for a couple of seconds
			 * that this PID is dead and ignore them (only the counting of
			 * backends, not the table access stats they sent).
2172
			 */
2173 2174
			deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
													   (void *) &procpid,
2175 2176
													   HASH_ENTER,
													   &found);
2177 2178
			if (deadbe == NULL)
			{
2179 2180 2181
				ereport(LOG,
						(errcode(ERRCODE_OUT_OF_MEMORY),
						 errmsg("out of memory in statistics collector --- abort")));
2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198
				exit(1);
			}
			if (!found)
			{
				deadbe->backendid = i + 1;
				deadbe->destroy = PGSTAT_DESTROY_COUNT;
			}

			/*
			 * Declare the backend slot empty.
			 */
			pgStatBeTable[i].databaseid = InvalidOid;
			return;
		}
	}

	/*
2199 2200
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213
	 */
}


/* ----------
 * pgstat_write_statsfile() -
 *
 *	Tell the news.
 * ----------
 */
static void
pgstat_write_statsfile(void)
{
2214 2215 2216 2217 2218 2219 2220
	HASH_SEQ_STATUS hstat;
	HASH_SEQ_STATUS tstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatBeDead *deadbe;
	FILE	   *fpout;
	int			i;
2221 2222

	/*
2223
	 * Open the statistics temp file to write out the current values.
2224
	 */
P
Peter Eisentraut 已提交
2225
	fpout = fopen(pgStat_tmpfname, PG_BINARY_W);
2226 2227
	if (fpout == NULL)
	{
2228 2229
		ereport(LOG,
				(errcode_for_file_access(),
2230
				 errmsg("could not open temporary statistics file \"%s\": %m",
2231
						pgStat_tmpfname)));
2232 2233 2234 2235 2236 2237 2238
		return;
	}

	/*
	 * Walk through the database table.
	 */
	hash_seq_init(&hstat, pgStatDBHash);
2239
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
2240 2241
	{
		/*
2242 2243
		 * If this database is marked destroyed, count down and do so if
		 * it reaches 0.
2244 2245 2246 2247 2248 2249 2250 2251
		 */
		if (dbentry->destroy > 0)
		{
			if (--(dbentry->destroy) == 0)
			{
				if (dbentry->tables != NULL)
					hash_destroy(dbentry->tables);

2252
				if (hash_search(pgStatDBHash,
2253 2254
								(void *) &(dbentry->databaseid),
								HASH_REMOVE, NULL) == NULL)
2255
				{
2256 2257 2258
					ereport(LOG,
							(errmsg("database hash table corrupted "
									"during cleanup --- abort")));
2259 2260 2261
					exit(1);
				}
			}
2262

2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278
			/*
			 * Don't include statistics for it.
			 */
			continue;
		}

		/*
		 * Write out the DB line including the number of life backends.
		 */
		fputc('D', fpout);
		fwrite(dbentry, sizeof(PgStat_StatDBEntry), 1, fpout);

		/*
		 * Walk through the databases access stats per table.
		 */
		hash_seq_init(&tstat, dbentry->tables);
2279
		while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&tstat)) != NULL)
2280 2281
		{
			/*
2282 2283
			 * If table entry marked for destruction, same as above for
			 * the database entry.
2284 2285 2286 2287 2288
			 */
			if (tabentry->destroy > 0)
			{
				if (--(tabentry->destroy) == 0)
				{
2289
					if (hash_search(dbentry->tables,
2290
									(void *) &(tabentry->tableid),
2291
									HASH_REMOVE, NULL) == NULL)
2292
					{
2293 2294 2295 2296 2297
						ereport(LOG,
								(errmsg("tables hash table for "
										"database %u corrupted during "
										"cleanup --- abort",
										dbentry->databaseid)));
2298 2299 2300 2301 2302 2303 2304
						exit(1);
					}
				}
				continue;
			}

			/*
2305 2306
			 * At least we think this is still a life table. Print it's
			 * access stats.
2307 2308 2309 2310
			 */
			fputc('T', fpout);
			fwrite(tabentry, sizeof(PgStat_StatTabEntry), 1, fpout);
		}
2311

2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334
		/*
		 * Mark the end of this DB
		 */
		fputc('d', fpout);
	}

	/*
	 * Write out the known running backends to the stats file.
	 */
	i = MaxBackends;
	fputc('M', fpout);
	fwrite(&i, sizeof(i), 1, fpout);

	for (i = 0; i < MaxBackends; i++)
	{
		if (pgStatBeTable[i].databaseid != InvalidOid)
		{
			fputc('B', fpout);
			fwrite(&pgStatBeTable[i], sizeof(PgStat_StatBeEntry), 1, fpout);
		}
	}

	/*
2335
	 * No more output to be done. Close the temp file and replace the old
2336
	 * pgstat.stat with it.
2337 2338 2339 2340
	 */
	fputc('E', fpout);
	if (fclose(fpout) < 0)
	{
2341 2342
		ereport(LOG,
				(errcode_for_file_access(),
2343
				 errmsg("could not close temporary statistics file \"%s\": %m",
2344
						pgStat_tmpfname)));
2345 2346 2347 2348 2349
	}
	else
	{
		if (rename(pgStat_tmpfname, pgStat_fname) < 0)
		{
2350 2351
			ereport(LOG,
					(errcode_for_file_access(),
2352
					 errmsg("could not rename temporary statistics file \"%s\" to \"%s\": %m",
2353
							pgStat_tmpfname, pgStat_fname)));
2354 2355 2356 2357 2358 2359 2360
		}
	}

	/*
	 * Clear out the dead backends table
	 */
	hash_seq_init(&hstat, pgStatBeDead);
2361
	while ((deadbe = (PgStat_StatBeDead *) hash_seq_search(&hstat)) != NULL)
2362 2363
	{
		/*
2364 2365
		 * Count down the destroy delay and remove entries where it
		 * reaches 0.
2366 2367 2368
		 */
		if (--(deadbe->destroy) <= 0)
		{
2369 2370 2371
			if (hash_search(pgStatBeDead,
							(void *) &(deadbe->procpid),
							HASH_REMOVE, NULL) == NULL)
2372
			{
2373
				ereport(LOG,
2374
						(errmsg("dead-server-process hash table corrupted "
2375
								"during cleanup --- abort")));
2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391
				exit(1);
			}
		}
	}
}


/* ----------
 * pgstat_read_statsfile() -
 *
 *	Reads in an existing statistics collector and initializes the
 *	databases hash table (who's entries point to the tables hash tables)
 *	and the current backend table.
 * ----------
 */
static void
2392 2393
pgstat_read_statsfile(HTAB **dbhash, Oid onlydb,
					  PgStat_StatBeEntry **betab, int *numbackends)
2394
{
2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412
	PgStat_StatDBEntry *dbentry;
	PgStat_StatDBEntry dbbuf;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatTabEntry tabbuf;
	HASHCTL		hash_ctl;
	HTAB	   *tabhash = NULL;
	FILE	   *fpin;
	int			maxbackends = 0;
	int			havebackends = 0;
	bool		found;
	MemoryContext use_mcxt;
	int			mcxt_flags;

	/*
	 * If running in the collector we use the DynaHashCxt memory context.
	 * If running in a backend, we use the TopTransactionContext instead,
	 * so the caller must only know the last XactId when this call
	 * happened to know if his tables are still valid or already gone!
2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428
	 */
	if (pgStatRunningInCollector)
	{
		use_mcxt = NULL;
		mcxt_flags = 0;
	}
	else
	{
		use_mcxt = TopTransactionContext;
		mcxt_flags = HASH_CONTEXT;
	}

	/*
	 * Create the DB hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
2429
	hash_ctl.keysize = sizeof(Oid);
2430
	hash_ctl.entrysize = sizeof(PgStat_StatDBEntry);
2431 2432 2433 2434
	hash_ctl.hash = tag_hash;
	hash_ctl.hcxt = use_mcxt;
	*dbhash = hash_create("Databases hash", PGSTAT_DB_HASH_SIZE, &hash_ctl,
						  HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2435
	if (*dbhash == NULL)
2436
	{
2437
		/* assume the problem is out-of-memory */
2438 2439
		if (pgStatRunningInCollector)
		{
2440 2441
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
2442
			 errmsg("out of memory in statistics collector --- abort")));
2443 2444
			exit(1);
		}
2445
		/* in backend, can do normal error */
2446 2447 2448
		ereport(ERROR,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory")));
2449 2450 2451
	}

	/*
2452 2453
	 * Initialize the number of known backends to zero, just in case we do
	 * a silent error return below.
2454 2455 2456 2457 2458 2459
	 */
	if (numbackends != NULL)
		*numbackends = 0;
	if (betab != NULL)
		*betab = NULL;

2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471
	/*
	 * In EXEC_BACKEND case, we won't have inherited pgStat_fname from
	 * postmaster, so compute it first time through.
	 */
#ifdef EXEC_BACKEND
	if (pgStat_fname[0] == '\0')
	{
		Assert(DataDir != NULL);
		snprintf(pgStat_fname, MAXPGPATH, PGSTAT_STAT_FILENAME, DataDir);
	}
#endif

2472 2473
	/*
	 * Try to open the status file. If it doesn't exist, the backends
2474 2475
	 * simply return zero for anything and the collector simply starts
	 * from scratch with empty counters.
2476
	 */
P
Peter Eisentraut 已提交
2477
	if ((fpin = fopen(pgStat_fname, PG_BINARY_R)) == NULL)
2478 2479 2480
		return;

	/*
2481 2482
	 * We found an existing collector stats file. Read it and put all the
	 * hashtable entries into place.
2483 2484 2485 2486 2487
	 */
	for (;;)
	{
		switch (fgetc(fpin))
		{
2488 2489 2490 2491 2492
				/*
				 * 'D'	A PgStat_StatDBEntry struct describing a database
				 * follows. Subsequently, zero to many 'T' entries will
				 * follow until a 'd' is encountered.
				 */
2493 2494 2495
			case 'D':
				if (fread(&dbbuf, 1, sizeof(dbbuf), fpin) != sizeof(dbbuf))
				{
2496 2497 2498 2499
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2500 2501 2502 2503 2504
				}

				/*
				 * Add to the DB hash
				 */
2505
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
2506
											  (void *) &dbbuf.databaseid,
2507 2508
															 HASH_ENTER,
															 &found);
2509 2510 2511 2512
				if (dbentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2513 2514 2515
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2516 2517 2518 2519 2520
						exit(1);
					}
					else
					{
						fclose(fpin);
2521 2522 2523
						ereport(ERROR,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory")));
2524 2525 2526 2527
					}
				}
				if (found)
				{
2528 2529 2530 2531
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2532 2533 2534
				}

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2535 2536 2537
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2538 2539 2540 2541 2542 2543 2544 2545

				/*
				 * Don't collect tables if not the requested DB
				 */
				if (onlydb != InvalidOid && onlydb != dbbuf.databaseid)
					break;

				memset(&hash_ctl, 0, sizeof(hash_ctl));
2546
				hash_ctl.keysize = sizeof(Oid);
2547
				hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2548 2549
				hash_ctl.hash = tag_hash;
				hash_ctl.hcxt = use_mcxt;
2550 2551 2552
				dbentry->tables = hash_create("Per-database table",
											  PGSTAT_TAB_HASH_SIZE,
											  &hash_ctl,
2553
								 HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2554 2555
				if (dbentry->tables == NULL)
				{
2556
					/* assume the problem is out-of-memory */
2557 2558
					if (pgStatRunningInCollector)
					{
2559 2560 2561
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2562 2563
						exit(1);
					}
2564 2565 2566 2567 2568
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2569 2570 2571 2572 2573 2574 2575 2576 2577
				}

				/*
				 * Arrange that following 'T's add entries to this
				 * databases tables hash table.
				 */
				tabhash = dbentry->tables;
				break;

2578 2579 2580
				/*
				 * 'd'	End of this database.
				 */
2581 2582 2583 2584
			case 'd':
				tabhash = NULL;
				break;

2585 2586 2587
				/*
				 * 'T'	A PgStat_StatTabEntry follows.
				 */
2588 2589 2590
			case 'T':
				if (fread(&tabbuf, 1, sizeof(tabbuf), fpin) != sizeof(tabbuf))
				{
2591 2592 2593 2594
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2595 2596 2597 2598 2599 2600 2601 2602
				}

				/*
				 * Skip if table belongs to a not requested database.
				 */
				if (tabhash == NULL)
					break;

2603
				tabentry = (PgStat_StatTabEntry *) hash_search(tabhash,
2604 2605
												(void *) &tabbuf.tableid,
													 HASH_ENTER, &found);
2606 2607 2608 2609
				if (tabentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2610 2611 2612
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2613 2614
						exit(1);
					}
2615 2616 2617 2618 2619
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2620 2621 2622 2623
				}

				if (found)
				{
2624 2625 2626 2627
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2628 2629 2630 2631 2632
				}

				memcpy(tabentry, &tabbuf, sizeof(tabbuf));
				break;

2633 2634 2635
				/*
				 * 'M'	The maximum number of backends to expect follows.
				 */
2636 2637 2638 2639 2640 2641 2642
			case 'M':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (fread(&maxbackends, 1, sizeof(maxbackends), fpin) !=
2643
					sizeof(maxbackends))
2644
				{
2645 2646 2647 2648
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2649 2650 2651 2652 2653 2654 2655 2656
				}
				if (maxbackends == 0)
				{
					fclose(fpin);
					return;
				}

				/*
2657 2658
				 * Allocate space (in TopTransactionContext too) for the
				 * backend table.
2659 2660
				 */
				if (use_mcxt == NULL)
2661 2662
					*betab = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2663
				else
2664 2665 2666
					*betab = (PgStat_StatBeEntry *) MemoryContextAlloc(
																use_mcxt,
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2667 2668
				break;

2669 2670 2671
				/*
				 * 'B'	A PgStat_StatBeEntry follows.
				 */
2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682
			case 'B':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (*betab == NULL)
				{
					fclose(fpin);
					return;
				}
2683

2684 2685 2686
				/*
				 * Read it directly into the table.
				 */
2687 2688 2689
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
2690
				{
2691 2692 2693 2694
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2695 2696 2697 2698 2699
				}

				/*
				 * Count backends per database here.
				 */
2700 2701 2702
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
						   (void *) &((*betab)[havebackends].databaseid),
														HASH_FIND, NULL);
2703
				if (dbentry)
2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715
					dbentry->n_backends++;

				havebackends++;
				if (numbackends != 0)
					*numbackends = havebackends;
				if (havebackends >= maxbackends)
				{
					fclose(fpin);
					return;
				}
				break;

2716 2717 2718
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2719 2720 2721 2722 2723
			case 'E':
				fclose(fpin);
				return;

			default:
2724 2725 2726 2727
				ereport(pgStatRunningInCollector ? LOG : WARNING,
						(errmsg("corrupted pgstat.stat file")));
				fclose(fpin);
				return;
2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769
		}
	}

	fclose(fpin);
}


/* ----------
 * pgstat_recv_bestart() -
 *
 *	Process a backend starup message.
 * ----------
 */
static void
pgstat_recv_bestart(PgStat_MsgBestart *msg, int len)
{
	pgstat_add_backend(&msg->m_hdr);
}


/* ----------
 * pgstat_recv_beterm() -
 *
 *	Process a backend termination message.
 * ----------
 */
static void
pgstat_recv_beterm(PgStat_MsgBeterm *msg, int len)
{
	pgstat_sub_backend(msg->m_hdr.m_procpid);
}


/* ----------
 * pgstat_recv_activity() -
 *
 *	Remember what the backend is doing.
 * ----------
 */
static void
pgstat_recv_activity(PgStat_MsgActivity *msg, int len)
{
2770 2771
	PgStat_StatBeEntry *entry;

2772
	/*
2773 2774 2775
	 * Here we check explicitly for 0 return, since we don't want to
	 * mangle the activity of an active backend by a delayed packed from a
	 * dead one.
2776 2777 2778
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2779

2780 2781 2782 2783 2784 2785
	entry = &(pgStatBeTable[msg->m_hdr.m_backendid - 1]);

	strncpy(entry->activity, msg->m_what, PGSTAT_ACTIVITY_SIZE);

	entry->activity_start_sec =
		GetCurrentAbsoluteTimeUsec(&entry->activity_start_usec);
2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797
}


/* ----------
 * pgstat_recv_tabstat() -
 *
 *	Count what the backend has done.
 * ----------
 */
static void
pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len)
{
2798 2799 2800 2801 2802
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2803 2804 2805 2806 2807 2808 2809 2810 2811 2812

	/*
	 * Make sure the backend is counted for.
	 */
	if (pgstat_add_backend(&msg->m_hdr) < 0)
		return;

	/*
	 * Lookup the database in the hashtable.
	 */
2813
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2814 2815
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2816
	if (!dbentry)
2817 2818 2819
		return;

	/*
2820 2821
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and not worth being counted.
2822 2823 2824 2825
	 */
	if (dbentry->destroy > 0)
		return;

2826 2827
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2828 2829 2830 2831 2832 2833

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2834
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2835 2836
											  (void *) &(tabmsg[i].t_id),
													 HASH_ENTER, &found);
2837 2838
		if (tabentry == NULL)
		{
2839 2840
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
2841
			 errmsg("out of memory in statistics collector --- abort")));
2842 2843 2844 2845 2846 2847
			exit(1);
		}

		if (!found)
		{
			/*
2848 2849
			 * If it's a new table entry, initialize counters to the
			 * values we just got.
2850
			 */
2851 2852 2853 2854 2855 2856 2857 2858
			tabentry->numscans = tabmsg[i].t_numscans;
			tabentry->tuples_returned = tabmsg[i].t_tuples_returned;
			tabentry->tuples_fetched = tabmsg[i].t_tuples_fetched;
			tabentry->tuples_inserted = tabmsg[i].t_tuples_inserted;
			tabentry->tuples_updated = tabmsg[i].t_tuples_updated;
			tabentry->tuples_deleted = tabmsg[i].t_tuples_deleted;
			tabentry->blocks_fetched = tabmsg[i].t_blocks_fetched;
			tabentry->blocks_hit = tabmsg[i].t_blocks_hit;
2859 2860 2861 2862 2863 2864 2865 2866

			tabentry->destroy = 0;
		}
		else
		{
			/*
			 * Otherwise add the values to the existing entry.
			 */
2867 2868 2869 2870 2871 2872 2873 2874
			tabentry->numscans += tabmsg[i].t_numscans;
			tabentry->tuples_returned += tabmsg[i].t_tuples_returned;
			tabentry->tuples_fetched += tabmsg[i].t_tuples_fetched;
			tabentry->tuples_inserted += tabmsg[i].t_tuples_inserted;
			tabentry->tuples_updated += tabmsg[i].t_tuples_updated;
			tabentry->tuples_deleted += tabmsg[i].t_tuples_deleted;
			tabentry->blocks_fetched += tabmsg[i].t_blocks_fetched;
			tabentry->blocks_hit += tabmsg[i].t_blocks_hit;
2875 2876 2877 2878 2879
		}

		/*
		 * And add the block IO to the database entry.
		 */
2880 2881
		dbentry->n_blocks_fetched += tabmsg[i].t_blocks_fetched;
		dbentry->n_blocks_hit += tabmsg[i].t_blocks_hit;
2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894
	}
}


/* ----------
 * pgstat_recv_tabpurge() -
 *
 *	Arrange for dead table removal.
 * ----------
 */
static void
pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len)
{
2895 2896 2897
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
2898 2899 2900 2901 2902 2903 2904 2905 2906 2907

	/*
	 * Make sure the backend is counted for.
	 */
	if (pgstat_add_backend(&msg->m_hdr) < 0)
		return;

	/*
	 * Lookup the database in the hashtable.
	 */
2908
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2909 2910
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2911
	if (!dbentry)
2912 2913 2914
		return;

	/*
2915 2916
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and the tables will go away at DB destruction.
2917 2918 2919 2920 2921 2922 2923 2924 2925
	 */
	if (dbentry->destroy > 0)
		return;

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2926
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2927 2928
										   (void *) &(msg->m_tableid[i]),
													   HASH_FIND, NULL);
2929
		if (tabentry)
2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943
			tabentry->destroy = PGSTAT_DESTROY_COUNT;
	}
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2944
	PgStat_StatDBEntry *dbentry;
2945 2946 2947 2948 2949 2950 2951 2952 2953 2954

	/*
	 * Make sure the backend is counted for.
	 */
	if (pgstat_add_backend(&msg->m_hdr) < 0)
		return;

	/*
	 * Lookup the database in the hashtable.
	 */
2955
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2956 2957
										   (void *) &(msg->m_databaseid),
												 HASH_FIND, NULL);
2958
	if (!dbentry)
2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976
		return;

	/*
	 * Mark the database for destruction.
	 */
	dbentry->destroy = PGSTAT_DESTROY_COUNT;
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_resetcounter(PgStat_MsgResetcounter *msg, int len)
{
2977 2978
	HASHCTL		hash_ctl;
	PgStat_StatDBEntry *dbentry;
2979 2980 2981 2982 2983 2984 2985 2986 2987 2988

	/*
	 * Make sure the backend is counted for.
	 */
	if (pgstat_add_backend(&msg->m_hdr) < 0)
		return;

	/*
	 * Lookup the database in the hashtable.
	 */
2989
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2990 2991
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2992
	if (!dbentry)
2993 2994 2995 2996 2997 2998 2999 3000 3001
		return;

	/*
	 * We simply throw away all the databases table entries by recreating
	 * a new hash table for them.
	 */
	if (dbentry->tables != NULL)
		hash_destroy(dbentry->tables);

3002 3003 3004 3005 3006 3007 3008
	dbentry->tables = NULL;
	dbentry->n_xact_commit = 0;
	dbentry->n_xact_rollback = 0;
	dbentry->n_blocks_fetched = 0;
	dbentry->n_blocks_hit = 0;
	dbentry->n_connects = 0;
	dbentry->destroy = 0;
3009 3010

	memset(&hash_ctl, 0, sizeof(hash_ctl));
3011
	hash_ctl.keysize = sizeof(Oid);
3012
	hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
3013
	hash_ctl.hash = tag_hash;
3014 3015 3016 3017
	dbentry->tables = hash_create("Per-database table",
								  PGSTAT_TAB_HASH_SIZE,
								  &hash_ctl,
								  HASH_ELEM | HASH_FUNCTION);
3018 3019
	if (dbentry->tables == NULL)
	{
3020 3021 3022
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
B
Bruce Momjian 已提交
3023
			 errmsg("out of memory in statistics collector --- abort")));
3024 3025 3026
		exit(1);
	}
}