mirror of
https://github.com/MariaDB/server.git
synced 2025-08-26 01:44:06 +03:00
storage/bdb/LICENSE: Import db-4.3.28 storage/bdb/btree/bt_compare.c: Import db-4.3.28 storage/bdb/btree/bt_conv.c: Import db-4.3.28 storage/bdb/btree/bt_curadj.c: Import db-4.3.28 storage/bdb/btree/bt_cursor.c: Import db-4.3.28 storage/bdb/btree/bt_delete.c: Import db-4.3.28 storage/bdb/btree/bt_method.c: Import db-4.3.28 storage/bdb/btree/bt_open.c: Import db-4.3.28 storage/bdb/btree/bt_put.c: Import db-4.3.28 storage/bdb/btree/bt_rec.c: Import db-4.3.28 storage/bdb/btree/bt_reclaim.c: Import db-4.3.28 storage/bdb/btree/bt_recno.c: Import db-4.3.28 storage/bdb/btree/bt_rsearch.c: Import db-4.3.28 storage/bdb/btree/bt_search.c: Import db-4.3.28 storage/bdb/btree/bt_split.c: Import db-4.3.28 storage/bdb/btree/bt_stat.c: Import db-4.3.28 storage/bdb/btree/bt_upgrade.c: Import db-4.3.28 storage/bdb/btree/bt_verify.c: Import db-4.3.28 storage/bdb/btree/btree.src: Import db-4.3.28 storage/bdb/build_win32/Berkeley_DB.dsw: Import db-4.3.28 storage/bdb/build_win32/app_dsp.src: Import db-4.3.28 storage/bdb/build_win32/db_test.src: Import db-4.3.28 storage/bdb/build_win32/dbkill.cpp: Import db-4.3.28 storage/bdb/build_win32/dynamic_dsp.src: Import db-4.3.28 storage/bdb/build_win32/java_dsp.src: Import db-4.3.28 storage/bdb/build_win32/libdb_tcl.def: Import db-4.3.28 storage/bdb/build_win32/libdbrc.src: Import db-4.3.28 storage/bdb/build_win32/static_dsp.src: Import db-4.3.28 storage/bdb/build_win32/tcl_dsp.src: Import db-4.3.28 storage/bdb/clib/getcwd.c: Import db-4.3.28 storage/bdb/clib/getopt.c: Import db-4.3.28 storage/bdb/clib/memcmp.c: Import db-4.3.28 storage/bdb/clib/memmove.c: Import db-4.3.28 storage/bdb/clib/raise.c: Import db-4.3.28 storage/bdb/clib/snprintf.c: Import db-4.3.28 storage/bdb/clib/strcasecmp.c: Import db-4.3.28 storage/bdb/clib/strdup.c: Import db-4.3.28 storage/bdb/clib/strerror.c: Import db-4.3.28 storage/bdb/common/db_byteorder.c: Import db-4.3.28 storage/bdb/common/db_err.c: Import db-4.3.28 storage/bdb/common/db_getlong.c: Import db-4.3.28 storage/bdb/common/db_idspace.c: Import db-4.3.28 storage/bdb/common/db_log2.c: Import db-4.3.28 storage/bdb/common/util_arg.c: Import db-4.3.28 storage/bdb/common/util_cache.c: Import db-4.3.28 storage/bdb/common/util_log.c: Import db-4.3.28 storage/bdb/common/util_sig.c: Import db-4.3.28 storage/bdb/cxx/cxx_db.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_dbc.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_dbt.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_env.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_except.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_lock.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_logc.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_mpool.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_txn.cpp: Import db-4.3.28 storage/bdb/db/crdel.src: Import db-4.3.28 storage/bdb/db/crdel_rec.c: Import db-4.3.28 storage/bdb/db/db.c: Import db-4.3.28 storage/bdb/db/db.src: Import db-4.3.28 storage/bdb/db/db_am.c: Import db-4.3.28 storage/bdb/db/db_cam.c: Import db-4.3.28 storage/bdb/db/db_conv.c: Import db-4.3.28 storage/bdb/db/db_dispatch.c: Import db-4.3.28 storage/bdb/db/db_dup.c: Import db-4.3.28 storage/bdb/db/db_iface.c: Import db-4.3.28 storage/bdb/db/db_join.c: Import db-4.3.28 storage/bdb/db/db_meta.c: Import db-4.3.28 storage/bdb/db/db_method.c: Import db-4.3.28 storage/bdb/db/db_open.c: Import db-4.3.28 storage/bdb/db/db_overflow.c: Import db-4.3.28 storage/bdb/db/db_pr.c: Import db-4.3.28 storage/bdb/db/db_rec.c: Import db-4.3.28 storage/bdb/db/db_reclaim.c: Import db-4.3.28 storage/bdb/db/db_remove.c: Import db-4.3.28 storage/bdb/db/db_rename.c: Import db-4.3.28 storage/bdb/db/db_ret.c: Import db-4.3.28 storage/bdb/db/db_truncate.c: Import db-4.3.28 storage/bdb/db/db_upg.c: Import db-4.3.28 storage/bdb/db/db_upg_opd.c: Import db-4.3.28 storage/bdb/db/db_vrfy.c: Import db-4.3.28 storage/bdb/db/db_vrfyutil.c: Import db-4.3.28 storage/bdb/db185/db185.c: Import db-4.3.28 storage/bdb/db185/db185_int.in: Import db-4.3.28 storage/bdb/db_archive/db_archive.c: Import db-4.3.28 storage/bdb/db_checkpoint/db_checkpoint.c: Import db-4.3.28 storage/bdb/db_deadlock/db_deadlock.c: Import db-4.3.28 storage/bdb/db_dump/db_dump.c: Import db-4.3.28 storage/bdb/db_dump185/db_dump185.c: Import db-4.3.28 storage/bdb/db_load/db_load.c: Import db-4.3.28 storage/bdb/db_printlog/README: Import db-4.3.28 storage/bdb/db_printlog/db_printlog.c: Import db-4.3.28 storage/bdb/db_printlog/dbname.awk: Import db-4.3.28 storage/bdb/db_printlog/rectype.awk: Import db-4.3.28 storage/bdb/db_printlog/status.awk: Import db-4.3.28 storage/bdb/db_recover/db_recover.c: Import db-4.3.28 storage/bdb/db_stat/db_stat.c: Import db-4.3.28 storage/bdb/db_upgrade/db_upgrade.c: Import db-4.3.28 storage/bdb/db_verify/db_verify.c: Import db-4.3.28 storage/bdb/dbinc/btree.h: Import db-4.3.28 storage/bdb/dbinc/crypto.h: Import db-4.3.28 storage/bdb/dbinc/cxx_int.h: Import db-4.3.28 storage/bdb/dbinc/db.in: Import db-4.3.28 storage/bdb/dbinc/db_185.in: Import db-4.3.28 storage/bdb/dbinc/db_am.h: Import db-4.3.28 storage/bdb/dbinc/db_cxx.in: Import db-4.3.28 storage/bdb/dbinc/db_dispatch.h: Import db-4.3.28 storage/bdb/dbinc/db_int.in: Import db-4.3.28 storage/bdb/dbinc/db_join.h: Import db-4.3.28 storage/bdb/dbinc/db_page.h: Import db-4.3.28 storage/bdb/dbinc/db_server_int.h: Import db-4.3.28 storage/bdb/dbinc/db_shash.h: Import db-4.3.28 storage/bdb/dbinc/db_swap.h: Import db-4.3.28 storage/bdb/dbinc/db_upgrade.h: Import db-4.3.28 storage/bdb/dbinc/db_verify.h: Import db-4.3.28 storage/bdb/dbinc/debug.h: Import db-4.3.28 storage/bdb/dbinc/fop.h: Import db-4.3.28 storage/bdb/dbinc/globals.h: Import db-4.3.28 storage/bdb/dbinc/hash.h: Import db-4.3.28 storage/bdb/dbinc/hmac.h: Import db-4.3.28 storage/bdb/dbinc/lock.h: Import db-4.3.28 storage/bdb/dbinc/log.h: Import db-4.3.28 storage/bdb/dbinc/mp.h: Import db-4.3.28 storage/bdb/dbinc/mutex.h: Import db-4.3.28 storage/bdb/dbinc/os.h: Import db-4.3.28 storage/bdb/dbinc/qam.h: Import db-4.3.28 storage/bdb/dbinc/queue.h: Import db-4.3.28 storage/bdb/dbinc/region.h: Import db-4.3.28 storage/bdb/dbinc/rep.h: Import db-4.3.28 storage/bdb/dbinc/shqueue.h: Import db-4.3.28 storage/bdb/dbinc/tcl_db.h: Import db-4.3.28 storage/bdb/dbinc/txn.h: Import db-4.3.28 storage/bdb/dbinc/xa.h: Import db-4.3.28 storage/bdb/dbm/dbm.c: Import db-4.3.28 storage/bdb/dbreg/dbreg.c: Import db-4.3.28 storage/bdb/dbreg/dbreg.src: Import db-4.3.28 storage/bdb/dbreg/dbreg_rec.c: Import db-4.3.28 storage/bdb/dbreg/dbreg_util.c: Import db-4.3.28 storage/bdb/dist/Makefile.in: Import db-4.3.28 storage/bdb/dist/RELEASE: Import db-4.3.28 storage/bdb/dist/aclocal/config.ac: Import db-4.3.28 storage/bdb/dist/aclocal/libtool.ac: Import db-4.3.28 storage/bdb/dist/aclocal/mutex.ac: Import db-4.3.28 storage/bdb/dist/aclocal/options.ac: Import db-4.3.28 storage/bdb/dist/aclocal/programs.ac: Import db-4.3.28 storage/bdb/dist/aclocal/sosuffix.ac: Import db-4.3.28 storage/bdb/dist/aclocal/tcl.ac: Import db-4.3.28 storage/bdb/dist/aclocal/types.ac: Import db-4.3.28 storage/bdb/dist/aclocal_java/ac_jni_include_dirs.ac: Import db-4.3.28 storage/bdb/dist/aclocal_java/ac_prog_java.ac: Import db-4.3.28 storage/bdb/dist/buildrel: Import db-4.3.28 storage/bdb/dist/configure.ac: Import db-4.3.28 storage/bdb/dist/gen_inc.awk: Import db-4.3.28 storage/bdb/dist/gen_rec.awk: Import db-4.3.28 storage/bdb/dist/gen_rpc.awk: Import db-4.3.28 storage/bdb/dist/ltmain.sh: Import db-4.3.28 storage/bdb/dist/pubdef.in: Import db-4.3.28 storage/bdb/dist/srcfiles.in: Import db-4.3.28 storage/bdb/dist/vx_2.0/BerkeleyDB.wpj: Import db-4.3.28 storage/bdb/dist/vx_2.0/wpj.in: Import db-4.3.28 storage/bdb/dist/vx_config.in: Import db-4.3.28 storage/bdb/dist/vx_setup/CONFIG.in: Import db-4.3.28 storage/bdb/dist/vx_setup/LICENSE.TXT: Import db-4.3.28 storage/bdb/dist/vx_setup/vx_allfile.in: Import db-4.3.28 storage/bdb/dist/vx_setup/vx_demofile.in: Import db-4.3.28 storage/bdb/dist/win_config.in: Import db-4.3.28 storage/bdb/dist/win_exports.in: Import db-4.3.28 storage/bdb/env/db_salloc.c: Import db-4.3.28 storage/bdb/env/db_shash.c: Import db-4.3.28 storage/bdb/env/env_file.c: Import db-4.3.28 storage/bdb/env/env_method.c: Import db-4.3.28 storage/bdb/env/env_open.c: Import db-4.3.28 storage/bdb/env/env_recover.c: Import db-4.3.28 storage/bdb/env/env_region.c: Import db-4.3.28 storage/bdb/fileops/fileops.src: Import db-4.3.28 storage/bdb/fileops/fop_basic.c: Import db-4.3.28 storage/bdb/fileops/fop_rec.c: Import db-4.3.28 storage/bdb/fileops/fop_util.c: Import db-4.3.28 storage/bdb/hash/hash.c: Import db-4.3.28 storage/bdb/hash/hash.src: Import db-4.3.28 storage/bdb/hash/hash_conv.c: Import db-4.3.28 storage/bdb/hash/hash_dup.c: Import db-4.3.28 storage/bdb/hash/hash_func.c: Import db-4.3.28 storage/bdb/hash/hash_meta.c: Import db-4.3.28 storage/bdb/hash/hash_method.c: Import db-4.3.28 storage/bdb/hash/hash_open.c: Import db-4.3.28 storage/bdb/hash/hash_page.c: Import db-4.3.28 storage/bdb/hash/hash_rec.c: Import db-4.3.28 storage/bdb/hash/hash_reclaim.c: Import db-4.3.28 storage/bdb/hash/hash_stat.c: Import db-4.3.28 storage/bdb/hash/hash_upgrade.c: Import db-4.3.28 storage/bdb/hash/hash_verify.c: Import db-4.3.28 storage/bdb/hmac/hmac.c: Import db-4.3.28 storage/bdb/hmac/sha1.c: Import db-4.3.28 storage/bdb/hsearch/hsearch.c: Import db-4.3.28 storage/bdb/lock/lock.c: Import db-4.3.28 storage/bdb/lock/lock_deadlock.c: Import db-4.3.28 storage/bdb/lock/lock_method.c: Import db-4.3.28 storage/bdb/lock/lock_region.c: Import db-4.3.28 storage/bdb/lock/lock_stat.c: Import db-4.3.28 storage/bdb/lock/lock_util.c: Import db-4.3.28 storage/bdb/log/log.c: Import db-4.3.28 storage/bdb/log/log_archive.c: Import db-4.3.28 storage/bdb/log/log_compare.c: Import db-4.3.28 storage/bdb/log/log_get.c: Import db-4.3.28 storage/bdb/log/log_method.c: Import db-4.3.28 storage/bdb/log/log_put.c: Import db-4.3.28 storage/bdb/mp/mp_alloc.c: Import db-4.3.28 storage/bdb/mp/mp_bh.c: Import db-4.3.28 storage/bdb/mp/mp_fget.c: Import db-4.3.28 storage/bdb/mp/mp_fopen.c: Import db-4.3.28 storage/bdb/mp/mp_fput.c: Import db-4.3.28 storage/bdb/mp/mp_fset.c: Import db-4.3.28 storage/bdb/mp/mp_method.c: Import db-4.3.28 storage/bdb/mp/mp_region.c: Import db-4.3.28 storage/bdb/mp/mp_register.c: Import db-4.3.28 storage/bdb/mp/mp_stat.c: Import db-4.3.28 storage/bdb/mp/mp_sync.c: Import db-4.3.28 storage/bdb/mp/mp_trickle.c: Import db-4.3.28 storage/bdb/mutex/mut_fcntl.c: Import db-4.3.28 storage/bdb/mutex/mut_pthread.c: Import db-4.3.28 storage/bdb/mutex/mut_tas.c: Import db-4.3.28 storage/bdb/mutex/mut_win32.c: Import db-4.3.28 storage/bdb/mutex/mutex.c: Import db-4.3.28 storage/bdb/mutex/tm.c: Import db-4.3.28 storage/bdb/mutex/uts4_cc.s: Import db-4.3.28 storage/bdb/os/os_abs.c: Import db-4.3.28 storage/bdb/os/os_alloc.c: Import db-4.3.28 storage/bdb/os/os_clock.c: Import db-4.3.28 storage/bdb/os/os_config.c: Import db-4.3.28 storage/bdb/os/os_dir.c: Import db-4.3.28 storage/bdb/os/os_errno.c: Import db-4.3.28 storage/bdb/os/os_fid.c: Import db-4.3.28 storage/bdb/os/os_fsync.c: Import db-4.3.28 storage/bdb/os/os_handle.c: Import db-4.3.28 storage/bdb/os/os_id.c: Import db-4.3.28 storage/bdb/os/os_map.c: Import db-4.3.28 storage/bdb/os/os_method.c: Import db-4.3.28 storage/bdb/os/os_oflags.c: Import db-4.3.28 storage/bdb/os/os_open.c: Import db-4.3.28 storage/bdb/os/os_region.c: Import db-4.3.28 storage/bdb/os/os_rename.c: Import db-4.3.28 storage/bdb/os/os_root.c: Import db-4.3.28 storage/bdb/os/os_rpath.c: Import db-4.3.28 storage/bdb/os/os_rw.c: Import db-4.3.28 storage/bdb/os/os_seek.c: Import db-4.3.28 storage/bdb/os/os_sleep.c: Import db-4.3.28 storage/bdb/os/os_spin.c: Import db-4.3.28 storage/bdb/os/os_stat.c: Import db-4.3.28 storage/bdb/os/os_tmpdir.c: Import db-4.3.28 storage/bdb/os/os_unlink.c: Import db-4.3.28 storage/bdb/os_vxworks/os_vx_abs.c: Import db-4.3.28 storage/bdb/os_vxworks/os_vx_config.c: Import db-4.3.28 storage/bdb/os_vxworks/os_vx_map.c: Import db-4.3.28 storage/bdb/os_win32/os_abs.c: Import db-4.3.28 storage/bdb/os_win32/os_clock.c: Import db-4.3.28 storage/bdb/os_win32/os_config.c: Import db-4.3.28 storage/bdb/os_win32/os_dir.c: Import db-4.3.28 storage/bdb/os_win32/os_errno.c: Import db-4.3.28 storage/bdb/os_win32/os_fid.c: Import db-4.3.28 storage/bdb/os_win32/os_fsync.c: Import db-4.3.28 storage/bdb/os_win32/os_handle.c: Import db-4.3.28 storage/bdb/os_win32/os_map.c: Import db-4.3.28 storage/bdb/os_win32/os_open.c: Import db-4.3.28 storage/bdb/os_win32/os_rename.c: Import db-4.3.28 storage/bdb/os_win32/os_rw.c: Import db-4.3.28 storage/bdb/os_win32/os_seek.c: Import db-4.3.28 storage/bdb/os_win32/os_sleep.c: Import db-4.3.28 storage/bdb/os_win32/os_spin.c: Import db-4.3.28 storage/bdb/os_win32/os_stat.c: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/BerkeleyDB.pm: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/BerkeleyDB.pod.P: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/BerkeleyDB.pod: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/BerkeleyDB.xs: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/Changes: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/MANIFEST: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/Makefile.PL: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/README: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/config.in: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/constants.h: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/mkconsts: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/patches/5.004: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/ppport.h: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/scan: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/btree.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/destroy.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/env.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/filter.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/hash.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/join.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/mldbm.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/queue.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/recno.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/strict.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/subdb.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/txn.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/util.pm: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/typemap: Import db-4.3.28 storage/bdb/perl/DB_File/Changes: Import db-4.3.28 storage/bdb/perl/DB_File/DB_File.pm: Import db-4.3.28 storage/bdb/perl/DB_File/DB_File.xs: Import db-4.3.28 storage/bdb/perl/DB_File/MANIFEST: Import db-4.3.28 storage/bdb/perl/DB_File/Makefile.PL: Import db-4.3.28 storage/bdb/perl/DB_File/README: Import db-4.3.28 storage/bdb/perl/DB_File/dbinfo: Import db-4.3.28 storage/bdb/perl/DB_File/patches/5.004: Import db-4.3.28 storage/bdb/perl/DB_File/ppport.h: Import db-4.3.28 storage/bdb/perl/DB_File/t/db-btree.t: Import db-4.3.28 storage/bdb/perl/DB_File/t/db-hash.t: Import db-4.3.28 storage/bdb/perl/DB_File/t/db-recno.t: Import db-4.3.28 storage/bdb/perl/DB_File/typemap: Import db-4.3.28 storage/bdb/qam/qam.c: Import db-4.3.28 storage/bdb/qam/qam.src: Import db-4.3.28 storage/bdb/qam/qam_conv.c: Import db-4.3.28 storage/bdb/qam/qam_files.c: Import db-4.3.28 storage/bdb/qam/qam_method.c: Import db-4.3.28 storage/bdb/qam/qam_open.c: Import db-4.3.28 storage/bdb/qam/qam_rec.c: Import db-4.3.28 storage/bdb/qam/qam_stat.c: Import db-4.3.28 storage/bdb/qam/qam_upgrade.c: Import db-4.3.28 storage/bdb/qam/qam_verify.c: Import db-4.3.28 storage/bdb/rep/rep_method.c: Import db-4.3.28 storage/bdb/rep/rep_record.c: Import db-4.3.28 storage/bdb/rep/rep_region.c: Import db-4.3.28 storage/bdb/rep/rep_util.c: Import db-4.3.28 storage/bdb/rpc_client/client.c: Import db-4.3.28 storage/bdb/rpc_client/gen_client_ret.c: Import db-4.3.28 storage/bdb/rpc_server/c/db_server_util.c: Import db-4.3.28 storage/bdb/rpc_server/cxx/db_server_cxxproc.cpp: Import db-4.3.28 storage/bdb/rpc_server/cxx/db_server_cxxutil.cpp: Import db-4.3.28 storage/bdb/rpc_server/java/FreeList.java: Import db-4.3.28 storage/bdb/rpc_server/java/LocalIterator.java: Import db-4.3.28 storage/bdb/rpc_server/java/README: Import db-4.3.28 storage/bdb/rpc_server/java/RpcDb.java: Import db-4.3.28 storage/bdb/rpc_server/java/RpcDbEnv.java: Import db-4.3.28 storage/bdb/rpc_server/java/RpcDbTxn.java: Import db-4.3.28 storage/bdb/rpc_server/java/RpcDbc.java: Import db-4.3.28 storage/bdb/rpc_server/java/Timer.java: Import db-4.3.28 storage/bdb/rpc_server/java/gen/__db_open_reply.java: Import db-4.3.28 storage/bdb/rpc_server/java/gen/__db_stat_msg.java: Import db-4.3.28 storage/bdb/rpc_server/java/gen/db_server.java: Import db-4.3.28 storage/bdb/rpc_server/java/s_jrpcgen: Import db-4.3.28 storage/bdb/rpc_server/rpc.src: Import db-4.3.28 storage/bdb/tcl/docs/db.html: Import db-4.3.28 storage/bdb/tcl/docs/env.html: Import db-4.3.28 storage/bdb/tcl/docs/historic.html: Import db-4.3.28 storage/bdb/tcl/docs/index.html: Import db-4.3.28 storage/bdb/tcl/docs/library.html: Import db-4.3.28 storage/bdb/tcl/docs/lock.html: Import db-4.3.28 storage/bdb/tcl/docs/log.html: Import db-4.3.28 storage/bdb/tcl/docs/mpool.html: Import db-4.3.28 storage/bdb/tcl/docs/rep.html: Import db-4.3.28 storage/bdb/tcl/docs/test.html: Import db-4.3.28 storage/bdb/tcl/docs/txn.html: Import db-4.3.28 storage/bdb/tcl/tcl_compat.c: Import db-4.3.28 storage/bdb/tcl/tcl_db.c: Import db-4.3.28 storage/bdb/tcl/tcl_db_pkg.c: Import db-4.3.28 storage/bdb/tcl/tcl_dbcursor.c: Import db-4.3.28 storage/bdb/tcl/tcl_env.c: Import db-4.3.28 storage/bdb/tcl/tcl_internal.c: Import db-4.3.28 storage/bdb/tcl/tcl_lock.c: Import db-4.3.28 storage/bdb/tcl/tcl_log.c: Import db-4.3.28 storage/bdb/tcl/tcl_mp.c: Import db-4.3.28 storage/bdb/tcl/tcl_rep.c: Import db-4.3.28 storage/bdb/tcl/tcl_txn.c: Import db-4.3.28 storage/bdb/tcl/tcl_util.c: Import db-4.3.28 storage/bdb/test/archive.tcl: Import db-4.3.28 storage/bdb/test/bigfile001.tcl: Import db-4.3.28 storage/bdb/test/bigfile002.tcl: Import db-4.3.28 storage/bdb/test/byteorder.tcl: Import db-4.3.28 storage/bdb/test/conscript.tcl: Import db-4.3.28 storage/bdb/test/dbm.tcl: Import db-4.3.28 storage/bdb/test/dbscript.tcl: Import db-4.3.28 storage/bdb/test/ddoyscript.tcl: Import db-4.3.28 storage/bdb/test/ddscript.tcl: Import db-4.3.28 storage/bdb/test/dead001.tcl: Import db-4.3.28 storage/bdb/test/dead002.tcl: Import db-4.3.28 storage/bdb/test/dead003.tcl: Import db-4.3.28 storage/bdb/test/dead004.tcl: Import db-4.3.28 storage/bdb/test/dead005.tcl: Import db-4.3.28 storage/bdb/test/dead006.tcl: Import db-4.3.28 storage/bdb/test/dead007.tcl: Import db-4.3.28 storage/bdb/test/env001.tcl: Import db-4.3.28 storage/bdb/test/env002.tcl: Import db-4.3.28 storage/bdb/test/env003.tcl: Import db-4.3.28 storage/bdb/test/env004.tcl: Import db-4.3.28 storage/bdb/test/env005.tcl: Import db-4.3.28 storage/bdb/test/env006.tcl: Import db-4.3.28 storage/bdb/test/env007.tcl: Import db-4.3.28 storage/bdb/test/env008.tcl: Import db-4.3.28 storage/bdb/test/env009.tcl: Import db-4.3.28 storage/bdb/test/env010.tcl: Import db-4.3.28 storage/bdb/test/env011.tcl: Import db-4.3.28 storage/bdb/test/hsearch.tcl: Import db-4.3.28 storage/bdb/test/join.tcl: Import db-4.3.28 storage/bdb/test/lock001.tcl: Import db-4.3.28 storage/bdb/test/lock002.tcl: Import db-4.3.28 storage/bdb/test/lock003.tcl: Import db-4.3.28 storage/bdb/test/lock004.tcl: Import db-4.3.28 storage/bdb/test/lock005.tcl: Import db-4.3.28 storage/bdb/test/lockscript.tcl: Import db-4.3.28 storage/bdb/test/log001.tcl: Import db-4.3.28 storage/bdb/test/log002.tcl: Import db-4.3.28 storage/bdb/test/log003.tcl: Import db-4.3.28 storage/bdb/test/log004.tcl: Import db-4.3.28 storage/bdb/test/log005.tcl: Import db-4.3.28 storage/bdb/test/logtrack.tcl: Import db-4.3.28 storage/bdb/test/mdbscript.tcl: Import db-4.3.28 storage/bdb/test/memp001.tcl: Import db-4.3.28 storage/bdb/test/memp002.tcl: Import db-4.3.28 storage/bdb/test/memp003.tcl: Import db-4.3.28 storage/bdb/test/mpoolscript.tcl: Import db-4.3.28 storage/bdb/test/mutex001.tcl: Import db-4.3.28 storage/bdb/test/mutex002.tcl: Import db-4.3.28 storage/bdb/test/mutex003.tcl: Import db-4.3.28 storage/bdb/test/mutexscript.tcl: Import db-4.3.28 storage/bdb/test/ndbm.tcl: Import db-4.3.28 storage/bdb/test/parallel.tcl: Import db-4.3.28 storage/bdb/test/recd001.tcl: Import db-4.3.28 storage/bdb/test/recd002.tcl: Import db-4.3.28 storage/bdb/test/recd003.tcl: Import db-4.3.28 storage/bdb/test/recd004.tcl: Import db-4.3.28 storage/bdb/test/recd005.tcl: Import db-4.3.28 storage/bdb/test/recd006.tcl: Import db-4.3.28 storage/bdb/test/recd007.tcl: Import db-4.3.28 storage/bdb/test/recd008.tcl: Import db-4.3.28 storage/bdb/test/recd009.tcl: Import db-4.3.28 storage/bdb/test/recd010.tcl: Import db-4.3.28 storage/bdb/test/recd011.tcl: Import db-4.3.28 storage/bdb/test/recd012.tcl: Import db-4.3.28 storage/bdb/test/recd013.tcl: Import db-4.3.28 storage/bdb/test/recd014.tcl: Import db-4.3.28 storage/bdb/test/recd015.tcl: Import db-4.3.28 storage/bdb/test/recd016.tcl: Import db-4.3.28 storage/bdb/test/recd017.tcl: Import db-4.3.28 storage/bdb/test/recd018.tcl: Import db-4.3.28 storage/bdb/test/recd019.tcl: Import db-4.3.28 storage/bdb/test/recd020.tcl: Import db-4.3.28 storage/bdb/test/recd15scr.tcl: Import db-4.3.28 storage/bdb/test/recdscript.tcl: Import db-4.3.28 storage/bdb/test/rep001.tcl: Import db-4.3.28 storage/bdb/test/rep002.tcl: Import db-4.3.28 storage/bdb/test/rep003.tcl: Import db-4.3.28 storage/bdb/test/rep005.tcl: Import db-4.3.28 storage/bdb/test/reputils.tcl: Import db-4.3.28 storage/bdb/test/rpc001.tcl: Import db-4.3.28 storage/bdb/test/rpc002.tcl: Import db-4.3.28 storage/bdb/test/rpc003.tcl: Import db-4.3.28 storage/bdb/test/rpc004.tcl: Import db-4.3.28 storage/bdb/test/rpc005.tcl: Import db-4.3.28 storage/bdb/test/rsrc001.tcl: Import db-4.3.28 storage/bdb/test/rsrc002.tcl: Import db-4.3.28 storage/bdb/test/rsrc003.tcl: Import db-4.3.28 storage/bdb/test/rsrc004.tcl: Import db-4.3.28 storage/bdb/test/scr001/chk.code: Import db-4.3.28 storage/bdb/test/scr003/chk.define: Import db-4.3.28 storage/bdb/test/scr004/chk.javafiles: Import db-4.3.28 storage/bdb/test/scr005/chk.nl: Import db-4.3.28 storage/bdb/test/scr006/chk.offt: Import db-4.3.28 storage/bdb/test/scr007/chk.proto: Import db-4.3.28 storage/bdb/test/scr008/chk.pubdef: Import db-4.3.28 storage/bdb/test/scr009/chk.srcfiles: Import db-4.3.28 storage/bdb/test/scr010/chk.str: Import db-4.3.28 storage/bdb/test/scr010/spell.ok: Import db-4.3.28 storage/bdb/test/scr011/chk.tags: Import db-4.3.28 storage/bdb/test/scr012/chk.vx_code: Import db-4.3.28 storage/bdb/test/scr013/chk.stats: Import db-4.3.28 storage/bdb/test/scr015/TestConstruct01.cpp: Import db-4.3.28 storage/bdb/test/scr015/TestConstruct01.testerr: Import db-4.3.28 storage/bdb/test/scr015/TestGetSetMethods.cpp: Import db-4.3.28 storage/bdb/test/scr015/TestKeyRange.cpp: Import db-4.3.28 storage/bdb/test/scr015/TestLogc.cpp: Import db-4.3.28 storage/bdb/test/scr015/TestSimpleAccess.cpp: Import db-4.3.28 storage/bdb/test/scr015/TestTruncate.cpp: Import db-4.3.28 storage/bdb/test/scr015/chk.cxxtests: Import db-4.3.28 storage/bdb/test/scr016/CallbackTest.java: Import db-4.3.28 storage/bdb/test/scr016/CallbackTest.testout: Import db-4.3.28 storage/bdb/test/scr016/TestAppendRecno.java: Import db-4.3.28 storage/bdb/test/scr016/TestAssociate.java: Import db-4.3.28 storage/bdb/test/scr016/TestClosedDb.java: Import db-4.3.28 storage/bdb/test/scr016/TestClosedDb.testout: Import db-4.3.28 storage/bdb/test/scr016/TestConstruct01.java: Import db-4.3.28 storage/bdb/test/scr016/TestConstruct01.testout: Import db-4.3.28 storage/bdb/test/scr016/TestConstruct02.java: Import db-4.3.28 storage/bdb/test/scr016/TestDbtFlags.java: Import db-4.3.28 storage/bdb/test/scr016/TestGetSetMethods.java: Import db-4.3.28 storage/bdb/test/scr016/TestKeyRange.java: Import db-4.3.28 storage/bdb/test/scr016/TestLockVec.java: Import db-4.3.28 storage/bdb/test/scr016/TestLogc.java: Import db-4.3.28 storage/bdb/test/scr016/TestOpenEmpty.java: Import db-4.3.28 storage/bdb/test/scr016/TestOpenEmpty.testerr: Import db-4.3.28 storage/bdb/test/scr016/TestReplication.java: Import db-4.3.28 storage/bdb/test/scr016/TestRpcServer.java: Import db-4.3.28 storage/bdb/test/scr016/TestSameDbt.java: Import db-4.3.28 storage/bdb/test/scr016/TestSimpleAccess.java: Import db-4.3.28 storage/bdb/test/scr016/TestStat.java: Import db-4.3.28 storage/bdb/test/scr016/TestStat.testout: Import db-4.3.28 storage/bdb/test/scr016/TestTruncate.java: Import db-4.3.28 storage/bdb/test/scr016/TestTruncate.testout: Import db-4.3.28 storage/bdb/test/scr016/TestUtil.java: Import db-4.3.28 storage/bdb/test/scr016/TestXAServlet.java: Import db-4.3.28 storage/bdb/test/scr016/chk.javatests: Import db-4.3.28 storage/bdb/test/scr016/ignore: Import db-4.3.28 storage/bdb/test/scr016/testone: Import db-4.3.28 storage/bdb/test/scr017/chk.db185: Import db-4.3.28 storage/bdb/test/scr019/chk.include: Import db-4.3.28 storage/bdb/test/scr020/chk.inc: Import db-4.3.28 storage/bdb/test/scr021/chk.flags: Import db-4.3.28 storage/bdb/test/scr022/chk.rr: Import db-4.3.28 storage/bdb/test/sdb001.tcl: Import db-4.3.28 storage/bdb/test/sdb002.tcl: Import db-4.3.28 storage/bdb/test/sdb003.tcl: Import db-4.3.28 storage/bdb/test/sdb004.tcl: Import db-4.3.28 storage/bdb/test/sdb005.tcl: Import db-4.3.28 storage/bdb/test/sdb006.tcl: Import db-4.3.28 storage/bdb/test/sdb007.tcl: Import db-4.3.28 storage/bdb/test/sdb008.tcl: Import db-4.3.28 storage/bdb/test/sdb009.tcl: Import db-4.3.28 storage/bdb/test/sdb010.tcl: Import db-4.3.28 storage/bdb/test/sdb011.tcl: Import db-4.3.28 storage/bdb/test/sdb012.tcl: Import db-4.3.28 storage/bdb/test/sdbscript.tcl: Import db-4.3.28 storage/bdb/test/sdbtest001.tcl: Import db-4.3.28 storage/bdb/test/sdbtest002.tcl: Import db-4.3.28 storage/bdb/test/sdbutils.tcl: Import db-4.3.28 storage/bdb/test/sec001.tcl: Import db-4.3.28 storage/bdb/test/sec002.tcl: Import db-4.3.28 storage/bdb/test/shelltest.tcl: Import db-4.3.28 storage/bdb/test/si001.tcl: Import db-4.3.28 storage/bdb/test/si002.tcl: Import db-4.3.28 storage/bdb/test/si003.tcl: Import db-4.3.28 storage/bdb/test/si004.tcl: Import db-4.3.28 storage/bdb/test/si005.tcl: Import db-4.3.28 storage/bdb/test/sysscript.tcl: Import db-4.3.28 storage/bdb/test/test.tcl: Import db-4.3.28 storage/bdb/test/test001.tcl: Import db-4.3.28 storage/bdb/test/test002.tcl: Import db-4.3.28 storage/bdb/test/test003.tcl: Import db-4.3.28 storage/bdb/test/test004.tcl: Import db-4.3.28 storage/bdb/test/test005.tcl: Import db-4.3.28 storage/bdb/test/test006.tcl: Import db-4.3.28 storage/bdb/test/test007.tcl: Import db-4.3.28 storage/bdb/test/test008.tcl: Import db-4.3.28 storage/bdb/test/test009.tcl: Import db-4.3.28 storage/bdb/test/test010.tcl: Import db-4.3.28 storage/bdb/test/test011.tcl: Import db-4.3.28 storage/bdb/test/test012.tcl: Import db-4.3.28 storage/bdb/test/test013.tcl: Import db-4.3.28 storage/bdb/test/test014.tcl: Import db-4.3.28 storage/bdb/test/test015.tcl: Import db-4.3.28 storage/bdb/test/test016.tcl: Import db-4.3.28 storage/bdb/test/test017.tcl: Import db-4.3.28 storage/bdb/test/test018.tcl: Import db-4.3.28 storage/bdb/test/test019.tcl: Import db-4.3.28 storage/bdb/test/test020.tcl: Import db-4.3.28 storage/bdb/test/test021.tcl: Import db-4.3.28 storage/bdb/test/test022.tcl: Import db-4.3.28 storage/bdb/test/test023.tcl: Import db-4.3.28 storage/bdb/test/test024.tcl: Import db-4.3.28 storage/bdb/test/test025.tcl: Import db-4.3.28 storage/bdb/test/test026.tcl: Import db-4.3.28 storage/bdb/test/test027.tcl: Import db-4.3.28 storage/bdb/test/test028.tcl: Import db-4.3.28 storage/bdb/test/test029.tcl: Import db-4.3.28 storage/bdb/test/test030.tcl: Import db-4.3.28 storage/bdb/test/test031.tcl: Import db-4.3.28 storage/bdb/test/test032.tcl: Import db-4.3.28 storage/bdb/test/test033.tcl: Import db-4.3.28 storage/bdb/test/test034.tcl: Import db-4.3.28 storage/bdb/test/test035.tcl: Import db-4.3.28 storage/bdb/test/test036.tcl: Import db-4.3.28 storage/bdb/test/test037.tcl: Import db-4.3.28 storage/bdb/test/test038.tcl: Import db-4.3.28 storage/bdb/test/test039.tcl: Import db-4.3.28 storage/bdb/test/test040.tcl: Import db-4.3.28 storage/bdb/test/test041.tcl: Import db-4.3.28 storage/bdb/test/test042.tcl: Import db-4.3.28 storage/bdb/test/test043.tcl: Import db-4.3.28 storage/bdb/test/test044.tcl: Import db-4.3.28 storage/bdb/test/test045.tcl: Import db-4.3.28 storage/bdb/test/test046.tcl: Import db-4.3.28 storage/bdb/test/test047.tcl: Import db-4.3.28 storage/bdb/test/test048.tcl: Import db-4.3.28 storage/bdb/test/test049.tcl: Import db-4.3.28 storage/bdb/test/test050.tcl: Import db-4.3.28 storage/bdb/test/test051.tcl: Import db-4.3.28 storage/bdb/test/test052.tcl: Import db-4.3.28 storage/bdb/test/test053.tcl: Import db-4.3.28 storage/bdb/test/test054.tcl: Import db-4.3.28 storage/bdb/test/test055.tcl: Import db-4.3.28 storage/bdb/test/test056.tcl: Import db-4.3.28 storage/bdb/test/test057.tcl: Import db-4.3.28 storage/bdb/test/test058.tcl: Import db-4.3.28 storage/bdb/test/test059.tcl: Import db-4.3.28 storage/bdb/test/test060.tcl: Import db-4.3.28 storage/bdb/test/test061.tcl: Import db-4.3.28 storage/bdb/test/test062.tcl: Import db-4.3.28 storage/bdb/test/test063.tcl: Import db-4.3.28 storage/bdb/test/test064.tcl: Import db-4.3.28 storage/bdb/test/test065.tcl: Import db-4.3.28 storage/bdb/test/test066.tcl: Import db-4.3.28 storage/bdb/test/test067.tcl: Import db-4.3.28 storage/bdb/test/test068.tcl: Import db-4.3.28 storage/bdb/test/test069.tcl: Import db-4.3.28 storage/bdb/test/test070.tcl: Import db-4.3.28 storage/bdb/test/test071.tcl: Import db-4.3.28 storage/bdb/test/test072.tcl: Import db-4.3.28 storage/bdb/test/test073.tcl: Import db-4.3.28 storage/bdb/test/test074.tcl: Import db-4.3.28 storage/bdb/test/test076.tcl: Import db-4.3.28 storage/bdb/test/test077.tcl: Import db-4.3.28 storage/bdb/test/test078.tcl: Import db-4.3.28 storage/bdb/test/test079.tcl: Import db-4.3.28 storage/bdb/test/test081.tcl: Import db-4.3.28 storage/bdb/test/test082.tcl: Import db-4.3.28 storage/bdb/test/test083.tcl: Import db-4.3.28 storage/bdb/test/test084.tcl: Import db-4.3.28 storage/bdb/test/test085.tcl: Import db-4.3.28 storage/bdb/test/test086.tcl: Import db-4.3.28 storage/bdb/test/test087.tcl: Import db-4.3.28 storage/bdb/test/test088.tcl: Import db-4.3.28 storage/bdb/test/test089.tcl: Import db-4.3.28 storage/bdb/test/test090.tcl: Import db-4.3.28 storage/bdb/test/test091.tcl: Import db-4.3.28 storage/bdb/test/test092.tcl: Import db-4.3.28 storage/bdb/test/test093.tcl: Import db-4.3.28 storage/bdb/test/test094.tcl: Import db-4.3.28 storage/bdb/test/test095.tcl: Import db-4.3.28 storage/bdb/test/test096.tcl: Import db-4.3.28 storage/bdb/test/test097.tcl: Import db-4.3.28 storage/bdb/test/test098.tcl: Import db-4.3.28 storage/bdb/test/test099.tcl: Import db-4.3.28 storage/bdb/test/test100.tcl: Import db-4.3.28 storage/bdb/test/test101.tcl: Import db-4.3.28 storage/bdb/test/testparams.tcl: Import db-4.3.28 storage/bdb/test/testutils.tcl: Import db-4.3.28 storage/bdb/test/txn001.tcl: Import db-4.3.28 storage/bdb/test/txn002.tcl: Import db-4.3.28 storage/bdb/test/txn003.tcl: Import db-4.3.28 storage/bdb/test/txn004.tcl: Import db-4.3.28 storage/bdb/test/txn005.tcl: Import db-4.3.28 storage/bdb/test/txn006.tcl: Import db-4.3.28 storage/bdb/test/txn007.tcl: Import db-4.3.28 storage/bdb/test/txn008.tcl: Import db-4.3.28 storage/bdb/test/txn009.tcl: Import db-4.3.28 storage/bdb/test/txnscript.tcl: Import db-4.3.28 storage/bdb/test/update.tcl: Import db-4.3.28 storage/bdb/test/upgrade.tcl: Import db-4.3.28 storage/bdb/test/wrap.tcl: Import db-4.3.28 storage/bdb/txn/txn.c: Import db-4.3.28 storage/bdb/txn/txn.src: Import db-4.3.28 storage/bdb/txn/txn_method.c: Import db-4.3.28 storage/bdb/txn/txn_rec.c: Import db-4.3.28 storage/bdb/txn/txn_recover.c: Import db-4.3.28 storage/bdb/txn/txn_region.c: Import db-4.3.28 storage/bdb/txn/txn_stat.c: Import db-4.3.28 storage/bdb/txn/txn_util.c: Import db-4.3.28 storage/bdb/xa/xa.c: Import db-4.3.28 storage/bdb/xa/xa_db.c: Import db-4.3.28 storage/bdb/xa/xa_map.c: Import db-4.3.28 storage/bdb/clib/strtol.c: Import db-4.3.28 storage/bdb/clib/strtoul.c: Import db-4.3.28 storage/bdb/common/crypto_stub.c: Import db-4.3.28 storage/bdb/crypto/aes_method.c: Import db-4.3.28 storage/bdb/crypto/crypto.c: Import db-4.3.28 storage/bdb/crypto/crypto.html: Import db-4.3.28 storage/bdb/crypto/mersenne/mt19937db.c: Import db-4.3.28 storage/bdb/crypto/rijndael/rijndael-alg-fst.c: Import db-4.3.28 storage/bdb/crypto/rijndael/rijndael-alg-fst.h: Import db-4.3.28 storage/bdb/crypto/rijndael/rijndael-api-fst.c: Import db-4.3.28 storage/bdb/crypto/rijndael/rijndael-api-fst.h: Import db-4.3.28 storage/bdb/cxx/cxx_multi.cpp: Import db-4.3.28 storage/bdb/cxx/cxx_seq.cpp: Import db-4.3.28 storage/bdb/db/db_ovfl_vrfy.c: Import db-4.3.28 storage/bdb/db/db_setid.c: Import db-4.3.28 storage/bdb/db/db_setlsn.c: Import db-4.3.28 storage/bdb/db/db_stati.c: Import db-4.3.28 storage/bdb/db/db_vrfy_stub.c: Import db-4.3.28 storage/bdb/db_stat/dd.sh: Import db-4.3.28 storage/bdb/dbreg/dbreg_stat.c: Import db-4.3.28 storage/bdb/dist/aclocal/rpc.ac: Import db-4.3.28 storage/bdb/dist/aclocal/sequence.ac: Import db-4.3.28 storage/bdb/dist/config.hin: Import db-4.3.28 storage/bdb/dist/s_java_const: Import db-4.3.28 storage/bdb/dist/s_java_stat: Import db-4.3.28 storage/bdb/dist/s_java_swig: Import db-4.3.28 storage/bdb/dist/s_je2db: Import db-4.3.28 storage/bdb/dist/s_winmsi: Import db-4.3.28 storage/bdb/dist/template/db_server_proc: Import db-4.3.28 storage/bdb/dist/template/gen_client_ret: Import db-4.3.28 storage/bdb/dist/template/rec_btree: Import db-4.3.28 storage/bdb/dist/template/rec_crdel: Import db-4.3.28 storage/bdb/dist/template/rec_dbreg: Import db-4.3.28 storage/bdb/dist/template/rec_db: Import db-4.3.28 storage/bdb/dist/template/rec_fileops: Import db-4.3.28 storage/bdb/dist/template/rec_hash: Import db-4.3.28 storage/bdb/dist/template/rec_qam: Import db-4.3.28 storage/bdb/dist/template/rec_rep: Import db-4.3.28 storage/bdb/dist/template/rec_txn: Import db-4.3.28 storage/bdb/dist/vx_2.0/BerkeleyDBsmall.wpj: Import db-4.3.28 storage/bdb/dist/vx_2.2/BerkeleyDB.wpj: Import db-4.3.28 storage/bdb/dist/vx_2.2/BerkeleyDBsmall.wpj: Import db-4.3.28 storage/bdb/dist/vx_2.2/wpj.in: Import db-4.3.28 storage/bdb/dist/win_db.in: Import db-4.3.28 storage/bdb/dist/winmsi/dbcorewix.in: Import db-4.3.28 storage/bdb/dist/winmsi/dbvarsbat.in: Import db-4.3.28 storage/bdb/dist/winmsi/dbwix.m4: Import db-4.3.28 storage/bdb/dist/winmsi/environment.in: Import db-4.3.28 storage/bdb/dist/winmsi/features.in: Import db-4.3.28 storage/bdb/dist/winmsi/files.in: Import db-4.3.28 storage/bdb/dist/winmsi/images/caticon.ibd: Import db-4.3.28 storage/bdb/dist/winmsi/images/foldernew.ibd: Import db-4.3.28 storage/bdb/dist/winmsi/images/folderup.ibd: Import db-4.3.28 storage/bdb/dist/winmsi/images/sleepycat.jpg: Import db-4.3.28 storage/bdb/dist/winmsi/images/topstripe.ibd: Import db-4.3.28 storage/bdb/dist/winmsi/images/webicon.ico: Import db-4.3.28 storage/bdb/dist/winmsi/links.in: Import db-4.3.28 storage/bdb/dist/winmsi/s_winmsi.fcn: Import db-4.3.28 storage/bdb/dist/winmsi/winbuild.bat: Import db-4.3.28 storage/bdb/env/env_stat.c: Import db-4.3.28 storage/bdb/hash/hash_stub.c: Import db-4.3.28 storage/bdb/lock/lock_id.c: Import db-4.3.28 storage/bdb/lock/lock_list.c: Import db-4.3.28 storage/bdb/lock/lock_timer.c: Import db-4.3.28 storage/bdb/log/log_stat.c: Import db-4.3.28 storage/bdb/mp/mp_fmethod.c: Import db-4.3.28 storage/bdb/os/os_truncate.c: Import db-4.3.28 storage/bdb/os_win32/os_truncate.c: Import db-4.3.28 storage/bdb/os_win32/os_unlink.c: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/META.yml: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/cds.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/encrypt.t: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/t/pod.t: Import db-4.3.28 storage/bdb/perl/DB_File/META.yml: Import db-4.3.28 storage/bdb/qam/qam_stub.c: Import db-4.3.28 storage/bdb/rep/rep.src: Import db-4.3.28 storage/bdb/rep/rep_backup.c: Import db-4.3.28 storage/bdb/rep/rep_stat.c: Import db-4.3.28 storage/bdb/rep/rep_stub.c: Import db-4.3.28 storage/bdb/rpc_client/gen_client.c: Import db-4.3.28 storage/bdb/rpc_server/c/db_server_proc.c: Import db-4.3.28 storage/bdb/rpc_server/c/gen_db_server.c: Import db-4.3.28 storage/bdb/rpc_server/db_server.x: Import db-4.3.28 storage/bdb/sequence/seq_stat.c: Import db-4.3.28 storage/bdb/sequence/sequence.c: Import db-4.3.28 storage/bdb/tcl/tcl_seq.c: Import db-4.3.28 storage/bdb/dist/config.guess: Import db-4.3.28 storage/bdb/dist/config.sub: Import db-4.3.28 storage/bdb/dist/s_all: Import db-4.3.28 storage/bdb/dist/s_config: Import db-4.3.28 storage/bdb/dist/s_crypto: Import db-4.3.28 storage/bdb/dist/s_include: Import db-4.3.28 storage/bdb/dist/s_java: Import db-4.3.28 storage/bdb/dist/s_perm: Import db-4.3.28 storage/bdb/dist/s_readme: Import db-4.3.28 storage/bdb/dist/s_recover: Import db-4.3.28 storage/bdb/dist/s_rpc: Import db-4.3.28 storage/bdb/dist/s_symlink: Import db-4.3.28 storage/bdb/dist/s_tags: Import db-4.3.28 storage/bdb/dist/s_test: Import db-4.3.28 storage/bdb/dist/s_vxworks: Import db-4.3.28 storage/bdb/dist/s_win32_dsp: Import db-4.3.28 storage/bdb/dist/s_win32: Import db-4.3.28 storage/bdb/perl/BerkeleyDB/dbinfo: Import db-4.3.28
1187 lines
35 KiB
C
1187 lines
35 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996-2004
|
|
* 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.
|
|
*
|
|
* $Id: bt_split.c,v 11.66 2004/10/01 13:00:21 bostic Exp $
|
|
*/
|
|
|
|
#include "db_config.h"
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
|
|
#include <string.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "dbinc/db_page.h"
|
|
#include "dbinc/db_shash.h"
|
|
#include "dbinc/lock.h"
|
|
#include "dbinc/mp.h"
|
|
#include "dbinc/btree.h"
|
|
|
|
static int __bam_broot __P((DBC *, PAGE *, PAGE *, PAGE *));
|
|
static int __bam_page __P((DBC *, EPG *, EPG *));
|
|
static int __bam_pinsert __P((DBC *, EPG *, PAGE *, PAGE *, int));
|
|
static int __bam_psplit __P((DBC *, EPG *, PAGE *, PAGE *, db_indx_t *));
|
|
static int __bam_root __P((DBC *, EPG *));
|
|
static int __ram_root __P((DBC *, PAGE *, PAGE *, PAGE *));
|
|
|
|
/*
|
|
* __bam_split --
|
|
* Split a page.
|
|
*
|
|
* PUBLIC: int __bam_split __P((DBC *, void *, db_pgno_t *));
|
|
*/
|
|
int
|
|
__bam_split(dbc, arg, root_pgnop)
|
|
DBC *dbc;
|
|
void *arg;
|
|
db_pgno_t *root_pgnop;
|
|
{
|
|
BTREE_CURSOR *cp;
|
|
enum { UP, DOWN } dir;
|
|
db_pgno_t root_pgno;
|
|
int exact, level, ret;
|
|
|
|
cp = (BTREE_CURSOR *)dbc->internal;
|
|
root_pgno = cp->root;
|
|
|
|
/*
|
|
* The locking protocol we use to avoid deadlock to acquire locks by
|
|
* walking down the tree, but we do it as lazily as possible, locking
|
|
* the root only as a last resort. We expect all stack pages to have
|
|
* been discarded before we're called; we discard all short-term locks.
|
|
*
|
|
* When __bam_split is first called, we know that a leaf page was too
|
|
* full for an insert. We don't know what leaf page it was, but we
|
|
* have the key/recno that caused the problem. We call XX_search to
|
|
* reacquire the leaf page, but this time get both the leaf page and
|
|
* its parent, locked. We then split the leaf page and see if the new
|
|
* internal key will fit into the parent page. If it will, we're done.
|
|
*
|
|
* If it won't, we discard our current locks and repeat the process,
|
|
* only this time acquiring the parent page and its parent, locked.
|
|
* This process repeats until we succeed in the split, splitting the
|
|
* root page as the final resort. The entire process then repeats,
|
|
* as necessary, until we split a leaf page.
|
|
*
|
|
* XXX
|
|
* A traditional method of speeding this up is to maintain a stack of
|
|
* the pages traversed in the original search. You can detect if the
|
|
* stack is correct by storing the page's LSN when it was searched and
|
|
* comparing that LSN with the current one when it's locked during the
|
|
* split. This would be an easy change for this code, but I have no
|
|
* numbers that indicate it's worthwhile.
|
|
*/
|
|
for (dir = UP, level = LEAFLEVEL;; dir == UP ? ++level : --level) {
|
|
/*
|
|
* Acquire a page and its parent, locked.
|
|
*/
|
|
if ((ret = (dbc->dbtype == DB_BTREE ?
|
|
__bam_search(dbc, PGNO_INVALID,
|
|
arg, S_WRPAIR, level, NULL, &exact) :
|
|
__bam_rsearch(dbc,
|
|
(db_recno_t *)arg, S_WRPAIR, level, &exact))) != 0)
|
|
break;
|
|
|
|
if (root_pgnop != NULL)
|
|
*root_pgnop = cp->csp[0].page->pgno == root_pgno ?
|
|
root_pgno : cp->csp[-1].page->pgno;
|
|
/*
|
|
* Split the page if it still needs it (it's possible another
|
|
* thread of control has already split the page). If we are
|
|
* guaranteed that two items will fit on the page, the split
|
|
* is no longer necessary.
|
|
*/
|
|
if (2 * B_MAXSIZEONPAGE(cp->ovflsize)
|
|
<= (db_indx_t)P_FREESPACE(dbc->dbp, cp->csp[0].page)) {
|
|
__bam_stkrel(dbc, STK_NOLOCK);
|
|
break;
|
|
}
|
|
ret = cp->csp[0].page->pgno == root_pgno ?
|
|
__bam_root(dbc, &cp->csp[0]) :
|
|
__bam_page(dbc, &cp->csp[-1], &cp->csp[0]);
|
|
BT_STK_CLR(cp);
|
|
|
|
switch (ret) {
|
|
case 0:
|
|
/* Once we've split the leaf page, we're done. */
|
|
if (level == LEAFLEVEL)
|
|
return (0);
|
|
|
|
/* Switch directions. */
|
|
if (dir == UP)
|
|
dir = DOWN;
|
|
break;
|
|
case DB_NEEDSPLIT:
|
|
/*
|
|
* It's possible to fail to split repeatedly, as other
|
|
* threads may be modifying the tree, or the page usage
|
|
* is sufficiently bad that we don't get enough space
|
|
* the first time.
|
|
*/
|
|
if (dir == DOWN)
|
|
dir = UP;
|
|
break;
|
|
default:
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
err: if (root_pgnop != NULL)
|
|
*root_pgnop = cp->root;
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __bam_root --
|
|
* Split the root page of a btree.
|
|
*/
|
|
static int
|
|
__bam_root(dbc, cp)
|
|
DBC *dbc;
|
|
EPG *cp;
|
|
{
|
|
DB *dbp;
|
|
DBT log_dbt;
|
|
DB_LSN log_lsn;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *lp, *rp;
|
|
db_indx_t split;
|
|
u_int32_t opflags;
|
|
int ret, t_ret;
|
|
|
|
dbp = dbc->dbp;
|
|
mpf = dbp->mpf;
|
|
lp = rp = NULL;
|
|
|
|
/* Yeah, right. */
|
|
if (cp->page->level >= MAXBTREELEVEL) {
|
|
__db_err(dbp->dbenv,
|
|
"Too many btree levels: %d", cp->page->level);
|
|
ret = ENOSPC;
|
|
goto err;
|
|
}
|
|
|
|
/* Create new left and right pages for the split. */
|
|
if ((ret = __db_new(dbc, TYPE(cp->page), &lp)) != 0 ||
|
|
(ret = __db_new(dbc, TYPE(cp->page), &rp)) != 0)
|
|
goto err;
|
|
P_INIT(lp, dbp->pgsize, lp->pgno,
|
|
PGNO_INVALID, ISINTERNAL(cp->page) ? PGNO_INVALID : rp->pgno,
|
|
cp->page->level, TYPE(cp->page));
|
|
P_INIT(rp, dbp->pgsize, rp->pgno,
|
|
ISINTERNAL(cp->page) ? PGNO_INVALID : lp->pgno, PGNO_INVALID,
|
|
cp->page->level, TYPE(cp->page));
|
|
|
|
/* Split the page. */
|
|
if ((ret = __bam_psplit(dbc, cp, lp, rp, &split)) != 0)
|
|
goto err;
|
|
|
|
/* Log the change. */
|
|
if (DBC_LOGGING(dbc)) {
|
|
memset(&log_dbt, 0, sizeof(log_dbt));
|
|
log_dbt.data = cp->page;
|
|
log_dbt.size = dbp->pgsize;
|
|
ZERO_LSN(log_lsn);
|
|
opflags = F_ISSET(
|
|
(BTREE_CURSOR *)dbc->internal, C_RECNUM) ? SPL_NRECS : 0;
|
|
if ((ret = __bam_split_log(dbp,
|
|
dbc->txn, &LSN(cp->page), 0, PGNO(lp), &LSN(lp), PGNO(rp),
|
|
&LSN(rp), (u_int32_t)NUM_ENT(lp), 0, &log_lsn,
|
|
dbc->internal->root, &log_dbt, opflags)) != 0)
|
|
goto err;
|
|
} else
|
|
LSN_NOT_LOGGED(LSN(cp->page));
|
|
LSN(lp) = LSN(cp->page);
|
|
LSN(rp) = LSN(cp->page);
|
|
|
|
/* Clean up the new root page. */
|
|
if ((ret = (dbc->dbtype == DB_RECNO ?
|
|
__ram_root(dbc, cp->page, lp, rp) :
|
|
__bam_broot(dbc, cp->page, lp, rp))) != 0)
|
|
goto err;
|
|
|
|
/* Adjust any cursors. */
|
|
ret = __bam_ca_split(dbc, cp->page->pgno, lp->pgno, rp->pgno, split, 1);
|
|
|
|
/* Success or error: release pages and locks. */
|
|
err: if ((t_ret =
|
|
__memp_fput(mpf, cp->page, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __TLPUT(dbc, cp->lock)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (lp != NULL &&
|
|
(t_ret = __memp_fput(mpf, lp, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (rp != NULL &&
|
|
(t_ret = __memp_fput(mpf, rp, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __bam_page --
|
|
* Split the non-root page of a btree.
|
|
*/
|
|
static int
|
|
__bam_page(dbc, pp, cp)
|
|
DBC *dbc;
|
|
EPG *pp, *cp;
|
|
{
|
|
BTREE_CURSOR *bc;
|
|
DBT log_dbt;
|
|
DB_LSN log_lsn;
|
|
DB *dbp;
|
|
DB_LOCK rplock, tplock;
|
|
DB_MPOOLFILE *mpf;
|
|
DB_LSN save_lsn;
|
|
PAGE *lp, *rp, *alloc_rp, *tp;
|
|
db_indx_t split;
|
|
u_int32_t opflags;
|
|
int ret, t_ret;
|
|
|
|
dbp = dbc->dbp;
|
|
mpf = dbp->mpf;
|
|
alloc_rp = lp = rp = tp = NULL;
|
|
LOCK_INIT(rplock);
|
|
LOCK_INIT(tplock);
|
|
ret = -1;
|
|
|
|
/*
|
|
* Create a new right page for the split, and fill in everything
|
|
* except its LSN and page number.
|
|
*
|
|
* We malloc space for both the left and right pages, so we don't get
|
|
* a new page from the underlying buffer pool until we know the split
|
|
* is going to succeed. The reason is that we can't release locks
|
|
* acquired during the get-a-new-page process because metadata page
|
|
* locks can't be discarded on failure since we may have modified the
|
|
* free list. So, if you assume that we're holding a write lock on the
|
|
* leaf page which ran out of space and started this split (e.g., we
|
|
* have already written records to the page, or we retrieved a record
|
|
* from it with the DB_RMW flag set), failing in a split with both a
|
|
* leaf page locked and the metadata page locked can potentially lock
|
|
* up the tree badly, because we've violated the rule of always locking
|
|
* down the tree, and never up.
|
|
*/
|
|
if ((ret = __os_malloc(dbp->dbenv, dbp->pgsize, &rp)) != 0)
|
|
goto err;
|
|
P_INIT(rp, dbp->pgsize, 0,
|
|
ISINTERNAL(cp->page) ? PGNO_INVALID : PGNO(cp->page),
|
|
ISINTERNAL(cp->page) ? PGNO_INVALID : NEXT_PGNO(cp->page),
|
|
cp->page->level, TYPE(cp->page));
|
|
|
|
/*
|
|
* Create new left page for the split, and fill in everything
|
|
* except its LSN and next-page page number.
|
|
*/
|
|
if ((ret = __os_malloc(dbp->dbenv, dbp->pgsize, &lp)) != 0)
|
|
goto err;
|
|
P_INIT(lp, dbp->pgsize, PGNO(cp->page),
|
|
ISINTERNAL(cp->page) ? PGNO_INVALID : PREV_PGNO(cp->page),
|
|
ISINTERNAL(cp->page) ? PGNO_INVALID : 0,
|
|
cp->page->level, TYPE(cp->page));
|
|
|
|
/*
|
|
* Split right.
|
|
*
|
|
* Only the indices are sorted on the page, i.e., the key/data pairs
|
|
* aren't, so it's simpler to copy the data from the split page onto
|
|
* two new pages instead of copying half the data to a new right page
|
|
* and compacting the left page in place. Since the left page can't
|
|
* change, we swap the original and the allocated left page after the
|
|
* split.
|
|
*/
|
|
if ((ret = __bam_psplit(dbc, cp, lp, rp, &split)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Test to see if we are going to be able to insert the new pages into
|
|
* the parent page. The interesting failure here is that the parent
|
|
* page can't hold the new keys, and has to be split in turn, in which
|
|
* case we want to release all the locks we can.
|
|
*/
|
|
if ((ret = __bam_pinsert(dbc, pp, lp, rp, 1)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Fix up the previous pointer of any leaf page following the split
|
|
* page.
|
|
*
|
|
* There's interesting deadlock situations here as we try to write-lock
|
|
* a page that's not in our direct ancestry. Consider a cursor walking
|
|
* backward through the leaf pages, that has our following page locked,
|
|
* and is waiting on a lock for the page we're splitting. In that case
|
|
* we're going to deadlock here . It's probably OK, stepping backward
|
|
* through the tree isn't a common operation.
|
|
*/
|
|
if (ISLEAF(cp->page) && NEXT_PGNO(cp->page) != PGNO_INVALID) {
|
|
if ((ret = __db_lget(dbc,
|
|
0, NEXT_PGNO(cp->page), DB_LOCK_WRITE, 0, &tplock)) != 0)
|
|
goto err;
|
|
if ((ret = __memp_fget(mpf, &NEXT_PGNO(cp->page), 0, &tp)) != 0)
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
* We've got everything locked down we need, and we know the split
|
|
* is going to succeed. Go and get the additional page we'll need.
|
|
*/
|
|
if ((ret = __db_new(dbc, TYPE(cp->page), &alloc_rp)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Lock the new page. We need to do this for two reasons: first, the
|
|
* fast-lookup code might have a reference to this page in bt_lpgno if
|
|
* the page was recently deleted from the tree, and that code doesn't
|
|
* walk the tree and so won't encounter the parent's page lock.
|
|
* Second, a dirty reader could get to this page via the parent or old
|
|
* page after the split is done but before the transaction is committed
|
|
* or aborted.
|
|
*/
|
|
if ((ret = __db_lget(dbc,
|
|
0, PGNO(alloc_rp), DB_LOCK_WRITE, 0, &rplock)) != 0)
|
|
goto err;
|
|
|
|
/*
|
|
* Fix up the page numbers we didn't have before. We have to do this
|
|
* before calling __bam_pinsert because it may copy a page number onto
|
|
* the parent page and it takes the page number from its page argument.
|
|
*/
|
|
PGNO(rp) = NEXT_PGNO(lp) = PGNO(alloc_rp);
|
|
|
|
/* Actually update the parent page. */
|
|
if ((ret = __bam_pinsert(dbc, pp, lp, rp, 0)) != 0)
|
|
goto err;
|
|
|
|
bc = (BTREE_CURSOR *)dbc->internal;
|
|
/* Log the change. */
|
|
if (DBC_LOGGING(dbc)) {
|
|
memset(&log_dbt, 0, sizeof(log_dbt));
|
|
log_dbt.data = cp->page;
|
|
log_dbt.size = dbp->pgsize;
|
|
if (tp == NULL)
|
|
ZERO_LSN(log_lsn);
|
|
opflags = F_ISSET(bc, C_RECNUM) ? SPL_NRECS : 0;
|
|
if ((ret = __bam_split_log(dbp, dbc->txn, &LSN(cp->page), 0,
|
|
PGNO(cp->page), &LSN(cp->page), PGNO(alloc_rp),
|
|
&LSN(alloc_rp), (u_int32_t)NUM_ENT(lp),
|
|
tp == NULL ? 0 : PGNO(tp),
|
|
tp == NULL ? &log_lsn : &LSN(tp),
|
|
PGNO_INVALID, &log_dbt, opflags)) != 0)
|
|
goto err;
|
|
|
|
} else
|
|
LSN_NOT_LOGGED(LSN(cp->page));
|
|
|
|
/* Update the LSNs for all involved pages. */
|
|
LSN(alloc_rp) = LSN(cp->page);
|
|
LSN(lp) = LSN(cp->page);
|
|
LSN(rp) = LSN(cp->page);
|
|
if (tp != NULL)
|
|
LSN(tp) = LSN(cp->page);
|
|
|
|
/*
|
|
* Copy the left and right pages into place. There are two paths
|
|
* through here. Either we are logging and we set the LSNs in the
|
|
* logging path. However, if we are not logging, then we do not
|
|
* have valid LSNs on lp or rp. The correct LSNs to use are the
|
|
* ones on the page we got from __db_new or the one that was
|
|
* originally on cp->page. In both cases, we save the LSN from the
|
|
* real database page (not a malloc'd one) and reapply it after we
|
|
* do the copy.
|
|
*/
|
|
save_lsn = alloc_rp->lsn;
|
|
memcpy(alloc_rp, rp, LOFFSET(dbp, rp));
|
|
memcpy((u_int8_t *)alloc_rp + HOFFSET(rp),
|
|
(u_int8_t *)rp + HOFFSET(rp), dbp->pgsize - HOFFSET(rp));
|
|
alloc_rp->lsn = save_lsn;
|
|
|
|
save_lsn = cp->page->lsn;
|
|
memcpy(cp->page, lp, LOFFSET(dbp, lp));
|
|
memcpy((u_int8_t *)cp->page + HOFFSET(lp),
|
|
(u_int8_t *)lp + HOFFSET(lp), dbp->pgsize - HOFFSET(lp));
|
|
cp->page->lsn = save_lsn;
|
|
|
|
/* Fix up the next-page link. */
|
|
if (tp != NULL)
|
|
PREV_PGNO(tp) = PGNO(rp);
|
|
|
|
/* Adjust any cursors. */
|
|
if ((ret = __bam_ca_split(dbc,
|
|
PGNO(cp->page), PGNO(cp->page), PGNO(rp), split, 0)) != 0)
|
|
goto err;
|
|
|
|
__os_free(dbp->dbenv, lp);
|
|
__os_free(dbp->dbenv, rp);
|
|
|
|
/*
|
|
* Success -- write the real pages back to the store. As we never
|
|
* acquired any sort of lock on the new page, we release it before
|
|
* releasing locks on the pages that reference it. We're finished
|
|
* modifying the page so it's not really necessary, but it's neater.
|
|
*/
|
|
if ((t_ret =
|
|
__memp_fput(mpf, alloc_rp, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __TLPUT(dbc, rplock)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret =
|
|
__memp_fput(mpf, pp->page, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __TLPUT(dbc, pp->lock)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret =
|
|
__memp_fput(mpf, cp->page, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __TLPUT(dbc, cp->lock)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (tp != NULL) {
|
|
if ((t_ret =
|
|
__memp_fput(mpf, tp, DB_MPOOL_DIRTY)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if ((t_ret = __TLPUT(dbc, tplock)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
}
|
|
return (ret);
|
|
|
|
err: if (lp != NULL)
|
|
__os_free(dbp->dbenv, lp);
|
|
if (rp != NULL)
|
|
__os_free(dbp->dbenv, rp);
|
|
if (alloc_rp != NULL)
|
|
(void)__memp_fput(mpf, alloc_rp, 0);
|
|
if (tp != NULL)
|
|
(void)__memp_fput(mpf, tp, 0);
|
|
|
|
/* We never updated the new or next pages, we can release them. */
|
|
(void)__LPUT(dbc, rplock);
|
|
(void)__LPUT(dbc, tplock);
|
|
|
|
(void)__memp_fput(mpf, pp->page, 0);
|
|
if (ret == DB_NEEDSPLIT)
|
|
(void)__LPUT(dbc, pp->lock);
|
|
else
|
|
(void)__TLPUT(dbc, pp->lock);
|
|
|
|
(void)__memp_fput(mpf, cp->page, 0);
|
|
if (ret == DB_NEEDSPLIT)
|
|
(void)__LPUT(dbc, cp->lock);
|
|
else
|
|
(void)__TLPUT(dbc, cp->lock);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __bam_broot --
|
|
* Fix up the btree root page after it has been split.
|
|
*/
|
|
static int
|
|
__bam_broot(dbc, rootp, lp, rp)
|
|
DBC *dbc;
|
|
PAGE *rootp, *lp, *rp;
|
|
{
|
|
BINTERNAL bi, *child_bi;
|
|
BKEYDATA *child_bk;
|
|
BTREE_CURSOR *cp;
|
|
DB *dbp;
|
|
DBT hdr, data;
|
|
db_pgno_t root_pgno;
|
|
int ret;
|
|
|
|
dbp = dbc->dbp;
|
|
cp = (BTREE_CURSOR *)dbc->internal;
|
|
|
|
/*
|
|
* If the root page was a leaf page, change it into an internal page.
|
|
* We copy the key we split on (but not the key's data, in the case of
|
|
* a leaf page) to the new root page.
|
|
*/
|
|
root_pgno = cp->root;
|
|
P_INIT(rootp, dbp->pgsize,
|
|
root_pgno, PGNO_INVALID, PGNO_INVALID, lp->level + 1, P_IBTREE);
|
|
|
|
memset(&data, 0, sizeof(data));
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
|
|
/*
|
|
* The btree comparison code guarantees that the left-most key on any
|
|
* internal btree page is never used, so it doesn't need to be filled
|
|
* in. Set the record count if necessary.
|
|
*/
|
|
memset(&bi, 0, sizeof(bi));
|
|
bi.len = 0;
|
|
B_TSET(bi.type, B_KEYDATA, 0);
|
|
bi.pgno = lp->pgno;
|
|
if (F_ISSET(cp, C_RECNUM)) {
|
|
bi.nrecs = __bam_total(dbp, lp);
|
|
RE_NREC_SET(rootp, bi.nrecs);
|
|
}
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
if ((ret =
|
|
__db_pitem(dbc, rootp, 0, BINTERNAL_SIZE(0), &hdr, NULL)) != 0)
|
|
return (ret);
|
|
|
|
switch (TYPE(rp)) {
|
|
case P_IBTREE:
|
|
/* Copy the first key of the child page onto the root page. */
|
|
child_bi = GET_BINTERNAL(dbp, rp, 0);
|
|
|
|
bi.len = child_bi->len;
|
|
B_TSET(bi.type, child_bi->type, 0);
|
|
bi.pgno = rp->pgno;
|
|
if (F_ISSET(cp, C_RECNUM)) {
|
|
bi.nrecs = __bam_total(dbp, rp);
|
|
RE_NREC_ADJ(rootp, bi.nrecs);
|
|
}
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
data.data = child_bi->data;
|
|
data.size = child_bi->len;
|
|
if ((ret = __db_pitem(dbc, rootp, 1,
|
|
BINTERNAL_SIZE(child_bi->len), &hdr, &data)) != 0)
|
|
return (ret);
|
|
|
|
/* Increment the overflow ref count. */
|
|
if (B_TYPE(child_bi->type) == B_OVERFLOW)
|
|
if ((ret = __db_ovref(dbc,
|
|
((BOVERFLOW *)(child_bi->data))->pgno, 1)) != 0)
|
|
return (ret);
|
|
break;
|
|
case P_LDUP:
|
|
case P_LBTREE:
|
|
/* Copy the first key of the child page onto the root page. */
|
|
child_bk = GET_BKEYDATA(dbp, rp, 0);
|
|
switch (B_TYPE(child_bk->type)) {
|
|
case B_KEYDATA:
|
|
bi.len = child_bk->len;
|
|
B_TSET(bi.type, child_bk->type, 0);
|
|
bi.pgno = rp->pgno;
|
|
if (F_ISSET(cp, C_RECNUM)) {
|
|
bi.nrecs = __bam_total(dbp, rp);
|
|
RE_NREC_ADJ(rootp, bi.nrecs);
|
|
}
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
data.data = child_bk->data;
|
|
data.size = child_bk->len;
|
|
if ((ret = __db_pitem(dbc, rootp, 1,
|
|
BINTERNAL_SIZE(child_bk->len), &hdr, &data)) != 0)
|
|
return (ret);
|
|
break;
|
|
case B_DUPLICATE:
|
|
case B_OVERFLOW:
|
|
bi.len = BOVERFLOW_SIZE;
|
|
B_TSET(bi.type, child_bk->type, 0);
|
|
bi.pgno = rp->pgno;
|
|
if (F_ISSET(cp, C_RECNUM)) {
|
|
bi.nrecs = __bam_total(dbp, rp);
|
|
RE_NREC_ADJ(rootp, bi.nrecs);
|
|
}
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
data.data = child_bk;
|
|
data.size = BOVERFLOW_SIZE;
|
|
if ((ret = __db_pitem(dbc, rootp, 1,
|
|
BINTERNAL_SIZE(BOVERFLOW_SIZE), &hdr, &data)) != 0)
|
|
return (ret);
|
|
|
|
/* Increment the overflow ref count. */
|
|
if (B_TYPE(child_bk->type) == B_OVERFLOW)
|
|
if ((ret = __db_ovref(dbc,
|
|
((BOVERFLOW *)child_bk)->pgno, 1)) != 0)
|
|
return (ret);
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, rp->pgno));
|
|
}
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, rp->pgno));
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __ram_root --
|
|
* Fix up the recno root page after it has been split.
|
|
*/
|
|
static int
|
|
__ram_root(dbc, rootp, lp, rp)
|
|
DBC *dbc;
|
|
PAGE *rootp, *lp, *rp;
|
|
{
|
|
DB *dbp;
|
|
DBT hdr;
|
|
RINTERNAL ri;
|
|
db_pgno_t root_pgno;
|
|
int ret;
|
|
|
|
dbp = dbc->dbp;
|
|
root_pgno = dbc->internal->root;
|
|
|
|
/* Initialize the page. */
|
|
P_INIT(rootp, dbp->pgsize,
|
|
root_pgno, PGNO_INVALID, PGNO_INVALID, lp->level + 1, P_IRECNO);
|
|
|
|
/* Initialize the header. */
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
hdr.data = &ri;
|
|
hdr.size = RINTERNAL_SIZE;
|
|
|
|
/* Insert the left and right keys, set the header information. */
|
|
ri.pgno = lp->pgno;
|
|
ri.nrecs = __bam_total(dbp, lp);
|
|
if ((ret = __db_pitem(dbc, rootp, 0, RINTERNAL_SIZE, &hdr, NULL)) != 0)
|
|
return (ret);
|
|
RE_NREC_SET(rootp, ri.nrecs);
|
|
ri.pgno = rp->pgno;
|
|
ri.nrecs = __bam_total(dbp, rp);
|
|
if ((ret = __db_pitem(dbc, rootp, 1, RINTERNAL_SIZE, &hdr, NULL)) != 0)
|
|
return (ret);
|
|
RE_NREC_ADJ(rootp, ri.nrecs);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __bam_pinsert --
|
|
* Insert a new key into a parent page, completing the split.
|
|
*/
|
|
static int
|
|
__bam_pinsert(dbc, parent, lchild, rchild, space_check)
|
|
DBC *dbc;
|
|
EPG *parent;
|
|
PAGE *lchild, *rchild;
|
|
int space_check;
|
|
{
|
|
BINTERNAL bi, *child_bi;
|
|
BKEYDATA *child_bk, *tmp_bk;
|
|
BTREE *t;
|
|
BTREE_CURSOR *cp;
|
|
DB *dbp;
|
|
DBT a, b, hdr, data;
|
|
PAGE *ppage;
|
|
RINTERNAL ri;
|
|
db_indx_t off;
|
|
db_recno_t nrecs;
|
|
size_t (*func) __P((DB *, const DBT *, const DBT *));
|
|
u_int32_t n, nbytes, nksize;
|
|
int ret;
|
|
|
|
dbp = dbc->dbp;
|
|
cp = (BTREE_CURSOR *)dbc->internal;
|
|
t = dbp->bt_internal;
|
|
ppage = parent->page;
|
|
|
|
/* If handling record numbers, count records split to the right page. */
|
|
nrecs = F_ISSET(cp, C_RECNUM) &&
|
|
!space_check ? __bam_total(dbp, rchild) : 0;
|
|
|
|
/*
|
|
* Now we insert the new page's first key into the parent page, which
|
|
* completes the split. The parent points to a PAGE and a page index
|
|
* offset, where the new key goes ONE AFTER the index, because we split
|
|
* to the right.
|
|
*
|
|
* XXX
|
|
* Some btree algorithms replace the key for the old page as well as
|
|
* the new page. We don't, as there's no reason to believe that the
|
|
* first key on the old page is any better than the key we have, and,
|
|
* in the case of a key being placed at index 0 causing the split, the
|
|
* key is unavailable.
|
|
*/
|
|
off = parent->indx + O_INDX;
|
|
|
|
/*
|
|
* Calculate the space needed on the parent page.
|
|
*
|
|
* Prefix trees: space hack used when inserting into BINTERNAL pages.
|
|
* Retain only what's needed to distinguish between the new entry and
|
|
* the LAST entry on the page to its left. If the keys compare equal,
|
|
* retain the entire key. We ignore overflow keys, and the entire key
|
|
* must be retained for the next-to-leftmost key on the leftmost page
|
|
* of each level, or the search will fail. Applicable ONLY to internal
|
|
* pages that have leaf pages as children. Further reduction of the
|
|
* key between pairs of internal pages loses too much information.
|
|
*/
|
|
switch (TYPE(rchild)) {
|
|
case P_IBTREE:
|
|
child_bi = GET_BINTERNAL(dbp, rchild, 0);
|
|
nbytes = BINTERNAL_PSIZE(child_bi->len);
|
|
|
|
if (P_FREESPACE(dbp, ppage) < nbytes)
|
|
return (DB_NEEDSPLIT);
|
|
if (space_check)
|
|
return (0);
|
|
|
|
/* Add a new record for the right page. */
|
|
memset(&bi, 0, sizeof(bi));
|
|
bi.len = child_bi->len;
|
|
B_TSET(bi.type, child_bi->type, 0);
|
|
bi.pgno = rchild->pgno;
|
|
bi.nrecs = nrecs;
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
memset(&data, 0, sizeof(data));
|
|
data.data = child_bi->data;
|
|
data.size = child_bi->len;
|
|
if ((ret = __db_pitem(dbc, ppage, off,
|
|
BINTERNAL_SIZE(child_bi->len), &hdr, &data)) != 0)
|
|
return (ret);
|
|
|
|
/* Increment the overflow ref count. */
|
|
if (B_TYPE(child_bi->type) == B_OVERFLOW)
|
|
if ((ret = __db_ovref(dbc,
|
|
((BOVERFLOW *)(child_bi->data))->pgno, 1)) != 0)
|
|
return (ret);
|
|
break;
|
|
case P_LDUP:
|
|
case P_LBTREE:
|
|
child_bk = GET_BKEYDATA(dbp, rchild, 0);
|
|
switch (B_TYPE(child_bk->type)) {
|
|
case B_KEYDATA:
|
|
/*
|
|
* We set t->bt_prefix to NULL if we have a comparison
|
|
* callback but no prefix compression callback. But,
|
|
* if we're splitting in an off-page duplicates tree,
|
|
* we still have to do some checking. If using the
|
|
* default off-page duplicates comparison routine we
|
|
* can use the default prefix compression callback. If
|
|
* not using the default off-page duplicates comparison
|
|
* routine, we can't do any kind of prefix compression
|
|
* as there's no way for an application to specify a
|
|
* prefix compression callback that corresponds to its
|
|
* comparison callback.
|
|
*/
|
|
if (F_ISSET(dbc, DBC_OPD)) {
|
|
if (dbp->dup_compare == __bam_defcmp)
|
|
func = __bam_defpfx;
|
|
else
|
|
func = NULL;
|
|
} else
|
|
func = t->bt_prefix;
|
|
|
|
nbytes = BINTERNAL_PSIZE(child_bk->len);
|
|
nksize = child_bk->len;
|
|
if (func == NULL)
|
|
goto noprefix;
|
|
if (ppage->prev_pgno == PGNO_INVALID && off <= 1)
|
|
goto noprefix;
|
|
tmp_bk = GET_BKEYDATA(dbp, lchild, NUM_ENT(lchild) -
|
|
(TYPE(lchild) == P_LDUP ? O_INDX : P_INDX));
|
|
if (B_TYPE(tmp_bk->type) != B_KEYDATA)
|
|
goto noprefix;
|
|
memset(&a, 0, sizeof(a));
|
|
a.size = tmp_bk->len;
|
|
a.data = tmp_bk->data;
|
|
memset(&b, 0, sizeof(b));
|
|
b.size = child_bk->len;
|
|
b.data = child_bk->data;
|
|
nksize = (u_int32_t)func(dbp, &a, &b);
|
|
if ((n = BINTERNAL_PSIZE(nksize)) < nbytes)
|
|
nbytes = n;
|
|
else
|
|
noprefix: nksize = child_bk->len;
|
|
|
|
if (P_FREESPACE(dbp, ppage) < nbytes)
|
|
return (DB_NEEDSPLIT);
|
|
if (space_check)
|
|
return (0);
|
|
|
|
memset(&bi, 0, sizeof(bi));
|
|
bi.len = nksize;
|
|
B_TSET(bi.type, child_bk->type, 0);
|
|
bi.pgno = rchild->pgno;
|
|
bi.nrecs = nrecs;
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
memset(&data, 0, sizeof(data));
|
|
data.data = child_bk->data;
|
|
data.size = nksize;
|
|
if ((ret = __db_pitem(dbc, ppage, off,
|
|
BINTERNAL_SIZE(nksize), &hdr, &data)) != 0)
|
|
return (ret);
|
|
break;
|
|
case B_DUPLICATE:
|
|
case B_OVERFLOW:
|
|
nbytes = BINTERNAL_PSIZE(BOVERFLOW_SIZE);
|
|
|
|
if (P_FREESPACE(dbp, ppage) < nbytes)
|
|
return (DB_NEEDSPLIT);
|
|
if (space_check)
|
|
return (0);
|
|
|
|
memset(&bi, 0, sizeof(bi));
|
|
bi.len = BOVERFLOW_SIZE;
|
|
B_TSET(bi.type, child_bk->type, 0);
|
|
bi.pgno = rchild->pgno;
|
|
bi.nrecs = nrecs;
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
hdr.data = &bi;
|
|
hdr.size = SSZA(BINTERNAL, data);
|
|
memset(&data, 0, sizeof(data));
|
|
data.data = child_bk;
|
|
data.size = BOVERFLOW_SIZE;
|
|
if ((ret = __db_pitem(dbc, ppage, off,
|
|
BINTERNAL_SIZE(BOVERFLOW_SIZE), &hdr, &data)) != 0)
|
|
return (ret);
|
|
|
|
/* Increment the overflow ref count. */
|
|
if (B_TYPE(child_bk->type) == B_OVERFLOW)
|
|
if ((ret = __db_ovref(dbc,
|
|
((BOVERFLOW *)child_bk)->pgno, 1)) != 0)
|
|
return (ret);
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, rchild->pgno));
|
|
}
|
|
break;
|
|
case P_IRECNO:
|
|
case P_LRECNO:
|
|
nbytes = RINTERNAL_PSIZE;
|
|
|
|
if (P_FREESPACE(dbp, ppage) < nbytes)
|
|
return (DB_NEEDSPLIT);
|
|
if (space_check)
|
|
return (0);
|
|
|
|
/* Add a new record for the right page. */
|
|
memset(&hdr, 0, sizeof(hdr));
|
|
hdr.data = &ri;
|
|
hdr.size = RINTERNAL_SIZE;
|
|
ri.pgno = rchild->pgno;
|
|
ri.nrecs = nrecs;
|
|
if ((ret = __db_pitem(dbc,
|
|
ppage, off, RINTERNAL_SIZE, &hdr, NULL)) != 0)
|
|
return (ret);
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, rchild->pgno));
|
|
}
|
|
|
|
/*
|
|
* If a Recno or Btree with record numbers AM page, or an off-page
|
|
* duplicates tree, adjust the parent page's left page record count.
|
|
*/
|
|
if (F_ISSET(cp, C_RECNUM)) {
|
|
/* Log the change. */
|
|
if (DBC_LOGGING(dbc)) {
|
|
if ((ret = __bam_cadjust_log(dbp, dbc->txn,
|
|
&LSN(ppage), 0, PGNO(ppage),
|
|
&LSN(ppage), parent->indx, -(int32_t)nrecs, 0)) != 0)
|
|
return (ret);
|
|
} else
|
|
LSN_NOT_LOGGED(LSN(ppage));
|
|
|
|
/* Update the left page count. */
|
|
if (dbc->dbtype == DB_RECNO)
|
|
GET_RINTERNAL(dbp, ppage, parent->indx)->nrecs -= nrecs;
|
|
else
|
|
GET_BINTERNAL(dbp, ppage, parent->indx)->nrecs -= nrecs;
|
|
}
|
|
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __bam_psplit --
|
|
* Do the real work of splitting the page.
|
|
*/
|
|
static int
|
|
__bam_psplit(dbc, cp, lp, rp, splitret)
|
|
DBC *dbc;
|
|
EPG *cp;
|
|
PAGE *lp, *rp;
|
|
db_indx_t *splitret;
|
|
{
|
|
DB *dbp;
|
|
PAGE *pp;
|
|
db_indx_t half, *inp, nbytes, off, splitp, top;
|
|
int adjust, cnt, iflag, isbigkey, ret;
|
|
|
|
dbp = dbc->dbp;
|
|
pp = cp->page;
|
|
inp = P_INP(dbp, pp);
|
|
adjust = TYPE(pp) == P_LBTREE ? P_INDX : O_INDX;
|
|
|
|
/*
|
|
* If we're splitting the first (last) page on a level because we're
|
|
* inserting (appending) a key to it, it's likely that the data is
|
|
* sorted. Moving a single item to the new page is less work and can
|
|
* push the fill factor higher than normal. This is trivial when we
|
|
* are splitting a new page before the beginning of the tree, all of
|
|
* the interesting tests are against values of 0.
|
|
*
|
|
* Catching appends to the tree is harder. In a simple append, we're
|
|
* inserting an item that sorts past the end of the tree; the cursor
|
|
* will point past the last element on the page. But, in trees with
|
|
* duplicates, the cursor may point to the last entry on the page --
|
|
* in this case, the entry will also be the last element of a duplicate
|
|
* set (the last because the search call specified the S_DUPLAST flag).
|
|
* The only way to differentiate between an insert immediately before
|
|
* the last item in a tree or an append after a duplicate set which is
|
|
* also the last item in the tree is to call the comparison function.
|
|
* When splitting internal pages during an append, the search code
|
|
* guarantees the cursor always points to the largest page item less
|
|
* than the new internal entry. To summarize, we want to catch three
|
|
* possible index values:
|
|
*
|
|
* NUM_ENT(page) Btree/Recno leaf insert past end-of-tree
|
|
* NUM_ENT(page) - O_INDX Btree or Recno internal insert past EOT
|
|
* NUM_ENT(page) - P_INDX Btree leaf insert past EOT after a set
|
|
* of duplicates
|
|
*
|
|
* two of which, (NUM_ENT(page) - O_INDX or P_INDX) might be an insert
|
|
* near the end of the tree, and not after the end of the tree at all.
|
|
* Do a simple test which might be wrong because calling the comparison
|
|
* functions is expensive. Regardless, it's not a big deal if we're
|
|
* wrong, we'll do the split the right way next time.
|
|
*/
|
|
off = 0;
|
|
if (NEXT_PGNO(pp) == PGNO_INVALID && cp->indx >= NUM_ENT(pp) - adjust)
|
|
off = NUM_ENT(pp) - adjust;
|
|
else if (PREV_PGNO(pp) == PGNO_INVALID && cp->indx == 0)
|
|
off = adjust;
|
|
if (off != 0)
|
|
goto sort;
|
|
|
|
/*
|
|
* Split the data to the left and right pages. Try not to split on
|
|
* an overflow key. (Overflow keys on internal pages will slow down
|
|
* searches.) Refuse to split in the middle of a set of duplicates.
|
|
*
|
|
* First, find the optimum place to split.
|
|
*
|
|
* It's possible to try and split past the last record on the page if
|
|
* there's a very large record at the end of the page. Make sure this
|
|
* doesn't happen by bounding the check at the next-to-last entry on
|
|
* the page.
|
|
*
|
|
* Note, we try and split half the data present on the page. This is
|
|
* because another process may have already split the page and left
|
|
* it half empty. We don't try and skip the split -- we don't know
|
|
* how much space we're going to need on the page, and we may need up
|
|
* to half the page for a big item, so there's no easy test to decide
|
|
* if we need to split or not. Besides, if two threads are inserting
|
|
* data into the same place in the database, we're probably going to
|
|
* need more space soon anyway.
|
|
*/
|
|
top = NUM_ENT(pp) - adjust;
|
|
half = (dbp->pgsize - HOFFSET(pp)) / 2;
|
|
for (nbytes = 0, off = 0; off < top && nbytes < half; ++off)
|
|
switch (TYPE(pp)) {
|
|
case P_IBTREE:
|
|
if (B_TYPE(
|
|
GET_BINTERNAL(dbp, pp, off)->type) == B_KEYDATA)
|
|
nbytes += BINTERNAL_SIZE(
|
|
GET_BINTERNAL(dbp, pp, off)->len);
|
|
else
|
|
nbytes += BINTERNAL_SIZE(BOVERFLOW_SIZE);
|
|
break;
|
|
case P_LBTREE:
|
|
if (B_TYPE(GET_BKEYDATA(dbp, pp, off)->type) ==
|
|
B_KEYDATA)
|
|
nbytes += BKEYDATA_SIZE(GET_BKEYDATA(dbp,
|
|
pp, off)->len);
|
|
else
|
|
nbytes += BOVERFLOW_SIZE;
|
|
|
|
++off;
|
|
/* FALLTHROUGH */
|
|
case P_LDUP:
|
|
case P_LRECNO:
|
|
if (B_TYPE(GET_BKEYDATA(dbp, pp, off)->type) ==
|
|
B_KEYDATA)
|
|
nbytes += BKEYDATA_SIZE(GET_BKEYDATA(dbp,
|
|
pp, off)->len);
|
|
else
|
|
nbytes += BOVERFLOW_SIZE;
|
|
break;
|
|
case P_IRECNO:
|
|
nbytes += RINTERNAL_SIZE;
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, pp->pgno));
|
|
}
|
|
sort: splitp = off;
|
|
|
|
/*
|
|
* Splitp is either at or just past the optimum split point. If the
|
|
* tree type is such that we're going to promote a key to an internal
|
|
* page, and our current choice is an overflow key, look for something
|
|
* close by that's smaller.
|
|
*/
|
|
switch (TYPE(pp)) {
|
|
case P_IBTREE:
|
|
iflag = 1;
|
|
isbigkey =
|
|
B_TYPE(GET_BINTERNAL(dbp, pp, off)->type) != B_KEYDATA;
|
|
break;
|
|
case P_LBTREE:
|
|
case P_LDUP:
|
|
iflag = 0;
|
|
isbigkey = B_TYPE(GET_BKEYDATA(dbp, pp, off)->type) !=
|
|
B_KEYDATA;
|
|
break;
|
|
default:
|
|
iflag = isbigkey = 0;
|
|
}
|
|
if (isbigkey)
|
|
for (cnt = 1; cnt <= 3; ++cnt) {
|
|
off = splitp + cnt * adjust;
|
|
if (off < (db_indx_t)NUM_ENT(pp) &&
|
|
((iflag && B_TYPE(
|
|
GET_BINTERNAL(dbp, pp,off)->type) == B_KEYDATA) ||
|
|
B_TYPE(GET_BKEYDATA(dbp, pp, off)->type) ==
|
|
B_KEYDATA)) {
|
|
splitp = off;
|
|
break;
|
|
}
|
|
if (splitp <= (db_indx_t)(cnt * adjust))
|
|
continue;
|
|
off = splitp - cnt * adjust;
|
|
if (iflag ? B_TYPE(
|
|
GET_BINTERNAL(dbp, pp, off)->type) == B_KEYDATA :
|
|
B_TYPE(GET_BKEYDATA(dbp, pp, off)->type) ==
|
|
B_KEYDATA) {
|
|
splitp = off;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* We can't split in the middle a set of duplicates. We know that
|
|
* no duplicate set can take up more than about 25% of the page,
|
|
* because that's the point where we push it off onto a duplicate
|
|
* page set. So, this loop can't be unbounded.
|
|
*/
|
|
if (TYPE(pp) == P_LBTREE &&
|
|
inp[splitp] == inp[splitp - adjust])
|
|
for (cnt = 1;; ++cnt) {
|
|
off = splitp + cnt * adjust;
|
|
if (off < NUM_ENT(pp) &&
|
|
inp[splitp] != inp[off]) {
|
|
splitp = off;
|
|
break;
|
|
}
|
|
if (splitp <= (db_indx_t)(cnt * adjust))
|
|
continue;
|
|
off = splitp - cnt * adjust;
|
|
if (inp[splitp] != inp[off]) {
|
|
splitp = off + adjust;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* We're going to split at splitp. */
|
|
if ((ret = __bam_copy(dbp, pp, lp, 0, splitp)) != 0)
|
|
return (ret);
|
|
if ((ret = __bam_copy(dbp, pp, rp, splitp, NUM_ENT(pp))) != 0)
|
|
return (ret);
|
|
|
|
*splitret = splitp;
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __bam_copy --
|
|
* Copy a set of records from one page to another.
|
|
*
|
|
* PUBLIC: int __bam_copy __P((DB *, PAGE *, PAGE *, u_int32_t, u_int32_t));
|
|
*/
|
|
int
|
|
__bam_copy(dbp, pp, cp, nxt, stop)
|
|
DB *dbp;
|
|
PAGE *pp, *cp;
|
|
u_int32_t nxt, stop;
|
|
{
|
|
db_indx_t *cinp, nbytes, off, *pinp;
|
|
|
|
cinp = P_INP(dbp, cp);
|
|
pinp = P_INP(dbp, pp);
|
|
/*
|
|
* Nxt is the offset of the next record to be placed on the target page.
|
|
*/
|
|
for (off = 0; nxt < stop; ++nxt, ++NUM_ENT(cp), ++off) {
|
|
switch (TYPE(pp)) {
|
|
case P_IBTREE:
|
|
if (B_TYPE(
|
|
GET_BINTERNAL(dbp, pp, nxt)->type) == B_KEYDATA)
|
|
nbytes = BINTERNAL_SIZE(
|
|
GET_BINTERNAL(dbp, pp, nxt)->len);
|
|
else
|
|
nbytes = BINTERNAL_SIZE(BOVERFLOW_SIZE);
|
|
break;
|
|
case P_LBTREE:
|
|
/*
|
|
* If we're on a key and it's a duplicate, just copy
|
|
* the offset.
|
|
*/
|
|
if (off != 0 && (nxt % P_INDX) == 0 &&
|
|
pinp[nxt] == pinp[nxt - P_INDX]) {
|
|
cinp[off] = cinp[off - P_INDX];
|
|
continue;
|
|
}
|
|
/* FALLTHROUGH */
|
|
case P_LDUP:
|
|
case P_LRECNO:
|
|
if (B_TYPE(GET_BKEYDATA(dbp, pp, nxt)->type) ==
|
|
B_KEYDATA)
|
|
nbytes = BKEYDATA_SIZE(GET_BKEYDATA(dbp,
|
|
pp, nxt)->len);
|
|
else
|
|
nbytes = BOVERFLOW_SIZE;
|
|
break;
|
|
case P_IRECNO:
|
|
nbytes = RINTERNAL_SIZE;
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp->dbenv, pp->pgno));
|
|
}
|
|
cinp[off] = HOFFSET(cp) -= nbytes;
|
|
memcpy(P_ENTRY(dbp, cp, off), P_ENTRY(dbp, pp, nxt), nbytes);
|
|
}
|
|
return (0);
|
|
}
|