pgstat.c 64.8 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
/* ----------
 * 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
 *			  entire thing can be enabled/disabled on a per db base.
 *
14
 *	Copyright (c) 2001-2003, PostgreSQL Global Development Group
15
 *
16
 *	$Header: /cvsroot/pgsql/src/backend/postmaster/pgstat.c,v 1.41 2003/07/28 00:09:15 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 32
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <signal.h>

33 34
#include "pgstat.h"

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


/* ----------
54
 * GUC parameters
55 56
 * ----------
 */
57 58 59 60 61
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;
62

63 64 65 66 67 68
/* ----------
 * Other global variables
 * ----------
 */
bool		pgstat_is_running = false;

69 70 71 72
/* ----------
 * Local data
 * ----------
 */
73 74
static int	pgStatSock = -1;
static int	pgStatPipe[2];
B
Bruce Momjian 已提交
75
static struct sockaddr_storage pgStatAddr;
76
static int	pgStatPmPipe[2] = {-1, -1};
77

78
static int	pgStatPid;
79
static time_t last_pgstat_start_time;
80

81
static long pgStatNumMessages = 0;
82

83
static bool pgStatRunningInCollector = FALSE;
84

85 86 87
static int	pgStatTabstatAlloc = 0;
static int	pgStatTabstatUsed = 0;
static PgStat_MsgTabstat **pgStatTabstatMessages = NULL;
88 89
#define TABSTAT_QUANTUM		4	/* we alloc this many at a time */

90 91
static int	pgStatXactCommit = 0;
static int	pgStatXactRollback = 0;
92

93 94 95 96 97
static TransactionId pgStatDBHashXact = InvalidTransactionId;
static HTAB *pgStatDBHash = NULL;
static HTAB *pgStatBeDead = NULL;
static PgStat_StatBeEntry *pgStatBeTable = NULL;
static int	pgStatNumBackends = 0;
98

99 100
static char pgStat_tmpfname[MAXPGPATH];
static char pgStat_fname[MAXPGPATH];
101 102 103 104 105 106


/* ----------
 * Local function forward declarations
 * ----------
 */
107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128
static void pgstat_main(void);
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);
129 130 131 132 133 134 135 136 137 138 139 140


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


/* ----------
 * pgstat_init() -
 *
 *	Called from postmaster at startup. Create the resources required
141 142 143
 *	by the statistics collector process.  If unable to do so, do not
 *	fail --- better to let the postmaster start with stats collection
 *	disabled.
144 145
 * ----------
 */
146
void
147 148
pgstat_init(void)
{
B
Bruce Momjian 已提交
149
	ACCEPT_TYPE_ARG3	alen;
150
	struct	addrinfo	*addrs = NULL, *addr, hints;
B
Bruce Momjian 已提交
151
	int			ret;
152

153 154 155 156
	/*
	 * Force start of collector daemon if something to collect
	 */
	if (pgstat_collect_querystring || pgstat_collect_tuplelevel ||
157
		pgstat_collect_blocklevel)
158 159
		pgstat_collect_startcollector = true;

160 161 162
	/*
	 * Initialize the filenames for the status reports.
	 */
163 164 165 166
	snprintf(pgStat_tmpfname, MAXPGPATH,
			 PGSTAT_STAT_TMPFILE, DataDir, getpid());
	snprintf(pgStat_fname, MAXPGPATH,
			 PGSTAT_STAT_FILENAME, DataDir);
167

168
	/*
169 170
	 * If we don't have to start a collector or should reset the collected
	 * statistics on postmaster start, simply remove the file.
171 172 173 174 175 176 177 178
	 */
	if (!pgstat_collect_startcollector || pgstat_collect_resetonpmstart)
		unlink(pgStat_fname);

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

181
	/*
182
	 * Create the UDP socket for sending and receiving statistic messages
183
	 */
B
Bruce Momjian 已提交
184 185 186 187 188 189 190 191
	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;
192 193
	ret = getaddrinfo_all("localhost", NULL, &hints, &addrs);
	if (ret || !addrs)
B
Bruce Momjian 已提交
194
	{
195
		ereport(LOG,
196
				(errmsg("could not resolve \"localhost\": %s",
197
						gai_strerror(ret))));
B
Bruce Momjian 已提交
198 199 200
		goto startup_failed;
	}
	
201 202 203 204 205 206 207 208 209 210 211 212
	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
		if ((pgStatSock = socket(addr->ai_family, SOCK_DGRAM, 0)) >= 0)
			break;
	}

	if (!addr || pgStatSock < 0)
213
	{
214 215 216
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create socket for statistics: %m")));
217
		goto startup_failed;
218 219 220
	}

	/*
221 222
	 * Bind it to a kernel assigned port on localhost and get the assigned
	 * port via getsockname().
223
	 */
B
Bruce Momjian 已提交
224
	if (bind(pgStatSock, addr->ai_addr, addr->ai_addrlen) < 0)
225
	{
226 227 228
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not bind socket for statistics: %m")));
229
		goto startup_failed;
230
	}
231 232 233

	freeaddrinfo_all(hints.ai_family, addrs);
	addrs = NULL;
B
Bruce Momjian 已提交
234 235 236

	alen = sizeof(pgStatAddr);
	if (getsockname(pgStatSock, (struct sockaddr *)&pgStatAddr, &alen) < 0)
237
	{
238 239 240
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not get address of socket for statistics: %m")));
241
		goto startup_failed;
242 243 244
	}

	/*
245 246 247 248
	 * 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.
249
	 */
250
	if (connect(pgStatSock, (struct sockaddr *) & pgStatAddr, alen) < 0)
251
	{
252 253 254
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not connect socket for statistics: %m")));
255
		goto startup_failed;
256 257 258 259 260 261 262
	}

	/*
	 * 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.
263
	 */
264
	if (FCNTL_NONBLOCK(pgStatSock) < 0)
265
	{
266 267 268
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not set statistics socket to nonblock mode: %m")));
269
		goto startup_failed;
270 271 272 273 274 275 276
	}

	/*
	 * Create the pipe that controls the statistics collector shutdown
	 */
	if (pipe(pgStatPmPipe) < 0)
	{
277 278 279
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create pipe for statistics collector: %m")));
280
		goto startup_failed;
281 282
	}

283
	return;
284 285

startup_failed:
286 287
	if (addrs)
		freeaddrinfo_all(hints.ai_family, addrs);
B
Bruce Momjian 已提交
288

289
	if (pgStatSock >= 0)
290
		closesocket(pgStatSock);
291 292 293
	pgStatSock = -1;

	/* Adjust GUC variables to suppress useless activity */
294
	pgstat_collect_startcollector = false;
295 296 297
	pgstat_collect_querystring = false;
	pgstat_collect_tuplelevel = false;
	pgstat_collect_blocklevel = false;
298 299 300 301 302 303 304
}


/* ----------
 * pgstat_start() -
 *
 *	Called from postmaster at startup or after an existing collector
305
 *	died.  Attempt to fire up a fresh statistics collector.
306
 *
307
 *	Note: if fail, we will be called again from the postmaster main loop.
308 309
 * ----------
 */
