1N/A/*-
1N/A * See the file LICENSE for redistribution information.
1N/A *
1N/A * Copyright (c) 1996, 1997, 1998
1N/A * Sleepycat Software. All rights reserved.
1N/A */
1N/A
1N/A#include "config.h"
1N/A
1N/A#ifndef lint
1N/Astatic const char sccsid[] = "@(#)bt_rec.c 10.28 (Sleepycat) 9/27/98";
1N/A#endif /* not lint */
1N/A
1N/A#ifndef NO_SYSTEM_INCLUDES
1N/A#include <sys/types.h>
1N/A
1N/A#include <errno.h>
1N/A#include <string.h>
1N/A#endif
1N/A
1N/A#include "db_int.h"
1N/A#include "db_page.h"
1N/A#include "shqueue.h"
1N/A#include "hash.h"
1N/A#include "btree.h"
1N/A#include "log.h"
1N/A#include "common_ext.h"
1N/A
1N/A/*
1N/A * __bam_pg_alloc_recover --
1N/A * Recovery function for pg_alloc.
1N/A *
1N/A * PUBLIC: int __bam_pg_alloc_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_pg_alloc_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_pg_alloc_args *argp;
1N/A BTMETA *meta;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A db_pgno_t pgno;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_pg_alloc_print);
1N/A REC_INTRO(__bam_pg_alloc_read);
1N/A
1N/A /*
1N/A * Fix up the allocated page. If we're redoing the operation, we have
1N/A * to get the page (creating it if it doesn't exist), and update its
1N/A * LSN. If we're undoing the operation, we have to reset the page's
1N/A * LSN and put it on the free list.
1N/A *
1N/A * Fix up the metadata page. If we're redoing the operation, we have
1N/A * to get the metadata page and update its LSN and its free pointer.
1N/A * If we're undoing the operation and the page was ever created, we put
1N/A * it on the freelist.
1N/A */
1N/A pgno = PGNO_METADATA;
1N/A if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
1N/A /* The metadata page must always exist. */
1N/A (void)__db_pgerr(file_dbp, pgno);
1N/A goto out;
1N/A }
1N/A if ((ret = memp_fget(mpf, &argp->pgno, DB_MPOOL_CREATE, &pagep)) != 0) {
1N/A /*
1N/A * We specify creation and check for it later, because this
1N/A * operation was supposed to create the page, and even in
1N/A * the undo case it's going to get linked onto the freelist
1N/A * which we're also fixing up.
1N/A */
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A (void)memp_fput(mpf, meta, 0);
1N/A goto out;
1N/A }
1N/A
1N/A /* Fix up the allocated page. */
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->page_lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A P_INIT(pagep, file_dbp->pgsize,
1N/A argp->pgno, PGNO_INVALID, PGNO_INVALID, 0, argp->ptype);
1N/A
1N/A pagep->lsn = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A P_INIT(pagep, file_dbp->pgsize,
1N/A argp->pgno, PGNO_INVALID, meta->free, 0, P_INVALID);
1N/A
1N/A pagep->lsn = argp->page_lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
1N/A (void)memp_fput(mpf, meta, 0);
1N/A goto out;
1N/A }
1N/A
1N/A /* Fix up the metadata page. */
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(meta));
1N/A cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A meta->lsn = *lsnp;
1N/A meta->free = argp->next;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A meta->lsn = argp->meta_lsn;
1N/A meta->free = argp->pgno;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_pg_free_recover --
1N/A * Recovery function for pg_free.
1N/A *
1N/A * PUBLIC: int __bam_pg_free_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_pg_free_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_pg_free_args *argp;
1N/A BTMETA *meta;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A db_pgno_t pgno;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_pg_free_print);
1N/A REC_INTRO(__bam_pg_free_read);
1N/A
1N/A /*
1N/A * Fix up the freed page. If we're redoing the operation we get the
1N/A * page and explicitly discard its contents, then update its LSN. If
1N/A * we're undoing the operation, we get the page and restore its header.
1N/A */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A /*
1N/A * We don't automatically create the page. The only way the
1N/A * page might not exist is if the alloc never happened, and
1N/A * the only way the alloc might never have happened is if we
1N/A * are undoing, in which case there's no reason to create the
1N/A * page.
1N/A */
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &LSN(argp->header.data));
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A P_INIT(pagep, file_dbp->pgsize,
1N/A pagep->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
1N/A pagep->lsn = *lsnp;
1N/A
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A memcpy(pagep, argp->header.data, argp->header.size);
1N/A
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/A /*
1N/A * Fix up the metadata page. If we're redoing or undoing the operation
1N/A * we get the page and update its LSN and free pointer.
1N/A */
1N/A pgno = PGNO_METADATA;
1N/A if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
1N/A /* The metadata page must always exist. */
1N/A (void)__db_pgerr(file_dbp, pgno);
1N/A goto out;
1N/A }
1N/A
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(meta));
1N/A cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A meta->free = argp->pgno;
1N/A
1N/A meta->lsn = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A meta->free = argp->next;
1N/A
1N/A meta->lsn = argp->meta_lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_split_recover --
1N/A * Recovery function for split.
1N/A *
1N/A * PUBLIC: int __bam_split_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_split_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_split_args *argp;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *_lp, *lp, *np, *pp, *_rp, *rp, *sp;
1N/A db_pgno_t pgno;
1N/A int l_update, p_update, r_update, ret, rootsplit, t_ret;
1N/A
1N/A REC_PRINT(__bam_split_print);
1N/A
1N/A mpf = NULL;
1N/A _lp = lp = np = pp = _rp = rp = NULL;
1N/A
1N/A REC_INTRO(__bam_split_read);
1N/A
1N/A /*
1N/A * There are two kinds of splits that we have to recover from. The
1N/A * first is a root-page split, where the root page is split from a
1N/A * leaf page into an internal page and two new leaf pages are created.
1N/A * The second is where a page is split into two pages, and a new key
1N/A * is inserted into the parent page.
1N/A */
1N/A sp = argp->pg.data;
1N/A pgno = PGNO(sp);
1N/A rootsplit = pgno == PGNO_ROOT;
1N/A if (memp_fget(mpf, &argp->left, 0, &lp) != 0)
1N/A lp = NULL;
1N/A if (memp_fget(mpf, &argp->right, 0, &rp) != 0)
1N/A rp = NULL;
1N/A
1N/A if (redo) {
1N/A l_update = r_update = p_update = 0;
1N/A /*
1N/A * Decide if we need to resplit the page.
1N/A *
1N/A * If this is a root split, then the root has to exist, it's
1N/A * the page we're splitting and it gets modified. If this is
1N/A * not a root split, then the left page has to exist, for the
1N/A * same reason.
1N/A */
1N/A if (rootsplit) {
1N/A if ((ret = memp_fget(mpf, &pgno, 0, &pp)) != 0) {
1N/A (void)__db_pgerr(file_dbp, pgno);
1N/A pp = NULL;
1N/A goto out;
1N/A }
1N/A p_update =
1N/A log_compare(&LSN(pp), &LSN(argp->pg.data)) == 0;
1N/A } else
1N/A if (lp == NULL) {
1N/A (void)__db_pgerr(file_dbp, argp->left);
1N/A goto out;
1N/A }
1N/A if (lp == NULL || log_compare(&LSN(lp), &argp->llsn) == 0)
1N/A l_update = 1;
1N/A if (rp == NULL || log_compare(&LSN(rp), &argp->rlsn) == 0)
1N/A r_update = 1;
1N/A if (!p_update && !l_update && !r_update)
1N/A goto done;
1N/A
1N/A /* Allocate and initialize new left/right child pages. */
1N/A if ((ret = __os_malloc(file_dbp->pgsize, NULL, &_lp)) != 0 ||
1N/A (ret = __os_malloc(file_dbp->pgsize, NULL, &_rp)) != 0)
1N/A goto out;
1N/A if (rootsplit) {
1N/A P_INIT(_lp, file_dbp->pgsize, argp->left,
1N/A PGNO_INVALID,
1N/A ISINTERNAL(sp) ? PGNO_INVALID : argp->right,
1N/A LEVEL(sp), TYPE(sp));
1N/A P_INIT(_rp, file_dbp->pgsize, argp->right,
1N/A ISINTERNAL(sp) ? PGNO_INVALID : argp->left,
1N/A PGNO_INVALID, LEVEL(sp), TYPE(sp));
1N/A } else {
1N/A P_INIT(_lp, file_dbp->pgsize, PGNO(sp),
1N/A ISINTERNAL(sp) ? PGNO_INVALID : PREV_PGNO(sp),
1N/A ISINTERNAL(sp) ? PGNO_INVALID : argp->right,
1N/A LEVEL(sp), TYPE(sp));
1N/A P_INIT(_rp, file_dbp->pgsize, argp->right,
1N/A ISINTERNAL(sp) ? PGNO_INVALID : sp->pgno,
1N/A ISINTERNAL(sp) ? PGNO_INVALID : NEXT_PGNO(sp),
1N/A LEVEL(sp), TYPE(sp));
1N/A }
1N/A
1N/A /* Split the page. */
1N/A if ((ret = __bam_copy(file_dbp, sp, _lp, 0, argp->indx)) != 0 ||
1N/A (ret = __bam_copy(file_dbp, sp, _rp, argp->indx,
1N/A NUM_ENT(sp))) != 0)
1N/A goto out;
1N/A
1N/A /* If the left child is wrong, update it. */
1N/A if (lp == NULL && (ret =
1N/A memp_fget(mpf, &argp->left, DB_MPOOL_CREATE, &lp)) != 0) {
1N/A (void)__db_pgerr(file_dbp, argp->left);
1N/A lp = NULL;
1N/A goto out;
1N/A }
1N/A if (l_update) {
1N/A memcpy(lp, _lp, file_dbp->pgsize);
1N/A lp->lsn = *lsnp;
1N/A if ((ret = memp_fput(mpf, lp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A lp = NULL;
1N/A }
1N/A
1N/A /* If the right child is wrong, update it. */
1N/A if (rp == NULL && (ret = memp_fget(mpf,
1N/A &argp->right, DB_MPOOL_CREATE, &rp)) != 0) {
1N/A (void)__db_pgerr(file_dbp, argp->right);
1N/A rp = NULL;
1N/A goto out;
1N/A }
1N/A if (r_update) {
1N/A memcpy(rp, _rp, file_dbp->pgsize);
1N/A rp->lsn = *lsnp;
1N/A if ((ret = memp_fput(mpf, rp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A rp = NULL;
1N/A }
1N/A
1N/A /*
1N/A * If the parent page is wrong, update it. This is of interest
1N/A * only if it was a root split, since root splits create parent
1N/A * pages. All other splits modify a parent page, but those are
1N/A * separately logged and recovered.
1N/A */
1N/A if (rootsplit && p_update) {
1N/A if (file_dbp->type == DB_BTREE)
1N/A P_INIT(pp, file_dbp->pgsize,
1N/A PGNO_ROOT, PGNO_INVALID, PGNO_INVALID,
1N/A _lp->level + 1, P_IBTREE);
1N/A else
1N/A P_INIT(pp, file_dbp->pgsize,
1N/A PGNO_ROOT, PGNO_INVALID, PGNO_INVALID,
1N/A _lp->level + 1, P_IRECNO);
1N/A RE_NREC_SET(pp,
1N/A file_dbp->type == DB_RECNO ||
1N/A F_ISSET(file_dbp, DB_BT_RECNUM) ?
1N/A __bam_total(_lp) + __bam_total(_rp) : 0);
1N/A pp->lsn = *lsnp;
1N/A if ((ret = memp_fput(mpf, pp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A pp = NULL;
1N/A }
1N/A
1N/A /*
1N/A * Finally, redo the next-page link if necessary. This is of
1N/A * interest only if it wasn't a root split -- inserting a new
1N/A * page in the tree requires that any following page have its
1N/A * previous-page pointer updated to our new page. The next
1N/A * page must exist because we're redoing the operation.
1N/A */
1N/A if (!rootsplit && !IS_ZERO_LSN(argp->nlsn)) {
1N/A if ((ret = memp_fget(mpf, &argp->npgno, 0, &np)) != 0) {
1N/A (void)__db_pgerr(file_dbp, argp->npgno);
1N/A np = NULL;
1N/A goto out;
1N/A }
1N/A if (log_compare(&LSN(np), &argp->nlsn) == 0) {
1N/A PREV_PGNO(np) = argp->right;
1N/A np->lsn = *lsnp;
1N/A if ((ret =
1N/A memp_fput(mpf, np, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A np = NULL;
1N/A }
1N/A }
1N/A } else {
1N/A /*
1N/A * If the split page is wrong, replace its contents with the
1N/A * logged page contents. If the page doesn't exist, it means
1N/A * that the create of the page never happened, nor did any of
1N/A * the adds onto the page that caused the split, and there's
1N/A * really no undo-ing to be done.
1N/A */
1N/A if ((ret = memp_fget(mpf, &pgno, 0, &pp)) != 0) {
1N/A pp = NULL;
1N/A goto lrundo;
1N/A }
1N/A if (log_compare(lsnp, &LSN(pp)) == 0) {
1N/A memcpy(pp, argp->pg.data, argp->pg.size);
1N/A if ((ret = memp_fput(mpf, pp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A pp = NULL;
1N/A }
1N/A
1N/A /*
1N/A * If it's a root split and the left child ever existed, update
1N/A * its LSN. (If it's not a root split, we've updated the left
1N/A * page already -- it's the same as the split page.) If the
1N/A * right child ever existed, root split or not, update its LSN.
1N/A * The undo of the page allocation(s) will restore them to the
1N/A * free list.
1N/A */
1N/Alrundo: if ((rootsplit && lp != NULL) || rp != NULL) {
1N/A if (rootsplit && lp != NULL &&
1N/A log_compare(lsnp, &LSN(lp)) == 0) {
1N/A lp->lsn = argp->llsn;
1N/A if ((ret =
1N/A memp_fput(mpf, lp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A lp = NULL;
1N/A }
1N/A if (rp != NULL &&
1N/A log_compare(lsnp, &LSN(rp)) == 0) {
1N/A rp->lsn = argp->rlsn;
1N/A if ((ret =
1N/A memp_fput(mpf, rp, DB_MPOOL_DIRTY)) != 0)
1N/A goto out;
1N/A rp = NULL;
1N/A }
1N/A }
1N/A
1N/A /*
1N/A * Finally, undo the next-page link if necessary. This is of
1N/A * interest only if it wasn't a root split -- inserting a new
1N/A * page in the tree requires that any following page have its
1N/A * previous-page pointer updated to our new page. Since it's
1N/A * possible that the next-page never existed, we ignore it as
1N/A * if there's nothing to undo.
1N/A */
1N/A if (!rootsplit && !IS_ZERO_LSN(argp->nlsn)) {
1N/A if ((ret = memp_fget(mpf, &argp->npgno, 0, &np)) != 0) {
1N/A np = NULL;
1N/A goto done;
1N/A }
1N/A if (log_compare(lsnp, &LSN(np)) == 0) {
1N/A PREV_PGNO(np) = argp->left;
1N/A np->lsn = argp->nlsn;
1N/A if (memp_fput(mpf, np, DB_MPOOL_DIRTY))
1N/A goto out;
1N/A np = NULL;
1N/A }
1N/A }
1N/A }
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: /* Free any pages that weren't dirtied. */
1N/A if (pp != NULL && (t_ret = memp_fput(mpf, pp, 0)) != 0 && ret == 0)
1N/A ret = t_ret;
1N/A if (lp != NULL && (t_ret = memp_fput(mpf, lp, 0)) != 0 && ret == 0)
1N/A ret = t_ret;
1N/A if (np != NULL && (t_ret = memp_fput(mpf, np, 0)) != 0 && ret == 0)
1N/A ret = t_ret;
1N/A if (rp != NULL && (t_ret = memp_fput(mpf, rp, 0)) != 0 && ret == 0)
1N/A ret = t_ret;
1N/A
1N/A /* Free any allocated space. */
1N/A if (_lp != NULL)
1N/A __os_free(_lp, file_dbp->pgsize);
1N/A if (_rp != NULL)
1N/A __os_free(_rp, file_dbp->pgsize);
1N/A
1N/A REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_rsplit_recover --
1N/A * Recovery function for a reverse split.
1N/A *
1N/A * PUBLIC: int __bam_rsplit_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_rsplit_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_rsplit_args *argp;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A db_pgno_t pgno;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_rsplit_print);
1N/A REC_INTRO(__bam_rsplit_read);
1N/A
1N/A /* Fix the root page. */
1N/A pgno = PGNO_ROOT;
1N/A if ((ret = memp_fget(mpf, &pgno, 0, &pagep)) != 0) {
1N/A /* The root page must always exist. */
1N/A __db_pgerr(file_dbp, pgno);
1N/A goto out;
1N/A }
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->rootlsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A memcpy(pagep, argp->pgdbt.data, argp->pgdbt.size);
1N/A pagep->pgno = PGNO_ROOT;
1N/A pagep->lsn = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A P_INIT(pagep, file_dbp->pgsize, PGNO_ROOT,
1N/A argp->nrec, PGNO_INVALID, pagep->level + 1,
1N/A file_dbp->type == DB_BTREE ? P_IBTREE : P_IRECNO);
1N/A if ((ret = __db_pitem(dbc, pagep, 0,
1N/A argp->rootent.size, &argp->rootent, NULL)) != 0)
1N/A goto out;
1N/A pagep->lsn = argp->rootlsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/A /*
1N/A * Fix the page copied over the root page. It's possible that the
1N/A * page never made it to disk, so if we're undo-ing and the page
1N/A * doesn't exist, it's okay and there's nothing further to do.
1N/A */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &LSN(argp->pgdbt.data));
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A pagep->lsn = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A memcpy(pagep, argp->pgdbt.data, argp->pgdbt.size);
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_adj_recover --
1N/A * Recovery function for adj.
1N/A *
1N/A * PUBLIC: int __bam_adj_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_adj_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_adj_args *argp;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_adj_print);
1N/A REC_INTRO(__bam_adj_read);
1N/A
1N/A /* Get the page; if it never existed and we're undoing, we're done. */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A if ((ret = __bam_adjindx(dbc,
1N/A pagep, argp->indx, argp->indx_copy, argp->is_insert)) != 0)
1N/A goto err;
1N/A
1N/A LSN(pagep) = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A if ((ret = __bam_adjindx(dbc,
1N/A pagep, argp->indx, argp->indx_copy, !argp->is_insert)) != 0)
1N/A goto err;
1N/A
1N/A LSN(pagep) = argp->lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/A if (0) {
1N/Aerr: (void)memp_fput(mpf, pagep, 0);
1N/A }
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_cadjust_recover --
1N/A * Recovery function for the adjust of a count change in an internal
1N/A * page.
1N/A *
1N/A * PUBLIC: int __bam_cadjust_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_cadjust_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_cadjust_args *argp;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_cadjust_print);
1N/A REC_INTRO(__bam_cadjust_read);
1N/A
1N/A /* Get the page; if it never existed and we're undoing, we're done. */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A if (file_dbp->type == DB_BTREE &&
1N/A F_ISSET(file_dbp, DB_BT_RECNUM)) {
1N/A GET_BINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
1N/A if (argp->total && PGNO(pagep) == PGNO_ROOT)
1N/A RE_NREC_ADJ(pagep, argp->adjust);
1N/A }
1N/A if (file_dbp->type == DB_RECNO) {
1N/A GET_RINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
1N/A if (argp->total && PGNO(pagep) == PGNO_ROOT)
1N/A RE_NREC_ADJ(pagep, argp->adjust);
1N/A }
1N/A
1N/A LSN(pagep) = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A if (file_dbp->type == DB_BTREE &&
1N/A F_ISSET(file_dbp, DB_BT_RECNUM)) {
1N/A GET_BINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
1N/A if (argp->total && PGNO(pagep) == PGNO_ROOT)
1N/A RE_NREC_ADJ(pagep, argp->adjust);
1N/A }
1N/A if (file_dbp->type == DB_RECNO) {
1N/A GET_RINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
1N/A if (argp->total && PGNO(pagep) == PGNO_ROOT)
1N/A RE_NREC_ADJ(pagep, -(argp->adjust));
1N/A }
1N/A LSN(pagep) = argp->lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_cdel_recover --
1N/A * Recovery function for the intent-to-delete of a cursor record.
1N/A *
1N/A * PUBLIC: int __bam_cdel_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_cdel_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_cdel_args *argp;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A
1N/A REC_PRINT(__bam_cdel_print);
1N/A REC_INTRO(__bam_cdel_read);
1N/A
1N/A /* Get the page; if it never existed and we're undoing, we're done. */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /* Need to redo update described. */
1N/A if (pagep->type == P_DUPLICATE)
1N/A B_DSET(GET_BKEYDATA(pagep, argp->indx)->type);
1N/A else
1N/A B_DSET(GET_BKEYDATA(pagep, argp->indx + O_INDX)->type);
1N/A
1N/A LSN(pagep) = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /* Need to undo update described. */
1N/A if (pagep->type == P_DUPLICATE)
1N/A B_DCLR(GET_BKEYDATA(pagep, argp->indx)->type);
1N/A else
1N/A B_DCLR(GET_BKEYDATA(pagep, argp->indx + O_INDX)->type);
1N/A
1N/A LSN(pagep) = argp->lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/Aout: REC_CLOSE;
1N/A}
1N/A
1N/A/*
1N/A * __bam_repl_recover --
1N/A * Recovery function for page item replacement.
1N/A *
1N/A * PUBLIC: int __bam_repl_recover
1N/A * PUBLIC: __P((DB_LOG *, DBT *, DB_LSN *, int, void *));
1N/A */
1N/Aint
1N/A__bam_repl_recover(logp, dbtp, lsnp, redo, info)
1N/A DB_LOG *logp;
1N/A DBT *dbtp;
1N/A DB_LSN *lsnp;
1N/A int redo;
1N/A void *info;
1N/A{
1N/A __bam_repl_args *argp;
1N/A BKEYDATA *bk;
1N/A DB *file_dbp;
1N/A DBC *dbc;
1N/A DBT dbt;
1N/A DB_MPOOLFILE *mpf;
1N/A PAGE *pagep;
1N/A int cmp_n, cmp_p, modified, ret;
1N/A u_int8_t *p;
1N/A
1N/A REC_PRINT(__bam_repl_print);
1N/A REC_INTRO(__bam_repl_read);
1N/A
1N/A /* Get the page; if it never existed and we're undoing, we're done. */
1N/A if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
1N/A if (!redo)
1N/A goto done;
1N/A (void)__db_pgerr(file_dbp, argp->pgno);
1N/A goto out;
1N/A }
1N/A bk = GET_BKEYDATA(pagep, argp->indx);
1N/A
1N/A modified = 0;
1N/A cmp_n = log_compare(lsnp, &LSN(pagep));
1N/A cmp_p = log_compare(&LSN(pagep), &argp->lsn);
1N/A if (cmp_p == 0 && redo) {
1N/A /*
1N/A * Need to redo update described.
1N/A *
1N/A * Re-build the replacement item.
1N/A */
1N/A memset(&dbt, 0, sizeof(dbt));
1N/A dbt.size = argp->prefix + argp->suffix + argp->repl.size;
1N/A if ((ret = __os_malloc(dbt.size, NULL, &dbt.data)) != 0)
1N/A goto err;
1N/A p = dbt.data;
1N/A memcpy(p, bk->data, argp->prefix);
1N/A p += argp->prefix;
1N/A memcpy(p, argp->repl.data, argp->repl.size);
1N/A p += argp->repl.size;
1N/A memcpy(p, bk->data + (bk->len - argp->suffix), argp->suffix);
1N/A
1N/A ret = __bam_ritem(dbc, pagep, argp->indx, &dbt);
1N/A __os_free(dbt.data, dbt.size);
1N/A if (ret != 0)
1N/A goto err;
1N/A
1N/A LSN(pagep) = *lsnp;
1N/A modified = 1;
1N/A } else if (cmp_n == 0 && !redo) {
1N/A /*
1N/A * Need to undo update described.
1N/A *
1N/A * Re-build the original item.
1N/A */
1N/A memset(&dbt, 0, sizeof(dbt));
1N/A dbt.size = argp->prefix + argp->suffix + argp->orig.size;
1N/A if ((ret = __os_malloc(dbt.size, NULL, &dbt.data)) != 0)
1N/A goto err;
1N/A p = dbt.data;
1N/A memcpy(p, bk->data, argp->prefix);
1N/A p += argp->prefix;
1N/A memcpy(p, argp->orig.data, argp->orig.size);
1N/A p += argp->orig.size;
1N/A memcpy(p, bk->data + (bk->len - argp->suffix), argp->suffix);
1N/A
1N/A ret = __bam_ritem(dbc, pagep, argp->indx, &dbt);
1N/A __os_free(dbt.data, dbt.size);
1N/A if (ret != 0)
1N/A goto err;
1N/A
1N/A /* Reset the deleted flag, if necessary. */
1N/A if (argp->isdeleted)
1N/A B_DSET(GET_BKEYDATA(pagep, argp->indx)->type);
1N/A
1N/A LSN(pagep) = argp->lsn;
1N/A modified = 1;
1N/A }
1N/A if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
1N/A goto out;
1N/A
1N/Adone: *lsnp = argp->prev_lsn;
1N/A ret = 0;
1N/A
1N/A if (0) {
1N/Aerr: (void)memp_fput(mpf, pagep, 0);
1N/A }
1N/Aout: REC_CLOSE;
1N/A}