pgstat.c 64.5 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.38 2003/07/22 19:00:10 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	*addr = NULL, 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 192 193 194
	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;
	ret = getaddrinfo2("localhost", NULL, &hints, &addr);
	if (ret || !addr)
	{
195 196 197
		ereport(LOG,
				(errmsg("getaddrinfo2(\"localhost\") failed: %s",
						gai_strerror(ret))));
B
Bruce Momjian 已提交
198 199 200 201
		goto startup_failed;
	}
	
	if ((pgStatSock = socket(addr->ai_family,
202
							 addr->ai_socktype, addr->ai_protocol)) < 0)
203
	{
204 205 206
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create socket for statistics: %m")));
207
		goto startup_failed;
208 209 210
	}

	/*
211 212
	 * Bind it to a kernel assigned port on localhost and get the assigned
	 * port via getsockname().
213
	 */
B
Bruce Momjian 已提交
214
	if (bind(pgStatSock, addr->ai_addr, addr->ai_addrlen) < 0)
215
	{
216 217 218
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not bind socket for statistics: %m")));
219
		goto startup_failed;
220
	}
B
Bruce Momjian 已提交
221 222 223 224 225
	freeaddrinfo2(hints.ai_family, addr);
	addr = NULL;

	alen = sizeof(pgStatAddr);
	if (getsockname(pgStatSock, (struct sockaddr *)&pgStatAddr, &alen) < 0)
226
	{
227 228 229
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not get address of socket for statistics: %m")));
230
		goto startup_failed;
231 232 233
	}

	/*
234 235 236 237
	 * 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.
238
	 */
239
	if (connect(pgStatSock, (struct sockaddr *) & pgStatAddr, alen) < 0)
240
	{
241 242 243
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not connect socket for statistics: %m")));
244
		goto startup_failed;
245 246 247 248 249 250 251
	}

	/*
	 * 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.
252
	 */
253
	if (FCNTL_NONBLOCK(pgStatSock) < 0)
254
	{
255 256 257
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not set statistics socket to nonblock mode: %m")));
258
		goto startup_failed;
259 260 261 262 263 264 265
	}

	/*
	 * Create the pipe that controls the statistics collector shutdown
	 */
	if (pipe(pgStatPmPipe) < 0)
	{
266 267 268
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create pipe for statistics collector: %m")));
269
		goto startup_failed;
270 271
	}

272
	return;
273 274

startup_failed:
B
Bruce Momjian 已提交
275 276 277
	if (addr)
		freeaddrinfo2(hints.ai_family, addr);

278
	if (pgStatSock >= 0)
279
		closesocket(pgStatSock);
280 281 282
	pgStatSock = -1;

	/* Adjust GUC variables to suppress useless activity */
283
	pgstat_collect_startcollector = false;
284 285 286
	pgstat_collect_querystring = false;
	pgstat_collect_tuplelevel = false;
	pgstat_collect_blocklevel = false;
287 288 289 290 291 292 293
}


/* ----------
 * pgstat_start() -
 *
 *	Called from postmaster at startup or after an existing collector
294
 *	died.  Attempt to fire up a fresh statistics collector.
295
 *
296
 *	Note: if fail, we will be called again from the postmaster main loop.
297 298
 * ----------
 */