310
void
311
pgstat_start(void)
312
{
313 314
	time_t		curtime;

315 316 317
	/*
	 * Do nothing if no collector needed
	 */
318 319
	if (pgstat_is_running || !pgstat_collect_startcollector)
		return;
320

321
	/*
322 323 324 325 326 327 328 329 330 331 332 333 334 335
	 * Do nothing if too soon since last collector start.  This is a
	 * 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.
	 */
	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.
336 337 338
	 */
	if (pgStatSock < 0)
	{
339 340
		ereport(LOG,
				(errmsg("statistics collector startup skipped")));
341 342 343 344 345 346
		/*
		 * 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;
347 348 349
	}

	/*
350
	 * Okay, fork off the collector.  Remember its PID for pgstat_ispgstat.
351
	 */
352 353 354 355 356 357 358 359 360

	fflush(stdout);
	fflush(stderr);

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

361
	switch ((pgStatPid = (int) fork()))
362 363
	{
		case -1:
364 365 366 367
#ifdef __BEOS__
			/* Specific beos actions */
			beos_backend_startup_failed();
#endif
368 369
			ereport(LOG,
					(errmsg("could not fork statistics buffer: %m")));
370
			return;
371 372 373 374 375

		case 0:
			break;

		default:
376 377
			pgstat_is_running = true;
			return;
378 379
	}

380
	/* in postmaster child ... */
381 382 383 384 385 386 387 388

#ifdef __BEOS__
	/* Specific beos actions after backend startup */
	beos_backend_startup();
#endif

	IsUnderPostmaster = true;	/* we are a postmaster subprocess now */

389 390
	MyProcPid = getpid();		/* reset MyProcPid */

391 392 393 394
	/* Lose the postmaster's on-exit routines */
	on_exit_reset();

	/* Close the postmaster's sockets, except for pgstat link */
395 396
	ClosePostmasterPorts(false);

397
	pgstat_main();
398

399 400 401 402 403 404 405 406 407 408 409
	exit(0);
}


/* ----------
 * pgstat_ispgstat() -
 *
 *	Called from postmaster to check if a terminated child process
 *	was the statistics collector.
 * ----------
 */
410
bool
411 412
pgstat_ispgstat(int pid)
{
413 414
	if (!pgstat_is_running)
		return false;
415 416

	if (pgStatPid != pid)
417 418 419 420
		return false;

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

422
	return true;
423 424 425
}


426 427 428 429 430 431 432 433 434 435 436
/* ----------
 * pgstat_close_sockets() -
 *
 *	Called when postmaster forks a non-pgstat child process, to close off
 *	file descriptors that should not be held open in child processes.
 * ----------
 */
void
pgstat_close_sockets(void)
{
	if (pgStatPmPipe[0] >= 0)
437
		closesocket(pgStatPmPipe[0]);
438 439
	pgStatPmPipe[0] = -1;
	if (pgStatPmPipe[1] >= 0)
440
		closesocket(pgStatPmPipe[1]);
441 442 443 444
	pgStatPmPipe[1] = -1;
}


445 446 447 448 449 450 451 452 453
/* ----------
 * pgstat_beterm() -
 *
 *	Called from postmaster to tell collector a backend terminated.
 * ----------
 */
void
pgstat_beterm(int pid)
{
454
	PgStat_MsgBeterm msg;
455

456
	if (pgStatSock < 0)
457 458
		return;

459
	MemSet(&(msg.m_hdr), 0, sizeof(msg.m_hdr));
460 461
	msg.m_hdr.m_type = PGSTAT_MTYPE_BETERM;
	msg.m_hdr.m_procpid = pid;
462 463 464 465 466 467 468

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


/* ------------------------------------------------------------
 * Public functions used by backends follow
469
 *------------------------------------------------------------
470 471 472 473 474 475 476 477 478 479 480 481 482
 */


/* ----------
 * 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)
{
483
	PgStat_MsgBestart msg;
484

485
	if (pgStatSock < 0)
486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501
		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
502
pgstat_report_activity(const char *what)
503
{
504 505
	PgStat_MsgActivity msg;
	int			len;
506

507
	if (!pgstat_collect_querystring || pgStatSock < 0)
508 509 510
		return;

	len = strlen(what);
511 512
	len = pg_mbcliplen((const unsigned char *) what, len,
					   PGSTAT_ACTIVITY_SIZE - 1);
513

514 515
	memcpy(msg.m_what, what, len);
	msg.m_what[len] = '\0';
516
	len += offsetof(PgStat_MsgActivity, m_what) +1;
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532

	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)
{
533 534 535
	int			i;
	int			n;
	int			len;
536

537
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
538
		!pgstat_collect_blocklevel)
539 540
		return;

541 542 543 544
	if (pgStatSock < 0)
		return;

	/*
545 546
	 * For each message buffer used during the last query set the header
	 * fields and send it out.
547 548 549 550
	 */
	for (i = 0; i < pgStatTabstatUsed; i++)
	{
		n = pgStatTabstatMessages[i]->m_nentries;
551 552
		len = offsetof(PgStat_MsgTabstat, m_entry[0]) +
			n * sizeof(PgStat_TableEntry);
553

554
		pgStatTabstatMessages[i]->m_xact_commit = pgStatXactCommit;
555
		pgStatTabstatMessages[i]->m_xact_rollback = pgStatXactRollback;
556
		pgStatXactCommit = 0;
557 558
		pgStatXactRollback = 0;

559 560
		pgstat_setheader(&pgStatTabstatMessages[i]->m_hdr,
						 PGSTAT_MTYPE_TABSTAT);
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
		pgstat_send(pgStatTabstatMessages[i], len);
	}

	pgStatTabstatUsed = 0;
}


/* ----------
 * pgstat_vacuum_tabstat() -
 *
 *	Will tell the collector about objects he can get rid of.
 * ----------
 */
int
pgstat_vacuum_tabstat(void)
{
577 578 579 580 581 582 583 584 585 586 587 588 589 590
	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;
591 592 593 594 595 596 597 598

	if (pgStatSock < 0)
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
599
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
600
	{
601
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
602
							  &pgStatBeTable, &pgStatNumBackends);
603 604 605 606 607 608
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our own database entry
	 */
609 610 611
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
												 HASH_FIND, NULL);
612
	if (dbentry == NULL)
613 614 615 616 617 618 619 620 621 622 623 624 625
		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.
	 */
626
	hash_seq_init(&hstat, dbentry->tables);
627
	while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&hstat)) != NULL)
628 629
	{
		/*
630 631
		 * Check if this relation is still alive by looking up it's
		 * pg_class tuple in the system catalog cache.
632 633
		 */
		reltup = SearchSysCache(RELOID,
634 635
								ObjectIdGetDatum(tabentry->tableid),
								0, 0, 0);
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652
		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)
		{
653
			len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
654
				+msg.m_nentries * sizeof(Oid);
655 656 657 658 659 660 661 662 663 664 665 666 667

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

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
668
		len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
669
			+msg.m_nentries * sizeof(Oid);
670 671 672 673 674 675 676 677 678 679

		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;
680
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
681 682

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
683 684
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
685 686 687 688
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
689 690
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
691
		}
692
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
693 694 695 696 697
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

	/*
698 699
	 * Search the database hash table for dead databases and tell the
	 * collector to drop them as well.
700 701
	 */
	hash_seq_init(&hstat, pgStatDBHash);
