pgstat.c 62.6 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
 *
B
Bruce Momjian 已提交
16
 *	$Header: /cvsroot/pgsql/src/backend/postmaster/pgstat.c,v 1.37 2003/06/12 07:36:51 momjian 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 84 85 86 87 88
static bool pgStatRunningInCollector = FALSE;
static int	pgStatTabstatAlloc = 0;
static int	pgStatTabstatUsed = 0;
static PgStat_MsgTabstat **pgStatTabstatMessages = NULL;
static int	pgStatXactCommit = 0;
static int	pgStatXactRollback = 0;
89 90


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

97 98
static char pgStat_tmpfname[MAXPGPATH];
static char pgStat_fname[MAXPGPATH];
99 100 101 102 103 104


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


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


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

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

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

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

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

179
	/*
180
	 * Create the UDP socket for sending and receiving statistic messages
181
	 */
B
Bruce Momjian 已提交
182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
	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)
	{
		elog(LOG, "PGSTAT: getaddrinfo2() failed: %s",
			gai_strerror(ret));
		goto startup_failed;
	}
	
	if ((pgStatSock = socket(addr->ai_family,
		addr->ai_socktype, addr->ai_protocol)) < 0)
200
	{
201 202
		elog(LOG, "PGSTAT: socket() failed: %m");
		goto startup_failed;
203 204 205
	}

	/*
206 207
	 * Bind it to a kernel assigned port on localhost and get the assigned
	 * port via getsockname().
208
	 */
B
Bruce Momjian 已提交
209
	if (bind(pgStatSock, addr->ai_addr, addr->ai_addrlen) < 0)
210
	{
B
Bruce Momjian 已提交
211
		elog(LOG, "PGSTAT: bind() failed: %m");
212
		goto startup_failed;
213
	}
B
Bruce Momjian 已提交
214 215 216 217 218
	freeaddrinfo2(hints.ai_family, addr);
	addr = NULL;

	alen = sizeof(pgStatAddr);
	if (getsockname(pgStatSock, (struct sockaddr *)&pgStatAddr, &alen) < 0)
219
	{
220 221
		elog(LOG, "PGSTAT: getsockname() failed: %m");
		goto startup_failed;
222 223 224
	}

	/*
225 226 227 228
	 * 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.
229
	 */
230
	if (connect(pgStatSock, (struct sockaddr *) & pgStatAddr, alen) < 0)
231
	{
232 233
		elog(LOG, "PGSTAT: connect() failed: %m");
		goto startup_failed;
234 235 236 237 238 239 240
	}

	/*
	 * 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.
241
	 */
242
	if (FCNTL_NONBLOCK(pgStatSock) < 0)
243
	{
244 245
		elog(LOG, "PGSTAT: fcntl() failed: %m");
		goto startup_failed;
246 247 248 249 250 251 252
	}

	/*
	 * Create the pipe that controls the statistics collector shutdown
	 */
	if (pipe(pgStatPmPipe) < 0)
	{
253 254
		elog(LOG, "PGSTAT: pipe() failed: %m");
		goto startup_failed;
255 256
	}

257
	return;
258 259

startup_failed:
B
Bruce Momjian 已提交
260 261 262 263 264
	if (addr)
	{
		freeaddrinfo2(hints.ai_family, addr);
	}

265
	if (pgStatSock >= 0)
266
		closesocket(pgStatSock);
267 268 269
	pgStatSock = -1;

	/* Adjust GUC variables to suppress useless activity */
270
	pgstat_collect_startcollector = false;
271 272 273
	pgstat_collect_querystring = false;
	pgstat_collect_tuplelevel = false;
	pgstat_collect_blocklevel = false;
274 275 276 277 278 279 280
}


/* ----------
 * pgstat_start() -
 *
 *	Called from postmaster at startup or after an existing collector
281
 *	died.  Attempt to fire up a fresh statistics collector.
282
 *
283
 *	Note: if fail, we will be called again from the postmaster main loop.
284 285
 * ----------
 */