299
void
300
pgstat_start(void)
301
{
302 303
	time_t		curtime;

304 305 306
	/*
	 * Do nothing if no collector needed
	 */
307 308
	if (pgstat_is_running || !pgstat_collect_startcollector)
		return;
309

310
	/*
311 312 313 314 315 316 317 318 319 320 321 322 323 324
	 * 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.
325 326 327
	 */
	if (pgStatSock < 0)
	{
328 329
		ereport(LOG,
				(errmsg("statistics collector startup skipped")));
330 331 332 333 334 335
		/*
		 * 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;
336 337 338
	}

	/*
339
	 * Okay, fork off the collector.  Remember its PID for pgstat_ispgstat.
340
	 */
341 342 343 344 345 346 347 348 349

	fflush(stdout);
	fflush(stderr);

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

350
	switch ((pgStatPid = (int) fork()))
351 352
	{
		case -1:
353 354 355 356
#ifdef __BEOS__
			/* Specific beos actions */
			beos_backend_startup_failed();
#endif
357 358
			ereport(LOG,
					(errmsg("could not fork statistics buffer: %m")));
359
			return;
360 361 362 363 364

		case 0:
			break;

		default:
365 366
			pgstat_is_running = true;
			return;
367 368
	}

369
	/* in postmaster child ... */
370 371 372 373 374 375 376 377

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

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

378 379
	MyProcPid = getpid();		/* reset MyProcPid */

380 381 382 383
	/* Lose the postmaster's on-exit routines */
	on_exit_reset();

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

386
	pgstat_main();
387

388 389 390 391 392 393 394 395 396 397 398
	exit(0);
}


/* ----------
 * pgstat_ispgstat() -
 *
 *	Called from postmaster to check if a terminated child process
 *	was the statistics collector.
 * ----------
 */
399
bool
400 401
pgstat_ispgstat(int pid)
{
402 403
	if (!pgstat_is_running)
		return false;
404 405

	if (pgStatPid != pid)
406 407 408 409
		return false;

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

411
	return true;
412 413 414
}


415 416 417 418 419 420 421 422 423 424 425
/* ----------
 * 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)
426
		closesocket(pgStatPmPipe[0]);
427 428
	pgStatPmPipe[0] = -1;
	if (pgStatPmPipe[1] >= 0)
429
		closesocket(pgStatPmPipe[1]);
430 431 432 433
	pgStatPmPipe[1] = -1;
}


434 435 436 437 438 439 440 441 442
/* ----------
 * pgstat_beterm() -
 *
 *	Called from postmaster to tell collector a backend terminated.
 * ----------
 */
void
pgstat_beterm(int pid)
{
443
	PgStat_MsgBeterm msg;
444

445
	if (pgStatSock < 0)
446 447
		return;

448
	MemSet(&(msg.m_hdr), 0, sizeof(msg.m_hdr));
449 450
	msg.m_hdr.m_type = PGSTAT_MTYPE_BETERM;
	msg.m_hdr.m_procpid = pid;
451 452 453 454 455 456 457

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


/* ------------------------------------------------------------
 * Public functions used by backends follow
458
 *------------------------------------------------------------
459 460 461 462 463 464 465 466 467 468 469 470 471
 */


/* ----------
 * 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)
{
472
	PgStat_MsgBestart msg;
473

474
	if (pgStatSock < 0)
475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490
		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
491
pgstat_report_activity(const char *what)
492
{
493 494
	PgStat_MsgActivity msg;
	int			len;
495

496
	if (!pgstat_collect_querystring || pgStatSock < 0)
497 498 499
		return;

	len = strlen(what);
500 501
	len = pg_mbcliplen((const unsigned char *) what, len,
					   PGSTAT_ACTIVITY_SIZE - 1);
502

503 504
	memcpy(msg.m_what, what, len);
	msg.m_what[len] = '\0';
505
	len += offsetof(PgStat_MsgActivity, m_what) +1;
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521

	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)
{
522 523 524
	int			i;
	int			n;
	int			len;
525

526
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
527
		!pgstat_collect_blocklevel)
528 529
		return;

530 531 532 533
	if (pgStatSock < 0)
		return;

	/*
534 535
	 * For each message buffer used during the last query set the header
	 * fields and send it out.
536 537 538 539
	 */
	for (i = 0; i < pgStatTabstatUsed; i++)
	{
		n = pgStatTabstatMessages[i]->m_nentries;
540 541
		len = offsetof(PgStat_MsgTabstat, m_entry[0]) +
			n * sizeof(PgStat_TableEntry);
542

543
		pgStatTabstatMessages[i]->m_xact_commit = pgStatXactCommit;
544
		pgStatTabstatMessages[i]->m_xact_rollback = pgStatXactRollback;
545
		pgStatXactCommit = 0;
546 547
		pgStatXactRollback = 0;

548 549
		pgstat_setheader(&pgStatTabstatMessages[i]->m_hdr,
						 PGSTAT_MTYPE_TABSTAT);
550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
		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)
{
566 567 568 569 570 571 572 573 574 575 576 577 578 579
	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;
580 581 582 583 584 585 586 587

	if (pgStatSock < 0)
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
588
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
589
	{
590
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
591
							  &pgStatBeTable, &pgStatNumBackends);
592 593 594 595 596 597
		pgStatDBHashXact = GetCurrentTransactionId();
	}

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

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

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
657
		len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
658
			+msg.m_nentries * sizeof(Oid);
659 660 661 662 663 664 665 666 667 668

		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;
669
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
670 671

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
672 673
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
674 675 676 677
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
678 679
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
680
		}
681
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
682 683 684 685 686
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

	/*
687 688
	 * Search the database hash table for dead databases and tell the
	 * collector to drop them as well.
689 690
	 */
	hash_seq_init(&hstat, pgStatDBHash);
691
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
692
	{
693
		Oid			dbid = dbentry->databaseid;
694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713

		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.
	 */
714
	pfree((char *) dbidlist);
715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734

	/*
	 * 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)
{
735
	PgStat_MsgDropdb msg;
736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755

	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)
{
756
	PgStat_MsgResetcounter msg;
757 758 759 760 761

	if (pgStatSock < 0)
		return;

	if (!superuser())
762 763 764
		ereport(ERROR,
				(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
				 errmsg("must be superuser to reset statistics counters")));
765 766 767 768 769 770 771 772 773 774 775 776 777 778 779

	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)
{
780
	PgStat_MsgDummy msg;
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801

	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)
{
802 803 804 805
	PgStat_TableEntry *useent = NULL;
	Oid			rel_id = rel->rd_id;
	int			mb;
	int			i;
806 807 808 809

	/*
	 * Initialize data not to count at all.
	 */
810 811 812 813
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
814

815
	if (pgStatSock < 0)
816 817 818 819 820 821
	{
		stats->no_stats = TRUE;
		return;
	}

	/*
822
	 * On the first of all calls create some message buffers.
823
	 */
824
	if (pgStatTabstatMessages == NULL)
825
	{
826 827 828 829 830 831
		PgStat_MsgTabstat *newMessages;
		PgStat_MsgTabstat **msgArray;

		newMessages = (PgStat_MsgTabstat *)
			malloc(sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		if (newMessages == NULL)
832
		{
833 834 835
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
836 837
			return;
		}
838 839 840
		msgArray = (PgStat_MsgTabstat **)
			malloc(sizeof(PgStat_MsgTabstat *) * TABSTAT_QUANTUM);
		if (msgArray == NULL)
841
		{
842 843 844 845 846
			free(newMessages);
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
			return;
847
		}
848 849 850 851 852
		MemSet(newMessages, 0, sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		for (i = 0; i < TABSTAT_QUANTUM; i++)
			msgArray[i] = newMessages++;
		pgStatTabstatMessages = msgArray;
		pgStatTabstatAlloc = TABSTAT_QUANTUM;
853 854 855
	}

	/*
856
	 * Search the already-used message slots for this relation.
857 858 859 860 861 862 863
	 */
	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)
			{
864
				stats->tabentry = (void *) &(pgStatTabstatMessages[mb]->m_entry[i]);
865 866 867 868 869 870
				return;
			}
		}

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

872 873 874 875 876 877 878
		/*
		 * 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];
		useent->t_id = rel_id;
879
		stats->tabentry = (void *) useent;
880 881 882 883 884 885 886 887
		return;
	}

	/*
	 * If we ran out of message buffers, we just allocate more.
	 */
	if (pgStatTabstatUsed >= pgStatTabstatAlloc)
	{
888 889 890 891 892 893 894
		int		newAlloc = pgStatTabstatAlloc + TABSTAT_QUANTUM;
		PgStat_MsgTabstat *newMessages;
		PgStat_MsgTabstat **msgArray;

		newMessages = (PgStat_MsgTabstat *)
			malloc(sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		if (newMessages == NULL)
895
		{
896 897 898
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
899 900
			return;
		}
901 902 903 904
		msgArray = (PgStat_MsgTabstat **)
			realloc(pgStatTabstatMessages,
					sizeof(PgStat_MsgTabstat *) * newAlloc);
		if (msgArray == NULL)
905
		{
906 907 908 909 910
			free(newMessages);
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory")));
			return;
911
		}
912 913 914 915 916
		MemSet(newMessages, 0, sizeof(PgStat_MsgTabstat) * TABSTAT_QUANTUM);
		for (i = 0; i < TABSTAT_QUANTUM; i++)
			msgArray[pgStatTabstatAlloc + i] = newMessages++;
		pgStatTabstatMessages = msgArray;
		pgStatTabstatAlloc = newAlloc;
917 918 919 920 921 922 923 924 925
	}

	/*
	 * Use the first entry of the next message buffer.
	 */
	mb = pgStatTabstatUsed++;
	pgStatTabstatMessages[mb]->m_nentries = 1;
	useent = &pgStatTabstatMessages[mb]->m_entry[0];
	useent->t_id = rel_id;
926
	stats->tabentry = (void *) useent;
927 928 929 930 931 932 933 934 935 936 937 938
}


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
939
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
940
		!pgstat_collect_blocklevel)
941 942
		return;

943 944 945
	pgStatXactCommit++;

	/*
946 947 948
	 * 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.
949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969
	 */
	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)
{
970
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
971
		!pgstat_collect_blocklevel)