702
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
703
	{
704
		Oid			dbid = dbentry->databaseid;
705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724

		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.
	 */
725
	pfree((char *) dbidlist);
726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745

	/*
	 * 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)
{
746
	PgStat_MsgDropdb msg;
747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766

	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)
{
767
	PgStat_MsgResetcounter msg;
768 769 770 771 772

	if (pgStatSock < 0)
		return;

	if (!superuser())
773 774 775
		ereport(ERROR,
				(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
				 errmsg("must be superuser to reset statistics counters")));
776 777 778 779 780 781 782 783 784 785 786 787 788 789 790

	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)
{
791
	PgStat_MsgDummy msg;
792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812

	if (pgStatSock < 0)
		return;

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


/* ----------
 * 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)
{
813
	PgStat_TableEntry *useent;
814 815 816
	Oid			rel_id = rel->rd_id;
	int			mb;
	int			i;
817 818 819 820

	/*
	 * Initialize data not to count at all.
	 */
821 822 823 824
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
825

826
	if (pgStatSock < 0)
827 828 829 830 831 832
	{
		stats->no_stats = TRUE;
		return;
	}

	/*
833
	 * On the first of all calls create some message buffers.
834
	 */
835
	if (pgStatTabstatMessages == NULL)
836
	{
837 838 839 840 841 842
		PgStat_MsgTabstat *newMessages;
		PgStat_MsgTabstat **msgArray;

		newMessages = (PgStat_MsgTabstat *)
			malloc(sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		if (newMessages == NULL)
843
		{
844 845 846
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
847 848
			return;
		}
849 850 851
		msgArray = (PgStat_MsgTabstat **)
			malloc(sizeof(PgStat_MsgTabstat *) * TABSTAT_QUANTUM);
		if (msgArray == NULL)
852
		{
853 854 855 856 857
			free(newMessages);
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
			return;
858
		}
859 860 861 862 863
		MemSet(newMessages, 0, sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		for (i = 0; i < TABSTAT_QUANTUM; i++)
			msgArray[i] = newMessages++;
		pgStatTabstatMessages = msgArray;
		pgStatTabstatAlloc = TABSTAT_QUANTUM;
864 865 866
	}

	/*
867
	 * Search the already-used message slots for this relation.
868 869 870 871 872 873 874
	 */
	for (mb = 0; mb < pgStatTabstatUsed; mb++)
	{
		for (i = 0; i < pgStatTabstatMessages[mb]->m_nentries; i++)
		{
			if (pgStatTabstatMessages[mb]->m_entry[i].t_id == rel_id)
			{
875
				stats->tabentry = (void *) &(pgStatTabstatMessages[mb]->m_entry[i]);
876 877 878 879 880 881
				return;
			}
		}

		if (pgStatTabstatMessages[mb]->m_nentries >= PGSTAT_NUM_TABENTRIES)
			continue;
882

883 884 885 886 887 888
		/*
		 * Not found, but found a message buffer with an empty slot
		 * instead. Fine, let's use this one.
		 */
		i = pgStatTabstatMessages[mb]->m_nentries++;
		useent = &pgStatTabstatMessages[mb]->m_entry[i];
889
		MemSet(useent, 0, sizeof(PgStat_TableEntry));
890
		useent->t_id = rel_id;
891
		stats->tabentry = (void *) useent;
892 893 894 895 896 897 898 899
		return;
	}

	/*
	 * If we ran out of message buffers, we just allocate more.
	 */
	if (pgStatTabstatUsed >= pgStatTabstatAlloc)
	{
900 901 902 903 904 905 906
		int		newAlloc = pgStatTabstatAlloc + TABSTAT_QUANTUM;
		PgStat_MsgTabstat *newMessages;
		PgStat_MsgTabstat **msgArray;

		newMessages = (PgStat_MsgTabstat *)
			malloc(sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		if (newMessages == NULL)
907
		{
908 909 910
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
911 912
			return;
		}
913 914 915 916
		msgArray = (PgStat_MsgTabstat **)
			realloc(pgStatTabstatMessages,
					sizeof(PgStat_MsgTabstat *) * newAlloc);
		if (msgArray == NULL)
917
		{
918 919 920 921 922
			free(newMessages);
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
			return;
923
		}
924 925 926 927 928
		MemSet(newMessages, 0, sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		for (i = 0; i < TABSTAT_QUANTUM; i++)
			msgArray[pgStatTabstatAlloc + i] = newMessages++;
		pgStatTabstatMessages = msgArray;
		pgStatTabstatAlloc = newAlloc;
929 930 931 932 933 934 935 936
	}

	/*
	 * Use the first entry of the next message buffer.
	 */
	mb = pgStatTabstatUsed++;
	pgStatTabstatMessages[mb]->m_nentries = 1;
	useent = &pgStatTabstatMessages[mb]->m_entry[0];
937
	MemSet(useent, 0, sizeof(PgStat_TableEntry));
938
	useent->t_id = rel_id;
939
	stats->tabentry = (void *) useent;
940 941 942 943 944 945 946 947 948 949 950 951
}


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
952
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
953
		!pgstat_collect_blocklevel)
954 955
		return;

956 957 958
	pgStatXactCommit++;

	/*
959 960 961
	 * 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.
962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982
	 */
	if (pgStatTabstatAlloc > 0)
	{
		if (pgStatTabstatUsed == 0)
		{
			pgStatTabstatUsed++;
			pgStatTabstatMessages[0]->m_nentries = 0;
		}
	}
}


/* ----------
 * pgstat_count_xact_rollback() -
 *
 *	Called from access/transam/xact.c to count transaction rollbacks.
 * ----------
 */
void
pgstat_count_xact_rollback(void)
{
983
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
984
		!pgstat_collect_blocklevel)
985 986
		return;

987 988 989
	pgStatXactRollback++;

	/*
990 991 992
	 * 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.
993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016
	 */
	if (pgStatTabstatAlloc > 0)
	{
		if (pgStatTabstatUsed == 0)
		{
			pgStatTabstatUsed++;
			pgStatTabstatMessages[0]->m_nentries = 0;
		}
	}
}


/* ----------
 * 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)
{
1017
	PgStat_StatDBEntry *dbentry;
1018 1019 1020

	/*
	 * If not done for this transaction, read the statistics collector
1021 1022
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1023
	 */
1024
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1025
	{
1026
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1027
							  &pgStatBeTable, &pgStatNumBackends);
1028 1029 1030 1031 1032 1033
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup the requested database
	 */
1034 1035
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &dbid,
1036 1037
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055
		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)
{
1056 1057
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
1058 1059 1060

	/*
	 * If not done for this transaction, read the statistics collector
1061 1062
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1063
	 */
1064
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1065
	{
1066
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1067
							  &pgStatBeTable, &pgStatNumBackends);
1068 1069 1070 1071 1072 1073
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our database.
	 */
1074 1075
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
1076 1077
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1078 1079 1080 1081 1082 1083 1084
		return NULL;

	/*
	 * Now inside the DB's table hash table lookup the requested one.
	 */
	if (dbentry->tables == NULL)
		return NULL;
1085 1086
	tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
												   (void *) &relid,
1087 1088
												   HASH_FIND, NULL);
	if (tabentry == NULL)
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106
		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)
{
1107
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1108
	{
1109
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1110
							  &pgStatBeTable, &pgStatNumBackends);
1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130
		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)
{
1131
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1132
	{
1133
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1134
							  &pgStatBeTable, &pgStatNumBackends);
1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157
		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)
{
1158 1159 1160 1161 1162
	hdr->m_type = mtype;
	hdr->m_backendid = MyBackendId;
	hdr->m_procpid = MyProcPid;
	hdr->m_databaseid = MyDatabaseId;
	hdr->m_userid = GetSessionUserId();
1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177
}


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

