mdbxmou 0.1.26

package/deps/libmdbx/src/layout-dxb.h

@@ -0,0 +1,288 @@
+/// \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
+
+#pragma once
+
+#include "essentials.h"
+
+#pragma pack(push, 4)
+
+/* A stamp that identifies a file as an MDBX file.
+ * There's nothing special about this value other than that it is easily
+ * recognizable, and it will reflect any byte order mismatches. */
+#define MDBX_MAGIC UINT64_C(/* 56-bit prime */ 0x59659DBDEF4C11)
+
+/* FROZEN: The version number for a database's datafile format. */
+#define MDBX_DATA_VERSION 3
+
+#define MDBX_DATA_MAGIC ((MDBX_MAGIC << 8) + MDBX_PNL_ASCENDING * 64 + MDBX_DATA_VERSION)
+#define MDBX_DATA_MAGIC_LEGACY_COMPAT ((MDBX_MAGIC << 8) + MDBX_PNL_ASCENDING * 64 + 2)
+#define MDBX_DATA_MAGIC_LEGACY_DEVEL ((MDBX_MAGIC << 8) + 255)
+
+/* handle for the DB used to track free pages. */
+#define FREE_DBI 0
+/* handle for the default DB. */
+#define MAIN_DBI 1
+/* Number of DBs in metapage (free and main) - also hardcoded elsewhere */
+#define CORE_DBS 2
+
+/* Number of meta pages - also hardcoded elsewhere */
+#define NUM_METAS 3
+
+/* A page number in the database.
+ *
+ * MDBX uses 32 bit for page numbers. This limits database
+ * size up to 2^44 bytes, in case of 4K pages. */
+typedef uint32_t pgno_t;
+typedef mdbx_atomic_uint32_t atomic_pgno_t;
+#define PRIaPGNO PRIu32
+#define MAX_PAGENO UINT32_C(0x7FFFffff)
+#define MIN_PAGENO NUM_METAS
+
+/* An invalid page number.
+ * Mainly used to denote an empty tree. */
+#define P_INVALID (~(pgno_t)0)
+
+/* A transaction ID. */
+typedef uint64_t txnid_t;
+typedef mdbx_atomic_uint64_t atomic_txnid_t;
+#define PRIaTXN PRIi64
+#define MIN_TXNID UINT64_C(1)
+#define MAX_TXNID (SAFE64_INVALID_THRESHOLD - 1)
+#define INITIAL_TXNID (MIN_TXNID + NUM_METAS - 1)
+#define INVALID_TXNID UINT64_MAX
+
+/* Used for offsets within a single page. */
+typedef uint16_t indx_t;
+
+typedef struct tree {
+  uint16_t flags;       /* see mdbx_dbi_open */
+  uint16_t height;      /* height of this tree */
+  uint32_t dupfix_size; /* key-size for MDBX_DUPFIXED (DUPFIX pages) */
+  pgno_t root;          /* the root page of this tree */
+  pgno_t branch_pages;  /* number of branch pages */
+  pgno_t leaf_pages;    /* number of leaf pages */
+  pgno_t large_pages;   /* number of large pages */
+  uint64_t sequence;    /* table sequence counter */
+  uint64_t items;       /* number of data items */
+  uint64_t mod_txnid;   /* txnid of last committed modification */
+} tree_t;
+
+/* database size-related parameters */
+typedef struct geo {
+  uint16_t grow_pv;   /* datafile growth step as a 16-bit packed (exponential
+                           quantized) value */
+  uint16_t shrink_pv; /* datafile shrink threshold as a 16-bit packed
+                           (exponential quantized) value */
+  pgno_t lower;       /* minimal size of datafile in pages */
+  pgno_t upper;       /* maximal size of datafile in pages */
+  union {
+    pgno_t now; /* current size of datafile in pages */
+    pgno_t end_pgno;
+  };
+  union {
+    pgno_t first_unallocated; /* first unused page in the datafile,
+                         but actually the file may be shorter. */
+    pgno_t next_pgno;
+  };
+} geo_t;
+
+/* Meta page content.
+ * A meta page is the start point for accessing a database snapshot.
+ * Pages 0-2 are meta pages. */
+typedef struct meta {
+  /* Stamp identifying this as an MDBX file.
+   * It must be set to MDBX_MAGIC with MDBX_DATA_VERSION. */
+  uint32_t magic_and_version[2];
+
+  /* txnid that committed this meta, the first of a two-phase-update pair */
+  union {
+    mdbx_atomic_uint32_t txnid_a[2];
+    uint64_t unsafe_txnid;
+  };
+
+  uint16_t reserve16;   /* extra flags, zero (nothing) for now */
+  uint8_t validator_id; /* ID of checksum and page validation method,
+                         * zero (nothing) for now */
+  int8_t extra_pagehdr; /* extra bytes in the page header,
+                         * zero (nothing) for now */
+
+  geo_t geometry; /* database size-related parameters */
+
+  union {
+    struct {
+      tree_t gc, main;
+    } trees;
+    __anonymous_struct_extension__ struct {
+      uint16_t gc_flags;
+      uint16_t gc_height;
+      uint32_t pagesize;
+    };
+  };
+
+  MDBX_canary canary;
+
+#define DATASIGN_NONE 0u
+#define DATASIGN_WEAK 1u
+#define SIGN_IS_STEADY(sign) ((sign) > DATASIGN_WEAK)
+  union {
+    uint32_t sign[2];
+    uint64_t unsafe_sign;
+  };
+
+  /* txnid that committed this meta, the second of a two-phase-update pair */
+  mdbx_atomic_uint32_t txnid_b[2];
+
+  /* Number of non-meta pages which were put in GC after COW. May be 0 in case
+   * DB was previously handled by libmdbx without corresponding feature.
+   * This value in couple with reader.snapshot_pages_retired allows fast
+   * estimation of "how much reader is restraining GC recycling". */
+  uint32_t pages_retired[2];
+
+  /* The analogue /proc/sys/kernel/random/boot_id or similar to determine
+   * whether the system was rebooted after the last use of the database files.
+   * If there was no reboot, but there is no need to rollback to the last
+   * steady sync point. Zeros mean that no relevant information is available
+   * from the system. */
+  bin128_t bootid;
+
+  /* GUID базы данных, начиная с v0.13.1 */
+  bin128_t dxbid;
+} meta_t;
+
+#pragma pack(1)
+
+typedef enum page_type {
+  P_BRANCH = 0x01u /* branch page */,
+  P_LEAF = 0x02u /* leaf page */,
+  P_LARGE = 0x04u /* large/overflow page */,
+  P_META = 0x08u /* meta page */,
+  P_LEGACY_DIRTY = 0x10u /* legacy P_DIRTY flag prior to v0.10 958fd5b9 */,
+  P_BAD = P_LEGACY_DIRTY /* explicit flag for invalid/bad page */,
+  P_DUPFIX = 0x20u /* for MDBX_DUPFIXED records */,
+  P_SUBP = 0x40u /* for MDBX_DUPSORT sub-pages */,
+  P_SPILLED = 0x2000u /* spilled in parent txn */,
+  P_LOOSE = 0x4000u /* page was dirtied then freed, can be reused */,
+  P_FROZEN = 0x8000u /* used for retire page with known status */,
+  P_ILL_BITS = (uint16_t)~(P_BRANCH | P_LEAF | P_DUPFIX | P_LARGE | P_SPILLED),
+
+  page_broken = 0,
+  page_large = P_LARGE,
+  page_branch = P_BRANCH,
+  page_leaf = P_LEAF,
+  page_dupfix_leaf = P_DUPFIX,
+  page_sub_leaf = P_SUBP | P_LEAF,
+  page_sub_dupfix_leaf = P_SUBP | P_DUPFIX,
+  page_sub_broken = P_SUBP,
+} page_type_t;
+
+/* Common header for all page types. The page type depends on flags.
+ *
+ * P_BRANCH and P_LEAF pages have unsorted 'node_t's at the end, with
+ * sorted entries[] entries referring to them. Exception: P_DUPFIX pages
+ * omit entries and pack sorted MDBX_DUPFIXED values after the page header.
+ *
+ * P_LARGE records occupy one or more contiguous pages where only the
+ * first has a page header. They hold the real data of N_BIG nodes.
+ *
+ * P_SUBP sub-pages are small leaf "pages" with duplicate data.
+ * A node with flag N_DUP but not N_TREE contains a sub-page.
+ * (Duplicate data can also go in tables, which use normal pages.)
+ *
+ * P_META pages contain meta_t, the start point of an MDBX snapshot.
+ *
+ * Each non-metapage up to meta_t.mm_last_pg is reachable exactly once
+ * in the snapshot: Either used by a database or listed in a GC record. */
+typedef struct page {
+  uint64_t txnid;        /* txnid which created page, maybe zero in legacy DB */
+  uint16_t dupfix_ksize; /* key size if this is a DUPFIX page */
+  uint16_t flags;
+  union {
+    uint32_t pages; /* number of overflow pages */
+    __anonymous_struct_extension__ struct {
+      indx_t lower; /* lower bound of free space */
+      indx_t upper; /* upper bound of free space */
+    };
+  };
+  pgno_t pgno; /* page number */
+
+#if FLEXIBLE_ARRAY_MEMBERS
+  indx_t entries[] /* dynamic size */;
+#endif /* FLEXIBLE_ARRAY_MEMBERS */
+} page_t;
+
+/* Size of the page header, excluding dynamic data at the end */
+#define PAGEHDRSZ 20u
+
+/* Header for a single key/data pair within a page.
+ * Used in pages of type P_BRANCH and P_LEAF without P_DUPFIX.
+ * We guarantee 2-byte alignment for 'node_t's.
+ *
+ * Leaf node flags describe node contents.  N_BIG says the node's
+ * data part is the page number of an overflow page with actual data.
+ * N_DUP and N_TREE can be combined giving duplicate data in
+ * a sub-page/table, and named databases (just N_TREE). */
+typedef struct node {
+#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+  union {
+    uint32_t dsize;
+    uint32_t child_pgno;
+  };
+  uint8_t flags; /* see node_flags */
+  uint8_t extra;
+  uint16_t ksize; /* key size */
+#else
+  uint16_t ksize; /* key size */
+  uint8_t extra;
+  uint8_t flags; /* see node_flags */
+  union {
+    uint32_t child_pgno;
+    uint32_t dsize;
+  };
+#endif /* __BYTE_ORDER__ */
+
+#if FLEXIBLE_ARRAY_MEMBERS
+  uint8_t payload[] /* key and data are appended here */;
+#endif /* FLEXIBLE_ARRAY_MEMBERS */
+} node_t;
+
+/* Size of the node header, excluding dynamic data at the end */
+#define NODESIZE 8u
+
+typedef enum node_flags {
+  N_BIG = 0x01 /* data put on large page */,
+  N_TREE = 0x02 /* data is a b-tree */,
+  N_DUP = 0x04 /* data has duplicates */
+} node_flags_t;
+
+#pragma pack(pop)
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline uint8_t page_type(const page_t *mp) { return mp->flags; }
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline uint8_t page_type_compat(const page_t *mp) {
+  /* Drop legacy P_DIRTY flag for sub-pages for compatilibity,
+   * for assertions only. */
+  return unlikely(mp->flags & P_SUBP) ? mp->flags & ~(P_SUBP | P_LEGACY_DIRTY) : mp->flags;
+}
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline bool is_leaf(const page_t *mp) {
+  return (mp->flags & P_LEAF) != 0;
+}
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline bool is_dupfix_leaf(const page_t *mp) {
+  return (mp->flags & P_DUPFIX) != 0;
+}
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline bool is_branch(const page_t *mp) {
+  return (mp->flags & P_BRANCH) != 0;
+}
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline bool is_largepage(const page_t *mp) {
+  return (mp->flags & P_LARGE) != 0;
+}
+
+MDBX_MAYBE_UNUSED MDBX_NOTHROW_PURE_FUNCTION static inline bool is_subpage(const page_t *mp) {
+  return (mp->flags & P_SUBP) != 0;
+}