972 973
		return;

974 975 976
	pgStatXactRollback++;

	/*
977 978 979
	 * 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.
980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003
	 */
	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)
{
1004
	PgStat_StatDBEntry *dbentry;
1005 1006 1007

	/*
	 * If not done for this transaction, read the statistics collector
1008 1009
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1010
	 */
1011
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1012
	{
1013
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1014
							  &pgStatBeTable, &pgStatNumBackends);
1015 1016 1017 1018 1019 1020
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup the requested database
	 */
1021 1022
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &dbid,
1023 1024
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042
		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)
{
1043 1044
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
1045 1046 1047

	/*
	 * If not done for this transaction, read the statistics collector
1048 1049
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
1050
	 */
1051
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1052
	{
1053
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1054
							  &pgStatBeTable, &pgStatNumBackends);
1055 1056 1057 1058 1059 1060
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our database.
	 */
1061 1062
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
1063 1064
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1065 1066 1067 1068 1069 1070 1071
		return NULL;

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


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

1165
	((PgStat_MsgHdr *) msg)->m_size = len;
1166

1167 1168
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1169 1170 1171 1172 1173
}


/* ------------------------------------------------------------
 * Local functions implementing the statistics collector itself follow
1174
 *------------------------------------------------------------
1175 1176 1177 1178 1179 1180
 */


/* ----------
 * pgstat_main() -
 *
1181 1182
 *	Start up the statistics collector itself.  This is the body of the
 *	postmaster child process.
1183 1184 1185
 * ----------
 */
static void
1186
pgstat_main(void)
1187 1188
{
	PgStat_Msg	msg;
1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202
	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.
1203
	 */
1204
	closesocket(pgStatPmPipe[1]);
1205
	pgStatPmPipe[1] = -1;
1206 1207

	/*
1208 1209
	 * Ignore all signals usually bound to some action in the postmaster,
	 * except for SIGCHLD --- see pgstat_recvbuffer.
1210
	 */
1211 1212 1213 1214 1215 1216 1217 1218
	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);
1219
	pqsignal(SIGCHLD, pgstat_die);
1220 1221 1222 1223
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
1224 1225

	/*
1226 1227
	 * Start a buffering process to read from the socket, so we have a
	 * little more time to process incoming messages.
1228 1229
	 *
	 * NOTE: the process structure is: postmaster is parent of buffer process
1230
	 * is parent of collector process.	This way, the buffer can detect
1231
	 * collector failure via SIGCHLD, whereas otherwise it wouldn't notice
1232 1233 1234 1235
	 * 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.
1236 1237 1238
	 */
	if (pipe(pgStatPipe) < 0)
	{
1239 1240 1241
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not create pipe for statistics buffer: %m")));
1242 1243 1244
		exit(1);
	}

1245
	switch (fork())
1246
	{
1247
		case -1:
1248 1249
			ereport(LOG,
					(errmsg("could not fork statistics collector: %m")));
1250
			exit(1);
1251

1252
		case 0:
1253
			/* child becomes collector process */
1254 1255
			closesocket(pgStatPipe[1]);
			closesocket(pgStatSock);
1256
			break;
1257 1258 1259

		default:
			/* parent becomes buffer process */
1260
			closesocket(pgStatPipe[0]);
1261
			pgstat_recvbuffer();
1262
			exit(0);
1263 1264
	}

1265
	/*
1266 1267
	 * In the child we can have default SIGCHLD handling (in case we want
	 * to call system() here...)
1268 1269 1270
	 */
	pqsignal(SIGCHLD, SIG_DFL);

1271 1272
	MyProcPid = getpid();		/* reset MyProcPid */

1273 1274 1275
	/*
	 * Identify myself via ps
	 */
1276
	init_ps_display("stats collector process", "", "");
1277 1278 1279 1280 1281 1282 1283 1284
	set_ps_display("");

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

1285
	/*
1286 1287
	 * Read in an existing statistics stats file or initialize the stats
	 * to zero.
1288 1289 1290 1291 1292 1293 1294 1295
	 */
	pgStatRunningInCollector = TRUE;
	pgstat_read_statsfile(&pgStatDBHash, InvalidOid, NULL, NULL);

	/*
	 * Create the dead backend hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
1296
	hash_ctl.keysize = sizeof(int);
1297
	hash_ctl.entrysize = sizeof(PgStat_StatBeDead);
1298
	hash_ctl.hash = tag_hash;
1299 1300
	pgStatBeDead = hash_create("Dead Backends", PGSTAT_BE_HASH_SIZE,
							   &hash_ctl, HASH_ELEM | HASH_FUNCTION);
1301 1302
	if (pgStatBeDead == NULL)
	{
1303 1304 1305 1306
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1307 1308 1309 1310 1311 1312
		exit(1);
	}

	/*
	 * Create the known backends table
	 */