1178
	((PgStat_MsgHdr *) msg)->m_size = len;
1179

1180 1181
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1182 1183 1184 1185 1186
}


/* ------------------------------------------------------------
 * Local functions implementing the statistics collector itself follow
1187
 *------------------------------------------------------------
1188 1189 1190 1191 1192 1193
 */


/* ----------
 * pgstat_main() -
 *
1194 1195
 *	Start up the statistics collector itself.  This is the body of the
 *	postmaster child process.
1196 1197 1198
 * ----------
 */
static void
1199
pgstat_main(void)
1200 1201
{
	PgStat_Msg	msg;
1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215
	fd_set		rfds;
	int			readPipe;
	int			pmPipe = pgStatPmPipe[0];
	int			maxfd;
	int			nready;
	int			len = 0;
	struct timeval timeout;
	struct timeval next_statwrite;
	bool		need_statwrite;
	HASHCTL		hash_ctl;

	/*
	 * Close the writing end of the postmaster pipe, so we'll see it
	 * closing when the postmaster terminates and can terminate as well.
1216
	 */
1217
	closesocket(pgStatPmPipe[1]);
1218
	pgStatPmPipe[1] = -1;
1219 1220

	/*
1221 1222
	 * Ignore all signals usually bound to some action in the postmaster,
	 * except for SIGCHLD --- see pgstat_recvbuffer.
1223
	 */
1224 1225 1226 1227 1228 1229 1230 1231
	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);
1232
	pqsignal(SIGCHLD, pgstat_die);
1233 1234 1235 1236
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
1237 1238

	/*
1239 1240
	 * Start a buffering process to read from the socket, so we have a
	 * little more time to process incoming messages.
1241 1242
	 *
	 * NOTE: the process structure is: postmaster is parent of buffer process
1243
	 * is parent of collector process.	This way, the buffer can detect
1244
	 * collector failure via SIGCHLD, whereas otherwise it wouldn't notice
1245 1246 1247 1248
	 * 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.
1249 1250 1251
	 */
	if (pipe(pgStatPipe) < 0)
	{
1252 1253 1254
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create pipe for statistics buffer: %m")));
1255 1256 1257
		exit(1);
	}

1258
	switch (fork())
1259
	{
1260
		case -1:
1261 1262
			ereport(LOG,
					(errmsg("could not fork statistics collector: %m")));
1263
			exit(1);
1264

1265
		case 0:
1266
			/* child becomes collector process */
1267 1268
			closesocket(pgStatPipe[1]);
			closesocket(pgStatSock);
1269
			break;
1270 1271 1272

		default:
			/* parent becomes buffer process */
1273
			closesocket(pgStatPipe[0]);
1274
			pgstat_recvbuffer();
1275
			exit(0);
1276 1277
	}

1278
	/*
1279 1280
	 * In the child we can have default SIGCHLD handling (in case we want
	 * to call system() here...)
1281 1282 1283
	 */
	pqsignal(SIGCHLD, SIG_DFL);

1284 1285
	MyProcPid = getpid();		/* reset MyProcPid */

1286 1287 1288
	/*
	 * Identify myself via ps
	 */
1289
	init_ps_display("stats collector process", "", "");
1290 1291 1292 1293 1294 1295 1296 1297
	set_ps_display("");

	/*
	 * Arrange to write the initial status file right away
	 */
	gettimeofday(&next_statwrite, NULL);
	need_statwrite = TRUE;

1298
	/*
1299 1300
	 * Read in an existing statistics stats file or initialize the stats
	 * to zero.
1301 1302 1303 1304 1305 1306 1307 1308
	 */
	pgStatRunningInCollector = TRUE;
	pgstat_read_statsfile(&pgStatDBHash, InvalidOid, NULL, NULL);

	/*
	 * Create the dead backend hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
1309
	hash_ctl.keysize = sizeof(int);
1310
	hash_ctl.entrysize = sizeof(PgStat_StatBeDead);
1311
	hash_ctl.hash = tag_hash;
1312 1313
	pgStatBeDead = hash_create("Dead Backends", PGSTAT_BE_HASH_SIZE,
							   &hash_ctl, HASH_ELEM | HASH_FUNCTION);
1314 1315
	if (pgStatBeDead == NULL)
	{
1316 1317 1318 1319
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1320 1321 1322 1323 1324 1325
		exit(1);
	}

	/*
	 * Create the known backends table
	 */
1326 1327
	pgStatBeTable = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * MaxBackends);
1328 1329
	if (pgStatBeTable == NULL)
	{
1330 1331
		ereport(LOG,
				(errmsg("allocation of backend table failed")));
1332 1333 1334 1335
		exit(1);
	}
	memset(pgStatBeTable, 0, sizeof(PgStat_StatBeEntry) * MaxBackends);

1336 1337
	readPipe = pgStatPipe[0];

1338
	/*
1339 1340
	 * Process incoming messages and handle all the reporting stuff until
	 * there are no more messages.
1341 1342 1343 1344
	 */
	for (;;)
	{
		/*
1345 1346 1347
		 * 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.
1348 1349 1350
		 */
		if (need_statwrite)
		{
1351 1352 1353 1354 1355 1356 1357
			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))
1358
			{
1359
				timeout.tv_sec = 0;
1360 1361
				timeout.tv_usec = 0;
			}
1362 1363 1364 1365 1366 1367 1368 1369 1370 1371
			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;
				}
			}
1372 1373 1374 1375 1376 1377
		}

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1378 1379
		FD_SET(readPipe, &rfds);
		FD_SET(pmPipe, &rfds);
1380

1381 1382
		if (readPipe > pmPipe)
			maxfd = readPipe;
1383
		else
1384
			maxfd = pmPipe;
1385 1386 1387 1388

		/*
		 * Now wait for something to do.
		 */
1389
		nready = select(maxfd + 1, &rfds, NULL, NULL,
1390 1391 1392
						(need_statwrite) ? &timeout : NULL);
		if (nready < 0)
		{
1393 1394
			if (errno == EINTR)
				continue;
1395 1396 1397
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("select failed in statistics collector: %m")));
1398 1399 1400 1401
			exit(1);
		}

		/*
1402 1403
		 * If there are no descriptors ready, our timeout for writing the
		 * stats file happened.
1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415
		 */
		if (nready == 0)
		{
			pgstat_write_statsfile();
			need_statwrite = FALSE;

			continue;
		}

		/*
		 * Check if there is a new statistics message to collect.
		 */
1416
		if (FD_ISSET(readPipe, &rfds))