286
void
287
pgstat_start(void)
288
{
289 290
	time_t		curtime;

291 292 293
	/*
	 * Do nothing if no collector needed
	 */
294 295
	if (pgstat_is_running || !pgstat_collect_startcollector)
		return;
296

297
	/*
298 299 300 301 302 303 304 305 306 307 308 309 310 311
	 * 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.
312 313 314
	 */
	if (pgStatSock < 0)
	{
315
		elog(LOG, "PGSTAT: statistics collector startup skipped");
316 317 318 319 320 321
		/*
		 * 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;
322 323 324
	}

	/*
325
	 * Okay, fork off the collector.  Remember its PID for pgstat_ispgstat.
326
	 */
327 328 329 330 331 332 333 334 335

	fflush(stdout);
	fflush(stderr);

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

336
	switch ((pgStatPid = (int) fork()))
337 338
	{
		case -1:
339 340 341 342
#ifdef __BEOS__
			/* Specific beos actions */
			beos_backend_startup_failed();
#endif
343
			elog(LOG, "PGSTAT: fork() failed: %m");
344
			return;
345 346 347 348 349

		case 0:
			break;

		default:
350 351
			pgstat_is_running = true;
			return;
352 353
	}

354
	/* in postmaster child ... */
355 356 357 358 359 360 361 362

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

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

363 364
	MyProcPid = getpid();		/* reset MyProcPid */

365 366 367 368
	/* Lose the postmaster's on-exit routines */
	on_exit_reset();

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

371
	pgstat_main();
372

373 374 375 376 377 378 379 380 381 382 383
	exit(0);
}


/* ----------
 * pgstat_ispgstat() -
 *
 *	Called from postmaster to check if a terminated child process
 *	was the statistics collector.
 * ----------
 */
384
bool
385 386
pgstat_ispgstat(int pid)
{
387 388
	if (!pgstat_is_running)
		return false;
389 390

	if (pgStatPid != pid)
391 392 393 394
		return false;

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

396
	return true;
397 398 399
}


400 401 402 403 404 405 406 407 408 409 410
/* ----------
 * 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)
411
		closesocket(pgStatPmPipe[0]);
412 413
	pgStatPmPipe[0] = -1;
	if (pgStatPmPipe[1] >= 0)
414
		closesocket(pgStatPmPipe[1]);
415 416 417 418
	pgStatPmPipe[1] = -1;
}


419 420 421 422 423 424 425 426 427
/* ----------
 * pgstat_beterm() -
 *
 *	Called from postmaster to tell collector a backend terminated.
 * ----------
 */
void
pgstat_beterm(int pid)
{
428
	PgStat_MsgBeterm msg;
429

430
	if (pgStatSock < 0)
431 432
		return;

433
	MemSet(&(msg.m_hdr), 0, sizeof(msg.m_hdr));
434 435
	msg.m_hdr.m_type = PGSTAT_MTYPE_BETERM;
	msg.m_hdr.m_procpid = pid;
436 437 438 439 440 441 442

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


/* ------------------------------------------------------------
 * Public functions used by backends follow
443
 *------------------------------------------------------------
444 445 446 447 448 449 450 451 452 453 454 455 456
 */


/* ----------
 * 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)
{
457
	PgStat_MsgBestart msg;
458

459
	if (pgStatSock < 0)
460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475
		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
476
pgstat_report_activity(const char *what)
477
{
478 479
	PgStat_MsgActivity msg;
	int			len;
480

481
	if (!pgstat_collect_querystring || pgStatSock < 0)
482 483 484
		return;

	len = strlen(what);
485 486
	len = pg_mbcliplen((const unsigned char *) what, len,
					   PGSTAT_ACTIVITY_SIZE - 1);
487

488 489
	memcpy(msg.m_what, what, len);
	msg.m_what[len] = '\0';
490
	len += offsetof(PgStat_MsgActivity, m_what) +1;
491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506

	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)
{
507 508 509
	int			i;
	int			n;
	int			len;
510

511
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
512
		!pgstat_collect_blocklevel)
513 514
		return;

515 516 517 518
	if (pgStatSock < 0)
		return;

	/*
519 520
	 * For each message buffer used during the last query set the header
	 * fields and send it out.
521 522 523 524
	 */
	for (i = 0; i < pgStatTabstatUsed; i++)
	{
		n = pgStatTabstatMessages[i]->m_nentries;
525 526
		len = offsetof(PgStat_MsgTabstat, m_entry[0]) +
			n * sizeof(PgStat_TableEntry);
527

528
		pgStatTabstatMessages[i]->m_xact_commit = pgStatXactCommit;
529
		pgStatTabstatMessages[i]->m_xact_rollback = pgStatXactRollback;
530
		pgStatXactCommit = 0;
531 532
		pgStatXactRollback = 0;

533 534
		pgstat_setheader(&pgStatTabstatMessages[i]->m_hdr,
						 PGSTAT_MTYPE_TABSTAT);
535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550
		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)
{
551 552 553 554 555 556 557 558 559 560 561 562 563 564
	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;
565 566 567 568 569 570 571 572

	if (pgStatSock < 0)
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
573
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
574
	{
575
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
576
							  &pgStatBeTable, &pgStatNumBackends);
577 578 579 580 581 582
		pgStatDBHashXact = GetCurrentTransactionId();
	}

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

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

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
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

		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;
654
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
655 656

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
657 658
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
659 660 661 662
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
663 664
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
665
		}
666
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
667 668 669 670 671
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

	/*
672 673
	 * Search the database hash table for dead databases and tell the
	 * collector to drop them as well.
674 675
	 */
	hash_seq_init(&hstat, pgStatDBHash);
676
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
677
	{
678
		Oid			dbid = dbentry->databaseid;
679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698

		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.
	 */
699
	pfree((char *) dbidlist);
700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719

	/*
	 * 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)
{
720
	PgStat_MsgDropdb msg;
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740

	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)
{
741
	PgStat_MsgResetcounter msg;
742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762

	if (pgStatSock < 0)
		return;

	if (!superuser())
		elog(ERROR, "Only database superusers can reset statistic counters");

	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)
{
763
	PgStat_MsgDummy msg;
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784

	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)
{
785 786 787 788
	PgStat_TableEntry *useent = NULL;
	Oid			rel_id = rel->rd_id;
	int			mb;
	int			i;
789 790 791 792

	/*
	 * Initialize data not to count at all.
	 */
793 794 795 796
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
797

798
	if (pgStatSock < 0)
799 800 801 802 803 804 805 806 807 808 809 810
	{
		stats->no_stats = TRUE;
		return;
	}

	/*
	 * On the first of all calls initialize the message buffers.
	 */
	if (pgStatTabstatAlloc == 0)
	{
		pgStatTabstatAlloc = 4;
		pgStatTabstatMessages = (PgStat_MsgTabstat **)
811
			malloc(sizeof(PgStat_MsgTabstat *) * pgStatTabstatAlloc);
812 813
		if (pgStatTabstatMessages == NULL)
		{
814
			elog(LOG, "PGSTATBE: malloc() failed");
815 816 817 818 819
			return;
		}
		for (i = 0; i < pgStatTabstatAlloc; i++)
		{
			pgStatTabstatMessages[i] = (PgStat_MsgTabstat *)
820
				malloc(sizeof(PgStat_MsgTabstat));
821 822
			if (pgStatTabstatMessages[i] == NULL)
			{
823
				elog(LOG, "PGSTATBE: malloc() failed");
824 825 826 827 828 829 830 831 832 833 834 835 836 837
				return;
			}
		}
	}

	/*
	 * Lookup the so far used table slots for this relation.
	 */
	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)
			{
838
				stats->tabentry = (void *) &(pgStatTabstatMessages[mb]->m_entry[i]);
839 840 841 842 843 844
				return;
			}
		}

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

846 847 848 849 850 851 852 853
		/*
		 * 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];
		memset(useent, 0, sizeof(PgStat_TableEntry));
		useent->t_id = rel_id;
854
		stats->tabentry = (void *) useent;
855 856 857 858 859 860 861 862 863 864
		return;
	}

	/*
	 * If we ran out of message buffers, we just allocate more.
	 */
	if (pgStatTabstatUsed >= pgStatTabstatAlloc)
	{
		pgStatTabstatAlloc += 4;
		pgStatTabstatMessages = (PgStat_MsgTabstat **)
865
			realloc(pgStatTabstatMessages,
866 867 868 869
					sizeof(PgStat_MsgTabstat *) * pgStatTabstatAlloc);
		if (pgStatTabstatMessages == NULL)
		{
			pgStatTabstatAlloc -= 4;
870
			elog(LOG, "PGSTATBE: malloc() failed");
871 872 873 874 875
			return;
		}
		for (i = pgStatTabstatUsed; i < pgStatTabstatAlloc; i++)
		{
			pgStatTabstatMessages[i] = (PgStat_MsgTabstat *)
876
				malloc(sizeof(PgStat_MsgTabstat));
877 878 879
			if (pgStatTabstatMessages[i] == NULL)
			{
				pgStatTabstatAlloc -= 4;
880
				elog(LOG, "PGSTATBE: malloc() failed");
881 882 883 884 885 886 887 888 889 890 891 892 893
				return;
			}
		}
	}

	/*
	 * Use the first entry of the next message buffer.
	 */
	mb = pgStatTabstatUsed++;
	pgStatTabstatMessages[mb]->m_nentries = 1;
	useent = &pgStatTabstatMessages[mb]->m_entry[0];
	memset(useent, 0, sizeof(PgStat_TableEntry));
	useent->t_id = rel_id;
