mdbxmou 0.1.26

package/deps/libmdbx/src/tree-search.c

@@ -0,0 +1,140 @@
+/// \copyright SPDX-License-Identifier: Apache-2.0
+/// \note Please refer to the COPYRIGHT file for explanations license change,
+/// credits and acknowledgments.
+/// \author Леонид Юрьев aka Leonid Yuriev <leo@yuriev.ru> \date 2015-2025
+
+#include "internals.h"
+
+/* Search for the lowest key under the current branch page.
+ * This just bypasses a numkeys check in the current page
+ * before calling tree_search_finalize(), because the callers
+ * are all in situations where the current page is known to
+ * be underfilled. */
+__hot int tree_search_lowest(MDBX_cursor *mc) {
+  cASSERT(mc, mc->top >= 0);
+  page_t *mp = mc->pg[mc->top];
+  cASSERT(mc, is_branch(mp));
+
+  node_t *node = page_node(mp, 0);
+  int err = page_get(mc, node_pgno(node), &mp, mp->txnid);
+  if (unlikely(err != MDBX_SUCCESS))
+    return err;
+
+  mc->ki[mc->top] = 0;
+  err = cursor_push(mc, mp, 0);
+  if (unlikely(err != MDBX_SUCCESS))
+    return err;
+  return tree_search_finalize(mc, nullptr, Z_FIRST);
+}
+
+__hot int tree_search(MDBX_cursor *mc, const MDBX_val *key, int flags) {
+  int err;
+  if (unlikely(mc->txn->flags & MDBX_TXN_BLOCKED)) {
+    DEBUG("%s", "transaction has failed, must abort");
+    err = MDBX_BAD_TXN;
+  bailout:
+    be_poor(mc);
+    return err;
+  }
+
+  const size_t dbi = cursor_dbi(mc);
+  if (unlikely(*cursor_dbi_state(mc) & DBI_STALE)) {
+    err = tbl_fetch(mc->txn, dbi);
+    if (unlikely(err != MDBX_SUCCESS))
+      goto bailout;
+  }
+
+  const pgno_t root = mc->tree->root;
+  if (unlikely(root == P_INVALID)) {
+    DEBUG("%s", "tree is empty");
+    cASSERT(mc, is_poor(mc));
+    return MDBX_NOTFOUND;
+  }
+
+  cASSERT(mc, root >= NUM_METAS && root < mc->txn->geo.first_unallocated);
+  if (mc->top < 0 || mc->pg[0]->pgno != root) {
+    txnid_t pp_txnid = mc->tree->mod_txnid;
+    pp_txnid = /* tree->mod_txnid maybe zero in a legacy DB */ pp_txnid ? pp_txnid : mc->txn->txnid;
+    if ((mc->txn->flags & MDBX_TXN_RDONLY) == 0) {
+      MDBX_txn *scan = mc->txn;
+      do
+        if ((scan->flags & MDBX_TXN_DIRTY) && (dbi == MAIN_DBI || (scan->dbi_state[dbi] & DBI_DIRTY))) {
+          /* После коммита вложенных тразакций может быть mod_txnid > front */
+          pp_txnid = scan->front_txnid;
+          break;
+        }
+      while (unlikely((scan = scan->parent) != nullptr));
+    }
+    err = page_get(mc, root, &mc->pg[0], pp_txnid);
+    if (unlikely(err != MDBX_SUCCESS))
+      goto bailout;
+  }
+
+  mc->top = 0;
+  mc->ki[0] = (flags & Z_LAST) ? page_numkeys(mc->pg[0]) - 1 : 0;
+  DEBUG("db %d root page %" PRIaPGNO " has flags 0x%X", cursor_dbi_dbg(mc), root, mc->pg[0]->flags);
+
+  if (flags & Z_MODIFY) {
+    err = page_touch(mc);
+    if (unlikely(err != MDBX_SUCCESS))
+      goto bailout;
+  }
+
+  if (flags & Z_ROOTONLY)
+    return MDBX_SUCCESS;
+
+  return tree_search_finalize(mc, key, flags);
+}
+
+__hot __noinline int tree_search_finalize(MDBX_cursor *mc, const MDBX_val *key, int flags) {
+  cASSERT(mc, !is_poor(mc));
+  DKBUF_DEBUG;
+  int err;
+  page_t *mp = mc->pg[mc->top];
+  intptr_t ki = (flags & Z_FIRST) ? 0 : page_numkeys(mp) - 1;
+  while (is_branch(mp)) {
+    DEBUG("branch page %" PRIaPGNO " has %zu keys", mp->pgno, page_numkeys(mp));
+    cASSERT(mc, page_numkeys(mp) > 1);
+    DEBUG("found index 0 to page %" PRIaPGNO, node_pgno(page_node(mp, 0)));
+
+    if ((flags & (Z_FIRST | Z_LAST)) == 0) {
+      const struct node_search_result nsr = node_search(mc, key);
+      if (likely(nsr.node))
+        ki = mc->ki[mc->top] + (intptr_t)nsr.exact - 1;
+      DEBUG("following index %zu for key [%s]", ki, DKEY_DEBUG(key));
+    }
+
+    err = page_get(mc, node_pgno(page_node(mp, ki)), &mp, mp->txnid);
+    if (unlikely(err != MDBX_SUCCESS))
+      goto bailout;
+
+    mc->ki[mc->top] = (indx_t)ki;
+    ki = (flags & Z_FIRST) ? 0 : page_numkeys(mp) - 1;
+    err = cursor_push(mc, mp, ki);
+    if (unlikely(err != MDBX_SUCCESS))
+      goto bailout;
+
+    if (flags & Z_MODIFY) {
+      err = page_touch(mc);
+      if (unlikely(err != MDBX_SUCCESS))
+        goto bailout;
+      mp = mc->pg[mc->top];
+    }
+  }
+
+  if (!MDBX_DISABLE_VALIDATION && unlikely(!check_leaf_type(mc, mp))) {
+    ERROR("unexpected leaf-page #%" PRIaPGNO " type 0x%x seen by cursor", mp->pgno, mp->flags);
+    err = MDBX_CORRUPTED;
+  bailout:
+    be_poor(mc);
+    return err;
+  }
+
+  DEBUG("found leaf page %" PRIaPGNO " for key [%s]", mp->pgno, DKEY_DEBUG(key));
+  /* Логически верно, но (в текущем понимании) нет необходимости.
+     Однако, стоит ещё по-проверять/по-тестировать.
+     Возможно есть сценарий, в котором очистка флагов всё-таки требуется.
+
+     be_filled(mc); */
+  return MDBX_SUCCESS;
+}

