pgstat.c 61.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/* ----------
 * 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.
 *			  Not to be done before 7.2 - requires catalog change and
 *			  thus an initdb and we might want to provide this as a
 *			  patch for 7.1.
 *
 *	Copyright (c) 2001, PostgreSQL Global Development Group
 *
19
 *	$Header: /cvsroot/pgsql/src/backend/postmaster/pgstat.c,v 1.28 2002/09/05 18:26:18 petere Exp $
20 21
 * ----------
 */
P
Peter Eisentraut 已提交
22 23
#include "postgres.h"

24 25 26 27 28 29 30 31 32 33
#include <unistd.h>
#include <fcntl.h>
#include <sys/param.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <signal.h>

34 35 36 37 38 39
#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"
40
#include "mb/pg_wchar.h"
41 42 43
#include "miscadmin.h"
#include "utils/memutils.h"
#include "storage/backendid.h"
44
#include "storage/ipc.h"
45 46
#include "utils/rel.h"
#include "utils/hsearch.h"
47
#include "utils/ps_status.h"
48 49 50 51 52 53
#include "utils/syscache.h"

#include "pgstat.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

/* ----------
 * Local data
 * ----------
 */
67 68 69 70
static int	pgStatSock = -1;
static int	pgStatPipe[2];
static struct sockaddr_in pgStatAddr;
static int	pgStatPmPipe[2] = {-1, -1};
71

72 73
static int	pgStatRunning = 0;
static int	pgStatPid;
74

75
static long pgStatNumMessages = 0;
76

77 78 79 80 81 82
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;
83 84


85 86 87 88 89
static TransactionId pgStatDBHashXact = InvalidTransactionId;
static HTAB *pgStatDBHash = NULL;
static HTAB *pgStatBeDead = NULL;
static PgStat_StatBeEntry *pgStatBeTable = NULL;
static int	pgStatNumBackends = 0;
90

91 92
static char pgStat_tmpfname[MAXPGPATH];
static char pgStat_fname[MAXPGPATH];
93 94 95 96 97 98


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


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


/* ----------
 * pgstat_init() -
 *
 *	Called from postmaster at startup. Create the resources required
 *	by the statistics collector process.
134 135 136 137
 *
 *	NOTE: failure exit from this routine causes the postmaster to abort.
 *	This is unfriendly and should not be done except in dire straits.
 *	Better to let the postmaster start with stats collection disabled.
138 139 140 141 142 143 144
 * ----------
 */
int
pgstat_init(void)
{
	int			alen;

145 146 147 148
	/*
	 * Force start of collector daemon if something to collect
	 */
	if (pgstat_collect_querystring || pgstat_collect_tuplelevel ||
149
		pgstat_collect_blocklevel)
150 151
		pgstat_collect_startcollector = true;

152 153 154
	/*
	 * Initialize the filenames for the status reports.
	 */
155 156 157 158
	snprintf(pgStat_tmpfname, MAXPGPATH,
			 PGSTAT_STAT_TMPFILE, DataDir, getpid());
	snprintf(pgStat_fname, MAXPGPATH,
			 PGSTAT_STAT_FILENAME, DataDir);
159

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

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

173
	/*
174
	 * Create the UDP socket for sending and receiving statistic messages
175 176 177
	 */
	if ((pgStatSock = socket(PF_INET, SOCK_DGRAM, 0)) < 0)
	{
178 179
		elog(LOG, "PGSTAT: socket() failed: %m");
		goto startup_failed;
180 181 182
	}

	/*
183 184
	 * Bind it to a kernel assigned port on localhost and get the assigned
	 * port via getsockname().
185
	 */
186 187
	pgStatAddr.sin_family = AF_INET;
	pgStatAddr.sin_port = htons(0);
188 189
	inet_aton("127.0.0.1", &(pgStatAddr.sin_addr));
	alen = sizeof(pgStatAddr);
190
	if (bind(pgStatSock, (struct sockaddr *) & pgStatAddr, alen) < 0)
191
	{
192 193
		elog(LOG, "PGSTAT: bind(127.0.0.1) failed: %m");
		goto startup_failed;
194
	}
195
	if (getsockname(pgStatSock, (struct sockaddr *) & pgStatAddr, &alen) < 0)
196
	{
197 198
		elog(LOG, "PGSTAT: getsockname() failed: %m");
		goto startup_failed;
199 200 201
	}

	/*
202 203 204 205
	 * 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.
206
	 */
207
	if (connect(pgStatSock, (struct sockaddr *) & pgStatAddr, alen) < 0)
208
	{
209 210
		elog(LOG, "PGSTAT: connect() failed: %m");
		goto startup_failed;
211 212 213 214 215 216 217
	}

	/*
	 * 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.
218 219 220
	 */
	if (fcntl(pgStatSock, F_SETFL, O_NONBLOCK) < 0)
	{
221 222
		elog(LOG, "PGSTAT: fcntl() failed: %m");
		goto startup_failed;
223 224 225 226 227 228 229
	}

	/*
	 * Create the pipe that controls the statistics collector shutdown
	 */
	if (pipe(pgStatPmPipe) < 0)
	{
230 231
		elog(LOG, "PGSTAT: pipe() failed: %m");
		goto startup_failed;
232 233
	}

234 235 236 237 238 239 240 241 242 243 244 245
	return 0;

startup_failed:
	if (pgStatSock >= 0)
		close(pgStatSock);
	pgStatSock = -1;

	/* Adjust GUC variables to suppress useless activity */
	pgstat_collect_querystring = false;
	pgstat_collect_tuplelevel = false;
	pgstat_collect_blocklevel = false;

246 247 248 249 250 251 252 253
	return 0;
}


/* ----------
 * pgstat_start() -
 *
 *	Called from postmaster at startup or after an existing collector
254
 *	died.  Fire up a fresh statistics collector.
255 256
 *
 *	NOTE: failure exit from this routine causes the postmaster to abort.
257 258 259
 * ----------
 */
int
260
pgstat_start(void)
261
{
262 263 264 265 266 267
	/*
	 * Do nothing if no collector needed
	 */
	if (!pgstat_collect_startcollector)
		return 0;

268
	/*
269
	 * Check that the socket is there, else pgstat_init failed
270 271 272
	 */
	if (pgStatSock < 0)
	{
273
		elog(LOG, "PGSTAT: statistics collector startup skipped");
274 275 276 277
		return 0;
	}

	/*
278
	 * Then fork off the collector.  Remember its PID for pgstat_ispgstat.
279
	 */
280 281 282 283 284 285 286 287 288

	fflush(stdout);
	fflush(stderr);

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

289
	switch ((pgStatPid = (int) fork()))
290 291
	{
		case -1:
292 293 294 295
#ifdef __BEOS__
			/* Specific beos actions */
			beos_backend_startup_failed();
#endif
296
			elog(LOG, "PGSTAT: fork() failed: %m");
297
			pgStatRunning = 0;
298
			return 0;
299 300 301 302 303 304 305 306 307

		case 0:
			break;

		default:
			pgStatRunning = 1;
			return 0;
	}

308
	/* in postmaster child ... */
309 310 311 312 313 314 315 316 317 318 319 320

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

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

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

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

323
	pgstat_main();
324

325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348
	exit(0);
}