894
	stats->tabentry = (void *) useent;
895 896 897 898 899 900 901 902 903 904 905 906 907
	return;
}


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
908
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
909
		!pgstat_collect_blocklevel)
910 911
		return;

912 913 914
	pgStatXactCommit++;

	/*
915 916 917
	 * 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.
918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938
	 */
	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)
{
939
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
940
		!pgstat_collect_blocklevel)
941 942
		return;

943 944 945
	pgStatXactRollback++;

	/*
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 970 971 972
	 */
	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)
{
973
	PgStat_StatDBEntry *dbentry;
974 975 976

	/*
	 * If not done for this transaction, read the statistics collector
977 978
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
979
	 */
980
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
981
	{
982
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
983
							  &pgStatBeTable, &pgStatNumBackends);
984 985 986 987 988 989
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup the requested database
	 */
990 991
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &dbid,
992 993
												 HASH_FIND, NULL);
	if (dbentry == NULL)
994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011
		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)
{
1012 1013
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
1014 1015 1016

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

	/*
	 * Lookup our database.
	 */
1030 1031
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
1032 1033
												 HASH_FIND, NULL);
	if (dbentry == NULL)
1034 1035 1036 1037 1038 1039 1040
		return NULL;

	/*
	 * Now inside the DB's table hash table lookup the requested one.
	 */
	if (dbentry->tables == NULL)
		return NULL;
1041 1042
	tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
												   (void *) &relid,
1043 1044
												   HASH_FIND, NULL);
	if (tabentry == NULL)
1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
		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)
{
1063
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1064
	{
1065
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1066
							  &pgStatBeTable, &pgStatNumBackends);
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086
		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)
{
1087
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1088
	{
1089
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1090
							  &pgStatBeTable, &pgStatNumBackends);
1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113
		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)
{
1114 1115 1116 1117 1118
	hdr->m_type = mtype;
	hdr->m_backendid = MyBackendId;
	hdr->m_procpid = MyProcPid;
	hdr->m_databaseid = MyDatabaseId;
	hdr->m_userid = GetSessionUserId();
1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133
}


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

1134
	((PgStat_MsgHdr *) msg)->m_size = len;
1135

1136 1137
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1138 1139 1140 1141 1142
}


/* ------------------------------------------------------------
 * Local functions implementing the statistics collector itself follow
1143
 *------------------------------------------------------------
1144 1145 1146 1147 1148 1149
 */


/* ----------
 * pgstat_main() -
 *
1150 1151
 *	Start up the statistics collector itself.  This is the body of the
 *	postmaster child process.
1152 1153 1154
 * ----------
 */
static void
1155
pgstat_main(void)
1156 1157
{
	PgStat_Msg	msg;
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171
	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.
1172
	 */
1173
	closesocket(pgStatPmPipe[1]);
1174
	pgStatPmPipe[1] = -1;
1175 1176

	/*
1177 1178
	 * Ignore all signals usually bound to some action in the postmaster,
	 * except for SIGCHLD --- see pgstat_recvbuffer.
1179
	 */
1180 1181 1182 1183 1184 1185 1186 1187
	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);
1188
	pqsignal(SIGCHLD, pgstat_die);
1189 1190 1191 1192
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
1193 1194

	/*
1195 1196
	 * Start a buffering process to read from the socket, so we have a
	 * little more time to process incoming messages.
1197 1198
	 *
	 * NOTE: the process structure is: postmaster is parent of buffer process
1199
	 * is parent of collector process.	This way, the buffer can detect
1200
	 * collector failure via SIGCHLD, whereas otherwise it wouldn't notice
1201 1202 1203 1204
	 * 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.
1205 1206 1207
	 */
	if (pipe(pgStatPipe) < 0)
	{
1208
		elog(LOG, "PGSTAT: pipe() failed: %m");
1209 1210 1211
		exit(1);
	}

1212
	switch (fork())
1213
	{
1214
		case -1:
1215
			elog(LOG, "PGSTAT: fork() failed: %m");
1216
			exit(1);
1217

1218
		case 0:
1219
			/* child becomes collector process */
1220 1221
			closesocket(pgStatPipe[1]);
			closesocket(pgStatSock);
1222
			break;
1223 1224 1225

		default:
			/* parent becomes buffer process */
1226
			closesocket(pgStatPipe[0]);
1227
			pgstat_recvbuffer();
1228
			exit(0);
1229 1230
	}

1231
	/*
1232 1233
	 * In the child we can have default SIGCHLD handling (in case we want
	 * to call system() here...)
1234 1235 1236
	 */
	pqsignal(SIGCHLD, SIG_DFL);

1237 1238
	MyProcPid = getpid();		/* reset MyProcPid */

1239 1240 1241
	/*
	 * Identify myself via ps
	 */
1242
	init_ps_display("stats collector process", "", "");
1243 1244 1245 1246 1247 1248 1249 1250
	set_ps_display("");

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

1251
	/*
1252 1253
	 * Read in an existing statistics stats file or initialize the stats
	 * to zero.
1254 1255 1256 1257 1258 1259 1260 1261
	 */
	pgStatRunningInCollector = TRUE;
	pgstat_read_statsfile(&pgStatDBHash, InvalidOid, NULL, NULL);

	/*
	 * Create the dead backend hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
1262
	hash_ctl.keysize = sizeof(int);
1263
	hash_ctl.entrysize = sizeof(PgStat_StatBeDead);
1264
	hash_ctl.hash = tag_hash;
1265 1266
	pgStatBeDead = hash_create("Dead Backends", PGSTAT_BE_HASH_SIZE,
							   &hash_ctl, HASH_ELEM | HASH_FUNCTION);
1267 1268
	if (pgStatBeDead == NULL)
	{
1269
		elog(LOG, "PGSTAT: Creation of dead backend hash table failed");
1270 1271 1272 1273 1274 1275
		exit(1);
	}

	/*
	 * Create the known backends table
	 */
