mirror of
https://github.com/MariaDB/server.git
synced 2025-01-17 20:42:30 +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
627 lines
16 KiB
C
627 lines
16 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 revid[] = "$Id: mp_sync.c,v 11.64 2002/08/25 16:00:27 bostic Exp $";
|
|
#endif /* not lint */
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
|
|
#include <stdlib.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "dbinc/db_shash.h"
|
|
#include "dbinc/mp.h"
|
|
|
|
typedef struct {
|
|
DB_MPOOL_HASH *track_hp; /* Hash bucket. */
|
|
|
|
roff_t track_off; /* Page file offset. */
|
|
db_pgno_t track_pgno; /* Page number. */
|
|
} BH_TRACK;
|
|
|
|
static int __bhcmp __P((const void *, const void *));
|
|
static int __memp_close_flush_files __P((DB_ENV *, DB_MPOOL *));
|
|
static int __memp_sync_files __P((DB_ENV *, DB_MPOOL *));
|
|
|
|
/*
|
|
* __memp_sync --
|
|
* Mpool sync function.
|
|
*
|
|
* PUBLIC: int __memp_sync __P((DB_ENV *, DB_LSN *));
|
|
*/
|
|
int
|
|
__memp_sync(dbenv, lsnp)
|
|
DB_ENV *dbenv;
|
|
DB_LSN *lsnp;
|
|
{
|
|
DB_MPOOL *dbmp;
|
|
MPOOL *mp;
|
|
int ret;
|
|
|
|
PANIC_CHECK(dbenv);
|
|
ENV_REQUIRES_CONFIG(dbenv,
|
|
dbenv->mp_handle, "memp_sync", DB_INIT_MPOOL);
|
|
|
|
/*
|
|
* If no LSN is provided, flush the entire cache (reasonable usage
|
|
* even if there's no log subsystem configured).
|
|
*/
|
|
if (lsnp != NULL)
|
|
ENV_REQUIRES_CONFIG(dbenv,
|
|
dbenv->lg_handle, "memp_sync", DB_INIT_LOG);
|
|
|
|
dbmp = dbenv->mp_handle;
|
|
mp = dbmp->reginfo[0].primary;
|
|
|
|
/* If we've flushed to the requested LSN, return that information. */
|
|
if (lsnp != NULL) {
|
|
R_LOCK(dbenv, dbmp->reginfo);
|
|
if (log_compare(lsnp, &mp->lsn) <= 0) {
|
|
*lsnp = mp->lsn;
|
|
|
|
R_UNLOCK(dbenv, dbmp->reginfo);
|
|
return (0);
|
|
}
|
|
R_UNLOCK(dbenv, dbmp->reginfo);
|
|
}
|
|
|
|
if ((ret = __memp_sync_int(dbenv, NULL, 0, DB_SYNC_CACHE, NULL)) != 0)
|
|
return (ret);
|
|
|
|
if (lsnp != NULL) {
|
|
R_LOCK(dbenv, dbmp->reginfo);
|
|
if (log_compare(lsnp, &mp->lsn) > 0)
|
|
mp->lsn = *lsnp;
|
|
R_UNLOCK(dbenv, dbmp->reginfo);
|
|
}
|
|
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __memp_fsync --
|
|
* Mpool file sync function.
|
|
*
|
|
* PUBLIC: int __memp_fsync __P((DB_MPOOLFILE *));
|
|
*/
|
|
int
|
|
__memp_fsync(dbmfp)
|
|
DB_MPOOLFILE *dbmfp;
|
|
{
|
|
DB_ENV *dbenv;
|
|
DB_MPOOL *dbmp;
|
|
|
|
dbmp = dbmfp->dbmp;
|
|
dbenv = dbmp->dbenv;
|
|
|
|
PANIC_CHECK(dbenv);
|
|
|
|
/*
|
|
* If this handle doesn't have a file descriptor that's open for
|
|
* writing, or if the file is a temporary, there's no reason to
|
|
* proceed further.
|
|
*/
|
|
if (F_ISSET(dbmfp, MP_READONLY))
|
|
return (0);
|
|
|
|
if (F_ISSET(dbmfp->mfp, MP_TEMP))
|
|
return (0);
|
|
|
|
return (__memp_sync_int(dbenv, dbmfp, 0, DB_SYNC_FILE, NULL));
|
|
}
|
|
|
|
/*
|
|
* __mp_xxx_fh --
|
|
* Return a file descriptor for DB 1.85 compatibility locking.
|
|
*
|
|
* PUBLIC: int __mp_xxx_fh __P((DB_MPOOLFILE *, DB_FH **));
|
|
*/
|
|
int
|
|
__mp_xxx_fh(dbmfp, fhp)
|
|
DB_MPOOLFILE *dbmfp;
|
|
DB_FH **fhp;
|
|
{
|
|
DB_ENV *dbenv;
|
|
/*
|
|
* This is a truly spectacular layering violation, intended ONLY to
|
|
* support compatibility for the DB 1.85 DB->fd call.
|
|
*
|
|
* Sync the database file to disk, creating the file as necessary.
|
|
*
|
|
* We skip the MP_READONLY and MP_TEMP tests done by memp_fsync(3).
|
|
* The MP_READONLY test isn't interesting because we will either
|
|
* already have a file descriptor (we opened the database file for
|
|
* reading) or we aren't readonly (we created the database which
|
|
* requires write privileges). The MP_TEMP test isn't interesting
|
|
* because we want to write to the backing file regardless so that
|
|
* we get a file descriptor to return.
|
|
*/
|
|
*fhp = dbmfp->fhp;
|
|
if (F_ISSET(dbmfp->fhp, DB_FH_VALID))
|
|
return (0);
|
|
dbenv = dbmfp->dbmp->dbenv;
|
|
|
|
return (__memp_sync_int(dbenv, dbmfp, 0, DB_SYNC_FILE, NULL));
|
|
}
|
|
|
|
/*
|
|
* __memp_sync_int --
|
|
* Mpool sync internal function.
|
|
*
|
|
* PUBLIC: int __memp_sync_int
|
|
* PUBLIC: __P((DB_ENV *, DB_MPOOLFILE *, int, db_sync_op, int *));
|
|
*/
|
|
int
|
|
__memp_sync_int(dbenv, dbmfp, ar_max, op, wrotep)
|
|
DB_ENV *dbenv;
|
|
DB_MPOOLFILE *dbmfp;
|
|
int ar_max, *wrotep;
|
|
db_sync_op op;
|
|
{
|
|
BH *bhp;
|
|
BH_TRACK *bharray;
|
|
DB_MPOOL *dbmp;
|
|
DB_MPOOL_HASH *hp;
|
|
DB_MUTEX *mutexp;
|
|
MPOOL *c_mp, *mp;
|
|
MPOOLFILE *mfp;
|
|
u_int32_t n_cache;
|
|
int ar_cnt, hb_lock, i, pass, remaining, ret, t_ret, wait_cnt, wrote;
|
|
|
|
dbmp = dbenv->mp_handle;
|
|
mp = dbmp->reginfo[0].primary;
|
|
pass = wrote = 0;
|
|
|
|
/*
|
|
* If the caller does not specify how many pages assume one
|
|
* per bucket.
|
|
*/
|
|
if (ar_max == 0)
|
|
ar_max = mp->nreg * mp->htab_buckets;
|
|
|
|
if ((ret =
|
|
__os_malloc(dbenv, ar_max * sizeof(BH_TRACK), &bharray)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* Walk each cache's list of buffers and mark all dirty buffers to be
|
|
* written and all pinned buffers to be potentially written, depending
|
|
* on our flags.
|
|
*/
|
|
for (ar_cnt = 0, n_cache = 0; n_cache < mp->nreg; ++n_cache) {
|
|
c_mp = dbmp->reginfo[n_cache].primary;
|
|
|
|
hp = R_ADDR(&dbmp->reginfo[n_cache], c_mp->htab);
|
|
for (i = 0; i < c_mp->htab_buckets; i++, hp++) {
|
|
/*
|
|
* We can check for empty buckets before locking as we
|
|
* only care if the pointer is zero or non-zero. We
|
|
* can ignore empty buckets because we only need write
|
|
* buffers that were dirty before we started.
|
|
*/
|
|
if (SH_TAILQ_FIRST(&hp->hash_bucket, __bh) == NULL)
|
|
continue;
|
|
|
|
MUTEX_LOCK(dbenv, &hp->hash_mutex);
|
|
for (bhp = SH_TAILQ_FIRST(&hp->hash_bucket, __bh);
|
|
bhp != NULL; bhp = SH_TAILQ_NEXT(bhp, hq, __bh)) {
|
|
/* Always ignore unreferenced, clean pages. */
|
|
if (bhp->ref == 0 && !F_ISSET(bhp, BH_DIRTY))
|
|
continue;
|
|
|
|
/*
|
|
* Checkpoints have to wait on all pinned pages,
|
|
* as pages may be marked dirty when returned to
|
|
* the cache.
|
|
*
|
|
* File syncs only wait on pages both pinned and
|
|
* dirty. (We don't care if pages are marked
|
|
* dirty when returned to the cache, that means
|
|
* there's another writing thread and flushing
|
|
* the cache for this handle is meaningless.)
|
|
*/
|
|
if (op == DB_SYNC_FILE &&
|
|
!F_ISSET(bhp, BH_DIRTY))
|
|
continue;
|
|
|
|
mfp = R_ADDR(dbmp->reginfo, bhp->mf_offset);
|
|
|
|
/*
|
|
* Ignore temporary files -- this means you
|
|
* can't even flush temporary files by handle.
|
|
* (Checkpoint doesn't require temporary files
|
|
* be flushed and the underlying buffer write
|
|
* write routine may not be able to write it
|
|
* anyway.)
|
|
*/
|
|
if (F_ISSET(mfp, MP_TEMP))
|
|
continue;
|
|
|
|
/*
|
|
* If we're flushing a specific file, see if
|
|
* this page is from that file.
|
|
*/
|
|
if (dbmfp != NULL && mfp != dbmfp->mfp)
|
|
continue;
|
|
|
|
/*
|
|
* Ignore files that aren't involved in DB's
|
|
* transactional operations during checkpoints.
|
|
*/
|
|
if (dbmfp == NULL && mfp->lsn_off == -1)
|
|
continue;
|
|
|
|
/* Track the buffer, we want it. */
|
|
bharray[ar_cnt].track_hp = hp;
|
|
bharray[ar_cnt].track_pgno = bhp->pgno;
|
|
bharray[ar_cnt].track_off = bhp->mf_offset;
|
|
ar_cnt++;
|
|
|
|
if (ar_cnt >= ar_max) {
|
|
if ((ret = __os_realloc(dbenv,
|
|
(ar_max * 2) * sizeof(BH_TRACK),
|
|
&bharray)) != 0)
|
|
break;
|
|
ar_max *= 2;
|
|
}
|
|
}
|
|
MUTEX_UNLOCK(dbenv, &hp->hash_mutex);
|
|
|
|
if (ret != 0)
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
/* If there no buffers to write, we're done. */
|
|
if (ar_cnt == 0)
|
|
goto done;
|
|
|
|
/*
|
|
* Write the buffers in file/page order, trying to reduce seeks by the
|
|
* filesystem and, when pages are smaller than filesystem block sizes,
|
|
* reduce the actual number of writes.
|
|
*/
|
|
if (ar_cnt > 1)
|
|
qsort(bharray, ar_cnt, sizeof(BH_TRACK), __bhcmp);
|
|
|
|
/*
|
|
* If we're trickling buffers, only write enough to reach the correct
|
|
* percentage for this region. We may not write enough if the dirty
|
|
* buffers have an unbalanced distribution among the regions, but that
|
|
* seems unlikely.
|
|
*/
|
|
if (op == DB_SYNC_TRICKLE && ar_cnt > ar_max / (int)mp->nreg)
|
|
ar_cnt = ar_max / (int)mp->nreg;
|
|
|
|
/*
|
|
* Flush the log. We have to ensure the log records reflecting the
|
|
* changes on the database pages we're writing have already made it
|
|
* to disk. We still have to check the log each time we write a page
|
|
* (because pages we are about to write may be modified after we have
|
|
* flushed the log), but in general this will at least avoid any I/O
|
|
* on the log's part.
|
|
*/
|
|
if (LOGGING_ON(dbenv) && (ret = dbenv->log_flush(dbenv, NULL)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Walk the array, writing buffers. When we write a buffer, we NULL
|
|
* out its hash bucket pointer so we don't process a slot more than
|
|
* once.
|
|
*/
|
|
for (remaining = ar_cnt, i = pass = 0; remaining > 0; ++i) {
|
|
if (i >= ar_cnt) {
|
|
i = 0;
|
|
++pass;
|
|
__os_sleep(dbenv, 1, 0);
|
|
}
|
|
if ((hp = bharray[i].track_hp) == NULL)
|
|
continue;
|
|
|
|
/* Lock the hash bucket and find the buffer. */
|
|
mutexp = &hp->hash_mutex;
|
|
MUTEX_LOCK(dbenv, mutexp);
|
|
for (bhp = SH_TAILQ_FIRST(&hp->hash_bucket, __bh);
|
|
bhp != NULL; bhp = SH_TAILQ_NEXT(bhp, hq, __bh))
|
|
if (bhp->pgno == bharray[i].track_pgno &&
|
|
bhp->mf_offset == bharray[i].track_off)
|
|
break;
|
|
|
|
/*
|
|
* If we can't find the buffer we're done, somebody else had
|
|
* to have written it.
|
|
*
|
|
* If the buffer isn't pinned or dirty, we're done, there's
|
|
* no work needed.
|
|
*/
|
|
if (bhp == NULL || (bhp->ref == 0 && !F_ISSET(bhp, BH_DIRTY))) {
|
|
MUTEX_UNLOCK(dbenv, mutexp);
|
|
--remaining;
|
|
bharray[i].track_hp = NULL;
|
|
continue;
|
|
}
|
|
|
|
/*
|
|
* If the buffer is locked by another thread, ignore it, we'll
|
|
* come back to it.
|
|
*
|
|
* If the buffer is pinned and it's only the first or second
|
|
* time we have looked at it, ignore it, we'll come back to
|
|
* it.
|
|
*
|
|
* In either case, skip the buffer if we're not required to
|
|
* write it.
|
|
*/
|
|
if (F_ISSET(bhp, BH_LOCKED) || (bhp->ref != 0 && pass < 2)) {
|
|
MUTEX_UNLOCK(dbenv, mutexp);
|
|
if (op != DB_SYNC_CACHE && op != DB_SYNC_FILE) {
|
|
--remaining;
|
|
bharray[i].track_hp = NULL;
|
|
}
|
|
continue;
|
|
}
|
|
|
|
/*
|
|
* The buffer is either pinned or dirty.
|
|
*
|
|
* Set the sync wait-for count, used to count down outstanding
|
|
* references to this buffer as they are returned to the cache.
|
|
*/
|
|
bhp->ref_sync = bhp->ref;
|
|
|
|
/* Pin the buffer into memory and lock it. */
|
|
++bhp->ref;
|
|
F_SET(bhp, BH_LOCKED);
|
|
MUTEX_LOCK(dbenv, &bhp->mutex);
|
|
|
|
/*
|
|
* Unlock the hash bucket and wait for the wait-for count to
|
|
* go to 0. No new thread can acquire the buffer because we
|
|
* have it locked.
|
|
*
|
|
* If a thread attempts to re-pin a page, the wait-for count
|
|
* will never go to 0 (the thread spins on our buffer lock,
|
|
* while we spin on the thread's ref count). Give up if we
|
|
* don't get the buffer in 3 seconds, we can try again later.
|
|
*
|
|
* If, when the wait-for count goes to 0, the buffer is found
|
|
* to be dirty, write it.
|
|
*/
|
|
MUTEX_UNLOCK(dbenv, mutexp);
|
|
for (wait_cnt = 1;
|
|
bhp->ref_sync != 0 && wait_cnt < 4; ++wait_cnt)
|
|
__os_sleep(dbenv, 1, 0);
|
|
MUTEX_LOCK(dbenv, mutexp);
|
|
hb_lock = 1;
|
|
|
|
/*
|
|
* If the ref_sync count has gone to 0, we're going to be done
|
|
* with this buffer no matter what happens.
|
|
*/
|
|
if (bhp->ref_sync == 0) {
|
|
--remaining;
|
|
bharray[i].track_hp = NULL;
|
|
}
|
|
|
|
/*
|
|
* If the ref_sync count has gone to 0 and the buffer is still
|
|
* dirty, we write it. We only try to write the buffer once.
|
|
* Any process checkpointing or trickle-flushing the pool
|
|
* must be able to write any underlying file -- if the write
|
|
* fails, error out. It would be very strange if file sync
|
|
* failed to write, but we don't care if it happens.
|
|
*/
|
|
if (bhp->ref_sync == 0 && F_ISSET(bhp, BH_DIRTY)) {
|
|
hb_lock = 0;
|
|
MUTEX_UNLOCK(dbenv, mutexp);
|
|
|
|
mfp = R_ADDR(dbmp->reginfo, bhp->mf_offset);
|
|
if ((ret = __memp_bhwrite(dbmp, hp, mfp, bhp, 1)) == 0)
|
|
++wrote;
|
|
else if (op == DB_SYNC_CACHE || op == DB_SYNC_TRICKLE)
|
|
__db_err(dbenv, "%s: unable to flush page: %lu",
|
|
__memp_fns(dbmp, mfp), (u_long)bhp->pgno);
|
|
else
|
|
ret = 0;
|
|
}
|
|
|
|
/*
|
|
* If ref_sync count never went to 0, the buffer was written
|
|
* by another thread, or the write failed, we still have the
|
|
* buffer locked.
|
|
*
|
|
* We may or may not currently hold the hash bucket mutex. If
|
|
* the __memp_bhwrite -> __memp_pgwrite call was successful,
|
|
* then __memp_pgwrite will have swapped the buffer lock for
|
|
* the hash lock. All other call paths will leave us without
|
|
* the hash bucket lock.
|
|
*
|
|
* The order of mutexes above was to acquire the buffer lock
|
|
* while holding the hash bucket lock. Don't deadlock here,
|
|
* release the buffer lock and then acquire the hash bucket
|
|
* lock.
|
|
*/
|
|
if (F_ISSET(bhp, BH_LOCKED)) {
|
|
F_CLR(bhp, BH_LOCKED);
|
|
MUTEX_UNLOCK(dbenv, &bhp->mutex);
|
|
|
|
if (!hb_lock)
|
|
MUTEX_LOCK(dbenv, mutexp);
|
|
}
|
|
|
|
/*
|
|
* Reset the ref_sync count regardless of our success, we're
|
|
* done with this buffer for now.
|
|
*/
|
|
bhp->ref_sync = 0;
|
|
|
|
/* Discard our reference and unlock the bucket. */
|
|
--bhp->ref;
|
|
MUTEX_UNLOCK(dbenv, mutexp);
|
|
|
|
if (ret != 0)
|
|
break;
|
|
}
|
|
|
|
done: /* If we've opened files to flush pages, close them. */
|
|
if ((t_ret = __memp_close_flush_files(dbenv, dbmp)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/*
|
|
* If doing a checkpoint or flushing a file for the application, we
|
|
* have to force the pages to disk. We don't do this as we go along
|
|
* because we want to give the OS as much time as possible to lazily
|
|
* flush, and because we have to flush files that might not even have
|
|
* had dirty buffers in the cache, so we have to walk the files list.
|
|
*/
|
|
if (ret == 0 && (op == DB_SYNC_CACHE || op == DB_SYNC_FILE)) {
|
|
if (dbmfp == NULL)
|
|
ret = __memp_sync_files(dbenv, dbmp);
|
|
else
|
|
ret = __os_fsync(dbenv, dbmfp->fhp);
|
|
}
|
|
|
|
err: __os_free(dbenv, bharray);
|
|
if (wrotep != NULL)
|
|
*wrotep = wrote;
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __memp_sync_files --
|
|
* Sync all the files in the environment, open or not.
|
|
*/
|
|
static
|
|
int __memp_sync_files(dbenv, dbmp)
|
|
DB_ENV *dbenv;
|
|
DB_MPOOL *dbmp;
|
|
{
|
|
DB_MPOOLFILE *dbmfp;
|
|
MPOOL *mp;
|
|
MPOOLFILE *mfp;
|
|
int ret, t_ret;
|
|
|
|
ret = 0;
|
|
mp = dbmp->reginfo[0].primary;
|
|
|
|
R_LOCK(dbenv, dbmp->reginfo);
|
|
for (mfp = SH_TAILQ_FIRST(&mp->mpfq, __mpoolfile);
|
|
mfp != NULL; mfp = SH_TAILQ_NEXT(mfp, q, __mpoolfile)) {
|
|
if (mfp->stat.st_page_out == 0 ||
|
|
F_ISSET(mfp, MP_DEADFILE | MP_TEMP))
|
|
continue;
|
|
|
|
/* Look for an already open handle. */
|
|
ret = 0;
|
|
MUTEX_THREAD_LOCK(dbenv, dbmp->mutexp);
|
|
for (dbmfp = TAILQ_FIRST(&dbmp->dbmfq);
|
|
dbmfp != NULL; dbmfp = TAILQ_NEXT(dbmfp, q))
|
|
if (dbmfp->mfp == mfp) {
|
|
ret = __os_fsync(dbenv, dbmfp->fhp);
|
|
break;
|
|
}
|
|
MUTEX_THREAD_UNLOCK(dbenv, dbmp->mutexp);
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
/* If we don't find one, open one. */
|
|
if (dbmfp == NULL) {
|
|
if ((ret = dbenv->memp_fcreate(dbenv, &dbmfp, 0)) != 0)
|
|
goto err;
|
|
ret = __memp_fopen_int(
|
|
dbmfp, mfp, R_ADDR(dbmp->reginfo, mfp->path_off),
|
|
0, 0, mfp->stat.st_pagesize);
|
|
if (ret == 0)
|
|
ret = __os_fsync(dbenv, dbmfp->fhp);
|
|
if ((t_ret =
|
|
__memp_fclose_int(dbmfp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (ret != 0)
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
if (0) {
|
|
err: __db_err(dbenv, "%s: cannot sync: %s",
|
|
R_ADDR(dbmp->reginfo, mfp->path_off), db_strerror(ret));
|
|
}
|
|
R_UNLOCK(dbenv, dbmp->reginfo);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __memp_close_flush_files --
|
|
* Close files opened only to flush buffers.
|
|
*/
|
|
static int
|
|
__memp_close_flush_files(dbenv, dbmp)
|
|
DB_ENV *dbenv;
|
|
DB_MPOOL *dbmp;
|
|
{
|
|
DB_MPOOLFILE *dbmfp;
|
|
int ret;
|
|
|
|
/*
|
|
* The routine exists because we must close files opened by sync to
|
|
* flush buffers. There are two cases: first, extent files have to
|
|
* be closed so they may be removed when empty. Second, regular
|
|
* files have to be closed so we don't run out of descriptors (for
|
|
* example, and application partitioning its data into databases
|
|
* based on timestamps, so there's a continually increasing set of
|
|
* files).
|
|
*
|
|
* We mark files opened in the __memp_bhwrite() function with the
|
|
* MP_FLUSH flag. Here we walk through our file descriptor list,
|
|
* and, if a file was opened by __memp_bhwrite(), we close it.
|
|
*/
|
|
retry: MUTEX_THREAD_LOCK(dbenv, dbmp->mutexp);
|
|
for (dbmfp = TAILQ_FIRST(&dbmp->dbmfq);
|
|
dbmfp != NULL; dbmfp = TAILQ_NEXT(dbmfp, q))
|
|
if (F_ISSET(dbmfp, MP_FLUSH)) {
|
|
F_CLR(dbmfp, MP_FLUSH);
|
|
MUTEX_THREAD_UNLOCK(dbenv, dbmp->mutexp);
|
|
if ((ret = __memp_fclose_int(dbmfp, 0)) != 0)
|
|
return (ret);
|
|
goto retry;
|
|
}
|
|
MUTEX_THREAD_UNLOCK(dbenv, dbmp->mutexp);
|
|
|
|
return (0);
|
|
}
|
|
|
|
static int
|
|
__bhcmp(p1, p2)
|
|
const void *p1, *p2;
|
|
{
|
|
BH_TRACK *bhp1, *bhp2;
|
|
|
|
bhp1 = (BH_TRACK *)p1;
|
|
bhp2 = (BH_TRACK *)p2;
|
|
|
|
/* Sort by file (shared memory pool offset). */
|
|
if (bhp1->track_off < bhp2->track_off)
|
|
return (-1);
|
|
if (bhp1->track_off > bhp2->track_off)
|
|
return (1);
|
|
|
|
/*
|
|
* !!!
|
|
* Defend against badly written quicksort code calling the comparison
|
|
* function with two identical pointers (e.g., WATCOM C++ (Power++)).
|
|
*/
|
|
if (bhp1->track_pgno < bhp2->track_pgno)
|
|
return (-1);
|
|
if (bhp1->track_pgno > bhp2->track_pgno)
|
|
return (1);
|
|
return (0);
|
|
}
|