1313 1314
	pgStatBeTable = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * MaxBackends);
1315 1316
	if (pgStatBeTable == NULL)
	{
1317 1318
		ereport(LOG,
				(errmsg("allocation of backend table failed")));
1319 1320 1321 1322
		exit(1);
	}
	memset(pgStatBeTable, 0, sizeof(PgStat_StatBeEntry) * MaxBackends);

1323 1324
	readPipe = pgStatPipe[0];

1325
	/*
1326 1327
	 * Process incoming messages and handle all the reporting stuff until
	 * there are no more messages.
1328 1329 1330 1331
	 */
	for (;;)
	{
		/*
1332 1333 1334
		 * 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.
1335 1336 1337
		 */
		if (need_statwrite)
		{
1338 1339 1340 1341 1342 1343 1344
			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))
1345
			{
1346
				timeout.tv_sec = 0;
1347 1348
				timeout.tv_usec = 0;
			}
1349 1350 1351 1352 1353 1354 1355 1356 1357 1358
			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;
				}
			}
1359 1360 1361 1362 1363 1364
		}

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1365 1366
		FD_SET(readPipe, &rfds);
		FD_SET(pmPipe, &rfds);
1367

1368 1369
		if (readPipe > pmPipe)
			maxfd = readPipe;
1370
		else
1371
			maxfd = pmPipe;
1372 1373 1374 1375

		/*
		 * Now wait for something to do.
		 */
1376
		nready = select(maxfd + 1, &rfds, NULL, NULL,
1377 1378 1379
						(need_statwrite) ? &timeout : NULL);
		if (nready < 0)
		{
1380 1381
			if (errno == EINTR)
				continue;
1382 1383 1384
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("select failed in statistics collector: %m")));
1385 1386 1387 1388
			exit(1);
		}

		/*
1389 1390
		 * If there are no descriptors ready, our timeout for writing the
		 * stats file happened.
1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402
		 */
		if (nready == 0)
		{
			pgstat_write_statsfile();
			need_statwrite = FALSE;

			continue;
		}

		/*
		 * Check if there is a new statistics message to collect.
		 */
1403
		if (FD_ISSET(readPipe, &rfds))
1404 1405
		{
			/*
1406 1407 1408 1409 1410
			 * 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.
1411
			 */
1412 1413
			int			nread = 0;
			int			targetlen = sizeof(PgStat_MsgHdr);		/* initial */
1414

1415
			while (nread < targetlen)
1416
			{
1417 1418 1419
				len = read(readPipe,
						   ((char *) &msg) + nread,
						   targetlen - nread);
1420 1421
				if (len < 0)
				{
1422 1423
					if (errno == EINTR)
						continue;
1424 1425 1426
					ereport(LOG,
							(errcode_for_socket_access(),
							 errmsg("could not read from statistics pipe: %m")));
1427 1428
					exit(1);
				}
1429 1430 1431 1432
				if (len == 0)	/* EOF on the pipe! */
					break;
				nread += len;
				if (nread == sizeof(PgStat_MsgHdr))
1433
				{
1434 1435 1436 1437 1438 1439
					/* we have the header, compute actual msg length */
					targetlen = msg.msg_hdr.m_size;
					if (targetlen < (int) sizeof(PgStat_MsgHdr) ||
						targetlen > (int) sizeof(msg))
					{
						/*
1440 1441 1442
						 * Bogus message length implies that we got out of
						 * sync with the buffer process somehow. Abort so
						 * that we can restart both processes.
1443
						 */
1444 1445
						ereport(LOG,
								(errmsg("invalid statistics message length")));
1446 1447
						exit(1);
					}
1448 1449
				}
			}
1450

1451 1452 1453 1454 1455 1456
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
			if (len == 0)
				break;
1457 1458

			/*
1459 1460
			 * Distribute the message to the specific function handling
			 * it.
1461 1462 1463 1464 1465 1466 1467
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1468
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1469 1470 1471
					break;

				case PGSTAT_MTYPE_BETERM:
1472
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1473 1474 1475
					break;

				case PGSTAT_MTYPE_TABSTAT:
1476
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1477 1478 1479
					break;

				case PGSTAT_MTYPE_TABPURGE:
1480
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1481 1482 1483
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1484
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1485 1486 1487
					break;

				case PGSTAT_MTYPE_DROPDB:
1488
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1489 1490 1491
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1492
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1493
											 nread);
1494 1495 1496 1497 1498 1499 1500
					break;

				default:
					break;
			}

			/*
1501
			 * Globally count messages.
1502 1503
			 */
			pgStatNumMessages++;
1504 1505

			/*
1506 1507
			 * If this is the first message after we wrote the stats file
			 * the last time, setup the timeout that it'd be written.
1508 1509 1510 1511 1512
			 */
			if (!need_statwrite)
			{
				gettimeofday(&next_statwrite, NULL);
				next_statwrite.tv_usec += ((PGSTAT_STAT_INTERVAL) * 1000);
1513
				next_statwrite.tv_sec += (next_statwrite.tv_usec / 1000000);
1514 1515 1516
				next_statwrite.tv_usec %= 1000000;
				need_statwrite = TRUE;
			}
1517 1518 1519
		}

		/*
1520
		 * Note that we do NOT check for postmaster exit inside the loop;
1521 1522 1523
		 * 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.
1524 1525
		 */
	}
1526 1527

	/*
1528 1529 1530 1531 1532 1533 1534 1535 1536
	 * 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.
1537 1538 1539
	 */
	if (FD_ISSET(pmPipe, &rfds))
		pgstat_write_statsfile();
1540 1541 1542 1543 1544 1545
}