1276 1277
	pgStatBeTable = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * MaxBackends);
1278 1279
	if (pgStatBeTable == NULL)
	{
1280
		elog(LOG, "PGSTAT: Allocation of backend table failed");
1281 1282 1283 1284
		exit(1);
	}
	memset(pgStatBeTable, 0, sizeof(PgStat_StatBeEntry) * MaxBackends);

1285 1286
	readPipe = pgStatPipe[0];

1287
	/*
1288 1289
	 * Process incoming messages and handle all the reporting stuff until
	 * there are no more messages.
1290 1291 1292 1293
	 */
	for (;;)
	{
		/*
1294 1295 1296
		 * 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.
1297 1298 1299
		 */
		if (need_statwrite)
		{
1300 1301 1302 1303 1304 1305 1306
			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))
1307
			{
1308
				timeout.tv_sec = 0;
1309 1310
				timeout.tv_usec = 0;
			}
1311 1312 1313 1314 1315 1316 1317 1318 1319 1320
			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;
				}
			}
1321 1322 1323 1324 1325 1326
		}

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1327 1328
		FD_SET(readPipe, &rfds);
		FD_SET(pmPipe, &rfds);
1329

1330 1331
		if (readPipe > pmPipe)
			maxfd = readPipe;
1332
		else
1333
			maxfd = pmPipe;
1334 1335 1336 1337

		/*
		 * Now wait for something to do.
		 */
1338
		nready = select(maxfd + 1, &rfds, NULL, NULL,
1339 1340 1341
						(need_statwrite) ? &timeout : NULL);
		if (nready < 0)
		{
1342 1343
			if (errno == EINTR)
				continue;
1344
			elog(LOG, "PGSTAT: select() failed: %m");
1345 1346 1347 1348
			exit(1);
		}

		/*
1349 1350
		 * If there are no descriptors ready, our timeout for writing the
		 * stats file happened.
1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362
		 */
		if (nready == 0)
		{
			pgstat_write_statsfile();
			need_statwrite = FALSE;

			continue;
		}

		/*
		 * Check if there is a new statistics message to collect.
		 */
1363
		if (FD_ISSET(readPipe, &rfds))
1364 1365
		{
			/*
1366 1367 1368 1369 1370
			 * 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.
1371
			 */
1372 1373
			int			nread = 0;
			int			targetlen = sizeof(PgStat_MsgHdr);		/* initial */
1374

1375
			while (nread < targetlen)
1376
			{
1377 1378 1379
				len = read(readPipe,
						   ((char *) &msg) + nread,
						   targetlen - nread);
1380 1381
				if (len < 0)
				{
1382 1383
					if (errno == EINTR)
						continue;
1384
					elog(LOG, "PGSTAT: read() failed: %m");
1385 1386
					exit(1);
				}
1387 1388 1389 1390
				if (len == 0)	/* EOF on the pipe! */
					break;
				nread += len;
				if (nread == sizeof(PgStat_MsgHdr))
1391
				{
1392 1393 1394 1395 1396 1397
					/* we have the header, compute actual msg length */
					targetlen = msg.msg_hdr.m_size;
					if (targetlen < (int) sizeof(PgStat_MsgHdr) ||
						targetlen > (int) sizeof(msg))
					{
						/*
1398 1399 1400
						 * Bogus message length implies that we got out of
						 * sync with the buffer process somehow. Abort so
						 * that we can restart both processes.
1401
						 */
1402
						elog(LOG, "PGSTAT: bogus message length");
1403 1404
						exit(1);
					}
1405 1406
				}
			}
1407

1408 1409 1410 1411 1412 1413
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
			if (len == 0)
				break;
1414 1415

			/*
1416 1417
			 * Distribute the message to the specific function handling
			 * it.
1418 1419 1420 1421 1422 1423 1424
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1425
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1426 1427 1428
					break;

				case PGSTAT_MTYPE_BETERM:
1429
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1430 1431 1432
					break;

				case PGSTAT_MTYPE_TABSTAT:
1433
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1434 1435 1436
					break;

				case PGSTAT_MTYPE_TABPURGE:
1437
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1438 1439 1440
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1441
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1442 1443 1444
					break;

				case PGSTAT_MTYPE_DROPDB:
1445
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1446 1447 1448
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1449
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1450
											 nread);
1451 1452 1453 1454 1455 1456 1457
					break;

				default:
					break;
			}

			/*
1458
			 * Globally count messages.
1459 1460
			 */
			pgStatNumMessages++;
1461 1462

			/*
1463 1464
			 * If this is the first message after we wrote the stats file
			 * the last time, setup the timeout that it'd be written.
1465 1466 1467 1468 1469
			 */
			if (!need_statwrite)
			{
				gettimeofday(&next_statwrite, NULL);
				next_statwrite.tv_usec += ((PGSTAT_STAT_INTERVAL) * 1000);
1470
				next_statwrite.tv_sec += (next_statwrite.tv_usec / 1000000);
1471 1472 1473
				next_statwrite.tv_usec %= 1000000;
				need_statwrite = TRUE;
			}
1474 1475 1476
		}

		/*
1477
		 * Note that we do NOT check for postmaster exit inside the loop;
1478 1479 1480
		 * 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.
1481 1482
		 */
	}
1483 1484

	/*
1485 1486 1487 1488 1489 1490 1491 1492 1493
	 * 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.
1494 1495 1496
	 */
	if (FD_ISSET(pmPipe, &rfds))
		pgstat_write_statsfile();
1497 1498 1499 1500 1501 1502
}


/* ----------
 * pgstat_recvbuffer() -
 *
1503
 *	This is the body of the separate buffering process. Its only
1504
 *	purpose is to receive messages from the UDP socket as fast as
1505 1506
 *	possible and forward them over a pipe into the collector itself.
 *	If the collector is slow to absorb messages, they are buffered here.
1507 1508 1509
 * ----------
 */
