mirror of
https://github.com/isar/libmdbx.git
synced 2024-10-30 23:39:19 +08:00
43d87b4d97
Finally for https://github.com/ReOpen/libmdbx/issues/3
954 lines
26 KiB
C
954 lines
26 KiB
C
/* mdbx_chk.c - memory-mapped database check tool */
|
|
|
|
/*
|
|
* Copyright (c) 2015,2016 Leonid Yuriev <leo@yuriev.ru>.
|
|
* Copyright (c) 2015,2016 Peter-Service R&D LLC.
|
|
*
|
|
* This file is part of libmdbx.
|
|
*
|
|
* ReOpenMDBX is free software; you can redistribute it and/or modify it under
|
|
* the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation; either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* ReOpenMDBX is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Affero General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Affero General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <errno.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include <unistd.h>
|
|
#include <signal.h>
|
|
#include <stdarg.h>
|
|
#include <malloc.h>
|
|
#include <time.h>
|
|
|
|
#include "midl.h"
|
|
#include "mdbx.h"
|
|
|
|
typedef struct flagbit {
|
|
int bit;
|
|
char *name;
|
|
} flagbit;
|
|
|
|
flagbit dbflags[] = {
|
|
{ MDB_DUPSORT, "dupsort" },
|
|
{ MDB_INTEGERKEY, "integerkey" },
|
|
{ MDB_REVERSEKEY, "reversekey" },
|
|
{ MDB_DUPFIXED, "dupfixed" },
|
|
{ MDB_REVERSEDUP, "reversedup" },
|
|
{ MDB_INTEGERDUP, "integerdup" },
|
|
{ 0, NULL }
|
|
};
|
|
|
|
static volatile sig_atomic_t gotsignal;
|
|
|
|
static void signal_hanlder( int sig ) {
|
|
(void) sig;
|
|
gotsignal = 1;
|
|
}
|
|
|
|
#define MAX_DBI 32768
|
|
|
|
#define EXIT_INTERRUPTED (EXIT_FAILURE+4)
|
|
#define EXIT_FAILURE_SYS (EXIT_FAILURE+3)
|
|
#define EXIT_FAILURE_MDB (EXIT_FAILURE+2)
|
|
#define EXIT_FAILURE_CHECK_MAJOR (EXIT_FAILURE+1)
|
|
#define EXIT_FAILURE_CHECK_MINOR EXIT_FAILURE
|
|
|
|
struct {
|
|
const char* dbi_names[MAX_DBI];
|
|
size_t dbi_pages[MAX_DBI];
|
|
size_t dbi_empty_pages[MAX_DBI];
|
|
size_t dbi_payload_bytes[MAX_DBI];
|
|
size_t dbi_lost_bytes[MAX_DBI];
|
|
short *pagemap;
|
|
size_t total_payload_bytes;
|
|
size_t pgcount;
|
|
} walk = {
|
|
.dbi_names = { "@gc" }
|
|
};
|
|
|
|
size_t total_unused_bytes;
|
|
int exclusive = 2;
|
|
|
|
MDB_env *env;
|
|
MDB_txn *txn, *locktxn;
|
|
MDBX_envinfo info;
|
|
MDBX_stat stat;
|
|
size_t maxkeysize, reclaimable_pages, freedb_pages, lastpgno;
|
|
size_t userdb_count, skipped_subdb;
|
|
unsigned verbose, quiet;
|
|
const char* only_subdb;
|
|
|
|
struct problem {
|
|
struct problem* pr_next;
|
|
size_t count;
|
|
const char* caption;
|
|
};
|
|
|
|
struct problem* problems_list;
|
|
size_t total_problems;
|
|
|
|
static void __attribute__ ((format (printf, 1, 2)))
|
|
print(const char* msg, ...) {
|
|
if (! quiet) {
|
|
va_list args;
|
|
|
|
fflush(stderr);
|
|
va_start(args, msg);
|
|
vfprintf(stdout, msg, args);
|
|
va_end(args);
|
|
}
|
|
}
|
|
|
|
static void __attribute__ ((format (printf, 1, 2)))
|
|
error(const char* msg, ...) {
|
|
total_problems++;
|
|
|
|
if (! quiet) {
|
|
va_list args;
|
|
|
|
fflush(stdout);
|
|
va_start(args, msg);
|
|
vfprintf(stderr, msg, args);
|
|
va_end(args);
|
|
fflush(NULL);
|
|
}
|
|
}
|
|
|
|
static void pagemap_cleanup(void) {
|
|
int i;
|
|
|
|
for( i = 1; i < MAX_DBI; ++i ) {
|
|
if (walk.dbi_names[i]) {
|
|
free((void *) walk.dbi_names[i]);
|
|
walk.dbi_names[i] = NULL;
|
|
}
|
|
}
|
|
|
|
free(walk.pagemap);
|
|
walk.pagemap = NULL;
|
|
}
|
|
|
|
static int pagemap_lookup_dbi(const char* dbi) {
|
|
static int last;
|
|
int i;
|
|
|
|
if (last > 0 && strcmp(walk.dbi_names[last], dbi) == 0)
|
|
return last;
|
|
|
|
for(i = 1; walk.dbi_names[i] && last < MAX_DBI; ++i)
|
|
if (strcmp(walk.dbi_names[i], dbi) == 0)
|
|
return last = i;
|
|
|
|
if (i == MAX_DBI)
|
|
return -1;
|
|
|
|
walk.dbi_names[i] = strdup(dbi);
|
|
|
|
if (verbose > 1) {
|
|
print(" - found '%s' area\n", dbi);
|
|
fflush(NULL);
|
|
}
|
|
|
|
return last = i;
|
|
}
|
|
|
|
static void problem_add(const char* object, size_t entry_number, const char* msg, const char *extra, ...) {
|
|
total_problems++;
|
|
|
|
if (! quiet) {
|
|
int need_fflush = 0;
|
|
struct problem* p;
|
|
|
|
for (p = problems_list; p; p = p->pr_next)
|
|
if (p->caption == msg)
|
|
break;
|
|
|
|
if (! p) {
|
|
p = calloc(1, sizeof(*p));
|
|
p->caption = msg;
|
|
p->pr_next = problems_list;
|
|
problems_list = p;
|
|
need_fflush = 1;
|
|
}
|
|
|
|
p->count++;
|
|
if (verbose > 1) {
|
|
print(" %s #%zu: %s", object, entry_number, msg);
|
|
if (extra) {
|
|
va_list args;
|
|
printf(" (");
|
|
va_start(args, extra);
|
|
vfprintf(stdout, extra, args);
|
|
va_end(args);
|
|
printf(")");
|
|
}
|
|
printf("\n");
|
|
if (need_fflush)
|
|
fflush(NULL);
|
|
}
|
|
}
|
|
}
|
|
|
|
static struct problem* problems_push() {
|
|
struct problem* p = problems_list;
|
|
problems_list = NULL;
|
|
return p;
|
|
}
|
|
|
|
static size_t problems_pop(struct problem* list) {
|
|
size_t count = 0;
|
|
|
|
if (problems_list) {
|
|
int i;
|
|
|
|
print(" - problems: ");
|
|
for (i = 0; problems_list; ++i) {
|
|
struct problem* p = problems_list->pr_next;
|
|
count += problems_list->count;
|
|
print("%s%s (%zu)", i ? ", " : "", problems_list->caption, problems_list->count);
|
|
free(problems_list);
|
|
problems_list = p;
|
|
}
|
|
print("\n");
|
|
fflush(NULL);
|
|
}
|
|
|
|
problems_list = list;
|
|
return count;
|
|
}
|
|
|
|
static int pgvisitor(size_t pgno, unsigned pgnumber, void* ctx, const char* dbi,
|
|
const char* type, int nentries, int payload_bytes, int header_bytes, int unused_bytes)
|
|
{
|
|
(void) ctx;
|
|
|
|
if (type) {
|
|
size_t page_bytes = payload_bytes + header_bytes + unused_bytes;
|
|
size_t page_size = pgnumber * stat.base.ms_psize;
|
|
int index = pagemap_lookup_dbi(dbi);
|
|
if (index < 0)
|
|
return ENOMEM;
|
|
|
|
if (verbose > 2 && (!only_subdb || strcmp(only_subdb, dbi) == 0)) {
|
|
if (pgnumber == 1)
|
|
print(" %s-page %zu", type, pgno);
|
|
else
|
|
print(" %s-span %zu[%u]", type, pgno, pgnumber);
|
|
print(" of %s: header %i, payload %i, unused %i\n",
|
|
dbi, header_bytes, payload_bytes, unused_bytes);
|
|
}
|
|
|
|
walk.pgcount += pgnumber;
|
|
|
|
if (unused_bytes < 0 || (size_t) unused_bytes > page_size)
|
|
problem_add("page", pgno, "illegal unused-bytes", "%zu < %i < %zu",
|
|
0, unused_bytes, stat.base.ms_psize);
|
|
|
|
if (header_bytes < (int) sizeof(long) || (size_t) header_bytes >= stat.base.ms_psize - sizeof(long))
|
|
problem_add("page", pgno, "illegal header-length", "%zu < %i < %zu",
|
|
sizeof(long), header_bytes, stat.base.ms_psize - sizeof(long));
|
|
if (payload_bytes < 1) {
|
|
if (nentries > 0) {
|
|
problem_add("page", pgno, "zero size-of-entry", "payload %i bytes, %i entries",
|
|
payload_bytes, nentries);
|
|
if ((size_t) header_bytes + unused_bytes < page_size) {
|
|
/* LY: hush a misuse error */
|
|
page_bytes = page_size;
|
|
}
|
|
} else {
|
|
problem_add("page", pgno, "empty", "payload %i bytes, %i entries",
|
|
payload_bytes, nentries);
|
|
walk.dbi_empty_pages[index] += 1;
|
|
}
|
|
}
|
|
|
|
if (page_bytes != page_size) {
|
|
problem_add("page", pgno, "misused", "%zu != %zu (%ih + %ip + %iu)",
|
|
page_size, page_bytes, header_bytes, payload_bytes, unused_bytes);
|
|
if (page_size > page_bytes)
|
|
walk.dbi_lost_bytes[index] += page_size - page_bytes;
|
|
} else {
|
|
walk.dbi_payload_bytes[index] += payload_bytes + header_bytes;
|
|
walk.total_payload_bytes += payload_bytes + header_bytes;
|
|
}
|
|
|
|
if (pgnumber) {
|
|
do {
|
|
if (pgno >= lastpgno)
|
|
problem_add("page", pgno, "wrong page-no",
|
|
"%zu > %zi", pgno, lastpgno);
|
|
else if (walk.pagemap[pgno])
|
|
problem_add("page", pgno, "already used",
|
|
"in %s", walk.dbi_names[walk.pagemap[pgno]]);
|
|
else {
|
|
walk.pagemap[pgno] = index;
|
|
walk.dbi_pages[index] += 1;
|
|
}
|
|
++pgno;
|
|
} while(--pgnumber);
|
|
}
|
|
}
|
|
|
|
return gotsignal ? EINTR : MDB_SUCCESS;
|
|
}
|
|
|
|
typedef int (visitor)(size_t record_number, MDB_val *key, MDB_val* data);
|
|
static int process_db(MDB_dbi dbi, char *name, visitor *handler, int silent);
|
|
|
|
static int handle_userdb(size_t record_number, MDB_val *key, MDB_val* data) {
|
|
(void) record_number;
|
|
(void) key;
|
|
(void) data;
|
|
return MDB_SUCCESS;
|
|
}
|
|
|
|
static int handle_freedb(size_t record_number, MDB_val *key, MDB_val* data) {
|
|
char *bad = "";
|
|
size_t pg, prev;
|
|
ssize_t i, number, span = 0;
|
|
size_t *iptr = data->mv_data, txnid = *(size_t*)key->mv_data;
|
|
|
|
if (key->mv_size != sizeof(txnid))
|
|
problem_add("entry", record_number, "wrong txn-id size", "key-size %zi", key->mv_size);
|
|
else if (txnid < 1 || txnid > info.base.me_last_txnid)
|
|
problem_add("entry", record_number, "wrong txn-id", "%zu", txnid);
|
|
|
|
if (data->mv_size < sizeof(size_t) || data->mv_size % sizeof(size_t))
|
|
problem_add("entry", record_number, "wrong idl size", "%zu", data->mv_size);
|
|
else {
|
|
number = *iptr++;
|
|
if (number >= MDB_IDL_UM_MAX)
|
|
problem_add("entry", record_number, "wrong idl length", "%zi", number);
|
|
else if ((number + 1) * sizeof(size_t) != data->mv_size)
|
|
problem_add("entry", record_number, "mismatch idl length", "%zi != %zu",
|
|
number * sizeof(size_t), data->mv_size);
|
|
else {
|
|
freedb_pages += number;
|
|
if (info.me_tail_txnid > txnid)
|
|
reclaimable_pages += number;
|
|
for (i = number, prev = 1; --i >= 0; ) {
|
|
pg = iptr[i];
|
|
if (pg < 2 /* META_PAGE */ || pg > info.base.me_last_pgno)
|
|
problem_add("entry", record_number, "wrong idl entry", "2 < %zi < %zi",
|
|
pg, info.base.me_last_pgno);
|
|
else if (pg <= prev) {
|
|
bad = " [bad sequence]";
|
|
problem_add("entry", record_number, "bad sequence", "%zi <= %zi",
|
|
pg, prev);
|
|
}
|
|
prev = pg;
|
|
pg += span;
|
|
for (; i >= span && iptr[i - span] == pg; span++, pg++) ;
|
|
}
|
|
if (verbose > 2 && !only_subdb) {
|
|
print(" transaction %zu, %zd pages, maxspan %zd%s\n",
|
|
*(size_t *)key->mv_data, number, span, bad);
|
|
if (verbose > 3) {
|
|
int j = number - 1;
|
|
while (j >= 0) {
|
|
pg = iptr[j];
|
|
for (span = 1; --j >= 0 && iptr[j] == pg + span; span++) ;
|
|
if (span > 1)
|
|
print(" %9zu[%zd]\n", pg, span);
|
|
else
|
|
print(" %9zu\n", pg);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return MDB_SUCCESS;
|
|
}
|
|
|
|
static int handle_maindb(size_t record_number, MDB_val *key, MDB_val* data) {
|
|
char *name;
|
|
int rc;
|
|
size_t i;
|
|
|
|
name = key->mv_data;
|
|
for(i = 0; i < key->mv_size; ++i) {
|
|
if (name[i] < ' ')
|
|
return handle_userdb(record_number, key, data);
|
|
}
|
|
|
|
name = malloc(key->mv_size + 1);
|
|
memcpy(name, key->mv_data, key->mv_size);
|
|
name[key->mv_size] = '\0';
|
|
userdb_count++;
|
|
|
|
rc = process_db(-1, name, handle_userdb, 0);
|
|
free(name);
|
|
if (rc != MDB_INCOMPATIBLE)
|
|
return rc;
|
|
|
|
return handle_userdb(record_number, key, data);
|
|
}
|
|
|
|
static int process_db(MDB_dbi dbi, char *name, visitor *handler, int silent)
|
|
{
|
|
MDB_cursor *mc;
|
|
MDBX_stat ms;
|
|
MDB_val key, data;
|
|
MDB_val prev_key, prev_data;
|
|
unsigned flags;
|
|
int rc, i;
|
|
struct problem* saved_list;
|
|
size_t problems_count;
|
|
|
|
unsigned record_count = 0, dups = 0;
|
|
size_t key_bytes = 0, data_bytes = 0;
|
|
|
|
if (0 > (int) dbi) {
|
|
rc = mdbx_dbi_open(txn, name, 0, &dbi);
|
|
if (rc) {
|
|
if (!name || rc != MDB_INCOMPATIBLE) /* LY: mainDB's record is not a user's DB. */ {
|
|
error(" - mdbx_open '%s' failed, error %d %s\n",
|
|
name ? name : "main", rc, mdbx_strerror(rc));
|
|
}
|
|
return rc;
|
|
}
|
|
}
|
|
|
|
if (dbi >= 2 /* CORE_DBS */ && name && only_subdb && strcmp(only_subdb, name)) {
|
|
if (verbose) {
|
|
print("Skip processing '%s'...\n", name);
|
|
fflush(NULL);
|
|
}
|
|
skipped_subdb++;
|
|
mdbx_dbi_close(env, dbi);
|
|
return MDB_SUCCESS;
|
|
}
|
|
|
|
if (! silent && verbose) {
|
|
print("Processing '%s'...\n", name ? name : "main");
|
|
fflush(NULL);
|
|
}
|
|
|
|
rc = mdbx_dbi_flags(txn, dbi, &flags);
|
|
if (rc) {
|
|
error(" - mdbx_dbi_flags failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
mdbx_dbi_close(env, dbi);
|
|
return rc;
|
|
}
|
|
|
|
rc = mdbx_stat(txn, dbi, &ms, sizeof(ms));
|
|
if (rc) {
|
|
error(" - mdbx_stat failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
mdbx_dbi_close(env, dbi);
|
|
return rc;
|
|
}
|
|
|
|
if (! silent && verbose) {
|
|
print(" - dbi-id %d, flags:", dbi);
|
|
if (! flags)
|
|
print(" none");
|
|
else {
|
|
for (i=0; dbflags[i].bit; i++)
|
|
if (flags & dbflags[i].bit)
|
|
print(" %s", dbflags[i].name);
|
|
}
|
|
print(" (0x%02X)\n", flags);
|
|
if (verbose > 1) {
|
|
print(" - page size %u, entries %zu\n", ms.base.ms_psize, ms.base.ms_entries);
|
|
print(" - b-tree depth %u, pages: branch %zu, leaf %zu, overflow %zu\n",
|
|
ms.base.ms_depth, ms.base.ms_branch_pages, ms.base.ms_leaf_pages, ms.base.ms_overflow_pages);
|
|
}
|
|
}
|
|
|
|
rc = mdbx_cursor_open(txn, dbi, &mc);
|
|
if (rc) {
|
|
error(" - mdbx_cursor_open failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
mdbx_dbi_close(env, dbi);
|
|
return rc;
|
|
}
|
|
|
|
saved_list = problems_push();
|
|
prev_key.mv_data = NULL;
|
|
prev_data.mv_size = 0;
|
|
rc = mdbx_cursor_get(mc, &key, &data, MDB_FIRST);
|
|
while (rc == MDB_SUCCESS) {
|
|
if (gotsignal) {
|
|
print(" - interrupted by signal\n");
|
|
fflush(NULL);
|
|
rc = EINTR;
|
|
goto bailout;
|
|
}
|
|
|
|
if (key.mv_size == 0) {
|
|
problem_add("entry", record_count, "key with zero length", NULL);
|
|
} else if (key.mv_size > maxkeysize) {
|
|
problem_add("entry", record_count, "key length exceeds max-key-size",
|
|
"%zu > %zu", key.mv_size, maxkeysize);
|
|
} else if ((flags & MDB_INTEGERKEY)
|
|
&& key.mv_size != sizeof(size_t) && key.mv_size != sizeof(int)) {
|
|
problem_add("entry", record_count, "wrong key length",
|
|
"%zu != %zu", key.mv_size, sizeof(size_t));
|
|
}
|
|
|
|
if ((flags & MDB_INTEGERDUP)
|
|
&& data.mv_size != sizeof(size_t) && data.mv_size != sizeof(int)) {
|
|
problem_add("entry", record_count, "wrong data length",
|
|
"%zu != %zu", data.mv_size, sizeof(size_t));
|
|
}
|
|
|
|
if (prev_key.mv_data) {
|
|
if ((flags & MDB_DUPFIXED) && prev_data.mv_size != data.mv_size) {
|
|
problem_add("entry", record_count, "different data length",
|
|
"%zu != %zu", prev_data.mv_size, data.mv_size);
|
|
}
|
|
|
|
int cmp = mdbx_cmp(txn, dbi, &prev_key, &key);
|
|
if (cmp > 0) {
|
|
problem_add("entry", record_count, "broken ordering of entries", NULL);
|
|
} else if (cmp == 0) {
|
|
++dups;
|
|
if (! (flags & MDB_DUPSORT))
|
|
problem_add("entry", record_count, "duplicated entries", NULL);
|
|
else if (flags & MDB_INTEGERDUP) {
|
|
cmp = mdbx_dcmp(txn, dbi, &prev_data, &data);
|
|
if (cmp > 0)
|
|
problem_add("entry", record_count, "broken ordering of multi-values", NULL);
|
|
}
|
|
}
|
|
} else if (verbose) {
|
|
if (flags & MDB_INTEGERKEY)
|
|
print(" - fixed key-size %zu\n", key.mv_size );
|
|
if (flags & (MDB_INTEGERDUP | MDB_DUPFIXED))
|
|
print(" - fixed data-size %zu\n", data.mv_size );
|
|
}
|
|
|
|
if (handler) {
|
|
rc = handler(record_count, &key, &data);
|
|
if (rc)
|
|
goto bailout;
|
|
}
|
|
|
|
record_count++;
|
|
key_bytes += key.mv_size;
|
|
data_bytes += data.mv_size;
|
|
|
|
prev_key = key;
|
|
prev_data = data;
|
|
rc = mdbx_cursor_get(mc, &key, &data, MDB_NEXT);
|
|
}
|
|
if (rc != MDB_NOTFOUND)
|
|
error(" - mdbx_cursor_get failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
else
|
|
rc = 0;
|
|
|
|
if (record_count != ms.base.ms_entries)
|
|
problem_add("entry", record_count, "differentent number of entries",
|
|
"%zu != %zu", record_count, ms.base.ms_entries);
|
|
bailout:
|
|
problems_count = problems_pop(saved_list);
|
|
if (! silent && verbose) {
|
|
print(" - summary: %u records, %u dups, %zu key's bytes, %zu data's bytes, %zu problems\n",
|
|
record_count, dups, key_bytes, data_bytes, problems_count);
|
|
fflush(NULL);
|
|
}
|
|
|
|
mdbx_cursor_close(mc);
|
|
mdbx_dbi_close(env, dbi);
|
|
return rc || problems_count;
|
|
}
|
|
|
|
static void usage(char *prog)
|
|
{
|
|
fprintf(stderr, "usage: %s dbpath [-V] [-v] [-n] [-q] [-w] [-c] [-d] [-s subdb]\n"
|
|
" -V\t\tshow version\n"
|
|
" -v\t\tmore verbose, could be used multiple times\n"
|
|
" -n\t\tNOSUBDIR mode for open\n"
|
|
" -q\t\tbe quiet\n"
|
|
" -w\t\tlock DB for writing while checking\n"
|
|
" -d\t\tdisable page-by-page traversal of b-tree\n"
|
|
" -s subdb\tprocess a specific subdatabase only\n"
|
|
" -c\t\tforce cooperative mode (don't try exclusive)\n", prog);
|
|
exit(EXIT_INTERRUPTED);
|
|
}
|
|
|
|
const char* meta_synctype(size_t sign) {
|
|
switch(sign) {
|
|
case 0:
|
|
return "no-sync/legacy";
|
|
case 1:
|
|
return "weak";
|
|
default:
|
|
return "steady";
|
|
}
|
|
}
|
|
|
|
int meta_lt(size_t txn1, size_t sign1, size_t txn2, size_t sign2) {
|
|
return ((sign1 > 1) == (sign2 > 1)) ? txn1 < txn2 : txn2 && sign2 > 1;
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int i, rc;
|
|
char *prog = argv[0];
|
|
char *envname;
|
|
int envflags = MDB_RDONLY;
|
|
int problems_maindb = 0, problems_freedb = 0, problems_meta = 0;
|
|
int dont_traversal = 0;
|
|
size_t n;
|
|
struct timespec timestamp_start, timestamp_finish;
|
|
double elapsed;
|
|
|
|
atexit(pagemap_cleanup);
|
|
|
|
if (clock_gettime(CLOCK_MONOTONIC, ×tamp_start)) {
|
|
rc = errno;
|
|
error("clock_gettime failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
return EXIT_FAILURE_SYS;
|
|
}
|
|
|
|
if (argc < 2) {
|
|
usage(prog);
|
|
}
|
|
|
|
while ((i = getopt(argc, argv, "Vvqnwcds:")) != EOF) {
|
|
switch(i) {
|
|
case 'V':
|
|
printf("%s\n", MDB_VERSION_STRING);
|
|
exit(EXIT_SUCCESS);
|
|
break;
|
|
case 'v':
|
|
verbose++;
|
|
break;
|
|
case 'q':
|
|
quiet = 1;
|
|
break;
|
|
case 'n':
|
|
envflags |= MDB_NOSUBDIR;
|
|
break;
|
|
case 'w':
|
|
envflags &= ~MDB_RDONLY;
|
|
break;
|
|
case 'c':
|
|
exclusive = 0;
|
|
break;
|
|
case 'd':
|
|
dont_traversal = 1;
|
|
break;
|
|
case 's':
|
|
if (only_subdb && strcmp(only_subdb, optarg))
|
|
usage(prog);
|
|
only_subdb = optarg;
|
|
break;
|
|
default:
|
|
usage(prog);
|
|
}
|
|
}
|
|
|
|
if (optind != argc - 1)
|
|
usage(prog);
|
|
|
|
#ifdef SIGPIPE
|
|
signal(SIGPIPE, signal_hanlder);
|
|
#endif
|
|
#ifdef SIGHUP
|
|
signal(SIGHUP, signal_hanlder);
|
|
#endif
|
|
signal(SIGINT, signal_hanlder);
|
|
signal(SIGTERM, signal_hanlder);
|
|
|
|
envname = argv[optind];
|
|
print("Running mdbx_chk for '%s' in %s mode...\n",
|
|
envname, (envflags & MDB_RDONLY) ? "read-only" : "write-lock");
|
|
fflush(NULL);
|
|
|
|
rc = mdbx_env_create(&env);
|
|
if (rc) {
|
|
error("mdbx_env_create failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
return rc < 0 ? EXIT_FAILURE_MDB : EXIT_FAILURE_SYS;
|
|
}
|
|
|
|
rc = mdbx_env_get_maxkeysize(env);
|
|
if (rc < 0) {
|
|
error("mdbx_env_get_maxkeysize failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
maxkeysize = rc;
|
|
|
|
mdbx_env_set_maxdbs(env, 3);
|
|
|
|
rc = mdbx_env_open_ex(env, envname, envflags, 0664, &exclusive);
|
|
if (rc) {
|
|
error("mdbx_env_open failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
if (verbose)
|
|
print(" - %s mode\n", exclusive ? "monopolistic" : "cooperative");
|
|
|
|
if (! (envflags & MDB_RDONLY)) {
|
|
rc = mdbx_txn_begin(env, NULL, 0, &locktxn);
|
|
if (rc) {
|
|
error("mdbx_txn_begin(lock-write) failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
}
|
|
|
|
rc = mdbx_txn_begin(env, NULL, MDB_RDONLY, &txn);
|
|
if (rc) {
|
|
error("mdbx_txn_begin(read-only) failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
rc = mdbx_env_info(env, &info, sizeof(info));
|
|
if (rc) {
|
|
error("mdbx_env_info failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
rc = mdbx_env_stat(env, &stat, sizeof(stat));
|
|
if (rc) {
|
|
error("mdbx_env_stat failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
lastpgno = info.base.me_last_pgno + 1;
|
|
errno = 0;
|
|
|
|
if (verbose) {
|
|
double k = 1024.0;
|
|
const char sf[] = "KMGTPEZY"; /* LY: Kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta! */
|
|
for(i = 0; sf[i+1] && info.base.me_mapsize / k > 1000.0; ++i)
|
|
k *= 1024;
|
|
print(" - map size %zu (%.2f %cb)\n", info.base.me_mapsize,
|
|
info.base.me_mapsize / k, sf[i]);
|
|
if (info.base.me_mapaddr)
|
|
print(" - mapaddr %p\n", info.base.me_mapaddr);
|
|
print(" - pagesize %u, max keysize %zu (%s), max readers %u\n",
|
|
stat.base.ms_psize, maxkeysize,
|
|
(maxkeysize == 511) ? "default" :
|
|
(maxkeysize == 0) ? "devel" : "custom",
|
|
info.base.me_maxreaders);
|
|
print(" - transactions: last %zu, bottom %zu, lag reading %zi\n", info.base.me_last_txnid,
|
|
info.me_tail_txnid, info.base.me_last_txnid - info.me_tail_txnid);
|
|
|
|
print(" - meta-1: %s %zu, %s",
|
|
meta_synctype(info.me_meta1_sign), info.me_meta1_txnid,
|
|
meta_lt(info.me_meta1_txnid, info.me_meta1_sign,
|
|
info.me_meta2_txnid, info.me_meta2_sign) ? "tail" : "head");
|
|
if (info.me_meta1_txnid > info.base.me_last_txnid)
|
|
print(", rolled-back %zu (%zu >>> %zu)\n",
|
|
info.me_meta1_txnid - info.base.me_last_txnid,
|
|
info.me_meta1_txnid, info.base.me_last_txnid);
|
|
print("\n");
|
|
|
|
print(" - meta-2: %s %zu, %s",
|
|
meta_synctype(info.me_meta2_sign), info.me_meta2_txnid,
|
|
meta_lt(info.me_meta2_txnid, info.me_meta2_sign,
|
|
info.me_meta1_txnid, info.me_meta1_sign) ? "tail" : "head");
|
|
if (info.me_meta2_txnid > info.base.me_last_txnid)
|
|
print(", rolled-back %zu (%zu >>> %zu)\n",
|
|
info.me_meta2_txnid - info.base.me_last_txnid,
|
|
info.me_meta2_txnid, info.base.me_last_txnid);
|
|
print("\n");
|
|
}
|
|
|
|
if (exclusive > 1) {
|
|
if (verbose)
|
|
print(" - perform full check last-txn-id with meta-pages\n");
|
|
|
|
if (! meta_lt(info.me_meta1_txnid, info.me_meta1_sign,
|
|
info.me_meta2_txnid, info.me_meta2_sign)
|
|
&& info.me_meta1_txnid != info.base.me_last_txnid) {
|
|
print(" - meta-1 txn-id mismatch last-txn-id (%zi != %zi)\n",
|
|
info.me_meta1_txnid, info.base.me_last_txnid);
|
|
++problems_meta;
|
|
}
|
|
|
|
if (! meta_lt(info.me_meta2_txnid, info.me_meta2_sign,
|
|
info.me_meta1_txnid, info.me_meta1_sign)
|
|
&& info.me_meta2_txnid != info.base.me_last_txnid) {
|
|
print(" - meta-2 txn-id mismatch last-txn-id (%zi != %zi)\n",
|
|
info.me_meta2_txnid, info.base.me_last_txnid);
|
|
++problems_meta;
|
|
}
|
|
} else if (locktxn) {
|
|
if (verbose)
|
|
print(" - perform lite check last-txn-id with meta-pages (not a monopolistic mode)\n");
|
|
size_t last = (info.me_meta2_txnid > info.me_meta1_txnid) ? info.me_meta2_txnid : info.me_meta1_txnid;
|
|
if (last != info.base.me_last_txnid) {
|
|
print(" - last-meta mismatch last-txn-id (%zi != %zi)\n",
|
|
last, info.base.me_last_txnid);
|
|
++problems_meta;
|
|
}
|
|
} else if (verbose) {
|
|
print(" - skip check last-txn-id with meta-pages (monopolistic or write-lock mode only)\n");
|
|
}
|
|
|
|
if (!dont_traversal) {
|
|
struct problem* saved_list;
|
|
size_t traversal_problems;
|
|
size_t empty_pages, lost_bytes;
|
|
|
|
print("Traversal b-tree...\n");
|
|
fflush(NULL);
|
|
walk.pagemap = calloc(lastpgno, sizeof(*walk.pagemap));
|
|
if (! walk.pagemap) {
|
|
rc = errno ? errno : ENOMEM;
|
|
error("calloc failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
saved_list = problems_push();
|
|
rc = mdbx_env_pgwalk(txn, pgvisitor, NULL);
|
|
traversal_problems = problems_pop(saved_list);
|
|
|
|
if (rc) {
|
|
if (rc == EINTR && gotsignal) {
|
|
print(" - interrupted by signal\n");
|
|
fflush(NULL);
|
|
} else {
|
|
error("mdbx_env_pgwalk failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
}
|
|
goto bailout;
|
|
}
|
|
|
|
for( n = 0; n < lastpgno; ++n)
|
|
if (! walk.pagemap[n])
|
|
walk.dbi_pages[0] += 1;
|
|
|
|
empty_pages = lost_bytes = 0;
|
|
for (i = 1; i < MAX_DBI && walk.dbi_names[i]; ++i) {
|
|
empty_pages += walk.dbi_empty_pages[i];
|
|
lost_bytes += walk.dbi_lost_bytes[i];
|
|
}
|
|
|
|
if (verbose) {
|
|
size_t total_page_bytes = walk.pgcount * stat.base.ms_psize;
|
|
print(" - dbi pages: %zu total", walk.pgcount);
|
|
if (verbose > 1)
|
|
for (i = 1; i < MAX_DBI && walk.dbi_names[i]; ++i)
|
|
print(", %s %zu", walk.dbi_names[i], walk.dbi_pages[i]);
|
|
print(", %s %zu\n", walk.dbi_names[0], walk.dbi_pages[0]);
|
|
if (verbose > 1) {
|
|
print(" - space info: total %zu bytes, payload %zu (%.1f%%), unused %zu (%.1f%%)\n",
|
|
total_page_bytes, walk.total_payload_bytes,
|
|
walk.total_payload_bytes * 100.0 / total_page_bytes,
|
|
total_page_bytes - walk.total_payload_bytes,
|
|
(total_page_bytes - walk.total_payload_bytes) * 100.0 / total_page_bytes);
|
|
for (i = 1; i < MAX_DBI && walk.dbi_names[i]; ++i) {
|
|
size_t dbi_bytes = walk.dbi_pages[i] * stat.base.ms_psize;
|
|
print(" %s: subtotal %zu bytes (%.1f%%), payload %zu (%.1f%%), unused %zu (%.1f%%)",
|
|
walk.dbi_names[i],
|
|
dbi_bytes, dbi_bytes * 100.0 / total_page_bytes,
|
|
walk.dbi_payload_bytes[i], walk.dbi_payload_bytes[i] * 100.0 / dbi_bytes,
|
|
dbi_bytes - walk.dbi_payload_bytes[i],
|
|
(dbi_bytes - walk.dbi_payload_bytes[i]) * 100.0 / dbi_bytes);
|
|
if (walk.dbi_empty_pages[i])
|
|
print(", %zu empty pages", walk.dbi_empty_pages[i]);
|
|
if (walk.dbi_lost_bytes[i])
|
|
print(", %zu bytes lost", walk.dbi_lost_bytes[i]);
|
|
print("\n");
|
|
}
|
|
}
|
|
print(" - summary: average fill %.1f%%", walk.total_payload_bytes * 100.0 / total_page_bytes);
|
|
if (empty_pages)
|
|
print(", %zu empty pages", empty_pages);
|
|
if (lost_bytes)
|
|
print(", %zu bytes lost", lost_bytes);
|
|
print(", %zu problems\n", traversal_problems);
|
|
}
|
|
} else if (verbose) {
|
|
print("Skipping b-tree walk...\n");
|
|
fflush(NULL);
|
|
}
|
|
|
|
if (! verbose)
|
|
print("Iterating DBIs...\n");
|
|
problems_maindb = process_db(-1, /* MAIN_DBI */ NULL, NULL, 0);
|
|
problems_freedb = process_db(0 /* FREE_DBI */, "free", handle_freedb, 0);
|
|
|
|
if (verbose) {
|
|
size_t value = info.base.me_mapsize / stat.base.ms_psize;
|
|
double percent = value / 100.0;
|
|
print(" - pages info: %zu total", value);
|
|
print(", allocated %zu (%.1f%%)", lastpgno, lastpgno / percent);
|
|
|
|
if (verbose > 1) {
|
|
value = info.base.me_mapsize / stat.base.ms_psize - lastpgno;
|
|
print(", remained %zu (%.1f%%)", value, value / percent);
|
|
|
|
value = lastpgno - freedb_pages;
|
|
print(", used %zu (%.1f%%)", value, value / percent);
|
|
|
|
print(", gc %zu (%.1f%%)", freedb_pages, freedb_pages / percent);
|
|
|
|
value = freedb_pages - reclaimable_pages;
|
|
print(", detained %zu (%.1f%%)", value, value / percent);
|
|
|
|
print(", reclaimable %zu (%.1f%%)", reclaimable_pages, reclaimable_pages / percent);
|
|
}
|
|
|
|
value = info.base.me_mapsize / stat.base.ms_psize - lastpgno + reclaimable_pages;
|
|
print(", available %zu (%.1f%%)\n", value, value / percent);
|
|
}
|
|
|
|
if (problems_maindb == 0 && problems_freedb == 0) {
|
|
if (!dont_traversal && (exclusive || locktxn)) {
|
|
if (walk.pgcount != lastpgno - freedb_pages) {
|
|
error("used pages mismatch (%zu != %zu)\n", walk.pgcount, lastpgno - freedb_pages);
|
|
}
|
|
if (walk.dbi_pages[0] != freedb_pages) {
|
|
error("gc pages mismatch (%zu != %zu)\n", walk.dbi_pages[0], freedb_pages);
|
|
}
|
|
} else if (verbose) {
|
|
print(" - skip check used and gc pages (btree-traversal with monopolistic or write-lock mode only)\n");
|
|
}
|
|
|
|
if (! process_db(-1, NULL, handle_maindb, 1)) {
|
|
if (! userdb_count && verbose)
|
|
print(" - does not contain multiple databases\n");
|
|
}
|
|
}
|
|
|
|
bailout:
|
|
if (txn)
|
|
mdbx_txn_abort(txn);
|
|
if (locktxn)
|
|
mdbx_txn_abort(locktxn);
|
|
if (env)
|
|
mdbx_env_close(env);
|
|
fflush(NULL);
|
|
if (rc) {
|
|
if (rc < 0)
|
|
return gotsignal ? EXIT_INTERRUPTED : EXIT_FAILURE_SYS;
|
|
return EXIT_FAILURE_MDB;
|
|
}
|
|
|
|
if (clock_gettime(CLOCK_MONOTONIC, ×tamp_finish)) {
|
|
rc = errno;
|
|
error("clock_gettime failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
return EXIT_FAILURE_SYS;
|
|
}
|
|
|
|
elapsed = timestamp_finish.tv_sec - timestamp_start.tv_sec
|
|
+ (timestamp_finish.tv_nsec - timestamp_start.tv_nsec) * 1e-9;
|
|
|
|
total_problems += problems_meta;
|
|
if (total_problems || problems_maindb || problems_freedb) {
|
|
print("Total %zu error(s) is detected, elapsed %.3f seconds.\n",
|
|
total_problems, elapsed);
|
|
if (problems_meta || problems_maindb || problems_freedb)
|
|
return EXIT_FAILURE_CHECK_MAJOR;
|
|
return EXIT_FAILURE_CHECK_MINOR;
|
|
}
|
|
print("No error is detected, elapsed %.3f seconds\n", elapsed);
|
|
return EXIT_SUCCESS;
|
|
}
|