/* ----------
 * pgstat_recvbuffer() -
 *
1546
 *	This is the body of the separate buffering process. Its only
1547
 *	purpose is to receive messages from the UDP socket as fast as
1548 1549
 *	possible and forward them over a pipe into the collector itself.
 *	If the collector is slow to absorb messages, they are buffered here.
1550 1551 1552
 * ----------
 */
static void
1553
pgstat_recvbuffer(void)
1554
{
1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568
	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 已提交
1569
	struct sockaddr_storage	fromaddr;
1570 1571
	int			fromlen;
	bool		overflow = false;
1572

1573 1574 1575
	/*
	 * Identify myself via ps
	 */
1576
	init_ps_display("stats buffer process", "", "");
1577 1578
	set_ps_display("");

1579
	/*
1580 1581 1582 1583 1584
	 * 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).
1585 1586 1587 1588 1589 1590 1591 1592
	 */
	pqsignal(SIGPIPE, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

	/*
	 * Set the write pipe to nonblock mode, so that we cannot block when
	 * the collector falls behind.
	 */
1593
	if (FCNTL_NONBLOCK(writePipe) < 0)
1594
	{
1595 1596 1597
		ereport(LOG,
				(errcode_for_socket_access(),
				 errmsg("could not set statistics pipe to nonblock mode: %m")));
1598 1599 1600
		exit(1);
	}

1601 1602 1603
	/*
	 * Allocate the message buffer
	 */
1604
	msgbuffer = (char *) malloc(PGSTAT_RECVBUFFERSZ);
1605 1606
	if (msgbuffer == NULL)
	{
1607 1608 1609
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622
		exit(1);
	}

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

		/*
1623 1624
		 * As long as we have buffer space we add the socket to the read
		 * descriptor set.
1625
		 */
1626
		if (msg_have <= (int) (PGSTAT_RECVBUFFERSZ - sizeof(PgStat_Msg)))
1627 1628 1629
		{
			FD_SET(pgStatSock, &rfds);
			maxfd = pgStatSock;
1630
			overflow = false;
1631 1632 1633
		}
		else
		{
1634
			if (!overflow)
1635
			{
1636 1637
				ereport(LOG,
						(errmsg("statistics buffer is full")));
1638
				overflow = true;
1639 1640 1641 1642
			}
		}

		/*
1643 1644 1645
		 * 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.
1646 1647 1648
		 */
		if (msg_have > 0)
		{
1649 1650 1651
			FD_SET(writePipe, &wfds);
			if (writePipe > maxfd)
				maxfd = writePipe;
1652 1653 1654
		}
		else
		{
1655 1656 1657
			FD_SET(pmPipe, &rfds);
			if (pmPipe > maxfd)
				maxfd = pmPipe;
1658 1659 1660 1661 1662 1663 1664 1665
		}

		/*
		 * Wait for some work to do.
		 */
		nready = select(maxfd + 1, &rfds, &wfds, NULL, NULL);
		if (nready < 0)
		{
1666 1667
			if (errno == EINTR)
				continue;
1668 1669 1670
			ereport(LOG,
					(errcode_for_socket_access(),
					 errmsg("select failed in statistics buffer: %m")));
1671 1672 1673 1674 1675 1676 1677 1678 1679 1680
			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 已提交
1681 1682 1683
			len = recvfrom(pgStatSock, (char *) &input_buffer,
				sizeof(PgStat_Msg), 0,
				(struct sockaddr *) &fromaddr, &fromlen);
1684 1685
			if (len < 0)
			{
1686 1687 1688
				ereport(LOG,
						(errcode_for_socket_access(),
						 errmsg("failed to read statistics message: %m")));
1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700
				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
			 */
1701
			if (input_buffer.msg_hdr.m_size != len)
1702 1703 1704 1705 1706
				continue;

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

1714
			/*
1715 1716
			 * O.K. - we accept this message.  Copy it to the circular
			 * msgbuffer.
1717
			 */
1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734
			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;
			}
1735 1736 1737
		}

		/*
1738 1739 1740 1741
		 * 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
1742 1743 1744 1745 1746 1747 1748
		 * 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...
1749
		 */
1750
		if (FD_ISSET(writePipe, &wfds))
1751
		{
1752 1753 1754 1755 1756
			xfr = PGSTAT_RECVBUFFERSZ - msg_send;
			if (xfr > msg_have)
				xfr = msg_have;
			Assert(xfr > 0);
			len = write(writePipe, msgbuffer + msg_send, xfr);
1757 1758
			if (len < 0)
			{
1759 1760
				if (errno == EINTR || errno == EAGAIN)
					continue;	/* not enough space in pipe */
1761 1762 1763
				ereport(LOG,
						(errcode_for_socket_access(),
						 errmsg("failed to write statistics pipe: %m")));
1764 1765
				exit(1);
			}
1766 1767
			/* NB: len < xfr is okay */
			msg_send += len;
1768 1769
			if (msg_send == PGSTAT_RECVBUFFERSZ)
				msg_send = 0;
1770
			msg_have -= len;
1771 1772 1773 1774 1775 1776
		}

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1777
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1778 1779 1780
			continue;

		/*
1781 1782 1783
		 * 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.
1784
		 */
1785
		if (FD_ISSET(pmPipe, &rfds))
1786 1787 1788 1789
			exit(0);
	}
}

1790 1791 1792 1793 1794 1795
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

1796 1797 1798 1799

/* ----------
 * pgstat_add_backend() -
 *
1800
 *	Support function to keep our backend list up to date.
1801 1802 1803 1804 1805
 * ----------
 */