static void
1510
pgstat_recvbuffer(void)
1511
{
1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525
	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 已提交
1526
	struct sockaddr_storage	fromaddr;
1527 1528
	int			fromlen;
	bool		overflow = false;
1529

1530 1531 1532
	/*
	 * Identify myself via ps
	 */
1533
	init_ps_display("stats buffer process", "", "");
1534 1535
	set_ps_display("");

1536
	/*
1537 1538 1539 1540 1541
	 * 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).
1542 1543 1544 1545 1546 1547 1548 1549
	 */
	pqsignal(SIGPIPE, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

	/*
	 * Set the write pipe to nonblock mode, so that we cannot block when
	 * the collector falls behind.
	 */
1550
	if (FCNTL_NONBLOCK(writePipe) < 0)
1551
	{
1552
		elog(LOG, "PGSTATBUFF: fcntl() failed: %m");
1553 1554 1555
		exit(1);
	}

1556 1557 1558
	/*
	 * Allocate the message buffer
	 */
1559
	msgbuffer = (char *) malloc(PGSTAT_RECVBUFFERSZ);
1560 1561
	if (msgbuffer == NULL)
	{
1562
		elog(LOG, "PGSTATBUFF: malloc() failed");
1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575
		exit(1);
	}

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

		/*
1576 1577
		 * As long as we have buffer space we add the socket to the read
		 * descriptor set.
1578
		 */
1579
		if (msg_have <= (int) (PGSTAT_RECVBUFFERSZ - sizeof(PgStat_Msg)))
1580 1581 1582
		{
			FD_SET(pgStatSock, &rfds);
			maxfd = pgStatSock;
1583
			overflow = false;
1584 1585 1586
		}
		else
		{
1587
			if (!overflow)
1588
			{
1589
				elog(LOG, "PGSTATBUFF: Warning - receive buffer full");
1590
				overflow = true;
1591 1592 1593 1594
			}
		}

		/*
1595 1596 1597
		 * 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.
1598 1599 1600
		 */
		if (msg_have > 0)
		{
1601 1602 1603
			FD_SET(writePipe, &wfds);
			if (writePipe > maxfd)
				maxfd = writePipe;
1604 1605 1606
		}
		else
		{
1607 1608 1609
			FD_SET(pmPipe, &rfds);
			if (pmPipe > maxfd)
				maxfd = pmPipe;
1610 1611 1612 1613 1614 1615 1616 1617
		}

		/*
		 * Wait for some work to do.
		 */
		nready = select(maxfd + 1, &rfds, &wfds, NULL, NULL);
		if (nready < 0)
		{
1618 1619
			if (errno == EINTR)
				continue;
1620
			elog(LOG, "PGSTATBUFF: select() failed: %m");
1621 1622 1623 1624 1625 1626 1627 1628 1629 1630
			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 已提交
1631 1632 1633
			len = recvfrom(pgStatSock, (char *) &input_buffer,
				sizeof(PgStat_Msg), 0,
				(struct sockaddr *) &fromaddr, &fromlen);
1634 1635
			if (len < 0)
			{
1636
				elog(LOG, "PGSTATBUFF: recvfrom() failed: %m");
1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648
				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
			 */
1649
			if (input_buffer.msg_hdr.m_size != len)
1650 1651 1652 1653 1654
				continue;

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

1662
			/*
1663 1664
			 * O.K. - we accept this message.  Copy it to the circular
			 * msgbuffer.
1665
			 */
1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682
			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;
			}
1683 1684 1685
		}

		/*
1686 1687 1688 1689
		 * 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
1690 1691 1692 1693 1694 1695 1696
		 * 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...
1697
		 */
1698
		if (FD_ISSET(writePipe, &wfds))
1699
		{
1700 1701 1702 1703 1704
			xfr = PGSTAT_RECVBUFFERSZ - msg_send;
			if (xfr > msg_have)
				xfr = msg_have;
			Assert(xfr > 0);
			len = write(writePipe, msgbuffer + msg_send, xfr);
1705 1706
			if (len < 0)
			{
1707 1708
				if (errno == EINTR || errno == EAGAIN)
					continue;	/* not enough space in pipe */
1709
				elog(LOG, "PGSTATBUFF: write() failed: %m");
1710 1711
				exit(1);
			}
1712 1713
			/* NB: len < xfr is okay */
			msg_send += len;
1714 1715
			if (msg_send == PGSTAT_RECVBUFFERSZ)
				msg_send = 0;
1716
			msg_have -= len;
1717 1718 1719 1720 1721 1722
		}

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1723
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1724 1725 1726
			continue;

		/*
1727 1728 1729
		 * 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.
1730
		 */
1731
		if (FD_ISSET(pmPipe, &rfds))
1732 1733 1734 1735
			exit(0);
	}
}

1736 1737 1738 1739 1740 1741
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

1742 1743 1744 1745

/* ----------
 * pgstat_add_backend() -
 *
1746
 *	Support function to keep our backend list up to date.
1747 1748 1749 1750 1751
 * ----------
 */
static int
pgstat_add_backend(PgStat_MsgHdr *msg)
{
1752 1753 1754 1755
	PgStat_StatDBEntry *dbentry;
	PgStat_StatBeEntry *beentry;
	PgStat_StatBeDead *deadbe;
	bool		found;
1756 1757 1758 1759 1760 1761

	/*
	 * Check that the backend ID is valid
	 */
	if (msg->m_backendid < 1 || msg->m_backendid > MaxBackends)
	{
1762
		elog(LOG, "PGSTAT: Invalid backend ID %d", msg->m_backendid);
1763 1764 1765 1766 1767 1768 1769 1770 1771 1772
		return -1;
	}

	/*
	 * Get the slot for this backendid.
	 */
	beentry = &pgStatBeTable[msg->m_backendid - 1];
	if (beentry->databaseid != InvalidOid)
	{
		/*
1773 1774
		 * If the slot contains the PID of this backend, everything is
		 * fine and we got nothing to do.
1775 1776 1777 1778 1779 1780
		 */
		if (beentry->procpid == msg->m_procpid)
			return 0;
	}

	/*
1781 1782 1783 1784 1785
	 * 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.
1786 1787 1788
	 *
	 * If the backend is known to be dead, we ignore this add.
	 */
1789 1790
	deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
											   (void *) &(msg->m_procpid),
1791 1792
											   HASH_FIND, NULL);
	if (deadbe)
1793 1794 1795
		return 1;

	/*
1796 1797
	 * Backend isn't known to be dead. If it's slot is currently used, we
	 * have to kick out the old backend.
1798 1799 1800 1801 1802 1803 1804 1805
	 */
	if (beentry->databaseid != InvalidOid)
		pgstat_sub_backend(beentry->procpid);

	/*
	 * Put this new backend into the slot.
	 */
	beentry->databaseid = msg->m_databaseid;