/* ----------
 * pgstat_ispgstat() -
 *
 *	Called from postmaster to check if a terminated child process
 *	was the statistics collector.
 * ----------
 */
int
pgstat_ispgstat(int pid)
{
	if (pgStatRunning == 0)
		return 0;

	if (pgStatPid != pid)
		return 0;

	return 1;
}


349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
/* ----------
 * 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)
		close(pgStatPmPipe[0]);
	pgStatPmPipe[0] = -1;
	if (pgStatPmPipe[1] >= 0)
		close(pgStatPmPipe[1]);
	pgStatPmPipe[1] = -1;
}


368 369 370 371 372 373 374 375 376
/* ----------
 * pgstat_beterm() -
 *
 *	Called from postmaster to tell collector a backend terminated.
 * ----------
 */
void
pgstat_beterm(int pid)
{
377
	PgStat_MsgBeterm msg;
378

379
	if (pgStatSock < 0)
380 381
		return;

382
	MemSet(&(msg.m_hdr), 0, sizeof(msg.m_hdr));
383 384
	msg.m_hdr.m_type = PGSTAT_MTYPE_BETERM;
	msg.m_hdr.m_procpid = pid;
385 386 387 388 389 390 391

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


/* ------------------------------------------------------------
 * Public functions used by backends follow
392
 *------------------------------------------------------------
393 394 395 396 397 398 399 400 401 402 403 404 405
 */


/* ----------
 * 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)
{
406
	PgStat_MsgBestart msg;
407

408
	if (pgStatSock < 0)
409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426
		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
pgstat_report_activity(char *what)
{
427 428
	PgStat_MsgActivity msg;
	int			len;
429

430
	if (!pgstat_collect_querystring || pgStatSock < 0)
431 432 433
		return;

	len = strlen(what);
B
Bruce Momjian 已提交
434
	len = pg_mbcliplen((const unsigned char *) what, len, PGSTAT_ACTIVITY_SIZE - 1);
435

436 437
	memcpy(msg.m_what, what, len);
	msg.m_what[len] = '\0';
438
	len += offsetof(PgStat_MsgActivity, m_what) +1;
439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454

	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)
{
455 456 457
	int			i;
	int			n;
	int			len;
458

459
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
460
		!pgstat_collect_blocklevel)
461 462
		return;

463 464 465 466
	if (pgStatSock < 0)
		return;

	/*
467 468
	 * For each message buffer used during the last query set the header
	 * fields and send it out.
469 470 471 472
	 */
	for (i = 0; i < pgStatTabstatUsed; i++)
	{
		n = pgStatTabstatMessages[i]->m_nentries;
473 474
		len = offsetof(PgStat_MsgTabstat, m_entry[0]) +
			n * sizeof(PgStat_TableEntry);
475

476
		pgStatTabstatMessages[i]->m_xact_commit = pgStatXactCommit;
477
		pgStatTabstatMessages[i]->m_xact_rollback = pgStatXactRollback;
478
		pgStatXactCommit = 0;
479 480
		pgStatXactRollback = 0;

481 482
		pgstat_setheader(&pgStatTabstatMessages[i]->m_hdr,
						 PGSTAT_MTYPE_TABSTAT);
483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498
		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)
{
499 500 501 502 503 504 505 506 507 508 509 510 511 512
	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;
513 514 515 516 517

	if (pgStatSock < 0)
		return 0;

	/*
518 519 520
	 * We don't vacuum inside of transaction blocks, because a possible
	 * later rollback might reactivate objects we didn't find because of
	 * earlier destruction in the xact.
521 522 523 524 525 526 527 528
	 */
	if (IsTransactionBlock())
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
529
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
530
	{
531
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
532
							  &pgStatBeTable, &pgStatNumBackends);
533 534 535 536 537 538
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup our own database entry
	 */
539 540 541
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
												 HASH_FIND, NULL);
542
	if (dbentry == NULL)
543 544 545 546 547 548 549 550 551 552 553 554 555
		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.
	 */
556
	hash_seq_init(&hstat, dbentry->tables);
557
	while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&hstat)) != NULL)
558 559
	{
		/*
560 561
		 * Check if this relation is still alive by looking up it's
		 * pg_class tuple in the system catalog cache.
562 563
		 */
		reltup = SearchSysCache(RELOID,
564 565
								ObjectIdGetDatum(tabentry->tableid),
								0, 0, 0);
566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582
		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)
		{
583
			len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
584
				+msg.m_nentries * sizeof(Oid);
585 586 587 588 589 590 591 592 593 594 595 596 597

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

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
598
		len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
599
			+msg.m_nentries * sizeof(Oid);
600 601 602 603 604 605 606 607 608 609

		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;
610
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
611 612

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
613 614
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
615 616 617 618
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
619 620
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
621
		}
622
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
623 624 625 626 627
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

	/*
628 629
	 * Search the database hash table for dead databases and tell the
	 * collector to drop them as well.
630 631
	 */
	hash_seq_init(&hstat, pgStatDBHash);
