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.31 2002/10/24 23:19:13 tgl 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

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

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

317 318
	MyProcPid = getpid();		/* reset MyProcPid */

319 320 321 322
	/* Lose the postmaster's on-exit routines */
	on_exit_reset();

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

325
	pgstat_main();
326

327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
	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;
}


351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369
/* ----------
 * 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;
}


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

381
	if (pgStatSock < 0)
382 383
		return;

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

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


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


/* ----------
 * 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)
{
408
	PgStat_MsgBestart msg;
409

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

432
	if (!pgstat_collect_querystring || pgStatSock < 0)
433 434 435
		return;

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

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

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

461
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
462
		!pgstat_collect_blocklevel)
463 464
		return;

465 466 467 468
	if (pgStatSock < 0)
		return;

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

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

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

	if (pgStatSock < 0)
		return 0;

	/*
	 * If not done for this transaction, read the statistics collector
	 * stats file into some hash tables.
	 */
523
	if (!TransactionIdEquals(pgStatDBHashXact, GetCurrentTransactionId()))
524
	{
525
		pgstat_read_statsfile(&pgStatDBHash, MyDatabaseId,
526
							  &pgStatBeTable, &pgStatNumBackends);
527 528 529 530 531 532
		pgStatDBHashXact = GetCurrentTransactionId();
	}

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

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

			msg.m_nentries = 0;
		}
	}

	/*
	 * Send the rest
	 */
	if (msg.m_nentries > 0)
	{
592
		len = offsetof(PgStat_MsgTabpurge, m_tableid[0])
B
Bruce Momjian 已提交
593
			+msg.m_nentries * sizeof(Oid);
594 595 596 597 598 599 600 601 602 603

		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;
604
	dbidlist = (Oid *) palloc(sizeof(Oid) * dbidalloc);
605 606

	dbrel = heap_openr(DatabaseRelationName, AccessShareLock);
607 608
	dbscan = heap_beginscan(dbrel, SnapshotNow, 0, NULL);
	while ((dbtup = heap_getnext(dbscan, ForwardScanDirection)) != NULL)
609 610 611 612
	{
		if (dbidused >= dbidalloc)
		{
			dbidalloc *= 2;
613 614
			dbidlist = (Oid *) repalloc((char *) dbidlist,
										sizeof(Oid) * dbidalloc);
615
		}
616
		dbidlist[dbidused++] = HeapTupleGetOid(dbtup);
617 618 619 620 621
	}
	heap_endscan(dbscan);
	heap_close(dbrel, AccessShareLock);

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

		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.
	 */
649
	pfree((char *) dbidlist);
650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669

	/*
	 * 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)
{
670
	PgStat_MsgDropdb msg;
671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690

	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)
{
691
	PgStat_MsgResetcounter msg;
692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712

	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)
{
713
	PgStat_MsgDummy msg;
714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734

	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)
{
735 736 737 738
	PgStat_TableEntry *useent = NULL;
	Oid			rel_id = rel->rd_id;
	int			mb;
	int			i;
739 740 741 742

	/*
	 * Initialize data not to count at all.
	 */
743 744 745 746
	stats->tabentry = NULL;
	stats->no_stats = FALSE;
	stats->heap_scan_counted = FALSE;
	stats->index_scan_counted = FALSE;
747

748
	if (pgStatSock < 0)
749 750 751 752 753 754 755 756 757 758 759 760
	{
		stats->no_stats = TRUE;
		return;
	}

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

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

796 797 798 799 800 801 802 803
		/*
		 * 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;
804
		stats->tabentry = (void *) useent;
805 806 807 808 809 810 811 812 813 814
		return;
	}

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


/* ----------
 * pgstat_count_xact_commit() -
 *
 *	Called from access/transam/xact.c to count transaction commits.
 * ----------
 */
void
pgstat_count_xact_commit(void)
{
858
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
859
		!pgstat_collect_blocklevel)
860 861
		return;

862 863 864
	pgStatXactCommit++;

	/*
865 866 867
	 * 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.
868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888
	 */
	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)
{
889
	if (!pgstat_collect_querystring && !pgstat_collect_tuplelevel &&
890
		!pgstat_collect_blocklevel)
891 892
		return;

893 894 895
	pgStatXactRollback++;

	/*
896 897 898
	 * 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.
899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922
	 */
	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)
{
923
	PgStat_StatDBEntry *dbentry;
924 925 926

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

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

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

	/*
	 * Lookup our database.
	 */
980 981
	dbentry = (PgStat_StatDBEntry *) hash_search(pgStatDBHash,
												 (void *) &MyDatabaseId,
982 983
												 HASH_FIND, NULL);
	if (dbentry == NULL)
984 985 986 987 988 989 990
		return NULL;

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


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

1084
	((PgStat_MsgHdr *) msg)->m_size = len;
1085

1086 1087
	send(pgStatSock, msg, len, 0);
	/* We deliberately ignore any error from send() */
1088 1089 1090 1091 1092
}