1417 1418
		{
			/*
1419 1420 1421 1422 1423
			 * 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.
1424
			 */
1425 1426
			int			nread = 0;
			int			targetlen = sizeof(PgStat_MsgHdr);		/* initial */
1427

1428
			while (nread < targetlen)
1429
			{
1430 1431 1432
				len = read(readPipe,
						   ((char *) &msg) + nread,
						   targetlen - nread);
1433 1434
				if (len < 0)
				{
1435 1436
					if (errno == EINTR)
						continue;
1437 1438 1439
					ereport(LOG,
							(errcode_for_socket_access(),
							 errmsg("could not read from statistics pipe: %m")));
1440 1441
					exit(1);
				}
1442 1443 1444 1445
				if (len == 0)	/* EOF on the pipe! */
					break;
				nread += len;
				if (nread == sizeof(PgStat_MsgHdr))
1446
				{
1447 1448 1449 1450 1451 1452
					/* we have the header, compute actual msg length */
					targetlen = msg.msg_hdr.m_size;
					if (targetlen < (int) sizeof(PgStat_MsgHdr) ||
						targetlen > (int) sizeof(msg))
					{
						/*
1453 1454 1455
						 * Bogus message length implies that we got out of
						 * sync with the buffer process somehow. Abort so
						 * that we can restart both processes.
1456
						 */
1457 1458
						ereport(LOG,
								(errmsg("invalid statistics message length")));
1459 1460
						exit(1);
					}
1461 1462
				}
			}
1463

1464 1465 1466 1467 1468 1469
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
			if (len == 0)
				break;
1470 1471

			/*
1472 1473
			 * Distribute the message to the specific function handling
			 * it.
1474 1475 1476 1477 1478 1479 1480
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1481
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1482 1483 1484
					break;

				case PGSTAT_MTYPE_BETERM:
1485
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1486 1487 1488
					break;

				case PGSTAT_MTYPE_TABSTAT:
1489
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1490 1491 1492
					break;

				case PGSTAT_MTYPE_TABPURGE:
1493
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1494 1495 1496
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1497
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1498 1499 1500
					break;

				case PGSTAT_MTYPE_DROPDB:
1501
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1502 1503 1504
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1505
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1506
											 nread);
1507 1508 1509 1510 1511 1512 1513
					break;

				default:
					break;
			}

			/*
1514
			 * Globally count messages.
1515 1516
			 */
			pgStatNumMessages++;
1517 1518

			/*
1519 1520
			 * If this is the first message after we wrote the stats file
			 * the last time, setup the timeout that it'd be written.
1521 1522 1523 1524 1525
			 */
			if (!need_statwrite)
			{
				gettimeofday(&next_statwrite, NULL);
				next_statwrite.tv_usec += ((PGSTAT_STAT_INTERVAL) * 1000);
1526
				next_statwrite.tv_sec += (next_statwrite.tv_usec / 1000000);
1527 1528 1529
				next_statwrite.tv_usec %= 1000000;
				need_statwrite = TRUE;
			}
1530 1531 1532
		}

		/*
1533
		 * Note that we do NOT check for postmaster exit inside the loop;
1534 1535 1536
		 * 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.
1537 1538
		 */
	}
1539 1540

	/*
1541 1542 1543 1544 1545 1546 1547 1548 1549
	 * 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
	 * a partially- rewritten stats file).	We can tell whether the
	 * postmaster is still alive by checking to see if the postmaster pipe
	 * is still open.  If it is read-ready (ie, EOF), the postmaster must
	 * have quit.
1550 1551 1552
	 */
	if (FD_ISSET(pmPipe, &rfds))
		pgstat_write_statsfile();
1553 1554 1555 1556 1557 1558
}


/* ----------
 * pgstat_recvbuffer() -
 *
1559
 *	This is the body of the separate buffering process. Its only
1560
 *	purpose is to receive messages from the UDP socket as fast as
1561 1562
 *	possible and forward them over a pipe into the collector itself.
 *	If the collector is slow to absorb messages, they are buffered here.
1563 1564 1565
 * ----------
 */
static void
1566
pgstat_recvbuffer(void)
1567
{
1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581
	fd_set		rfds;
	fd_set		wfds;
	int			writePipe = pgStatPipe[1];
	int			pmPipe = pgStatPmPipe[0];
	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 */
B
Bruce Momjian 已提交
1582
	struct sockaddr_storage	fromaddr;
1583 1584
	int			fromlen;
	bool		overflow = false;
1585

1586 1587 1588
	/*
	 * Identify myself via ps
	 */
1589
	init_ps_display("stats buffer process", "", "");
1590 1591
	set_ps_display("");

1592
	/*
1593 1594 1595 1596 1597
	 * 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).
1598 1599 1600 1601 1602 1603 1604 1605
	 */
	pqsignal(SIGPIPE, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

	/*
	 * Set the write pipe to nonblock mode, so that we cannot block when
	 * the collector falls behind.
	 */
1606
	if (FCNTL_NONBLOCK(writePipe) < 0)
1607
	{
1608 1609 1610
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not set statistics pipe to nonblock mode: %m")));
1611 1612 1613
		exit(1);
	}

1614 1615 1616
	/*
	 * Allocate the message buffer
	 */
1617
	msgbuffer = (char *) malloc(PGSTAT_RECVBUFFERSZ);
1618 1619
	if (msgbuffer == NULL)
	{
1620 1621 1622
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635
		exit(1);
	}

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

		/*
1636 1637
		 * As long as we have buffer space we add the socket to the read
		 * descriptor set.
1638
		 */
1639
		if (msg_have <= (int) (PGSTAT_RECVBUFFERSZ - sizeof(PgStat_Msg)))
1640 1641 1642
		{
			FD_SET(pgStatSock, &rfds);
			maxfd = pgStatSock;
1643
			overflow = false;
1644 1645 1646
		}
		else
		{
1647
			if (!overflow)
1648
			{
1649 1650
				ereport(LOG,
						(errmsg("statistics buffer is full")));
1651
				overflow = true;
1652 1653 1654 1655
			}
		}

		/*
1656 1657 1658
		 * If we have messages to write out, we add the pipe to the write
		 * descriptor set. Otherwise, we check if the postmaster might
		 * have terminated.
1659 1660 1661
		 */
		if (msg_have > 0)
		{
1662 1663 1664
			FD_SET(writePipe, &wfds);
			if (writePipe > maxfd)
				maxfd = writePipe;
1665 1666 1667
		}
		else
		{
1668 1669 1670
			FD_SET(pmPipe, &rfds);
			if (pmPipe > maxfd)
				maxfd = pmPipe;
1671 1672 1673 1674 1675 1676 1677 1678
		}

		/*
		 * Wait for some work to do.
		 */
		nready = select(maxfd + 1, &rfds, &wfds, NULL, NULL);
		if (nready < 0)
		{
1679 1680
			if (errno == EINTR)
				continue;
1681 1682 1683
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("select failed in statistics buffer: %m")));
1684 1685 1686 1687 1688 1689 1690 1691 1692 1693
			exit(1);
		}

		/*
		 * If there is a message on the socket, read it and check for
		 * validity.
		 */
		if (FD_ISSET(pgStatSock, &rfds))
		{
			fromlen = sizeof(fromaddr);
B
Bruce Momjian 已提交
1694 1695 1696
			len = recvfrom(pgStatSock, (char *) &input_buffer,
				sizeof(PgStat_Msg), 0,
				(struct sockaddr *) &fromaddr, &fromlen);
1697 1698
			if (len < 0)
			{
1699 1700 1701
				ereport(LOG,
						(errcode_for_socket_access(),
						 errmsg("failed to read statistics message: %m")));
1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713
				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
			 */
1714
			if (input_buffer.msg_hdr.m_size != len)
1715 1716 1717 1718 1719
				continue;

			/*
			 * The source address of the packet must be our own socket.
			 * This ensures that only real hackers or our own backends
1720
			 * tell us something.  (This should be redundant with a
1721 1722
			 * kernel-level check due to having used connect(), but let's
			 * do it anyway.)
1723
			 */
B
Bruce Momjian 已提交
1724
			if (memcmp(&fromaddr, &pgStatAddr, fromlen))
1725
				continue;
1726

1727
			/*
1728 1729
			 * O.K. - we accept this message.  Copy it to the circular
			 * msgbuffer.
1730
			 */
1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747
			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;
			}
1748 1749 1750
		}

		/*
1751 1752 1753 1754
		 * 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
1755 1756 1757 1758 1759 1760 1761
		 * 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...
1762
		 */
