mirror of
https://sourceware.org/git/glibc.git
synced 2024-10-03 20:47:42 +00:00
cc3fa75512
1997-11-11 21:30 Ulrich Drepper <drepper@cygnus.com> * include/sys/stat.h: Define stat, fstat, lstat and *64 variants as macros so the the library compiles correctly even without optimization. * io/fstat.c: Undef fstat. * io/fstat64.c: Undef fstat64 * io/lstat.c: Undef lstat. * io/lstat64.c: Undef lstat64 * io/stat.c: Undef stat. * io/stat64.c: Undef stat64 * io/fts.c: Include <include/sys/stat.h> to get macro definitions. * io/ftw.c: Likewise. * io/getdirname.c: Likewise. * Makefile (install): Run test-installation.pl if possible. * db2/Makefile: Update from db-2.3.12. * db2/db.h: Likewise. * db2/db_int.h: Likewise. * db2/btree/bt_cursor.c: Likewise. * db2/btree/bt_delete.c: Likewise. * db2/btree/bt_open.c: Likewise. * db2/btree/bt_put.c: Likewise. * db2/btree/bt_rec.c: Likewise. * db2/btree/bt_recno.c: Likewise. * db2/btree/bt_search.c: Likewise. * db2/btree/bt_split.c: Likewise. * db2/btree/bt_stat.c: Likewise. * db2/btree/btree.src: Likewise. * db2/btree/btree_auto.c: Likewise. * db2/btree/bt_cursor.c: Likewise. * db2/btree/bt_delete.c: Likewise. * db2/btree/bt_open.c: Likewise. * db2/btree/bt_put.c: Likewise. * db2/btree/bt_rec.c: Likewise. * db2/btree/bt_recno.c: Likewise. * db2/btree/bt_search.c: Likewise. * db2/btree/bt_split.c: Likewise. * db2/btree/bt_stat.c: Likewise. * db2/btree/btree.src: Likewise. * db2/btree/btree_auto.c: Likewise. * db2/common/db_appinit.c: Likewise. * db2/common/db_apprec.c: Likewise. * db2/common/db_byteorder.c: Likewise. * db2/common/db_region.c: Likewise. * db2/db/db.c: Likewise * db2/db/db.src: Likewise * db2/db/db_auto.c: Likewise * db2/db/db_dispatch.c: Likewise * db2/db/db_dup.c: Likewise * db2/db/db_overflow.c: Likewise * db2/db/db_pr.c: Likewise * db2/db/db_rec.c: Likewise * db2/db/db_ret.c: Likewise * db2/db/db_thread.c: Likewise * db2/db185/db185.c: Likewise. * db2/hash/hash.c: Likewise. * db2/hash/hash.src: Likewise. * db2/hash/hash_auto.c: Likewise. * db2/hash/hash_dup.c: Likewise. * db2/hash/hash_page.c: Likewise. * db2/hash/hash_rec.c: Likewise. * db2/include/btree_auto.h: Likewise. * db2/include/btree_ext.h: Likewise. * db2/include/clib_ext.h: Likewise. * db2/include/common_ext.h: Likewise. * db2/include/db.h.src: Likewise. * db2/include/db_am.h: Likewise. * db2/include/db_auto.h: Likewise. * db2/include/db_cxx.h: Likewise. * db2/include/db_ext.h: Likewise. * db2/include/db_int.h.src: Likewise. * db2/include/hash.h: Likewise. * db2/include/hash_auto.h: Likewise. * db2/include/hash_ext.h: Likewise. * db2/include/lock.h: Likewise. * db2/include/lock_ext.h: Likewise. * db2/include/log.h: Likewise. * db2/include/log_ext.h: Likewise. * db2/include/mp.h: Likewise. * db2/include/mp_ext.h: Likewise. * db2/include/mutex_ext.h: Likewise. * db2/include/os_ext.h: Likewise. * db2/include/os_func.h: Likewise. * db2/include/txn.h: Likewise. * db2/include/txn_ext.h: Likewise. * db2/lock/lock.c: Likewise. * db2/lock/lock_deadlock.c: Likewise. * db2/log/log.c: Likewise. * db2/log/log_archive.c: Likewise. * db2/log/log_auto.c: Likewise. * db2/log/log_findckp.c: Likewise. * db2/log/log_get.c: Likewise. * db2/log/log_put.c: Likewise. * db2/log/log_rec.c: Likewise. * db2/log/log_register.c: Likewise. * db2/mp/mp_bh.c: Likewise. * db2/mp/mp_fget.c: Likewise. * db2/mp/mp_fopen.c: Likewise. * db2/mp/mp_fput.c: Likewise. * db2/mp/mp_fset.c: Likewise. * db2/mp/mp_open.c: Likewise. * db2/mp/mp_pr.c: Likewise. * db2/mp/mp_region.c: Likewise. * db2/mp/mp_sync.c: Likewise. * db2/mutex/mutex.c: Likewise. * db2/os/os_abs.c: Likewise. * db2/os/os_dir.c: Likewise. * db2/os/os_fid.c: Likewise. * db2/os/os_fsync.c: Likewise. * db2/os/os_func.c: Likewise. * db2/os/os_map.c: Likewise. * db2/os/os_oflags.c: Likewise. * db2/os/os_open.c: Likewise. * db2/os/os_rpath.c: Likewise. * db2/os/os_rw.c: Likewise. * db2/os/os_seek.c: Likewise. * db2/os/os_sleep.c: Likewise. * db2/os/os_stat.c: Likewise. * db2/os/os_unlink.c: Likewise. * db2/progs/db_deadlock/db_deadlock.c: Likewise. * db2/progs/db_dump/db_dump.c: Likewise. * db2/progs/db_load/db_load.c: Likewise. * db2/progs/db_recover/db_recover.c: Likewise. * db2/progs/db_stat/db_stat.c: Likewise. * db2/txn/txn.c: Likewise. * db2/txn/txn_auto.c: Likewise. * db2/txn/txn_rec.c: Likewise. * db2/os/db_os_abs.c: Removed. * db2/os/db_os_dir.c: Removed. * db2/os/db_os_fid.c: Removed. * db2/os/db_os_lseek.c: Removed. * db2/os/db_os_mmap.c: Removed. * db2/os/db_os_open.c: Removed. * db2/os/db_os_rw.c: Removed. * db2/os/db_os_sleep.c: Removed. * db2/os/db_os_stat.c: Removed. * db2/os/db_os_unlink.c: Removed. * libio/stdio.h (fopen): Add __restrict to parameters. * manual/process.texi (system): Describe behaviour for NULL argument. * stdio-common/printf-parse.h: Parse hh modifier. * stdio-common/vfprintf.c: Handle hh modifier. * stdio-common/vfscanf.c: Likewise. * manual/stdio.texi: Describe hh modifier for scanf/printf. * math/complex.h: Don't define _Imaginary_I, but instead _Complex_I. gcc does no yet know the `imaginary' keyword. * math/test-math.c: Add little test for know gcc bug. * math/tgmath.h: Make complex versions of log10() only available if __USE_GNU. * stdlib/test-canon.c: Fix typo. * sysdeps/generic/setenv.c: Avoid compilation warnings. Reported by Jim Meyering. * sysdeps/generic/bits/errno.h: EILSEQ is an ISO C error number. * sysdeps/mach/hurd/bits/errno.h: Likewise. * sysdeps/standalone/bits/errno.h: Likewise. * sysdeps/unix/sysv/linux/bits/errno.h: Likewise. * sysdeps/i386/i586/memcpy.S: New file. * sysdeps/i386/i586/mempcpy.S: New file. * sysdeps/i386/i586/memset.S: Fix typo. * sysdeps/posix/getcwd.c: Define HAVE_MEMPCPY for _LIBC. Add casts. * sysdeps/posix/system.c: Add comment to explain code. * sysdeps/wordsize-32/inttypes.h: Include <stddef.h> for wchar_t. Define PTRDIFF_{MIN,MAX}, SIG_ATOMIC_{MIN,MAX}, SIZE_MAX, WCHAR_{MIN,MAX}, WINT_{MIN,MAX}. Define wcstoimax, wcstoumax. * sysdeps/wordsize-64/inttypes.h: Likewise. * wcsmbs/wchar.h: Define WCHAR_{MIN,MAX} if not already defined. Declare __wcsto{l,ul,ll,ull}_internal only if not already done. * time/Makefile (routines): Add strfxtime. * time/strftime.c: Implement %F and %f format. * time/strfxtime.c: New file. * time/time.h: Define new types and symbols from ISO C 9X. * time/mktime.c: Little comment correction. 1997-11-10 Andreas Jaeger <aj@arthur.rhein-neckar.de> * sysdeps/libm-ieee754/s_sincosl.c: Fix typo. * sysdeps/libm-ieee754/s_tanl.c: Fix typo. * sysdeps/libm-ieee754/s_floorl.c: Correct typos. * sysdeps/libm-ieee754/e_remainderl.c: Replace EXTRACT_LDOUBLE_WORDS by GET_LDOUBLE_WORDS. * sysdeps/libm-ieee754/e_atan2l.c: Replace EXTRACT_LDOUBLE_WORDS by GET_LDOUBLE_WORDS. * sysdeps/libm-ieee754/s_scalbnl.c: Replace ";" by "," for correct variable declaration. * sysdeps/libm-ieee754/s_scalblnl.c: Likewise. * sysdeps/libm-ieee754/s_lrint.c (__lrint): Correct function. * math/libm-test.c (sqrt_test): Add test for sqrt (0.25). (asin_test): Add more test. 1997-11-10 23:34 Ulrich Drepper <drepper@cygnus.com> * sysdeps/libm-ieee754/e_asin.c: Add braces to make code clearer and to not confuse the poor compiler. * sysdeps/libm-ieee754/e_asinf.c: Likewise. Reported by vertex@cagent.com. 1997-11-09 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * elf/dl-lookup.c (do_lookup): Don't accept the base version if we require a specific one. * libio/oldfreopen.c: Bind old symbols to version GLIBC_2.0. * libio/oldiofopen.c: Likewise. * libio/oldstdfiles.c: Likewise. * libc.map: Export them. 1997-11-10 07:40 H.J. Lu <hjl@gnu.ai.mit.edu> * stdlib/exit.c (exit): Handle recursive calls to exit (). 1997-11-09 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * sysdeps/m68k/fpu/s_llrint.c: Fixed to take double argument instead of long double. * sysdeps/m68k/fpu/s_llrintf.c: New file. * sysdeps/m68k/fpu/s_llrintl.c: New file. * sysdeps/libm-ieee754/s_llrint.c: Make compilable and fix overflow condition. * sysdeps/libm-ieee754/s_llrintf.c: Fix overflow condition. * sysdeps/libm-ieee754/s_llrintl.c: Likewise. * sysdeps/libm-ieee754/s_llround.c: Likewise. * sysdeps/libm-ieee754/s_llroundf.c: Likewise. * sysdeps/libm-ieee754/s_llroundl.c: Likewise. * sysdeps/libm-ieee754/s_lrint.c: Likewise. * sysdeps/libm-ieee754/s_lrintf.c: Likewise. * sysdeps/libm-ieee754/s_lrintl.c: Likewise. * sysdeps/libm-ieee754/s_lround.c: Likewise. * sysdeps/libm-ieee754/s_lroundf.c: Likewise. * sysdeps/libm-ieee754/s_lroundl.c: Likewise. * math/libm-test.c: Test all three variants of lrint and llrint. Fix typos in lround and llround tests. Add tests for boundary cases for lrint and llround. 1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * manual/arith.texi: Misc doc fixes. * manual/ctype.texi: Likewise. * manual/pattern.texi: Likewise. * manual/terminal.texi: Likewise. 1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * sysdeps/unix/sysv/linux/xstatconv.c: Use struct assignment instead of memcpy to let the compiler use whatever it regards as optimal. * sysdeps/unix/sysv/linux/alpha/xstatconv.c: Likewise. 1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * sysdeps/unix/sysv/linux/Makefile (sysdep_headers) [$(subdir)=misc]: Add sys/prctl.h. * sysdeps/unix/sysv/linux/Dist: Distribute it. 1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * io/ftwtest-sh: Don't use the unknown which command, instead try pwd as /bin/pwd and /usr/bin/pwd. 1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> * manual/maint.texi (Tools for Installation): Don't recommend broken version 3.76.1 of make. (Porting): Fix wording. 1997-11-06 06:13 H.J. Lu <hjl@gnu.ai.mit.edu> * config.make.in (build-pic-default): New, defined with pic_default. * configure.in (pic_default): New, set to yes if PIC is default. * Makeconfig (CPPFLAGS-.o, CPPFLAGS-.op, CPPFLAGS-.og, CPPFLAGS-.ob): Add -DPIC if $(build-pic-default) is yes. 1997-11-09 18:15 Ulrich Drepper <drepper@cygnus.com> * Makerules (libc.so): Fix typo. * csu/Makefile (CFLAGS-initfini.s): Correctly fix moving function definition. Patch by Zack Weinberg <zack@rabi.phys.columbia.edu>. * stdlib/strtod.c: Handle numbers like 0.0e10000 correctly which produce ±0.0. Reported by Joe Keane <jgk@jgk.org>. * sysdeps/libm-ieee754/s_ceill.c: Fix typos. * sysdeps/libm-ieee754/s_llrint.c: Correct code, it never worked. 1997-11-06 07:00 H.J. Lu <hjl@gnu.ai.mit.edu> * sysdeps/unix/sysv/i386/i686/time.S: Removed. 1997-11-08 14:07 Thorsten Kukuk <kukuk@vt.uni-paderborn.de> * nis/libnsl.map: Add __do_niscall2 for nis_cachemgr. * nis/nis_call.c: Set UDP resend timeout correct. * nis/nss_compat/compat-grp.c: Rewritten to make it faster. * nis/nss_compat/compat-pwd.c: Likewise. * nis/nss_compat/compat-spwd.c: Likewise. * nis/ypclnt.c: Fix UDP resend timeout, fix yp_bind/do_ypcall interaction. * inet/protocols/routed.h: Include sys/socket.h. * inet/protocols/talkd.h: Likewise. * inet/protocols/timed.h: Include rpc/types.h. * sunrpc/rpc/pmap_clnt.h: Include rpc/clnt.h. 1997-11-06 01:39 Ulrich Drepper <drepper@cygnus.com> * Makerules (libc.so): Add missing closing brace. 1997-11-05 Brendan Kehoe <brendan@lisa.cygnus.com> * libio.h (__P): Name its arg `p' instead of `params'. This was added solely to work around problems with the definition of __P in the Solaris math.h header.
871 lines
22 KiB
C
871 lines
22 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996, 1997
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#ifndef lint
|
|
static const char sccsid[] = "@(#)bt_rec.c 10.17 (Sleepycat) 11/2/97";
|
|
#endif /* not lint */
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
|
|
#include <ctype.h>
|
|
#include <errno.h>
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "db_page.h"
|
|
#include "shqueue.h"
|
|
#include "hash.h"
|
|
#include "btree.h"
|
|
#include "log.h"
|
|
#include "db_dispatch.h"
|
|
#include "common_ext.h"
|
|
|
|
/*
|
|
* __bam_pg_alloc_recover --
|
|
* Recovery function for pg_alloc.
|
|
*
|
|
* PUBLIC: int __bam_pg_alloc_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_pg_alloc_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_pg_alloc_args *argp;
|
|
BTMETA *meta;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
DB *file_dbp, *mdbp;
|
|
db_pgno_t pgno;
|
|
int cmp_n, cmp_p, created, modified, ret;
|
|
|
|
REC_PRINT(__bam_pg_alloc_print);
|
|
REC_INTRO(__bam_pg_alloc_read);
|
|
|
|
/*
|
|
* Fix up the allocated page. If we're redoing the operation, we have
|
|
* to get the page (creating it if it doesn't exist), and update its
|
|
* LSN. If we're undoing the operation, we have to reset the page's
|
|
* LSN and put it on the free list.
|
|
*
|
|
* Fix up the metadata page. If we're redoing the operation, we have
|
|
* to get the metadata page and update its LSN and its free pointer.
|
|
* If we're undoing the operation and the page was ever created, we put
|
|
* it on the freelist.
|
|
*/
|
|
pgno = PGNO_METADATA;
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
|
|
(void)__db_pgerr(file_dbp, pgno);
|
|
goto out;
|
|
}
|
|
if ((ret = memp_fget(mpf, &argp->pgno, DB_MPOOL_CREATE, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
(void)memp_fput(mpf, meta, 0);
|
|
goto out;
|
|
}
|
|
|
|
/* Fix up the allocated page. */
|
|
created = IS_ZERO_LSN(LSN(pagep));
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->page_lsn);
|
|
if ((created || cmp_p == 0) && redo) {
|
|
/* Need to redo update described. */
|
|
P_INIT(pagep, file_dbp->pgsize,
|
|
argp->pgno, PGNO_INVALID, PGNO_INVALID, 0, argp->ptype);
|
|
|
|
pagep->lsn = *lsnp;
|
|
modified = 1;
|
|
} else if ((created || cmp_n == 0) && !redo) {
|
|
/* Need to undo update described. */
|
|
P_INIT(pagep, file_dbp->pgsize,
|
|
argp->pgno, PGNO_INVALID, meta->free, 0, P_INVALID);
|
|
|
|
pagep->lsn = argp->page_lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
(void)memp_fput(mpf, meta, 0);
|
|
goto out;
|
|
}
|
|
|
|
/* Fix up the metadata page. */
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(meta));
|
|
cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
meta->lsn = *lsnp;
|
|
meta->free = argp->next;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
meta->lsn = argp->meta_lsn;
|
|
meta->free = argp->pgno;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
goto out;
|
|
}
|
|
|
|
*lsnp = argp->prev_lsn;
|
|
ret = 0;
|
|
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_pg_free_recover --
|
|
* Recovery function for pg_free.
|
|
*
|
|
* PUBLIC: int __bam_pg_free_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_pg_free_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_pg_free_args *argp;
|
|
BTMETA *meta;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
db_pgno_t pgno;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
|
|
REC_PRINT(__bam_pg_free_print);
|
|
REC_INTRO(__bam_pg_free_read);
|
|
|
|
/*
|
|
* Fix up the freed page. If we're redoing the operation we get the
|
|
* page and explicitly discard its contents, then update its LSN. If
|
|
* we're undoing the operation, we get the page and restore its header.
|
|
*/
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
goto out;
|
|
}
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &LSN(argp->header.data));
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
P_INIT(pagep, file_dbp->pgsize,
|
|
pagep->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
|
|
pagep->lsn = *lsnp;
|
|
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
memcpy(pagep, argp->header.data, argp->header.size);
|
|
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* Fix up the metadata page. If we're redoing or undoing the operation
|
|
* we get the page and update its LSN and free pointer.
|
|
*/
|
|
pgno = PGNO_METADATA;
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
|
|
(void)__db_pgerr(file_dbp, pgno);
|
|
goto out;
|
|
}
|
|
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(meta));
|
|
cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
meta->free = argp->pgno;
|
|
|
|
meta->lsn = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
meta->free = argp->next;
|
|
|
|
meta->lsn = argp->meta_lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
goto out;
|
|
}
|
|
|
|
*lsnp = argp->prev_lsn;
|
|
ret = 0;
|
|
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_split_recover --
|
|
* Recovery function for split.
|
|
*
|
|
* PUBLIC: int __bam_split_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_split_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_split_args *argp;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *_lp, *lp, *np, *pp, *_rp, *rp, *sp;
|
|
db_pgno_t pgno;
|
|
int l_update, p_update, r_update, ret, rootsplit, t_ret;
|
|
|
|
REC_PRINT(__bam_split_print);
|
|
|
|
mpf = NULL;
|
|
_lp = lp = np = pp = _rp = rp = NULL;
|
|
|
|
REC_INTRO(__bam_split_read);
|
|
|
|
/*
|
|
* There are two kinds of splits that we have to recover from. The
|
|
* first is a root-page split, where the root page is split from a
|
|
* leaf page into an internal page and two new leaf pages are created.
|
|
* The second is where a page is split into two pages, and a new key
|
|
* is inserted into the parent page.
|
|
*/
|
|
sp = argp->pg.data;
|
|
pgno = PGNO(sp);
|
|
rootsplit = pgno == PGNO_ROOT;
|
|
if (memp_fget(mpf, &argp->left, 0, &lp) != 0)
|
|
lp = NULL;
|
|
if (memp_fget(mpf, &argp->right, 0, &rp) != 0)
|
|
rp = NULL;
|
|
|
|
if (redo) {
|
|
l_update = r_update = p_update = 0;
|
|
/*
|
|
* Decide if we need to resplit the page.
|
|
*
|
|
* If this is a root split, then the root has to exist, it's
|
|
* the page we're splitting and it gets modified. If this is
|
|
* not a root split, then the left page has to exist, for the
|
|
* same reason.
|
|
*/
|
|
if (rootsplit) {
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &pp)) != 0) {
|
|
(void)__db_pgerr(file_dbp, pgno);
|
|
pp = NULL;
|
|
goto out;
|
|
}
|
|
p_update =
|
|
log_compare(&LSN(pp), &LSN(argp->pg.data)) == 0;
|
|
} else
|
|
if (lp == NULL) {
|
|
(void)__db_pgerr(file_dbp, argp->left);
|
|
goto out;
|
|
}
|
|
if (lp == NULL || log_compare(&LSN(lp), &argp->llsn) == 0)
|
|
l_update = 1;
|
|
if (rp == NULL || log_compare(&LSN(rp), &argp->rlsn) == 0)
|
|
r_update = 1;
|
|
if (!p_update && !l_update && !r_update)
|
|
goto done;
|
|
|
|
/* Allocate and initialize new left/right child pages. */
|
|
if ((_lp = (PAGE *)__db_malloc(file_dbp->pgsize)) == NULL ||
|
|
(_rp = (PAGE *)__db_malloc(file_dbp->pgsize)) == NULL) {
|
|
ret = ENOMEM;
|
|
__db_err(file_dbp->dbenv, "%s", strerror(ret));
|
|
goto out;
|
|
}
|
|
if (rootsplit) {
|
|
P_INIT(_lp, file_dbp->pgsize, argp->left,
|
|
PGNO_INVALID,
|
|
ISINTERNAL(sp) ? PGNO_INVALID : argp->right,
|
|
LEVEL(sp), TYPE(sp));
|
|
P_INIT(_rp, file_dbp->pgsize, argp->right,
|
|
ISINTERNAL(sp) ? PGNO_INVALID : argp->left,
|
|
PGNO_INVALID, LEVEL(sp), TYPE(sp));
|
|
} else {
|
|
P_INIT(_lp, file_dbp->pgsize, PGNO(sp),
|
|
ISINTERNAL(sp) ? PGNO_INVALID : PREV_PGNO(sp),
|
|
ISINTERNAL(sp) ? PGNO_INVALID : argp->right,
|
|
LEVEL(sp), TYPE(sp));
|
|
P_INIT(_rp, file_dbp->pgsize, argp->right,
|
|
ISINTERNAL(sp) ? PGNO_INVALID : sp->pgno,
|
|
ISINTERNAL(sp) ? PGNO_INVALID : NEXT_PGNO(sp),
|
|
LEVEL(sp), TYPE(sp));
|
|
}
|
|
|
|
/* Split the page. */
|
|
if ((ret = __bam_copy(file_dbp, sp, _lp, 0, argp->indx)) != 0 ||
|
|
(ret = __bam_copy(file_dbp, sp, _rp, argp->indx,
|
|
NUM_ENT(sp))) != 0)
|
|
goto out;
|
|
|
|
/* If the left child is wrong, update it. */
|
|
if (lp == NULL && (ret =
|
|
memp_fget(mpf, &argp->left, DB_MPOOL_CREATE, &lp)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->left);
|
|
lp = NULL;
|
|
goto out;
|
|
}
|
|
if (l_update) {
|
|
memcpy(lp, _lp, file_dbp->pgsize);
|
|
lp->lsn = *lsnp;
|
|
if ((ret = memp_fput(mpf, lp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
lp = NULL;
|
|
}
|
|
|
|
/* If the right child is wrong, update it. */
|
|
if (rp == NULL && (ret = memp_fget(mpf,
|
|
&argp->right, DB_MPOOL_CREATE, &rp)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->right);
|
|
rp = NULL;
|
|
goto out;
|
|
}
|
|
if (r_update) {
|
|
memcpy(rp, _rp, file_dbp->pgsize);
|
|
rp->lsn = *lsnp;
|
|
if ((ret = memp_fput(mpf, rp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
rp = NULL;
|
|
}
|
|
|
|
/*
|
|
* If the parent page is wrong, update it. This is of interest
|
|
* only if it was a root split, since root splits create parent
|
|
* pages. All other splits modify a parent page, but those are
|
|
* separately logged and recovered.
|
|
*/
|
|
if (rootsplit && p_update) {
|
|
if (file_dbp->type == DB_BTREE)
|
|
P_INIT(pp, file_dbp->pgsize,
|
|
PGNO_ROOT, PGNO_INVALID, PGNO_INVALID,
|
|
_lp->level + 1, P_IBTREE);
|
|
else
|
|
P_INIT(pp, file_dbp->pgsize,
|
|
PGNO_ROOT, PGNO_INVALID, PGNO_INVALID,
|
|
_lp->level + 1, P_IRECNO);
|
|
RE_NREC_SET(pp,
|
|
file_dbp->type == DB_RECNO ||
|
|
F_ISSET(file_dbp, DB_BT_RECNUM) ?
|
|
__bam_total(_lp) + __bam_total(_rp) : 0);
|
|
pp->lsn = *lsnp;
|
|
if ((ret = memp_fput(mpf, pp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
pp = NULL;
|
|
}
|
|
|
|
/*
|
|
* Finally, redo the next-page link if necessary. This is of
|
|
* interest only if it wasn't a root split -- inserting a new
|
|
* page in the tree requires that any following page have its
|
|
* previous-page pointer updated to our new page. The next
|
|
* page had better exist.
|
|
*/
|
|
if (!rootsplit && !IS_ZERO_LSN(argp->nlsn)) {
|
|
if ((ret = memp_fget(mpf, &argp->npgno, 0, &np)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->npgno);
|
|
np = NULL;
|
|
goto out;
|
|
}
|
|
if (log_compare(&LSN(np), &argp->nlsn) == 0) {
|
|
PREV_PGNO(np) = argp->right;
|
|
np->lsn = *lsnp;
|
|
if ((ret = memp_fput(mpf,
|
|
np, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
np = NULL;
|
|
}
|
|
}
|
|
} else {
|
|
/*
|
|
* If the split page is wrong, replace its contents with the
|
|
* logged page contents. The split page had better exist.
|
|
*/
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &pp)) != 0) {
|
|
(void)__db_pgerr(file_dbp, pgno);
|
|
pp = NULL;
|
|
goto out;
|
|
}
|
|
if (log_compare(lsnp, &LSN(pp)) == 0) {
|
|
memcpy(pp, argp->pg.data, argp->pg.size);
|
|
if ((ret = memp_fput(mpf, pp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
pp = NULL;
|
|
}
|
|
|
|
/*
|
|
* If it's a root split and the left child ever existed, put
|
|
* it on the free list. (If it's not a root split, we just
|
|
* updated the left page -- it's the same as the split page.)
|
|
* If the right child ever existed, root split or not, put it
|
|
* on the free list.
|
|
*/
|
|
if ((rootsplit && lp != NULL) || rp != NULL) {
|
|
if (rootsplit && lp != NULL &&
|
|
log_compare(lsnp, &LSN(lp)) == 0) {
|
|
lp->lsn = argp->llsn;
|
|
if ((ret =
|
|
memp_fput(mpf, lp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
lp = NULL;
|
|
}
|
|
if (rp != NULL &&
|
|
log_compare(lsnp, &LSN(rp)) == 0) {
|
|
rp->lsn = argp->rlsn;
|
|
if ((ret =
|
|
memp_fput(mpf, rp, DB_MPOOL_DIRTY)) != 0)
|
|
goto fatal;
|
|
rp = NULL;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Finally, undo the next-page link if necessary. This is of
|
|
* interest only if it wasn't a root split -- inserting a new
|
|
* page in the tree requires that any following page have its
|
|
* previous-page pointer updated to our new page. The next
|
|
* page had better exist.
|
|
*/
|
|
if (!rootsplit && !IS_ZERO_LSN(argp->nlsn)) {
|
|
if ((ret = memp_fget(mpf, &argp->npgno, 0, &np)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->npgno);
|
|
np = NULL;
|
|
goto out;
|
|
}
|
|
if (log_compare(lsnp, &LSN(np)) == 0) {
|
|
PREV_PGNO(np) = argp->left;
|
|
np->lsn = argp->nlsn;
|
|
if (memp_fput(mpf, np, DB_MPOOL_DIRTY))
|
|
goto fatal;
|
|
np = NULL;
|
|
}
|
|
}
|
|
}
|
|
|
|
done: ret = 0;
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
if (0) {
|
|
fatal: (void)__db_panic(file_dbp);
|
|
}
|
|
out: /* Free any pages that weren't dirtied. */
|
|
if (pp != NULL && (t_ret = memp_fput(mpf, pp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (lp != NULL && (t_ret = memp_fput(mpf, lp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (np != NULL && (t_ret = memp_fput(mpf, np, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
if (rp != NULL && (t_ret = memp_fput(mpf, rp, 0)) != 0 && ret == 0)
|
|
ret = t_ret;
|
|
|
|
/* Free any allocated space. */
|
|
if (_lp != NULL)
|
|
__db_free(_lp);
|
|
if (_rp != NULL)
|
|
__db_free(_rp);
|
|
|
|
REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_rsplit_recover --
|
|
* Recovery function for a reverse split.
|
|
*
|
|
* PUBLIC: int __bam_rsplit_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_rsplit_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_rsplit_args *argp;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
db_pgno_t pgno;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
|
|
REC_PRINT(__bam_rsplit_print);
|
|
REC_INTRO(__bam_rsplit_read);
|
|
|
|
/* Fix the root page. */
|
|
pgno = PGNO_ROOT;
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &pagep)) != 0) {
|
|
__db_pgerr(file_dbp, pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->rootlsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
memcpy(pagep, argp->pgdbt.data, argp->pgdbt.size);
|
|
pagep->pgno = PGNO_ROOT;
|
|
pagep->lsn = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
P_INIT(pagep, file_dbp->pgsize, PGNO_ROOT,
|
|
argp->nrec, PGNO_INVALID, pagep->level + 1,
|
|
file_dbp->type == DB_BTREE ? P_IBTREE : P_IRECNO);
|
|
if ((ret = __db_pitem(file_dbp, pagep, 0,
|
|
argp->rootent.size, &argp->rootent, NULL)) != 0)
|
|
goto out;
|
|
pagep->lsn = argp->rootlsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
goto out;
|
|
}
|
|
|
|
/* Fix the page copied over the root page. */
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &LSN(argp->pgdbt.data));
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
pagep->lsn = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
memcpy(pagep, argp->pgdbt.data, argp->pgdbt.size);
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
|
(void)__db_panic(file_dbp);
|
|
goto out;
|
|
}
|
|
|
|
ret = 0;
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_adj_recover --
|
|
* Recovery function for adj.
|
|
*
|
|
* PUBLIC: int __bam_adj_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_adj_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_adj_args *argp;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
|
|
REC_PRINT(__bam_adj_print);
|
|
REC_INTRO(__bam_adj_read);
|
|
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
if ((ret = __bam_adjindx(file_dbp,
|
|
pagep, argp->indx, argp->indx_copy, argp->is_insert)) != 0)
|
|
goto err;
|
|
|
|
LSN(pagep) = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
if ((ret = __bam_adjindx(file_dbp,
|
|
pagep, argp->indx, argp->indx_copy, !argp->is_insert)) != 0)
|
|
goto err;
|
|
|
|
LSN(pagep) = argp->lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) == 0)
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
if (0) {
|
|
err: (void)memp_fput(mpf, pagep, 0);
|
|
}
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_cadjust_recover --
|
|
* Recovery function for the adjust of a count change in an internal
|
|
* page.
|
|
*
|
|
* PUBLIC: int __bam_cadjust_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_cadjust_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_cadjust_args *argp;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
|
|
REC_PRINT(__bam_cadjust_print);
|
|
REC_INTRO(__bam_cadjust_read);
|
|
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
if (file_dbp->type == DB_BTREE &&
|
|
F_ISSET(file_dbp, DB_BT_RECNUM)) {
|
|
GET_BINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
|
|
if (argp->total && PGNO(pagep) == PGNO_ROOT)
|
|
RE_NREC_ADJ(pagep, argp->adjust);
|
|
}
|
|
if (file_dbp->type == DB_RECNO) {
|
|
GET_RINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
|
|
if (argp->total && PGNO(pagep) == PGNO_ROOT)
|
|
RE_NREC_ADJ(pagep, argp->adjust);
|
|
}
|
|
|
|
LSN(pagep) = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
if (file_dbp->type == DB_BTREE &&
|
|
F_ISSET(file_dbp, DB_BT_RECNUM)) {
|
|
GET_BINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
|
|
if (argp->total && PGNO(pagep) == PGNO_ROOT)
|
|
RE_NREC_ADJ(pagep, argp->adjust);
|
|
}
|
|
if (file_dbp->type == DB_RECNO) {
|
|
GET_RINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
|
|
if (argp->total && PGNO(pagep) == PGNO_ROOT)
|
|
RE_NREC_ADJ(pagep, -(argp->adjust));
|
|
}
|
|
LSN(pagep) = argp->lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) == 0)
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_cdel_recover --
|
|
* Recovery function for the intent-to-delete of a cursor record.
|
|
*
|
|
* PUBLIC: int __bam_cdel_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_cdel_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_cdel_args *argp;
|
|
DB *file_dbp, *mdbp;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
|
|
REC_PRINT(__bam_cdel_print);
|
|
REC_INTRO(__bam_cdel_read);
|
|
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/* Need to redo update described. */
|
|
B_DSET(GET_BKEYDATA(pagep, argp->indx + O_INDX)->type);
|
|
|
|
LSN(pagep) = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/* Need to undo update described. */
|
|
B_DCLR(GET_BKEYDATA(pagep, argp->indx + O_INDX)->type);
|
|
|
|
LSN(pagep) = argp->lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) == 0)
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
out: REC_CLOSE;
|
|
}
|
|
|
|
/*
|
|
* __bam_repl_recover --
|
|
* Recovery function for page item replacement.
|
|
*
|
|
* PUBLIC: int __bam_repl_recover
|
|
* PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
|
|
*/
|
|
int
|
|
__bam_repl_recover(logp, dbtp, lsnp, redo, info)
|
|
DB_LOG *logp;
|
|
DBT *dbtp;
|
|
DB_LSN *lsnp;
|
|
int redo;
|
|
void *info;
|
|
{
|
|
__bam_repl_args *argp;
|
|
BKEYDATA *bk;
|
|
DB *file_dbp, *mdbp;
|
|
DBT dbt;
|
|
DB_MPOOLFILE *mpf;
|
|
PAGE *pagep;
|
|
int cmp_n, cmp_p, modified, ret;
|
|
u_int8_t *p;
|
|
|
|
REC_PRINT(__bam_repl_print);
|
|
REC_INTRO(__bam_repl_read);
|
|
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
|
pagep = NULL;
|
|
goto out;
|
|
}
|
|
bk = GET_BKEYDATA(pagep, argp->indx);
|
|
|
|
modified = 0;
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
|
if (cmp_p == 0 && redo) {
|
|
/*
|
|
* Need to redo update described.
|
|
*
|
|
* Re-build the replacement item.
|
|
*/
|
|
memset(&dbt, 0, sizeof(dbt));
|
|
dbt.size = argp->prefix + argp->suffix + argp->repl.size;
|
|
if ((dbt.data = __db_malloc(dbt.size)) == NULL) {
|
|
ret = ENOMEM;
|
|
goto err;
|
|
}
|
|
p = dbt.data;
|
|
memcpy(p, bk->data, argp->prefix);
|
|
p += argp->prefix;
|
|
memcpy(p, argp->repl.data, argp->repl.size);
|
|
p += argp->repl.size;
|
|
memcpy(p, bk->data + (bk->len - argp->suffix), argp->suffix);
|
|
|
|
ret = __bam_ritem(file_dbp, pagep, argp->indx, &dbt);
|
|
__db_free(dbt.data);
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
LSN(pagep) = *lsnp;
|
|
modified = 1;
|
|
} else if (cmp_n == 0 && !redo) {
|
|
/*
|
|
* Need to undo update described.
|
|
*
|
|
* Re-build the original item.
|
|
*/
|
|
memset(&dbt, 0, sizeof(dbt));
|
|
dbt.size = argp->prefix + argp->suffix + argp->orig.size;
|
|
if ((dbt.data = __db_malloc(dbt.size)) == NULL) {
|
|
ret = ENOMEM;
|
|
goto err;
|
|
}
|
|
p = dbt.data;
|
|
memcpy(p, bk->data, argp->prefix);
|
|
p += argp->prefix;
|
|
memcpy(p, argp->orig.data, argp->orig.size);
|
|
p += argp->orig.size;
|
|
memcpy(p, bk->data + (bk->len - argp->suffix), argp->suffix);
|
|
|
|
ret = __bam_ritem(file_dbp, pagep, argp->indx, &dbt);
|
|
__db_free(dbt.data);
|
|
if (ret != 0)
|
|
goto err;
|
|
|
|
/* Reset the deleted flag, if necessary. */
|
|
if (argp->isdeleted)
|
|
B_DSET(GET_BKEYDATA(pagep, argp->indx)->type);
|
|
|
|
LSN(pagep) = argp->lsn;
|
|
modified = 1;
|
|
}
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) == 0)
|
|
*lsnp = argp->prev_lsn;
|
|
|
|
if (0) {
|
|
err: (void)memp_fput(mpf, pagep, 0);
|
|
}
|
|
out: REC_CLOSE;
|
|
}
|