package/deps/libmdbx/src/txl.c

@@ -0,0 +1,99 @@
+/// \copyright SPDX-License-Identifier: Apache-2.0
+/// \author Леонид Юрьев aka Leonid Yuriev <leo@yuriev.ru> \date 2015-2025
+
+#include "internals.h"
+
+static inline size_t txl_size2bytes(const size_t size) {
+  assert(size > 0 && size <= txl_max * 2);
+  size_t bytes =
+      ceil_powerof2(MDBX_ASSUME_MALLOC_OVERHEAD + sizeof(txnid_t) * (size + 2), txl_granulate * sizeof(txnid_t)) -
+      MDBX_ASSUME_MALLOC_OVERHEAD;
+  return bytes;
+}
+
+static inline size_t txl_bytes2size(const size_t bytes) {
+  size_t size = bytes / sizeof(txnid_t);
+  assert(size > 2 && size <= txl_max * 2);
+  return size - 2;
+}
+
+txl_t txl_alloc(void) {
+  size_t bytes = txl_size2bytes(txl_initial);
+  txl_t txl = osal_malloc(bytes);
+  if (likely(txl)) {
+#ifdef osal_malloc_usable_size
+    bytes = osal_malloc_usable_size(txl);
+#endif /* osal_malloc_usable_size */
+    txl[0] = txl_bytes2size(bytes);
+    assert(txl[0] >= txl_initial);
+    txl += 1;
+    *txl = 0;
+  }
+  return txl;
+}
+
+void txl_free(txl_t txl) {
+  if (likely(txl))
+    osal_free(txl - 1);
+}
+
+static int txl_reserve(txl_t __restrict *__restrict ptxl, const size_t wanna) {
+  const size_t allocated = (size_t)MDBX_PNL_ALLOCLEN(*ptxl);
+  assert(MDBX_PNL_GETSIZE(*ptxl) <= txl_max && MDBX_PNL_ALLOCLEN(*ptxl) >= MDBX_PNL_GETSIZE(*ptxl));
+  if (likely(allocated >= wanna))
+    return MDBX_SUCCESS;
+
+  if (unlikely(wanna > /* paranoia */ txl_max)) {
+    ERROR("TXL too long (%zu > %zu)", wanna, (size_t)txl_max);
+    return MDBX_TXN_FULL;
+  }
+
+  const size_t size = (wanna + wanna - allocated < txl_max) ? wanna + wanna - allocated : txl_max;
+  size_t bytes = txl_size2bytes(size);
+  txl_t txl = osal_realloc(*ptxl - 1, bytes);
+  if (likely(txl)) {
+#ifdef osal_malloc_usable_size
+    bytes = osal_malloc_usable_size(txl);
+#endif /* osal_malloc_usable_size */
+    *txl = txl_bytes2size(bytes);
+    assert(*txl >= wanna);
+    *ptxl = txl + 1;
+    return MDBX_SUCCESS;
+  }
+  return MDBX_ENOMEM;
+}
+
+static __always_inline int __must_check_result txl_need(txl_t __restrict *__restrict ptxl, size_t num) {
+  assert(MDBX_PNL_GETSIZE(*ptxl) <= txl_max && MDBX_PNL_ALLOCLEN(*ptxl) >= MDBX_PNL_GETSIZE(*ptxl));
+  assert(num <= PAGELIST_LIMIT);
+  const size_t wanna = (size_t)MDBX_PNL_GETSIZE(*ptxl) + num;
+  return likely(MDBX_PNL_ALLOCLEN(*ptxl) >= wanna) ? MDBX_SUCCESS : txl_reserve(ptxl, wanna);
+}
+
+static __always_inline void txl_xappend(txl_t __restrict txl, txnid_t id) {
+  assert(MDBX_PNL_GETSIZE(txl) < MDBX_PNL_ALLOCLEN(txl));
+  txl[0] += 1;
+  MDBX_PNL_LAST(txl) = id;
+}
+
+#define TXNID_SORT_CMP(first, last) ((first) > (last))
+SORT_IMPL(txnid_sort, false, txnid_t, TXNID_SORT_CMP)
+void txl_sort(txl_t txl) { txnid_sort(MDBX_PNL_BEGIN(txl), MDBX_PNL_END(txl)); }
+
+int __must_check_result txl_append(txl_t __restrict *ptxl, txnid_t id) {
+  if (unlikely(MDBX_PNL_GETSIZE(*ptxl) == MDBX_PNL_ALLOCLEN(*ptxl))) {
+    int rc = txl_need(ptxl, txl_granulate);
+    if (unlikely(rc != MDBX_SUCCESS))
+      return rc;
+  }
+  txl_xappend(*ptxl, id);
+  return MDBX_SUCCESS;
+}
+
+__hot bool txl_contain(const txl_t txl, txnid_t id) {
+  const size_t len = MDBX_PNL_GETSIZE(txl);
+  for (size_t i = 1; i <= len; ++i)
+    if (txl[i] == id)
+      return true;
+  return false;
+}

package/deps/libmdbx/src/txl.h

@@ -0,0 +1,26 @@
+/// \copyright SPDX-License-Identifier: Apache-2.0
+/// \author Леонид Юрьев aka Leonid Yuriev <leo@yuriev.ru> \date 2015-2025
+
+#pragma once
+
+#include "essentials.h"
+
+/* List of txnid */
+typedef txnid_t *txl_t;
+typedef const txnid_t *const_txl_t;
+
+enum txl_rules {
+  txl_granulate = 32,
+  txl_initial = txl_granulate - 2 - MDBX_ASSUME_MALLOC_OVERHEAD / sizeof(txnid_t),
+  txl_max = (1u << 26) - 2 - MDBX_ASSUME_MALLOC_OVERHEAD / sizeof(txnid_t)
+};
+
+MDBX_INTERNAL txl_t txl_alloc(void);
+
+MDBX_INTERNAL void txl_free(txl_t txl);
+
+MDBX_INTERNAL int __must_check_result txl_append(txl_t __restrict *ptxl, txnid_t id);
+
+MDBX_INTERNAL void txl_sort(txl_t txl);
+
+MDBX_INTERNAL bool txl_contain(const txl_t txl, txnid_t id);