1806 1807
	beentry->procpid = msg->m_procpid;
	beentry->userid = msg->m_userid;
1808 1809
	beentry->activity_start_sec = 0;
	beentry->activity_start_usec = 0;
1810
	MemSet(beentry->activity, 0, PGSTAT_ACTIVITY_SIZE);
1811 1812 1813 1814

	/*
	 * Lookup or create the database entry for this backends DB.
	 */
1815
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
1816
										   (void *) &(msg->m_databaseid),
1817
												 HASH_ENTER, &found);
1818
	if (dbentry == NULL)
1819
	{
1820
		elog(LOG, "PGSTAT: DB hash table out of memory - abort");
1821 1822 1823 1824 1825 1826 1827 1828
		exit(1);
	}

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

1831 1832 1833 1834 1835 1836 1837
		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;
1838 1839

		memset(&hash_ctl, 0, sizeof(hash_ctl));
1840
		hash_ctl.keysize = sizeof(Oid);
1841
		hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
1842
		hash_ctl.hash = tag_hash;
1843 1844 1845 1846
		dbentry->tables = hash_create("Per-database table",
									  PGSTAT_TAB_HASH_SIZE,
									  &hash_ctl,
									  HASH_ELEM | HASH_FUNCTION);
1847 1848
		if (dbentry->tables == NULL)
		{
1849
			elog(LOG, "PGSTAT: failed to initialize hash table for "
B
Bruce Momjian 已提交
1850
				 "new database entry");
1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872
			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)
{
1873 1874 1875
	int			i;
	PgStat_StatBeDead *deadbe;
	bool		found;
1876 1877

	/*
1878 1879
	 * Search in the known-backends table for the slot containing this
	 * PID.
1880 1881 1882 1883 1884 1885 1886 1887
	 */
	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.
1888 1889 1890 1891 1892 1893 1894
			 * 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).
1895
			 */
1896 1897
			deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
													   (void *) &procpid,
1898
													 HASH_ENTER, &found);
1899 1900
			if (deadbe == NULL)
			{
1901
				elog(LOG, "PGSTAT: dead backend hash table out of memory");
1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918
				exit(1);
			}
			if (!found)
			{
				deadbe->backendid = i + 1;
				deadbe->destroy = PGSTAT_DESTROY_COUNT;
			}

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

	/*
1919 1920
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933
	 */
}


/* ----------
 * pgstat_write_statsfile() -
 *
 *	Tell the news.
 * ----------
 */