package/deps/libmdbx/src/layout-lck.h

@@ -0,0 +1,289 @@
+/// \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
+
+#pragma once
+
+#include "essentials.h"
+
+/* The version number for a database's lockfile format. */
+#define MDBX_LOCK_VERSION 6
+
+#if MDBX_LOCKING == MDBX_LOCKING_WIN32FILES
+
+#define MDBX_LCK_SIGN UINT32_C(0xF10C)
+typedef void osal_ipclock_t;
+#elif MDBX_LOCKING == MDBX_LOCKING_SYSV
+
+#define MDBX_LCK_SIGN UINT32_C(0xF18D)
+typedef mdbx_pid_t osal_ipclock_t;
+
+#elif MDBX_LOCKING == MDBX_LOCKING_POSIX2001 || MDBX_LOCKING == MDBX_LOCKING_POSIX2008
+
+#define MDBX_LCK_SIGN UINT32_C(0x8017)
+typedef pthread_mutex_t osal_ipclock_t;
+
+#elif MDBX_LOCKING == MDBX_LOCKING_POSIX1988
+
+#define MDBX_LCK_SIGN UINT32_C(0xFC29)
+typedef sem_t osal_ipclock_t;
+
+#else
+#error "FIXME"
+#endif /* MDBX_LOCKING */
+
+/* Статистика профилирования работы GC */
+typedef struct gc_prof_stat {
+  /* Монотонное время по "настенным часам"
+   * затраченное на чтение и поиск внутри GC */
+  uint64_t rtime_monotonic;
+  /* Процессорное время в режим пользователя
+   * на подготовку страниц извлекаемых из GC, включая подкачку с диска. */
+  uint64_t xtime_cpu;
+  /* Количество итераций чтения-поиска внутри GC при выделении страниц */
+  uint32_t rsteps;
+  /* Количество запросов на выделение последовательностей страниц,
+   * т.е. когда запрашивает выделение больше одной страницы */
+  uint32_t xpages;
+  /* Счетчик выполнения по медленному пути (slow path execution count) */
+  uint32_t spe_counter;
+  /* page faults (hard page faults) */
+  uint32_t majflt;
+  /* Для разборок с pnl_merge() */
+  struct {
+    uint64_t time;
+    uint64_t volume;
+    uint32_t calls;
+  } pnl_merge;
+} gc_prof_stat_t;
+
+/* Statistics of pages operations for all transactions,
+ * including incomplete and aborted. */
+typedef struct pgops {
+  mdbx_atomic_uint64_t newly;   /* Quantity of a new pages added */
+  mdbx_atomic_uint64_t cow;     /* Quantity of pages copied for update */
+  mdbx_atomic_uint64_t clone;   /* Quantity of parent's dirty pages clones
+                                   for nested transactions */
+  mdbx_atomic_uint64_t split;   /* Page splits */
+  mdbx_atomic_uint64_t merge;   /* Page merges */
+  mdbx_atomic_uint64_t spill;   /* Quantity of spilled dirty pages */
+  mdbx_atomic_uint64_t unspill; /* Quantity of unspilled/reloaded pages */
+  mdbx_atomic_uint64_t wops;    /* Number of explicit write operations (not a pages) to a disk */
+  mdbx_atomic_uint64_t msync;   /* Number of explicit msync/flush-to-disk operations */
+  mdbx_atomic_uint64_t fsync;   /* Number of explicit fsync/flush-to-disk operations */
+
+  mdbx_atomic_uint64_t prefault; /* Number of prefault write operations */
+  mdbx_atomic_uint64_t mincore;  /* Number of mincore() calls */
+
+  mdbx_atomic_uint32_t incoherence; /* number of https://libmdbx.dqdkfa.ru/dead-github/issues/269
+                                       caught */
+  mdbx_atomic_uint32_t reserved;
+
+  /* Статистика для профилирования GC.
+   * Логически эти данные, возможно, стоит вынести в другую структуру,
+   * но разница будет сугубо косметическая. */
+  struct {
+    /* Затраты на поддержку данных пользователя */
+    gc_prof_stat_t work;
+    /* Затраты на поддержку и обновления самой GC */
+    gc_prof_stat_t self;
+    /* Итераций обновления GC,
+     * больше 1 если были повторы/перезапуски */
+    uint32_t wloops;
+    /* Итерации слияния записей GC */
+    uint32_t coalescences;
+    /* Уничтожения steady-точек фиксации в MDBX_UTTERLY_NOSYNC */
+    uint32_t wipes;
+    /* Сбросы данные на диск вне MDBX_UTTERLY_NOSYNC */
+    uint32_t flushes;
+    /* Попытки пнуть тормозящих читателей */
+    uint32_t kicks;
+  } gc_prof;
+} pgop_stat_t;
+
+/* Reader Lock Table
+ *
+ * Readers don't acquire any locks for their data access. Instead, they
+ * simply record their transaction ID in the reader table. The reader
+ * mutex is needed just to find an empty slot in the reader table. The
+ * slot's address is saved in thread-specific data so that subsequent
+ * read transactions started by the same thread need no further locking to
+ * proceed.
+ *
+ * If MDBX_NOSTICKYTHREADS is set, the slot address is not saved in
+ * thread-specific data. No reader table is used if the database is on a
+ * read-only filesystem.
+ *
+ * Since the database uses multi-version concurrency control, readers don't
+ * actually need any locking. This table is used to keep track of which
+ * readers are using data from which old transactions, so that we'll know
+ * when a particular old transaction is no longer in use. Old transactions
+ * that have discarded any data pages can then have those pages reclaimed
+ * for use by a later write transaction.
+ *
+ * The lock table is constructed such that reader slots are aligned with the
+ * processor's cache line size. Any slot is only ever used by one thread.
+ * This alignment guarantees that there will be no contention or cache
+ * thrashing as threads update their own slot info, and also eliminates
+ * any need for locking when accessing a slot.
+ *
+ * A writer thread will scan every slot in the table to determine the oldest
+ * outstanding reader transaction. Any freed pages older than this will be
+ * reclaimed by the writer. The writer doesn't use any locks when scanning
+ * this table. This means that there's no guarantee that the writer will
+ * see the most up-to-date reader info, but that's not required for correct
+ * operation - all we need is to know the upper bound on the oldest reader,
+ * we don't care at all about the newest reader. So the only consequence of
+ * reading stale information here is that old pages might hang around a
+ * while longer before being reclaimed. That's actually good anyway, because
+ * the longer we delay reclaiming old pages, the more likely it is that a
+ * string of contiguous pages can be found after coalescing old pages from
+ * many old transactions together. */
+
+/* The actual reader record, with cacheline padding. */
+typedef struct reader_slot {
+  /* Current Transaction ID when this transaction began, or INVALID_TXNID.
+   * Multiple readers that start at the same time will probably have the
+   * same ID here. Again, it's not important to exclude them from
+   * anything; all we need to know is which version of the DB they
+   * started from so we can avoid overwriting any data used in that
+   * particular version. */
+  atomic_txnid_t txnid;
+
+  /* The information we store in a single slot of the reader table.
+   * In addition to a transaction ID, we also record the process and
+   * thread ID that owns a slot, so that we can detect stale information,
+   * e.g. threads or processes that went away without cleaning up.
+   *
+   * NOTE: We currently don't check for stale records.
+   * We simply re-init the table when we know that we're the only process
+   * opening the lock file. */
+
+  /* Псевдо thread_id для пометки вытесненных читающих транзакций. */
+#define MDBX_TID_TXN_OUSTED (UINT64_MAX - 1)
+
+  /* Псевдо thread_id для пометки припаркованных читающих транзакций. */
+#define MDBX_TID_TXN_PARKED UINT64_MAX
+
+  /* The thread ID of the thread owning this txn. */
+  mdbx_atomic_uint64_t tid;
+
+  /* The process ID of the process owning this reader txn. */
+  mdbx_atomic_uint32_t pid;
+
+  /* The number of pages used in the reader's MVCC snapshot,
+   * i.e. the value of meta->geometry.first_unallocated and
+   * txn->geo.first_unallocated */
+  atomic_pgno_t snapshot_pages_used;
+  /* Number of retired pages at the time this reader starts transaction. So,
+   * at any time the difference meta.pages_retired -
+   * reader.snapshot_pages_retired will give the number of pages which this
+   * reader restraining from reuse. */
+  mdbx_atomic_uint64_t snapshot_pages_retired;
+} reader_slot_t;
+
+/* The header for the reader table (a memory-mapped lock file). */
+typedef struct shared_lck {
+  /* Stamp identifying this as an MDBX file.
+   * It must be set to MDBX_MAGIC with with MDBX_LOCK_VERSION. */
+  uint64_t magic_and_version;
+
+  /* Format of this lock file. Must be set to MDBX_LOCK_FORMAT. */
+  uint32_t os_and_format;
+
+  /* Flags which environment was opened. */
+  mdbx_atomic_uint32_t envmode;
+
+  /* Threshold of un-synced-with-disk pages for auto-sync feature,
+   * zero means no-threshold, i.e. auto-sync is disabled. */
+  atomic_pgno_t autosync_threshold;
+
+  /* Low 32-bit of txnid with which meta-pages was synced,
+   * i.e. for sync-polling in the MDBX_NOMETASYNC mode. */
+#define MDBX_NOMETASYNC_LAZY_UNK (UINT32_MAX / 3)
+#define MDBX_NOMETASYNC_LAZY_FD (MDBX_NOMETASYNC_LAZY_UNK + UINT32_MAX / 8)
+#define MDBX_NOMETASYNC_LAZY_WRITEMAP (MDBX_NOMETASYNC_LAZY_UNK - UINT32_MAX / 8)
+  mdbx_atomic_uint32_t meta_sync_txnid;
+
+  /* Period for timed auto-sync feature, i.e. at the every steady checkpoint
+   * the mti_unsynced_timeout sets to the current_time + autosync_period.
+   * The time value is represented in a suitable system-dependent form, for
+   * example clock_gettime(CLOCK_BOOTTIME) or clock_gettime(CLOCK_MONOTONIC).
+   * Zero means timed auto-sync is disabled. */
+  mdbx_atomic_uint64_t autosync_period;
+
+  /* Marker to distinguish uniqueness of DB/CLK. */
+  mdbx_atomic_uint64_t bait_uniqueness;
+
+  /* Paired counter of processes that have mlock()ed part of mmapped DB.
+   * The (mlcnt[0] - mlcnt[1]) > 0 means at least one process
+   * lock at least one page, so therefore madvise() could return EINVAL. */
+  mdbx_atomic_uint32_t mlcnt[2];
+
+  MDBX_ALIGNAS(MDBX_CACHELINE_SIZE) /* cacheline ----------------------------*/
+
+  /* Statistics of costly ops of all (running, completed and aborted)
+   * transactions */
+  pgop_stat_t pgops;
+
+  MDBX_ALIGNAS(MDBX_CACHELINE_SIZE) /* cacheline ----------------------------*/
+
+#if MDBX_LOCKING > 0
+  /* Write transaction lock. */
+  osal_ipclock_t wrt_lock;
+#endif /* MDBX_LOCKING > 0 */
+
+  atomic_txnid_t cached_oldest;
+
+  /* Timestamp of entering an out-of-sync state. Value is represented in a
+   * suitable system-dependent form, for example clock_gettime(CLOCK_BOOTTIME)
+   * or clock_gettime(CLOCK_MONOTONIC). */
+  mdbx_atomic_uint64_t eoos_timestamp;
+
+  /* Number un-synced-with-disk pages for auto-sync feature. */
+  mdbx_atomic_uint64_t unsynced_pages;
+
+  /* Timestamp of the last readers check. */
+  mdbx_atomic_uint64_t readers_check_timestamp;
+
+  /* Number of page which was discarded last time by madvise(DONTNEED). */
+  atomic_pgno_t discarded_tail;
+
+  /* Shared anchor for tracking readahead edge and enabled/disabled status. */
+  pgno_t readahead_anchor;
+
+  /* Shared cache for mincore() results */
+  struct {
+    pgno_t begin[4];
+    uint64_t mask[4];
+  } mincore_cache;
+
+  MDBX_ALIGNAS(MDBX_CACHELINE_SIZE) /* cacheline ----------------------------*/
+
+#if MDBX_LOCKING > 0
+  /* Readeaders table lock. */
+  osal_ipclock_t rdt_lock;
+#endif /* MDBX_LOCKING > 0 */
+
+  /* The number of slots that have been used in the reader table.
+   * This always records the maximum count, it is not decremented
+   * when readers release their slots. */
+  mdbx_atomic_uint32_t rdt_length;
+  mdbx_atomic_uint32_t rdt_refresh_flag;
+
+#if FLEXIBLE_ARRAY_MEMBERS
+  MDBX_ALIGNAS(MDBX_CACHELINE_SIZE) /* cacheline ----------------------------*/
+  reader_slot_t rdt[] /* dynamic size */;
+
+/* Lockfile format signature: version, features and field layout */
+#define MDBX_LOCK_FORMAT                                                                                               \
+  (MDBX_LCK_SIGN * 27733 + (unsigned)sizeof(reader_slot_t) * 13 +                                                      \
+   (unsigned)offsetof(reader_slot_t, snapshot_pages_used) * 251 + (unsigned)offsetof(lck_t, cached_oldest) * 83 +      \
+   (unsigned)offsetof(lck_t, rdt_length) * 37 + (unsigned)offsetof(lck_t, rdt) * 29)
+#endif /* FLEXIBLE_ARRAY_MEMBERS */
+} lck_t;
+
+#define MDBX_LOCK_MAGIC ((MDBX_MAGIC << 8) + MDBX_LOCK_VERSION)
+
+#define MDBX_READERS_LIMIT 32767