mirror of
https://github.com/MariaDB/server.git
synced 2025-01-23 15:24:16 +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
815 lines
18 KiB
C
815 lines
18 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 2000-2002
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
|
|
#include "db_config.h"
|
|
|
|
#ifndef lint
|
|
static const char revid[] = "$Id: db_server_util.c,v 1.59 2002/03/27 04:32:50 bostic Exp $";
|
|
#endif /* not lint */
|
|
|
|
#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 <rpc/rpc.h>
|
|
|
|
#include <limits.h>
|
|
#include <signal.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#endif
|
|
#include "dbinc_auto/db_server.h"
|
|
|
|
#include "db_int.h"
|
|
#include "dbinc_auto/clib_ext.h"
|
|
#include "dbinc/db_server_int.h"
|
|
#include "dbinc_auto/rpc_server_ext.h"
|
|
#include "dbinc_auto/common_ext.h"
|
|
|
|
extern int __dbsrv_main __P((void));
|
|
static int add_home __P((char *));
|
|
static int add_passwd __P((char *));
|
|
static int env_recover __P((char *));
|
|
static void __dbclear_child __P((ct_entry *));
|
|
|
|
static LIST_HEAD(cthead, ct_entry) __dbsrv_head;
|
|
static LIST_HEAD(homehead, home_entry) __dbsrv_home;
|
|
static long __dbsrv_defto = DB_SERVER_TIMEOUT;
|
|
static long __dbsrv_maxto = DB_SERVER_MAXTIMEOUT;
|
|
static long __dbsrv_idleto = DB_SERVER_IDLETIMEOUT;
|
|
static char *logfile = NULL;
|
|
static char *prog;
|
|
|
|
static void usage __P((char *));
|
|
static void version_check __P((void));
|
|
|
|
int __dbsrv_verbose = 0;
|
|
|
|
int
|
|
main(argc, argv)
|
|
int argc;
|
|
char **argv;
|
|
{
|
|
extern char *optarg;
|
|
CLIENT *cl;
|
|
int ch, ret;
|
|
char *passwd;
|
|
|
|
prog = argv[0];
|
|
|
|
version_check();
|
|
|
|
ret = 0;
|
|
/*
|
|
* Check whether another server is running or not. There
|
|
* is a race condition where two servers could be racing to
|
|
* register with the portmapper. The goal of this check is to
|
|
* forbid running additional servers (like those started from
|
|
* the test suite) if the user is already running one.
|
|
*
|
|
* XXX
|
|
* This does not solve nor prevent two servers from being
|
|
* started at the same time and running recovery at the same
|
|
* time on the same environments.
|
|
*/
|
|
if ((cl = clnt_create("localhost",
|
|
DB_RPC_SERVERPROG, DB_RPC_SERVERVERS, "tcp")) != NULL) {
|
|
fprintf(stderr,
|
|
"%s: Berkeley DB RPC server already running.\n", prog);
|
|
clnt_destroy(cl);
|
|
return (EXIT_FAILURE);
|
|
}
|
|
|
|
LIST_INIT(&__dbsrv_home);
|
|
while ((ch = getopt(argc, argv, "h:I:L:P:t:T:Vv")) != EOF)
|
|
switch (ch) {
|
|
case 'h':
|
|
(void)add_home(optarg);
|
|
break;
|
|
case 'I':
|
|
if (__db_getlong(NULL, prog,
|
|
optarg, 1, LONG_MAX, &__dbsrv_idleto))
|
|
return (EXIT_FAILURE);
|
|
break;
|
|
case 'L':
|
|
logfile = optarg;
|
|
break;
|
|
case 'P':
|
|
passwd = strdup(optarg);
|
|
memset(optarg, 0, strlen(optarg));
|
|
if (passwd == NULL) {
|
|
fprintf(stderr, "%s: strdup: %s\n",
|
|
prog, strerror(errno));
|
|
return (EXIT_FAILURE);
|
|
}
|
|
if ((ret = add_passwd(passwd)) != 0) {
|
|
fprintf(stderr, "%s: strdup: %s\n",
|
|
prog, strerror(ret));
|
|
return (EXIT_FAILURE);
|
|
}
|
|
break;
|
|
case 't':
|
|
if (__db_getlong(NULL, prog,
|
|
optarg, 1, LONG_MAX, &__dbsrv_defto))
|
|
return (EXIT_FAILURE);
|
|
break;
|
|
case 'T':
|
|
if (__db_getlong(NULL, prog,
|
|
optarg, 1, LONG_MAX, &__dbsrv_maxto))
|
|
return (EXIT_FAILURE);
|
|
break;
|
|
case 'V':
|
|
printf("%s\n", db_version(NULL, NULL, NULL));
|
|
return (EXIT_SUCCESS);
|
|
case 'v':
|
|
__dbsrv_verbose = 1;
|
|
break;
|
|
default:
|
|
usage(prog);
|
|
}
|
|
/*
|
|
* Check default timeout against maximum timeout
|
|
*/
|
|
if (__dbsrv_defto > __dbsrv_maxto)
|
|
__dbsrv_defto = __dbsrv_maxto;
|
|
|
|
/*
|
|
* Check default timeout against idle timeout
|
|
* It would be bad to timeout environments sooner than txns.
|
|
*/
|
|
if (__dbsrv_defto > __dbsrv_idleto)
|
|
fprintf(stderr,
|
|
"%s: WARNING: Idle timeout %ld is less than resource timeout %ld\n",
|
|
prog, __dbsrv_idleto, __dbsrv_defto);
|
|
|
|
LIST_INIT(&__dbsrv_head);
|
|
|
|
/*
|
|
* If a client crashes during an RPC, our reply to it
|
|
* generates a SIGPIPE. Ignore SIGPIPE so we don't exit unnecessarily.
|
|
*/
|
|
#ifdef SIGPIPE
|
|
signal(SIGPIPE, SIG_IGN);
|
|
#endif
|
|
|
|
if (logfile != NULL && __db_util_logset("berkeley_db_svc", logfile))
|
|
return (EXIT_FAILURE);
|
|
|
|
/*
|
|
* Now that we are ready to start, run recovery on all the
|
|
* environments specified.
|
|
*/
|
|
if (env_recover(prog) != 0)
|
|
return (EXIT_FAILURE);
|
|
|
|
/*
|
|
* We've done our setup, now call the generated server loop
|
|
*/
|
|
if (__dbsrv_verbose)
|
|
printf("%s: Ready to receive requests\n", prog);
|
|
__dbsrv_main();
|
|
|
|
/* NOTREACHED */
|
|
abort();
|
|
}
|
|
|
|
static void
|
|
usage(prog)
|
|
char *prog;
|
|
{
|
|
fprintf(stderr, "usage: %s %s\n\t%s\n", prog,
|
|
"[-Vv] [-h home] [-P passwd]",
|
|
"[-I idletimeout] [-L logfile] [-t def_timeout] [-T maxtimeout]");
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
static void
|
|
version_check()
|
|
{
|
|
int v_major, v_minor, v_patch;
|
|
|
|
/* Make sure we're loaded with the right version of the DB library. */
|
|
(void)db_version(&v_major, &v_minor, &v_patch);
|
|
if (v_major != DB_VERSION_MAJOR ||
|
|
v_minor != DB_VERSION_MINOR || v_patch != DB_VERSION_PATCH) {
|
|
fprintf(stderr,
|
|
"%s: version %d.%d.%d doesn't match library version %d.%d.%d\n",
|
|
prog, DB_VERSION_MAJOR, DB_VERSION_MINOR,
|
|
DB_VERSION_PATCH, v_major, v_minor, v_patch);
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: void __dbsrv_settimeout __P((ct_entry *, u_int32_t));
|
|
*/
|
|
void
|
|
__dbsrv_settimeout(ctp, to)
|
|
ct_entry *ctp;
|
|
u_int32_t to;
|
|
{
|
|
if (to > (u_int32_t)__dbsrv_maxto)
|
|
ctp->ct_timeout = __dbsrv_maxto;
|
|
else if (to <= 0)
|
|
ctp->ct_timeout = __dbsrv_defto;
|
|
else
|
|
ctp->ct_timeout = to;
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: void __dbsrv_timeout __P((int));
|
|
*/
|
|
void
|
|
__dbsrv_timeout(force)
|
|
int force;
|
|
{
|
|
static long to_hint = -1;
|
|
time_t t;
|
|
long to;
|
|
ct_entry *ctp, *nextctp;
|
|
|
|
if ((t = time(NULL)) == -1)
|
|
return;
|
|
|
|
/*
|
|
* Check hint. If hint is further in the future
|
|
* than now, no work to do.
|
|
*/
|
|
if (!force && to_hint > 0 && t < to_hint)
|
|
return;
|
|
to_hint = -1;
|
|
/*
|
|
* Timeout transactions or cursors holding DB resources.
|
|
* Do this before timing out envs to properly release resources.
|
|
*
|
|
* !!!
|
|
* We can just loop through this list looking for cursors and txns.
|
|
* We do not need to verify txn and cursor relationships at this
|
|
* point because we maintain the list in LIFO order *and* we
|
|
* maintain activity in the ultimate txn parent of any cursor
|
|
* so either everything in a txn is timing out, or nothing.
|
|
* So, since we are LIFO, we will correctly close/abort all the
|
|
* appropriate handles, in the correct order.
|
|
*/
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL; ctp = nextctp) {
|
|
nextctp = LIST_NEXT(ctp, entries);
|
|
switch (ctp->ct_type) {
|
|
case CT_TXN:
|
|
to = *(ctp->ct_activep) + ctp->ct_timeout;
|
|
/* TIMEOUT */
|
|
if (to < t) {
|
|
if (__dbsrv_verbose)
|
|
printf("Timing out txn id %ld\n",
|
|
ctp->ct_id);
|
|
(void)((DB_TXN *)ctp->ct_anyp)->
|
|
abort((DB_TXN *)ctp->ct_anyp);
|
|
__dbdel_ctp(ctp);
|
|
/*
|
|
* If we timed out an txn, we may have closed
|
|
* all sorts of ctp's.
|
|
* So start over with a guaranteed good ctp.
|
|
*/
|
|
nextctp = LIST_FIRST(&__dbsrv_head);
|
|
} else if ((to_hint > 0 && to_hint > to) ||
|
|
to_hint == -1)
|
|
to_hint = to;
|
|
break;
|
|
case CT_CURSOR:
|
|
case (CT_JOINCUR | CT_CURSOR):
|
|
to = *(ctp->ct_activep) + ctp->ct_timeout;
|
|
/* TIMEOUT */
|
|
if (to < t) {
|
|
if (__dbsrv_verbose)
|
|
printf("Timing out cursor %ld\n",
|
|
ctp->ct_id);
|
|
(void)__dbc_close_int(ctp);
|
|
/*
|
|
* Start over with a guaranteed good ctp.
|
|
*/
|
|
nextctp = LIST_FIRST(&__dbsrv_head);
|
|
} else if ((to_hint > 0 && to_hint > to) ||
|
|
to_hint == -1)
|
|
to_hint = to;
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
/*
|
|
* Timeout idle handles.
|
|
* If we are forcing a timeout, we'll close all env handles.
|
|
*/
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL; ctp = nextctp) {
|
|
nextctp = LIST_NEXT(ctp, entries);
|
|
if (ctp->ct_type != CT_ENV)
|
|
continue;
|
|
to = *(ctp->ct_activep) + ctp->ct_idle;
|
|
/* TIMEOUT */
|
|
if (to < t || force) {
|
|
if (__dbsrv_verbose)
|
|
printf("Timing out env id %ld\n", ctp->ct_id);
|
|
(void)__dbenv_close_int(ctp->ct_id, 0, 1);
|
|
/*
|
|
* If we timed out an env, we may have closed
|
|
* all sorts of ctp's (maybe even all of them.
|
|
* So start over with a guaranteed good ctp.
|
|
*/
|
|
nextctp = LIST_FIRST(&__dbsrv_head);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* RECURSIVE FUNCTION. We need to clear/free any number of levels of nested
|
|
* layers.
|
|
*/
|
|
static void
|
|
__dbclear_child(parent)
|
|
ct_entry *parent;
|
|
{
|
|
ct_entry *ctp, *nextctp;
|
|
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL;
|
|
ctp = nextctp) {
|
|
nextctp = LIST_NEXT(ctp, entries);
|
|
if (ctp->ct_type == 0)
|
|
continue;
|
|
if (ctp->ct_parent == parent) {
|
|
__dbclear_child(ctp);
|
|
/*
|
|
* Need to do this here because le_next may
|
|
* have changed with the recursive call and we
|
|
* don't want to point to a removed entry.
|
|
*/
|
|
nextctp = LIST_NEXT(ctp, entries);
|
|
__dbclear_ctp(ctp);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: void __dbclear_ctp __P((ct_entry *));
|
|
*/
|
|
void
|
|
__dbclear_ctp(ctp)
|
|
ct_entry *ctp;
|
|
{
|
|
LIST_REMOVE(ctp, entries);
|
|
__os_free(NULL, ctp);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: void __dbdel_ctp __P((ct_entry *));
|
|
*/
|
|
void
|
|
__dbdel_ctp(parent)
|
|
ct_entry *parent;
|
|
{
|
|
__dbclear_child(parent);
|
|
__dbclear_ctp(parent);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: ct_entry *new_ct_ent __P((int *));
|
|
*/
|
|
ct_entry *
|
|
new_ct_ent(errp)
|
|
int *errp;
|
|
{
|
|
time_t t;
|
|
ct_entry *ctp, *octp;
|
|
int ret;
|
|
|
|
if ((ret = __os_malloc(NULL, sizeof(ct_entry), &ctp)) != 0) {
|
|
*errp = ret;
|
|
return (NULL);
|
|
}
|
|
memset(ctp, 0, sizeof(ct_entry));
|
|
/*
|
|
* Get the time as ID. We may service more than one request per
|
|
* second however. If we are, then increment id value until we
|
|
* find an unused one. We insert entries in LRU fashion at the
|
|
* head of the list. So, if the first entry doesn't match, then
|
|
* we know for certain that we can use our entry.
|
|
*/
|
|
if ((t = time(NULL)) == -1) {
|
|
*errp = __os_get_errno();
|
|
__os_free(NULL, ctp);
|
|
return (NULL);
|
|
}
|
|
octp = LIST_FIRST(&__dbsrv_head);
|
|
if (octp != NULL && octp->ct_id >= t)
|
|
t = octp->ct_id + 1;
|
|
ctp->ct_id = t;
|
|
ctp->ct_idle = __dbsrv_idleto;
|
|
ctp->ct_activep = &ctp->ct_active;
|
|
ctp->ct_origp = NULL;
|
|
ctp->ct_refcount = 1;
|
|
|
|
LIST_INSERT_HEAD(&__dbsrv_head, ctp, entries);
|
|
return (ctp);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: ct_entry *get_tableent __P((long));
|
|
*/
|
|
ct_entry *
|
|
get_tableent(id)
|
|
long id;
|
|
{
|
|
ct_entry *ctp;
|
|
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL;
|
|
ctp = LIST_NEXT(ctp, entries))
|
|
if (ctp->ct_id == id)
|
|
return (ctp);
|
|
return (NULL);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: ct_entry *__dbsrv_sharedb __P((ct_entry *, const char *,
|
|
* PUBLIC: const char *, DBTYPE, u_int32_t));
|
|
*/
|
|
ct_entry *
|
|
__dbsrv_sharedb(db_ctp, name, subdb, type, flags)
|
|
ct_entry *db_ctp;
|
|
const char *name, *subdb;
|
|
DBTYPE type;
|
|
u_int32_t flags;
|
|
{
|
|
ct_entry *ctp;
|
|
|
|
/*
|
|
* Check if we can share a db handle. Criteria for sharing are:
|
|
* If any of the non-sharable flags are set, we cannot share.
|
|
* Must be a db ctp, obviously.
|
|
* Must share the same env parent.
|
|
* Must be the same type, or current one DB_UNKNOWN.
|
|
* Must be same byteorder, or current one must not care.
|
|
* All flags must match.
|
|
* Must be same name, but don't share in-memory databases.
|
|
* Must be same subdb name.
|
|
*/
|
|
if (flags & DB_SERVER_DBNOSHARE)
|
|
return (NULL);
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL;
|
|
ctp = LIST_NEXT(ctp, entries)) {
|
|
/*
|
|
* Skip ourselves.
|
|
*/
|
|
if (ctp == db_ctp)
|
|
continue;
|
|
if (ctp->ct_type != CT_DB)
|
|
continue;
|
|
if (ctp->ct_envparent != db_ctp->ct_envparent)
|
|
continue;
|
|
if (type != DB_UNKNOWN && ctp->ct_dbdp.type != type)
|
|
continue;
|
|
if (ctp->ct_dbdp.dbflags != LF_ISSET(DB_SERVER_DBFLAGS))
|
|
continue;
|
|
if (db_ctp->ct_dbdp.setflags != 0 &&
|
|
ctp->ct_dbdp.setflags != db_ctp->ct_dbdp.setflags)
|
|
continue;
|
|
if (name == NULL || ctp->ct_dbdp.db == NULL ||
|
|
strcmp(name, ctp->ct_dbdp.db) != 0)
|
|
continue;
|
|
if (subdb != ctp->ct_dbdp.subdb &&
|
|
(subdb == NULL || ctp->ct_dbdp.subdb == NULL ||
|
|
strcmp(subdb, ctp->ct_dbdp.subdb) != 0))
|
|
continue;
|
|
/*
|
|
* If we get here, then we match.
|
|
*/
|
|
ctp->ct_refcount++;
|
|
return (ctp);
|
|
}
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: ct_entry *__dbsrv_shareenv __P((ct_entry *, home_entry *, u_int32_t));
|
|
*/
|
|
ct_entry *
|
|
__dbsrv_shareenv(env_ctp, home, flags)
|
|
ct_entry *env_ctp;
|
|
home_entry *home;
|
|
u_int32_t flags;
|
|
{
|
|
ct_entry *ctp;
|
|
|
|
/*
|
|
* Check if we can share an env. Criteria for sharing are:
|
|
* Must be an env ctp, obviously.
|
|
* Must share the same home env.
|
|
* All flags must match.
|
|
*/
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL;
|
|
ctp = LIST_NEXT(ctp, entries)) {
|
|
/*
|
|
* Skip ourselves.
|
|
*/
|
|
if (ctp == env_ctp)
|
|
continue;
|
|
if (ctp->ct_type != CT_ENV)
|
|
continue;
|
|
if (ctp->ct_envdp.home != home)
|
|
continue;
|
|
if (ctp->ct_envdp.envflags != flags)
|
|
continue;
|
|
if (ctp->ct_envdp.onflags != env_ctp->ct_envdp.onflags)
|
|
continue;
|
|
if (ctp->ct_envdp.offflags != env_ctp->ct_envdp.offflags)
|
|
continue;
|
|
/*
|
|
* If we get here, then we match. The only thing left to
|
|
* check is the timeout. Since the server timeout set by
|
|
* the client is a hint, for sharing we'll give them the
|
|
* benefit of the doubt and grant them the longer timeout.
|
|
*/
|
|
if (ctp->ct_timeout < env_ctp->ct_timeout)
|
|
ctp->ct_timeout = env_ctp->ct_timeout;
|
|
ctp->ct_refcount++;
|
|
return (ctp);
|
|
}
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: void __dbsrv_active __P((ct_entry *));
|
|
*/
|
|
void
|
|
__dbsrv_active(ctp)
|
|
ct_entry *ctp;
|
|
{
|
|
time_t t;
|
|
ct_entry *envctp;
|
|
|
|
if (ctp == NULL)
|
|
return;
|
|
if ((t = time(NULL)) == -1)
|
|
return;
|
|
*(ctp->ct_activep) = t;
|
|
if ((envctp = ctp->ct_envparent) == NULL)
|
|
return;
|
|
*(envctp->ct_activep) = t;
|
|
return;
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int __db_close_int __P((long, u_int32_t));
|
|
*/
|
|
int
|
|
__db_close_int(id, flags)
|
|
long id;
|
|
u_int32_t flags;
|
|
{
|
|
DB *dbp;
|
|
int ret;
|
|
ct_entry *ctp;
|
|
|
|
ret = 0;
|
|
ctp = get_tableent(id);
|
|
if (ctp == NULL)
|
|
return (DB_NOSERVER_ID);
|
|
DB_ASSERT(ctp->ct_type == CT_DB);
|
|
if (__dbsrv_verbose && ctp->ct_refcount != 1)
|
|
printf("Deref'ing dbp id %ld, refcount %d\n",
|
|
id, ctp->ct_refcount);
|
|
if (--ctp->ct_refcount != 0)
|
|
return (ret);
|
|
dbp = ctp->ct_dbp;
|
|
if (__dbsrv_verbose)
|
|
printf("Closing dbp id %ld\n", id);
|
|
|
|
ret = dbp->close(dbp, flags);
|
|
__dbdel_ctp(ctp);
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int __dbc_close_int __P((ct_entry *));
|
|
*/
|
|
int
|
|
__dbc_close_int(dbc_ctp)
|
|
ct_entry *dbc_ctp;
|
|
{
|
|
DBC *dbc;
|
|
int ret;
|
|
ct_entry *ctp;
|
|
|
|
dbc = (DBC *)dbc_ctp->ct_anyp;
|
|
|
|
ret = dbc->c_close(dbc);
|
|
/*
|
|
* If this cursor is a join cursor then we need to fix up the
|
|
* cursors that it was joined from so that they are independent again.
|
|
*/
|
|
if (dbc_ctp->ct_type & CT_JOINCUR)
|
|
for (ctp = LIST_FIRST(&__dbsrv_head); ctp != NULL;
|
|
ctp = LIST_NEXT(ctp, entries)) {
|
|
/*
|
|
* Test if it is a join cursor, and if it is part
|
|
* of this one.
|
|
*/
|
|
if ((ctp->ct_type & CT_JOIN) &&
|
|
ctp->ct_activep == &dbc_ctp->ct_active) {
|
|
ctp->ct_type &= ~CT_JOIN;
|
|
ctp->ct_activep = ctp->ct_origp;
|
|
__dbsrv_active(ctp);
|
|
}
|
|
}
|
|
__dbclear_ctp(dbc_ctp);
|
|
return (ret);
|
|
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int __dbenv_close_int __P((long, u_int32_t, int));
|
|
*/
|
|
int
|
|
__dbenv_close_int(id, flags, force)
|
|
long id;
|
|
u_int32_t flags;
|
|
int force;
|
|
{
|
|
DB_ENV *dbenv;
|
|
int ret;
|
|
ct_entry *ctp;
|
|
|
|
ret = 0;
|
|
ctp = get_tableent(id);
|
|
if (ctp == NULL)
|
|
return (DB_NOSERVER_ID);
|
|
DB_ASSERT(ctp->ct_type == CT_ENV);
|
|
if (__dbsrv_verbose && ctp->ct_refcount != 1)
|
|
printf("Deref'ing env id %ld, refcount %d\n",
|
|
id, ctp->ct_refcount);
|
|
/*
|
|
* If we are timing out, we need to force the close, no matter
|
|
* what the refcount.
|
|
*/
|
|
if (--ctp->ct_refcount != 0 && !force)
|
|
return (ret);
|
|
dbenv = ctp->ct_envp;
|
|
if (__dbsrv_verbose)
|
|
printf("Closing env id %ld\n", id);
|
|
|
|
ret = dbenv->close(dbenv, flags);
|
|
__dbdel_ctp(ctp);
|
|
return (ret);
|
|
}
|
|
|
|
static int
|
|
add_home(home)
|
|
char *home;
|
|
{
|
|
home_entry *hp, *homep;
|
|
int ret;
|
|
|
|
if ((ret = __os_malloc(NULL, sizeof(home_entry), &hp)) != 0)
|
|
return (ret);
|
|
if ((ret = __os_malloc(NULL, strlen(home)+1, &hp->home)) != 0)
|
|
return (ret);
|
|
memcpy(hp->home, home, strlen(home)+1);
|
|
hp->dir = home;
|
|
hp->passwd = NULL;
|
|
/*
|
|
* This loop is to remove any trailing path separators,
|
|
* to assure hp->name points to the last component.
|
|
*/
|
|
hp->name = __db_rpath(home);
|
|
*(hp->name) = '\0';
|
|
hp->name++;
|
|
while (*(hp->name) == '\0') {
|
|
hp->name = __db_rpath(home);
|
|
*(hp->name) = '\0';
|
|
hp->name++;
|
|
}
|
|
/*
|
|
* Now we have successfully added it. Make sure there are no
|
|
* identical names.
|
|
*/
|
|
for (homep = LIST_FIRST(&__dbsrv_home); homep != NULL;
|
|
homep = LIST_NEXT(homep, entries))
|
|
if (strcmp(homep->name, hp->name) == 0) {
|
|
printf("Already added home name %s, at directory %s\n",
|
|
hp->name, homep->dir);
|
|
__os_free(NULL, hp->home);
|
|
__os_free(NULL, hp);
|
|
return (-1);
|
|
}
|
|
LIST_INSERT_HEAD(&__dbsrv_home, hp, entries);
|
|
if (__dbsrv_verbose)
|
|
printf("Added home %s in dir %s\n", hp->name, hp->dir);
|
|
return (0);
|
|
}
|
|
|
|
static int
|
|
add_passwd(passwd)
|
|
char *passwd;
|
|
{
|
|
home_entry *hp;
|
|
|
|
/*
|
|
* We add the passwd to the last given home dir. If there
|
|
* isn't a home dir, or the most recent one already has a
|
|
* passwd, then there is a user error.
|
|
*/
|
|
hp = LIST_FIRST(&__dbsrv_home);
|
|
if (hp == NULL || hp->passwd != NULL)
|
|
return (EINVAL);
|
|
/*
|
|
* We've already strdup'ed the passwd above, so we don't need
|
|
* to malloc new space, just point to it.
|
|
*/
|
|
hp->passwd = passwd;
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: home_entry *get_home __P((char *));
|
|
*/
|
|
home_entry *
|
|
get_home(name)
|
|
char *name;
|
|
{
|
|
home_entry *hp;
|
|
|
|
for (hp = LIST_FIRST(&__dbsrv_home); hp != NULL;
|
|
hp = LIST_NEXT(hp, entries))
|
|
if (strcmp(name, hp->name) == 0)
|
|
return (hp);
|
|
return (NULL);
|
|
}
|
|
|
|
static int
|
|
env_recover(progname)
|
|
char *progname;
|
|
{
|
|
DB_ENV *dbenv;
|
|
home_entry *hp;
|
|
u_int32_t flags;
|
|
int exitval, ret;
|
|
|
|
for (hp = LIST_FIRST(&__dbsrv_home); hp != NULL;
|
|
hp = LIST_NEXT(hp, entries)) {
|
|
exitval = 0;
|
|
if ((ret = db_env_create(&dbenv, 0)) != 0) {
|
|
fprintf(stderr, "%s: db_env_create: %s\n",
|
|
progname, db_strerror(ret));
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
if (__dbsrv_verbose == 1) {
|
|
(void)dbenv->set_verbose(dbenv, DB_VERB_RECOVERY, 1);
|
|
(void)dbenv->set_verbose(dbenv, DB_VERB_CHKPOINT, 1);
|
|
}
|
|
dbenv->set_errfile(dbenv, stderr);
|
|
dbenv->set_errpfx(dbenv, progname);
|
|
if (hp->passwd != NULL)
|
|
(void)dbenv->set_encrypt(dbenv, hp->passwd,
|
|
DB_ENCRYPT_AES);
|
|
|
|
/*
|
|
* Initialize the env with DB_RECOVER. That is all we
|
|
* have to do to run recovery.
|
|
*/
|
|
if (__dbsrv_verbose)
|
|
printf("Running recovery on %s\n", hp->home);
|
|
flags = DB_CREATE | DB_INIT_LOCK | DB_INIT_LOG | DB_INIT_MPOOL |
|
|
DB_INIT_TXN | DB_USE_ENVIRON | DB_RECOVER;
|
|
if ((ret = dbenv->open(dbenv, hp->home, flags, 0)) != 0) {
|
|
dbenv->err(dbenv, ret, "DB_ENV->open");
|
|
goto error;
|
|
}
|
|
|
|
if (0) {
|
|
error: exitval = 1;
|
|
}
|
|
if ((ret = dbenv->close(dbenv, 0)) != 0) {
|
|
exitval = 1;
|
|
fprintf(stderr, "%s: dbenv->close: %s\n",
|
|
progname, db_strerror(ret));
|
|
}
|
|
if (exitval)
|
|
return (exitval);
|
|
}
|
|
return (0);
|
|
}
|