static int
pgstat_add_backend(PgStat_MsgHdr *msg)
{
1806 1807 1808 1809
	PgStat_StatDBEntry *dbentry;
	PgStat_StatBeEntry *beentry;
	PgStat_StatBeDead *deadbe;
	bool		found;
1810 1811 1812 1813 1814 1815

	/*
	 * Check that the backend ID is valid
	 */
	if (msg->m_backendid < 1 || msg->m_backendid > MaxBackends)
	{
1816 1817
		ereport(LOG,
				(errmsg("invalid backend ID %d", msg->m_backendid)));
1818 1819 1820 1821 1822 1823 1824 1825 1826 1827
		return -1;
	}

	/*
	 * Get the slot for this backendid.
	 */
	beentry = &pgStatBeTable[msg->m_backendid - 1];
	if (beentry->databaseid != InvalidOid)
	{
		/*
1828 1829
		 * If the slot contains the PID of this backend, everything is
		 * fine and we got nothing to do.
1830 1831 1832 1833 1834 1835
		 */
		if (beentry->procpid == msg->m_procpid)
			return 0;
	}

	/*
1836 1837 1838 1839 1840
	 * 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.
1841 1842 1843
	 *
	 * If the backend is known to be dead, we ignore this add.
	 */
1844 1845
	deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
											   (void *) &(msg->m_procpid),
1846 1847
											   HASH_FIND, NULL);
	if (deadbe)
1848 1849 1850
		return 1;

	/*
1851 1852
	 * Backend isn't known to be dead. If it's slot is currently used, we
	 * have to kick out the old backend.
1853 1854 1855 1856 1857 1858 1859 1860
	 */
	if (beentry->databaseid != InvalidOid)
		pgstat_sub_backend(beentry->procpid);

	/*
	 * Put this new backend into the slot.
	 */
	beentry->databaseid = msg->m_databaseid;
1861 1862
	beentry->procpid = msg->m_procpid;
	beentry->userid = msg->m_userid;
1863 1864
	beentry->activity_start_sec = 0;
	beentry->activity_start_usec = 0;
1865
	MemSet(beentry->activity, 0, PGSTAT_ACTIVITY_SIZE);
1866 1867 1868 1869

	/*
	 * Lookup or create the database entry for this backends DB.
	 */
1870
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
1871
										   (void *) &(msg->m_databaseid),
1872
												 HASH_ENTER, &found);
1873
	if (dbentry == NULL)
1874
	{
1875 1876 1877
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
1878 1879 1880 1881 1882 1883 1884 1885
		exit(1);
	}

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

1888 1889 1890 1891 1892 1893 1894
		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;
1895 1896

		memset(&hash_ctl, 0, sizeof(hash_ctl));
1897
		hash_ctl.keysize = sizeof(Oid);
1898
		hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
1899
		hash_ctl.hash = tag_hash;
1900 1901 1902 1903
		dbentry->tables = hash_create("Per-database table",
									  PGSTAT_TAB_HASH_SIZE,
									  &hash_ctl,
									  HASH_ELEM | HASH_FUNCTION);
1904 1905
		if (dbentry->tables == NULL)
		{
1906 1907 1908 1909
			/* assume the problem is out-of-memory */
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory in statistics collector --- abort")));
1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931
			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)
{
1932 1933 1934
	int			i;
	PgStat_StatBeDead *deadbe;
	bool		found;
1935 1936

	/*
1937 1938
	 * Search in the known-backends table for the slot containing this
	 * PID.
1939 1940 1941 1942 1943 1944 1945 1946
	 */
	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.
1947 1948 1949 1950 1951 1952 1953
			 * 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).
1954
			 */
1955 1956
			deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
													   (void *) &procpid,
1957 1958
													   HASH_ENTER,
													   &found);
1959 1960
			if (deadbe == NULL)
			{
1961 1962 1963
				ereport(LOG,
						(errcode(ERRCODE_OUT_OF_MEMORY),
						 errmsg("out of memory in statistics collector --- abort")));
1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
				exit(1);
			}
			if (!found)
			{
				deadbe->backendid = i + 1;
				deadbe->destroy = PGSTAT_DESTROY_COUNT;
			}

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

	/*
1981 1982
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995
	 */
}


/* ----------
 * pgstat_write_statsfile() -
 *
 *	Tell the news.
 * ----------
 */
