mirror of
https://github.com/MariaDB/server.git
synced 2025-01-19 21:42:35 +01:00
1220 lines
31 KiB
C
1220 lines
31 KiB
C
|
/*-
|
||
|
|
* See the file LICENSE for redistribution information.
|
||
|
|
*
|
||
|
|
* Copyright (c) 1996, 1997, 1998, 1999, 2000
|
||
|
|
* Sleepycat Software. All rights reserved.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "db_config.h"
|
||
|
|
|
||
|
|
#ifndef lint
|
||
|
|
static const char revid[] = "$Id: bt_rec.c,v 11.35 2001/01/10 16:24:47 ubell Exp $";
|
||
|
|
#endif /* not lint */
|
||
|
|
|
||
|
|
#ifndef NO_SYSTEM_INCLUDES
|
||
|
|
#include <sys/types.h>
|
||
|
|
|
||
|
|
#include <string.h>
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include "db_int.h"
|
||
|
|
#include "db_page.h"
|
||
|
|
#include "hash.h"
|
||
|
|
#include "btree.h"
|
||
|
|
#include "log.h"
|
||
|
|
|
||
|
|
#define IS_BTREE_PAGE(pagep) \
|
||
|
|
(TYPE(pagep) == P_IBTREE || \
|
||
|
|
TYPE(pagep) == P_LBTREE || TYPE(pagep) == P_LDUP)
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_pg_alloc_recover --
|
||
|
|
* Recovery function for pg_alloc.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_pg_alloc_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_pg_alloc_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_pg_alloc_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DBMETA *meta;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
db_pgno_t pgno;
|
||
|
|
int cmp_n, cmp_p, level, modified, ret;
|
||
|
|
|
||
|
|
REC_PRINT(__bam_pg_alloc_print);
|
||
|
|
REC_INTRO(__bam_pg_alloc_read, 0);
|
||
|
|
|
||
|
|
/*
|
||
|
|
* 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_BASE_MD;
|
||
|
|
meta = NULL;
|
||
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
|
||
|
|
/* The metadata page must always exist on redo. */
|
||
|
|
if (DB_REDO(op)) {
|
||
|
|
(void)__db_pgerr(file_dbp, pgno);
|
||
|
|
goto out;
|
||
|
|
} else
|
||
|
|
goto done;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, DB_MPOOL_CREATE, &pagep)) != 0) {
|
||
|
|
/*
|
||
|
|
* We specify creation and check for it later, because this
|
||
|
|
* operation was supposed to create the page, and even in
|
||
|
|
* the undo case it's going to get linked onto the freelist
|
||
|
|
* which we're also fixing up.
|
||
|
|
*/
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
goto err;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Fix up the allocated page. */
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), &argp->page_lsn);
|
||
|
|
|
||
|
|
/*
|
||
|
|
* If an inital allocation is aborted and then reallocated
|
||
|
|
* during an archival restore the log record will have
|
||
|
|
* an LSN for the page but the page will be empty.
|
||
|
|
*/
|
||
|
|
if (IS_ZERO_LSN(LSN(pagep)))
|
||
|
|
cmp_p = 0;
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->page_lsn);
|
||
|
|
/*
|
||
|
|
* If we we rolled back this allocation previously during an
|
||
|
|
* archive restore, the page may have the LSN of the meta page
|
||
|
|
* at the point of the roll back. This will be no more
|
||
|
|
* than the LSN of the metadata page at the time of this allocation.
|
||
|
|
*/
|
||
|
|
if (DB_REDO(op) &&
|
||
|
|
(cmp_p == 0 ||
|
||
|
|
(IS_ZERO_LSN(argp->page_lsn) &&
|
||
|
|
log_compare(&LSN(pagep), &argp->meta_lsn) <= 0))) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
switch (argp->ptype) {
|
||
|
|
case P_LBTREE:
|
||
|
|
case P_LRECNO:
|
||
|
|
case P_LDUP:
|
||
|
|
level = LEAFLEVEL;
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
level = 0;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
P_INIT(pagep, file_dbp->pgsize,
|
||
|
|
argp->pgno, PGNO_INVALID, PGNO_INVALID, level, argp->ptype);
|
||
|
|
|
||
|
|
pagep->lsn = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/*
|
||
|
|
* Undo the allocation, reinitialize the page and
|
||
|
|
* link its next pointer to the free list.
|
||
|
|
*/
|
||
|
|
P_INIT(pagep, file_dbp->pgsize,
|
||
|
|
argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
|
||
|
|
|
||
|
|
pagep->lsn = argp->page_lsn;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0) {
|
||
|
|
goto err;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* If the page was newly created, put it on the limbo list.
|
||
|
|
*/
|
||
|
|
if (IS_ZERO_LSN(LSN(pagep)) &&
|
||
|
|
IS_ZERO_LSN(argp->page_lsn) && DB_UNDO(op)) {
|
||
|
|
/* Put the page in limbo.*/
|
||
|
|
if ((ret = __db_add_limbo(dbenv,
|
||
|
|
info, argp->fileid, argp->pgno, 1)) != 0)
|
||
|
|
goto err;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Fix up the metadata page. */
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(meta));
|
||
|
|
cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(meta), &argp->meta_lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
LSN(meta) = *lsnp;
|
||
|
|
meta->free = argp->next;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo update described. */
|
||
|
|
LSN(meta) = argp->meta_lsn;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* If the page has a zero LSN then its newly created
|
||
|
|
* and will go into limbo rather than directly on the
|
||
|
|
* free list.
|
||
|
|
*/
|
||
|
|
if (!IS_ZERO_LSN(argp->page_lsn))
|
||
|
|
meta->free = argp->pgno;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0)
|
||
|
|
goto out;
|
||
|
|
/*
|
||
|
|
* This could be the metapage from a subdb which is read from disk
|
||
|
|
* to recover its creation.
|
||
|
|
*/
|
||
|
|
if (F_ISSET(file_dbp, DB_AM_SUBDB))
|
||
|
|
switch (argp->type) {
|
||
|
|
case P_BTREEMETA:
|
||
|
|
case P_HASHMETA:
|
||
|
|
case P_QAMMETA:
|
||
|
|
file_dbp->sync(file_dbp, 0);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
if (0) {
|
||
|
|
err:
|
||
|
|
if (meta != NULL)
|
||
|
|
(void)memp_fput(mpf, meta, 0);
|
||
|
|
}
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_pg_free_recover --
|
||
|
|
* Recovery function for pg_free.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_pg_free_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_pg_free_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_pg_free_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DBMETA *meta;
|
||
|
|
DB_LSN copy_lsn;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
db_pgno_t pgno;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_pg_free_print);
|
||
|
|
REC_INTRO(__bam_pg_free_read, 1);
|
||
|
|
|
||
|
|
/*
|
||
|
|
* 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.
|
||
|
|
* Create the page if necessary, we may be freeing an aborted
|
||
|
|
* create.
|
||
|
|
*/
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, DB_MPOOL_CREATE, &pagep)) != 0)
|
||
|
|
goto out;
|
||
|
|
modified = 0;
|
||
|
|
__ua_memcpy(©_lsn, &LSN(argp->header.data), sizeof(DB_LSN));
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), ©_lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), ©_lsn);
|
||
|
|
if (DB_REDO(op) &&
|
||
|
|
(cmp_p == 0 ||
|
||
|
|
(IS_ZERO_LSN(copy_lsn) &&
|
||
|
|
log_compare(&LSN(pagep), &argp->meta_lsn) <= 0))) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
P_INIT(pagep, file_dbp->pgsize,
|
||
|
|
argp->pgno, PGNO_INVALID, argp->next, 0, P_INVALID);
|
||
|
|
pagep->lsn = *lsnp;
|
||
|
|
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* 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)
|
||
|
|
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_BASE_MD;
|
||
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &meta)) != 0) {
|
||
|
|
/* The metadata page must always exist. */
|
||
|
|
(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);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(meta), &argp->meta_lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo the deallocation. */
|
||
|
|
meta->free = argp->pgno;
|
||
|
|
LSN(meta) = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo the deallocation. */
|
||
|
|
meta->free = argp->next;
|
||
|
|
LSN(meta) = argp->meta_lsn;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_split_recover --
|
||
|
|
* Recovery function for split.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_split_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_split_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_split_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *_lp, *lp, *np, *pp, *_rp, *rp, *sp;
|
||
|
|
db_pgno_t pgno, root_pgno;
|
||
|
|
u_int32_t ptype;
|
||
|
|
int cmp, l_update, p_update, r_update, rc, ret, rootsplit, t_ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_split_print);
|
||
|
|
|
||
|
|
mpf = NULL;
|
||
|
|
_lp = lp = np = pp = _rp = rp = NULL;
|
||
|
|
sp = NULL;
|
||
|
|
|
||
|
|
REC_INTRO(__bam_split_read, 1);
|
||
|
|
|
||
|
|
/*
|
||
|
|
* 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.
|
||
|
|
*
|
||
|
|
* DBTs are not aligned in log records, so we need to copy the page
|
||
|
|
* so that we can access fields within it throughout this routine.
|
||
|
|
* Although we could hardcode the unaligned copies in this routine,
|
||
|
|
* we will be calling into regular btree functions with this page,
|
||
|
|
* so it's got to be aligned. Copying it into allocated memory is
|
||
|
|
* the only way to guarantee this.
|
||
|
|
*/
|
||
|
|
if ((ret = __os_malloc(dbenv, argp->pg.size, NULL, &sp)) != 0)
|
||
|
|
goto out;
|
||
|
|
memcpy(sp, argp->pg.data, argp->pg.size);
|
||
|
|
|
||
|
|
pgno = PGNO(sp);
|
||
|
|
root_pgno = argp->root_pgno;
|
||
|
|
rootsplit = pgno == root_pgno;
|
||
|
|
if (memp_fget(mpf, &argp->left, 0, &lp) != 0)
|
||
|
|
lp = NULL;
|
||
|
|
if (memp_fget(mpf, &argp->right, 0, &rp) != 0)
|
||
|
|
rp = NULL;
|
||
|
|
|
||
|
|
if (DB_REDO(op)) {
|
||
|
|
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;
|
||
|
|
}
|
||
|
|
cmp = log_compare(&LSN(pp), &LSN(argp->pg.data));
|
||
|
|
CHECK_LSN(op, cmp, &LSN(pp), &LSN(argp->pg.data));
|
||
|
|
p_update = cmp == 0;
|
||
|
|
} else if (lp == NULL) {
|
||
|
|
(void)__db_pgerr(file_dbp, argp->left);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (lp != NULL) {
|
||
|
|
cmp = log_compare(&LSN(lp), &argp->llsn);
|
||
|
|
CHECK_LSN(op, cmp, &LSN(lp), &argp->llsn);
|
||
|
|
if (cmp == 0)
|
||
|
|
l_update = 1;
|
||
|
|
} else
|
||
|
|
l_update = 1;
|
||
|
|
|
||
|
|
if (rp != NULL) {
|
||
|
|
cmp = log_compare(&LSN(rp), &argp->rlsn);
|
||
|
|
CHECK_LSN(op, cmp, &LSN(rp), &argp->rlsn);
|
||
|
|
if (cmp == 0)
|
||
|
|
r_update = 1;
|
||
|
|
} else
|
||
|
|
r_update = 1;
|
||
|
|
if (!p_update && !l_update && !r_update)
|
||
|
|
goto check_next;
|
||
|
|
|
||
|
|
/* Allocate and initialize new left/right child pages. */
|
||
|
|
if ((ret =
|
||
|
|
__os_malloc(dbenv, file_dbp->pgsize, NULL, &_lp)) != 0
|
||
|
|
|| (ret =
|
||
|
|
__os_malloc(dbenv, file_dbp->pgsize, NULL, &_rp)) != 0)
|
||
|
|
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 out;
|
||
|
|
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 out;
|
||
|
|
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 (IS_BTREE_PAGE(sp)) {
|
||
|
|
ptype = P_IBTREE;
|
||
|
|
rc = argp->opflags & SPL_NRECS ? 1 : 0;
|
||
|
|
} else {
|
||
|
|
ptype = P_IRECNO;
|
||
|
|
rc = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
P_INIT(pp, file_dbp->pgsize, root_pgno,
|
||
|
|
PGNO_INVALID, PGNO_INVALID, _lp->level + 1, ptype);
|
||
|
|
RE_NREC_SET(pp,
|
||
|
|
rc ? __bam_total(_lp) + __bam_total(_rp) : 0);
|
||
|
|
|
||
|
|
pp->lsn = *lsnp;
|
||
|
|
if ((ret = memp_fput(mpf, pp, DB_MPOOL_DIRTY)) != 0)
|
||
|
|
goto out;
|
||
|
|
pp = NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
check_next: /*
|
||
|
|
* 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 must exist because we're redoing the operation.
|
||
|
|
*/
|
||
|
|
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;
|
||
|
|
}
|
||
|
|
cmp = log_compare(&LSN(np), &argp->nlsn);
|
||
|
|
CHECK_LSN(op, cmp, &LSN(np), &argp->nlsn);
|
||
|
|
if (cmp == 0) {
|
||
|
|
PREV_PGNO(np) = argp->right;
|
||
|
|
np->lsn = *lsnp;
|
||
|
|
if ((ret =
|
||
|
|
memp_fput(mpf, np, DB_MPOOL_DIRTY)) != 0)
|
||
|
|
goto out;
|
||
|
|
np = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
/*
|
||
|
|
* If the split page is wrong, replace its contents with the
|
||
|
|
* logged page contents. If the page doesn't exist, it means
|
||
|
|
* that the create of the page never happened, nor did any of
|
||
|
|
* the adds onto the page that caused the split, and there's
|
||
|
|
* really no undo-ing to be done.
|
||
|
|
*/
|
||
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &pp)) != 0) {
|
||
|
|
pp = NULL;
|
||
|
|
goto lrundo;
|
||
|
|
}
|
||
|
|
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 out;
|
||
|
|
pp = NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* If it's a root split and the left child ever existed, update
|
||
|
|
* its LSN. (If it's not a root split, we've updated the left
|
||
|
|
* page already -- it's the same as the split page.) If the
|
||
|
|
* right child ever existed, root split or not, update its LSN.
|
||
|
|
* The undo of the page allocation(s) will restore them to the
|
||
|
|
* free list.
|
||
|
|
*/
|
||
|
|
lrundo: 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 out;
|
||
|
|
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 out;
|
||
|
|
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. Since it's
|
||
|
|
* possible that the next-page never existed, we ignore it as
|
||
|
|
* if there's nothing to undo.
|
||
|
|
*/
|
||
|
|
if (!rootsplit && !IS_ZERO_LSN(argp->nlsn)) {
|
||
|
|
if ((ret = memp_fget(mpf, &argp->npgno, 0, &np)) != 0) {
|
||
|
|
np = NULL;
|
||
|
|
goto done;
|
||
|
|
}
|
||
|
|
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 out;
|
||
|
|
np = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
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)
|
||
|
|
__os_free(_lp, file_dbp->pgsize);
|
||
|
|
if (_rp != NULL)
|
||
|
|
__os_free(_rp, file_dbp->pgsize);
|
||
|
|
if (sp != NULL)
|
||
|
|
__os_free(sp, argp->pg.size);
|
||
|
|
|
||
|
|
REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_rsplit_recover --
|
||
|
|
* Recovery function for a reverse split.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_rsplit_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_rsplit_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_rsplit_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_LSN copy_lsn;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
db_pgno_t pgno, root_pgno;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_rsplit_print);
|
||
|
|
REC_INTRO(__bam_rsplit_read, 1);
|
||
|
|
|
||
|
|
/* Fix the root page. */
|
||
|
|
pgno = root_pgno = argp->root_pgno;
|
||
|
|
if ((ret = memp_fget(mpf, &pgno, 0, &pagep)) != 0) {
|
||
|
|
/* The root page must always exist if we are going forward. */
|
||
|
|
if (DB_REDO(op)) {
|
||
|
|
__db_pgerr(file_dbp, pgno);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
/* This must be the root of an OPD tree. */
|
||
|
|
DB_ASSERT(root_pgno !=
|
||
|
|
((BTREE *)file_dbp->bt_internal)->bt_root);
|
||
|
|
ret = 0;
|
||
|
|
goto done;
|
||
|
|
}
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), &argp->rootlsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->rootlsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
memcpy(pagep, argp->pgdbt.data, argp->pgdbt.size);
|
||
|
|
pagep->pgno = root_pgno;
|
||
|
|
pagep->lsn = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo update described. */
|
||
|
|
P_INIT(pagep, file_dbp->pgsize, root_pgno,
|
||
|
|
argp->nrec, PGNO_INVALID, pagep->level + 1,
|
||
|
|
IS_BTREE_PAGE(pagep) ? P_IBTREE : P_IRECNO);
|
||
|
|
if ((ret = __db_pitem(dbc, 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)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Fix the page copied over the root page. It's possible that the
|
||
|
|
* page never made it to disk, so if we're undo-ing and the page
|
||
|
|
* doesn't exist, it's okay and there's nothing further to do.
|
||
|
|
*/
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
||
|
|
if (DB_UNDO(op))
|
||
|
|
goto done;
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
modified = 0;
|
||
|
|
__ua_memcpy(©_lsn, &LSN(argp->pgdbt.data), sizeof(DB_LSN));
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), ©_lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), ©_lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
pagep->lsn = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* 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)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_adj_recover --
|
||
|
|
* Recovery function for adj.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_adj_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_adj_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_adj_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_adj_print);
|
||
|
|
REC_INTRO(__bam_adj_read, 1);
|
||
|
|
|
||
|
|
/* Get the page; if it never existed and we're undoing, we're done. */
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
||
|
|
if (DB_UNDO(op))
|
||
|
|
goto done;
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
if ((ret = __bam_adjindx(dbc,
|
||
|
|
pagep, argp->indx, argp->indx_copy, argp->is_insert)) != 0)
|
||
|
|
goto err;
|
||
|
|
|
||
|
|
LSN(pagep) = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo update described. */
|
||
|
|
if ((ret = __bam_adjindx(dbc,
|
||
|
|
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)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
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_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_cadjust_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_cadjust_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_cadjust_print);
|
||
|
|
REC_INTRO(__bam_cadjust_read, 1);
|
||
|
|
|
||
|
|
/* Get the page; if it never existed and we're undoing, we're done. */
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
||
|
|
if (DB_UNDO(op))
|
||
|
|
goto done;
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
if (IS_BTREE_PAGE(pagep)) {
|
||
|
|
GET_BINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
|
||
|
|
if (argp->opflags & CAD_UPDATEROOT)
|
||
|
|
RE_NREC_ADJ(pagep, argp->adjust);
|
||
|
|
} else {
|
||
|
|
GET_RINTERNAL(pagep, argp->indx)->nrecs += argp->adjust;
|
||
|
|
if (argp->opflags & CAD_UPDATEROOT)
|
||
|
|
RE_NREC_ADJ(pagep, argp->adjust);
|
||
|
|
}
|
||
|
|
|
||
|
|
LSN(pagep) = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo update described. */
|
||
|
|
if (IS_BTREE_PAGE(pagep)) {
|
||
|
|
GET_BINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
|
||
|
|
if (argp->opflags & CAD_UPDATEROOT)
|
||
|
|
RE_NREC_ADJ(pagep, -(argp->adjust));
|
||
|
|
} else {
|
||
|
|
GET_RINTERNAL(pagep, argp->indx)->nrecs -= argp->adjust;
|
||
|
|
if (argp->opflags & CAD_UPDATEROOT)
|
||
|
|
RE_NREC_ADJ(pagep, -(argp->adjust));
|
||
|
|
}
|
||
|
|
LSN(pagep) = argp->lsn;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
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_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_cdel_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_cdel_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
u_int32_t indx;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_cdel_print);
|
||
|
|
REC_INTRO(__bam_cdel_read, 1);
|
||
|
|
|
||
|
|
/* Get the page; if it never existed and we're undoing, we're done. */
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
||
|
|
if (DB_UNDO(op))
|
||
|
|
goto done;
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
goto out;
|
||
|
|
}
|
||
|
|
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(pagep));
|
||
|
|
cmp_p = log_compare(&LSN(pagep), &argp->lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
|
||
|
|
B_DSET(GET_BKEYDATA(pagep, indx)->type);
|
||
|
|
|
||
|
|
LSN(pagep) = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Need to undo update described. */
|
||
|
|
indx = argp->indx + (TYPE(pagep) == P_LBTREE ? O_INDX : 0);
|
||
|
|
B_DCLR(GET_BKEYDATA(pagep, indx)->type);
|
||
|
|
|
||
|
|
(void)__bam_ca_delete(file_dbp, argp->pgno, argp->indx, 0);
|
||
|
|
|
||
|
|
LSN(pagep) = argp->lsn;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fput(mpf, pagep, modified ? DB_MPOOL_DIRTY : 0)) != 0)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_repl_recover --
|
||
|
|
* Recovery function for page item replacement.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_repl_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_repl_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_repl_args *argp;
|
||
|
|
BKEYDATA *bk;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DBT dbt;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
PAGE *pagep;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
u_int8_t *p;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_repl_print);
|
||
|
|
REC_INTRO(__bam_repl_read, 1);
|
||
|
|
|
||
|
|
/* Get the page; if it never existed and we're undoing, we're done. */
|
||
|
|
if ((ret = memp_fget(mpf, &argp->pgno, 0, &pagep)) != 0) {
|
||
|
|
if (DB_UNDO(op))
|
||
|
|
goto done;
|
||
|
|
(void)__db_pgerr(file_dbp, argp->pgno);
|
||
|
|
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);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(pagep), &argp->lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/*
|
||
|
|
* 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 ((ret = __os_malloc(dbenv, dbt.size, NULL, &dbt.data)) != 0)
|
||
|
|
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(dbc, pagep, argp->indx, &dbt);
|
||
|
|
__os_free(dbt.data, dbt.size);
|
||
|
|
if (ret != 0)
|
||
|
|
goto err;
|
||
|
|
|
||
|
|
LSN(pagep) = *lsnp;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/*
|
||
|
|
* 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 ((ret = __os_malloc(dbenv, dbt.size, NULL, &dbt.data)) != 0)
|
||
|
|
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(dbc, pagep, argp->indx, &dbt);
|
||
|
|
__os_free(dbt.data, dbt.size);
|
||
|
|
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)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
if (0) {
|
||
|
|
err: (void)memp_fput(mpf, pagep, 0);
|
||
|
|
}
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_root_recover --
|
||
|
|
* Recovery function for setting the root page on the meta-data page.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_root_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_root_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_root_args *argp;
|
||
|
|
BTMETA *meta;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
int cmp_n, cmp_p, modified, ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
REC_PRINT(__bam_root_print);
|
||
|
|
REC_INTRO(__bam_root_read, 0);
|
||
|
|
|
||
|
|
if ((ret = memp_fget(mpf, &argp->meta_pgno, 0, &meta)) != 0) {
|
||
|
|
/* The metadata page must always exist on redo. */
|
||
|
|
if (DB_REDO(op)) {
|
||
|
|
(void)__db_pgerr(file_dbp, argp->meta_pgno);
|
||
|
|
goto out;
|
||
|
|
} else
|
||
|
|
goto done;
|
||
|
|
}
|
||
|
|
|
||
|
|
modified = 0;
|
||
|
|
cmp_n = log_compare(lsnp, &LSN(meta));
|
||
|
|
cmp_p = log_compare(&LSN(meta), &argp->meta_lsn);
|
||
|
|
CHECK_LSN(op, cmp_p, &LSN(meta), &argp->meta_lsn);
|
||
|
|
if (cmp_p == 0 && DB_REDO(op)) {
|
||
|
|
/* Need to redo update described. */
|
||
|
|
meta->root = argp->root_pgno;
|
||
|
|
meta->dbmeta.lsn = *lsnp;
|
||
|
|
((BTREE *)file_dbp->bt_internal)->bt_root = meta->root;
|
||
|
|
modified = 1;
|
||
|
|
} else if (cmp_n == 0 && DB_UNDO(op)) {
|
||
|
|
/* Nothing to undo except lsn. */
|
||
|
|
meta->dbmeta.lsn = argp->meta_lsn;
|
||
|
|
modified = 1;
|
||
|
|
}
|
||
|
|
if ((ret = memp_fput(mpf, meta, modified ? DB_MPOOL_DIRTY : 0)) != 0)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
ret = 0;
|
||
|
|
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_curadj_recover --
|
||
|
|
* Transaction abort function to undo cursor adjustments.
|
||
|
|
* This should only be triggered by subtransaction aborts.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_curadj_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_curadj_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_curadj_args *argp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
int ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
|
||
|
|
REC_PRINT(__bam_curadj_print);
|
||
|
|
REC_INTRO(__bam_curadj_read, 0);
|
||
|
|
|
||
|
|
ret = 0;
|
||
|
|
if (op != DB_TXN_ABORT)
|
||
|
|
goto done;
|
||
|
|
|
||
|
|
switch(argp->mode) {
|
||
|
|
case DB_CA_DI:
|
||
|
|
if ((ret = __bam_ca_di(dbc, argp->from_pgno,
|
||
|
|
argp->from_indx, -(int)argp->first_indx)) != 0)
|
||
|
|
goto out;
|
||
|
|
break;
|
||
|
|
case DB_CA_DUP:
|
||
|
|
if ((ret = __bam_ca_undodup(file_dbp, argp->first_indx,
|
||
|
|
argp->from_pgno, argp->from_indx, argp->to_indx)) != 0)
|
||
|
|
goto out;
|
||
|
|
break;
|
||
|
|
|
||
|
|
case DB_CA_RSPLIT:
|
||
|
|
if ((ret =
|
||
|
|
__bam_ca_rsplit(dbc, argp->to_pgno, argp->from_pgno)) != 0)
|
||
|
|
goto out;
|
||
|
|
break;
|
||
|
|
|
||
|
|
case DB_CA_SPLIT:
|
||
|
|
__bam_ca_undosplit(file_dbp, argp->from_pgno,
|
||
|
|
argp->to_pgno, argp->left_pgno, argp->from_indx);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
out: REC_CLOSE;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* __bam_rcuradj_recover --
|
||
|
|
* Transaction abort function to undo cursor adjustments in rrecno.
|
||
|
|
* This should only be triggered by subtransaction aborts.
|
||
|
|
*
|
||
|
|
* PUBLIC: int __bam_rcuradj_recover
|
||
|
|
* PUBLIC: __P((DB_ENV *, DBT *, DB_LSN *, db_recops, void *));
|
||
|
|
*/
|
||
|
|
int
|
||
|
|
__bam_rcuradj_recover(dbenv, dbtp, lsnp, op, info)
|
||
|
|
DB_ENV *dbenv;
|
||
|
|
DBT *dbtp;
|
||
|
|
DB_LSN *lsnp;
|
||
|
|
db_recops op;
|
||
|
|
void *info;
|
||
|
|
{
|
||
|
|
__bam_rcuradj_args *argp;
|
||
|
|
BTREE_CURSOR *cp;
|
||
|
|
DB *file_dbp;
|
||
|
|
DBC *dbc, *rdbc;
|
||
|
|
DB_MPOOLFILE *mpf;
|
||
|
|
int ret, t_ret;
|
||
|
|
|
||
|
|
COMPQUIET(info, NULL);
|
||
|
|
rdbc = NULL;
|
||
|
|
|
||
|
|
REC_PRINT(__bam_rcuradj_print);
|
||
|
|
REC_INTRO(__bam_rcuradj_read, 0);
|
||
|
|
|
||
|
|
ret = t_ret = 0;
|
||
|
|
|
||
|
|
if (op != DB_TXN_ABORT)
|
||
|
|
goto done;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* We don't know whether we're in an offpage dup set, and
|
||
|
|
* thus don't know whether the dbc REC_INTRO has handed us is
|
||
|
|
* of a reasonable type. It's certainly unset, so if this is
|
||
|
|
* an offpage dup set, we don't have an OPD cursor. The
|
||
|
|
* simplest solution is just to allocate a whole new cursor
|
||
|
|
* for our use; we're only really using it to hold pass some
|
||
|
|
* state into __ram_ca, and this way we don't need to make
|
||
|
|
* this function know anything about how offpage dups work.
|
||
|
|
*/
|
||
|
|
if ((ret =
|
||
|
|
__db_icursor(file_dbp, NULL, DB_RECNO, argp->root, 0, &rdbc)) != 0)
|
||
|
|
goto out;
|
||
|
|
|
||
|
|
cp = (BTREE_CURSOR *)rdbc->internal;
|
||
|
|
F_SET(cp, C_RENUMBER);
|
||
|
|
cp->recno = argp->recno;
|
||
|
|
|
||
|
|
switch(argp->mode) {
|
||
|
|
case CA_DELETE:
|
||
|
|
/*
|
||
|
|
* The way to undo a delete is with an insert. Since
|
||
|
|
* we're undoing it, the delete flag must be set.
|
||
|
|
*/
|
||
|
|
F_SET(cp, C_DELETED);
|
||
|
|
F_SET(cp, C_RENUMBER); /* Just in case. */
|
||
|
|
cp->order = argp->order;
|
||
|
|
__ram_ca(rdbc, CA_ICURRENT);
|
||
|
|
break;
|
||
|
|
case CA_IAFTER:
|
||
|
|
case CA_IBEFORE:
|
||
|
|
case CA_ICURRENT:
|
||
|
|
/*
|
||
|
|
* The way to undo an insert is with a delete. The delete
|
||
|
|
* flag is unset to start with.
|
||
|
|
*/
|
||
|
|
F_CLR(cp, C_DELETED);
|
||
|
|
cp->order = INVALID_ORDER;
|
||
|
|
__ram_ca(rdbc, CA_DELETE);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
done: *lsnp = argp->prev_lsn;
|
||
|
|
out: if (rdbc != NULL && (t_ret = rdbc->c_close(rdbc)) != 0 && ret == 0)
|
||
|
|
ret = t_ret;
|
||
|
|
REC_CLOSE;
|
||
|
|
}
|