mariadb/storage/bdb/log/log_archive.c

592 lines
13 KiB
C
Raw Normal View History

2001-03-04 19:42:05 -05:00
/*-
* See the file LICENSE for redistribution information.
*
2005-12-05 10:27:46 -08:00
* Copyright (c) 1997-2005
2001-03-04 19:42:05 -05:00
* Sleepycat Software. All rights reserved.
2005-07-20 15:48:22 -07:00
*
2005-12-05 10:27:46 -08:00
* $Id: log_archive.c,v 12.9 2005/11/04 17:27:58 ubell Exp $
2001-03-04 19:42:05 -05:00
*/
#include "db_config.h"
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <stdlib.h>
#include <string.h>
#endif
#include "db_int.h"
2002-10-30 15:57:05 +04:00
#include "dbinc/db_page.h"
#include "dbinc/log.h"
#include "dbinc/qam.h"
#include "dbinc/txn.h"
2001-03-04 19:42:05 -05:00
static int __absname __P((DB_ENV *, char *, char *, char **));
2002-10-30 15:57:05 +04:00
static int __build_data __P((DB_ENV *, char *, char ***));
2001-03-04 19:42:05 -05:00
static int __cmpfunc __P((const void *, const void *));
2005-07-20 15:48:22 -07:00
static int __log_archive __P((DB_ENV *, char **[], u_int32_t));
2002-10-30 15:57:05 +04:00
static int __usermem __P((DB_ENV *, char ***));
2001-03-04 19:42:05 -05:00
/*
2005-07-20 15:48:22 -07:00
* __log_archive_pp --
* DB_ENV->log_archive pre/post processing.
2002-10-30 15:57:05 +04:00
*
2005-07-20 15:48:22 -07:00
* PUBLIC: int __log_archive_pp __P((DB_ENV *, char **[], u_int32_t));
2001-03-04 19:42:05 -05:00
*/
int
2005-07-20 15:48:22 -07:00
__log_archive_pp(dbenv, listp, flags)
2001-03-04 19:42:05 -05:00
DB_ENV *dbenv;
char ***listp;
u_int32_t flags;
{
2005-12-05 10:27:46 -08:00
DB_THREAD_INFO *ip;
int ret;
2001-03-04 19:42:05 -05:00
PANIC_CHECK(dbenv);
2002-10-30 15:57:05 +04:00
ENV_REQUIRES_CONFIG(dbenv,
dbenv->lg_handle, "DB_ENV->log_archive", DB_INIT_LOG);
2001-03-04 19:42:05 -05:00
2005-07-20 15:48:22 -07:00
#define OKFLAGS (DB_ARCH_ABS | DB_ARCH_DATA | DB_ARCH_LOG | DB_ARCH_REMOVE)
2001-03-04 19:42:05 -05:00
if (flags != 0) {
2002-10-30 15:57:05 +04:00
if ((ret = __db_fchk(
dbenv, "DB_ENV->log_archive", flags, OKFLAGS)) != 0)
2001-03-04 19:42:05 -05:00
return (ret);
2002-10-30 15:57:05 +04:00
if ((ret = __db_fcchk(dbenv, "DB_ENV->log_archive",
flags, DB_ARCH_DATA, DB_ARCH_LOG)) != 0)
2001-03-04 19:42:05 -05:00
return (ret);
2005-07-20 15:48:22 -07:00
if ((ret = __db_fcchk(dbenv, "DB_ENV->log_archive",
flags, DB_ARCH_REMOVE,
DB_ARCH_ABS | DB_ARCH_DATA | DB_ARCH_LOG)) != 0)
return (ret);
2001-03-04 19:42:05 -05:00
}
2005-12-05 10:27:46 -08:00
ENV_ENTER(dbenv, ip);
REPLICATION_WRAP(dbenv, (__log_archive(dbenv, listp, flags)), ret);
ENV_LEAVE(dbenv, ip);
2005-07-20 15:48:22 -07:00
return (ret);
}
2002-10-30 15:57:05 +04:00
2005-07-20 15:48:22 -07:00
/*
* __log_archive --
* DB_ENV->log_archive. Internal.
*/
static int
__log_archive(dbenv, listp, flags)
DB_ENV *dbenv;
char ***listp;
u_int32_t flags;
{
DBT rec;
DB_LOG *dblp;
LOG *lp;
DB_LOGC *logc;
DB_LSN stable_lsn;
u_int array_size, n;
u_int32_t fnum;
int ret, t_ret;
2005-12-05 10:27:46 -08:00
char **array, **arrayp, *name, *p, *pref;
2005-07-20 15:48:22 -07:00
dblp = dbenv->lg_handle;
lp = (LOG *)dblp->reginfo.primary;
array = NULL;
name = NULL;
ret = 0;
COMPQUIET(fnum, 0);
if (flags != DB_ARCH_REMOVE)
*listp = NULL;
/* There are no log files if logs are in memory. */
if (lp->db_log_inmemory) {
LF_CLR(~DB_ARCH_DATA);
if (flags == 0)
return (0);
}
/*
* If the user wants the list of log files to remove and we're
* at a bad time in replication initialization, just return.
*/
if (!LF_ISSET(DB_ARCH_DATA) &&
!LF_ISSET(DB_ARCH_LOG) && __rep_noarchive(dbenv))
return (0);
2002-10-30 15:57:05 +04:00
2001-03-04 19:42:05 -05:00
/*
2005-12-05 10:27:46 -08:00
* Prepend the original absolute pathname if the user wants an
* absolute path to the database environment directory.
2001-03-04 19:42:05 -05:00
*/
2005-12-05 10:27:46 -08:00
pref = LF_ISSET(DB_ARCH_ABS) ? dbenv->db_abshome : NULL;
2001-03-04 19:42:05 -05:00
2005-07-20 15:48:22 -07:00
LF_CLR(DB_ARCH_ABS);
2002-10-30 15:57:05 +04:00
switch (flags) {
2001-03-04 19:42:05 -05:00
case DB_ARCH_DATA:
2005-07-20 15:48:22 -07:00
ret = __build_data(dbenv, pref, listp);
goto err;
2001-03-04 19:42:05 -05:00
case DB_ARCH_LOG:
memset(&rec, 0, sizeof(rec));
2005-07-20 15:48:22 -07:00
if ((ret = __log_cursor(dbenv, &logc)) != 0)
goto err;
2002-10-30 15:57:05 +04:00
#ifdef UMRW
ZERO_LSN(stable_lsn);
#endif
2005-07-20 15:48:22 -07:00
ret = __log_c_get(logc, &stable_lsn, &rec, DB_LAST);
if ((t_ret = __log_c_close(logc)) != 0 && ret == 0)
ret = t_ret;
2002-10-30 15:57:05 +04:00
if (ret != 0)
2005-07-20 15:48:22 -07:00
goto err;
2001-03-04 19:42:05 -05:00
fnum = stable_lsn.file;
break;
2005-07-20 15:48:22 -07:00
case DB_ARCH_REMOVE:
__log_autoremove(dbenv);
goto err;
2001-03-04 19:42:05 -05:00
case 0:
2005-12-05 10:27:46 -08:00
ret = __log_get_stable_lsn(dbenv, &stable_lsn);
/*
* A return of DB_NOTFOUND means the checkpoint LSN
* is before the beginning of the log files we have.
* This is not an error; it just means we're done.
*/
if (ret != 0) {
2005-07-20 15:48:22 -07:00
if (ret == DB_NOTFOUND)
2002-10-30 15:57:05 +04:00
ret = 0;
2005-07-20 15:48:22 -07:00
goto err;
2002-10-30 15:57:05 +04:00
}
2001-03-04 19:42:05 -05:00
/* Remove any log files before the last stable LSN. */
fnum = stable_lsn.file - 1;
break;
2005-07-20 15:48:22 -07:00
default:
DB_ASSERT(0);
ret = EINVAL;
goto err;
2001-03-04 19:42:05 -05:00
}
#define LIST_INCREMENT 64
/* Get some initial space. */
2002-10-30 15:57:05 +04:00
array_size = 64;
2001-03-04 19:42:05 -05:00
if ((ret = __os_malloc(dbenv,
2002-10-30 15:57:05 +04:00
sizeof(char *) * array_size, &array)) != 0)
2005-07-20 15:48:22 -07:00
goto err;
2001-03-04 19:42:05 -05:00
array[0] = NULL;
/* Build an array of the file names. */
for (n = 0; fnum > 0; --fnum) {
if ((ret = __log_name(dblp, fnum, &name, NULL, 0)) != 0)
goto err;
if (__os_exists(name, NULL) != 0) {
if (LF_ISSET(DB_ARCH_LOG) && fnum == stable_lsn.file)
continue;
2002-10-30 15:57:05 +04:00
__os_free(dbenv, name);
2001-03-04 19:42:05 -05:00
name = NULL;
break;
}
2002-10-30 15:57:05 +04:00
if (n >= array_size - 2) {
2001-03-04 19:42:05 -05:00
array_size += LIST_INCREMENT;
if ((ret = __os_realloc(dbenv,
2002-10-30 15:57:05 +04:00
sizeof(char *) * array_size, &array)) != 0)
2001-03-04 19:42:05 -05:00
goto err;
}
2005-07-20 15:48:22 -07:00
if (pref != NULL) {
if ((ret =
__absname(dbenv, pref, name, &array[n])) != 0)
2001-03-04 19:42:05 -05:00
goto err;
2002-10-30 15:57:05 +04:00
__os_free(dbenv, name);
2001-03-04 19:42:05 -05:00
} else if ((p = __db_rpath(name)) != NULL) {
if ((ret = __os_strdup(dbenv, p + 1, &array[n])) != 0)
goto err;
2002-10-30 15:57:05 +04:00
__os_free(dbenv, name);
2001-03-04 19:42:05 -05:00
} else
array[n] = name;
name = NULL;
array[++n] = NULL;
}
/* If there's nothing to return, we're done. */
2005-07-20 15:48:22 -07:00
if (n == 0)
2001-03-04 19:42:05 -05:00
goto err;
/* Sort the list. */
qsort(array, (size_t)n, sizeof(char *), __cmpfunc);
/* Rework the memory. */
2002-10-30 15:57:05 +04:00
if ((ret = __usermem(dbenv, &array)) != 0)
2001-03-04 19:42:05 -05:00
goto err;
2005-07-20 15:48:22 -07:00
if (listp != NULL)
*listp = array;
2001-03-04 19:42:05 -05:00
2005-07-20 15:48:22 -07:00
if (0) {
err: if (array != NULL) {
for (arrayp = array; *arrayp != NULL; ++arrayp)
__os_free(dbenv, *arrayp);
__os_free(dbenv, array);
}
if (name != NULL)
__os_free(dbenv, name);
2001-03-04 19:42:05 -05:00
}
2005-07-20 15:48:22 -07:00
2001-03-04 19:42:05 -05:00
return (ret);
}
2005-12-05 10:27:46 -08:00
/*
* __log_get_stable_lsn --
* Get the stable lsn based on where checkpoints are.
*
* PUBLIC: int __log_get_stable_lsn __P((DB_ENV *, DB_LSN *));
*/
int
__log_get_stable_lsn(dbenv, stable_lsn)
DB_ENV *dbenv;
DB_LSN *stable_lsn;
{
DB_LOGC *logc;
DBT rec;
__txn_ckp_args *ckp_args;
int ret, t_ret;
ret = 0;
memset(&rec, 0, sizeof(rec));
if (!TXN_ON(dbenv)) {
if ((ret = __log_get_cached_ckp_lsn(dbenv, stable_lsn)) != 0)
goto err;
/*
* No need to check for a return value of DB_NOTFOUND;
* __txn_findlastckp returns 0 if no checkpoint record
* is found. Instead of checking the return value, we
* check to see if the return LSN has been filled in.
*/
if (IS_ZERO_LSN(*stable_lsn) && (ret =
__txn_findlastckp(dbenv, stable_lsn, NULL)) != 0)
goto err;
/*
* If the LSN has not been filled in return DB_NOTFOUND
* so that the caller knows it may be done.
*/
if (IS_ZERO_LSN(*stable_lsn)) {
ret = DB_NOTFOUND;
goto err;
}
} else if ((ret = __txn_getckp(dbenv, stable_lsn)) != 0)
goto err;
if ((ret = __log_cursor(dbenv, &logc)) != 0)
goto err;
/*
* If we can read it, set the stable_lsn to the ckp_lsn in the
* checkpoint record.
*/
if ((ret = __log_c_get(logc, stable_lsn, &rec, DB_SET)) == 0 &&
(ret = __txn_ckp_read(dbenv, rec.data, &ckp_args)) == 0) {
*stable_lsn = ckp_args->ckp_lsn;
__os_free(dbenv, ckp_args);
}
if ((t_ret = __log_c_close(logc)) != 0 && ret == 0)
ret = t_ret;
err:
return (ret);
}
2005-07-20 15:48:22 -07:00
/*
* __log_autoremove --
* Delete any non-essential log files.
*
* PUBLIC: void __log_autoremove __P((DB_ENV *));
*/
void
__log_autoremove(dbenv)
DB_ENV *dbenv;
{
2005-12-05 10:27:46 -08:00
int ret;
2005-07-20 15:48:22 -07:00
char **begin, **list;
2005-12-05 10:27:46 -08:00
/*
* Complain if there's an error, but don't return the error to our
* caller. Auto-remove is done when writing a log record, and we
* don't want to fail a write, which could fail the corresponding
* committing transaction, for a permissions error.
*/
if ((ret = __log_archive(dbenv, &list, DB_ARCH_ABS)) != 0) {
if (ret != DB_NOTFOUND)
__db_err(dbenv,
"log file auto-remove: %s", db_strerror(ret));
2005-07-20 15:48:22 -07:00
return;
2005-12-05 10:27:46 -08:00
}
2005-07-20 15:48:22 -07:00
2005-12-05 10:27:46 -08:00
/*
* Remove the files. No error message needed for __os_unlink failure,
* the underlying OS layer has its own error handling.
*/
2005-07-20 15:48:22 -07:00
if (list != NULL) {
for (begin = list; *list != NULL; ++list)
(void)__os_unlink(dbenv, *list);
__os_ufree(dbenv, begin);
}
}
2001-03-04 19:42:05 -05:00
/*
* __build_data --
* Build a list of datafiles for return.
*/
static int
2002-10-30 15:57:05 +04:00
__build_data(dbenv, pref, listp)
2001-03-04 19:42:05 -05:00
DB_ENV *dbenv;
char *pref, ***listp;
{
DBT rec;
2002-10-30 15:57:05 +04:00
DB_LOGC *logc;
2001-03-04 19:42:05 -05:00
DB_LSN lsn;
2002-10-30 15:57:05 +04:00
__dbreg_register_args *argp;
2005-07-20 15:48:22 -07:00
u_int array_size, last, n, nxt;
2001-03-04 19:42:05 -05:00
u_int32_t rectype;
2005-07-20 15:48:22 -07:00
int ret, t_ret;
2002-10-30 15:57:05 +04:00
char **array, **arrayp, **list, **lp, *p, *real_name;
2001-03-04 19:42:05 -05:00
/* Get some initial space. */
2002-10-30 15:57:05 +04:00
array_size = 64;
2001-03-04 19:42:05 -05:00
if ((ret = __os_malloc(dbenv,
2002-10-30 15:57:05 +04:00
sizeof(char *) * array_size, &array)) != 0)
2001-03-04 19:42:05 -05:00
return (ret);
array[0] = NULL;
memset(&rec, 0, sizeof(rec));
2005-07-20 15:48:22 -07:00
if ((ret = __log_cursor(dbenv, &logc)) != 0)
2002-10-30 15:57:05 +04:00
return (ret);
2005-07-20 15:48:22 -07:00
for (n = 0; (ret = __log_c_get(logc, &lsn, &rec, DB_PREV)) == 0;) {
2001-03-04 19:42:05 -05:00
if (rec.size < sizeof(rectype)) {
ret = EINVAL;
2002-10-30 15:57:05 +04:00
__db_err(dbenv, "DB_ENV->log_archive: bad log record");
2005-07-20 15:48:22 -07:00
break;
2001-03-04 19:42:05 -05:00
}
memcpy(&rectype, rec.data, sizeof(rectype));
2002-10-30 15:57:05 +04:00
if (rectype != DB___dbreg_register)
2001-03-04 19:42:05 -05:00
continue;
2002-10-30 15:57:05 +04:00
if ((ret =
__dbreg_register_read(dbenv, rec.data, &argp)) != 0) {
2001-03-04 19:42:05 -05:00
ret = EINVAL;
__db_err(dbenv,
2002-10-30 15:57:05 +04:00
"DB_ENV->log_archive: unable to read log record");
2005-07-20 15:48:22 -07:00
break;
2001-03-04 19:42:05 -05:00
}
2002-10-30 15:57:05 +04:00
if (n >= array_size - 2) {
2001-03-04 19:42:05 -05:00
array_size += LIST_INCREMENT;
if ((ret = __os_realloc(dbenv,
2002-10-30 15:57:05 +04:00
sizeof(char *) * array_size, &array)) != 0)
goto free_continue;
2001-03-04 19:42:05 -05:00
}
if ((ret = __os_strdup(dbenv,
2002-10-30 15:57:05 +04:00
argp->name.data, &array[n++])) != 0)
goto free_continue;
array[n] = NULL;
if (argp->ftype == DB_QUEUE) {
if ((ret = __qam_extent_names(dbenv,
argp->name.data, &list)) != 0)
goto q_err;
for (lp = list;
lp != NULL && *lp != NULL; lp++) {
if (n >= array_size - 2) {
array_size += LIST_INCREMENT;
if ((ret = __os_realloc(dbenv,
sizeof(char *) *
array_size, &array)) != 0)
goto q_err;
}
if ((ret =
__os_strdup(dbenv, *lp, &array[n++])) != 0)
goto q_err;
array[n] = NULL;
}
q_err: if (list != NULL)
__os_free(dbenv, list);
2001-03-04 19:42:05 -05:00
}
2002-10-30 15:57:05 +04:00
free_continue: __os_free(dbenv, argp);
if (ret != 0)
break;
2001-03-04 19:42:05 -05:00
}
2002-10-30 15:57:05 +04:00
if (ret == DB_NOTFOUND)
ret = 0;
2005-07-20 15:48:22 -07:00
if ((t_ret = __log_c_close(logc)) != 0 && ret == 0)
2002-10-30 15:57:05 +04:00
ret = t_ret;
if (ret != 0)
goto err1;
2001-03-04 19:42:05 -05:00
/* If there's nothing to return, we're done. */
if (n == 0) {
ret = 0;
*listp = NULL;
goto err1;
}
/* Sort the list. */
qsort(array, (size_t)n, sizeof(char *), __cmpfunc);
/*
* Build the real pathnames, discarding nonexistent files and
* duplicates.
*/
for (last = nxt = 0; nxt < n;) {
/*
* Discard duplicates. Last is the next slot we're going
* to return to the user, nxt is the next slot that we're
* going to consider.
*/
if (last != nxt) {
array[last] = array[nxt];
array[nxt] = NULL;
}
for (++nxt; nxt < n &&
strcmp(array[last], array[nxt]) == 0; ++nxt) {
2002-10-30 15:57:05 +04:00
__os_free(dbenv, array[nxt]);
2001-03-04 19:42:05 -05:00
array[nxt] = NULL;
}
/* Get the real name. */
if ((ret = __db_appname(dbenv,
2002-10-30 15:57:05 +04:00
DB_APP_DATA, array[last], 0, NULL, &real_name)) != 0)
2001-03-04 19:42:05 -05:00
goto err2;
/* If the file doesn't exist, ignore it. */
if (__os_exists(real_name, NULL) != 0) {
2002-10-30 15:57:05 +04:00
__os_free(dbenv, real_name);
__os_free(dbenv, array[last]);
2001-03-04 19:42:05 -05:00
array[last] = NULL;
continue;
}
/* Rework the name as requested by the user. */
2002-10-30 15:57:05 +04:00
__os_free(dbenv, array[last]);
2001-03-04 19:42:05 -05:00
array[last] = NULL;
if (pref != NULL) {
ret = __absname(dbenv, pref, real_name, &array[last]);
2002-10-30 15:57:05 +04:00
__os_free(dbenv, real_name);
2001-03-04 19:42:05 -05:00
if (ret != 0)
goto err2;
} else if ((p = __db_rpath(real_name)) != NULL) {
ret = __os_strdup(dbenv, p + 1, &array[last]);
2002-10-30 15:57:05 +04:00
__os_free(dbenv, real_name);
2001-03-04 19:42:05 -05:00
if (ret != 0)
goto err2;
} else
array[last] = real_name;
++last;
}
/* NULL-terminate the list. */
array[last] = NULL;
/* Rework the memory. */
2002-10-30 15:57:05 +04:00
if ((ret = __usermem(dbenv, &array)) != 0)
2001-03-04 19:42:05 -05:00
goto err1;
*listp = array;
return (0);
err2: /*
* XXX
* We've possibly inserted NULLs into the array list, so clean up a
* bit so that the other error processing works.
*/
if (array != NULL)
for (; nxt < n; ++nxt)
2002-10-30 15:57:05 +04:00
__os_free(dbenv, array[nxt]);
2001-03-04 19:42:05 -05:00
/* FALLTHROUGH */
err1: if (array != NULL) {
for (arrayp = array; *arrayp != NULL; ++arrayp)
2002-10-30 15:57:05 +04:00
__os_free(dbenv, *arrayp);
__os_free(dbenv, array);
2001-03-04 19:42:05 -05:00
}
return (ret);
}
/*
* __absname --
* Return an absolute path name for the file.
*/
static int
__absname(dbenv, pref, name, newnamep)
DB_ENV *dbenv;
char *pref, *name, **newnamep;
{
size_t l_pref, l_name;
int isabspath, ret;
char *newname;
l_name = strlen(name);
isabspath = __os_abspath(name);
l_pref = isabspath ? 0 : strlen(pref);
/* Malloc space for concatenating the two. */
if ((ret = __os_malloc(dbenv,
2002-10-30 15:57:05 +04:00
l_pref + l_name + 2, &newname)) != 0)
2001-03-04 19:42:05 -05:00
return (ret);
*newnamep = newname;
/* Build the name. If `name' is an absolute path, ignore any prefix. */
if (!isabspath) {
memcpy(newname, pref, l_pref);
if (strchr(PATH_SEPARATOR, newname[l_pref - 1]) == NULL)
newname[l_pref++] = PATH_SEPARATOR[0];
}
memcpy(newname + l_pref, name, l_name + 1);
return (0);
}
/*
* __usermem --
* Create a single chunk of memory that holds the returned information.
* If the user has their own malloc routine, use it.
*/
static int
2002-10-30 15:57:05 +04:00
__usermem(dbenv, listp)
2001-03-04 19:42:05 -05:00
DB_ENV *dbenv;
char ***listp;
{
size_t len;
int ret;
char **array, **arrayp, **orig, *strp;
/* Find out how much space we need. */
for (len = 0, orig = *listp; *orig != NULL; ++orig)
len += sizeof(char *) + strlen(*orig) + 1;
len += sizeof(char *);
/* Allocate it and set up the pointers. */
2002-10-30 15:57:05 +04:00
if ((ret = __os_umalloc(dbenv, len, &array)) != 0)
2001-03-04 19:42:05 -05:00
return (ret);
strp = (char *)(array + (orig - *listp) + 1);
/* Copy the original information into the new memory. */
for (orig = *listp, arrayp = array; *orig != NULL; ++orig, ++arrayp) {
len = strlen(*orig);
memcpy(strp, *orig, len + 1);
*arrayp = strp;
strp += len + 1;
2002-10-30 15:57:05 +04:00
__os_free(dbenv, *orig);
2001-03-04 19:42:05 -05:00
}
/* NULL-terminate the list. */
*arrayp = NULL;
2002-10-30 15:57:05 +04:00
__os_free(dbenv, *listp);
2001-03-04 19:42:05 -05:00
*listp = array;
return (0);
}
static int
__cmpfunc(p1, p2)
const void *p1, *p2;
{
return (strcmp(*((char * const *)p1), *((char * const *)p2)));
}