static void
pgstat_write_statsfile(void)
{
1996 1997 1998 1999 2000 2001 2002
	HASH_SEQ_STATUS hstat;
	HASH_SEQ_STATUS tstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatBeDead *deadbe;
	FILE	   *fpout;
	int			i;
2003 2004

	/*
2005
	 * Open the statistics temp file to write out the current values.
2006
	 */
P
Peter Eisentraut 已提交
2007
	fpout = fopen(pgStat_tmpfname, PG_BINARY_W);
2008 2009
	if (fpout == NULL)
	{
2010 2011 2012 2013
		ereport(LOG,
				(errcode_for_file_access(),
				 errmsg("cannot write temp statistics file \"%s\": %m",
						pgStat_tmpfname)));
2014 2015 2016 2017 2018 2019 2020
		return;
	}

	/*
	 * Walk through the database table.
	 */
	hash_seq_init(&hstat, pgStatDBHash);
2021
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
2022 2023
	{
		/*
2024 2025
		 * If this database is marked destroyed, count down and do so if
		 * it reaches 0.
2026 2027 2028 2029 2030 2031 2032 2033
		 */
		if (dbentry->destroy > 0)
		{
			if (--(dbentry->destroy) == 0)
			{
				if (dbentry->tables != NULL)
					hash_destroy(dbentry->tables);

2034
				if (hash_search(pgStatDBHash,
2035 2036
								(void *) &(dbentry->databaseid),
								HASH_REMOVE, NULL) == NULL)
2037
				{
2038 2039 2040
					ereport(LOG,
							(errmsg("database hash table corrupted "
									"during cleanup --- abort")));
2041 2042 2043
					exit(1);
				}
			}
2044

2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060
			/*
			 * 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);
2061
		while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&tstat)) != NULL)
2062 2063
		{
			/*
2064 2065
			 * If table entry marked for destruction, same as above for
			 * the database entry.
2066 2067 2068 2069 2070
			 */
			if (tabentry->destroy > 0)
			{
				if (--(tabentry->destroy) == 0)
				{
2071
					if (hash_search(dbentry->tables,
2072
									(void *) &(tabentry->tableid),
2073
									HASH_REMOVE, NULL) == NULL)
2074
					{
2075 2076 2077 2078 2079
						ereport(LOG,
								(errmsg("tables hash table for "
										"database %u corrupted during "
										"cleanup --- abort",
										dbentry->databaseid)));
2080 2081 2082 2083 2084 2085 2086
						exit(1);
					}
				}
				continue;
			}

			/*
2087 2088
			 * At least we think this is still a life table. Print it's
			 * access stats.
2089 2090 2091 2092
			 */
			fputc('T', fpout);
			fwrite(tabentry, sizeof(PgStat_StatTabEntry), 1, fpout);
		}
2093

2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116
		/*
		 * 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);
		}
	}

	/*
2117
	 * No more output to be done. Close the temp file and replace the old
2118
	 * pgstat.stat with it.
2119 2120 2121 2122
	 */
	fputc('E', fpout);
	if (fclose(fpout) < 0)
	{
2123 2124 2125 2126
		ereport(LOG,
				(errcode_for_file_access(),
				 errmsg("could not write temp statistics file \"%s\": %m",
						pgStat_tmpfname)));
2127 2128 2129 2130 2131
	}
	else
	{
		if (rename(pgStat_tmpfname, pgStat_fname) < 0)
		{
2132 2133 2134 2135
			ereport(LOG,
					(errcode_for_file_access(),
					 errmsg("could not rename temp statistics file \"%s\" to \"%s\": %m",
							pgStat_tmpfname, pgStat_fname)));
2136 2137 2138 2139 2140 2141 2142
		}
	}

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

	/*
2234 2235
	 * Initialize the number of known backends to zero, just in case we do
	 * a silent error return below.
2236 2237 2238 2239 2240 2241 2242 2243
	 */
	if (numbackends != NULL)
		*numbackends = 0;
	if (betab != NULL)
		*betab = NULL;

	/*
	 * Try to open the status file. If it doesn't exist, the backends
2244 2245
	 * simply return zero for anything and the collector simply starts
	 * from scratch with empty counters.
2246
	 */
P
Peter Eisentraut 已提交
2247
	if ((fpin = fopen(pgStat_fname, PG_BINARY_R)) == NULL)
2248 2249 2250
		return;

	/*
2251 2252
	 * We found an existing collector stats file. Read it and put all the
	 * hashtable entries into place.
2253 2254 2255 2256 2257
	 */
	for (;;)
	{
		switch (fgetc(fpin))
		{
2258 2259 2260 2261 2262
				/*
				 * 'D'	A PgStat_StatDBEntry struct describing a database
				 * follows. Subsequently, zero to many 'T' entries will
				 * follow until a 'd' is encountered.
				 */
2263 2264 2265
			case 'D':
				if (fread(&dbbuf, 1, sizeof(dbbuf), fpin) != sizeof(dbbuf))
				{
2266 2267 2268 2269
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2270 2271 2272 2273 2274
				}

				/*
				 * Add to the DB hash
				 */
2275
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
2276
											  (void *) &dbbuf.databaseid,
2277 2278
															 HASH_ENTER,
															 &found);
2279 2280 2281 2282
				if (dbentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2283 2284 2285
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2286 2287 2288 2289 2290
						exit(1);
					}
					else
					{
						fclose(fpin);
2291 2292 2293
						ereport(ERROR,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory")));
2294 2295 2296 2297
					}
				}
				if (found)
				{
2298 2299 2300 2301
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2302 2303 2304
				}

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2305 2306 2307
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2308 2309 2310 2311 2312 2313 2314 2315

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

				memset(&hash_ctl, 0, sizeof(hash_ctl));
2316
				hash_ctl.keysize = sizeof(Oid);
2317
				hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2318 2319
				hash_ctl.hash = tag_hash;
				hash_ctl.hcxt = use_mcxt;
2320 2321 2322
				dbentry->tables = hash_create("Per-database table",
											  PGSTAT_TAB_HASH_SIZE,
											  &hash_ctl,
2323
								 HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2324 2325
				if (dbentry->tables == NULL)
				{
2326
					/* assume the problem is out-of-memory */
2327 2328
					if (pgStatRunningInCollector)
					{
2329 2330 2331
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2332 2333
						exit(1);
					}
2334 2335 2336 2337 2338
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2339 2340 2341 2342 2343 2344 2345 2346 2347
				}

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

2348 2349 2350
				/*
				 * 'd'	End of this database.
				 */
2351 2352 2353 2354
			case 'd':
				tabhash = NULL;
				break;

2355 2356 2357
				/*
				 * 'T'	A PgStat_StatTabEntry follows.
				 */
2358 2359 2360
			case 'T':
				if (fread(&tabbuf, 1, sizeof(tabbuf), fpin) != sizeof(tabbuf))
				{
2361 2362 2363 2364
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2365 2366 2367 2368 2369 2370 2371 2372
				}

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

2373
				tabentry = (PgStat_StatTabEntry *) hash_search(tabhash,
2374 2375
												(void *) &tabbuf.tableid,
													 HASH_ENTER, &found);
2376 2377 2378 2379
				if (tabentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2380 2381 2382
						ereport(LOG,
								(errcode(ERRCODE_OUT_OF_MEMORY),
								 errmsg("out of memory in statistics collector --- abort")));
2383 2384
						exit(1);
					}
2385 2386 2387 2388 2389
					/* in backend, can do normal error */
					fclose(fpin);
					ereport(ERROR,
							(errcode(ERRCODE_OUT_OF_MEMORY),
							 errmsg("out of memory")));
2390 2391 2392 2393
				}

				if (found)
				{
2394 2395 2396 2397
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2398 2399 2400 2401 2402
				}

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

2403 2404 2405
				/*
				 * 'M'	The maximum number of backends to expect follows.
				 */
2406 2407 2408 2409 2410 2411 2412
			case 'M':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (fread(&maxbackends, 1, sizeof(maxbackends), fpin) !=
2413
					sizeof(maxbackends))
2414
				{
2415 2416 2417 2418
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2419 2420 2421 2422 2423 2424 2425 2426
				}
				if (maxbackends == 0)
				{
					fclose(fpin);
					return;
				}

				/*
2427 2428
				 * Allocate space (in TopTransactionContext too) for the
				 * backend table.
2429 2430
				 */
				if (use_mcxt == NULL)
2431 2432
					*betab = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2433
				else
2434 2435 2436
					*betab = (PgStat_StatBeEntry *) MemoryContextAlloc(
																use_mcxt,
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2437 2438
				break;

2439 2440 2441
				/*
				 * 'B'	A PgStat_StatBeEntry follows.
				 */
2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452
			case 'B':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (*betab == NULL)
				{
					fclose(fpin);
					return;
				}
2453

2454 2455 2456
				/*
				 * Read it directly into the table.
				 */
2457 2458 2459
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
2460
				{
2461 2462 2463 2464
					ereport(pgStatRunningInCollector ? LOG : WARNING,
							(errmsg("corrupted pgstat.stat file")));
					fclose(fpin);
					return;
2465 2466 2467 2468 2469
				}

				/*
				 * Count backends per database here.
				 */
2470 2471 2472
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
						   (void *) &((*betab)[havebackends].databaseid),
														HASH_FIND, NULL);
2473
				if (dbentry)
2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485
					dbentry->n_backends++;

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

2486 2487 2488
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2489 2490 2491 2492 2493
			case 'E':
				fclose(fpin);
				return;

			default:
2494 2495 2496 2497
				ereport(pgStatRunningInCollector ? LOG : WARNING,
						(errmsg("corrupted pgstat.stat file")));
				fclose(fpin);
				return;
2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 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
		}
	}

	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)
{
2540 2541
	PgStat_StatBeEntry *entry;

2542
	/*
2543 2544 2545
	 * 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.
2546 2547 2548
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2549

2550 2551 2552 2553 2554 2555
	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);
2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567
}


/* ----------
 * pgstat_recv_tabstat() -
 *
 *	Count what the backend has done.
 * ----------
 */
static void
pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len)
{
2568 2569 2570 2571 2572
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2573 2574 2575 2576 2577 2578 2579 2580 2581 2582

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

	/*
	 * Lookup the database in the hashtable.
	 */
2583
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2584 2585
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2586
	if (!dbentry)
2587 2588 2589
		return;

	/*
2590 2591
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and not worth being counted.
2592 2593 2594 2595
	 */
	if (dbentry->destroy > 0)
		return;

2596 2597
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2598 2599 2600 2601 2602 2603

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2604
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2605 2606
											  (void *) &(tabmsg[i].t_id),
													 HASH_ENTER, &found);
