mirror of
https://github.com/isar/libmdbx.git
synced 2025-01-08 05:24:12 +08:00
b8b3ba8e91
Change-Id: I3134c100880ff28bb0aaf46ed91affc9f6347110
1138 lines
34 KiB
C
1138 lines
34 KiB
C
/* mdbx_chk.c - memory-mapped database check tool */
|
|
|
|
/*
|
|
* Copyright 2015-2017 Leonid Yuriev <leo@yuriev.ru>
|
|
* and other libmdbx authors: please see AUTHORS file.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted only as authorized by the OpenLDAP
|
|
* Public License.
|
|
*
|
|
* A copy of this license is available in the file LICENSE in the
|
|
* top-level directory of the distribution or, alternatively, at
|
|
* <http://www.OpenLDAP.org/license.html>. */
|
|
|
|
#ifdef _MSC_VER
|
|
#if _MSC_VER > 1800
|
|
#pragma warning(disable : 4464) /* relative include path contains '..' */
|
|
#endif
|
|
#pragma warning(disable : 4996) /* The POSIX name is deprecated... */
|
|
#endif /* _MSC_VER (warnings) */
|
|
|
|
#include "../bits.h"
|
|
|
|
typedef struct flagbit {
|
|
int bit;
|
|
char *name;
|
|
} flagbit;
|
|
|
|
flagbit dbflags[] = {{MDBX_DUPSORT, "dupsort"},
|
|
{MDBX_INTEGERKEY, "integerkey"},
|
|
{MDBX_REVERSEKEY, "reversekey"},
|
|
{MDBX_DUPFIXED, "dupfixed"},
|
|
{MDBX_REVERSEDUP, "reversedup"},
|
|
{MDBX_INTEGERDUP, "integerdup"},
|
|
{0, NULL}};
|
|
|
|
#if defined(_WIN32) || defined(_WIN64)
|
|
#include "wingetopt.h"
|
|
|
|
static volatile BOOL user_break;
|
|
static BOOL WINAPI ConsoleBreakHandlerRoutine(DWORD dwCtrlType) {
|
|
(void)dwCtrlType;
|
|
user_break = true;
|
|
return true;
|
|
}
|
|
|
|
#else /* WINDOWS */
|
|
|
|
static volatile sig_atomic_t user_break;
|
|
static void signal_handler(int sig) {
|
|
(void)sig;
|
|
user_break = 1;
|
|
}
|
|
|
|
#endif /* !WINDOWS */
|
|
|
|
#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];
|
|
uint64_t dbi_pages[MAX_DBI];
|
|
uint64_t dbi_empty_pages[MAX_DBI];
|
|
uint64_t dbi_payload_bytes[MAX_DBI];
|
|
uint64_t dbi_lost_bytes[MAX_DBI];
|
|
short *pagemap;
|
|
uint64_t total_payload_bytes;
|
|
uint64_t pgcount;
|
|
} walk;
|
|
|
|
uint64_t total_unused_bytes;
|
|
int exclusive = 2;
|
|
int envflags = MDBX_RDONLY;
|
|
|
|
MDBX_env *env;
|
|
MDBX_txn *txn, *locktxn;
|
|
MDBX_envinfo envinfo;
|
|
MDBX_stat envstat;
|
|
size_t maxkeysize, userdb_count, skipped_subdb;
|
|
uint64_t reclaimable_pages, freedb_pages, lastpgno;
|
|
unsigned verbose, quiet;
|
|
const char *only_subdb;
|
|
|
|
struct problem {
|
|
struct problem *pr_next;
|
|
uint64_t count;
|
|
const char *caption;
|
|
};
|
|
|
|
struct problem *problems_list;
|
|
uint64_t total_problems;
|
|
|
|
static void
|
|
#ifdef __GNU__
|
|
__attribute__((format(printf, 1, 2)))
|
|
#endif
|
|
print(const char *msg, ...) {
|
|
if (!quiet) {
|
|
va_list args;
|
|
|
|
fflush(stderr);
|
|
va_start(args, msg);
|
|
vfprintf(stdout, msg, args);
|
|
va_end(args);
|
|
}
|
|
}
|
|
|
|
static void
|
|
#ifdef __GNU__
|
|
__attribute__((format(printf, 1, 2)))
|
|
#endif
|
|
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, uint64_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 #%" PRIu64 ": %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(void) {
|
|
struct problem *p = problems_list;
|
|
problems_list = NULL;
|
|
return p;
|
|
}
|
|
|
|
static uint64_t problems_pop(struct problem *list) {
|
|
uint64_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 (%" PRIu64 ")", 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(uint64_t pgno, unsigned pgnumber, void *ctx,
|
|
const char *dbi, const char *type, size_t nentries,
|
|
size_t payload_bytes, size_t header_bytes,
|
|
size_t unused_bytes) {
|
|
(void)ctx;
|
|
|
|
if (type) {
|
|
uint64_t page_bytes = payload_bytes + header_bytes + unused_bytes;
|
|
size_t page_size = (size_t)pgnumber * envstat.ms_psize;
|
|
int index = pagemap_lookup_dbi(dbi);
|
|
if (index < 0)
|
|
return MDBX_ENOMEM;
|
|
|
|
if (verbose > 2 && (!only_subdb || strcmp(only_subdb, dbi) == 0)) {
|
|
if (pgnumber == 1)
|
|
print(" %s-page %" PRIu64, type, pgno);
|
|
else
|
|
print(" %s-span %" PRIu64 "[%u]", type, pgno, pgnumber);
|
|
print(" of %s: header %" PRIiPTR ", payload %" PRIiPTR
|
|
", unused %" PRIiPTR "\n",
|
|
dbi, header_bytes, payload_bytes, unused_bytes);
|
|
}
|
|
|
|
walk.pgcount += pgnumber;
|
|
|
|
if (unused_bytes > page_size)
|
|
problem_add("page", pgno, "illegal unused-bytes", "%u < %i < %u", 0,
|
|
unused_bytes, envstat.ms_psize);
|
|
|
|
if (header_bytes < (int)sizeof(long) ||
|
|
(size_t)header_bytes >= envstat.ms_psize - sizeof(long))
|
|
problem_add("page", pgno, "illegal header-length",
|
|
"%" PRIuPTR " < %i < %" PRIuPTR "", sizeof(long),
|
|
header_bytes, envstat.ms_psize - sizeof(long));
|
|
if (payload_bytes < 1) {
|
|
if (nentries > 1) {
|
|
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",
|
|
"%" PRIu64 " != %" PRIu64 " (%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",
|
|
"%" PRIu64 " > %" PRIu64 "", 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] = (short)index;
|
|
walk.dbi_pages[index] += 1;
|
|
}
|
|
++pgno;
|
|
} while (--pgnumber);
|
|
}
|
|
}
|
|
|
|
return user_break ? MDBX_EINTR : MDBX_SUCCESS;
|
|
}
|
|
|
|
typedef int(visitor)(const uint64_t record_number, const MDBX_val *key,
|
|
const MDBX_val *data);
|
|
static int process_db(MDBX_dbi dbi, char *name, visitor *handler, bool silent);
|
|
|
|
static int handle_userdb(const uint64_t record_number, const MDBX_val *key,
|
|
const MDBX_val *data) {
|
|
(void)record_number;
|
|
(void)key;
|
|
(void)data;
|
|
return MDBX_SUCCESS;
|
|
}
|
|
|
|
static int handle_freedb(const uint64_t record_number, const MDBX_val *key,
|
|
const MDBX_val *data) {
|
|
char *bad = "";
|
|
pgno_t *iptr = data->iov_base;
|
|
txnid_t txnid = *(txnid_t *)key->iov_base;
|
|
|
|
if (key->iov_len != sizeof(txnid_t))
|
|
problem_add("entry", record_number, "wrong txn-id size",
|
|
"key-size %" PRIiPTR "", key->iov_len);
|
|
else if (txnid < 1 || txnid > envinfo.mi_recent_txnid)
|
|
problem_add("entry", record_number, "wrong txn-id", "%" PRIaTXN "", txnid);
|
|
|
|
if (data->iov_len < sizeof(pgno_t) || data->iov_len % sizeof(pgno_t))
|
|
problem_add("entry", record_number, "wrong idl size", "%" PRIuPTR "",
|
|
data->iov_len);
|
|
else {
|
|
const intptr_t number = *iptr++;
|
|
if (number >= MDBX_PNL_UM_MAX)
|
|
problem_add("entry", record_number, "wrong idl length", "%" PRIiPTR "",
|
|
number);
|
|
else if ((number + 1) * sizeof(pgno_t) != data->iov_len)
|
|
problem_add("entry", record_number, "mismatch idl length",
|
|
"%" PRIiPTR " != %" PRIuPTR "", (number + 1) * sizeof(pgno_t),
|
|
data->iov_len);
|
|
else {
|
|
freedb_pages += number;
|
|
if (envinfo.mi_latter_reader_txnid > txnid)
|
|
reclaimable_pages += number;
|
|
|
|
pgno_t prev =
|
|
MDBX_PNL_ASCENDING ? NUM_METAS - 1 : envinfo.mi_last_pgno + 1;
|
|
intptr_t span = 1;
|
|
for (intptr_t i = 0; i < number; ++i) {
|
|
const pgno_t pg = iptr[i];
|
|
if (pg < NUM_METAS || pg > envinfo.mi_last_pgno)
|
|
problem_add("entry", record_number, "wrong idl entry",
|
|
"%u < %" PRIiPTR " < %" PRIiPTR "", NUM_METAS, pg,
|
|
envinfo.mi_last_pgno);
|
|
else if (MDBX_PNL_DISORDERED(prev, pg)) {
|
|
bad = " [bad sequence]";
|
|
problem_add("entry", record_number, "bad sequence",
|
|
"%" PRIiPTR " <> %" PRIiPTR "", prev, pg);
|
|
}
|
|
prev = pg;
|
|
while (i + span < number &&
|
|
iptr[i + span] == (MDBX_PNL_ASCENDING ? pgno_add(pg, span)
|
|
: pgno_sub(pg, span)))
|
|
++span;
|
|
}
|
|
if (verbose > 2 && !only_subdb) {
|
|
print(" transaction %" PRIaTXN ", %u pages, maxspan %i%s\n", txnid,
|
|
number, span, bad);
|
|
if (verbose > 3) {
|
|
for (intptr_t i = 0; i < number; i += span) {
|
|
const pgno_t pg = iptr[i];
|
|
for (span = 1;
|
|
i + span < number &&
|
|
iptr[i + span] == (MDBX_PNL_ASCENDING ? pgno_add(pg, span)
|
|
: pgno_sub(pg, span));
|
|
++span)
|
|
;
|
|
if (span > 1) {
|
|
print(" %9" PRIaPGNO "[%" PRIiPTR "]\n", pg, span);
|
|
} else
|
|
print(" %9" PRIaPGNO "\n", pg);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return MDBX_SUCCESS;
|
|
}
|
|
|
|
static int handle_maindb(const uint64_t record_number, const MDBX_val *key,
|
|
const MDBX_val *data) {
|
|
char *name;
|
|
int rc;
|
|
size_t i;
|
|
|
|
name = key->iov_base;
|
|
for (i = 0; i < key->iov_len; ++i) {
|
|
if (name[i] < ' ')
|
|
return handle_userdb(record_number, key, data);
|
|
}
|
|
|
|
name = malloc(key->iov_len + 1);
|
|
memcpy(name, key->iov_base, key->iov_len);
|
|
name[key->iov_len] = '\0';
|
|
userdb_count++;
|
|
|
|
rc = process_db(~0u, name, handle_userdb, false);
|
|
free(name);
|
|
if (rc != MDBX_INCOMPATIBLE)
|
|
return rc;
|
|
|
|
return handle_userdb(record_number, key, data);
|
|
}
|
|
|
|
static int process_db(MDBX_dbi dbi, char *name, visitor *handler, bool silent) {
|
|
MDBX_cursor *mc;
|
|
MDBX_stat ms;
|
|
MDBX_val key, data;
|
|
MDBX_val prev_key, prev_data;
|
|
unsigned flags;
|
|
int rc, i;
|
|
struct problem *saved_list;
|
|
uint64_t problems_count;
|
|
|
|
uint64_t record_count = 0, dups = 0;
|
|
uint64_t key_bytes = 0, data_bytes = 0;
|
|
|
|
if (dbi == ~0u) {
|
|
rc = mdbx_dbi_open(txn, name, 0, &dbi);
|
|
if (rc) {
|
|
if (!name ||
|
|
rc !=
|
|
MDBX_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 >= CORE_DBS && name && only_subdb && strcmp(only_subdb, name)) {
|
|
if (verbose) {
|
|
print("Skip processing '%s'...\n", name);
|
|
fflush(NULL);
|
|
}
|
|
skipped_subdb++;
|
|
return MDBX_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));
|
|
return rc;
|
|
}
|
|
|
|
rc = mdbx_dbi_stat(txn, dbi, &ms, sizeof(ms));
|
|
if (rc) {
|
|
error(" - mdbx_dbi_stat failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
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 %" PRIu64 "\n", ms.ms_psize,
|
|
ms.ms_entries);
|
|
print(" - b-tree depth %u, pages: branch %" PRIu64 ", leaf %" PRIu64
|
|
", overflow %" PRIu64 "\n",
|
|
ms.ms_depth, ms.ms_branch_pages, ms.ms_leaf_pages,
|
|
ms.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));
|
|
return rc;
|
|
}
|
|
|
|
saved_list = problems_push();
|
|
prev_key.iov_base = NULL;
|
|
prev_data.iov_len = 0;
|
|
rc = mdbx_cursor_get(mc, &key, &data, MDBX_FIRST);
|
|
while (rc == MDBX_SUCCESS) {
|
|
if (user_break) {
|
|
print(" - interrupted by signal\n");
|
|
fflush(NULL);
|
|
rc = MDBX_EINTR;
|
|
goto bailout;
|
|
}
|
|
|
|
if (key.iov_len > maxkeysize) {
|
|
problem_add("entry", record_count, "key length exceeds max-key-size",
|
|
"%" PRIuPTR " > %u", key.iov_len, maxkeysize);
|
|
} else if ((flags & MDBX_INTEGERKEY) && key.iov_len != sizeof(uint64_t) &&
|
|
key.iov_len != sizeof(uint32_t)) {
|
|
problem_add("entry", record_count, "wrong key length",
|
|
"%" PRIuPTR " != 4or8", key.iov_len);
|
|
}
|
|
|
|
if ((flags & MDBX_INTEGERDUP) && data.iov_len != sizeof(uint64_t) &&
|
|
data.iov_len != sizeof(uint32_t)) {
|
|
problem_add("entry", record_count, "wrong data length",
|
|
"%" PRIuPTR " != 4or8", data.iov_len);
|
|
}
|
|
|
|
if (prev_key.iov_base) {
|
|
if ((flags & MDBX_DUPFIXED) && prev_data.iov_len != data.iov_len) {
|
|
problem_add("entry", record_count, "different data length",
|
|
"%" PRIuPTR " != %" PRIuPTR "", prev_data.iov_len,
|
|
data.iov_len);
|
|
}
|
|
|
|
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 & MDBX_DUPSORT))
|
|
problem_add("entry", record_count, "duplicated entries", NULL);
|
|
else if (flags & MDBX_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 & MDBX_INTEGERKEY)
|
|
print(" - fixed key-size %" PRIuPTR "\n", key.iov_len);
|
|
if (flags & (MDBX_INTEGERDUP | MDBX_DUPFIXED))
|
|
print(" - fixed data-size %" PRIuPTR "\n", data.iov_len);
|
|
}
|
|
|
|
if (handler) {
|
|
rc = handler(record_count, &key, &data);
|
|
if (rc)
|
|
goto bailout;
|
|
}
|
|
|
|
record_count++;
|
|
key_bytes += key.iov_len;
|
|
data_bytes += data.iov_len;
|
|
|
|
prev_key = key;
|
|
prev_data = data;
|
|
rc = mdbx_cursor_get(mc, &key, &data, MDBX_NEXT);
|
|
}
|
|
if (rc != MDBX_NOTFOUND)
|
|
error(" - mdbx_cursor_get failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
else
|
|
rc = 0;
|
|
|
|
if (record_count != ms.ms_entries)
|
|
problem_add("entry", record_count, "differentent number of entries",
|
|
"%" PRIuPTR " != %" PRIuPTR "", record_count, ms.ms_entries);
|
|
bailout:
|
|
problems_count = problems_pop(saved_list);
|
|
if (!silent && verbose) {
|
|
print(" - summary: %" PRIu64 " records, %" PRIu64 " dups, %" PRIu64
|
|
" key's bytes, %" PRIu64 " data's "
|
|
"bytes, %" PRIu64 " problems\n",
|
|
record_count, dups, key_bytes, data_bytes, problems_count);
|
|
fflush(NULL);
|
|
}
|
|
|
|
mdbx_cursor_close(mc);
|
|
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(uint64_t sign) {
|
|
switch (sign) {
|
|
case MDBX_DATASIGN_NONE:
|
|
return "no-sync/legacy";
|
|
case MDBX_DATASIGN_WEAK:
|
|
return "weak";
|
|
default:
|
|
return "steady";
|
|
}
|
|
}
|
|
|
|
static __inline bool meta_ot(txnid_t txn_a, uint64_t sign_a, txnid_t txn_b,
|
|
uint64_t sign_b, const bool roolback2steady) {
|
|
if (txn_a == txn_b)
|
|
return SIGN_IS_STEADY(sign_b);
|
|
|
|
if (roolback2steady && SIGN_IS_STEADY(sign_a) != SIGN_IS_STEADY(sign_b))
|
|
return SIGN_IS_STEADY(sign_b);
|
|
|
|
return txn_a < txn_b;
|
|
}
|
|
|
|
static __inline bool meta_eq(txnid_t txn_a, uint64_t sign_a, txnid_t txn_b,
|
|
uint64_t sign_b) {
|
|
if (txn_a != txn_b)
|
|
return false;
|
|
|
|
if (SIGN_IS_STEADY(sign_a) != SIGN_IS_STEADY(sign_b))
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
static __inline int meta_recent(const bool roolback2steady) {
|
|
|
|
if (meta_ot(envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign,
|
|
envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign, roolback2steady))
|
|
return meta_ot(envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign,
|
|
envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign,
|
|
roolback2steady)
|
|
? 1
|
|
: 2;
|
|
|
|
return meta_ot(envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign,
|
|
envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign, roolback2steady)
|
|
? 2
|
|
: 0;
|
|
}
|
|
|
|
static __inline int meta_tail(int head) {
|
|
|
|
if (head == 0)
|
|
return meta_ot(envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign,
|
|
envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign, true)
|
|
? 1
|
|
: 2;
|
|
if (head == 1)
|
|
return meta_ot(envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign,
|
|
envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign, true)
|
|
? 0
|
|
: 2;
|
|
if (head == 2)
|
|
return meta_ot(envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign,
|
|
envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign, true)
|
|
? 0
|
|
: 1;
|
|
assert(false);
|
|
return -1;
|
|
}
|
|
|
|
static int meta_steady(void) { return meta_recent(true); }
|
|
|
|
static int meta_head(void) { return meta_recent(false); }
|
|
|
|
void verbose_meta(int num, txnid_t txnid, uint64_t sign) {
|
|
print(" - meta-%d: %s %" PRIu64, num, meta_synctype(sign), txnid);
|
|
bool stay = true;
|
|
|
|
const int steady = meta_steady();
|
|
const int head = meta_head();
|
|
if (num == steady && num == head) {
|
|
print(", head");
|
|
stay = false;
|
|
} else if (num == steady) {
|
|
print(", head-steady");
|
|
stay = false;
|
|
} else if (num == head) {
|
|
print(", head-weak");
|
|
stay = false;
|
|
}
|
|
if (num == meta_tail(head)) {
|
|
print(", tail");
|
|
stay = false;
|
|
}
|
|
if (stay)
|
|
print(", stay");
|
|
|
|
if (txnid > envinfo.mi_recent_txnid &&
|
|
(exclusive || (envflags & MDBX_RDONLY) == 0))
|
|
print(", rolled-back %" PRIu64 " (%" PRIu64 " >>> %" PRIu64 ")",
|
|
txnid - envinfo.mi_recent_txnid, txnid, envinfo.mi_recent_txnid);
|
|
print("\n");
|
|
}
|
|
|
|
static int check_meta_head(bool steady) {
|
|
switch (meta_recent(steady)) {
|
|
default:
|
|
assert(false);
|
|
error(" - unexpected internal error (%s)\n",
|
|
steady ? "meta_steady_head" : "meta_weak_head");
|
|
case 0:
|
|
if (envinfo.mi_meta0_txnid != envinfo.mi_recent_txnid) {
|
|
print(" - meta-%d txn-id mismatch recent-txn-id (%" PRIi64 " != %" PRIi64
|
|
")\n",
|
|
0, envinfo.mi_meta0_txnid, envinfo.mi_recent_txnid);
|
|
return 1;
|
|
}
|
|
break;
|
|
case 1:
|
|
if (envinfo.mi_meta1_txnid != envinfo.mi_recent_txnid) {
|
|
print(" - meta-%d txn-id mismatch recent-txn-id (%" PRIi64 " != %" PRIi64
|
|
")\n",
|
|
1, envinfo.mi_meta1_txnid, envinfo.mi_recent_txnid);
|
|
return 1;
|
|
}
|
|
break;
|
|
case 2:
|
|
if (envinfo.mi_meta2_txnid != envinfo.mi_recent_txnid) {
|
|
print(" - meta-%d txn-id mismatch recent-txn-id (%" PRIi64 " != %" PRIi64
|
|
")\n",
|
|
2, envinfo.mi_meta2_txnid, envinfo.mi_recent_txnid);
|
|
return 1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static void print_size(const char *prefix, const uint64_t value,
|
|
const char *suffix) {
|
|
const char sf[] =
|
|
"KMGTPEZY"; /* LY: Kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta! */
|
|
double k = 1024.0;
|
|
size_t i;
|
|
for (i = 0; sf[i + 1] && value / k > 1000.0; ++i)
|
|
k *= 1024;
|
|
print("%s%" PRIu64 " (%.2f %cb)%s", prefix, value, value / k, sf[i], suffix);
|
|
}
|
|
|
|
int main(int argc, char *argv[]) {
|
|
int i, rc;
|
|
char *prog = argv[0];
|
|
char *envname;
|
|
int problems_maindb = 0, problems_freedb = 0, problems_meta = 0;
|
|
int dont_traversal = 0;
|
|
|
|
double elapsed;
|
|
#if defined(_WIN32) || defined(_WIN64)
|
|
uint64_t timestamp_start, timestamp_finish;
|
|
timestamp_start = GetTickCount64();
|
|
#else
|
|
struct timespec timestamp_start, timestamp_finish;
|
|
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;
|
|
}
|
|
#endif
|
|
|
|
walk.dbi_names[0] = "@gc";
|
|
atexit(pagemap_cleanup);
|
|
|
|
if (argc < 2) {
|
|
usage(prog);
|
|
}
|
|
|
|
while ((i = getopt(argc, argv, "Vvqnwcds:")) != EOF) {
|
|
switch (i) {
|
|
case 'V':
|
|
printf("%s (%s, build %s)\n", mdbx_version.git.describe,
|
|
mdbx_version.git.datetime, mdbx_build.datetime);
|
|
exit(EXIT_SUCCESS);
|
|
break;
|
|
case 'v':
|
|
verbose++;
|
|
break;
|
|
case 'q':
|
|
quiet = 1;
|
|
break;
|
|
case 'n':
|
|
envflags |= MDBX_NOSUBDIR;
|
|
break;
|
|
case 'w':
|
|
envflags &= ~MDBX_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);
|
|
|
|
#if defined(_WIN32) || defined(_WIN64)
|
|
SetConsoleCtrlHandler(ConsoleBreakHandlerRoutine, true);
|
|
#else
|
|
#ifdef SIGPIPE
|
|
signal(SIGPIPE, signal_handler);
|
|
#endif
|
|
#ifdef SIGHUP
|
|
signal(SIGHUP, signal_handler);
|
|
#endif
|
|
signal(SIGINT, signal_handler);
|
|
signal(SIGTERM, signal_handler);
|
|
#endif /* !WINDOWS */
|
|
|
|
envname = argv[optind];
|
|
print("Running mdbx_chk for '%s' in %s mode...\n", envname,
|
|
(envflags & MDBX_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_set_maxdbs(env, MAX_DBI);
|
|
if (rc) {
|
|
error("mdbx_env_set_maxdbs failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
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));
|
|
if (rc == MDBX_WANNA_RECOVERY && (envflags & MDBX_RDONLY))
|
|
print("Please run %s in the read-write mode (with '-w' option).\n", prog);
|
|
goto bailout;
|
|
}
|
|
if (verbose)
|
|
print(" - %s mode\n", exclusive ? "monopolistic" : "cooperative");
|
|
|
|
if (!(envflags & MDBX_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_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;
|
|
|
|
rc = mdbx_txn_begin(env, NULL, MDBX_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, &envinfo, sizeof(envinfo));
|
|
if (rc) {
|
|
error("mdbx_env_info failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
rc = mdbx_env_stat(env, &envstat, sizeof(envstat));
|
|
if (rc) {
|
|
error("mdbx_env_stat failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
goto bailout;
|
|
}
|
|
|
|
lastpgno = envinfo.mi_last_pgno + 1;
|
|
errno = 0;
|
|
|
|
if (verbose) {
|
|
print(" - pagesize %u (%u system), max keysize %" PRIuPTR
|
|
", max readers %u\n",
|
|
envinfo.mi_dxb_pagesize, envinfo.mi_sys_pagesize, maxkeysize,
|
|
envinfo.mi_maxreaders);
|
|
print_size(" - mapsize ", envinfo.mi_mapsize, "\n");
|
|
if (envinfo.mi_geo.lower == envinfo.mi_geo.upper)
|
|
print_size(" - fixed datafile: ", envinfo.mi_geo.current, "");
|
|
else {
|
|
print_size(" - dynamic datafile: ", envinfo.mi_geo.lower, "");
|
|
print_size(" .. ", envinfo.mi_geo.upper, ", ");
|
|
print_size("+", envinfo.mi_geo.grow, ", ");
|
|
print_size("-", envinfo.mi_geo.shrink, "\n");
|
|
print_size(" - current datafile: ", envinfo.mi_geo.current, "");
|
|
}
|
|
printf(", %" PRIu64 " pages\n",
|
|
envinfo.mi_geo.current / envinfo.mi_dxb_pagesize);
|
|
print(" - transactions: recent %" PRIu64 ", latter reader %" PRIu64
|
|
", lag %" PRIi64 "\n",
|
|
envinfo.mi_recent_txnid, envinfo.mi_latter_reader_txnid,
|
|
envinfo.mi_recent_txnid - envinfo.mi_latter_reader_txnid);
|
|
|
|
verbose_meta(0, envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign);
|
|
verbose_meta(1, envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign);
|
|
verbose_meta(2, envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign);
|
|
}
|
|
|
|
if (verbose)
|
|
print(" - performs check for meta-pages clashes\n");
|
|
if (meta_eq(envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign,
|
|
envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign)) {
|
|
print(" - meta-%d and meta-%d are clashed\n", 0, 1);
|
|
++problems_meta;
|
|
}
|
|
if (meta_eq(envinfo.mi_meta1_txnid, envinfo.mi_meta1_sign,
|
|
envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign)) {
|
|
print(" - meta-%d and meta-%d are clashed\n", 1, 2);
|
|
++problems_meta;
|
|
}
|
|
if (meta_eq(envinfo.mi_meta2_txnid, envinfo.mi_meta2_sign,
|
|
envinfo.mi_meta0_txnid, envinfo.mi_meta0_sign)) {
|
|
print(" - meta-%d and meta-%d are clashed\n", 2, 0);
|
|
++problems_meta;
|
|
}
|
|
|
|
if (exclusive > 1) {
|
|
if (verbose)
|
|
print(" - performs full check recent-txn-id with meta-pages\n");
|
|
problems_meta += check_meta_head(true);
|
|
} else if (locktxn) {
|
|
if (verbose)
|
|
print(" - performs lite check recent-txn-id with meta-pages (not a "
|
|
"monopolistic mode)\n");
|
|
problems_meta += check_meta_head(false);
|
|
} else if (verbose) {
|
|
print(" - skip check recent-txn-id with meta-pages (monopolistic or "
|
|
"write-lock mode only)\n");
|
|
}
|
|
|
|
if (!dont_traversal) {
|
|
struct problem *saved_list;
|
|
uint64_t traversal_problems;
|
|
uint64_t empty_pages, lost_bytes;
|
|
|
|
print("Traversal b-tree by txn#%" PRIaTXN "...\n", txn->mt_txnid);
|
|
fflush(NULL);
|
|
walk.pagemap = calloc((size_t)lastpgno, sizeof(*walk.pagemap));
|
|
if (!walk.pagemap) {
|
|
rc = errno ? errno : MDBX_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 == MDBX_EINTR && user_break) {
|
|
print(" - interrupted by signal\n");
|
|
fflush(NULL);
|
|
} else {
|
|
error("mdbx_env_pgwalk failed, error %d %s\n", rc, mdbx_strerror(rc));
|
|
}
|
|
goto bailout;
|
|
}
|
|
|
|
uint64_t n;
|
|
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) {
|
|
uint64_t total_page_bytes = walk.pgcount * envstat.ms_psize;
|
|
print(" - dbi pages: %" PRIu64 " total", walk.pgcount);
|
|
if (verbose > 1)
|
|
for (i = 1; i < MAX_DBI && walk.dbi_names[i]; ++i)
|
|
print(", %s %" PRIu64 "", walk.dbi_names[i], walk.dbi_pages[i]);
|
|
print(", %s %" PRIu64 "\n", walk.dbi_names[0], walk.dbi_pages[0]);
|
|
if (verbose > 1) {
|
|
print(" - space info: total %" PRIu64 " bytes, payload %" PRIu64
|
|
" (%.1f%%), unused "
|
|
"%" PRIu64 " (%.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) {
|
|
uint64_t dbi_bytes = walk.dbi_pages[i] * envstat.ms_psize;
|
|
print(" %s: subtotal %" PRIu64 " bytes (%.1f%%),"
|
|
" payload %" PRIu64 " (%.1f%%), unused %" PRIu64 " (%.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(", %" PRIu64 " empty pages", walk.dbi_empty_pages[i]);
|
|
if (walk.dbi_lost_bytes[i])
|
|
print(", %" PRIu64 " 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(", %" PRIuPTR " empty pages", empty_pages);
|
|
if (lost_bytes)
|
|
print(", %" PRIuPTR " bytes lost", lost_bytes);
|
|
print(", %" PRIuPTR " 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(~0u, /* MAIN_DBI */ NULL, NULL, false);
|
|
problems_freedb = process_db(FREE_DBI, "free", handle_freedb, false);
|
|
|
|
if (verbose) {
|
|
uint64_t value = envinfo.mi_mapsize / envstat.ms_psize;
|
|
double percent = value / 100.0;
|
|
print(" - pages info: %" PRIu64 " total", value);
|
|
value = envinfo.mi_geo.current / envinfo.mi_dxb_pagesize;
|
|
print(", backed %" PRIu64 " (%.1f%%)", value, value / percent);
|
|
print(", allocated %" PRIu64 " (%.1f%%)", lastpgno, lastpgno / percent);
|
|
|
|
if (verbose > 1) {
|
|
value = envinfo.mi_mapsize / envstat.ms_psize - lastpgno;
|
|
print(", remained %" PRIu64 " (%.1f%%)", value, value / percent);
|
|
|
|
value = lastpgno - freedb_pages;
|
|
print(", used %" PRIu64 " (%.1f%%)", value, value / percent);
|
|
|
|
print(", gc %" PRIu64 " (%.1f%%)", freedb_pages, freedb_pages / percent);
|
|
|
|
value = freedb_pages - reclaimable_pages;
|
|
print(", detained %" PRIu64 " (%.1f%%)", value, value / percent);
|
|
|
|
print(", reclaimable %" PRIu64 " (%.1f%%)", reclaimable_pages,
|
|
reclaimable_pages / percent);
|
|
}
|
|
|
|
value =
|
|
envinfo.mi_mapsize / envstat.ms_psize - lastpgno + reclaimable_pages;
|
|
print(", available %" PRIu64 " (%.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 (%" PRIu64 " != %" PRIu64 ")\n",
|
|
walk.pgcount, lastpgno - freedb_pages);
|
|
}
|
|
if (walk.dbi_pages[0] != freedb_pages) {
|
|
error("gc pages mismatch (%" PRIu64 " != %" PRIu64 ")\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(MAIN_DBI, NULL, handle_maindb, true)) {
|
|
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 (user_break) ? EXIT_INTERRUPTED : EXIT_FAILURE_SYS;
|
|
return EXIT_FAILURE_MDB;
|
|
}
|
|
|
|
#if defined(_WIN32) || defined(_WIN64)
|
|
timestamp_finish = GetTickCount64();
|
|
elapsed = (timestamp_finish - timestamp_start) * 1e-3;
|
|
#else
|
|
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;
|
|
#endif /* !WINDOWS */
|
|
|
|
total_problems += problems_meta;
|
|
if (total_problems || problems_maindb || problems_freedb) {
|
|
print("Total %" PRIu64 " 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;
|
|
}
|