mariadb/bdb/db/db_vrfyutil.c
unknown 155e78f014 BDB 4.1.24
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
2002-10-30 15:57:05 +04:00

872 lines
19 KiB
C

/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2000-2002
* Sleepycat Software. All rights reserved.
*
* $Id: db_vrfyutil.c,v 11.29 2002/08/08 03:57:50 bostic Exp $
*/
#include "db_config.h"
#ifndef lint
static const char revid[] = "$Id: db_vrfyutil.c,v 11.29 2002/08/08 03:57:50 bostic Exp $";
#endif /* not lint */
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <string.h>
#endif
#include "db_int.h"
#include "dbinc/db_page.h"
#include "dbinc/db_verify.h"
#include "dbinc/db_am.h"
static int __db_vrfy_pageinfo_create __P((DB_ENV *, VRFY_PAGEINFO **));
static int __db_vrfy_pgset_iinc __P((DB *, db_pgno_t, int));
/*
* __db_vrfy_dbinfo_create --
* Allocate and initialize a VRFY_DBINFO structure.
*
* PUBLIC: int __db_vrfy_dbinfo_create
* PUBLIC: __P((DB_ENV *, u_int32_t, VRFY_DBINFO **));
*/
int
__db_vrfy_dbinfo_create(dbenv, pgsize, vdpp)
DB_ENV *dbenv;
u_int32_t pgsize;
VRFY_DBINFO **vdpp;
{
DB *cdbp, *pgdbp, *pgset;
VRFY_DBINFO *vdp;
int ret;
vdp = NULL;
cdbp = pgdbp = pgset = NULL;
if ((ret = __os_calloc(NULL,
1, sizeof(VRFY_DBINFO), (void **)&vdp)) != 0)
goto err;
if ((ret = db_create(&cdbp, dbenv, 0)) != 0)
goto err;
if ((ret = cdbp->set_flags(cdbp, DB_DUP)) != 0)
goto err;
if ((ret = cdbp->set_pagesize(cdbp, pgsize)) != 0)
goto err;
if ((ret =
cdbp->open(cdbp, NULL, NULL, NULL, DB_BTREE, DB_CREATE, 0600)) != 0)
goto err;
if ((ret = db_create(&pgdbp, dbenv, 0)) != 0)
goto err;
if ((ret = pgdbp->set_pagesize(pgdbp, pgsize)) != 0)
goto err;
if ((ret = pgdbp->open(pgdbp,
NULL, NULL, NULL, DB_BTREE, DB_CREATE, 0600)) != 0)
goto err;
if ((ret = __db_vrfy_pgset(dbenv, pgsize, &pgset)) != 0)
goto err;
LIST_INIT(&vdp->subdbs);
LIST_INIT(&vdp->activepips);
vdp->cdbp = cdbp;
vdp->pgdbp = pgdbp;
vdp->pgset = pgset;
*vdpp = vdp;
return (0);
err: if (cdbp != NULL)
(void)cdbp->close(cdbp, 0);
if (pgdbp != NULL)
(void)pgdbp->close(pgdbp, 0);
if (vdp != NULL)
__os_free(dbenv, vdp);
return (ret);
}
/*
* __db_vrfy_dbinfo_destroy --
* Destructor for VRFY_DBINFO. Destroys VRFY_PAGEINFOs and deallocates
* structure.
*
* PUBLIC: int __db_vrfy_dbinfo_destroy __P((DB_ENV *, VRFY_DBINFO *));
*/
int
__db_vrfy_dbinfo_destroy(dbenv, vdp)
DB_ENV *dbenv;
VRFY_DBINFO *vdp;
{
VRFY_CHILDINFO *c, *d;
int t_ret, ret;
ret = 0;
for (c = LIST_FIRST(&vdp->subdbs); c != NULL; c = d) {
d = LIST_NEXT(c, links);
__os_free(NULL, c);
}
if ((t_ret = vdp->pgdbp->close(vdp->pgdbp, 0)) != 0)
ret = t_ret;
if ((t_ret = vdp->cdbp->close(vdp->cdbp, 0)) != 0 && ret == 0)
ret = t_ret;
if ((t_ret = vdp->pgset->close(vdp->pgset, 0)) != 0 && ret == 0)
ret = t_ret;
DB_ASSERT(LIST_FIRST(&vdp->activepips) == NULL);
__os_free(dbenv, vdp);
return (ret);
}
/*
* __db_vrfy_getpageinfo --
* Get a PAGEINFO structure for a given page, creating it if necessary.
*
* PUBLIC: int __db_vrfy_getpageinfo
* PUBLIC: __P((VRFY_DBINFO *, db_pgno_t, VRFY_PAGEINFO **));
*/
int
__db_vrfy_getpageinfo(vdp, pgno, pipp)
VRFY_DBINFO *vdp;
db_pgno_t pgno;
VRFY_PAGEINFO **pipp;
{
DBT key, data;
DB *pgdbp;
VRFY_PAGEINFO *pip;
int ret;
/*
* We want a page info struct. There are three places to get it from,
* in decreasing order of preference:
*
* 1. vdp->activepips. If it's already "checked out", we're
* already using it, we return the same exact structure with a
* bumped refcount. This is necessary because this code is
* replacing array accesses, and it's common for f() to make some
* changes to a pip, and then call g() and h() which each make
* changes to the same pip. vdps are never shared between threads
* (they're never returned to the application), so this is safe.
* 2. The pgdbp. It's not in memory, but it's in the database, so
* get it, give it a refcount of 1, and stick it on activepips.
* 3. malloc. It doesn't exist yet; create it, then stick it on
* activepips. We'll put it in the database when we putpageinfo
* later.
*/
/* Case 1. */
for (pip = LIST_FIRST(&vdp->activepips); pip != NULL;
pip = LIST_NEXT(pip, links))
if (pip->pgno == pgno)
/* Found it. */
goto found;
/* Case 2. */
pgdbp = vdp->pgdbp;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
F_SET(&data, DB_DBT_MALLOC);
key.data = &pgno;
key.size = sizeof(db_pgno_t);
if ((ret = pgdbp->get(pgdbp, NULL, &key, &data, 0)) == 0) {
/* Found it. */
DB_ASSERT(data.size = sizeof(VRFY_PAGEINFO));
pip = data.data;
DB_ASSERT(pip->pi_refcount == 0);
LIST_INSERT_HEAD(&vdp->activepips, pip, links);
goto found;
} else if (ret != DB_NOTFOUND) /* Something nasty happened. */
return (ret);
/* Case 3 */
if ((ret = __db_vrfy_pageinfo_create(pgdbp->dbenv, &pip)) != 0)
return (ret);
LIST_INSERT_HEAD(&vdp->activepips, pip, links);
found: pip->pi_refcount++;
*pipp = pip;
DB_ASSERT(pip->pi_refcount > 0);
return (0);
}
/*
* __db_vrfy_putpageinfo --
* Put back a VRFY_PAGEINFO that we're done with.
*
* PUBLIC: int __db_vrfy_putpageinfo __P((DB_ENV *,
* PUBLIC: VRFY_DBINFO *, VRFY_PAGEINFO *));
*/
int
__db_vrfy_putpageinfo(dbenv, vdp, pip)
DB_ENV *dbenv;
VRFY_DBINFO *vdp;
VRFY_PAGEINFO *pip;
{
DBT key, data;
DB *pgdbp;
VRFY_PAGEINFO *p;
int ret;
#ifdef DIAGNOSTIC
int found;
found = 0;
#endif
if (--pip->pi_refcount > 0)
return (0);
pgdbp = vdp->pgdbp;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
key.data = &pip->pgno;
key.size = sizeof(db_pgno_t);
data.data = pip;
data.size = sizeof(VRFY_PAGEINFO);
if ((ret = pgdbp->put(pgdbp, NULL, &key, &data, 0)) != 0)
return (ret);
for (p = LIST_FIRST(&vdp->activepips); p != NULL;
p = LIST_NEXT(p, links))
if (p == pip) {
#ifdef DIAGNOSTIC
found++;
#endif
DB_ASSERT(p->pi_refcount == 0);
LIST_REMOVE(p, links);
break;
}
#ifdef DIAGNOSTIC
DB_ASSERT(found == 1);
#endif
DB_ASSERT(pip->pi_refcount == 0);
__os_ufree(dbenv, pip);
return (0);
}
/*
* __db_vrfy_pgset --
* Create a temporary database for the storing of sets of page numbers.
* (A mapping from page number to int, used by the *_meta2pgset functions,
* as well as for keeping track of which pages the verifier has seen.)
*
* PUBLIC: int __db_vrfy_pgset __P((DB_ENV *, u_int32_t, DB **));
*/
int
__db_vrfy_pgset(dbenv, pgsize, dbpp)
DB_ENV *dbenv;
u_int32_t pgsize;
DB **dbpp;
{
DB *dbp;
int ret;
if ((ret = db_create(&dbp, dbenv, 0)) != 0)
return (ret);
if ((ret = dbp->set_pagesize(dbp, pgsize)) != 0)
goto err;
if ((ret = dbp->open(dbp,
NULL, NULL, NULL, DB_BTREE, DB_CREATE, 0600)) == 0)
*dbpp = dbp;
else
err: (void)dbp->close(dbp, 0);
return (ret);
}
/*
* __db_vrfy_pgset_get --
* Get the value associated in a page set with a given pgno. Return
* a 0 value (and succeed) if we've never heard of this page.
*
* PUBLIC: int __db_vrfy_pgset_get __P((DB *, db_pgno_t, int *));
*/
int
__db_vrfy_pgset_get(dbp, pgno, valp)
DB *dbp;
db_pgno_t pgno;
int *valp;
{
DBT key, data;
int ret, val;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
key.data = &pgno;
key.size = sizeof(db_pgno_t);
data.data = &val;
data.ulen = sizeof(int);
F_SET(&data, DB_DBT_USERMEM);
if ((ret = dbp->get(dbp, NULL, &key, &data, 0)) == 0) {
DB_ASSERT(data.size = sizeof(int));
memcpy(&val, data.data, sizeof(int));
} else if (ret == DB_NOTFOUND)
val = 0;
else
return (ret);
*valp = val;
return (0);
}
/*
* __db_vrfy_pgset_inc --
* Increment the value associated with a pgno by 1.
*
* PUBLIC: int __db_vrfy_pgset_inc __P((DB *, db_pgno_t));
*/
int
__db_vrfy_pgset_inc(dbp, pgno)
DB *dbp;
db_pgno_t pgno;
{
return (__db_vrfy_pgset_iinc(dbp, pgno, 1));
}
/*
* __db_vrfy_pgset_dec --
* Increment the value associated with a pgno by 1.
*
* PUBLIC: int __db_vrfy_pgset_dec __P((DB *, db_pgno_t));
*/
int
__db_vrfy_pgset_dec(dbp, pgno)
DB *dbp;
db_pgno_t pgno;
{
return (__db_vrfy_pgset_iinc(dbp, pgno, -1));
}
/*
* __db_vrfy_pgset_iinc --
* Increment the value associated with a pgno by i.
*
*/
static int
__db_vrfy_pgset_iinc(dbp, pgno, i)
DB *dbp;
db_pgno_t pgno;
int i;
{
DBT key, data;
int ret;
int val;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
val = 0;
key.data = &pgno;
key.size = sizeof(db_pgno_t);
data.data = &val;
data.ulen = sizeof(int);
F_SET(&data, DB_DBT_USERMEM);
if ((ret = dbp->get(dbp, NULL, &key, &data, 0)) == 0) {
DB_ASSERT(data.size == sizeof(int));
memcpy(&val, data.data, sizeof(int));
} else if (ret != DB_NOTFOUND)
return (ret);
data.size = sizeof(int);
val += i;
return (dbp->put(dbp, NULL, &key, &data, 0));
}
/*
* __db_vrfy_pgset_next --
* Given a cursor open in a pgset database, get the next page in the
* set.
*
* PUBLIC: int __db_vrfy_pgset_next __P((DBC *, db_pgno_t *));
*/
int
__db_vrfy_pgset_next(dbc, pgnop)
DBC *dbc;
db_pgno_t *pgnop;
{
DBT key, data;
db_pgno_t pgno;
int ret;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
/* We don't care about the data, just the keys. */
F_SET(&data, DB_DBT_USERMEM | DB_DBT_PARTIAL);
F_SET(&key, DB_DBT_USERMEM);
key.data = &pgno;
key.ulen = sizeof(db_pgno_t);
if ((ret = dbc->c_get(dbc, &key, &data, DB_NEXT)) != 0)
return (ret);
DB_ASSERT(key.size == sizeof(db_pgno_t));
*pgnop = pgno;
return (0);
}
/*
* __db_vrfy_childcursor --
* Create a cursor to walk the child list with. Returns with a nonzero
* final argument if the specified page has no children.
*
* PUBLIC: int __db_vrfy_childcursor __P((VRFY_DBINFO *, DBC **));
*/
int
__db_vrfy_childcursor(vdp, dbcp)
VRFY_DBINFO *vdp;
DBC **dbcp;
{
DB *cdbp;
DBC *dbc;
int ret;
cdbp = vdp->cdbp;
if ((ret = cdbp->cursor(cdbp, NULL, &dbc, 0)) == 0)
*dbcp = dbc;
return (ret);
}
/*
* __db_vrfy_childput --
* Add a child structure to the set for a given page.
*
* PUBLIC: int __db_vrfy_childput
* PUBLIC: __P((VRFY_DBINFO *, db_pgno_t, VRFY_CHILDINFO *));
*/
int
__db_vrfy_childput(vdp, pgno, cip)
VRFY_DBINFO *vdp;
db_pgno_t pgno;
VRFY_CHILDINFO *cip;
{
DB *cdbp;
DBC *cc;
DBT key, data;
VRFY_CHILDINFO *oldcip;
int ret;
cdbp = vdp->cdbp;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
key.data = &pgno;
key.size = sizeof(db_pgno_t);
/*
* We want to avoid adding multiple entries for a single child page;
* we only need to verify each child once, even if a child (such
* as an overflow key) is multiply referenced.
*
* However, we also need to make sure that when walking the list
* of children, we encounter them in the order they're referenced
* on a page. (This permits us, for example, to verify the
* prev_pgno/next_pgno chain of Btree leaf pages.)
*
* Check the child database to make sure that this page isn't
* already a child of the specified page number. If it's not,
* put it at the end of the duplicate set.
*/
if ((ret = __db_vrfy_childcursor(vdp, &cc)) != 0)
return (ret);
for (ret = __db_vrfy_ccset(cc, pgno, &oldcip); ret == 0;
ret = __db_vrfy_ccnext(cc, &oldcip))
if (oldcip->pgno == cip->pgno) {
/*
* Found a matching child. Return without
* putting it again.
*/
if ((ret = __db_vrfy_ccclose(cc)) != 0)
return (ret);
return (0);
}
if (ret != DB_NOTFOUND) {
(void)__db_vrfy_ccclose(cc);
return (ret);
}
if ((ret = __db_vrfy_ccclose(cc)) != 0)
return (ret);
data.data = cip;
data.size = sizeof(VRFY_CHILDINFO);
return (cdbp->put(cdbp, NULL, &key, &data, 0));
}
/*
* __db_vrfy_ccset --
* Sets a cursor created with __db_vrfy_childcursor to the first
* child of the given pgno, and returns it in the third arg.
*
* PUBLIC: int __db_vrfy_ccset __P((DBC *, db_pgno_t, VRFY_CHILDINFO **));
*/
int
__db_vrfy_ccset(dbc, pgno, cipp)
DBC *dbc;
db_pgno_t pgno;
VRFY_CHILDINFO **cipp;
{
DBT key, data;
int ret;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
key.data = &pgno;
key.size = sizeof(db_pgno_t);
if ((ret = dbc->c_get(dbc, &key, &data, DB_SET)) != 0)
return (ret);
DB_ASSERT(data.size == sizeof(VRFY_CHILDINFO));
*cipp = (VRFY_CHILDINFO *)data.data;
return (0);
}
/*
* __db_vrfy_ccnext --
* Gets the next child of the given cursor created with
* __db_vrfy_childcursor, and returns it in the memory provided in the
* second arg.
*
* PUBLIC: int __db_vrfy_ccnext __P((DBC *, VRFY_CHILDINFO **));
*/
int
__db_vrfy_ccnext(dbc, cipp)
DBC *dbc;
VRFY_CHILDINFO **cipp;
{
DBT key, data;
int ret;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
if ((ret = dbc->c_get(dbc, &key, &data, DB_NEXT_DUP)) != 0)
return (ret);
DB_ASSERT(data.size == sizeof(VRFY_CHILDINFO));
*cipp = (VRFY_CHILDINFO *)data.data;
return (0);
}
/*
* __db_vrfy_ccclose --
* Closes the cursor created with __db_vrfy_childcursor.
*
* This doesn't actually do anything interesting now, but it's
* not inconceivable that we might change the internal database usage
* and keep the interfaces the same, and a function call here or there
* seldom hurts anyone.
*
* PUBLIC: int __db_vrfy_ccclose __P((DBC *));
*/
int
__db_vrfy_ccclose(dbc)
DBC *dbc;
{
return (dbc->c_close(dbc));
}
/*
* __db_vrfy_pageinfo_create --
* Constructor for VRFY_PAGEINFO; allocates and initializes.
*/
static int
__db_vrfy_pageinfo_create(dbenv, pgipp)
DB_ENV *dbenv;
VRFY_PAGEINFO **pgipp;
{
VRFY_PAGEINFO *pgip;
int ret;
/*
* pageinfo structs are sometimes allocated here and sometimes
* allocated by fetching them from a database with DB_DBT_MALLOC.
* There's no easy way for the destructor to tell which was
* used, and so we always allocate with __os_umalloc so we can free
* with __os_ufree.
*/
if ((ret = __os_umalloc(dbenv,
sizeof(VRFY_PAGEINFO), (void **)&pgip)) != 0)
return (ret);
memset(pgip, 0, sizeof(VRFY_PAGEINFO));
DB_ASSERT(pgip->pi_refcount == 0);
*pgipp = pgip;
return (0);
}
/*
* __db_salvage_init --
* Set up salvager database.
*
* PUBLIC: int __db_salvage_init __P((VRFY_DBINFO *));
*/
int
__db_salvage_init(vdp)
VRFY_DBINFO *vdp;
{
DB *dbp;
int ret;
if ((ret = db_create(&dbp, NULL, 0)) != 0)
return (ret);
if ((ret = dbp->set_pagesize(dbp, 1024)) != 0)
goto err;
if ((ret = dbp->open(dbp,
NULL, NULL, NULL, DB_BTREE, DB_CREATE, 0)) != 0)
goto err;
vdp->salvage_pages = dbp;
return (0);
err: (void)dbp->close(dbp, 0);
return (ret);
}
/*
* __db_salvage_destroy --
* Close salvager database.
* PUBLIC: void __db_salvage_destroy __P((VRFY_DBINFO *));
*/
void
__db_salvage_destroy(vdp)
VRFY_DBINFO *vdp;
{
(void)vdp->salvage_pages->close(vdp->salvage_pages, 0);
}
/*
* __db_salvage_getnext --
* Get the next (first) unprinted page in the database of pages we need to
* print still. Delete entries for any already-printed pages we encounter
* in this search, as well as the page we're returning.
*
* PUBLIC: int __db_salvage_getnext
* PUBLIC: __P((VRFY_DBINFO *, db_pgno_t *, u_int32_t *));
*/
int
__db_salvage_getnext(vdp, pgnop, pgtypep)
VRFY_DBINFO *vdp;
db_pgno_t *pgnop;
u_int32_t *pgtypep;
{
DB *dbp;
DBC *dbc;
DBT key, data;
int ret;
u_int32_t pgtype;
dbp = vdp->salvage_pages;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
if ((ret = dbp->cursor(dbp, NULL, &dbc, 0)) != 0)
return (ret);
while ((ret = dbc->c_get(dbc, &key, &data, DB_NEXT)) == 0) {
DB_ASSERT(data.size == sizeof(u_int32_t));
memcpy(&pgtype, data.data, sizeof(pgtype));
if ((ret = dbc->c_del(dbc, 0)) != 0)
goto err;
if (pgtype != SALVAGE_IGNORE)
goto found;
}
/* No more entries--ret probably equals DB_NOTFOUND. */
if (0) {
found: DB_ASSERT(key.size == sizeof(db_pgno_t));
DB_ASSERT(data.size == sizeof(u_int32_t));
*pgnop = *(db_pgno_t *)key.data;
*pgtypep = *(u_int32_t *)data.data;
}
err: (void)dbc->c_close(dbc);
return (ret);
}
/*
* __db_salvage_isdone --
* Return whether or not the given pgno is already marked
* SALVAGE_IGNORE (meaning that we don't need to print it again).
*
* Returns DB_KEYEXIST if it is marked, 0 if not, or another error on
* error.
*
* PUBLIC: int __db_salvage_isdone __P((VRFY_DBINFO *, db_pgno_t));
*/
int
__db_salvage_isdone(vdp, pgno)
VRFY_DBINFO *vdp;
db_pgno_t pgno;
{
DBT key, data;
DB *dbp;
int ret;
u_int32_t currtype;
dbp = vdp->salvage_pages;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
currtype = SALVAGE_INVALID;
data.data = &currtype;
data.ulen = sizeof(u_int32_t);
data.flags = DB_DBT_USERMEM;
key.data = &pgno;
key.size = sizeof(db_pgno_t);
/*
* Put an entry for this page, with pgno as key and type as data,
* unless it's already there and is marked done.
* If it's there and is marked anything else, that's fine--we
* want to mark it done.
*/
ret = dbp->get(dbp, NULL, &key, &data, 0);
if (ret == 0) {
/*
* The key's already here. Check and see if it's already
* marked done. If it is, return DB_KEYEXIST. If it's not,
* return 0.
*/
if (currtype == SALVAGE_IGNORE)
return (DB_KEYEXIST);
else
return (0);
} else if (ret != DB_NOTFOUND)
return (ret);
/* The pgno is not yet marked anything; return 0. */
return (0);
}
/*
* __db_salvage_markdone --
* Mark as done a given page.
*
* PUBLIC: int __db_salvage_markdone __P((VRFY_DBINFO *, db_pgno_t));
*/
int
__db_salvage_markdone(vdp, pgno)
VRFY_DBINFO *vdp;
db_pgno_t pgno;
{
DBT key, data;
DB *dbp;
int pgtype, ret;
u_int32_t currtype;
pgtype = SALVAGE_IGNORE;
dbp = vdp->salvage_pages;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
currtype = SALVAGE_INVALID;
data.data = &currtype;
data.ulen = sizeof(u_int32_t);
data.flags = DB_DBT_USERMEM;
key.data = &pgno;
key.size = sizeof(db_pgno_t);
/*
* Put an entry for this page, with pgno as key and type as data,
* unless it's already there and is marked done.
* If it's there and is marked anything else, that's fine--we
* want to mark it done, but db_salvage_isdone only lets
* us know if it's marked IGNORE.
*
* We don't want to return DB_KEYEXIST, though; this will
* likely get passed up all the way and make no sense to the
* application. Instead, use DB_VERIFY_BAD to indicate that
* we've seen this page already--it probably indicates a
* multiply-linked page.
*/
if ((ret = __db_salvage_isdone(vdp, pgno)) != 0)
return (ret == DB_KEYEXIST ? DB_VERIFY_BAD : ret);
data.size = sizeof(u_int32_t);
data.data = &pgtype;
return (dbp->put(dbp, NULL, &key, &data, 0));
}
/*
* __db_salvage_markneeded --
* If it has not yet been printed, make note of the fact that a page
* must be dealt with later.
*
* PUBLIC: int __db_salvage_markneeded
* PUBLIC: __P((VRFY_DBINFO *, db_pgno_t, u_int32_t));
*/
int
__db_salvage_markneeded(vdp, pgno, pgtype)
VRFY_DBINFO *vdp;
db_pgno_t pgno;
u_int32_t pgtype;
{
DB *dbp;
DBT key, data;
int ret;
dbp = vdp->salvage_pages;
memset(&key, 0, sizeof(DBT));
memset(&data, 0, sizeof(DBT));
key.data = &pgno;
key.size = sizeof(db_pgno_t);
data.data = &pgtype;
data.size = sizeof(u_int32_t);
/*
* Put an entry for this page, with pgno as key and type as data,
* unless it's already there, in which case it's presumably
* already been marked done.
*/
ret = dbp->put(dbp, NULL, &key, &data, DB_NOOVERWRITE);
return (ret == DB_KEYEXIST ? 0 : ret);
}