1763
		if (FD_ISSET(writePipe, &wfds))
1764
		{
1765 1766 1767 1768 1769
			xfr = PGSTAT_RECVBUFFERSZ - msg_send;
			if (xfr > msg_have)
				xfr = msg_have;
			Assert(xfr > 0);
			len = write(writePipe, msgbuffer + msg_send, xfr);
1770 1771
			if (len < 0)
			{
1772 1773
				if (errno == EINTR || errno == EAGAIN)
					continue;	/* not enough space in pipe */
1774 1775 1776
				ereport(LOG,
						(errcode_for_socket_access(),
						 errmsg("failed to write statistics pipe: %m")));
1777 1778
				exit(1);
			}
1779 1780
			/* NB: len < xfr is okay */
			msg_send += len;
1781 1782
			if (msg_send == PGSTAT_RECVBUFFERSZ)
				msg_send = 0;
1783
			msg_have -= len;
1784 1785 1786 1787 1788 1789
		}

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1790
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1791 1792 1793
			continue;

		/*
1794 1795 1796
		 * If the pipe from the postmaster is ready for reading, the
		 * kernel must have closed it on exit() (the postmaster never
		 * really writes to it). So we've done our job.
1797
		 */
1798
		if (FD_ISSET(pmPipe, &rfds))
1799 1800 1801 1802
			exit(0);
	}
}

1803 1804 1805 1806 1807 1808
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

1809 1810 1811 1812

/* ----------
 * pgstat_add_backend() -
 *
1813
 *	Support function to keep our backend list up to date.
1814 1815 1816 1817 1818
 * ----------
 */
static int
pgstat_add_backend(PgStat_MsgHdr *msg)
{
1819 1820 1821 1822
	PgStat_StatDBEntry *dbentry;
	PgStat_StatBeEntry *beentry;
	PgStat_StatBeDead *deadbe;
	bool		found;
1823 1824 1825 1826 1827 1828

	/*
	 * Check that the backend ID is valid
	 */
	if (msg->m_backendid < 1 || msg->m_backendid > MaxBackends)
	{
1829 1830
		ereport(LOG,
				(errmsg("invalid backend ID %d", msg->m_backendid)));
1831 1832 1833 1834 1835 1836 1837 1838 1839 1840
		return -1;
	}

	/*
	 * Get the slot for this backendid.
	 */
	beentry = &pgStatBeTable[msg->m_backendid - 1];
	if (beentry->databaseid != InvalidOid)
	{
		/*
1841 1842
		 * If the slot contains the PID of this backend, everything is
		 * fine and we got nothing to do.
1843 1844 1845 1846 1847 1848
		 */
		if (beentry->procpid == msg->m_procpid)
			return 0;
	}

	/*
1849 1850 1851 1852 1853
	 * 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.
1854 1855 1856
	 *
	 * If the backend is known to be dead, we ignore this add.
	 */
1857 1858
	deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
											   (void *) &(msg->m_procpid),
1859 1860
											   HASH_FIND, NULL);
	if (deadbe)
1861 1862 1863
		return 1;

	/*
1864 1865
	 * Backend isn't known to be dead. If it's slot is currently used, we
	 * have to kick out the old backend.
1866 1867 1868 1869 1870 1871 1872 1873
	 */
	if (beentry->databaseid != InvalidOid)
		pgstat_sub_backend(beentry->procpid);

	/*
	 * Put this new backend into the slot.
	 */
	beentry->databaseid = msg->m_databaseid;
1874 1875
	beentry->procpid = msg->m_procpid;
	beentry->userid = msg->m_userid;
1876 1877
	beentry->activity_start_sec = 0;
	beentry->activity_start_usec = 0;
1878
	MemSet(beentry->activity, 0, PGSTAT_ACTIVITY_SIZE);
1879 1880 1881 1882

	/*
	 * Lookup or create the database entry for this backends DB.
	 */
1883
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
1884
										   (void *) &(msg->m_databaseid),
1885
												 HASH_ENTER, &found);
1886
	if (dbentry == NULL)
1887
	{
1888 1889 1890
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1891 1892 1893 1894 1895 1896 1897 1898
		exit(1);
	}

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

1901 1902 1903 1904 1905 1906 1907
		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;
1908 1909

		memset(&hash_ctl, 0, sizeof(hash_ctl));
1910
		hash_ctl.keysize = sizeof(Oid);
1911
		hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
1912
		hash_ctl.hash = tag_hash;
1913 1914 1915 1916
		dbentry->tables = hash_create("Per-database table",
									  PGSTAT_TAB_HASH_SIZE,
									  &hash_ctl,
									  HASH_ELEM | HASH_FUNCTION);
1917 1918
		if (dbentry->tables == NULL)
		{
1919 1920 1921 1922
			/* assume the problem is out-of-memory */
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory in statistics collector --- abort")));
1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944
			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)
{
1945 1946 1947
	int			i;
	PgStat_StatBeDead *deadbe;
	bool		found;
1948 1949

	/*
1950 1951
	 * Search in the known-backends table for the slot containing this
	 * PID.
1952 1953 1954 1955 1956 1957 1958 1959
	 */
	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.
1960 1961 1962 1963 1964 1965 1966
			 * 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).
1967
			 */
1968 1969
			deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
													   (void *) &procpid,
1970 1971
													   HASH_ENTER,
													   &found);
1972 1973
			if (deadbe == NULL)
			{
1974 1975 1976
				ereport(LOG,
						(errcode(ERRCODE_OUT_OF_MEMORY),
						 errmsg("out of memory in statistics collector --- abort")));
1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993
				exit(1);
			}
			if (!found)
			{
				deadbe->backendid = i + 1;
				deadbe->destroy = PGSTAT_DESTROY_COUNT;
			}

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

	/*
1994 1995
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008
	 */
}


/* ----------
 * pgstat_write_statsfile() -
 *
 *	Tell the news.
 * ----------
 */