632
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
633
	{
634
		Oid			dbid = dbentry->databaseid;
635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654

		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.
	 */
655
	pfree((char *) dbidlist);
656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675

	/*
	 * 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)
{
676
	PgStat_MsgDropdb msg;
677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696

	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)
{
697
	PgStat_MsgResetcounter msg;
698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718

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

	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)
{
741 742 743 744
	PgStat_TableEntry *useent = NULL;
	Oid			rel_id = rel->rd_id;
	int			mb;
	int			i;
745 746 747 748

	/*
	 * Initialize data not to count at all.
	 */
749 750 751 752
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
753

754
	if (pgStatSock < 0)
755 756 757 758 759 760 761 762 763 764 765 766
	{
		stats->no_stats = TRUE;
		return;
	}

	/*
	 * On the first of all calls initialize the message buffers.
	 */
	if (pgStatTabstatAlloc == 0)
	{
		pgStatTabstatAlloc = 4;
		pgStatTabstatMessages = (PgStat_MsgTabstat **)
767
			malloc(sizeof(PgStat_MsgTabstat *) * pgStatTabstatAlloc);
768 769
		if (pgStatTabstatMessages == NULL)
		{
770
			elog(LOG, "PGSTATBE: malloc() failed");
771 772 773 774 775
			return;
		}
		for (i = 0; i < pgStatTabstatAlloc; i++)
		{
			pgStatTabstatMessages[i] = (PgStat_MsgTabstat *)
776
				malloc(sizeof(PgStat_MsgTabstat));
777 778
			if (pgStatTabstatMessages[i] == NULL)
			{
779
				elog(LOG, "PGSTATBE: malloc() failed");
780 781 782 783 784 785 786 787 788 789 790 791 792 793
				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)
			{
794
				stats->tabentry = (void *) &(pgStatTabstatMessages[mb]->m_entry[i]);
795 796 797 798 799 800
				return;
			}
		}

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

802 803 804 805 806 807 808 809
		/*
		 * 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;
810
		stats->tabentry = (void *) useent;
811 812 813 814 815 816 817 818 819 820
		return;
	}

	/*
	 * If we ran out of message buffers, we just allocate more.
	 */
	if (pgStatTabstatUsed >= pgStatTabstatAlloc)
	{
		pgStatTabstatAlloc += 4;
		pgStatTabstatMessages = (PgStat_MsgTabstat **)
821
			realloc(pgStatTabstatMessages,
822 823 824 825
					sizeof(PgStat_MsgTabstat *) * pgStatTabstatAlloc);
		if (pgStatTabstatMessages == NULL)
		{
			pgStatTabstatAlloc -= 4;
826
			elog(LOG, "PGSTATBE: malloc() failed");
827 828 829 830 831
			return;
		}
		for (i = pgStatTabstatUsed; i < pgStatTabstatAlloc; i++)
		{
			pgStatTabstatMessages[i] = (PgStat_MsgTabstat *)
832
				malloc(sizeof(PgStat_MsgTabstat));
833 834 835
			if (pgStatTabstatMessages[i] == NULL)
			{
				pgStatTabstatAlloc -= 4;
836
				elog(LOG, "PGSTATBE: malloc() failed");
837 838 839 840 841 842 843 844 845 846 847 848 849
				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;
850
	stats->tabentry = (void *) useent;
851 852 853 854 855 856 857 858 859 860 861 862 863
	return;
}


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
864
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
865
		!pgstat_collect_blocklevel)
866 867
		return;

868 869 870
	pgStatXactCommit++;

	/*
871 872 873
	 * 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.
874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894
	 */
	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)
{
895
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
896
		!pgstat_collect_blocklevel)
897 898
		return;

899 900 901
	pgStatXactRollback++;

	/*
902 903 904
	 * 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.
905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928
	 */
	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)
{
929
	PgStat_StatDBEntry *dbentry;
930 931 932

	/*
	 * If not done for this transaction, read the statistics collector
933 934
	 * stats file into some hash tables. Be careful with the
	 * read_statsfile() call below!
935
	 */
936
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
937
	{
938
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
939
							  &pgStatBeTable, &pgStatNumBackends);
940 941 942 943 944 945
		pgStatDBHashXact = GetCurrentTransactionId();
	}

	/*
	 * Lookup the requested database
	 */
946 947
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &dbid,
948 949
												 HASH_FIND, NULL);
	if (dbentry == NULL)
950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967
		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)
{
968 969
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
970 971 972

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

	/*
	 * Lookup our database.
	 */
986 987
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
988 989
												 HASH_FIND, NULL);
	if (dbentry == NULL)
990 991 992 993 994 995 996
		return NULL;

	/*
	 * Now inside the DB's table hash table lookup the requested one.
	 */
	if (dbentry->tables == NULL)
		return NULL;
997 998
	tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
												   (void *) &relid,
999 1000
												   HASH_FIND, NULL);
	if (tabentry == NULL)
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018
		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)
{
1019
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1020
	{
1021
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1022
							  &pgStatBeTable, &pgStatNumBackends);
1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042
		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)
{
1043
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
1044
	{
1045
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
1046
							  &pgStatBeTable, &pgStatNumBackends);
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
		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)
{
1070 1071 1072 1073 1074
	hdr->m_type = mtype;
	hdr->m_backendid = MyBackendId;
	hdr->m_procpid = MyProcPid;
	hdr->m_databaseid = MyDatabaseId;
	hdr->m_userid = GetSessionUserId();
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
}


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

1090
	((PgStat_MsgHdr *) msg)->m_size = len;
1091

1092 1093
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1094 1095 1096 1097 1098
}


/* ------------------------------------------------------------
 * Local functions implementing the statistics collector itself follow
1099
 *------------------------------------------------------------
1100 1101 1102 1103 1104 1105
 */


/* ----------
 * pgstat_main() -
 *
1106 1107
 *	Start up the statistics collector itself.  This is the body of the
 *	postmaster child process.
1108 1109 1110
 * ----------
 */
static void
1111
pgstat_main(void)
1112 1113
{
	PgStat_Msg	msg;
1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127
	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.
1128 1129
	 */
	close(pgStatPmPipe[1]);
1130
	pgStatPmPipe[1] = -1;
1131 1132

	/*
1133 1134
	 * Ignore all signals usually bound to some action in the postmaster,
	 * except for SIGCHLD --- see pgstat_recvbuffer.
1135
	 */
1136 1137 1138 1139 1140 1141 1142 1143
	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);
1144
	pqsignal(SIGCHLD, pgstat_die);
1145 1146 1147 1148
	pqsignal(SIGTTIN, SIG_DFL);
	pqsignal(SIGTTOU, SIG_DFL);
	pqsignal(SIGCONT, SIG_DFL);
	pqsignal(SIGWINCH, SIG_DFL);
1149 1150

	/*
1151 1152
	 * Start a buffering process to read from the socket, so we have a
	 * little more time to process incoming messages.
1153 1154
	 *
	 * NOTE: the process structure is: postmaster is parent of buffer process
1155
	 * is parent of collector process.	This way, the buffer can detect
1156
	 * collector failure via SIGCHLD, whereas otherwise it wouldn't notice
1157 1158 1159 1160
	 * 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.
1161 1162 1163
	 */
	if (pipe(pgStatPipe) < 0)
	{
1164
		elog(LOG, "PGSTAT: pipe() failed: %m");
1165 1166 1167
		exit(1);
	}

1168
	switch (fork())
1169
	{
1170
		case -1:
1171
			elog(LOG, "PGSTAT: fork() failed: %m");
1172
			exit(1);
1173

1174
		case 0:
1175
			/* child becomes collector process */
1176 1177 1178
			close(pgStatPipe[1]);
			close(pgStatSock);
			break;
1179 1180 1181 1182

		default:
			/* parent becomes buffer process */
			close(pgStatPipe[0]);
1183
			pgstat_recvbuffer();
1184
			exit(0);
1185 1186
	}

1187
	/*
1188 1189
	 * In the child we can have default SIGCHLD handling (in case we want
	 * to call system() here...)
1190 1191 1192
	 */
	pqsignal(SIGCHLD, SIG_DFL);

1193 1194 1195
	/*
	 * Identify myself via ps
	 */
1196
	init_ps_display("stats collector process", "", "");
1197 1198 1199 1200 1201 1202 1203 1204
	set_ps_display("");

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