static void
pgstat_write_statsfile(void)
{
1934 1935 1936 1937 1938 1939 1940
	HASH_SEQ_STATUS hstat;
	HASH_SEQ_STATUS tstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatBeDead *deadbe;
	FILE	   *fpout;
	int			i;
1941 1942

	/*
1943
	 * Open the statistics temp file to write out the current values.
1944
	 */
P
Peter Eisentraut 已提交
1945
	fpout = fopen(pgStat_tmpfname, PG_BINARY_W);
1946 1947
	if (fpout == NULL)
	{
1948 1949
		elog(LOG, "PGSTAT: cannot open temp stats file %s: %m",
			 pgStat_tmpfname);
1950 1951 1952 1953 1954 1955 1956
		return;
	}

	/*
	 * Walk through the database table.
	 */
	hash_seq_init(&hstat, pgStatDBHash);
1957
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
1958 1959
	{
		/*
1960 1961
		 * If this database is marked destroyed, count down and do so if
		 * it reaches 0.
1962 1963 1964 1965 1966 1967 1968 1969
		 */
		if (dbentry->destroy > 0)
		{
			if (--(dbentry->destroy) == 0)
			{
				if (dbentry->tables != NULL)
					hash_destroy(dbentry->tables);

1970
				if (hash_search(pgStatDBHash,
1971 1972
								(void *) &(dbentry->databaseid),
								HASH_REMOVE, NULL) == NULL)
1973
				{
1974
					elog(LOG, "PGSTAT: database hash table corrupted "
B
Bruce Momjian 已提交
1975
						 "during cleanup - abort");
1976 1977 1978
					exit(1);
				}
			}
1979

1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995
			/*
			 * 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);
1996
		while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&tstat)) != NULL)
1997 1998
		{
			/*
1999 2000
			 * If table entry marked for destruction, same as above for
			 * the database entry.
2001 2002 2003 2004 2005
			 */
			if (tabentry->destroy > 0)
			{
				if (--(tabentry->destroy) == 0)
				{
2006
					if (hash_search(dbentry->tables,
2007
									(void *) &(tabentry->tableid),
2008
									HASH_REMOVE, NULL) == NULL)
2009
					{
2010
						elog(LOG, "PGSTAT: tables hash table for "
B
Bruce Momjian 已提交
2011 2012 2013
							 "database %d corrupted during "
							 "cleanup - abort",
							 dbentry->databaseid);
2014 2015 2016 2017 2018 2019 2020
						exit(1);
					}
				}
				continue;
			}

			/*
2021 2022
			 * At least we think this is still a life table. Print it's
			 * access stats.
2023 2024 2025 2026
			 */
			fputc('T', fpout);
			fwrite(tabentry, sizeof(PgStat_StatTabEntry), 1, fpout);
		}
2027

2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050
		/*
		 * 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);
		}
	}

	/*
2051 2052
	 * No more output to be done. Close the temp file and replace the old
	 * pgstat.stat with it's content.
2053 2054 2055 2056
	 */
	fputc('E', fpout);
	if (fclose(fpout) < 0)
	{
2057 2058
		elog(LOG, "PGSTAT: Error closing temp stats file %s: %m",
			 pgStat_tmpfname);
2059 2060 2061 2062 2063
	}
	else
	{
		if (rename(pgStat_tmpfname, pgStat_fname) < 0)
		{
2064 2065
			elog(LOG, "PGSTAT: Cannot rename temp stats file %s: %m",
				 pgStat_fname);
2066 2067 2068 2069 2070 2071 2072
		}
	}

	/*
	 * Clear out the dead backends table
	 */
	hash_seq_init(&hstat, pgStatBeDead);
2073
	while ((deadbe = (PgStat_StatBeDead *) hash_seq_search(&hstat)) != NULL)
2074 2075
	{
		/*
2076 2077
		 * Count down the destroy delay and remove entries where it
		 * reaches 0.
2078 2079 2080
		 */
		if (--(deadbe->destroy) <= 0)
		{
2081 2082 2083
			if (hash_search(pgStatBeDead,
							(void *) &(deadbe->procpid),
							HASH_REMOVE, NULL) == NULL)
2084
			{
2085
				elog(LOG, "PGSTAT: dead backend hash table corrupted "
B
Bruce Momjian 已提交
2086
					 "during cleanup - abort");
2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102
				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
2103 2104
pgstat_read_statsfile(HTAB **dbhash, Oid onlydb,
					  PgStat_StatBeEntry **betab, int *numbackends)
2105
{
2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123
	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!
2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139
	 */
	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));
2140
	hash_ctl.keysize = sizeof(Oid);
2141
	hash_ctl.entrysize = sizeof(PgStat_StatDBEntry);
2142 2143 2144 2145
	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);
2146
	if (*dbhash == NULL)
2147 2148 2149
	{
		if (pgStatRunningInCollector)
		{
2150
			elog(LOG, "PGSTAT: Creation of DB hash table failed");
2151 2152
			exit(1);
		}
2153
		/* in backend, can do normal error */
2154
		elog(ERROR, "PGSTAT: Creation of DB hash table failed");
2155 2156 2157
	}

	/*
2158 2159
	 * Initialize the number of known backends to zero, just in case we do
	 * a silent error return below.
2160 2161 2162 2163 2164 2165 2166 2167
	 */
	if (numbackends != NULL)
		*numbackends = 0;
	if (betab != NULL)
		*betab = NULL;

	/*
	 * Try to open the status file. If it doesn't exist, the backends
2168 2169
	 * simply return zero for anything and the collector simply starts
	 * from scratch with empty counters.
2170
	 */
P
Peter Eisentraut 已提交
2171
	if ((fpin = fopen(pgStat_fname, PG_BINARY_R)) == NULL)
2172 2173 2174
		return;

	/*
2175 2176
	 * We found an existing collector stats file. Read it and put all the
	 * hashtable entries into place.
2177 2178 2179 2180 2181
	 */
	for (;;)
	{
		switch (fgetc(fpin))
		{
2182 2183 2184 2185 2186
				/*
				 * 'D'	A PgStat_StatDBEntry struct describing a database
				 * follows. Subsequently, zero to many 'T' entries will
				 * follow until a 'd' is encountered.
				 */
2187 2188 2189 2190 2191
			case 'D':
				if (fread(&dbbuf, 1, sizeof(dbbuf), fpin) != sizeof(dbbuf))
				{
					if (pgStatRunningInCollector)
					{
2192
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2193 2194 2195 2196 2197
						fclose(fpin);
						return;
					}
					else
					{
2198
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2199 2200 2201 2202 2203 2204 2205 2206
						fclose(fpin);
						return;
					}
				}

				/*
				 * Add to the DB hash
				 */
2207
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
2208 2209
											  (void *) &dbbuf.databaseid,
													 HASH_ENTER, &found);
2210 2211 2212 2213
				if (dbentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2214
						elog(LOG, "PGSTAT: DB hash table out of memory");
2215 2216 2217 2218 2219
						exit(1);
					}
					else
					{
						fclose(fpin);
2220
						elog(ERROR, "PGSTAT: DB hash table out of memory");
2221 2222 2223 2224 2225 2226
					}
				}
				if (found)
				{
					if (pgStatRunningInCollector)
					{
2227
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2228 2229 2230 2231 2232
						fclose(fpin);
						return;
					}
					else
					{
2233
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2234 2235 2236 2237 2238 2239
						fclose(fpin);
						return;
					}
				}

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2240 2241 2242
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2243 2244 2245 2246 2247 2248 2249 2250 2251

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


				memset(&hash_ctl, 0, sizeof(hash_ctl));
2252
				hash_ctl.keysize = sizeof(Oid);
2253
				hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2254 2255
				hash_ctl.hash = tag_hash;
				hash_ctl.hcxt = use_mcxt;
2256 2257 2258
				dbentry->tables = hash_create("Per-database table",
											  PGSTAT_TAB_HASH_SIZE,
											  &hash_ctl,
2259
								 HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2260 2261 2262 2263
				if (dbentry->tables == NULL)
				{
					if (pgStatRunningInCollector)
					{
2264 2265
						elog(LOG, "PGSTAT: failed to initialize "
							 "hash table for new database entry");
2266 2267 2268 2269 2270 2271
						exit(1);
					}
					else
					{
						fclose(fpin);
						elog(ERROR, "PGSTAT: failed to initialize "
2272
							 "hash table for new database entry");
2273 2274 2275 2276 2277 2278 2279 2280 2281 2282
					}
				}

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

2283 2284 2285
				/*
				 * 'd'	End of this database.
				 */
2286 2287 2288 2289
			case 'd':
				tabhash = NULL;
				break;

2290 2291 2292
				/*
				 * 'T'	A PgStat_StatTabEntry follows.
				 */
2293 2294 2295 2296 2297
			case 'T':
				if (fread(&tabbuf, 1, sizeof(tabbuf), fpin) != sizeof(tabbuf))
				{
					if (pgStatRunningInCollector)
					{
2298
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2299 2300 2301 2302 2303
						fclose(fpin);
						return;
					}
					else
					{
2304
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315
						fclose(fpin);
						return;
					}
				}

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

2316
				tabentry = (PgStat_StatTabEntry *) hash_search(tabhash,
2317 2318
												(void *) &tabbuf.tableid,
													 HASH_ENTER, &found);
2319 2320 2321 2322
				if (tabentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2323
						elog(LOG, "PGSTAT: Tab hash table out of memory");
2324 2325 2326 2327 2328
						exit(1);
					}
					else
					{
						fclose(fpin);
2329
						elog(ERROR, "PGSTAT: Tab hash table out of memory");
2330 2331 2332 2333 2334 2335 2336
					}
				}

				if (found)
				{
					if (pgStatRunningInCollector)
					{
2337
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2338 2339 2340 2341 2342
						fclose(fpin);
						return;
					}
					else
					{
2343
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2344 2345 2346 2347 2348 2349 2350 2351
						fclose(fpin);
						return;
					}
				}

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

2352 2353 2354
				/*
				 * 'M'	The maximum number of backends to expect follows.
				 */
2355 2356 2357 2358 2359 2360 2361
			case 'M':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (fread(&maxbackends, 1, sizeof(maxbackends), fpin) !=
2362
					sizeof(maxbackends))
2363 2364 2365
				{
					if (pgStatRunningInCollector)
					{
2366
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2367 2368 2369 2370 2371
						fclose(fpin);
						return;
					}
					else
					{
2372
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383
						fclose(fpin);
						return;
					}
				}
				if (maxbackends == 0)
				{
					fclose(fpin);
					return;
				}

				/*
2384 2385
				 * Allocate space (in TopTransactionContext too) for the
				 * backend table.
2386 2387
				 */
				if (use_mcxt == NULL)
2388 2389
					*betab = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2390
				else
2391 2392 2393
					*betab = (PgStat_StatBeEntry *) MemoryContextAlloc(
																use_mcxt,
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2394 2395
				break;

2396 2397 2398
				/*
				 * 'B'	A PgStat_StatBeEntry follows.
				 */
2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409
			case 'B':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (*betab == NULL)
				{
					fclose(fpin);
					return;
				}
2410

2411 2412 2413
				/*
				 * Read it directly into the table.
				 */
2414 2415 2416
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
2417 2418 2419
				{
					if (pgStatRunningInCollector)
					{
2420
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2421 2422 2423 2424 2425
						fclose(fpin);
						return;
					}
					else
					{
2426
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2427 2428 2429 2430 2431 2432 2433 2434
						fclose(fpin);
						return;
					}
				}

				/*
				 * Count backends per database here.
				 */
2435 2436 2437
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
						   (void *) &((*betab)[havebackends].databaseid),
														HASH_FIND, NULL);
2438
				if (dbentry)
2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450
					dbentry->n_backends++;

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

2451 2452 2453
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2454 2455 2456 2457 2458 2459 2460
			case 'E':
				fclose(fpin);
				return;

			default:
				if (pgStatRunningInCollector)
				{
2461
					elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2462 2463 2464 2465 2466
					fclose(fpin);
					return;
				}
				else
				{
B
Bruce Momjian 已提交
2467
					elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512
					fclose(fpin);
					return;
				}
		}
	}

	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)
{
2513 2514
	PgStat_StatBeEntry *entry;

2515
	/*
2516 2517 2518
	 * 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.
2519 2520 2521
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2522

2523 2524 2525 2526 2527 2528
	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);
2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540
}


/* ----------
 * pgstat_recv_tabstat() -
 *
 *	Count what the backend has done.
 * ----------
 */
static void
pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len)
{
2541 2542 2543 2544 2545
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2546 2547 2548 2549 2550 2551 2552 2553 2554 2555

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

	/*
	 * Lookup the database in the hashtable.
	 */
2556
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2557 2558
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2559
	if (!dbentry)
2560 2561 2562
		return;

	/*
2563 2564
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and not worth being counted.
2565 2566 2567 2568
	 */
	if (dbentry->destroy > 0)
		return;

2569 2570
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2571 2572 2573 2574 2575 2576

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2577
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2578 2579
											  (void *) &(tabmsg[i].t_id),
													 HASH_ENTER, &found);
