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-2015 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
101 #if defined(__sun) || defined(ANDROID)
102 /* Most platforms have posix_memalign, older may only have memalign */
103 #define HAVE_MEMALIGN 1
107 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
108 #include <netinet/in.h>
109 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
112 #if defined(__APPLE__) || defined (BSD)
113 # define MDB_USE_POSIX_SEM 1
114 # define MDB_FDATASYNC fsync
115 #elif defined(ANDROID)
116 # define MDB_FDATASYNC fsync
121 #ifdef MDB_USE_POSIX_SEM
122 # define MDB_USE_HASH 1
123 #include <semaphore.h>
128 #include <valgrind/memcheck.h>
129 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
130 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
131 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
132 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
133 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
135 #define VGMEMP_CREATE(h,r,z)
136 #define VGMEMP_ALLOC(h,a,s)
137 #define VGMEMP_FREE(h,a)
138 #define VGMEMP_DESTROY(h)
139 #define VGMEMP_DEFINED(a,s)
143 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
144 /* Solaris just defines one or the other */
145 # define LITTLE_ENDIAN 1234
146 # define BIG_ENDIAN 4321
147 # ifdef _LITTLE_ENDIAN
148 # define BYTE_ORDER LITTLE_ENDIAN
150 # define BYTE_ORDER BIG_ENDIAN
153 # define BYTE_ORDER __BYTE_ORDER
157 #ifndef LITTLE_ENDIAN
158 #define LITTLE_ENDIAN __LITTLE_ENDIAN
161 #define BIG_ENDIAN __BIG_ENDIAN
164 #if defined(__i386) || defined(__x86_64) || defined(_M_IX86)
165 #define MISALIGNED_OK 1
171 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
172 # error "Unknown or unsupported endianness (BYTE_ORDER)"
173 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
174 # error "Two's complement, reasonably sized integer types, please"
178 /** Put infrequently used env functions in separate section */
180 # define ESECT __attribute__ ((section("__TEXT,text_env")))
182 # define ESECT __attribute__ ((section("text_env")))
188 /** @defgroup internal LMDB Internals
191 /** @defgroup compat Compatibility Macros
192 * A bunch of macros to minimize the amount of platform-specific ifdefs
193 * needed throughout the rest of the code. When the features this library
194 * needs are similar enough to POSIX to be hidden in a one-or-two line
195 * replacement, this macro approach is used.
199 /** Features under development */
204 /** Wrapper around __func__, which is a C99 feature */
205 #if __STDC_VERSION__ >= 199901L
206 # define mdb_func_ __func__
207 #elif __GNUC__ >= 2 || _MSC_VER >= 1300
208 # define mdb_func_ __FUNCTION__
210 /* If a debug message says <mdb_unknown>(), update the #if statements above */
211 # define mdb_func_ "<mdb_unknown>"
215 #define MDB_USE_HASH 1
216 #define MDB_PIDLOCK 0
217 #define THREAD_RET DWORD
218 #define pthread_t HANDLE
219 #define pthread_mutex_t HANDLE
220 #define pthread_cond_t HANDLE
221 #define pthread_key_t DWORD
222 #define pthread_self() GetCurrentThreadId()
223 #define pthread_key_create(x,y) \
224 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
225 #define pthread_key_delete(x) TlsFree(x)
226 #define pthread_getspecific(x) TlsGetValue(x)
227 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
228 #define pthread_mutex_unlock(x) ReleaseMutex(*x)
229 #define pthread_mutex_lock(x) WaitForSingleObject(*x, INFINITE)
230 #define pthread_cond_signal(x) SetEvent(*x)
231 #define pthread_cond_wait(cond,mutex) do{SignalObjectAndWait(*mutex, *cond, INFINITE, FALSE); WaitForSingleObject(*mutex, INFINITE);}while(0)
232 #define THREAD_CREATE(thr,start,arg) thr=CreateThread(NULL,0,start,arg,0,NULL)
233 #define THREAD_FINISH(thr) WaitForSingleObject(thr, INFINITE)
234 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_rmutex)
235 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_rmutex)
236 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_wmutex)
237 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_wmutex)
238 #define getpid() GetCurrentProcessId()
239 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
240 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
241 #define ErrCode() GetLastError()
242 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
243 #define close(fd) (CloseHandle(fd) ? 0 : -1)
244 #define munmap(ptr,len) UnmapViewOfFile(ptr)
245 #ifdef PROCESS_QUERY_LIMITED_INFORMATION
246 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION PROCESS_QUERY_LIMITED_INFORMATION
248 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION 0x1000
252 #define THREAD_RET void *
253 #define THREAD_CREATE(thr,start,arg) pthread_create(&thr,NULL,start,arg)
254 #define THREAD_FINISH(thr) pthread_join(thr,NULL)
255 #define Z "z" /**< printf format modifier for size_t */
257 /** For MDB_LOCK_FORMAT: True if readers take a pid lock in the lockfile */
258 #define MDB_PIDLOCK 1
260 #ifdef MDB_USE_POSIX_SEM
262 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
263 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
264 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
265 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
268 mdb_sem_wait(sem_t *sem)
271 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
276 /** Lock the reader mutex.
278 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
279 /** Unlock the reader mutex.
281 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
283 /** Lock the writer mutex.
284 * Only a single write transaction is allowed at a time. Other writers
285 * will block waiting for this mutex.
287 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
288 /** Unlock the writer mutex.
290 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
291 #endif /* MDB_USE_POSIX_SEM */
293 /** Get the error code for the last failed system function.
295 #define ErrCode() errno
297 /** An abstraction for a file handle.
298 * On POSIX systems file handles are small integers. On Windows
299 * they're opaque pointers.
303 /** A value for an invalid file handle.
304 * Mainly used to initialize file variables and signify that they are
307 #define INVALID_HANDLE_VALUE (-1)
309 /** Get the size of a memory page for the system.
310 * This is the basic size that the platform's memory manager uses, and is
311 * fundamental to the use of memory-mapped files.
313 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
316 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
319 #define MNAME_LEN (sizeof(pthread_mutex_t))
325 /** A flag for opening a file and requesting synchronous data writes.
326 * This is only used when writing a meta page. It's not strictly needed;
327 * we could just do a normal write and then immediately perform a flush.
328 * But if this flag is available it saves us an extra system call.
330 * @note If O_DSYNC is undefined but exists in /usr/include,
331 * preferably set some compiler flag to get the definition.
332 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
335 # define MDB_DSYNC O_DSYNC
339 /** Function for flushing the data of a file. Define this to fsync
340 * if fdatasync() is not supported.
342 #ifndef MDB_FDATASYNC
343 # define MDB_FDATASYNC fdatasync
347 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
358 /** A page number in the database.
359 * Note that 64 bit page numbers are overkill, since pages themselves
360 * already represent 12-13 bits of addressable memory, and the OS will
361 * always limit applications to a maximum of 63 bits of address space.
363 * @note In the #MDB_node structure, we only store 48 bits of this value,
364 * which thus limits us to only 60 bits of addressable data.
366 typedef MDB_ID pgno_t;
368 /** A transaction ID.
369 * See struct MDB_txn.mt_txnid for details.
371 typedef MDB_ID txnid_t;
373 /** @defgroup debug Debug Macros
377 /** Enable debug output. Needs variable argument macros (a C99 feature).
378 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
379 * read from and written to the database (used for free space management).
385 static int mdb_debug;
386 static txnid_t mdb_debug_start;
388 /** Print a debug message with printf formatting.
389 * Requires double parenthesis around 2 or more args.
391 # define DPRINTF(args) ((void) ((mdb_debug) && DPRINTF0 args))
392 # define DPRINTF0(fmt, ...) \
393 fprintf(stderr, "%s:%d " fmt "\n", mdb_func_, __LINE__, __VA_ARGS__)
395 # define DPRINTF(args) ((void) 0)
397 /** Print a debug string.
398 * The string is printed literally, with no format processing.
400 #define DPUTS(arg) DPRINTF(("%s", arg))
401 /** Debuging output value of a cursor DBI: Negative in a sub-cursor. */
403 (((mc)->mc_flags & C_SUB) ? -(int)(mc)->mc_dbi : (int)(mc)->mc_dbi)
406 /** @brief The maximum size of a database page.
408 * It is 32k or 64k, since value-PAGEBASE must fit in
409 * #MDB_page.%mp_upper.
411 * LMDB will use database pages < OS pages if needed.
412 * That causes more I/O in write transactions: The OS must
413 * know (read) the whole page before writing a partial page.
415 * Note that we don't currently support Huge pages. On Linux,
416 * regular data files cannot use Huge pages, and in general
417 * Huge pages aren't actually pageable. We rely on the OS
418 * demand-pager to read our data and page it out when memory
419 * pressure from other processes is high. So until OSs have
420 * actual paging support for Huge pages, they're not viable.
422 #define MAX_PAGESIZE (PAGEBASE ? 0x10000 : 0x8000)
424 /** The minimum number of keys required in a database page.
425 * Setting this to a larger value will place a smaller bound on the
426 * maximum size of a data item. Data items larger than this size will
427 * be pushed into overflow pages instead of being stored directly in
428 * the B-tree node. This value used to default to 4. With a page size
429 * of 4096 bytes that meant that any item larger than 1024 bytes would
430 * go into an overflow page. That also meant that on average 2-3KB of
431 * each overflow page was wasted space. The value cannot be lower than
432 * 2 because then there would no longer be a tree structure. With this
433 * value, items larger than 2KB will go into overflow pages, and on
434 * average only 1KB will be wasted.
436 #define MDB_MINKEYS 2
438 /** A stamp that identifies a file as an LMDB file.
439 * There's nothing special about this value other than that it is easily
440 * recognizable, and it will reflect any byte order mismatches.
442 #define MDB_MAGIC 0xBEEFC0DE
444 /** The version number for a database's datafile format. */
445 #define MDB_DATA_VERSION ((MDB_DEVEL) ? 999 : 1)
446 /** The version number for a database's lockfile format. */
447 #define MDB_LOCK_VERSION 1
449 /** @brief The max size of a key we can write, or 0 for dynamic max.
451 * Define this as 0 to compute the max from the page size. 511
452 * is default for backwards compat: liblmdb <= 0.9.10 can break
453 * when modifying a DB with keys/dupsort data bigger than its max.
454 * #MDB_DEVEL sets the default to 0.
456 * Data items in an #MDB_DUPSORT database are also limited to
457 * this size, since they're actually keys of a sub-DB. Keys and
458 * #MDB_DUPSORT data items must fit on a node in a regular page.
460 #ifndef MDB_MAXKEYSIZE
461 #define MDB_MAXKEYSIZE ((MDB_DEVEL) ? 0 : 511)
464 /** The maximum size of a key we can write to the environment. */
466 #define ENV_MAXKEY(env) (MDB_MAXKEYSIZE)
468 #define ENV_MAXKEY(env) ((env)->me_maxkey)
471 /** @brief The maximum size of a data item.
473 * We only store a 32 bit value for node sizes.
475 #define MAXDATASIZE 0xffffffffUL
478 /** Key size which fits in a #DKBUF.
481 #define DKBUF_MAXKEYSIZE ((MDB_MAXKEYSIZE) > 0 ? (MDB_MAXKEYSIZE) : 511)
484 * This is used for printing a hex dump of a key's contents.
486 #define DKBUF char kbuf[DKBUF_MAXKEYSIZE*2+1]
487 /** Display a key in hex.
489 * Invoke a function to display a key in hex.
491 #define DKEY(x) mdb_dkey(x, kbuf)
497 /** An invalid page number.
498 * Mainly used to denote an empty tree.
500 #define P_INVALID (~(pgno_t)0)
502 /** Test if the flags \b f are set in a flag word \b w. */
503 #define F_ISSET(w, f) (((w) & (f)) == (f))
505 /** Round \b n up to an even number. */
506 #define EVEN(n) (((n) + 1U) & -2) /* sign-extending -2 to match n+1U */
508 /** Used for offsets within a single page.
509 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
512 typedef uint16_t indx_t;
514 /** Default size of memory map.
515 * This is certainly too small for any actual applications. Apps should always set
516 * the size explicitly using #mdb_env_set_mapsize().
518 #define DEFAULT_MAPSIZE 1048576
520 /** @defgroup readers Reader Lock Table
521 * Readers don't acquire any locks for their data access. Instead, they
522 * simply record their transaction ID in the reader table. The reader
523 * mutex is needed just to find an empty slot in the reader table. The
524 * slot's address is saved in thread-specific data so that subsequent read
525 * transactions started by the same thread need no further locking to proceed.
527 * If #MDB_NOTLS is set, the slot address is not saved in thread-specific data.
529 * No reader table is used if the database is on a read-only filesystem, or
530 * if #MDB_NOLOCK is set.
532 * Since the database uses multi-version concurrency control, readers don't
533 * actually need any locking. This table is used to keep track of which
534 * readers are using data from which old transactions, so that we'll know
535 * when a particular old transaction is no longer in use. Old transactions
536 * that have discarded any data pages can then have those pages reclaimed
537 * for use by a later write transaction.
539 * The lock table is constructed such that reader slots are aligned with the
540 * processor's cache line size. Any slot is only ever used by one thread.
541 * This alignment guarantees that there will be no contention or cache
542 * thrashing as threads update their own slot info, and also eliminates
543 * any need for locking when accessing a slot.
545 * A writer thread will scan every slot in the table to determine the oldest
546 * outstanding reader transaction. Any freed pages older than this will be
547 * reclaimed by the writer. The writer doesn't use any locks when scanning
548 * this table. This means that there's no guarantee that the writer will
549 * see the most up-to-date reader info, but that's not required for correct
550 * operation - all we need is to know the upper bound on the oldest reader,
551 * we don't care at all about the newest reader. So the only consequence of
552 * reading stale information here is that old pages might hang around a
553 * while longer before being reclaimed. That's actually good anyway, because
554 * the longer we delay reclaiming old pages, the more likely it is that a
555 * string of contiguous pages can be found after coalescing old pages from
556 * many old transactions together.
559 /** Number of slots in the reader table.
560 * This value was chosen somewhat arbitrarily. 126 readers plus a
561 * couple mutexes fit exactly into 8KB on my development machine.
562 * Applications should set the table size using #mdb_env_set_maxreaders().
564 #define DEFAULT_READERS 126
566 /** The size of a CPU cache line in bytes. We want our lock structures
567 * aligned to this size to avoid false cache line sharing in the
569 * This value works for most CPUs. For Itanium this should be 128.
575 /** The information we store in a single slot of the reader table.
576 * In addition to a transaction ID, we also record the process and
577 * thread ID that owns a slot, so that we can detect stale information,
578 * e.g. threads or processes that went away without cleaning up.
579 * @note We currently don't check for stale records. We simply re-init
580 * the table when we know that we're the only process opening the
583 typedef struct MDB_rxbody {
584 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
585 * Multiple readers that start at the same time will probably have the
586 * same ID here. Again, it's not important to exclude them from
587 * anything; all we need to know is which version of the DB they
588 * started from so we can avoid overwriting any data used in that
589 * particular version.
591 volatile txnid_t mrb_txnid;
592 /** The process ID of the process owning this reader txn. */
593 volatile MDB_PID_T mrb_pid;
594 /** The thread ID of the thread owning this txn. */
595 volatile MDB_THR_T mrb_tid;
598 /** The actual reader record, with cacheline padding. */
599 typedef struct MDB_reader {
602 /** shorthand for mrb_txnid */
603 #define mr_txnid mru.mrx.mrb_txnid
604 #define mr_pid mru.mrx.mrb_pid
605 #define mr_tid mru.mrx.mrb_tid
606 /** cache line alignment */
607 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
611 /** The header for the reader table.
612 * The table resides in a memory-mapped file. (This is a different file
613 * than is used for the main database.)
615 * For POSIX the actual mutexes reside in the shared memory of this
616 * mapped file. On Windows, mutexes are named objects allocated by the
617 * kernel; we store the mutex names in this mapped file so that other
618 * processes can grab them. This same approach is also used on
619 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
620 * process-shared POSIX mutexes. For these cases where a named object
621 * is used, the object name is derived from a 64 bit FNV hash of the
622 * environment pathname. As such, naming collisions are extremely
623 * unlikely. If a collision occurs, the results are unpredictable.
625 typedef struct MDB_txbody {
626 /** Stamp identifying this as an LMDB file. It must be set
629 /** Format of this lock file. Must be set to #MDB_LOCK_FORMAT. */
631 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
632 char mtb_rmname[MNAME_LEN];
634 /** Mutex protecting access to this table.
635 * This is the reader lock that #LOCK_MUTEX_R acquires.
637 pthread_mutex_t mtb_mutex;
639 /** The ID of the last transaction committed to the database.
640 * This is recorded here only for convenience; the value can always
641 * be determined by reading the main database meta pages.
643 volatile txnid_t mtb_txnid;
644 /** The number of slots that have been used in the reader table.
645 * This always records the maximum count, it is not decremented
646 * when readers release their slots.
648 volatile unsigned mtb_numreaders;
651 /** The actual reader table definition. */
652 typedef struct MDB_txninfo {
655 #define mti_magic mt1.mtb.mtb_magic
656 #define mti_format mt1.mtb.mtb_format
657 #define mti_mutex mt1.mtb.mtb_mutex
658 #define mti_rmname mt1.mtb.mtb_rmname
659 #define mti_txnid mt1.mtb.mtb_txnid
660 #define mti_numreaders mt1.mtb.mtb_numreaders
661 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
664 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
665 char mt2_wmname[MNAME_LEN];
666 #define mti_wmname mt2.mt2_wmname
668 pthread_mutex_t mt2_wmutex;
669 #define mti_wmutex mt2.mt2_wmutex
671 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
673 MDB_reader mti_readers[1];
676 /** Lockfile format signature: version, features and field layout */
677 #define MDB_LOCK_FORMAT \
679 ((MDB_LOCK_VERSION) \
680 /* Flags which describe functionality */ \
681 + (((MDB_PIDLOCK) != 0) << 16)))
684 /** Common header for all page types.
685 * Overflow records occupy a number of contiguous pages with no
686 * headers on any page after the first.
688 typedef struct MDB_page {
689 #define mp_pgno mp_p.p_pgno
690 #define mp_next mp_p.p_next
692 pgno_t p_pgno; /**< page number */
693 struct MDB_page *p_next; /**< for in-memory list of freed pages */
696 /** @defgroup mdb_page Page Flags
698 * Flags for the page headers.
701 #define P_BRANCH 0x01 /**< branch page */
702 #define P_LEAF 0x02 /**< leaf page */
703 #define P_OVERFLOW 0x04 /**< overflow page */
704 #define P_META 0x08 /**< meta page */
705 #define P_DIRTY 0x10 /**< dirty page, also set for #P_SUBP pages */
706 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
707 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
708 #define P_LOOSE 0x4000 /**< page was dirtied then freed, can be reused */
709 #define P_KEEP 0x8000 /**< leave this page alone during spill */
711 uint16_t mp_flags; /**< @ref mdb_page */
712 #define mp_lower mp_pb.pb.pb_lower
713 #define mp_upper mp_pb.pb.pb_upper
714 #define mp_pages mp_pb.pb_pages
717 indx_t pb_lower; /**< lower bound of free space */
718 indx_t pb_upper; /**< upper bound of free space */
720 uint32_t pb_pages; /**< number of overflow pages */
722 indx_t mp_ptrs[1]; /**< dynamic size */
725 /** Size of the page header, excluding dynamic data at the end */
726 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
728 /** Address of first usable data byte in a page, after the header */
729 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
731 /** ITS#7713, change PAGEBASE to handle 65536 byte pages */
732 #define PAGEBASE ((MDB_DEVEL) ? PAGEHDRSZ : 0)
734 /** Number of nodes on a page */
735 #define NUMKEYS(p) (((p)->mp_lower - (PAGEHDRSZ-PAGEBASE)) >> 1)
737 /** The amount of space remaining in the page */
738 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
740 /** The percentage of space used in the page, in tenths of a percent. */
741 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
742 ((env)->me_psize - PAGEHDRSZ))
743 /** The minimum page fill factor, in tenths of a percent.
744 * Pages emptier than this are candidates for merging.
746 #define FILL_THRESHOLD 250
748 /** Test if a page is a leaf page */
749 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
750 /** Test if a page is a LEAF2 page */
751 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
752 /** Test if a page is a branch page */
753 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
754 /** Test if a page is an overflow page */
755 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
756 /** Test if a page is a sub page */
757 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
759 /** The number of overflow pages needed to store the given size. */
760 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
762 /** Link in #MDB_txn.%mt_loose_pgs list */
763 #define NEXT_LOOSE_PAGE(p) (*(MDB_page **)((p) + 2))
765 /** Header for a single key/data pair within a page.
766 * Used in pages of type #P_BRANCH and #P_LEAF without #P_LEAF2.
767 * We guarantee 2-byte alignment for 'MDB_node's.
769 typedef struct MDB_node {
770 /** lo and hi are used for data size on leaf nodes and for
771 * child pgno on branch nodes. On 64 bit platforms, flags
772 * is also used for pgno. (Branch nodes have no flags).
773 * They are in host byte order in case that lets some
774 * accesses be optimized into a 32-bit word access.
776 #if BYTE_ORDER == LITTLE_ENDIAN
777 unsigned short mn_lo, mn_hi; /**< part of data size or pgno */
779 unsigned short mn_hi, mn_lo;
781 /** @defgroup mdb_node Node Flags
783 * Flags for node headers.
786 #define F_BIGDATA 0x01 /**< data put on overflow page */
787 #define F_SUBDATA 0x02 /**< data is a sub-database */
788 #define F_DUPDATA 0x04 /**< data has duplicates */
790 /** valid flags for #mdb_node_add() */
791 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
794 unsigned short mn_flags; /**< @ref mdb_node */
795 unsigned short mn_ksize; /**< key size */
796 char mn_data[1]; /**< key and data are appended here */
799 /** Size of the node header, excluding dynamic data at the end */
800 #define NODESIZE offsetof(MDB_node, mn_data)
802 /** Bit position of top word in page number, for shifting mn_flags */
803 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
805 /** Size of a node in a branch page with a given key.
806 * This is just the node header plus the key, there is no data.
808 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
810 /** Size of a node in a leaf page with a given key and data.
811 * This is node header plus key plus data size.
813 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
815 /** Address of node \b i in page \b p */
816 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i] + PAGEBASE))
818 /** Address of the key for the node */
819 #define NODEKEY(node) (void *)((node)->mn_data)
821 /** Address of the data for a node */
822 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
824 /** Get the page number pointed to by a branch node */
825 #define NODEPGNO(node) \
826 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
827 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
828 /** Set the page number in a branch node */
829 #define SETPGNO(node,pgno) do { \
830 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
831 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
833 /** Get the size of the data in a leaf node */
834 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
835 /** Set the size of the data for a leaf node */
836 #define SETDSZ(node,size) do { \
837 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
838 /** The size of a key in a node */
839 #define NODEKSZ(node) ((node)->mn_ksize)
841 /** Copy a page number from src to dst */
843 #define COPY_PGNO(dst,src) dst = src
845 #if SIZE_MAX > 4294967295UL
846 #define COPY_PGNO(dst,src) do { \
847 unsigned short *s, *d; \
848 s = (unsigned short *)&(src); \
849 d = (unsigned short *)&(dst); \
856 #define COPY_PGNO(dst,src) do { \
857 unsigned short *s, *d; \
858 s = (unsigned short *)&(src); \
859 d = (unsigned short *)&(dst); \
865 /** The address of a key in a LEAF2 page.
866 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
867 * There are no node headers, keys are stored contiguously.
869 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
871 /** Set the \b node's key into \b keyptr, if requested. */
872 #define MDB_GET_KEY(node, keyptr) { if ((keyptr) != NULL) { \
873 (keyptr)->mv_size = NODEKSZ(node); (keyptr)->mv_data = NODEKEY(node); } }
875 /** Set the \b node's key into \b key. */
876 #define MDB_GET_KEY2(node, key) { key.mv_size = NODEKSZ(node); key.mv_data = NODEKEY(node); }
878 /** Information about a single database in the environment. */
879 typedef struct MDB_db {
880 uint32_t md_pad; /**< also ksize for LEAF2 pages */
881 uint16_t md_flags; /**< @ref mdb_dbi_open */
882 uint16_t md_depth; /**< depth of this tree */
883 pgno_t md_branch_pages; /**< number of internal pages */
884 pgno_t md_leaf_pages; /**< number of leaf pages */
885 pgno_t md_overflow_pages; /**< number of overflow pages */
886 size_t md_entries; /**< number of data items */
887 pgno_t md_root; /**< the root page of this tree */
890 /** mdb_dbi_open flags */
891 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
892 #define PERSISTENT_FLAGS (0xffff & ~(MDB_VALID))
893 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
894 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
896 /** Handle for the DB used to track free pages. */
898 /** Handle for the default DB. */
901 /** Meta page content.
902 * A meta page is the start point for accessing a database snapshot.
903 * Pages 0-1 are meta pages. Transaction N writes meta page #(N % 2).
905 typedef struct MDB_meta {
906 /** Stamp identifying this as an LMDB file. It must be set
909 /** Version number of this file. Must be set to #MDB_DATA_VERSION. */
911 void *mm_address; /**< address for fixed mapping */
912 size_t mm_mapsize; /**< size of mmap region */
913 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
914 /** The size of pages used in this DB */
915 #define mm_psize mm_dbs[0].md_pad
916 /** Any persistent environment flags. @ref mdb_env */
917 #define mm_flags mm_dbs[0].md_flags
918 pgno_t mm_last_pg; /**< last used page in file */
919 volatile txnid_t mm_txnid; /**< txnid that committed this page */
922 /** Buffer for a stack-allocated meta page.
923 * The members define size and alignment, and silence type
924 * aliasing warnings. They are not used directly; that could
925 * mean incorrectly using several union members in parallel.
927 typedef union MDB_metabuf {
930 char mm_pad[PAGEHDRSZ];
935 /** Auxiliary DB info.
936 * The information here is mostly static/read-only. There is
937 * only a single copy of this record in the environment.
939 typedef struct MDB_dbx {
940 MDB_val md_name; /**< name of the database */
941 MDB_cmp_func *md_cmp; /**< function for comparing keys */
942 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
943 MDB_rel_func *md_rel; /**< user relocate function */
944 void *md_relctx; /**< user-provided context for md_rel */
947 /** A database transaction.
948 * Every operation requires a transaction handle.
951 MDB_txn *mt_parent; /**< parent of a nested txn */
952 MDB_txn *mt_child; /**< nested txn under this txn */
953 pgno_t mt_next_pgno; /**< next unallocated page */
954 /** The ID of this transaction. IDs are integers incrementing from 1.
955 * Only committed write transactions increment the ID. If a transaction
956 * aborts, the ID may be re-used by the next writer.
959 MDB_env *mt_env; /**< the DB environment */
960 /** The list of pages that became unused during this transaction.
963 /** The list of loose pages that became unused and may be reused
964 * in this transaction, linked through #NEXT_LOOSE_PAGE(page).
966 MDB_page *mt_loose_pgs;
967 /* #Number of loose pages (#mt_loose_pgs) */
969 /** The sorted list of dirty pages we temporarily wrote to disk
970 * because the dirty list was full. page numbers in here are
971 * shifted left by 1, deleted slots have the LSB set.
973 MDB_IDL mt_spill_pgs;
975 /** For write txns: Modified pages. Sorted when not MDB_WRITEMAP. */
977 /** For read txns: This thread/txn's reader table slot, or NULL. */
980 /** Array of records for each DB known in the environment. */
982 /** Array of MDB_db records for each known DB */
984 /** Array of sequence numbers for each DB handle */
985 unsigned int *mt_dbiseqs;
986 /** @defgroup mt_dbflag Transaction DB Flags
990 #define DB_DIRTY 0x01 /**< DB was modified or is DUPSORT data */
991 #define DB_STALE 0x02 /**< Named-DB record is older than txnID */
992 #define DB_NEW 0x04 /**< Named-DB handle opened in this txn */
993 #define DB_VALID 0x08 /**< DB handle is valid, see also #MDB_VALID */
995 /** In write txns, array of cursors for each DB */
996 MDB_cursor **mt_cursors;
997 /** Array of flags for each DB */
998 unsigned char *mt_dbflags;
999 /** Number of DB records in use. This number only ever increments;
1000 * we don't decrement it when individual DB handles are closed.
1004 /** @defgroup mdb_txn Transaction Flags
1008 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
1009 #define MDB_TXN_ERROR 0x02 /**< txn is unusable after an error */
1010 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
1011 #define MDB_TXN_SPILLS 0x08 /**< txn or a parent has spilled pages */
1013 unsigned int mt_flags; /**< @ref mdb_txn */
1014 /** #dirty_list room: Array size - \#dirty pages visible to this txn.
1015 * Includes ancestor txns' dirty pages not hidden by other txns'
1016 * dirty/spilled pages. Thus commit(nested txn) has room to merge
1017 * dirty_list into mt_parent after freeing hidden mt_parent pages.
1019 unsigned int mt_dirty_room;
1022 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
1023 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
1024 * raise this on a 64 bit machine.
1026 #define CURSOR_STACK 32
1030 /** Cursors are used for all DB operations.
1031 * A cursor holds a path of (page pointer, key index) from the DB
1032 * root to a position in the DB, plus other state. #MDB_DUPSORT
1033 * cursors include an xcursor to the current data item. Write txns
1034 * track their cursors and keep them up to date when data moves.
1035 * Exception: An xcursor's pointer to a #P_SUBP page can be stale.
1036 * (A node with #F_DUPDATA but no #F_SUBDATA contains a subpage).
1039 /** Next cursor on this DB in this txn */
1040 MDB_cursor *mc_next;
1041 /** Backup of the original cursor if this cursor is a shadow */
1042 MDB_cursor *mc_backup;
1043 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
1044 struct MDB_xcursor *mc_xcursor;
1045 /** The transaction that owns this cursor */
1047 /** The database handle this cursor operates on */
1049 /** The database record for this cursor */
1051 /** The database auxiliary record for this cursor */
1053 /** The @ref mt_dbflag for this database */
1054 unsigned char *mc_dbflag;
1055 unsigned short mc_snum; /**< number of pushed pages */
1056 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
1057 /** @defgroup mdb_cursor Cursor Flags
1059 * Cursor state flags.
1062 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
1063 #define C_EOF 0x02 /**< No more data */
1064 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
1065 #define C_DEL 0x08 /**< last op was a cursor_del */
1066 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
1067 #define C_UNTRACK 0x40 /**< Un-track cursor when closing */
1069 unsigned int mc_flags; /**< @ref mdb_cursor */
1070 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
1071 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
1074 /** Context for sorted-dup records.
1075 * We could have gone to a fully recursive design, with arbitrarily
1076 * deep nesting of sub-databases. But for now we only handle these
1077 * levels - main DB, optional sub-DB, sorted-duplicate DB.
1079 typedef struct MDB_xcursor {
1080 /** A sub-cursor for traversing the Dup DB */
1081 MDB_cursor mx_cursor;
1082 /** The database record for this Dup DB */
1084 /** The auxiliary DB record for this Dup DB */
1086 /** The @ref mt_dbflag for this Dup DB */
1087 unsigned char mx_dbflag;
1090 /** State of FreeDB old pages, stored in the MDB_env */
1091 typedef struct MDB_pgstate {
1092 pgno_t *mf_pghead; /**< Reclaimed freeDB pages, or NULL before use */
1093 txnid_t mf_pglast; /**< ID of last used record, or 0 if !mf_pghead */
1096 /** The database environment. */
1098 HANDLE me_fd; /**< The main data file */
1099 HANDLE me_lfd; /**< The lock file */
1100 HANDLE me_mfd; /**< just for writing the meta pages */
1101 /** Failed to update the meta page. Probably an I/O error. */
1102 #define MDB_FATAL_ERROR 0x80000000U
1103 /** Some fields are initialized. */
1104 #define MDB_ENV_ACTIVE 0x20000000U
1105 /** me_txkey is set */
1106 #define MDB_ENV_TXKEY 0x10000000U
1107 /** fdatasync is unreliable */
1108 #define MDB_FSYNCONLY 0x08000000U
1109 uint32_t me_flags; /**< @ref mdb_env */
1110 unsigned int me_psize; /**< DB page size, inited from me_os_psize */
1111 unsigned int me_os_psize; /**< OS page size, from #GET_PAGESIZE */
1112 unsigned int me_maxreaders; /**< size of the reader table */
1113 unsigned int me_numreaders; /**< max numreaders set by this env */
1114 MDB_dbi me_numdbs; /**< number of DBs opened */
1115 MDB_dbi me_maxdbs; /**< size of the DB table */
1116 MDB_PID_T me_pid; /**< process ID of this env */
1117 char *me_path; /**< path to the DB files */
1118 char *me_map; /**< the memory map of the data file */
1119 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
1120 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
1121 void *me_pbuf; /**< scratch area for DUPSORT put() */
1122 MDB_txn *me_txn; /**< current write transaction */
1123 MDB_txn *me_txn0; /**< prealloc'd write transaction */
1124 size_t me_mapsize; /**< size of the data memory map */
1125 off_t me_size; /**< current file size */
1126 pgno_t me_maxpg; /**< me_mapsize / me_psize */
1127 MDB_dbx *me_dbxs; /**< array of static DB info */
1128 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
1129 unsigned int *me_dbiseqs; /**< array of dbi sequence numbers */
1130 pthread_key_t me_txkey; /**< thread-key for readers */
1131 txnid_t me_pgoldest; /**< ID of oldest reader last time we looked */
1132 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
1133 # define me_pglast me_pgstate.mf_pglast
1134 # define me_pghead me_pgstate.mf_pghead
1135 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
1136 /** IDL of pages that became unused in a write txn */
1137 MDB_IDL me_free_pgs;
1138 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
1139 MDB_ID2L me_dirty_list;
1140 /** Max number of freelist items that can fit in a single overflow page */
1142 /** Max size of a node on a page */
1143 unsigned int me_nodemax;
1144 #if !(MDB_MAXKEYSIZE)
1145 unsigned int me_maxkey; /**< max size of a key */
1147 int me_live_reader; /**< have liveness lock in reader table */
1149 int me_pidquery; /**< Used in OpenProcess */
1150 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
1152 #elif defined(MDB_USE_POSIX_SEM)
1153 sem_t *me_rmutex; /* Shared mutexes are not supported */
1156 void *me_userctx; /**< User-settable context */
1157 MDB_assert_func *me_assert_func; /**< Callback for assertion failures */
1160 /** Nested transaction */
1161 typedef struct MDB_ntxn {
1162 MDB_txn mnt_txn; /**< the transaction */
1163 MDB_pgstate mnt_pgstate; /**< parent transaction's saved freestate */
1166 /** max number of pages to commit in one writev() call */
1167 #define MDB_COMMIT_PAGES 64
1168 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
1169 #undef MDB_COMMIT_PAGES
1170 #define MDB_COMMIT_PAGES IOV_MAX
1173 /** max bytes to write in one call */
1174 #define MAX_WRITE (0x80000000U >> (sizeof(ssize_t) == 4))
1176 /** Check \b txn and \b dbi arguments to a function */
1177 #define TXN_DBI_EXIST(txn, dbi) \
1178 ((txn) && (dbi) < (txn)->mt_numdbs && ((txn)->mt_dbflags[dbi] & DB_VALID))
1180 /** Check for misused \b dbi handles */
1181 #define TXN_DBI_CHANGED(txn, dbi) \
1182 ((txn)->mt_dbiseqs[dbi] != (txn)->mt_env->me_dbiseqs[dbi])
1184 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
1185 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
1186 static int mdb_page_touch(MDB_cursor *mc);
1188 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp, int *lvl);
1189 static int mdb_page_search_root(MDB_cursor *mc,
1190 MDB_val *key, int modify);
1191 #define MDB_PS_MODIFY 1
1192 #define MDB_PS_ROOTONLY 2
1193 #define MDB_PS_FIRST 4
1194 #define MDB_PS_LAST 8
1195 static int mdb_page_search(MDB_cursor *mc,
1196 MDB_val *key, int flags);
1197 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1199 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1200 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1201 pgno_t newpgno, unsigned int nflags);
1203 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1204 static int mdb_env_pick_meta(const MDB_env *env);
1205 static int mdb_env_write_meta(MDB_txn *txn);
1206 #if !(defined(_WIN32) || defined(MDB_USE_POSIX_SEM)) /* Drop unused excl arg */
1207 # define mdb_env_close0(env, excl) mdb_env_close1(env)
1209 static void mdb_env_close0(MDB_env *env, int excl);
1211 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1212 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1213 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1214 static void mdb_node_del(MDB_cursor *mc, int ksize);
1215 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1216 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1217 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1218 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1219 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1221 static int mdb_rebalance(MDB_cursor *mc);
1222 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1224 static void mdb_cursor_pop(MDB_cursor *mc);
1225 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1227 static int mdb_cursor_del0(MDB_cursor *mc);
1228 static int mdb_del0(MDB_txn *txn, MDB_dbi dbi, MDB_val *key, MDB_val *data, unsigned flags);
1229 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1230 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1231 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1232 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1234 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1235 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1237 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1238 static void mdb_xcursor_init0(MDB_cursor *mc);
1239 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1241 static int mdb_drop0(MDB_cursor *mc, int subs);
1242 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1245 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1249 static SECURITY_DESCRIPTOR mdb_null_sd;
1250 static SECURITY_ATTRIBUTES mdb_all_sa;
1251 static int mdb_sec_inited;
1254 /** Return the library version info. */
1256 mdb_version(int *major, int *minor, int *patch)
1258 if (major) *major = MDB_VERSION_MAJOR;
1259 if (minor) *minor = MDB_VERSION_MINOR;
1260 if (patch) *patch = MDB_VERSION_PATCH;
1261 return MDB_VERSION_STRING;
1264 /** Table of descriptions for LMDB @ref errors */
1265 static char *const mdb_errstr[] = {
1266 "MDB_KEYEXIST: Key/data pair already exists",
1267 "MDB_NOTFOUND: No matching key/data pair found",
1268 "MDB_PAGE_NOTFOUND: Requested page not found",
1269 "MDB_CORRUPTED: Located page was wrong type",
1270 "MDB_PANIC: Update of meta page failed",
1271 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1272 "MDB_INVALID: File is not an LMDB file",
1273 "MDB_MAP_FULL: Environment mapsize limit reached",
1274 "MDB_DBS_FULL: Environment maxdbs limit reached",
1275 "MDB_READERS_FULL: Environment maxreaders limit reached",
1276 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1277 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1278 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1279 "MDB_PAGE_FULL: Internal error - page has no more space",
1280 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1281 "MDB_INCOMPATIBLE: Operation and DB incompatible, or DB flags changed",
1282 "MDB_BAD_RSLOT: Invalid reuse of reader locktable slot",
1283 "MDB_BAD_TXN: Transaction cannot recover - it must be aborted",
1284 "MDB_BAD_VALSIZE: Unsupported size of key/DB name/data, or wrong DUPFIXED size",
1285 "MDB_BAD_DBI: The specified DBI handle was closed/changed unexpectedly",
1289 mdb_strerror(int err)
1292 /** HACK: pad 4KB on stack over the buf. Return system msgs in buf.
1293 * This works as long as no function between the call to mdb_strerror
1294 * and the actual use of the message uses more than 4K of stack.
1297 char buf[1024], *ptr = buf;
1301 return ("Successful return: 0");
1303 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1304 i = err - MDB_KEYEXIST;
1305 return mdb_errstr[i];
1309 /* These are the C-runtime error codes we use. The comment indicates
1310 * their numeric value, and the Win32 error they would correspond to
1311 * if the error actually came from a Win32 API. A major mess, we should
1312 * have used LMDB-specific error codes for everything.
1315 case ENOENT: /* 2, FILE_NOT_FOUND */
1316 case EIO: /* 5, ACCESS_DENIED */
1317 case ENOMEM: /* 12, INVALID_ACCESS */
1318 case EACCES: /* 13, INVALID_DATA */
1319 case EBUSY: /* 16, CURRENT_DIRECTORY */
1320 case EINVAL: /* 22, BAD_COMMAND */
1321 case ENOSPC: /* 28, OUT_OF_PAPER */
1322 return strerror(err);
1327 FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM |
1328 FORMAT_MESSAGE_IGNORE_INSERTS,
1329 NULL, err, 0, ptr, sizeof(buf), (va_list *)pad);
1332 return strerror(err);
1336 /** assert(3) variant in cursor context */
1337 #define mdb_cassert(mc, expr) mdb_assert0((mc)->mc_txn->mt_env, expr, #expr)
1338 /** assert(3) variant in transaction context */
1339 #define mdb_tassert(mc, expr) mdb_assert0((txn)->mt_env, expr, #expr)
1340 /** assert(3) variant in environment context */
1341 #define mdb_eassert(env, expr) mdb_assert0(env, expr, #expr)
1344 # define mdb_assert0(env, expr, expr_txt) ((expr) ? (void)0 : \
1345 mdb_assert_fail(env, expr_txt, mdb_func_, __FILE__, __LINE__))
1348 mdb_assert_fail(MDB_env *env, const char *expr_txt,
1349 const char *func, const char *file, int line)
1352 sprintf(buf, "%.100s:%d: Assertion '%.200s' failed in %.40s()",
1353 file, line, expr_txt, func);
1354 if (env->me_assert_func)
1355 env->me_assert_func(env, buf);
1356 fprintf(stderr, "%s\n", buf);
1360 # define mdb_assert0(env, expr, expr_txt) ((void) 0)
1364 /** Return the page number of \b mp which may be sub-page, for debug output */
1366 mdb_dbg_pgno(MDB_page *mp)
1369 COPY_PGNO(ret, mp->mp_pgno);
1373 /** Display a key in hexadecimal and return the address of the result.
1374 * @param[in] key the key to display
1375 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1376 * @return The key in hexadecimal form.
1379 mdb_dkey(MDB_val *key, char *buf)
1382 unsigned char *c = key->mv_data;
1388 if (key->mv_size > DKBUF_MAXKEYSIZE)
1389 return "MDB_MAXKEYSIZE";
1390 /* may want to make this a dynamic check: if the key is mostly
1391 * printable characters, print it as-is instead of converting to hex.
1395 for (i=0; i<key->mv_size; i++)
1396 ptr += sprintf(ptr, "%02x", *c++);
1398 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1404 mdb_leafnode_type(MDB_node *n)
1406 static char *const tp[2][2] = {{"", ": DB"}, {": sub-page", ": sub-DB"}};
1407 return F_ISSET(n->mn_flags, F_BIGDATA) ? ": overflow page" :
1408 tp[F_ISSET(n->mn_flags, F_DUPDATA)][F_ISSET(n->mn_flags, F_SUBDATA)];
1411 /** Display all the keys in the page. */
1413 mdb_page_list(MDB_page *mp)
1415 pgno_t pgno = mdb_dbg_pgno(mp);
1416 const char *type, *state = (mp->mp_flags & P_DIRTY) ? ", dirty" : "";
1418 unsigned int i, nkeys, nsize, total = 0;
1422 switch (mp->mp_flags & (P_BRANCH|P_LEAF|P_LEAF2|P_META|P_OVERFLOW|P_SUBP)) {
1423 case P_BRANCH: type = "Branch page"; break;
1424 case P_LEAF: type = "Leaf page"; break;
1425 case P_LEAF|P_SUBP: type = "Sub-page"; break;
1426 case P_LEAF|P_LEAF2: type = "LEAF2 page"; break;
1427 case P_LEAF|P_LEAF2|P_SUBP: type = "LEAF2 sub-page"; break;
1429 fprintf(stderr, "Overflow page %"Z"u pages %u%s\n",
1430 pgno, mp->mp_pages, state);
1433 fprintf(stderr, "Meta-page %"Z"u txnid %"Z"u\n",
1434 pgno, ((MDB_meta *)METADATA(mp))->mm_txnid);
1437 fprintf(stderr, "Bad page %"Z"u flags 0x%u\n", pgno, mp->mp_flags);
1441 nkeys = NUMKEYS(mp);
1442 fprintf(stderr, "%s %"Z"u numkeys %d%s\n", type, pgno, nkeys, state);
1444 for (i=0; i<nkeys; i++) {
1445 if (IS_LEAF2(mp)) { /* LEAF2 pages have no mp_ptrs[] or node headers */
1446 key.mv_size = nsize = mp->mp_pad;
1447 key.mv_data = LEAF2KEY(mp, i, nsize);
1449 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1452 node = NODEPTR(mp, i);
1453 key.mv_size = node->mn_ksize;
1454 key.mv_data = node->mn_data;
1455 nsize = NODESIZE + key.mv_size;
1456 if (IS_BRANCH(mp)) {
1457 fprintf(stderr, "key %d: page %"Z"u, %s\n", i, NODEPGNO(node),
1461 if (F_ISSET(node->mn_flags, F_BIGDATA))
1462 nsize += sizeof(pgno_t);
1464 nsize += NODEDSZ(node);
1466 nsize += sizeof(indx_t);
1467 fprintf(stderr, "key %d: nsize %d, %s%s\n",
1468 i, nsize, DKEY(&key), mdb_leafnode_type(node));
1470 total = EVEN(total);
1472 fprintf(stderr, "Total: header %d + contents %d + unused %d\n",
1473 IS_LEAF2(mp) ? PAGEHDRSZ : PAGEBASE + mp->mp_lower, total, SIZELEFT(mp));
1477 mdb_cursor_chk(MDB_cursor *mc)
1483 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1484 for (i=0; i<mc->mc_top; i++) {
1486 node = NODEPTR(mp, mc->mc_ki[i]);
1487 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1490 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1496 /** Count all the pages in each DB and in the freelist
1497 * and make sure it matches the actual number of pages
1499 * All named DBs must be open for a correct count.
1501 static void mdb_audit(MDB_txn *txn)
1505 MDB_ID freecount, count;
1510 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1511 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1512 freecount += *(MDB_ID *)data.mv_data;
1513 mdb_tassert(txn, rc == MDB_NOTFOUND);
1516 for (i = 0; i<txn->mt_numdbs; i++) {
1518 if (!(txn->mt_dbflags[i] & DB_VALID))
1520 mdb_cursor_init(&mc, txn, i, &mx);
1521 if (txn->mt_dbs[i].md_root == P_INVALID)
1523 count += txn->mt_dbs[i].md_branch_pages +
1524 txn->mt_dbs[i].md_leaf_pages +
1525 txn->mt_dbs[i].md_overflow_pages;
1526 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1527 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST);
1528 for (; rc == MDB_SUCCESS; rc = mdb_cursor_sibling(&mc, 1)) {
1531 mp = mc.mc_pg[mc.mc_top];
1532 for (j=0; j<NUMKEYS(mp); j++) {
1533 MDB_node *leaf = NODEPTR(mp, j);
1534 if (leaf->mn_flags & F_SUBDATA) {
1536 memcpy(&db, NODEDATA(leaf), sizeof(db));
1537 count += db.md_branch_pages + db.md_leaf_pages +
1538 db.md_overflow_pages;
1542 mdb_tassert(txn, rc == MDB_NOTFOUND);
1545 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1546 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1547 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1553 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1555 return txn->mt_dbxs[dbi].md_cmp(a, b);
1559 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1561 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1564 /** Allocate memory for a page.
1565 * Re-use old malloc'd pages first for singletons, otherwise just malloc.
1568 mdb_page_malloc(MDB_txn *txn, unsigned num)
1570 MDB_env *env = txn->mt_env;
1571 MDB_page *ret = env->me_dpages;
1572 size_t psize = env->me_psize, sz = psize, off;
1573 /* For ! #MDB_NOMEMINIT, psize counts how much to init.
1574 * For a single page alloc, we init everything after the page header.
1575 * For multi-page, we init the final page; if the caller needed that
1576 * many pages they will be filling in at least up to the last page.
1580 VGMEMP_ALLOC(env, ret, sz);
1581 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1582 env->me_dpages = ret->mp_next;
1585 psize -= off = PAGEHDRSZ;
1590 if ((ret = malloc(sz)) != NULL) {
1591 VGMEMP_ALLOC(env, ret, sz);
1592 if (!(env->me_flags & MDB_NOMEMINIT)) {
1593 memset((char *)ret + off, 0, psize);
1597 txn->mt_flags |= MDB_TXN_ERROR;
1601 /** Free a single page.
1602 * Saves single pages to a list, for future reuse.
1603 * (This is not used for multi-page overflow pages.)
1606 mdb_page_free(MDB_env *env, MDB_page *mp)
1608 mp->mp_next = env->me_dpages;
1609 VGMEMP_FREE(env, mp);
1610 env->me_dpages = mp;
1613 /** Free a dirty page */
1615 mdb_dpage_free(MDB_env *env, MDB_page *dp)
1617 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1618 mdb_page_free(env, dp);
1620 /* large pages just get freed directly */
1621 VGMEMP_FREE(env, dp);
1626 /** Return all dirty pages to dpage list */
1628 mdb_dlist_free(MDB_txn *txn)
1630 MDB_env *env = txn->mt_env;
1631 MDB_ID2L dl = txn->mt_u.dirty_list;
1632 unsigned i, n = dl[0].mid;
1634 for (i = 1; i <= n; i++) {
1635 mdb_dpage_free(env, dl[i].mptr);
1640 /** Loosen or free a single page.
1641 * Saves single pages to a list for future reuse
1642 * in this same txn. It has been pulled from the freeDB
1643 * and already resides on the dirty list, but has been
1644 * deleted. Use these pages first before pulling again
1647 * If the page wasn't dirtied in this txn, just add it
1648 * to this txn's free list.
1651 mdb_page_loose(MDB_cursor *mc, MDB_page *mp)
1654 pgno_t pgno = mp->mp_pgno;
1655 MDB_txn *txn = mc->mc_txn;
1657 if ((mp->mp_flags & P_DIRTY) && mc->mc_dbi != FREE_DBI) {
1658 if (txn->mt_parent) {
1659 MDB_ID2 *dl = txn->mt_u.dirty_list;
1660 /* If txn has a parent, make sure the page is in our
1664 unsigned x = mdb_mid2l_search(dl, pgno);
1665 if (x <= dl[0].mid && dl[x].mid == pgno) {
1666 if (mp != dl[x].mptr) { /* bad cursor? */
1667 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
1668 txn->mt_flags |= MDB_TXN_ERROR;
1669 return MDB_CORRUPTED;
1676 /* no parent txn, so it's just ours */
1681 DPRINTF(("loosen db %d page %"Z"u", DDBI(mc),
1683 NEXT_LOOSE_PAGE(mp) = txn->mt_loose_pgs;
1684 txn->mt_loose_pgs = mp;
1685 txn->mt_loose_count++;
1686 mp->mp_flags |= P_LOOSE;
1688 int rc = mdb_midl_append(&txn->mt_free_pgs, pgno);
1696 /** Set or clear P_KEEP in dirty, non-overflow, non-sub pages watched by txn.
1697 * @param[in] mc A cursor handle for the current operation.
1698 * @param[in] pflags Flags of the pages to update:
1699 * P_DIRTY to set P_KEEP, P_DIRTY|P_KEEP to clear it.
1700 * @param[in] all No shortcuts. Needed except after a full #mdb_page_flush().
1701 * @return 0 on success, non-zero on failure.
1704 mdb_pages_xkeep(MDB_cursor *mc, unsigned pflags, int all)
1706 enum { Mask = P_SUBP|P_DIRTY|P_LOOSE|P_KEEP };
1707 MDB_txn *txn = mc->mc_txn;
1713 int rc = MDB_SUCCESS, level;
1715 /* Mark pages seen by cursors */
1716 if (mc->mc_flags & C_UNTRACK)
1717 mc = NULL; /* will find mc in mt_cursors */
1718 for (i = txn->mt_numdbs;; mc = txn->mt_cursors[--i]) {
1719 for (; mc; mc=mc->mc_next) {
1720 if (!(mc->mc_flags & C_INITIALIZED))
1722 for (m3 = mc;; m3 = &mx->mx_cursor) {
1724 for (j=0; j<m3->mc_snum; j++) {
1726 if ((mp->mp_flags & Mask) == pflags)
1727 mp->mp_flags ^= P_KEEP;
1729 mx = m3->mc_xcursor;
1730 /* Proceed to mx if it is at a sub-database */
1731 if (! (mx && (mx->mx_cursor.mc_flags & C_INITIALIZED)))
1733 if (! (mp && (mp->mp_flags & P_LEAF)))
1735 leaf = NODEPTR(mp, m3->mc_ki[j-1]);
1736 if (!(leaf->mn_flags & F_SUBDATA))
1745 /* Mark dirty root pages */
1746 for (i=0; i<txn->mt_numdbs; i++) {
1747 if (txn->mt_dbflags[i] & DB_DIRTY) {
1748 pgno_t pgno = txn->mt_dbs[i].md_root;
1749 if (pgno == P_INVALID)
1751 if ((rc = mdb_page_get(txn, pgno, &dp, &level)) != MDB_SUCCESS)
1753 if ((dp->mp_flags & Mask) == pflags && level <= 1)
1754 dp->mp_flags ^= P_KEEP;
1762 static int mdb_page_flush(MDB_txn *txn, int keep);
1764 /** Spill pages from the dirty list back to disk.
1765 * This is intended to prevent running into #MDB_TXN_FULL situations,
1766 * but note that they may still occur in a few cases:
1767 * 1) our estimate of the txn size could be too small. Currently this
1768 * seems unlikely, except with a large number of #MDB_MULTIPLE items.
1769 * 2) child txns may run out of space if their parents dirtied a
1770 * lot of pages and never spilled them. TODO: we probably should do
1771 * a preemptive spill during #mdb_txn_begin() of a child txn, if
1772 * the parent's dirty_room is below a given threshold.
1774 * Otherwise, if not using nested txns, it is expected that apps will
1775 * not run into #MDB_TXN_FULL any more. The pages are flushed to disk
1776 * the same way as for a txn commit, e.g. their P_DIRTY flag is cleared.
1777 * If the txn never references them again, they can be left alone.
1778 * If the txn only reads them, they can be used without any fuss.
1779 * If the txn writes them again, they can be dirtied immediately without
1780 * going thru all of the work of #mdb_page_touch(). Such references are
1781 * handled by #mdb_page_unspill().
1783 * Also note, we never spill DB root pages, nor pages of active cursors,
1784 * because we'll need these back again soon anyway. And in nested txns,
1785 * we can't spill a page in a child txn if it was already spilled in a
1786 * parent txn. That would alter the parent txns' data even though
1787 * the child hasn't committed yet, and we'd have no way to undo it if
1788 * the child aborted.
1790 * @param[in] m0 cursor A cursor handle identifying the transaction and
1791 * database for which we are checking space.
1792 * @param[in] key For a put operation, the key being stored.
1793 * @param[in] data For a put operation, the data being stored.
1794 * @return 0 on success, non-zero on failure.
1797 mdb_page_spill(MDB_cursor *m0, MDB_val *key, MDB_val *data)
1799 MDB_txn *txn = m0->mc_txn;
1801 MDB_ID2L dl = txn->mt_u.dirty_list;
1802 unsigned int i, j, need;
1805 if (m0->mc_flags & C_SUB)
1808 /* Estimate how much space this op will take */
1809 i = m0->mc_db->md_depth;
1810 /* Named DBs also dirty the main DB */
1811 if (m0->mc_dbi > MAIN_DBI)
1812 i += txn->mt_dbs[MAIN_DBI].md_depth;
1813 /* For puts, roughly factor in the key+data size */
1815 i += (LEAFSIZE(key, data) + txn->mt_env->me_psize) / txn->mt_env->me_psize;
1816 i += i; /* double it for good measure */
1819 if (txn->mt_dirty_room > i)
1822 if (!txn->mt_spill_pgs) {
1823 txn->mt_spill_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX);
1824 if (!txn->mt_spill_pgs)
1827 /* purge deleted slots */
1828 MDB_IDL sl = txn->mt_spill_pgs;
1829 unsigned int num = sl[0];
1831 for (i=1; i<=num; i++) {
1838 /* Preserve pages which may soon be dirtied again */
1839 if ((rc = mdb_pages_xkeep(m0, P_DIRTY, 1)) != MDB_SUCCESS)
1842 /* Less aggressive spill - we originally spilled the entire dirty list,
1843 * with a few exceptions for cursor pages and DB root pages. But this
1844 * turns out to be a lot of wasted effort because in a large txn many
1845 * of those pages will need to be used again. So now we spill only 1/8th
1846 * of the dirty pages. Testing revealed this to be a good tradeoff,
1847 * better than 1/2, 1/4, or 1/10.
1849 if (need < MDB_IDL_UM_MAX / 8)
1850 need = MDB_IDL_UM_MAX / 8;
1852 /* Save the page IDs of all the pages we're flushing */
1853 /* flush from the tail forward, this saves a lot of shifting later on. */
1854 for (i=dl[0].mid; i && need; i--) {
1855 MDB_ID pn = dl[i].mid << 1;
1857 if (dp->mp_flags & (P_LOOSE|P_KEEP))
1859 /* Can't spill twice, make sure it's not already in a parent's
1862 if (txn->mt_parent) {
1864 for (tx2 = txn->mt_parent; tx2; tx2 = tx2->mt_parent) {
1865 if (tx2->mt_spill_pgs) {
1866 j = mdb_midl_search(tx2->mt_spill_pgs, pn);
1867 if (j <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[j] == pn) {
1868 dp->mp_flags |= P_KEEP;
1876 if ((rc = mdb_midl_append(&txn->mt_spill_pgs, pn)))
1880 mdb_midl_sort(txn->mt_spill_pgs);
1882 /* Flush the spilled part of dirty list */
1883 if ((rc = mdb_page_flush(txn, i)) != MDB_SUCCESS)
1886 /* Reset any dirty pages we kept that page_flush didn't see */
1887 rc = mdb_pages_xkeep(m0, P_DIRTY|P_KEEP, i);
1890 txn->mt_flags |= rc ? MDB_TXN_ERROR : MDB_TXN_SPILLS;
1894 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
1896 mdb_find_oldest(MDB_txn *txn)
1899 txnid_t mr, oldest = txn->mt_txnid - 1;
1900 if (txn->mt_env->me_txns) {
1901 MDB_reader *r = txn->mt_env->me_txns->mti_readers;
1902 for (i = txn->mt_env->me_txns->mti_numreaders; --i >= 0; ) {
1913 /** Add a page to the txn's dirty list */
1915 mdb_page_dirty(MDB_txn *txn, MDB_page *mp)
1918 int rc, (*insert)(MDB_ID2L, MDB_ID2 *);
1920 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1921 insert = mdb_mid2l_append;
1923 insert = mdb_mid2l_insert;
1925 mid.mid = mp->mp_pgno;
1927 rc = insert(txn->mt_u.dirty_list, &mid);
1928 mdb_tassert(txn, rc == 0);
1929 txn->mt_dirty_room--;
1932 /** Allocate page numbers and memory for writing. Maintain me_pglast,
1933 * me_pghead and mt_next_pgno.
1935 * If there are free pages available from older transactions, they
1936 * are re-used first. Otherwise allocate a new page at mt_next_pgno.
1937 * Do not modify the freedB, just merge freeDB records into me_pghead[]
1938 * and move me_pglast to say which records were consumed. Only this
1939 * function can create me_pghead and move me_pglast/mt_next_pgno.
1940 * @param[in] mc cursor A cursor handle identifying the transaction and
1941 * database for which we are allocating.
1942 * @param[in] num the number of pages to allocate.
1943 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1944 * will always be satisfied by a single contiguous chunk of memory.
1945 * @return 0 on success, non-zero on failure.
1948 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1950 #ifdef MDB_PARANOID /* Seems like we can ignore this now */
1951 /* Get at most <Max_retries> more freeDB records once me_pghead
1952 * has enough pages. If not enough, use new pages from the map.
1953 * If <Paranoid> and mc is updating the freeDB, only get new
1954 * records if me_pghead is empty. Then the freelist cannot play
1955 * catch-up with itself by growing while trying to save it.
1957 enum { Paranoid = 1, Max_retries = 500 };
1959 enum { Paranoid = 0, Max_retries = INT_MAX /*infinite*/ };
1961 int rc, retry = num * 60;
1962 MDB_txn *txn = mc->mc_txn;
1963 MDB_env *env = txn->mt_env;
1964 pgno_t pgno, *mop = env->me_pghead;
1965 unsigned i, j, mop_len = mop ? mop[0] : 0, n2 = num-1;
1967 txnid_t oldest = 0, last;
1972 /* If there are any loose pages, just use them */
1973 if (num == 1 && txn->mt_loose_pgs) {
1974 np = txn->mt_loose_pgs;
1975 txn->mt_loose_pgs = NEXT_LOOSE_PAGE(np);
1976 txn->mt_loose_count--;
1977 DPRINTF(("db %d use loose page %"Z"u", DDBI(mc),
1985 /* If our dirty list is already full, we can't do anything */
1986 if (txn->mt_dirty_room == 0) {
1991 for (op = MDB_FIRST;; op = MDB_NEXT) {
1996 /* Seek a big enough contiguous page range. Prefer
1997 * pages at the tail, just truncating the list.
2003 if (mop[i-n2] == pgno+n2)
2010 if (op == MDB_FIRST) { /* 1st iteration */
2011 /* Prepare to fetch more and coalesce */
2012 last = env->me_pglast;
2013 oldest = env->me_pgoldest;
2014 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
2017 key.mv_data = &last; /* will look up last+1 */
2018 key.mv_size = sizeof(last);
2020 if (Paranoid && mc->mc_dbi == FREE_DBI)
2023 if (Paranoid && retry < 0 && mop_len)
2027 /* Do not fetch more if the record will be too recent */
2028 if (oldest <= last) {
2030 oldest = mdb_find_oldest(txn);
2031 env->me_pgoldest = oldest;
2037 rc = mdb_cursor_get(&m2, &key, NULL, op);
2039 if (rc == MDB_NOTFOUND)
2043 last = *(txnid_t*)key.mv_data;
2044 if (oldest <= last) {
2046 oldest = mdb_find_oldest(txn);
2047 env->me_pgoldest = oldest;
2053 np = m2.mc_pg[m2.mc_top];
2054 leaf = NODEPTR(np, m2.mc_ki[m2.mc_top]);
2055 if ((rc = mdb_node_read(txn, leaf, &data)) != MDB_SUCCESS)
2058 idl = (MDB_ID *) data.mv_data;
2061 if (!(env->me_pghead = mop = mdb_midl_alloc(i))) {
2066 if ((rc = mdb_midl_need(&env->me_pghead, i)) != 0)
2068 mop = env->me_pghead;
2070 env->me_pglast = last;
2072 DPRINTF(("IDL read txn %"Z"u root %"Z"u num %u",
2073 last, txn->mt_dbs[FREE_DBI].md_root, i));
2075 DPRINTF(("IDL %"Z"u", idl[j]));
2077 /* Merge in descending sorted order */
2078 mdb_midl_xmerge(mop, idl);
2082 /* Use new pages from the map when nothing suitable in the freeDB */
2084 pgno = txn->mt_next_pgno;
2085 if (pgno + num >= env->me_maxpg) {
2086 DPUTS("DB size maxed out");
2092 if (env->me_flags & MDB_WRITEMAP) {
2093 np = (MDB_page *)(env->me_map + env->me_psize * pgno);
2095 if (!(np = mdb_page_malloc(txn, num))) {
2101 mop[0] = mop_len -= num;
2102 /* Move any stragglers down */
2103 for (j = i-num; j < mop_len; )
2104 mop[++j] = mop[++i];
2106 txn->mt_next_pgno = pgno + num;
2109 mdb_page_dirty(txn, np);
2115 txn->mt_flags |= MDB_TXN_ERROR;
2119 /** Copy the used portions of a non-overflow page.
2120 * @param[in] dst page to copy into
2121 * @param[in] src page to copy from
2122 * @param[in] psize size of a page
2125 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
2127 enum { Align = sizeof(pgno_t) };
2128 indx_t upper = src->mp_upper, lower = src->mp_lower, unused = upper-lower;
2130 /* If page isn't full, just copy the used portion. Adjust
2131 * alignment so memcpy may copy words instead of bytes.
2133 if ((unused &= -Align) && !IS_LEAF2(src)) {
2134 upper = (upper + PAGEBASE) & -Align;
2135 memcpy(dst, src, (lower + PAGEBASE + (Align-1)) & -Align);
2136 memcpy((pgno_t *)((char *)dst+upper), (pgno_t *)((char *)src+upper),
2139 memcpy(dst, src, psize - unused);
2143 /** Pull a page off the txn's spill list, if present.
2144 * If a page being referenced was spilled to disk in this txn, bring
2145 * it back and make it dirty/writable again.
2146 * @param[in] txn the transaction handle.
2147 * @param[in] mp the page being referenced. It must not be dirty.
2148 * @param[out] ret the writable page, if any. ret is unchanged if
2149 * mp wasn't spilled.
2152 mdb_page_unspill(MDB_txn *txn, MDB_page *mp, MDB_page **ret)
2154 MDB_env *env = txn->mt_env;
2157 pgno_t pgno = mp->mp_pgno, pn = pgno << 1;
2159 for (tx2 = txn; tx2; tx2=tx2->mt_parent) {
2160 if (!tx2->mt_spill_pgs)
2162 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
2163 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
2166 if (txn->mt_dirty_room == 0)
2167 return MDB_TXN_FULL;
2168 if (IS_OVERFLOW(mp))
2172 if (env->me_flags & MDB_WRITEMAP) {
2175 np = mdb_page_malloc(txn, num);
2179 memcpy(np, mp, num * env->me_psize);
2181 mdb_page_copy(np, mp, env->me_psize);
2184 /* If in current txn, this page is no longer spilled.
2185 * If it happens to be the last page, truncate the spill list.
2186 * Otherwise mark it as deleted by setting the LSB.
2188 if (x == txn->mt_spill_pgs[0])
2189 txn->mt_spill_pgs[0]--;
2191 txn->mt_spill_pgs[x] |= 1;
2192 } /* otherwise, if belonging to a parent txn, the
2193 * page remains spilled until child commits
2196 mdb_page_dirty(txn, np);
2197 np->mp_flags |= P_DIRTY;
2205 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
2206 * @param[in] mc cursor pointing to the page to be touched
2207 * @return 0 on success, non-zero on failure.
2210 mdb_page_touch(MDB_cursor *mc)
2212 MDB_page *mp = mc->mc_pg[mc->mc_top], *np;
2213 MDB_txn *txn = mc->mc_txn;
2214 MDB_cursor *m2, *m3;
2218 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
2219 if (txn->mt_flags & MDB_TXN_SPILLS) {
2221 rc = mdb_page_unspill(txn, mp, &np);
2227 if ((rc = mdb_midl_need(&txn->mt_free_pgs, 1)) ||
2228 (rc = mdb_page_alloc(mc, 1, &np)))
2231 DPRINTF(("touched db %d page %"Z"u -> %"Z"u", DDBI(mc),
2232 mp->mp_pgno, pgno));
2233 mdb_cassert(mc, mp->mp_pgno != pgno);
2234 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
2235 /* Update the parent page, if any, to point to the new page */
2237 MDB_page *parent = mc->mc_pg[mc->mc_top-1];
2238 MDB_node *node = NODEPTR(parent, mc->mc_ki[mc->mc_top-1]);
2239 SETPGNO(node, pgno);
2241 mc->mc_db->md_root = pgno;
2243 } else if (txn->mt_parent && !IS_SUBP(mp)) {
2244 MDB_ID2 mid, *dl = txn->mt_u.dirty_list;
2246 /* If txn has a parent, make sure the page is in our
2250 unsigned x = mdb_mid2l_search(dl, pgno);
2251 if (x <= dl[0].mid && dl[x].mid == pgno) {
2252 if (mp != dl[x].mptr) { /* bad cursor? */
2253 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
2254 txn->mt_flags |= MDB_TXN_ERROR;
2255 return MDB_CORRUPTED;
2260 mdb_cassert(mc, dl[0].mid < MDB_IDL_UM_MAX);
2262 np = mdb_page_malloc(txn, 1);
2267 rc = mdb_mid2l_insert(dl, &mid);
2268 mdb_cassert(mc, rc == 0);
2273 mdb_page_copy(np, mp, txn->mt_env->me_psize);
2275 np->mp_flags |= P_DIRTY;
2278 /* Adjust cursors pointing to mp */
2279 mc->mc_pg[mc->mc_top] = np;
2280 m2 = txn->mt_cursors[mc->mc_dbi];
2281 if (mc->mc_flags & C_SUB) {
2282 for (; m2; m2=m2->mc_next) {
2283 m3 = &m2->mc_xcursor->mx_cursor;
2284 if (m3->mc_snum < mc->mc_snum) continue;
2285 if (m3->mc_pg[mc->mc_top] == mp)
2286 m3->mc_pg[mc->mc_top] = np;
2289 for (; m2; m2=m2->mc_next) {
2290 if (m2->mc_snum < mc->mc_snum) continue;
2291 if (m2->mc_pg[mc->mc_top] == mp) {
2292 m2->mc_pg[mc->mc_top] = np;
2293 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
2295 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
2297 MDB_node *leaf = NODEPTR(np, mc->mc_ki[mc->mc_top]);
2298 if (!(leaf->mn_flags & F_SUBDATA))
2299 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
2307 txn->mt_flags |= MDB_TXN_ERROR;
2312 mdb_env_sync(MDB_env *env, int force)
2315 if (env->me_flags & MDB_RDONLY)
2317 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
2318 if (env->me_flags & MDB_WRITEMAP) {
2319 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
2320 ? MS_ASYNC : MS_SYNC;
2321 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
2324 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
2328 #ifdef BROKEN_FDATASYNC
2329 if (env->me_flags & MDB_FSYNCONLY) {
2330 if (fsync(env->me_fd))
2334 if (MDB_FDATASYNC(env->me_fd))
2341 /** Back up parent txn's cursors, then grab the originals for tracking */
2343 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
2345 MDB_cursor *mc, *bk;
2350 for (i = src->mt_numdbs; --i >= 0; ) {
2351 if ((mc = src->mt_cursors[i]) != NULL) {
2352 size = sizeof(MDB_cursor);
2354 size += sizeof(MDB_xcursor);
2355 for (; mc; mc = bk->mc_next) {
2361 mc->mc_db = &dst->mt_dbs[i];
2362 /* Kill pointers into src - and dst to reduce abuse: The
2363 * user may not use mc until dst ends. Otherwise we'd...
2365 mc->mc_txn = NULL; /* ...set this to dst */
2366 mc->mc_dbflag = NULL; /* ...and &dst->mt_dbflags[i] */
2367 if ((mx = mc->mc_xcursor) != NULL) {
2368 *(MDB_xcursor *)(bk+1) = *mx;
2369 mx->mx_cursor.mc_txn = NULL; /* ...and dst. */
2371 mc->mc_next = dst->mt_cursors[i];
2372 dst->mt_cursors[i] = mc;
2379 /** Close this write txn's cursors, give parent txn's cursors back to parent.
2380 * @param[in] txn the transaction handle.
2381 * @param[in] merge true to keep changes to parent cursors, false to revert.
2382 * @return 0 on success, non-zero on failure.
2385 mdb_cursors_close(MDB_txn *txn, unsigned merge)
2387 MDB_cursor **cursors = txn->mt_cursors, *mc, *next, *bk;
2391 for (i = txn->mt_numdbs; --i >= 0; ) {
2392 for (mc = cursors[i]; mc; mc = next) {
2394 if ((bk = mc->mc_backup) != NULL) {
2396 /* Commit changes to parent txn */
2397 mc->mc_next = bk->mc_next;
2398 mc->mc_backup = bk->mc_backup;
2399 mc->mc_txn = bk->mc_txn;
2400 mc->mc_db = bk->mc_db;
2401 mc->mc_dbflag = bk->mc_dbflag;
2402 if ((mx = mc->mc_xcursor) != NULL)
2403 mx->mx_cursor.mc_txn = bk->mc_txn;
2405 /* Abort nested txn */
2407 if ((mx = mc->mc_xcursor) != NULL)
2408 *mx = *(MDB_xcursor *)(bk+1);
2412 /* Only malloced cursors are permanently tracked. */
2420 #define mdb_txn_reset0(txn, act) mdb_txn_reset0(txn)
2423 mdb_txn_reset0(MDB_txn *txn, const char *act);
2425 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2431 Pidset = F_SETLK, Pidcheck = F_GETLK
2435 /** Set or check a pid lock. Set returns 0 on success.
2436 * Check returns 0 if the process is certainly dead, nonzero if it may
2437 * be alive (the lock exists or an error happened so we do not know).
2439 * On Windows Pidset is a no-op, we merely check for the existence
2440 * of the process with the given pid. On POSIX we use a single byte
2441 * lock on the lockfile, set at an offset equal to the pid.
2444 mdb_reader_pid(MDB_env *env, enum Pidlock_op op, MDB_PID_T pid)
2446 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2449 if (op == Pidcheck) {
2450 h = OpenProcess(env->me_pidquery, FALSE, pid);
2451 /* No documented "no such process" code, but other program use this: */
2453 return ErrCode() != ERROR_INVALID_PARAMETER;
2454 /* A process exists until all handles to it close. Has it exited? */
2455 ret = WaitForSingleObject(h, 0) != 0;
2462 struct flock lock_info;
2463 memset(&lock_info, 0, sizeof(lock_info));
2464 lock_info.l_type = F_WRLCK;
2465 lock_info.l_whence = SEEK_SET;
2466 lock_info.l_start = pid;
2467 lock_info.l_len = 1;
2468 if ((rc = fcntl(env->me_lfd, op, &lock_info)) == 0) {
2469 if (op == F_GETLK && lock_info.l_type != F_UNLCK)
2471 } else if ((rc = ErrCode()) == EINTR) {
2479 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
2480 * @param[in] txn the transaction handle to initialize
2481 * @return 0 on success, non-zero on failure.
2484 mdb_txn_renew0(MDB_txn *txn)
2486 MDB_env *env = txn->mt_env;
2487 MDB_txninfo *ti = env->me_txns;
2491 int rc, new_notls = 0;
2493 if (txn->mt_flags & MDB_TXN_RDONLY) {
2495 txn->mt_numdbs = env->me_numdbs;
2496 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
2498 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2499 txn->mt_txnid = meta->mm_txnid;
2500 txn->mt_u.reader = NULL;
2502 MDB_reader *r = (env->me_flags & MDB_NOTLS) ? txn->mt_u.reader :
2503 pthread_getspecific(env->me_txkey);
2505 if (r->mr_pid != env->me_pid || r->mr_txnid != (txnid_t)-1)
2506 return MDB_BAD_RSLOT;
2508 MDB_PID_T pid = env->me_pid;
2509 MDB_THR_T tid = pthread_self();
2511 if (!env->me_live_reader) {
2512 rc = mdb_reader_pid(env, Pidset, pid);
2515 env->me_live_reader = 1;
2519 nr = ti->mti_numreaders;
2520 for (i=0; i<nr; i++)
2521 if (ti->mti_readers[i].mr_pid == 0)
2523 if (i == env->me_maxreaders) {
2524 UNLOCK_MUTEX_R(env);
2525 return MDB_READERS_FULL;
2527 ti->mti_readers[i].mr_pid = pid;
2528 ti->mti_readers[i].mr_tid = tid;
2530 ti->mti_numreaders = ++nr;
2531 /* Save numreaders for un-mutexed mdb_env_close() */
2532 env->me_numreaders = nr;
2533 UNLOCK_MUTEX_R(env);
2535 r = &ti->mti_readers[i];
2536 new_notls = (env->me_flags & MDB_NOTLS);
2537 if (!new_notls && (rc=pthread_setspecific(env->me_txkey, r))) {
2542 do /* LY: Retry on a race, ITS#7970. */
2543 r->mr_txnid = ti->mti_txnid;
2544 while(r->mr_txnid != ti->mti_txnid);
2545 txn->mt_txnid = r->mr_txnid;
2546 txn->mt_u.reader = r;
2547 meta = env->me_metas[txn->mt_txnid & 1];
2553 txn->mt_txnid = ti->mti_txnid;
2554 meta = env->me_metas[txn->mt_txnid & 1];
2556 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2557 txn->mt_txnid = meta->mm_txnid;
2560 txn->mt_numdbs = env->me_numdbs;
2563 if (txn->mt_txnid == mdb_debug_start)
2567 txn->mt_child = NULL;
2568 txn->mt_loose_pgs = NULL;
2569 txn->mt_loose_count = 0;
2570 txn->mt_dirty_room = MDB_IDL_UM_MAX;
2571 txn->mt_u.dirty_list = env->me_dirty_list;
2572 txn->mt_u.dirty_list[0].mid = 0;
2573 txn->mt_free_pgs = env->me_free_pgs;
2574 txn->mt_free_pgs[0] = 0;
2575 txn->mt_spill_pgs = NULL;
2577 memcpy(txn->mt_dbiseqs, env->me_dbiseqs, env->me_maxdbs * sizeof(unsigned int));
2580 /* Copy the DB info and flags */
2581 memcpy(txn->mt_dbs, meta->mm_dbs, 2 * sizeof(MDB_db));
2583 /* Moved to here to avoid a data race in read TXNs */
2584 txn->mt_next_pgno = meta->mm_last_pg+1;
2586 for (i=2; i<txn->mt_numdbs; i++) {
2587 x = env->me_dbflags[i];
2588 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
2589 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_STALE : 0;
2591 txn->mt_dbflags[0] = txn->mt_dbflags[1] = DB_VALID;
2593 if (env->me_maxpg < txn->mt_next_pgno) {
2594 mdb_txn_reset0(txn, "renew0-mapfail");
2596 txn->mt_u.reader->mr_pid = 0;
2597 txn->mt_u.reader = NULL;
2599 return MDB_MAP_RESIZED;
2606 mdb_txn_renew(MDB_txn *txn)
2610 if (!txn || txn->mt_dbxs) /* A reset txn has mt_dbxs==NULL */
2613 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
2614 DPUTS("environment had fatal error, must shutdown!");
2618 rc = mdb_txn_renew0(txn);
2619 if (rc == MDB_SUCCESS) {
2620 DPRINTF(("renew txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2621 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2622 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root));
2628 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
2632 int rc, size, tsize = sizeof(MDB_txn);
2634 if (env->me_flags & MDB_FATAL_ERROR) {
2635 DPUTS("environment had fatal error, must shutdown!");
2638 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
2641 /* Nested transactions: Max 1 child, write txns only, no writemap */
2642 if (parent->mt_child ||
2643 (flags & MDB_RDONLY) ||
2644 (parent->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR)) ||
2645 (env->me_flags & MDB_WRITEMAP))
2647 return (parent->mt_flags & MDB_TXN_RDONLY) ? EINVAL : MDB_BAD_TXN;
2649 tsize = sizeof(MDB_ntxn);
2652 if (!(flags & MDB_RDONLY)) {
2654 txn = env->me_txn0; /* just reuse preallocated write txn */
2657 /* child txns use own copy of cursors */
2658 size += env->me_maxdbs * sizeof(MDB_cursor *);
2660 size += env->me_maxdbs * (sizeof(MDB_db)+1);
2662 if ((txn = calloc(1, size)) == NULL) {
2663 DPRINTF(("calloc: %s", strerror(errno)));
2666 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
2667 if (flags & MDB_RDONLY) {
2668 txn->mt_flags |= MDB_TXN_RDONLY;
2669 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
2670 txn->mt_dbiseqs = env->me_dbiseqs;
2672 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
2674 txn->mt_dbiseqs = parent->mt_dbiseqs;
2675 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
2677 txn->mt_dbiseqs = (unsigned int *)(txn->mt_cursors + env->me_maxdbs);
2678 txn->mt_dbflags = (unsigned char *)(txn->mt_dbiseqs + env->me_maxdbs);
2686 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
2687 if (!txn->mt_u.dirty_list ||
2688 !(txn->mt_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)))
2690 free(txn->mt_u.dirty_list);
2694 txn->mt_txnid = parent->mt_txnid;
2695 txn->mt_dirty_room = parent->mt_dirty_room;
2696 txn->mt_u.dirty_list[0].mid = 0;
2697 txn->mt_spill_pgs = NULL;
2698 txn->mt_next_pgno = parent->mt_next_pgno;
2699 parent->mt_child = txn;
2700 txn->mt_parent = parent;
2701 txn->mt_numdbs = parent->mt_numdbs;
2702 txn->mt_flags = parent->mt_flags;
2703 txn->mt_dbxs = parent->mt_dbxs;
2704 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2705 /* Copy parent's mt_dbflags, but clear DB_NEW */
2706 for (i=0; i<txn->mt_numdbs; i++)
2707 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
2709 ntxn = (MDB_ntxn *)txn;
2710 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
2711 if (env->me_pghead) {
2712 size = MDB_IDL_SIZEOF(env->me_pghead);
2713 env->me_pghead = mdb_midl_alloc(env->me_pghead[0]);
2715 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
2720 rc = mdb_cursor_shadow(parent, txn);
2722 mdb_txn_reset0(txn, "beginchild-fail");
2724 rc = mdb_txn_renew0(txn);
2727 if (txn != env->me_txn0)
2731 DPRINTF(("begin txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2732 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2733 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root));
2740 mdb_txn_env(MDB_txn *txn)
2742 if(!txn) return NULL;
2746 /** Export or close DBI handles opened in this txn. */
2748 mdb_dbis_update(MDB_txn *txn, int keep)
2751 MDB_dbi n = txn->mt_numdbs;
2752 MDB_env *env = txn->mt_env;
2753 unsigned char *tdbflags = txn->mt_dbflags;
2755 for (i = n; --i >= 2;) {
2756 if (tdbflags[i] & DB_NEW) {
2758 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2760 char *ptr = env->me_dbxs[i].md_name.mv_data;
2762 env->me_dbxs[i].md_name.mv_data = NULL;
2763 env->me_dbxs[i].md_name.mv_size = 0;
2764 env->me_dbflags[i] = 0;
2765 env->me_dbiseqs[i]++;
2771 if (keep && env->me_numdbs < n)
2775 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
2776 * May be called twice for readonly txns: First reset it, then abort.
2777 * @param[in] txn the transaction handle to reset
2778 * @param[in] act why the transaction is being reset
2781 mdb_txn_reset0(MDB_txn *txn, const char *act)
2783 MDB_env *env = txn->mt_env;
2785 /* Close any DBI handles opened in this txn */
2786 mdb_dbis_update(txn, 0);
2788 DPRINTF(("%s txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2789 act, txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2790 (void *) txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root));
2792 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2793 if (txn->mt_u.reader) {
2794 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
2795 if (!(env->me_flags & MDB_NOTLS))
2796 txn->mt_u.reader = NULL; /* txn does not own reader */
2798 txn->mt_numdbs = 0; /* close nothing if called again */
2799 txn->mt_dbxs = NULL; /* mark txn as reset */
2801 pgno_t *pghead = env->me_pghead;
2803 mdb_cursors_close(txn, 0);
2804 if (!(env->me_flags & MDB_WRITEMAP)) {
2805 mdb_dlist_free(txn);
2808 if (!txn->mt_parent) {
2809 if (mdb_midl_shrink(&txn->mt_free_pgs))
2810 env->me_free_pgs = txn->mt_free_pgs;
2812 env->me_pghead = NULL;
2816 /* The writer mutex was locked in mdb_txn_begin. */
2818 UNLOCK_MUTEX_W(env);
2820 txn->mt_parent->mt_child = NULL;
2821 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2822 mdb_midl_free(txn->mt_free_pgs);
2823 mdb_midl_free(txn->mt_spill_pgs);
2824 free(txn->mt_u.dirty_list);
2827 mdb_midl_free(pghead);
2832 mdb_txn_reset(MDB_txn *txn)
2837 /* This call is only valid for read-only txns */
2838 if (!(txn->mt_flags & MDB_TXN_RDONLY))
2841 mdb_txn_reset0(txn, "reset");
2845 mdb_txn_abort(MDB_txn *txn)
2851 mdb_txn_abort(txn->mt_child);
2853 mdb_txn_reset0(txn, "abort");
2854 /* Free reader slot tied to this txn (if MDB_NOTLS && writable FS) */
2855 if ((txn->mt_flags & MDB_TXN_RDONLY) && txn->mt_u.reader)
2856 txn->mt_u.reader->mr_pid = 0;
2858 if (txn != txn->mt_env->me_txn0)
2862 /** Save the freelist as of this transaction to the freeDB.
2863 * This changes the freelist. Keep trying until it stabilizes.
2866 mdb_freelist_save(MDB_txn *txn)
2868 /* env->me_pghead[] can grow and shrink during this call.
2869 * env->me_pglast and txn->mt_free_pgs[] can only grow.
2870 * Page numbers cannot disappear from txn->mt_free_pgs[].
2873 MDB_env *env = txn->mt_env;
2874 int rc, maxfree_1pg = env->me_maxfree_1pg, more = 1;
2875 txnid_t pglast = 0, head_id = 0;
2876 pgno_t freecnt = 0, *free_pgs, *mop;
2877 ssize_t head_room = 0, total_room = 0, mop_len, clean_limit;
2879 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2881 if (env->me_pghead) {
2882 /* Make sure first page of freeDB is touched and on freelist */
2883 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST|MDB_PS_MODIFY);
2884 if (rc && rc != MDB_NOTFOUND)
2888 if (!env->me_pghead && txn->mt_loose_pgs) {
2889 /* Put loose page numbers in mt_free_pgs, since
2890 * we may be unable to return them to me_pghead.
2892 MDB_page *mp = txn->mt_loose_pgs;
2893 if ((rc = mdb_midl_need(&txn->mt_free_pgs, txn->mt_loose_count)) != 0)
2895 for (; mp; mp = NEXT_LOOSE_PAGE(mp))
2896 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
2897 txn->mt_loose_pgs = NULL;
2898 txn->mt_loose_count = 0;
2901 /* MDB_RESERVE cancels meminit in ovpage malloc (when no WRITEMAP) */
2902 clean_limit = (env->me_flags & (MDB_NOMEMINIT|MDB_WRITEMAP))
2903 ? SSIZE_MAX : maxfree_1pg;
2906 /* Come back here after each Put() in case freelist changed */
2911 /* If using records from freeDB which we have not yet
2912 * deleted, delete them and any we reserved for me_pghead.
2914 while (pglast < env->me_pglast) {
2915 rc = mdb_cursor_first(&mc, &key, NULL);
2918 pglast = head_id = *(txnid_t *)key.mv_data;
2919 total_room = head_room = 0;
2920 mdb_tassert(txn, pglast <= env->me_pglast);
2921 rc = mdb_cursor_del(&mc, 0);
2926 /* Save the IDL of pages freed by this txn, to a single record */
2927 if (freecnt < txn->mt_free_pgs[0]) {
2929 /* Make sure last page of freeDB is touched and on freelist */
2930 rc = mdb_page_search(&mc, NULL, MDB_PS_LAST|MDB_PS_MODIFY);
2931 if (rc && rc != MDB_NOTFOUND)
2934 free_pgs = txn->mt_free_pgs;
2935 /* Write to last page of freeDB */
2936 key.mv_size = sizeof(txn->mt_txnid);
2937 key.mv_data = &txn->mt_txnid;
2939 freecnt = free_pgs[0];
2940 data.mv_size = MDB_IDL_SIZEOF(free_pgs);
2941 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2944 /* Retry if mt_free_pgs[] grew during the Put() */
2945 free_pgs = txn->mt_free_pgs;
2946 } while (freecnt < free_pgs[0]);
2947 mdb_midl_sort(free_pgs);
2948 memcpy(data.mv_data, free_pgs, data.mv_size);
2951 unsigned int i = free_pgs[0];
2952 DPRINTF(("IDL write txn %"Z"u root %"Z"u num %u",
2953 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, i));
2955 DPRINTF(("IDL %"Z"u", free_pgs[i]));
2961 mop = env->me_pghead;
2962 mop_len = (mop ? mop[0] : 0) + txn->mt_loose_count;
2964 /* Reserve records for me_pghead[]. Split it if multi-page,
2965 * to avoid searching freeDB for a page range. Use keys in
2966 * range [1,me_pglast]: Smaller than txnid of oldest reader.
2968 if (total_room >= mop_len) {
2969 if (total_room == mop_len || --more < 0)
2971 } else if (head_room >= maxfree_1pg && head_id > 1) {
2972 /* Keep current record (overflow page), add a new one */
2976 /* (Re)write {key = head_id, IDL length = head_room} */
2977 total_room -= head_room;
2978 head_room = mop_len - total_room;
2979 if (head_room > maxfree_1pg && head_id > 1) {
2980 /* Overflow multi-page for part of me_pghead */
2981 head_room /= head_id; /* amortize page sizes */
2982 head_room += maxfree_1pg - head_room % (maxfree_1pg + 1);
2983 } else if (head_room < 0) {
2984 /* Rare case, not bothering to delete this record */
2987 key.mv_size = sizeof(head_id);
2988 key.mv_data = &head_id;
2989 data.mv_size = (head_room + 1) * sizeof(pgno_t);
2990 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2993 /* IDL is initially empty, zero out at least the length */
2994 pgs = (pgno_t *)data.mv_data;
2995 j = head_room > clean_limit ? head_room : 0;
2999 total_room += head_room;
3002 /* Return loose page numbers to me_pghead, though usually none are
3003 * left at this point. The pages themselves remain in dirty_list.
3005 if (txn->mt_loose_pgs) {
3006 MDB_page *mp = txn->mt_loose_pgs;
3007 unsigned count = txn->mt_loose_count;
3009 /* Room for loose pages + temp IDL with same */
3010 if ((rc = mdb_midl_need(&env->me_pghead, 2*count+1)) != 0)
3012 mop = env->me_pghead;
3013 loose = mop + MDB_IDL_ALLOCLEN(mop) - count;
3014 for (count = 0; mp; mp = NEXT_LOOSE_PAGE(mp))
3015 loose[ ++count ] = mp->mp_pgno;
3017 mdb_midl_sort(loose);
3018 mdb_midl_xmerge(mop, loose);
3019 txn->mt_loose_pgs = NULL;
3020 txn->mt_loose_count = 0;
3024 /* Fill in the reserved me_pghead records */
3030 rc = mdb_cursor_first(&mc, &key, &data);
3031 for (; !rc; rc = mdb_cursor_next(&mc, &key, &data, MDB_NEXT)) {
3032 txnid_t id = *(txnid_t *)key.mv_data;
3033 ssize_t len = (ssize_t)(data.mv_size / sizeof(MDB_ID)) - 1;
3036 mdb_tassert(txn, len >= 0 && id <= env->me_pglast);
3038 if (len > mop_len) {
3040 data.mv_size = (len + 1) * sizeof(MDB_ID);
3042 data.mv_data = mop -= len;
3045 rc = mdb_cursor_put(&mc, &key, &data, MDB_CURRENT);
3047 if (rc || !(mop_len -= len))
3054 /** Flush (some) dirty pages to the map, after clearing their dirty flag.
3055 * @param[in] txn the transaction that's being committed
3056 * @param[in] keep number of initial pages in dirty_list to keep dirty.
3057 * @return 0 on success, non-zero on failure.
3060 mdb_page_flush(MDB_txn *txn, int keep)
3062 MDB_env *env = txn->mt_env;
3063 MDB_ID2L dl = txn->mt_u.dirty_list;
3064 unsigned psize = env->me_psize, j;
3065 int i, pagecount = dl[0].mid, rc;
3066 size_t size = 0, pos = 0;
3068 MDB_page *dp = NULL;
3072 struct iovec iov[MDB_COMMIT_PAGES];
3073 ssize_t wpos = 0, wsize = 0, wres;
3074 size_t next_pos = 1; /* impossible pos, so pos != next_pos */
3080 if (env->me_flags & MDB_WRITEMAP) {
3081 /* Clear dirty flags */
3082 while (++i <= pagecount) {
3084 /* Don't flush this page yet */
3085 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3086 dp->mp_flags &= ~P_KEEP;
3090 dp->mp_flags &= ~P_DIRTY;
3095 /* Write the pages */
3097 if (++i <= pagecount) {
3099 /* Don't flush this page yet */
3100 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3101 dp->mp_flags &= ~P_KEEP;
3106 /* clear dirty flag */
3107 dp->mp_flags &= ~P_DIRTY;
3110 if (IS_OVERFLOW(dp)) size *= dp->mp_pages;
3115 /* Windows actually supports scatter/gather I/O, but only on
3116 * unbuffered file handles. Since we're relying on the OS page
3117 * cache for all our data, that's self-defeating. So we just
3118 * write pages one at a time. We use the ov structure to set
3119 * the write offset, to at least save the overhead of a Seek
3122 DPRINTF(("committing page %"Z"u", pgno));
3123 memset(&ov, 0, sizeof(ov));
3124 ov.Offset = pos & 0xffffffff;
3125 ov.OffsetHigh = pos >> 16 >> 16;
3126 if (!WriteFile(env->me_fd, dp, size, NULL, &ov)) {
3128 DPRINTF(("WriteFile: %d", rc));
3132 /* Write up to MDB_COMMIT_PAGES dirty pages at a time. */
3133 if (pos!=next_pos || n==MDB_COMMIT_PAGES || wsize+size>MAX_WRITE) {
3135 /* Write previous page(s) */
3136 #ifdef MDB_USE_PWRITEV
3137 wres = pwritev(env->me_fd, iov, n, wpos);
3140 wres = pwrite(env->me_fd, iov[0].iov_base, wsize, wpos);
3142 if (lseek(env->me_fd, wpos, SEEK_SET) == -1) {
3144 DPRINTF(("lseek: %s", strerror(rc)));
3147 wres = writev(env->me_fd, iov, n);
3150 if (wres != wsize) {
3153 DPRINTF(("Write error: %s", strerror(rc)));
3155 rc = EIO; /* TODO: Use which error code? */
3156 DPUTS("short write, filesystem full?");
3167 DPRINTF(("committing page %"Z"u", pgno));
3168 next_pos = pos + size;
3169 iov[n].iov_len = size;
3170 iov[n].iov_base = (char *)dp;
3176 /* MIPS has cache coherency issues, this is a no-op everywhere else
3177 * Note: for any size >= on-chip cache size, entire on-chip cache is
3180 CACHEFLUSH(env->me_map, txn->mt_next_pgno * env->me_psize, DCACHE);
3182 for (i = keep; ++i <= pagecount; ) {
3184 /* This is a page we skipped above */
3187 dl[j].mid = dp->mp_pgno;
3190 mdb_dpage_free(env, dp);
3195 txn->mt_dirty_room += i - j;
3201 mdb_txn_commit(MDB_txn *txn)
3207 if (txn == NULL || txn->mt_env == NULL)
3210 if (txn->mt_child) {
3211 rc = mdb_txn_commit(txn->mt_child);
3212 txn->mt_child = NULL;
3219 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
3220 mdb_dbis_update(txn, 1);
3221 txn->mt_numdbs = 2; /* so txn_abort() doesn't close any new handles */
3226 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
3227 DPUTS("error flag is set, can't commit");
3229 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
3234 if (txn->mt_parent) {
3235 MDB_txn *parent = txn->mt_parent;
3239 unsigned x, y, len, ps_len;
3241 /* Append our free list to parent's */
3242 rc = mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs);
3245 mdb_midl_free(txn->mt_free_pgs);
3246 /* Failures after this must either undo the changes
3247 * to the parent or set MDB_TXN_ERROR in the parent.
3250 parent->mt_next_pgno = txn->mt_next_pgno;
3251 parent->mt_flags = txn->mt_flags;
3253 /* Merge our cursors into parent's and close them */
3254 mdb_cursors_close(txn, 1);
3256 /* Update parent's DB table. */
3257 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
3258 parent->mt_numdbs = txn->mt_numdbs;
3259 parent->mt_dbflags[0] = txn->mt_dbflags[0];
3260 parent->mt_dbflags[1] = txn->mt_dbflags[1];
3261 for (i=2; i<txn->mt_numdbs; i++) {
3262 /* preserve parent's DB_NEW status */
3263 x = parent->mt_dbflags[i] & DB_NEW;
3264 parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
3267 dst = parent->mt_u.dirty_list;
3268 src = txn->mt_u.dirty_list;
3269 /* Remove anything in our dirty list from parent's spill list */
3270 if ((pspill = parent->mt_spill_pgs) && (ps_len = pspill[0])) {
3272 pspill[0] = (pgno_t)-1;
3273 /* Mark our dirty pages as deleted in parent spill list */
3274 for (i=0, len=src[0].mid; ++i <= len; ) {
3275 MDB_ID pn = src[i].mid << 1;
3276 while (pn > pspill[x])
3278 if (pn == pspill[x]) {
3283 /* Squash deleted pagenums if we deleted any */
3284 for (x=y; ++x <= ps_len; )
3285 if (!(pspill[x] & 1))
3286 pspill[++y] = pspill[x];
3290 /* Find len = length of merging our dirty list with parent's */
3292 dst[0].mid = 0; /* simplify loops */
3293 if (parent->mt_parent) {
3294 len = x + src[0].mid;
3295 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
3296 for (i = x; y && i; y--) {
3297 pgno_t yp = src[y].mid;
3298 while (yp < dst[i].mid)
3300 if (yp == dst[i].mid) {
3305 } else { /* Simplify the above for single-ancestor case */
3306 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
3308 /* Merge our dirty list with parent's */
3310 for (i = len; y; dst[i--] = src[y--]) {
3311 pgno_t yp = src[y].mid;
3312 while (yp < dst[x].mid)
3313 dst[i--] = dst[x--];
3314 if (yp == dst[x].mid)
3315 free(dst[x--].mptr);
3317 mdb_tassert(txn, i == x);
3319 free(txn->mt_u.dirty_list);
3320 parent->mt_dirty_room = txn->mt_dirty_room;
3321 if (txn->mt_spill_pgs) {
3322 if (parent->mt_spill_pgs) {
3323 /* TODO: Prevent failure here, so parent does not fail */
3324 rc = mdb_midl_append_list(&parent->mt_spill_pgs, txn->mt_spill_pgs);
3326 parent->mt_flags |= MDB_TXN_ERROR;
3327 mdb_midl_free(txn->mt_spill_pgs);
3328 mdb_midl_sort(parent->mt_spill_pgs);
3330 parent->mt_spill_pgs = txn->mt_spill_pgs;
3334 /* Append our loose page list to parent's */
3335 for (lp = &parent->mt_loose_pgs; *lp; lp = &NEXT_LOOSE_PAGE(lp))
3337 *lp = txn->mt_loose_pgs;
3338 parent->mt_loose_count += txn->mt_loose_count;
3340 parent->mt_child = NULL;
3341 mdb_midl_free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pghead);
3346 if (txn != env->me_txn) {
3347 DPUTS("attempt to commit unknown transaction");
3352 mdb_cursors_close(txn, 0);
3354 if (!txn->mt_u.dirty_list[0].mid &&
3355 !(txn->mt_flags & (MDB_TXN_DIRTY|MDB_TXN_SPILLS)))
3358 DPRINTF(("committing txn %"Z"u %p on mdbenv %p, root page %"Z"u",
3359 txn->mt_txnid, (void*)txn, (void*)env, txn->mt_dbs[MAIN_DBI].md_root));
3361 /* Update DB root pointers */
3362 if (txn->mt_numdbs > 2) {
3366 data.mv_size = sizeof(MDB_db);
3368 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
3369 for (i = 2; i < txn->mt_numdbs; i++) {
3370 if (txn->mt_dbflags[i] & DB_DIRTY) {
3371 if (TXN_DBI_CHANGED(txn, i)) {
3375 data.mv_data = &txn->mt_dbs[i];
3376 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
3383 rc = mdb_freelist_save(txn);
3387 mdb_midl_free(env->me_pghead);
3388 env->me_pghead = NULL;
3389 if (mdb_midl_shrink(&txn->mt_free_pgs))
3390 env->me_free_pgs = txn->mt_free_pgs;
3396 if ((rc = mdb_page_flush(txn, 0)) ||
3397 (rc = mdb_env_sync(env, 0)) ||
3398 (rc = mdb_env_write_meta(txn)))
3401 /* Free P_LOOSE pages left behind in dirty_list */
3402 if (!(env->me_flags & MDB_WRITEMAP))
3403 mdb_dlist_free(txn);
3408 mdb_dbis_update(txn, 1);
3411 UNLOCK_MUTEX_W(env);
3412 if (txn != env->me_txn0)
3422 /** Read the environment parameters of a DB environment before
3423 * mapping it into memory.
3424 * @param[in] env the environment handle
3425 * @param[out] meta address of where to store the meta information
3426 * @return 0 on success, non-zero on failure.
3429 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
3435 enum { Size = sizeof(pbuf) };
3437 /* We don't know the page size yet, so use a minimum value.
3438 * Read both meta pages so we can use the latest one.
3441 for (i=off=0; i<2; i++, off = meta->mm_psize) {
3445 memset(&ov, 0, sizeof(ov));
3447 rc = ReadFile(env->me_fd, &pbuf, Size, &len, &ov) ? (int)len : -1;
3448 if (rc == -1 && ErrCode() == ERROR_HANDLE_EOF)
3451 rc = pread(env->me_fd, &pbuf, Size, off);
3454 if (rc == 0 && off == 0)
3456 rc = rc < 0 ? (int) ErrCode() : MDB_INVALID;
3457 DPRINTF(("read: %s", mdb_strerror(rc)));
3461 p = (MDB_page *)&pbuf;
3463 if (!F_ISSET(p->mp_flags, P_META)) {
3464 DPRINTF(("page %"Z"u not a meta page", p->mp_pgno));
3469 if (m->mm_magic != MDB_MAGIC) {
3470 DPUTS("meta has invalid magic");
3474 if (m->mm_version != MDB_DATA_VERSION) {
3475 DPRINTF(("database is version %u, expected version %u",
3476 m->mm_version, MDB_DATA_VERSION));
3477 return MDB_VERSION_MISMATCH;
3480 if (off == 0 || m->mm_txnid > meta->mm_txnid)
3487 mdb_env_init_meta0(MDB_env *env, MDB_meta *meta)
3489 meta->mm_magic = MDB_MAGIC;
3490 meta->mm_version = MDB_DATA_VERSION;
3491 meta->mm_mapsize = env->me_mapsize;
3492 meta->mm_psize = env->me_psize;
3493 meta->mm_last_pg = 1;
3494 meta->mm_flags = env->me_flags & 0xffff;
3495 meta->mm_flags |= MDB_INTEGERKEY;
3496 meta->mm_dbs[0].md_root = P_INVALID;
3497 meta->mm_dbs[1].md_root = P_INVALID;
3500 /** Write the environment parameters of a freshly created DB environment.
3501 * @param[in] env the environment handle
3502 * @param[out] meta address of where to store the meta information
3503 * @return 0 on success, non-zero on failure.
3506 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
3514 memset(&ov, 0, sizeof(ov));
3515 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3517 rc = WriteFile(fd, ptr, size, &len, &ov); } while(0)
3520 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3521 len = pwrite(fd, ptr, size, pos); \
3522 rc = (len >= 0); } while(0)
3525 DPUTS("writing new meta page");
3527 psize = env->me_psize;
3529 mdb_env_init_meta0(env, meta);
3531 p = calloc(2, psize);
3533 p->mp_flags = P_META;
3534 *(MDB_meta *)METADATA(p) = *meta;
3536 q = (MDB_page *)((char *)p + psize);
3538 q->mp_flags = P_META;
3539 *(MDB_meta *)METADATA(q) = *meta;
3541 DO_PWRITE(rc, env->me_fd, p, psize * 2, len, 0);
3544 else if ((unsigned) len == psize * 2)
3552 /** Update the environment info to commit a transaction.
3553 * @param[in] txn the transaction that's being committed
3554 * @return 0 on success, non-zero on failure.
3557 mdb_env_write_meta(MDB_txn *txn)
3560 MDB_meta meta, metab, *mp;
3563 int rc, len, toggle;
3572 toggle = txn->mt_txnid & 1;
3573 DPRINTF(("writing meta page %d for root page %"Z"u",
3574 toggle, txn->mt_dbs[MAIN_DBI].md_root));
3577 mp = env->me_metas[toggle];
3578 mapsize = env->me_metas[toggle ^ 1]->mm_mapsize;
3579 /* Persist any increases of mapsize config */
3580 if (mapsize < env->me_mapsize)
3581 mapsize = env->me_mapsize;
3583 if (env->me_flags & MDB_WRITEMAP) {
3584 mp->mm_mapsize = mapsize;
3585 mp->mm_dbs[0] = txn->mt_dbs[0];
3586 mp->mm_dbs[1] = txn->mt_dbs[1];
3587 mp->mm_last_pg = txn->mt_next_pgno - 1;
3588 mp->mm_txnid = txn->mt_txnid;
3589 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
3590 unsigned meta_size = env->me_psize;
3591 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
3594 #ifndef _WIN32 /* POSIX msync() requires ptr = start of OS page */
3595 if (meta_size < env->me_os_psize)
3596 meta_size += meta_size;
3601 if (MDB_MSYNC(ptr, meta_size, rc)) {
3608 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
3609 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
3611 meta.mm_mapsize = mapsize;
3612 meta.mm_dbs[0] = txn->mt_dbs[0];
3613 meta.mm_dbs[1] = txn->mt_dbs[1];
3614 meta.mm_last_pg = txn->mt_next_pgno - 1;
3615 meta.mm_txnid = txn->mt_txnid;
3617 off = offsetof(MDB_meta, mm_mapsize);
3618 ptr = (char *)&meta + off;
3619 len = sizeof(MDB_meta) - off;
3621 off += env->me_psize;
3624 /* Write to the SYNC fd */
3625 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
3626 env->me_fd : env->me_mfd;
3629 memset(&ov, 0, sizeof(ov));
3631 if (!WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov))
3635 rc = pwrite(mfd, ptr, len, off);
3638 rc = rc < 0 ? ErrCode() : EIO;
3639 DPUTS("write failed, disk error?");
3640 /* On a failure, the pagecache still contains the new data.
3641 * Write some old data back, to prevent it from being used.
3642 * Use the non-SYNC fd; we know it will fail anyway.
3644 meta.mm_last_pg = metab.mm_last_pg;
3645 meta.mm_txnid = metab.mm_txnid;
3647 memset(&ov, 0, sizeof(ov));
3649 WriteFile(env->me_fd, ptr, len, NULL, &ov);
3651 r2 = pwrite(env->me_fd, ptr, len, off);
3652 (void)r2; /* Silence warnings. We don't care about pwrite's return value */
3655 env->me_flags |= MDB_FATAL_ERROR;
3658 /* MIPS has cache coherency issues, this is a no-op everywhere else */
3659 CACHEFLUSH(env->me_map + off, len, DCACHE);
3661 /* Memory ordering issues are irrelevant; since the entire writer
3662 * is wrapped by wmutex, all of these changes will become visible
3663 * after the wmutex is unlocked. Since the DB is multi-version,
3664 * readers will get consistent data regardless of how fresh or
3665 * how stale their view of these values is.
3668 env->me_txns->mti_txnid = txn->mt_txnid;
3673 /** Check both meta pages to see which one is newer.
3674 * @param[in] env the environment handle
3675 * @return meta toggle (0 or 1).
3678 mdb_env_pick_meta(const MDB_env *env)
3680 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
3684 mdb_env_create(MDB_env **env)
3688 e = calloc(1, sizeof(MDB_env));
3692 e->me_maxreaders = DEFAULT_READERS;
3693 e->me_maxdbs = e->me_numdbs = 2;
3694 e->me_fd = INVALID_HANDLE_VALUE;
3695 e->me_lfd = INVALID_HANDLE_VALUE;
3696 e->me_mfd = INVALID_HANDLE_VALUE;
3697 #ifdef MDB_USE_POSIX_SEM
3698 e->me_rmutex = SEM_FAILED;
3699 e->me_wmutex = SEM_FAILED;
3701 e->me_pid = getpid();
3702 GET_PAGESIZE(e->me_os_psize);
3703 VGMEMP_CREATE(e,0,0);
3709 mdb_env_map(MDB_env *env, void *addr)
3712 unsigned int flags = env->me_flags;
3716 LONG sizelo, sizehi;
3719 if (flags & MDB_RDONLY) {
3720 /* Don't set explicit map size, use whatever exists */
3725 msize = env->me_mapsize;
3726 sizelo = msize & 0xffffffff;
3727 sizehi = msize >> 16 >> 16; /* only needed on Win64 */
3729 /* Windows won't create mappings for zero length files.
3730 * and won't map more than the file size.
3731 * Just set the maxsize right now.
3733 if (SetFilePointer(env->me_fd, sizelo, &sizehi, 0) != (DWORD)sizelo
3734 || !SetEndOfFile(env->me_fd)
3735 || SetFilePointer(env->me_fd, 0, NULL, 0) != 0)
3739 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
3740 PAGE_READWRITE : PAGE_READONLY,
3741 sizehi, sizelo, NULL);
3744 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
3745 FILE_MAP_WRITE : FILE_MAP_READ,
3747 rc = env->me_map ? 0 : ErrCode();
3752 int prot = PROT_READ;
3753 if (flags & MDB_WRITEMAP) {
3755 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
3758 env->me_map = mmap(addr, env->me_mapsize, prot, MAP_SHARED,
3760 if (env->me_map == MAP_FAILED) {
3765 if (flags & MDB_NORDAHEAD) {
3766 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
3768 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
3770 #ifdef POSIX_MADV_RANDOM
3771 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
3772 #endif /* POSIX_MADV_RANDOM */
3773 #endif /* MADV_RANDOM */
3777 /* Can happen because the address argument to mmap() is just a
3778 * hint. mmap() can pick another, e.g. if the range is in use.
3779 * The MAP_FIXED flag would prevent that, but then mmap could
3780 * instead unmap existing pages to make room for the new map.
3782 if (addr && env->me_map != addr)
3783 return EBUSY; /* TODO: Make a new MDB_* error code? */
3785 p = (MDB_page *)env->me_map;
3786 env->me_metas[0] = METADATA(p);
3787 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + env->me_psize);
3793 mdb_env_set_mapsize(MDB_env *env, size_t size)
3795 /* If env is already open, caller is responsible for making
3796 * sure there are no active txns.
3804 size = env->me_metas[mdb_env_pick_meta(env)]->mm_mapsize;
3805 else if (size < env->me_mapsize) {
3806 /* If the configured size is smaller, make sure it's
3807 * still big enough. Silently round up to minimum if not.
3809 size_t minsize = (env->me_metas[mdb_env_pick_meta(env)]->mm_last_pg + 1) * env->me_psize;
3813 munmap(env->me_map, env->me_mapsize);
3814 env->me_mapsize = size;
3815 old = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : NULL;
3816 rc = mdb_env_map(env, old);
3820 env->me_mapsize = size;
3822 env->me_maxpg = env->me_mapsize / env->me_psize;
3827 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
3831 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
3836 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
3838 if (env->me_map || readers < 1)
3840 env->me_maxreaders = readers;
3845 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
3847 if (!env || !readers)
3849 *readers = env->me_maxreaders;
3854 mdb_fsize(HANDLE fd, size_t *size)
3857 LARGE_INTEGER fsize;
3859 if (!GetFileSizeEx(fd, &fsize))
3862 *size = fsize.QuadPart;
3874 #ifdef BROKEN_FDATASYNC
3875 #include <sys/utsname.h>
3876 #include <sys/vfs.h>
3879 /** Further setup required for opening an LMDB environment
3882 mdb_env_open2(MDB_env *env)
3884 unsigned int flags = env->me_flags;
3885 int i, newenv = 0, rc;
3889 /* See if we should use QueryLimited */
3891 if ((rc & 0xff) > 5)
3892 env->me_pidquery = MDB_PROCESS_QUERY_LIMITED_INFORMATION;
3894 env->me_pidquery = PROCESS_QUERY_INFORMATION;
3896 #ifdef BROKEN_FDATASYNC
3897 /* ext3/ext4 fdatasync is broken on some older Linux kernels.
3898 * https://lkml.org/lkml/2012/9/3/83
3899 * Kernels after 3.6-rc6 are known good.
3900 * https://lkml.org/lkml/2012/9/10/556
3901 * See if the DB is on ext3/ext4, then check for new enough kernel
3902 * Kernels 2.6.32.60, 2.6.34.15, 3.2.30, and 3.5.4 are also known
3907 fstatfs(env->me_fd, &st);
3908 while (st.f_type == 0xEF53) {
3912 if (uts.release[0] < '3') {
3913 if (!strncmp(uts.release, "2.6.32.", 7)) {
3914 i = atoi(uts.release+7);
3916 break; /* 2.6.32.60 and newer is OK */
3917 } else if (!strncmp(uts.release, "2.6.34.", 7)) {
3918 i = atoi(uts.release+7);
3920 break; /* 2.6.34.15 and newer is OK */
3922 } else if (uts.release[0] == '3') {
3923 i = atoi(uts.release+2);
3925 break; /* 3.6 and newer is OK */
3927 i = atoi(uts.release+4);
3929 break; /* 3.5.4 and newer is OK */
3930 } else if (i == 2) {
3931 i = atoi(uts.release+4);
3933 break; /* 3.2.30 and newer is OK */
3935 } else { /* 4.x and newer is OK */
3938 env->me_flags |= MDB_FSYNCONLY;
3944 memset(&meta, 0, sizeof(meta));
3946 if ((i = mdb_env_read_header(env, &meta)) != 0) {
3949 DPUTS("new mdbenv");
3951 env->me_psize = env->me_os_psize;
3952 if (env->me_psize > MAX_PAGESIZE)
3953 env->me_psize = MAX_PAGESIZE;
3955 env->me_psize = meta.mm_psize;
3958 /* Was a mapsize configured? */
3959 if (!env->me_mapsize) {
3960 /* If this is a new environment, take the default,
3961 * else use the size recorded in the existing env.
3963 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
3964 } else if (env->me_mapsize < meta.mm_mapsize) {
3965 /* If the configured size is smaller, make sure it's
3966 * still big enough. Silently round up to minimum if not.
3968 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
3969 if (env->me_mapsize < minsize)
3970 env->me_mapsize = minsize;
3973 rc = mdb_env_map(env, (flags & MDB_FIXEDMAP) ? meta.mm_address : NULL);
3978 if (flags & MDB_FIXEDMAP)
3979 meta.mm_address = env->me_map;
3980 i = mdb_env_init_meta(env, &meta);
3981 if (i != MDB_SUCCESS) {
3986 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
3987 env->me_nodemax = (((env->me_psize - PAGEHDRSZ) / MDB_MINKEYS) & -2)
3989 #if !(MDB_MAXKEYSIZE)
3990 env->me_maxkey = env->me_nodemax - (NODESIZE + sizeof(MDB_db));
3992 env->me_maxpg = env->me_mapsize / env->me_psize;
3996 int toggle = mdb_env_pick_meta(env);
3997 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
3999 DPRINTF(("opened database version %u, pagesize %u",
4000 env->me_metas[0]->mm_version, env->me_psize));
4001 DPRINTF(("using meta page %d", toggle));
4002 DPRINTF(("depth: %u", db->md_depth));
4003 DPRINTF(("entries: %"Z"u", db->md_entries));
4004 DPRINTF(("branch pages: %"Z"u", db->md_branch_pages));
4005 DPRINTF(("leaf pages: %"Z"u", db->md_leaf_pages));
4006 DPRINTF(("overflow pages: %"Z"u", db->md_overflow_pages));
4007 DPRINTF(("root: %"Z"u", db->md_root));
4015 /** Release a reader thread's slot in the reader lock table.
4016 * This function is called automatically when a thread exits.
4017 * @param[in] ptr This points to the slot in the reader lock table.
4020 mdb_env_reader_dest(void *ptr)
4022 MDB_reader *reader = ptr;
4028 /** Junk for arranging thread-specific callbacks on Windows. This is
4029 * necessarily platform and compiler-specific. Windows supports up
4030 * to 1088 keys. Let's assume nobody opens more than 64 environments
4031 * in a single process, for now. They can override this if needed.
4033 #ifndef MAX_TLS_KEYS
4034 #define MAX_TLS_KEYS 64
4036 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
4037 static int mdb_tls_nkeys;
4039 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
4043 case DLL_PROCESS_ATTACH: break;
4044 case DLL_THREAD_ATTACH: break;
4045 case DLL_THREAD_DETACH:
4046 for (i=0; i<mdb_tls_nkeys; i++) {
4047 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
4049 mdb_env_reader_dest(r);
4053 case DLL_PROCESS_DETACH: break;
4058 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
4060 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
4064 /* Force some symbol references.
4065 * _tls_used forces the linker to create the TLS directory if not already done
4066 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
4068 #pragma comment(linker, "/INCLUDE:_tls_used")
4069 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
4070 #pragma const_seg(".CRT$XLB")
4071 extern const PIMAGE_TLS_CALLBACK mdb_tls_cbp;
4072 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
4075 #pragma comment(linker, "/INCLUDE:__tls_used")
4076 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
4077 #pragma data_seg(".CRT$XLB")
4078 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
4080 #endif /* WIN 32/64 */
4081 #endif /* !__GNUC__ */
4084 /** Downgrade the exclusive lock on the region back to shared */
4086 mdb_env_share_locks(MDB_env *env, int *excl)
4088 int rc = 0, toggle = mdb_env_pick_meta(env);
4090 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
4095 /* First acquire a shared lock. The Unlock will
4096 * then release the existing exclusive lock.
4098 memset(&ov, 0, sizeof(ov));
4099 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
4102 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4108 struct flock lock_info;
4109 /* The shared lock replaces the existing lock */
4110 memset((void *)&lock_info, 0, sizeof(lock_info));
4111 lock_info.l_type = F_RDLCK;
4112 lock_info.l_whence = SEEK_SET;
4113 lock_info.l_start = 0;
4114 lock_info.l_len = 1;
4115 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
4116 (rc = ErrCode()) == EINTR) ;
4117 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
4124 /** Try to get exclusive lock, otherwise shared.
4125 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
4128 mdb_env_excl_lock(MDB_env *env, int *excl)
4132 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
4136 memset(&ov, 0, sizeof(ov));
4137 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
4144 struct flock lock_info;
4145 memset((void *)&lock_info, 0, sizeof(lock_info));
4146 lock_info.l_type = F_WRLCK;
4147 lock_info.l_whence = SEEK_SET;
4148 lock_info.l_start = 0;
4149 lock_info.l_len = 1;
4150 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
4151 (rc = ErrCode()) == EINTR) ;
4155 # ifdef MDB_USE_POSIX_SEM
4156 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
4159 lock_info.l_type = F_RDLCK;
4160 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
4161 (rc = ErrCode()) == EINTR) ;
4171 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
4173 * @(#) $Revision: 5.1 $
4174 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
4175 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
4177 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
4181 * Please do not copyright this code. This code is in the public domain.
4183 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
4184 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
4185 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
4186 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
4187 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
4188 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
4189 * PERFORMANCE OF THIS SOFTWARE.
4192 * chongo <Landon Curt Noll> /\oo/\
4193 * http://www.isthe.com/chongo/
4195 * Share and Enjoy! :-)
4198 typedef unsigned long long mdb_hash_t;
4199 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
4201 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
4202 * @param[in] val value to hash
4203 * @param[in] hval initial value for hash
4204 * @return 64 bit hash
4206 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
4207 * hval arg on the first call.
4210 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
4212 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
4213 unsigned char *end = s + val->mv_size;
4215 * FNV-1a hash each octet of the string
4218 /* xor the bottom with the current octet */
4219 hval ^= (mdb_hash_t)*s++;
4221 /* multiply by the 64 bit FNV magic prime mod 2^64 */
4222 hval += (hval << 1) + (hval << 4) + (hval << 5) +
4223 (hval << 7) + (hval << 8) + (hval << 40);
4225 /* return our new hash value */
4229 /** Hash the string and output the encoded hash.
4230 * This uses modified RFC1924 Ascii85 encoding to accommodate systems with
4231 * very short name limits. We don't care about the encoding being reversible,
4232 * we just want to preserve as many bits of the input as possible in a
4233 * small printable string.
4234 * @param[in] str string to hash
4235 * @param[out] encbuf an array of 11 chars to hold the hash
4237 static const char mdb_a85[]= "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~";
4240 mdb_pack85(unsigned long l, char *out)
4244 for (i=0; i<5; i++) {
4245 *out++ = mdb_a85[l % 85];
4251 mdb_hash_enc(MDB_val *val, char *encbuf)
4253 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
4255 mdb_pack85(h, encbuf);
4256 mdb_pack85(h>>32, encbuf+5);
4261 /** Open and/or initialize the lock region for the environment.
4262 * @param[in] env The LMDB environment.
4263 * @param[in] lpath The pathname of the file used for the lock region.
4264 * @param[in] mode The Unix permissions for the file, if we create it.
4265 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
4266 * @return 0 on success, non-zero on failure.
4269 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
4272 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
4274 # define MDB_ERRCODE_ROFS EROFS
4275 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
4276 # define MDB_CLOEXEC O_CLOEXEC
4279 # define MDB_CLOEXEC 0
4286 env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
4287 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
4288 FILE_ATTRIBUTE_NORMAL, NULL);
4290 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
4292 if (env->me_lfd == INVALID_HANDLE_VALUE) {
4294 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
4299 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
4300 /* Lose record locks when exec*() */
4301 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
4302 fcntl(env->me_lfd, F_SETFD, fdflags);
4305 if (!(env->me_flags & MDB_NOTLS)) {
4306 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
4309 env->me_flags |= MDB_ENV_TXKEY;
4311 /* Windows TLS callbacks need help finding their TLS info. */
4312 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
4316 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
4320 /* Try to get exclusive lock. If we succeed, then
4321 * nobody is using the lock region and we should initialize it.
4323 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
4326 size = GetFileSize(env->me_lfd, NULL);
4328 size = lseek(env->me_lfd, 0, SEEK_END);
4329 if (size == -1) goto fail_errno;
4331 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
4332 if (size < rsize && *excl > 0) {
4334 if (SetFilePointer(env->me_lfd, rsize, NULL, FILE_BEGIN) != (DWORD)rsize
4335 || !SetEndOfFile(env->me_lfd))
4338 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
4342 size = rsize - sizeof(MDB_txninfo);
4343 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
4348 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
4350 if (!mh) goto fail_errno;
4351 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
4353 if (!env->me_txns) goto fail_errno;
4355 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
4357 if (m == MAP_FAILED) goto fail_errno;
4363 BY_HANDLE_FILE_INFORMATION stbuf;
4372 if (!mdb_sec_inited) {
4373 InitializeSecurityDescriptor(&mdb_null_sd,
4374 SECURITY_DESCRIPTOR_REVISION);
4375 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
4376 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
4377 mdb_all_sa.bInheritHandle = FALSE;
4378 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
4381 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
4382 idbuf.volume = stbuf.dwVolumeSerialNumber;
4383 idbuf.nhigh = stbuf.nFileIndexHigh;
4384 idbuf.nlow = stbuf.nFileIndexLow;
4385 val.mv_data = &idbuf;
4386 val.mv_size = sizeof(idbuf);
4387 mdb_hash_enc(&val, encbuf);
4388 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", encbuf);
4389 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", encbuf);
4390 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
4391 if (!env->me_rmutex) goto fail_errno;
4392 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
4393 if (!env->me_wmutex) goto fail_errno;
4394 #elif defined(MDB_USE_POSIX_SEM)
4403 #if defined(__NetBSD__)
4404 #define MDB_SHORT_SEMNAMES 1 /* limited to 14 chars */
4406 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
4407 idbuf.dev = stbuf.st_dev;
4408 idbuf.ino = stbuf.st_ino;
4409 val.mv_data = &idbuf;
4410 val.mv_size = sizeof(idbuf);
4411 mdb_hash_enc(&val, encbuf);
4412 #ifdef MDB_SHORT_SEMNAMES
4413 encbuf[9] = '\0'; /* drop name from 15 chars to 14 chars */
4415 sprintf(env->me_txns->mti_rmname, "/MDBr%s", encbuf);
4416 sprintf(env->me_txns->mti_wmname, "/MDBw%s", encbuf);
4417 /* Clean up after a previous run, if needed: Try to
4418 * remove both semaphores before doing anything else.
4420 sem_unlink(env->me_txns->mti_rmname);
4421 sem_unlink(env->me_txns->mti_wmname);
4422 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
4423 O_CREAT|O_EXCL, mode, 1);
4424 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4425 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
4426 O_CREAT|O_EXCL, mode, 1);
4427 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4428 #else /* MDB_USE_POSIX_SEM */
4429 pthread_mutexattr_t mattr;
4431 if ((rc = pthread_mutexattr_init(&mattr))
4432 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
4433 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
4434 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
4436 pthread_mutexattr_destroy(&mattr);
4437 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
4439 env->me_txns->mti_magic = MDB_MAGIC;
4440 env->me_txns->mti_format = MDB_LOCK_FORMAT;
4441 env->me_txns->mti_txnid = 0;
4442 env->me_txns->mti_numreaders = 0;
4445 if (env->me_txns->mti_magic != MDB_MAGIC) {
4446 DPUTS("lock region has invalid magic");
4450 if (env->me_txns->mti_format != MDB_LOCK_FORMAT) {
4451 DPRINTF(("lock region has format+version 0x%x, expected 0x%x",
4452 env->me_txns->mti_format, MDB_LOCK_FORMAT));
4453 rc = MDB_VERSION_MISMATCH;
4457 if (rc && rc != EACCES && rc != EAGAIN) {
4461 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
4462 if (!env->me_rmutex) goto fail_errno;
4463 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
4464 if (!env->me_wmutex) goto fail_errno;
4465 #elif defined(MDB_USE_POSIX_SEM)
4466 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
4467 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4468 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
4469 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4480 /** The name of the lock file in the DB environment */
4481 #define LOCKNAME "/lock.mdb"
4482 /** The name of the data file in the DB environment */
4483 #define DATANAME "/data.mdb"
4484 /** The suffix of the lock file when no subdir is used */
4485 #define LOCKSUFF "-lock"
4486 /** Only a subset of the @ref mdb_env flags can be changed
4487 * at runtime. Changing other flags requires closing the
4488 * environment and re-opening it with the new flags.
4490 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC|MDB_NOMEMINIT)
4491 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP| \
4492 MDB_NOTLS|MDB_NOLOCK|MDB_NORDAHEAD)
4494 #if VALID_FLAGS & PERSISTENT_FLAGS & (CHANGEABLE|CHANGELESS)
4495 # error "Persistent DB flags & env flags overlap, but both go in mm_flags"
4499 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
4501 int oflags, rc, len, excl = -1;
4502 char *lpath, *dpath;
4504 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
4508 if (flags & MDB_NOSUBDIR) {
4509 rc = len + sizeof(LOCKSUFF) + len + 1;
4511 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
4516 if (flags & MDB_NOSUBDIR) {
4517 dpath = lpath + len + sizeof(LOCKSUFF);
4518 sprintf(lpath, "%s" LOCKSUFF, path);
4519 strcpy(dpath, path);
4521 dpath = lpath + len + sizeof(LOCKNAME);
4522 sprintf(lpath, "%s" LOCKNAME, path);
4523 sprintf(dpath, "%s" DATANAME, path);
4527 flags |= env->me_flags;
4528 if (flags & MDB_RDONLY) {
4529 /* silently ignore WRITEMAP when we're only getting read access */
4530 flags &= ~MDB_WRITEMAP;
4532 if (!((env->me_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)) &&
4533 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
4536 env->me_flags = flags |= MDB_ENV_ACTIVE;
4540 env->me_path = strdup(path);
4541 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
4542 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
4543 env->me_dbiseqs = calloc(env->me_maxdbs, sizeof(unsigned int));
4544 if (!(env->me_dbxs && env->me_path && env->me_dbflags && env->me_dbiseqs)) {
4549 /* For RDONLY, get lockfile after we know datafile exists */
4550 if (!(flags & (MDB_RDONLY|MDB_NOLOCK))) {
4551 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4557 if (F_ISSET(flags, MDB_RDONLY)) {
4558 oflags = GENERIC_READ;
4559 len = OPEN_EXISTING;
4561 oflags = GENERIC_READ|GENERIC_WRITE;
4564 mode = FILE_ATTRIBUTE_NORMAL;
4565 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
4566 NULL, len, mode, NULL);
4568 if (F_ISSET(flags, MDB_RDONLY))
4571 oflags = O_RDWR | O_CREAT;
4573 env->me_fd = open(dpath, oflags, mode);
4575 if (env->me_fd == INVALID_HANDLE_VALUE) {
4580 if ((flags & (MDB_RDONLY|MDB_NOLOCK)) == MDB_RDONLY) {
4581 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4586 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
4587 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
4588 env->me_mfd = env->me_fd;
4590 /* Synchronous fd for meta writes. Needed even with
4591 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
4594 len = OPEN_EXISTING;
4595 env->me_mfd = CreateFile(dpath, oflags,
4596 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
4597 mode | FILE_FLAG_WRITE_THROUGH, NULL);
4600 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
4602 if (env->me_mfd == INVALID_HANDLE_VALUE) {
4607 DPRINTF(("opened dbenv %p", (void *) env));
4609 rc = mdb_env_share_locks(env, &excl);
4613 if (!((flags & MDB_RDONLY) ||
4614 (env->me_pbuf = calloc(1, env->me_psize))))
4616 if (!(flags & MDB_RDONLY)) {
4618 int tsize = sizeof(MDB_txn), size = tsize + env->me_maxdbs *
4619 (sizeof(MDB_db)+sizeof(MDB_cursor *)+sizeof(unsigned int)+1);
4620 txn = calloc(1, size);
4622 txn->mt_dbs = (MDB_db *)((char *)txn + tsize);
4623 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
4624 txn->mt_dbiseqs = (unsigned int *)(txn->mt_cursors + env->me_maxdbs);
4625 txn->mt_dbflags = (unsigned char *)(txn->mt_dbiseqs + env->me_maxdbs);
4627 txn->mt_dbxs = env->me_dbxs;
4637 mdb_env_close0(env, excl);
4643 /** Destroy resources from mdb_env_open(), clear our readers & DBIs */
4645 mdb_env_close0(MDB_env *env, int excl)
4649 if (!(env->me_flags & MDB_ENV_ACTIVE))
4652 /* Doing this here since me_dbxs may not exist during mdb_env_close */
4654 for (i = env->me_maxdbs; --i > MAIN_DBI; )
4655 free(env->me_dbxs[i].md_name.mv_data);
4660 free(env->me_dbiseqs);
4661 free(env->me_dbflags);
4663 free(env->me_dirty_list);
4665 mdb_midl_free(env->me_free_pgs);
4667 if (env->me_flags & MDB_ENV_TXKEY) {
4668 pthread_key_delete(env->me_txkey);
4670 /* Delete our key from the global list */
4671 for (i=0; i<mdb_tls_nkeys; i++)
4672 if (mdb_tls_keys[i] == env->me_txkey) {
4673 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
4681 munmap(env->me_map, env->me_mapsize);
4683 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
4684 (void) close(env->me_mfd);
4685 if (env->me_fd != INVALID_HANDLE_VALUE)
4686 (void) close(env->me_fd);
4688 MDB_PID_T pid = env->me_pid;
4689 /* Clearing readers is done in this function because
4690 * me_txkey with its destructor must be disabled first.
4692 for (i = env->me_numreaders; --i >= 0; )
4693 if (env->me_txns->mti_readers[i].mr_pid == pid)
4694 env->me_txns->mti_readers[i].mr_pid = 0;
4696 if (env->me_rmutex) {
4697 CloseHandle(env->me_rmutex);
4698 if (env->me_wmutex) CloseHandle(env->me_wmutex);
4700 /* Windows automatically destroys the mutexes when
4701 * the last handle closes.
4703 #elif defined(MDB_USE_POSIX_SEM)
4704 if (env->me_rmutex != SEM_FAILED) {
4705 sem_close(env->me_rmutex);
4706 if (env->me_wmutex != SEM_FAILED)
4707 sem_close(env->me_wmutex);
4708 /* If we have the filelock: If we are the
4709 * only remaining user, clean up semaphores.
4712 mdb_env_excl_lock(env, &excl);
4714 sem_unlink(env->me_txns->mti_rmname);
4715 sem_unlink(env->me_txns->mti_wmname);
4719 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
4721 if (env->me_lfd != INVALID_HANDLE_VALUE) {
4724 /* Unlock the lockfile. Windows would have unlocked it
4725 * after closing anyway, but not necessarily at once.
4727 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4730 (void) close(env->me_lfd);
4733 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
4738 mdb_env_close(MDB_env *env)
4745 VGMEMP_DESTROY(env);
4746 while ((dp = env->me_dpages) != NULL) {
4747 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
4748 env->me_dpages = dp->mp_next;
4752 mdb_env_close0(env, 0);
4756 /** Compare two items pointing at aligned size_t's */
4758 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
4760 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
4761 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
4764 /** Compare two items pointing at aligned unsigned int's */
4766 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
4768 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
4769 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
4772 /** Compare two items pointing at unsigned ints of unknown alignment.
4773 * Nodes and keys are guaranteed to be 2-byte aligned.
4776 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
4778 #if BYTE_ORDER == LITTLE_ENDIAN
4779 unsigned short *u, *c;
4782 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4783 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
4786 } while(!x && u > (unsigned short *)a->mv_data);
4789 unsigned short *u, *c, *end;
4792 end = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4793 u = (unsigned short *)a->mv_data;
4794 c = (unsigned short *)b->mv_data;
4797 } while(!x && u < end);
4802 /** Compare two items pointing at size_t's of unknown alignment. */
4803 #ifdef MISALIGNED_OK
4804 # define mdb_cmp_clong mdb_cmp_long
4806 # define mdb_cmp_clong mdb_cmp_cint
4809 /** Compare two items lexically */
4811 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
4818 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4824 diff = memcmp(a->mv_data, b->mv_data, len);
4825 return diff ? diff : len_diff<0 ? -1 : len_diff;
4828 /** Compare two items in reverse byte order */
4830 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
4832 const unsigned char *p1, *p2, *p1_lim;
4836 p1_lim = (const unsigned char *)a->mv_data;
4837 p1 = (const unsigned char *)a->mv_data + a->mv_size;
4838 p2 = (const unsigned char *)b->mv_data + b->mv_size;
4840 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4846 while (p1 > p1_lim) {
4847 diff = *--p1 - *--p2;
4851 return len_diff<0 ? -1 : len_diff;
4854 /** Search for key within a page, using binary search.
4855 * Returns the smallest entry larger or equal to the key.
4856 * If exactp is non-null, stores whether the found entry was an exact match
4857 * in *exactp (1 or 0).
4858 * Updates the cursor index with the index of the found entry.
4859 * If no entry larger or equal to the key is found, returns NULL.
4862 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
4864 unsigned int i = 0, nkeys;
4867 MDB_page *mp = mc->mc_pg[mc->mc_top];
4868 MDB_node *node = NULL;
4873 nkeys = NUMKEYS(mp);
4875 DPRINTF(("searching %u keys in %s %spage %"Z"u",
4876 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
4879 low = IS_LEAF(mp) ? 0 : 1;
4881 cmp = mc->mc_dbx->md_cmp;
4883 /* Branch pages have no data, so if using integer keys,
4884 * alignment is guaranteed. Use faster mdb_cmp_int.
4886 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
4887 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
4894 nodekey.mv_size = mc->mc_db->md_pad;
4895 node = NODEPTR(mp, 0); /* fake */
4896 while (low <= high) {
4897 i = (low + high) >> 1;
4898 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
4899 rc = cmp(key, &nodekey);
4900 DPRINTF(("found leaf index %u [%s], rc = %i",
4901 i, DKEY(&nodekey), rc));
4910 while (low <= high) {
4911 i = (low + high) >> 1;
4913 node = NODEPTR(mp, i);
4914 nodekey.mv_size = NODEKSZ(node);
4915 nodekey.mv_data = NODEKEY(node);
4917 rc = cmp(key, &nodekey);
4920 DPRINTF(("found leaf index %u [%s], rc = %i",
4921 i, DKEY(&nodekey), rc));
4923 DPRINTF(("found branch index %u [%s -> %"Z"u], rc = %i",
4924 i, DKEY(&nodekey), NODEPGNO(node), rc));
4935 if (rc > 0) { /* Found entry is less than the key. */
4936 i++; /* Skip to get the smallest entry larger than key. */
4938 node = NODEPTR(mp, i);
4941 *exactp = (rc == 0 && nkeys > 0);
4942 /* store the key index */
4943 mc->mc_ki[mc->mc_top] = i;
4945 /* There is no entry larger or equal to the key. */
4948 /* nodeptr is fake for LEAF2 */
4954 mdb_cursor_adjust(MDB_cursor *mc, func)
4958 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4959 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
4966 /** Pop a page off the top of the cursor's stack. */
4968 mdb_cursor_pop(MDB_cursor *mc)
4972 MDB_page *top = mc->mc_pg[mc->mc_top];
4978 DPRINTF(("popped page %"Z"u off db %d cursor %p", top->mp_pgno,
4979 DDBI(mc), (void *) mc));
4983 /** Push a page onto the top of the cursor's stack. */
4985 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
4987 DPRINTF(("pushing page %"Z"u on db %d cursor %p", mp->mp_pgno,
4988 DDBI(mc), (void *) mc));
4990 if (mc->mc_snum >= CURSOR_STACK) {
4991 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4992 return MDB_CURSOR_FULL;
4995 mc->mc_top = mc->mc_snum++;
4996 mc->mc_pg[mc->mc_top] = mp;
4997 mc->mc_ki[mc->mc_top] = 0;
5002 /** Find the address of the page corresponding to a given page number.
5003 * @param[in] txn the transaction for this access.
5004 * @param[in] pgno the page number for the page to retrieve.
5005 * @param[out] ret address of a pointer where the page's address will be stored.
5006 * @param[out] lvl dirty_list inheritance level of found page. 1=current txn, 0=mapped page.
5007 * @return 0 on success, non-zero on failure.
5010 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret, int *lvl)
5012 MDB_env *env = txn->mt_env;
5016 if (!((txn->mt_flags & MDB_TXN_RDONLY) | (env->me_flags & MDB_WRITEMAP))) {
5020 MDB_ID2L dl = tx2->mt_u.dirty_list;
5022 /* Spilled pages were dirtied in this txn and flushed
5023 * because the dirty list got full. Bring this page
5024 * back in from the map (but don't unspill it here,
5025 * leave that unless page_touch happens again).
5027 if (tx2->mt_spill_pgs) {
5028 MDB_ID pn = pgno << 1;
5029 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
5030 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
5031 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
5036 unsigned x = mdb_mid2l_search(dl, pgno);
5037 if (x <= dl[0].mid && dl[x].mid == pgno) {
5043 } while ((tx2 = tx2->mt_parent) != NULL);
5046 if (pgno < txn->mt_next_pgno) {
5048 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
5050 DPRINTF(("page %"Z"u not found", pgno));
5051 txn->mt_flags |= MDB_TXN_ERROR;
5052 return MDB_PAGE_NOTFOUND;
5062 /** Finish #mdb_page_search() / #mdb_page_search_lowest().
5063 * The cursor is at the root page, set up the rest of it.
5066 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int flags)
5068 MDB_page *mp = mc->mc_pg[mc->mc_top];
5072 while (IS_BRANCH(mp)) {
5076 DPRINTF(("branch page %"Z"u has %u keys", mp->mp_pgno, NUMKEYS(mp)));
5077 mdb_cassert(mc, NUMKEYS(mp) > 1);
5078 DPRINTF(("found index 0 to page %"Z"u", NODEPGNO(NODEPTR(mp, 0))));
5080 if (flags & (MDB_PS_FIRST|MDB_PS_LAST)) {
5082 if (flags & MDB_PS_LAST)
5083 i = NUMKEYS(mp) - 1;
5086 node = mdb_node_search(mc, key, &exact);
5088 i = NUMKEYS(mp) - 1;
5090 i = mc->mc_ki[mc->mc_top];
5092 mdb_cassert(mc, i > 0);
5096 DPRINTF(("following index %u for key [%s]", i, DKEY(key)));
5099 mdb_cassert(mc, i < NUMKEYS(mp));
5100 node = NODEPTR(mp, i);
5102 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
5105 mc->mc_ki[mc->mc_top] = i;
5106 if ((rc = mdb_cursor_push(mc, mp)))
5109 if (flags & MDB_PS_MODIFY) {
5110 if ((rc = mdb_page_touch(mc)) != 0)
5112 mp = mc->mc_pg[mc->mc_top];
5117 DPRINTF(("internal error, index points to a %02X page!?",
5119 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5120 return MDB_CORRUPTED;
5123 DPRINTF(("found leaf page %"Z"u for key [%s]", mp->mp_pgno,
5124 key ? DKEY(key) : "null"));
5125 mc->mc_flags |= C_INITIALIZED;
5126 mc->mc_flags &= ~C_EOF;
5131 /** Search for the lowest key under the current branch page.
5132 * This just bypasses a NUMKEYS check in the current page
5133 * before calling mdb_page_search_root(), because the callers
5134 * are all in situations where the current page is known to
5138 mdb_page_search_lowest(MDB_cursor *mc)
5140 MDB_page *mp = mc->mc_pg[mc->mc_top];
5141 MDB_node *node = NODEPTR(mp, 0);
5144 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
5147 mc->mc_ki[mc->mc_top] = 0;
5148 if ((rc = mdb_cursor_push(mc, mp)))
5150 return mdb_page_search_root(mc, NULL, MDB_PS_FIRST);
5153 /** Search for the page a given key should be in.
5154 * Push it and its parent pages on the cursor stack.
5155 * @param[in,out] mc the cursor for this operation.
5156 * @param[in] key the key to search for, or NULL for first/last page.
5157 * @param[in] flags If MDB_PS_MODIFY is set, visited pages in the DB
5158 * are touched (updated with new page numbers).
5159 * If MDB_PS_FIRST or MDB_PS_LAST is set, find first or last leaf.
5160 * This is used by #mdb_cursor_first() and #mdb_cursor_last().
5161 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
5162 * @return 0 on success, non-zero on failure.
5165 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
5170 /* Make sure the txn is still viable, then find the root from
5171 * the txn's db table and set it as the root of the cursor's stack.
5173 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
5174 DPUTS("transaction has failed, must abort");
5177 /* Make sure we're using an up-to-date root */
5178 if (*mc->mc_dbflag & DB_STALE) {
5180 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
5182 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
5183 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, 0);
5190 MDB_node *leaf = mdb_node_search(&mc2,
5191 &mc->mc_dbx->md_name, &exact);
5193 return MDB_NOTFOUND;
5194 rc = mdb_node_read(mc->mc_txn, leaf, &data);
5197 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
5199 /* The txn may not know this DBI, or another process may
5200 * have dropped and recreated the DB with other flags.
5202 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
5203 return MDB_INCOMPATIBLE;
5204 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
5206 *mc->mc_dbflag &= ~DB_STALE;
5208 root = mc->mc_db->md_root;
5210 if (root == P_INVALID) { /* Tree is empty. */
5211 DPUTS("tree is empty");
5212 return MDB_NOTFOUND;
5216 mdb_cassert(mc, root > 1);
5217 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
5218 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0], NULL)) != 0)
5224 DPRINTF(("db %d root page %"Z"u has flags 0x%X",
5225 DDBI(mc), root, mc->mc_pg[0]->mp_flags));
5227 if (flags & MDB_PS_MODIFY) {
5228 if ((rc = mdb_page_touch(mc)))
5232 if (flags & MDB_PS_ROOTONLY)
5235 return mdb_page_search_root(mc, key, flags);
5239 mdb_ovpage_free(MDB_cursor *mc, MDB_page *mp)
5241 MDB_txn *txn = mc->mc_txn;
5242 pgno_t pg = mp->mp_pgno;
5243 unsigned x = 0, ovpages = mp->mp_pages;
5244 MDB_env *env = txn->mt_env;
5245 MDB_IDL sl = txn->mt_spill_pgs;
5246 MDB_ID pn = pg << 1;
5249 DPRINTF(("free ov page %"Z"u (%d)", pg, ovpages));
5250 /* If the page is dirty or on the spill list we just acquired it,
5251 * so we should give it back to our current free list, if any.
5252 * Otherwise put it onto the list of pages we freed in this txn.
5254 * Won't create me_pghead: me_pglast must be inited along with it.
5255 * Unsupported in nested txns: They would need to hide the page
5256 * range in ancestor txns' dirty and spilled lists.
5258 if (env->me_pghead &&
5260 ((mp->mp_flags & P_DIRTY) ||
5261 (sl && (x = mdb_midl_search(sl, pn)) <= sl[0] && sl[x] == pn)))
5265 MDB_ID2 *dl, ix, iy;
5266 rc = mdb_midl_need(&env->me_pghead, ovpages);
5269 if (!(mp->mp_flags & P_DIRTY)) {
5270 /* This page is no longer spilled */
5277 /* Remove from dirty list */
5278 dl = txn->mt_u.dirty_list;
5280 for (ix = dl[x]; ix.mptr != mp; ix = iy) {
5286 mdb_cassert(mc, x > 1);
5288 dl[j] = ix; /* Unsorted. OK when MDB_TXN_ERROR. */
5289 txn->mt_flags |= MDB_TXN_ERROR;
5290 return MDB_CORRUPTED;
5293 if (!(env->me_flags & MDB_WRITEMAP))
5294 mdb_dpage_free(env, mp);
5296 /* Insert in me_pghead */
5297 mop = env->me_pghead;
5298 j = mop[0] + ovpages;
5299 for (i = mop[0]; i && mop[i] < pg; i--)
5305 rc = mdb_midl_append_range(&txn->mt_free_pgs, pg, ovpages);
5309 mc->mc_db->md_overflow_pages -= ovpages;
5313 /** Return the data associated with a given node.
5314 * @param[in] txn The transaction for this operation.
5315 * @param[in] leaf The node being read.
5316 * @param[out] data Updated to point to the node's data.
5317 * @return 0 on success, non-zero on failure.
5320 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
5322 MDB_page *omp; /* overflow page */
5326 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5327 data->mv_size = NODEDSZ(leaf);
5328 data->mv_data = NODEDATA(leaf);
5332 /* Read overflow data.
5334 data->mv_size = NODEDSZ(leaf);
5335 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
5336 if ((rc = mdb_page_get(txn, pgno, &omp, NULL)) != 0) {
5337 DPRINTF(("read overflow page %"Z"u failed", pgno));
5340 data->mv_data = METADATA(omp);
5346 mdb_get(MDB_txn *txn, MDB_dbi dbi,
5347 MDB_val *key, MDB_val *data)
5354 DPRINTF(("===> get db %u key [%s]", dbi, DKEY(key)));
5356 if (!key || !data || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
5359 if (txn->mt_flags & MDB_TXN_ERROR)
5362 mdb_cursor_init(&mc, txn, dbi, &mx);
5363 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
5366 /** Find a sibling for a page.
5367 * Replaces the page at the top of the cursor's stack with the
5368 * specified sibling, if one exists.
5369 * @param[in] mc The cursor for this operation.
5370 * @param[in] move_right Non-zero if the right sibling is requested,
5371 * otherwise the left sibling.
5372 * @return 0 on success, non-zero on failure.
5375 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
5381 if (mc->mc_snum < 2) {
5382 return MDB_NOTFOUND; /* root has no siblings */
5386 DPRINTF(("parent page is page %"Z"u, index %u",
5387 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]));
5389 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
5390 : (mc->mc_ki[mc->mc_top] == 0)) {
5391 DPRINTF(("no more keys left, moving to %s sibling",
5392 move_right ? "right" : "left"));
5393 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
5394 /* undo cursor_pop before returning */
5401 mc->mc_ki[mc->mc_top]++;
5403 mc->mc_ki[mc->mc_top]--;
5404 DPRINTF(("just moving to %s index key %u",
5405 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]));
5407 mdb_cassert(mc, IS_BRANCH(mc->mc_pg[mc->mc_top]));
5409 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5410 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp, NULL)) != 0) {
5411 /* mc will be inconsistent if caller does mc_snum++ as above */
5412 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
5416 mdb_cursor_push(mc, mp);
5418 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
5423 /** Move the cursor to the next data item. */
5425 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5431 if (mc->mc_flags & C_EOF) {
5432 return MDB_NOTFOUND;
5435 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5437 mp = mc->mc_pg[mc->mc_top];
5439 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5440 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5441 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5442 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
5443 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
5444 if (op != MDB_NEXT || rc != MDB_NOTFOUND) {
5445 if (rc == MDB_SUCCESS)
5446 MDB_GET_KEY(leaf, key);
5451 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5452 if (op == MDB_NEXT_DUP)
5453 return MDB_NOTFOUND;
5457 DPRINTF(("cursor_next: top page is %"Z"u in cursor %p",
5458 mdb_dbg_pgno(mp), (void *) mc));
5459 if (mc->mc_flags & C_DEL)
5462 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
5463 DPUTS("=====> move to next sibling page");
5464 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
5465 mc->mc_flags |= C_EOF;
5468 mp = mc->mc_pg[mc->mc_top];
5469 DPRINTF(("next page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5471 mc->mc_ki[mc->mc_top]++;
5474 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5475 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5478 key->mv_size = mc->mc_db->md_pad;
5479 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5483 mdb_cassert(mc, IS_LEAF(mp));
5484 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5486 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5487 mdb_xcursor_init1(mc, leaf);
5490 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5493 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5494 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5495 if (rc != MDB_SUCCESS)
5500 MDB_GET_KEY(leaf, key);
5504 /** Move the cursor to the previous data item. */
5506 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5512 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5514 mp = mc->mc_pg[mc->mc_top];
5516 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5517 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5518 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5519 if (op == MDB_PREV || op == MDB_PREV_DUP) {
5520 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
5521 if (op != MDB_PREV || rc != MDB_NOTFOUND) {
5522 if (rc == MDB_SUCCESS) {
5523 MDB_GET_KEY(leaf, key);
5524 mc->mc_flags &= ~C_EOF;
5530 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5531 if (op == MDB_PREV_DUP)
5532 return MDB_NOTFOUND;
5536 DPRINTF(("cursor_prev: top page is %"Z"u in cursor %p",
5537 mdb_dbg_pgno(mp), (void *) mc));
5539 if (mc->mc_ki[mc->mc_top] == 0) {
5540 DPUTS("=====> move to prev sibling page");
5541 if ((rc = mdb_cursor_sibling(mc, 0)) != MDB_SUCCESS) {
5544 mp = mc->mc_pg[mc->mc_top];
5545 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
5546 DPRINTF(("prev page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5548 mc->mc_ki[mc->mc_top]--;
5550 mc->mc_flags &= ~C_EOF;
5552 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5553 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5556 key->mv_size = mc->mc_db->md_pad;
5557 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5561 mdb_cassert(mc, IS_LEAF(mp));
5562 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5564 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5565 mdb_xcursor_init1(mc, leaf);
5568 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5571 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5572 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5573 if (rc != MDB_SUCCESS)
5578 MDB_GET_KEY(leaf, key);
5582 /** Set the cursor on a specific data item. */
5584 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5585 MDB_cursor_op op, int *exactp)
5589 MDB_node *leaf = NULL;
5592 if (key->mv_size == 0)
5593 return MDB_BAD_VALSIZE;
5596 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5598 /* See if we're already on the right page */
5599 if (mc->mc_flags & C_INITIALIZED) {
5602 mp = mc->mc_pg[mc->mc_top];
5604 mc->mc_ki[mc->mc_top] = 0;
5605 return MDB_NOTFOUND;
5607 if (mp->mp_flags & P_LEAF2) {
5608 nodekey.mv_size = mc->mc_db->md_pad;
5609 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
5611 leaf = NODEPTR(mp, 0);
5612 MDB_GET_KEY2(leaf, nodekey);
5614 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5616 /* Probably happens rarely, but first node on the page
5617 * was the one we wanted.
5619 mc->mc_ki[mc->mc_top] = 0;
5626 unsigned int nkeys = NUMKEYS(mp);
5628 if (mp->mp_flags & P_LEAF2) {
5629 nodekey.mv_data = LEAF2KEY(mp,
5630 nkeys-1, nodekey.mv_size);
5632 leaf = NODEPTR(mp, nkeys-1);
5633 MDB_GET_KEY2(leaf, nodekey);
5635 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5637 /* last node was the one we wanted */
5638 mc->mc_ki[mc->mc_top] = nkeys-1;
5644 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
5645 /* This is definitely the right page, skip search_page */
5646 if (mp->mp_flags & P_LEAF2) {
5647 nodekey.mv_data = LEAF2KEY(mp,
5648 mc->mc_ki[mc->mc_top], nodekey.mv_size);
5650 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5651 MDB_GET_KEY2(leaf, nodekey);
5653 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5655 /* current node was the one we wanted */
5665 /* If any parents have right-sibs, search.
5666 * Otherwise, there's nothing further.
5668 for (i=0; i<mc->mc_top; i++)
5670 NUMKEYS(mc->mc_pg[i])-1)
5672 if (i == mc->mc_top) {
5673 /* There are no other pages */
5674 mc->mc_ki[mc->mc_top] = nkeys;
5675 return MDB_NOTFOUND;
5679 /* There are no other pages */
5680 mc->mc_ki[mc->mc_top] = 0;
5681 if (op == MDB_SET_RANGE && !exactp) {
5685 return MDB_NOTFOUND;
5689 rc = mdb_page_search(mc, key, 0);
5690 if (rc != MDB_SUCCESS)
5693 mp = mc->mc_pg[mc->mc_top];
5694 mdb_cassert(mc, IS_LEAF(mp));
5697 leaf = mdb_node_search(mc, key, exactp);
5698 if (exactp != NULL && !*exactp) {
5699 /* MDB_SET specified and not an exact match. */
5700 return MDB_NOTFOUND;
5704 DPUTS("===> inexact leaf not found, goto sibling");
5705 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
5706 return rc; /* no entries matched */
5707 mp = mc->mc_pg[mc->mc_top];
5708 mdb_cassert(mc, IS_LEAF(mp));
5709 leaf = NODEPTR(mp, 0);
5713 mc->mc_flags |= C_INITIALIZED;
5714 mc->mc_flags &= ~C_EOF;
5717 if (op == MDB_SET_RANGE || op == MDB_SET_KEY) {
5718 key->mv_size = mc->mc_db->md_pad;
5719 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5724 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5725 mdb_xcursor_init1(mc, leaf);
5728 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5729 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
5730 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5733 if (op == MDB_GET_BOTH) {
5739 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
5740 if (rc != MDB_SUCCESS)
5743 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
5745 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
5747 rc = mc->mc_dbx->md_dcmp(data, &d2);
5749 if (op == MDB_GET_BOTH || rc > 0)
5750 return MDB_NOTFOUND;
5757 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5758 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5763 /* The key already matches in all other cases */
5764 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
5765 MDB_GET_KEY(leaf, key);
5766 DPRINTF(("==> cursor placed on key [%s]", DKEY(key)));
5771 /** Move the cursor to the first item in the database. */
5773 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5779 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5781 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5782 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
5783 if (rc != MDB_SUCCESS)
5786 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
5788 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
5789 mc->mc_flags |= C_INITIALIZED;
5790 mc->mc_flags &= ~C_EOF;
5792 mc->mc_ki[mc->mc_top] = 0;
5794 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5795 key->mv_size = mc->mc_db->md_pad;
5796 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
5801 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5802 mdb_xcursor_init1(mc, leaf);
5803 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5807 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5811 MDB_GET_KEY(leaf, key);
5815 /** Move the cursor to the last item in the database. */
5817 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5823 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5825 if (!(mc->mc_flags & C_EOF)) {
5827 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5828 rc = mdb_page_search(mc, NULL, MDB_PS_LAST);
5829 if (rc != MDB_SUCCESS)
5832 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
5835 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
5836 mc->mc_flags |= C_INITIALIZED|C_EOF;
5837 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5839 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5840 key->mv_size = mc->mc_db->md_pad;
5841 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
5846 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5847 mdb_xcursor_init1(mc, leaf);
5848 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5852 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5857 MDB_GET_KEY(leaf, key);
5862 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5867 int (*mfunc)(MDB_cursor *mc, MDB_val *key, MDB_val *data);
5872 if (mc->mc_txn->mt_flags & MDB_TXN_ERROR)
5876 case MDB_GET_CURRENT:
5877 if (!(mc->mc_flags & C_INITIALIZED)) {
5880 MDB_page *mp = mc->mc_pg[mc->mc_top];
5881 int nkeys = NUMKEYS(mp);
5882 if (!nkeys || mc->mc_ki[mc->mc_top] >= nkeys) {
5883 mc->mc_ki[mc->mc_top] = nkeys;
5889 key->mv_size = mc->mc_db->md_pad;
5890 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5892 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5893 MDB_GET_KEY(leaf, key);
5895 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5896 if (mc->mc_flags & C_DEL)
5897 mdb_xcursor_init1(mc, leaf);
5898 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
5900 rc = mdb_node_read(mc->mc_txn, leaf, data);
5907 case MDB_GET_BOTH_RANGE:
5912 if (mc->mc_xcursor == NULL) {
5913 rc = MDB_INCOMPATIBLE;
5923 rc = mdb_cursor_set(mc, key, data, op,
5924 op == MDB_SET_RANGE ? NULL : &exact);
5927 case MDB_GET_MULTIPLE:
5928 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5932 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5933 rc = MDB_INCOMPATIBLE;
5937 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
5938 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
5941 case MDB_NEXT_MULTIPLE:
5946 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5947 rc = MDB_INCOMPATIBLE;
5950 if (!(mc->mc_flags & C_INITIALIZED))
5951 rc = mdb_cursor_first(mc, key, data);
5953 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
5954 if (rc == MDB_SUCCESS) {
5955 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
5958 mx = &mc->mc_xcursor->mx_cursor;
5959 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
5961 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
5962 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
5970 case MDB_NEXT_NODUP:
5971 if (!(mc->mc_flags & C_INITIALIZED))
5972 rc = mdb_cursor_first(mc, key, data);
5974 rc = mdb_cursor_next(mc, key, data, op);
5978 case MDB_PREV_NODUP:
5979 if (!(mc->mc_flags & C_INITIALIZED)) {
5980 rc = mdb_cursor_last(mc, key, data);
5983 mc->mc_flags |= C_INITIALIZED;
5984 mc->mc_ki[mc->mc_top]++;
5986 rc = mdb_cursor_prev(mc, key, data, op);
5989 rc = mdb_cursor_first(mc, key, data);
5992 mfunc = mdb_cursor_first;
5994 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5998 if (mc->mc_xcursor == NULL) {
5999 rc = MDB_INCOMPATIBLE;
6003 MDB_node *leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6004 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6005 MDB_GET_KEY(leaf, key);
6006 rc = mdb_node_read(mc->mc_txn, leaf, data);
6010 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
6014 rc = mfunc(&mc->mc_xcursor->mx_cursor, data, NULL);
6017 rc = mdb_cursor_last(mc, key, data);
6020 mfunc = mdb_cursor_last;
6023 DPRINTF(("unhandled/unimplemented cursor operation %u", op));
6028 if (mc->mc_flags & C_DEL)
6029 mc->mc_flags ^= C_DEL;
6034 /** Touch all the pages in the cursor stack. Set mc_top.
6035 * Makes sure all the pages are writable, before attempting a write operation.
6036 * @param[in] mc The cursor to operate on.
6039 mdb_cursor_touch(MDB_cursor *mc)
6041 int rc = MDB_SUCCESS;
6043 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
6046 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
6048 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, &mcx);
6049 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
6052 *mc->mc_dbflag |= DB_DIRTY;
6057 rc = mdb_page_touch(mc);
6058 } while (!rc && ++(mc->mc_top) < mc->mc_snum);
6059 mc->mc_top = mc->mc_snum-1;
6064 /** Do not spill pages to disk if txn is getting full, may fail instead */
6065 #define MDB_NOSPILL 0x8000
6068 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
6071 enum { MDB_NO_ROOT = MDB_LAST_ERRCODE+10 }; /* internal code */
6073 MDB_node *leaf = NULL;
6076 MDB_val xdata, *rdata, dkey, olddata;
6078 int do_sub = 0, insert_key, insert_data;
6079 unsigned int mcount = 0, dcount = 0, nospill;
6082 unsigned int nflags;
6085 if (mc == NULL || key == NULL)
6088 env = mc->mc_txn->mt_env;
6090 /* Check this first so counter will always be zero on any
6093 if (flags & MDB_MULTIPLE) {
6094 dcount = data[1].mv_size;
6095 data[1].mv_size = 0;
6096 if (!F_ISSET(mc->mc_db->md_flags, MDB_DUPFIXED))
6097 return MDB_INCOMPATIBLE;
6100 nospill = flags & MDB_NOSPILL;
6101 flags &= ~MDB_NOSPILL;
6103 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
6104 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6106 if (key->mv_size-1 >= ENV_MAXKEY(env))
6107 return MDB_BAD_VALSIZE;
6109 #if SIZE_MAX > MAXDATASIZE
6110 if (data->mv_size > ((mc->mc_db->md_flags & MDB_DUPSORT) ? ENV_MAXKEY(env) : MAXDATASIZE))
6111 return MDB_BAD_VALSIZE;
6113 if ((mc->mc_db->md_flags & MDB_DUPSORT) && data->mv_size > ENV_MAXKEY(env))
6114 return MDB_BAD_VALSIZE;
6117 DPRINTF(("==> put db %d key [%s], size %"Z"u, data size %"Z"u",
6118 DDBI(mc), DKEY(key), key ? key->mv_size : 0, data->mv_size));
6122 if (flags == MDB_CURRENT) {
6123 if (!(mc->mc_flags & C_INITIALIZED))
6126 } else if (mc->mc_db->md_root == P_INVALID) {
6127 /* new database, cursor has nothing to point to */
6130 mc->mc_flags &= ~C_INITIALIZED;
6135 if (flags & MDB_APPEND) {
6137 rc = mdb_cursor_last(mc, &k2, &d2);
6139 rc = mc->mc_dbx->md_cmp(key, &k2);
6142 mc->mc_ki[mc->mc_top]++;
6144 /* new key is <= last key */
6149 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
6151 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
6152 DPRINTF(("duplicate key [%s]", DKEY(key)));
6154 return MDB_KEYEXIST;
6156 if (rc && rc != MDB_NOTFOUND)
6160 if (mc->mc_flags & C_DEL)
6161 mc->mc_flags ^= C_DEL;
6163 /* Cursor is positioned, check for room in the dirty list */
6165 if (flags & MDB_MULTIPLE) {
6167 xdata.mv_size = data->mv_size * dcount;
6171 if ((rc2 = mdb_page_spill(mc, key, rdata)))
6175 if (rc == MDB_NO_ROOT) {
6177 /* new database, write a root leaf page */
6178 DPUTS("allocating new root leaf page");
6179 if ((rc2 = mdb_page_new(mc, P_LEAF, 1, &np))) {
6182 mdb_cursor_push(mc, np);
6183 mc->mc_db->md_root = np->mp_pgno;
6184 mc->mc_db->md_depth++;
6185 *mc->mc_dbflag |= DB_DIRTY;
6186 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
6188 np->mp_flags |= P_LEAF2;
6189 mc->mc_flags |= C_INITIALIZED;
6191 /* make sure all cursor pages are writable */
6192 rc2 = mdb_cursor_touch(mc);
6197 insert_key = insert_data = rc;
6199 /* The key does not exist */
6200 DPRINTF(("inserting key at index %i", mc->mc_ki[mc->mc_top]));
6201 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
6202 LEAFSIZE(key, data) > env->me_nodemax)
6204 /* Too big for a node, insert in sub-DB. Set up an empty
6205 * "old sub-page" for prep_subDB to expand to a full page.
6207 fp_flags = P_LEAF|P_DIRTY;
6209 fp->mp_pad = data->mv_size; /* used if MDB_DUPFIXED */
6210 fp->mp_lower = fp->mp_upper = (PAGEHDRSZ-PAGEBASE);
6211 olddata.mv_size = PAGEHDRSZ;
6215 /* there's only a key anyway, so this is a no-op */
6216 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
6218 unsigned int ksize = mc->mc_db->md_pad;
6219 if (key->mv_size != ksize)
6220 return MDB_BAD_VALSIZE;
6221 ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
6222 memcpy(ptr, key->mv_data, ksize);
6224 /* if overwriting slot 0 of leaf, need to
6225 * update branch key if there is a parent page
6227 if (mc->mc_top && !mc->mc_ki[mc->mc_top]) {
6228 unsigned short top = mc->mc_top;
6230 /* slot 0 is always an empty key, find real slot */
6231 while (mc->mc_top && !mc->mc_ki[mc->mc_top])
6233 if (mc->mc_ki[mc->mc_top])
6234 rc2 = mdb_update_key(mc, key);
6245 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6246 olddata.mv_size = NODEDSZ(leaf);
6247 olddata.mv_data = NODEDATA(leaf);
6250 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
6251 /* Prepare (sub-)page/sub-DB to accept the new item,
6252 * if needed. fp: old sub-page or a header faking
6253 * it. mp: new (sub-)page. offset: growth in page
6254 * size. xdata: node data with new page or DB.
6256 unsigned i, offset = 0;
6257 mp = fp = xdata.mv_data = env->me_pbuf;
6258 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
6260 /* Was a single item before, must convert now */
6261 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6262 /* Just overwrite the current item */
6263 if (flags == MDB_CURRENT)
6266 #if UINT_MAX < SIZE_MAX
6267 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && olddata.mv_size == sizeof(size_t))
6268 mc->mc_dbx->md_dcmp = mdb_cmp_clong;
6270 /* does data match? */
6271 if (!mc->mc_dbx->md_dcmp(data, &olddata)) {
6272 if (flags & MDB_NODUPDATA)
6273 return MDB_KEYEXIST;
6278 /* Back up original data item */
6279 dkey.mv_size = olddata.mv_size;
6280 dkey.mv_data = memcpy(fp+1, olddata.mv_data, olddata.mv_size);
6282 /* Make sub-page header for the dup items, with dummy body */
6283 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
6284 fp->mp_lower = (PAGEHDRSZ-PAGEBASE);
6285 xdata.mv_size = PAGEHDRSZ + dkey.mv_size + data->mv_size;
6286 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6287 fp->mp_flags |= P_LEAF2;
6288 fp->mp_pad = data->mv_size;
6289 xdata.mv_size += 2 * data->mv_size; /* leave space for 2 more */
6291 xdata.mv_size += 2 * (sizeof(indx_t) + NODESIZE) +
6292 (dkey.mv_size & 1) + (data->mv_size & 1);
6294 fp->mp_upper = xdata.mv_size - PAGEBASE;
6295 olddata.mv_size = xdata.mv_size; /* pretend olddata is fp */
6296 } else if (leaf->mn_flags & F_SUBDATA) {
6297 /* Data is on sub-DB, just store it */
6298 flags |= F_DUPDATA|F_SUBDATA;
6301 /* Data is on sub-page */
6302 fp = olddata.mv_data;
6305 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
6306 offset = EVEN(NODESIZE + sizeof(indx_t) +
6310 offset = fp->mp_pad;
6311 if (SIZELEFT(fp) < offset) {
6312 offset *= 4; /* space for 4 more */
6315 /* FALLTHRU: Big enough MDB_DUPFIXED sub-page */
6317 fp->mp_flags |= P_DIRTY;
6318 COPY_PGNO(fp->mp_pgno, mp->mp_pgno);
6319 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
6323 xdata.mv_size = olddata.mv_size + offset;
6326 fp_flags = fp->mp_flags;
6327 if (NODESIZE + NODEKSZ(leaf) + xdata.mv_size > env->me_nodemax) {
6328 /* Too big for a sub-page, convert to sub-DB */
6329 fp_flags &= ~P_SUBP;
6331 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6332 fp_flags |= P_LEAF2;
6333 dummy.md_pad = fp->mp_pad;
6334 dummy.md_flags = MDB_DUPFIXED;
6335 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
6336 dummy.md_flags |= MDB_INTEGERKEY;
6342 dummy.md_branch_pages = 0;
6343 dummy.md_leaf_pages = 1;
6344 dummy.md_overflow_pages = 0;
6345 dummy.md_entries = NUMKEYS(fp);
6346 xdata.mv_size = sizeof(MDB_db);
6347 xdata.mv_data = &dummy;
6348 if ((rc = mdb_page_alloc(mc, 1, &mp)))
6350 offset = env->me_psize - olddata.mv_size;
6351 flags |= F_DUPDATA|F_SUBDATA;
6352 dummy.md_root = mp->mp_pgno;
6355 mp->mp_flags = fp_flags | P_DIRTY;
6356 mp->mp_pad = fp->mp_pad;
6357 mp->mp_lower = fp->mp_lower;
6358 mp->mp_upper = fp->mp_upper + offset;
6359 if (fp_flags & P_LEAF2) {
6360 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
6362 memcpy((char *)mp + mp->mp_upper + PAGEBASE, (char *)fp + fp->mp_upper + PAGEBASE,
6363 olddata.mv_size - fp->mp_upper - PAGEBASE);
6364 for (i=0; i<NUMKEYS(fp); i++)
6365 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
6373 mdb_node_del(mc, 0);
6377 /* overflow page overwrites need special handling */
6378 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6381 int level, ovpages, dpages = OVPAGES(data->mv_size, env->me_psize);
6383 memcpy(&pg, olddata.mv_data, sizeof(pg));
6384 if ((rc2 = mdb_page_get(mc->mc_txn, pg, &omp, &level)) != 0)
6386 ovpages = omp->mp_pages;
6388 /* Is the ov page large enough? */
6389 if (ovpages >= dpages) {
6390 if (!(omp->mp_flags & P_DIRTY) &&
6391 (level || (env->me_flags & MDB_WRITEMAP)))
6393 rc = mdb_page_unspill(mc->mc_txn, omp, &omp);
6396 level = 0; /* dirty in this txn or clean */
6399 if (omp->mp_flags & P_DIRTY) {
6400 /* yes, overwrite it. Note in this case we don't
6401 * bother to try shrinking the page if the new data
6402 * is smaller than the overflow threshold.
6405 /* It is writable only in a parent txn */
6406 size_t sz = (size_t) env->me_psize * ovpages, off;
6407 MDB_page *np = mdb_page_malloc(mc->mc_txn, ovpages);
6413 rc2 = mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &id2);
6414 mdb_cassert(mc, rc2 == 0);
6415 if (!(flags & MDB_RESERVE)) {
6416 /* Copy end of page, adjusting alignment so
6417 * compiler may copy words instead of bytes.
6419 off = (PAGEHDRSZ + data->mv_size) & -sizeof(size_t);
6420 memcpy((size_t *)((char *)np + off),
6421 (size_t *)((char *)omp + off), sz - off);
6424 memcpy(np, omp, sz); /* Copy beginning of page */
6427 SETDSZ(leaf, data->mv_size);
6428 if (F_ISSET(flags, MDB_RESERVE))
6429 data->mv_data = METADATA(omp);
6431 memcpy(METADATA(omp), data->mv_data, data->mv_size);
6435 if ((rc2 = mdb_ovpage_free(mc, omp)) != MDB_SUCCESS)
6437 } else if (data->mv_size == olddata.mv_size) {
6438 /* same size, just replace it. Note that we could
6439 * also reuse this node if the new data is smaller,
6440 * but instead we opt to shrink the node in that case.
6442 if (F_ISSET(flags, MDB_RESERVE))
6443 data->mv_data = olddata.mv_data;
6444 else if (!(mc->mc_flags & C_SUB))
6445 memcpy(olddata.mv_data, data->mv_data, data->mv_size);
6447 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
6452 mdb_node_del(mc, 0);
6458 nflags = flags & NODE_ADD_FLAGS;
6459 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(env, key, rdata);
6460 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
6461 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
6462 nflags &= ~MDB_APPEND; /* sub-page may need room to grow */
6464 nflags |= MDB_SPLIT_REPLACE;
6465 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
6467 /* There is room already in this leaf page. */
6468 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
6469 if (rc == 0 && insert_key) {
6470 /* Adjust other cursors pointing to mp */
6471 MDB_cursor *m2, *m3;
6472 MDB_dbi dbi = mc->mc_dbi;
6473 unsigned i = mc->mc_top;
6474 MDB_page *mp = mc->mc_pg[i];
6476 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6477 if (mc->mc_flags & C_SUB)
6478 m3 = &m2->mc_xcursor->mx_cursor;
6481 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
6482 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
6489 if (rc == MDB_SUCCESS) {
6490 /* Now store the actual data in the child DB. Note that we're
6491 * storing the user data in the keys field, so there are strict
6492 * size limits on dupdata. The actual data fields of the child
6493 * DB are all zero size.
6501 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6502 if (flags & MDB_CURRENT) {
6503 xflags = MDB_CURRENT|MDB_NOSPILL;
6505 mdb_xcursor_init1(mc, leaf);
6506 xflags = (flags & MDB_NODUPDATA) ?
6507 MDB_NOOVERWRITE|MDB_NOSPILL : MDB_NOSPILL;
6509 /* converted, write the original data first */
6511 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
6515 /* Adjust other cursors pointing to mp */
6517 unsigned i = mc->mc_top;
6518 MDB_page *mp = mc->mc_pg[i];
6520 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6521 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6522 if (!(m2->mc_flags & C_INITIALIZED)) continue;
6523 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
6524 mdb_xcursor_init1(m2, leaf);
6528 /* we've done our job */
6531 ecount = mc->mc_xcursor->mx_db.md_entries;
6532 if (flags & MDB_APPENDDUP)
6533 xflags |= MDB_APPEND;
6534 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
6535 if (flags & F_SUBDATA) {
6536 void *db = NODEDATA(leaf);
6537 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6539 insert_data = mc->mc_xcursor->mx_db.md_entries - ecount;
6541 /* Increment count unless we just replaced an existing item. */
6543 mc->mc_db->md_entries++;
6545 /* Invalidate txn if we created an empty sub-DB */
6548 /* If we succeeded and the key didn't exist before,
6549 * make sure the cursor is marked valid.
6551 mc->mc_flags |= C_INITIALIZED;
6553 if (flags & MDB_MULTIPLE) {
6556 /* let caller know how many succeeded, if any */
6557 data[1].mv_size = mcount;
6558 if (mcount < dcount) {
6559 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
6560 insert_key = insert_data = 0;
6567 if (rc == MDB_KEYEXIST) /* should not happen, we deleted that item */
6570 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6575 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
6581 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
6582 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6584 if (!(mc->mc_flags & C_INITIALIZED))
6587 if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6588 return MDB_NOTFOUND;
6590 if (!(flags & MDB_NOSPILL) && (rc = mdb_page_spill(mc, NULL, NULL)))
6593 rc = mdb_cursor_touch(mc);
6597 mp = mc->mc_pg[mc->mc_top];
6600 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6602 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6603 if (flags & MDB_NODUPDATA) {
6604 /* mdb_cursor_del0() will subtract the final entry */
6605 mc->mc_db->md_entries -= mc->mc_xcursor->mx_db.md_entries - 1;
6607 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
6608 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6610 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, MDB_NOSPILL);
6613 /* If sub-DB still has entries, we're done */
6614 if (mc->mc_xcursor->mx_db.md_entries) {
6615 if (leaf->mn_flags & F_SUBDATA) {
6616 /* update subDB info */
6617 void *db = NODEDATA(leaf);
6618 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6621 /* shrink fake page */
6622 mdb_node_shrink(mp, mc->mc_ki[mc->mc_top]);
6623 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6624 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6625 /* fix other sub-DB cursors pointed at this fake page */
6626 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6627 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6628 if (m2->mc_pg[mc->mc_top] == mp &&
6629 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
6630 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6633 mc->mc_db->md_entries--;
6634 mc->mc_flags |= C_DEL;
6637 /* otherwise fall thru and delete the sub-DB */
6640 if (leaf->mn_flags & F_SUBDATA) {
6641 /* add all the child DB's pages to the free list */
6642 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6648 /* add overflow pages to free list */
6649 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6653 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6654 if ((rc = mdb_page_get(mc->mc_txn, pg, &omp, NULL)) ||
6655 (rc = mdb_ovpage_free(mc, omp)))
6660 return mdb_cursor_del0(mc);
6663 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6667 /** Allocate and initialize new pages for a database.
6668 * @param[in] mc a cursor on the database being added to.
6669 * @param[in] flags flags defining what type of page is being allocated.
6670 * @param[in] num the number of pages to allocate. This is usually 1,
6671 * unless allocating overflow pages for a large record.
6672 * @param[out] mp Address of a page, or NULL on failure.
6673 * @return 0 on success, non-zero on failure.
6676 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
6681 if ((rc = mdb_page_alloc(mc, num, &np)))
6683 DPRINTF(("allocated new mpage %"Z"u, page size %u",
6684 np->mp_pgno, mc->mc_txn->mt_env->me_psize));
6685 np->mp_flags = flags | P_DIRTY;
6686 np->mp_lower = (PAGEHDRSZ-PAGEBASE);
6687 np->mp_upper = mc->mc_txn->mt_env->me_psize - PAGEBASE;
6690 mc->mc_db->md_branch_pages++;
6691 else if (IS_LEAF(np))
6692 mc->mc_db->md_leaf_pages++;
6693 else if (IS_OVERFLOW(np)) {
6694 mc->mc_db->md_overflow_pages += num;
6702 /** Calculate the size of a leaf node.
6703 * The size depends on the environment's page size; if a data item
6704 * is too large it will be put onto an overflow page and the node
6705 * size will only include the key and not the data. Sizes are always
6706 * rounded up to an even number of bytes, to guarantee 2-byte alignment
6707 * of the #MDB_node headers.
6708 * @param[in] env The environment handle.
6709 * @param[in] key The key for the node.
6710 * @param[in] data The data for the node.
6711 * @return The number of bytes needed to store the node.
6714 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
6718 sz = LEAFSIZE(key, data);
6719 if (sz > env->me_nodemax) {
6720 /* put on overflow page */
6721 sz -= data->mv_size - sizeof(pgno_t);
6724 return EVEN(sz + sizeof(indx_t));
6727 /** Calculate the size of a branch node.
6728 * The size should depend on the environment's page size but since
6729 * we currently don't support spilling large keys onto overflow
6730 * pages, it's simply the size of the #MDB_node header plus the
6731 * size of the key. Sizes are always rounded up to an even number
6732 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
6733 * @param[in] env The environment handle.
6734 * @param[in] key The key for the node.
6735 * @return The number of bytes needed to store the node.
6738 mdb_branch_size(MDB_env *env, MDB_val *key)
6743 if (sz > env->me_nodemax) {
6744 /* put on overflow page */
6745 /* not implemented */
6746 /* sz -= key->size - sizeof(pgno_t); */
6749 return sz + sizeof(indx_t);
6752 /** Add a node to the page pointed to by the cursor.
6753 * @param[in] mc The cursor for this operation.
6754 * @param[in] indx The index on the page where the new node should be added.
6755 * @param[in] key The key for the new node.
6756 * @param[in] data The data for the new node, if any.
6757 * @param[in] pgno The page number, if adding a branch node.
6758 * @param[in] flags Flags for the node.
6759 * @return 0 on success, non-zero on failure. Possible errors are:
6761 * <li>ENOMEM - failed to allocate overflow pages for the node.
6762 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
6763 * should never happen since all callers already calculate the
6764 * page's free space before calling this function.
6768 mdb_node_add(MDB_cursor *mc, indx_t indx,
6769 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
6772 size_t node_size = NODESIZE;
6776 MDB_page *mp = mc->mc_pg[mc->mc_top];
6777 MDB_page *ofp = NULL; /* overflow page */
6780 mdb_cassert(mc, mp->mp_upper >= mp->mp_lower);
6782 DPRINTF(("add to %s %spage %"Z"u index %i, data size %"Z"u key size %"Z"u [%s]",
6783 IS_LEAF(mp) ? "leaf" : "branch",
6784 IS_SUBP(mp) ? "sub-" : "",
6785 mdb_dbg_pgno(mp), indx, data ? data->mv_size : 0,
6786 key ? key->mv_size : 0, key ? DKEY(key) : "null"));
6789 /* Move higher keys up one slot. */
6790 int ksize = mc->mc_db->md_pad, dif;
6791 char *ptr = LEAF2KEY(mp, indx, ksize);
6792 dif = NUMKEYS(mp) - indx;
6794 memmove(ptr+ksize, ptr, dif*ksize);
6795 /* insert new key */
6796 memcpy(ptr, key->mv_data, ksize);
6798 /* Just using these for counting */
6799 mp->mp_lower += sizeof(indx_t);
6800 mp->mp_upper -= ksize - sizeof(indx_t);
6804 room = (ssize_t)SIZELEFT(mp) - (ssize_t)sizeof(indx_t);
6806 node_size += key->mv_size;
6808 mdb_cassert(mc, data);
6809 if (F_ISSET(flags, F_BIGDATA)) {
6810 /* Data already on overflow page. */
6811 node_size += sizeof(pgno_t);
6812 } else if (node_size + data->mv_size > mc->mc_txn->mt_env->me_nodemax) {
6813 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
6815 /* Put data on overflow page. */
6816 DPRINTF(("data size is %"Z"u, node would be %"Z"u, put data on overflow page",
6817 data->mv_size, node_size+data->mv_size));
6818 node_size = EVEN(node_size + sizeof(pgno_t));
6819 if ((ssize_t)node_size > room)
6821 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
6823 DPRINTF(("allocated overflow page %"Z"u", ofp->mp_pgno));
6827 node_size += data->mv_size;
6830 node_size = EVEN(node_size);
6831 if ((ssize_t)node_size > room)
6835 /* Move higher pointers up one slot. */
6836 for (i = NUMKEYS(mp); i > indx; i--)
6837 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
6839 /* Adjust free space offsets. */
6840 ofs = mp->mp_upper - node_size;
6841 mdb_cassert(mc, ofs >= mp->mp_lower + sizeof(indx_t));
6842 mp->mp_ptrs[indx] = ofs;
6844 mp->mp_lower += sizeof(indx_t);
6846 /* Write the node data. */
6847 node = NODEPTR(mp, indx);
6848 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
6849 node->mn_flags = flags;
6851 SETDSZ(node,data->mv_size);
6856 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
6859 mdb_cassert(mc, key);
6861 if (F_ISSET(flags, F_BIGDATA))
6862 memcpy(node->mn_data + key->mv_size, data->mv_data,
6864 else if (F_ISSET(flags, MDB_RESERVE))
6865 data->mv_data = node->mn_data + key->mv_size;
6867 memcpy(node->mn_data + key->mv_size, data->mv_data,
6870 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
6872 if (F_ISSET(flags, MDB_RESERVE))
6873 data->mv_data = METADATA(ofp);
6875 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
6882 DPRINTF(("not enough room in page %"Z"u, got %u ptrs",
6883 mdb_dbg_pgno(mp), NUMKEYS(mp)));
6884 DPRINTF(("upper-lower = %u - %u = %"Z"d", mp->mp_upper,mp->mp_lower,room));
6885 DPRINTF(("node size = %"Z"u", node_size));
6886 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6887 return MDB_PAGE_FULL;
6890 /** Delete the specified node from a page.
6891 * @param[in] mc Cursor pointing to the node to delete.
6892 * @param[in] ksize The size of a node. Only used if the page is
6893 * part of a #MDB_DUPFIXED database.
6896 mdb_node_del(MDB_cursor *mc, int ksize)
6898 MDB_page *mp = mc->mc_pg[mc->mc_top];
6899 indx_t indx = mc->mc_ki[mc->mc_top];
6901 indx_t i, j, numkeys, ptr;
6905 DPRINTF(("delete node %u on %s page %"Z"u", indx,
6906 IS_LEAF(mp) ? "leaf" : "branch", mdb_dbg_pgno(mp)));
6907 numkeys = NUMKEYS(mp);
6908 mdb_cassert(mc, indx < numkeys);
6911 int x = numkeys - 1 - indx;
6912 base = LEAF2KEY(mp, indx, ksize);
6914 memmove(base, base + ksize, x * ksize);
6915 mp->mp_lower -= sizeof(indx_t);
6916 mp->mp_upper += ksize - sizeof(indx_t);
6920 node = NODEPTR(mp, indx);
6921 sz = NODESIZE + node->mn_ksize;
6923 if (F_ISSET(node->mn_flags, F_BIGDATA))
6924 sz += sizeof(pgno_t);
6926 sz += NODEDSZ(node);
6930 ptr = mp->mp_ptrs[indx];
6931 for (i = j = 0; i < numkeys; i++) {
6933 mp->mp_ptrs[j] = mp->mp_ptrs[i];
6934 if (mp->mp_ptrs[i] < ptr)
6935 mp->mp_ptrs[j] += sz;
6940 base = (char *)mp + mp->mp_upper + PAGEBASE;
6941 memmove(base + sz, base, ptr - mp->mp_upper);
6943 mp->mp_lower -= sizeof(indx_t);
6947 /** Compact the main page after deleting a node on a subpage.
6948 * @param[in] mp The main page to operate on.
6949 * @param[in] indx The index of the subpage on the main page.
6952 mdb_node_shrink(MDB_page *mp, indx_t indx)
6958 indx_t i, numkeys, ptr;
6960 node = NODEPTR(mp, indx);
6961 sp = (MDB_page *)NODEDATA(node);
6962 delta = SIZELEFT(sp);
6963 xp = (MDB_page *)((char *)sp + delta);
6965 /* shift subpage upward */
6967 nsize = NUMKEYS(sp) * sp->mp_pad;
6969 return; /* do not make the node uneven-sized */
6970 memmove(METADATA(xp), METADATA(sp), nsize);
6973 numkeys = NUMKEYS(sp);
6974 for (i=numkeys-1; i>=0; i--)
6975 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
6977 xp->mp_upper = sp->mp_lower;
6978 xp->mp_lower = sp->mp_lower;
6979 xp->mp_flags = sp->mp_flags;
6980 xp->mp_pad = sp->mp_pad;
6981 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
6983 nsize = NODEDSZ(node) - delta;
6984 SETDSZ(node, nsize);
6986 /* shift lower nodes upward */
6987 ptr = mp->mp_ptrs[indx];
6988 numkeys = NUMKEYS(mp);
6989 for (i = 0; i < numkeys; i++) {
6990 if (mp->mp_ptrs[i] <= ptr)
6991 mp->mp_ptrs[i] += delta;
6994 base = (char *)mp + mp->mp_upper + PAGEBASE;
6995 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
6996 mp->mp_upper += delta;
6999 /** Initial setup of a sorted-dups cursor.
7000 * Sorted duplicates are implemented as a sub-database for the given key.
7001 * The duplicate data items are actually keys of the sub-database.
7002 * Operations on the duplicate data items are performed using a sub-cursor
7003 * initialized when the sub-database is first accessed. This function does
7004 * the preliminary setup of the sub-cursor, filling in the fields that
7005 * depend only on the parent DB.
7006 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
7009 mdb_xcursor_init0(MDB_cursor *mc)
7011 MDB_xcursor *mx = mc->mc_xcursor;
7013 mx->mx_cursor.mc_xcursor = NULL;
7014 mx->mx_cursor.mc_txn = mc->mc_txn;
7015 mx->mx_cursor.mc_db = &mx->mx_db;
7016 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
7017 mx->mx_cursor.mc_dbi = mc->mc_dbi;
7018 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
7019 mx->mx_cursor.mc_snum = 0;
7020 mx->mx_cursor.mc_top = 0;
7021 mx->mx_cursor.mc_flags = C_SUB;
7022 mx->mx_dbx.md_name.mv_size = 0;
7023 mx->mx_dbx.md_name.mv_data = NULL;
7024 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
7025 mx->mx_dbx.md_dcmp = NULL;
7026 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
7029 /** Final setup of a sorted-dups cursor.
7030 * Sets up the fields that depend on the data from the main cursor.
7031 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
7032 * @param[in] node The data containing the #MDB_db record for the
7033 * sorted-dup database.
7036 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
7038 MDB_xcursor *mx = mc->mc_xcursor;
7040 if (node->mn_flags & F_SUBDATA) {
7041 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
7042 mx->mx_cursor.mc_pg[0] = 0;
7043 mx->mx_cursor.mc_snum = 0;
7044 mx->mx_cursor.mc_top = 0;
7045 mx->mx_cursor.mc_flags = C_SUB;
7047 MDB_page *fp = NODEDATA(node);
7048 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
7049 mx->mx_db.md_flags = 0;
7050 mx->mx_db.md_depth = 1;
7051 mx->mx_db.md_branch_pages = 0;
7052 mx->mx_db.md_leaf_pages = 1;
7053 mx->mx_db.md_overflow_pages = 0;
7054 mx->mx_db.md_entries = NUMKEYS(fp);
7055 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
7056 mx->mx_cursor.mc_snum = 1;
7057 mx->mx_cursor.mc_top = 0;
7058 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
7059 mx->mx_cursor.mc_pg[0] = fp;
7060 mx->mx_cursor.mc_ki[0] = 0;
7061 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
7062 mx->mx_db.md_flags = MDB_DUPFIXED;
7063 mx->mx_db.md_pad = fp->mp_pad;
7064 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
7065 mx->mx_db.md_flags |= MDB_INTEGERKEY;
7068 DPRINTF(("Sub-db -%u root page %"Z"u", mx->mx_cursor.mc_dbi,
7069 mx->mx_db.md_root));
7070 mx->mx_dbflag = DB_VALID|DB_DIRTY; /* DB_DIRTY guides mdb_cursor_touch */
7071 #if UINT_MAX < SIZE_MAX
7072 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
7073 mx->mx_dbx.md_cmp = mdb_cmp_clong;
7077 /** Initialize a cursor for a given transaction and database. */
7079 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
7082 mc->mc_backup = NULL;
7085 mc->mc_db = &txn->mt_dbs[dbi];
7086 mc->mc_dbx = &txn->mt_dbxs[dbi];
7087 mc->mc_dbflag = &txn->mt_dbflags[dbi];
7092 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
7093 mdb_tassert(txn, mx != NULL);
7094 mc->mc_xcursor = mx;
7095 mdb_xcursor_init0(mc);
7097 mc->mc_xcursor = NULL;
7099 if (*mc->mc_dbflag & DB_STALE) {
7100 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
7105 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
7108 size_t size = sizeof(MDB_cursor);
7110 if (!ret || !TXN_DBI_EXIST(txn, dbi))
7113 if (txn->mt_flags & MDB_TXN_ERROR)
7116 /* Allow read access to the freelist */
7117 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
7120 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
7121 size += sizeof(MDB_xcursor);
7123 if ((mc = malloc(size)) != NULL) {
7124 mdb_cursor_init(mc, txn, dbi, (MDB_xcursor *)(mc + 1));
7125 if (txn->mt_cursors) {
7126 mc->mc_next = txn->mt_cursors[dbi];
7127 txn->mt_cursors[dbi] = mc;
7128 mc->mc_flags |= C_UNTRACK;
7140 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
7142 if (!mc || !TXN_DBI_EXIST(txn, mc->mc_dbi))
7145 if ((mc->mc_flags & C_UNTRACK) || txn->mt_cursors)
7148 if (txn->mt_flags & MDB_TXN_ERROR)
7151 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
7155 /* Return the count of duplicate data items for the current key */
7157 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
7161 if (mc == NULL || countp == NULL)
7164 if (mc->mc_xcursor == NULL)
7165 return MDB_INCOMPATIBLE;
7167 if (mc->mc_txn->mt_flags & MDB_TXN_ERROR)
7170 if (!(mc->mc_flags & C_INITIALIZED))
7173 if (!mc->mc_snum || (mc->mc_flags & C_EOF))
7174 return MDB_NOTFOUND;
7176 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
7177 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
7180 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
7183 *countp = mc->mc_xcursor->mx_db.md_entries;
7189 mdb_cursor_close(MDB_cursor *mc)
7191 if (mc && !mc->mc_backup) {
7192 /* remove from txn, if tracked */
7193 if ((mc->mc_flags & C_UNTRACK) && mc->mc_txn->mt_cursors) {
7194 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
7195 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
7197 *prev = mc->mc_next;
7204 mdb_cursor_txn(MDB_cursor *mc)
7206 if (!mc) return NULL;
7211 mdb_cursor_dbi(MDB_cursor *mc)
7216 /** Replace the key for a branch node with a new key.
7217 * @param[in] mc Cursor pointing to the node to operate on.
7218 * @param[in] key The new key to use.
7219 * @return 0 on success, non-zero on failure.
7222 mdb_update_key(MDB_cursor *mc, MDB_val *key)
7228 int delta, ksize, oksize;
7229 indx_t ptr, i, numkeys, indx;
7232 indx = mc->mc_ki[mc->mc_top];
7233 mp = mc->mc_pg[mc->mc_top];
7234 node = NODEPTR(mp, indx);
7235 ptr = mp->mp_ptrs[indx];
7239 char kbuf2[DKBUF_MAXKEYSIZE*2+1];
7240 k2.mv_data = NODEKEY(node);
7241 k2.mv_size = node->mn_ksize;
7242 DPRINTF(("update key %u (ofs %u) [%s] to [%s] on page %"Z"u",
7244 mdb_dkey(&k2, kbuf2),
7250 /* Sizes must be 2-byte aligned. */
7251 ksize = EVEN(key->mv_size);
7252 oksize = EVEN(node->mn_ksize);
7253 delta = ksize - oksize;
7255 /* Shift node contents if EVEN(key length) changed. */
7257 if (delta > 0 && SIZELEFT(mp) < delta) {
7259 /* not enough space left, do a delete and split */
7260 DPRINTF(("Not enough room, delta = %d, splitting...", delta));
7261 pgno = NODEPGNO(node);
7262 mdb_node_del(mc, 0);
7263 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
7266 numkeys = NUMKEYS(mp);
7267 for (i = 0; i < numkeys; i++) {
7268 if (mp->mp_ptrs[i] <= ptr)
7269 mp->mp_ptrs[i] -= delta;
7272 base = (char *)mp + mp->mp_upper + PAGEBASE;
7273 len = ptr - mp->mp_upper + NODESIZE;
7274 memmove(base - delta, base, len);
7275 mp->mp_upper -= delta;
7277 node = NODEPTR(mp, indx);
7280 /* But even if no shift was needed, update ksize */
7281 if (node->mn_ksize != key->mv_size)
7282 node->mn_ksize = key->mv_size;
7285 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
7291 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
7293 /** Move a node from csrc to cdst.
7296 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
7303 unsigned short flags;
7307 /* Mark src and dst as dirty. */
7308 if ((rc = mdb_page_touch(csrc)) ||
7309 (rc = mdb_page_touch(cdst)))
7312 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7313 key.mv_size = csrc->mc_db->md_pad;
7314 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
7316 data.mv_data = NULL;
7320 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
7321 mdb_cassert(csrc, !((size_t)srcnode & 1));
7322 srcpg = NODEPGNO(srcnode);
7323 flags = srcnode->mn_flags;
7324 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7325 unsigned int snum = csrc->mc_snum;
7327 /* must find the lowest key below src */
7328 rc = mdb_page_search_lowest(csrc);
7331 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7332 key.mv_size = csrc->mc_db->md_pad;
7333 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7335 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7336 key.mv_size = NODEKSZ(s2);
7337 key.mv_data = NODEKEY(s2);
7339 csrc->mc_snum = snum--;
7340 csrc->mc_top = snum;
7342 key.mv_size = NODEKSZ(srcnode);
7343 key.mv_data = NODEKEY(srcnode);
7345 data.mv_size = NODEDSZ(srcnode);
7346 data.mv_data = NODEDATA(srcnode);
7348 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
7349 unsigned int snum = cdst->mc_snum;
7352 /* must find the lowest key below dst */
7353 mdb_cursor_copy(cdst, &mn);
7354 rc = mdb_page_search_lowest(&mn);
7357 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7358 bkey.mv_size = mn.mc_db->md_pad;
7359 bkey.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, bkey.mv_size);
7361 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7362 bkey.mv_size = NODEKSZ(s2);
7363 bkey.mv_data = NODEKEY(s2);
7365 mn.mc_snum = snum--;
7368 rc = mdb_update_key(&mn, &bkey);
7373 DPRINTF(("moving %s node %u [%s] on page %"Z"u to node %u on page %"Z"u",
7374 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
7375 csrc->mc_ki[csrc->mc_top],
7377 csrc->mc_pg[csrc->mc_top]->mp_pgno,
7378 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno));
7380 /* Add the node to the destination page.
7382 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
7383 if (rc != MDB_SUCCESS)
7386 /* Delete the node from the source page.
7388 mdb_node_del(csrc, key.mv_size);
7391 /* Adjust other cursors pointing to mp */
7392 MDB_cursor *m2, *m3;
7393 MDB_dbi dbi = csrc->mc_dbi;
7394 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
7396 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7397 if (csrc->mc_flags & C_SUB)
7398 m3 = &m2->mc_xcursor->mx_cursor;
7401 if (m3 == csrc) continue;
7402 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
7403 csrc->mc_ki[csrc->mc_top]) {
7404 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
7405 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
7410 /* Update the parent separators.
7412 if (csrc->mc_ki[csrc->mc_top] == 0) {
7413 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
7414 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7415 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7417 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7418 key.mv_size = NODEKSZ(srcnode);
7419 key.mv_data = NODEKEY(srcnode);
7421 DPRINTF(("update separator for source page %"Z"u to [%s]",
7422 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key)));
7423 mdb_cursor_copy(csrc, &mn);
7426 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
7429 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7431 indx_t ix = csrc->mc_ki[csrc->mc_top];
7432 nullkey.mv_size = 0;
7433 csrc->mc_ki[csrc->mc_top] = 0;
7434 rc = mdb_update_key(csrc, &nullkey);
7435 csrc->mc_ki[csrc->mc_top] = ix;
7436 mdb_cassert(csrc, rc == MDB_SUCCESS);
7440 if (cdst->mc_ki[cdst->mc_top] == 0) {
7441 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
7442 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7443 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
7445 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
7446 key.mv_size = NODEKSZ(srcnode);
7447 key.mv_data = NODEKEY(srcnode);
7449 DPRINTF(("update separator for destination page %"Z"u to [%s]",
7450 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key)));
7451 mdb_cursor_copy(cdst, &mn);
7454 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
7457 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
7459 indx_t ix = cdst->mc_ki[cdst->mc_top];
7460 nullkey.mv_size = 0;
7461 cdst->mc_ki[cdst->mc_top] = 0;
7462 rc = mdb_update_key(cdst, &nullkey);
7463 cdst->mc_ki[cdst->mc_top] = ix;
7464 mdb_cassert(cdst, rc == MDB_SUCCESS);
7471 /** Merge one page into another.
7472 * The nodes from the page pointed to by \b csrc will
7473 * be copied to the page pointed to by \b cdst and then
7474 * the \b csrc page will be freed.
7475 * @param[in] csrc Cursor pointing to the source page.
7476 * @param[in] cdst Cursor pointing to the destination page.
7477 * @return 0 on success, non-zero on failure.
7480 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
7482 MDB_page *psrc, *pdst;
7489 psrc = csrc->mc_pg[csrc->mc_top];
7490 pdst = cdst->mc_pg[cdst->mc_top];
7492 DPRINTF(("merging page %"Z"u into %"Z"u", psrc->mp_pgno, pdst->mp_pgno));
7494 mdb_cassert(csrc, csrc->mc_snum > 1); /* can't merge root page */
7495 mdb_cassert(csrc, cdst->mc_snum > 1);
7497 /* Mark dst as dirty. */
7498 if ((rc = mdb_page_touch(cdst)))
7501 /* Move all nodes from src to dst.
7503 j = nkeys = NUMKEYS(pdst);
7504 if (IS_LEAF2(psrc)) {
7505 key.mv_size = csrc->mc_db->md_pad;
7506 key.mv_data = METADATA(psrc);
7507 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7508 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
7509 if (rc != MDB_SUCCESS)
7511 key.mv_data = (char *)key.mv_data + key.mv_size;
7514 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7515 srcnode = NODEPTR(psrc, i);
7516 if (i == 0 && IS_BRANCH(psrc)) {
7519 mdb_cursor_copy(csrc, &mn);
7520 /* must find the lowest key below src */
7521 rc = mdb_page_search_lowest(&mn);
7524 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7525 key.mv_size = mn.mc_db->md_pad;
7526 key.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, key.mv_size);
7528 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7529 key.mv_size = NODEKSZ(s2);
7530 key.mv_data = NODEKEY(s2);
7533 key.mv_size = srcnode->mn_ksize;
7534 key.mv_data = NODEKEY(srcnode);
7537 data.mv_size = NODEDSZ(srcnode);
7538 data.mv_data = NODEDATA(srcnode);
7539 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
7540 if (rc != MDB_SUCCESS)
7545 DPRINTF(("dst page %"Z"u now has %u keys (%.1f%% filled)",
7546 pdst->mp_pgno, NUMKEYS(pdst),
7547 (float)PAGEFILL(cdst->mc_txn->mt_env, pdst) / 10));
7549 /* Unlink the src page from parent and add to free list.
7552 mdb_node_del(csrc, 0);
7553 if (csrc->mc_ki[csrc->mc_top] == 0) {
7555 rc = mdb_update_key(csrc, &key);
7563 psrc = csrc->mc_pg[csrc->mc_top];
7564 /* If not operating on FreeDB, allow this page to be reused
7565 * in this txn. Otherwise just add to free list.
7567 rc = mdb_page_loose(csrc, psrc);
7571 csrc->mc_db->md_leaf_pages--;
7573 csrc->mc_db->md_branch_pages--;
7575 /* Adjust other cursors pointing to mp */
7576 MDB_cursor *m2, *m3;
7577 MDB_dbi dbi = csrc->mc_dbi;
7579 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7580 if (csrc->mc_flags & C_SUB)
7581 m3 = &m2->mc_xcursor->mx_cursor;
7584 if (m3 == csrc) continue;
7585 if (m3->mc_snum < csrc->mc_snum) continue;
7586 if (m3->mc_pg[csrc->mc_top] == psrc) {
7587 m3->mc_pg[csrc->mc_top] = pdst;
7588 m3->mc_ki[csrc->mc_top] += nkeys;
7593 unsigned int snum = cdst->mc_snum;
7594 uint16_t depth = cdst->mc_db->md_depth;
7595 mdb_cursor_pop(cdst);
7596 rc = mdb_rebalance(cdst);
7597 /* Did the tree shrink? */
7598 if (depth > cdst->mc_db->md_depth)
7600 cdst->mc_snum = snum;
7601 cdst->mc_top = snum-1;
7606 /** Copy the contents of a cursor.
7607 * @param[in] csrc The cursor to copy from.
7608 * @param[out] cdst The cursor to copy to.
7611 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
7615 cdst->mc_txn = csrc->mc_txn;
7616 cdst->mc_dbi = csrc->mc_dbi;
7617 cdst->mc_db = csrc->mc_db;
7618 cdst->mc_dbx = csrc->mc_dbx;
7619 cdst->mc_snum = csrc->mc_snum;
7620 cdst->mc_top = csrc->mc_top;
7621 cdst->mc_flags = csrc->mc_flags;
7623 for (i=0; i<csrc->mc_snum; i++) {
7624 cdst->mc_pg[i] = csrc->mc_pg[i];
7625 cdst->mc_ki[i] = csrc->mc_ki[i];
7629 /** Rebalance the tree after a delete operation.
7630 * @param[in] mc Cursor pointing to the page where rebalancing
7632 * @return 0 on success, non-zero on failure.
7635 mdb_rebalance(MDB_cursor *mc)
7639 unsigned int ptop, minkeys;
7643 minkeys = 1 + (IS_BRANCH(mc->mc_pg[mc->mc_top]));
7644 DPRINTF(("rebalancing %s page %"Z"u (has %u keys, %.1f%% full)",
7645 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
7646 mdb_dbg_pgno(mc->mc_pg[mc->mc_top]), NUMKEYS(mc->mc_pg[mc->mc_top]),
7647 (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10));
7649 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD &&
7650 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
7651 DPRINTF(("no need to rebalance page %"Z"u, above fill threshold",
7652 mdb_dbg_pgno(mc->mc_pg[mc->mc_top])));
7656 if (mc->mc_snum < 2) {
7657 MDB_page *mp = mc->mc_pg[0];
7659 DPUTS("Can't rebalance a subpage, ignoring");
7662 if (NUMKEYS(mp) == 0) {
7663 DPUTS("tree is completely empty");
7664 mc->mc_db->md_root = P_INVALID;
7665 mc->mc_db->md_depth = 0;
7666 mc->mc_db->md_leaf_pages = 0;
7667 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7670 /* Adjust cursors pointing to mp */
7673 mc->mc_flags &= ~C_INITIALIZED;
7675 MDB_cursor *m2, *m3;
7676 MDB_dbi dbi = mc->mc_dbi;
7678 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7679 if (mc->mc_flags & C_SUB)
7680 m3 = &m2->mc_xcursor->mx_cursor;
7683 if (m3->mc_snum < mc->mc_snum) continue;
7684 if (m3->mc_pg[0] == mp) {
7687 m3->mc_flags &= ~C_INITIALIZED;
7691 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
7693 DPUTS("collapsing root page!");
7694 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7697 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
7698 rc = mdb_page_get(mc->mc_txn,mc->mc_db->md_root,&mc->mc_pg[0],NULL);
7701 mc->mc_db->md_depth--;
7702 mc->mc_db->md_branch_pages--;
7703 mc->mc_ki[0] = mc->mc_ki[1];
7704 for (i = 1; i<mc->mc_db->md_depth; i++) {
7705 mc->mc_pg[i] = mc->mc_pg[i+1];
7706 mc->mc_ki[i] = mc->mc_ki[i+1];
7709 /* Adjust other cursors pointing to mp */
7710 MDB_cursor *m2, *m3;
7711 MDB_dbi dbi = mc->mc_dbi;
7713 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7714 if (mc->mc_flags & C_SUB)
7715 m3 = &m2->mc_xcursor->mx_cursor;
7718 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
7719 if (m3->mc_pg[0] == mp) {
7722 for (i=0; i<m3->mc_snum; i++) {
7723 m3->mc_pg[i] = m3->mc_pg[i+1];
7724 m3->mc_ki[i] = m3->mc_ki[i+1];
7730 DPUTS("root page doesn't need rebalancing");
7734 /* The parent (branch page) must have at least 2 pointers,
7735 * otherwise the tree is invalid.
7737 ptop = mc->mc_top-1;
7738 mdb_cassert(mc, NUMKEYS(mc->mc_pg[ptop]) > 1);
7740 /* Leaf page fill factor is below the threshold.
7741 * Try to move keys from left or right neighbor, or
7742 * merge with a neighbor page.
7747 mdb_cursor_copy(mc, &mn);
7748 mn.mc_xcursor = NULL;
7750 oldki = mc->mc_ki[mc->mc_top];
7751 if (mc->mc_ki[ptop] == 0) {
7752 /* We're the leftmost leaf in our parent.
7754 DPUTS("reading right neighbor");
7756 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7757 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7760 mn.mc_ki[mn.mc_top] = 0;
7761 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
7763 /* There is at least one neighbor to the left.
7765 DPUTS("reading left neighbor");
7767 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7768 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7771 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
7772 mc->mc_ki[mc->mc_top] = 0;
7775 DPRINTF(("found neighbor page %"Z"u (%u keys, %.1f%% full)",
7776 mn.mc_pg[mn.mc_top]->mp_pgno, NUMKEYS(mn.mc_pg[mn.mc_top]),
7777 (float)PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) / 10));
7779 /* If the neighbor page is above threshold and has enough keys,
7780 * move one key from it. Otherwise we should try to merge them.
7781 * (A branch page must never have less than 2 keys.)
7783 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
7784 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys) {
7785 rc = mdb_node_move(&mn, mc);
7786 if (mc->mc_ki[ptop]) {
7790 if (mc->mc_ki[ptop] == 0) {
7791 rc = mdb_page_merge(&mn, mc);
7793 oldki += NUMKEYS(mn.mc_pg[mn.mc_top]);
7794 mn.mc_ki[mn.mc_top] += mc->mc_ki[mn.mc_top] + 1;
7795 rc = mdb_page_merge(mc, &mn);
7796 mdb_cursor_copy(&mn, mc);
7798 mc->mc_flags &= ~C_EOF;
7800 mc->mc_ki[mc->mc_top] = oldki;
7804 /** Complete a delete operation started by #mdb_cursor_del(). */
7806 mdb_cursor_del0(MDB_cursor *mc)
7813 ki = mc->mc_ki[mc->mc_top];
7814 mdb_node_del(mc, mc->mc_db->md_pad);
7815 mc->mc_db->md_entries--;
7816 rc = mdb_rebalance(mc);
7818 if (rc == MDB_SUCCESS) {
7819 MDB_cursor *m2, *m3;
7820 MDB_dbi dbi = mc->mc_dbi;
7822 mp = mc->mc_pg[mc->mc_top];
7823 nkeys = NUMKEYS(mp);
7825 /* if mc points past last node in page, find next sibling */
7826 if (mc->mc_ki[mc->mc_top] >= nkeys) {
7827 rc = mdb_cursor_sibling(mc, 1);
7828 if (rc == MDB_NOTFOUND) {
7829 mc->mc_flags |= C_EOF;
7834 /* Adjust other cursors pointing to mp */
7835 for (m2 = mc->mc_txn->mt_cursors[dbi]; !rc && m2; m2=m2->mc_next) {
7836 m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
7837 if (! (m2->mc_flags & m3->mc_flags & C_INITIALIZED))
7839 if (m3 == mc || m3->mc_snum < mc->mc_snum)
7841 if (m3->mc_pg[mc->mc_top] == mp) {
7842 if (m3->mc_ki[mc->mc_top] >= ki) {
7843 m3->mc_flags |= C_DEL;
7844 if (m3->mc_ki[mc->mc_top] > ki)
7845 m3->mc_ki[mc->mc_top]--;
7846 else if (mc->mc_db->md_flags & MDB_DUPSORT)
7847 m3->mc_xcursor->mx_cursor.mc_flags |= C_EOF;
7849 if (m3->mc_ki[mc->mc_top] >= nkeys) {
7850 rc = mdb_cursor_sibling(m3, 1);
7851 if (rc == MDB_NOTFOUND) {
7852 m3->mc_flags |= C_EOF;
7858 mc->mc_flags |= C_DEL;
7862 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
7867 mdb_del(MDB_txn *txn, MDB_dbi dbi,
7868 MDB_val *key, MDB_val *data)
7870 if (!key || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
7873 if (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
7874 return (txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
7876 if (!F_ISSET(txn->mt_dbs[dbi].md_flags, MDB_DUPSORT)) {
7877 /* must ignore any data */
7881 return mdb_del0(txn, dbi, key, data, 0);
7885 mdb_del0(MDB_txn *txn, MDB_dbi dbi,
7886 MDB_val *key, MDB_val *data, unsigned flags)
7891 MDB_val rdata, *xdata;
7895 DPRINTF(("====> delete db %u key [%s]", dbi, DKEY(key)));
7897 mdb_cursor_init(&mc, txn, dbi, &mx);
7906 flags |= MDB_NODUPDATA;
7908 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
7910 /* let mdb_page_split know about this cursor if needed:
7911 * delete will trigger a rebalance; if it needs to move
7912 * a node from one page to another, it will have to
7913 * update the parent's separator key(s). If the new sepkey
7914 * is larger than the current one, the parent page may
7915 * run out of space, triggering a split. We need this
7916 * cursor to be consistent until the end of the rebalance.
7918 mc.mc_flags |= C_UNTRACK;
7919 mc.mc_next = txn->mt_cursors[dbi];
7920 txn->mt_cursors[dbi] = &mc;
7921 rc = mdb_cursor_del(&mc, flags);
7922 txn->mt_cursors[dbi] = mc.mc_next;
7927 /** Split a page and insert a new node.
7928 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
7929 * The cursor will be updated to point to the actual page and index where
7930 * the node got inserted after the split.
7931 * @param[in] newkey The key for the newly inserted node.
7932 * @param[in] newdata The data for the newly inserted node.
7933 * @param[in] newpgno The page number, if the new node is a branch node.
7934 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
7935 * @return 0 on success, non-zero on failure.
7938 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
7939 unsigned int nflags)
7942 int rc = MDB_SUCCESS, new_root = 0, did_split = 0;
7945 int i, j, split_indx, nkeys, pmax;
7946 MDB_env *env = mc->mc_txn->mt_env;
7948 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
7949 MDB_page *copy = NULL;
7950 MDB_page *mp, *rp, *pp;
7955 mp = mc->mc_pg[mc->mc_top];
7956 newindx = mc->mc_ki[mc->mc_top];
7957 nkeys = NUMKEYS(mp);
7959 DPRINTF(("-----> splitting %s page %"Z"u and adding [%s] at index %i/%i",
7960 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
7961 DKEY(newkey), mc->mc_ki[mc->mc_top], nkeys));
7963 /* Create a right sibling. */
7964 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
7966 DPRINTF(("new right sibling: page %"Z"u", rp->mp_pgno));
7968 if (mc->mc_snum < 2) {
7969 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
7971 /* shift current top to make room for new parent */
7972 mc->mc_pg[1] = mc->mc_pg[0];
7973 mc->mc_ki[1] = mc->mc_ki[0];
7976 mc->mc_db->md_root = pp->mp_pgno;
7977 DPRINTF(("root split! new root = %"Z"u", pp->mp_pgno));
7978 mc->mc_db->md_depth++;
7981 /* Add left (implicit) pointer. */
7982 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
7983 /* undo the pre-push */
7984 mc->mc_pg[0] = mc->mc_pg[1];
7985 mc->mc_ki[0] = mc->mc_ki[1];
7986 mc->mc_db->md_root = mp->mp_pgno;
7987 mc->mc_db->md_depth--;
7994 ptop = mc->mc_top-1;
7995 DPRINTF(("parent branch page is %"Z"u", mc->mc_pg[ptop]->mp_pgno));
7998 mc->mc_flags |= C_SPLITTING;
7999 mdb_cursor_copy(mc, &mn);
8000 mn.mc_pg[mn.mc_top] = rp;
8001 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
8003 if (nflags & MDB_APPEND) {
8004 mn.mc_ki[mn.mc_top] = 0;
8006 split_indx = newindx;
8010 split_indx = (nkeys+1) / 2;
8015 unsigned int lsize, rsize, ksize;
8016 /* Move half of the keys to the right sibling */
8017 x = mc->mc_ki[mc->mc_top] - split_indx;
8018 ksize = mc->mc_db->md_pad;
8019 split = LEAF2KEY(mp, split_indx, ksize);
8020 rsize = (nkeys - split_indx) * ksize;
8021 lsize = (nkeys - split_indx) * sizeof(indx_t);
8022 mp->mp_lower -= lsize;
8023 rp->mp_lower += lsize;
8024 mp->mp_upper += rsize - lsize;
8025 rp->mp_upper -= rsize - lsize;
8026 sepkey.mv_size = ksize;
8027 if (newindx == split_indx) {
8028 sepkey.mv_data = newkey->mv_data;
8030 sepkey.mv_data = split;
8033 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
8034 memcpy(rp->mp_ptrs, split, rsize);
8035 sepkey.mv_data = rp->mp_ptrs;
8036 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
8037 memcpy(ins, newkey->mv_data, ksize);
8038 mp->mp_lower += sizeof(indx_t);
8039 mp->mp_upper -= ksize - sizeof(indx_t);
8042 memcpy(rp->mp_ptrs, split, x * ksize);
8043 ins = LEAF2KEY(rp, x, ksize);
8044 memcpy(ins, newkey->mv_data, ksize);
8045 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
8046 rp->mp_lower += sizeof(indx_t);
8047 rp->mp_upper -= ksize - sizeof(indx_t);
8048 mc->mc_ki[mc->mc_top] = x;
8049 mc->mc_pg[mc->mc_top] = rp;
8052 int psize, nsize, k;
8053 /* Maximum free space in an empty page */
8054 pmax = env->me_psize - PAGEHDRSZ;
8056 nsize = mdb_leaf_size(env, newkey, newdata);
8058 nsize = mdb_branch_size(env, newkey);
8059 nsize = EVEN(nsize);
8061 /* grab a page to hold a temporary copy */
8062 copy = mdb_page_malloc(mc->mc_txn, 1);
8067 copy->mp_pgno = mp->mp_pgno;
8068 copy->mp_flags = mp->mp_flags;
8069 copy->mp_lower = (PAGEHDRSZ-PAGEBASE);
8070 copy->mp_upper = env->me_psize - PAGEBASE;
8072 /* prepare to insert */
8073 for (i=0, j=0; i<nkeys; i++) {
8075 copy->mp_ptrs[j++] = 0;
8077 copy->mp_ptrs[j++] = mp->mp_ptrs[i];
8080 /* When items are relatively large the split point needs
8081 * to be checked, because being off-by-one will make the
8082 * difference between success or failure in mdb_node_add.
8084 * It's also relevant if a page happens to be laid out
8085 * such that one half of its nodes are all "small" and
8086 * the other half of its nodes are "large." If the new
8087 * item is also "large" and falls on the half with
8088 * "large" nodes, it also may not fit.
8090 * As a final tweak, if the new item goes on the last
8091 * spot on the page (and thus, onto the new page), bias
8092 * the split so the new page is emptier than the old page.
8093 * This yields better packing during sequential inserts.
8095 if (nkeys < 20 || nsize > pmax/16 || newindx >= nkeys) {
8096 /* Find split point */
8098 if (newindx <= split_indx || newindx >= nkeys) {
8100 k = newindx >= nkeys ? nkeys : split_indx+2;
8105 for (; i!=k; i+=j) {
8110 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
8111 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
8113 if (F_ISSET(node->mn_flags, F_BIGDATA))
8114 psize += sizeof(pgno_t);
8116 psize += NODEDSZ(node);
8118 psize = EVEN(psize);
8120 if (psize > pmax || i == k-j) {
8121 split_indx = i + (j<0);
8126 if (split_indx == newindx) {
8127 sepkey.mv_size = newkey->mv_size;
8128 sepkey.mv_data = newkey->mv_data;
8130 node = (MDB_node *)((char *)mp + copy->mp_ptrs[split_indx] + PAGEBASE);
8131 sepkey.mv_size = node->mn_ksize;
8132 sepkey.mv_data = NODEKEY(node);
8137 DPRINTF(("separator is %d [%s]", split_indx, DKEY(&sepkey)));
8139 /* Copy separator key to the parent.
8141 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(env, &sepkey)) {
8145 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
8150 if (mn.mc_snum == mc->mc_snum) {
8151 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
8152 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
8153 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
8154 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
8159 /* Right page might now have changed parent.
8160 * Check if left page also changed parent.
8162 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8163 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8164 for (i=0; i<ptop; i++) {
8165 mc->mc_pg[i] = mn.mc_pg[i];
8166 mc->mc_ki[i] = mn.mc_ki[i];
8168 mc->mc_pg[ptop] = mn.mc_pg[ptop];
8169 if (mn.mc_ki[ptop]) {
8170 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
8172 /* find right page's left sibling */
8173 mc->mc_ki[ptop] = mn.mc_ki[ptop];
8174 mdb_cursor_sibling(mc, 0);
8179 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
8182 mc->mc_flags ^= C_SPLITTING;
8183 if (rc != MDB_SUCCESS) {
8186 if (nflags & MDB_APPEND) {
8187 mc->mc_pg[mc->mc_top] = rp;
8188 mc->mc_ki[mc->mc_top] = 0;
8189 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
8192 for (i=0; i<mc->mc_top; i++)
8193 mc->mc_ki[i] = mn.mc_ki[i];
8194 } else if (!IS_LEAF2(mp)) {
8196 mc->mc_pg[mc->mc_top] = rp;
8201 rkey.mv_data = newkey->mv_data;
8202 rkey.mv_size = newkey->mv_size;
8208 /* Update index for the new key. */
8209 mc->mc_ki[mc->mc_top] = j;
8211 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
8212 rkey.mv_data = NODEKEY(node);
8213 rkey.mv_size = node->mn_ksize;
8215 xdata.mv_data = NODEDATA(node);
8216 xdata.mv_size = NODEDSZ(node);
8219 pgno = NODEPGNO(node);
8220 flags = node->mn_flags;
8223 if (!IS_LEAF(mp) && j == 0) {
8224 /* First branch index doesn't need key data. */
8228 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
8234 mc->mc_pg[mc->mc_top] = copy;
8239 } while (i != split_indx);
8241 nkeys = NUMKEYS(copy);
8242 for (i=0; i<nkeys; i++)
8243 mp->mp_ptrs[i] = copy->mp_ptrs[i];
8244 mp->mp_lower = copy->mp_lower;
8245 mp->mp_upper = copy->mp_upper;
8246 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
8247 env->me_psize - copy->mp_upper - PAGEBASE);
8249 /* reset back to original page */
8250 if (newindx < split_indx) {
8251 mc->mc_pg[mc->mc_top] = mp;
8252 if (nflags & MDB_RESERVE) {
8253 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
8254 if (!(node->mn_flags & F_BIGDATA))
8255 newdata->mv_data = NODEDATA(node);
8258 mc->mc_pg[mc->mc_top] = rp;
8260 /* Make sure mc_ki is still valid.
8262 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8263 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8264 for (i=0; i<=ptop; i++) {
8265 mc->mc_pg[i] = mn.mc_pg[i];
8266 mc->mc_ki[i] = mn.mc_ki[i];
8273 /* Adjust other cursors pointing to mp */
8274 MDB_cursor *m2, *m3;
8275 MDB_dbi dbi = mc->mc_dbi;
8276 int fixup = NUMKEYS(mp);
8278 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8279 if (mc->mc_flags & C_SUB)
8280 m3 = &m2->mc_xcursor->mx_cursor;
8285 if (!(m2->mc_flags & m3->mc_flags & C_INITIALIZED))
8287 if (m3->mc_flags & C_SPLITTING)
8292 for (k=m3->mc_top; k>=0; k--) {
8293 m3->mc_ki[k+1] = m3->mc_ki[k];
8294 m3->mc_pg[k+1] = m3->mc_pg[k];
8296 if (m3->mc_ki[0] >= split_indx) {
8301 m3->mc_pg[0] = mc->mc_pg[0];
8305 if (m3->mc_top >= mc->mc_top && m3->mc_pg[mc->mc_top] == mp) {
8306 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
8307 m3->mc_ki[mc->mc_top]++;
8308 if (m3->mc_ki[mc->mc_top] >= fixup) {
8309 m3->mc_pg[mc->mc_top] = rp;
8310 m3->mc_ki[mc->mc_top] -= fixup;
8311 m3->mc_ki[ptop] = mn.mc_ki[ptop];
8313 } else if (!did_split && m3->mc_top >= ptop && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
8314 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
8319 DPRINTF(("mp left: %d, rp left: %d", SIZELEFT(mp), SIZELEFT(rp)));
8322 if (copy) /* tmp page */
8323 mdb_page_free(env, copy);
8325 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
8330 mdb_put(MDB_txn *txn, MDB_dbi dbi,
8331 MDB_val *key, MDB_val *data, unsigned int flags)
8336 if (!key || !data || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
8339 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP)) != flags)
8342 mdb_cursor_init(&mc, txn, dbi, &mx);
8343 return mdb_cursor_put(&mc, key, data, flags);
8347 #define MDB_WBUF (1024*1024)
8350 /** State needed for a compacting copy. */
8351 typedef struct mdb_copy {
8352 pthread_mutex_t mc_mutex;
8353 pthread_cond_t mc_cond;
8360 pgno_t mc_next_pgno;
8363 volatile int mc_new;
8368 /** Dedicated writer thread for compacting copy. */
8369 static THREAD_RET ESECT
8370 mdb_env_copythr(void *arg)
8374 int toggle = 0, wsize, rc;
8377 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
8380 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
8383 pthread_mutex_lock(&my->mc_mutex);
8385 pthread_cond_signal(&my->mc_cond);
8388 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8389 if (my->mc_new < 0) {
8394 wsize = my->mc_wlen[toggle];
8395 ptr = my->mc_wbuf[toggle];
8398 DO_WRITE(rc, my->mc_fd, ptr, wsize, len);
8402 } else if (len > 0) {
8416 /* If there's an overflow page tail, write it too */
8417 if (my->mc_olen[toggle]) {
8418 wsize = my->mc_olen[toggle];
8419 ptr = my->mc_over[toggle];
8420 my->mc_olen[toggle] = 0;
8423 my->mc_wlen[toggle] = 0;
8425 pthread_cond_signal(&my->mc_cond);
8427 pthread_cond_signal(&my->mc_cond);
8428 pthread_mutex_unlock(&my->mc_mutex);
8429 return (THREAD_RET)0;
8433 /** Tell the writer thread there's a buffer ready to write */
8435 mdb_env_cthr_toggle(mdb_copy *my, int st)
8437 int toggle = my->mc_toggle ^ 1;
8438 pthread_mutex_lock(&my->mc_mutex);
8439 if (my->mc_status) {
8440 pthread_mutex_unlock(&my->mc_mutex);
8441 return my->mc_status;
8443 while (my->mc_new == 1)
8444 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8446 my->mc_toggle = toggle;
8447 pthread_cond_signal(&my->mc_cond);
8448 pthread_mutex_unlock(&my->mc_mutex);
8452 /** Depth-first tree traversal for compacting copy. */
8454 mdb_env_cwalk(mdb_copy *my, pgno_t *pg, int flags)
8457 MDB_txn *txn = my->mc_txn;
8459 MDB_page *mo, *mp, *leaf;
8464 /* Empty DB, nothing to do */
8465 if (*pg == P_INVALID)
8472 rc = mdb_page_get(my->mc_txn, *pg, &mc.mc_pg[0], NULL);
8475 rc = mdb_page_search_root(&mc, NULL, MDB_PS_FIRST);
8479 /* Make cursor pages writable */
8480 buf = ptr = malloc(my->mc_env->me_psize * mc.mc_snum);
8484 for (i=0; i<mc.mc_top; i++) {
8485 mdb_page_copy((MDB_page *)ptr, mc.mc_pg[i], my->mc_env->me_psize);
8486 mc.mc_pg[i] = (MDB_page *)ptr;
8487 ptr += my->mc_env->me_psize;
8490 /* This is writable space for a leaf page. Usually not needed. */
8491 leaf = (MDB_page *)ptr;
8493 toggle = my->mc_toggle;
8494 while (mc.mc_snum > 0) {
8496 mp = mc.mc_pg[mc.mc_top];
8500 if (!IS_LEAF2(mp) && !(flags & F_DUPDATA)) {
8501 for (i=0; i<n; i++) {
8502 ni = NODEPTR(mp, i);
8503 if (ni->mn_flags & F_BIGDATA) {
8507 /* Need writable leaf */
8509 mc.mc_pg[mc.mc_top] = leaf;
8510 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8512 ni = NODEPTR(mp, i);
8515 memcpy(&pg, NODEDATA(ni), sizeof(pg));
8516 rc = mdb_page_get(txn, pg, &omp, NULL);
8519 if (my->mc_wlen[toggle] >= MDB_WBUF) {
8520 rc = mdb_env_cthr_toggle(my, 1);
8523 toggle = my->mc_toggle;
8525 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
8526 memcpy(mo, omp, my->mc_env->me_psize);
8527 mo->mp_pgno = my->mc_next_pgno;
8528 my->mc_next_pgno += omp->mp_pages;
8529 my->mc_wlen[toggle] += my->mc_env->me_psize;
8530 if (omp->mp_pages > 1) {
8531 my->mc_olen[toggle] = my->mc_env->me_psize * (omp->mp_pages - 1);
8532 my->mc_over[toggle] = (char *)omp + my->mc_env->me_psize;
8533 rc = mdb_env_cthr_toggle(my, 1);
8536 toggle = my->mc_toggle;
8538 memcpy(NODEDATA(ni), &mo->mp_pgno, sizeof(pgno_t));
8539 } else if (ni->mn_flags & F_SUBDATA) {
8542 /* Need writable leaf */
8544 mc.mc_pg[mc.mc_top] = leaf;
8545 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8547 ni = NODEPTR(mp, i);
8550 memcpy(&db, NODEDATA(ni), sizeof(db));
8551 my->mc_toggle = toggle;
8552 rc = mdb_env_cwalk(my, &db.md_root, ni->mn_flags & F_DUPDATA);
8555 toggle = my->mc_toggle;
8556 memcpy(NODEDATA(ni), &db, sizeof(db));
8561 mc.mc_ki[mc.mc_top]++;
8562 if (mc.mc_ki[mc.mc_top] < n) {
8565 ni = NODEPTR(mp, mc.mc_ki[mc.mc_top]);
8567 rc = mdb_page_get(txn, pg, &mp, NULL);
8572 mc.mc_ki[mc.mc_top] = 0;
8573 if (IS_BRANCH(mp)) {
8574 /* Whenever we advance to a sibling branch page,
8575 * we must proceed all the way down to its first leaf.
8577 mdb_page_copy(mc.mc_pg[mc.mc_top], mp, my->mc_env->me_psize);
8580 mc.mc_pg[mc.mc_top] = mp;
8584 if (my->mc_wlen[toggle] >= MDB_WBUF) {
8585 rc = mdb_env_cthr_toggle(my, 1);
8588 toggle = my->mc_toggle;
8590 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
8591 mdb_page_copy(mo, mp, my->mc_env->me_psize);
8592 mo->mp_pgno = my->mc_next_pgno++;
8593 my->mc_wlen[toggle] += my->mc_env->me_psize;
8595 /* Update parent if there is one */
8596 ni = NODEPTR(mc.mc_pg[mc.mc_top-1], mc.mc_ki[mc.mc_top-1]);
8597 SETPGNO(ni, mo->mp_pgno);
8598 mdb_cursor_pop(&mc);
8600 /* Otherwise we're done */
8610 /** Copy environment with compaction. */
8612 mdb_env_copyfd1(MDB_env *env, HANDLE fd)
8617 MDB_txn *txn = NULL;
8622 my.mc_mutex = CreateMutex(NULL, FALSE, NULL);
8623 my.mc_cond = CreateEvent(NULL, FALSE, FALSE, NULL);
8624 my.mc_wbuf[0] = _aligned_malloc(MDB_WBUF*2, env->me_os_psize);
8625 if (my.mc_wbuf[0] == NULL)
8628 pthread_mutex_init(&my.mc_mutex, NULL);
8629 pthread_cond_init(&my.mc_cond, NULL);
8630 #ifdef HAVE_MEMALIGN
8631 my.mc_wbuf[0] = memalign(env->me_os_psize, MDB_WBUF*2);
8632 if (my.mc_wbuf[0] == NULL)
8635 rc = posix_memalign((void **)&my.mc_wbuf[0], env->me_os_psize, MDB_WBUF*2);
8640 memset(my.mc_wbuf[0], 0, MDB_WBUF*2);
8641 my.mc_wbuf[1] = my.mc_wbuf[0] + MDB_WBUF;
8646 my.mc_next_pgno = 2;
8652 THREAD_CREATE(thr, mdb_env_copythr, &my);
8654 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
8658 mp = (MDB_page *)my.mc_wbuf[0];
8659 memset(mp, 0, 2*env->me_psize);
8661 mp->mp_flags = P_META;
8662 mm = (MDB_meta *)METADATA(mp);
8663 mdb_env_init_meta0(env, mm);
8664 mm->mm_address = env->me_metas[0]->mm_address;
8666 mp = (MDB_page *)(my.mc_wbuf[0] + env->me_psize);
8668 mp->mp_flags = P_META;
8669 *(MDB_meta *)METADATA(mp) = *mm;
8670 mm = (MDB_meta *)METADATA(mp);
8672 /* Count the number of free pages, subtract from lastpg to find
8673 * number of active pages
8676 MDB_ID freecount = 0;
8679 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
8680 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
8681 freecount += *(MDB_ID *)data.mv_data;
8682 freecount += txn->mt_dbs[0].md_branch_pages +
8683 txn->mt_dbs[0].md_leaf_pages +
8684 txn->mt_dbs[0].md_overflow_pages;
8686 /* Set metapage 1 */
8687 mm->mm_last_pg = txn->mt_next_pgno - freecount - 1;
8688 mm->mm_dbs[1] = txn->mt_dbs[1];
8689 if (mm->mm_last_pg > 1) {
8690 mm->mm_dbs[1].md_root = mm->mm_last_pg;
8693 mm->mm_dbs[1].md_root = P_INVALID;
8696 my.mc_wlen[0] = env->me_psize * 2;
8698 pthread_mutex_lock(&my.mc_mutex);
8700 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
8701 pthread_mutex_unlock(&my.mc_mutex);
8702 rc = mdb_env_cwalk(&my, &txn->mt_dbs[1].md_root, 0);
8703 if (rc == MDB_SUCCESS && my.mc_wlen[my.mc_toggle])
8704 rc = mdb_env_cthr_toggle(&my, 1);
8705 mdb_env_cthr_toggle(&my, -1);
8706 pthread_mutex_lock(&my.mc_mutex);
8708 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
8709 pthread_mutex_unlock(&my.mc_mutex);
8714 CloseHandle(my.mc_cond);
8715 CloseHandle(my.mc_mutex);
8716 _aligned_free(my.mc_wbuf[0]);
8718 pthread_cond_destroy(&my.mc_cond);
8719 pthread_mutex_destroy(&my.mc_mutex);
8720 free(my.mc_wbuf[0]);
8725 /** Copy environment as-is. */
8727 mdb_env_copyfd0(MDB_env *env, HANDLE fd)
8729 MDB_txn *txn = NULL;
8735 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
8739 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
8742 /* Do the lock/unlock of the reader mutex before starting the
8743 * write txn. Otherwise other read txns could block writers.
8745 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
8750 /* We must start the actual read txn after blocking writers */
8751 mdb_txn_reset0(txn, "reset-stage1");
8753 /* Temporarily block writers until we snapshot the meta pages */
8756 rc = mdb_txn_renew0(txn);
8758 UNLOCK_MUTEX_W(env);
8763 wsize = env->me_psize * 2;
8767 DO_WRITE(rc, fd, ptr, w2, len);
8771 } else if (len > 0) {
8777 /* Non-blocking or async handles are not supported */
8783 UNLOCK_MUTEX_W(env);
8788 w2 = txn->mt_next_pgno * env->me_psize;
8791 if ((rc = mdb_fsize(env->me_fd, &fsize)))
8798 if (wsize > MAX_WRITE)
8802 DO_WRITE(rc, fd, ptr, w2, len);
8806 } else if (len > 0) {
8823 mdb_env_copyfd2(MDB_env *env, HANDLE fd, unsigned int flags)
8825 if (flags & MDB_CP_COMPACT)
8826 return mdb_env_copyfd1(env, fd);
8828 return mdb_env_copyfd0(env, fd);
8832 mdb_env_copyfd(MDB_env *env, HANDLE fd)
8834 return mdb_env_copyfd2(env, fd, 0);
8838 mdb_env_copy2(MDB_env *env, const char *path, unsigned int flags)
8842 HANDLE newfd = INVALID_HANDLE_VALUE;
8844 if (env->me_flags & MDB_NOSUBDIR) {
8845 lpath = (char *)path;
8848 len += sizeof(DATANAME);
8849 lpath = malloc(len);
8852 sprintf(lpath, "%s" DATANAME, path);
8855 /* The destination path must exist, but the destination file must not.
8856 * We don't want the OS to cache the writes, since the source data is
8857 * already in the OS cache.
8860 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
8861 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
8863 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL, 0666);
8865 if (newfd == INVALID_HANDLE_VALUE) {
8870 if (env->me_psize >= env->me_os_psize) {
8872 /* Set O_DIRECT if the file system supports it */
8873 if ((rc = fcntl(newfd, F_GETFL)) != -1)
8874 (void) fcntl(newfd, F_SETFL, rc | O_DIRECT);
8876 #ifdef F_NOCACHE /* __APPLE__ */
8877 rc = fcntl(newfd, F_NOCACHE, 1);
8885 rc = mdb_env_copyfd2(env, newfd, flags);
8888 if (!(env->me_flags & MDB_NOSUBDIR))
8890 if (newfd != INVALID_HANDLE_VALUE)
8891 if (close(newfd) < 0 && rc == MDB_SUCCESS)
8898 mdb_env_copy(MDB_env *env, const char *path)
8900 return mdb_env_copy2(env, path, 0);
8904 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
8906 if ((flag & CHANGEABLE) != flag)
8909 env->me_flags |= flag;
8911 env->me_flags &= ~flag;
8916 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
8921 *arg = env->me_flags;
8926 mdb_env_set_userctx(MDB_env *env, void *ctx)
8930 env->me_userctx = ctx;
8935 mdb_env_get_userctx(MDB_env *env)
8937 return env ? env->me_userctx : NULL;
8941 mdb_env_set_assert(MDB_env *env, MDB_assert_func *func)
8946 env->me_assert_func = func;
8952 mdb_env_get_path(MDB_env *env, const char **arg)
8957 *arg = env->me_path;
8962 mdb_env_get_fd(MDB_env *env, mdb_filehandle_t *arg)
8971 /** Common code for #mdb_stat() and #mdb_env_stat().
8972 * @param[in] env the environment to operate in.
8973 * @param[in] db the #MDB_db record containing the stats to return.
8974 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
8975 * @return 0, this function always succeeds.
8978 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
8980 arg->ms_psize = env->me_psize;
8981 arg->ms_depth = db->md_depth;
8982 arg->ms_branch_pages = db->md_branch_pages;
8983 arg->ms_leaf_pages = db->md_leaf_pages;
8984 arg->ms_overflow_pages = db->md_overflow_pages;
8985 arg->ms_entries = db->md_entries;
8991 mdb_env_stat(MDB_env *env, MDB_stat *arg)
8995 if (env == NULL || arg == NULL)
8998 toggle = mdb_env_pick_meta(env);
9000 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
9004 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
9008 if (env == NULL || arg == NULL)
9011 toggle = mdb_env_pick_meta(env);
9012 arg->me_mapaddr = env->me_metas[toggle]->mm_address;
9013 arg->me_mapsize = env->me_mapsize;
9014 arg->me_maxreaders = env->me_maxreaders;
9016 /* me_numreaders may be zero if this process never used any readers. Use
9017 * the shared numreader count if it exists.
9019 arg->me_numreaders = env->me_txns ? env->me_txns->mti_numreaders : env->me_numreaders;
9021 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
9022 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
9026 /** Set the default comparison functions for a database.
9027 * Called immediately after a database is opened to set the defaults.
9028 * The user can then override them with #mdb_set_compare() or
9029 * #mdb_set_dupsort().
9030 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
9031 * @param[in] dbi A database handle returned by #mdb_dbi_open()
9034 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
9036 uint16_t f = txn->mt_dbs[dbi].md_flags;
9038 txn->mt_dbxs[dbi].md_cmp =
9039 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
9040 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
9042 txn->mt_dbxs[dbi].md_dcmp =
9043 !(f & MDB_DUPSORT) ? 0 :
9044 ((f & MDB_INTEGERDUP)
9045 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
9046 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
9049 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
9055 int rc, dbflag, exact;
9056 unsigned int unused = 0, seq;
9059 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
9060 mdb_default_cmp(txn, FREE_DBI);
9063 if ((flags & VALID_FLAGS) != flags)
9065 if (txn->mt_flags & MDB_TXN_ERROR)
9071 if (flags & PERSISTENT_FLAGS) {
9072 uint16_t f2 = flags & PERSISTENT_FLAGS;
9073 /* make sure flag changes get committed */
9074 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
9075 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
9076 txn->mt_flags |= MDB_TXN_DIRTY;
9079 mdb_default_cmp(txn, MAIN_DBI);
9083 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
9084 mdb_default_cmp(txn, MAIN_DBI);
9087 /* Is the DB already open? */
9089 for (i=2; i<txn->mt_numdbs; i++) {
9090 if (!txn->mt_dbxs[i].md_name.mv_size) {
9091 /* Remember this free slot */
9092 if (!unused) unused = i;
9095 if (len == txn->mt_dbxs[i].md_name.mv_size &&
9096 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
9102 /* If no free slot and max hit, fail */
9103 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
9104 return MDB_DBS_FULL;
9106 /* Cannot mix named databases with some mainDB flags */
9107 if (txn->mt_dbs[MAIN_DBI].md_flags & (MDB_DUPSORT|MDB_INTEGERKEY))
9108 return (flags & MDB_CREATE) ? MDB_INCOMPATIBLE : MDB_NOTFOUND;
9110 /* Find the DB info */
9111 dbflag = DB_NEW|DB_VALID;
9114 key.mv_data = (void *)name;
9115 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
9116 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
9117 if (rc == MDB_SUCCESS) {
9118 /* make sure this is actually a DB */
9119 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
9120 if (!(node->mn_flags & F_SUBDATA))
9121 return MDB_INCOMPATIBLE;
9122 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
9123 /* Create if requested */
9124 data.mv_size = sizeof(MDB_db);
9125 data.mv_data = &dummy;
9126 memset(&dummy, 0, sizeof(dummy));
9127 dummy.md_root = P_INVALID;
9128 dummy.md_flags = flags & PERSISTENT_FLAGS;
9129 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
9133 /* OK, got info, add to table */
9134 if (rc == MDB_SUCCESS) {
9135 unsigned int slot = unused ? unused : txn->mt_numdbs;
9136 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
9137 txn->mt_dbxs[slot].md_name.mv_size = len;
9138 txn->mt_dbxs[slot].md_rel = NULL;
9139 txn->mt_dbflags[slot] = dbflag;
9140 /* txn-> and env-> are the same in read txns, use
9141 * tmp variable to avoid undefined assignment
9143 seq = ++txn->mt_env->me_dbiseqs[slot];
9144 txn->mt_dbiseqs[slot] = seq;
9146 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
9148 mdb_default_cmp(txn, slot);
9157 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
9159 if (!arg || !TXN_DBI_EXIST(txn, dbi))
9162 if (txn->mt_flags & MDB_TXN_ERROR)
9165 if (txn->mt_dbflags[dbi] & DB_STALE) {
9168 /* Stale, must read the DB's root. cursor_init does it for us. */
9169 mdb_cursor_init(&mc, txn, dbi, &mx);
9171 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
9174 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
9177 if (dbi <= MAIN_DBI || dbi >= env->me_maxdbs)
9179 ptr = env->me_dbxs[dbi].md_name.mv_data;
9180 /* If there was no name, this was already closed */
9182 env->me_dbxs[dbi].md_name.mv_data = NULL;
9183 env->me_dbxs[dbi].md_name.mv_size = 0;
9184 env->me_dbflags[dbi] = 0;
9185 env->me_dbiseqs[dbi]++;
9190 int mdb_dbi_flags(MDB_txn *txn, MDB_dbi dbi, unsigned int *flags)
9192 /* We could return the flags for the FREE_DBI too but what's the point? */
9193 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9195 *flags = txn->mt_dbs[dbi].md_flags & PERSISTENT_FLAGS;
9199 /** Add all the DB's pages to the free list.
9200 * @param[in] mc Cursor on the DB to free.
9201 * @param[in] subs non-Zero to check for sub-DBs in this DB.
9202 * @return 0 on success, non-zero on failure.
9205 mdb_drop0(MDB_cursor *mc, int subs)
9209 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
9210 if (rc == MDB_SUCCESS) {
9211 MDB_txn *txn = mc->mc_txn;
9216 /* LEAF2 pages have no nodes, cannot have sub-DBs */
9217 if (IS_LEAF2(mc->mc_pg[mc->mc_top]))
9220 mdb_cursor_copy(mc, &mx);
9221 while (mc->mc_snum > 0) {
9222 MDB_page *mp = mc->mc_pg[mc->mc_top];
9223 unsigned n = NUMKEYS(mp);
9225 for (i=0; i<n; i++) {
9226 ni = NODEPTR(mp, i);
9227 if (ni->mn_flags & F_BIGDATA) {
9230 memcpy(&pg, NODEDATA(ni), sizeof(pg));
9231 rc = mdb_page_get(txn, pg, &omp, NULL);
9234 mdb_cassert(mc, IS_OVERFLOW(omp));
9235 rc = mdb_midl_append_range(&txn->mt_free_pgs,
9239 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
9240 mdb_xcursor_init1(mc, ni);
9241 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
9247 if ((rc = mdb_midl_need(&txn->mt_free_pgs, n)) != 0)
9249 for (i=0; i<n; i++) {
9251 ni = NODEPTR(mp, i);
9254 mdb_midl_xappend(txn->mt_free_pgs, pg);
9259 mc->mc_ki[mc->mc_top] = i;
9260 rc = mdb_cursor_sibling(mc, 1);
9262 if (rc != MDB_NOTFOUND)
9264 /* no more siblings, go back to beginning
9265 * of previous level.
9269 for (i=1; i<mc->mc_snum; i++) {
9271 mc->mc_pg[i] = mx.mc_pg[i];
9276 rc = mdb_midl_append(&txn->mt_free_pgs, mc->mc_db->md_root);
9279 txn->mt_flags |= MDB_TXN_ERROR;
9280 } else if (rc == MDB_NOTFOUND) {
9286 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
9288 MDB_cursor *mc, *m2;
9291 if ((unsigned)del > 1 || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9294 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
9297 if (dbi > MAIN_DBI && TXN_DBI_CHANGED(txn, dbi))
9300 rc = mdb_cursor_open(txn, dbi, &mc);
9304 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
9305 /* Invalidate the dropped DB's cursors */
9306 for (m2 = txn->mt_cursors[dbi]; m2; m2 = m2->mc_next)
9307 m2->mc_flags &= ~(C_INITIALIZED|C_EOF);
9311 /* Can't delete the main DB */
9312 if (del && dbi > MAIN_DBI) {
9313 rc = mdb_del0(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL, 0);
9315 txn->mt_dbflags[dbi] = DB_STALE;
9316 mdb_dbi_close(txn->mt_env, dbi);
9318 txn->mt_flags |= MDB_TXN_ERROR;
9321 /* reset the DB record, mark it dirty */
9322 txn->mt_dbflags[dbi] |= DB_DIRTY;
9323 txn->mt_dbs[dbi].md_depth = 0;
9324 txn->mt_dbs[dbi].md_branch_pages = 0;
9325 txn->mt_dbs[dbi].md_leaf_pages = 0;
9326 txn->mt_dbs[dbi].md_overflow_pages = 0;
9327 txn->mt_dbs[dbi].md_entries = 0;
9328 txn->mt_dbs[dbi].md_root = P_INVALID;
9330 txn->mt_flags |= MDB_TXN_DIRTY;
9333 mdb_cursor_close(mc);
9337 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9339 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9342 txn->mt_dbxs[dbi].md_cmp = cmp;
9346 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9348 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9351 txn->mt_dbxs[dbi].md_dcmp = cmp;
9355 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
9357 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9360 txn->mt_dbxs[dbi].md_rel = rel;
9364 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
9366 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9369 txn->mt_dbxs[dbi].md_relctx = ctx;
9374 mdb_env_get_maxkeysize(MDB_env *env)
9376 return ENV_MAXKEY(env);
9380 mdb_reader_list(MDB_env *env, MDB_msg_func *func, void *ctx)
9382 unsigned int i, rdrs;
9385 int rc = 0, first = 1;
9389 if (!env->me_txns) {
9390 return func("(no reader locks)\n", ctx);
9392 rdrs = env->me_txns->mti_numreaders;
9393 mr = env->me_txns->mti_readers;
9394 for (i=0; i<rdrs; i++) {
9396 txnid_t txnid = mr[i].mr_txnid;
9397 sprintf(buf, txnid == (txnid_t)-1 ?
9398 "%10d %"Z"x -\n" : "%10d %"Z"x %"Z"u\n",
9399 (int)mr[i].mr_pid, (size_t)mr[i].mr_tid, txnid);
9402 rc = func(" pid thread txnid\n", ctx);
9406 rc = func(buf, ctx);
9412 rc = func("(no active readers)\n", ctx);
9417 /** Insert pid into list if not already present.
9418 * return -1 if already present.
9421 mdb_pid_insert(MDB_PID_T *ids, MDB_PID_T pid)
9423 /* binary search of pid in list */
9425 unsigned cursor = 1;
9427 unsigned n = ids[0];
9430 unsigned pivot = n >> 1;
9431 cursor = base + pivot + 1;
9432 val = pid - ids[cursor];
9437 } else if ( val > 0 ) {
9442 /* found, so it's a duplicate */
9451 for (n = ids[0]; n > cursor; n--)
9458 mdb_reader_check(MDB_env *env, int *dead)
9460 unsigned int i, j, rdrs;
9462 MDB_PID_T *pids, pid;
9471 rdrs = env->me_txns->mti_numreaders;
9472 pids = malloc((rdrs+1) * sizeof(MDB_PID_T));
9476 mr = env->me_txns->mti_readers;
9477 for (i=0; i<rdrs; i++) {
9478 if (mr[i].mr_pid && mr[i].mr_pid != env->me_pid) {
9480 if (mdb_pid_insert(pids, pid) == 0) {
9481 if (!mdb_reader_pid(env, Pidcheck, pid)) {
9483 /* Recheck, a new process may have reused pid */
9484 if (!mdb_reader_pid(env, Pidcheck, pid)) {
9485 for (j=i; j<rdrs; j++)
9486 if (mr[j].mr_pid == pid) {
9487 DPRINTF(("clear stale reader pid %u txn %"Z"d",
9488 (unsigned) pid, mr[j].mr_txnid));
9493 UNLOCK_MUTEX_R(env);
projects / openldap / blob