PostgreSQL Source Code git master
Loading...
Searching...
No Matches
checkpointer.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * checkpointer.c
4 *
5 * The checkpointer is new as of Postgres 9.2. It handles all checkpoints.
6 * Checkpoints are automatically dispatched after a certain amount of time has
7 * elapsed since the last one, and it can be signaled to perform requested
8 * checkpoints as well. (The GUC parameter that mandates a checkpoint every
9 * so many WAL segments is implemented by having backends signal when they
10 * fill WAL segments; the checkpointer itself doesn't watch for the
11 * condition.)
12 *
13 * The normal termination sequence is that checkpointer is instructed to
14 * execute the shutdown checkpoint by SIGINT. After that checkpointer waits
15 * to be terminated via SIGUSR2, which instructs the checkpointer to exit(0).
16 * All backends must be stopped before SIGINT or SIGUSR2 is issued!
17 *
18 * Emergency termination is by SIGQUIT; like any backend, the checkpointer
19 * will simply abort and exit on SIGQUIT.
20 *
21 * If the checkpointer exits unexpectedly, the postmaster treats that the same
22 * as a backend crash: shared memory may be corrupted, so remaining backends
23 * should be killed by SIGQUIT and then a recovery cycle started. (Even if
24 * shared memory isn't corrupted, we have lost information about which
25 * files need to be fsync'd for the next checkpoint, and so a system
26 * restart needs to be forced.)
27 *
28 *
29 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
30 *
31 *
32 * IDENTIFICATION
33 * src/backend/postmaster/checkpointer.c
34 *
35 *-------------------------------------------------------------------------
36 */
37#include "postgres.h"
38
39#include <sys/time.h>
40#include <time.h>
41
42#include "access/xlog.h"
44#include "access/xlogrecovery.h"
45#include "catalog/pg_authid.h"
46#include "commands/defrem.h"
47#include "libpq/pqsignal.h"
48#include "miscadmin.h"
49#include "pgstat.h"
50#include "port/atomics.h"
52#include "postmaster/bgwriter.h"
54#include "replication/syncrep.h"
55#include "storage/aio_subsys.h"
56#include "storage/bufmgr.h"
58#include "storage/fd.h"
59#include "storage/ipc.h"
60#include "storage/lwlock.h"
61#include "storage/pmsignal.h"
62#include "storage/proc.h"
63#include "storage/procsignal.h"
64#include "storage/shmem.h"
65#include "storage/smgr.h"
66#include "storage/spin.h"
67#include "storage/subsystems.h"
68#include "utils/acl.h"
69#include "utils/guc.h"
70#include "utils/memutils.h"
71#include "utils/resowner.h"
72#include "utils/wait_event.h"
73
74
75/*----------
76 * Shared memory area for communication between checkpointer and backends
77 *
78 * The ckpt counters allow backends to watch for completion of a checkpoint
79 * request they send. Here's how it works:
80 * * At start of a checkpoint, checkpointer reads (and clears) the request
81 * flags and increments ckpt_started, while holding ckpt_lck.
82 * * On completion of a checkpoint, checkpointer sets ckpt_done to
83 * equal ckpt_started.
84 * * On failure of a checkpoint, checkpointer increments ckpt_failed
85 * and sets ckpt_done to equal ckpt_started.
86 *
87 * The algorithm for backends is:
88 * 1. Record current values of ckpt_failed and ckpt_started, and
89 * set request flags, while holding ckpt_lck.
90 * 2. Send signal to request checkpoint.
91 * 3. Sleep until ckpt_started changes. Now you know a checkpoint has
92 * begun since you started this algorithm (although *not* that it was
93 * specifically initiated by your signal), and that it is using your flags.
94 * 4. Record new value of ckpt_started.
95 * 5. Sleep until ckpt_done >= saved value of ckpt_started. (Use modulo
96 * arithmetic here in case counters wrap around.) Now you know a
97 * checkpoint has started and completed, but not whether it was
98 * successful.
99 * 6. If ckpt_failed is different from the originally saved value,
100 * assume request failed; otherwise it was definitely successful.
101 *
102 * ckpt_flags holds the OR of the checkpoint request flags sent by all
103 * requesting backends since the last checkpoint start. The flags are
104 * chosen so that OR'ing is the correct way to combine multiple requests.
105 *
106 * The requests array holds fsync requests sent by backends and not yet
107 * absorbed by the checkpointer.
108 *
109 * Unlike the checkpoint fields, requests related fields are protected by
110 * CheckpointerCommLock.
111 *----------
112 */
113typedef struct
114{
115 SyncRequestType type; /* request type */
116 FileTag ftag; /* file identifier */
118
119typedef struct
120{
121 pid_t checkpointer_pid; /* PID (0 if not started) */
122
123 slock_t ckpt_lck; /* protects all the ckpt_* fields */
124
125 int ckpt_started; /* advances when checkpoint starts */
126 int ckpt_done; /* advances when checkpoint done */
127 int ckpt_failed; /* advances when checkpoint fails */
128
129 int ckpt_flags; /* checkpoint flags, as defined in xlog.h */
130
131 ConditionVariable start_cv; /* signaled when ckpt_started advances */
132 ConditionVariable done_cv; /* signaled when ckpt_done advances */
133
134 int num_requests; /* current # of requests */
135 int max_requests; /* allocated array size */
136
137 int head; /* Index of the first request in the ring
138 * buffer */
139 int tail; /* Index of the last request in the ring
140 * buffer */
141
142 /* The ring buffer of pending checkpointer requests */
145
147
148static void CheckpointerShmemRequest(void *arg);
149static void CheckpointerShmemInit(void *arg);
150
155
156/* interval for calling AbsorbSyncRequests in CheckpointWriteDelay */
157#define WRITES_PER_ABSORB 1000
158
159/* Maximum number of checkpointer requests to process in one batch */
160#define CKPT_REQ_BATCH_SIZE 10000
161
162/* Max number of requests the checkpointer request queue can hold */
163#define MAX_CHECKPOINT_REQUESTS 10000000
164
165/*
166 * GUC parameters
167 */
171
172/*
173 * Private state
174 */
175static bool ckpt_active = false;
176static volatile sig_atomic_t ShutdownXLOGPending = false;
177
178/* these values are valid when ckpt_active is true: */
182
185
186/* Prototypes for private functions */
187
188static void ProcessCheckpointerInterrupts(void);
189static void CheckArchiveTimeout(void);
190static bool IsCheckpointOnSchedule(double progress);
191static bool FastCheckpointRequested(void);
192static bool CompactCheckpointerRequestQueue(void);
193static void UpdateSharedMemoryConfig(void);
194
195/* Signal handlers */
196static void ReqShutdownXLOG(SIGNAL_ARGS);
197
198
199/*
200 * Main entry point for checkpointer process
201 *
202 * This is invoked from AuxiliaryProcessMain, which has already created the
203 * basic execution environment, but not enabled signals yet.
204 */
205void
207{
210
212
214
216
217 /*
218 * Properly accept or ignore signals the postmaster might send us
219 *
220 * Note: we deliberately ignore SIGTERM, because during a standard Unix
221 * system shutdown cycle, init will SIGTERM all processes at once. We
222 * want to wait for the backends to exit, whereupon the postmaster will
223 * tell us it's okay to shut down (via SIGUSR2).
224 */
227 pqsignal(SIGTERM, PG_SIG_IGN); /* ignore SIGTERM */
228 /* SIGQUIT handler was already set up by InitPostmasterChild */
233
234 /*
235 * Reset some signals that are accepted by postmaster but not here
236 */
238
239 /*
240 * Initialize so that first time-driven event happens at the correct time.
241 */
243
244 /*
245 * Write out stats after shutdown. This needs to be called by exactly one
246 * process during a normal shutdown, and since checkpointer is shut down
247 * very late...
248 *
249 * While e.g. walsenders are active after the shutdown checkpoint has been
250 * written (and thus could produce more stats), checkpointer stays around
251 * after the shutdown checkpoint has been written. postmaster will only
252 * signal checkpointer to exit after all processes that could emit stats
253 * have been shut down.
254 */
256
257 /*
258 * Create a memory context that we will do all our work in. We do this so
259 * that we can reset the context during error recovery and thereby avoid
260 * possible memory leaks. Formerly this code just ran in
261 * TopMemoryContext, but resetting that would be a really bad idea.
262 */
264 "Checkpointer",
267
268 /*
269 * If an exception is encountered, processing resumes here.
270 *
271 * You might wonder why this isn't coded as an infinite loop around a
272 * PG_TRY construct. The reason is that this is the bottom of the
273 * exception stack, and so with PG_TRY there would be no exception handler
274 * in force at all during the CATCH part. By leaving the outermost setjmp
275 * always active, we have at least some chance of recovering from an error
276 * during error recovery. (If we get into an infinite loop thereby, it
277 * will soon be stopped by overflow of elog.c's internal state stack.)
278 *
279 * Note that we use sigsetjmp(..., 1), so that the prevailing signal mask
280 * (to wit, BlockSig) will be restored when longjmp'ing to here. Thus,
281 * signals other than SIGQUIT will be blocked until we complete error
282 * recovery. It might seem that this policy makes the HOLD_INTERRUPTS()
283 * call redundant, but it is not since InterruptPending might be set
284 * already.
285 */
286 if (sigsetjmp(local_sigjmp_buf, 1) != 0)
287 {
288 /* Since not using PG_TRY, must reset error stack by hand */
290
291 /* Prevent interrupts while cleaning up */
293
294 /* Report the error to the server log */
296
297 /*
298 * These operations are really just a minimal subset of
299 * AbortTransaction(). We don't have very many resources to worry
300 * about in checkpointer, but we do have LWLocks, buffers, and temp
301 * files.
302 */
309 AtEOXact_Buffers(false);
311 AtEOXact_Files(false);
312 AtEOXact_HashTables(false);
313
314 /* Warn any waiting backends that the checkpoint failed. */
315 if (ckpt_active)
316 {
321
323
324 ckpt_active = false;
325 }
326
327 /*
328 * Now return to normal top-level context and clear ErrorContext for
329 * next time.
330 */
333
334 /* Flush any leaked data in the top-level context */
336
337 /* Now we can allow interrupts again */
339
340 /*
341 * Sleep at least 1 second after any error. A write error is likely
342 * to be repeated, and we don't want to be filling the error logs as
343 * fast as we can.
344 */
345 pg_usleep(1000000L);
346 }
347
348 /* We can now handle ereport(ERROR) */
350
351 /*
352 * Unblock signals (they were blocked when the postmaster forked us)
353 */
355
356 /*
357 * Ensure all shared memory values are set correctly for the config. Doing
358 * this here ensures no race conditions from other concurrent updaters.
359 */
361
362 /*
363 * Loop until we've been asked to write the shutdown checkpoint or
364 * terminate.
365 */
366 for (;;)
367 {
368 bool do_checkpoint = false;
369 int flags = 0;
371 int elapsed_secs;
372 int cur_timeout;
373 bool chkpt_or_rstpt_requested = false;
374 bool chkpt_or_rstpt_timed = false;
375
376 /* Clear any already-pending wakeups */
378
379 /*
380 * Process any requests or signals received recently.
381 */
383
386 break;
387
388 /*
389 * Detect a pending checkpoint request by checking whether the flags
390 * word in shared memory is nonzero. We shouldn't need to acquire the
391 * ckpt_lck for this.
392 */
393 if (((volatile CheckpointerShmemStruct *) CheckpointerShmem)->ckpt_flags)
394 {
395 do_checkpoint = true;
397 }
398
399 /*
400 * Force a checkpoint if too much time has elapsed since the last one.
401 * Note that we count a timed checkpoint in stats only when this
402 * occurs without an external request, but we set the CAUSE_TIME flag
403 * bit even if there is also an external request.
404 */
405 now = (pg_time_t) time(NULL);
408 {
409 if (!do_checkpoint)
411 do_checkpoint = true;
412 flags |= CHECKPOINT_CAUSE_TIME;
413 }
414
415 /*
416 * Do a checkpoint if requested.
417 */
418 if (do_checkpoint)
419 {
420 bool ckpt_performed = false;
421 bool do_restartpoint;
422
423 /* Check if we should perform a checkpoint or a restartpoint. */
425
426 /*
427 * Atomically fetch the request flags to figure out what kind of a
428 * checkpoint we should perform, and increase the started-counter
429 * to acknowledge that we've started a new checkpoint.
430 */
436
438
439 /*
440 * The end-of-recovery checkpoint is a real checkpoint that's
441 * performed while we're still in recovery.
442 */
443 if (flags & CHECKPOINT_END_OF_RECOVERY)
444 do_restartpoint = false;
445
447 {
448 chkpt_or_rstpt_timed = false;
449 if (do_restartpoint)
451 else
453 }
454
456 {
458 if (do_restartpoint)
460 else
462 }
463
464 /*
465 * We will warn if (a) too soon since last checkpoint (whatever
466 * caused it) and (b) somebody set the CHECKPOINT_CAUSE_XLOG flag
467 * since the last checkpoint start. Note in particular that this
468 * implementation will not generate warnings caused by
469 * CheckPointTimeout < CheckPointWarning.
470 */
471 if (!do_restartpoint &&
472 (flags & CHECKPOINT_CAUSE_XLOG) &&
474 ereport(LOG,
475 (errmsg_plural("checkpoints are occurring too frequently (%d second apart)",
476 "checkpoints are occurring too frequently (%d seconds apart)",
479 errhint("Consider increasing the configuration parameter \"%s\".", "max_wal_size")));
480
481 /*
482 * Initialize checkpointer-private variables used during
483 * checkpoint.
484 */
485 ckpt_active = true;
486 if (do_restartpoint)
488 else
492
493 /*
494 * Do the checkpoint.
495 */
496 if (!do_restartpoint)
498 else
500
501 /*
502 * After any checkpoint, free all smgr objects. Otherwise we
503 * would never do so for dropped relations, as the checkpointer
504 * does not process shared invalidation messages or call
505 * AtEOXact_SMgr().
506 */
508
509 /*
510 * Indicate checkpoint completion to any waiting backends.
511 */
515
517
518 if (!do_restartpoint)
519 {
520 /*
521 * Note we record the checkpoint start time not end time as
522 * last_checkpoint_time. This is so that time-driven
523 * checkpoints happen at a predictable spacing.
524 */
526
527 if (ckpt_performed)
529 }
530 else
531 {
532 if (ckpt_performed)
533 {
534 /*
535 * The same as for checkpoint. Please see the
536 * corresponding comment.
537 */
539
541 }
542 else
543 {
544 /*
545 * We were not able to perform the restartpoint
546 * (checkpoints throw an ERROR in case of error). Most
547 * likely because we have not received any new checkpoint
548 * WAL records since the last restartpoint. Try again in
549 * 15 s.
550 */
552 }
553 }
554
555 ckpt_active = false;
556
557 /*
558 * We may have received an interrupt during the checkpoint and the
559 * latch might have been reset (e.g. in CheckpointWriteDelay).
560 */
563 break;
564 }
565
566 /*
567 * Disable logical decoding if someone requested it. See comments atop
568 * logicalctl.c.
569 */
571
572 /* Check for archive_timeout and switch xlog files if necessary. */
574
575 /* Report pending statistics to the cumulative stats system */
577 pgstat_report_wal(true);
578
579 /*
580 * If any checkpoint flags have been set, redo the loop to handle the
581 * checkpoint without sleeping.
582 */
583 if (((volatile CheckpointerShmemStruct *) CheckpointerShmem)->ckpt_flags)
584 continue;
585
586 /*
587 * Sleep until we are signaled or it's time for another checkpoint or
588 * xlog file switch.
589 */
590 now = (pg_time_t) time(NULL);
593 continue; /* no sleep for us ... */
596 {
599 continue; /* no sleep for us ... */
601 }
602
605 cur_timeout * 1000L /* convert to ms */ ,
607 }
608
609 /*
610 * From here on, elog(ERROR) should end with exit(1), not send control
611 * back to the sigsetjmp block above.
612 */
613 ExitOnAnyError = true;
614
616 {
617 /*
618 * Close down the database.
619 *
620 * Since ShutdownXLOG() creates restartpoint or checkpoint, and
621 * updates the statistics, increment the checkpoint request and flush
622 * out pending statistic.
623 */
625 ShutdownXLOG(0, 0);
627 pgstat_report_wal(true);
628
629 /*
630 * Tell postmaster that we're done.
631 */
633 ShutdownXLOGPending = false;
634 }
635
636 /*
637 * Wait until we're asked to shut down. By separating the writing of the
638 * shutdown checkpoint from checkpointer exiting, checkpointer can perform
639 * some should-be-as-late-as-possible work like writing out stats.
640 */
641 for (;;)
642 {
643 /* Clear any already-pending wakeups */
645
647
649 break;
650
653 0,
655 }
656
657 /* Normal exit from the checkpointer is here */
658 proc_exit(0); /* done */
659}
660
661/*
662 * Process any new interrupts.
663 */
664static void
666{
669
671 {
672 ConfigReloadPending = false;
674
675 /*
676 * Checkpointer is the last process to shut down, so we ask it to hold
677 * the keys for a range of other tasks required most of which have
678 * nothing to do with checkpointing at all.
679 *
680 * For various reasons, some config values can change dynamically so
681 * the primary copy of them is held in shared memory to make sure all
682 * backends see the same value. We make Checkpointer responsible for
683 * updating the shared memory copy if the parameter setting changes
684 * because of SIGHUP.
685 */
687 }
688
689 /* Perform logging of memory contexts of this process */
692}
693
694/*
695 * CheckArchiveTimeout -- check for archive_timeout and switch xlog files
696 *
697 * This will switch to a new WAL file and force an archive file write if
698 * meaningful activity is recorded in the current WAL file. This includes most
699 * writes, including just a single checkpoint record, but excludes WAL records
700 * that were inserted with the XLOG_MARK_UNIMPORTANT flag being set (like
701 * snapshots of running transactions). Such records, depending on
702 * configuration, occur on regular intervals and don't contain important
703 * information. This avoids generating archives with a few unimportant
704 * records.
705 */
706static void
708{
712
714 return;
715
716 now = (pg_time_t) time(NULL);
717
718 /* First we do a quick check using possibly-stale local state. */
720 return;
721
722 /*
723 * Update local state ... note that last_xlog_switch_time is the last time
724 * a switch was performed *or requested*.
725 */
727
729
730 /* Now we can do the real checks */
732 {
733 /*
734 * Switch segment only when "important" WAL has been logged since the
735 * last segment switch (last_switch_lsn points to end of segment
736 * switch occurred in).
737 */
739 {
741
742 /* mark switch as unimportant, avoids triggering checkpoints */
744
745 /*
746 * If the returned pointer points exactly to a segment boundary,
747 * assume nothing happened.
748 */
750 elog(DEBUG1, "write-ahead log switch forced (\"archive_timeout\"=%d)",
752 }
753
754 /*
755 * Update state in any case, so we don't retry constantly when the
756 * system is idle.
757 */
759 }
760}
761
762/*
763 * Returns true if a fast checkpoint request is pending. (Note that this does
764 * not check the *current* checkpoint's FAST flag, but whether there is one
765 * pending behind it.)
766 */
767static bool
769{
771
772 /*
773 * We don't need to acquire the ckpt_lck in this case because we're only
774 * looking at a single flag bit.
775 */
776 if (cps->ckpt_flags & CHECKPOINT_FAST)
777 return true;
778 return false;
779}
780
781/*
782 * CheckpointWriteDelay -- control rate of checkpoint
783 *
784 * This function is called after each page write performed by BufferSync().
785 * It is responsible for throttling BufferSync()'s write rate to hit
786 * checkpoint_completion_target.
787 *
788 * The checkpoint request flags should be passed in; currently the only one
789 * examined is CHECKPOINT_FAST, which disables delays between writes.
790 *
791 * 'progress' is an estimate of how much of the work has been done, as a
792 * fraction between 0.0 meaning none, and 1.0 meaning all done.
793 */
794void
796{
798
799 /* Do nothing if checkpoint is being executed by non-checkpointer process */
801 return;
802
803 /*
804 * Perform the usual duties and take a nap, unless we're behind schedule,
805 * in which case we just try to catch up as quickly as possible.
806 */
807 if (!(flags & CHECKPOINT_FAST) &&
812 {
814 {
815 ConfigReloadPending = false;
817 /* update shmem copies of config variables */
819 }
820
823
825
826 /* Report interim statistics to the cumulative stats system */
828
829 /*
830 * This sleep used to be connected to bgwriter_delay, typically 200ms.
831 * That resulted in more frequent wakeups if not much work to do.
832 * Checkpointer and bgwriter are no longer related so take the Big
833 * Sleep.
834 */
836 100,
839 }
840 else if (--absorb_counter <= 0)
841 {
842 /*
843 * Absorb pending fsync requests after each WRITES_PER_ABSORB write
844 * operations even when we don't sleep, to prevent overflow of the
845 * fsync request queue.
846 */
849 }
850
851 /* Check for barrier events. */
854}
855
856/*
857 * IsCheckpointOnSchedule -- are we on schedule to finish this checkpoint
858 * (or restartpoint) in time?
859 *
860 * Compares the current progress against the time/segments elapsed since last
861 * checkpoint, and returns true if the progress we've made this far is greater
862 * than the elapsed time/segments.
863 */
864static bool
866{
868 struct timeval now;
869 double elapsed_xlogs,
871
873
874 /* Scale progress according to checkpoint_completion_target. */
876
877 /*
878 * Check against the cached value first. Only do the more expensive
879 * calculations once we reach the target previously calculated. Since
880 * neither time or WAL insert pointer moves backwards, a freshly
881 * calculated value can only be greater than or equal to the cached value.
882 */
884 return false;
885
886 /*
887 * Check progress against WAL segments written and CheckPointSegments.
888 *
889 * We compare the current WAL insert location against the location
890 * computed before calling CreateCheckPoint. The code in XLogInsert that
891 * actually triggers a checkpoint when CheckPointSegments is exceeded
892 * compares against RedoRecPtr, so this is not completely accurate.
893 * However, it's good enough for our purposes, we're only calculating an
894 * estimate anyway.
895 *
896 * During recovery, we compare last replayed WAL record's location with
897 * the location computed before calling CreateRestartPoint. That maintains
898 * the same pacing as we have during checkpoints in normal operation, but
899 * we might exceed max_wal_size by a fair amount. That's because there can
900 * be a large gap between a checkpoint's redo-pointer and the checkpoint
901 * record itself, and we only start the restartpoint after we've seen the
902 * checkpoint record. (The gap is typically up to CheckPointSegments *
903 * checkpoint_completion_target where checkpoint_completion_target is the
904 * value that was in effect when the WAL was generated).
905 */
906 if (RecoveryInProgress())
908 else
912
914 {
916 return false;
917 }
918
919 /*
920 * Check progress against time elapsed and checkpoint_timeout.
921 */
924 now.tv_usec / 1000000.0) / CheckPointTimeout;
925
927 {
929 return false;
930 }
931
932 /* It looks like we're on schedule. */
933 return true;
934}
935
936
937/* --------------------------------
938 * signal handler routines
939 * --------------------------------
940 */
941
942/* SIGINT: set flag to trigger writing of shutdown checkpoint */
943static void
949
950
951/* --------------------------------
952 * communication with backends
953 * --------------------------------
954 */
955
956/*
957 * CheckpointerShmemRequest
958 * Register shared memory space needed for checkpointer
959 */
960static void
962{
963 Size size;
964
965 /*
966 * The size of the requests[] array is arbitrarily set equal to NBuffers.
967 * But there is a cap of MAX_CHECKPOINT_REQUESTS to prevent accumulating
968 * too many checkpoint requests in the ring buffer.
969 */
970 size = offsetof(CheckpointerShmemStruct, requests);
971 size = add_size(size, mul_size(Min(NBuffers,
973 sizeof(CheckpointerRequest)));
974 ShmemRequestStruct(.name = "Checkpointer Data",
975 .size = size,
976 .ptr = (void **) &CheckpointerShmem,
977 );
978}
979
980/*
981 * CheckpointerShmemInit
982 * Initialize checkpointer-related shared memory
983 */
984static void
993
994/*
995 * ExecCheckpoint
996 * Primary entry point for manual CHECKPOINT commands
997 *
998 * This is mainly a wrapper for RequestCheckpoint().
999 */
1000void
1002{
1003 bool fast = true;
1004 bool unlogged = false;
1005
1006 foreach_ptr(DefElem, opt, stmt->options)
1007 {
1008 if (strcmp(opt->defname, "mode") == 0)
1009 {
1010 char *mode = defGetString(opt);
1011
1012 if (strcmp(mode, "spread") == 0)
1013 fast = false;
1014 else if (strcmp(mode, "fast") != 0)
1015 ereport(ERROR,
1017 errmsg("unrecognized value for %s option \"%s\": \"%s\"",
1018 "CHECKPOINT", "mode", mode),
1019 parser_errposition(pstate, opt->location)));
1020 }
1021 else if (strcmp(opt->defname, "flush_unlogged") == 0)
1022 unlogged = defGetBoolean(opt);
1023 else
1024 ereport(ERROR,
1026 errmsg("unrecognized %s option \"%s\"",
1027 "CHECKPOINT", opt->defname),
1028 parser_errposition(pstate, opt->location)));
1029 }
1030
1032 ereport(ERROR,
1034 /* translator: %s is name of an SQL command (e.g., CHECKPOINT) */
1035 errmsg("permission denied to execute %s command",
1036 "CHECKPOINT"),
1037 errdetail("Only roles with privileges of the \"%s\" role may execute this command.",
1038 "pg_checkpoint")));
1039
1041 (fast ? CHECKPOINT_FAST : 0) |
1044}
1045
1046/*
1047 * RequestCheckpoint
1048 * Called in backend processes to request a checkpoint
1049 *
1050 * flags is a bitwise OR of the following:
1051 * CHECKPOINT_IS_SHUTDOWN: checkpoint is for database shutdown.
1052 * CHECKPOINT_END_OF_RECOVERY: checkpoint is for end of WAL recovery.
1053 * CHECKPOINT_FAST: finish the checkpoint ASAP,
1054 * ignoring checkpoint_completion_target parameter.
1055 * CHECKPOINT_FORCE: force a checkpoint even if no XLOG activity has occurred
1056 * since the last one (implied by CHECKPOINT_IS_SHUTDOWN or
1057 * CHECKPOINT_END_OF_RECOVERY, and the CHECKPOINT command).
1058 * CHECKPOINT_WAIT: wait for completion before returning (otherwise,
1059 * just signal checkpointer to do it, and return).
1060 * CHECKPOINT_CAUSE_XLOG: checkpoint is requested due to xlog filling.
1061 * (This affects logging, and in particular enables CheckPointWarning.)
1062 */
1063void
1065{
1066 int ntries;
1067 int old_failed,
1069
1070 /*
1071 * If in a standalone backend, just do it ourselves.
1072 */
1074 {
1075 /*
1076 * There's no point in doing slow checkpoints in a standalone backend,
1077 * because there's no other backends the checkpoint could disrupt.
1078 */
1080
1081 /* Free all smgr objects, as CheckpointerMain() normally would. */
1083
1084 return;
1085 }
1086
1087 /*
1088 * Atomically set the request flags, and take a snapshot of the counters.
1089 * When we see ckpt_started > old_started, we know the flags we set here
1090 * have been seen by checkpointer.
1091 *
1092 * Note that we OR the flags with any existing flags, to avoid overriding
1093 * a "stronger" request by another backend. The flag senses must be
1094 * chosen to make this work!
1095 */
1097
1101
1103
1104 /*
1105 * Set checkpointer's latch to request checkpoint. It's possible that the
1106 * checkpointer hasn't started yet, so we will retry a few times if
1107 * needed. (Actually, more than a few times, since on slow or overloaded
1108 * buildfarm machines, it's been observed that the checkpointer can take
1109 * several seconds to start.) However, if not told to wait for the
1110 * checkpoint to occur, we consider failure to set the latch to be
1111 * nonfatal and merely LOG it. The checkpointer should see the request
1112 * when it does start, with or without the SetLatch().
1113 */
1114#define MAX_SIGNAL_TRIES 600 /* max wait 60.0 sec */
1115 for (ntries = 0;; ntries++)
1116 {
1118
1119 if (checkpointerProc == INVALID_PROC_NUMBER)
1120 {
1121 if (ntries >= MAX_SIGNAL_TRIES || !(flags & CHECKPOINT_WAIT))
1122 {
1123 elog((flags & CHECKPOINT_WAIT) ? ERROR : LOG,
1124 "could not notify checkpoint: checkpointer is not running");
1125 break;
1126 }
1127 }
1128 else
1129 {
1130 SetLatch(&GetPGProcByNumber(checkpointerProc)->procLatch);
1131 /* notified successfully */
1132 break;
1133 }
1134
1136 pg_usleep(100000L); /* wait 0.1 sec, then retry */
1137 }
1138
1139 /*
1140 * If requested, wait for completion. We detect completion according to
1141 * the algorithm given above.
1142 */
1143 if (flags & CHECKPOINT_WAIT)
1144 {
1145 int new_started,
1146 new_failed;
1147
1148 /* Wait for a new checkpoint to start. */
1150 for (;;)
1151 {
1155
1156 if (new_started != old_started)
1157 break;
1158
1161 }
1163
1164 /*
1165 * We are waiting for ckpt_done >= new_started, in a modulo sense.
1166 */
1168 for (;;)
1169 {
1170 int new_done;
1171
1176
1177 if (new_done - new_started >= 0)
1178 break;
1179
1182 }
1184
1185 if (new_failed != old_failed)
1186 ereport(ERROR,
1187 (errmsg("checkpoint request failed"),
1188 errhint("Consult recent messages in the server log for details.")));
1189 }
1190}
1191
1192/*
1193 * ForwardSyncRequest
1194 * Forward a file-fsync request from a backend to the checkpointer
1195 *
1196 * Whenever a backend is compelled to write directly to a relation
1197 * (which should be seldom, if the background writer is getting its job done),
1198 * the backend calls this routine to pass over knowledge that the relation
1199 * is dirty and must be fsync'd before next checkpoint. We also use this
1200 * opportunity to count such writes for statistical purposes.
1201 *
1202 * To avoid holding the lock for longer than necessary, we normally write
1203 * to the requests[] queue without checking for duplicates. The checkpointer
1204 * will have to eliminate dups internally anyway. However, if we discover
1205 * that the queue is full, we make a pass over the entire queue to compact
1206 * it. This is somewhat expensive, but the alternative is for the backend
1207 * to perform its own fsync, which is far more expensive in practice. It
1208 * is theoretically possible a backend fsync might still be necessary, if
1209 * the queue is full and contains no duplicate entries. In that case, we
1210 * let the backend know by returning false.
1211 */
1212bool
1214{
1216 bool too_full;
1217 int insert_pos;
1218
1219 if (!IsUnderPostmaster)
1220 return false; /* probably shouldn't even get here */
1221
1223 elog(ERROR, "ForwardSyncRequest must not be called in checkpointer");
1224
1226
1227 /*
1228 * If the checkpointer isn't running or the request queue is full, the
1229 * backend will have to perform its own fsync request. But before forcing
1230 * that to happen, we can try to compact the request queue.
1231 */
1235 {
1237 return false;
1238 }
1239
1240 /* OK, insert request */
1243 request->ftag = *ftag;
1244 request->type = type;
1245
1248
1249 /* If queue is more than half full, nudge the checkpointer to empty it */
1252
1254
1255 /* ... but not till after we release the lock */
1256 if (too_full)
1257 {
1259
1260 if (checkpointerProc != INVALID_PROC_NUMBER)
1261 SetLatch(&GetPGProcByNumber(checkpointerProc)->procLatch);
1262 }
1263
1264 return true;
1265}
1266
1267/*
1268 * CompactCheckpointerRequestQueue
1269 * Remove duplicates from the request queue to avoid backend fsyncs.
1270 * Returns "true" if any entries were removed.
1271 *
1272 * Although a full fsync request queue is not common, it can lead to severe
1273 * performance problems when it does happen. So far, this situation has
1274 * only been observed to occur when the system is under heavy write load,
1275 * and especially during the "sync" phase of a checkpoint. Without this
1276 * logic, each backend begins doing an fsync for every block written, which
1277 * gets very expensive and can slow down the whole system.
1278 *
1279 * Trying to do this every time the queue is full could lose if there
1280 * aren't any removable entries. But that should be vanishingly rare in
1281 * practice: there's one queue entry per shared buffer.
1282 */
1283static bool
1285{
1287 {
1289 int ring_idx;
1290 };
1291
1292 int n;
1293 int num_skipped = 0;
1294 int head;
1295 int max_requests;
1296 int num_requests;
1297 int read_idx,
1298 write_idx;
1299 HASHCTL ctl;
1300 HTAB *htab;
1301 bool *skip_slot;
1302
1303 /* must hold CheckpointerCommLock in exclusive mode */
1305
1306 /* Avoid memory allocations in a critical section. */
1307 if (CritSectionCount > 0)
1308 return false;
1309
1310 max_requests = CheckpointerShmem->max_requests;
1311 num_requests = CheckpointerShmem->num_requests;
1312
1313 /* Initialize skip_slot array */
1314 skip_slot = palloc0_array(bool, max_requests);
1315
1316 head = CheckpointerShmem->head;
1317
1318 /* Initialize temporary hash table */
1319 ctl.keysize = sizeof(CheckpointerRequest);
1320 ctl.entrysize = sizeof(struct CheckpointerSlotMapping);
1322
1323 htab = hash_create("CompactCheckpointerRequestQueue",
1325 &ctl,
1327
1328 /*
1329 * The basic idea here is that a request can be skipped if it's followed
1330 * by a later, identical request. It might seem more sensible to work
1331 * backwards from the end of the queue and check whether a request is
1332 * *preceded* by an earlier, identical request, in the hopes of doing less
1333 * copying. But that might change the semantics, if there's an
1334 * intervening SYNC_FORGET_REQUEST or SYNC_FILTER_REQUEST, so we do it
1335 * this way. It would be possible to be even smarter if we made the code
1336 * below understand the specific semantics of such requests (it could blow
1337 * away preceding entries that would end up being canceled anyhow), but
1338 * it's not clear that the extra complexity would buy us anything.
1339 */
1340 read_idx = head;
1341 for (n = 0; n < num_requests; n++)
1342 {
1345 bool found;
1346
1347 /*
1348 * We use the request struct directly as a hashtable key. This
1349 * assumes that any padding bytes in the structs are consistently the
1350 * same, which should be okay because we zeroed them in
1351 * CheckpointerShmemInit. Note also that RelFileLocator had better
1352 * contain no pad bytes.
1353 */
1356 if (found)
1357 {
1358 /* Duplicate, so mark the previous occurrence as skippable */
1359 skip_slot[slotmap->ring_idx] = true;
1360 num_skipped++;
1361 }
1362 /* Remember slot containing latest occurrence of this request value */
1363 slotmap->ring_idx = read_idx;
1364
1365 /* Move to the next request in the ring buffer */
1366 read_idx = (read_idx + 1) % max_requests;
1367 }
1368
1369 /* Done with the hash table. */
1371
1372 /* If no duplicates, we're out of luck. */
1373 if (!num_skipped)
1374 {
1376 return false;
1377 }
1378
1379 /* We found some duplicates; remove them. */
1380 read_idx = write_idx = head;
1381 for (n = 0; n < num_requests; n++)
1382 {
1383 /* If this slot is NOT skipped, keep it */
1384 if (!skip_slot[read_idx])
1385 {
1386 /* If the read and write positions are different, copy the request */
1387 if (write_idx != read_idx)
1390
1391 /* Advance the write position */
1392 write_idx = (write_idx + 1) % max_requests;
1393 }
1394
1395 read_idx = (read_idx + 1) % max_requests;
1396 }
1397
1398 /*
1399 * Update ring buffer state: head remains the same, tail moves, count
1400 * decreases
1401 */
1404
1406 (errmsg_internal("compacted fsync request queue from %d entries to %d entries",
1407 num_requests, CheckpointerShmem->num_requests)));
1408
1409 /* Cleanup. */
1411 return true;
1412}
1413
1414/*
1415 * AbsorbSyncRequests
1416 * Retrieve queued sync requests and pass them to sync mechanism.
1417 *
1418 * This is exported because it must be called during CreateCheckPoint;
1419 * we have to be sure we have accepted all pending requests just before
1420 * we start fsync'ing. Since CreateCheckPoint sometimes runs in
1421 * non-checkpointer processes, do nothing if not checkpointer.
1422 */
1423void
1425{
1426 CheckpointerRequest *requests = NULL;
1428 int n,
1429 i;
1430 bool loop;
1431
1432 if (!AmCheckpointerProcess())
1433 return;
1434
1435 do
1436 {
1438
1439 /*---
1440 * We try to avoid holding the lock for a long time by:
1441 * 1. Copying the request array and processing the requests after
1442 * releasing the lock;
1443 * 2. Processing not the whole queue, but only batches of
1444 * CKPT_REQ_BATCH_SIZE at once.
1445 *
1446 * Once we have cleared the requests from shared memory, we must
1447 * PANIC if we then fail to absorb them (e.g., because our hashtable
1448 * runs out of memory). This is because the system cannot run safely
1449 * if we are unable to fsync what we have been told to fsync.
1450 * Fortunately, the hashtable is so small that the problem is quite
1451 * unlikely to arise in practice.
1452 *
1453 * Note: The maximum possible size of a ring buffer is
1454 * MAX_CHECKPOINT_REQUESTS entries, which fit into a maximum palloc
1455 * allocation size of 1Gb. Our maximum batch size,
1456 * CKPT_REQ_BATCH_SIZE, is even smaller.
1457 */
1459 if (n > 0)
1460 {
1461 if (!requests)
1462 requests = (CheckpointerRequest *) palloc(n * sizeof(CheckpointerRequest));
1463
1464 for (i = 0; i < n; i++)
1465 {
1468 }
1469
1471
1472 }
1473
1475
1476 /* Are there any requests in the queue? If so, keep going. */
1478
1480
1481 for (request = requests; n > 0; request++, n--)
1482 RememberSyncRequest(&request->ftag, request->type);
1483
1485 } while (loop);
1486
1487 if (requests)
1488 pfree(requests);
1489}
1490
1491/*
1492 * Update any shared memory configurations based on config parameters
1493 */
1494static void
1496{
1497 /* update global shmem state for sync rep */
1499
1500 /*
1501 * If full_page_writes has been changed by SIGHUP, we update it in shared
1502 * memory and write an XLOG_FPW_CHANGE record.
1503 */
1505
1506 elog(DEBUG2, "checkpointer updated shared memory configuration values");
1507}
1508
1509/*
1510 * FirstCallSinceLastCheckpoint allows a process to take an action once
1511 * per checkpoint cycle by asynchronously checking for checkpoint completion.
1512 */
1513bool
1515{
1516 static int ckpt_done = 0;
1517 int new_done;
1518 bool FirstCall = false;
1519
1523
1524 if (new_done != ckpt_done)
1525 FirstCall = true;
1526
1527 ckpt_done = new_done;
1528
1529 return FirstCall;
1530}
1531
1532/*
1533 * Wake up the checkpointer process.
1534 */
1535void
1537{
1539
1540 if (checkpointerProc != INVALID_PROC_NUMBER)
1541 SetLatch(&GetPGProcByNumber(checkpointerProc)->procLatch);
1542}
bool has_privs_of_role(Oid member, Oid role)
Definition acl.c:5317
void pgaio_error_cleanup(void)
Definition aio.c:1175
static uint32 pg_atomic_read_u32(volatile pg_atomic_uint32 *ptr)
Definition atomics.h:232
void AuxiliaryProcessMainCommon(void)
Definition auxprocess.c:41
sigset_t UnBlockSig
Definition pqsignal.c:22
Datum now(PG_FUNCTION_ARGS)
Definition timestamp.c:1613
void AtEOXact_Buffers(bool isCommit)
Definition bufmgr.c:4222
void UnlockBuffers(void)
Definition bufmgr.c:5875
#define Min(x, y)
Definition c.h:1131
#define Max(x, y)
Definition c.h:1125
#define SIGNAL_ARGS
Definition c.h:1519
#define Assert(condition)
Definition c.h:1002
#define FLEXIBLE_ARRAY_MEMBER
Definition c.h:617
size_t Size
Definition c.h:748
static void UpdateSharedMemoryConfig(void)
static bool FastCheckpointRequested(void)
static XLogRecPtr ckpt_start_recptr
static bool IsCheckpointOnSchedule(double progress)
static void CheckpointerShmemRequest(void *arg)
bool ForwardSyncRequest(const FileTag *ftag, SyncRequestType type)
static void ReqShutdownXLOG(SIGNAL_ARGS)
static void CheckArchiveTimeout(void)
static double ckpt_cached_elapsed
static bool ckpt_active
void CheckpointerMain(const void *startup_data, size_t startup_data_len)
static bool CompactCheckpointerRequestQueue(void)
static void ProcessCheckpointerInterrupts(void)
static volatile sig_atomic_t ShutdownXLOGPending
#define CKPT_REQ_BATCH_SIZE
#define MAX_SIGNAL_TRIES
void WakeupCheckpointer(void)
void AbsorbSyncRequests(void)
#define WRITES_PER_ABSORB
static void CheckpointerShmemInit(void *arg)
double CheckPointCompletionTarget
static pg_time_t last_xlog_switch_time
#define MAX_CHECKPOINT_REQUESTS
int CheckPointWarning
const ShmemCallbacks CheckpointerShmemCallbacks
bool FirstCallSinceLastCheckpoint(void)
static CheckpointerShmemStruct * CheckpointerShmem
int CheckPointTimeout
void RequestCheckpoint(int flags)
static pg_time_t last_checkpoint_time
void ExecCheckpoint(ParseState *pstate, CheckPointStmt *stmt)
void CheckpointWriteDelay(int flags, double progress)
static pg_time_t ckpt_start_time
bool ConditionVariableCancelSleep(void)
void ConditionVariableBroadcast(ConditionVariable *cv)
void ConditionVariablePrepareToSleep(ConditionVariable *cv)
void ConditionVariableInit(ConditionVariable *cv)
void ConditionVariableSleep(ConditionVariable *cv, uint32 wait_event_info)
char * defGetString(DefElem *def)
Definition define.c:34
bool defGetBoolean(DefElem *def)
Definition define.c:93
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition dynahash.c:889
void AtEOXact_HashTables(bool isCommit)
Definition dynahash.c:1864
HTAB * hash_create(const char *tabname, int64 nelem, const HASHCTL *info, int flags)
Definition dynahash.c:360
void hash_destroy(HTAB *hashp)
Definition dynahash.c:802
Datum arg
Definition elog.c:1323
void EmitErrorReport(void)
Definition elog.c:1883
ErrorContextCallback * error_context_stack
Definition elog.c:100
void FlushErrorState(void)
Definition elog.c:2063
int errcode(int sqlerrcode)
Definition elog.c:875
sigjmp_buf * PG_exception_stack
Definition elog.c:102
#define LOG
Definition elog.h:32
int errhint(const char *fmt,...) pg_attribute_printf(1
int errdetail(const char *fmt,...) pg_attribute_printf(1
int int errmsg_internal(const char *fmt,...) pg_attribute_printf(1
int int int errmsg_plural(const char *fmt_singular, const char *fmt_plural, unsigned long n,...) pg_attribute_printf(1
#define DEBUG2
Definition elog.h:30
#define DEBUG1
Definition elog.h:31
#define ERROR
Definition elog.h:40
#define elog(elevel,...)
Definition elog.h:228
#define ereport(elevel,...)
Definition elog.h:152
static double elapsed_time(instr_time *starttime)
Definition explain.c:1171
void AtEOXact_Files(bool isCommit)
Definition fd.c:3212
#define palloc0_array(type, count)
Definition fe_memutils.h:92
volatile sig_atomic_t LogMemoryContextPending
Definition globals.c:41
volatile sig_atomic_t ProcSignalBarrierPending
Definition globals.c:40
int NBuffers
Definition globals.c:144
int MyProcPid
Definition globals.c:49
bool IsUnderPostmaster
Definition globals.c:122
volatile uint32 CritSectionCount
Definition globals.c:45
bool ExitOnAnyError
Definition globals.c:125
bool IsPostmasterEnvironment
Definition globals.c:121
struct Latch * MyLatch
Definition globals.c:65
void ProcessConfigFile(GucContext context)
Definition guc-file.l:120
@ PGC_SIGHUP
Definition guc.h:75
@ HASH_ENTER
Definition hsearch.h:109
#define HASH_CONTEXT
Definition hsearch.h:97
#define HASH_ELEM
Definition hsearch.h:90
#define HASH_BLOBS
Definition hsearch.h:92
#define stmt
void SignalHandlerForShutdownRequest(SIGNAL_ARGS)
Definition interrupt.c:104
volatile sig_atomic_t ShutdownRequestPending
Definition interrupt.c:28
volatile sig_atomic_t ConfigReloadPending
Definition interrupt.c:27
void SignalHandlerForConfigReload(SIGNAL_ARGS)
Definition interrupt.c:61
void before_shmem_exit(pg_on_exit_callback function, Datum arg)
Definition ipc.c:344
void proc_exit(int code)
Definition ipc.c:105
int i
Definition isn.c:77
void SetLatch(Latch *latch)
Definition latch.c:290
void ResetLatch(Latch *latch)
Definition latch.c:374
int WaitLatch(Latch *latch, int wakeEvents, long timeout, uint32 wait_event_info)
Definition latch.c:172
void DisableLogicalDecodingIfNecessary(void)
Definition logicalctl.c:450
bool LWLockHeldByMe(LWLock *lock)
Definition lwlock.c:1885
bool LWLockAcquire(LWLock *lock, LWLockMode mode)
Definition lwlock.c:1150
void LWLockRelease(LWLock *lock)
Definition lwlock.c:1767
void LWLockReleaseAll(void)
Definition lwlock.c:1866
@ LW_EXCLUSIVE
Definition lwlock.h:104
void MemoryContextReset(MemoryContext context)
Definition mcxt.c:406
Size add_size(Size s1, Size s2)
Definition mcxt.c:1733
void pfree(void *pointer)
Definition mcxt.c:1619
MemoryContext TopMemoryContext
Definition mcxt.c:167
Size mul_size(Size s1, Size s2)
Definition mcxt.c:1752
void * palloc(Size size)
Definition mcxt.c:1390
MemoryContext CurrentMemoryContext
Definition mcxt.c:161
void ProcessLogMemoryContextInterrupt(void)
Definition mcxt.c:1343
#define AllocSetContextCreate
Definition memutils.h:129
#define ALLOCSET_DEFAULT_SIZES
Definition memutils.h:160
#define AmCheckpointerProcess()
Definition miscadmin.h:395
#define RESUME_INTERRUPTS()
Definition miscadmin.h:138
#define START_CRIT_SECTION()
Definition miscadmin.h:152
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:125
#define HOLD_INTERRUPTS()
Definition miscadmin.h:136
#define END_CRIT_SECTION()
Definition miscadmin.h:154
Oid GetUserId(void)
Definition miscinit.c:470
static char * errmsg
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition palloc.h:138
int parser_errposition(ParseState *pstate, int location)
Definition parse_node.c:106
static PgChecksumMode mode
#define foreach_ptr(type, var, lst)
Definition pg_list.h:501
static int progress
Definition pgbench.c:262
void pgstat_before_server_shutdown(int code, Datum arg)
Definition pgstat.c:590
void pgstat_report_checkpointer(void)
PgStat_CheckpointerStats PendingCheckpointerStats
void pgstat_report_wal(bool force)
Definition pgstat_wal.c:46
int64 pg_time_t
Definition pgtime.h:23
void SendPostmasterSignal(PMSignalReason reason)
Definition pmsignal.c:164
@ PMSIGNAL_XLOG_IS_SHUTDOWN
Definition pmsignal.h:45
#define pqsignal
Definition port.h:548
#define PG_SIG_IGN
Definition port.h:552
#define PG_SIG_DFL
Definition port.h:551
static int fb(int x)
#define GetPGProcByNumber(n)
Definition proc.h:506
#define INVALID_PROC_NUMBER
Definition procnumber.h:26
int ProcNumber
Definition procnumber.h:24
void ProcessProcSignalBarrier(void)
Definition procsignal.c:511
void procsignal_sigusr1_handler(SIGNAL_ARGS)
Definition procsignal.c:696
tree ctl
Definition radixtree.h:1838
void ReleaseAuxProcessResources(bool isCommit)
Definition resowner.c:1026
#define ShmemRequestStruct(...)
Definition shmem.h:176
void pg_usleep(long microsec)
Definition signal.c:53
void smgrdestroyall(void)
Definition smgr.c:386
void AtEOXact_SMgr(void)
Definition smgr.c:1017
static void SpinLockRelease(volatile slock_t *lock)
Definition spin.h:62
static void SpinLockAcquire(volatile slock_t *lock)
Definition spin.h:56
static void SpinLockInit(volatile slock_t *lock)
Definition spin.h:50
PROC_HDR * ProcGlobal
Definition proc.c:74
SyncRequestType type
ConditionVariable done_cv
ConditionVariable start_cv
CheckpointerRequest requests[FLEXIBLE_ARRAY_MEMBER]
Definition sync.h:51
pg_atomic_uint32 checkpointerProc
Definition proc.h:489
PgStat_Counter restartpoints_requested
Definition pgstat.h:266
PgStat_Counter num_requested
Definition pgstat.h:263
PgStat_Counter num_performed
Definition pgstat.h:264
PgStat_Counter restartpoints_timed
Definition pgstat.h:265
PgStat_Counter num_timed
Definition pgstat.h:262
PgStat_Counter restartpoints_performed
Definition pgstat.h:267
ShmemRequestCallback request_fn
Definition shmem.h:133
void RememberSyncRequest(const FileTag *ftag, SyncRequestType type)
Definition sync.c:488
SyncRequestType
Definition sync.h:24
void SyncRepUpdateSyncStandbysDefined(void)
Definition syncrep.c:970
static void pgstat_report_wait_end(void)
Definition wait_event.h:83
const char * type
const char * name
#define WL_TIMEOUT
#define WL_EXIT_ON_PM_DEATH
#define WL_LATCH_SET
#define SIGCHLD
Definition win32_port.h:168
#define SIGHUP
Definition win32_port.h:158
#define SIGPIPE
Definition win32_port.h:163
#define SIGUSR1
Definition win32_port.h:170
#define SIGALRM
Definition win32_port.h:164
#define SIGUSR2
Definition win32_port.h:171
int gettimeofday(struct timeval *tp, void *tzp)
void UpdateFullPageWrites(void)
Definition xlog.c:8755
bool RecoveryInProgress(void)
Definition xlog.c:6835
XLogRecPtr RequestXLogSwitch(bool mark_unimportant)
Definition xlog.c:8607
bool CreateRestartPoint(int flags)
Definition xlog.c:8129
XLogRecPtr GetInsertRecPtr(void)
Definition xlog.c:6983
int wal_segment_size
Definition xlog.c:150
void ShutdownXLOG(int code, Datum arg)
Definition xlog.c:7103
int XLogArchiveTimeout
Definition xlog.c:125
pg_time_t GetLastSegSwitchData(XLogRecPtr *lastSwitchLSN)
Definition xlog.c:7086
XLogRecPtr GetLastImportantRecPtr(void)
Definition xlog.c:7057
bool CreateCheckPoint(int flags)
Definition xlog.c:7400
int CheckPointSegments
Definition xlog.c:163
#define CHECKPOINT_FLUSH_UNLOGGED
Definition xlog.h:155
#define CHECKPOINT_CAUSE_XLOG
Definition xlog.h:160
#define CHECKPOINT_END_OF_RECOVERY
Definition xlog.h:152
#define CHECKPOINT_CAUSE_TIME
Definition xlog.h:161
#define CHECKPOINT_REQUESTED
Definition xlog.h:158
#define CHECKPOINT_FORCE
Definition xlog.h:154
#define CHECKPOINT_WAIT
Definition xlog.h:157
#define CHECKPOINT_FAST
Definition xlog.h:153
#define XLogSegmentOffset(xlogptr, wal_segsz_bytes)
uint64 XLogRecPtr
Definition xlogdefs.h:21
XLogRecPtr GetXLogReplayRecPtr(TimeLineID *replayTLI)