1205
	/*
1206 1207
	 * Read in an existing statistics stats file or initialize the stats
	 * to zero.
1208 1209 1210 1211 1212 1213 1214 1215
	 */
	pgStatRunningInCollector = TRUE;
	pgstat_read_statsfile(&pgStatDBHash, InvalidOid, NULL, NULL);

	/*
	 * Create the dead backend hashtable
	 */
	memset(&hash_ctl, 0, sizeof(hash_ctl));
1216
	hash_ctl.keysize = sizeof(int);
1217
	hash_ctl.entrysize = sizeof(PgStat_StatBeDead);
1218
	hash_ctl.hash = tag_hash;
1219 1220
	pgStatBeDead = hash_create("Dead Backends", PGSTAT_BE_HASH_SIZE,
							   &hash_ctl, HASH_ELEM | HASH_FUNCTION);
1221 1222
	if (pgStatBeDead == NULL)
	{
1223
		elog(LOG, "PGSTAT: Creation of dead backend hash table failed");
1224 1225 1226 1227 1228 1229
		exit(1);
	}

	/*
	 * Create the known backends table
	 */
1230 1231
	pgStatBeTable = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * MaxBackends);
1232 1233
	if (pgStatBeTable == NULL)
	{
1234
		elog(LOG, "PGSTAT: Allocation of backend table failed");
1235 1236 1237 1238
		exit(1);
	}
	memset(pgStatBeTable, 0, sizeof(PgStat_StatBeEntry) * MaxBackends);

1239 1240
	readPipe = pgStatPipe[0];

1241
	/*
1242 1243
	 * Process incoming messages and handle all the reporting stuff until
	 * there are no more messages.
1244 1245 1246 1247
	 */
	for (;;)
	{
		/*
1248 1249 1250
		 * 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.
1251 1252 1253 1254 1255
		 */
		if (need_statwrite)
		{
			gettimeofday(&timeout, NULL);
			timeout.tv_usec = next_statwrite.tv_usec - timeout.tv_usec;
1256
			timeout.tv_sec = next_statwrite.tv_sec - timeout.tv_sec;
1257 1258
			if (timeout.tv_usec < 0)
			{
1259
				timeout.tv_sec -= 1;
1260 1261 1262 1263
				timeout.tv_usec += 1000000;
			}
			if (timeout.tv_sec < 0)
			{
1264
				timeout.tv_sec = 0;
1265 1266 1267 1268 1269 1270 1271 1272
				timeout.tv_usec = 0;
			}
		}

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1273 1274
		FD_SET(readPipe, &rfds);
		FD_SET(pmPipe, &rfds);
1275

1276 1277
		if (readPipe > pmPipe)
			maxfd = readPipe;
1278
		else
1279
			maxfd = pmPipe;
1280 1281 1282 1283

		/*
		 * Now wait for something to do.
		 */
1284
		nready = select(maxfd + 1, &rfds, NULL, NULL,
1285 1286 1287
						(need_statwrite) ? &timeout : NULL);
		if (nready < 0)
		{
1288 1289
			if (errno == EINTR)
				continue;
1290
			elog(LOG, "PGSTAT: select() failed: %m");
1291 1292 1293 1294
			exit(1);
		}

		/*
1295 1296
		 * If there are no descriptors ready, our timeout for writing the
		 * stats file happened.
1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308
		 */
		if (nready == 0)
		{
			pgstat_write_statsfile();
			need_statwrite = FALSE;

			continue;
		}

		/*
		 * Check if there is a new statistics message to collect.
		 */
1309
		if (FD_ISSET(readPipe, &rfds))
1310 1311
		{
			/*
1312 1313 1314 1315 1316
			 * 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.
1317
			 */
1318 1319
			int			nread = 0;
			int			targetlen = sizeof(PgStat_MsgHdr);		/* initial */
1320

1321
			while (nread < targetlen)
1322
			{
1323 1324 1325
				len = read(readPipe,
						   ((char *) &msg) + nread,
						   targetlen - nread);
1326 1327
				if (len < 0)
				{
1328 1329
					if (errno == EINTR)
						continue;
1330
					elog(LOG, "PGSTAT: read() failed: %m");
1331 1332
					exit(1);
				}
1333 1334 1335 1336
				if (len == 0)	/* EOF on the pipe! */
					break;
				nread += len;
				if (nread == sizeof(PgStat_MsgHdr))
1337
				{
1338 1339 1340 1341 1342 1343
					/* we have the header, compute actual msg length */
					targetlen = msg.msg_hdr.m_size;
					if (targetlen < (int) sizeof(PgStat_MsgHdr) ||
						targetlen > (int) sizeof(msg))
					{
						/*
1344 1345 1346
						 * Bogus message length implies that we got out of
						 * sync with the buffer process somehow. Abort so
						 * that we can restart both processes.
1347
						 */
1348
						elog(LOG, "PGSTAT: bogus message length");
1349 1350
						exit(1);
					}
1351 1352
				}
			}
1353

1354 1355 1356 1357 1358 1359
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
			if (len == 0)
				break;
1360 1361

			/*
1362 1363
			 * Distribute the message to the specific function handling
			 * it.
1364 1365 1366 1367 1368 1369 1370
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1371
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1372 1373 1374
					break;

				case PGSTAT_MTYPE_BETERM:
1375
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1376 1377 1378
					break;

				case PGSTAT_MTYPE_TABSTAT:
1379
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1380 1381 1382
					break;

				case PGSTAT_MTYPE_TABPURGE:
1383
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1384 1385 1386
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1387
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1388 1389 1390
					break;

				case PGSTAT_MTYPE_DROPDB:
1391
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1392 1393 1394
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1395
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1396
											 nread);
1397 1398 1399 1400 1401 1402 1403
					break;

				default:
					break;
			}

			/*
1404
			 * Globally count messages.
1405 1406
			 */
			pgStatNumMessages++;
1407 1408

			/*
1409 1410
			 * If this is the first message after we wrote the stats file
			 * the last time, setup the timeout that it'd be written.
1411 1412 1413 1414 1415
			 */
			if (!need_statwrite)
			{
				gettimeofday(&next_statwrite, NULL);
				next_statwrite.tv_usec += ((PGSTAT_STAT_INTERVAL) * 1000);
1416
				next_statwrite.tv_sec += (next_statwrite.tv_usec / 1000000);
1417 1418 1419
				next_statwrite.tv_usec %= 1000000;
				need_statwrite = TRUE;
			}
1420 1421 1422
		}

		/*
1423
		 * Note that we do NOT check for postmaster exit inside the loop;
1424 1425 1426
		 * 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.
1427 1428
		 */
	}
1429 1430

	/*
1431 1432 1433 1434 1435 1436 1437 1438 1439
	 * 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.
1440 1441 1442
	 */
	if (FD_ISSET(pmPipe, &rfds))
		pgstat_write_statsfile();
1443 1444 1445 1446 1447 1448
}


/* ----------
 * pgstat_recvbuffer() -
 *
1449
 *	This is the body of the separate buffering process. Its only
1450
 *	purpose is to receive messages from the UDP socket as fast as
1451 1452
 *	possible and forward them over a pipe into the collector itself.
 *	If the collector is slow to absorb messages, they are buffered here.
1453 1454 1455
 * ----------
 */