/* ------------------------------------------------------------
 * Local functions implementing the statistics collector itself follow
1093
 *------------------------------------------------------------
1094 1095 1096 1097 1098 1099
 */


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

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

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

1162
	switch (fork())
1163
	{
1164
		case -1:
1165
			elog(LOG, "PGSTAT: fork() failed: %m");
1166
			exit(1);
1167

1168
		case 0:
1169
			/* child becomes collector process */
1170 1171 1172
			close(pgStatPipe[1]);
			close(pgStatSock);
			break;
1173 1174 1175 1176

		default:
			/* parent becomes buffer process */
			close(pgStatPipe[0]);
1177
			pgstat_recvbuffer();
1178
			exit(0);
1179 1180
	}

1181
	/*
1182 1183
	 * In the child we can have default SIGCHLD handling (in case we want
	 * to call system() here...)
1184 1185 1186
	 */
	pqsignal(SIGCHLD, SIG_DFL);

1187 1188
	MyProcPid = getpid();		/* reset MyProcPid */

1189 1190 1191
	/*
	 * Identify myself via ps
	 */
1192
	init_ps_display("stats collector process", "", "");
1193 1194 1195 1196 1197 1198 1199 1200
	set_ps_display("");

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

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

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

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

1235 1236
	readPipe = pgStatPipe[0];

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

		/*
		 * Setup the descriptor set for select(2)
		 */
		FD_ZERO(&rfds);
1277 1278
		FD_SET(readPipe, &rfds);
		FD_SET(pmPipe, &rfds);
1279

1280 1281
		if (readPipe > pmPipe)
			maxfd = readPipe;
1282
		else
1283
			maxfd = pmPipe;
1284 1285 1286 1287

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

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

			continue;
		}

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

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

1358 1359 1360 1361 1362 1363
			/*
			 * EOF on the pipe implies that the buffer process exited.
			 * Fall out of outer loop.
			 */
			if (len == 0)
				break;
1364 1365

			/*
1366 1367
			 * Distribute the message to the specific function handling
			 * it.
1368 1369 1370 1371 1372 1373 1374
			 */
			switch (msg.msg_hdr.m_type)
			{
				case PGSTAT_MTYPE_DUMMY:
					break;

				case PGSTAT_MTYPE_BESTART:
1375
					pgstat_recv_bestart((PgStat_MsgBestart *) &msg, nread);
1376 1377 1378
					break;

				case PGSTAT_MTYPE_BETERM:
1379
					pgstat_recv_beterm((PgStat_MsgBeterm *) &msg, nread);
1380 1381 1382
					break;

				case PGSTAT_MTYPE_TABSTAT:
1383
					pgstat_recv_tabstat((PgStat_MsgTabstat *) &msg, nread);
1384 1385 1386
					break;

				case PGSTAT_MTYPE_TABPURGE:
1387
					pgstat_recv_tabpurge((PgStat_MsgTabpurge *) &msg, nread);
1388 1389 1390
					break;

				case PGSTAT_MTYPE_ACTIVITY:
1391
					pgstat_recv_activity((PgStat_MsgActivity *) &msg, nread);
1392 1393 1394
					break;

				case PGSTAT_MTYPE_DROPDB:
1395
					pgstat_recv_dropdb((PgStat_MsgDropdb *) &msg, nread);
1396 1397 1398
					break;

				case PGSTAT_MTYPE_RESETCOUNTER:
1399
					pgstat_recv_resetcounter((PgStat_MsgResetcounter *) &msg,
1400
											 nread);
1401 1402 1403 1404 1405 1406 1407
					break;

				default:
					break;
			}

			/*
1408
			 * Globally count messages.
1409 1410
			 */
			pgStatNumMessages++;
1411 1412

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

		/*
1427
		 * Note that we do NOT check for postmaster exit inside the loop;
1428 1429 1430
		 * 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.
1431 1432
		 */
	}
1433 1434

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


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