static void
pgstat_write_statsfile(void)
{
2009 2010 2011 2012 2013 2014 2015
	HASH_SEQ_STATUS hstat;
	HASH_SEQ_STATUS tstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatBeDead *deadbe;
	FILE	   *fpout;
	int			i;
2016 2017

	/*
2018
	 * Open the statistics temp file to write out the current values.
2019
	 */
P
Peter Eisentraut 已提交
2020
	fpout = fopen(pgStat_tmpfname, PG_BINARY_W);
2021 2022
	if (fpout == NULL)
	{
2023 2024
		ereport(LOG,
				(errcode_for_file_access(),
2025
				 errmsg("could not write temp statistics file \"%s\": %m",
2026
						pgStat_tmpfname)));
2027 2028 2029 2030 2031 2032 2033
		return;
	}

	/*
	 * Walk through the database table.
	 */
	hash_seq_init(&hstat, pgStatDBHash);
2034
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
2035 2036
	{
		/*
2037 2038
		 * If this database is marked destroyed, count down and do so if
		 * it reaches 0.
2039 2040 2041 2042 2043 2044 2045 2046
		 */
		if (dbentry->destroy > 0)
		{
			if (--(dbentry->destroy) == 0)
			{
				if (dbentry->tables != NULL)
					hash_destroy(dbentry->tables);

2047
				if (hash_search(pgStatDBHash,
2048 2049
								(void *) &(dbentry->databaseid),
								HASH_REMOVE, NULL) == NULL)
2050
				{
2051 2052 2053
					ereport(LOG,
							(errmsg("database hash table corrupted "
									"during cleanup --- abort")));
2054 2055 2056
					exit(1);
				}
			}
2057

2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073
			/*
			 * 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);
2074
		while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&tstat)) != NULL)
2075 2076
		{
			/*
2077 2078
			 * If table entry marked for destruction, same as above for
			 * the database entry.
2079 2080 2081 2082 2083
			 */
			if (tabentry->destroy > 0)
			{
				if (--(tabentry->destroy) == 0)
				{
2084
					if (hash_search(dbentry->tables,
2085
									(void *) &(tabentry->tableid),
2086
									HASH_REMOVE, NULL) == NULL)
2087
					{
2088 2089 2090 2091 2092
						ereport(LOG,
								(errmsg("tables hash table for "
										"database %u corrupted during "
										"cleanup --- abort",
										dbentry->databaseid)));
2093 2094 2095 2096 2097 2098 2099
						exit(1);
					}
				}
				continue;
			}

			/*
2100 2101
			 * At least we think this is still a life table. Print it's
			 * access stats.
2102 2103 2104 2105
			 */
			fputc('T', fpout);
			fwrite(tabentry, sizeof(PgStat_StatTabEntry), 1, fpout);
		}
2106

2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129
		/*
		 * 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);
		}
	}

	/*
2130
	 * No more output to be done. Close the temp file and replace the old
2131
	 * pgstat.stat with it.
2132 2133 2134 2135
	 */
	fputc('E', fpout);
	if (fclose(fpout) < 0)
	{
2136 2137 2138 2139
		ereport(LOG,
				(errcode_for_file_access(),
				 errmsg("could not write temp statistics file \"%s\": %m",
						pgStat_tmpfname)));
2140 2141 2142 2143 2144
	}
	else
	{
		if (rename(pgStat_tmpfname, pgStat_fname) < 0)
		{
2145 2146 2147 2148
			ereport(LOG,
					(errcode_for_file_access(),
					 errmsg("could not rename temp statistics file \"%s\" to \"%s\": %m",
							pgStat_tmpfname, pgStat_fname)));
2149 2150 2151 2152 2153 2154 2155
		}
	}

	/*
	 * Clear out the dead backends table
	 */
	hash_seq_init(&hstat, pgStatBeDead);
2156
	while ((deadbe = (PgStat_StatBeDead *) hash_seq_search(&hstat)) != NULL)
2157 2158
	{
		/*
2159 2160
		 * Count down the destroy delay and remove entries where it
		 * reaches 0.
2161 2162 2163
		 */
		if (--(deadbe->destroy) <= 0)
		{
2164 2165 2166
			if (hash_search(pgStatBeDead,
							(void *) &(deadbe->procpid),
							HASH_REMOVE, NULL) == NULL)
2167
			{
2168 2169 2170
				ereport(LOG,
						(errmsg("dead-backend hash table corrupted "
								"during cleanup --- abort")));
2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186
				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
2187 2188
pgstat_read_statsfile(HTAB **dbhash, Oid onlydb,
					  PgStat_StatBeEntry **betab, int *numbackends)
2189
{
2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207
	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!
2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223
	 */
	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));
2224
	hash_ctl.keysize = sizeof(Oid);
2225
	hash_ctl.entrysize = sizeof(PgStat_StatDBEntry);
2226 2227 2228 2229
	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);
2230
	if (*dbhash == NULL)
2231
	{
2232
		/* assume the problem is out-of-memory */
2233 2234
		if (pgStatRunningInCollector)
		{
2235 2236 2237
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory in statistics collector --- abort")));
2238 2239
			exit(1);
		}
2240
		/* in backend, can do normal error */
2241 2242 2243
		ereport(ERROR,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory")));
2244 2245 2246
	}

	/*
2247 2248
	 * Initialize the number of known backends to zero, just in case we do
	 * a silent error return below.
2249 2250 2251 2252 2253 2254 2255 2256
	 */
	if (numbackends != NULL)
		*numbackends = 0;
	if (betab != NULL)
		*betab = NULL;

	/*
	 * Try to open the status file. If it doesn't exist, the backends
2257 2258
	 * simply return zero for anything and the collector simply starts
	 * from scratch with empty counters.
2259
	 */
P
Peter Eisentraut 已提交
2260
	if ((fpin = fopen(pgStat_fname, PG_BINARY_R)) == NULL)
2261 2262 2263
		return;

	/*
2264 2265
	 * We found an existing collector stats file. Read it and put all the
	 * hashtable entries into place.
2266 2267 2268 2269 2270
	 */
	for (;;)
	{
		switch (fgetc(fpin))
		{
2271 2272 2273 2274 2275
				/*
				 * 'D'	A PgStat_StatDBEntry struct describing a database
				 * follows. Subsequently, zero to many 'T' entries will
				 * follow until a 'd' is encountered.
				 */
2276 2277 2278
			case 'D':
				if (fread(&dbbuf, 1, sizeof(dbbuf), fpin) != sizeof(dbbuf))
				{
2279 2280 2281 2282
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2283 2284 2285 2286 2287
				}

				/*
				 * Add to the DB hash
				 */
2288
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
2289
											  (void *) &dbbuf.databaseid,
2290 2291
															 HASH_ENTER,
															 &found);
2292 2293 2294 2295
				if (dbentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2296 2297 2298
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2299 2300 2301 2302 2303
						exit(1);
					}
					else
					{
						fclose(fpin);
2304 2305 2306
						ereport(ERROR,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory")));
2307 2308 2309 2310
					}
				}
				if (found)
				{
2311 2312 2313 2314
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2315 2316 2317
				}

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2318 2319 2320
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2321 2322 2323 2324 2325 2326 2327 2328

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

				memset(&hash_ctl, 0, sizeof(hash_ctl));
2329
				hash_ctl.keysize = sizeof(Oid);
2330
				hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2331 2332
				hash_ctl.hash = tag_hash;
				hash_ctl.hcxt = use_mcxt;
2333 2334 2335
				dbentry->tables = hash_create("Per-database table",
											  PGSTAT_TAB_HASH_SIZE,
											  &hash_ctl,
2336
								 HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2337 2338
				if (dbentry->tables == NULL)
				{
2339
					/* assume the problem is out-of-memory */
2340 2341
					if (pgStatRunningInCollector)
					{
2342 2343 2344
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2345 2346
						exit(1);
					}
2347 2348 2349 2350 2351
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2352 2353 2354 2355 2356 2357 2358 2359 2360
				}

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

2361 2362 2363
				/*
				 * 'd'	End of this database.
				 */
2364 2365 2366 2367
			case 'd':
				tabhash = NULL;
				break;

2368 2369 2370
				/*
				 * 'T'	A PgStat_StatTabEntry follows.
				 */
2371 2372 2373
			case 'T':
				if (fread(&tabbuf, 1, sizeof(tabbuf), fpin) != sizeof(tabbuf))
				{
2374 2375 2376 2377
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2378 2379 2380 2381 2382 2383 2384 2385
				}

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

2386
				tabentry = (PgStat_StatTabEntry *) hash_search(tabhash,
2387 2388
												(void *) &tabbuf.tableid,
													 HASH_ENTER, &found);
2389 2390 2391 2392
				if (tabentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2393 2394 2395
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2396 2397
						exit(1);
					}
2398 2399 2400 2401 2402
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2403 2404 2405 2406
				}

				if (found)
				{
2407 2408 2409 2410
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2411 2412 2413 2414 2415
				}

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

2416 2417 2418
				/*
				 * 'M'	The maximum number of backends to expect follows.
				 */
2419 2420 2421 2422 2423 2424 2425
			case 'M':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (fread(&maxbackends, 1, sizeof(maxbackends), fpin) !=
2426
					sizeof(maxbackends))
2427
				{
2428 2429 2430 2431
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2432 2433 2434 2435 2436 2437 2438 2439
				}
				if (maxbackends == 0)
				{
					fclose(fpin);
					return;
				}

				/*
2440 2441
				 * Allocate space (in TopTransactionContext too) for the
				 * backend table.
2442 2443
				 */
				if (use_mcxt == NULL)
2444 2445
					*betab = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2446
				else
2447 2448 2449
					*betab = (PgStat_StatBeEntry *) MemoryContextAlloc(
																use_mcxt,
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2450 2451
				break;

2452 2453 2454
				/*
				 * 'B'	A PgStat_StatBeEntry follows.
				 */
2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465
			case 'B':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (*betab == NULL)
				{
					fclose(fpin);
					return;
				}
2466

2467 2468 2469
				/*
				 * Read it directly into the table.
				 */
2470 2471 2472
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
2473
				{
2474 2475 2476 2477
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2478 2479 2480 2481 2482
				}

				/*
				 * Count backends per database here.
				 */
2483 2484 2485
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
						   (void *) &((*betab)[havebackends].databaseid),
														HASH_FIND, NULL);
2486
				if (dbentry)
2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498
					dbentry->n_backends++;

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

2499 2500 2501
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2502 2503 2504 2505 2506
			case 'E':
				fclose(fpin);
				return;

			default:
2507 2508 2509 2510
				ereport(pgStatRunningInCollector ? LOG : WARNING,
						(errmsg("corrupted pgstat.stat file")));
				fclose(fpin);
				return;
2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552
		}
	}

	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)
{
2553 2554
	PgStat_StatBeEntry *entry;

2555
	/*
2556 2557 2558
	 * 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.
2559 2560 2561
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2562

2563 2564 2565 2566 2567 2568
	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);
2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580
}


/* ----------
 * pgstat_recv_tabstat() -
 *
 *	Count what the backend has done.
 * ----------
 */
static void
pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len)
{
2581 2582 2583 2584 2585
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2586 2587 2588 2589 2590 2591 2592 2593 2594 2595

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

	/*
	 * Lookup the database in the hashtable.
	 */
2596
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2597 2598
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2599
	if (!dbentry)
2600 2601 2602
		return;

	/*
2603 2604
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and not worth being counted.
2605 2606 2607 2608
	 */
	if (dbentry->destroy > 0)
		return;

2609 2610
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2611 2612 2613 2614 2615 2616

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2617
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2618 2619
											  (void *) &(tabmsg[i].t_id),
													 HASH_ENTER, &found);
2620 2621
		if (tabentry == NULL)
		{
2622 2623 2624
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory in statistics collector --- abort")));
2625 2626 2627 2628 2629 2630
			exit(1);
		}

		if (!found)
		{
			/*
2631 2632
			 * If it's a new table entry, initialize counters to the
			 * values we just got.
2633
			 */
2634 2635 2636 2637 2638 2639 2640 2641
			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;
2642 2643 2644 2645 2646 2647 2648 2649

			tabentry->destroy = 0;
		}
		else
		{
			/*
			 * Otherwise add the values to the existing entry.
			 */
2650 2651 2652 2653 2654 2655 2656 2657
			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;
2658 2659 2660 2661 2662
		}

		/*
		 * And add the block IO to the database entry.
		 */
2663 2664
		dbentry->n_blocks_fetched += tabmsg[i].t_blocks_fetched;
		dbentry->n_blocks_hit += tabmsg[i].t_blocks_hit;
2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677
	}
}


