![]() FindLastCheckpoint looks for the nearest checkpoint before the bifurcation point divergerec as the starting point of rewind.ġ) first, you need to locate the record at the beginning of the bifurcation point divergerec, and then locate the previous wal record according to the xl_prev pointer of the recordĢ) determine whether the wal record obtained in step 1) is checkpoint, and if not, return to 1) until the checkpoint point is foundģ) there is a problem here. At this time, ControlFile_target.checkPoint < divergerec & & target's chkpattendant recycle assigned gerec, so pg_rewind can be done.Ĥ. end is returned as the bifurcation point, that is, 0/1F000090.ģ. In this case, the value of sourceHistory. ![]() New owner $cat 00000004.history1 0/140000C8 no recovery target specified2 0max 19000060 no recovery target specified3 0/1F000090 no recovery target specified- Old owner $cat 00000003.history1 0/140000C8 no recovery target specified2 0max 19000060 no recovery target specifiedġ) if you compare the timeline of sourceHistory, targetHistory and begin, you can find that they are equal, then go to the comparison of the second entry.Ģ) if you compare the timeline of sourceHistory and targetHistory with the value of begin, you can find that they are equal, then go to the comparison of the third entryģ) comparing the timeline of sourceHistory, targetHistory and begin, we can find that they are equal, and the comparison ends at this time.Ĥ) return the third entry: MinXLogRecPtr (sourceHistory. ![]() ![]() Add a use case as an error chapter of pg_rewind to illustrate its usage. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |