PostgreSQL Source Code  git master
xlogutils.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * xlogutils.c
4  *
5  * PostgreSQL write-ahead log manager utility routines
6  *
7  * This file contains support routines that are used by XLOG replay functions.
8  * None of this code is used during normal system operation.
9  *
10  *
11  * Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
12  * Portions Copyright (c) 1994, Regents of the University of California
13  *
14  * src/backend/access/transam/xlogutils.c
15  *
16  *-------------------------------------------------------------------------
17  */
18 #include "postgres.h"
19 
20 #include <unistd.h>
21 
22 #include "access/timeline.h"
23 #include "access/xlog.h"
24 #include "access/xlog_internal.h"
25 #include "access/xlogutils.h"
26 #include "miscadmin.h"
27 #include "pgstat.h"
28 #include "storage/smgr.h"
29 #include "utils/guc.h"
30 #include "utils/hsearch.h"
31 #include "utils/rel.h"
32 
33 
34 /*
35  * During XLOG replay, we may see XLOG records for incremental updates of
36  * pages that no longer exist, because their relation was later dropped or
37  * truncated. (Note: this is only possible when full_page_writes = OFF,
38  * since when it's ON, the first reference we see to a page should always
39  * be a full-page rewrite not an incremental update.) Rather than simply
40  * ignoring such records, we make a note of the referenced page, and then
41  * complain if we don't actually see a drop or truncate covering the page
42  * later in replay.
43  */
44 typedef struct xl_invalid_page_key
45 {
46  RelFileNode node; /* the relation */
47  ForkNumber forkno; /* the fork number */
48  BlockNumber blkno; /* the page */
50 
51 typedef struct xl_invalid_page
52 {
53  xl_invalid_page_key key; /* hash key ... must be first */
54  bool present; /* page existed but contained zeroes */
56 
57 static HTAB *invalid_page_tab = NULL;
58 
59 
60 /* Report a reference to an invalid page */
61 static void
63  BlockNumber blkno, bool present)
64 {
65  char *path = relpathperm(node, forkno);
66 
67  if (present)
68  elog(elevel, "page %u of relation %s is uninitialized",
69  blkno, path);
70  else
71  elog(elevel, "page %u of relation %s does not exist",
72  blkno, path);
73  pfree(path);
74 }
75 
76 /* Log a reference to an invalid page */
77 static void
79  bool present)
80 {
82  xl_invalid_page *hentry;
83  bool found;
84 
85  /*
86  * Once recovery has reached a consistent state, the invalid-page table
87  * should be empty and remain so. If a reference to an invalid page is
88  * found after consistency is reached, PANIC immediately. This might seem
89  * aggressive, but it's better than letting the invalid reference linger
90  * in the hash table until the end of recovery and PANIC there, which
91  * might come only much later if this is a standby server.
92  */
94  {
95  report_invalid_page(WARNING, node, forkno, blkno, present);
96  elog(PANIC, "WAL contains references to invalid pages");
97  }
98 
99  /*
100  * Log references to invalid pages at DEBUG1 level. This allows some
101  * tracing of the cause (note the elog context mechanism will tell us
102  * something about the XLOG record that generated the reference).
103  */
105  report_invalid_page(DEBUG1, node, forkno, blkno, present);
106 
107  if (invalid_page_tab == NULL)
108  {
109  /* create hash table when first needed */
110  HASHCTL ctl;
111 
112  memset(&ctl, 0, sizeof(ctl));
113  ctl.keysize = sizeof(xl_invalid_page_key);
114  ctl.entrysize = sizeof(xl_invalid_page);
115 
116  invalid_page_tab = hash_create("XLOG invalid-page table",
117  100,
118  &ctl,
120  }
121 
122  /* we currently assume xl_invalid_page_key contains no padding */
123  key.node = node;
124  key.forkno = forkno;
125  key.blkno = blkno;
126  hentry = (xl_invalid_page *)
127  hash_search(invalid_page_tab, (void *) &key, HASH_ENTER, &found);
128 
129  if (!found)
130  {
131  /* hash_search already filled in the key */
132  hentry->present = present;
133  }
134  else
135  {
136  /* repeat reference ... leave "present" as it was */
137  }
138 }
139 
140 /* Forget any invalid pages >= minblkno, because they've been dropped */
141 static void
143 {
145  xl_invalid_page *hentry;
146 
147  if (invalid_page_tab == NULL)
148  return; /* nothing to do */
149 
150  hash_seq_init(&status, invalid_page_tab);
151 
152  while ((hentry = (xl_invalid_page *) hash_seq_search(&status)) != NULL)
153  {
154  if (RelFileNodeEquals(hentry->key.node, node) &&
155  hentry->key.forkno == forkno &&
156  hentry->key.blkno >= minblkno)
157  {
159  {
160  char *path = relpathperm(hentry->key.node, forkno);
161 
162  elog(DEBUG2, "page %u of relation %s has been dropped",
163  hentry->key.blkno, path);
164  pfree(path);
165  }
166 
167  if (hash_search(invalid_page_tab,
168  (void *) &hentry->key,
169  HASH_REMOVE, NULL) == NULL)
170  elog(ERROR, "hash table corrupted");
171  }
172  }
173 }
174 
175 /* Forget any invalid pages in a whole database */
176 static void
178 {
180  xl_invalid_page *hentry;
181 
182  if (invalid_page_tab == NULL)
183  return; /* nothing to do */
184 
185  hash_seq_init(&status, invalid_page_tab);
186 
187  while ((hentry = (xl_invalid_page *) hash_seq_search(&status)) != NULL)
188  {
189  if (hentry->key.node.dbNode == dbid)
190  {
192  {
193  char *path = relpathperm(hentry->key.node, hentry->key.forkno);
194 
195  elog(DEBUG2, "page %u of relation %s has been dropped",
196  hentry->key.blkno, path);
197  pfree(path);
198  }
199 
200  if (hash_search(invalid_page_tab,
201  (void *) &hentry->key,
202  HASH_REMOVE, NULL) == NULL)
203  elog(ERROR, "hash table corrupted");
204  }
205  }
206 }
207 
208 /* Are there any unresolved references to invalid pages? */
209 bool
211 {
212  if (invalid_page_tab != NULL &&
213  hash_get_num_entries(invalid_page_tab) > 0)
214  return true;
215  return false;
216 }
217 
218 /* Complain about any remaining invalid-page entries */
219 void
221 {
223  xl_invalid_page *hentry;
224  bool foundone = false;
225 
226  if (invalid_page_tab == NULL)
227  return; /* nothing to do */
228 
229  hash_seq_init(&status, invalid_page_tab);
230 
231  /*
232  * Our strategy is to emit WARNING messages for all remaining entries and
233  * only PANIC after we've dumped all the available info.
234  */
235  while ((hentry = (xl_invalid_page *) hash_seq_search(&status)) != NULL)
236  {
237  report_invalid_page(WARNING, hentry->key.node, hentry->key.forkno,
238  hentry->key.blkno, hentry->present);
239  foundone = true;
240  }
241 
242  if (foundone)
243  elog(PANIC, "WAL contains references to invalid pages");
244 
245  hash_destroy(invalid_page_tab);
246  invalid_page_tab = NULL;
247 }
248 
249 
250 /*
251  * XLogReadBufferForRedo
252  * Read a page during XLOG replay
253  *
254  * Reads a block referenced by a WAL record into shared buffer cache, and
255  * determines what needs to be done to redo the changes to it. If the WAL
256  * record includes a full-page image of the page, it is restored.
257  *
258  * 'lsn' is the LSN of the record being replayed. It is compared with the
259  * page's LSN to determine if the record has already been replayed.
260  * 'block_id' is the ID number the block was registered with, when the WAL
261  * record was created.
262  *
263  * Returns one of the following:
264  *
265  * BLK_NEEDS_REDO - changes from the WAL record need to be applied
266  * BLK_DONE - block doesn't need replaying
267  * BLK_RESTORED - block was restored from a full-page image included in
268  * the record
269  * BLK_NOTFOUND - block was not found (because it was truncated away by
270  * an operation later in the WAL stream)
271  *
272  * On return, the buffer is locked in exclusive-mode, and returned in *buf.
273  * Note that the buffer is locked and returned even if it doesn't need
274  * replaying. (Getting the buffer lock is not really necessary during
275  * single-process crash recovery, but some subroutines such as MarkBufferDirty
276  * will complain if we don't have the lock. In hot standby mode it's
277  * definitely necessary.)
278  *
279  * Note: when a backup block is available in XLOG with the BKPIMAGE_APPLY flag
280  * set, we restore it, even if the page in the database appears newer. This
281  * is to protect ourselves against database pages that were partially or
282  * incorrectly written during a crash. We assume that the XLOG data must be
283  * good because it has passed a CRC check, while the database page might not
284  * be. This will force us to replay all subsequent modifications of the page
285  * that appear in XLOG, rather than possibly ignoring them as already
286  * applied, but that's not a huge drawback.
287  */
290  Buffer *buf)
291 {
292  return XLogReadBufferForRedoExtended(record, block_id, RBM_NORMAL,
293  false, buf);
294 }
295 
296 /*
297  * Pin and lock a buffer referenced by a WAL record, for the purpose of
298  * re-initializing it.
299  */
300 Buffer
302 {
303  Buffer buf;
304 
305  XLogReadBufferForRedoExtended(record, block_id, RBM_ZERO_AND_LOCK, false,
306  &buf);
307  return buf;
308 }
309 
310 /*
311  * XLogReadBufferForRedoExtended
312  * Like XLogReadBufferForRedo, but with extra options.
313  *
314  * In RBM_ZERO_* modes, if the page doesn't exist, the relation is extended
315  * with all-zeroes pages up to the referenced block number. In
316  * RBM_ZERO_AND_LOCK and RBM_ZERO_AND_CLEANUP_LOCK modes, the return value
317  * is always BLK_NEEDS_REDO.
318  *
319  * (The RBM_ZERO_AND_CLEANUP_LOCK mode is redundant with the get_cleanup_lock
320  * parameter. Do not use an inconsistent combination!)
321  *
322  * If 'get_cleanup_lock' is true, a "cleanup lock" is acquired on the buffer
323  * using LockBufferForCleanup(), instead of a regular exclusive lock.
324  */
327  uint8 block_id,
328  ReadBufferMode mode, bool get_cleanup_lock,
329  Buffer *buf)
330 {
331  XLogRecPtr lsn = record->EndRecPtr;
332  RelFileNode rnode;
333  ForkNumber forknum;
335  Page page;
336  bool zeromode;
337  bool willinit;
338 
339  if (!XLogRecGetBlockTag(record, block_id, &rnode, &forknum, &blkno))
340  {
341  /* Caller specified a bogus block_id */
342  elog(PANIC, "failed to locate backup block with ID %d", block_id);
343  }
344 
345  /*
346  * Make sure that if the block is marked with WILL_INIT, the caller is
347  * going to initialize it. And vice versa.
348  */
349  zeromode = (mode == RBM_ZERO_AND_LOCK || mode == RBM_ZERO_AND_CLEANUP_LOCK);
350  willinit = (record->blocks[block_id].flags & BKPBLOCK_WILL_INIT) != 0;
351  if (willinit && !zeromode)
352  elog(PANIC, "block with WILL_INIT flag in WAL record must be zeroed by redo routine");
353  if (!willinit && zeromode)
354  elog(PANIC, "block to be initialized in redo routine must be marked with WILL_INIT flag in the WAL record");
355 
356  /* If it has a full-page image and it should be restored, do it. */
357  if (XLogRecBlockImageApply(record, block_id))
358  {
359  Assert(XLogRecHasBlockImage(record, block_id));
360  *buf = XLogReadBufferExtended(rnode, forknum, blkno,
361  get_cleanup_lock ? RBM_ZERO_AND_CLEANUP_LOCK : RBM_ZERO_AND_LOCK);
362  page = BufferGetPage(*buf);
363  if (!RestoreBlockImage(record, block_id, page))
364  elog(ERROR, "failed to restore block image");
365 
366  /*
367  * The page may be uninitialized. If so, we can't set the LSN because
368  * that would corrupt the page.
369  */
370  if (!PageIsNew(page))
371  {
372  PageSetLSN(page, lsn);
373  }
374 
375  MarkBufferDirty(*buf);
376 
377  /*
378  * At the end of crash recovery the init forks of unlogged relations
379  * are copied, without going through shared buffers. So we need to
380  * force the on-disk state of init forks to always be in sync with the
381  * state in shared buffers.
382  */
383  if (forknum == INIT_FORKNUM)
384  FlushOneBuffer(*buf);
385 
386  return BLK_RESTORED;
387  }
388  else
389  {
390  *buf = XLogReadBufferExtended(rnode, forknum, blkno, mode);
391  if (BufferIsValid(*buf))
392  {
393  if (mode != RBM_ZERO_AND_LOCK && mode != RBM_ZERO_AND_CLEANUP_LOCK)
394  {
395  if (get_cleanup_lock)
396  LockBufferForCleanup(*buf);
397  else
399  }
400  if (lsn <= PageGetLSN(BufferGetPage(*buf)))
401  return BLK_DONE;
402  else
403  return BLK_NEEDS_REDO;
404  }
405  else
406  return BLK_NOTFOUND;
407  }
408 }
409 
410 /*
411  * XLogReadBufferExtended
412  * Read a page during XLOG replay
413  *
414  * This is functionally comparable to ReadBufferExtended. There's some
415  * differences in the behavior wrt. the "mode" argument:
416  *
417  * In RBM_NORMAL mode, if the page doesn't exist, or contains all-zeroes, we
418  * return InvalidBuffer. In this case the caller should silently skip the
419  * update on this page. (In this situation, we expect that the page was later
420  * dropped or truncated. If we don't see evidence of that later in the WAL
421  * sequence, we'll complain at the end of WAL replay.)
422  *
423  * In RBM_ZERO_* modes, if the page doesn't exist, the relation is extended
424  * with all-zeroes pages up to the given block number.
425  *
426  * In RBM_NORMAL_NO_LOG mode, we return InvalidBuffer if the page doesn't
427  * exist, and we don't check for all-zeroes. Thus, no log entry is made
428  * to imply that the page should be dropped or truncated later.
429  *
430  * NB: A redo function should normally not call this directly. To get a page
431  * to modify, use XLogReadBufferForRedoExtended instead. It is important that
432  * all pages modified by a WAL record are registered in the WAL records, or
433  * they will be invisible to tools that that need to know which pages are
434  * modified.
435  */
436 Buffer
439 {
440  BlockNumber lastblock;
441  Buffer buffer;
442  SMgrRelation smgr;
443 
444  Assert(blkno != P_NEW);
445 
446  /* Open the relation at smgr level */
447  smgr = smgropen(rnode, InvalidBackendId);
448 
449  /*
450  * Create the target file if it doesn't already exist. This lets us cope
451  * if the replay sequence contains writes to a relation that is later
452  * deleted. (The original coding of this routine would instead suppress
453  * the writes, but that seems like it risks losing valuable data if the
454  * filesystem loses an inode during a crash. Better to write the data
455  * until we are actually told to delete the file.)
456  */
457  smgrcreate(smgr, forknum, true);
458 
459  lastblock = smgrnblocks(smgr, forknum);
460 
461  if (blkno < lastblock)
462  {
463  /* page exists in file */
464  buffer = ReadBufferWithoutRelcache(rnode, forknum, blkno,
465  mode, NULL);
466  }
467  else
468  {
469  /* hm, page doesn't exist in file */
470  if (mode == RBM_NORMAL)
471  {
472  log_invalid_page(rnode, forknum, blkno, false);
473  return InvalidBuffer;
474  }
475  if (mode == RBM_NORMAL_NO_LOG)
476  return InvalidBuffer;
477  /* OK to extend the file */
478  /* we do this in recovery only - no rel-extension lock needed */
480  buffer = InvalidBuffer;
481  do
482  {
483  if (buffer != InvalidBuffer)
484  {
485  if (mode == RBM_ZERO_AND_LOCK || mode == RBM_ZERO_AND_CLEANUP_LOCK)
487  ReleaseBuffer(buffer);
488  }
489  buffer = ReadBufferWithoutRelcache(rnode, forknum,
490  P_NEW, mode, NULL);
491  }
492  while (BufferGetBlockNumber(buffer) < blkno);
493  /* Handle the corner case that P_NEW returns non-consecutive pages */
494  if (BufferGetBlockNumber(buffer) != blkno)
495  {
496  if (mode == RBM_ZERO_AND_LOCK || mode == RBM_ZERO_AND_CLEANUP_LOCK)
498  ReleaseBuffer(buffer);
499  buffer = ReadBufferWithoutRelcache(rnode, forknum, blkno,
500  mode, NULL);
501  }
502  }
503 
504  if (mode == RBM_NORMAL)
505  {
506  /* check that page has been initialized */
507  Page page = (Page) BufferGetPage(buffer);
508 
509  /*
510  * We assume that PageIsNew is safe without a lock. During recovery,
511  * there should be no other backends that could modify the buffer at
512  * the same time.
513  */
514  if (PageIsNew(page))
515  {
516  ReleaseBuffer(buffer);
517  log_invalid_page(rnode, forknum, blkno, true);
518  return InvalidBuffer;
519  }
520  }
521 
522  return buffer;
523 }
524 
525 /*
526  * Struct actually returned by CreateFakeRelcacheEntry, though the declared
527  * return type is Relation.
528  */
529 typedef struct
530 {
531  RelationData reldata; /* Note: this must be first */
534 
536 
537 /*
538  * Create a fake relation cache entry for a physical relation
539  *
540  * It's often convenient to use the same functions in XLOG replay as in the
541  * main codepath, but those functions typically work with a relcache entry.
542  * We don't have a working relation cache during XLOG replay, but this
543  * function can be used to create a fake relcache entry instead. Only the
544  * fields related to physical storage, like rd_rel, are initialized, so the
545  * fake entry is only usable in low-level operations like ReadBuffer().
546  *
547  * Caller must free the returned entry with FreeFakeRelcacheEntry().
548  */
549 Relation
551 {
552  FakeRelCacheEntry fakeentry;
553  Relation rel;
554 
556 
557  /* Allocate the Relation struct and all related space in one block. */
558  fakeentry = palloc0(sizeof(FakeRelCacheEntryData));
559  rel = (Relation) fakeentry;
560 
561  rel->rd_rel = &fakeentry->pgc;
562  rel->rd_node = rnode;
563  /* We will never be working with temp rels during recovery */
565 
566  /* It must be a permanent table if we're in recovery. */
567  rel->rd_rel->relpersistence = RELPERSISTENCE_PERMANENT;
568 
569  /* We don't know the name of the relation; use relfilenode instead */
570  sprintf(RelationGetRelationName(rel), "%u", rnode.relNode);
571 
572  /*
573  * We set up the lockRelId in case anything tries to lock the dummy
574  * relation. Note that this is fairly bogus since relNode may be
575  * different from the relation's OID. It shouldn't really matter though,
576  * since we are presumably running by ourselves and can't have any lock
577  * conflicts ...
578  */
579  rel->rd_lockInfo.lockRelId.dbId = rnode.dbNode;
580  rel->rd_lockInfo.lockRelId.relId = rnode.relNode;
581 
582  rel->rd_smgr = NULL;
583 
584  return rel;
585 }
586 
587 /*
588  * Free a fake relation cache entry.
589  */
590 void
592 {
593  /* make sure the fakerel is not referenced by the SmgrRelation anymore */
594  if (fakerel->rd_smgr != NULL)
595  smgrclearowner(&fakerel->rd_smgr, fakerel->rd_smgr);
596  pfree(fakerel);
597 }
598 
599 /*
600  * Drop a relation during XLOG replay
601  *
602  * This is called when the relation is about to be deleted; we need to remove
603  * any open "invalid-page" records for the relation.
604  */
605 void
607 {
608  forget_invalid_pages(rnode, forknum, 0);
609 }
610 
611 /*
612  * Drop a whole database during XLOG replay
613  *
614  * As above, but for DROP DATABASE instead of dropping a single rel
615  */
616 void
618 {
619  /*
620  * This is unnecessarily heavy-handed, as it will close SMgrRelation
621  * objects for other databases as well. DROP DATABASE occurs seldom enough
622  * that it's not worth introducing a variant of smgrclose for just this
623  * purpose. XXX: Or should we rather leave the smgr entries dangling?
624  */
625  smgrcloseall();
626 
628 }
629 
630 /*
631  * Truncate a relation during XLOG replay
632  *
633  * We need to clean up any open "invalid-page" records for the dropped pages.
634  */
635 void
637  BlockNumber nblocks)
638 {
639  forget_invalid_pages(rnode, forkNum, nblocks);
640 }
641 
642 /*
643  * Determine which timeline to read an xlog page from and set the
644  * XLogReaderState's currTLI to that timeline ID.
645  *
646  * We care about timelines in xlogreader when we might be reading xlog
647  * generated prior to a promotion, either if we're currently a standby in
648  * recovery or if we're a promoted master reading xlogs generated by the old
649  * master before our promotion.
650  *
651  * wantPage must be set to the start address of the page to read and
652  * wantLength to the amount of the page that will be read, up to
653  * XLOG_BLCKSZ. If the amount to be read isn't known, pass XLOG_BLCKSZ.
654  *
655  * We switch to an xlog segment from the new timeline eagerly when on a
656  * historical timeline, as soon as we reach the start of the xlog segment
657  * containing the timeline switch. The server copied the segment to the new
658  * timeline so all the data up to the switch point is the same, but there's no
659  * guarantee the old segment will still exist. It may have been deleted or
660  * renamed with a .partial suffix so we can't necessarily keep reading from
661  * the old TLI even though tliSwitchPoint says it's OK.
662  *
663  * We can't just check the timeline when we read a page on a different segment
664  * to the last page. We could've received a timeline switch from a cascading
665  * upstream, so the current segment ends abruptly (possibly getting renamed to
666  * .partial) and we have to switch to a new one. Even in the middle of reading
667  * a page we could have to dump the cached page and switch to a new TLI.
668  *
669  * Because of this, callers MAY NOT assume that currTLI is the timeline that
670  * will be in a page's xlp_tli; the page may begin on an older timeline or we
671  * might be reading from historical timeline data on a segment that's been
672  * copied to a new timeline.
673  *
674  * The caller must also make sure it doesn't read past the current replay
675  * position (using GetWalRcvWriteRecPtr) if executing in recovery, so it
676  * doesn't fail to notice that the current timeline became historical. The
677  * caller must also update ThisTimeLineID with the result of
678  * GetWalRcvWriteRecPtr and must check RecoveryInProgress().
679  */
680 void
682 {
683  const XLogRecPtr lastReadPage = (state->seg.ws_segno *
684  state->segcxt.ws_segsize + state->segoff);
685 
686  Assert(wantPage != InvalidXLogRecPtr && wantPage % XLOG_BLCKSZ == 0);
687  Assert(wantLength <= XLOG_BLCKSZ);
688  Assert(state->readLen == 0 || state->readLen <= XLOG_BLCKSZ);
689 
690  /*
691  * If the desired page is currently read in and valid, we have nothing to
692  * do.
693  *
694  * The caller should've ensured that it didn't previously advance readOff
695  * past the valid limit of this timeline, so it doesn't matter if the
696  * current TLI has since become historical.
697  */
698  if (lastReadPage == wantPage &&
699  state->readLen != 0 &&
700  lastReadPage + state->readLen >= wantPage + Min(wantLength, XLOG_BLCKSZ - 1))
701  return;
702 
703  /*
704  * If we're reading from the current timeline, it hasn't become historical
705  * and the page we're reading is after the last page read, we can again
706  * just carry on. (Seeking backwards requires a check to make sure the
707  * older page isn't on a prior timeline).
708  *
709  * ThisTimeLineID might've become historical since we last looked, but the
710  * caller is required not to read past the flush limit it saw at the time
711  * it looked up the timeline. There's nothing we can do about it if
712  * StartupXLOG() renames it to .partial concurrently.
713  */
714  if (state->currTLI == ThisTimeLineID && wantPage >= lastReadPage)
715  {
717  return;
718  }
719 
720  /*
721  * If we're just reading pages from a previously validated historical
722  * timeline and the timeline we're reading from is valid until the end of
723  * the current segment we can just keep reading.
724  */
725  if (state->currTLIValidUntil != InvalidXLogRecPtr &&
726  state->currTLI != ThisTimeLineID &&
727  state->currTLI != 0 &&
728  ((wantPage + wantLength) / state->segcxt.ws_segsize) <
729  (state->currTLIValidUntil / state->segcxt.ws_segsize))
730  return;
731 
732  /*
733  * If we reach this point we're either looking up a page for random
734  * access, the current timeline just became historical, or we're reading
735  * from a new segment containing a timeline switch. In all cases we need
736  * to determine the newest timeline on the segment.
737  *
738  * If it's the current timeline we can just keep reading from here unless
739  * we detect a timeline switch that makes the current timeline historical.
740  * If it's a historical timeline we can read all the segment on the newest
741  * timeline because it contains all the old timelines' data too. So only
742  * one switch check is required.
743  */
744  {
745  /*
746  * We need to re-read the timeline history in case it's been changed
747  * by a promotion or replay from a cascaded replica.
748  */
749  List *timelineHistory = readTimeLineHistory(ThisTimeLineID);
750  XLogRecPtr endOfSegment;
751 
752  endOfSegment = ((wantPage / state->segcxt.ws_segsize) + 1) *
753  state->segcxt.ws_segsize - 1;
754  Assert(wantPage / state->segcxt.ws_segsize ==
755  endOfSegment / state->segcxt.ws_segsize);
756 
757  /*
758  * Find the timeline of the last LSN on the segment containing
759  * wantPage.
760  */
761  state->currTLI = tliOfPointInHistory(endOfSegment, timelineHistory);
762  state->currTLIValidUntil = tliSwitchPoint(state->currTLI, timelineHistory,
763  &state->nextTLI);
764 
766  wantPage + wantLength < state->currTLIValidUntil);
767 
768  list_free_deep(timelineHistory);
769 
770  elog(DEBUG3, "switched to timeline %u valid until %X/%X",
771  state->currTLI,
772  (uint32) (state->currTLIValidUntil >> 32),
773  (uint32) (state->currTLIValidUntil));
774  }
775 }
776 
777 /* openSegment callback for WALRead */
778 static int
780  TimeLineID *tli_p)
781 {
782  TimeLineID tli = *tli_p;
783  char path[MAXPGPATH];
784  int fd;
785 
786  XLogFilePath(path, tli, nextSegNo, segcxt->ws_segsize);
787  fd = BasicOpenFile(path, O_RDONLY | PG_BINARY);
788  if (fd >= 0)
789  return fd;
790 
791  if (errno == ENOENT)
792  ereport(ERROR,
794  errmsg("requested WAL segment %s has already been removed",
795  path)));
796  else
797  ereport(ERROR,
799  errmsg("could not open file \"%s\": %m",
800  path)));
801 
802  return -1; /* keep compiler quiet */
803 }
804 
805 /*
806  * read_page callback for reading local xlog files
807  *
808  * Public because it would likely be very helpful for someone writing another
809  * output method outside walsender, e.g. in a bgworker.
810  *
811  * TODO: The walsender has its own version of this, but it relies on the
812  * walsender's latch being set whenever WAL is flushed. No such infrastructure
813  * exists for normal backends, so we have to do a check/sleep/repeat style of
814  * loop for now.
815  */
816 int
818  int reqLen, XLogRecPtr targetRecPtr, char *cur_page)
819 {
820  XLogRecPtr read_upto,
821  loc;
822  TimeLineID tli;
823  int count;
824  WALReadError errinfo;
825 
826  loc = targetPagePtr + reqLen;
827 
828  /* Loop waiting for xlog to be available if necessary */
829  while (1)
830  {
831  /*
832  * Determine the limit of xlog we can currently read to, and what the
833  * most recent timeline is.
834  *
835  * RecoveryInProgress() will update ThisTimeLineID when it first
836  * notices recovery finishes, so we only have to maintain it for the
837  * local process until recovery ends.
838  */
839  if (!RecoveryInProgress())
840  read_upto = GetFlushRecPtr();
841  else
842  read_upto = GetXLogReplayRecPtr(&ThisTimeLineID);
843  tli = ThisTimeLineID;
844 
845  /*
846  * Check which timeline to get the record from.
847  *
848  * We have to do it each time through the loop because if we're in
849  * recovery as a cascading standby, the current timeline might've
850  * become historical. We can't rely on RecoveryInProgress() because in
851  * a standby configuration like
852  *
853  * A => B => C
854  *
855  * if we're a logical decoding session on C, and B gets promoted, our
856  * timeline will change while we remain in recovery.
857  *
858  * We can't just keep reading from the old timeline as the last WAL
859  * archive in the timeline will get renamed to .partial by
860  * StartupXLOG().
861  *
862  * If that happens after our caller updated ThisTimeLineID but before
863  * we actually read the xlog page, we might still try to read from the
864  * old (now renamed) segment and fail. There's not much we can do
865  * about this, but it can only happen when we're a leaf of a cascading
866  * standby whose master gets promoted while we're decoding, so a
867  * one-off ERROR isn't too bad.
868  */
869  XLogReadDetermineTimeline(state, targetPagePtr, reqLen);
870 
871  if (state->currTLI == ThisTimeLineID)
872  {
873 
874  if (loc <= read_upto)
875  break;
876 
878  pg_usleep(1000L);
879  }
880  else
881  {
882  /*
883  * We're on a historical timeline, so limit reading to the switch
884  * point where we moved to the next timeline.
885  *
886  * We don't need to GetFlushRecPtr or GetXLogReplayRecPtr. We know
887  * about the new timeline, so we must've received past the end of
888  * it.
889  */
890  read_upto = state->currTLIValidUntil;
891 
892  /*
893  * Setting tli to our wanted record's TLI is slightly wrong; the
894  * page might begin on an older timeline if it contains a timeline
895  * switch, since its xlog segment will have been copied from the
896  * prior timeline. This is pretty harmless though, as nothing
897  * cares so long as the timeline doesn't go backwards. We should
898  * read the page header instead; FIXME someday.
899  */
900  tli = state->currTLI;
901 
902  /* No need to wait on a historical timeline */
903  break;
904  }
905  }
906 
907  if (targetPagePtr + XLOG_BLCKSZ <= read_upto)
908  {
909  /*
910  * more than one block available; read only that block, have caller
911  * come back if they need more.
912  */
913  count = XLOG_BLCKSZ;
914  }
915  else if (targetPagePtr + reqLen > read_upto)
916  {
917  /* not enough data there */
918  return -1;
919  }
920  else
921  {
922  /* enough bytes available to satisfy the request */
923  count = read_upto - targetPagePtr;
924  }
925 
926  /*
927  * Even though we just determined how much of the page can be validly read
928  * as 'count', read the whole page anyway. It's guaranteed to be
929  * zero-padded up to the page boundary if it's incomplete.
930  */
931  if (!WALRead(cur_page, targetPagePtr, XLOG_BLCKSZ, tli, &state->seg,
932  &state->segcxt, wal_segment_open, &errinfo))
933  WALReadRaiseError(&errinfo);
934 
935  /* number of valid bytes in the buffer */
936  return count;
937 }
938 
939 /*
940  * Backend-specific convenience code to handle read errors encountered by
941  * WALRead().
942  */
943 void
945 {
946  WALOpenSegment *seg = &errinfo->wre_seg;
947  char fname[MAXFNAMELEN];
948 
949  XLogFileName(fname, seg->ws_tli, seg->ws_segno, wal_segment_size);
950 
951  if (errinfo->wre_read < 0)
952  {
953  errno = errinfo->wre_errno;
954  ereport(ERROR,
956  errmsg("could not read from log segment %s, offset %u: %m",
957  fname, errinfo->wre_off)));
958  }
959  else if (errinfo->wre_read == 0)
960  {
961  ereport(ERROR,
963  errmsg("could not read from log segment %s, offset %u: read %d of %zu",
964  fname, errinfo->wre_off, errinfo->wre_read,
965  (Size) errinfo->wre_req)));
966  }
967 }
WALOpenSegment wre_seg
Definition: xlogreader.h:264
bool XLogHaveInvalidPages(void)
Definition: xlogutils.c:210
void XLogTruncateRelation(RelFileNode rnode, ForkNumber forkNum, BlockNumber nblocks)
Definition: xlogutils.c:636
static PgChecksumMode mode
Definition: pg_checksums.c:61
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:86
void hash_destroy(HTAB *hashp)
Definition: dynahash.c:814
void LockBufferForCleanup(Buffer buffer)
Definition: bufmgr.c:3659
LockRelId lockRelId
Definition: rel.h:43
#define relpathperm(rnode, forknum)
Definition: relpath.h:83
#define InvalidXLogRecPtr
Definition: xlogdefs.h:28
TimeLineID tliOfPointInHistory(XLogRecPtr ptr, List *history)
Definition: timeline.c:535
#define DEBUG1
Definition: elog.h:25
void smgrcreate(SMgrRelation reln, ForkNumber forknum, bool isRedo)
Definition: smgr.c:333
uint32 TimeLineID
Definition: xlogdefs.h:52
void smgrclearowner(SMgrRelation *owner, SMgrRelation reln)
Definition: smgr.c:227
RelationData reldata
Definition: xlogutils.c:531
struct xl_invalid_page xl_invalid_page
#define HASH_ELEM
Definition: hsearch.h:87
int wal_segment_size
Definition: xlog.c:112
#define DEBUG3
Definition: elog.h:23
#define XLogRecHasBlockImage(decoder, block_id)
Definition: xlogreader.h:288
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1458
static void forget_invalid_pages_db(Oid dbid)
Definition: xlogutils.c:177
struct SMgrRelationData * rd_smgr
Definition: rel.h:56
void XLogCheckInvalidPages(void)
Definition: xlogutils.c:220
bool InRecovery
Definition: xlog.c:200
#define Min(x, y)
Definition: c.h:911
Oid dbId
Definition: rel.h:38
void WALReadRaiseError(WALReadError *errinfo)
Definition: xlogutils.c:944
List * readTimeLineHistory(TimeLineID targetTLI)
Definition: timeline.c:75
Buffer XLogReadBufferExtended(RelFileNode rnode, ForkNumber forknum, BlockNumber blkno, ReadBufferMode mode)
Definition: xlogutils.c:437
unsigned char uint8
Definition: c.h:357
#define InvalidBuffer
Definition: buf.h:25
Size entrysize
Definition: hsearch.h:73
Buffer ReadBufferWithoutRelcache(RelFileNode rnode, ForkNumber forkNum, BlockNumber blockNum, ReadBufferMode mode, BufferAccessStrategy strategy)
Definition: bufmgr.c:684
int errcode(int sqlerrcode)
Definition: elog.c:608
struct xl_invalid_page_key xl_invalid_page_key
long hash_get_num_entries(HTAB *hashp)
Definition: dynahash.c:1335
XLogRecPtr GetFlushRecPtr(void)
Definition: xlog.c:8267
uint32 BlockNumber
Definition: block.h:31
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3365
ForkNumber forkno
Definition: xlogutils.c:47
#define P_NEW
Definition: bufmgr.h:81
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:906
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:88
Form_pg_class rd_rel
Definition: rel.h:83
unsigned int Oid
Definition: postgres_ext.h:31
bool RecoveryInProgress(void)
Definition: xlog.c:7935
#define PANIC
Definition: elog.h:53
void list_free_deep(List *list)
Definition: list.c:1391
static int fd(const char *x, int i)
Definition: preproc-init.c:105
#define PG_BINARY
Definition: c.h:1222
void XLogReadDetermineTimeline(XLogReaderState *state, XLogRecPtr wantPage, uint32 wantLength)
Definition: xlogutils.c:681
XLogRecPtr EndRecPtr
Definition: xlogreader.h:132
void smgrcloseall(void)
Definition: smgr.c:286
#define sprintf
Definition: port.h:194
WALOpenSegment seg
Definition: xlogreader.h:169
RelFileNode node
Definition: xlogutils.c:46
void pg_usleep(long microsec)
Definition: signal.c:53
Definition: dynahash.c:208
struct RelationData * Relation
Definition: relcache.h:26
void pfree(void *pointer)
Definition: mcxt.c:1056
static void report_invalid_page(int elevel, RelFileNode node, ForkNumber forkno, BlockNumber blkno, bool present)
Definition: xlogutils.c:62
#define ERROR
Definition: elog.h:43
Buffer XLogInitBufferForRedo(XLogReaderState *record, uint8 block_id)
Definition: xlogutils.c:301
static void log_invalid_page(RelFileNode node, ForkNumber forkno, BlockNumber blkno, bool present)
Definition: xlogutils.c:78
#define MAXPGPATH
XLogRecPtr GetXLogReplayRecPtr(TimeLineID *replayTLI)
Definition: xlog.c:11172
#define DEBUG2
Definition: elog.h:24
Relation CreateFakeRelcacheEntry(RelFileNode rnode)
Definition: xlogutils.c:550
static void forget_invalid_pages(RelFileNode node, ForkNumber forkno, BlockNumber minblkno)
Definition: xlogutils.c:142
LockInfoData rd_lockInfo
Definition: rel.h:86
static char * buf
Definition: pg_test_fsync.c:67
uint64 XLogSegNo
Definition: xlogdefs.h:41
BlockNumber blkno
Definition: xlogutils.c:48
bool WALRead(char *buf, XLogRecPtr startptr, Size count, TimeLineID tli, WALOpenSegment *seg, WALSegmentContext *segcxt, WALSegmentOpen openSegment, WALReadError *errinfo)
Definition: xlogreader.c:1033
xl_invalid_page_key key
Definition: xlogutils.c:53
XLogSegNo ws_segno
Definition: xlogreader.h:38
int errcode_for_file_access(void)
Definition: elog.c:631
XLogRecPtr currTLIValidUntil
Definition: xlogreader.h:192
#define RelationGetRelationName(relation)
Definition: rel.h:456
unsigned int uint32
Definition: c.h:359
#define BufferGetPage(buffer)
Definition: bufmgr.h:159
#define BKPBLOCK_WILL_INIT
Definition: xlogrecord.h:182
#define ereport(elevel, rest)
Definition: elog.h:141
SMgrRelation smgropen(RelFileNode rnode, BackendId backend)
Definition: smgr.c:145
ForkNumber
Definition: relpath.h:40
#define ERRCODE_DATA_CORRUPTED
Definition: pg_basebackup.c:45
#define WARNING
Definition: elog.h:40
ReadBufferMode
Definition: bufmgr.h:37
void FreeFakeRelcacheEntry(Relation fakerel)
Definition: xlogutils.c:591
#define MAXFNAMELEN
static int elevel
Definition: vacuumlazy.c:143
TimeLineID nextTLI
Definition: xlogreader.h:198
bool XLogRecGetBlockTag(XLogReaderState *record, uint8 block_id, RelFileNode *rnode, ForkNumber *forknum, BlockNumber *blknum)
Definition: xlogreader.c:1460
#define HASH_BLOBS
Definition: hsearch.h:88
#define InvalidBackendId
Definition: backendid.h:23
void * palloc0(Size size)
Definition: mcxt.c:980
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:316
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3602
Size keysize
Definition: hsearch.h:72
XLogRecPtr tliSwitchPoint(TimeLineID tli, List *history, TimeLineID *nextTLI)
Definition: timeline.c:563
int log_min_messages
Definition: guc.c:513
TimeLineID ThisTimeLineID
Definition: xlog.c:187
TimeLineID currTLI
Definition: xlogreader.h:182
XLogRedoAction XLogReadBufferForRedo(XLogReaderState *record, uint8 block_id, Buffer *buf)
Definition: xlogutils.c:289
RelFileNode rd_node
Definition: rel.h:54
bool reachedConsistency
Definition: xlog.c:844
BlockNumber smgrnblocks(SMgrRelation reln, ForkNumber forknum)
Definition: smgr.c:555
FakeRelCacheEntryData * FakeRelCacheEntry
Definition: xlogutils.c:535
uint64 XLogRecPtr
Definition: xlogdefs.h:21
BackendId rd_backend
Definition: rel.h:58
#define Assert(condition)
Definition: c.h:739
Definition: regguts.h:298
XLogRedoAction
Definition: xlogutils.h:27
size_t Size
Definition: c.h:467
#define XLogFileName(fname, tli, logSegNo, wal_segsz_bytes)
static int wal_segment_open(XLogSegNo nextSegNo, WALSegmentContext *segcxt, TimeLineID *tli_p)
Definition: xlogutils.c:779
#define BufferIsValid(bufnum)
Definition: bufmgr.h:113
void * hash_seq_search(HASH_SEQ_STATUS *status)
Definition: dynahash.c:1389
void hash_seq_init(HASH_SEQ_STATUS *status, HTAB *hashp)
Definition: dynahash.c:1379
TimeLineID ws_tli
Definition: xlogreader.h:39
void FlushOneBuffer(Buffer buffer)
Definition: bufmgr.c:3345
bool RestoreBlockImage(XLogReaderState *record, uint8 block_id, char *page)
Definition: xlogreader.c:1513
#define PageGetLSN(page)
Definition: bufpage.h:366
int BasicOpenFile(const char *fileName, int fileFlags)
Definition: fd.c:981
FormData_pg_class
Definition: pg_class.h:139
#define XLogFilePath(path, tli, logSegNo, wal_segsz_bytes)
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2613
void XLogDropRelation(RelFileNode rnode, ForkNumber forknum)
Definition: xlogutils.c:606
#define PageIsNew(page)
Definition: bufpage.h:229
int errmsg(const char *fmt,...)
Definition: elog.c:822
XLogRedoAction XLogReadBufferForRedoExtended(XLogReaderState *record, uint8 block_id, ReadBufferMode mode, bool get_cleanup_lock, Buffer *buf)
Definition: xlogutils.c:326
void XLogDropDatabase(Oid dbid)
Definition: xlogutils.c:617
#define elog(elevel,...)
Definition: elog.h:228
static HTAB * invalid_page_tab
Definition: xlogutils.c:57
FormData_pg_class pgc
Definition: xlogutils.c:532
int client_min_messages
Definition: guc.c:514
WALSegmentContext segcxt
Definition: xlogreader.h:168
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:99
#define XLogRecBlockImageApply(decoder, block_id)
Definition: xlogreader.h:290
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:226
int read_local_xlog_page(XLogReaderState *state, XLogRecPtr targetPagePtr, int reqLen, XLogRecPtr targetRecPtr, char *cur_page)
Definition: xlogutils.c:817
#define PageSetLSN(page, lsn)
Definition: bufpage.h:368
Definition: pg_list.h:50
int Buffer
Definition: buf.h:23
Pointer Page
Definition: bufpage.h:78
#define RelFileNodeEquals(node1, node2)
Definition: relfilenode.h:88
DecodedBkpBlock blocks[XLR_MAX_BLOCK_ID+1]
Definition: xlogreader.h:151
Oid relId
Definition: rel.h:37