static void
1456
pgstat_recvbuffer(void)
1457
{
1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474
	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 */
	struct sockaddr_in fromaddr;
	int			fromlen;
	bool		overflow = false;
1475

1476 1477 1478
	/*
	 * Identify myself via ps
	 */
1479
	init_ps_display("stats buffer process", "", "");
1480 1481
	set_ps_display("");

1482
	/*
1483 1484 1485 1486 1487
	 * 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).
1488 1489 1490 1491 1492 1493 1494 1495 1496 1497
	 */
	pqsignal(SIGPIPE, SIG_DFL);
	PG_SETMASK(&UnBlockSig);

	/*
	 * Set the write pipe to nonblock mode, so that we cannot block when
	 * the collector falls behind.
	 */
	if (fcntl(writePipe, F_SETFL, O_NONBLOCK) < 0)
	{
1498
		elog(LOG, "PGSTATBUFF: fcntl() failed: %m");
1499 1500 1501
		exit(1);
	}

1502 1503 1504
	/*
	 * Allocate the message buffer
	 */
1505
	msgbuffer = (char *) malloc(PGSTAT_RECVBUFFERSZ);
1506 1507
	if (msgbuffer == NULL)
	{
1508
		elog(LOG, "PGSTATBUFF: malloc() failed");
1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521
		exit(1);
	}

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

		/*
1522 1523
		 * As long as we have buffer space we add the socket to the read
		 * descriptor set.
1524
		 */
1525
		if (msg_have <= (int) (PGSTAT_RECVBUFFERSZ - sizeof(PgStat_Msg)))
1526 1527 1528
		{
			FD_SET(pgStatSock, &rfds);
			maxfd = pgStatSock;
1529
			overflow = false;
1530 1531 1532
		}
		else
		{
1533
			if (!overflow)
1534
			{
1535
				elog(LOG, "PGSTATBUFF: Warning - receive buffer full");
1536
				overflow = true;
1537 1538 1539 1540
			}
		}

		/*
1541 1542 1543
		 * 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.
1544 1545 1546
		 */
		if (msg_have > 0)
		{
1547 1548 1549
			FD_SET(writePipe, &wfds);
			if (writePipe > maxfd)
				maxfd = writePipe;
1550 1551 1552
		}
		else
		{
1553 1554 1555
			FD_SET(pmPipe, &rfds);
			if (pmPipe > maxfd)
				maxfd = pmPipe;
1556 1557 1558 1559 1560 1561 1562 1563
		}

		/*
		 * Wait for some work to do.
		 */
		nready = select(maxfd + 1, &rfds, &wfds, NULL, NULL);
		if (nready < 0)
		{
1564 1565
			if (errno == EINTR)
				continue;
1566
			elog(LOG, "PGSTATBUFF: select() failed: %m");
1567 1568 1569 1570 1571 1572 1573 1574 1575 1576
			exit(1);
		}

		/*
		 * If there is a message on the socket, read it and check for
		 * validity.
		 */
		if (FD_ISSET(pgStatSock, &rfds))
		{
			fromlen = sizeof(fromaddr);
1577
			len = recvfrom(pgStatSock,
1578
						   (char *) &input_buffer, sizeof(PgStat_Msg), 0,
1579
						   (struct sockaddr *) &fromaddr, &fromlen);
1580 1581
			if (len < 0)
			{
1582
				elog(LOG, "PGSTATBUFF: recvfrom() failed: %m");
1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594
				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
			 */
1595
			if (input_buffer.msg_hdr.m_size != len)
1596 1597 1598 1599 1600
				continue;

			/*
			 * The source address of the packet must be our own socket.
			 * This ensures that only real hackers or our own backends
1601
			 * tell us something.  (This should be redundant with a
1602 1603
			 * kernel-level check due to having used connect(), but let's
			 * do it anyway.)
1604 1605 1606 1607 1608
			 */
			if (fromaddr.sin_addr.s_addr != pgStatAddr.sin_addr.s_addr)
				continue;
			if (fromaddr.sin_port != pgStatAddr.sin_port)
				continue;
1609

1610
			/*
1611 1612
			 * O.K. - we accept this message.  Copy it to the circular
			 * msgbuffer.
1613
			 */
1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630
			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;
			}
1631 1632 1633
		}

		/*
1634 1635 1636 1637
		 * 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
1638 1639 1640 1641 1642 1643 1644
		 * 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...
1645
		 */
1646
		if (FD_ISSET(writePipe, &wfds))
1647
		{
1648 1649 1650 1651 1652
			xfr = PGSTAT_RECVBUFFERSZ - msg_send;
			if (xfr > msg_have)
				xfr = msg_have;
			Assert(xfr > 0);
			len = write(writePipe, msgbuffer + msg_send, xfr);
1653 1654
			if (len < 0)
			{
1655 1656
				if (errno == EINTR || errno == EAGAIN)
					continue;	/* not enough space in pipe */
1657
				elog(LOG, "PGSTATBUFF: write() failed: %m");
1658 1659
				exit(1);
			}
1660 1661
			/* NB: len < xfr is okay */
			msg_send += len;
1662 1663
			if (msg_send == PGSTAT_RECVBUFFERSZ)
				msg_send = 0;
1664
			msg_have -= len;
1665 1666 1667 1668 1669 1670
		}

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1671
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1672 1673 1674
			continue;

		/*
1675 1676 1677
		 * 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.
1678
		 */
1679
		if (FD_ISSET(pmPipe, &rfds))
1680 1681 1682 1683
			exit(0);
	}
}

1684 1685 1686 1687 1688 1689
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

1690 1691 1692 1693

/* ----------
 * pgstat_add_backend() -
 *
1694
 *	Support function to keep our backend list up to date.
1695 1696 1697 1698 1699
 * ----------
 */
static int
pgstat_add_backend(PgStat_MsgHdr *msg)
{
1700 1701 1702 1703
	PgStat_StatDBEntry *dbentry;
	PgStat_StatBeEntry *beentry;
	PgStat_StatBeDead *deadbe;
	bool		found;
1704 1705 1706 1707 1708 1709

	/*
	 * Check that the backend ID is valid
	 */
	if (msg->m_backendid < 1 || msg->m_backendid > MaxBackends)
	{
1710
		elog(LOG, "PGSTAT: Invalid backend ID %d", msg->m_backendid);
1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
		return -1;
	}

	/*
	 * Get the slot for this backendid.
	 */
	beentry = &pgStatBeTable[msg->m_backendid - 1];
	if (beentry->databaseid != InvalidOid)
	{
		/*
1721 1722
		 * If the slot contains the PID of this backend, everything is
		 * fine and we got nothing to do.
1723 1724 1725 1726 1727 1728
		 */
		if (beentry->procpid == msg->m_procpid)
			return 0;
	}

	/*
1729 1730 1731 1732 1733
	 * 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.
1734 1735 1736
	 *
	 * If the backend is known to be dead, we ignore this add.
	 */
1737 1738
	deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
											   (void *) &(msg->m_procpid),
1739 1740
											   HASH_FIND, NULL);
	if (deadbe)