/* ----------
 * pgstat_recv_tabpurge() -
 *
 *	Arrange for dead table removal.
 * ----------
 */
static void
pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len)
{
2678 2679 2680
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
2681 2682 2683 2684 2685 2686 2687 2688 2689 2690

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

	/*
	 * Lookup the database in the hashtable.
	 */
2691
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2692 2693
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2694
	if (!dbentry)
2695 2696 2697
		return;

	/*
2698 2699
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and the tables will go away at DB destruction.
2700 2701 2702 2703 2704 2705 2706 2707 2708
	 */
	if (dbentry->destroy > 0)
		return;

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2709
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2710 2711
										   (void *) &(msg->m_tableid[i]),
													   HASH_FIND, NULL);
2712
		if (tabentry)
2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726
			tabentry->destroy = PGSTAT_DESTROY_COUNT;
	}
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2727
	PgStat_StatDBEntry *dbentry;
2728 2729 2730 2731 2732 2733 2734 2735 2736 2737

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

	/*
	 * Lookup the database in the hashtable.
	 */
2738
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2739 2740
										   (void *) &(msg->m_databaseid),
												 HASH_FIND, NULL);
2741
	if (!dbentry)
2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759
		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)
{
2760 2761
	HASHCTL		hash_ctl;
	PgStat_StatDBEntry *dbentry;
2762 2763 2764 2765 2766 2767 2768 2769 2770 2771

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

	/*
	 * Lookup the database in the hashtable.
	 */
2772
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2773 2774
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2775
	if (!dbentry)
2776 2777 2778 2779 2780 2781 2782 2783 2784
		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);

2785 2786 2787 2788 2789 2790 2791
	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;
2792 2793

	memset(&hash_ctl, 0, sizeof(hash_ctl));
2794
	hash_ctl.keysize = sizeof(Oid);
2795
	hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2796
	hash_ctl.hash = tag_hash;
2797 2798 2799 2800
	dbentry->tables = hash_create("Per-database table",
								  PGSTAT_TAB_HASH_SIZE,
								  &hash_ctl,
								  HASH_ELEM | HASH_FUNCTION);
2801 2802
	if (dbentry->tables == NULL)
	{
2803 2804 2805 2806
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
2807 2808 2809
		exit(1);
	}
}