2 * @brief Lightning memory-mapped database library
4 * A Btree-based database management library modeled loosely on the
5 * BerkeleyDB API, but much simplified.
8 * Copyright 2011-2016 Howard Chu, Symas Corp.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted only as authorized by the OpenLDAP
15 * A copy of this license is available in the file LICENSE in the
16 * top-level directory of the distribution or, alternatively, at
17 * <http://www.OpenLDAP.org/license.html>.
19 * This code is derived from btree.c written by Martin Hedenfalk.
21 * Copyright (c) 2009, 2010 Martin Hedenfalk <martin@bzero.se>
23 * Permission to use, copy, modify, and distribute this software for any
24 * purpose with or without fee is hereby granted, provided that the above
25 * copyright notice and this permission notice appear in all copies.
27 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
28 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
29 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
30 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
31 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
32 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
33 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
41 /** getpid() returns int; MinGW defines pid_t but MinGW64 typedefs it
42 * as int64 which is wrong. MSVC doesn't define it at all, so just
46 #define MDB_THR_T DWORD
47 #include <sys/types.h>
50 # include <sys/param.h>
52 # define LITTLE_ENDIAN 1234
53 # define BIG_ENDIAN 4321
54 # define BYTE_ORDER LITTLE_ENDIAN
56 # define SSIZE_MAX INT_MAX
60 #include <sys/types.h>
62 #define MDB_PID_T pid_t
63 #define MDB_THR_T pthread_t
64 #include <sys/param.h>
67 #ifdef HAVE_SYS_FILE_H
73 #if defined(__mips) && defined(__linux)
74 /* MIPS has cache coherency issues, requires explicit cache control */
75 #include <asm/cachectl.h>
76 extern int cacheflush(char *addr, int nbytes, int cache);
77 #define CACHEFLUSH(addr, bytes, cache) cacheflush(addr, bytes, cache)
79 #define CACHEFLUSH(addr, bytes, cache)
82 #if defined(__linux) && !defined(MDB_FDATASYNC_WORKS)
83 /** fdatasync is broken on ext3/ext4fs on older kernels, see
84 * description in #mdb_env_open2 comments. You can safely
85 * define MDB_FDATASYNC_WORKS if this code will only be run
86 * on kernels 3.6 and newer.
88 #define BROKEN_FDATASYNC
102 typedef SSIZE_T ssize_t;
107 #if defined(__sun) || defined(ANDROID)
108 /* Most platforms have posix_memalign, older may only have memalign */
109 #define HAVE_MEMALIGN 1
113 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
114 #include <netinet/in.h>
115 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
118 #if defined(__APPLE__) || defined (BSD)
119 # define MDB_USE_POSIX_SEM 1
120 # define MDB_FDATASYNC fsync
121 #elif defined(ANDROID)
122 # define MDB_FDATASYNC fsync
127 #ifdef MDB_USE_POSIX_SEM
128 # define MDB_USE_HASH 1
129 #include <semaphore.h>
131 #define MDB_USE_POSIX_MUTEX 1
135 #if defined(_WIN32) + defined(MDB_USE_POSIX_SEM) \
136 + defined(MDB_USE_POSIX_MUTEX) != 1
137 # error "Ambiguous shared-lock implementation"
141 #include <valgrind/memcheck.h>
142 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
143 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
144 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
145 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
146 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
148 #define VGMEMP_CREATE(h,r,z)
149 #define VGMEMP_ALLOC(h,a,s)
150 #define VGMEMP_FREE(h,a)
151 #define VGMEMP_DESTROY(h)
152 #define VGMEMP_DEFINED(a,s)
156 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
157 /* Solaris just defines one or the other */
158 # define LITTLE_ENDIAN 1234
159 # define BIG_ENDIAN 4321
160 # ifdef _LITTLE_ENDIAN
161 # define BYTE_ORDER LITTLE_ENDIAN
163 # define BYTE_ORDER BIG_ENDIAN
166 # define BYTE_ORDER __BYTE_ORDER
170 #ifndef LITTLE_ENDIAN
171 #define LITTLE_ENDIAN __LITTLE_ENDIAN
174 #define BIG_ENDIAN __BIG_ENDIAN
177 #if defined(__i386) || defined(__x86_64) || defined(_M_IX86)
178 #define MISALIGNED_OK 1
184 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
185 # error "Unknown or unsupported endianness (BYTE_ORDER)"
186 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
187 # error "Two's complement, reasonably sized integer types, please"
191 /** Put infrequently used env functions in separate section */
193 # define ESECT __attribute__ ((section("__TEXT,text_env")))
195 # define ESECT __attribute__ ((section("text_env")))
202 #define CALL_CONV WINAPI
207 /** @defgroup internal LMDB Internals
210 /** @defgroup compat Compatibility Macros
211 * A bunch of macros to minimize the amount of platform-specific ifdefs
212 * needed throughout the rest of the code. When the features this library
213 * needs are similar enough to POSIX to be hidden in a one-or-two line
214 * replacement, this macro approach is used.
218 /** Features under development */
223 /** Wrapper around __func__, which is a C99 feature */
224 #if __STDC_VERSION__ >= 199901L
225 # define mdb_func_ __func__
226 #elif __GNUC__ >= 2 || _MSC_VER >= 1300
227 # define mdb_func_ __FUNCTION__
229 /* If a debug message says <mdb_unknown>(), update the #if statements above */
230 # define mdb_func_ "<mdb_unknown>"
233 /* Internal error codes, not exposed outside liblmdb */
234 #define MDB_NO_ROOT (MDB_LAST_ERRCODE + 10)
236 #define MDB_OWNERDEAD ((int) WAIT_ABANDONED)
237 #elif defined(MDB_USE_POSIX_MUTEX) && defined(EOWNERDEAD)
238 #define MDB_OWNERDEAD EOWNERDEAD /**< #LOCK_MUTEX0() result if dead owner */
242 #define GLIBC_VER ((__GLIBC__ << 16 )| __GLIBC_MINOR__)
244 /** Some platforms define the EOWNERDEAD error code
245 * even though they don't support Robust Mutexes.
246 * Compile with -DMDB_USE_ROBUST=0, or use some other
247 * mechanism like -DMDB_USE_SYSV_SEM instead of
248 * -DMDB_USE_POSIX_MUTEX. (SysV semaphores are
249 * also Robust, but some systems don't support them
252 #ifndef MDB_USE_ROBUST
253 /* Android currently lacks Robust Mutex support. So does glibc < 2.4. */
254 # if defined(MDB_USE_POSIX_MUTEX) && (defined(ANDROID) || \
255 (defined(__GLIBC__) && GLIBC_VER < 0x020004))
256 # define MDB_USE_ROBUST 0
258 # define MDB_USE_ROBUST 1
259 /* glibc < 2.12 only provided _np API */
260 # if defined(__GLIBC__) && GLIBC_VER < 0x02000c
261 # define PTHREAD_MUTEX_ROBUST PTHREAD_MUTEX_ROBUST_NP
262 # define pthread_mutexattr_setrobust(attr, flag) pthread_mutexattr_setrobust_np(attr, flag)
263 # define pthread_mutex_consistent(mutex) pthread_mutex_consistent_np(mutex)
266 #endif /* MDB_USE_ROBUST */
268 #if defined(MDB_OWNERDEAD) && MDB_USE_ROBUST
269 #define MDB_ROBUST_SUPPORTED 1
273 #define MDB_USE_HASH 1
274 #define MDB_PIDLOCK 0
275 #define THREAD_RET DWORD
276 #define pthread_t HANDLE
277 #define pthread_mutex_t HANDLE
278 #define pthread_cond_t HANDLE
279 typedef HANDLE mdb_mutex_t, mdb_mutexref_t;
280 #define pthread_key_t DWORD
281 #define pthread_self() GetCurrentThreadId()
282 #define pthread_key_create(x,y) \
283 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
284 #define pthread_key_delete(x) TlsFree(x)
285 #define pthread_getspecific(x) TlsGetValue(x)
286 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
287 #define pthread_mutex_unlock(x) ReleaseMutex(*x)
288 #define pthread_mutex_lock(x) WaitForSingleObject(*x, INFINITE)
289 #define pthread_cond_signal(x) SetEvent(*x)
290 #define pthread_cond_wait(cond,mutex) do{SignalObjectAndWait(*mutex, *cond, INFINITE, FALSE); WaitForSingleObject(*mutex, INFINITE);}while(0)
291 #define THREAD_CREATE(thr,start,arg) thr=CreateThread(NULL,0,start,arg,0,NULL)
292 #define THREAD_FINISH(thr) WaitForSingleObject(thr, INFINITE)
293 #define LOCK_MUTEX0(mutex) WaitForSingleObject(mutex, INFINITE)
294 #define UNLOCK_MUTEX(mutex) ReleaseMutex(mutex)
295 #define mdb_mutex_consistent(mutex) 0
296 #define getpid() GetCurrentProcessId()
297 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
298 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
299 #define ErrCode() GetLastError()
300 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
301 #define close(fd) (CloseHandle(fd) ? 0 : -1)
302 #define munmap(ptr,len) UnmapViewOfFile(ptr)
303 #ifdef PROCESS_QUERY_LIMITED_INFORMATION
304 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION PROCESS_QUERY_LIMITED_INFORMATION
306 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION 0x1000
310 #define THREAD_RET void *
311 #define THREAD_CREATE(thr,start,arg) pthread_create(&thr,NULL,start,arg)
312 #define THREAD_FINISH(thr) pthread_join(thr,NULL)
313 #define Z "z" /**< printf format modifier for size_t */
315 /** For MDB_LOCK_FORMAT: True if readers take a pid lock in the lockfile */
316 #define MDB_PIDLOCK 1
318 #ifdef MDB_USE_POSIX_SEM
320 typedef sem_t *mdb_mutex_t, *mdb_mutexref_t;
321 #define LOCK_MUTEX0(mutex) mdb_sem_wait(mutex)
322 #define UNLOCK_MUTEX(mutex) sem_post(mutex)
325 mdb_sem_wait(sem_t *sem)
328 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
332 #else /* MDB_USE_POSIX_MUTEX: */
333 /** Shared mutex/semaphore as it is stored (mdb_mutex_t), and as
334 * local variables keep it (mdb_mutexref_t).
336 * When #mdb_mutexref_t is a pointer declaration and #mdb_mutex_t is
337 * not, then it is array[size 1] so it can be assigned to a pointer.
340 typedef pthread_mutex_t mdb_mutex_t[1], *mdb_mutexref_t;
342 /** Lock the reader or writer mutex.
343 * Returns 0 or a code to give #mdb_mutex_failed(), as in #LOCK_MUTEX().
345 #define LOCK_MUTEX0(mutex) pthread_mutex_lock(mutex)
346 /** Unlock the reader or writer mutex.
348 #define UNLOCK_MUTEX(mutex) pthread_mutex_unlock(mutex)
349 /** Mark mutex-protected data as repaired, after death of previous owner.
351 #define mdb_mutex_consistent(mutex) pthread_mutex_consistent(mutex)
352 #endif /* MDB_USE_POSIX_SEM */
354 /** Get the error code for the last failed system function.
356 #define ErrCode() errno
358 /** An abstraction for a file handle.
359 * On POSIX systems file handles are small integers. On Windows
360 * they're opaque pointers.
364 /** A value for an invalid file handle.
365 * Mainly used to initialize file variables and signify that they are
368 #define INVALID_HANDLE_VALUE (-1)
370 /** Get the size of a memory page for the system.
371 * This is the basic size that the platform's memory manager uses, and is
372 * fundamental to the use of memory-mapped files.
374 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
377 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
380 #define MNAME_LEN (sizeof(pthread_mutex_t))
385 #ifdef MDB_ROBUST_SUPPORTED
386 /** Lock mutex, handle any error, set rc = result.
387 * Return 0 on success, nonzero (not rc) on error.
389 #define LOCK_MUTEX(rc, env, mutex) \
390 (((rc) = LOCK_MUTEX0(mutex)) && \
391 ((rc) = mdb_mutex_failed(env, mutex, rc)))
392 static int mdb_mutex_failed(MDB_env *env, mdb_mutexref_t mutex, int rc);
394 #define LOCK_MUTEX(rc, env, mutex) ((rc) = LOCK_MUTEX0(mutex))
395 #define mdb_mutex_failed(env, mutex, rc) (rc)
399 /** A flag for opening a file and requesting synchronous data writes.
400 * This is only used when writing a meta page. It's not strictly needed;
401 * we could just do a normal write and then immediately perform a flush.
402 * But if this flag is available it saves us an extra system call.
404 * @note If O_DSYNC is undefined but exists in /usr/include,
405 * preferably set some compiler flag to get the definition.
409 # define MDB_DSYNC O_DSYNC
411 # define MDB_DSYNC O_SYNC
416 /** Function for flushing the data of a file. Define this to fsync
417 * if fdatasync() is not supported.
419 #ifndef MDB_FDATASYNC
420 # define MDB_FDATASYNC fdatasync
424 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
435 /** A page number in the database.
436 * Note that 64 bit page numbers are overkill, since pages themselves
437 * already represent 12-13 bits of addressable memory, and the OS will
438 * always limit applications to a maximum of 63 bits of address space.
440 * @note In the #MDB_node structure, we only store 48 bits of this value,
441 * which thus limits us to only 60 bits of addressable data.
443 typedef MDB_ID pgno_t;
445 /** A transaction ID.
446 * See struct MDB_txn.mt_txnid for details.
448 typedef MDB_ID txnid_t;
450 /** @defgroup debug Debug Macros
454 /** Enable debug output. Needs variable argument macros (a C99 feature).
455 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
456 * read from and written to the database (used for free space management).
462 static int mdb_debug;
463 static txnid_t mdb_debug_start;
465 /** Print a debug message with printf formatting.
466 * Requires double parenthesis around 2 or more args.
468 # define DPRINTF(args) ((void) ((mdb_debug) && DPRINTF0 args))
469 # define DPRINTF0(fmt, ...) \
470 fprintf(stderr, "%s:%d " fmt "\n", mdb_func_, __LINE__, __VA_ARGS__)
472 # define DPRINTF(args) ((void) 0)
474 /** Print a debug string.
475 * The string is printed literally, with no format processing.
477 #define DPUTS(arg) DPRINTF(("%s", arg))
478 /** Debuging output value of a cursor DBI: Negative in a sub-cursor. */
480 (((mc)->mc_flags & C_SUB) ? -(int)(mc)->mc_dbi : (int)(mc)->mc_dbi)
483 /** @brief The maximum size of a database page.
485 * It is 32k or 64k, since value-PAGEBASE must fit in
486 * #MDB_page.%mp_upper.
488 * LMDB will use database pages < OS pages if needed.
489 * That causes more I/O in write transactions: The OS must
490 * know (read) the whole page before writing a partial page.
492 * Note that we don't currently support Huge pages. On Linux,
493 * regular data files cannot use Huge pages, and in general
494 * Huge pages aren't actually pageable. We rely on the OS
495 * demand-pager to read our data and page it out when memory
496 * pressure from other processes is high. So until OSs have
497 * actual paging support for Huge pages, they're not viable.
499 #define MAX_PAGESIZE (PAGEBASE ? 0x10000 : 0x8000)
501 /** The minimum number of keys required in a database page.
502 * Setting this to a larger value will place a smaller bound on the
503 * maximum size of a data item. Data items larger than this size will
504 * be pushed into overflow pages instead of being stored directly in
505 * the B-tree node. This value used to default to 4. With a page size
506 * of 4096 bytes that meant that any item larger than 1024 bytes would
507 * go into an overflow page. That also meant that on average 2-3KB of
508 * each overflow page was wasted space. The value cannot be lower than
509 * 2 because then there would no longer be a tree structure. With this
510 * value, items larger than 2KB will go into overflow pages, and on
511 * average only 1KB will be wasted.
513 #define MDB_MINKEYS 2
515 /** A stamp that identifies a file as an LMDB file.
516 * There's nothing special about this value other than that it is easily
517 * recognizable, and it will reflect any byte order mismatches.
519 #define MDB_MAGIC 0xBEEFC0DE
521 /** The version number for a database's datafile format. */
522 #define MDB_DATA_VERSION ((MDB_DEVEL) ? 999 : 1)
523 /** The version number for a database's lockfile format. */
524 #define MDB_LOCK_VERSION 1
526 /** @brief The max size of a key we can write, or 0 for computed max.
528 * This macro should normally be left alone or set to 0.
529 * Note that a database with big keys or dupsort data cannot be
530 * reliably modified by a liblmdb which uses a smaller max.
531 * The default is 511 for backwards compat, or 0 when #MDB_DEVEL.
533 * Other values are allowed, for backwards compat. However:
534 * A value bigger than the computed max can break if you do not
535 * know what you are doing, and liblmdb <= 0.9.10 can break when
536 * modifying a DB with keys/dupsort data bigger than its max.
538 * Data items in an #MDB_DUPSORT database are also limited to
539 * this size, since they're actually keys of a sub-DB. Keys and
540 * #MDB_DUPSORT data items must fit on a node in a regular page.
542 #ifndef MDB_MAXKEYSIZE
543 #define MDB_MAXKEYSIZE ((MDB_DEVEL) ? 0 : 511)
546 /** The maximum size of a key we can write to the environment. */
548 #define ENV_MAXKEY(env) (MDB_MAXKEYSIZE)
550 #define ENV_MAXKEY(env) ((env)->me_maxkey)
553 /** @brief The maximum size of a data item.
555 * We only store a 32 bit value for node sizes.
557 #define MAXDATASIZE 0xffffffffUL
560 /** Key size which fits in a #DKBUF.
563 #define DKBUF_MAXKEYSIZE ((MDB_MAXKEYSIZE) > 0 ? (MDB_MAXKEYSIZE) : 511)
566 * This is used for printing a hex dump of a key's contents.
568 #define DKBUF char kbuf[DKBUF_MAXKEYSIZE*2+1]
569 /** Display a key in hex.
571 * Invoke a function to display a key in hex.
573 #define DKEY(x) mdb_dkey(x, kbuf)
579 /** An invalid page number.
580 * Mainly used to denote an empty tree.
582 #define P_INVALID (~(pgno_t)0)
584 /** Test if the flags \b f are set in a flag word \b w. */
585 #define F_ISSET(w, f) (((w) & (f)) == (f))
587 /** Round \b n up to an even number. */
588 #define EVEN(n) (((n) + 1U) & -2) /* sign-extending -2 to match n+1U */
590 /** Used for offsets within a single page.
591 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
594 typedef uint16_t indx_t;
596 /** Default size of memory map.
597 * This is certainly too small for any actual applications. Apps should always set
598 * the size explicitly using #mdb_env_set_mapsize().
600 #define DEFAULT_MAPSIZE 1048576
602 /** @defgroup readers Reader Lock Table
603 * Readers don't acquire any locks for their data access. Instead, they
604 * simply record their transaction ID in the reader table. The reader
605 * mutex is needed just to find an empty slot in the reader table. The
606 * slot's address is saved in thread-specific data so that subsequent read
607 * transactions started by the same thread need no further locking to proceed.
609 * If #MDB_NOTLS is set, the slot address is not saved in thread-specific data.
611 * No reader table is used if the database is on a read-only filesystem, or
612 * if #MDB_NOLOCK is set.
614 * Since the database uses multi-version concurrency control, readers don't
615 * actually need any locking. This table is used to keep track of which
616 * readers are using data from which old transactions, so that we'll know
617 * when a particular old transaction is no longer in use. Old transactions
618 * that have discarded any data pages can then have those pages reclaimed
619 * for use by a later write transaction.
621 * The lock table is constructed such that reader slots are aligned with the
622 * processor's cache line size. Any slot is only ever used by one thread.
623 * This alignment guarantees that there will be no contention or cache
624 * thrashing as threads update their own slot info, and also eliminates
625 * any need for locking when accessing a slot.
627 * A writer thread will scan every slot in the table to determine the oldest
628 * outstanding reader transaction. Any freed pages older than this will be
629 * reclaimed by the writer. The writer doesn't use any locks when scanning
630 * this table. This means that there's no guarantee that the writer will
631 * see the most up-to-date reader info, but that's not required for correct
632 * operation - all we need is to know the upper bound on the oldest reader,
633 * we don't care at all about the newest reader. So the only consequence of
634 * reading stale information here is that old pages might hang around a
635 * while longer before being reclaimed. That's actually good anyway, because
636 * the longer we delay reclaiming old pages, the more likely it is that a
637 * string of contiguous pages can be found after coalescing old pages from
638 * many old transactions together.
641 /** Number of slots in the reader table.
642 * This value was chosen somewhat arbitrarily. 126 readers plus a
643 * couple mutexes fit exactly into 8KB on my development machine.
644 * Applications should set the table size using #mdb_env_set_maxreaders().
646 #define DEFAULT_READERS 126
648 /** The size of a CPU cache line in bytes. We want our lock structures
649 * aligned to this size to avoid false cache line sharing in the
651 * This value works for most CPUs. For Itanium this should be 128.
657 /** The information we store in a single slot of the reader table.
658 * In addition to a transaction ID, we also record the process and
659 * thread ID that owns a slot, so that we can detect stale information,
660 * e.g. threads or processes that went away without cleaning up.
661 * @note We currently don't check for stale records. We simply re-init
662 * the table when we know that we're the only process opening the
665 typedef struct MDB_rxbody {
666 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
667 * Multiple readers that start at the same time will probably have the
668 * same ID here. Again, it's not important to exclude them from
669 * anything; all we need to know is which version of the DB they
670 * started from so we can avoid overwriting any data used in that
671 * particular version.
673 volatile txnid_t mrb_txnid;
674 /** The process ID of the process owning this reader txn. */
675 volatile MDB_PID_T mrb_pid;
676 /** The thread ID of the thread owning this txn. */
677 volatile MDB_THR_T mrb_tid;
680 /** The actual reader record, with cacheline padding. */
681 typedef struct MDB_reader {
684 /** shorthand for mrb_txnid */
685 #define mr_txnid mru.mrx.mrb_txnid
686 #define mr_pid mru.mrx.mrb_pid
687 #define mr_tid mru.mrx.mrb_tid
688 /** cache line alignment */
689 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
693 /** The header for the reader table.
694 * The table resides in a memory-mapped file. (This is a different file
695 * than is used for the main database.)
697 * For POSIX the actual mutexes reside in the shared memory of this
698 * mapped file. On Windows, mutexes are named objects allocated by the
699 * kernel; we store the mutex names in this mapped file so that other
700 * processes can grab them. This same approach is also used on
701 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
702 * process-shared POSIX mutexes. For these cases where a named object
703 * is used, the object name is derived from a 64 bit FNV hash of the
704 * environment pathname. As such, naming collisions are extremely
705 * unlikely. If a collision occurs, the results are unpredictable.
707 typedef struct MDB_txbody {
708 /** Stamp identifying this as an LMDB file. It must be set
711 /** Format of this lock file. Must be set to #MDB_LOCK_FORMAT. */
713 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
714 char mtb_rmname[MNAME_LEN];
716 /** Mutex protecting access to this table.
717 * This is the reader table lock used with LOCK_MUTEX().
719 mdb_mutex_t mtb_rmutex;
721 /** The ID of the last transaction committed to the database.
722 * This is recorded here only for convenience; the value can always
723 * be determined by reading the main database meta pages.
725 volatile txnid_t mtb_txnid;
726 /** The number of slots that have been used in the reader table.
727 * This always records the maximum count, it is not decremented
728 * when readers release their slots.
730 volatile unsigned mtb_numreaders;
733 /** The actual reader table definition. */
734 typedef struct MDB_txninfo {
737 #define mti_magic mt1.mtb.mtb_magic
738 #define mti_format mt1.mtb.mtb_format
739 #define mti_rmutex mt1.mtb.mtb_rmutex
740 #define mti_rmname mt1.mtb.mtb_rmname
741 #define mti_txnid mt1.mtb.mtb_txnid
742 #define mti_numreaders mt1.mtb.mtb_numreaders
743 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
746 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
747 char mt2_wmname[MNAME_LEN];
748 #define mti_wmname mt2.mt2_wmname
750 mdb_mutex_t mt2_wmutex;
751 #define mti_wmutex mt2.mt2_wmutex
753 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
755 MDB_reader mti_readers[1];
758 /** Lockfile format signature: version, features and field layout */
759 #define MDB_LOCK_FORMAT \
761 ((MDB_LOCK_VERSION) \
762 /* Flags which describe functionality */ \
763 + (((MDB_PIDLOCK) != 0) << 16)))
766 /** Common header for all page types.
767 * Overflow records occupy a number of contiguous pages with no
768 * headers on any page after the first.
770 typedef struct MDB_page {
771 #define mp_pgno mp_p.p_pgno
772 #define mp_next mp_p.p_next
774 pgno_t p_pgno; /**< page number */
775 struct MDB_page *p_next; /**< for in-memory list of freed pages */
778 /** @defgroup mdb_page Page Flags
780 * Flags for the page headers.
783 #define P_BRANCH 0x01 /**< branch page */
784 #define P_LEAF 0x02 /**< leaf page */
785 #define P_OVERFLOW 0x04 /**< overflow page */
786 #define P_META 0x08 /**< meta page */
787 #define P_DIRTY 0x10 /**< dirty page, also set for #P_SUBP pages */
788 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
789 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
790 #define P_LOOSE 0x4000 /**< page was dirtied then freed, can be reused */
791 #define P_KEEP 0x8000 /**< leave this page alone during spill */
793 uint16_t mp_flags; /**< @ref mdb_page */
794 #define mp_lower mp_pb.pb.pb_lower
795 #define mp_upper mp_pb.pb.pb_upper
796 #define mp_pages mp_pb.pb_pages
799 indx_t pb_lower; /**< lower bound of free space */
800 indx_t pb_upper; /**< upper bound of free space */
802 uint32_t pb_pages; /**< number of overflow pages */
804 indx_t mp_ptrs[1]; /**< dynamic size */
807 /** Size of the page header, excluding dynamic data at the end */
808 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
810 /** Address of first usable data byte in a page, after the header */
811 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
813 /** ITS#7713, change PAGEBASE to handle 65536 byte pages */
814 #define PAGEBASE ((MDB_DEVEL) ? PAGEHDRSZ : 0)
816 /** Number of nodes on a page */
817 #define NUMKEYS(p) (((p)->mp_lower - (PAGEHDRSZ-PAGEBASE)) >> 1)
819 /** The amount of space remaining in the page */
820 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
822 /** The percentage of space used in the page, in tenths of a percent. */
823 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
824 ((env)->me_psize - PAGEHDRSZ))
825 /** The minimum page fill factor, in tenths of a percent.
826 * Pages emptier than this are candidates for merging.
828 #define FILL_THRESHOLD 250
830 /** Test if a page is a leaf page */
831 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
832 /** Test if a page is a LEAF2 page */
833 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
834 /** Test if a page is a branch page */
835 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
836 /** Test if a page is an overflow page */
837 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
838 /** Test if a page is a sub page */
839 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
841 /** The number of overflow pages needed to store the given size. */
842 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
844 /** Link in #MDB_txn.%mt_loose_pgs list */
845 #define NEXT_LOOSE_PAGE(p) (*(MDB_page **)((p) + 2))
847 /** Header for a single key/data pair within a page.
848 * Used in pages of type #P_BRANCH and #P_LEAF without #P_LEAF2.
849 * We guarantee 2-byte alignment for 'MDB_node's.
851 typedef struct MDB_node {
852 /** lo and hi are used for data size on leaf nodes and for
853 * child pgno on branch nodes. On 64 bit platforms, flags
854 * is also used for pgno. (Branch nodes have no flags).
855 * They are in host byte order in case that lets some
856 * accesses be optimized into a 32-bit word access.
858 #if BYTE_ORDER == LITTLE_ENDIAN
859 unsigned short mn_lo, mn_hi; /**< part of data size or pgno */
861 unsigned short mn_hi, mn_lo;
863 /** @defgroup mdb_node Node Flags
865 * Flags for node headers.
868 #define F_BIGDATA 0x01 /**< data put on overflow page */
869 #define F_SUBDATA 0x02 /**< data is a sub-database */
870 #define F_DUPDATA 0x04 /**< data has duplicates */
872 /** valid flags for #mdb_node_add() */
873 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
876 unsigned short mn_flags; /**< @ref mdb_node */
877 unsigned short mn_ksize; /**< key size */
878 char mn_data[1]; /**< key and data are appended here */
881 /** Size of the node header, excluding dynamic data at the end */
882 #define NODESIZE offsetof(MDB_node, mn_data)
884 /** Bit position of top word in page number, for shifting mn_flags */
885 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
887 /** Size of a node in a branch page with a given key.
888 * This is just the node header plus the key, there is no data.
890 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
892 /** Size of a node in a leaf page with a given key and data.
893 * This is node header plus key plus data size.
895 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
897 /** Address of node \b i in page \b p */
898 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i] + PAGEBASE))
900 /** Address of the key for the node */
901 #define NODEKEY(node) (void *)((node)->mn_data)
903 /** Address of the data for a node */
904 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
906 /** Get the page number pointed to by a branch node */
907 #define NODEPGNO(node) \
908 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
909 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
910 /** Set the page number in a branch node */
911 #define SETPGNO(node,pgno) do { \
912 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
913 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
915 /** Get the size of the data in a leaf node */
916 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
917 /** Set the size of the data for a leaf node */
918 #define SETDSZ(node,size) do { \
919 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
920 /** The size of a key in a node */
921 #define NODEKSZ(node) ((node)->mn_ksize)
923 /** Copy a page number from src to dst */
925 #define COPY_PGNO(dst,src) dst = src
927 #if SIZE_MAX > 4294967295UL
928 #define COPY_PGNO(dst,src) do { \
929 unsigned short *s, *d; \
930 s = (unsigned short *)&(src); \
931 d = (unsigned short *)&(dst); \
938 #define COPY_PGNO(dst,src) do { \
939 unsigned short *s, *d; \
940 s = (unsigned short *)&(src); \
941 d = (unsigned short *)&(dst); \
947 /** The address of a key in a LEAF2 page.
948 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
949 * There are no node headers, keys are stored contiguously.
951 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
953 /** Set the \b node's key into \b keyptr, if requested. */
954 #define MDB_GET_KEY(node, keyptr) { if ((keyptr) != NULL) { \
955 (keyptr)->mv_size = NODEKSZ(node); (keyptr)->mv_data = NODEKEY(node); } }
957 /** Set the \b node's key into \b key. */
958 #define MDB_GET_KEY2(node, key) { key.mv_size = NODEKSZ(node); key.mv_data = NODEKEY(node); }
960 /** Information about a single database in the environment. */
961 typedef struct MDB_db {
962 uint32_t md_pad; /**< also ksize for LEAF2 pages */
963 uint16_t md_flags; /**< @ref mdb_dbi_open */
964 uint16_t md_depth; /**< depth of this tree */
965 pgno_t md_branch_pages; /**< number of internal pages */
966 pgno_t md_leaf_pages; /**< number of leaf pages */
967 pgno_t md_overflow_pages; /**< number of overflow pages */
968 size_t md_entries; /**< number of data items */
969 pgno_t md_root; /**< the root page of this tree */
972 /** mdb_dbi_open flags */
973 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
974 #define PERSISTENT_FLAGS (0xffff & ~(MDB_VALID))
975 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
976 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
978 /** Handle for the DB used to track free pages. */
980 /** Handle for the default DB. */
982 /** Number of DBs in metapage (free and main) - also hardcoded elsewhere */
985 /** Number of meta pages - also hardcoded elsewhere */
988 /** Meta page content.
989 * A meta page is the start point for accessing a database snapshot.
990 * Pages 0-1 are meta pages. Transaction N writes meta page #(N % 2).
992 typedef struct MDB_meta {
993 /** Stamp identifying this as an LMDB file. It must be set
996 /** Version number of this file. Must be set to #MDB_DATA_VERSION. */
998 void *mm_address; /**< address for fixed mapping */
999 size_t mm_mapsize; /**< size of mmap region */
1000 MDB_db mm_dbs[CORE_DBS]; /**< first is free space, 2nd is main db */
1001 /** The size of pages used in this DB */
1002 #define mm_psize mm_dbs[FREE_DBI].md_pad
1003 /** Any persistent environment flags. @ref mdb_env */
1004 #define mm_flags mm_dbs[FREE_DBI].md_flags
1005 pgno_t mm_last_pg; /**< last used page in file */
1006 volatile txnid_t mm_txnid; /**< txnid that committed this page */
1009 /** Buffer for a stack-allocated meta page.
1010 * The members define size and alignment, and silence type
1011 * aliasing warnings. They are not used directly; that could
1012 * mean incorrectly using several union members in parallel.
1014 typedef union MDB_metabuf {
1017 char mm_pad[PAGEHDRSZ];
1022 /** Auxiliary DB info.
1023 * The information here is mostly static/read-only. There is
1024 * only a single copy of this record in the environment.
1026 typedef struct MDB_dbx {
1027 MDB_val md_name; /**< name of the database */
1028 MDB_cmp_func *md_cmp; /**< function for comparing keys */
1029 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
1030 MDB_rel_func *md_rel; /**< user relocate function */
1031 void *md_relctx; /**< user-provided context for md_rel */
1034 /** A database transaction.
1035 * Every operation requires a transaction handle.
1038 MDB_txn *mt_parent; /**< parent of a nested txn */
1039 /** Nested txn under this txn, set together with flag #MDB_TXN_HAS_CHILD */
1041 pgno_t mt_next_pgno; /**< next unallocated page */
1042 /** The ID of this transaction. IDs are integers incrementing from 1.
1043 * Only committed write transactions increment the ID. If a transaction
1044 * aborts, the ID may be re-used by the next writer.
1047 MDB_env *mt_env; /**< the DB environment */
1048 /** The list of pages that became unused during this transaction.
1050 MDB_IDL mt_free_pgs;
1051 /** The list of loose pages that became unused and may be reused
1052 * in this transaction, linked through #NEXT_LOOSE_PAGE(page).
1054 MDB_page *mt_loose_pgs;
1055 /* #Number of loose pages (#mt_loose_pgs) */
1057 /** The sorted list of dirty pages we temporarily wrote to disk
1058 * because the dirty list was full. page numbers in here are
1059 * shifted left by 1, deleted slots have the LSB set.
1061 MDB_IDL mt_spill_pgs;
1063 /** For write txns: Modified pages. Sorted when not MDB_WRITEMAP. */
1064 MDB_ID2L dirty_list;
1065 /** For read txns: This thread/txn's reader table slot, or NULL. */
1068 /** Array of records for each DB known in the environment. */
1070 /** Array of MDB_db records for each known DB */
1072 /** Array of sequence numbers for each DB handle */
1073 unsigned int *mt_dbiseqs;
1074 /** @defgroup mt_dbflag Transaction DB Flags
1078 #define DB_DIRTY 0x01 /**< DB was modified or is DUPSORT data */
1079 #define DB_STALE 0x02 /**< Named-DB record is older than txnID */
1080 #define DB_NEW 0x04 /**< Named-DB handle opened in this txn */
1081 #define DB_VALID 0x08 /**< DB handle is valid, see also #MDB_VALID */
1082 #define DB_USRVALID 0x10 /**< As #DB_VALID, but not set for #FREE_DBI */
1084 /** In write txns, array of cursors for each DB */
1085 MDB_cursor **mt_cursors;
1086 /** Array of flags for each DB */
1087 unsigned char *mt_dbflags;
1088 /** Number of DB records in use, or 0 when the txn is finished.
1089 * This number only ever increments until the txn finishes; we
1090 * don't decrement it when individual DB handles are closed.
1094 /** @defgroup mdb_txn Transaction Flags
1098 /** #mdb_txn_begin() flags */
1099 #define MDB_TXN_BEGIN_FLAGS MDB_RDONLY
1100 #define MDB_TXN_RDONLY MDB_RDONLY /**< read-only transaction */
1101 /* internal txn flags */
1102 #define MDB_TXN_WRITEMAP MDB_WRITEMAP /**< copy of #MDB_env flag in writers */
1103 #define MDB_TXN_FINISHED 0x01 /**< txn is finished or never began */
1104 #define MDB_TXN_ERROR 0x02 /**< txn is unusable after an error */
1105 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
1106 #define MDB_TXN_SPILLS 0x08 /**< txn or a parent has spilled pages */
1107 #define MDB_TXN_HAS_CHILD 0x10 /**< txn has an #MDB_txn.%mt_child */
1108 /** most operations on the txn are currently illegal */
1109 #define MDB_TXN_BLOCKED (MDB_TXN_FINISHED|MDB_TXN_ERROR|MDB_TXN_HAS_CHILD)
1111 unsigned int mt_flags; /**< @ref mdb_txn */
1112 /** #dirty_list room: Array size - \#dirty pages visible to this txn.
1113 * Includes ancestor txns' dirty pages not hidden by other txns'
1114 * dirty/spilled pages. Thus commit(nested txn) has room to merge
1115 * dirty_list into mt_parent after freeing hidden mt_parent pages.
1117 unsigned int mt_dirty_room;
1120 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
1121 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
1122 * raise this on a 64 bit machine.
1124 #define CURSOR_STACK 32
1128 /** Cursors are used for all DB operations.
1129 * A cursor holds a path of (page pointer, key index) from the DB
1130 * root to a position in the DB, plus other state. #MDB_DUPSORT
1131 * cursors include an xcursor to the current data item. Write txns
1132 * track their cursors and keep them up to date when data moves.
1133 * Exception: An xcursor's pointer to a #P_SUBP page can be stale.
1134 * (A node with #F_DUPDATA but no #F_SUBDATA contains a subpage).
1137 /** Next cursor on this DB in this txn */
1138 MDB_cursor *mc_next;
1139 /** Backup of the original cursor if this cursor is a shadow */
1140 MDB_cursor *mc_backup;
1141 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
1142 struct MDB_xcursor *mc_xcursor;
1143 /** The transaction that owns this cursor */
1145 /** The database handle this cursor operates on */
1147 /** The database record for this cursor */
1149 /** The database auxiliary record for this cursor */
1151 /** The @ref mt_dbflag for this database */
1152 unsigned char *mc_dbflag;
1153 unsigned short mc_snum; /**< number of pushed pages */
1154 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
1155 /** @defgroup mdb_cursor Cursor Flags
1157 * Cursor state flags.
1160 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
1161 #define C_EOF 0x02 /**< No more data */
1162 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
1163 #define C_DEL 0x08 /**< last op was a cursor_del */
1164 #define C_UNTRACK 0x40 /**< Un-track cursor when closing */
1166 unsigned int mc_flags; /**< @ref mdb_cursor */
1167 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
1168 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
1171 /** Context for sorted-dup records.
1172 * We could have gone to a fully recursive design, with arbitrarily
1173 * deep nesting of sub-databases. But for now we only handle these
1174 * levels - main DB, optional sub-DB, sorted-duplicate DB.
1176 typedef struct MDB_xcursor {
1177 /** A sub-cursor for traversing the Dup DB */
1178 MDB_cursor mx_cursor;
1179 /** The database record for this Dup DB */
1181 /** The auxiliary DB record for this Dup DB */
1183 /** The @ref mt_dbflag for this Dup DB */
1184 unsigned char mx_dbflag;
1187 /** State of FreeDB old pages, stored in the MDB_env */
1188 typedef struct MDB_pgstate {
1189 pgno_t *mf_pghead; /**< Reclaimed freeDB pages, or NULL before use */
1190 txnid_t mf_pglast; /**< ID of last used record, or 0 if !mf_pghead */
1193 /** The database environment. */
1195 HANDLE me_fd; /**< The main data file */
1196 HANDLE me_lfd; /**< The lock file */
1197 HANDLE me_mfd; /**< just for writing the meta pages */
1198 /** Failed to update the meta page. Probably an I/O error. */
1199 #define MDB_FATAL_ERROR 0x80000000U
1200 /** Some fields are initialized. */
1201 #define MDB_ENV_ACTIVE 0x20000000U
1202 /** me_txkey is set */
1203 #define MDB_ENV_TXKEY 0x10000000U
1204 /** fdatasync is unreliable */
1205 #define MDB_FSYNCONLY 0x08000000U
1206 uint32_t me_flags; /**< @ref mdb_env */
1207 unsigned int me_psize; /**< DB page size, inited from me_os_psize */
1208 unsigned int me_os_psize; /**< OS page size, from #GET_PAGESIZE */
1209 unsigned int me_maxreaders; /**< size of the reader table */
1210 /** Max #MDB_txninfo.%mti_numreaders of interest to #mdb_env_close() */
1211 volatile int me_close_readers;
1212 MDB_dbi me_numdbs; /**< number of DBs opened */
1213 MDB_dbi me_maxdbs; /**< size of the DB table */
1214 MDB_PID_T me_pid; /**< process ID of this env */
1215 char *me_path; /**< path to the DB files */
1216 char *me_map; /**< the memory map of the data file */
1217 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
1218 MDB_meta *me_metas[NUM_METAS]; /**< pointers to the two meta pages */
1219 void *me_pbuf; /**< scratch area for DUPSORT put() */
1220 MDB_txn *me_txn; /**< current write transaction */
1221 MDB_txn *me_txn0; /**< prealloc'd write transaction */
1222 size_t me_mapsize; /**< size of the data memory map */
1223 off_t me_size; /**< current file size */
1224 pgno_t me_maxpg; /**< me_mapsize / me_psize */
1225 MDB_dbx *me_dbxs; /**< array of static DB info */
1226 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
1227 unsigned int *me_dbiseqs; /**< array of dbi sequence numbers */
1228 pthread_key_t me_txkey; /**< thread-key for readers */
1229 txnid_t me_pgoldest; /**< ID of oldest reader last time we looked */
1230 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
1231 # define me_pglast me_pgstate.mf_pglast
1232 # define me_pghead me_pgstate.mf_pghead
1233 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
1234 /** IDL of pages that became unused in a write txn */
1235 MDB_IDL me_free_pgs;
1236 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
1237 MDB_ID2L me_dirty_list;
1238 /** Max number of freelist items that can fit in a single overflow page */
1240 /** Max size of a node on a page */
1241 unsigned int me_nodemax;
1242 #if !(MDB_MAXKEYSIZE)
1243 unsigned int me_maxkey; /**< max size of a key */
1245 int me_live_reader; /**< have liveness lock in reader table */
1247 int me_pidquery; /**< Used in OpenProcess */
1249 #ifdef MDB_USE_POSIX_MUTEX /* Posix mutexes reside in shared mem */
1250 # define me_rmutex me_txns->mti_rmutex /**< Shared reader lock */
1251 # define me_wmutex me_txns->mti_wmutex /**< Shared writer lock */
1253 mdb_mutex_t me_rmutex;
1254 mdb_mutex_t me_wmutex;
1256 void *me_userctx; /**< User-settable context */
1257 MDB_assert_func *me_assert_func; /**< Callback for assertion failures */
1260 /** Nested transaction */
1261 typedef struct MDB_ntxn {
1262 MDB_txn mnt_txn; /**< the transaction */
1263 MDB_pgstate mnt_pgstate; /**< parent transaction's saved freestate */
1266 /** max number of pages to commit in one writev() call */
1267 #define MDB_COMMIT_PAGES 64
1268 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
1269 #undef MDB_COMMIT_PAGES
1270 #define MDB_COMMIT_PAGES IOV_MAX
1273 /** max bytes to write in one call */
1274 #define MAX_WRITE (0x40000000U >> (sizeof(ssize_t) == 4))
1276 /** Check \b txn and \b dbi arguments to a function */
1277 #define TXN_DBI_EXIST(txn, dbi, validity) \
1278 ((txn) && (dbi)<(txn)->mt_numdbs && ((txn)->mt_dbflags[dbi] & (validity)))
1280 /** Check for misused \b dbi handles */
1281 #define TXN_DBI_CHANGED(txn, dbi) \
1282 ((txn)->mt_dbiseqs[dbi] != (txn)->mt_env->me_dbiseqs[dbi])
1284 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
1285 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
1286 static int mdb_page_touch(MDB_cursor *mc);
1288 #define MDB_END_NAMES {"committed", "empty-commit", "abort", "reset", \
1289 "reset-tmp", "fail-begin", "fail-beginchild"}
1291 /* mdb_txn_end operation number, for logging */
1292 MDB_END_COMMITTED, MDB_END_EMPTY_COMMIT, MDB_END_ABORT, MDB_END_RESET,
1293 MDB_END_RESET_TMP, MDB_END_FAIL_BEGIN, MDB_END_FAIL_BEGINCHILD
1295 #define MDB_END_OPMASK 0x0F /**< mask for #mdb_txn_end() operation number */
1296 #define MDB_END_UPDATE 0x10 /**< update env state (DBIs) */
1297 #define MDB_END_FREE 0x20 /**< free txn unless it is #MDB_env.%me_txn0 */
1298 #define MDB_END_SLOT MDB_NOTLS /**< release any reader slot if #MDB_NOTLS */
1299 static void mdb_txn_end(MDB_txn *txn, unsigned mode);
1301 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp, int *lvl);
1302 static int mdb_page_search_root(MDB_cursor *mc,
1303 MDB_val *key, int modify);
1304 #define MDB_PS_MODIFY 1
1305 #define MDB_PS_ROOTONLY 2
1306 #define MDB_PS_FIRST 4
1307 #define MDB_PS_LAST 8
1308 static int mdb_page_search(MDB_cursor *mc,
1309 MDB_val *key, int flags);
1310 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1312 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1313 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1314 pgno_t newpgno, unsigned int nflags);
1316 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1317 static MDB_meta *mdb_env_pick_meta(const MDB_env *env);
1318 static int mdb_env_write_meta(MDB_txn *txn);
1319 #ifdef MDB_USE_POSIX_MUTEX /* Drop unused excl arg */
1320 # define mdb_env_close0(env, excl) mdb_env_close1(env)
1322 static void mdb_env_close0(MDB_env *env, int excl);
1324 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1325 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1326 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1327 static void mdb_node_del(MDB_cursor *mc, int ksize);
1328 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1329 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst, int fromleft);
1330 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1331 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1332 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1334 static int mdb_rebalance(MDB_cursor *mc);
1335 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1337 static void mdb_cursor_pop(MDB_cursor *mc);
1338 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1340 static int mdb_cursor_del0(MDB_cursor *mc);
1341 static int mdb_del0(MDB_txn *txn, MDB_dbi dbi, MDB_val *key, MDB_val *data, unsigned flags);
1342 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1343 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1344 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1345 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1347 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1348 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1350 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1351 static void mdb_xcursor_init0(MDB_cursor *mc);
1352 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1353 static void mdb_xcursor_init2(MDB_cursor *mc, MDB_xcursor *src_mx, int force);
1355 static int mdb_drop0(MDB_cursor *mc, int subs);
1356 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1357 static int mdb_reader_check0(MDB_env *env, int rlocked, int *dead);
1360 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1363 /** Compare two items pointing at size_t's of unknown alignment. */
1364 #ifdef MISALIGNED_OK
1365 # define mdb_cmp_clong mdb_cmp_long
1367 # define mdb_cmp_clong mdb_cmp_cint
1371 static SECURITY_DESCRIPTOR mdb_null_sd;
1372 static SECURITY_ATTRIBUTES mdb_all_sa;
1373 static int mdb_sec_inited;
1375 static int utf8_to_utf16(const char *src, int srcsize, wchar_t **dst, int *dstsize);
1378 /** Return the library version info. */
1380 mdb_version(int *major, int *minor, int *patch)
1382 if (major) *major = MDB_VERSION_MAJOR;
1383 if (minor) *minor = MDB_VERSION_MINOR;
1384 if (patch) *patch = MDB_VERSION_PATCH;
1385 return MDB_VERSION_STRING;
1388 /** Table of descriptions for LMDB @ref errors */
1389 static char *const mdb_errstr[] = {
1390 "MDB_KEYEXIST: Key/data pair already exists",
1391 "MDB_NOTFOUND: No matching key/data pair found",
1392 "MDB_PAGE_NOTFOUND: Requested page not found",
1393 "MDB_CORRUPTED: Located page was wrong type",
1394 "MDB_PANIC: Update of meta page failed or environment had fatal error",
1395 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1396 "MDB_INVALID: File is not an LMDB file",
1397 "MDB_MAP_FULL: Environment mapsize limit reached",
1398 "MDB_DBS_FULL: Environment maxdbs limit reached",
1399 "MDB_READERS_FULL: Environment maxreaders limit reached",
1400 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1401 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1402 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1403 "MDB_PAGE_FULL: Internal error - page has no more space",
1404 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1405 "MDB_INCOMPATIBLE: Operation and DB incompatible, or DB flags changed",
1406 "MDB_BAD_RSLOT: Invalid reuse of reader locktable slot",
1407 "MDB_BAD_TXN: Transaction must abort, has a child, or is invalid",
1408 "MDB_BAD_VALSIZE: Unsupported size of key/DB name/data, or wrong DUPFIXED size",
1409 "MDB_BAD_DBI: The specified DBI handle was closed/changed unexpectedly",
1413 mdb_strerror(int err)
1416 /** HACK: pad 4KB on stack over the buf. Return system msgs in buf.
1417 * This works as long as no function between the call to mdb_strerror
1418 * and the actual use of the message uses more than 4K of stack.
1420 #define MSGSIZE 1024
1421 #define PADSIZE 4096
1422 char buf[MSGSIZE+PADSIZE], *ptr = buf;
1426 return ("Successful return: 0");
1428 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1429 i = err - MDB_KEYEXIST;
1430 return mdb_errstr[i];
1434 /* These are the C-runtime error codes we use. The comment indicates
1435 * their numeric value, and the Win32 error they would correspond to
1436 * if the error actually came from a Win32 API. A major mess, we should
1437 * have used LMDB-specific error codes for everything.
1440 case ENOENT: /* 2, FILE_NOT_FOUND */
1441 case EIO: /* 5, ACCESS_DENIED */
1442 case ENOMEM: /* 12, INVALID_ACCESS */
1443 case EACCES: /* 13, INVALID_DATA */
1444 case EBUSY: /* 16, CURRENT_DIRECTORY */
1445 case EINVAL: /* 22, BAD_COMMAND */
1446 case ENOSPC: /* 28, OUT_OF_PAPER */
1447 return strerror(err);
1452 FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM |
1453 FORMAT_MESSAGE_IGNORE_INSERTS,
1454 NULL, err, 0, ptr, MSGSIZE, (va_list *)buf+MSGSIZE);
1457 return strerror(err);
1461 /** assert(3) variant in cursor context */
1462 #define mdb_cassert(mc, expr) mdb_assert0((mc)->mc_txn->mt_env, expr, #expr)
1463 /** assert(3) variant in transaction context */
1464 #define mdb_tassert(txn, expr) mdb_assert0((txn)->mt_env, expr, #expr)
1465 /** assert(3) variant in environment context */
1466 #define mdb_eassert(env, expr) mdb_assert0(env, expr, #expr)
1469 # define mdb_assert0(env, expr, expr_txt) ((expr) ? (void)0 : \
1470 mdb_assert_fail(env, expr_txt, mdb_func_, __FILE__, __LINE__))
1473 mdb_assert_fail(MDB_env *env, const char *expr_txt,
1474 const char *func, const char *file, int line)
1477 sprintf(buf, "%.100s:%d: Assertion '%.200s' failed in %.40s()",
1478 file, line, expr_txt, func);
1479 if (env->me_assert_func)
1480 env->me_assert_func(env, buf);
1481 fprintf(stderr, "%s\n", buf);
1485 # define mdb_assert0(env, expr, expr_txt) ((void) 0)
1489 /** Return the page number of \b mp which may be sub-page, for debug output */
1491 mdb_dbg_pgno(MDB_page *mp)
1494 COPY_PGNO(ret, mp->mp_pgno);
1498 /** Display a key in hexadecimal and return the address of the result.
1499 * @param[in] key the key to display
1500 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1501 * @return The key in hexadecimal form.
1504 mdb_dkey(MDB_val *key, char *buf)
1507 unsigned char *c = key->mv_data;
1513 if (key->mv_size > DKBUF_MAXKEYSIZE)
1514 return "MDB_MAXKEYSIZE";
1515 /* may want to make this a dynamic check: if the key is mostly
1516 * printable characters, print it as-is instead of converting to hex.
1520 for (i=0; i<key->mv_size; i++)
1521 ptr += sprintf(ptr, "%02x", *c++);
1523 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1529 mdb_leafnode_type(MDB_node *n)
1531 static char *const tp[2][2] = {{"", ": DB"}, {": sub-page", ": sub-DB"}};
1532 return F_ISSET(n->mn_flags, F_BIGDATA) ? ": overflow page" :
1533 tp[F_ISSET(n->mn_flags, F_DUPDATA)][F_ISSET(n->mn_flags, F_SUBDATA)];
1536 /** Display all the keys in the page. */
1538 mdb_page_list(MDB_page *mp)
1540 pgno_t pgno = mdb_dbg_pgno(mp);
1541 const char *type, *state = (mp->mp_flags & P_DIRTY) ? ", dirty" : "";
1543 unsigned int i, nkeys, nsize, total = 0;
1547 switch (mp->mp_flags & (P_BRANCH|P_LEAF|P_LEAF2|P_META|P_OVERFLOW|P_SUBP)) {
1548 case P_BRANCH: type = "Branch page"; break;
1549 case P_LEAF: type = "Leaf page"; break;
1550 case P_LEAF|P_SUBP: type = "Sub-page"; break;
1551 case P_LEAF|P_LEAF2: type = "LEAF2 page"; break;
1552 case P_LEAF|P_LEAF2|P_SUBP: type = "LEAF2 sub-page"; break;
1554 fprintf(stderr, "Overflow page %"Z"u pages %u%s\n",
1555 pgno, mp->mp_pages, state);
1558 fprintf(stderr, "Meta-page %"Z"u txnid %"Z"u\n",
1559 pgno, ((MDB_meta *)METADATA(mp))->mm_txnid);
1562 fprintf(stderr, "Bad page %"Z"u flags 0x%u\n", pgno, mp->mp_flags);
1566 nkeys = NUMKEYS(mp);
1567 fprintf(stderr, "%s %"Z"u numkeys %d%s\n", type, pgno, nkeys, state);
1569 for (i=0; i<nkeys; i++) {
1570 if (IS_LEAF2(mp)) { /* LEAF2 pages have no mp_ptrs[] or node headers */
1571 key.mv_size = nsize = mp->mp_pad;
1572 key.mv_data = LEAF2KEY(mp, i, nsize);
1574 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1577 node = NODEPTR(mp, i);
1578 key.mv_size = node->mn_ksize;
1579 key.mv_data = node->mn_data;
1580 nsize = NODESIZE + key.mv_size;
1581 if (IS_BRANCH(mp)) {
1582 fprintf(stderr, "key %d: page %"Z"u, %s\n", i, NODEPGNO(node),
1586 if (F_ISSET(node->mn_flags, F_BIGDATA))
1587 nsize += sizeof(pgno_t);
1589 nsize += NODEDSZ(node);
1591 nsize += sizeof(indx_t);
1592 fprintf(stderr, "key %d: nsize %d, %s%s\n",
1593 i, nsize, DKEY(&key), mdb_leafnode_type(node));
1595 total = EVEN(total);
1597 fprintf(stderr, "Total: header %d + contents %d + unused %d\n",
1598 IS_LEAF2(mp) ? PAGEHDRSZ : PAGEBASE + mp->mp_lower, total, SIZELEFT(mp));
1602 mdb_cursor_chk(MDB_cursor *mc)
1608 if (!mc->mc_snum || !(mc->mc_flags & C_INITIALIZED)) return;
1609 for (i=0; i<mc->mc_top; i++) {
1611 node = NODEPTR(mp, mc->mc_ki[i]);
1612 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1615 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1617 if (mc->mc_xcursor && (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
1618 node = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
1619 if (((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA) &&
1620 mc->mc_xcursor->mx_cursor.mc_pg[0] != NODEDATA(node)) {
1628 /** Count all the pages in each DB and in the freelist
1629 * and make sure it matches the actual number of pages
1631 * All named DBs must be open for a correct count.
1633 static void mdb_audit(MDB_txn *txn)
1637 MDB_ID freecount, count;
1642 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1643 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1644 freecount += *(MDB_ID *)data.mv_data;
1645 mdb_tassert(txn, rc == MDB_NOTFOUND);
1648 for (i = 0; i<txn->mt_numdbs; i++) {
1650 if (!(txn->mt_dbflags[i] & DB_VALID))
1652 mdb_cursor_init(&mc, txn, i, &mx);
1653 if (txn->mt_dbs[i].md_root == P_INVALID)
1655 count += txn->mt_dbs[i].md_branch_pages +
1656 txn->mt_dbs[i].md_leaf_pages +
1657 txn->mt_dbs[i].md_overflow_pages;
1658 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1659 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST);
1660 for (; rc == MDB_SUCCESS; rc = mdb_cursor_sibling(&mc, 1)) {
1663 mp = mc.mc_pg[mc.mc_top];
1664 for (j=0; j<NUMKEYS(mp); j++) {
1665 MDB_node *leaf = NODEPTR(mp, j);
1666 if (leaf->mn_flags & F_SUBDATA) {
1668 memcpy(&db, NODEDATA(leaf), sizeof(db));
1669 count += db.md_branch_pages + db.md_leaf_pages +
1670 db.md_overflow_pages;
1674 mdb_tassert(txn, rc == MDB_NOTFOUND);
1677 if (freecount + count + NUM_METAS != txn->mt_next_pgno) {
1678 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1679 txn->mt_txnid, freecount, count+NUM_METAS,
1680 freecount+count+NUM_METAS, txn->mt_next_pgno);
1686 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1688 return txn->mt_dbxs[dbi].md_cmp(a, b);
1692 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1694 MDB_cmp_func *dcmp = txn->mt_dbxs[dbi].md_dcmp;
1695 #if UINT_MAX < SIZE_MAX
1696 if (dcmp == mdb_cmp_int && a->mv_size == sizeof(size_t))
1697 dcmp = mdb_cmp_clong;
1702 /** Allocate memory for a page.
1703 * Re-use old malloc'd pages first for singletons, otherwise just malloc.
1706 mdb_page_malloc(MDB_txn *txn, unsigned num)
1708 MDB_env *env = txn->mt_env;
1709 MDB_page *ret = env->me_dpages;
1710 size_t psize = env->me_psize, sz = psize, off;
1711 /* For ! #MDB_NOMEMINIT, psize counts how much to init.
1712 * For a single page alloc, we init everything after the page header.
1713 * For multi-page, we init the final page; if the caller needed that
1714 * many pages they will be filling in at least up to the last page.
1718 VGMEMP_ALLOC(env, ret, sz);
1719 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1720 env->me_dpages = ret->mp_next;
1723 psize -= off = PAGEHDRSZ;
1728 if ((ret = malloc(sz)) != NULL) {
1729 VGMEMP_ALLOC(env, ret, sz);
1730 if (!(env->me_flags & MDB_NOMEMINIT)) {
1731 memset((char *)ret + off, 0, psize);
1735 txn->mt_flags |= MDB_TXN_ERROR;
1739 /** Free a single page.
1740 * Saves single pages to a list, for future reuse.
1741 * (This is not used for multi-page overflow pages.)
1744 mdb_page_free(MDB_env *env, MDB_page *mp)
1746 mp->mp_next = env->me_dpages;
1747 VGMEMP_FREE(env, mp);
1748 env->me_dpages = mp;
1751 /** Free a dirty page */
1753 mdb_dpage_free(MDB_env *env, MDB_page *dp)
1755 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1756 mdb_page_free(env, dp);
1758 /* large pages just get freed directly */
1759 VGMEMP_FREE(env, dp);
1764 /** Return all dirty pages to dpage list */
1766 mdb_dlist_free(MDB_txn *txn)
1768 MDB_env *env = txn->mt_env;
1769 MDB_ID2L dl = txn->mt_u.dirty_list;
1770 unsigned i, n = dl[0].mid;
1772 for (i = 1; i <= n; i++) {
1773 mdb_dpage_free(env, dl[i].mptr);
1778 /** Loosen or free a single page.
1779 * Saves single pages to a list for future reuse
1780 * in this same txn. It has been pulled from the freeDB
1781 * and already resides on the dirty list, but has been
1782 * deleted. Use these pages first before pulling again
1785 * If the page wasn't dirtied in this txn, just add it
1786 * to this txn's free list.
1789 mdb_page_loose(MDB_cursor *mc, MDB_page *mp)
1792 pgno_t pgno = mp->mp_pgno;
1793 MDB_txn *txn = mc->mc_txn;
1795 if ((mp->mp_flags & P_DIRTY) && mc->mc_dbi != FREE_DBI) {
1796 if (txn->mt_parent) {
1797 MDB_ID2 *dl = txn->mt_u.dirty_list;
1798 /* If txn has a parent, make sure the page is in our
1802 unsigned x = mdb_mid2l_search(dl, pgno);
1803 if (x <= dl[0].mid && dl[x].mid == pgno) {
1804 if (mp != dl[x].mptr) { /* bad cursor? */
1805 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
1806 txn->mt_flags |= MDB_TXN_ERROR;
1807 return MDB_CORRUPTED;
1814 /* no parent txn, so it's just ours */
1819 DPRINTF(("loosen db %d page %"Z"u", DDBI(mc),
1821 NEXT_LOOSE_PAGE(mp) = txn->mt_loose_pgs;
1822 txn->mt_loose_pgs = mp;
1823 txn->mt_loose_count++;
1824 mp->mp_flags |= P_LOOSE;
1826 int rc = mdb_midl_append(&txn->mt_free_pgs, pgno);
1834 /** Set or clear P_KEEP in dirty, non-overflow, non-sub pages watched by txn.
1835 * @param[in] mc A cursor handle for the current operation.
1836 * @param[in] pflags Flags of the pages to update:
1837 * P_DIRTY to set P_KEEP, P_DIRTY|P_KEEP to clear it.
1838 * @param[in] all No shortcuts. Needed except after a full #mdb_page_flush().
1839 * @return 0 on success, non-zero on failure.
1842 mdb_pages_xkeep(MDB_cursor *mc, unsigned pflags, int all)
1844 enum { Mask = P_SUBP|P_DIRTY|P_LOOSE|P_KEEP };
1845 MDB_txn *txn = mc->mc_txn;
1851 int rc = MDB_SUCCESS, level;
1853 /* Mark pages seen by cursors */
1854 if (mc->mc_flags & C_UNTRACK)
1855 mc = NULL; /* will find mc in mt_cursors */
1856 for (i = txn->mt_numdbs;; mc = txn->mt_cursors[--i]) {
1857 for (; mc; mc=mc->mc_next) {
1858 if (!(mc->mc_flags & C_INITIALIZED))
1860 for (m3 = mc;; m3 = &mx->mx_cursor) {
1862 for (j=0; j<m3->mc_snum; j++) {
1864 if ((mp->mp_flags & Mask) == pflags)
1865 mp->mp_flags ^= P_KEEP;
1867 mx = m3->mc_xcursor;
1868 /* Proceed to mx if it is at a sub-database */
1869 if (! (mx && (mx->mx_cursor.mc_flags & C_INITIALIZED)))
1871 if (! (mp && (mp->mp_flags & P_LEAF)))
1873 leaf = NODEPTR(mp, m3->mc_ki[j-1]);
1874 if (!(leaf->mn_flags & F_SUBDATA))
1883 /* Mark dirty root pages */
1884 for (i=0; i<txn->mt_numdbs; i++) {
1885 if (txn->mt_dbflags[i] & DB_DIRTY) {
1886 pgno_t pgno = txn->mt_dbs[i].md_root;
1887 if (pgno == P_INVALID)
1889 if ((rc = mdb_page_get(txn, pgno, &dp, &level)) != MDB_SUCCESS)
1891 if ((dp->mp_flags & Mask) == pflags && level <= 1)
1892 dp->mp_flags ^= P_KEEP;
1900 static int mdb_page_flush(MDB_txn *txn, int keep);
1902 /** Spill pages from the dirty list back to disk.
1903 * This is intended to prevent running into #MDB_TXN_FULL situations,
1904 * but note that they may still occur in a few cases:
1905 * 1) our estimate of the txn size could be too small. Currently this
1906 * seems unlikely, except with a large number of #MDB_MULTIPLE items.
1907 * 2) child txns may run out of space if their parents dirtied a
1908 * lot of pages and never spilled them. TODO: we probably should do
1909 * a preemptive spill during #mdb_txn_begin() of a child txn, if
1910 * the parent's dirty_room is below a given threshold.
1912 * Otherwise, if not using nested txns, it is expected that apps will
1913 * not run into #MDB_TXN_FULL any more. The pages are flushed to disk
1914 * the same way as for a txn commit, e.g. their P_DIRTY flag is cleared.
1915 * If the txn never references them again, they can be left alone.
1916 * If the txn only reads them, they can be used without any fuss.
1917 * If the txn writes them again, they can be dirtied immediately without
1918 * going thru all of the work of #mdb_page_touch(). Such references are
1919 * handled by #mdb_page_unspill().
1921 * Also note, we never spill DB root pages, nor pages of active cursors,
1922 * because we'll need these back again soon anyway. And in nested txns,
1923 * we can't spill a page in a child txn if it was already spilled in a
1924 * parent txn. That would alter the parent txns' data even though
1925 * the child hasn't committed yet, and we'd have no way to undo it if
1926 * the child aborted.
1928 * @param[in] m0 cursor A cursor handle identifying the transaction and
1929 * database for which we are checking space.
1930 * @param[in] key For a put operation, the key being stored.
1931 * @param[in] data For a put operation, the data being stored.
1932 * @return 0 on success, non-zero on failure.
1935 mdb_page_spill(MDB_cursor *m0, MDB_val *key, MDB_val *data)
1937 MDB_txn *txn = m0->mc_txn;
1939 MDB_ID2L dl = txn->mt_u.dirty_list;
1940 unsigned int i, j, need;
1943 if (m0->mc_flags & C_SUB)
1946 /* Estimate how much space this op will take */
1947 i = m0->mc_db->md_depth;
1948 /* Named DBs also dirty the main DB */
1949 if (m0->mc_dbi >= CORE_DBS)
1950 i += txn->mt_dbs[MAIN_DBI].md_depth;
1951 /* For puts, roughly factor in the key+data size */
1953 i += (LEAFSIZE(key, data) + txn->mt_env->me_psize) / txn->mt_env->me_psize;
1954 i += i; /* double it for good measure */
1957 if (txn->mt_dirty_room > i)
1960 if (!txn->mt_spill_pgs) {
1961 txn->mt_spill_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX);
1962 if (!txn->mt_spill_pgs)
1965 /* purge deleted slots */
1966 MDB_IDL sl = txn->mt_spill_pgs;
1967 unsigned int num = sl[0];
1969 for (i=1; i<=num; i++) {
1976 /* Preserve pages which may soon be dirtied again */
1977 if ((rc = mdb_pages_xkeep(m0, P_DIRTY, 1)) != MDB_SUCCESS)
1980 /* Less aggressive spill - we originally spilled the entire dirty list,
1981 * with a few exceptions for cursor pages and DB root pages. But this
1982 * turns out to be a lot of wasted effort because in a large txn many
1983 * of those pages will need to be used again. So now we spill only 1/8th
1984 * of the dirty pages. Testing revealed this to be a good tradeoff,
1985 * better than 1/2, 1/4, or 1/10.
1987 if (need < MDB_IDL_UM_MAX / 8)
1988 need = MDB_IDL_UM_MAX / 8;
1990 /* Save the page IDs of all the pages we're flushing */
1991 /* flush from the tail forward, this saves a lot of shifting later on. */
1992 for (i=dl[0].mid; i && need; i--) {
1993 MDB_ID pn = dl[i].mid << 1;
1995 if (dp->mp_flags & (P_LOOSE|P_KEEP))
1997 /* Can't spill twice, make sure it's not already in a parent's
2000 if (txn->mt_parent) {
2002 for (tx2 = txn->mt_parent; tx2; tx2 = tx2->mt_parent) {
2003 if (tx2->mt_spill_pgs) {
2004 j = mdb_midl_search(tx2->mt_spill_pgs, pn);
2005 if (j <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[j] == pn) {
2006 dp->mp_flags |= P_KEEP;
2014 if ((rc = mdb_midl_append(&txn->mt_spill_pgs, pn)))
2018 mdb_midl_sort(txn->mt_spill_pgs);
2020 /* Flush the spilled part of dirty list */
2021 if ((rc = mdb_page_flush(txn, i)) != MDB_SUCCESS)
2024 /* Reset any dirty pages we kept that page_flush didn't see */
2025 rc = mdb_pages_xkeep(m0, P_DIRTY|P_KEEP, i);
2028 txn->mt_flags |= rc ? MDB_TXN_ERROR : MDB_TXN_SPILLS;
2032 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
2034 mdb_find_oldest(MDB_txn *txn)
2037 txnid_t mr, oldest = txn->mt_txnid - 1;
2038 if (txn->mt_env->me_txns) {
2039 MDB_reader *r = txn->mt_env->me_txns->mti_readers;
2040 for (i = txn->mt_env->me_txns->mti_numreaders; --i >= 0; ) {
2051 /** Add a page to the txn's dirty list */
2053 mdb_page_dirty(MDB_txn *txn, MDB_page *mp)
2056 int rc, (*insert)(MDB_ID2L, MDB_ID2 *);
2058 if (txn->mt_flags & MDB_TXN_WRITEMAP) {
2059 insert = mdb_mid2l_append;
2061 insert = mdb_mid2l_insert;
2063 mid.mid = mp->mp_pgno;
2065 rc = insert(txn->mt_u.dirty_list, &mid);
2066 mdb_tassert(txn, rc == 0);
2067 txn->mt_dirty_room--;
2070 /** Allocate page numbers and memory for writing. Maintain me_pglast,
2071 * me_pghead and mt_next_pgno.
2073 * If there are free pages available from older transactions, they
2074 * are re-used first. Otherwise allocate a new page at mt_next_pgno.
2075 * Do not modify the freedB, just merge freeDB records into me_pghead[]
2076 * and move me_pglast to say which records were consumed. Only this
2077 * function can create me_pghead and move me_pglast/mt_next_pgno.
2078 * @param[in] mc cursor A cursor handle identifying the transaction and
2079 * database for which we are allocating.
2080 * @param[in] num the number of pages to allocate.
2081 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
2082 * will always be satisfied by a single contiguous chunk of memory.
2083 * @return 0 on success, non-zero on failure.
2086 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
2088 #ifdef MDB_PARANOID /* Seems like we can ignore this now */
2089 /* Get at most <Max_retries> more freeDB records once me_pghead
2090 * has enough pages. If not enough, use new pages from the map.
2091 * If <Paranoid> and mc is updating the freeDB, only get new
2092 * records if me_pghead is empty. Then the freelist cannot play
2093 * catch-up with itself by growing while trying to save it.
2095 enum { Paranoid = 1, Max_retries = 500 };
2097 enum { Paranoid = 0, Max_retries = INT_MAX /*infinite*/ };
2099 int rc, retry = num * 60;
2100 MDB_txn *txn = mc->mc_txn;
2101 MDB_env *env = txn->mt_env;
2102 pgno_t pgno, *mop = env->me_pghead;
2103 unsigned i, j, mop_len = mop ? mop[0] : 0, n2 = num-1;
2105 txnid_t oldest = 0, last;
2110 /* If there are any loose pages, just use them */
2111 if (num == 1 && txn->mt_loose_pgs) {
2112 np = txn->mt_loose_pgs;
2113 txn->mt_loose_pgs = NEXT_LOOSE_PAGE(np);
2114 txn->mt_loose_count--;
2115 DPRINTF(("db %d use loose page %"Z"u", DDBI(mc),
2123 /* If our dirty list is already full, we can't do anything */
2124 if (txn->mt_dirty_room == 0) {
2129 for (op = MDB_FIRST;; op = MDB_NEXT) {
2134 /* Seek a big enough contiguous page range. Prefer
2135 * pages at the tail, just truncating the list.
2141 if (mop[i-n2] == pgno+n2)
2148 if (op == MDB_FIRST) { /* 1st iteration */
2149 /* Prepare to fetch more and coalesce */
2150 last = env->me_pglast;
2151 oldest = env->me_pgoldest;
2152 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
2155 key.mv_data = &last; /* will look up last+1 */
2156 key.mv_size = sizeof(last);
2158 if (Paranoid && mc->mc_dbi == FREE_DBI)
2161 if (Paranoid && retry < 0 && mop_len)
2165 /* Do not fetch more if the record will be too recent */
2166 if (oldest <= last) {
2168 oldest = mdb_find_oldest(txn);
2169 env->me_pgoldest = oldest;
2175 rc = mdb_cursor_get(&m2, &key, NULL, op);
2177 if (rc == MDB_NOTFOUND)
2181 last = *(txnid_t*)key.mv_data;
2182 if (oldest <= last) {
2184 oldest = mdb_find_oldest(txn);
2185 env->me_pgoldest = oldest;
2191 np = m2.mc_pg[m2.mc_top];
2192 leaf = NODEPTR(np, m2.mc_ki[m2.mc_top]);
2193 if ((rc = mdb_node_read(txn, leaf, &data)) != MDB_SUCCESS)
2196 idl = (MDB_ID *) data.mv_data;
2199 if (!(env->me_pghead = mop = mdb_midl_alloc(i))) {
2204 if ((rc = mdb_midl_need(&env->me_pghead, i)) != 0)
2206 mop = env->me_pghead;
2208 env->me_pglast = last;
2210 DPRINTF(("IDL read txn %"Z"u root %"Z"u num %u",
2211 last, txn->mt_dbs[FREE_DBI].md_root, i));
2213 DPRINTF(("IDL %"Z"u", idl[j]));
2215 /* Merge in descending sorted order */
2216 mdb_midl_xmerge(mop, idl);
2220 /* Use new pages from the map when nothing suitable in the freeDB */
2222 pgno = txn->mt_next_pgno;
2223 if (pgno + num >= env->me_maxpg) {
2224 DPUTS("DB size maxed out");
2230 if (env->me_flags & MDB_WRITEMAP) {
2231 np = (MDB_page *)(env->me_map + env->me_psize * pgno);
2233 if (!(np = mdb_page_malloc(txn, num))) {
2239 mop[0] = mop_len -= num;
2240 /* Move any stragglers down */
2241 for (j = i-num; j < mop_len; )
2242 mop[++j] = mop[++i];
2244 txn->mt_next_pgno = pgno + num;
2247 mdb_page_dirty(txn, np);
2253 txn->mt_flags |= MDB_TXN_ERROR;
2257 /** Copy the used portions of a non-overflow page.
2258 * @param[in] dst page to copy into
2259 * @param[in] src page to copy from
2260 * @param[in] psize size of a page
2263 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
2265 enum { Align = sizeof(pgno_t) };
2266 indx_t upper = src->mp_upper, lower = src->mp_lower, unused = upper-lower;
2268 /* If page isn't full, just copy the used portion. Adjust
2269 * alignment so memcpy may copy words instead of bytes.
2271 if ((unused &= -Align) && !IS_LEAF2(src)) {
2272 upper = (upper + PAGEBASE) & -Align;
2273 memcpy(dst, src, (lower + PAGEBASE + (Align-1)) & -Align);
2274 memcpy((pgno_t *)((char *)dst+upper), (pgno_t *)((char *)src+upper),
2277 memcpy(dst, src, psize - unused);
2281 /** Pull a page off the txn's spill list, if present.
2282 * If a page being referenced was spilled to disk in this txn, bring
2283 * it back and make it dirty/writable again.
2284 * @param[in] txn the transaction handle.
2285 * @param[in] mp the page being referenced. It must not be dirty.
2286 * @param[out] ret the writable page, if any. ret is unchanged if
2287 * mp wasn't spilled.
2290 mdb_page_unspill(MDB_txn *txn, MDB_page *mp, MDB_page **ret)
2292 MDB_env *env = txn->mt_env;
2295 pgno_t pgno = mp->mp_pgno, pn = pgno << 1;
2297 for (tx2 = txn; tx2; tx2=tx2->mt_parent) {
2298 if (!tx2->mt_spill_pgs)
2300 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
2301 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
2304 if (txn->mt_dirty_room == 0)
2305 return MDB_TXN_FULL;
2306 if (IS_OVERFLOW(mp))
2310 if (env->me_flags & MDB_WRITEMAP) {
2313 np = mdb_page_malloc(txn, num);
2317 memcpy(np, mp, num * env->me_psize);
2319 mdb_page_copy(np, mp, env->me_psize);
2322 /* If in current txn, this page is no longer spilled.
2323 * If it happens to be the last page, truncate the spill list.
2324 * Otherwise mark it as deleted by setting the LSB.
2326 if (x == txn->mt_spill_pgs[0])
2327 txn->mt_spill_pgs[0]--;
2329 txn->mt_spill_pgs[x] |= 1;
2330 } /* otherwise, if belonging to a parent txn, the
2331 * page remains spilled until child commits
2334 mdb_page_dirty(txn, np);
2335 np->mp_flags |= P_DIRTY;
2343 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
2344 * @param[in] mc cursor pointing to the page to be touched
2345 * @return 0 on success, non-zero on failure.
2348 mdb_page_touch(MDB_cursor *mc)
2350 MDB_page *mp = mc->mc_pg[mc->mc_top], *np;
2351 MDB_txn *txn = mc->mc_txn;
2352 MDB_cursor *m2, *m3;
2356 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
2357 if (txn->mt_flags & MDB_TXN_SPILLS) {
2359 rc = mdb_page_unspill(txn, mp, &np);
2365 if ((rc = mdb_midl_need(&txn->mt_free_pgs, 1)) ||
2366 (rc = mdb_page_alloc(mc, 1, &np)))
2369 DPRINTF(("touched db %d page %"Z"u -> %"Z"u", DDBI(mc),
2370 mp->mp_pgno, pgno));
2371 mdb_cassert(mc, mp->mp_pgno != pgno);
2372 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
2373 /* Update the parent page, if any, to point to the new page */
2375 MDB_page *parent = mc->mc_pg[mc->mc_top-1];
2376 MDB_node *node = NODEPTR(parent, mc->mc_ki[mc->mc_top-1]);
2377 SETPGNO(node, pgno);
2379 mc->mc_db->md_root = pgno;
2381 } else if (txn->mt_parent && !IS_SUBP(mp)) {
2382 MDB_ID2 mid, *dl = txn->mt_u.dirty_list;
2384 /* If txn has a parent, make sure the page is in our
2388 unsigned x = mdb_mid2l_search(dl, pgno);
2389 if (x <= dl[0].mid && dl[x].mid == pgno) {
2390 if (mp != dl[x].mptr) { /* bad cursor? */
2391 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
2392 txn->mt_flags |= MDB_TXN_ERROR;
2393 return MDB_CORRUPTED;
2398 mdb_cassert(mc, dl[0].mid < MDB_IDL_UM_MAX);
2400 np = mdb_page_malloc(txn, 1);
2405 rc = mdb_mid2l_insert(dl, &mid);
2406 mdb_cassert(mc, rc == 0);
2411 mdb_page_copy(np, mp, txn->mt_env->me_psize);
2413 np->mp_flags |= P_DIRTY;
2416 /* Adjust cursors pointing to mp */
2417 mc->mc_pg[mc->mc_top] = np;
2418 m2 = txn->mt_cursors[mc->mc_dbi];
2419 if (mc->mc_flags & C_SUB) {
2420 for (; m2; m2=m2->mc_next) {
2421 m3 = &m2->mc_xcursor->mx_cursor;
2422 if (m3->mc_snum < mc->mc_snum) continue;
2423 if (m3->mc_pg[mc->mc_top] == mp)
2424 m3->mc_pg[mc->mc_top] = np;
2427 for (; m2; m2=m2->mc_next) {
2428 if (m2->mc_snum < mc->mc_snum) continue;
2429 if (m2 == mc) continue;
2430 if (m2->mc_pg[mc->mc_top] == mp) {
2431 m2->mc_pg[mc->mc_top] = np;
2432 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
2434 (m2->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
2436 MDB_node *leaf = NODEPTR(np, m2->mc_ki[mc->mc_top]);
2437 if ((leaf->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
2438 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
2446 txn->mt_flags |= MDB_TXN_ERROR;
2451 mdb_env_sync(MDB_env *env, int force)
2454 if (env->me_flags & MDB_RDONLY)
2456 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
2457 if (env->me_flags & MDB_WRITEMAP) {
2458 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
2459 ? MS_ASYNC : MS_SYNC;
2460 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
2463 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
2467 #ifdef BROKEN_FDATASYNC
2468 if (env->me_flags & MDB_FSYNCONLY) {
2469 if (fsync(env->me_fd))
2473 if (MDB_FDATASYNC(env->me_fd))
2480 /** Back up parent txn's cursors, then grab the originals for tracking */
2482 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
2484 MDB_cursor *mc, *bk;
2489 for (i = src->mt_numdbs; --i >= 0; ) {
2490 if ((mc = src->mt_cursors[i]) != NULL) {
2491 size = sizeof(MDB_cursor);
2493 size += sizeof(MDB_xcursor);
2494 for (; mc; mc = bk->mc_next) {
2500 mc->mc_db = &dst->mt_dbs[i];
2501 /* Kill pointers into src to reduce abuse: The
2502 * user may not use mc until dst ends. But we need a valid
2503 * txn pointer here for cursor fixups to keep working.
2506 mc->mc_dbflag = &dst->mt_dbflags[i];
2507 if ((mx = mc->mc_xcursor) != NULL) {
2508 *(MDB_xcursor *)(bk+1) = *mx;
2509 mx->mx_cursor.mc_txn = dst;
2511 mc->mc_next = dst->mt_cursors[i];
2512 dst->mt_cursors[i] = mc;
2519 /** Close this write txn's cursors, give parent txn's cursors back to parent.
2520 * @param[in] txn the transaction handle.
2521 * @param[in] merge true to keep changes to parent cursors, false to revert.
2522 * @return 0 on success, non-zero on failure.
2525 mdb_cursors_close(MDB_txn *txn, unsigned merge)
2527 MDB_cursor **cursors = txn->mt_cursors, *mc, *next, *bk;
2531 for (i = txn->mt_numdbs; --i >= 0; ) {
2532 for (mc = cursors[i]; mc; mc = next) {
2534 if ((bk = mc->mc_backup) != NULL) {
2536 /* Commit changes to parent txn */
2537 mc->mc_next = bk->mc_next;
2538 mc->mc_backup = bk->mc_backup;
2539 mc->mc_txn = bk->mc_txn;
2540 mc->mc_db = bk->mc_db;
2541 mc->mc_dbflag = bk->mc_dbflag;
2542 if ((mx = mc->mc_xcursor) != NULL)
2543 mx->mx_cursor.mc_txn = bk->mc_txn;
2545 /* Abort nested txn */
2547 if ((mx = mc->mc_xcursor) != NULL)
2548 *mx = *(MDB_xcursor *)(bk+1);
2552 /* Only malloced cursors are permanently tracked. */
2559 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2565 Pidset = F_SETLK, Pidcheck = F_GETLK
2569 /** Set or check a pid lock. Set returns 0 on success.
2570 * Check returns 0 if the process is certainly dead, nonzero if it may
2571 * be alive (the lock exists or an error happened so we do not know).
2573 * On Windows Pidset is a no-op, we merely check for the existence
2574 * of the process with the given pid. On POSIX we use a single byte
2575 * lock on the lockfile, set at an offset equal to the pid.
2578 mdb_reader_pid(MDB_env *env, enum Pidlock_op op, MDB_PID_T pid)
2580 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2583 if (op == Pidcheck) {
2584 h = OpenProcess(env->me_pidquery, FALSE, pid);
2585 /* No documented "no such process" code, but other program use this: */
2587 return ErrCode() != ERROR_INVALID_PARAMETER;
2588 /* A process exists until all handles to it close. Has it exited? */
2589 ret = WaitForSingleObject(h, 0) != 0;
2596 struct flock lock_info;
2597 memset(&lock_info, 0, sizeof(lock_info));
2598 lock_info.l_type = F_WRLCK;
2599 lock_info.l_whence = SEEK_SET;
2600 lock_info.l_start = pid;
2601 lock_info.l_len = 1;
2602 if ((rc = fcntl(env->me_lfd, op, &lock_info)) == 0) {
2603 if (op == F_GETLK && lock_info.l_type != F_UNLCK)
2605 } else if ((rc = ErrCode()) == EINTR) {
2613 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
2614 * @param[in] txn the transaction handle to initialize
2615 * @return 0 on success, non-zero on failure.
2618 mdb_txn_renew0(MDB_txn *txn)
2620 MDB_env *env = txn->mt_env;
2621 MDB_txninfo *ti = env->me_txns;
2623 unsigned int i, nr, flags = txn->mt_flags;
2625 int rc, new_notls = 0;
2627 if ((flags &= MDB_TXN_RDONLY) != 0) {
2629 meta = mdb_env_pick_meta(env);
2630 txn->mt_txnid = meta->mm_txnid;
2631 txn->mt_u.reader = NULL;
2633 MDB_reader *r = (env->me_flags & MDB_NOTLS) ? txn->mt_u.reader :
2634 pthread_getspecific(env->me_txkey);
2636 if (r->mr_pid != env->me_pid || r->mr_txnid != (txnid_t)-1)
2637 return MDB_BAD_RSLOT;
2639 MDB_PID_T pid = env->me_pid;
2640 MDB_THR_T tid = pthread_self();
2641 mdb_mutexref_t rmutex = env->me_rmutex;
2643 if (!env->me_live_reader) {
2644 rc = mdb_reader_pid(env, Pidset, pid);
2647 env->me_live_reader = 1;
2650 if (LOCK_MUTEX(rc, env, rmutex))
2652 nr = ti->mti_numreaders;
2653 for (i=0; i<nr; i++)
2654 if (ti->mti_readers[i].mr_pid == 0)
2656 if (i == env->me_maxreaders) {
2657 UNLOCK_MUTEX(rmutex);
2658 return MDB_READERS_FULL;
2660 r = &ti->mti_readers[i];
2661 /* Claim the reader slot, carefully since other code
2662 * uses the reader table un-mutexed: First reset the
2663 * slot, next publish it in mti_numreaders. After
2664 * that, it is safe for mdb_env_close() to touch it.
2665 * When it will be closed, we can finally claim it.
2668 r->mr_txnid = (txnid_t)-1;
2671 ti->mti_numreaders = ++nr;
2672 env->me_close_readers = nr;
2674 UNLOCK_MUTEX(rmutex);
2676 new_notls = (env->me_flags & MDB_NOTLS);
2677 if (!new_notls && (rc=pthread_setspecific(env->me_txkey, r))) {
2682 do /* LY: Retry on a race, ITS#7970. */
2683 r->mr_txnid = ti->mti_txnid;
2684 while(r->mr_txnid != ti->mti_txnid);
2685 txn->mt_txnid = r->mr_txnid;
2686 txn->mt_u.reader = r;
2687 meta = env->me_metas[txn->mt_txnid & 1];
2691 /* Not yet touching txn == env->me_txn0, it may be active */
2693 if (LOCK_MUTEX(rc, env, env->me_wmutex))
2695 txn->mt_txnid = ti->mti_txnid;
2696 meta = env->me_metas[txn->mt_txnid & 1];
2698 meta = mdb_env_pick_meta(env);
2699 txn->mt_txnid = meta->mm_txnid;
2703 if (txn->mt_txnid == mdb_debug_start)
2706 txn->mt_child = NULL;
2707 txn->mt_loose_pgs = NULL;
2708 txn->mt_loose_count = 0;
2709 txn->mt_dirty_room = MDB_IDL_UM_MAX;
2710 txn->mt_u.dirty_list = env->me_dirty_list;
2711 txn->mt_u.dirty_list[0].mid = 0;
2712 txn->mt_free_pgs = env->me_free_pgs;
2713 txn->mt_free_pgs[0] = 0;
2714 txn->mt_spill_pgs = NULL;
2716 memcpy(txn->mt_dbiseqs, env->me_dbiseqs, env->me_maxdbs * sizeof(unsigned int));
2719 /* Copy the DB info and flags */
2720 memcpy(txn->mt_dbs, meta->mm_dbs, CORE_DBS * sizeof(MDB_db));
2722 /* Moved to here to avoid a data race in read TXNs */
2723 txn->mt_next_pgno = meta->mm_last_pg+1;
2725 txn->mt_flags = flags;
2728 txn->mt_numdbs = env->me_numdbs;
2729 for (i=CORE_DBS; i<txn->mt_numdbs; i++) {
2730 x = env->me_dbflags[i];
2731 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
2732 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_USRVALID|DB_STALE : 0;
2734 txn->mt_dbflags[MAIN_DBI] = DB_VALID|DB_USRVALID;
2735 txn->mt_dbflags[FREE_DBI] = DB_VALID;
2737 if (env->me_flags & MDB_FATAL_ERROR) {
2738 DPUTS("environment had fatal error, must shutdown!");
2740 } else if (env->me_maxpg < txn->mt_next_pgno) {
2741 rc = MDB_MAP_RESIZED;
2745 mdb_txn_end(txn, new_notls /*0 or MDB_END_SLOT*/ | MDB_END_FAIL_BEGIN);
2750 mdb_txn_renew(MDB_txn *txn)
2754 if (!txn || !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY|MDB_TXN_FINISHED))
2757 rc = mdb_txn_renew0(txn);
2758 if (rc == MDB_SUCCESS) {
2759 DPRINTF(("renew txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2760 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2761 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root));
2767 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
2771 int rc, size, tsize;
2773 flags &= MDB_TXN_BEGIN_FLAGS;
2774 flags |= env->me_flags & MDB_WRITEMAP;
2776 if (env->me_flags & MDB_RDONLY & ~flags) /* write txn in RDONLY env */
2780 /* Nested transactions: Max 1 child, write txns only, no writemap */
2781 flags |= parent->mt_flags;
2782 if (flags & (MDB_RDONLY|MDB_WRITEMAP|MDB_TXN_BLOCKED)) {
2783 return (parent->mt_flags & MDB_TXN_RDONLY) ? EINVAL : MDB_BAD_TXN;
2785 /* Child txns save MDB_pgstate and use own copy of cursors */
2786 size = env->me_maxdbs * (sizeof(MDB_db)+sizeof(MDB_cursor *)+1);
2787 size += tsize = sizeof(MDB_ntxn);
2788 } else if (flags & MDB_RDONLY) {
2789 size = env->me_maxdbs * (sizeof(MDB_db)+1);
2790 size += tsize = sizeof(MDB_txn);
2792 /* Reuse preallocated write txn. However, do not touch it until
2793 * mdb_txn_renew0() succeeds, since it currently may be active.
2798 if ((txn = calloc(1, size)) == NULL) {
2799 DPRINTF(("calloc: %s", strerror(errno)));
2802 txn->mt_dbxs = env->me_dbxs; /* static */
2803 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
2804 txn->mt_dbflags = (unsigned char *)txn + size - env->me_maxdbs;
2805 txn->mt_flags = flags;
2810 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
2811 txn->mt_dbiseqs = parent->mt_dbiseqs;
2812 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
2813 if (!txn->mt_u.dirty_list ||
2814 !(txn->mt_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)))
2816 free(txn->mt_u.dirty_list);
2820 txn->mt_txnid = parent->mt_txnid;
2821 txn->mt_dirty_room = parent->mt_dirty_room;
2822 txn->mt_u.dirty_list[0].mid = 0;
2823 txn->mt_spill_pgs = NULL;
2824 txn->mt_next_pgno = parent->mt_next_pgno;
2825 parent->mt_flags |= MDB_TXN_HAS_CHILD;
2826 parent->mt_child = txn;
2827 txn->mt_parent = parent;
2828 txn->mt_numdbs = parent->mt_numdbs;
2829 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2830 /* Copy parent's mt_dbflags, but clear DB_NEW */
2831 for (i=0; i<txn->mt_numdbs; i++)
2832 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
2834 ntxn = (MDB_ntxn *)txn;
2835 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
2836 if (env->me_pghead) {
2837 size = MDB_IDL_SIZEOF(env->me_pghead);
2838 env->me_pghead = mdb_midl_alloc(env->me_pghead[0]);
2840 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
2845 rc = mdb_cursor_shadow(parent, txn);
2847 mdb_txn_end(txn, MDB_END_FAIL_BEGINCHILD);
2848 } else { /* MDB_RDONLY */
2849 txn->mt_dbiseqs = env->me_dbiseqs;
2851 rc = mdb_txn_renew0(txn);
2854 if (txn != env->me_txn0)
2857 txn->mt_flags |= flags; /* could not change txn=me_txn0 earlier */
2859 DPRINTF(("begin txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2860 txn->mt_txnid, (flags & MDB_RDONLY) ? 'r' : 'w',
2861 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root));
2868 mdb_txn_env(MDB_txn *txn)
2870 if(!txn) return NULL;
2875 mdb_txn_id(MDB_txn *txn)
2878 return txn->mt_txnid;
2881 /** Export or close DBI handles opened in this txn. */
2883 mdb_dbis_update(MDB_txn *txn, int keep)
2886 MDB_dbi n = txn->mt_numdbs;
2887 MDB_env *env = txn->mt_env;
2888 unsigned char *tdbflags = txn->mt_dbflags;
2890 for (i = n; --i >= CORE_DBS;) {
2891 if (tdbflags[i] & DB_NEW) {
2893 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2895 char *ptr = env->me_dbxs[i].md_name.mv_data;
2897 env->me_dbxs[i].md_name.mv_data = NULL;
2898 env->me_dbxs[i].md_name.mv_size = 0;
2899 env->me_dbflags[i] = 0;
2900 env->me_dbiseqs[i]++;
2906 if (keep && env->me_numdbs < n)
2910 /** End a transaction, except successful commit of a nested transaction.
2911 * May be called twice for readonly txns: First reset it, then abort.
2912 * @param[in] txn the transaction handle to end
2913 * @param[in] mode why and how to end the transaction
2916 mdb_txn_end(MDB_txn *txn, unsigned mode)
2918 MDB_env *env = txn->mt_env;
2920 static const char *const names[] = MDB_END_NAMES;
2923 /* Export or close DBI handles opened in this txn */
2924 mdb_dbis_update(txn, mode & MDB_END_UPDATE);
2926 DPRINTF(("%s txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2927 names[mode & MDB_END_OPMASK],
2928 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2929 (void *) txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root));
2931 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2932 if (txn->mt_u.reader) {
2933 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
2934 if (!(env->me_flags & MDB_NOTLS)) {
2935 txn->mt_u.reader = NULL; /* txn does not own reader */
2936 } else if (mode & MDB_END_SLOT) {
2937 txn->mt_u.reader->mr_pid = 0;
2938 txn->mt_u.reader = NULL;
2939 } /* else txn owns the slot until it does MDB_END_SLOT */
2941 txn->mt_numdbs = 0; /* prevent further DBI activity */
2942 txn->mt_flags |= MDB_TXN_FINISHED;
2944 } else if (!F_ISSET(txn->mt_flags, MDB_TXN_FINISHED)) {
2945 pgno_t *pghead = env->me_pghead;
2947 if (!(mode & MDB_END_UPDATE)) /* !(already closed cursors) */
2948 mdb_cursors_close(txn, 0);
2949 if (!(env->me_flags & MDB_WRITEMAP)) {
2950 mdb_dlist_free(txn);
2954 txn->mt_flags = MDB_TXN_FINISHED;
2956 if (!txn->mt_parent) {
2957 mdb_midl_shrink(&txn->mt_free_pgs);
2958 env->me_free_pgs = txn->mt_free_pgs;
2960 env->me_pghead = NULL;
2964 mode = 0; /* txn == env->me_txn0, do not free() it */
2966 /* The writer mutex was locked in mdb_txn_begin. */
2968 UNLOCK_MUTEX(env->me_wmutex);
2970 txn->mt_parent->mt_child = NULL;
2971 txn->mt_parent->mt_flags &= ~MDB_TXN_HAS_CHILD;
2972 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2973 mdb_midl_free(txn->mt_free_pgs);
2974 mdb_midl_free(txn->mt_spill_pgs);
2975 free(txn->mt_u.dirty_list);
2978 mdb_midl_free(pghead);
2981 if (mode & MDB_END_FREE)
2986 mdb_txn_reset(MDB_txn *txn)
2991 /* This call is only valid for read-only txns */
2992 if (!(txn->mt_flags & MDB_TXN_RDONLY))
2995 mdb_txn_end(txn, MDB_END_RESET);
2999 mdb_txn_abort(MDB_txn *txn)
3005 mdb_txn_abort(txn->mt_child);
3007 mdb_txn_end(txn, MDB_END_ABORT|MDB_END_SLOT|MDB_END_FREE);
3010 /** Save the freelist as of this transaction to the freeDB.
3011 * This changes the freelist. Keep trying until it stabilizes.
3014 mdb_freelist_save(MDB_txn *txn)
3016 /* env->me_pghead[] can grow and shrink during this call.
3017 * env->me_pglast and txn->mt_free_pgs[] can only grow.
3018 * Page numbers cannot disappear from txn->mt_free_pgs[].
3021 MDB_env *env = txn->mt_env;
3022 int rc, maxfree_1pg = env->me_maxfree_1pg, more = 1;
3023 txnid_t pglast = 0, head_id = 0;
3024 pgno_t freecnt = 0, *free_pgs, *mop;
3025 ssize_t head_room = 0, total_room = 0, mop_len, clean_limit;
3027 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
3029 if (env->me_pghead) {
3030 /* Make sure first page of freeDB is touched and on freelist */
3031 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST|MDB_PS_MODIFY);
3032 if (rc && rc != MDB_NOTFOUND)
3036 if (!env->me_pghead && txn->mt_loose_pgs) {
3037 /* Put loose page numbers in mt_free_pgs, since
3038 * we may be unable to return them to me_pghead.
3040 MDB_page *mp = txn->mt_loose_pgs;
3041 if ((rc = mdb_midl_need(&txn->mt_free_pgs, txn->mt_loose_count)) != 0)
3043 for (; mp; mp = NEXT_LOOSE_PAGE(mp))
3044 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
3045 txn->mt_loose_pgs = NULL;
3046 txn->mt_loose_count = 0;
3049 /* MDB_RESERVE cancels meminit in ovpage malloc (when no WRITEMAP) */
3050 clean_limit = (env->me_flags & (MDB_NOMEMINIT|MDB_WRITEMAP))
3051 ? SSIZE_MAX : maxfree_1pg;
3054 /* Come back here after each Put() in case freelist changed */
3059 /* If using records from freeDB which we have not yet
3060 * deleted, delete them and any we reserved for me_pghead.
3062 while (pglast < env->me_pglast) {
3063 rc = mdb_cursor_first(&mc, &key, NULL);
3066 pglast = head_id = *(txnid_t *)key.mv_data;
3067 total_room = head_room = 0;
3068 mdb_tassert(txn, pglast <= env->me_pglast);
3069 rc = mdb_cursor_del(&mc, 0);
3074 /* Save the IDL of pages freed by this txn, to a single record */
3075 if (freecnt < txn->mt_free_pgs[0]) {
3077 /* Make sure last page of freeDB is touched and on freelist */
3078 rc = mdb_page_search(&mc, NULL, MDB_PS_LAST|MDB_PS_MODIFY);
3079 if (rc && rc != MDB_NOTFOUND)
3082 free_pgs = txn->mt_free_pgs;
3083 /* Write to last page of freeDB */
3084 key.mv_size = sizeof(txn->mt_txnid);
3085 key.mv_data = &txn->mt_txnid;
3087 freecnt = free_pgs[0];
3088 data.mv_size = MDB_IDL_SIZEOF(free_pgs);
3089 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
3092 /* Retry if mt_free_pgs[] grew during the Put() */
3093 free_pgs = txn->mt_free_pgs;
3094 } while (freecnt < free_pgs[0]);
3095 mdb_midl_sort(free_pgs);
3096 memcpy(data.mv_data, free_pgs, data.mv_size);
3099 unsigned int i = free_pgs[0];
3100 DPRINTF(("IDL write txn %"Z"u root %"Z"u num %u",
3101 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, i));
3103 DPRINTF(("IDL %"Z"u", free_pgs[i]));
3109 mop = env->me_pghead;
3110 mop_len = (mop ? mop[0] : 0) + txn->mt_loose_count;
3112 /* Reserve records for me_pghead[]. Split it if multi-page,
3113 * to avoid searching freeDB for a page range. Use keys in
3114 * range [1,me_pglast]: Smaller than txnid of oldest reader.
3116 if (total_room >= mop_len) {
3117 if (total_room == mop_len || --more < 0)
3119 } else if (head_room >= maxfree_1pg && head_id > 1) {
3120 /* Keep current record (overflow page), add a new one */
3124 /* (Re)write {key = head_id, IDL length = head_room} */
3125 total_room -= head_room;
3126 head_room = mop_len - total_room;
3127 if (head_room > maxfree_1pg && head_id > 1) {
3128 /* Overflow multi-page for part of me_pghead */
3129 head_room /= head_id; /* amortize page sizes */
3130 head_room += maxfree_1pg - head_room % (maxfree_1pg + 1);
3131 } else if (head_room < 0) {
3132 /* Rare case, not bothering to delete this record */
3135 key.mv_size = sizeof(head_id);
3136 key.mv_data = &head_id;
3137 data.mv_size = (head_room + 1) * sizeof(pgno_t);
3138 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
3141 /* IDL is initially empty, zero out at least the length */
3142 pgs = (pgno_t *)data.mv_data;
3143 j = head_room > clean_limit ? head_room : 0;
3147 total_room += head_room;
3150 /* Return loose page numbers to me_pghead, though usually none are
3151 * left at this point. The pages themselves remain in dirty_list.
3153 if (txn->mt_loose_pgs) {
3154 MDB_page *mp = txn->mt_loose_pgs;
3155 unsigned count = txn->mt_loose_count;
3157 /* Room for loose pages + temp IDL with same */
3158 if ((rc = mdb_midl_need(&env->me_pghead, 2*count+1)) != 0)
3160 mop = env->me_pghead;
3161 loose = mop + MDB_IDL_ALLOCLEN(mop) - count;
3162 for (count = 0; mp; mp = NEXT_LOOSE_PAGE(mp))
3163 loose[ ++count ] = mp->mp_pgno;
3165 mdb_midl_sort(loose);
3166 mdb_midl_xmerge(mop, loose);
3167 txn->mt_loose_pgs = NULL;
3168 txn->mt_loose_count = 0;
3172 /* Fill in the reserved me_pghead records */
3178 rc = mdb_cursor_first(&mc, &key, &data);
3179 for (; !rc; rc = mdb_cursor_next(&mc, &key, &data, MDB_NEXT)) {
3180 txnid_t id = *(txnid_t *)key.mv_data;
3181 ssize_t len = (ssize_t)(data.mv_size / sizeof(MDB_ID)) - 1;
3184 mdb_tassert(txn, len >= 0 && id <= env->me_pglast);
3186 if (len > mop_len) {
3188 data.mv_size = (len + 1) * sizeof(MDB_ID);
3190 data.mv_data = mop -= len;
3193 rc = mdb_cursor_put(&mc, &key, &data, MDB_CURRENT);
3195 if (rc || !(mop_len -= len))
3202 /** Flush (some) dirty pages to the map, after clearing their dirty flag.
3203 * @param[in] txn the transaction that's being committed
3204 * @param[in] keep number of initial pages in dirty_list to keep dirty.
3205 * @return 0 on success, non-zero on failure.
3208 mdb_page_flush(MDB_txn *txn, int keep)
3210 MDB_env *env = txn->mt_env;
3211 MDB_ID2L dl = txn->mt_u.dirty_list;
3212 unsigned psize = env->me_psize, j;
3213 int i, pagecount = dl[0].mid, rc;
3214 size_t size = 0, pos = 0;
3216 MDB_page *dp = NULL;
3220 struct iovec iov[MDB_COMMIT_PAGES];
3221 ssize_t wpos = 0, wsize = 0, wres;
3222 size_t next_pos = 1; /* impossible pos, so pos != next_pos */
3228 if (env->me_flags & MDB_WRITEMAP) {
3229 /* Clear dirty flags */
3230 while (++i <= pagecount) {
3232 /* Don't flush this page yet */
3233 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3234 dp->mp_flags &= ~P_KEEP;
3238 dp->mp_flags &= ~P_DIRTY;
3243 /* Write the pages */
3245 if (++i <= pagecount) {
3247 /* Don't flush this page yet */
3248 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3249 dp->mp_flags &= ~P_KEEP;
3254 /* clear dirty flag */
3255 dp->mp_flags &= ~P_DIRTY;
3258 if (IS_OVERFLOW(dp)) size *= dp->mp_pages;
3263 /* Windows actually supports scatter/gather I/O, but only on
3264 * unbuffered file handles. Since we're relying on the OS page
3265 * cache for all our data, that's self-defeating. So we just
3266 * write pages one at a time. We use the ov structure to set
3267 * the write offset, to at least save the overhead of a Seek
3270 DPRINTF(("committing page %"Z"u", pgno));
3271 memset(&ov, 0, sizeof(ov));
3272 ov.Offset = pos & 0xffffffff;
3273 ov.OffsetHigh = pos >> 16 >> 16;
3274 if (!WriteFile(env->me_fd, dp, size, NULL, &ov)) {
3276 DPRINTF(("WriteFile: %d", rc));
3280 /* Write up to MDB_COMMIT_PAGES dirty pages at a time. */
3281 if (pos!=next_pos || n==MDB_COMMIT_PAGES || wsize+size>MAX_WRITE) {
3284 /* Write previous page(s) */
3285 #ifdef MDB_USE_PWRITEV
3286 wres = pwritev(env->me_fd, iov, n, wpos);
3289 wres = pwrite(env->me_fd, iov[0].iov_base, wsize, wpos);
3292 if (lseek(env->me_fd, wpos, SEEK_SET) == -1) {
3296 DPRINTF(("lseek: %s", strerror(rc)));
3299 wres = writev(env->me_fd, iov, n);
3302 if (wres != wsize) {
3307 DPRINTF(("Write error: %s", strerror(rc)));
3309 rc = EIO; /* TODO: Use which error code? */
3310 DPUTS("short write, filesystem full?");
3321 DPRINTF(("committing page %"Z"u", pgno));
3322 next_pos = pos + size;
3323 iov[n].iov_len = size;
3324 iov[n].iov_base = (char *)dp;
3330 /* MIPS has cache coherency issues, this is a no-op everywhere else
3331 * Note: for any size >= on-chip cache size, entire on-chip cache is
3334 CACHEFLUSH(env->me_map, txn->mt_next_pgno * env->me_psize, DCACHE);
3336 for (i = keep; ++i <= pagecount; ) {
3338 /* This is a page we skipped above */
3341 dl[j].mid = dp->mp_pgno;
3344 mdb_dpage_free(env, dp);
3349 txn->mt_dirty_room += i - j;
3355 mdb_txn_commit(MDB_txn *txn)
3358 unsigned int i, end_mode;
3364 /* mdb_txn_end() mode for a commit which writes nothing */
3365 end_mode = MDB_END_EMPTY_COMMIT|MDB_END_UPDATE|MDB_END_SLOT|MDB_END_FREE;
3367 if (txn->mt_child) {
3368 rc = mdb_txn_commit(txn->mt_child);
3375 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
3379 if (txn->mt_flags & (MDB_TXN_FINISHED|MDB_TXN_ERROR)) {
3380 DPUTS("txn has failed/finished, can't commit");
3382 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
3387 if (txn->mt_parent) {
3388 MDB_txn *parent = txn->mt_parent;
3392 unsigned x, y, len, ps_len;
3394 /* Append our free list to parent's */
3395 rc = mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs);
3398 mdb_midl_free(txn->mt_free_pgs);
3399 /* Failures after this must either undo the changes
3400 * to the parent or set MDB_TXN_ERROR in the parent.
3403 parent->mt_next_pgno = txn->mt_next_pgno;
3404 parent->mt_flags = txn->mt_flags;
3406 /* Merge our cursors into parent's and close them */
3407 mdb_cursors_close(txn, 1);
3409 /* Update parent's DB table. */
3410 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
3411 parent->mt_numdbs = txn->mt_numdbs;
3412 parent->mt_dbflags[FREE_DBI] = txn->mt_dbflags[FREE_DBI];
3413 parent->mt_dbflags[MAIN_DBI] = txn->mt_dbflags[MAIN_DBI];
3414 for (i=CORE_DBS; i<txn->mt_numdbs; i++) {
3415 /* preserve parent's DB_NEW status */
3416 x = parent->mt_dbflags[i] & DB_NEW;
3417 parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
3420 dst = parent->mt_u.dirty_list;
3421 src = txn->mt_u.dirty_list;
3422 /* Remove anything in our dirty list from parent's spill list */
3423 if ((pspill = parent->mt_spill_pgs) && (ps_len = pspill[0])) {
3425 pspill[0] = (pgno_t)-1;
3426 /* Mark our dirty pages as deleted in parent spill list */
3427 for (i=0, len=src[0].mid; ++i <= len; ) {
3428 MDB_ID pn = src[i].mid << 1;
3429 while (pn > pspill[x])
3431 if (pn == pspill[x]) {
3436 /* Squash deleted pagenums if we deleted any */
3437 for (x=y; ++x <= ps_len; )
3438 if (!(pspill[x] & 1))
3439 pspill[++y] = pspill[x];
3443 /* Remove anything in our spill list from parent's dirty list */
3444 if (txn->mt_spill_pgs && txn->mt_spill_pgs[0]) {
3445 for (i=1; i<=txn->mt_spill_pgs[0]; i++) {
3446 MDB_ID pn = txn->mt_spill_pgs[i];
3448 continue; /* deleted spillpg */
3450 y = mdb_mid2l_search(dst, pn);
3451 if (y <= dst[0].mid && dst[y].mid == pn) {
3453 while (y < dst[0].mid) {
3462 /* Find len = length of merging our dirty list with parent's */
3464 dst[0].mid = 0; /* simplify loops */
3465 if (parent->mt_parent) {
3466 len = x + src[0].mid;
3467 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
3468 for (i = x; y && i; y--) {
3469 pgno_t yp = src[y].mid;
3470 while (yp < dst[i].mid)
3472 if (yp == dst[i].mid) {
3477 } else { /* Simplify the above for single-ancestor case */
3478 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
3480 /* Merge our dirty list with parent's */
3482 for (i = len; y; dst[i--] = src[y--]) {
3483 pgno_t yp = src[y].mid;
3484 while (yp < dst[x].mid)
3485 dst[i--] = dst[x--];
3486 if (yp == dst[x].mid)
3487 free(dst[x--].mptr);
3489 mdb_tassert(txn, i == x);
3491 free(txn->mt_u.dirty_list);
3492 parent->mt_dirty_room = txn->mt_dirty_room;
3493 if (txn->mt_spill_pgs) {
3494 if (parent->mt_spill_pgs) {
3495 /* TODO: Prevent failure here, so parent does not fail */
3496 rc = mdb_midl_append_list(&parent->mt_spill_pgs, txn->mt_spill_pgs);
3498 parent->mt_flags |= MDB_TXN_ERROR;
3499 mdb_midl_free(txn->mt_spill_pgs);
3500 mdb_midl_sort(parent->mt_spill_pgs);
3502 parent->mt_spill_pgs = txn->mt_spill_pgs;
3506 /* Append our loose page list to parent's */
3507 for (lp = &parent->mt_loose_pgs; *lp; lp = &NEXT_LOOSE_PAGE(*lp))
3509 *lp = txn->mt_loose_pgs;
3510 parent->mt_loose_count += txn->mt_loose_count;
3512 parent->mt_child = NULL;
3513 mdb_midl_free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pghead);
3518 if (txn != env->me_txn) {
3519 DPUTS("attempt to commit unknown transaction");
3524 mdb_cursors_close(txn, 0);
3526 if (!txn->mt_u.dirty_list[0].mid &&
3527 !(txn->mt_flags & (MDB_TXN_DIRTY|MDB_TXN_SPILLS)))
3530 DPRINTF(("committing txn %"Z"u %p on mdbenv %p, root page %"Z"u",
3531 txn->mt_txnid, (void*)txn, (void*)env, txn->mt_dbs[MAIN_DBI].md_root));
3533 /* Update DB root pointers */
3534 if (txn->mt_numdbs > CORE_DBS) {
3538 data.mv_size = sizeof(MDB_db);
3540 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
3541 for (i = CORE_DBS; i < txn->mt_numdbs; i++) {
3542 if (txn->mt_dbflags[i] & DB_DIRTY) {
3543 if (TXN_DBI_CHANGED(txn, i)) {
3547 data.mv_data = &txn->mt_dbs[i];
3548 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data,
3556 rc = mdb_freelist_save(txn);
3560 mdb_midl_free(env->me_pghead);
3561 env->me_pghead = NULL;
3562 mdb_midl_shrink(&txn->mt_free_pgs);
3568 if ((rc = mdb_page_flush(txn, 0)) ||
3569 (rc = mdb_env_sync(env, 0)) ||
3570 (rc = mdb_env_write_meta(txn)))
3572 end_mode = MDB_END_COMMITTED|MDB_END_UPDATE;
3575 mdb_txn_end(txn, end_mode);
3583 /** Read the environment parameters of a DB environment before
3584 * mapping it into memory.
3585 * @param[in] env the environment handle
3586 * @param[out] meta address of where to store the meta information
3587 * @return 0 on success, non-zero on failure.
3590 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
3596 enum { Size = sizeof(pbuf) };
3598 /* We don't know the page size yet, so use a minimum value.
3599 * Read both meta pages so we can use the latest one.
3602 for (i=off=0; i<NUM_METAS; i++, off += meta->mm_psize) {
3606 memset(&ov, 0, sizeof(ov));
3608 rc = ReadFile(env->me_fd, &pbuf, Size, &len, &ov) ? (int)len : -1;
3609 if (rc == -1 && ErrCode() == ERROR_HANDLE_EOF)
3612 rc = pread(env->me_fd, &pbuf, Size, off);
3615 if (rc == 0 && off == 0)
3617 rc = rc < 0 ? (int) ErrCode() : MDB_INVALID;
3618 DPRINTF(("read: %s", mdb_strerror(rc)));
3622 p = (MDB_page *)&pbuf;
3624 if (!F_ISSET(p->mp_flags, P_META)) {
3625 DPRINTF(("page %"Z"u not a meta page", p->mp_pgno));
3630 if (m->mm_magic != MDB_MAGIC) {
3631 DPUTS("meta has invalid magic");
3635 if (m->mm_version != MDB_DATA_VERSION) {
3636 DPRINTF(("database is version %u, expected version %u",
3637 m->mm_version, MDB_DATA_VERSION));
3638 return MDB_VERSION_MISMATCH;
3641 if (off == 0 || m->mm_txnid > meta->mm_txnid)
3647 /** Fill in most of the zeroed #MDB_meta for an empty database environment */
3649 mdb_env_init_meta0(MDB_env *env, MDB_meta *meta)
3651 meta->mm_magic = MDB_MAGIC;
3652 meta->mm_version = MDB_DATA_VERSION;
3653 meta->mm_mapsize = env->me_mapsize;
3654 meta->mm_psize = env->me_psize;
3655 meta->mm_last_pg = NUM_METAS-1;
3656 meta->mm_flags = env->me_flags & 0xffff;
3657 meta->mm_flags |= MDB_INTEGERKEY; /* this is mm_dbs[FREE_DBI].md_flags */
3658 meta->mm_dbs[FREE_DBI].md_root = P_INVALID;
3659 meta->mm_dbs[MAIN_DBI].md_root = P_INVALID;
3662 /** Write the environment parameters of a freshly created DB environment.
3663 * @param[in] env the environment handle
3664 * @param[in] meta the #MDB_meta to write
3665 * @return 0 on success, non-zero on failure.
3668 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
3676 memset(&ov, 0, sizeof(ov));
3677 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3679 rc = WriteFile(fd, ptr, size, &len, &ov); } while(0)
3682 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3683 len = pwrite(fd, ptr, size, pos); \
3684 if (len == -1 && ErrCode() == EINTR) continue; \
3685 rc = (len >= 0); break; } while(1)
3688 DPUTS("writing new meta page");
3690 psize = env->me_psize;
3692 p = calloc(NUM_METAS, psize);
3697 p->mp_flags = P_META;
3698 *(MDB_meta *)METADATA(p) = *meta;
3700 q = (MDB_page *)((char *)p + psize);
3702 q->mp_flags = P_META;
3703 *(MDB_meta *)METADATA(q) = *meta;
3705 DO_PWRITE(rc, env->me_fd, p, psize * NUM_METAS, len, 0);
3708 else if ((unsigned) len == psize * NUM_METAS)
3716 /** Update the environment info to commit a transaction.
3717 * @param[in] txn the transaction that's being committed
3718 * @return 0 on success, non-zero on failure.
3721 mdb_env_write_meta(MDB_txn *txn)
3724 MDB_meta meta, metab, *mp;
3728 int rc, len, toggle;
3737 toggle = txn->mt_txnid & 1;
3738 DPRINTF(("writing meta page %d for root page %"Z"u",
3739 toggle, txn->mt_dbs[MAIN_DBI].md_root));
3742 flags = env->me_flags;
3743 mp = env->me_metas[toggle];
3744 mapsize = env->me_metas[toggle ^ 1]->mm_mapsize;
3745 /* Persist any increases of mapsize config */
3746 if (mapsize < env->me_mapsize)
3747 mapsize = env->me_mapsize;
3749 if (flags & MDB_WRITEMAP) {
3750 mp->mm_mapsize = mapsize;
3751 mp->mm_dbs[FREE_DBI] = txn->mt_dbs[FREE_DBI];
3752 mp->mm_dbs[MAIN_DBI] = txn->mt_dbs[MAIN_DBI];
3753 mp->mm_last_pg = txn->mt_next_pgno - 1;
3754 #if (__GNUC__ * 100 + __GNUC_MINOR__ >= 404) && /* TODO: portability */ \
3755 !(defined(__i386__) || defined(__x86_64__))
3756 /* LY: issue a memory barrier, if not x86. ITS#7969 */
3757 __sync_synchronize();
3759 mp->mm_txnid = txn->mt_txnid;
3760 if (!(flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
3761 unsigned meta_size = env->me_psize;
3762 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
3763 ptr = (char *)mp - PAGEHDRSZ;
3764 #ifndef _WIN32 /* POSIX msync() requires ptr = start of OS page */
3765 r2 = (ptr - env->me_map) & (env->me_os_psize - 1);
3769 if (MDB_MSYNC(ptr, meta_size, rc)) {
3776 metab.mm_txnid = mp->mm_txnid;
3777 metab.mm_last_pg = mp->mm_last_pg;
3779 meta.mm_mapsize = mapsize;
3780 meta.mm_dbs[FREE_DBI] = txn->mt_dbs[FREE_DBI];
3781 meta.mm_dbs[MAIN_DBI] = txn->mt_dbs[MAIN_DBI];
3782 meta.mm_last_pg = txn->mt_next_pgno - 1;
3783 meta.mm_txnid = txn->mt_txnid;
3785 off = offsetof(MDB_meta, mm_mapsize);
3786 ptr = (char *)&meta + off;
3787 len = sizeof(MDB_meta) - off;
3788 off += (char *)mp - env->me_map;
3790 /* Write to the SYNC fd */
3791 mfd = (flags & (MDB_NOSYNC|MDB_NOMETASYNC)) ? env->me_fd : env->me_mfd;
3794 memset(&ov, 0, sizeof(ov));
3796 if (!WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov))
3801 rc = pwrite(mfd, ptr, len, off);
3804 rc = rc < 0 ? ErrCode() : EIO;
3809 DPUTS("write failed, disk error?");
3810 /* On a failure, the pagecache still contains the new data.
3811 * Write some old data back, to prevent it from being used.
3812 * Use the non-SYNC fd; we know it will fail anyway.
3814 meta.mm_last_pg = metab.mm_last_pg;
3815 meta.mm_txnid = metab.mm_txnid;
3817 memset(&ov, 0, sizeof(ov));
3819 WriteFile(env->me_fd, ptr, len, NULL, &ov);
3821 r2 = pwrite(env->me_fd, ptr, len, off);
3822 (void)r2; /* Silence warnings. We don't care about pwrite's return value */
3825 env->me_flags |= MDB_FATAL_ERROR;
3828 /* MIPS has cache coherency issues, this is a no-op everywhere else */
3829 CACHEFLUSH(env->me_map + off, len, DCACHE);
3831 /* Memory ordering issues are irrelevant; since the entire writer
3832 * is wrapped by wmutex, all of these changes will become visible
3833 * after the wmutex is unlocked. Since the DB is multi-version,
3834 * readers will get consistent data regardless of how fresh or
3835 * how stale their view of these values is.
3838 env->me_txns->mti_txnid = txn->mt_txnid;
3843 /** Check both meta pages to see which one is newer.
3844 * @param[in] env the environment handle
3845 * @return newest #MDB_meta.
3848 mdb_env_pick_meta(const MDB_env *env)
3850 MDB_meta *const *metas = env->me_metas;
3851 return metas[ metas[0]->mm_txnid < metas[1]->mm_txnid ];
3855 mdb_env_create(MDB_env **env)
3859 e = calloc(1, sizeof(MDB_env));
3863 e->me_maxreaders = DEFAULT_READERS;
3864 e->me_maxdbs = e->me_numdbs = CORE_DBS;
3865 e->me_fd = INVALID_HANDLE_VALUE;
3866 e->me_lfd = INVALID_HANDLE_VALUE;
3867 e->me_mfd = INVALID_HANDLE_VALUE;
3868 #ifdef MDB_USE_POSIX_SEM
3869 e->me_rmutex = SEM_FAILED;
3870 e->me_wmutex = SEM_FAILED;
3872 e->me_pid = getpid();
3873 GET_PAGESIZE(e->me_os_psize);
3874 VGMEMP_CREATE(e,0,0);
3880 mdb_env_map(MDB_env *env, void *addr)
3883 unsigned int flags = env->me_flags;
3887 LONG sizelo, sizehi;
3890 if (flags & MDB_RDONLY) {
3891 /* Don't set explicit map size, use whatever exists */
3896 msize = env->me_mapsize;
3897 sizelo = msize & 0xffffffff;
3898 sizehi = msize >> 16 >> 16; /* only needed on Win64 */
3900 /* Windows won't create mappings for zero length files.
3901 * and won't map more than the file size.
3902 * Just set the maxsize right now.
3904 if (SetFilePointer(env->me_fd, sizelo, &sizehi, 0) != (DWORD)sizelo
3905 || !SetEndOfFile(env->me_fd)
3906 || SetFilePointer(env->me_fd, 0, NULL, 0) != 0)
3910 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
3911 PAGE_READWRITE : PAGE_READONLY,
3912 sizehi, sizelo, NULL);
3915 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
3916 FILE_MAP_WRITE : FILE_MAP_READ,
3918 rc = env->me_map ? 0 : ErrCode();
3923 int prot = PROT_READ;
3924 if (flags & MDB_WRITEMAP) {
3926 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
3929 env->me_map = mmap(addr, env->me_mapsize, prot, MAP_SHARED,
3931 if (env->me_map == MAP_FAILED) {
3936 if (flags & MDB_NORDAHEAD) {
3937 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
3939 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
3941 #ifdef POSIX_MADV_RANDOM
3942 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
3943 #endif /* POSIX_MADV_RANDOM */
3944 #endif /* MADV_RANDOM */
3948 /* Can happen because the address argument to mmap() is just a
3949 * hint. mmap() can pick another, e.g. if the range is in use.
3950 * The MAP_FIXED flag would prevent that, but then mmap could
3951 * instead unmap existing pages to make room for the new map.
3953 if (addr && env->me_map != addr)
3954 return EBUSY; /* TODO: Make a new MDB_* error code? */
3956 p = (MDB_page *)env->me_map;
3957 env->me_metas[0] = METADATA(p);
3958 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + env->me_psize);
3964 mdb_env_set_mapsize(MDB_env *env, size_t size)
3966 /* If env is already open, caller is responsible for making
3967 * sure there are no active txns.
3975 meta = mdb_env_pick_meta(env);
3977 size = meta->mm_mapsize;
3979 /* Silently round up to minimum if the size is too small */
3980 size_t minsize = (meta->mm_last_pg + 1) * env->me_psize;
3984 munmap(env->me_map, env->me_mapsize);
3985 env->me_mapsize = size;
3986 old = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : NULL;
3987 rc = mdb_env_map(env, old);
3991 env->me_mapsize = size;
3993 env->me_maxpg = env->me_mapsize / env->me_psize;
3998 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
4002 env->me_maxdbs = dbs + CORE_DBS;
4007 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
4009 if (env->me_map || readers < 1)
4011 env->me_maxreaders = readers;
4016 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
4018 if (!env || !readers)
4020 *readers = env->me_maxreaders;
4025 mdb_fsize(HANDLE fd, size_t *size)
4028 LARGE_INTEGER fsize;
4030 if (!GetFileSizeEx(fd, &fsize))
4033 *size = fsize.QuadPart;
4045 #ifdef BROKEN_FDATASYNC
4046 #include <sys/utsname.h>
4047 #include <sys/vfs.h>
4050 /** Further setup required for opening an LMDB environment
4053 mdb_env_open2(MDB_env *env)
4055 unsigned int flags = env->me_flags;
4056 int i, newenv = 0, rc;
4060 /* See if we should use QueryLimited */
4062 if ((rc & 0xff) > 5)
4063 env->me_pidquery = MDB_PROCESS_QUERY_LIMITED_INFORMATION;
4065 env->me_pidquery = PROCESS_QUERY_INFORMATION;
4068 #ifdef BROKEN_FDATASYNC
4069 /* ext3/ext4 fdatasync is broken on some older Linux kernels.
4070 * https://lkml.org/lkml/2012/9/3/83
4071 * Kernels after 3.6-rc6 are known good.
4072 * https://lkml.org/lkml/2012/9/10/556
4073 * See if the DB is on ext3/ext4, then check for new enough kernel
4074 * Kernels 2.6.32.60, 2.6.34.15, 3.2.30, and 3.5.4 are also known
4079 fstatfs(env->me_fd, &st);
4080 while (st.f_type == 0xEF53) {
4084 if (uts.release[0] < '3') {
4085 if (!strncmp(uts.release, "2.6.32.", 7)) {
4086 i = atoi(uts.release+7);
4088 break; /* 2.6.32.60 and newer is OK */
4089 } else if (!strncmp(uts.release, "2.6.34.", 7)) {
4090 i = atoi(uts.release+7);
4092 break; /* 2.6.34.15 and newer is OK */
4094 } else if (uts.release[0] == '3') {
4095 i = atoi(uts.release+2);
4097 break; /* 3.6 and newer is OK */
4099 i = atoi(uts.release+4);
4101 break; /* 3.5.4 and newer is OK */
4102 } else if (i == 2) {
4103 i = atoi(uts.release+4);
4105 break; /* 3.2.30 and newer is OK */
4107 } else { /* 4.x and newer is OK */
4110 env->me_flags |= MDB_FSYNCONLY;
4116 if ((i = mdb_env_read_header(env, &meta)) != 0) {
4119 DPUTS("new mdbenv");
4121 env->me_psize = env->me_os_psize;
4122 if (env->me_psize > MAX_PAGESIZE)
4123 env->me_psize = MAX_PAGESIZE;
4124 memset(&meta, 0, sizeof(meta));
4125 mdb_env_init_meta0(env, &meta);
4126 meta.mm_mapsize = DEFAULT_MAPSIZE;
4128 env->me_psize = meta.mm_psize;
4131 /* Was a mapsize configured? */
4132 if (!env->me_mapsize) {
4133 env->me_mapsize = meta.mm_mapsize;
4136 /* Make sure mapsize >= committed data size. Even when using
4137 * mm_mapsize, which could be broken in old files (ITS#7789).
4139 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
4140 if (env->me_mapsize < minsize)
4141 env->me_mapsize = minsize;
4143 meta.mm_mapsize = env->me_mapsize;
4145 if (newenv && !(flags & MDB_FIXEDMAP)) {
4146 /* mdb_env_map() may grow the datafile. Write the metapages
4147 * first, so the file will be valid if initialization fails.
4148 * Except with FIXEDMAP, since we do not yet know mm_address.
4149 * We could fill in mm_address later, but then a different
4150 * program might end up doing that - one with a memory layout
4151 * and map address which does not suit the main program.
4153 rc = mdb_env_init_meta(env, &meta);
4159 rc = mdb_env_map(env, (flags & MDB_FIXEDMAP) ? meta.mm_address : NULL);
4164 if (flags & MDB_FIXEDMAP)
4165 meta.mm_address = env->me_map;
4166 i = mdb_env_init_meta(env, &meta);
4167 if (i != MDB_SUCCESS) {
4172 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
4173 env->me_nodemax = (((env->me_psize - PAGEHDRSZ) / MDB_MINKEYS) & -2)
4175 #if !(MDB_MAXKEYSIZE)
4176 env->me_maxkey = env->me_nodemax - (NODESIZE + sizeof(MDB_db));
4178 env->me_maxpg = env->me_mapsize / env->me_psize;
4182 MDB_meta *meta = mdb_env_pick_meta(env);
4183 MDB_db *db = &meta->mm_dbs[MAIN_DBI];
4185 DPRINTF(("opened database version %u, pagesize %u",
4186 meta->mm_version, env->me_psize));
4187 DPRINTF(("using meta page %d", (int) (meta->mm_txnid & 1)));
4188 DPRINTF(("depth: %u", db->md_depth));
4189 DPRINTF(("entries: %"Z"u", db->md_entries));
4190 DPRINTF(("branch pages: %"Z"u", db->md_branch_pages));
4191 DPRINTF(("leaf pages: %"Z"u", db->md_leaf_pages));
4192 DPRINTF(("overflow pages: %"Z"u", db->md_overflow_pages));
4193 DPRINTF(("root: %"Z"u", db->md_root));
4201 /** Release a reader thread's slot in the reader lock table.
4202 * This function is called automatically when a thread exits.
4203 * @param[in] ptr This points to the slot in the reader lock table.
4206 mdb_env_reader_dest(void *ptr)
4208 MDB_reader *reader = ptr;
4214 /** Junk for arranging thread-specific callbacks on Windows. This is
4215 * necessarily platform and compiler-specific. Windows supports up
4216 * to 1088 keys. Let's assume nobody opens more than 64 environments
4217 * in a single process, for now. They can override this if needed.
4219 #ifndef MAX_TLS_KEYS
4220 #define MAX_TLS_KEYS 64
4222 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
4223 static int mdb_tls_nkeys;
4225 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
4229 case DLL_PROCESS_ATTACH: break;
4230 case DLL_THREAD_ATTACH: break;
4231 case DLL_THREAD_DETACH:
4232 for (i=0; i<mdb_tls_nkeys; i++) {
4233 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
4235 mdb_env_reader_dest(r);
4239 case DLL_PROCESS_DETACH: break;
4244 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
4246 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
4250 /* Force some symbol references.
4251 * _tls_used forces the linker to create the TLS directory if not already done
4252 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
4254 #pragma comment(linker, "/INCLUDE:_tls_used")
4255 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
4256 #pragma const_seg(".CRT$XLB")
4257 extern const PIMAGE_TLS_CALLBACK mdb_tls_cbp;
4258 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
4261 #pragma comment(linker, "/INCLUDE:__tls_used")
4262 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
4263 #pragma data_seg(".CRT$XLB")
4264 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
4266 #endif /* WIN 32/64 */
4267 #endif /* !__GNUC__ */
4270 /** Downgrade the exclusive lock on the region back to shared */
4272 mdb_env_share_locks(MDB_env *env, int *excl)
4275 MDB_meta *meta = mdb_env_pick_meta(env);
4277 env->me_txns->mti_txnid = meta->mm_txnid;
4282 /* First acquire a shared lock. The Unlock will
4283 * then release the existing exclusive lock.
4285 memset(&ov, 0, sizeof(ov));
4286 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
4289 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4295 struct flock lock_info;
4296 /* The shared lock replaces the existing lock */
4297 memset((void *)&lock_info, 0, sizeof(lock_info));
4298 lock_info.l_type = F_RDLCK;
4299 lock_info.l_whence = SEEK_SET;
4300 lock_info.l_start = 0;
4301 lock_info.l_len = 1;
4302 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
4303 (rc = ErrCode()) == EINTR) ;
4304 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
4311 /** Try to get exclusive lock, otherwise shared.
4312 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
4315 mdb_env_excl_lock(MDB_env *env, int *excl)
4319 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
4323 memset(&ov, 0, sizeof(ov));
4324 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
4331 struct flock lock_info;
4332 memset((void *)&lock_info, 0, sizeof(lock_info));
4333 lock_info.l_type = F_WRLCK;
4334 lock_info.l_whence = SEEK_SET;
4335 lock_info.l_start = 0;
4336 lock_info.l_len = 1;
4337 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
4338 (rc = ErrCode()) == EINTR) ;
4342 # ifndef MDB_USE_POSIX_MUTEX
4343 if (*excl < 0) /* always true when MDB_USE_POSIX_MUTEX */
4346 lock_info.l_type = F_RDLCK;
4347 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
4348 (rc = ErrCode()) == EINTR) ;
4358 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
4360 * @(#) $Revision: 5.1 $
4361 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
4362 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
4364 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
4368 * Please do not copyright this code. This code is in the public domain.
4370 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
4371 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
4372 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
4373 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
4374 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
4375 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
4376 * PERFORMANCE OF THIS SOFTWARE.
4379 * chongo <Landon Curt Noll> /\oo/\
4380 * http://www.isthe.com/chongo/
4382 * Share and Enjoy! :-)
4385 typedef unsigned long long mdb_hash_t;
4386 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
4388 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
4389 * @param[in] val value to hash
4390 * @param[in] hval initial value for hash
4391 * @return 64 bit hash
4393 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
4394 * hval arg on the first call.
4397 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
4399 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
4400 unsigned char *end = s + val->mv_size;
4402 * FNV-1a hash each octet of the string
4405 /* xor the bottom with the current octet */
4406 hval ^= (mdb_hash_t)*s++;
4408 /* multiply by the 64 bit FNV magic prime mod 2^64 */
4409 hval += (hval << 1) + (hval << 4) + (hval << 5) +
4410 (hval << 7) + (hval << 8) + (hval << 40);
4412 /* return our new hash value */
4416 /** Hash the string and output the encoded hash.
4417 * This uses modified RFC1924 Ascii85 encoding to accommodate systems with
4418 * very short name limits. We don't care about the encoding being reversible,
4419 * we just want to preserve as many bits of the input as possible in a
4420 * small printable string.
4421 * @param[in] str string to hash
4422 * @param[out] encbuf an array of 11 chars to hold the hash
4424 static const char mdb_a85[]= "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~";
4427 mdb_pack85(unsigned long l, char *out)
4431 for (i=0; i<5; i++) {
4432 *out++ = mdb_a85[l % 85];
4438 mdb_hash_enc(MDB_val *val, char *encbuf)
4440 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
4442 mdb_pack85(h, encbuf);
4443 mdb_pack85(h>>32, encbuf+5);
4448 /** Open and/or initialize the lock region for the environment.
4449 * @param[in] env The LMDB environment.
4450 * @param[in] lpath The pathname of the file used for the lock region.
4451 * @param[in] mode The Unix permissions for the file, if we create it.
4452 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
4453 * @return 0 on success, non-zero on failure.
4456 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
4459 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
4461 # define MDB_ERRCODE_ROFS EROFS
4462 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
4463 # define MDB_CLOEXEC O_CLOEXEC
4466 # define MDB_CLOEXEC 0
4474 rc = utf8_to_utf16(lpath, -1, &wlpath, NULL);
4477 env->me_lfd = CreateFileW(wlpath, GENERIC_READ|GENERIC_WRITE,
4478 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
4479 FILE_ATTRIBUTE_NORMAL, NULL);
4482 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
4484 if (env->me_lfd == INVALID_HANDLE_VALUE) {
4486 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
4491 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
4492 /* Lose record locks when exec*() */
4493 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
4494 fcntl(env->me_lfd, F_SETFD, fdflags);
4497 if (!(env->me_flags & MDB_NOTLS)) {
4498 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
4501 env->me_flags |= MDB_ENV_TXKEY;
4503 /* Windows TLS callbacks need help finding their TLS info. */
4504 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
4508 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
4512 /* Try to get exclusive lock. If we succeed, then
4513 * nobody is using the lock region and we should initialize it.
4515 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
4518 size = GetFileSize(env->me_lfd, NULL);
4520 size = lseek(env->me_lfd, 0, SEEK_END);
4521 if (size == -1) goto fail_errno;
4523 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
4524 if (size < rsize && *excl > 0) {
4526 if (SetFilePointer(env->me_lfd, rsize, NULL, FILE_BEGIN) != (DWORD)rsize
4527 || !SetEndOfFile(env->me_lfd))
4530 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
4534 size = rsize - sizeof(MDB_txninfo);
4535 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
4540 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
4542 if (!mh) goto fail_errno;
4543 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
4545 if (!env->me_txns) goto fail_errno;
4547 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
4549 if (m == MAP_FAILED) goto fail_errno;
4555 BY_HANDLE_FILE_INFORMATION stbuf;
4564 if (!mdb_sec_inited) {
4565 InitializeSecurityDescriptor(&mdb_null_sd,
4566 SECURITY_DESCRIPTOR_REVISION);
4567 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
4568 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
4569 mdb_all_sa.bInheritHandle = FALSE;
4570 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
4573 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
4574 idbuf.volume = stbuf.dwVolumeSerialNumber;
4575 idbuf.nhigh = stbuf.nFileIndexHigh;
4576 idbuf.nlow = stbuf.nFileIndexLow;
4577 val.mv_data = &idbuf;
4578 val.mv_size = sizeof(idbuf);
4579 mdb_hash_enc(&val, encbuf);
4580 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", encbuf);
4581 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", encbuf);
4582 env->me_rmutex = CreateMutexA(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
4583 if (!env->me_rmutex) goto fail_errno;
4584 env->me_wmutex = CreateMutexA(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
4585 if (!env->me_wmutex) goto fail_errno;
4586 #elif defined(MDB_USE_POSIX_SEM)
4595 #if defined(__NetBSD__)
4596 #define MDB_SHORT_SEMNAMES 1 /* limited to 14 chars */
4598 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
4599 idbuf.dev = stbuf.st_dev;
4600 idbuf.ino = stbuf.st_ino;
4601 val.mv_data = &idbuf;
4602 val.mv_size = sizeof(idbuf);
4603 mdb_hash_enc(&val, encbuf);
4604 #ifdef MDB_SHORT_SEMNAMES
4605 encbuf[9] = '\0'; /* drop name from 15 chars to 14 chars */
4607 sprintf(env->me_txns->mti_rmname, "/MDBr%s", encbuf);
4608 sprintf(env->me_txns->mti_wmname, "/MDBw%s", encbuf);
4609 /* Clean up after a previous run, if needed: Try to
4610 * remove both semaphores before doing anything else.
4612 sem_unlink(env->me_txns->mti_rmname);
4613 sem_unlink(env->me_txns->mti_wmname);
4614 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
4615 O_CREAT|O_EXCL, mode, 1);
4616 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4617 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
4618 O_CREAT|O_EXCL, mode, 1);
4619 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4620 #else /* MDB_USE_POSIX_MUTEX: */
4621 pthread_mutexattr_t mattr;
4623 if ((rc = pthread_mutexattr_init(&mattr))
4624 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
4625 #ifdef MDB_ROBUST_SUPPORTED
4626 || (rc = pthread_mutexattr_setrobust(&mattr, PTHREAD_MUTEX_ROBUST))
4628 || (rc = pthread_mutex_init(env->me_txns->mti_rmutex, &mattr))
4629 || (rc = pthread_mutex_init(env->me_txns->mti_wmutex, &mattr)))
4631 pthread_mutexattr_destroy(&mattr);
4632 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
4634 env->me_txns->mti_magic = MDB_MAGIC;
4635 env->me_txns->mti_format = MDB_LOCK_FORMAT;
4636 env->me_txns->mti_txnid = 0;
4637 env->me_txns->mti_numreaders = 0;
4640 if (env->me_txns->mti_magic != MDB_MAGIC) {
4641 DPUTS("lock region has invalid magic");
4645 if (env->me_txns->mti_format != MDB_LOCK_FORMAT) {
4646 DPRINTF(("lock region has format+version 0x%x, expected 0x%x",
4647 env->me_txns->mti_format, MDB_LOCK_FORMAT));
4648 rc = MDB_VERSION_MISMATCH;
4652 if (rc && rc != EACCES && rc != EAGAIN) {
4656 env->me_rmutex = OpenMutexA(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
4657 if (!env->me_rmutex) goto fail_errno;
4658 env->me_wmutex = OpenMutexA(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
4659 if (!env->me_wmutex) goto fail_errno;
4660 #elif defined(MDB_USE_POSIX_SEM)
4661 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
4662 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4663 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
4664 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4675 /** The name of the lock file in the DB environment */
4676 #define LOCKNAME "/lock.mdb"
4677 /** The name of the data file in the DB environment */
4678 #define DATANAME "/data.mdb"
4679 /** The suffix of the lock file when no subdir is used */
4680 #define LOCKSUFF "-lock"
4681 /** Only a subset of the @ref mdb_env flags can be changed
4682 * at runtime. Changing other flags requires closing the
4683 * environment and re-opening it with the new flags.
4685 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC|MDB_NOMEMINIT)
4686 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY| \
4687 MDB_WRITEMAP|MDB_NOTLS|MDB_NOLOCK|MDB_NORDAHEAD)
4689 #if VALID_FLAGS & PERSISTENT_FLAGS & (CHANGEABLE|CHANGELESS)
4690 # error "Persistent DB flags & env flags overlap, but both go in mm_flags"
4694 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
4696 int oflags, rc, len, excl = -1;
4697 char *lpath, *dpath;
4702 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
4706 if (flags & MDB_NOSUBDIR) {
4707 rc = len + sizeof(LOCKSUFF) + len + 1;
4709 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
4714 if (flags & MDB_NOSUBDIR) {
4715 dpath = lpath + len + sizeof(LOCKSUFF);
4716 sprintf(lpath, "%s" LOCKSUFF, path);
4717 strcpy(dpath, path);
4719 dpath = lpath + len + sizeof(LOCKNAME);
4720 sprintf(lpath, "%s" LOCKNAME, path);
4721 sprintf(dpath, "%s" DATANAME, path);
4725 flags |= env->me_flags;
4726 if (flags & MDB_RDONLY) {
4727 /* silently ignore WRITEMAP when we're only getting read access */
4728 flags &= ~MDB_WRITEMAP;
4730 if (!((env->me_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)) &&
4731 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
4734 env->me_flags = flags |= MDB_ENV_ACTIVE;
4738 env->me_path = strdup(path);
4739 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
4740 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
4741 env->me_dbiseqs = calloc(env->me_maxdbs, sizeof(unsigned int));
4742 if (!(env->me_dbxs && env->me_path && env->me_dbflags && env->me_dbiseqs)) {
4746 env->me_dbxs[FREE_DBI].md_cmp = mdb_cmp_long; /* aligned MDB_INTEGERKEY */
4748 /* For RDONLY, get lockfile after we know datafile exists */
4749 if (!(flags & (MDB_RDONLY|MDB_NOLOCK))) {
4750 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4756 if (F_ISSET(flags, MDB_RDONLY)) {
4757 oflags = GENERIC_READ;
4758 len = OPEN_EXISTING;
4760 oflags = GENERIC_READ|GENERIC_WRITE;
4763 mode = FILE_ATTRIBUTE_NORMAL;
4764 rc = utf8_to_utf16(dpath, -1, &wpath, NULL);
4767 env->me_fd = CreateFileW(wpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
4768 NULL, len, mode, NULL);
4771 if (F_ISSET(flags, MDB_RDONLY))
4774 oflags = O_RDWR | O_CREAT;
4776 env->me_fd = open(dpath, oflags, mode);
4778 if (env->me_fd == INVALID_HANDLE_VALUE) {
4783 if ((flags & (MDB_RDONLY|MDB_NOLOCK)) == MDB_RDONLY) {
4784 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4789 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
4790 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
4791 env->me_mfd = env->me_fd;
4793 /* Synchronous fd for meta writes. Needed even with
4794 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
4797 len = OPEN_EXISTING;
4798 rc = utf8_to_utf16(dpath, -1, &wpath, NULL);
4801 env->me_mfd = CreateFileW(wpath, oflags,
4802 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
4803 mode | FILE_FLAG_WRITE_THROUGH, NULL);
4807 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
4809 if (env->me_mfd == INVALID_HANDLE_VALUE) {
4814 DPRINTF(("opened dbenv %p", (void *) env));
4816 rc = mdb_env_share_locks(env, &excl);
4820 if (!(flags & MDB_RDONLY)) {
4822 int tsize = sizeof(MDB_txn), size = tsize + env->me_maxdbs *
4823 (sizeof(MDB_db)+sizeof(MDB_cursor *)+sizeof(unsigned int)+1);
4824 if ((env->me_pbuf = calloc(1, env->me_psize)) &&
4825 (txn = calloc(1, size)))
4827 txn->mt_dbs = (MDB_db *)((char *)txn + tsize);
4828 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
4829 txn->mt_dbiseqs = (unsigned int *)(txn->mt_cursors + env->me_maxdbs);
4830 txn->mt_dbflags = (unsigned char *)(txn->mt_dbiseqs + env->me_maxdbs);
4832 txn->mt_dbxs = env->me_dbxs;
4833 txn->mt_flags = MDB_TXN_FINISHED;
4843 mdb_env_close0(env, excl);
4849 /** Destroy resources from mdb_env_open(), clear our readers & DBIs */
4851 mdb_env_close0(MDB_env *env, int excl)
4855 if (!(env->me_flags & MDB_ENV_ACTIVE))
4858 /* Doing this here since me_dbxs may not exist during mdb_env_close */
4860 for (i = env->me_maxdbs; --i >= CORE_DBS; )
4861 free(env->me_dbxs[i].md_name.mv_data);
4866 free(env->me_dbiseqs);
4867 free(env->me_dbflags);
4869 free(env->me_dirty_list);
4871 mdb_midl_free(env->me_free_pgs);
4873 if (env->me_flags & MDB_ENV_TXKEY) {
4874 pthread_key_delete(env->me_txkey);
4876 /* Delete our key from the global list */
4877 for (i=0; i<mdb_tls_nkeys; i++)
4878 if (mdb_tls_keys[i] == env->me_txkey) {
4879 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
4887 munmap(env->me_map, env->me_mapsize);
4889 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
4890 (void) close(env->me_mfd);
4891 if (env->me_fd != INVALID_HANDLE_VALUE)
4892 (void) close(env->me_fd);
4894 MDB_PID_T pid = env->me_pid;
4895 /* Clearing readers is done in this function because
4896 * me_txkey with its destructor must be disabled first.
4898 * We skip the the reader mutex, so we touch only
4899 * data owned by this process (me_close_readers and
4900 * our readers), and clear each reader atomically.
4902 for (i = env->me_close_readers; --i >= 0; )
4903 if (env->me_txns->mti_readers[i].mr_pid == pid)
4904 env->me_txns->mti_readers[i].mr_pid = 0;
4906 if (env->me_rmutex) {
4907 CloseHandle(env->me_rmutex);
4908 if (env->me_wmutex) CloseHandle(env->me_wmutex);
4910 /* Windows automatically destroys the mutexes when
4911 * the last handle closes.
4913 #elif defined(MDB_USE_POSIX_SEM)
4914 if (env->me_rmutex != SEM_FAILED) {
4915 sem_close(env->me_rmutex);
4916 if (env->me_wmutex != SEM_FAILED)
4917 sem_close(env->me_wmutex);
4918 /* If we have the filelock: If we are the
4919 * only remaining user, clean up semaphores.
4922 mdb_env_excl_lock(env, &excl);
4924 sem_unlink(env->me_txns->mti_rmname);
4925 sem_unlink(env->me_txns->mti_wmname);
4929 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
4931 if (env->me_lfd != INVALID_HANDLE_VALUE) {
4934 /* Unlock the lockfile. Windows would have unlocked it
4935 * after closing anyway, but not necessarily at once.
4937 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4940 (void) close(env->me_lfd);
4943 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
4947 mdb_env_close(MDB_env *env)
4954 VGMEMP_DESTROY(env);
4955 while ((dp = env->me_dpages) != NULL) {
4956 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
4957 env->me_dpages = dp->mp_next;
4961 mdb_env_close0(env, 0);
4965 /** Compare two items pointing at aligned size_t's */
4967 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
4969 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
4970 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
4973 /** Compare two items pointing at aligned unsigned int's.
4975 * This is also set as #MDB_INTEGERDUP|#MDB_DUPFIXED's #MDB_dbx.%md_dcmp,
4976 * but #mdb_cmp_clong() is called instead if the data type is size_t.
4979 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
4981 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
4982 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
4985 /** Compare two items pointing at unsigned ints of unknown alignment.
4986 * Nodes and keys are guaranteed to be 2-byte aligned.
4989 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
4991 #if BYTE_ORDER == LITTLE_ENDIAN
4992 unsigned short *u, *c;
4995 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4996 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
4999 } while(!x && u > (unsigned short *)a->mv_data);
5002 unsigned short *u, *c, *end;
5005 end = (unsigned short *) ((char *) a->mv_data + a->mv_size);
5006 u = (unsigned short *)a->mv_data;
5007 c = (unsigned short *)b->mv_data;
5010 } while(!x && u < end);
5015 /** Compare two items lexically */
5017 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
5024 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
5030 diff = memcmp(a->mv_data, b->mv_data, len);
5031 return diff ? diff : len_diff<0 ? -1 : len_diff;
5034 /** Compare two items in reverse byte order */
5036 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
5038 const unsigned char *p1, *p2, *p1_lim;
5042 p1_lim = (const unsigned char *)a->mv_data;
5043 p1 = (const unsigned char *)a->mv_data + a->mv_size;
5044 p2 = (const unsigned char *)b->mv_data + b->mv_size;
5046 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
5052 while (p1 > p1_lim) {
5053 diff = *--p1 - *--p2;
5057 return len_diff<0 ? -1 : len_diff;
5060 /** Search for key within a page, using binary search.
5061 * Returns the smallest entry larger or equal to the key.
5062 * If exactp is non-null, stores whether the found entry was an exact match
5063 * in *exactp (1 or 0).
5064 * Updates the cursor index with the index of the found entry.
5065 * If no entry larger or equal to the key is found, returns NULL.
5068 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
5070 unsigned int i = 0, nkeys;
5073 MDB_page *mp = mc->mc_pg[mc->mc_top];
5074 MDB_node *node = NULL;
5079 nkeys = NUMKEYS(mp);
5081 DPRINTF(("searching %u keys in %s %spage %"Z"u",
5082 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
5085 low = IS_LEAF(mp) ? 0 : 1;
5087 cmp = mc->mc_dbx->md_cmp;
5089 /* Branch pages have no data, so if using integer keys,
5090 * alignment is guaranteed. Use faster mdb_cmp_int.
5092 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
5093 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
5100 nodekey.mv_size = mc->mc_db->md_pad;
5101 node = NODEPTR(mp, 0); /* fake */
5102 while (low <= high) {
5103 i = (low + high) >> 1;
5104 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
5105 rc = cmp(key, &nodekey);
5106 DPRINTF(("found leaf index %u [%s], rc = %i",
5107 i, DKEY(&nodekey), rc));
5116 while (low <= high) {
5117 i = (low + high) >> 1;
5119 node = NODEPTR(mp, i);
5120 nodekey.mv_size = NODEKSZ(node);
5121 nodekey.mv_data = NODEKEY(node);
5123 rc = cmp(key, &nodekey);
5126 DPRINTF(("found leaf index %u [%s], rc = %i",
5127 i, DKEY(&nodekey), rc));
5129 DPRINTF(("found branch index %u [%s -> %"Z"u], rc = %i",
5130 i, DKEY(&nodekey), NODEPGNO(node), rc));
5141 if (rc > 0) { /* Found entry is less than the key. */
5142 i++; /* Skip to get the smallest entry larger than key. */
5144 node = NODEPTR(mp, i);
5147 *exactp = (rc == 0 && nkeys > 0);
5148 /* store the key index */
5149 mc->mc_ki[mc->mc_top] = i;
5151 /* There is no entry larger or equal to the key. */
5154 /* nodeptr is fake for LEAF2 */
5160 mdb_cursor_adjust(MDB_cursor *mc, func)
5164 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
5165 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
5172 /** Pop a page off the top of the cursor's stack. */
5174 mdb_cursor_pop(MDB_cursor *mc)
5177 DPRINTF(("popping page %"Z"u off db %d cursor %p",
5178 mc->mc_pg[mc->mc_top]->mp_pgno, DDBI(mc), (void *) mc));
5184 mc->mc_flags &= ~C_INITIALIZED;
5189 /** Push a page onto the top of the cursor's stack. */
5191 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
5193 DPRINTF(("pushing page %"Z"u on db %d cursor %p", mp->mp_pgno,
5194 DDBI(mc), (void *) mc));
5196 if (mc->mc_snum >= CURSOR_STACK) {
5197 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5198 return MDB_CURSOR_FULL;
5201 mc->mc_top = mc->mc_snum++;
5202 mc->mc_pg[mc->mc_top] = mp;
5203 mc->mc_ki[mc->mc_top] = 0;
5208 /** Find the address of the page corresponding to a given page number.
5209 * @param[in] txn the transaction for this access.
5210 * @param[in] pgno the page number for the page to retrieve.
5211 * @param[out] ret address of a pointer where the page's address will be stored.
5212 * @param[out] lvl dirty_list inheritance level of found page. 1=current txn, 0=mapped page.
5213 * @return 0 on success, non-zero on failure.
5216 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret, int *lvl)
5218 MDB_env *env = txn->mt_env;
5222 if (! (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_WRITEMAP))) {
5226 MDB_ID2L dl = tx2->mt_u.dirty_list;
5228 /* Spilled pages were dirtied in this txn and flushed
5229 * because the dirty list got full. Bring this page
5230 * back in from the map (but don't unspill it here,
5231 * leave that unless page_touch happens again).
5233 if (tx2->mt_spill_pgs) {
5234 MDB_ID pn = pgno << 1;
5235 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
5236 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
5237 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
5242 unsigned x = mdb_mid2l_search(dl, pgno);
5243 if (x <= dl[0].mid && dl[x].mid == pgno) {
5249 } while ((tx2 = tx2->mt_parent) != NULL);
5252 if (pgno < txn->mt_next_pgno) {
5254 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
5256 DPRINTF(("page %"Z"u not found", pgno));
5257 txn->mt_flags |= MDB_TXN_ERROR;
5258 return MDB_PAGE_NOTFOUND;
5268 /** Finish #mdb_page_search() / #mdb_page_search_lowest().
5269 * The cursor is at the root page, set up the rest of it.
5272 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int flags)
5274 MDB_page *mp = mc->mc_pg[mc->mc_top];
5278 while (IS_BRANCH(mp)) {
5282 DPRINTF(("branch page %"Z"u has %u keys", mp->mp_pgno, NUMKEYS(mp)));
5283 /* Don't assert on branch pages in the FreeDB. We can get here
5284 * while in the process of rebalancing a FreeDB branch page; we must
5285 * let that proceed. ITS#8336
5287 mdb_cassert(mc, !mc->mc_dbi || NUMKEYS(mp) > 1);
5288 DPRINTF(("found index 0 to page %"Z"u", NODEPGNO(NODEPTR(mp, 0))));
5290 if (flags & (MDB_PS_FIRST|MDB_PS_LAST)) {
5292 if (flags & MDB_PS_LAST)
5293 i = NUMKEYS(mp) - 1;
5296 node = mdb_node_search(mc, key, &exact);
5298 i = NUMKEYS(mp) - 1;
5300 i = mc->mc_ki[mc->mc_top];
5302 mdb_cassert(mc, i > 0);
5306 DPRINTF(("following index %u for key [%s]", i, DKEY(key)));
5309 mdb_cassert(mc, i < NUMKEYS(mp));
5310 node = NODEPTR(mp, i);
5312 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
5315 mc->mc_ki[mc->mc_top] = i;
5316 if ((rc = mdb_cursor_push(mc, mp)))
5319 if (flags & MDB_PS_MODIFY) {
5320 if ((rc = mdb_page_touch(mc)) != 0)
5322 mp = mc->mc_pg[mc->mc_top];
5327 DPRINTF(("internal error, index points to a %02X page!?",
5329 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5330 return MDB_CORRUPTED;
5333 DPRINTF(("found leaf page %"Z"u for key [%s]", mp->mp_pgno,
5334 key ? DKEY(key) : "null"));
5335 mc->mc_flags |= C_INITIALIZED;
5336 mc->mc_flags &= ~C_EOF;
5341 /** Search for the lowest key under the current branch page.
5342 * This just bypasses a NUMKEYS check in the current page
5343 * before calling mdb_page_search_root(), because the callers
5344 * are all in situations where the current page is known to
5348 mdb_page_search_lowest(MDB_cursor *mc)
5350 MDB_page *mp = mc->mc_pg[mc->mc_top];
5351 MDB_node *node = NODEPTR(mp, 0);
5354 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
5357 mc->mc_ki[mc->mc_top] = 0;
5358 if ((rc = mdb_cursor_push(mc, mp)))
5360 return mdb_page_search_root(mc, NULL, MDB_PS_FIRST);
5363 /** Search for the page a given key should be in.
5364 * Push it and its parent pages on the cursor stack.
5365 * @param[in,out] mc the cursor for this operation.
5366 * @param[in] key the key to search for, or NULL for first/last page.
5367 * @param[in] flags If MDB_PS_MODIFY is set, visited pages in the DB
5368 * are touched (updated with new page numbers).
5369 * If MDB_PS_FIRST or MDB_PS_LAST is set, find first or last leaf.
5370 * This is used by #mdb_cursor_first() and #mdb_cursor_last().
5371 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
5372 * @return 0 on success, non-zero on failure.
5375 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
5380 /* Make sure the txn is still viable, then find the root from
5381 * the txn's db table and set it as the root of the cursor's stack.
5383 if (mc->mc_txn->mt_flags & MDB_TXN_BLOCKED) {
5384 DPUTS("transaction may not be used now");
5387 /* Make sure we're using an up-to-date root */
5388 if (*mc->mc_dbflag & DB_STALE) {
5390 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
5392 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
5393 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, 0);
5400 MDB_node *leaf = mdb_node_search(&mc2,
5401 &mc->mc_dbx->md_name, &exact);
5403 return MDB_NOTFOUND;
5404 if ((leaf->mn_flags & (F_DUPDATA|F_SUBDATA)) != F_SUBDATA)
5405 return MDB_INCOMPATIBLE; /* not a named DB */
5406 rc = mdb_node_read(mc->mc_txn, leaf, &data);
5409 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
5411 /* The txn may not know this DBI, or another process may
5412 * have dropped and recreated the DB with other flags.
5414 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
5415 return MDB_INCOMPATIBLE;
5416 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
5418 *mc->mc_dbflag &= ~DB_STALE;
5420 root = mc->mc_db->md_root;
5422 if (root == P_INVALID) { /* Tree is empty. */
5423 DPUTS("tree is empty");
5424 return MDB_NOTFOUND;
5428 mdb_cassert(mc, root > 1);
5429 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
5430 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0], NULL)) != 0)
5436 DPRINTF(("db %d root page %"Z"u has flags 0x%X",
5437 DDBI(mc), root, mc->mc_pg[0]->mp_flags));
5439 if (flags & MDB_PS_MODIFY) {
5440 if ((rc = mdb_page_touch(mc)))
5444 if (flags & MDB_PS_ROOTONLY)
5447 return mdb_page_search_root(mc, key, flags);
5451 mdb_ovpage_free(MDB_cursor *mc, MDB_page *mp)
5453 MDB_txn *txn = mc->mc_txn;
5454 pgno_t pg = mp->mp_pgno;
5455 unsigned x = 0, ovpages = mp->mp_pages;
5456 MDB_env *env = txn->mt_env;
5457 MDB_IDL sl = txn->mt_spill_pgs;
5458 MDB_ID pn = pg << 1;
5461 DPRINTF(("free ov page %"Z"u (%d)", pg, ovpages));
5462 /* If the page is dirty or on the spill list we just acquired it,
5463 * so we should give it back to our current free list, if any.
5464 * Otherwise put it onto the list of pages we freed in this txn.
5466 * Won't create me_pghead: me_pglast must be inited along with it.
5467 * Unsupported in nested txns: They would need to hide the page
5468 * range in ancestor txns' dirty and spilled lists.
5470 if (env->me_pghead &&
5472 ((mp->mp_flags & P_DIRTY) ||
5473 (sl && (x = mdb_midl_search(sl, pn)) <= sl[0] && sl[x] == pn)))
5477 MDB_ID2 *dl, ix, iy;
5478 rc = mdb_midl_need(&env->me_pghead, ovpages);
5481 if (!(mp->mp_flags & P_DIRTY)) {
5482 /* This page is no longer spilled */
5489 /* Remove from dirty list */
5490 dl = txn->mt_u.dirty_list;
5492 for (ix = dl[x]; ix.mptr != mp; ix = iy) {
5498 mdb_cassert(mc, x > 1);
5500 dl[j] = ix; /* Unsorted. OK when MDB_TXN_ERROR. */
5501 txn->mt_flags |= MDB_TXN_ERROR;
5502 return MDB_CORRUPTED;
5505 txn->mt_dirty_room++;
5506 if (!(env->me_flags & MDB_WRITEMAP))
5507 mdb_dpage_free(env, mp);
5509 /* Insert in me_pghead */
5510 mop = env->me_pghead;
5511 j = mop[0] + ovpages;
5512 for (i = mop[0]; i && mop[i] < pg; i--)
5518 rc = mdb_midl_append_range(&txn->mt_free_pgs, pg, ovpages);
5522 mc->mc_db->md_overflow_pages -= ovpages;
5526 /** Return the data associated with a given node.
5527 * @param[in] txn The transaction for this operation.
5528 * @param[in] leaf The node being read.
5529 * @param[out] data Updated to point to the node's data.
5530 * @return 0 on success, non-zero on failure.
5533 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
5535 MDB_page *omp; /* overflow page */
5539 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5540 data->mv_size = NODEDSZ(leaf);
5541 data->mv_data = NODEDATA(leaf);
5545 /* Read overflow data.
5547 data->mv_size = NODEDSZ(leaf);
5548 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
5549 if ((rc = mdb_page_get(txn, pgno, &omp, NULL)) != 0) {
5550 DPRINTF(("read overflow page %"Z"u failed", pgno));
5553 data->mv_data = METADATA(omp);
5559 mdb_get(MDB_txn *txn, MDB_dbi dbi,
5560 MDB_val *key, MDB_val *data)
5567 DPRINTF(("===> get db %u key [%s]", dbi, DKEY(key)));
5569 if (!key || !data || !TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
5572 if (txn->mt_flags & MDB_TXN_BLOCKED)
5575 mdb_cursor_init(&mc, txn, dbi, &mx);
5576 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
5579 /** Find a sibling for a page.
5580 * Replaces the page at the top of the cursor's stack with the
5581 * specified sibling, if one exists.
5582 * @param[in] mc The cursor for this operation.
5583 * @param[in] move_right Non-zero if the right sibling is requested,
5584 * otherwise the left sibling.
5585 * @return 0 on success, non-zero on failure.
5588 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
5594 if (mc->mc_snum < 2) {
5595 return MDB_NOTFOUND; /* root has no siblings */
5599 DPRINTF(("parent page is page %"Z"u, index %u",
5600 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]));
5602 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
5603 : (mc->mc_ki[mc->mc_top] == 0)) {
5604 DPRINTF(("no more keys left, moving to %s sibling",
5605 move_right ? "right" : "left"));
5606 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
5607 /* undo cursor_pop before returning */
5614 mc->mc_ki[mc->mc_top]++;
5616 mc->mc_ki[mc->mc_top]--;
5617 DPRINTF(("just moving to %s index key %u",
5618 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]));
5620 mdb_cassert(mc, IS_BRANCH(mc->mc_pg[mc->mc_top]));
5622 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5623 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp, NULL)) != 0) {
5624 /* mc will be inconsistent if caller does mc_snum++ as above */
5625 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
5629 mdb_cursor_push(mc, mp);
5631 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
5636 /** Move the cursor to the next data item. */
5638 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5644 if (mc->mc_flags & C_EOF) {
5645 return MDB_NOTFOUND;
5648 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5650 mp = mc->mc_pg[mc->mc_top];
5652 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5653 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5654 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5655 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
5656 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
5657 if (op != MDB_NEXT || rc != MDB_NOTFOUND) {
5658 if (rc == MDB_SUCCESS)
5659 MDB_GET_KEY(leaf, key);
5664 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5665 if (op == MDB_NEXT_DUP)
5666 return MDB_NOTFOUND;
5670 DPRINTF(("cursor_next: top page is %"Z"u in cursor %p",
5671 mdb_dbg_pgno(mp), (void *) mc));
5672 if (mc->mc_flags & C_DEL) {
5673 mc->mc_flags ^= C_DEL;
5677 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
5678 DPUTS("=====> move to next sibling page");
5679 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
5680 mc->mc_flags |= C_EOF;
5683 mp = mc->mc_pg[mc->mc_top];
5684 DPRINTF(("next page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5686 mc->mc_ki[mc->mc_top]++;
5689 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5690 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5693 key->mv_size = mc->mc_db->md_pad;
5694 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5698 mdb_cassert(mc, IS_LEAF(mp));
5699 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5701 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5702 mdb_xcursor_init1(mc, leaf);
5705 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5708 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5709 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5710 if (rc != MDB_SUCCESS)
5715 MDB_GET_KEY(leaf, key);
5719 /** Move the cursor to the previous data item. */
5721 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5727 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5729 mp = mc->mc_pg[mc->mc_top];
5731 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5732 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5733 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5734 if (op == MDB_PREV || op == MDB_PREV_DUP) {
5735 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
5736 if (op != MDB_PREV || rc != MDB_NOTFOUND) {
5737 if (rc == MDB_SUCCESS) {
5738 MDB_GET_KEY(leaf, key);
5739 mc->mc_flags &= ~C_EOF;
5745 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5746 if (op == MDB_PREV_DUP)
5747 return MDB_NOTFOUND;
5751 DPRINTF(("cursor_prev: top page is %"Z"u in cursor %p",
5752 mdb_dbg_pgno(mp), (void *) mc));
5754 mc->mc_flags &= ~(C_EOF|C_DEL);
5756 if (mc->mc_ki[mc->mc_top] == 0) {
5757 DPUTS("=====> move to prev sibling page");
5758 if ((rc = mdb_cursor_sibling(mc, 0)) != MDB_SUCCESS) {
5761 mp = mc->mc_pg[mc->mc_top];
5762 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
5763 DPRINTF(("prev page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5765 mc->mc_ki[mc->mc_top]--;
5767 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5768 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5771 key->mv_size = mc->mc_db->md_pad;
5772 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5776 mdb_cassert(mc, IS_LEAF(mp));
5777 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5779 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5780 mdb_xcursor_init1(mc, leaf);
5783 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5786 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5787 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5788 if (rc != MDB_SUCCESS)
5793 MDB_GET_KEY(leaf, key);
5797 /** Set the cursor on a specific data item. */
5799 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5800 MDB_cursor_op op, int *exactp)
5804 MDB_node *leaf = NULL;
5807 if (key->mv_size == 0)
5808 return MDB_BAD_VALSIZE;
5811 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5813 /* See if we're already on the right page */
5814 if (mc->mc_flags & C_INITIALIZED) {
5817 mp = mc->mc_pg[mc->mc_top];
5819 mc->mc_ki[mc->mc_top] = 0;
5820 return MDB_NOTFOUND;
5822 if (mp->mp_flags & P_LEAF2) {
5823 nodekey.mv_size = mc->mc_db->md_pad;
5824 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
5826 leaf = NODEPTR(mp, 0);
5827 MDB_GET_KEY2(leaf, nodekey);
5829 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5831 /* Probably happens rarely, but first node on the page
5832 * was the one we wanted.
5834 mc->mc_ki[mc->mc_top] = 0;
5841 unsigned int nkeys = NUMKEYS(mp);
5843 if (mp->mp_flags & P_LEAF2) {
5844 nodekey.mv_data = LEAF2KEY(mp,
5845 nkeys-1, nodekey.mv_size);
5847 leaf = NODEPTR(mp, nkeys-1);
5848 MDB_GET_KEY2(leaf, nodekey);
5850 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5852 /* last node was the one we wanted */
5853 mc->mc_ki[mc->mc_top] = nkeys-1;
5859 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
5860 /* This is definitely the right page, skip search_page */
5861 if (mp->mp_flags & P_LEAF2) {
5862 nodekey.mv_data = LEAF2KEY(mp,
5863 mc->mc_ki[mc->mc_top], nodekey.mv_size);
5865 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5866 MDB_GET_KEY2(leaf, nodekey);
5868 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5870 /* current node was the one we wanted */
5880 /* If any parents have right-sibs, search.
5881 * Otherwise, there's nothing further.
5883 for (i=0; i<mc->mc_top; i++)
5885 NUMKEYS(mc->mc_pg[i])-1)
5887 if (i == mc->mc_top) {
5888 /* There are no other pages */
5889 mc->mc_ki[mc->mc_top] = nkeys;
5890 return MDB_NOTFOUND;
5894 /* There are no other pages */
5895 mc->mc_ki[mc->mc_top] = 0;
5896 if (op == MDB_SET_RANGE && !exactp) {
5900 return MDB_NOTFOUND;
5906 rc = mdb_page_search(mc, key, 0);
5907 if (rc != MDB_SUCCESS)
5910 mp = mc->mc_pg[mc->mc_top];
5911 mdb_cassert(mc, IS_LEAF(mp));
5914 leaf = mdb_node_search(mc, key, exactp);
5915 if (exactp != NULL && !*exactp) {
5916 /* MDB_SET specified and not an exact match. */
5917 return MDB_NOTFOUND;
5921 DPUTS("===> inexact leaf not found, goto sibling");
5922 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
5923 mc->mc_flags |= C_EOF;
5924 return rc; /* no entries matched */
5926 mp = mc->mc_pg[mc->mc_top];
5927 mdb_cassert(mc, IS_LEAF(mp));
5928 leaf = NODEPTR(mp, 0);
5932 mc->mc_flags |= C_INITIALIZED;
5933 mc->mc_flags &= ~C_EOF;
5936 if (op == MDB_SET_RANGE || op == MDB_SET_KEY) {
5937 key->mv_size = mc->mc_db->md_pad;
5938 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5943 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5944 mdb_xcursor_init1(mc, leaf);
5947 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5948 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
5949 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5952 if (op == MDB_GET_BOTH) {
5958 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
5959 if (rc != MDB_SUCCESS)
5962 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
5965 if ((rc = mdb_node_read(mc->mc_txn, leaf, &olddata)) != MDB_SUCCESS)
5967 dcmp = mc->mc_dbx->md_dcmp;
5968 #if UINT_MAX < SIZE_MAX
5969 if (dcmp == mdb_cmp_int && olddata.mv_size == sizeof(size_t))
5970 dcmp = mdb_cmp_clong;
5972 rc = dcmp(data, &olddata);
5974 if (op == MDB_GET_BOTH || rc > 0)
5975 return MDB_NOTFOUND;
5982 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5983 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5988 /* The key already matches in all other cases */
5989 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
5990 MDB_GET_KEY(leaf, key);
5991 DPRINTF(("==> cursor placed on key [%s]", DKEY(key)));
5996 /** Move the cursor to the first item in the database. */
5998 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
6004 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
6006 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
6007 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
6008 if (rc != MDB_SUCCESS)
6011 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
6013 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
6014 mc->mc_flags |= C_INITIALIZED;
6015 mc->mc_flags &= ~C_EOF;
6017 mc->mc_ki[mc->mc_top] = 0;
6019 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
6020 key->mv_size = mc->mc_db->md_pad;
6021 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
6026 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6027 mdb_xcursor_init1(mc, leaf);
6028 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
6032 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
6036 MDB_GET_KEY(leaf, key);
6040 /** Move the cursor to the last item in the database. */
6042 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
6048 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
6050 if (!(mc->mc_flags & C_EOF)) {
6052 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
6053 rc = mdb_page_search(mc, NULL, MDB_PS_LAST);
6054 if (rc != MDB_SUCCESS)
6057 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
6060 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
6061 mc->mc_flags |= C_INITIALIZED|C_EOF;
6062 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6064 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
6065 key->mv_size = mc->mc_db->md_pad;
6066 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
6071 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6072 mdb_xcursor_init1(mc, leaf);
6073 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
6077 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
6082 MDB_GET_KEY(leaf, key);
6087 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
6092 int (*mfunc)(MDB_cursor *mc, MDB_val *key, MDB_val *data);
6097 if (mc->mc_txn->mt_flags & MDB_TXN_BLOCKED)
6101 case MDB_GET_CURRENT:
6102 if (!(mc->mc_flags & C_INITIALIZED)) {
6105 MDB_page *mp = mc->mc_pg[mc->mc_top];
6106 int nkeys = NUMKEYS(mp);
6107 if (!nkeys || mc->mc_ki[mc->mc_top] >= nkeys) {
6108 mc->mc_ki[mc->mc_top] = nkeys;
6114 key->mv_size = mc->mc_db->md_pad;
6115 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
6117 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6118 MDB_GET_KEY(leaf, key);
6120 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6121 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
6123 rc = mdb_node_read(mc->mc_txn, leaf, data);
6130 case MDB_GET_BOTH_RANGE:
6135 if (mc->mc_xcursor == NULL) {
6136 rc = MDB_INCOMPATIBLE;
6146 rc = mdb_cursor_set(mc, key, data, op,
6147 op == MDB_SET_RANGE ? NULL : &exact);
6150 case MDB_GET_MULTIPLE:
6151 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
6155 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
6156 rc = MDB_INCOMPATIBLE;
6160 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
6161 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
6164 case MDB_NEXT_MULTIPLE:
6169 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
6170 rc = MDB_INCOMPATIBLE;
6173 if (!(mc->mc_flags & C_INITIALIZED))
6174 rc = mdb_cursor_first(mc, key, data);
6176 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
6177 if (rc == MDB_SUCCESS) {
6178 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
6181 mx = &mc->mc_xcursor->mx_cursor;
6182 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
6184 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
6185 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
6193 case MDB_NEXT_NODUP:
6194 if (!(mc->mc_flags & C_INITIALIZED))
6195 rc = mdb_cursor_first(mc, key, data);
6197 rc = mdb_cursor_next(mc, key, data, op);
6201 case MDB_PREV_NODUP:
6202 if (!(mc->mc_flags & C_INITIALIZED)) {
6203 rc = mdb_cursor_last(mc, key, data);
6206 mc->mc_flags |= C_INITIALIZED;
6207 mc->mc_ki[mc->mc_top]++;
6209 rc = mdb_cursor_prev(mc, key, data, op);
6212 rc = mdb_cursor_first(mc, key, data);
6215 mfunc = mdb_cursor_first;
6217 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
6221 if (mc->mc_xcursor == NULL) {
6222 rc = MDB_INCOMPATIBLE;
6226 MDB_node *leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6227 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6228 MDB_GET_KEY(leaf, key);
6229 rc = mdb_node_read(mc->mc_txn, leaf, data);
6233 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
6237 rc = mfunc(&mc->mc_xcursor->mx_cursor, data, NULL);
6240 rc = mdb_cursor_last(mc, key, data);
6243 mfunc = mdb_cursor_last;
6246 DPRINTF(("unhandled/unimplemented cursor operation %u", op));
6251 if (mc->mc_flags & C_DEL)
6252 mc->mc_flags ^= C_DEL;
6257 /** Touch all the pages in the cursor stack. Set mc_top.
6258 * Makes sure all the pages are writable, before attempting a write operation.
6259 * @param[in] mc The cursor to operate on.
6262 mdb_cursor_touch(MDB_cursor *mc)
6264 int rc = MDB_SUCCESS;
6266 if (mc->mc_dbi >= CORE_DBS && !(*mc->mc_dbflag & DB_DIRTY)) {
6269 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
6271 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, &mcx);
6272 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
6275 *mc->mc_dbflag |= DB_DIRTY;
6280 rc = mdb_page_touch(mc);
6281 } while (!rc && ++(mc->mc_top) < mc->mc_snum);
6282 mc->mc_top = mc->mc_snum-1;
6287 /** Do not spill pages to disk if txn is getting full, may fail instead */
6288 #define MDB_NOSPILL 0x8000
6291 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
6295 MDB_node *leaf = NULL;
6296 MDB_page *fp, *mp, *sub_root = NULL;
6298 MDB_val xdata, *rdata, dkey, olddata;
6300 int do_sub = 0, insert_key, insert_data;
6301 unsigned int mcount = 0, dcount = 0, nospill;
6304 unsigned int nflags;
6307 if (mc == NULL || key == NULL)
6310 env = mc->mc_txn->mt_env;
6312 /* Check this first so counter will always be zero on any
6315 if (flags & MDB_MULTIPLE) {
6316 dcount = data[1].mv_size;
6317 data[1].mv_size = 0;
6318 if (!F_ISSET(mc->mc_db->md_flags, MDB_DUPFIXED))
6319 return MDB_INCOMPATIBLE;
6322 nospill = flags & MDB_NOSPILL;
6323 flags &= ~MDB_NOSPILL;
6325 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_BLOCKED))
6326 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6328 if (key->mv_size-1 >= ENV_MAXKEY(env))
6329 return MDB_BAD_VALSIZE;
6331 #if SIZE_MAX > MAXDATASIZE
6332 if (data->mv_size > ((mc->mc_db->md_flags & MDB_DUPSORT) ? ENV_MAXKEY(env) : MAXDATASIZE))
6333 return MDB_BAD_VALSIZE;
6335 if ((mc->mc_db->md_flags & MDB_DUPSORT) && data->mv_size > ENV_MAXKEY(env))
6336 return MDB_BAD_VALSIZE;
6339 DPRINTF(("==> put db %d key [%s], size %"Z"u, data size %"Z"u",
6340 DDBI(mc), DKEY(key), key ? key->mv_size : 0, data->mv_size));
6344 if (flags == MDB_CURRENT) {
6345 if (!(mc->mc_flags & C_INITIALIZED))
6348 } else if (mc->mc_db->md_root == P_INVALID) {
6349 /* new database, cursor has nothing to point to */
6352 mc->mc_flags &= ~C_INITIALIZED;
6357 if (flags & MDB_APPEND) {
6359 rc = mdb_cursor_last(mc, &k2, &d2);
6361 rc = mc->mc_dbx->md_cmp(key, &k2);
6364 mc->mc_ki[mc->mc_top]++;
6366 /* new key is <= last key */
6371 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
6373 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
6374 DPRINTF(("duplicate key [%s]", DKEY(key)));
6376 return MDB_KEYEXIST;
6378 if (rc && rc != MDB_NOTFOUND)
6382 if (mc->mc_flags & C_DEL)
6383 mc->mc_flags ^= C_DEL;
6385 /* Cursor is positioned, check for room in the dirty list */
6387 if (flags & MDB_MULTIPLE) {
6389 xdata.mv_size = data->mv_size * dcount;
6393 if ((rc2 = mdb_page_spill(mc, key, rdata)))
6397 if (rc == MDB_NO_ROOT) {
6399 /* new database, write a root leaf page */
6400 DPUTS("allocating new root leaf page");
6401 if ((rc2 = mdb_page_new(mc, P_LEAF, 1, &np))) {
6404 mdb_cursor_push(mc, np);
6405 mc->mc_db->md_root = np->mp_pgno;
6406 mc->mc_db->md_depth++;
6407 *mc->mc_dbflag |= DB_DIRTY;
6408 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
6410 np->mp_flags |= P_LEAF2;
6411 mc->mc_flags |= C_INITIALIZED;
6413 /* make sure all cursor pages are writable */
6414 rc2 = mdb_cursor_touch(mc);
6419 insert_key = insert_data = rc;
6421 /* The key does not exist */
6422 DPRINTF(("inserting key at index %i", mc->mc_ki[mc->mc_top]));
6423 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
6424 LEAFSIZE(key, data) > env->me_nodemax)
6426 /* Too big for a node, insert in sub-DB. Set up an empty
6427 * "old sub-page" for prep_subDB to expand to a full page.
6429 fp_flags = P_LEAF|P_DIRTY;
6431 fp->mp_pad = data->mv_size; /* used if MDB_DUPFIXED */
6432 fp->mp_lower = fp->mp_upper = (PAGEHDRSZ-PAGEBASE);
6433 olddata.mv_size = PAGEHDRSZ;
6437 /* there's only a key anyway, so this is a no-op */
6438 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
6440 unsigned int ksize = mc->mc_db->md_pad;
6441 if (key->mv_size != ksize)
6442 return MDB_BAD_VALSIZE;
6443 ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
6444 memcpy(ptr, key->mv_data, ksize);
6446 /* if overwriting slot 0 of leaf, need to
6447 * update branch key if there is a parent page
6449 if (mc->mc_top && !mc->mc_ki[mc->mc_top]) {
6450 unsigned short dtop = 1;
6452 /* slot 0 is always an empty key, find real slot */
6453 while (mc->mc_top && !mc->mc_ki[mc->mc_top]) {
6457 if (mc->mc_ki[mc->mc_top])
6458 rc2 = mdb_update_key(mc, key);
6469 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6470 olddata.mv_size = NODEDSZ(leaf);
6471 olddata.mv_data = NODEDATA(leaf);
6474 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
6475 /* Prepare (sub-)page/sub-DB to accept the new item,
6476 * if needed. fp: old sub-page or a header faking
6477 * it. mp: new (sub-)page. offset: growth in page
6478 * size. xdata: node data with new page or DB.
6480 unsigned i, offset = 0;
6481 mp = fp = xdata.mv_data = env->me_pbuf;
6482 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
6484 /* Was a single item before, must convert now */
6485 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6487 /* Just overwrite the current item */
6488 if (flags == MDB_CURRENT)
6490 dcmp = mc->mc_dbx->md_dcmp;
6491 #if UINT_MAX < SIZE_MAX
6492 if (dcmp == mdb_cmp_int && olddata.mv_size == sizeof(size_t))
6493 dcmp = mdb_cmp_clong;
6495 /* does data match? */
6496 if (!dcmp(data, &olddata)) {
6497 if (flags & (MDB_NODUPDATA|MDB_APPENDDUP))
6498 return MDB_KEYEXIST;
6503 /* Back up original data item */
6504 dkey.mv_size = olddata.mv_size;
6505 dkey.mv_data = memcpy(fp+1, olddata.mv_data, olddata.mv_size);
6507 /* Make sub-page header for the dup items, with dummy body */
6508 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
6509 fp->mp_lower = (PAGEHDRSZ-PAGEBASE);
6510 xdata.mv_size = PAGEHDRSZ + dkey.mv_size + data->mv_size;
6511 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6512 fp->mp_flags |= P_LEAF2;
6513 fp->mp_pad = data->mv_size;
6514 xdata.mv_size += 2 * data->mv_size; /* leave space for 2 more */
6516 xdata.mv_size += 2 * (sizeof(indx_t) + NODESIZE) +
6517 (dkey.mv_size & 1) + (data->mv_size & 1);
6519 fp->mp_upper = xdata.mv_size - PAGEBASE;
6520 olddata.mv_size = xdata.mv_size; /* pretend olddata is fp */
6521 } else if (leaf->mn_flags & F_SUBDATA) {
6522 /* Data is on sub-DB, just store it */
6523 flags |= F_DUPDATA|F_SUBDATA;
6526 /* Data is on sub-page */
6527 fp = olddata.mv_data;
6530 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
6531 offset = EVEN(NODESIZE + sizeof(indx_t) +
6535 offset = fp->mp_pad;
6536 if (SIZELEFT(fp) < offset) {
6537 offset *= 4; /* space for 4 more */
6540 /* FALLTHRU: Big enough MDB_DUPFIXED sub-page */
6542 fp->mp_flags |= P_DIRTY;
6543 COPY_PGNO(fp->mp_pgno, mp->mp_pgno);
6544 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
6548 xdata.mv_size = olddata.mv_size + offset;
6551 fp_flags = fp->mp_flags;
6552 if (NODESIZE + NODEKSZ(leaf) + xdata.mv_size > env->me_nodemax) {
6553 /* Too big for a sub-page, convert to sub-DB */
6554 fp_flags &= ~P_SUBP;
6556 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6557 fp_flags |= P_LEAF2;
6558 dummy.md_pad = fp->mp_pad;
6559 dummy.md_flags = MDB_DUPFIXED;
6560 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
6561 dummy.md_flags |= MDB_INTEGERKEY;
6567 dummy.md_branch_pages = 0;
6568 dummy.md_leaf_pages = 1;
6569 dummy.md_overflow_pages = 0;
6570 dummy.md_entries = NUMKEYS(fp);
6571 xdata.mv_size = sizeof(MDB_db);
6572 xdata.mv_data = &dummy;
6573 if ((rc = mdb_page_alloc(mc, 1, &mp)))
6575 offset = env->me_psize - olddata.mv_size;
6576 flags |= F_DUPDATA|F_SUBDATA;
6577 dummy.md_root = mp->mp_pgno;
6581 mp->mp_flags = fp_flags | P_DIRTY;
6582 mp->mp_pad = fp->mp_pad;
6583 mp->mp_lower = fp->mp_lower;
6584 mp->mp_upper = fp->mp_upper + offset;
6585 if (fp_flags & P_LEAF2) {
6586 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
6588 memcpy((char *)mp + mp->mp_upper + PAGEBASE, (char *)fp + fp->mp_upper + PAGEBASE,
6589 olddata.mv_size - fp->mp_upper - PAGEBASE);
6590 for (i=0; i<NUMKEYS(fp); i++)
6591 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
6599 mdb_node_del(mc, 0);
6603 /* LMDB passes F_SUBDATA in 'flags' to write a DB record */
6604 if ((leaf->mn_flags ^ flags) & F_SUBDATA)
6605 return MDB_INCOMPATIBLE;
6606 /* overflow page overwrites need special handling */
6607 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6610 int level, ovpages, dpages = OVPAGES(data->mv_size, env->me_psize);
6612 memcpy(&pg, olddata.mv_data, sizeof(pg));
6613 if ((rc2 = mdb_page_get(mc->mc_txn, pg, &omp, &level)) != 0)
6615 ovpages = omp->mp_pages;
6617 /* Is the ov page large enough? */
6618 if (ovpages >= dpages) {
6619 if (!(omp->mp_flags & P_DIRTY) &&
6620 (level || (env->me_flags & MDB_WRITEMAP)))
6622 rc = mdb_page_unspill(mc->mc_txn, omp, &omp);
6625 level = 0; /* dirty in this txn or clean */
6628 if (omp->mp_flags & P_DIRTY) {
6629 /* yes, overwrite it. Note in this case we don't
6630 * bother to try shrinking the page if the new data
6631 * is smaller than the overflow threshold.
6634 /* It is writable only in a parent txn */
6635 size_t sz = (size_t) env->me_psize * ovpages, off;
6636 MDB_page *np = mdb_page_malloc(mc->mc_txn, ovpages);
6642 /* Note - this page is already counted in parent's dirty_room */
6643 rc2 = mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &id2);
6644 mdb_cassert(mc, rc2 == 0);
6645 if (!(flags & MDB_RESERVE)) {
6646 /* Copy end of page, adjusting alignment so
6647 * compiler may copy words instead of bytes.
6649 off = (PAGEHDRSZ + data->mv_size) & -sizeof(size_t);
6650 memcpy((size_t *)((char *)np + off),
6651 (size_t *)((char *)omp + off), sz - off);
6654 memcpy(np, omp, sz); /* Copy beginning of page */
6657 SETDSZ(leaf, data->mv_size);
6658 if (F_ISSET(flags, MDB_RESERVE))
6659 data->mv_data = METADATA(omp);
6661 memcpy(METADATA(omp), data->mv_data, data->mv_size);
6665 if ((rc2 = mdb_ovpage_free(mc, omp)) != MDB_SUCCESS)
6667 } else if (data->mv_size == olddata.mv_size) {
6668 /* same size, just replace it. Note that we could
6669 * also reuse this node if the new data is smaller,
6670 * but instead we opt to shrink the node in that case.
6672 if (F_ISSET(flags, MDB_RESERVE))
6673 data->mv_data = olddata.mv_data;
6674 else if (!(mc->mc_flags & C_SUB))
6675 memcpy(olddata.mv_data, data->mv_data, data->mv_size);
6677 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
6682 mdb_node_del(mc, 0);
6688 nflags = flags & NODE_ADD_FLAGS;
6689 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(env, key, rdata);
6690 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
6691 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
6692 nflags &= ~MDB_APPEND; /* sub-page may need room to grow */
6694 nflags |= MDB_SPLIT_REPLACE;
6695 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
6697 /* There is room already in this leaf page. */
6698 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
6700 /* Adjust other cursors pointing to mp */
6701 MDB_cursor *m2, *m3;
6702 MDB_dbi dbi = mc->mc_dbi;
6703 unsigned i = mc->mc_top;
6704 MDB_page *mp = mc->mc_pg[i];
6706 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6707 if (mc->mc_flags & C_SUB)
6708 m3 = &m2->mc_xcursor->mx_cursor;
6711 if (m3 == mc || m3->mc_snum < mc->mc_snum || m3->mc_pg[i] != mp) continue;
6712 if (m3->mc_ki[i] >= mc->mc_ki[i] && insert_key) {
6715 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
6716 MDB_node *n2 = NODEPTR(mp, m3->mc_ki[i]);
6717 if ((n2->mn_flags & (F_SUBDATA|F_DUPDATA)) == F_DUPDATA)
6718 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(n2);
6724 if (rc == MDB_SUCCESS) {
6725 /* Now store the actual data in the child DB. Note that we're
6726 * storing the user data in the keys field, so there are strict
6727 * size limits on dupdata. The actual data fields of the child
6728 * DB are all zero size.
6731 int xflags, new_dupdata;
6736 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6737 if (flags & MDB_CURRENT) {
6738 xflags = MDB_CURRENT|MDB_NOSPILL;
6740 mdb_xcursor_init1(mc, leaf);
6741 xflags = (flags & MDB_NODUPDATA) ?
6742 MDB_NOOVERWRITE|MDB_NOSPILL : MDB_NOSPILL;
6745 mc->mc_xcursor->mx_cursor.mc_pg[0] = sub_root;
6746 new_dupdata = (int)dkey.mv_size;
6747 /* converted, write the original data first */
6749 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
6752 /* we've done our job */
6755 if (!(leaf->mn_flags & F_SUBDATA) || sub_root) {
6756 /* Adjust other cursors pointing to mp */
6758 MDB_xcursor *mx = mc->mc_xcursor;
6759 unsigned i = mc->mc_top;
6760 MDB_page *mp = mc->mc_pg[i];
6761 int nkeys = NUMKEYS(mp);
6763 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6764 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6765 if (!(m2->mc_flags & C_INITIALIZED)) continue;
6766 if (m2->mc_pg[i] == mp) {
6767 if (m2->mc_ki[i] == mc->mc_ki[i]) {
6768 mdb_xcursor_init2(m2, mx, new_dupdata);
6769 } else if (!insert_key && m2->mc_ki[i] < nkeys) {
6770 MDB_node *n2 = NODEPTR(mp, m2->mc_ki[i]);
6771 if ((n2->mn_flags & (F_SUBDATA|F_DUPDATA)) == F_DUPDATA)
6772 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(n2);
6777 ecount = mc->mc_xcursor->mx_db.md_entries;
6778 if (flags & MDB_APPENDDUP)
6779 xflags |= MDB_APPEND;
6780 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
6781 if (flags & F_SUBDATA) {
6782 void *db = NODEDATA(leaf);
6783 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6785 insert_data = mc->mc_xcursor->mx_db.md_entries - ecount;
6787 /* Increment count unless we just replaced an existing item. */
6789 mc->mc_db->md_entries++;
6791 /* Invalidate txn if we created an empty sub-DB */
6794 /* If we succeeded and the key didn't exist before,
6795 * make sure the cursor is marked valid.
6797 mc->mc_flags |= C_INITIALIZED;
6799 if (flags & MDB_MULTIPLE) {
6802 /* let caller know how many succeeded, if any */
6803 data[1].mv_size = mcount;
6804 if (mcount < dcount) {
6805 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
6806 insert_key = insert_data = 0;
6813 if (rc == MDB_KEYEXIST) /* should not happen, we deleted that item */
6816 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6821 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
6827 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_BLOCKED))
6828 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6830 if (!(mc->mc_flags & C_INITIALIZED))
6833 if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6834 return MDB_NOTFOUND;
6836 if (!(flags & MDB_NOSPILL) && (rc = mdb_page_spill(mc, NULL, NULL)))
6839 rc = mdb_cursor_touch(mc);
6843 mp = mc->mc_pg[mc->mc_top];
6846 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6848 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6849 if (flags & MDB_NODUPDATA) {
6850 /* mdb_cursor_del0() will subtract the final entry */
6851 mc->mc_db->md_entries -= mc->mc_xcursor->mx_db.md_entries - 1;
6852 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
6854 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
6855 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6857 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, MDB_NOSPILL);
6860 /* If sub-DB still has entries, we're done */
6861 if (mc->mc_xcursor->mx_db.md_entries) {
6862 if (leaf->mn_flags & F_SUBDATA) {
6863 /* update subDB info */
6864 void *db = NODEDATA(leaf);
6865 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6868 /* shrink fake page */
6869 mdb_node_shrink(mp, mc->mc_ki[mc->mc_top]);
6870 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6871 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6872 /* fix other sub-DB cursors pointed at fake pages on this page */
6873 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6874 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6875 if (!(m2->mc_flags & C_INITIALIZED)) continue;
6876 if (m2->mc_pg[mc->mc_top] == mp) {
6877 if (m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top]) {
6878 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6880 MDB_node *n2 = NODEPTR(mp, m2->mc_ki[mc->mc_top]);
6881 if (!(n2->mn_flags & F_SUBDATA))
6882 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(n2);
6887 mc->mc_db->md_entries--;
6890 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
6892 /* otherwise fall thru and delete the sub-DB */
6895 if (leaf->mn_flags & F_SUBDATA) {
6896 /* add all the child DB's pages to the free list */
6897 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6902 /* LMDB passes F_SUBDATA in 'flags' to delete a DB record */
6903 else if ((leaf->mn_flags ^ flags) & F_SUBDATA) {
6904 rc = MDB_INCOMPATIBLE;
6908 /* add overflow pages to free list */
6909 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6913 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6914 if ((rc = mdb_page_get(mc->mc_txn, pg, &omp, NULL)) ||
6915 (rc = mdb_ovpage_free(mc, omp)))
6920 return mdb_cursor_del0(mc);
6923 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6927 /** Allocate and initialize new pages for a database.
6928 * @param[in] mc a cursor on the database being added to.
6929 * @param[in] flags flags defining what type of page is being allocated.
6930 * @param[in] num the number of pages to allocate. This is usually 1,
6931 * unless allocating overflow pages for a large record.
6932 * @param[out] mp Address of a page, or NULL on failure.
6933 * @return 0 on success, non-zero on failure.
6936 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
6941 if ((rc = mdb_page_alloc(mc, num, &np)))
6943 DPRINTF(("allocated new mpage %"Z"u, page size %u",
6944 np->mp_pgno, mc->mc_txn->mt_env->me_psize));
6945 np->mp_flags = flags | P_DIRTY;
6946 np->mp_lower = (PAGEHDRSZ-PAGEBASE);
6947 np->mp_upper = mc->mc_txn->mt_env->me_psize - PAGEBASE;
6950 mc->mc_db->md_branch_pages++;
6951 else if (IS_LEAF(np))
6952 mc->mc_db->md_leaf_pages++;
6953 else if (IS_OVERFLOW(np)) {
6954 mc->mc_db->md_overflow_pages += num;
6962 /** Calculate the size of a leaf node.
6963 * The size depends on the environment's page size; if a data item
6964 * is too large it will be put onto an overflow page and the node
6965 * size will only include the key and not the data. Sizes are always
6966 * rounded up to an even number of bytes, to guarantee 2-byte alignment
6967 * of the #MDB_node headers.
6968 * @param[in] env The environment handle.
6969 * @param[in] key The key for the node.
6970 * @param[in] data The data for the node.
6971 * @return The number of bytes needed to store the node.
6974 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
6978 sz = LEAFSIZE(key, data);
6979 if (sz > env->me_nodemax) {
6980 /* put on overflow page */
6981 sz -= data->mv_size - sizeof(pgno_t);
6984 return EVEN(sz + sizeof(indx_t));
6987 /** Calculate the size of a branch node.
6988 * The size should depend on the environment's page size but since
6989 * we currently don't support spilling large keys onto overflow
6990 * pages, it's simply the size of the #MDB_node header plus the
6991 * size of the key. Sizes are always rounded up to an even number
6992 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
6993 * @param[in] env The environment handle.
6994 * @param[in] key The key for the node.
6995 * @return The number of bytes needed to store the node.
6998 mdb_branch_size(MDB_env *env, MDB_val *key)
7003 if (sz > env->me_nodemax) {
7004 /* put on overflow page */
7005 /* not implemented */
7006 /* sz -= key->size - sizeof(pgno_t); */
7009 return sz + sizeof(indx_t);
7012 /** Add a node to the page pointed to by the cursor.
7013 * @param[in] mc The cursor for this operation.
7014 * @param[in] indx The index on the page where the new node should be added.
7015 * @param[in] key The key for the new node.
7016 * @param[in] data The data for the new node, if any.
7017 * @param[in] pgno The page number, if adding a branch node.
7018 * @param[in] flags Flags for the node.
7019 * @return 0 on success, non-zero on failure. Possible errors are:
7021 * <li>ENOMEM - failed to allocate overflow pages for the node.
7022 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
7023 * should never happen since all callers already calculate the
7024 * page's free space before calling this function.
7028 mdb_node_add(MDB_cursor *mc, indx_t indx,
7029 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
7032 size_t node_size = NODESIZE;
7036 MDB_page *mp = mc->mc_pg[mc->mc_top];
7037 MDB_page *ofp = NULL; /* overflow page */
7041 mdb_cassert(mc, mp->mp_upper >= mp->mp_lower);
7043 DPRINTF(("add to %s %spage %"Z"u index %i, data size %"Z"u key size %"Z"u [%s]",
7044 IS_LEAF(mp) ? "leaf" : "branch",
7045 IS_SUBP(mp) ? "sub-" : "",
7046 mdb_dbg_pgno(mp), indx, data ? data->mv_size : 0,
7047 key ? key->mv_size : 0, key ? DKEY(key) : "null"));
7050 /* Move higher keys up one slot. */
7051 int ksize = mc->mc_db->md_pad, dif;
7052 char *ptr = LEAF2KEY(mp, indx, ksize);
7053 dif = NUMKEYS(mp) - indx;
7055 memmove(ptr+ksize, ptr, dif*ksize);
7056 /* insert new key */
7057 memcpy(ptr, key->mv_data, ksize);
7059 /* Just using these for counting */
7060 mp->mp_lower += sizeof(indx_t);
7061 mp->mp_upper -= ksize - sizeof(indx_t);
7065 room = (ssize_t)SIZELEFT(mp) - (ssize_t)sizeof(indx_t);
7067 node_size += key->mv_size;
7069 mdb_cassert(mc, key && data);
7070 if (F_ISSET(flags, F_BIGDATA)) {
7071 /* Data already on overflow page. */
7072 node_size += sizeof(pgno_t);
7073 } else if (node_size + data->mv_size > mc->mc_txn->mt_env->me_nodemax) {
7074 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
7076 /* Put data on overflow page. */
7077 DPRINTF(("data size is %"Z"u, node would be %"Z"u, put data on overflow page",
7078 data->mv_size, node_size+data->mv_size));
7079 node_size = EVEN(node_size + sizeof(pgno_t));
7080 if ((ssize_t)node_size > room)
7082 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
7084 DPRINTF(("allocated overflow page %"Z"u", ofp->mp_pgno));
7088 node_size += data->mv_size;
7091 node_size = EVEN(node_size);
7092 if ((ssize_t)node_size > room)
7096 /* Move higher pointers up one slot. */
7097 for (i = NUMKEYS(mp); i > indx; i--)
7098 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
7100 /* Adjust free space offsets. */
7101 ofs = mp->mp_upper - node_size;
7102 mdb_cassert(mc, ofs >= mp->mp_lower + sizeof(indx_t));
7103 mp->mp_ptrs[indx] = ofs;
7105 mp->mp_lower += sizeof(indx_t);
7107 /* Write the node data. */
7108 node = NODEPTR(mp, indx);
7109 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
7110 node->mn_flags = flags;
7112 SETDSZ(node,data->mv_size);
7117 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
7120 ndata = NODEDATA(node);
7122 if (F_ISSET(flags, F_BIGDATA))
7123 memcpy(ndata, data->mv_data, sizeof(pgno_t));
7124 else if (F_ISSET(flags, MDB_RESERVE))
7125 data->mv_data = ndata;
7127 memcpy(ndata, data->mv_data, data->mv_size);
7129 memcpy(ndata, &ofp->mp_pgno, sizeof(pgno_t));
7130 ndata = METADATA(ofp);
7131 if (F_ISSET(flags, MDB_RESERVE))
7132 data->mv_data = ndata;
7134 memcpy(ndata, data->mv_data, data->mv_size);
7141 DPRINTF(("not enough room in page %"Z"u, got %u ptrs",
7142 mdb_dbg_pgno(mp), NUMKEYS(mp)));
7143 DPRINTF(("upper-lower = %u - %u = %"Z"d", mp->mp_upper,mp->mp_lower,room));
7144 DPRINTF(("node size = %"Z"u", node_size));
7145 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
7146 return MDB_PAGE_FULL;
7149 /** Delete the specified node from a page.
7150 * @param[in] mc Cursor pointing to the node to delete.
7151 * @param[in] ksize The size of a node. Only used if the page is
7152 * part of a #MDB_DUPFIXED database.
7155 mdb_node_del(MDB_cursor *mc, int ksize)
7157 MDB_page *mp = mc->mc_pg[mc->mc_top];
7158 indx_t indx = mc->mc_ki[mc->mc_top];
7160 indx_t i, j, numkeys, ptr;
7164 DPRINTF(("delete node %u on %s page %"Z"u", indx,
7165 IS_LEAF(mp) ? "leaf" : "branch", mdb_dbg_pgno(mp)));
7166 numkeys = NUMKEYS(mp);
7167 mdb_cassert(mc, indx < numkeys);
7170 int x = numkeys - 1 - indx;
7171 base = LEAF2KEY(mp, indx, ksize);
7173 memmove(base, base + ksize, x * ksize);
7174 mp->mp_lower -= sizeof(indx_t);
7175 mp->mp_upper += ksize - sizeof(indx_t);
7179 node = NODEPTR(mp, indx);
7180 sz = NODESIZE + node->mn_ksize;
7182 if (F_ISSET(node->mn_flags, F_BIGDATA))
7183 sz += sizeof(pgno_t);
7185 sz += NODEDSZ(node);
7189 ptr = mp->mp_ptrs[indx];
7190 for (i = j = 0; i < numkeys; i++) {
7192 mp->mp_ptrs[j] = mp->mp_ptrs[i];
7193 if (mp->mp_ptrs[i] < ptr)
7194 mp->mp_ptrs[j] += sz;
7199 base = (char *)mp + mp->mp_upper + PAGEBASE;
7200 memmove(base + sz, base, ptr - mp->mp_upper);
7202 mp->mp_lower -= sizeof(indx_t);
7206 /** Compact the main page after deleting a node on a subpage.
7207 * @param[in] mp The main page to operate on.
7208 * @param[in] indx The index of the subpage on the main page.
7211 mdb_node_shrink(MDB_page *mp, indx_t indx)
7216 indx_t delta, nsize, len, ptr;
7219 node = NODEPTR(mp, indx);
7220 sp = (MDB_page *)NODEDATA(node);
7221 delta = SIZELEFT(sp);
7222 nsize = NODEDSZ(node) - delta;
7224 /* Prepare to shift upward, set len = length(subpage part to shift) */
7228 return; /* do not make the node uneven-sized */
7230 xp = (MDB_page *)((char *)sp + delta); /* destination subpage */
7231 for (i = NUMKEYS(sp); --i >= 0; )
7232 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
7235 sp->mp_upper = sp->mp_lower;
7236 COPY_PGNO(sp->mp_pgno, mp->mp_pgno);
7237 SETDSZ(node, nsize);
7239 /* Shift <lower nodes...initial part of subpage> upward */
7240 base = (char *)mp + mp->mp_upper + PAGEBASE;
7241 memmove(base + delta, base, (char *)sp + len - base);
7243 ptr = mp->mp_ptrs[indx];
7244 for (i = NUMKEYS(mp); --i >= 0; ) {
7245 if (mp->mp_ptrs[i] <= ptr)
7246 mp->mp_ptrs[i] += delta;
7248 mp->mp_upper += delta;
7251 /** Initial setup of a sorted-dups cursor.
7252 * Sorted duplicates are implemented as a sub-database for the given key.
7253 * The duplicate data items are actually keys of the sub-database.
7254 * Operations on the duplicate data items are performed using a sub-cursor
7255 * initialized when the sub-database is first accessed. This function does
7256 * the preliminary setup of the sub-cursor, filling in the fields that
7257 * depend only on the parent DB.
7258 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
7261 mdb_xcursor_init0(MDB_cursor *mc)
7263 MDB_xcursor *mx = mc->mc_xcursor;
7265 mx->mx_cursor.mc_xcursor = NULL;
7266 mx->mx_cursor.mc_txn = mc->mc_txn;
7267 mx->mx_cursor.mc_db = &mx->mx_db;
7268 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
7269 mx->mx_cursor.mc_dbi = mc->mc_dbi;
7270 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
7271 mx->mx_cursor.mc_snum = 0;
7272 mx->mx_cursor.mc_top = 0;
7273 mx->mx_cursor.mc_flags = C_SUB;
7274 mx->mx_dbx.md_name.mv_size = 0;
7275 mx->mx_dbx.md_name.mv_data = NULL;
7276 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
7277 mx->mx_dbx.md_dcmp = NULL;
7278 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
7281 /** Final setup of a sorted-dups cursor.
7282 * Sets up the fields that depend on the data from the main cursor.
7283 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
7284 * @param[in] node The data containing the #MDB_db record for the
7285 * sorted-dup database.
7288 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
7290 MDB_xcursor *mx = mc->mc_xcursor;
7292 if (node->mn_flags & F_SUBDATA) {
7293 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
7294 mx->mx_cursor.mc_pg[0] = 0;
7295 mx->mx_cursor.mc_snum = 0;
7296 mx->mx_cursor.mc_top = 0;
7297 mx->mx_cursor.mc_flags = C_SUB;
7299 MDB_page *fp = NODEDATA(node);
7300 mx->mx_db.md_pad = 0;
7301 mx->mx_db.md_flags = 0;
7302 mx->mx_db.md_depth = 1;
7303 mx->mx_db.md_branch_pages = 0;
7304 mx->mx_db.md_leaf_pages = 1;
7305 mx->mx_db.md_overflow_pages = 0;
7306 mx->mx_db.md_entries = NUMKEYS(fp);
7307 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
7308 mx->mx_cursor.mc_snum = 1;
7309 mx->mx_cursor.mc_top = 0;
7310 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
7311 mx->mx_cursor.mc_pg[0] = fp;
7312 mx->mx_cursor.mc_ki[0] = 0;
7313 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
7314 mx->mx_db.md_flags = MDB_DUPFIXED;
7315 mx->mx_db.md_pad = fp->mp_pad;
7316 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
7317 mx->mx_db.md_flags |= MDB_INTEGERKEY;
7320 DPRINTF(("Sub-db -%u root page %"Z"u", mx->mx_cursor.mc_dbi,
7321 mx->mx_db.md_root));
7322 mx->mx_dbflag = DB_VALID|DB_USRVALID|DB_DIRTY; /* DB_DIRTY guides mdb_cursor_touch */
7323 #if UINT_MAX < SIZE_MAX
7324 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
7325 mx->mx_dbx.md_cmp = mdb_cmp_clong;
7330 /** Fixup a sorted-dups cursor due to underlying update.
7331 * Sets up some fields that depend on the data from the main cursor.
7332 * Almost the same as init1, but skips initialization steps if the
7333 * xcursor had already been used.
7334 * @param[in] mc The main cursor whose sorted-dups cursor is to be fixed up.
7335 * @param[in] src_mx The xcursor of an up-to-date cursor.
7336 * @param[in] new_dupdata True if converting from a non-#F_DUPDATA item.
7339 mdb_xcursor_init2(MDB_cursor *mc, MDB_xcursor *src_mx, int new_dupdata)
7341 MDB_xcursor *mx = mc->mc_xcursor;
7344 mx->mx_cursor.mc_snum = 1;
7345 mx->mx_cursor.mc_top = 0;
7346 mx->mx_cursor.mc_flags |= C_INITIALIZED;
7347 mx->mx_cursor.mc_ki[0] = 0;
7348 mx->mx_dbflag = DB_VALID|DB_USRVALID|DB_DIRTY; /* DB_DIRTY guides mdb_cursor_touch */
7349 #if UINT_MAX < SIZE_MAX
7350 mx->mx_dbx.md_cmp = src_mx->mx_dbx.md_cmp;
7352 } else if (!(mx->mx_cursor.mc_flags & C_INITIALIZED)) {
7355 mx->mx_db = src_mx->mx_db;
7356 mx->mx_cursor.mc_pg[0] = src_mx->mx_cursor.mc_pg[0];
7357 DPRINTF(("Sub-db -%u root page %"Z"u", mx->mx_cursor.mc_dbi,
7358 mx->mx_db.md_root));
7361 /** Initialize a cursor for a given transaction and database. */
7363 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
7366 mc->mc_backup = NULL;
7369 mc->mc_db = &txn->mt_dbs[dbi];
7370 mc->mc_dbx = &txn->mt_dbxs[dbi];
7371 mc->mc_dbflag = &txn->mt_dbflags[dbi];
7377 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
7378 mdb_tassert(txn, mx != NULL);
7379 mc->mc_xcursor = mx;
7380 mdb_xcursor_init0(mc);
7382 mc->mc_xcursor = NULL;
7384 if (*mc->mc_dbflag & DB_STALE) {
7385 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
7390 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
7393 size_t size = sizeof(MDB_cursor);
7395 if (!ret || !TXN_DBI_EXIST(txn, dbi, DB_VALID))
7398 if (txn->mt_flags & MDB_TXN_BLOCKED)
7401 if (dbi == FREE_DBI && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
7404 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
7405 size += sizeof(MDB_xcursor);
7407 if ((mc = malloc(size)) != NULL) {
7408 mdb_cursor_init(mc, txn, dbi, (MDB_xcursor *)(mc + 1));
7409 if (txn->mt_cursors) {
7410 mc->mc_next = txn->mt_cursors[dbi];
7411 txn->mt_cursors[dbi] = mc;
7412 mc->mc_flags |= C_UNTRACK;
7424 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
7426 if (!mc || !TXN_DBI_EXIST(txn, mc->mc_dbi, DB_VALID))
7429 if ((mc->mc_flags & C_UNTRACK) || txn->mt_cursors)
7432 if (txn->mt_flags & MDB_TXN_BLOCKED)
7435 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
7439 /* Return the count of duplicate data items for the current key */
7441 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
7445 if (mc == NULL || countp == NULL)
7448 if (mc->mc_xcursor == NULL)
7449 return MDB_INCOMPATIBLE;
7451 if (mc->mc_txn->mt_flags & MDB_TXN_BLOCKED)
7454 if (!(mc->mc_flags & C_INITIALIZED))
7457 if (!mc->mc_snum || (mc->mc_flags & C_EOF))
7458 return MDB_NOTFOUND;
7460 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
7461 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
7464 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
7467 *countp = mc->mc_xcursor->mx_db.md_entries;
7473 mdb_cursor_close(MDB_cursor *mc)
7475 if (mc && !mc->mc_backup) {
7476 /* remove from txn, if tracked */
7477 if ((mc->mc_flags & C_UNTRACK) && mc->mc_txn->mt_cursors) {
7478 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
7479 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
7481 *prev = mc->mc_next;
7488 mdb_cursor_txn(MDB_cursor *mc)
7490 if (!mc) return NULL;
7495 mdb_cursor_dbi(MDB_cursor *mc)
7500 /** Replace the key for a branch node with a new key.
7501 * @param[in] mc Cursor pointing to the node to operate on.
7502 * @param[in] key The new key to use.
7503 * @return 0 on success, non-zero on failure.
7506 mdb_update_key(MDB_cursor *mc, MDB_val *key)
7512 int delta, ksize, oksize;
7513 indx_t ptr, i, numkeys, indx;
7516 indx = mc->mc_ki[mc->mc_top];
7517 mp = mc->mc_pg[mc->mc_top];
7518 node = NODEPTR(mp, indx);
7519 ptr = mp->mp_ptrs[indx];
7523 char kbuf2[DKBUF_MAXKEYSIZE*2+1];
7524 k2.mv_data = NODEKEY(node);
7525 k2.mv_size = node->mn_ksize;
7526 DPRINTF(("update key %u (ofs %u) [%s] to [%s] on page %"Z"u",
7528 mdb_dkey(&k2, kbuf2),
7534 /* Sizes must be 2-byte aligned. */
7535 ksize = EVEN(key->mv_size);
7536 oksize = EVEN(node->mn_ksize);
7537 delta = ksize - oksize;
7539 /* Shift node contents if EVEN(key length) changed. */
7541 if (delta > 0 && SIZELEFT(mp) < delta) {
7543 /* not enough space left, do a delete and split */
7544 DPRINTF(("Not enough room, delta = %d, splitting...", delta));
7545 pgno = NODEPGNO(node);
7546 mdb_node_del(mc, 0);
7547 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
7550 numkeys = NUMKEYS(mp);
7551 for (i = 0; i < numkeys; i++) {
7552 if (mp->mp_ptrs[i] <= ptr)
7553 mp->mp_ptrs[i] -= delta;
7556 base = (char *)mp + mp->mp_upper + PAGEBASE;
7557 len = ptr - mp->mp_upper + NODESIZE;
7558 memmove(base - delta, base, len);
7559 mp->mp_upper -= delta;
7561 node = NODEPTR(mp, indx);
7564 /* But even if no shift was needed, update ksize */
7565 if (node->mn_ksize != key->mv_size)
7566 node->mn_ksize = key->mv_size;
7569 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
7575 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
7577 /** Perform \b act while tracking temporary cursor \b mn */
7578 #define WITH_CURSOR_TRACKING(mn, act) do { \
7579 MDB_cursor dummy, *tracked, **tp = &(mn).mc_txn->mt_cursors[mn.mc_dbi]; \
7580 if ((mn).mc_flags & C_SUB) { \
7581 dummy.mc_flags = C_INITIALIZED; \
7582 dummy.mc_xcursor = (MDB_xcursor *)&(mn); \
7587 tracked->mc_next = *tp; \
7590 *tp = tracked->mc_next; \
7593 /** Move a node from csrc to cdst.
7596 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst, int fromleft)
7603 unsigned short flags;
7607 /* Mark src and dst as dirty. */
7608 if ((rc = mdb_page_touch(csrc)) ||
7609 (rc = mdb_page_touch(cdst)))
7612 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7613 key.mv_size = csrc->mc_db->md_pad;
7614 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
7616 data.mv_data = NULL;
7620 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
7621 mdb_cassert(csrc, !((size_t)srcnode & 1));
7622 srcpg = NODEPGNO(srcnode);
7623 flags = srcnode->mn_flags;
7624 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7625 unsigned int snum = csrc->mc_snum;
7627 /* must find the lowest key below src */
7628 rc = mdb_page_search_lowest(csrc);
7631 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7632 key.mv_size = csrc->mc_db->md_pad;
7633 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7635 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7636 key.mv_size = NODEKSZ(s2);
7637 key.mv_data = NODEKEY(s2);
7639 csrc->mc_snum = snum--;
7640 csrc->mc_top = snum;
7642 key.mv_size = NODEKSZ(srcnode);
7643 key.mv_data = NODEKEY(srcnode);
7645 data.mv_size = NODEDSZ(srcnode);
7646 data.mv_data = NODEDATA(srcnode);
7648 mn.mc_xcursor = NULL;
7649 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
7650 unsigned int snum = cdst->mc_snum;
7653 /* must find the lowest key below dst */
7654 mdb_cursor_copy(cdst, &mn);
7655 rc = mdb_page_search_lowest(&mn);
7658 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7659 bkey.mv_size = mn.mc_db->md_pad;
7660 bkey.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, bkey.mv_size);
7662 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7663 bkey.mv_size = NODEKSZ(s2);
7664 bkey.mv_data = NODEKEY(s2);
7666 mn.mc_snum = snum--;
7669 rc = mdb_update_key(&mn, &bkey);
7674 DPRINTF(("moving %s node %u [%s] on page %"Z"u to node %u on page %"Z"u",
7675 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
7676 csrc->mc_ki[csrc->mc_top],
7678 csrc->mc_pg[csrc->mc_top]->mp_pgno,
7679 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno));
7681 /* Add the node to the destination page.
7683 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
7684 if (rc != MDB_SUCCESS)
7687 /* Delete the node from the source page.
7689 mdb_node_del(csrc, key.mv_size);
7692 /* Adjust other cursors pointing to mp */
7693 MDB_cursor *m2, *m3;
7694 MDB_dbi dbi = csrc->mc_dbi;
7695 MDB_page *mpd, *mps;
7697 mps = csrc->mc_pg[csrc->mc_top];
7698 /* If we're adding on the left, bump others up */
7700 mpd = cdst->mc_pg[csrc->mc_top];
7701 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7702 if (csrc->mc_flags & C_SUB)
7703 m3 = &m2->mc_xcursor->mx_cursor;
7706 if (!(m3->mc_flags & C_INITIALIZED) || m3->mc_top < csrc->mc_top)
7709 m3->mc_pg[csrc->mc_top] == mpd &&
7710 m3->mc_ki[csrc->mc_top] >= cdst->mc_ki[csrc->mc_top]) {
7711 m3->mc_ki[csrc->mc_top]++;
7714 m3->mc_pg[csrc->mc_top] == mps &&
7715 m3->mc_ki[csrc->mc_top] == csrc->mc_ki[csrc->mc_top]) {
7716 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
7717 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
7718 m3->mc_ki[csrc->mc_top-1]++;
7720 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) &&
7722 MDB_node *node = NODEPTR(m3->mc_pg[csrc->mc_top], m3->mc_ki[csrc->mc_top]);
7723 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
7724 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
7728 /* Adding on the right, bump others down */
7730 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7731 if (csrc->mc_flags & C_SUB)
7732 m3 = &m2->mc_xcursor->mx_cursor;
7735 if (m3 == csrc) continue;
7736 if (!(m3->mc_flags & C_INITIALIZED) || m3->mc_top < csrc->mc_top)
7738 if (m3->mc_pg[csrc->mc_top] == mps) {
7739 if (!m3->mc_ki[csrc->mc_top]) {
7740 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
7741 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
7742 m3->mc_ki[csrc->mc_top-1]--;
7744 m3->mc_ki[csrc->mc_top]--;
7746 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) &&
7748 MDB_node *node = NODEPTR(m3->mc_pg[csrc->mc_top], m3->mc_ki[csrc->mc_top]);
7749 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
7750 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
7757 /* Update the parent separators.
7759 if (csrc->mc_ki[csrc->mc_top] == 0) {
7760 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
7761 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7762 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7764 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7765 key.mv_size = NODEKSZ(srcnode);
7766 key.mv_data = NODEKEY(srcnode);
7768 DPRINTF(("update separator for source page %"Z"u to [%s]",
7769 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key)));
7770 mdb_cursor_copy(csrc, &mn);
7773 /* We want mdb_rebalance to find mn when doing fixups */
7774 WITH_CURSOR_TRACKING(mn,
7775 rc = mdb_update_key(&mn, &key));
7779 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7781 indx_t ix = csrc->mc_ki[csrc->mc_top];
7782 nullkey.mv_size = 0;
7783 csrc->mc_ki[csrc->mc_top] = 0;
7784 rc = mdb_update_key(csrc, &nullkey);
7785 csrc->mc_ki[csrc->mc_top] = ix;
7786 mdb_cassert(csrc, rc == MDB_SUCCESS);
7790 if (cdst->mc_ki[cdst->mc_top] == 0) {
7791 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
7792 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7793 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
7795 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
7796 key.mv_size = NODEKSZ(srcnode);
7797 key.mv_data = NODEKEY(srcnode);
7799 DPRINTF(("update separator for destination page %"Z"u to [%s]",
7800 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key)));
7801 mdb_cursor_copy(cdst, &mn);
7804 /* We want mdb_rebalance to find mn when doing fixups */
7805 WITH_CURSOR_TRACKING(mn,
7806 rc = mdb_update_key(&mn, &key));
7810 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
7812 indx_t ix = cdst->mc_ki[cdst->mc_top];
7813 nullkey.mv_size = 0;
7814 cdst->mc_ki[cdst->mc_top] = 0;
7815 rc = mdb_update_key(cdst, &nullkey);
7816 cdst->mc_ki[cdst->mc_top] = ix;
7817 mdb_cassert(cdst, rc == MDB_SUCCESS);
7824 /** Merge one page into another.
7825 * The nodes from the page pointed to by \b csrc will
7826 * be copied to the page pointed to by \b cdst and then
7827 * the \b csrc page will be freed.
7828 * @param[in] csrc Cursor pointing to the source page.
7829 * @param[in] cdst Cursor pointing to the destination page.
7830 * @return 0 on success, non-zero on failure.
7833 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
7835 MDB_page *psrc, *pdst;
7842 psrc = csrc->mc_pg[csrc->mc_top];
7843 pdst = cdst->mc_pg[cdst->mc_top];
7845 DPRINTF(("merging page %"Z"u into %"Z"u", psrc->mp_pgno, pdst->mp_pgno));
7847 mdb_cassert(csrc, csrc->mc_snum > 1); /* can't merge root page */
7848 mdb_cassert(csrc, cdst->mc_snum > 1);
7850 /* Mark dst as dirty. */
7851 if ((rc = mdb_page_touch(cdst)))
7854 /* get dst page again now that we've touched it. */
7855 pdst = cdst->mc_pg[cdst->mc_top];
7857 /* Move all nodes from src to dst.
7859 j = nkeys = NUMKEYS(pdst);
7860 if (IS_LEAF2(psrc)) {
7861 key.mv_size = csrc->mc_db->md_pad;
7862 key.mv_data = METADATA(psrc);
7863 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7864 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
7865 if (rc != MDB_SUCCESS)
7867 key.mv_data = (char *)key.mv_data + key.mv_size;
7870 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7871 srcnode = NODEPTR(psrc, i);
7872 if (i == 0 && IS_BRANCH(psrc)) {
7875 mdb_cursor_copy(csrc, &mn);
7876 mn.mc_xcursor = NULL;
7877 /* must find the lowest key below src */
7878 rc = mdb_page_search_lowest(&mn);
7881 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7882 key.mv_size = mn.mc_db->md_pad;
7883 key.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, key.mv_size);
7885 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7886 key.mv_size = NODEKSZ(s2);
7887 key.mv_data = NODEKEY(s2);
7890 key.mv_size = srcnode->mn_ksize;
7891 key.mv_data = NODEKEY(srcnode);
7894 data.mv_size = NODEDSZ(srcnode);
7895 data.mv_data = NODEDATA(srcnode);
7896 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
7897 if (rc != MDB_SUCCESS)
7902 DPRINTF(("dst page %"Z"u now has %u keys (%.1f%% filled)",
7903 pdst->mp_pgno, NUMKEYS(pdst),
7904 (float)PAGEFILL(cdst->mc_txn->mt_env, pdst) / 10));
7906 /* Unlink the src page from parent and add to free list.
7909 mdb_node_del(csrc, 0);
7910 if (csrc->mc_ki[csrc->mc_top] == 0) {
7912 rc = mdb_update_key(csrc, &key);
7920 psrc = csrc->mc_pg[csrc->mc_top];
7921 /* If not operating on FreeDB, allow this page to be reused
7922 * in this txn. Otherwise just add to free list.
7924 rc = mdb_page_loose(csrc, psrc);
7928 csrc->mc_db->md_leaf_pages--;
7930 csrc->mc_db->md_branch_pages--;
7932 /* Adjust other cursors pointing to mp */
7933 MDB_cursor *m2, *m3;
7934 MDB_dbi dbi = csrc->mc_dbi;
7935 unsigned int top = csrc->mc_top;
7937 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7938 if (csrc->mc_flags & C_SUB)
7939 m3 = &m2->mc_xcursor->mx_cursor;
7942 if (m3 == csrc) continue;
7943 if (m3->mc_snum < csrc->mc_snum) continue;
7944 if (m3->mc_pg[top] == psrc) {
7945 m3->mc_pg[top] = pdst;
7946 m3->mc_ki[top] += nkeys;
7947 m3->mc_ki[top-1] = cdst->mc_ki[top-1];
7948 } else if (m3->mc_pg[top-1] == csrc->mc_pg[top-1] &&
7949 m3->mc_ki[top-1] > csrc->mc_ki[top-1]) {
7952 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) &&
7954 MDB_node *node = NODEPTR(m3->mc_pg[top], m3->mc_ki[top]);
7955 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
7956 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
7961 unsigned int snum = cdst->mc_snum;
7962 uint16_t depth = cdst->mc_db->md_depth;
7963 mdb_cursor_pop(cdst);
7964 rc = mdb_rebalance(cdst);
7965 /* Did the tree height change? */
7966 if (depth != cdst->mc_db->md_depth)
7967 snum += cdst->mc_db->md_depth - depth;
7968 cdst->mc_snum = snum;
7969 cdst->mc_top = snum-1;
7974 /** Copy the contents of a cursor.
7975 * @param[in] csrc The cursor to copy from.
7976 * @param[out] cdst The cursor to copy to.
7979 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
7983 cdst->mc_txn = csrc->mc_txn;
7984 cdst->mc_dbi = csrc->mc_dbi;
7985 cdst->mc_db = csrc->mc_db;
7986 cdst->mc_dbx = csrc->mc_dbx;
7987 cdst->mc_snum = csrc->mc_snum;
7988 cdst->mc_top = csrc->mc_top;
7989 cdst->mc_flags = csrc->mc_flags;
7991 for (i=0; i<csrc->mc_snum; i++) {
7992 cdst->mc_pg[i] = csrc->mc_pg[i];
7993 cdst->mc_ki[i] = csrc->mc_ki[i];
7997 /** Rebalance the tree after a delete operation.
7998 * @param[in] mc Cursor pointing to the page where rebalancing
8000 * @return 0 on success, non-zero on failure.
8003 mdb_rebalance(MDB_cursor *mc)
8007 unsigned int ptop, minkeys, thresh;
8011 if (IS_BRANCH(mc->mc_pg[mc->mc_top])) {
8016 thresh = FILL_THRESHOLD;
8018 DPRINTF(("rebalancing %s page %"Z"u (has %u keys, %.1f%% full)",
8019 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
8020 mdb_dbg_pgno(mc->mc_pg[mc->mc_top]), NUMKEYS(mc->mc_pg[mc->mc_top]),
8021 (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10));
8023 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= thresh &&
8024 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
8025 DPRINTF(("no need to rebalance page %"Z"u, above fill threshold",
8026 mdb_dbg_pgno(mc->mc_pg[mc->mc_top])));
8030 if (mc->mc_snum < 2) {
8031 MDB_page *mp = mc->mc_pg[0];
8033 DPUTS("Can't rebalance a subpage, ignoring");
8036 if (NUMKEYS(mp) == 0) {
8037 DPUTS("tree is completely empty");
8038 mc->mc_db->md_root = P_INVALID;
8039 mc->mc_db->md_depth = 0;
8040 mc->mc_db->md_leaf_pages = 0;
8041 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
8044 /* Adjust cursors pointing to mp */
8047 mc->mc_flags &= ~C_INITIALIZED;
8049 MDB_cursor *m2, *m3;
8050 MDB_dbi dbi = mc->mc_dbi;
8052 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8053 if (mc->mc_flags & C_SUB)
8054 m3 = &m2->mc_xcursor->mx_cursor;
8057 if (!(m3->mc_flags & C_INITIALIZED) || (m3->mc_snum < mc->mc_snum))
8059 if (m3->mc_pg[0] == mp) {
8062 m3->mc_flags &= ~C_INITIALIZED;
8066 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
8068 DPUTS("collapsing root page!");
8069 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
8072 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
8073 rc = mdb_page_get(mc->mc_txn,mc->mc_db->md_root,&mc->mc_pg[0],NULL);
8076 mc->mc_db->md_depth--;
8077 mc->mc_db->md_branch_pages--;
8078 mc->mc_ki[0] = mc->mc_ki[1];
8079 for (i = 1; i<mc->mc_db->md_depth; i++) {
8080 mc->mc_pg[i] = mc->mc_pg[i+1];
8081 mc->mc_ki[i] = mc->mc_ki[i+1];
8084 /* Adjust other cursors pointing to mp */
8085 MDB_cursor *m2, *m3;
8086 MDB_dbi dbi = mc->mc_dbi;
8088 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8089 if (mc->mc_flags & C_SUB)
8090 m3 = &m2->mc_xcursor->mx_cursor;
8093 if (m3 == mc) continue;
8094 if (!(m3->mc_flags & C_INITIALIZED))
8096 if (m3->mc_pg[0] == mp) {
8097 for (i=0; i<mc->mc_db->md_depth; i++) {
8098 m3->mc_pg[i] = m3->mc_pg[i+1];
8099 m3->mc_ki[i] = m3->mc_ki[i+1];
8107 DPUTS("root page doesn't need rebalancing");
8111 /* The parent (branch page) must have at least 2 pointers,
8112 * otherwise the tree is invalid.
8114 ptop = mc->mc_top-1;
8115 mdb_cassert(mc, NUMKEYS(mc->mc_pg[ptop]) > 1);
8117 /* Leaf page fill factor is below the threshold.
8118 * Try to move keys from left or right neighbor, or
8119 * merge with a neighbor page.
8124 mdb_cursor_copy(mc, &mn);
8125 mn.mc_xcursor = NULL;
8127 oldki = mc->mc_ki[mc->mc_top];
8128 if (mc->mc_ki[ptop] == 0) {
8129 /* We're the leftmost leaf in our parent.
8131 DPUTS("reading right neighbor");
8133 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
8134 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
8137 mn.mc_ki[mn.mc_top] = 0;
8138 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
8141 /* There is at least one neighbor to the left.
8143 DPUTS("reading left neighbor");
8145 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
8146 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
8149 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
8150 mc->mc_ki[mc->mc_top] = 0;
8154 DPRINTF(("found neighbor page %"Z"u (%u keys, %.1f%% full)",
8155 mn.mc_pg[mn.mc_top]->mp_pgno, NUMKEYS(mn.mc_pg[mn.mc_top]),
8156 (float)PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) / 10));
8158 /* If the neighbor page is above threshold and has enough keys,
8159 * move one key from it. Otherwise we should try to merge them.
8160 * (A branch page must never have less than 2 keys.)
8162 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= thresh && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys) {
8163 rc = mdb_node_move(&mn, mc, fromleft);
8165 /* if we inserted on left, bump position up */
8170 rc = mdb_page_merge(&mn, mc);
8172 oldki += NUMKEYS(mn.mc_pg[mn.mc_top]);
8173 mn.mc_ki[mn.mc_top] += mc->mc_ki[mn.mc_top] + 1;
8174 /* We want mdb_rebalance to find mn when doing fixups */
8175 WITH_CURSOR_TRACKING(mn,
8176 rc = mdb_page_merge(mc, &mn));
8177 mdb_cursor_copy(&mn, mc);
8179 mc->mc_flags &= ~C_EOF;
8181 mc->mc_ki[mc->mc_top] = oldki;
8185 /** Complete a delete operation started by #mdb_cursor_del(). */
8187 mdb_cursor_del0(MDB_cursor *mc)
8193 MDB_cursor *m2, *m3;
8194 MDB_dbi dbi = mc->mc_dbi;
8196 ki = mc->mc_ki[mc->mc_top];
8197 mp = mc->mc_pg[mc->mc_top];
8198 mdb_node_del(mc, mc->mc_db->md_pad);
8199 mc->mc_db->md_entries--;
8201 /* Adjust other cursors pointing to mp */
8202 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8203 m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
8204 if (! (m2->mc_flags & m3->mc_flags & C_INITIALIZED))
8206 if (m3 == mc || m3->mc_snum < mc->mc_snum)
8208 if (m3->mc_pg[mc->mc_top] == mp) {
8209 if (m3->mc_ki[mc->mc_top] == ki) {
8210 m3->mc_flags |= C_DEL;
8211 if (mc->mc_db->md_flags & MDB_DUPSORT)
8212 m3->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
8213 } else if (m3->mc_ki[mc->mc_top] > ki) {
8214 m3->mc_ki[mc->mc_top]--;
8216 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
8217 MDB_node *node = NODEPTR(m3->mc_pg[mc->mc_top], m3->mc_ki[mc->mc_top]);
8218 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
8219 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
8224 rc = mdb_rebalance(mc);
8226 if (rc == MDB_SUCCESS) {
8227 /* DB is totally empty now, just bail out.
8228 * Other cursors adjustments were already done
8229 * by mdb_rebalance and aren't needed here.
8234 mp = mc->mc_pg[mc->mc_top];
8235 nkeys = NUMKEYS(mp);
8237 /* Adjust other cursors pointing to mp */
8238 for (m2 = mc->mc_txn->mt_cursors[dbi]; !rc && m2; m2=m2->mc_next) {
8239 m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
8240 if (! (m2->mc_flags & m3->mc_flags & C_INITIALIZED))
8242 if (m3->mc_snum < mc->mc_snum)
8244 if (m3->mc_pg[mc->mc_top] == mp) {
8245 /* if m3 points past last node in page, find next sibling */
8246 if (m3->mc_ki[mc->mc_top] >= nkeys) {
8247 rc = mdb_cursor_sibling(m3, 1);
8248 if (rc == MDB_NOTFOUND) {
8249 m3->mc_flags |= C_EOF;
8255 mc->mc_flags |= C_DEL;
8259 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
8264 mdb_del(MDB_txn *txn, MDB_dbi dbi,
8265 MDB_val *key, MDB_val *data)
8267 if (!key || !TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
8270 if (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_BLOCKED))
8271 return (txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
8273 if (!F_ISSET(txn->mt_dbs[dbi].md_flags, MDB_DUPSORT)) {
8274 /* must ignore any data */
8278 return mdb_del0(txn, dbi, key, data, 0);
8282 mdb_del0(MDB_txn *txn, MDB_dbi dbi,
8283 MDB_val *key, MDB_val *data, unsigned flags)
8288 MDB_val rdata, *xdata;
8292 DPRINTF(("====> delete db %u key [%s]", dbi, DKEY(key)));
8294 mdb_cursor_init(&mc, txn, dbi, &mx);
8303 flags |= MDB_NODUPDATA;
8305 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
8307 /* let mdb_page_split know about this cursor if needed:
8308 * delete will trigger a rebalance; if it needs to move
8309 * a node from one page to another, it will have to
8310 * update the parent's separator key(s). If the new sepkey
8311 * is larger than the current one, the parent page may
8312 * run out of space, triggering a split. We need this
8313 * cursor to be consistent until the end of the rebalance.
8315 mc.mc_flags |= C_UNTRACK;
8316 mc.mc_next = txn->mt_cursors[dbi];
8317 txn->mt_cursors[dbi] = &mc;
8318 rc = mdb_cursor_del(&mc, flags);
8319 txn->mt_cursors[dbi] = mc.mc_next;
8324 /** Split a page and insert a new node.
8325 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
8326 * The cursor will be updated to point to the actual page and index where
8327 * the node got inserted after the split.
8328 * @param[in] newkey The key for the newly inserted node.
8329 * @param[in] newdata The data for the newly inserted node.
8330 * @param[in] newpgno The page number, if the new node is a branch node.
8331 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
8332 * @return 0 on success, non-zero on failure.
8335 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
8336 unsigned int nflags)
8339 int rc = MDB_SUCCESS, new_root = 0, did_split = 0;
8342 int i, j, split_indx, nkeys, pmax;
8343 MDB_env *env = mc->mc_txn->mt_env;
8345 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
8346 MDB_page *copy = NULL;
8347 MDB_page *mp, *rp, *pp;
8352 mp = mc->mc_pg[mc->mc_top];
8353 newindx = mc->mc_ki[mc->mc_top];
8354 nkeys = NUMKEYS(mp);
8356 DPRINTF(("-----> splitting %s page %"Z"u and adding [%s] at index %i/%i",
8357 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
8358 DKEY(newkey), mc->mc_ki[mc->mc_top], nkeys));
8360 /* Create a right sibling. */
8361 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
8363 rp->mp_pad = mp->mp_pad;
8364 DPRINTF(("new right sibling: page %"Z"u", rp->mp_pgno));
8366 /* Usually when splitting the root page, the cursor
8367 * height is 1. But when called from mdb_update_key,
8368 * the cursor height may be greater because it walks
8369 * up the stack while finding the branch slot to update.
8371 if (mc->mc_top < 1) {
8372 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
8374 /* shift current top to make room for new parent */
8375 for (i=mc->mc_snum; i>0; i--) {
8376 mc->mc_pg[i] = mc->mc_pg[i-1];
8377 mc->mc_ki[i] = mc->mc_ki[i-1];
8381 mc->mc_db->md_root = pp->mp_pgno;
8382 DPRINTF(("root split! new root = %"Z"u", pp->mp_pgno));
8383 new_root = mc->mc_db->md_depth++;
8385 /* Add left (implicit) pointer. */
8386 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
8387 /* undo the pre-push */
8388 mc->mc_pg[0] = mc->mc_pg[1];
8389 mc->mc_ki[0] = mc->mc_ki[1];
8390 mc->mc_db->md_root = mp->mp_pgno;
8391 mc->mc_db->md_depth--;
8398 ptop = mc->mc_top-1;
8399 DPRINTF(("parent branch page is %"Z"u", mc->mc_pg[ptop]->mp_pgno));
8402 mdb_cursor_copy(mc, &mn);
8403 mn.mc_xcursor = NULL;
8404 mn.mc_pg[mn.mc_top] = rp;
8405 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
8407 if (nflags & MDB_APPEND) {
8408 mn.mc_ki[mn.mc_top] = 0;
8410 split_indx = newindx;
8414 split_indx = (nkeys+1) / 2;
8419 unsigned int lsize, rsize, ksize;
8420 /* Move half of the keys to the right sibling */
8421 x = mc->mc_ki[mc->mc_top] - split_indx;
8422 ksize = mc->mc_db->md_pad;
8423 split = LEAF2KEY(mp, split_indx, ksize);
8424 rsize = (nkeys - split_indx) * ksize;
8425 lsize = (nkeys - split_indx) * sizeof(indx_t);
8426 mp->mp_lower -= lsize;
8427 rp->mp_lower += lsize;
8428 mp->mp_upper += rsize - lsize;
8429 rp->mp_upper -= rsize - lsize;
8430 sepkey.mv_size = ksize;
8431 if (newindx == split_indx) {
8432 sepkey.mv_data = newkey->mv_data;
8434 sepkey.mv_data = split;
8437 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
8438 memcpy(rp->mp_ptrs, split, rsize);
8439 sepkey.mv_data = rp->mp_ptrs;
8440 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
8441 memcpy(ins, newkey->mv_data, ksize);
8442 mp->mp_lower += sizeof(indx_t);
8443 mp->mp_upper -= ksize - sizeof(indx_t);
8446 memcpy(rp->mp_ptrs, split, x * ksize);
8447 ins = LEAF2KEY(rp, x, ksize);
8448 memcpy(ins, newkey->mv_data, ksize);
8449 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
8450 rp->mp_lower += sizeof(indx_t);
8451 rp->mp_upper -= ksize - sizeof(indx_t);
8452 mc->mc_ki[mc->mc_top] = x;
8455 int psize, nsize, k;
8456 /* Maximum free space in an empty page */
8457 pmax = env->me_psize - PAGEHDRSZ;
8459 nsize = mdb_leaf_size(env, newkey, newdata);
8461 nsize = mdb_branch_size(env, newkey);
8462 nsize = EVEN(nsize);
8464 /* grab a page to hold a temporary copy */
8465 copy = mdb_page_malloc(mc->mc_txn, 1);
8470 copy->mp_pgno = mp->mp_pgno;
8471 copy->mp_flags = mp->mp_flags;
8472 copy->mp_lower = (PAGEHDRSZ-PAGEBASE);
8473 copy->mp_upper = env->me_psize - PAGEBASE;
8475 /* prepare to insert */
8476 for (i=0, j=0; i<nkeys; i++) {
8478 copy->mp_ptrs[j++] = 0;
8480 copy->mp_ptrs[j++] = mp->mp_ptrs[i];
8483 /* When items are relatively large the split point needs
8484 * to be checked, because being off-by-one will make the
8485 * difference between success or failure in mdb_node_add.
8487 * It's also relevant if a page happens to be laid out
8488 * such that one half of its nodes are all "small" and
8489 * the other half of its nodes are "large." If the new
8490 * item is also "large" and falls on the half with
8491 * "large" nodes, it also may not fit.
8493 * As a final tweak, if the new item goes on the last
8494 * spot on the page (and thus, onto the new page), bias
8495 * the split so the new page is emptier than the old page.
8496 * This yields better packing during sequential inserts.
8498 if (nkeys < 20 || nsize > pmax/16 || newindx >= nkeys) {
8499 /* Find split point */
8501 if (newindx <= split_indx || newindx >= nkeys) {
8503 k = newindx >= nkeys ? nkeys : split_indx+1+IS_LEAF(mp);
8508 for (; i!=k; i+=j) {
8513 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
8514 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
8516 if (F_ISSET(node->mn_flags, F_BIGDATA))
8517 psize += sizeof(pgno_t);
8519 psize += NODEDSZ(node);
8521 psize = EVEN(psize);
8523 if (psize > pmax || i == k-j) {
8524 split_indx = i + (j<0);
8529 if (split_indx == newindx) {
8530 sepkey.mv_size = newkey->mv_size;
8531 sepkey.mv_data = newkey->mv_data;
8533 node = (MDB_node *)((char *)mp + copy->mp_ptrs[split_indx] + PAGEBASE);
8534 sepkey.mv_size = node->mn_ksize;
8535 sepkey.mv_data = NODEKEY(node);
8540 DPRINTF(("separator is %d [%s]", split_indx, DKEY(&sepkey)));
8542 /* Copy separator key to the parent.
8544 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(env, &sepkey)) {
8545 int snum = mc->mc_snum;
8549 /* We want other splits to find mn when doing fixups */
8550 WITH_CURSOR_TRACKING(mn,
8551 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0));
8556 if (mc->mc_snum > snum) {
8559 /* Right page might now have changed parent.
8560 * Check if left page also changed parent.
8562 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8563 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8564 for (i=0; i<ptop; i++) {
8565 mc->mc_pg[i] = mn.mc_pg[i];
8566 mc->mc_ki[i] = mn.mc_ki[i];
8568 mc->mc_pg[ptop] = mn.mc_pg[ptop];
8569 if (mn.mc_ki[ptop]) {
8570 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
8572 /* find right page's left sibling */
8573 mc->mc_ki[ptop] = mn.mc_ki[ptop];
8574 mdb_cursor_sibling(mc, 0);
8579 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
8582 if (rc != MDB_SUCCESS) {
8585 if (nflags & MDB_APPEND) {
8586 mc->mc_pg[mc->mc_top] = rp;
8587 mc->mc_ki[mc->mc_top] = 0;
8588 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
8591 for (i=0; i<mc->mc_top; i++)
8592 mc->mc_ki[i] = mn.mc_ki[i];
8593 } else if (!IS_LEAF2(mp)) {
8595 mc->mc_pg[mc->mc_top] = rp;
8600 rkey.mv_data = newkey->mv_data;
8601 rkey.mv_size = newkey->mv_size;
8607 /* Update index for the new key. */
8608 mc->mc_ki[mc->mc_top] = j;
8610 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
8611 rkey.mv_data = NODEKEY(node);
8612 rkey.mv_size = node->mn_ksize;
8614 xdata.mv_data = NODEDATA(node);
8615 xdata.mv_size = NODEDSZ(node);
8618 pgno = NODEPGNO(node);
8619 flags = node->mn_flags;
8622 if (!IS_LEAF(mp) && j == 0) {
8623 /* First branch index doesn't need key data. */
8627 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
8633 mc->mc_pg[mc->mc_top] = copy;
8638 } while (i != split_indx);
8640 nkeys = NUMKEYS(copy);
8641 for (i=0; i<nkeys; i++)
8642 mp->mp_ptrs[i] = copy->mp_ptrs[i];
8643 mp->mp_lower = copy->mp_lower;
8644 mp->mp_upper = copy->mp_upper;
8645 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
8646 env->me_psize - copy->mp_upper - PAGEBASE);
8648 /* reset back to original page */
8649 if (newindx < split_indx) {
8650 mc->mc_pg[mc->mc_top] = mp;
8652 mc->mc_pg[mc->mc_top] = rp;
8654 /* Make sure mc_ki is still valid.
8656 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8657 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8658 for (i=0; i<=ptop; i++) {
8659 mc->mc_pg[i] = mn.mc_pg[i];
8660 mc->mc_ki[i] = mn.mc_ki[i];
8664 if (nflags & MDB_RESERVE) {
8665 node = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
8666 if (!(node->mn_flags & F_BIGDATA))
8667 newdata->mv_data = NODEDATA(node);
8670 if (newindx >= split_indx) {
8671 mc->mc_pg[mc->mc_top] = rp;
8673 /* Make sure mc_ki is still valid.
8675 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8676 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8677 for (i=0; i<=ptop; i++) {
8678 mc->mc_pg[i] = mn.mc_pg[i];
8679 mc->mc_ki[i] = mn.mc_ki[i];
8686 /* Adjust other cursors pointing to mp */
8687 MDB_cursor *m2, *m3;
8688 MDB_dbi dbi = mc->mc_dbi;
8689 nkeys = NUMKEYS(mp);
8691 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8692 if (mc->mc_flags & C_SUB)
8693 m3 = &m2->mc_xcursor->mx_cursor;
8698 if (!(m2->mc_flags & m3->mc_flags & C_INITIALIZED))
8702 /* sub cursors may be on different DB */
8703 if (m3->mc_pg[0] != mp)
8706 for (k=new_root; k>=0; k--) {
8707 m3->mc_ki[k+1] = m3->mc_ki[k];
8708 m3->mc_pg[k+1] = m3->mc_pg[k];
8710 if (m3->mc_ki[0] >= nkeys) {
8715 m3->mc_pg[0] = mc->mc_pg[0];
8719 if (m3->mc_top >= mc->mc_top && m3->mc_pg[mc->mc_top] == mp) {
8720 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
8721 m3->mc_ki[mc->mc_top]++;
8722 if (m3->mc_ki[mc->mc_top] >= nkeys) {
8723 m3->mc_pg[mc->mc_top] = rp;
8724 m3->mc_ki[mc->mc_top] -= nkeys;
8725 for (i=0; i<mc->mc_top; i++) {
8726 m3->mc_ki[i] = mn.mc_ki[i];
8727 m3->mc_pg[i] = mn.mc_pg[i];
8730 } else if (!did_split && m3->mc_top >= ptop && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
8731 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
8734 if (m3->mc_xcursor && (m3->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) &&
8736 MDB_node *node = NODEPTR(m3->mc_pg[mc->mc_top], m3->mc_ki[mc->mc_top]);
8737 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA)
8738 m3->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(node);
8742 DPRINTF(("mp left: %d, rp left: %d", SIZELEFT(mp), SIZELEFT(rp)));
8745 if (copy) /* tmp page */
8746 mdb_page_free(env, copy);
8748 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
8753 mdb_put(MDB_txn *txn, MDB_dbi dbi,
8754 MDB_val *key, MDB_val *data, unsigned int flags)
8760 if (!key || !data || !TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
8763 if (flags & ~(MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP))
8766 if (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_BLOCKED))
8767 return (txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
8769 mdb_cursor_init(&mc, txn, dbi, &mx);
8770 mc.mc_next = txn->mt_cursors[dbi];
8771 txn->mt_cursors[dbi] = &mc;
8772 rc = mdb_cursor_put(&mc, key, data, flags);
8773 txn->mt_cursors[dbi] = mc.mc_next;
8778 #define MDB_WBUF (1024*1024)
8781 /** State needed for a compacting copy. */
8782 typedef struct mdb_copy {
8783 pthread_mutex_t mc_mutex;
8784 pthread_cond_t mc_cond;
8791 pgno_t mc_next_pgno;
8794 volatile int mc_new;
8799 /** Dedicated writer thread for compacting copy. */
8800 static THREAD_RET ESECT CALL_CONV
8801 mdb_env_copythr(void *arg)
8805 int toggle = 0, wsize, rc;
8808 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
8811 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
8814 pthread_mutex_lock(&my->mc_mutex);
8816 pthread_cond_signal(&my->mc_cond);
8819 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8820 if (my->mc_new < 0) {
8825 wsize = my->mc_wlen[toggle];
8826 ptr = my->mc_wbuf[toggle];
8829 DO_WRITE(rc, my->mc_fd, ptr, wsize, len);
8833 } else if (len > 0) {
8847 /* If there's an overflow page tail, write it too */
8848 if (my->mc_olen[toggle]) {
8849 wsize = my->mc_olen[toggle];
8850 ptr = my->mc_over[toggle];
8851 my->mc_olen[toggle] = 0;
8854 my->mc_wlen[toggle] = 0;
8856 pthread_cond_signal(&my->mc_cond);
8858 pthread_cond_signal(&my->mc_cond);
8859 pthread_mutex_unlock(&my->mc_mutex);
8860 return (THREAD_RET)0;
8864 /** Tell the writer thread there's a buffer ready to write */
8866 mdb_env_cthr_toggle(mdb_copy *my, int st)
8868 int toggle = my->mc_toggle ^ 1;
8869 pthread_mutex_lock(&my->mc_mutex);
8870 if (my->mc_status) {
8871 pthread_mutex_unlock(&my->mc_mutex);
8872 return my->mc_status;
8874 while (my->mc_new == 1)
8875 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8877 my->mc_toggle = toggle;
8878 pthread_cond_signal(&my->mc_cond);
8879 pthread_mutex_unlock(&my->mc_mutex);
8883 /** Depth-first tree traversal for compacting copy. */
8885 mdb_env_cwalk(mdb_copy *my, pgno_t *pg, int flags)
8888 MDB_txn *txn = my->mc_txn;
8890 MDB_page *mo, *mp, *leaf;
8895 /* Empty DB, nothing to do */
8896 if (*pg == P_INVALID)
8903 rc = mdb_page_get(my->mc_txn, *pg, &mc.mc_pg[0], NULL);
8906 rc = mdb_page_search_root(&mc, NULL, MDB_PS_FIRST);
8910 /* Make cursor pages writable */
8911 buf = ptr = malloc(my->mc_env->me_psize * mc.mc_snum);
8915 for (i=0; i<mc.mc_top; i++) {
8916 mdb_page_copy((MDB_page *)ptr, mc.mc_pg[i], my->mc_env->me_psize);
8917 mc.mc_pg[i] = (MDB_page *)ptr;
8918 ptr += my->mc_env->me_psize;
8921 /* This is writable space for a leaf page. Usually not needed. */
8922 leaf = (MDB_page *)ptr;
8924 toggle = my->mc_toggle;
8925 while (mc.mc_snum > 0) {
8927 mp = mc.mc_pg[mc.mc_top];
8931 if (!IS_LEAF2(mp) && !(flags & F_DUPDATA)) {
8932 for (i=0; i<n; i++) {
8933 ni = NODEPTR(mp, i);
8934 if (ni->mn_flags & F_BIGDATA) {
8938 /* Need writable leaf */
8940 mc.mc_pg[mc.mc_top] = leaf;
8941 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8943 ni = NODEPTR(mp, i);
8946 memcpy(&pg, NODEDATA(ni), sizeof(pg));
8947 rc = mdb_page_get(txn, pg, &omp, NULL);
8950 if (my->mc_wlen[toggle] >= MDB_WBUF) {
8951 rc = mdb_env_cthr_toggle(my, 1);
8954 toggle = my->mc_toggle;
8956 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
8957 memcpy(mo, omp, my->mc_env->me_psize);
8958 mo->mp_pgno = my->mc_next_pgno;
8959 my->mc_next_pgno += omp->mp_pages;
8960 my->mc_wlen[toggle] += my->mc_env->me_psize;
8961 if (omp->mp_pages > 1) {
8962 my->mc_olen[toggle] = my->mc_env->me_psize * (omp->mp_pages - 1);
8963 my->mc_over[toggle] = (char *)omp + my->mc_env->me_psize;
8964 rc = mdb_env_cthr_toggle(my, 1);
8967 toggle = my->mc_toggle;
8969 memcpy(NODEDATA(ni), &mo->mp_pgno, sizeof(pgno_t));
8970 } else if (ni->mn_flags & F_SUBDATA) {
8973 /* Need writable leaf */
8975 mc.mc_pg[mc.mc_top] = leaf;
8976 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8978 ni = NODEPTR(mp, i);
8981 memcpy(&db, NODEDATA(ni), sizeof(db));
8982 my->mc_toggle = toggle;
8983 rc = mdb_env_cwalk(my, &db.md_root, ni->mn_flags & F_DUPDATA);
8986 toggle = my->mc_toggle;
8987 memcpy(NODEDATA(ni), &db, sizeof(db));
8992 mc.mc_ki[mc.mc_top]++;
8993 if (mc.mc_ki[mc.mc_top] < n) {
8996 ni = NODEPTR(mp, mc.mc_ki[mc.mc_top]);
8998 rc = mdb_page_get(txn, pg, &mp, NULL);
9003 mc.mc_ki[mc.mc_top] = 0;
9004 if (IS_BRANCH(mp)) {
9005 /* Whenever we advance to a sibling branch page,
9006 * we must proceed all the way down to its first leaf.
9008 mdb_page_copy(mc.mc_pg[mc.mc_top], mp, my->mc_env->me_psize);
9011 mc.mc_pg[mc.mc_top] = mp;
9015 if (my->mc_wlen[toggle] >= MDB_WBUF) {
9016 rc = mdb_env_cthr_toggle(my, 1);
9019 toggle = my->mc_toggle;
9021 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
9022 mdb_page_copy(mo, mp, my->mc_env->me_psize);
9023 mo->mp_pgno = my->mc_next_pgno++;
9024 my->mc_wlen[toggle] += my->mc_env->me_psize;
9026 /* Update parent if there is one */
9027 ni = NODEPTR(mc.mc_pg[mc.mc_top-1], mc.mc_ki[mc.mc_top-1]);
9028 SETPGNO(ni, mo->mp_pgno);
9029 mdb_cursor_pop(&mc);
9031 /* Otherwise we're done */
9041 /** Copy environment with compaction. */
9043 mdb_env_copyfd1(MDB_env *env, HANDLE fd)
9048 MDB_txn *txn = NULL;
9053 my.mc_mutex = CreateMutex(NULL, FALSE, NULL);
9054 my.mc_cond = CreateEvent(NULL, FALSE, FALSE, NULL);
9055 my.mc_wbuf[0] = _aligned_malloc(MDB_WBUF*2, env->me_os_psize);
9056 if (my.mc_wbuf[0] == NULL)
9059 pthread_mutex_init(&my.mc_mutex, NULL);
9060 pthread_cond_init(&my.mc_cond, NULL);
9061 #ifdef HAVE_MEMALIGN
9062 my.mc_wbuf[0] = memalign(env->me_os_psize, MDB_WBUF*2);
9063 if (my.mc_wbuf[0] == NULL)
9066 rc = posix_memalign((void **)&my.mc_wbuf[0], env->me_os_psize, MDB_WBUF*2);
9071 memset(my.mc_wbuf[0], 0, MDB_WBUF*2);
9072 my.mc_wbuf[1] = my.mc_wbuf[0] + MDB_WBUF;
9077 my.mc_next_pgno = NUM_METAS;
9083 THREAD_CREATE(thr, mdb_env_copythr, &my);
9085 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
9089 mp = (MDB_page *)my.mc_wbuf[0];
9090 memset(mp, 0, NUM_METAS * env->me_psize);
9092 mp->mp_flags = P_META;
9093 mm = (MDB_meta *)METADATA(mp);
9094 mdb_env_init_meta0(env, mm);
9095 mm->mm_address = env->me_metas[0]->mm_address;
9097 mp = (MDB_page *)(my.mc_wbuf[0] + env->me_psize);
9099 mp->mp_flags = P_META;
9100 *(MDB_meta *)METADATA(mp) = *mm;
9101 mm = (MDB_meta *)METADATA(mp);
9103 /* Count the number of free pages, subtract from lastpg to find
9104 * number of active pages
9107 MDB_ID freecount = 0;
9110 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
9111 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
9112 freecount += *(MDB_ID *)data.mv_data;
9113 freecount += txn->mt_dbs[FREE_DBI].md_branch_pages +
9114 txn->mt_dbs[FREE_DBI].md_leaf_pages +
9115 txn->mt_dbs[FREE_DBI].md_overflow_pages;
9117 /* Set metapage 1 */
9118 mm->mm_last_pg = txn->mt_next_pgno - freecount - 1;
9119 mm->mm_dbs[MAIN_DBI] = txn->mt_dbs[MAIN_DBI];
9120 if (mm->mm_last_pg > NUM_METAS-1) {
9121 mm->mm_dbs[MAIN_DBI].md_root = mm->mm_last_pg;
9124 mm->mm_dbs[MAIN_DBI].md_root = P_INVALID;
9127 my.mc_wlen[0] = env->me_psize * NUM_METAS;
9129 pthread_mutex_lock(&my.mc_mutex);
9131 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
9132 pthread_mutex_unlock(&my.mc_mutex);
9133 rc = mdb_env_cwalk(&my, &txn->mt_dbs[MAIN_DBI].md_root, 0);
9134 if (rc == MDB_SUCCESS && my.mc_wlen[my.mc_toggle])
9135 rc = mdb_env_cthr_toggle(&my, 1);
9136 mdb_env_cthr_toggle(&my, -1);
9137 pthread_mutex_lock(&my.mc_mutex);
9139 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
9140 pthread_mutex_unlock(&my.mc_mutex);
9145 CloseHandle(my.mc_cond);
9146 CloseHandle(my.mc_mutex);
9147 _aligned_free(my.mc_wbuf[0]);
9149 pthread_cond_destroy(&my.mc_cond);
9150 pthread_mutex_destroy(&my.mc_mutex);
9151 free(my.mc_wbuf[0]);
9156 /** Copy environment as-is. */
9158 mdb_env_copyfd0(MDB_env *env, HANDLE fd)
9160 MDB_txn *txn = NULL;
9161 mdb_mutexref_t wmutex = NULL;
9167 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
9171 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
9174 /* Do the lock/unlock of the reader mutex before starting the
9175 * write txn. Otherwise other read txns could block writers.
9177 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
9182 /* We must start the actual read txn after blocking writers */
9183 mdb_txn_end(txn, MDB_END_RESET_TMP);
9185 /* Temporarily block writers until we snapshot the meta pages */
9186 wmutex = env->me_wmutex;
9187 if (LOCK_MUTEX(rc, env, wmutex))
9190 rc = mdb_txn_renew0(txn);
9192 UNLOCK_MUTEX(wmutex);
9197 wsize = env->me_psize * NUM_METAS;
9201 DO_WRITE(rc, fd, ptr, w2, len);
9205 } else if (len > 0) {
9211 /* Non-blocking or async handles are not supported */
9217 UNLOCK_MUTEX(wmutex);
9222 w3 = txn->mt_next_pgno * env->me_psize;
9225 if ((rc = mdb_fsize(env->me_fd, &fsize)))
9232 if (wsize > MAX_WRITE)
9236 DO_WRITE(rc, fd, ptr, w2, len);
9240 } else if (len > 0) {
9257 mdb_env_copyfd2(MDB_env *env, HANDLE fd, unsigned int flags)
9259 if (flags & MDB_CP_COMPACT)
9260 return mdb_env_copyfd1(env, fd);
9262 return mdb_env_copyfd0(env, fd);
9266 mdb_env_copyfd(MDB_env *env, HANDLE fd)
9268 return mdb_env_copyfd2(env, fd, 0);
9272 mdb_env_copy2(MDB_env *env, const char *path, unsigned int flags)
9276 HANDLE newfd = INVALID_HANDLE_VALUE;
9281 if (env->me_flags & MDB_NOSUBDIR) {
9282 lpath = (char *)path;
9285 len += sizeof(DATANAME);
9286 lpath = malloc(len);
9289 sprintf(lpath, "%s" DATANAME, path);
9292 /* The destination path must exist, but the destination file must not.
9293 * We don't want the OS to cache the writes, since the source data is
9294 * already in the OS cache.
9297 rc = utf8_to_utf16(lpath, -1, &wpath, NULL);
9300 newfd = CreateFileW(wpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
9301 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
9304 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL, 0666);
9306 if (newfd == INVALID_HANDLE_VALUE) {
9311 if (env->me_psize >= env->me_os_psize) {
9313 /* Set O_DIRECT if the file system supports it */
9314 if ((rc = fcntl(newfd, F_GETFL)) != -1)
9315 (void) fcntl(newfd, F_SETFL, rc | O_DIRECT);
9317 #ifdef F_NOCACHE /* __APPLE__ */
9318 rc = fcntl(newfd, F_NOCACHE, 1);
9326 rc = mdb_env_copyfd2(env, newfd, flags);
9329 if (!(env->me_flags & MDB_NOSUBDIR))
9331 if (newfd != INVALID_HANDLE_VALUE)
9332 if (close(newfd) < 0 && rc == MDB_SUCCESS)
9339 mdb_env_copy(MDB_env *env, const char *path)
9341 return mdb_env_copy2(env, path, 0);
9345 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
9347 if (flag & ~CHANGEABLE)
9350 env->me_flags |= flag;
9352 env->me_flags &= ~flag;
9357 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
9362 *arg = env->me_flags & (CHANGEABLE|CHANGELESS);
9367 mdb_env_set_userctx(MDB_env *env, void *ctx)
9371 env->me_userctx = ctx;
9376 mdb_env_get_userctx(MDB_env *env)
9378 return env ? env->me_userctx : NULL;
9382 mdb_env_set_assert(MDB_env *env, MDB_assert_func *func)
9387 env->me_assert_func = func;
9393 mdb_env_get_path(MDB_env *env, const char **arg)
9398 *arg = env->me_path;
9403 mdb_env_get_fd(MDB_env *env, mdb_filehandle_t *arg)
9412 /** Common code for #mdb_stat() and #mdb_env_stat().
9413 * @param[in] env the environment to operate in.
9414 * @param[in] db the #MDB_db record containing the stats to return.
9415 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
9416 * @return 0, this function always succeeds.
9419 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
9421 arg->ms_psize = env->me_psize;
9422 arg->ms_depth = db->md_depth;
9423 arg->ms_branch_pages = db->md_branch_pages;
9424 arg->ms_leaf_pages = db->md_leaf_pages;
9425 arg->ms_overflow_pages = db->md_overflow_pages;
9426 arg->ms_entries = db->md_entries;
9432 mdb_env_stat(MDB_env *env, MDB_stat *arg)
9436 if (env == NULL || arg == NULL)
9439 meta = mdb_env_pick_meta(env);
9441 return mdb_stat0(env, &meta->mm_dbs[MAIN_DBI], arg);
9445 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
9449 if (env == NULL || arg == NULL)
9452 meta = mdb_env_pick_meta(env);
9453 arg->me_mapaddr = meta->mm_address;
9454 arg->me_last_pgno = meta->mm_last_pg;
9455 arg->me_last_txnid = meta->mm_txnid;
9457 arg->me_mapsize = env->me_mapsize;
9458 arg->me_maxreaders = env->me_maxreaders;
9459 arg->me_numreaders = env->me_txns ? env->me_txns->mti_numreaders : 0;
9463 /** Set the default comparison functions for a database.
9464 * Called immediately after a database is opened to set the defaults.
9465 * The user can then override them with #mdb_set_compare() or
9466 * #mdb_set_dupsort().
9467 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
9468 * @param[in] dbi A database handle returned by #mdb_dbi_open()
9471 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
9473 uint16_t f = txn->mt_dbs[dbi].md_flags;
9475 txn->mt_dbxs[dbi].md_cmp =
9476 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
9477 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
9479 txn->mt_dbxs[dbi].md_dcmp =
9480 !(f & MDB_DUPSORT) ? 0 :
9481 ((f & MDB_INTEGERDUP)
9482 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
9483 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
9486 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
9492 int rc, dbflag, exact;
9493 unsigned int unused = 0, seq;
9497 if (flags & ~VALID_FLAGS)
9499 if (txn->mt_flags & MDB_TXN_BLOCKED)
9505 if (flags & PERSISTENT_FLAGS) {
9506 uint16_t f2 = flags & PERSISTENT_FLAGS;
9507 /* make sure flag changes get committed */
9508 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
9509 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
9510 txn->mt_flags |= MDB_TXN_DIRTY;
9513 mdb_default_cmp(txn, MAIN_DBI);
9517 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
9518 mdb_default_cmp(txn, MAIN_DBI);
9521 /* Is the DB already open? */
9523 for (i=CORE_DBS; i<txn->mt_numdbs; i++) {
9524 if (!txn->mt_dbxs[i].md_name.mv_size) {
9525 /* Remember this free slot */
9526 if (!unused) unused = i;
9529 if (len == txn->mt_dbxs[i].md_name.mv_size &&
9530 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
9536 /* If no free slot and max hit, fail */
9537 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
9538 return MDB_DBS_FULL;
9540 /* Cannot mix named databases with some mainDB flags */
9541 if (txn->mt_dbs[MAIN_DBI].md_flags & (MDB_DUPSORT|MDB_INTEGERKEY))
9542 return (flags & MDB_CREATE) ? MDB_INCOMPATIBLE : MDB_NOTFOUND;
9544 /* Find the DB info */
9545 dbflag = DB_NEW|DB_VALID|DB_USRVALID;
9548 key.mv_data = (void *)name;
9549 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
9550 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
9551 if (rc == MDB_SUCCESS) {
9552 /* make sure this is actually a DB */
9553 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
9554 if ((node->mn_flags & (F_DUPDATA|F_SUBDATA)) != F_SUBDATA)
9555 return MDB_INCOMPATIBLE;
9556 } else if (! (rc == MDB_NOTFOUND && (flags & MDB_CREATE))) {
9560 /* Done here so we cannot fail after creating a new DB */
9561 if ((namedup = strdup(name)) == NULL)
9565 /* MDB_NOTFOUND and MDB_CREATE: Create new DB */
9566 data.mv_size = sizeof(MDB_db);
9567 data.mv_data = &dummy;
9568 memset(&dummy, 0, sizeof(dummy));
9569 dummy.md_root = P_INVALID;
9570 dummy.md_flags = flags & PERSISTENT_FLAGS;
9571 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
9578 /* Got info, register DBI in this txn */
9579 unsigned int slot = unused ? unused : txn->mt_numdbs;
9580 txn->mt_dbxs[slot].md_name.mv_data = namedup;
9581 txn->mt_dbxs[slot].md_name.mv_size = len;
9582 txn->mt_dbxs[slot].md_rel = NULL;
9583 txn->mt_dbflags[slot] = dbflag;
9584 /* txn-> and env-> are the same in read txns, use
9585 * tmp variable to avoid undefined assignment
9587 seq = ++txn->mt_env->me_dbiseqs[slot];
9588 txn->mt_dbiseqs[slot] = seq;
9590 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
9592 mdb_default_cmp(txn, slot);
9602 mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
9604 if (!arg || !TXN_DBI_EXIST(txn, dbi, DB_VALID))
9607 if (txn->mt_flags & MDB_TXN_BLOCKED)
9610 if (txn->mt_dbflags[dbi] & DB_STALE) {
9613 /* Stale, must read the DB's root. cursor_init does it for us. */
9614 mdb_cursor_init(&mc, txn, dbi, &mx);
9616 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
9619 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
9622 if (dbi < CORE_DBS || dbi >= env->me_maxdbs)
9624 ptr = env->me_dbxs[dbi].md_name.mv_data;
9625 /* If there was no name, this was already closed */
9627 env->me_dbxs[dbi].md_name.mv_data = NULL;
9628 env->me_dbxs[dbi].md_name.mv_size = 0;
9629 env->me_dbflags[dbi] = 0;
9630 env->me_dbiseqs[dbi]++;
9635 int mdb_dbi_flags(MDB_txn *txn, MDB_dbi dbi, unsigned int *flags)
9637 /* We could return the flags for the FREE_DBI too but what's the point? */
9638 if (!TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9640 *flags = txn->mt_dbs[dbi].md_flags & PERSISTENT_FLAGS;
9644 /** Add all the DB's pages to the free list.
9645 * @param[in] mc Cursor on the DB to free.
9646 * @param[in] subs non-Zero to check for sub-DBs in this DB.
9647 * @return 0 on success, non-zero on failure.
9650 mdb_drop0(MDB_cursor *mc, int subs)
9654 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
9655 if (rc == MDB_SUCCESS) {
9656 MDB_txn *txn = mc->mc_txn;
9661 /* DUPSORT sub-DBs have no ovpages/DBs. Omit scanning leaves.
9662 * This also avoids any P_LEAF2 pages, which have no nodes.
9663 * Also if the DB doesn't have sub-DBs and has no overflow
9664 * pages, omit scanning leaves.
9666 if ((mc->mc_flags & C_SUB) ||
9667 (!subs && !mc->mc_db->md_overflow_pages))
9670 mdb_cursor_copy(mc, &mx);
9671 while (mc->mc_snum > 0) {
9672 MDB_page *mp = mc->mc_pg[mc->mc_top];
9673 unsigned n = NUMKEYS(mp);
9675 for (i=0; i<n; i++) {
9676 ni = NODEPTR(mp, i);
9677 if (ni->mn_flags & F_BIGDATA) {
9680 memcpy(&pg, NODEDATA(ni), sizeof(pg));
9681 rc = mdb_page_get(txn, pg, &omp, NULL);
9684 mdb_cassert(mc, IS_OVERFLOW(omp));
9685 rc = mdb_midl_append_range(&txn->mt_free_pgs,
9689 mc->mc_db->md_overflow_pages -= omp->mp_pages;
9690 if (!mc->mc_db->md_overflow_pages && !subs)
9692 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
9693 mdb_xcursor_init1(mc, ni);
9694 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
9699 if (!subs && !mc->mc_db->md_overflow_pages)
9702 if ((rc = mdb_midl_need(&txn->mt_free_pgs, n)) != 0)
9704 for (i=0; i<n; i++) {
9706 ni = NODEPTR(mp, i);
9709 mdb_midl_xappend(txn->mt_free_pgs, pg);
9714 mc->mc_ki[mc->mc_top] = i;
9715 rc = mdb_cursor_sibling(mc, 1);
9717 if (rc != MDB_NOTFOUND)
9719 /* no more siblings, go back to beginning
9720 * of previous level.
9725 for (i=1; i<mc->mc_snum; i++) {
9727 mc->mc_pg[i] = mx.mc_pg[i];
9732 rc = mdb_midl_append(&txn->mt_free_pgs, mc->mc_db->md_root);
9735 txn->mt_flags |= MDB_TXN_ERROR;
9736 } else if (rc == MDB_NOTFOUND) {
9739 mc->mc_flags &= ~C_INITIALIZED;
9743 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
9745 MDB_cursor *mc, *m2;
9748 if ((unsigned)del > 1 || !TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9751 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
9754 if (TXN_DBI_CHANGED(txn, dbi))
9757 rc = mdb_cursor_open(txn, dbi, &mc);
9761 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
9762 /* Invalidate the dropped DB's cursors */
9763 for (m2 = txn->mt_cursors[dbi]; m2; m2 = m2->mc_next)
9764 m2->mc_flags &= ~(C_INITIALIZED|C_EOF);
9768 /* Can't delete the main DB */
9769 if (del && dbi >= CORE_DBS) {
9770 rc = mdb_del0(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL, F_SUBDATA);
9772 txn->mt_dbflags[dbi] = DB_STALE;
9773 mdb_dbi_close(txn->mt_env, dbi);
9775 txn->mt_flags |= MDB_TXN_ERROR;
9778 /* reset the DB record, mark it dirty */
9779 txn->mt_dbflags[dbi] |= DB_DIRTY;
9780 txn->mt_dbs[dbi].md_depth = 0;
9781 txn->mt_dbs[dbi].md_branch_pages = 0;
9782 txn->mt_dbs[dbi].md_leaf_pages = 0;
9783 txn->mt_dbs[dbi].md_overflow_pages = 0;
9784 txn->mt_dbs[dbi].md_entries = 0;
9785 txn->mt_dbs[dbi].md_root = P_INVALID;
9787 txn->mt_flags |= MDB_TXN_DIRTY;
9790 mdb_cursor_close(mc);
9794 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9796 if (!TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9799 txn->mt_dbxs[dbi].md_cmp = cmp;
9803 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9805 if (!TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9808 txn->mt_dbxs[dbi].md_dcmp = cmp;
9812 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
9814 if (!TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9817 txn->mt_dbxs[dbi].md_rel = rel;
9821 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
9823 if (!TXN_DBI_EXIST(txn, dbi, DB_USRVALID))
9826 txn->mt_dbxs[dbi].md_relctx = ctx;
9831 mdb_env_get_maxkeysize(MDB_env *env)
9833 return ENV_MAXKEY(env);
9837 mdb_reader_list(MDB_env *env, MDB_msg_func *func, void *ctx)
9839 unsigned int i, rdrs;
9842 int rc = 0, first = 1;
9846 if (!env->me_txns) {
9847 return func("(no reader locks)\n", ctx);
9849 rdrs = env->me_txns->mti_numreaders;
9850 mr = env->me_txns->mti_readers;
9851 for (i=0; i<rdrs; i++) {
9853 txnid_t txnid = mr[i].mr_txnid;
9854 sprintf(buf, txnid == (txnid_t)-1 ?
9855 "%10d %"Z"x -\n" : "%10d %"Z"x %"Z"u\n",
9856 (int)mr[i].mr_pid, (size_t)mr[i].mr_tid, txnid);
9859 rc = func(" pid thread txnid\n", ctx);
9863 rc = func(buf, ctx);
9869 rc = func("(no active readers)\n", ctx);
9874 /** Insert pid into list if not already present.
9875 * return -1 if already present.
9878 mdb_pid_insert(MDB_PID_T *ids, MDB_PID_T pid)
9880 /* binary search of pid in list */
9882 unsigned cursor = 1;
9884 unsigned n = ids[0];
9887 unsigned pivot = n >> 1;
9888 cursor = base + pivot + 1;
9889 val = pid - ids[cursor];
9894 } else if ( val > 0 ) {
9899 /* found, so it's a duplicate */
9908 for (n = ids[0]; n > cursor; n--)
9915 mdb_reader_check(MDB_env *env, int *dead)
9921 return env->me_txns ? mdb_reader_check0(env, 0, dead) : MDB_SUCCESS;
9924 /** As #mdb_reader_check(). rlocked = <caller locked the reader mutex>. */
9926 mdb_reader_check0(MDB_env *env, int rlocked, int *dead)
9928 mdb_mutexref_t rmutex = rlocked ? NULL : env->me_rmutex;
9929 unsigned int i, j, rdrs;
9931 MDB_PID_T *pids, pid;
9932 int rc = MDB_SUCCESS, count = 0;
9934 rdrs = env->me_txns->mti_numreaders;
9935 pids = malloc((rdrs+1) * sizeof(MDB_PID_T));
9939 mr = env->me_txns->mti_readers;
9940 for (i=0; i<rdrs; i++) {
9942 if (pid && pid != env->me_pid) {
9943 if (mdb_pid_insert(pids, pid) == 0) {
9944 if (!mdb_reader_pid(env, Pidcheck, pid)) {
9945 /* Stale reader found */
9948 if ((rc = LOCK_MUTEX0(rmutex)) != 0) {
9949 if ((rc = mdb_mutex_failed(env, rmutex, rc)))
9951 rdrs = 0; /* the above checked all readers */
9953 /* Recheck, a new process may have reused pid */
9954 if (mdb_reader_pid(env, Pidcheck, pid))
9959 if (mr[j].mr_pid == pid) {
9960 DPRINTF(("clear stale reader pid %u txn %"Z"d",
9961 (unsigned) pid, mr[j].mr_txnid));
9966 UNLOCK_MUTEX(rmutex);
9977 #ifdef MDB_ROBUST_SUPPORTED
9978 /** Handle #LOCK_MUTEX0() failure.
9979 * Try to repair the lock file if the mutex owner died.
9980 * @param[in] env the environment handle
9981 * @param[in] mutex LOCK_MUTEX0() mutex
9982 * @param[in] rc LOCK_MUTEX0() error (nonzero)
9983 * @return 0 on success with the mutex locked, or an error code on failure.
9986 mdb_mutex_failed(MDB_env *env, mdb_mutexref_t mutex, int rc)
9991 if (rc == MDB_OWNERDEAD) {
9992 /* We own the mutex. Clean up after dead previous owner. */
9994 rlocked = (mutex == env->me_rmutex);
9996 /* Keep mti_txnid updated, otherwise next writer can
9997 * overwrite data which latest meta page refers to.
9999 meta = mdb_env_pick_meta(env);
10000 env->me_txns->mti_txnid = meta->mm_txnid;
10001 /* env is hosed if the dead thread was ours */
10003 env->me_flags |= MDB_FATAL_ERROR;
10004 env->me_txn = NULL;
10008 DPRINTF(("%cmutex owner died, %s", (rlocked ? 'r' : 'w'),
10009 (rc ? "this process' env is hosed" : "recovering")));
10010 rc2 = mdb_reader_check0(env, rlocked, NULL);
10012 rc2 = mdb_mutex_consistent(mutex);
10013 if (rc || (rc = rc2)) {
10014 DPRINTF(("LOCK_MUTEX recovery failed, %s", mdb_strerror(rc)));
10015 UNLOCK_MUTEX(mutex);
10021 DPRINTF(("LOCK_MUTEX failed, %s", mdb_strerror(rc)));
10026 #endif /* MDB_ROBUST_SUPPORTED */
10029 #if defined(_WIN32)
10030 static int utf8_to_utf16(const char *src, int srcsize, wchar_t **dst, int *dstsize)
10034 need = MultiByteToWideChar(CP_UTF8, 0, src, srcsize, NULL, 0);
10035 if (need == 0xFFFD)
10039 result = malloc(sizeof(wchar_t) * need);
10042 MultiByteToWideChar(CP_UTF8, 0, src, srcsize, result, need);
10048 #endif /* defined(_WIN32) */
projects / openldap / blob