mirror of
https://github.com/MariaDB/server.git
synced 2025-01-17 04:22:27 +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
1308 lines
35 KiB
C
1308 lines
35 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996-2002
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993, 1994, 1995, 1996
|
|
* Keith Bostic. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993, 1994, 1995
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "db_config.h"
|
|
|
|
#ifndef lint
|
|
static const char revid[] = "$Id: db.c,v 11.246 2002/08/20 14:40:00 margo Exp $";
|
|
#endif /* not lint */
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "dbinc/db_page.h"
|
|
#include "dbinc/db_shash.h"
|
|
#include "dbinc/db_swap.h"
|
|
#include "dbinc/btree.h"
|
|
#include "dbinc/hash.h"
|
|
#include "dbinc/lock.h"
|
|
#include "dbinc/log.h"
|
|
#include "dbinc/log.h"
|
|
#include "dbinc/mp.h"
|
|
#include "dbinc/qam.h"
|
|
#include "dbinc/txn.h"
|
|
|
|
static int __db_disassociate __P((DB *));
|
|
#if CONFIG_TEST
|
|
static void __db_makecopy __P((const char *, const char *));
|
|
static int __db_testdocopy __P((DB_ENV *, const char *));
|
|
static int __qam_testdocopy __P((DB *, const char *));
|
|
#endif
|
|
|
|
/*
|
|
* DB.C --
|
|
* This file contains the utility functions for the DBP layer.
|
|
*/
|
|
|
|
/*
|
|
* __db_master_open --
|
|
* Open up a handle on a master database.
|
|
*
|
|
* PUBLIC: int __db_master_open __P((DB *,
|
|
* PUBLIC: DB_TXN *, const char *, u_int32_t, int, DB **));
|
|
*/
|
|
int
|
|
__db_master_open(subdbp, txn, name, flags, mode, dbpp)
|
|
DB *subdbp;
|
|
DB_TXN *txn;
|
|
const char *name;
|
|
u_int32_t flags;
|
|
int mode;
|
|
DB **dbpp;
|
|
{
|
|
DB *dbp;
|
|
int ret;
|
|
|
|
/* Open up a handle on the main database. */
|
|
if ((ret = db_create(&dbp, subdbp->dbenv, 0)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* It's always a btree.
|
|
* Run in the transaction we've created.
|
|
* Set the pagesize in case we're creating a new database.
|
|
* Flag that we're creating a database with subdatabases.
|
|
*/
|
|
dbp->type = DB_BTREE;
|
|
dbp->pgsize = subdbp->pgsize;
|
|
F_SET(dbp, DB_AM_SUBDB);
|
|
F_SET(dbp, F_ISSET(subdbp,
|
|
DB_AM_RECOVER | DB_AM_SWAP | DB_AM_ENCRYPT | DB_AM_CHKSUM));
|
|
|
|
/*
|
|
* If there was a subdb specified, then we only want to apply
|
|
* DB_EXCL to the subdb, not the actual file. We only got here
|
|
* because there was a subdb specified.
|
|
*/
|
|
LF_CLR(DB_EXCL);
|
|
LF_SET(DB_RDWRMASTER);
|
|
if ((ret = __db_dbopen(dbp, txn, name, NULL, flags, mode, PGNO_BASE_MD))
|
|
!= 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Verify that pagesize is the same on both.
|
|
* The items in dbp were now initialized from the meta
|
|
* page. The items in dbp were set in __db_dbopen
|
|
* when we either read or created the master file.
|
|
* Other items such as checksum and encryption are
|
|
* checked when we read the meta-page. So we do not
|
|
* check those here. However, if the meta-page caused
|
|
* chksumming to be turned on and it wasn't already, set
|
|
* it here.
|
|
*/
|
|
if (F_ISSET(dbp, DB_AM_CHKSUM))
|
|
F_SET(subdbp, DB_AM_CHKSUM);
|
|
if (subdbp->pgsize != 0 && dbp->pgsize != subdbp->pgsize) {
|
|
ret = EINVAL;
|
|
__db_err(dbp->dbenv,
|
|
"Different pagesize specified on existent file");
|
|
goto err;
|
|
}
|
|
err:
|
|
if (ret != 0 && !F_ISSET(dbp, DB_AM_DISCARD))
|
|
__db_close_i(dbp, txn, 0);
|
|
else
|
|
*dbpp = dbp;
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __db_master_update --
|
|
* Add/Open/Remove a subdatabase from a master database.
|
|
*
|
|
* PUBLIC: int __db_master_update __P((DB *, DB *, DB_TXN *, const char *,
|
|
* PUBLIC: DBTYPE, mu_action, const char *, u_int32_t));
|
|
*/
|
|
int
|
|
__db_master_update(mdbp, sdbp, txn, subdb, type, action, newname, flags)
|
|
DB *mdbp, *sdbp;
|
|
DB_TXN *txn;
|
|
const char *subdb;
|
|
DBTYPE type;
|
|
mu_action action;
|
|
const char *newname;
|
|
u_int32_t flags;
|
|
{
|
|
DB_ENV *dbenv;
|
|
DBC *dbc, *ndbc;
|
|
DBT key, data, ndata;
|
|
PAGE *p;
|
|
db_pgno_t t_pgno;
|
|
int modify, ret, t_ret;
|
|
|
|
dbenv = mdbp->dbenv;
|
|
dbc = ndbc = NULL;
|
|
p = NULL;
|
|
|
|
memset(&key, 0, sizeof(key));
|
|
memset(&data, 0, sizeof(data));
|
|
|
|
/* Might we modify the master database? If so, we'll need to lock. */
|
|
modify = (action != MU_OPEN || LF_ISSET(DB_CREATE)) ? 1 : 0;
|
|
|
|
/*
|
|
* Open up a cursor. If this is CDB and we're creating the database,
|
|
* make it an update cursor.
|
|
*/
|
|
if ((ret = mdbp->cursor(mdbp, txn, &dbc,
|
|
(CDB_LOCKING(dbenv) && modify) ? DB_WRITECURSOR : 0)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Point the cursor at the record.
|
|
*
|
|
* If we're removing or potentially creating an entry, lock the page
|
|
* with DB_RMW.
|
|
*
|
|
* We do multiple cursor operations with the cursor in some cases and
|
|
* subsequently access the data DBT information. Set DB_DBT_MALLOC so
|
|
* we don't risk modification of the data between our uses of it.
|
|
*
|
|
* !!!
|
|
* We don't include the name's nul termination in the database.
|
|
*/
|
|
key.data = (void *)subdb;
|
|
key.size = (u_int32_t)strlen(subdb);
|
|
F_SET(&data, DB_DBT_MALLOC);
|
|
|
|
ret = dbc->c_get(dbc, &key, &data,
|
|
DB_SET | ((STD_LOCKING(dbc) && modify) ? DB_RMW : 0));
|
|
|
|
/*
|
|
* What we do next--whether or not we found a record for the
|
|
* specified subdatabase--depends on what the specified action is.
|
|
* Handle ret appropriately as the first statement of each case.
|
|
*/
|
|
switch (action) {
|
|
case MU_REMOVE:
|
|
/*
|
|
* We should have found something if we're removing it. Note
|
|
* that in the common case where the DB we're asking to remove
|
|
* doesn't exist, we won't get this far; __db_subdb_remove
|
|
* will already have returned an error from __db_open.
|
|
*/
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Delete the subdatabase entry first; if this fails,
|
|
* we don't want to touch the actual subdb pages.
|
|
*/
|
|
if ((ret = dbc->c_del(dbc, 0)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* We're handling actual data, not on-page meta-data,
|
|
* so it hasn't been converted to/from opposite
|
|
* endian architectures. Do it explicitly, now.
|
|
*/
|
|
memcpy(&sdbp->meta_pgno, data.data, sizeof(db_pgno_t));
|
|
DB_NTOHL(&sdbp->meta_pgno);
|
|
if ((ret =
|
|
mdbp->mpf->get(mdbp->mpf, &sdbp->meta_pgno, 0, &p)) != 0)
|
|
goto err;
|
|
|
|
/* Free and put the page. */
|
|
if ((ret = __db_free(dbc, p)) != 0) {
|
|
p = NULL;
|
|
goto err;
|
|
}
|
|
p = NULL;
|
|
break;
|
|
case MU_RENAME:
|
|
/* We should have found something if we're renaming it. */
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Before we rename, we need to make sure we're not
|
|
* overwriting another subdatabase, or else this operation
|
|
* won't be undoable. Open a second cursor and check
|
|
* for the existence of newname; it shouldn't appear under
|
|
* us since we hold the metadata lock.
|
|
*/
|
|
if ((ret = mdbp->cursor(mdbp, txn, &ndbc, 0)) != 0)
|
|
goto err;
|
|
DB_ASSERT(newname != NULL);
|
|
key.data = (void *)newname;
|
|
key.size = (u_int32_t)strlen(newname);
|
|
|
|
/*
|
|
* We don't actually care what the meta page of the potentially-
|
|
* overwritten DB is; we just care about existence.
|
|
*/
|
|
memset(&ndata, 0, sizeof(ndata));
|
|
F_SET(&ndata, DB_DBT_USERMEM | DB_DBT_PARTIAL);
|
|
|
|
if ((ret = ndbc->c_get(ndbc, &key, &ndata, DB_SET)) == 0) {
|
|
/* A subdb called newname exists. Bail. */
|
|
ret = EEXIST;
|
|
__db_err(dbenv, "rename: database %s exists", newname);
|
|
goto err;
|
|
} else if (ret != DB_NOTFOUND)
|
|
goto err;
|
|
|
|
/*
|
|
* Now do the put first; we don't want to lose our
|
|
* sole reference to the subdb. Use the second cursor
|
|
* so that the first one continues to point to the old record.
|
|
*/
|
|
if ((ret = ndbc->c_put(ndbc, &key, &data, DB_KEYFIRST)) != 0)
|
|
goto err;
|
|
if ((ret = dbc->c_del(dbc, 0)) != 0) {
|
|
/*
|
|
* If the delete fails, try to delete the record
|
|
* we just put, in case we're not txn-protected.
|
|
*/
|
|
(void)ndbc->c_del(ndbc, 0);
|
|
goto err;
|
|
}
|
|
|
|
break;
|
|
case MU_OPEN:
|
|
/*
|
|
* Get the subdatabase information. If it already exists,
|
|
* copy out the page number and we're done.
|
|
*/
|
|
switch (ret) {
|
|
case 0:
|
|
if (LF_ISSET(DB_CREATE) && LF_ISSET(DB_EXCL)) {
|
|
ret = EEXIST;
|
|
goto err;
|
|
}
|
|
memcpy(&sdbp->meta_pgno, data.data, sizeof(db_pgno_t));
|
|
DB_NTOHL(&sdbp->meta_pgno);
|
|
goto done;
|
|
case DB_NOTFOUND:
|
|
if (LF_ISSET(DB_CREATE))
|
|
break;
|
|
/*
|
|
* No db_err, it is reasonable to remove a
|
|
* nonexistent db.
|
|
*/
|
|
ret = ENOENT;
|
|
goto err;
|
|
default:
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
* We need to check against the master lorder here because
|
|
* we only want to check this if we are creating. In the
|
|
* case where we don't create we just want to inherit.
|
|
*/
|
|
if (F_ISSET(mdbp, DB_AM_SWAP) != F_ISSET(sdbp, DB_AM_SWAP)) {
|
|
ret = EINVAL;
|
|
__db_err(mdbp->dbenv,
|
|
"Different lorder specified on existent file");
|
|
goto err;
|
|
}
|
|
/* Create a subdatabase. */
|
|
if ((ret = __db_new(dbc,
|
|
type == DB_HASH ? P_HASHMETA : P_BTREEMETA, &p)) != 0)
|
|
goto err;
|
|
sdbp->meta_pgno = PGNO(p);
|
|
|
|
/*
|
|
* XXX
|
|
* We're handling actual data, not on-page meta-data, so it
|
|
* hasn't been converted to/from opposite endian architectures.
|
|
* Do it explicitly, now.
|
|
*/
|
|
t_pgno = PGNO(p);
|
|
DB_HTONL(&t_pgno);
|
|
memset(&ndata, 0, sizeof(ndata));
|
|
ndata.data = &t_pgno;
|
|
ndata.size = sizeof(db_pgno_t);
|
|
if ((ret = dbc->c_put(dbc, &key, &ndata, DB_KEYLAST)) != 0)
|
|
goto err;
|
|
F_SET(sdbp, DB_AM_CREATED);
|
|
break;
|
|
}
|
|
|
|
err:
|
|
done: /*
|
|
* If we allocated a page: if we're successful, mark the page dirty
|
|
* and return it to the cache, otherwise, discard/free it.
|
|
*/
|
|
if (p != NULL) {
|
|
if (ret == 0) {
|
|
if ((t_ret =
|
|
mdbp->mpf->put(mdbp->mpf, p, DB_MPOOL_DIRTY)) != 0)
|
|
ret = t_ret;
|
|
/*
|
|
* Since we cannot close this file until after
|
|
* transaction commit, we need to sync the dirty
|
|
* pages, because we'll read these directly from
|
|
* disk to open.
|
|
*/
|
|
if ((t_ret = mdbp->sync(mdbp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
} else
|
|
(void)mdbp->mpf->put(mdbp->mpf, p, 0);
|
|
}
|
|
|
|
/* Discard the cursor(s) and data. */
|
|
if (data.data != NULL)
|
|
__os_ufree(dbenv, data.data);
|
|
if (dbc != NULL && (t_ret = dbc->c_close(dbc)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (ndbc != NULL && (t_ret = ndbc->c_close(ndbc)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __db_dbenv_setup --
|
|
* Set up the underlying environment during a db_open.
|
|
*
|
|
* PUBLIC: int __db_dbenv_setup __P((DB *,
|
|
* PUBLIC: DB_TXN *, const char *, u_int32_t, u_int32_t));
|
|
*/
|
|
int
|
|
__db_dbenv_setup(dbp, txn, name, id, flags)
|
|
DB *dbp;
|
|
DB_TXN *txn;
|
|
const char *name;
|
|
u_int32_t id;
|
|
u_int32_t flags;
|
|
{
|
|
DB *ldbp;
|
|
DBT pgcookie;
|
|
DB_ENV *dbenv;
|
|
DB_MPOOL *dbmp;
|
|
DB_MPOOLFILE *mpf;
|
|
DB_PGINFO pginfo;
|
|
u_int32_t maxid;
|
|
int ftype, ret;
|
|
|
|
dbenv = dbp->dbenv;
|
|
|
|
/* If we don't yet have an environment, it's time to create it. */
|
|
if (!F_ISSET(dbenv, DB_ENV_OPEN_CALLED)) {
|
|
/* Make sure we have at least DB_MINCACHE pages in our cache. */
|
|
if (dbenv->mp_gbytes == 0 &&
|
|
dbenv->mp_bytes < dbp->pgsize * DB_MINPAGECACHE &&
|
|
(ret = dbenv->set_cachesize(
|
|
dbenv, 0, dbp->pgsize * DB_MINPAGECACHE, 0)) != 0)
|
|
return (ret);
|
|
|
|
if ((ret = dbenv->open(dbenv, NULL, DB_CREATE |
|
|
DB_INIT_MPOOL | DB_PRIVATE | LF_ISSET(DB_THREAD), 0)) != 0)
|
|
return (ret);
|
|
}
|
|
|
|
/* Register DB's pgin/pgout functions. */
|
|
if ((ret = dbenv->memp_register(
|
|
dbenv, DB_FTYPE_SET, __db_pgin, __db_pgout)) != 0)
|
|
return (ret);
|
|
|
|
/* Create the DB_MPOOLFILE structure. */
|
|
if ((ret = dbenv->memp_fcreate(dbenv, &dbp->mpf, 0)) != 0)
|
|
return (ret);
|
|
mpf = dbp->mpf;
|
|
|
|
/* Set the database's cache priority if we've been given one. */
|
|
if (dbp->priority != 0 &&
|
|
(ret = mpf->set_priority(mpf, dbp->priority)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* Open a backing file in the memory pool.
|
|
*
|
|
* If we need to pre- or post-process a file's pages on I/O, set the
|
|
* file type. If it's a hash file, always call the pgin and pgout
|
|
* routines. This means that hash files can never be mapped into
|
|
* process memory. If it's a btree file and requires swapping, we
|
|
* need to page the file in and out. This has to be right -- we can't
|
|
* mmap files that are being paged in and out.
|
|
*/
|
|
switch (dbp->type) {
|
|
case DB_BTREE:
|
|
case DB_RECNO:
|
|
ftype = F_ISSET(dbp, DB_AM_SWAP | DB_AM_ENCRYPT | DB_AM_CHKSUM)
|
|
? DB_FTYPE_SET : DB_FTYPE_NOTSET;
|
|
(void)mpf->set_ftype(mpf, ftype);
|
|
(void)mpf->set_clear_len(mpf, (CRYPTO_ON(dbenv) ?
|
|
dbp->pgsize : DB_PAGE_DB_LEN));
|
|
break;
|
|
case DB_HASH:
|
|
(void)mpf->set_ftype(mpf, DB_FTYPE_SET);
|
|
(void)mpf->set_clear_len(mpf, (CRYPTO_ON(dbenv) ?
|
|
dbp->pgsize : DB_PAGE_DB_LEN));
|
|
break;
|
|
case DB_QUEUE:
|
|
ftype = F_ISSET(dbp, DB_AM_SWAP | DB_AM_ENCRYPT | DB_AM_CHKSUM)
|
|
? DB_FTYPE_SET : DB_FTYPE_NOTSET;
|
|
(void)mpf->set_ftype(mpf, ftype);
|
|
(void)mpf->set_clear_len(mpf, (CRYPTO_ON(dbenv) ?
|
|
dbp->pgsize : DB_PAGE_QUEUE_LEN));
|
|
break;
|
|
case DB_UNKNOWN:
|
|
/*
|
|
* If we're running in the verifier, our database might
|
|
* be corrupt and we might not know its type--but we may
|
|
* still want to be able to verify and salvage.
|
|
*
|
|
* If we can't identify the type, it's not going to be safe
|
|
* to call __db_pgin--we pretty much have to give up all
|
|
* hope of salvaging cross-endianness. Proceed anyway;
|
|
* at worst, the database will just appear more corrupt
|
|
* than it actually is, but at best, we may be able
|
|
* to salvage some data even with no metadata page.
|
|
*/
|
|
if (F_ISSET(dbp, DB_AM_VERIFYING)) {
|
|
(void)mpf->set_ftype(mpf, DB_FTYPE_NOTSET);
|
|
(void)mpf->set_clear_len(mpf, DB_PAGE_DB_LEN);
|
|
break;
|
|
}
|
|
/* FALLTHROUGH */
|
|
default:
|
|
return (
|
|
__db_unknown_type(dbenv, "__db_dbenv_setup", dbp->type));
|
|
}
|
|
|
|
(void)mpf->set_fileid(mpf, dbp->fileid);
|
|
(void)mpf->set_lsn_offset(mpf, 0);
|
|
|
|
pginfo.db_pagesize = dbp->pgsize;
|
|
pginfo.flags =
|
|
F_ISSET(dbp, (DB_AM_CHKSUM | DB_AM_ENCRYPT | DB_AM_SWAP));
|
|
pginfo.type = dbp->type;
|
|
pgcookie.data = &pginfo;
|
|
pgcookie.size = sizeof(DB_PGINFO);
|
|
(void)mpf->set_pgcookie(mpf, &pgcookie);
|
|
|
|
if ((ret = mpf->open(mpf, name,
|
|
LF_ISSET(DB_RDONLY | DB_NOMMAP | DB_ODDFILESIZE | DB_TRUNCATE) |
|
|
(F_ISSET(dbenv, DB_ENV_DIRECT_DB) ? DB_DIRECT : 0),
|
|
0, dbp->pgsize)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* We may need a per-thread mutex. Allocate it from the mpool
|
|
* region, there's supposed to be extra space there for that purpose.
|
|
*/
|
|
if (LF_ISSET(DB_THREAD)) {
|
|
dbmp = dbenv->mp_handle;
|
|
if ((ret = __db_mutex_setup(dbenv, dbmp->reginfo, &dbp->mutexp,
|
|
MUTEX_ALLOC | MUTEX_THREAD)) != 0)
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* Set up a bookkeeping entry for this database in the log region,
|
|
* if such a region exists. Note that even if we're in recovery
|
|
* or a replication client, where we won't log registries, we'll
|
|
* still need an FNAME struct, so LOGGING_ON is the correct macro.
|
|
*/
|
|
if (LOGGING_ON(dbenv) &&
|
|
(ret = __dbreg_setup(dbp, name, id)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* If we're actively logging and our caller isn't a recovery function
|
|
* that already did so, assign this dbp a log fileid.
|
|
*/
|
|
if (DBENV_LOGGING(dbenv) && !F_ISSET(dbp, DB_AM_RECOVER) &&
|
|
#if !defined(DEBUG_ROP)
|
|
!F_ISSET(dbp, DB_AM_RDONLY) &&
|
|
#endif
|
|
(ret = __dbreg_new_id(dbp, txn)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* Insert ourselves into the DB_ENV's dblist. We allocate a
|
|
* unique ID to each {fileid, meta page number} pair, and to
|
|
* each temporary file (since they all have a zero fileid).
|
|
* This ID gives us something to use to tell which DB handles
|
|
* go with which databases in all the cursor adjustment
|
|
* routines, where we don't want to do a lot of ugly and
|
|
* expensive memcmps.
|
|
*/
|
|
MUTEX_THREAD_LOCK(dbenv, dbenv->dblist_mutexp);
|
|
for (maxid = 0, ldbp = LIST_FIRST(&dbenv->dblist);
|
|
ldbp != NULL; ldbp = LIST_NEXT(dbp, dblistlinks)) {
|
|
if (name != NULL &&
|
|
memcmp(ldbp->fileid, dbp->fileid, DB_FILE_ID_LEN) == 0 &&
|
|
ldbp->meta_pgno == dbp->meta_pgno)
|
|
break;
|
|
if (ldbp->adj_fileid > maxid)
|
|
maxid = ldbp->adj_fileid;
|
|
}
|
|
|
|
/*
|
|
* If ldbp is NULL, we didn't find a match, or we weren't
|
|
* really looking because name is NULL. Assign the dbp an
|
|
* adj_fileid one higher than the largest we found, and
|
|
* insert it at the head of the master dbp list.
|
|
*
|
|
* If ldbp is not NULL, it is a match for our dbp. Give dbp
|
|
* the same ID that ldbp has, and add it after ldbp so they're
|
|
* together in the list.
|
|
*/
|
|
if (ldbp == NULL) {
|
|
dbp->adj_fileid = maxid + 1;
|
|
LIST_INSERT_HEAD(&dbenv->dblist, dbp, dblistlinks);
|
|
} else {
|
|
dbp->adj_fileid = ldbp->adj_fileid;
|
|
LIST_INSERT_AFTER(ldbp, dbp, dblistlinks);
|
|
}
|
|
MUTEX_THREAD_UNLOCK(dbenv, dbenv->dblist_mutexp);
|
|
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __db_close --
|
|
* DB destructor.
|
|
*
|
|
* PUBLIC: int __db_close __P((DB *, u_int32_t));
|
|
*/
|
|
int
|
|
__db_close(dbp, flags)
|
|
DB *dbp;
|
|
u_int32_t flags;
|
|
{
|
|
DB_ENV *dbenv;
|
|
|
|
dbenv = dbp->dbenv;
|
|
|
|
PANIC_CHECK(dbenv);
|
|
|
|
/* Validate arguments, but as a DB handle destructor, we can't fail. */
|
|
if (flags != 0 && flags != DB_NOSYNC)
|
|
(void)__db_ferr(dbenv, "DB->close", 0);
|
|
|
|
return (__db_close_i(dbp, NULL, flags));
|
|
}
|
|
|
|
/*
|
|
* __db_close_i --
|
|
* Internal DB destructor.
|
|
*
|
|
* PUBLIC: int __db_close_i __P((DB *, DB_TXN *, u_int32_t));
|
|
*/
|
|
int
|
|
__db_close_i(dbp, txn, flags)
|
|
DB *dbp;
|
|
DB_TXN *txn;
|
|
u_int32_t flags;
|
|
{
|
|
DB_ENV *dbenv;
|
|
int ret, t_ret;
|
|
|
|
dbenv = dbp->dbenv;
|
|
ret = 0;
|
|
|
|
/*
|
|
* Validate arguments, but as a DB handle destructor, we can't fail.
|
|
*
|
|
* Check for consistent transaction usage -- ignore errors. Only
|
|
* internal callers specify transactions, so it's a serious problem
|
|
* if we get error messages.
|
|
*/
|
|
if (txn != NULL)
|
|
(void)__db_check_txn(dbp, txn, DB_LOCK_INVALIDID, 0);
|
|
|
|
/* Refresh the structure and close any local environment. */
|
|
if ((t_ret = __db_refresh(dbp, txn, flags)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/*
|
|
* Call the access specific close function.
|
|
*
|
|
* !!!
|
|
* Because of where these functions are called in the DB handle close
|
|
* process, these routines can't do anything that would dirty pages or
|
|
* otherwise affect closing down the database. Specifically, we can't
|
|
* abort and recover any of the information they control.
|
|
*/
|
|
if ((t_ret = __ham_db_close(dbp)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __bam_db_close(dbp)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __qam_db_close(dbp)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
--dbenv->db_ref;
|
|
if (F_ISSET(dbenv, DB_ENV_DBLOCAL) && dbenv->db_ref == 0 &&
|
|
(t_ret = dbenv->close(dbenv, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/* Free the database handle. */
|
|
memset(dbp, CLEAR_BYTE, sizeof(*dbp));
|
|
__os_free(dbenv, dbp);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __db_refresh --
|
|
* Refresh the DB structure, releasing any allocated resources.
|
|
* This does most of the work of closing files now because refresh
|
|
* is what is used during abort processing (since we can't destroy
|
|
* the actual handle) and during abort processing, we may have a
|
|
* fully opened handle.
|
|
*
|
|
* PUBLIC: int __db_refresh __P((DB *, DB_TXN *, u_int32_t));
|
|
*/
|
|
int
|
|
__db_refresh(dbp, txn, flags)
|
|
DB *dbp;
|
|
DB_TXN *txn;
|
|
u_int32_t flags;
|
|
{
|
|
DB *sdbp;
|
|
DBC *dbc;
|
|
DB_ENV *dbenv;
|
|
DB_LOCKREQ lreq;
|
|
DB_MPOOL *dbmp;
|
|
int ret, t_ret;
|
|
|
|
ret = 0;
|
|
|
|
dbenv = dbp->dbenv;
|
|
|
|
/* If never opened, or not currently open, it's easy. */
|
|
if (!F_ISSET(dbp, DB_AM_OPEN_CALLED))
|
|
goto never_opened;
|
|
|
|
/*
|
|
* If we have any secondary indices, disassociate them from us.
|
|
* We don't bother with the mutex here; it only protects some
|
|
* of the ops that will make us core-dump mid-close anyway, and
|
|
* if you're trying to do something with a secondary *while* you're
|
|
* closing the primary, you deserve what you get. The disassociation
|
|
* is mostly done just so we can close primaries and secondaries in
|
|
* any order--but within one thread of control.
|
|
*/
|
|
for (sdbp = LIST_FIRST(&dbp->s_secondaries);
|
|
sdbp != NULL; sdbp = LIST_NEXT(sdbp, s_links)) {
|
|
LIST_REMOVE(sdbp, s_links);
|
|
if ((t_ret = __db_disassociate(sdbp)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
}
|
|
|
|
/*
|
|
* Sync the underlying access method. Do before closing the cursors
|
|
* because DB->sync allocates cursors in order to write Recno backing
|
|
* source text files.
|
|
*/
|
|
if (!LF_ISSET(DB_NOSYNC) && !F_ISSET(dbp, DB_AM_DISCARD) &&
|
|
(t_ret = dbp->sync(dbp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/*
|
|
* Go through the active cursors and call the cursor recycle routine,
|
|
* which resolves pending operations and moves the cursors onto the
|
|
* free list. Then, walk the free list and call the cursor destroy
|
|
* routine. Note that any failure on a close is considered "really
|
|
* bad" and we just break out of the loop and force forward.
|
|
*/
|
|
while ((dbc = TAILQ_FIRST(&dbp->active_queue)) != NULL)
|
|
if ((t_ret = dbc->c_close(dbc)) != 0) {
|
|
if (ret == 0)
|
|
ret = t_ret;
|
|
break;
|
|
}
|
|
|
|
while ((dbc = TAILQ_FIRST(&dbp->free_queue)) != NULL)
|
|
if ((t_ret = __db_c_destroy(dbc)) != 0) {
|
|
if (ret == 0)
|
|
ret = t_ret;
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* Close any outstanding join cursors. Join cursors destroy
|
|
* themselves on close and have no separate destroy routine.
|
|
*/
|
|
while ((dbc = TAILQ_FIRST(&dbp->join_queue)) != NULL)
|
|
if ((t_ret = dbc->c_close(dbc)) != 0) {
|
|
if (ret == 0)
|
|
ret = t_ret;
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* Sync the memory pool, even though we've already called DB->sync,
|
|
* because closing cursors can dirty pages by deleting items they
|
|
* referenced.
|
|
*/
|
|
if (!LF_ISSET(DB_NOSYNC) && !F_ISSET(dbp, DB_AM_DISCARD) &&
|
|
(t_ret = dbp->mpf->sync(dbp->mpf)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/* Close any handle we've been holding since the open. */
|
|
if (dbp->saved_open_fhp != NULL &&
|
|
F_ISSET(dbp->saved_open_fhp, DB_FH_VALID) &&
|
|
(t_ret = __os_closehandle(dbenv, dbp->saved_open_fhp)) != 0 &&
|
|
ret == 0)
|
|
ret = t_ret;
|
|
|
|
never_opened:
|
|
/*
|
|
* We are not releasing the handle lock here because we're about
|
|
* to release all locks held by dbp->lid below. There are two
|
|
* ways that we can get in here with a handle_lock, but not a
|
|
* dbp->lid. The first is when our lid has been hijacked by a
|
|
* subdb. The second is when we are a Queue database in the midst
|
|
* of a rename. If the queue file hasn't actually been opened, we
|
|
* hijack the main dbp's locker id to do the open so we can get the
|
|
* extent files. In both cases, we needn't free the handle lock
|
|
* because it will be freed when the hijacked locker-id is freed.
|
|
*/
|
|
DB_ASSERT(!LOCK_ISSET(dbp->handle_lock) ||
|
|
dbp->lid != DB_LOCK_INVALIDID ||
|
|
dbp->type == DB_QUEUE ||
|
|
F_ISSET(dbp, DB_AM_SUBDB));
|
|
|
|
if (dbp->lid != DB_LOCK_INVALIDID) {
|
|
/* We may have pending trade operations on this dbp. */
|
|
if (txn != NULL)
|
|
__txn_remlock(dbenv, txn, &dbp->handle_lock, dbp->lid);
|
|
|
|
/* We may be holding the handle lock; release it. */
|
|
lreq.op = DB_LOCK_PUT_ALL;
|
|
if ((t_ret = __lock_vec(dbenv,
|
|
dbp->lid, 0, &lreq, 1, NULL)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
if ((t_ret =
|
|
dbenv->lock_id_free(dbenv, dbp->lid)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
dbp->lid = DB_LOCK_INVALIDID;
|
|
LOCK_INIT(dbp->handle_lock);
|
|
}
|
|
|
|
/* Discard the locker ID allocated as the fileid. */
|
|
if (F_ISSET(dbp, DB_AM_INMEM) &&
|
|
LOCKING_ON(dbenv) && (t_ret = dbenv->lock_id_free(
|
|
dbenv, *(u_int32_t *)dbp->fileid)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
dbp->type = DB_UNKNOWN;
|
|
|
|
/* Discard the thread mutex. */
|
|
if (dbp->mutexp != NULL) {
|
|
dbmp = dbenv->mp_handle;
|
|
__db_mutex_free(dbenv, dbmp->reginfo, dbp->mutexp);
|
|
dbp->mutexp = NULL;
|
|
}
|
|
|
|
/* Discard any memory used to store returned data. */
|
|
if (dbp->my_rskey.data != NULL)
|
|
__os_free(dbp->dbenv, dbp->my_rskey.data);
|
|
if (dbp->my_rkey.data != NULL)
|
|
__os_free(dbp->dbenv, dbp->my_rkey.data);
|
|
if (dbp->my_rdata.data != NULL)
|
|
__os_free(dbp->dbenv, dbp->my_rdata.data);
|
|
|
|
/* For safety's sake; we may refresh twice. */
|
|
memset(&dbp->my_rskey, 0, sizeof(DBT));
|
|
memset(&dbp->my_rkey, 0, sizeof(DBT));
|
|
memset(&dbp->my_rdata, 0, sizeof(DBT));
|
|
|
|
/*
|
|
* Remove this DB handle from the DB_ENV's dblist, if it's been added.
|
|
*/
|
|
MUTEX_THREAD_LOCK(dbenv, dbenv->dblist_mutexp);
|
|
if (dbp->dblistlinks.le_prev != NULL)
|
|
LIST_REMOVE(dbp, dblistlinks);
|
|
MUTEX_THREAD_UNLOCK(dbenv, dbenv->dblist_mutexp);
|
|
dbp->dblistlinks.le_prev = NULL;
|
|
|
|
/* Close the memory pool file handle. */
|
|
if (dbp->mpf != NULL) {
|
|
if ((t_ret = dbp->mpf->close(dbp->mpf,
|
|
F_ISSET(dbp, DB_AM_DISCARD) ? DB_MPOOL_DISCARD : 0)) != 0 &&
|
|
ret == 0)
|
|
ret = t_ret;
|
|
dbp->mpf = NULL;
|
|
}
|
|
|
|
if (LOGGING_ON(dbp->dbenv)) {
|
|
/*
|
|
* Discard the log file id, if any. We want to log the close
|
|
* if and only if this is not a recovery dbp.
|
|
*/
|
|
if (F_ISSET(dbp, DB_AM_RECOVER))
|
|
(void)__dbreg_revoke_id(dbp, 0);
|
|
else
|
|
(void)__dbreg_close_id(dbp, txn);
|
|
|
|
/* Discard the log FNAME. */
|
|
(void)__dbreg_teardown(dbp);
|
|
}
|
|
|
|
/* Clear out fields that normally get set during open. */
|
|
memset(dbp->fileid, 0, sizeof(dbp->fileid));
|
|
dbp->adj_fileid = 0;
|
|
dbp->meta_pgno = 0;
|
|
dbp->cur_lid = DB_LOCK_INVALIDID;
|
|
dbp->associate_lid = DB_LOCK_INVALIDID;
|
|
dbp->cl_id = 0;
|
|
|
|
/*
|
|
* If we are being refreshed with a txn specified, then we need
|
|
* to make sure that we clear out the lock handle field, because
|
|
* releasing all the locks for this transaction will release this
|
|
* lock and we don't want close to stumble upon this handle and
|
|
* try to close it.
|
|
*/
|
|
if (txn != NULL)
|
|
LOCK_INIT(dbp->handle_lock);
|
|
|
|
F_CLR(dbp, DB_AM_DBM_ERROR);
|
|
F_CLR(dbp, DB_AM_DISCARD);
|
|
F_CLR(dbp, DB_AM_INMEM);
|
|
F_CLR(dbp, DB_AM_RECOVER);
|
|
F_CLR(dbp, DB_AM_OPEN_CALLED);
|
|
F_CLR(dbp, DB_AM_RDONLY);
|
|
F_CLR(dbp, DB_AM_SWAP);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __db_log_page
|
|
* Log a meta-data or root page during a subdatabase create operation.
|
|
*
|
|
* PUBLIC: int __db_log_page __P((DB *, DB_TXN *, DB_LSN *, db_pgno_t, PAGE *));
|
|
*/
|
|
int
|
|
__db_log_page(dbp, txn, lsn, pgno, page)
|
|
DB *dbp;
|
|
DB_TXN *txn;
|
|
DB_LSN *lsn;
|
|
db_pgno_t pgno;
|
|
PAGE *page;
|
|
{
|
|
DBT page_dbt;
|
|
DB_LSN new_lsn;
|
|
int ret;
|
|
|
|
if (!LOGGING_ON(dbp->dbenv) || txn == NULL)
|
|
return (0);
|
|
|
|
memset(&page_dbt, 0, sizeof(page_dbt));
|
|
page_dbt.size = dbp->pgsize;
|
|
page_dbt.data = page;
|
|
|
|
ret = __crdel_metasub_log(dbp, txn, &new_lsn, 0, pgno, &page_dbt, lsn);
|
|
|
|
if (ret == 0)
|
|
page->lsn = new_lsn;
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __db_backup_name
|
|
* Create the backup file name for a given file.
|
|
*
|
|
* PUBLIC: int __db_backup_name __P((DB_ENV *,
|
|
* PUBLIC: const char *, DB_TXN *, char **));
|
|
*/
|
|
#undef BACKUP_PREFIX
|
|
#define BACKUP_PREFIX "__db."
|
|
|
|
#undef MAX_LSN_TO_TEXT
|
|
#define MAX_LSN_TO_TEXT 17
|
|
|
|
int
|
|
__db_backup_name(dbenv, name, txn, backup)
|
|
DB_ENV *dbenv;
|
|
const char *name;
|
|
DB_TXN *txn;
|
|
char **backup;
|
|
{
|
|
DB_LSN lsn;
|
|
size_t len;
|
|
int plen, ret;
|
|
char *p, *retp;
|
|
|
|
/*
|
|
* Create the name. Backup file names are in one of two forms:
|
|
*
|
|
* In a transactional env: __db.LSN(8).LSN(8)
|
|
* and
|
|
* in a non-transactional env: __db.FILENAME.
|
|
*
|
|
* If the transaction doesn't have a current LSN, we write
|
|
* a dummy log record to force it, so that we ensure that
|
|
* all tmp names are unique.
|
|
*
|
|
* In addition, the name passed may contain an env-relative path.
|
|
* In that case, put the __db. in the right place (in the last
|
|
* component of the pathname).
|
|
*/
|
|
if (txn != NULL) {
|
|
if (IS_ZERO_LSN(txn->last_lsn)) {
|
|
/*
|
|
* Write dummy log record. The two choices for
|
|
* dummy log records are __db_noop_log and
|
|
* __db_debug_log; unfortunately __db_noop_log requires
|
|
* a valid dbp, and we aren't guaranteed to be able
|
|
* to pass one in here.
|
|
*/
|
|
if ((ret = __db_debug_log(dbenv, txn, &lsn, 0,
|
|
NULL, 0, NULL, NULL, 0)) != 0)
|
|
return (ret);
|
|
} else
|
|
lsn = txn->last_lsn;
|
|
}
|
|
|
|
/*
|
|
* Part of the name may be a full path, so we need to make sure that
|
|
* we allocate enough space for it, even in the case where we don't
|
|
* use the entire filename for the backup name.
|
|
*/
|
|
len = strlen(name) + strlen(BACKUP_PREFIX) + MAX_LSN_TO_TEXT;
|
|
|
|
if ((ret = __os_malloc(dbenv, len, &retp)) != 0)
|
|
return (ret);
|
|
|
|
/*
|
|
* There are four cases here:
|
|
* 1. simple path w/out transaction
|
|
* 2. simple path + transaction
|
|
* 3. multi-component path w/out transaction
|
|
* 4. multi-component path + transaction
|
|
*/
|
|
if ((p = __db_rpath(name)) == NULL) {
|
|
if (txn == NULL) /* case 1 */
|
|
snprintf(retp, len, "%s%s.", BACKUP_PREFIX, name);
|
|
else /* case 2 */
|
|
snprintf(retp, len,
|
|
"%s%x.%x", BACKUP_PREFIX, lsn.file, lsn.offset);
|
|
} else {
|
|
plen = (int)(p - name) + 1;
|
|
p++;
|
|
if (txn == NULL) /* case 3 */
|
|
snprintf(retp, len,
|
|
"%.*s%s%s.", plen, name, BACKUP_PREFIX, p);
|
|
else /* case 4 */
|
|
snprintf(retp, len,
|
|
"%.*s%x.%x.", plen, name, lsn.file, lsn.offset);
|
|
}
|
|
|
|
*backup = retp;
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __dblist_get --
|
|
* Get the first element of dbenv->dblist with
|
|
* dbp->adj_fileid matching adjid.
|
|
*
|
|
* PUBLIC: DB *__dblist_get __P((DB_ENV *, u_int32_t));
|
|
*/
|
|
DB *
|
|
__dblist_get(dbenv, adjid)
|
|
DB_ENV *dbenv;
|
|
u_int32_t adjid;
|
|
{
|
|
DB *dbp;
|
|
|
|
for (dbp = LIST_FIRST(&dbenv->dblist);
|
|
dbp != NULL && dbp->adj_fileid != adjid;
|
|
dbp = LIST_NEXT(dbp, dblistlinks))
|
|
;
|
|
|
|
return (dbp);
|
|
}
|
|
|
|
/*
|
|
* __db_disassociate --
|
|
* Destroy the association between a given secondary and its primary.
|
|
*/
|
|
static int
|
|
__db_disassociate(sdbp)
|
|
DB *sdbp;
|
|
{
|
|
DBC *dbc;
|
|
int ret, t_ret;
|
|
|
|
ret = 0;
|
|
|
|
sdbp->s_callback = NULL;
|
|
sdbp->s_primary = NULL;
|
|
sdbp->get = sdbp->stored_get;
|
|
sdbp->close = sdbp->stored_close;
|
|
|
|
/*
|
|
* Complain, but proceed, if we have any active cursors. (We're in
|
|
* the middle of a close, so there's really no turning back.)
|
|
*/
|
|
if (sdbp->s_refcnt != 1 ||
|
|
TAILQ_FIRST(&sdbp->active_queue) != NULL ||
|
|
TAILQ_FIRST(&sdbp->join_queue) != NULL) {
|
|
__db_err(sdbp->dbenv,
|
|
"Closing a primary DB while a secondary DB has active cursors is unsafe");
|
|
ret = EINVAL;
|
|
}
|
|
sdbp->s_refcnt = 0;
|
|
|
|
while ((dbc = TAILQ_FIRST(&sdbp->free_queue)) != NULL)
|
|
if ((t_ret = __db_c_destroy(dbc)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
F_CLR(sdbp, DB_AM_SECONDARY);
|
|
return (ret);
|
|
}
|
|
|
|
#if CONFIG_TEST
|
|
/*
|
|
* __db_testcopy
|
|
* Create a copy of all backup files and our "main" DB.
|
|
*
|
|
* PUBLIC: #if CONFIG_TEST
|
|
* PUBLIC: int __db_testcopy __P((DB_ENV *, DB *, const char *));
|
|
* PUBLIC: #endif
|
|
*/
|
|
int
|
|
__db_testcopy(dbenv, dbp, name)
|
|
DB_ENV *dbenv;
|
|
DB *dbp;
|
|
const char *name;
|
|
{
|
|
DB_MPOOLFILE *mpf;
|
|
|
|
DB_ASSERT(dbp != NULL || name != NULL);
|
|
|
|
if (name == NULL) {
|
|
mpf = dbp->mpf;
|
|
name = R_ADDR(mpf->dbmp->reginfo, mpf->mfp->path_off);
|
|
}
|
|
|
|
if (dbp != NULL && dbp->type == DB_QUEUE)
|
|
return (__qam_testdocopy(dbp, name));
|
|
else
|
|
return (__db_testdocopy(dbenv, name));
|
|
}
|
|
|
|
static int
|
|
__qam_testdocopy(dbp, name)
|
|
DB *dbp;
|
|
const char *name;
|
|
{
|
|
QUEUE_FILELIST *filelist, *fp;
|
|
char buf[256], *dir;
|
|
int ret;
|
|
|
|
filelist = NULL;
|
|
if ((ret = __db_testdocopy(dbp->dbenv, name)) != 0)
|
|
return (ret);
|
|
if (dbp->mpf != NULL &&
|
|
(ret = __qam_gen_filelist(dbp, &filelist)) != 0)
|
|
return (ret);
|
|
|
|
if (filelist == NULL)
|
|
return (0);
|
|
dir = ((QUEUE *)dbp->q_internal)->dir;
|
|
for (fp = filelist; fp->mpf != NULL; fp++) {
|
|
snprintf(buf, sizeof(buf),
|
|
QUEUE_EXTENT, dir, PATH_SEPARATOR[0], name, fp->id);
|
|
if ((ret = __db_testdocopy(dbp->dbenv, buf)) != 0)
|
|
return (ret);
|
|
}
|
|
|
|
__os_free(dbp->dbenv, filelist);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __db_testdocopy
|
|
* Create a copy of all backup files and our "main" DB.
|
|
*
|
|
*/
|
|
static int
|
|
__db_testdocopy(dbenv, name)
|
|
DB_ENV *dbenv;
|
|
const char *name;
|
|
{
|
|
size_t len;
|
|
int dircnt, i, ret;
|
|
char **namesp, *backup, *copy, *dir, *p, *real_name;
|
|
real_name = NULL;
|
|
/* Get the real backing file name. */
|
|
if ((ret = __db_appname(dbenv,
|
|
DB_APP_DATA, name, 0, NULL, &real_name)) != 0)
|
|
return (ret);
|
|
|
|
copy = backup = NULL;
|
|
namesp = NULL;
|
|
|
|
/*
|
|
* Maximum size of file, including adding a ".afterop".
|
|
*/
|
|
len = strlen(real_name) + strlen(BACKUP_PREFIX) + MAX_LSN_TO_TEXT + 9;
|
|
|
|
if ((ret = __os_malloc(dbenv, len, ©)) != 0)
|
|
goto out;
|
|
|
|
if ((ret = __os_malloc(dbenv, len, &backup)) != 0)
|
|
goto out;
|
|
|
|
/*
|
|
* First copy the file itself.
|
|
*/
|
|
snprintf(copy, len, "%s.afterop", real_name);
|
|
__db_makecopy(real_name, copy);
|
|
|
|
if ((ret = __os_strdup(dbenv, real_name, &dir)) != 0)
|
|
goto out;
|
|
__os_free(dbenv, real_name);
|
|
real_name = NULL;
|
|
/*
|
|
* Create the name. Backup file names are of the form:
|
|
*
|
|
* __db.name.0x[lsn-file].0x[lsn-offset]
|
|
*
|
|
* which guarantees uniqueness. We want to look for the
|
|
* backup name, followed by a '.0x' (so that if they have
|
|
* files named, say, 'a' and 'abc' we won't match 'abc' when
|
|
* looking for 'a'.
|
|
*/
|
|
snprintf(backup, len, "%s%s.0x", BACKUP_PREFIX, name);
|
|
|
|
/*
|
|
* We need the directory path to do the __os_dirlist.
|
|
*/
|
|
p = __db_rpath(dir);
|
|
if (p != NULL)
|
|
*p = '\0';
|
|
ret = __os_dirlist(dbenv, dir, &namesp, &dircnt);
|
|
#if DIAGNOSTIC
|
|
/*
|
|
* XXX
|
|
* To get the memory guard code to work because it uses strlen and we
|
|
* just moved the end of the string somewhere sooner. This causes the
|
|
* guard code to fail because it looks at one byte past the end of the
|
|
* string.
|
|
*/
|
|
*p = '/';
|
|
#endif
|
|
__os_free(dbenv, dir);
|
|
if (ret != 0)
|
|
goto out;
|
|
for (i = 0; i < dircnt; i++) {
|
|
/*
|
|
* Need to check if it is a backup file for this.
|
|
* No idea what namesp[i] may be or how long, so
|
|
* must use strncmp and not memcmp. We don't want
|
|
* to use strcmp either because we are only matching
|
|
* the first part of the real file's name. We don't
|
|
* know its LSN's.
|
|
*/
|
|
if (strncmp(namesp[i], backup, strlen(backup)) == 0) {
|
|
if ((ret = __db_appname(dbenv, DB_APP_DATA,
|
|
namesp[i], 0, NULL, &real_name)) != 0)
|
|
goto out;
|
|
|
|
/*
|
|
* This should not happen. Check that old
|
|
* .afterop files aren't around.
|
|
* If so, just move on.
|
|
*/
|
|
if (strstr(real_name, ".afterop") != NULL) {
|
|
__os_free(dbenv, real_name);
|
|
real_name = NULL;
|
|
continue;
|
|
}
|
|
snprintf(copy, len, "%s.afterop", real_name);
|
|
__db_makecopy(real_name, copy);
|
|
__os_free(dbenv, real_name);
|
|
real_name = NULL;
|
|
}
|
|
}
|
|
out:
|
|
if (backup != NULL)
|
|
__os_free(dbenv, backup);
|
|
if (copy != NULL)
|
|
__os_free(dbenv, copy);
|
|
if (namesp != NULL)
|
|
__os_dirfree(dbenv, namesp, dircnt);
|
|
if (real_name != NULL)
|
|
__os_free(dbenv, real_name);
|
|
return (ret);
|
|
}
|
|
|
|
static void
|
|
__db_makecopy(src, dest)
|
|
const char *src, *dest;
|
|
{
|
|
DB_FH rfh, wfh;
|
|
size_t rcnt, wcnt;
|
|
char *buf;
|
|
|
|
memset(&rfh, 0, sizeof(rfh));
|
|
memset(&wfh, 0, sizeof(wfh));
|
|
|
|
if (__os_malloc(NULL, 1024, &buf) != 0)
|
|
return;
|
|
|
|
if (__os_open(NULL,
|
|
src, DB_OSO_RDONLY, __db_omode("rw----"), &rfh) != 0)
|
|
goto err;
|
|
if (__os_open(NULL, dest,
|
|
DB_OSO_CREATE | DB_OSO_TRUNC, __db_omode("rw----"), &wfh) != 0)
|
|
goto err;
|
|
|
|
for (;;)
|
|
if (__os_read(NULL, &rfh, buf, 1024, &rcnt) < 0 || rcnt == 0 ||
|
|
__os_write(NULL, &wfh, buf, rcnt, &wcnt) < 0)
|
|
break;
|
|
|
|
err: __os_free(NULL, buf);
|
|
if (F_ISSET(&rfh, DB_FH_VALID))
|
|
__os_closehandle(NULL, &rfh);
|
|
if (F_ISSET(&wfh, DB_FH_VALID))
|
|
__os_closehandle(NULL, &wfh);
|
|
}
|
|
#endif
|