1480 1481 1482
	/*
	 * Identify myself via ps
	 */
1483
	init_ps_display("stats buffer process", "", "");
1484 1485
	set_ps_display("");

1486
	/*
1487 1488 1489 1490 1491
	 * 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).
1492 1493 1494 1495 1496 1497 1498 1499 1500 1501
	 */
	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)
	{
1502
		elog(LOG, "PGSTATBUFF: fcntl() failed: %m");
1503 1504 1505
		exit(1);
	}

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

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

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

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

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

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

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

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

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

		/*
		 * Make sure we forwarded all messages before we check for
		 * Postmaster termination.
		 */
1675
		if (msg_have != 0 || FD_ISSET(pgStatSock, &rfds))
1676 1677 1678
			continue;

		/*
1679 1680 1681
		 * 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.
1682
		 */
1683
		if (FD_ISSET(pmPipe, &rfds))
1684 1685 1686 1687
			exit(0);
	}
}

1688 1689 1690 1691 1692 1693
static void
pgstat_die(SIGNAL_ARGS)
{
	exit(1);
}

1694 1695 1696 1697

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

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

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

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

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

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

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

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

1781 1782 1783 1784 1785 1786 1787
		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;
1788 1789

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

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

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

	/*
1869 1870
	 * No big problem if not found. This can happen if UDP messages arrive
	 * out of order here.
1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883
	 */
}


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

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

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

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

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

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

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

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

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

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

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

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

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

				memcpy(dbentry, &dbbuf, sizeof(PgStat_StatDBEntry));
2190 2191 2192
				dbentry->tables = NULL;
				dbentry->destroy = 0;
				dbentry->n_backends = 0;
2193 2194 2195 2196 2197 2198 2199 2200 2201

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


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

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

2233 2234 2235
				/*
				 * 'd'	End of this database.
				 */
2236 2237 2238 2239
			case 'd':
				tabhash = NULL;
				break;

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

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

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

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

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

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

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

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

2361 2362 2363
				/*
				 * Read it directly into the table.
				 */
2364 2365 2366
				if (fread(&(*betab)[havebackends], 1,
						  sizeof(PgStat_StatBeEntry), fpin) !=
					sizeof(PgStat_StatBeEntry))
2367 2368 2369
				{
					if (pgStatRunningInCollector)
					{
2370
						elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2371 2372 2373 2374 2375
						fclose(fpin);
						return;
					}
					else
					{
2376
						elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
2377 2378 2379 2380 2381 2382 2383 2384
						fclose(fpin);
						return;
					}
				}

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

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

2401 2402 2403
				/*
				 * 'E'	The EOF marker of a complete stats file.
				 */
2404 2405 2406 2407 2408 2409 2410
			case 'E':
				fclose(fpin);
				return;

			default:
				if (pgStatRunningInCollector)
				{
2411
					elog(LOG, "PGSTAT: corrupted pgstat.stat file");
2412 2413 2414 2415 2416
					fclose(fpin);
					return;
				}
				else
				{
B
Bruce Momjian 已提交
2417
					elog(WARNING, "PGSTAT: corrupted pgstat.stat file");
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 2460 2461 2462 2463
					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)
{
	/*
2464 2465 2466
	 * 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.
2467 2468 2469
	 */
	if (pgstat_add_backend(&msg->m_hdr) != 0)
		return;
2470

2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484
	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)
{
2485 2486 2487 2488 2489
	PgStat_TableEntry *tabmsg = &(msg->m_entry[0]);
	PgStat_StatDBEntry *dbentry;
	PgStat_StatTabEntry *tabentry;
	int			i;
	bool		found;
2490 2491 2492 2493 2494 2495 2496 2497 2498 2499

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

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

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

2513 2514
	dbentry->n_xact_commit += (PgStat_Counter) (msg->m_xact_commit);
	dbentry->n_xact_rollback += (PgStat_Counter) (msg->m_xact_rollback);
2515 2516 2517 2518 2519 2520

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

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

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

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


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

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

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

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

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


/* ----------
 * pgstat_recv_dropdb() -
 *
 *	Arrange for dead database removal
 * ----------
 */
static void
pgstat_recv_dropdb(PgStat_MsgDropdb *msg, int len)
{
2630
	PgStat_StatDBEntry *dbentry;
2631 2632 2633 2634 2635 2636 2637 2638 2639 2640

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

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

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

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

2688 2689 2690 2691 2692 2693 2694
	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;
2695 2696

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