2580 2581
		if (tabentry == NULL)
		{
2582
			elog(LOG, "PGSTAT: tables hash table out of memory for "
B
Bruce Momjian 已提交
2583
				 "database %d - abort", dbentry->databaseid);
2584 2585 2586 2587 2588 2589
			exit(1);
		}

		if (!found)
		{
			/*
2590 2591
			 * If it's a new table entry, initialize counters to the
			 * values we just got.
2592
			 */
2593 2594 2595 2596 2597 2598 2599 2600
			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;
2601 2602 2603 2604 2605 2606 2607 2608

			tabentry->destroy = 0;
		}
		else
		{
			/*
			 * Otherwise add the values to the existing entry.
			 */
2609 2610 2611 2612 2613 2614 2615 2616
			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;
2617 2618 2619 2620 2621
		}

		/*
		 * And add the block IO to the database entry.
		 */
2622 2623
		dbentry->n_blocks_fetched += tabmsg[i].t_blocks_fetched;
		dbentry->n_blocks_hit += tabmsg[i].t_blocks_hit;
2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636
	}
}


/* ----------
 * pgstat_recv_tabpurge() -
 *
 *	Arrange for dead table removal.
 * ----------
 */
static void
pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len)
{
2637 2638 2639
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
2640 2641 2642 2643 2644 2645 2646 2647 2648 2649

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

	/*
	 * Lookup the database in the hashtable.
	 */
2650
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2651 2652
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2653
	if (!dbentry)
2654 2655 2656
		return;

	/*
2657 2658
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and the tables will go away at DB destruction.
2659 2660 2661 2662 2663 2664 2665 2666 2667
	 */
	if (dbentry->destroy > 0)
		return;

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2668
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2669 2670
										   (void *) &(msg->m_tableid[i]),
													   HASH_FIND, NULL);
2671
		if (tabentry)
2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685
			tabentry->destroy = PGSTAT_DESTROY_COUNT;
	}
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2686
	PgStat_StatDBEntry *dbentry;
2687 2688 2689 2690 2691 2692 2693 2694 2695 2696

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

	/*
	 * Lookup the database in the hashtable.
	 */
2697
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2698 2699
										   (void *) &(msg->m_databaseid),
												 HASH_FIND, NULL);
2700
	if (!dbentry)
2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718
		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)
{
2719 2720
	HASHCTL		hash_ctl;
	PgStat_StatDBEntry *dbentry;
2721 2722 2723 2724 2725 2726 2727 2728 2729 2730

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

	/*
	 * Lookup the database in the hashtable.
	 */
2731
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2732 2733
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2734
	if (!dbentry)
2735 2736 2737 2738 2739 2740 2741 2742 2743
		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);

2744 2745 2746 2747 2748 2749 2750
	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;
2751 2752

	memset(&hash_ctl, 0, sizeof(hash_ctl));
2753
	hash_ctl.keysize = sizeof(Oid);
2754
	hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2755
	hash_ctl.hash = tag_hash;
2756 2757 2758 2759
	dbentry->tables = hash_create("Per-database table",
								  PGSTAT_TAB_HASH_SIZE,
								  &hash_ctl,
								  HASH_ELEM | HASH_FUNCTION);
2760 2761
	if (dbentry->tables == NULL)
	{
2762
		elog(LOG, "PGSTAT: failed to reinitialize hash table for "
B
Bruce Momjian 已提交
2763
			 "database entry");
2764 2765 2766
		exit(1);
	}
}