1741 1742 1743
		return 1;

	/*
1744 1745
	 * Backend isn't known to be dead. If it's slot is currently used, we
	 * have to kick out the old backend.
1746 1747 1748 1749 1750 1751 1752 1753
	 */
	if (beentry->databaseid != InvalidOid)
		pgstat_sub_backend(beentry->procpid);

	/*
	 * Put this new backend into the slot.
	 */
	beentry->databaseid = msg->m_databaseid;
1754 1755
	beentry->procpid = msg->m_procpid;
	beentry->userid = msg->m_userid;
1756
	MemSet(beentry->activity, 0, PGSTAT_ACTIVITY_SIZE);
1757 1758 1759 1760

	/*
	 * Lookup or create the database entry for this backends DB.
	 */
1761
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
1762
										   (void *) &(msg->m_databaseid),
1763
												 HASH_ENTER, &found);
1764
	if (dbentry == NULL)
1765
	{
1766
		elog(LOG, "PGSTAT: DB hash table out of memory - abort");
1767 1768 1769 1770 1771 1772 1773 1774
		exit(1);
	}

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

1777 1778 1779 1780 1781 1782 1783
		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;
1784 1785

		memset(&hash_ctl, 0, sizeof(hash_ctl));
1786
		hash_ctl.keysize = sizeof(Oid);
1787
		hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
1788
		hash_ctl.hash = tag_hash;
1789 1790 1791 1792
		dbentry->tables = hash_create("Per-database table",
									  PGSTAT_TAB_HASH_SIZE,
									  &hash_ctl,
									  HASH_ELEM | HASH_FUNCTION);
1793 1794
		if (dbentry->tables == NULL)
		{
1795
			elog(LOG, "PGSTAT: failed to initialize hash table for "
B
Bruce Momjian 已提交
1796
				 "new database entry");
1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818
			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)
{
1819 1820 1821
	int			i;
	PgStat_StatBeDead *deadbe;
	bool		found;
1822 1823

	/*
1824 1825
	 * Search in the known-backends table for the slot containing this
	 * PID.
1826 1827 1828 1829 1830 1831 1832 1833
	 */
	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.
1834 1835 1836 1837 1838 1839 1840
			 * 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).
1841
			 */
1842 1843
			deadbe = (PgStat_StatBeDead *) hash_search(pgStatBeDead,
													   (void *) &procpid,
1844
													 HASH_ENTER, &found);
1845 1846
			if (deadbe == NULL)
			{
1847
				elog(LOG, "PGSTAT: dead backend hash table out of memory");
1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864
				exit(1);
			}
			if (!found)
			{
				deadbe->backendid = i + 1;
				deadbe->destroy = PGSTAT_DESTROY_COUNT;
			}

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

	/*
1865 1866
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879
	 */
}


/* ----------
 * pgstat_write_statsfile() -
 *
 *	Tell the news.
 * ----------
 */
