mirror of
https://github.com/MariaDB/server.git
synced 2025-01-18 21:12:26 +01:00
155e78f014
BitKeeper/deleted/.del-ex_access.wpj~3df6ae8c99bf7c5f: Delete: bdb/build_vxworks/ex_access/ex_access.wpj BitKeeper/deleted/.del-ex_btrec.wpj~a7622f1c6f432dc6: Delete: bdb/build_vxworks/ex_btrec/ex_btrec.wpj BitKeeper/deleted/.del-ex_dbclient.wpj~7345440f3b204cdd: Delete: bdb/build_vxworks/ex_dbclient/ex_dbclient.wpj BitKeeper/deleted/.del-ex_env.wpj~fbe1ab10b04e8b74: Delete: bdb/build_vxworks/ex_env/ex_env.wpj BitKeeper/deleted/.del-ex_mpool.wpj~4479cfd5c45f327d: Delete: bdb/build_vxworks/ex_mpool/ex_mpool.wpj BitKeeper/deleted/.del-ex_tpcb.wpj~f78093006e14bf41: Delete: bdb/build_vxworks/ex_tpcb/ex_tpcb.wpj BitKeeper/deleted/.del-db_buildall.dsp~bd749ff6da11682: Delete: bdb/build_win32/db_buildall.dsp BitKeeper/deleted/.del-cxx_app.cpp~ad8df8e0791011ed: Delete: bdb/cxx/cxx_app.cpp BitKeeper/deleted/.del-cxx_log.cpp~a50ff3118fe06952: Delete: bdb/cxx/cxx_log.cpp BitKeeper/deleted/.del-cxx_table.cpp~ecd751e79b055556: Delete: bdb/cxx/cxx_table.cpp BitKeeper/deleted/.del-namemap.txt~796a3acd3885d8fd: Delete: bdb/cxx/namemap.txt BitKeeper/deleted/.del-Design.fileop~3ca4da68f1727373: Delete: bdb/db/Design.fileop BitKeeper/deleted/.del-db185_int.h~61bee3736e7959ef: Delete: bdb/db185/db185_int.h BitKeeper/deleted/.del-acconfig.h~411e8854d67ad8b5: Delete: bdb/dist/acconfig.h BitKeeper/deleted/.del-mutex.m4~a13383cde18a64e1: Delete: bdb/dist/aclocal/mutex.m4 BitKeeper/deleted/.del-options.m4~b9d0ca637213750a: Delete: bdb/dist/aclocal/options.m4 BitKeeper/deleted/.del-programs.m4~3ce7890b47732b30: Delete: bdb/dist/aclocal/programs.m4 BitKeeper/deleted/.del-tcl.m4~f944e2db93c3b6db: Delete: bdb/dist/aclocal/tcl.m4 BitKeeper/deleted/.del-types.m4~59cae158c9a32cff: Delete: bdb/dist/aclocal/types.m4 BitKeeper/deleted/.del-script~d38f6d3a4f159cb4: Delete: bdb/dist/build/script BitKeeper/deleted/.del-configure.in~ac795a92c8fe049c: Delete: bdb/dist/configure.in BitKeeper/deleted/.del-ltconfig~66bbd007d8024af: Delete: bdb/dist/ltconfig BitKeeper/deleted/.del-rec_ctemp~a28554362534f00a: Delete: bdb/dist/rec_ctemp BitKeeper/deleted/.del-s_tcl~2ffe4326459fcd9f: Delete: bdb/dist/s_tcl BitKeeper/deleted/.del-.IGNORE_ME~d8148b08fa7d5d15: Delete: bdb/dist/template/.IGNORE_ME BitKeeper/deleted/.del-btree.h~179f2aefec1753d: Delete: bdb/include/btree.h BitKeeper/deleted/.del-cxx_int.h~6b649c04766508f8: Delete: bdb/include/cxx_int.h BitKeeper/deleted/.del-db.src~6b433ae615b16a8d: Delete: bdb/include/db.src BitKeeper/deleted/.del-db_185.h~ad8b373d9391d35c: Delete: bdb/include/db_185.h BitKeeper/deleted/.del-db_am.h~a714912b6b75932f: Delete: bdb/include/db_am.h BitKeeper/deleted/.del-db_cxx.h~fcafadf45f5d19e9: Delete: bdb/include/db_cxx.h BitKeeper/deleted/.del-db_dispatch.h~6844f20f7eb46904: Delete: bdb/include/db_dispatch.h BitKeeper/deleted/.del-db_int.src~419a3f48b6a01da7: Delete: bdb/include/db_int.src BitKeeper/deleted/.del-db_join.h~76f9747a42c3399a: Delete: bdb/include/db_join.h BitKeeper/deleted/.del-db_page.h~e302ca3a4db3abdc: Delete: bdb/include/db_page.h BitKeeper/deleted/.del-db_server_int.h~e1d20b6ba3bca1ab: Delete: bdb/include/db_server_int.h BitKeeper/deleted/.del-db_shash.h~5fbf2d696fac90f3: Delete: bdb/include/db_shash.h BitKeeper/deleted/.del-db_swap.h~1e60887550864a59: Delete: bdb/include/db_swap.h BitKeeper/deleted/.del-db_upgrade.h~c644eee73701fc8d: Delete: bdb/include/db_upgrade.h BitKeeper/deleted/.del-db_verify.h~b8d6c297c61f342e: Delete: bdb/include/db_verify.h BitKeeper/deleted/.del-debug.h~dc2b4f2cf27ccebc: Delete: bdb/include/debug.h BitKeeper/deleted/.del-hash.h~2aaa548b28882dfb: Delete: bdb/include/hash.h BitKeeper/deleted/.del-lock.h~a761c1b7de57b77f: Delete: bdb/include/lock.h BitKeeper/deleted/.del-log.h~ff20184238e35e4d: Delete: bdb/include/log.h BitKeeper/deleted/.del-mp.h~7e317597622f3411: Delete: bdb/include/mp.h BitKeeper/deleted/.del-mutex.h~d3ae7a2977a68137: Delete: bdb/include/mutex.h BitKeeper/deleted/.del-os.h~91867cc8757cd0e3: Delete: bdb/include/os.h BitKeeper/deleted/.del-os_jump.h~e1b939fa5151d4be: Delete: bdb/include/os_jump.h BitKeeper/deleted/.del-qam.h~6fad0c1b5723d597: Delete: bdb/include/qam.h BitKeeper/deleted/.del-queue.h~4c72c0826c123d5: Delete: bdb/include/queue.h BitKeeper/deleted/.del-region.h~513fe04d977ca0fc: Delete: bdb/include/region.h BitKeeper/deleted/.del-shqueue.h~525fc3e6c2025c36: Delete: bdb/include/shqueue.h BitKeeper/deleted/.del-tcl_db.h~c536fd61a844f23f: Delete: bdb/include/tcl_db.h BitKeeper/deleted/.del-txn.h~c8d94b221ec147e4: Delete: bdb/include/txn.h BitKeeper/deleted/.del-xa.h~ecc466493aae9d9a: Delete: bdb/include/xa.h BitKeeper/deleted/.del-DbRecoveryInit.java~756b52601a0b9023: Delete: bdb/java/src/com/sleepycat/db/DbRecoveryInit.java BitKeeper/deleted/.del-DbTxnRecover.java~74607cba7ab89d6d: Delete: bdb/java/src/com/sleepycat/db/DbTxnRecover.java BitKeeper/deleted/.del-lock_conflict.c~fc5e0f14cf597a2b: Delete: bdb/lock/lock_conflict.c BitKeeper/deleted/.del-log.src~53ac9e7b5cb023f2: Delete: bdb/log/log.src BitKeeper/deleted/.del-log_findckp.c~24287f008916e81f: Delete: bdb/log/log_findckp.c BitKeeper/deleted/.del-log_rec.c~d51711f2cac09297: Delete: bdb/log/log_rec.c BitKeeper/deleted/.del-log_register.c~b40bb4efac75ca15: Delete: bdb/log/log_register.c BitKeeper/deleted/.del-Design~b3d0f179f2767b: Delete: bdb/mp/Design BitKeeper/deleted/.del-os_finit.c~95dbefc6fe79b26c: Delete: bdb/os/os_finit.c BitKeeper/deleted/.del-os_abs.c~df95d1e7db81924: Delete: bdb/os_vxworks/os_abs.c BitKeeper/deleted/.del-os_finit.c~803b484bdb9d0122: Delete: bdb/os_vxworks/os_finit.c BitKeeper/deleted/.del-os_map.c~3a6d7926398b76d3: Delete: bdb/os_vxworks/os_map.c BitKeeper/deleted/.del-os_finit.c~19a227c6d3c78ad: Delete: bdb/os_win32/os_finit.c BitKeeper/deleted/.del-log-corruption.patch~1cf2ecc7c6408d5d: Delete: bdb/patches/log-corruption.patch BitKeeper/deleted/.del-Btree.pm~af6d0c5eaed4a98e: Delete: bdb/perl.BerkeleyDB/BerkeleyDB/Btree.pm BitKeeper/deleted/.del-BerkeleyDB.pm~7244036d4482643: Delete: bdb/perl.BerkeleyDB/BerkeleyDB.pm BitKeeper/deleted/.del-BerkeleyDB.pod~e7b18fd6132448e3: Delete: bdb/perl.BerkeleyDB/BerkeleyDB.pod BitKeeper/deleted/.del-Hash.pm~10292a26c06a5c95: Delete: bdb/perl.BerkeleyDB/BerkeleyDB/Hash.pm BitKeeper/deleted/.del-BerkeleyDB.pod.P~79f76a1495eda203: Delete: bdb/perl.BerkeleyDB/BerkeleyDB.pod.P BitKeeper/deleted/.del-BerkeleyDB.xs~80c99afbd98e392c: Delete: bdb/perl.BerkeleyDB/BerkeleyDB.xs BitKeeper/deleted/.del-Changes~729c1891efa60de9: Delete: bdb/perl.BerkeleyDB/Changes BitKeeper/deleted/.del-MANIFEST~63a1e34aecf157a0: Delete: bdb/perl.BerkeleyDB/MANIFEST BitKeeper/deleted/.del-Makefile.PL~c68797707d8df87a: Delete: bdb/perl.BerkeleyDB/Makefile.PL BitKeeper/deleted/.del-README~5f2f579b1a241407: Delete: bdb/perl.BerkeleyDB/README BitKeeper/deleted/.del-Todo~dca3c66c193adda9: Delete: bdb/perl.BerkeleyDB/Todo BitKeeper/deleted/.del-config.in~ae81681e450e0999: Delete: bdb/perl.BerkeleyDB/config.in BitKeeper/deleted/.del-dbinfo~28ad67d83be4f68e: Delete: bdb/perl.BerkeleyDB/dbinfo BitKeeper/deleted/.del-mkconsts~543ab60669c7a04e: Delete: bdb/perl.BerkeleyDB/mkconsts BitKeeper/deleted/.del-mkpod~182c0ca54e439afb: Delete: bdb/perl.BerkeleyDB/mkpod BitKeeper/deleted/.del-5.004~e008cb5a48805543: Delete: bdb/perl.BerkeleyDB/patches/5.004 BitKeeper/deleted/.del-irix_6_5.pl~61662bb08afcdec8: Delete: bdb/perl.BerkeleyDB/hints/irix_6_5.pl BitKeeper/deleted/.del-solaris.pl~6771e7182394e152: Delete: bdb/perl.BerkeleyDB/hints/solaris.pl BitKeeper/deleted/.del-typemap~783b8f5295b05f3d: Delete: bdb/perl.BerkeleyDB/typemap BitKeeper/deleted/.del-5.004_01~6081ce2fff7b0bc: Delete: bdb/perl.BerkeleyDB/patches/5.004_01 BitKeeper/deleted/.del-5.004_02~87214eac35ad9e6: Delete: bdb/perl.BerkeleyDB/patches/5.004_02 BitKeeper/deleted/.del-5.004_03~9a672becec7cb40f: Delete: bdb/perl.BerkeleyDB/patches/5.004_03 BitKeeper/deleted/.del-5.004_04~e326cb51af09d154: Delete: bdb/perl.BerkeleyDB/patches/5.004_04 BitKeeper/deleted/.del-5.004_05~7ab457a1e41a92fe: Delete: bdb/perl.BerkeleyDB/patches/5.004_05 BitKeeper/deleted/.del-5.005~f9e2d59b5964cd4b: Delete: bdb/perl.BerkeleyDB/patches/5.005 BitKeeper/deleted/.del-5.005_01~3eb9fb7b5842ea8e: Delete: bdb/perl.BerkeleyDB/patches/5.005_01 BitKeeper/deleted/.del-5.005_02~67477ce0bef717cb: Delete: bdb/perl.BerkeleyDB/patches/5.005_02 BitKeeper/deleted/.del-5.005_03~c4c29a1fb21e290a: Delete: bdb/perl.BerkeleyDB/patches/5.005_03 BitKeeper/deleted/.del-5.6.0~e1fb9897d124ee22: Delete: bdb/perl.BerkeleyDB/patches/5.6.0 BitKeeper/deleted/.del-btree.t~e4a1a3c675ddc406: Delete: bdb/perl.BerkeleyDB/t/btree.t BitKeeper/deleted/.del-db-3.0.t~d2c60991d84558f2: Delete: bdb/perl.BerkeleyDB/t/db-3.0.t BitKeeper/deleted/.del-db-3.1.t~6ee88cd13f55e018: Delete: bdb/perl.BerkeleyDB/t/db-3.1.t BitKeeper/deleted/.del-db-3.2.t~f73b6461f98fd1cf: Delete: bdb/perl.BerkeleyDB/t/db-3.2.t BitKeeper/deleted/.del-destroy.t~cc6a2ae1980a2ecd: Delete: bdb/perl.BerkeleyDB/t/destroy.t BitKeeper/deleted/.del-env.t~a8604a4499c4bd07: Delete: bdb/perl.BerkeleyDB/t/env.t BitKeeper/deleted/.del-examples.t~2571b77c3cc75574: Delete: bdb/perl.BerkeleyDB/t/examples.t BitKeeper/deleted/.del-examples.t.T~8228bdd75ac78b88: Delete: bdb/perl.BerkeleyDB/t/examples.t.T BitKeeper/deleted/.del-examples3.t.T~66a186897a87026d: Delete: bdb/perl.BerkeleyDB/t/examples3.t.T BitKeeper/deleted/.del-examples3.t~fe3822ba2f2d7f83: Delete: bdb/perl.BerkeleyDB/t/examples3.t BitKeeper/deleted/.del-filter.t~f87b045c1b708637: Delete: bdb/perl.BerkeleyDB/t/filter.t BitKeeper/deleted/.del-hash.t~616bfb4d644de3a3: Delete: bdb/perl.BerkeleyDB/t/hash.t BitKeeper/deleted/.del-join.t~29fc39f74a83ca22: Delete: bdb/perl.BerkeleyDB/t/join.t BitKeeper/deleted/.del-mldbm.t~31f5015341eea040: Delete: bdb/perl.BerkeleyDB/t/mldbm.t BitKeeper/deleted/.del-queue.t~8f338034ce44a641: Delete: bdb/perl.BerkeleyDB/t/queue.t BitKeeper/deleted/.del-recno.t~d4ddbd3743add63e: Delete: bdb/perl.BerkeleyDB/t/recno.t BitKeeper/deleted/.del-strict.t~6885cdd2ea71ca2d: Delete: bdb/perl.BerkeleyDB/t/strict.t BitKeeper/deleted/.del-subdb.t~aab62a5d5864c603: Delete: bdb/perl.BerkeleyDB/t/subdb.t BitKeeper/deleted/.del-txn.t~65033b8558ae1216: Delete: bdb/perl.BerkeleyDB/t/txn.t BitKeeper/deleted/.del-unknown.t~f3710458682665e1: Delete: bdb/perl.BerkeleyDB/t/unknown.t BitKeeper/deleted/.del-Changes~436f74a5c414c65b: Delete: bdb/perl.DB_File/Changes BitKeeper/deleted/.del-DB_File.pm~ae0951c6c7665a82: Delete: bdb/perl.DB_File/DB_File.pm BitKeeper/deleted/.del-DB_File.xs~89e49a0b5556f1d8: Delete: bdb/perl.DB_File/DB_File.xs BitKeeper/deleted/.del-DB_File_BS~290fad5dbbb87069: Delete: bdb/perl.DB_File/DB_File_BS BitKeeper/deleted/.del-MANIFEST~90ee581572bdd4ac: Delete: bdb/perl.DB_File/MANIFEST BitKeeper/deleted/.del-Makefile.PL~ac0567bb5a377e38: Delete: bdb/perl.DB_File/Makefile.PL BitKeeper/deleted/.del-README~77e924a5a9bae6b3: Delete: bdb/perl.DB_File/README BitKeeper/deleted/.del-config.in~ab4c2792b86a810b: Delete: bdb/perl.DB_File/config.in BitKeeper/deleted/.del-dbinfo~461c43b30fab2cb: Delete: bdb/perl.DB_File/dbinfo BitKeeper/deleted/.del-dynixptx.pl~50dcddfae25d17e9: Delete: bdb/perl.DB_File/hints/dynixptx.pl BitKeeper/deleted/.del-typemap~55cffb3288a9e587: Delete: bdb/perl.DB_File/typemap BitKeeper/deleted/.del-version.c~a4df0e646f8b3975: Delete: bdb/perl.DB_File/version.c BitKeeper/deleted/.del-5.004_01~d6830d0082702af7: Delete: bdb/perl.DB_File/patches/5.004_01 BitKeeper/deleted/.del-5.004_02~78b082dc80c91031: Delete: bdb/perl.DB_File/patches/5.004_02 BitKeeper/deleted/.del-5.004~4411ec2e3c9e008b: Delete: bdb/perl.DB_File/patches/5.004 BitKeeper/deleted/.del-sco.pl~1e795fe14fe4dcfe: Delete: bdb/perl.DB_File/hints/sco.pl BitKeeper/deleted/.del-5.004_03~33f274648b160d95: Delete: bdb/perl.DB_File/patches/5.004_03 BitKeeper/deleted/.del-5.004_04~8f3d1b3cf18bb20a: Delete: bdb/perl.DB_File/patches/5.004_04 BitKeeper/deleted/.del-5.004_05~9c0f02e7331e142: Delete: bdb/perl.DB_File/patches/5.004_05 BitKeeper/deleted/.del-5.005~c2108cb2e3c8d951: Delete: bdb/perl.DB_File/patches/5.005 BitKeeper/deleted/.del-5.005_01~3b45e9673afc4cfa: Delete: bdb/perl.DB_File/patches/5.005_01 BitKeeper/deleted/.del-5.005_02~9fe5766bb02a4522: Delete: bdb/perl.DB_File/patches/5.005_02 BitKeeper/deleted/.del-5.005_03~ffa1c38c19ae72ea: Delete: bdb/perl.DB_File/patches/5.005_03 BitKeeper/deleted/.del-5.6.0~373be3a5ce47be85: Delete: bdb/perl.DB_File/patches/5.6.0 BitKeeper/deleted/.del-db-btree.t~3231595a1c241eb3: Delete: bdb/perl.DB_File/t/db-btree.t BitKeeper/deleted/.del-db-hash.t~7c4ad0c795c7fad2: Delete: bdb/perl.DB_File/t/db-hash.t BitKeeper/deleted/.del-db-recno.t~6c2d3d80b9ba4a50: Delete: bdb/perl.DB_File/t/db-recno.t BitKeeper/deleted/.del-db_server.sed~cdb00ebcd48a64e2: Delete: bdb/rpc_server/db_server.sed BitKeeper/deleted/.del-db_server_proc.c~d46c8f409c3747f4: Delete: bdb/rpc_server/db_server_proc.c BitKeeper/deleted/.del-db_server_svc.sed~3f5e59f334fa4607: Delete: bdb/rpc_server/db_server_svc.sed BitKeeper/deleted/.del-db_server_util.c~a809f3a4629acda: Delete: bdb/rpc_server/db_server_util.c BitKeeper/deleted/.del-log.tcl~ff1b41f1355b97d7: Delete: bdb/test/log.tcl BitKeeper/deleted/.del-mpool.tcl~b0df4dc1b04db26c: Delete: bdb/test/mpool.tcl BitKeeper/deleted/.del-mutex.tcl~52fd5c73a150565: Delete: bdb/test/mutex.tcl BitKeeper/deleted/.del-txn.tcl~c4ff071550b5446e: Delete: bdb/test/txn.tcl BitKeeper/deleted/.del-README~e800a12a5392010a: Delete: bdb/test/upgrade/README BitKeeper/deleted/.del-pack-2.6.6.pl~89d5076d758d3e98: Delete: bdb/test/upgrade/generate-2.X/pack-2.6.6.pl BitKeeper/deleted/.del-test-2.6.patch~4a52dc83d447547b: Delete: bdb/test/upgrade/generate-2.X/test-2.6.patch
790 lines
23 KiB
C
790 lines
23 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996-2002
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
|
|
#include "db_config.h"
|
|
|
|
#ifndef lint
|
|
static const char copyright[] =
|
|
"Copyright (c) 1996-2002\nSleepycat Software Inc. All rights reserved.\n";
|
|
static const char revid[] =
|
|
"$Id: env_recover.c,v 11.97 2002/08/22 17:43:22 margo Exp $";
|
|
#endif
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
|
|
#if TIME_WITH_SYS_TIME
|
|
#include <sys/time.h>
|
|
#include <time.h>
|
|
#else
|
|
#if HAVE_SYS_TIME_H
|
|
#include <sys/time.h>
|
|
#else
|
|
#include <time.h>
|
|
#endif
|
|
#endif
|
|
|
|
#include <string.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "dbinc/db_page.h"
|
|
#include "dbinc/db_shash.h"
|
|
#include "dbinc/lock.h"
|
|
#include "dbinc/log.h"
|
|
#include "dbinc/rep.h"
|
|
#include "dbinc/txn.h"
|
|
#include "dbinc/db_am.h"
|
|
|
|
static int __log_backup __P((DB_ENV *, DB_LOGC *, DB_LSN *, DB_LSN *));
|
|
static int __log_earliest __P((DB_ENV *, DB_LOGC *, int32_t *, DB_LSN *));
|
|
static double __lsn_diff __P((DB_LSN *, DB_LSN *, DB_LSN *, u_int32_t, int));
|
|
|
|
/*
|
|
* __db_apprec --
|
|
* Perform recovery. If max_lsn is non-NULL, then we are trying
|
|
* to synchronize this system up with another system that has a max
|
|
* LSN of max_lsn, so we need to roll back sufficiently far for that
|
|
* to work. See __log_backup for details.
|
|
*
|
|
* PUBLIC: int __db_apprec __P((DB_ENV *, DB_LSN *, u_int32_t));
|
|
*/
|
|
int
|
|
__db_apprec(dbenv, max_lsn, flags)
|
|
DB_ENV *dbenv;
|
|
DB_LSN *max_lsn;
|
|
u_int32_t flags;
|
|
{
|
|
DBT data;
|
|
DB_LOGC *logc;
|
|
DB_LSN ckp_lsn, first_lsn, last_lsn, lowlsn, lsn, stop_lsn;
|
|
DB_TXNREGION *region;
|
|
__txn_ckp_args *ckp_args;
|
|
time_t now, tlow;
|
|
int32_t log_size, low;
|
|
double nfiles;
|
|
int have_rec, is_thread, progress, ret, t_ret;
|
|
int (**dtab) __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
|
size_t dtabsize;
|
|
u_int32_t hi_txn, lockid, txnid;
|
|
char *p, *pass, t1[60], t2[60];
|
|
void *txninfo;
|
|
|
|
COMPQUIET(nfiles, (double)0);
|
|
|
|
logc = NULL;
|
|
ckp_args = NULL;
|
|
dtab = NULL;
|
|
hi_txn = TXN_MAXIMUM;
|
|
lockid = DB_LOCK_INVALIDID;
|
|
txninfo = NULL;
|
|
pass = "initial";
|
|
|
|
/*
|
|
* XXX
|
|
* Get the log size. No locking required because we're single-threaded
|
|
* during recovery.
|
|
*/
|
|
log_size =
|
|
((LOG *)(((DB_LOG *)dbenv->lg_handle)->reginfo.primary))->log_size;
|
|
|
|
/*
|
|
* Save the state of the thread flag -- we don't need it on at the
|
|
* moment because we're single-threaded until recovery is complete.
|
|
*/
|
|
is_thread = F_ISSET(dbenv, DB_ENV_THREAD) ? 1 : 0;
|
|
F_CLR(dbenv, DB_ENV_THREAD);
|
|
|
|
/* Set in-recovery flags. */
|
|
F_SET((DB_LOG *)dbenv->lg_handle, DBLOG_RECOVER);
|
|
region = ((DB_TXNMGR *)dbenv->tx_handle)->reginfo.primary;
|
|
F_SET(region, TXN_IN_RECOVERY);
|
|
|
|
/* Allocate a cursor for the log. */
|
|
if ((ret = dbenv->log_cursor(dbenv, &logc, 0)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* If the user is specifying recovery to a particular point in time
|
|
* or to a particular LSN, find the point to start recovery from.
|
|
*/
|
|
ZERO_LSN(lowlsn);
|
|
if (max_lsn != NULL) {
|
|
if ((ret = __log_backup(dbenv, logc, max_lsn, &lowlsn)) != 0)
|
|
goto err;
|
|
} else if (dbenv->tx_timestamp != 0) {
|
|
if ((ret = __log_earliest(dbenv, logc, &low, &lowlsn)) != 0)
|
|
goto err;
|
|
if ((int32_t)dbenv->tx_timestamp < low) {
|
|
(void)snprintf(t1, sizeof(t1),
|
|
"%s", ctime(&dbenv->tx_timestamp));
|
|
if ((p = strchr(t1, '\n')) != NULL)
|
|
*p = '\0';
|
|
tlow = (time_t)low;
|
|
(void)snprintf(t2, sizeof(t2), "%s", ctime(&tlow));
|
|
if ((p = strchr(t2, '\n')) != NULL)
|
|
*p = '\0';
|
|
__db_err(dbenv,
|
|
"Invalid recovery timestamp %s; earliest time is %s",
|
|
t1, t2);
|
|
ret = EINVAL;
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Recovery is done in three passes:
|
|
* Pass #0:
|
|
* We need to find the position from which we will open files.
|
|
* We need to open files beginning with the earlier of the
|
|
* most recent checkpoint LSN and a checkpoint LSN before the
|
|
* recovery timestamp, if specified. We need to be before the
|
|
* most recent checkpoint LSN because we are going to collect
|
|
* information about which transactions were begun before we
|
|
* start rolling forward. Those that were should never be undone
|
|
* because queue cannot use LSNs to determine what operations can
|
|
* safely be aborted and it cannot rollback operations in
|
|
* transactions for which there may be records not processed
|
|
* during recovery. We need to consider earlier points in time
|
|
* in case we are recovering to a particular timestamp.
|
|
*
|
|
* Pass #1:
|
|
* Read forward through the log from the position found in pass 0
|
|
* opening and closing files, and recording transactions for which
|
|
* we've seen their first record (the transaction's prev_lsn is
|
|
* 0,0). At the end of this pass, we know all transactions for
|
|
* which we've seen begins and we have the "current" set of files
|
|
* open.
|
|
*
|
|
* Pass #2:
|
|
* Read backward through the log undoing any uncompleted TXNs.
|
|
* There are four cases:
|
|
* 1. If doing catastrophic recovery, we read to the
|
|
* beginning of the log
|
|
* 2. If we are doing normal reovery, then we have to roll
|
|
* back to the most recent checkpoint LSN.
|
|
* 3. If we are recovering to a point in time, then we have
|
|
* to roll back to the checkpoint whose ckp_lsn is earlier
|
|
* than the specified time. __log_earliest will figure
|
|
* this out for us.
|
|
* 4. If we are recovering back to a particular LSN, then
|
|
* we have to roll back to the checkpoint whose ckp_lsn
|
|
* is earlier than the max_lsn. __log_backup will figure
|
|
* that out for us.
|
|
* In case 2, "uncompleted TXNs" include all those who commited
|
|
* after the user's specified timestamp.
|
|
*
|
|
* Pass #3:
|
|
* Read forward through the log from the LSN found in pass #2,
|
|
* redoing any committed TXNs (which commited after any user-
|
|
* specified rollback point). During this pass, checkpoint
|
|
* file information is ignored, and file openings and closings
|
|
* are redone.
|
|
*
|
|
* ckp_lsn -- lsn of the last checkpoint or the first in the log.
|
|
* first_lsn -- the lsn where the forward passes begin.
|
|
* last_lsn -- the last lsn in the log, used for feedback
|
|
* lowlsn -- the lsn we are rolling back to, if we are recovering
|
|
* to a point in time.
|
|
* lsn -- temporary use lsn.
|
|
* stop_lsn -- the point at which forward roll should stop
|
|
*/
|
|
|
|
/*
|
|
* Find out the last lsn, so that we can estimate how far along we
|
|
* are in recovery. This will help us determine how much log there
|
|
* is between the first LSN that we're going to be working with and
|
|
* the last one. We assume that each of the three phases takes the
|
|
* same amount of time (a false assumption) and then use the %-age
|
|
* of the amount of log traversed to figure out how much of the
|
|
* pass we've accomplished.
|
|
*
|
|
* If we can't find any log records, we're kind of done.
|
|
*/
|
|
#ifdef UMRW
|
|
ZERO_LSN(last_lsn);
|
|
#endif
|
|
memset(&data, 0, sizeof(data));
|
|
if ((ret = logc->get(logc, &last_lsn, &data, DB_LAST)) != 0) {
|
|
if (ret == DB_NOTFOUND)
|
|
ret = 0;
|
|
else
|
|
__db_err(dbenv, "Last log record not found");
|
|
goto err;
|
|
}
|
|
|
|
do {
|
|
/* txnid is after rectype, which is a u_int32. */
|
|
memcpy(&txnid,
|
|
(u_int8_t *)data.data + sizeof(u_int32_t), sizeof(txnid));
|
|
|
|
if (txnid != 0)
|
|
break;
|
|
} while ((ret = logc->get(logc, &lsn, &data, DB_PREV)) == 0);
|
|
|
|
/*
|
|
* There are no transactions, so there is nothing to do unless
|
|
* we're recovering to an LSN. If we are, we need to proceed since
|
|
* we'll still need to do a vtruncate based on information we haven't
|
|
* yet collected.
|
|
*/
|
|
if (ret == DB_NOTFOUND) {
|
|
ret = 0;
|
|
if (max_lsn == NULL)
|
|
goto done;
|
|
}
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
hi_txn = txnid;
|
|
|
|
/*
|
|
* Pass #0
|
|
* Find the LSN from which we begin OPENFILES.
|
|
*
|
|
* If this is a catastrophic recovery, or if no checkpoint exists
|
|
* in the log, the LSN is the first LSN in the log.
|
|
*
|
|
* Otherwise, it is the minimum of (1) the LSN in the last checkpoint
|
|
* and (2) the LSN in the checkpoint before any specified recovery
|
|
* timestamp or max_lsn.
|
|
*/
|
|
/*
|
|
* Get the first LSN in the log; it's an initial default
|
|
* even if this is not a catastrophic recovery.
|
|
*/
|
|
if ((ret = logc->get(logc, &ckp_lsn, &data, DB_FIRST)) != 0) {
|
|
if (ret == DB_NOTFOUND)
|
|
ret = 0;
|
|
else
|
|
__db_err(dbenv, "First log record not found");
|
|
goto err;
|
|
}
|
|
first_lsn = ckp_lsn;
|
|
have_rec = 1;
|
|
|
|
if (!LF_ISSET(DB_RECOVER_FATAL)) {
|
|
if ((ret = __txn_getckp(dbenv, &ckp_lsn)) == 0 &&
|
|
(ret = logc->get(logc, &ckp_lsn, &data, DB_SET)) == 0) {
|
|
/* We have a recent checkpoint. This is LSN (1). */
|
|
if ((ret = __txn_ckp_read(dbenv,
|
|
data.data, &ckp_args)) != 0) {
|
|
__db_err(dbenv,
|
|
"Invalid checkpoint record at [%ld][%ld]",
|
|
(u_long)ckp_lsn.file,
|
|
(u_long)ckp_lsn.offset);
|
|
goto err;
|
|
}
|
|
first_lsn = ckp_args->ckp_lsn;
|
|
have_rec = 0;
|
|
}
|
|
|
|
/*
|
|
* If LSN (2) exists, use it if it's before LSN (1).
|
|
* (If LSN (1) doesn't exist, first_lsn is the
|
|
* beginning of the log, so will "win" this check.)
|
|
*
|
|
* XXX
|
|
* In the recovery-to-a-timestamp case, lowlsn is chosen by
|
|
* __log_earliest, and is the checkpoint LSN of the
|
|
* *earliest* checkpoint in the unreclaimed log. I
|
|
* (krinsky) believe that we could optimize this by looking
|
|
* instead for the LSN of the *latest* checkpoint before
|
|
* the timestamp of interest, but I'm not sure that this
|
|
* is worth doing right now. (We have to look for lowlsn
|
|
* and low anyway, to make sure the requested timestamp is
|
|
* somewhere in the logs we have, and all that's required
|
|
* is that we pick *some* checkpoint after the beginning of
|
|
* the logs and before the timestamp.
|
|
*/
|
|
if ((dbenv->tx_timestamp != 0 || max_lsn != NULL) &&
|
|
log_compare(&lowlsn, &first_lsn) < 0) {
|
|
DB_ASSERT(have_rec == 0);
|
|
first_lsn = lowlsn;
|
|
}
|
|
}
|
|
|
|
/* Get the record at first_lsn if we don't have it already. */
|
|
if (!have_rec &&
|
|
(ret = logc->get(logc, &first_lsn, &data, DB_SET)) != 0) {
|
|
__db_err(dbenv, "Checkpoint LSN record [%ld][%ld] not found",
|
|
(u_long)first_lsn.file, (u_long)first_lsn.offset);
|
|
goto err;
|
|
}
|
|
|
|
if (dbenv->db_feedback != NULL) {
|
|
if (last_lsn.file == first_lsn.file)
|
|
nfiles = (double)
|
|
(last_lsn.offset - first_lsn.offset) / log_size;
|
|
else
|
|
nfiles = (double)(last_lsn.file - first_lsn.file) +
|
|
(double)(log_size - first_lsn.offset +
|
|
last_lsn.offset) / log_size;
|
|
/* We are going to divide by nfiles; make sure it isn't 0. */
|
|
if (nfiles == 0)
|
|
nfiles = (double)0.001;
|
|
}
|
|
|
|
/* Find a low txnid. */
|
|
ret = 0;
|
|
do {
|
|
/* txnid is after rectype, which is a u_int32. */
|
|
memcpy(&txnid,
|
|
(u_int8_t *)data.data + sizeof(u_int32_t), sizeof(txnid));
|
|
|
|
if (txnid != 0)
|
|
break;
|
|
} while ((ret = logc->get(logc, &lsn, &data, DB_NEXT)) == 0);
|
|
|
|
/*
|
|
* There are no transactions and we're not recovering to an LSN (see
|
|
* above), so there is nothing to do.
|
|
*/
|
|
if (ret == DB_NOTFOUND) {
|
|
ret = 0;
|
|
if (max_lsn == NULL)
|
|
goto done;
|
|
}
|
|
|
|
/* Reset to the first lsn. */
|
|
if (ret != 0 || (ret = logc->get(logc, &first_lsn, &data, DB_SET)) != 0)
|
|
goto err;
|
|
|
|
/* Initialize the transaction list. */
|
|
if ((ret =
|
|
__db_txnlist_init(dbenv, txnid, hi_txn, max_lsn, &txninfo)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Pass #1
|
|
* Run forward through the log starting at the first relevant lsn.
|
|
*/
|
|
if ((ret = __env_openfiles(dbenv, logc,
|
|
txninfo, &data, &first_lsn, &last_lsn, nfiles, 1)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Pass #2.
|
|
*
|
|
* We used first_lsn to tell us how far back we need to recover,
|
|
* use it here.
|
|
*/
|
|
|
|
if (FLD_ISSET(dbenv->verbose, DB_VERB_RECOVERY))
|
|
__db_err(dbenv, "Recovery starting from [%lu][%lu]",
|
|
(u_long)first_lsn.file, (u_long)first_lsn.offset);
|
|
|
|
/*
|
|
* If we are doing client recovery, then we need to allocate
|
|
* the page-info lock table.
|
|
*/
|
|
if (max_lsn != NULL) {
|
|
if ((ret = __rep_lockpgno_init(dbenv, &dtab, &dtabsize)) != 0)
|
|
goto err;
|
|
if ((ret = dbenv->lock_id(dbenv, &lockid)) != 0)
|
|
goto err;
|
|
}
|
|
|
|
pass = "backward";
|
|
for (ret = logc->get(logc, &lsn, &data, DB_LAST);
|
|
ret == 0 && log_compare(&lsn, &first_lsn) >= 0;
|
|
ret = logc->get(logc, &lsn, &data, DB_PREV)) {
|
|
if (dbenv->db_feedback != NULL) {
|
|
progress = 34 + (int)(33 * (__lsn_diff(&first_lsn,
|
|
&last_lsn, &lsn, log_size, 0) / nfiles));
|
|
dbenv->db_feedback(dbenv, DB_RECOVER, progress);
|
|
}
|
|
if (max_lsn != NULL && (ret = __rep_lockpages(dbenv,
|
|
dtab, dtabsize, &lsn, NULL, NULL, lockid)) != 0)
|
|
continue;
|
|
|
|
ret = __db_dispatch(dbenv, dbenv->recover_dtab,
|
|
dbenv->recover_dtab_size, &data, &lsn,
|
|
DB_TXN_BACKWARD_ROLL, txninfo);
|
|
if (ret != 0) {
|
|
if (ret != DB_TXN_CKP)
|
|
goto msgerr;
|
|
else
|
|
ret = 0;
|
|
}
|
|
}
|
|
if (ret != 0 && ret != DB_NOTFOUND)
|
|
goto err;
|
|
|
|
/*
|
|
* Pass #3. If we are recovering to a timestamp or to an LSN,
|
|
* we need to make sure that we don't roll-forward beyond that
|
|
* point because there may be non-transactional operations (e.g.,
|
|
* closes that would fail). The last_lsn variable is used for
|
|
* feedback calculations, but use it to set an initial stopping
|
|
* point for the forward pass, and then reset appropriately to
|
|
* derive a real stop_lsn that tells how far the forward pass
|
|
* should go.
|
|
*/
|
|
pass = "forward";
|
|
stop_lsn = last_lsn;
|
|
if (max_lsn != NULL || dbenv->tx_timestamp != 0)
|
|
stop_lsn = ((DB_TXNHEAD *)txninfo)->maxlsn;
|
|
|
|
for (ret = logc->get(logc, &lsn, &data, DB_NEXT);
|
|
ret == 0; ret = logc->get(logc, &lsn, &data, DB_NEXT)) {
|
|
/*
|
|
* If we are recovering to a timestamp or an LSN,
|
|
* we need to make sure that we don't try to roll
|
|
* forward beyond the soon-to-be end of log.
|
|
*/
|
|
if (log_compare(&lsn, &stop_lsn) > 0)
|
|
break;
|
|
|
|
if (dbenv->db_feedback != NULL) {
|
|
progress = 67 + (int)(33 * (__lsn_diff(&first_lsn,
|
|
&last_lsn, &lsn, log_size, 1) / nfiles));
|
|
dbenv->db_feedback(dbenv, DB_RECOVER, progress);
|
|
}
|
|
ret = __db_dispatch(dbenv, dbenv->recover_dtab,
|
|
dbenv->recover_dtab_size, &data, &lsn,
|
|
DB_TXN_FORWARD_ROLL, txninfo);
|
|
if (ret != 0) {
|
|
if (ret != DB_TXN_CKP)
|
|
goto msgerr;
|
|
else
|
|
ret = 0;
|
|
}
|
|
|
|
}
|
|
if (ret != 0 && ret != DB_NOTFOUND)
|
|
goto err;
|
|
|
|
/*
|
|
* Process any pages that were on the limbo list and move them to
|
|
* the free list. Do this before checkpointing the database.
|
|
*/
|
|
if ((ret = __db_do_the_limbo(dbenv, NULL, NULL, txninfo)) != 0)
|
|
goto err;
|
|
|
|
if (max_lsn == NULL)
|
|
region->last_txnid = ((DB_TXNHEAD *)txninfo)->maxid;
|
|
|
|
/* Take a checkpoint here to force any dirty data pages to disk. */
|
|
if (dbenv->tx_timestamp != 0) {
|
|
region->last_ckp = ((DB_TXNHEAD *)txninfo)->ckplsn;
|
|
__log_vtruncate(dbenv, &((DB_TXNHEAD *)txninfo)->maxlsn,
|
|
&((DB_TXNHEAD *)txninfo)->ckplsn);
|
|
}
|
|
|
|
if ((ret = dbenv->txn_checkpoint(dbenv, 0, 0, DB_FORCE)) != 0)
|
|
goto err;
|
|
|
|
/* Close all the db files that are open. */
|
|
if ((ret = __dbreg_close_files(dbenv)) != 0)
|
|
goto err;
|
|
|
|
if (max_lsn != NULL) {
|
|
region->last_ckp = ((DB_TXNHEAD *)txninfo)->ckplsn;
|
|
|
|
/* We are going to truncate, so we'd best close the cursor. */
|
|
if (logc != NULL && (ret = logc->close(logc, 0)) != 0)
|
|
goto err;
|
|
__log_vtruncate(dbenv,
|
|
max_lsn, &((DB_TXNHEAD *)txninfo)->ckplsn);
|
|
|
|
/*
|
|
* Now we need to open files that should be open in order for
|
|
* client processing to continue. However, since we've
|
|
* truncated the log, we need to recompute from where the
|
|
* openfiles pass should begin.
|
|
*/
|
|
if ((ret = dbenv->log_cursor(dbenv, &logc, 0)) != 0)
|
|
goto err;
|
|
if ((ret = logc->get(logc, &first_lsn, &data, DB_FIRST)) != 0) {
|
|
if (ret == DB_NOTFOUND)
|
|
ret = 0;
|
|
else
|
|
__db_err(dbenv, "First log record not found");
|
|
goto err;
|
|
}
|
|
if ((ret = __txn_getckp(dbenv, &first_lsn)) == 0 &&
|
|
(ret = logc->get(logc, &first_lsn, &data, DB_SET)) == 0) {
|
|
/* We have a recent checkpoint. This is LSN (1). */
|
|
if ((ret = __txn_ckp_read(dbenv,
|
|
data.data, &ckp_args)) != 0) {
|
|
__db_err(dbenv,
|
|
"Invalid checkpoint record at [%ld][%ld]",
|
|
(u_long)first_lsn.file,
|
|
(u_long)first_lsn.offset);
|
|
goto err;
|
|
}
|
|
first_lsn = ckp_args->ckp_lsn;
|
|
}
|
|
if ((ret = logc->get(logc, &first_lsn, &data, DB_SET)) != 0)
|
|
goto err;
|
|
if ((ret = __env_openfiles(dbenv, logc,
|
|
txninfo, &data, &first_lsn, NULL, nfiles, 1)) != 0)
|
|
goto err;
|
|
} else if (region->stat.st_nrestores == 0)
|
|
/*
|
|
* If there are no prepared transactions that need resolution,
|
|
* we need to reset the transaction ID space and log this fact.
|
|
*/
|
|
if ((ret = __txn_reset(dbenv)) != 0)
|
|
goto err;
|
|
|
|
if (FLD_ISSET(dbenv->verbose, DB_VERB_RECOVERY)) {
|
|
(void)time(&now);
|
|
__db_err(dbenv, "Recovery complete at %.24s", ctime(&now));
|
|
__db_err(dbenv, "%s %lx %s [%lu][%lu]",
|
|
"Maximum transaction ID",
|
|
((DB_TXNHEAD *)txninfo)->maxid,
|
|
"Recovery checkpoint",
|
|
(u_long)region->last_ckp.file,
|
|
(u_long)region->last_ckp.offset);
|
|
}
|
|
|
|
if (0) {
|
|
msgerr: __db_err(dbenv,
|
|
"Recovery function for LSN %lu %lu failed on %s pass",
|
|
(u_long)lsn.file, (u_long)lsn.offset, pass);
|
|
}
|
|
|
|
done:
|
|
err: if (lockid != DB_LOCK_INVALIDID) {
|
|
if ((t_ret = __rep_unlockpages(dbenv, lockid)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
if ((t_ret =
|
|
dbenv->lock_id_free(dbenv, lockid)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
}
|
|
|
|
if (logc != NULL && (t_ret = logc->close(logc, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
if (txninfo != NULL)
|
|
__db_txnlist_end(dbenv, txninfo);
|
|
|
|
if (dtab != NULL)
|
|
__os_free(dbenv, dtab);
|
|
|
|
if (ckp_args != NULL)
|
|
__os_free(dbenv, ckp_args);
|
|
|
|
dbenv->tx_timestamp = 0;
|
|
|
|
/* Restore the state of the thread flag, clear in-recovery flags. */
|
|
if (is_thread)
|
|
F_SET(dbenv, DB_ENV_THREAD);
|
|
F_CLR((DB_LOG *)dbenv->lg_handle, DBLOG_RECOVER);
|
|
F_CLR(region, TXN_IN_RECOVERY);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* Figure out how many logfiles we have processed. If we are moving
|
|
* forward (is_forward != 0), then we're computing current - low. If
|
|
* we are moving backward, we are computing high - current. max is
|
|
* the number of bytes per logfile.
|
|
*/
|
|
static double
|
|
__lsn_diff(low, high, current, max, is_forward)
|
|
DB_LSN *low, *high, *current;
|
|
u_int32_t max;
|
|
int is_forward;
|
|
{
|
|
double nf;
|
|
|
|
/*
|
|
* There are three cases in each direction. If you are in the
|
|
* same file, then all you need worry about is the difference in
|
|
* offsets. If you are in different files, then either your offsets
|
|
* put you either more or less than the integral difference in the
|
|
* number of files -- we need to handle both of these.
|
|
*/
|
|
if (is_forward) {
|
|
if (current->file == low->file)
|
|
nf = (double)(current->offset - low->offset) / max;
|
|
else if (current->offset < low->offset)
|
|
nf = (double)(current->file - low->file - 1) +
|
|
(double)(max - low->offset + current->offset) / max;
|
|
else
|
|
nf = (double)(current->file - low->file) +
|
|
(double)(current->offset - low->offset) / max;
|
|
} else {
|
|
if (current->file == high->file)
|
|
nf = (double)(high->offset - current->offset) / max;
|
|
else if (current->offset > high->offset)
|
|
nf = (double)(high->file - current->file - 1) +
|
|
(double)
|
|
(max - current->offset + high->offset) / max;
|
|
else
|
|
nf = (double)(high->file - current->file) +
|
|
(double)(high->offset - current->offset) / max;
|
|
}
|
|
return (nf);
|
|
}
|
|
|
|
/*
|
|
* __log_backup --
|
|
*
|
|
* This is used to find the earliest log record to process when a client
|
|
* is trying to sync up with a master whose max LSN is less than this
|
|
* client's max lsn; we want to roll back everything after that
|
|
*
|
|
* Find the latest checkpoint whose ckp_lsn is less than the max lsn.
|
|
*/
|
|
static int
|
|
__log_backup(dbenv, logc, max_lsn, start_lsn)
|
|
DB_ENV *dbenv;
|
|
DB_LOGC *logc;
|
|
DB_LSN *max_lsn, *start_lsn;
|
|
{
|
|
DB_LSN lsn;
|
|
DBT data;
|
|
__txn_ckp_args *ckp_args;
|
|
int ret;
|
|
|
|
memset(&data, 0, sizeof(data));
|
|
ckp_args = NULL;
|
|
|
|
/*
|
|
* Follow checkpoints through the log until we find one with
|
|
* a ckp_lsn less than max_lsn.
|
|
*/
|
|
if ((ret = __txn_getckp(dbenv, &lsn)) != 0)
|
|
goto err;
|
|
while ((ret = logc->get(logc, &lsn, &data, DB_SET)) == 0) {
|
|
if ((ret = __txn_ckp_read(dbenv, data.data, &ckp_args)) != 0)
|
|
return (ret);
|
|
if (log_compare(&ckp_args->ckp_lsn, max_lsn) <= 0) {
|
|
*start_lsn = ckp_args->ckp_lsn;
|
|
break;
|
|
}
|
|
|
|
lsn = ckp_args->prev_lsn;
|
|
if (IS_ZERO_LSN(lsn))
|
|
break;
|
|
__os_free(dbenv, ckp_args);
|
|
}
|
|
|
|
if (ckp_args != NULL)
|
|
__os_free(dbenv, ckp_args);
|
|
err: if (IS_ZERO_LSN(*start_lsn) && (ret == 0 || ret == DB_NOTFOUND))
|
|
ret = logc->get(logc, start_lsn, &data, DB_FIRST);
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __log_earliest --
|
|
*
|
|
* Return the earliest recovery point for the log files present. The
|
|
* earliest recovery time is the time stamp of the first checkpoint record
|
|
* whose checkpoint LSN is greater than the first LSN we process.
|
|
*/
|
|
static int
|
|
__log_earliest(dbenv, logc, lowtime, lowlsn)
|
|
DB_ENV *dbenv;
|
|
DB_LOGC *logc;
|
|
int32_t *lowtime;
|
|
DB_LSN *lowlsn;
|
|
{
|
|
DB_LSN first_lsn, lsn;
|
|
DBT data;
|
|
__txn_ckp_args *ckpargs;
|
|
u_int32_t rectype;
|
|
int cmp, ret;
|
|
|
|
memset(&data, 0, sizeof(data));
|
|
/*
|
|
* Read forward through the log looking for the first checkpoint
|
|
* record whose ckp_lsn is greater than first_lsn.
|
|
*/
|
|
|
|
for (ret = logc->get(logc, &first_lsn, &data, DB_FIRST);
|
|
ret == 0; ret = logc->get(logc, &lsn, &data, DB_NEXT)) {
|
|
memcpy(&rectype, data.data, sizeof(rectype));
|
|
if (rectype != DB___txn_ckp)
|
|
continue;
|
|
if ((ret = __txn_ckp_read(dbenv, data.data, &ckpargs)) == 0) {
|
|
cmp = log_compare(&ckpargs->ckp_lsn, &first_lsn);
|
|
*lowlsn = ckpargs->ckp_lsn;
|
|
*lowtime = ckpargs->timestamp;
|
|
|
|
__os_free(dbenv, ckpargs);
|
|
if (cmp >= 0)
|
|
break;
|
|
}
|
|
}
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __env_openfiles --
|
|
* Perform the pass of recovery that opens files. This is used
|
|
* both during regular recovery and an initial call to txn_recover (since
|
|
* we need files open in order to abort prepared, but not yet committed
|
|
* transactions).
|
|
*
|
|
* See the comments in db_apprec for a detailed description of the
|
|
* various recovery passes.
|
|
*
|
|
* If we are not doing feedback processing (i.e., we are doing txn_recover
|
|
* processing and in_recovery is zero), then last_lsn can be NULL.
|
|
*
|
|
* PUBLIC: int __env_openfiles __P((DB_ENV *, DB_LOGC *,
|
|
* PUBLIC: void *, DBT *, DB_LSN *, DB_LSN *, double, int));
|
|
*/
|
|
int
|
|
__env_openfiles(dbenv, logc, txninfo,
|
|
data, open_lsn, last_lsn, nfiles, in_recovery)
|
|
DB_ENV *dbenv;
|
|
DB_LOGC *logc;
|
|
void *txninfo;
|
|
DBT *data;
|
|
DB_LSN *open_lsn, *last_lsn;
|
|
int in_recovery;
|
|
double nfiles;
|
|
{
|
|
DB_LSN lsn;
|
|
u_int32_t log_size;
|
|
int progress, ret;
|
|
|
|
/*
|
|
* XXX
|
|
* Get the log size. No locking required because we're single-threaded
|
|
* during recovery.
|
|
*/
|
|
log_size =
|
|
((LOG *)(((DB_LOG *)dbenv->lg_handle)->reginfo.primary))->log_size;
|
|
|
|
lsn = *open_lsn;
|
|
for (;;) {
|
|
if (in_recovery && dbenv->db_feedback != NULL) {
|
|
DB_ASSERT(last_lsn != NULL);
|
|
progress = (int)(33 * (__lsn_diff(open_lsn,
|
|
last_lsn, &lsn, log_size, 1) / nfiles));
|
|
dbenv->db_feedback(dbenv, DB_RECOVER, progress);
|
|
}
|
|
ret = __db_dispatch(dbenv,
|
|
dbenv->recover_dtab, dbenv->recover_dtab_size, data, &lsn,
|
|
in_recovery ? DB_TXN_OPENFILES : DB_TXN_POPENFILES,
|
|
txninfo);
|
|
if (ret != 0 && ret != DB_TXN_CKP) {
|
|
__db_err(dbenv,
|
|
"Recovery function for LSN %lu %lu failed",
|
|
(u_long)lsn.file, (u_long)lsn.offset);
|
|
break;
|
|
}
|
|
if ((ret = logc->get(logc, &lsn, data, DB_NEXT)) != 0) {
|
|
if (ret == DB_NOTFOUND)
|
|
ret = 0;
|
|
break;
|
|
}
|
|
}
|
|
|
|
return (ret);
|
|
}
|