mirror of
https://github.com/isar/libmdbx.git
synced 2025-10-20 10:48:56 +08:00
mdbx: добавление mdbx_enumerate_subdb()
.
This commit is contained in:
95
src/audit.c
95
src/audit.c
@@ -3,28 +3,24 @@
|
||||
|
||||
#include "internals.h"
|
||||
|
||||
__cold static tree_t *audit_db_dig(const MDBX_txn *txn, const size_t dbi,
|
||||
tree_t *fallback) {
|
||||
const MDBX_txn *dig = txn;
|
||||
do {
|
||||
tASSERT(txn, txn->n_dbi == dig->n_dbi);
|
||||
const uint8_t state = dbi_state(dig, dbi);
|
||||
if (state & DBI_LINDO)
|
||||
switch (state & (DBI_VALID | DBI_STALE | DBI_OLDEN)) {
|
||||
case DBI_VALID:
|
||||
case DBI_OLDEN:
|
||||
return dig->dbs + dbi;
|
||||
case 0:
|
||||
return nullptr;
|
||||
case DBI_VALID | DBI_STALE:
|
||||
case DBI_OLDEN | DBI_STALE:
|
||||
break;
|
||||
default:
|
||||
tASSERT(txn, !!"unexpected dig->dbi_state[dbi]");
|
||||
}
|
||||
dig = dig->parent;
|
||||
} while (dig);
|
||||
return fallback;
|
||||
struct audit_ctx {
|
||||
size_t used;
|
||||
uint8_t *const done_bitmap;
|
||||
};
|
||||
|
||||
static int audit_dbi(void *ctx, const MDBX_txn *txn, const MDBX_val *name,
|
||||
MDBX_db_flags_t flags, const struct MDBX_stat *stat,
|
||||
MDBX_dbi dbi) {
|
||||
struct audit_ctx *audit_ctx = ctx;
|
||||
(void)name;
|
||||
(void)txn;
|
||||
(void)flags;
|
||||
audit_ctx->used += (size_t)stat->ms_branch_pages +
|
||||
(size_t)stat->ms_leaf_pages +
|
||||
(size_t)stat->ms_overflow_pages;
|
||||
if (dbi)
|
||||
audit_ctx->done_bitmap[dbi / CHAR_BIT] |= 1 << dbi % CHAR_BIT;
|
||||
return MDBX_SUCCESS;
|
||||
}
|
||||
|
||||
static size_t audit_db_used(const tree_t *db) {
|
||||
@@ -71,8 +67,6 @@ __cold static int audit_ex_locked(MDBX_txn *txn, size_t retired_stored,
|
||||
tASSERT(txn, rc == MDBX_NOTFOUND);
|
||||
|
||||
const size_t done_bitmap_size = (txn->n_dbi + CHAR_BIT - 1) / CHAR_BIT;
|
||||
uint8_t *const done_bitmap = alloca(done_bitmap_size);
|
||||
memset(done_bitmap, 0, done_bitmap_size);
|
||||
if (txn->parent) {
|
||||
tASSERT(txn, txn->n_dbi == txn->parent->n_dbi &&
|
||||
txn->n_dbi == txn->env->txn->n_dbi);
|
||||
@@ -82,51 +76,20 @@ __cold static int audit_ex_locked(MDBX_txn *txn, size_t retired_stored,
|
||||
#endif /* MDBX_ENABLE_DBI_SPARSE */
|
||||
}
|
||||
|
||||
size_t used = NUM_METAS +
|
||||
audit_db_used(audit_db_dig(txn, FREE_DBI, nullptr)) +
|
||||
audit_db_used(audit_db_dig(txn, MAIN_DBI, nullptr));
|
||||
rc = cursor_init(&cx.outer, txn, MAIN_DBI);
|
||||
if (unlikely(rc != MDBX_SUCCESS))
|
||||
return rc;
|
||||
struct audit_ctx ctx = {0, alloca(done_bitmap_size)};
|
||||
memset(ctx.done_bitmap, 0, done_bitmap_size);
|
||||
ctx.used = NUM_METAS + audit_db_used(dbi_dig(txn, FREE_DBI, nullptr)) +
|
||||
audit_db_used(dbi_dig(txn, MAIN_DBI, nullptr));
|
||||
|
||||
rc = tree_search(&cx.outer, nullptr, Z_FIRST);
|
||||
while (rc == MDBX_SUCCESS) {
|
||||
page_t *mp = cx.outer.pg[cx.outer.top];
|
||||
for (size_t k = 0; k < page_numkeys(mp); k++) {
|
||||
node_t *node = page_node(mp, k);
|
||||
if (node_flags(node) != N_SUBDATA)
|
||||
continue;
|
||||
if (unlikely(node_ds(node) != sizeof(tree_t))) {
|
||||
ERROR("%s/%d: %s %u", "MDBX_CORRUPTED", MDBX_CORRUPTED,
|
||||
"invalid dupsort sub-tree node size", (unsigned)node_ds(node));
|
||||
return MDBX_CORRUPTED;
|
||||
}
|
||||
|
||||
tree_t reside;
|
||||
const tree_t *db = memcpy(&reside, node_data(node), sizeof(reside));
|
||||
const MDBX_val name = {node_key(node), node_ks(node)};
|
||||
for (size_t dbi = CORE_DBS; dbi < env->n_dbi; ++dbi) {
|
||||
if (dbi >= txn->n_dbi || !(env->dbs_flags[dbi] & DB_VALID))
|
||||
continue;
|
||||
if (env->kvs[MAIN_DBI].clc.k.cmp(&name, &env->kvs[dbi].name))
|
||||
continue;
|
||||
|
||||
done_bitmap[dbi / CHAR_BIT] |= 1 << dbi % CHAR_BIT;
|
||||
db = audit_db_dig(txn, dbi, &reside);
|
||||
break;
|
||||
}
|
||||
used += audit_db_used(db);
|
||||
}
|
||||
rc = cursor_sibling_right(&cx.outer);
|
||||
}
|
||||
tASSERT(txn, rc == MDBX_NOTFOUND);
|
||||
rc = mdbx_enumerate_subdb(txn, audit_dbi, &ctx);
|
||||
tASSERT(txn, rc == MDBX_SUCCESS);
|
||||
|
||||
for (size_t dbi = CORE_DBS; dbi < txn->n_dbi; ++dbi) {
|
||||
if (done_bitmap[dbi / CHAR_BIT] & (1 << dbi % CHAR_BIT))
|
||||
if (ctx.done_bitmap[dbi / CHAR_BIT] & (1 << dbi % CHAR_BIT))
|
||||
continue;
|
||||
const tree_t *db = audit_db_dig(txn, dbi, nullptr);
|
||||
const tree_t *db = dbi_dig(txn, dbi, nullptr);
|
||||
if (db)
|
||||
used += audit_db_used(db);
|
||||
ctx.used += audit_db_used(db);
|
||||
else if (dbi_state(txn, dbi))
|
||||
WARNING("audit %s@%" PRIaTXN
|
||||
": unable account dbi %zd / \"%*s\", state 0x%02x",
|
||||
@@ -135,7 +98,7 @@ __cold static int audit_ex_locked(MDBX_txn *txn, size_t retired_stored,
|
||||
(const char *)env->kvs[dbi].name.iov_base, dbi_state(txn, dbi));
|
||||
}
|
||||
|
||||
if (pending + gc + used == txn->geo.first_unallocated)
|
||||
if (pending + gc + ctx.used == txn->geo.first_unallocated)
|
||||
return MDBX_SUCCESS;
|
||||
|
||||
if ((txn->flags & MDBX_TXN_RDONLY) == 0)
|
||||
@@ -148,7 +111,7 @@ __cold static int audit_ex_locked(MDBX_txn *txn, size_t retired_stored,
|
||||
ERROR("audit @%" PRIaTXN ": %zu(pending) + %zu"
|
||||
"(gc) + %zu(count) = %zu(total) <> %zu"
|
||||
"(allocated)",
|
||||
txn->txnid, pending, gc, used, pending + gc + used,
|
||||
txn->txnid, pending, gc, ctx.used, pending + gc + ctx.used,
|
||||
(size_t)txn->geo.first_unallocated);
|
||||
return MDBX_PROBLEM;
|
||||
}
|
||||
|
Reference in New Issue
Block a user