2607 2608
		if (tabentry == NULL)
		{
2609 2610 2611
			ereport(LOG,
					(errcode(ERRCODE_OUT_OF_MEMORY),
					 errmsg("out of memory in statistics collector --- abort")));
2612 2613 2614 2615 2616 2617
			exit(1);
		}

		if (!found)
		{
			/*
2618 2619
			 * If it's a new table entry, initialize counters to the
			 * values we just got.
2620
			 */
2621 2622 2623 2624 2625 2626 2627 2628
			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;
2629 2630 2631 2632 2633 2634 2635 2636

			tabentry->destroy = 0;
		}
		else
		{
			/*
			 * Otherwise add the values to the existing entry.
			 */
2637 2638 2639 2640 2641 2642 2643 2644
			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;
2645 2646 2647 2648 2649
		}

		/*
		 * And add the block IO to the database entry.
		 */
2650 2651
		dbentry->n_blocks_fetched += tabmsg[i].t_blocks_fetched;
		dbentry->n_blocks_hit += tabmsg[i].t_blocks_hit;
2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664
	}
}


/* ----------
 * pgstat_recv_tabpurge() -
 *
 *	Arrange for dead table removal.
 * ----------
 */
static void
pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len)
{
2665 2666 2667
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
2668 2669 2670 2671 2672 2673 2674 2675 2676 2677

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

	/*
	 * Lookup the database in the hashtable.
	 */
2678
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2679 2680
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2681
	if (!dbentry)
2682 2683 2684
		return;

	/*
2685 2686
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and the tables will go away at DB destruction.
2687 2688 2689 2690 2691 2692 2693 2694 2695
	 */
	if (dbentry->destroy > 0)
		return;

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2696
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2697 2698
										   (void *) &(msg->m_tableid[i]),
													   HASH_FIND, NULL);
2699
		if (tabentry)
2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713
			tabentry->destroy = PGSTAT_DESTROY_COUNT;
	}
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2714
	PgStat_StatDBEntry *dbentry;
2715 2716 2717 2718 2719 2720 2721 2722 2723 2724

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

	/*
	 * Lookup the database in the hashtable.
	 */
2725
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2726 2727
										   (void *) &(msg->m_databaseid),
												 HASH_FIND, NULL);
2728
	if (!dbentry)
2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746
		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)
{
2747 2748
	HASHCTL		hash_ctl;
	PgStat_StatDBEntry *dbentry;
2749 2750 2751 2752 2753 2754 2755 2756 2757 2758

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

	/*
	 * Lookup the database in the hashtable.
	 */
2759
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2760 2761
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2762
	if (!dbentry)
2763 2764 2765 2766 2767 2768 2769 2770 2771
		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);

2772 2773 2774 2775 2776 2777 2778
	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;
2779 2780

	memset(&hash_ctl, 0, sizeof(hash_ctl));
2781
	hash_ctl.keysize = sizeof(Oid);
2782
	hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2783
	hash_ctl.hash = tag_hash;
2784 2785 2786 2787
	dbentry->tables = hash_create("Per-database table",
								  PGSTAT_TAB_HASH_SIZE,
								  &hash_ctl,
								  HASH_ELEM | HASH_FUNCTION);
2788 2789
	if (dbentry->tables == NULL)
	{
2790 2791 2792 2793
		/* assume the problem is out-of-memory */
		ereport(LOG,
				(errcode(ERRCODE_OUT_OF_MEMORY),
				 errmsg("out of memory in statistics collector --- abort")));
2794 2795 2796
		exit(1);
	}
}