static void
pgstat_write_statsfile(void)
{
1880 1881 1882 1883 1884 1885 1886
	HASH_SEQ_STATUS hstat;
	HASH_SEQ_STATUS tstat;
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	PgStat_StatBeDead *deadbe;
	FILE	   *fpout;
	int			i;
1887 1888

	/*
1889
	 * Open the statistics temp file to write out the current values.
1890
	 */
P
Peter Eisentraut 已提交
1891
	fpout = fopen(pgStat_tmpfname, PG_BINARY_W);
1892 1893
	if (fpout == NULL)
	{
1894 1895
		elog(LOG, "PGSTAT: cannot open temp stats file %s: %m",
			 pgStat_tmpfname);
1896 1897 1898 1899 1900 1901 1902
		return;
	}

	/*
	 * Walk through the database table.
	 */
	hash_seq_init(&hstat, pgStatDBHash);
1903
	while ((dbentry = (PgStat_StatDBEntry *) hash_seq_search(&hstat)) != NULL)
1904 1905
	{
		/*
1906 1907
		 * If this database is marked destroyed, count down and do so if
		 * it reaches 0.
1908 1909 1910 1911 1912 1913 1914 1915
		 */
		if (dbentry->destroy > 0)
		{
			if (--(dbentry->destroy) == 0)
			{
				if (dbentry->tables != NULL)
					hash_destroy(dbentry->tables);

1916
				if (hash_search(pgStatDBHash,
1917 1918
								(void *) &(dbentry->databaseid),
								HASH_REMOVE, NULL) == NULL)
1919
				{
1920
					elog(LOG, "PGSTAT: database hash table corrupted "
B
Bruce Momjian 已提交
1921
						 "during cleanup - abort");
1922 1923 1924
					exit(1);
				}
			}
1925

1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941
			/*
			 * 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);
1942
		while ((tabentry = (PgStat_StatTabEntry *) hash_seq_search(&tstat)) != NULL)
1943 1944
		{
			/*
1945 1946
			 * If table entry marked for destruction, same as above for
			 * the database entry.
1947 1948 1949 1950 1951
			 */
			if (tabentry->destroy > 0)
			{
				if (--(tabentry->destroy) == 0)
				{
1952
					if (hash_search(dbentry->tables,
1953
									(void *) &(tabentry->tableid),
1954
									HASH_REMOVE, NULL) == NULL)
1955
					{
1956
						elog(LOG, "PGSTAT: tables hash table for "
B
Bruce Momjian 已提交
1957 1958 1959
							 "database %d corrupted during "
							 "cleanup - abort",
							 dbentry->databaseid);
1960 1961 1962 1963 1964 1965 1966
						exit(1);
					}
				}
				continue;
			}

			/*
1967 1968
			 * At least we think this is still a life table. Print it's
			 * access stats.
1969 1970 1971 1972
			 */
			fputc('T', fpout);
			fwrite(tabentry, sizeof(PgStat_StatTabEntry), 1, fpout);
		}
1973

1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996
		/*
		 * 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);
		}
	}

	/*
1997 1998
	 * No more output to be done. Close the temp file and replace the old
	 * pgstat.stat with it's content.
1999 2000 2001 2002
	 */
	fputc('E', fpout);
	if (fclose(fpout) < 0)
	{
2003 2004
		elog(LOG, "PGSTAT: Error closing temp stats file %s: %m",
			 pgStat_tmpfname);
2005 2006 2007 2008 2009
	}
	else
	{
		if (rename(pgStat_tmpfname, pgStat_fname) < 0)
		{
2010 2011
			elog(LOG, "PGSTAT: Cannot rename temp stats file %s: %m",
				 pgStat_fname);
2012 2013 2014 2015 2016 2017 2018
		}
	}

	/*
	 * Clear out the dead backends table
	 */
	hash_seq_init(&hstat, pgStatBeDead);
2019
	while ((deadbe = (PgStat_StatBeDead *) hash_seq_search(&hstat)) != NULL)
2020 2021
	{
		/*
2022 2023
		 * Count down the destroy delay and remove entries where it
		 * reaches 0.
2024 2025 2026
		 */
		if (--(deadbe->destroy) <= 0)
		{
2027 2028 2029
			if (hash_search(pgStatBeDead,
							(void *) &(deadbe->procpid),
							HASH_REMOVE, NULL) == NULL)
2030
			{
2031
				elog(LOG, "PGSTAT: dead backend hash table corrupted "
B
Bruce Momjian 已提交
2032
					 "during cleanup - abort");
2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048
				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
2049 2050
pgstat_read_statsfile(HTAB **dbhash, Oid onlydb,
					  PgStat_StatBeEntry **betab, int *numbackends)
2051
{
2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069
	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!
2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085
	 */
	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));
2086
	hash_ctl.keysize = sizeof(Oid);
2087
	hash_ctl.entrysize = sizeof(PgStat_StatDBEntry);
2088 2089 2090 2091
	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);
2092
	if (*dbhash == NULL)
2093 2094 2095
	{
		if (pgStatRunningInCollector)
		{
2096
			elog(LOG, "PGSTAT: Creation of DB hash table failed");
2097 2098
			exit(1);
		}
2099
		/* in backend, can do normal error */
2100
		elog(ERROR, "PGSTAT: Creation of DB hash table failed");
2101 2102 2103
	}

	/*
2104 2105
	 * Initialize the number of known backends to zero, just in case we do
	 * a silent error return below.
2106 2107 2108 2109 2110 2111 2112 2113
	 */
	if (numbackends != NULL)
		*numbackends = 0;
	if (betab != NULL)
		*betab = NULL;

	/*
	 * Try to open the status file. If it doesn't exist, the backends
2114 2115
	 * simply return zero for anything and the collector simply starts
	 * from scratch with empty counters.
2116
	 */
P
Peter Eisentraut 已提交
2117
	if ((fpin = fopen(pgStat_fname, PG_BINARY_R)) == NULL)
2118 2119 2120
		return;

	/*
2121 2122
	 * We found an existing collector stats file. Read it and put all the
	 * hashtable entries into place.
2123 2124 2125 2126 2127
	 */
	for (;;)
	{
		switch (fgetc(fpin))
		{
2128 2129 2130 2131 2132
				/*
				 * 'D'	A PgStat_StatDBEntry struct describing a database
				 * follows. Subsequently, zero to many 'T' entries will
				 * follow until a 'd' is encountered.
				 */
2133 2134 2135 2136 2137
			case 'D':
				if (fread(&dbbuf, 1, sizeof(dbbuf), fpin) != sizeof(dbbuf))
				{
					if (pgStatRunningInCollector)
					{
2138
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2139 2140 2141 2142 2143
						fclose(fpin);
						return;
					}
					else
					{
2144
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2145 2146 2147 2148 2149 2150 2151 2152
						fclose(fpin);
						return;
					}
				}

				/*
				 * Add to the DB hash
				 */
2153
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
2154 2155
											  (void *) &dbbuf.databaseid,
													 HASH_ENTER, &found);
2156 2157 2158 2159
				if (dbentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2160
						elog(LOG, "PGSTAT: DB hash table out of memory");
2161 2162 2163 2164 2165
						exit(1);
					}
					else
					{
						fclose(fpin);
2166
						elog(ERROR, "PGSTAT: DB hash table out of memory");
2167 2168 2169 2170 2171 2172
					}
				}
				if (found)
				{
					if (pgStatRunningInCollector)
					{
2173
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2174 2175 2176 2177 2178
						fclose(fpin);
						return;
					}
					else
					{
2179
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2180 2181 2182 2183 2184 2185
						fclose(fpin);
						return;
					}
				}

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2186 2187 2188
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2189 2190 2191 2192 2193 2194 2195 2196 2197

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


				memset(&hash_ctl, 0, sizeof(hash_ctl));
2198
				hash_ctl.keysize = sizeof(Oid);
2199
				hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2200 2201
				hash_ctl.hash = tag_hash;
				hash_ctl.hcxt = use_mcxt;
2202 2203 2204
				dbentry->tables = hash_create("Per-database table",
											  PGSTAT_TAB_HASH_SIZE,
											  &hash_ctl,
2205
								 HASH_ELEM | HASH_FUNCTION | mcxt_flags);
2206 2207 2208 2209
				if (dbentry->tables == NULL)
				{
					if (pgStatRunningInCollector)
					{
2210 2211
						elog(LOG, "PGSTAT: failed to initialize "
							 "hash table for new database entry");
2212 2213 2214 2215 2216 2217
						exit(1);
					}
					else
					{
						fclose(fpin);
						elog(ERROR, "PGSTAT: failed to initialize "
2218
							 "hash table for new database entry");
2219 2220 2221 2222 2223 2224 2225 2226 2227 2228
					}
				}

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

2229 2230 2231
				/*
				 * 'd'	End of this database.
				 */
2232 2233 2234 2235
			case 'd':
				tabhash = NULL;
				break;

2236 2237 2238
				/*
				 * 'T'	A PgStat_StatTabEntry follows.
				 */
2239 2240 2241 2242 2243
			case 'T':
				if (fread(&tabbuf, 1, sizeof(tabbuf), fpin) != sizeof(tabbuf))
				{
					if (pgStatRunningInCollector)
					{
2244
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2245 2246 2247 2248 2249
						fclose(fpin);
						return;
					}
					else
					{
2250
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261
						fclose(fpin);
						return;
					}
				}

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

2262
				tabentry = (PgStat_StatTabEntry *) hash_search(tabhash,
2263 2264
												(void *) &tabbuf.tableid,
													 HASH_ENTER, &found);
2265 2266 2267 2268
				if (tabentry == NULL)
				{
					if (pgStatRunningInCollector)
					{
2269
						elog(LOG, "PGSTAT: Tab hash table out of memory");
2270 2271 2272 2273 2274
						exit(1);
					}
					else
					{
						fclose(fpin);
2275
						elog(ERROR, "PGSTAT: Tab hash table out of memory");
2276 2277 2278 2279 2280 2281 2282
					}
				}

				if (found)
				{
					if (pgStatRunningInCollector)
					{
2283
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2284 2285 2286 2287 2288
						fclose(fpin);
						return;
					}
					else
					{
2289
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2290 2291 2292 2293 2294 2295 2296 2297
						fclose(fpin);
						return;
					}
				}

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

2298 2299 2300
				/*
				 * 'M'	The maximum number of backends to expect follows.
				 */
2301 2302 2303 2304 2305 2306 2307
			case 'M':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (fread(&maxbackends, 1, sizeof(maxbackends), fpin) !=
2308
					sizeof(maxbackends))
2309 2310 2311
				{
					if (pgStatRunningInCollector)
					{
2312
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2313 2314 2315 2316 2317
						fclose(fpin);
						return;
					}
					else
					{
2318
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329
						fclose(fpin);
						return;
					}
				}
				if (maxbackends == 0)
				{
					fclose(fpin);
					return;
				}

				/*
2330 2331
				 * Allocate space (in TopTransactionContext too) for the
				 * backend table.
2332 2333
				 */
				if (use_mcxt == NULL)
2334 2335
					*betab = (PgStat_StatBeEntry *) malloc(
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2336
				else
2337 2338 2339
					*betab = (PgStat_StatBeEntry *) MemoryContextAlloc(
																use_mcxt,
							   sizeof(PgStat_StatBeEntry) * maxbackends);
2340 2341
				break;

2342 2343 2344
				/*
				 * 'B'	A PgStat_StatBeEntry follows.
				 */
2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355
			case 'B':
				if (betab == NULL || numbackends == NULL)
				{
					fclose(fpin);
					return;
				}
				if (*betab == NULL)
				{
					fclose(fpin);
					return;
				}
2356

2357 2358 2359
				/*
				 * Read it directly into the table.
				 */
2360 2361 2362
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
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
						fclose(fpin);
						return;
					}
				}

				/*
				 * Count backends per database here.
				 */
2381 2382 2383
				dbentry = (PgStat_StatDBEntry *) hash_search(*dbhash,
						   (void *) &((*betab)[havebackends].databaseid),
														HASH_FIND, NULL);
2384
				if (dbentry)
2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396
					dbentry->n_backends++;

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

2397 2398 2399
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2400 2401 2402 2403 2404 2405 2406
			case 'E':
				fclose(fpin);
				return;

			default:
				if (pgStatRunningInCollector)
				{
2407
					elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2408 2409 2410 2411 2412
					fclose(fpin);
					return;
				}
				else
				{
B
Bruce Momjian 已提交
2413
					elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459
					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)
{
	/*
2460 2461 2462
	 * 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.
2463 2464 2465
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2466

2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480
	strncpy(pgStatBeTable[msg->m_hdr.m_backendid - 1].activity,
			msg->m_what, PGSTAT_ACTIVITY_SIZE);
}


/* ----------
 * pgstat_recv_tabstat() -
 *
 *	Count what the backend has done.
 * ----------
 */
static void
pgstat_recv_tabstat(PgStat_MsgTabstat *msg, int len)
{
2481 2482 2483 2484 2485
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2486 2487 2488 2489 2490 2491 2492 2493 2494 2495

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

	/*
	 * Lookup the database in the hashtable.
	 */
2496
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2497 2498
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2499
	if (!dbentry)
2500 2501 2502
		return;

	/*
2503 2504
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and not worth being counted.
2505 2506 2507 2508
	 */
	if (dbentry->destroy > 0)
		return;

2509 2510
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2511 2512 2513 2514 2515 2516

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2517
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2518 2519
											  (void *) &(tabmsg[i].t_id),
													 HASH_ENTER, &found);
2520 2521
		if (tabentry == NULL)
		{
2522
			elog(LOG, "PGSTAT: tables hash table out of memory for "
B
Bruce Momjian 已提交
2523
				 "database %d - abort", dbentry->databaseid);
2524 2525 2526 2527 2528 2529
			exit(1);
		}

		if (!found)
		{
			/*
2530 2531
			 * If it's a new table entry, initialize counters to the
			 * values we just got.
2532
			 */
2533 2534 2535 2536 2537 2538 2539 2540
			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;
2541 2542 2543 2544 2545 2546 2547 2548

			tabentry->destroy = 0;
		}
		else
		{
			/*
			 * Otherwise add the values to the existing entry.
			 */
2549 2550 2551 2552 2553 2554 2555 2556
			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;
2557 2558 2559 2560 2561
		}

		/*
		 * And add the block IO to the database entry.
		 */
2562 2563
		dbentry->n_blocks_fetched += tabmsg[i].t_blocks_fetched;
		dbentry->n_blocks_hit += tabmsg[i].t_blocks_hit;
2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576
	}
}


/* ----------
 * pgstat_recv_tabpurge() -
 *
 *	Arrange for dead table removal.
 * ----------
 */
static void
pgstat_recv_tabpurge(PgStat_MsgTabpurge *msg, int len)
{
2577 2578 2579
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
2580 2581 2582 2583 2584 2585 2586 2587 2588 2589

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

	/*
	 * Lookup the database in the hashtable.
	 */
2590
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2591 2592
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2593
	if (!dbentry)
2594 2595 2596
		return;

	/*
2597 2598
	 * If the database is marked for destroy, this is a delayed UDP packet
	 * and the tables will go away at DB destruction.
2599 2600 2601 2602 2603 2604 2605 2606 2607
	 */
	if (dbentry->destroy > 0)
		return;

	/*
	 * Process all table entries in the message.
	 */
	for (i = 0; i < msg->m_nentries; i++)
	{
2608
		tabentry = (PgStat_StatTabEntry *) hash_search(dbentry->tables,
2609 2610
										   (void *) &(msg->m_tableid[i]),
													   HASH_FIND, NULL);
2611
		if (tabentry)
2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625
			tabentry->destroy = PGSTAT_DESTROY_COUNT;
	}
}


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2626
	PgStat_StatDBEntry *dbentry;
2627 2628 2629 2630 2631 2632 2633 2634 2635 2636

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

	/*
	 * Lookup the database in the hashtable.
	 */
2637
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2638 2639
										   (void *) &(msg->m_databaseid),
												 HASH_FIND, NULL);
2640
	if (!dbentry)
2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658
		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)
{
2659 2660
	HASHCTL		hash_ctl;
	PgStat_StatDBEntry *dbentry;
2661 2662 2663 2664 2665 2666 2667 2668 2669 2670

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

	/*
	 * Lookup the database in the hashtable.
	 */
2671
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
2672 2673
									 (void *) &(msg->m_hdr.m_databaseid),
												 HASH_FIND, NULL);
2674
	if (!dbentry)
2675 2676 2677 2678 2679 2680 2681 2682 2683
		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);

2684 2685 2686 2687 2688 2689 2690
	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;
2691 2692

	memset(&hash_ctl, 0, sizeof(hash_ctl));
2693
	hash_ctl.keysize = sizeof(Oid);
2694
	hash_ctl.entrysize = sizeof(PgStat_StatTabEntry);
2695
	hash_ctl.hash = tag_hash;
2696 2697 2698 2699
	dbentry->tables = hash_create("Per-database table",
								  PGSTAT_TAB_HASH_SIZE,
								  &hash_ctl,
								  HASH_ELEM | HASH_FUNCTION);
2700 2701
	if (dbentry->tables == NULL)
	{
2702
		elog(LOG, "PGSTAT: failed to reinitialize hash table for "
B
Bruce Momjian 已提交
2703
			 "database entry");
2704 2705 2706
		exit(1);
	}
}