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-2014 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)
94 /* Most platforms have posix_memalign, older may only have memalign */
95 #define HAVE_MEMALIGN 1
99 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
100 #include <netinet/in.h>
101 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
104 #if defined(__APPLE__) || defined (BSD)
105 # define MDB_USE_POSIX_SEM 1
106 # define MDB_FDATASYNC fsync
107 #elif defined(ANDROID)
108 # define MDB_FDATASYNC fsync
113 #ifdef MDB_USE_POSIX_SEM
114 # define MDB_USE_HASH 1
115 #include <semaphore.h>
120 #include <valgrind/memcheck.h>
121 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
122 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
123 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
124 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
125 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
127 #define VGMEMP_CREATE(h,r,z)
128 #define VGMEMP_ALLOC(h,a,s)
129 #define VGMEMP_FREE(h,a)
130 #define VGMEMP_DESTROY(h)
131 #define VGMEMP_DEFINED(a,s)
135 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
136 /* Solaris just defines one or the other */
137 # define LITTLE_ENDIAN 1234
138 # define BIG_ENDIAN 4321
139 # ifdef _LITTLE_ENDIAN
140 # define BYTE_ORDER LITTLE_ENDIAN
142 # define BYTE_ORDER BIG_ENDIAN
145 # define BYTE_ORDER __BYTE_ORDER
149 #ifndef LITTLE_ENDIAN
150 #define LITTLE_ENDIAN __LITTLE_ENDIAN
153 #define BIG_ENDIAN __BIG_ENDIAN
156 #if defined(__i386) || defined(__x86_64) || defined(_M_IX86)
157 #define MISALIGNED_OK 1
163 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
164 # error "Unknown or unsupported endianness (BYTE_ORDER)"
165 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
166 # error "Two's complement, reasonably sized integer types, please"
170 /** Put infrequently used env functions in separate section */
172 # define ESECT __attribute__ ((section("__TEXT,text_env")))
174 # define ESECT __attribute__ ((section("text_env")))
180 /** @defgroup internal LMDB Internals
183 /** @defgroup compat Compatibility Macros
184 * A bunch of macros to minimize the amount of platform-specific ifdefs
185 * needed throughout the rest of the code. When the features this library
186 * needs are similar enough to POSIX to be hidden in a one-or-two line
187 * replacement, this macro approach is used.
191 /** Features under development */
196 /** Wrapper around __func__, which is a C99 feature */
197 #if __STDC_VERSION__ >= 199901L
198 # define mdb_func_ __func__
199 #elif __GNUC__ >= 2 || _MSC_VER >= 1300
200 # define mdb_func_ __FUNCTION__
202 /* If a debug message says <mdb_unknown>(), update the #if statements above */
203 # define mdb_func_ "<mdb_unknown>"
207 #define MDB_USE_HASH 1
208 #define MDB_PIDLOCK 0
209 #define THREAD_RET DWORD
210 #define pthread_t HANDLE
211 #define pthread_mutex_t HANDLE
212 #define pthread_cond_t HANDLE
213 #define pthread_key_t DWORD
214 #define pthread_self() GetCurrentThreadId()
215 #define pthread_key_create(x,y) \
216 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
217 #define pthread_key_delete(x) TlsFree(x)
218 #define pthread_getspecific(x) TlsGetValue(x)
219 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
220 #define pthread_mutex_unlock(x) ReleaseMutex(*x)
221 #define pthread_mutex_lock(x) WaitForSingleObject(*x, INFINITE)
222 #define pthread_cond_signal(x) SetEvent(*x)
223 #define pthread_cond_wait(cond,mutex) do{SignalObjectAndWait(*mutex, *cond, INFINITE, FALSE); WaitForSingleObject(*mutex, INFINITE);}while(0)
224 #define THREAD_CREATE(thr,start,arg) thr=CreateThread(NULL,0,start,arg,0,NULL)
225 #define THREAD_FINISH(thr) WaitForSingleObject(thr, INFINITE)
226 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_rmutex)
227 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_rmutex)
228 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_wmutex)
229 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_wmutex)
230 #define getpid() GetCurrentProcessId()
231 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
232 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
233 #define ErrCode() GetLastError()
234 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
235 #define close(fd) (CloseHandle(fd) ? 0 : -1)
236 #define munmap(ptr,len) UnmapViewOfFile(ptr)
237 #ifdef PROCESS_QUERY_LIMITED_INFORMATION
238 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION PROCESS_QUERY_LIMITED_INFORMATION
240 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION 0x1000
244 #define THREAD_RET void *
245 #define THREAD_CREATE(thr,start,arg) pthread_create(&thr,NULL,start,arg)
246 #define THREAD_FINISH(thr) pthread_join(thr,NULL)
247 #define Z "z" /**< printf format modifier for size_t */
249 /** For MDB_LOCK_FORMAT: True if readers take a pid lock in the lockfile */
250 #define MDB_PIDLOCK 1
252 #ifdef MDB_USE_POSIX_SEM
254 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
255 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
256 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
257 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
260 mdb_sem_wait(sem_t *sem)
263 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
268 /** Lock the reader mutex.
270 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
271 /** Unlock the reader mutex.
273 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
275 /** Lock the writer mutex.
276 * Only a single write transaction is allowed at a time. Other writers
277 * will block waiting for this mutex.
279 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
280 /** Unlock the writer mutex.
282 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
283 #endif /* MDB_USE_POSIX_SEM */
285 /** Get the error code for the last failed system function.
287 #define ErrCode() errno
289 /** An abstraction for a file handle.
290 * On POSIX systems file handles are small integers. On Windows
291 * they're opaque pointers.
295 /** A value for an invalid file handle.
296 * Mainly used to initialize file variables and signify that they are
299 #define INVALID_HANDLE_VALUE (-1)
301 /** Get the size of a memory page for the system.
302 * This is the basic size that the platform's memory manager uses, and is
303 * fundamental to the use of memory-mapped files.
305 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
308 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
311 #define MNAME_LEN (sizeof(pthread_mutex_t))
317 /** A flag for opening a file and requesting synchronous data writes.
318 * This is only used when writing a meta page. It's not strictly needed;
319 * we could just do a normal write and then immediately perform a flush.
320 * But if this flag is available it saves us an extra system call.
322 * @note If O_DSYNC is undefined but exists in /usr/include,
323 * preferably set some compiler flag to get the definition.
324 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
327 # define MDB_DSYNC O_DSYNC
331 /** Function for flushing the data of a file. Define this to fsync
332 * if fdatasync() is not supported.
334 #ifndef MDB_FDATASYNC
335 # define MDB_FDATASYNC fdatasync
339 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
350 /** A page number in the database.
351 * Note that 64 bit page numbers are overkill, since pages themselves
352 * already represent 12-13 bits of addressable memory, and the OS will
353 * always limit applications to a maximum of 63 bits of address space.
355 * @note In the #MDB_node structure, we only store 48 bits of this value,
356 * which thus limits us to only 60 bits of addressable data.
358 typedef MDB_ID pgno_t;
360 /** A transaction ID.
361 * See struct MDB_txn.mt_txnid for details.
363 typedef MDB_ID txnid_t;
365 /** @defgroup debug Debug Macros
369 /** Enable debug output. Needs variable argument macros (a C99 feature).
370 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
371 * read from and written to the database (used for free space management).
377 static int mdb_debug;
378 static txnid_t mdb_debug_start;
380 /** Print a debug message with printf formatting.
381 * Requires double parenthesis around 2 or more args.
383 # define DPRINTF(args) ((void) ((mdb_debug) && DPRINTF0 args))
384 # define DPRINTF0(fmt, ...) \
385 fprintf(stderr, "%s:%d " fmt "\n", mdb_func_, __LINE__, __VA_ARGS__)
387 # define DPRINTF(args) ((void) 0)
389 /** Print a debug string.
390 * The string is printed literally, with no format processing.
392 #define DPUTS(arg) DPRINTF(("%s", arg))
393 /** Debuging output value of a cursor DBI: Negative in a sub-cursor. */
395 (((mc)->mc_flags & C_SUB) ? -(int)(mc)->mc_dbi : (int)(mc)->mc_dbi)
398 /** @brief The maximum size of a database page.
400 * It is 32k or 64k, since value-PAGEBASE must fit in
401 * #MDB_page.%mp_upper.
403 * LMDB will use database pages < OS pages if needed.
404 * That causes more I/O in write transactions: The OS must
405 * know (read) the whole page before writing a partial page.
407 * Note that we don't currently support Huge pages. On Linux,
408 * regular data files cannot use Huge pages, and in general
409 * Huge pages aren't actually pageable. We rely on the OS
410 * demand-pager to read our data and page it out when memory
411 * pressure from other processes is high. So until OSs have
412 * actual paging support for Huge pages, they're not viable.
414 #define MAX_PAGESIZE (PAGEBASE ? 0x10000 : 0x8000)
416 /** The minimum number of keys required in a database page.
417 * Setting this to a larger value will place a smaller bound on the
418 * maximum size of a data item. Data items larger than this size will
419 * be pushed into overflow pages instead of being stored directly in
420 * the B-tree node. This value used to default to 4. With a page size
421 * of 4096 bytes that meant that any item larger than 1024 bytes would
422 * go into an overflow page. That also meant that on average 2-3KB of
423 * each overflow page was wasted space. The value cannot be lower than
424 * 2 because then there would no longer be a tree structure. With this
425 * value, items larger than 2KB will go into overflow pages, and on
426 * average only 1KB will be wasted.
428 #define MDB_MINKEYS 2
430 /** A stamp that identifies a file as an LMDB file.
431 * There's nothing special about this value other than that it is easily
432 * recognizable, and it will reflect any byte order mismatches.
434 #define MDB_MAGIC 0xBEEFC0DE
436 /** The version number for a database's datafile format. */
437 #define MDB_DATA_VERSION ((MDB_DEVEL) ? 999 : 1)
438 /** The version number for a database's lockfile format. */
439 #define MDB_LOCK_VERSION 1
441 /** @brief The max size of a key we can write, or 0 for dynamic max.
443 * Define this as 0 to compute the max from the page size. 511
444 * is default for backwards compat: liblmdb <= 0.9.10 can break
445 * when modifying a DB with keys/dupsort data bigger than its max.
446 * #MDB_DEVEL sets the default to 0.
448 * Data items in an #MDB_DUPSORT database are also limited to
449 * this size, since they're actually keys of a sub-DB. Keys and
450 * #MDB_DUPSORT data items must fit on a node in a regular page.
452 #ifndef MDB_MAXKEYSIZE
453 #define MDB_MAXKEYSIZE ((MDB_DEVEL) ? 0 : 511)
456 /** The maximum size of a key we can write to the environment. */
458 #define ENV_MAXKEY(env) (MDB_MAXKEYSIZE)
460 #define ENV_MAXKEY(env) ((env)->me_maxkey)
463 /** @brief The maximum size of a data item.
465 * We only store a 32 bit value for node sizes.
467 #define MAXDATASIZE 0xffffffffUL
470 /** Key size which fits in a #DKBUF.
473 #define DKBUF_MAXKEYSIZE ((MDB_MAXKEYSIZE) > 0 ? (MDB_MAXKEYSIZE) : 511)
476 * This is used for printing a hex dump of a key's contents.
478 #define DKBUF char kbuf[DKBUF_MAXKEYSIZE*2+1]
479 /** Display a key in hex.
481 * Invoke a function to display a key in hex.
483 #define DKEY(x) mdb_dkey(x, kbuf)
489 /** An invalid page number.
490 * Mainly used to denote an empty tree.
492 #define P_INVALID (~(pgno_t)0)
494 /** Test if the flags \b f are set in a flag word \b w. */
495 #define F_ISSET(w, f) (((w) & (f)) == (f))
497 /** Round \b n up to an even number. */
498 #define EVEN(n) (((n) + 1U) & -2) /* sign-extending -2 to match n+1U */
500 /** Used for offsets within a single page.
501 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
504 typedef uint16_t indx_t;
506 /** Default size of memory map.
507 * This is certainly too small for any actual applications. Apps should always set
508 * the size explicitly using #mdb_env_set_mapsize().
510 #define DEFAULT_MAPSIZE 1048576
512 /** @defgroup readers Reader Lock Table
513 * Readers don't acquire any locks for their data access. Instead, they
514 * simply record their transaction ID in the reader table. The reader
515 * mutex is needed just to find an empty slot in the reader table. The
516 * slot's address is saved in thread-specific data so that subsequent read
517 * transactions started by the same thread need no further locking to proceed.
519 * If #MDB_NOTLS is set, the slot address is not saved in thread-specific data.
521 * No reader table is used if the database is on a read-only filesystem, or
522 * if #MDB_NOLOCK is set.
524 * Since the database uses multi-version concurrency control, readers don't
525 * actually need any locking. This table is used to keep track of which
526 * readers are using data from which old transactions, so that we'll know
527 * when a particular old transaction is no longer in use. Old transactions
528 * that have discarded any data pages can then have those pages reclaimed
529 * for use by a later write transaction.
531 * The lock table is constructed such that reader slots are aligned with the
532 * processor's cache line size. Any slot is only ever used by one thread.
533 * This alignment guarantees that there will be no contention or cache
534 * thrashing as threads update their own slot info, and also eliminates
535 * any need for locking when accessing a slot.
537 * A writer thread will scan every slot in the table to determine the oldest
538 * outstanding reader transaction. Any freed pages older than this will be
539 * reclaimed by the writer. The writer doesn't use any locks when scanning
540 * this table. This means that there's no guarantee that the writer will
541 * see the most up-to-date reader info, but that's not required for correct
542 * operation - all we need is to know the upper bound on the oldest reader,
543 * we don't care at all about the newest reader. So the only consequence of
544 * reading stale information here is that old pages might hang around a
545 * while longer before being reclaimed. That's actually good anyway, because
546 * the longer we delay reclaiming old pages, the more likely it is that a
547 * string of contiguous pages can be found after coalescing old pages from
548 * many old transactions together.
551 /** Number of slots in the reader table.
552 * This value was chosen somewhat arbitrarily. 126 readers plus a
553 * couple mutexes fit exactly into 8KB on my development machine.
554 * Applications should set the table size using #mdb_env_set_maxreaders().
556 #define DEFAULT_READERS 126
558 /** The size of a CPU cache line in bytes. We want our lock structures
559 * aligned to this size to avoid false cache line sharing in the
561 * This value works for most CPUs. For Itanium this should be 128.
567 /** The information we store in a single slot of the reader table.
568 * In addition to a transaction ID, we also record the process and
569 * thread ID that owns a slot, so that we can detect stale information,
570 * e.g. threads or processes that went away without cleaning up.
571 * @note We currently don't check for stale records. We simply re-init
572 * the table when we know that we're the only process opening the
575 typedef struct MDB_rxbody {
576 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
577 * Multiple readers that start at the same time will probably have the
578 * same ID here. Again, it's not important to exclude them from
579 * anything; all we need to know is which version of the DB they
580 * started from so we can avoid overwriting any data used in that
581 * particular version.
584 /** The process ID of the process owning this reader txn. */
586 /** The thread ID of the thread owning this txn. */
590 /** The actual reader record, with cacheline padding. */
591 typedef struct MDB_reader {
594 /** shorthand for mrb_txnid */
595 #define mr_txnid mru.mrx.mrb_txnid
596 #define mr_pid mru.mrx.mrb_pid
597 #define mr_tid mru.mrx.mrb_tid
598 /** cache line alignment */
599 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
603 /** The header for the reader table.
604 * The table resides in a memory-mapped file. (This is a different file
605 * than is used for the main database.)
607 * For POSIX the actual mutexes reside in the shared memory of this
608 * mapped file. On Windows, mutexes are named objects allocated by the
609 * kernel; we store the mutex names in this mapped file so that other
610 * processes can grab them. This same approach is also used on
611 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
612 * process-shared POSIX mutexes. For these cases where a named object
613 * is used, the object name is derived from a 64 bit FNV hash of the
614 * environment pathname. As such, naming collisions are extremely
615 * unlikely. If a collision occurs, the results are unpredictable.
617 typedef struct MDB_txbody {
618 /** Stamp identifying this as an LMDB file. It must be set
621 /** Format of this lock file. Must be set to #MDB_LOCK_FORMAT. */
623 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
624 char mtb_rmname[MNAME_LEN];
626 /** Mutex protecting access to this table.
627 * This is the reader lock that #LOCK_MUTEX_R acquires.
629 pthread_mutex_t mtb_mutex;
631 /** The ID of the last transaction committed to the database.
632 * This is recorded here only for convenience; the value can always
633 * be determined by reading the main database meta pages.
636 /** The number of slots that have been used in the reader table.
637 * This always records the maximum count, it is not decremented
638 * when readers release their slots.
640 unsigned mtb_numreaders;
643 /** The actual reader table definition. */
644 typedef struct MDB_txninfo {
647 #define mti_magic mt1.mtb.mtb_magic
648 #define mti_format mt1.mtb.mtb_format
649 #define mti_mutex mt1.mtb.mtb_mutex
650 #define mti_rmname mt1.mtb.mtb_rmname
651 #define mti_txnid mt1.mtb.mtb_txnid
652 #define mti_numreaders mt1.mtb.mtb_numreaders
653 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
656 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
657 char mt2_wmname[MNAME_LEN];
658 #define mti_wmname mt2.mt2_wmname
660 pthread_mutex_t mt2_wmutex;
661 #define mti_wmutex mt2.mt2_wmutex
663 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
665 MDB_reader mti_readers[1];
668 /** Lockfile format signature: version, features and field layout */
669 #define MDB_LOCK_FORMAT \
671 ((MDB_LOCK_VERSION) \
672 /* Flags which describe functionality */ \
673 + (((MDB_PIDLOCK) != 0) << 16)))
676 /** Common header for all page types.
677 * Overflow records occupy a number of contiguous pages with no
678 * headers on any page after the first.
680 typedef struct MDB_page {
681 #define mp_pgno mp_p.p_pgno
682 #define mp_next mp_p.p_next
684 pgno_t p_pgno; /**< page number */
685 struct MDB_page *p_next; /**< for in-memory list of freed pages */
688 /** @defgroup mdb_page Page Flags
690 * Flags for the page headers.
693 #define P_BRANCH 0x01 /**< branch page */
694 #define P_LEAF 0x02 /**< leaf page */
695 #define P_OVERFLOW 0x04 /**< overflow page */
696 #define P_META 0x08 /**< meta page */
697 #define P_DIRTY 0x10 /**< dirty page, also set for #P_SUBP pages */
698 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
699 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
700 #define P_LOOSE 0x4000 /**< page was dirtied then freed, can be reused */
701 #define P_KEEP 0x8000 /**< leave this page alone during spill */
703 uint16_t mp_flags; /**< @ref mdb_page */
704 #define mp_lower mp_pb.pb.pb_lower
705 #define mp_upper mp_pb.pb.pb_upper
706 #define mp_pages mp_pb.pb_pages
709 indx_t pb_lower; /**< lower bound of free space */
710 indx_t pb_upper; /**< upper bound of free space */
712 uint32_t pb_pages; /**< number of overflow pages */
714 indx_t mp_ptrs[1]; /**< dynamic size */
717 /** Size of the page header, excluding dynamic data at the end */
718 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
720 /** Address of first usable data byte in a page, after the header */
721 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
723 /** ITS#7713, change PAGEBASE to handle 65536 byte pages */
724 #define PAGEBASE ((MDB_DEVEL) ? PAGEHDRSZ : 0)
726 /** Number of nodes on a page */
727 #define NUMKEYS(p) (((p)->mp_lower - (PAGEHDRSZ-PAGEBASE)) >> 1)
729 /** The amount of space remaining in the page */
730 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
732 /** The percentage of space used in the page, in tenths of a percent. */
733 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
734 ((env)->me_psize - PAGEHDRSZ))
735 /** The minimum page fill factor, in tenths of a percent.
736 * Pages emptier than this are candidates for merging.
738 #define FILL_THRESHOLD 250
740 /** Test if a page is a leaf page */
741 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
742 /** Test if a page is a LEAF2 page */
743 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
744 /** Test if a page is a branch page */
745 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
746 /** Test if a page is an overflow page */
747 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
748 /** Test if a page is a sub page */
749 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
751 /** The number of overflow pages needed to store the given size. */
752 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
754 /** Link in #MDB_txn.%mt_loose_pgs list */
755 #define NEXT_LOOSE_PAGE(p) (*(MDB_page **)((p) + 2))
757 /** Header for a single key/data pair within a page.
758 * Used in pages of type #P_BRANCH and #P_LEAF without #P_LEAF2.
759 * We guarantee 2-byte alignment for 'MDB_node's.
761 typedef struct MDB_node {
762 /** lo and hi are used for data size on leaf nodes and for
763 * child pgno on branch nodes. On 64 bit platforms, flags
764 * is also used for pgno. (Branch nodes have no flags).
765 * They are in host byte order in case that lets some
766 * accesses be optimized into a 32-bit word access.
768 #if BYTE_ORDER == LITTLE_ENDIAN
769 unsigned short mn_lo, mn_hi; /**< part of data size or pgno */
771 unsigned short mn_hi, mn_lo;
773 /** @defgroup mdb_node Node Flags
775 * Flags for node headers.
778 #define F_BIGDATA 0x01 /**< data put on overflow page */
779 #define F_SUBDATA 0x02 /**< data is a sub-database */
780 #define F_DUPDATA 0x04 /**< data has duplicates */
782 /** valid flags for #mdb_node_add() */
783 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
786 unsigned short mn_flags; /**< @ref mdb_node */
787 unsigned short mn_ksize; /**< key size */
788 char mn_data[1]; /**< key and data are appended here */
791 /** Size of the node header, excluding dynamic data at the end */
792 #define NODESIZE offsetof(MDB_node, mn_data)
794 /** Bit position of top word in page number, for shifting mn_flags */
795 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
797 /** Size of a node in a branch page with a given key.
798 * This is just the node header plus the key, there is no data.
800 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
802 /** Size of a node in a leaf page with a given key and data.
803 * This is node header plus key plus data size.
805 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
807 /** Address of node \b i in page \b p */
808 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i] + PAGEBASE))
810 /** Address of the key for the node */
811 #define NODEKEY(node) (void *)((node)->mn_data)
813 /** Address of the data for a node */
814 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
816 /** Get the page number pointed to by a branch node */
817 #define NODEPGNO(node) \
818 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
819 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
820 /** Set the page number in a branch node */
821 #define SETPGNO(node,pgno) do { \
822 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
823 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
825 /** Get the size of the data in a leaf node */
826 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
827 /** Set the size of the data for a leaf node */
828 #define SETDSZ(node,size) do { \
829 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
830 /** The size of a key in a node */
831 #define NODEKSZ(node) ((node)->mn_ksize)
833 /** Copy a page number from src to dst */
835 #define COPY_PGNO(dst,src) dst = src
837 #if SIZE_MAX > 4294967295UL
838 #define COPY_PGNO(dst,src) do { \
839 unsigned short *s, *d; \
840 s = (unsigned short *)&(src); \
841 d = (unsigned short *)&(dst); \
848 #define COPY_PGNO(dst,src) do { \
849 unsigned short *s, *d; \
850 s = (unsigned short *)&(src); \
851 d = (unsigned short *)&(dst); \
857 /** The address of a key in a LEAF2 page.
858 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
859 * There are no node headers, keys are stored contiguously.
861 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
863 /** Set the \b node's key into \b keyptr, if requested. */
864 #define MDB_GET_KEY(node, keyptr) { if ((keyptr) != NULL) { \
865 (keyptr)->mv_size = NODEKSZ(node); (keyptr)->mv_data = NODEKEY(node); } }
867 /** Set the \b node's key into \b key. */
868 #define MDB_GET_KEY2(node, key) { key.mv_size = NODEKSZ(node); key.mv_data = NODEKEY(node); }
870 /** Information about a single database in the environment. */
871 typedef struct MDB_db {
872 uint32_t md_pad; /**< also ksize for LEAF2 pages */
873 uint16_t md_flags; /**< @ref mdb_dbi_open */
874 uint16_t md_depth; /**< depth of this tree */
875 pgno_t md_branch_pages; /**< number of internal pages */
876 pgno_t md_leaf_pages; /**< number of leaf pages */
877 pgno_t md_overflow_pages; /**< number of overflow pages */
878 size_t md_entries; /**< number of data items */
879 pgno_t md_root; /**< the root page of this tree */
882 /** mdb_dbi_open flags */
883 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
884 #define PERSISTENT_FLAGS (0xffff & ~(MDB_VALID))
885 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
886 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
888 /** Handle for the DB used to track free pages. */
890 /** Handle for the default DB. */
893 /** Meta page content.
894 * A meta page is the start point for accessing a database snapshot.
895 * Pages 0-1 are meta pages. Transaction N writes meta page #(N % 2).
897 typedef struct MDB_meta {
898 /** Stamp identifying this as an LMDB file. It must be set
901 /** Version number of this lock file. Must be set to #MDB_DATA_VERSION. */
903 void *mm_address; /**< address for fixed mapping */
904 size_t mm_mapsize; /**< size of mmap region */
905 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
906 /** The size of pages used in this DB */
907 #define mm_psize mm_dbs[0].md_pad
908 /** Any persistent environment flags. @ref mdb_env */
909 #define mm_flags mm_dbs[0].md_flags
910 pgno_t mm_last_pg; /**< last used page in file */
911 txnid_t mm_txnid; /**< txnid that committed this page */
914 /** Buffer for a stack-allocated meta page.
915 * The members define size and alignment, and silence type
916 * aliasing warnings. They are not used directly; that could
917 * mean incorrectly using several union members in parallel.
919 typedef union MDB_metabuf {
922 char mm_pad[PAGEHDRSZ];
927 /** Auxiliary DB info.
928 * The information here is mostly static/read-only. There is
929 * only a single copy of this record in the environment.
931 typedef struct MDB_dbx {
932 MDB_val md_name; /**< name of the database */
933 MDB_cmp_func *md_cmp; /**< function for comparing keys */
934 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
935 MDB_rel_func *md_rel; /**< user relocate function */
936 void *md_relctx; /**< user-provided context for md_rel */
939 /** A database transaction.
940 * Every operation requires a transaction handle.
943 MDB_txn *mt_parent; /**< parent of a nested txn */
944 MDB_txn *mt_child; /**< nested txn under this txn */
945 pgno_t mt_next_pgno; /**< next unallocated page */
946 /** The ID of this transaction. IDs are integers incrementing from 1.
947 * Only committed write transactions increment the ID. If a transaction
948 * aborts, the ID may be re-used by the next writer.
951 MDB_env *mt_env; /**< the DB environment */
952 /** The list of pages that became unused during this transaction.
955 /** The list of loose pages that became unused and may be reused
956 * in this transaction, linked through #NEXT_LOOSE_PAGE(page).
958 MDB_page *mt_loose_pgs;
959 /* #Number of loose pages (#mt_loose_pgs) */
961 /** The sorted list of dirty pages we temporarily wrote to disk
962 * because the dirty list was full. page numbers in here are
963 * shifted left by 1, deleted slots have the LSB set.
965 MDB_IDL mt_spill_pgs;
967 /** For write txns: Modified pages. Sorted when not MDB_WRITEMAP. */
969 /** For read txns: This thread/txn's reader table slot, or NULL. */
972 /** Array of records for each DB known in the environment. */
974 /** Array of MDB_db records for each known DB */
976 /** Array of sequence numbers for each DB handle */
977 unsigned int *mt_dbiseqs;
978 /** @defgroup mt_dbflag Transaction DB Flags
982 #define DB_DIRTY 0x01 /**< DB was modified or is DUPSORT data */
983 #define DB_STALE 0x02 /**< Named-DB record is older than txnID */
984 #define DB_NEW 0x04 /**< Named-DB handle opened in this txn */
985 #define DB_VALID 0x08 /**< DB handle is valid, see also #MDB_VALID */
987 /** In write txns, array of cursors for each DB */
988 MDB_cursor **mt_cursors;
989 /** Array of flags for each DB */
990 unsigned char *mt_dbflags;
991 /** Number of DB records in use. This number only ever increments;
992 * we don't decrement it when individual DB handles are closed.
996 /** @defgroup mdb_txn Transaction Flags
1000 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
1001 #define MDB_TXN_ERROR 0x02 /**< txn is unusable after an error */
1002 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
1003 #define MDB_TXN_SPILLS 0x08 /**< txn or a parent has spilled pages */
1005 unsigned int mt_flags; /**< @ref mdb_txn */
1006 /** #dirty_list room: Array size - \#dirty pages visible to this txn.
1007 * Includes ancestor txns' dirty pages not hidden by other txns'
1008 * dirty/spilled pages. Thus commit(nested txn) has room to merge
1009 * dirty_list into mt_parent after freeing hidden mt_parent pages.
1011 unsigned int mt_dirty_room;
1014 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
1015 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
1016 * raise this on a 64 bit machine.
1018 #define CURSOR_STACK 32
1022 /** Cursors are used for all DB operations.
1023 * A cursor holds a path of (page pointer, key index) from the DB
1024 * root to a position in the DB, plus other state. #MDB_DUPSORT
1025 * cursors include an xcursor to the current data item. Write txns
1026 * track their cursors and keep them up to date when data moves.
1027 * Exception: An xcursor's pointer to a #P_SUBP page can be stale.
1028 * (A node with #F_DUPDATA but no #F_SUBDATA contains a subpage).
1031 /** Next cursor on this DB in this txn */
1032 MDB_cursor *mc_next;
1033 /** Backup of the original cursor if this cursor is a shadow */
1034 MDB_cursor *mc_backup;
1035 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
1036 struct MDB_xcursor *mc_xcursor;
1037 /** The transaction that owns this cursor */
1039 /** The database handle this cursor operates on */
1041 /** The database record for this cursor */
1043 /** The database auxiliary record for this cursor */
1045 /** The @ref mt_dbflag for this database */
1046 unsigned char *mc_dbflag;
1047 unsigned short mc_snum; /**< number of pushed pages */
1048 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
1049 /** @defgroup mdb_cursor Cursor Flags
1051 * Cursor state flags.
1054 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
1055 #define C_EOF 0x02 /**< No more data */
1056 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
1057 #define C_DEL 0x08 /**< last op was a cursor_del */
1058 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
1059 #define C_UNTRACK 0x40 /**< Un-track cursor when closing */
1061 unsigned int mc_flags; /**< @ref mdb_cursor */
1062 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
1063 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
1066 /** Context for sorted-dup records.
1067 * We could have gone to a fully recursive design, with arbitrarily
1068 * deep nesting of sub-databases. But for now we only handle these
1069 * levels - main DB, optional sub-DB, sorted-duplicate DB.
1071 typedef struct MDB_xcursor {
1072 /** A sub-cursor for traversing the Dup DB */
1073 MDB_cursor mx_cursor;
1074 /** The database record for this Dup DB */
1076 /** The auxiliary DB record for this Dup DB */
1078 /** The @ref mt_dbflag for this Dup DB */
1079 unsigned char mx_dbflag;
1082 /** State of FreeDB old pages, stored in the MDB_env */
1083 typedef struct MDB_pgstate {
1084 pgno_t *mf_pghead; /**< Reclaimed freeDB pages, or NULL before use */
1085 txnid_t mf_pglast; /**< ID of last used record, or 0 if !mf_pghead */
1088 /** The database environment. */
1090 HANDLE me_fd; /**< The main data file */
1091 HANDLE me_lfd; /**< The lock file */
1092 HANDLE me_mfd; /**< just for writing the meta pages */
1093 /** Failed to update the meta page. Probably an I/O error. */
1094 #define MDB_FATAL_ERROR 0x80000000U
1095 /** Some fields are initialized. */
1096 #define MDB_ENV_ACTIVE 0x20000000U
1097 /** me_txkey is set */
1098 #define MDB_ENV_TXKEY 0x10000000U
1099 uint32_t me_flags; /**< @ref mdb_env */
1100 unsigned int me_psize; /**< DB page size, inited from me_os_psize */
1101 unsigned int me_os_psize; /**< OS page size, from #GET_PAGESIZE */
1102 unsigned int me_maxreaders; /**< size of the reader table */
1103 unsigned int me_numreaders; /**< max numreaders set by this env */
1104 MDB_dbi me_numdbs; /**< number of DBs opened */
1105 MDB_dbi me_maxdbs; /**< size of the DB table */
1106 MDB_PID_T me_pid; /**< process ID of this env */
1107 char *me_path; /**< path to the DB files */
1108 char *me_map; /**< the memory map of the data file */
1109 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
1110 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
1111 void *me_pbuf; /**< scratch area for DUPSORT put() */
1112 MDB_txn *me_txn; /**< current write transaction */
1113 size_t me_mapsize; /**< size of the data memory map */
1114 off_t me_size; /**< current file size */
1115 pgno_t me_maxpg; /**< me_mapsize / me_psize */
1116 MDB_dbx *me_dbxs; /**< array of static DB info */
1117 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
1118 unsigned int *me_dbiseqs; /**< array of dbi sequence numbers */
1119 pthread_key_t me_txkey; /**< thread-key for readers */
1120 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
1121 # define me_pglast me_pgstate.mf_pglast
1122 # define me_pghead me_pgstate.mf_pghead
1123 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
1124 /** IDL of pages that became unused in a write txn */
1125 MDB_IDL me_free_pgs;
1126 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
1127 MDB_ID2L me_dirty_list;
1128 /** Max number of freelist items that can fit in a single overflow page */
1130 /** Max size of a node on a page */
1131 unsigned int me_nodemax;
1132 #if !(MDB_MAXKEYSIZE)
1133 unsigned int me_maxkey; /**< max size of a key */
1135 int me_live_reader; /**< have liveness lock in reader table */
1137 int me_pidquery; /**< Used in OpenProcess */
1138 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
1140 #elif defined(MDB_USE_POSIX_SEM)
1141 sem_t *me_rmutex; /* Shared mutexes are not supported */
1144 void *me_userctx; /**< User-settable context */
1145 MDB_assert_func *me_assert_func; /**< Callback for assertion failures */
1148 /** Nested transaction */
1149 typedef struct MDB_ntxn {
1150 MDB_txn mnt_txn; /**< the transaction */
1151 MDB_pgstate mnt_pgstate; /**< parent transaction's saved freestate */
1154 /** max number of pages to commit in one writev() call */
1155 #define MDB_COMMIT_PAGES 64
1156 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
1157 #undef MDB_COMMIT_PAGES
1158 #define MDB_COMMIT_PAGES IOV_MAX
1161 /** max bytes to write in one call */
1162 #define MAX_WRITE (0x80000000U >> (sizeof(ssize_t) == 4))
1164 /** Check \b txn and \b dbi arguments to a function */
1165 #define TXN_DBI_EXIST(txn, dbi) \
1166 ((txn) && (dbi) < (txn)->mt_numdbs && ((txn)->mt_dbflags[dbi] & DB_VALID))
1168 /** Check for misused \b dbi handles */
1169 #define TXN_DBI_CHANGED(txn, dbi) \
1170 ((txn)->mt_dbiseqs[dbi] != (txn)->mt_env->me_dbiseqs[dbi])
1172 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
1173 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
1174 static int mdb_page_touch(MDB_cursor *mc);
1176 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp, int *lvl);
1177 static int mdb_page_search_root(MDB_cursor *mc,
1178 MDB_val *key, int modify);
1179 #define MDB_PS_MODIFY 1
1180 #define MDB_PS_ROOTONLY 2
1181 #define MDB_PS_FIRST 4
1182 #define MDB_PS_LAST 8
1183 static int mdb_page_search(MDB_cursor *mc,
1184 MDB_val *key, int flags);
1185 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1187 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1188 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1189 pgno_t newpgno, unsigned int nflags);
1191 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1192 static int mdb_env_pick_meta(const MDB_env *env);
1193 static int mdb_env_write_meta(MDB_txn *txn);
1194 #if !(defined(_WIN32) || defined(MDB_USE_POSIX_SEM)) /* Drop unused excl arg */
1195 # define mdb_env_close0(env, excl) mdb_env_close1(env)
1197 static void mdb_env_close0(MDB_env *env, int excl);
1199 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1200 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1201 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1202 static void mdb_node_del(MDB_cursor *mc, int ksize);
1203 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1204 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1205 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1206 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1207 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1209 static int mdb_rebalance(MDB_cursor *mc);
1210 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1212 static void mdb_cursor_pop(MDB_cursor *mc);
1213 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1215 static int mdb_cursor_del0(MDB_cursor *mc);
1216 static int mdb_del0(MDB_txn *txn, MDB_dbi dbi, MDB_val *key, MDB_val *data, unsigned flags);
1217 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1218 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1219 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1220 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1222 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1223 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1225 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1226 static void mdb_xcursor_init0(MDB_cursor *mc);
1227 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1229 static int mdb_drop0(MDB_cursor *mc, int subs);
1230 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1233 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1237 static SECURITY_DESCRIPTOR mdb_null_sd;
1238 static SECURITY_ATTRIBUTES mdb_all_sa;
1239 static int mdb_sec_inited;
1242 /** Return the library version info. */
1244 mdb_version(int *major, int *minor, int *patch)
1246 if (major) *major = MDB_VERSION_MAJOR;
1247 if (minor) *minor = MDB_VERSION_MINOR;
1248 if (patch) *patch = MDB_VERSION_PATCH;
1249 return MDB_VERSION_STRING;
1252 /** Table of descriptions for LMDB @ref errors */
1253 static char *const mdb_errstr[] = {
1254 "MDB_KEYEXIST: Key/data pair already exists",
1255 "MDB_NOTFOUND: No matching key/data pair found",
1256 "MDB_PAGE_NOTFOUND: Requested page not found",
1257 "MDB_CORRUPTED: Located page was wrong type",
1258 "MDB_PANIC: Update of meta page failed",
1259 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1260 "MDB_INVALID: File is not an LMDB file",
1261 "MDB_MAP_FULL: Environment mapsize limit reached",
1262 "MDB_DBS_FULL: Environment maxdbs limit reached",
1263 "MDB_READERS_FULL: Environment maxreaders limit reached",
1264 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1265 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1266 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1267 "MDB_PAGE_FULL: Internal error - page has no more space",
1268 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1269 "MDB_INCOMPATIBLE: Operation and DB incompatible, or DB flags changed",
1270 "MDB_BAD_RSLOT: Invalid reuse of reader locktable slot",
1271 "MDB_BAD_TXN: Transaction cannot recover - it must be aborted",
1272 "MDB_BAD_VALSIZE: Unsupported size of key/DB name/data, or wrong DUPFIXED size",
1273 "MDB_BAD_DBI: The specified DBI handle was closed/changed unexpectedly",
1277 mdb_strerror(int err)
1280 /** HACK: pad 4KB on stack over the buf. Return system msgs in buf.
1281 * This works as long as no function between the call to mdb_strerror
1282 * and the actual use of the message uses more than 4K of stack.
1285 char buf[1024], *ptr = buf;
1289 return ("Successful return: 0");
1291 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1292 i = err - MDB_KEYEXIST;
1293 return mdb_errstr[i];
1297 /* These are the C-runtime error codes we use. The comment indicates
1298 * their numeric value, and the Win32 error they would correspond to
1299 * if the error actually came from a Win32 API. A major mess, we should
1300 * have used LMDB-specific error codes for everything.
1303 case ENOENT: /* 2, FILE_NOT_FOUND */
1304 case EIO: /* 5, ACCESS_DENIED */
1305 case ENOMEM: /* 12, INVALID_ACCESS */
1306 case EACCES: /* 13, INVALID_DATA */
1307 case EBUSY: /* 16, CURRENT_DIRECTORY */
1308 case EINVAL: /* 22, BAD_COMMAND */
1309 case ENOSPC: /* 28, OUT_OF_PAPER */
1310 return strerror(err);
1315 FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM |
1316 FORMAT_MESSAGE_IGNORE_INSERTS,
1317 NULL, err, 0, ptr, sizeof(buf), pad);
1320 return strerror(err);
1324 /** assert(3) variant in cursor context */
1325 #define mdb_cassert(mc, expr) mdb_assert0((mc)->mc_txn->mt_env, expr, #expr)
1326 /** assert(3) variant in transaction context */
1327 #define mdb_tassert(mc, expr) mdb_assert0((txn)->mt_env, expr, #expr)
1328 /** assert(3) variant in environment context */
1329 #define mdb_eassert(env, expr) mdb_assert0(env, expr, #expr)
1332 # define mdb_assert0(env, expr, expr_txt) ((expr) ? (void)0 : \
1333 mdb_assert_fail(env, expr_txt, mdb_func_, __FILE__, __LINE__))
1336 mdb_assert_fail(MDB_env *env, const char *expr_txt,
1337 const char *func, const char *file, int line)
1340 sprintf(buf, "%.100s:%d: Assertion '%.200s' failed in %.40s()",
1341 file, line, expr_txt, func);
1342 if (env->me_assert_func)
1343 env->me_assert_func(env, buf);
1344 fprintf(stderr, "%s\n", buf);
1348 # define mdb_assert0(env, expr, expr_txt) ((void) 0)
1352 /** Return the page number of \b mp which may be sub-page, for debug output */
1354 mdb_dbg_pgno(MDB_page *mp)
1357 COPY_PGNO(ret, mp->mp_pgno);
1361 /** Display a key in hexadecimal and return the address of the result.
1362 * @param[in] key the key to display
1363 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1364 * @return The key in hexadecimal form.
1367 mdb_dkey(MDB_val *key, char *buf)
1370 unsigned char *c = key->mv_data;
1376 if (key->mv_size > DKBUF_MAXKEYSIZE)
1377 return "MDB_MAXKEYSIZE";
1378 /* may want to make this a dynamic check: if the key is mostly
1379 * printable characters, print it as-is instead of converting to hex.
1383 for (i=0; i<key->mv_size; i++)
1384 ptr += sprintf(ptr, "%02x", *c++);
1386 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1392 mdb_leafnode_type(MDB_node *n)
1394 static char *const tp[2][2] = {{"", ": DB"}, {": sub-page", ": sub-DB"}};
1395 return F_ISSET(n->mn_flags, F_BIGDATA) ? ": overflow page" :
1396 tp[F_ISSET(n->mn_flags, F_DUPDATA)][F_ISSET(n->mn_flags, F_SUBDATA)];
1399 /** Display all the keys in the page. */
1401 mdb_page_list(MDB_page *mp)
1403 pgno_t pgno = mdb_dbg_pgno(mp);
1404 const char *type, *state = (mp->mp_flags & P_DIRTY) ? ", dirty" : "";
1406 unsigned int i, nkeys, nsize, total = 0;
1410 switch (mp->mp_flags & (P_BRANCH|P_LEAF|P_LEAF2|P_META|P_OVERFLOW|P_SUBP)) {
1411 case P_BRANCH: type = "Branch page"; break;
1412 case P_LEAF: type = "Leaf page"; break;
1413 case P_LEAF|P_SUBP: type = "Sub-page"; break;
1414 case P_LEAF|P_LEAF2: type = "LEAF2 page"; break;
1415 case P_LEAF|P_LEAF2|P_SUBP: type = "LEAF2 sub-page"; break;
1417 fprintf(stderr, "Overflow page %"Z"u pages %u%s\n",
1418 pgno, mp->mp_pages, state);
1421 fprintf(stderr, "Meta-page %"Z"u txnid %"Z"u\n",
1422 pgno, ((MDB_meta *)METADATA(mp))->mm_txnid);
1425 fprintf(stderr, "Bad page %"Z"u flags 0x%u\n", pgno, mp->mp_flags);
1429 nkeys = NUMKEYS(mp);
1430 fprintf(stderr, "%s %"Z"u numkeys %d%s\n", type, pgno, nkeys, state);
1432 for (i=0; i<nkeys; i++) {
1433 if (IS_LEAF2(mp)) { /* LEAF2 pages have no mp_ptrs[] or node headers */
1434 key.mv_size = nsize = mp->mp_pad;
1435 key.mv_data = LEAF2KEY(mp, i, nsize);
1437 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1440 node = NODEPTR(mp, i);
1441 key.mv_size = node->mn_ksize;
1442 key.mv_data = node->mn_data;
1443 nsize = NODESIZE + key.mv_size;
1444 if (IS_BRANCH(mp)) {
1445 fprintf(stderr, "key %d: page %"Z"u, %s\n", i, NODEPGNO(node),
1449 if (F_ISSET(node->mn_flags, F_BIGDATA))
1450 nsize += sizeof(pgno_t);
1452 nsize += NODEDSZ(node);
1454 nsize += sizeof(indx_t);
1455 fprintf(stderr, "key %d: nsize %d, %s%s\n",
1456 i, nsize, DKEY(&key), mdb_leafnode_type(node));
1458 total = EVEN(total);
1460 fprintf(stderr, "Total: header %d + contents %d + unused %d\n",
1461 IS_LEAF2(mp) ? PAGEHDRSZ : PAGEBASE + mp->mp_lower, total, SIZELEFT(mp));
1465 mdb_cursor_chk(MDB_cursor *mc)
1471 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1472 for (i=0; i<mc->mc_top; i++) {
1474 node = NODEPTR(mp, mc->mc_ki[i]);
1475 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1478 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1484 /** Count all the pages in each DB and in the freelist
1485 * and make sure it matches the actual number of pages
1487 * All named DBs must be open for a correct count.
1489 static void mdb_audit(MDB_txn *txn)
1493 MDB_ID freecount, count;
1498 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1499 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1500 freecount += *(MDB_ID *)data.mv_data;
1501 mdb_tassert(txn, rc == MDB_NOTFOUND);
1504 for (i = 0; i<txn->mt_numdbs; i++) {
1506 if (!(txn->mt_dbflags[i] & DB_VALID))
1508 mdb_cursor_init(&mc, txn, i, &mx);
1509 if (txn->mt_dbs[i].md_root == P_INVALID)
1511 count += txn->mt_dbs[i].md_branch_pages +
1512 txn->mt_dbs[i].md_leaf_pages +
1513 txn->mt_dbs[i].md_overflow_pages;
1514 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1515 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST);
1516 for (; rc == MDB_SUCCESS; rc = mdb_cursor_sibling(&mc, 1)) {
1519 mp = mc.mc_pg[mc.mc_top];
1520 for (j=0; j<NUMKEYS(mp); j++) {
1521 MDB_node *leaf = NODEPTR(mp, j);
1522 if (leaf->mn_flags & F_SUBDATA) {
1524 memcpy(&db, NODEDATA(leaf), sizeof(db));
1525 count += db.md_branch_pages + db.md_leaf_pages +
1526 db.md_overflow_pages;
1530 mdb_tassert(txn, rc == MDB_NOTFOUND);
1533 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1534 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1535 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1541 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1543 return txn->mt_dbxs[dbi].md_cmp(a, b);
1547 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1549 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1552 /** Allocate memory for a page.
1553 * Re-use old malloc'd pages first for singletons, otherwise just malloc.
1556 mdb_page_malloc(MDB_txn *txn, unsigned num)
1558 MDB_env *env = txn->mt_env;
1559 MDB_page *ret = env->me_dpages;
1560 size_t psize = env->me_psize, sz = psize, off;
1561 /* For ! #MDB_NOMEMINIT, psize counts how much to init.
1562 * For a single page alloc, we init everything after the page header.
1563 * For multi-page, we init the final page; if the caller needed that
1564 * many pages they will be filling in at least up to the last page.
1568 VGMEMP_ALLOC(env, ret, sz);
1569 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1570 env->me_dpages = ret->mp_next;
1573 psize -= off = PAGEHDRSZ;
1578 if ((ret = malloc(sz)) != NULL) {
1579 VGMEMP_ALLOC(env, ret, sz);
1580 if (!(env->me_flags & MDB_NOMEMINIT)) {
1581 memset((char *)ret + off, 0, psize);
1585 txn->mt_flags |= MDB_TXN_ERROR;
1589 /** Free a single page.
1590 * Saves single pages to a list, for future reuse.
1591 * (This is not used for multi-page overflow pages.)
1594 mdb_page_free(MDB_env *env, MDB_page *mp)
1596 mp->mp_next = env->me_dpages;
1597 VGMEMP_FREE(env, mp);
1598 env->me_dpages = mp;
1601 /** Free a dirty page */
1603 mdb_dpage_free(MDB_env *env, MDB_page *dp)
1605 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1606 mdb_page_free(env, dp);
1608 /* large pages just get freed directly */
1609 VGMEMP_FREE(env, dp);
1614 /** Return all dirty pages to dpage list */
1616 mdb_dlist_free(MDB_txn *txn)
1618 MDB_env *env = txn->mt_env;
1619 MDB_ID2L dl = txn->mt_u.dirty_list;
1620 unsigned i, n = dl[0].mid;
1622 for (i = 1; i <= n; i++) {
1623 mdb_dpage_free(env, dl[i].mptr);
1628 /** Loosen or free a single page.
1629 * Saves single pages to a list for future reuse
1630 * in this same txn. It has been pulled from the freeDB
1631 * and already resides on the dirty list, but has been
1632 * deleted. Use these pages first before pulling again
1635 * If the page wasn't dirtied in this txn, just add it
1636 * to this txn's free list.
1639 mdb_page_loose(MDB_cursor *mc, MDB_page *mp)
1642 pgno_t pgno = mp->mp_pgno;
1643 MDB_txn *txn = mc->mc_txn;
1645 if ((mp->mp_flags & P_DIRTY) && mc->mc_dbi != FREE_DBI) {
1646 if (txn->mt_parent) {
1647 MDB_ID2 *dl = txn->mt_u.dirty_list;
1648 /* If txn has a parent, make sure the page is in our
1652 unsigned x = mdb_mid2l_search(dl, pgno);
1653 if (x <= dl[0].mid && dl[x].mid == pgno) {
1654 if (mp != dl[x].mptr) { /* bad cursor? */
1655 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
1656 txn->mt_flags |= MDB_TXN_ERROR;
1657 return MDB_CORRUPTED;
1664 /* no parent txn, so it's just ours */
1669 DPRINTF(("loosen db %d page %"Z"u", DDBI(mc),
1671 NEXT_LOOSE_PAGE(mp) = txn->mt_loose_pgs;
1672 txn->mt_loose_pgs = mp;
1673 txn->mt_loose_count++;
1674 mp->mp_flags |= P_LOOSE;
1676 int rc = mdb_midl_append(&txn->mt_free_pgs, pgno);
1684 /** Set or clear P_KEEP in dirty, non-overflow, non-sub pages watched by txn.
1685 * @param[in] mc A cursor handle for the current operation.
1686 * @param[in] pflags Flags of the pages to update:
1687 * P_DIRTY to set P_KEEP, P_DIRTY|P_KEEP to clear it.
1688 * @param[in] all No shortcuts. Needed except after a full #mdb_page_flush().
1689 * @return 0 on success, non-zero on failure.
1692 mdb_pages_xkeep(MDB_cursor *mc, unsigned pflags, int all)
1694 enum { Mask = P_SUBP|P_DIRTY|P_LOOSE|P_KEEP };
1695 MDB_txn *txn = mc->mc_txn;
1701 int rc = MDB_SUCCESS, level;
1703 /* Mark pages seen by cursors */
1704 if (mc->mc_flags & C_UNTRACK)
1705 mc = NULL; /* will find mc in mt_cursors */
1706 for (i = txn->mt_numdbs;; mc = txn->mt_cursors[--i]) {
1707 for (; mc; mc=mc->mc_next) {
1708 if (!(mc->mc_flags & C_INITIALIZED))
1710 for (m3 = mc;; m3 = &mx->mx_cursor) {
1712 for (j=0; j<m3->mc_snum; j++) {
1714 if ((mp->mp_flags & Mask) == pflags)
1715 mp->mp_flags ^= P_KEEP;
1717 mx = m3->mc_xcursor;
1718 /* Proceed to mx if it is at a sub-database */
1719 if (! (mx && (mx->mx_cursor.mc_flags & C_INITIALIZED)))
1721 if (! (mp && (mp->mp_flags & P_LEAF)))
1723 leaf = NODEPTR(mp, m3->mc_ki[j-1]);
1724 if (!(leaf->mn_flags & F_SUBDATA))
1733 /* Mark dirty root pages */
1734 for (i=0; i<txn->mt_numdbs; i++) {
1735 if (txn->mt_dbflags[i] & DB_DIRTY) {
1736 pgno_t pgno = txn->mt_dbs[i].md_root;
1737 if (pgno == P_INVALID)
1739 if ((rc = mdb_page_get(txn, pgno, &dp, &level)) != MDB_SUCCESS)
1741 if ((dp->mp_flags & Mask) == pflags && level <= 1)
1742 dp->mp_flags ^= P_KEEP;
1750 static int mdb_page_flush(MDB_txn *txn, int keep);
1752 /** Spill pages from the dirty list back to disk.
1753 * This is intended to prevent running into #MDB_TXN_FULL situations,
1754 * but note that they may still occur in a few cases:
1755 * 1) our estimate of the txn size could be too small. Currently this
1756 * seems unlikely, except with a large number of #MDB_MULTIPLE items.
1757 * 2) child txns may run out of space if their parents dirtied a
1758 * lot of pages and never spilled them. TODO: we probably should do
1759 * a preemptive spill during #mdb_txn_begin() of a child txn, if
1760 * the parent's dirty_room is below a given threshold.
1762 * Otherwise, if not using nested txns, it is expected that apps will
1763 * not run into #MDB_TXN_FULL any more. The pages are flushed to disk
1764 * the same way as for a txn commit, e.g. their P_DIRTY flag is cleared.
1765 * If the txn never references them again, they can be left alone.
1766 * If the txn only reads them, they can be used without any fuss.
1767 * If the txn writes them again, they can be dirtied immediately without
1768 * going thru all of the work of #mdb_page_touch(). Such references are
1769 * handled by #mdb_page_unspill().
1771 * Also note, we never spill DB root pages, nor pages of active cursors,
1772 * because we'll need these back again soon anyway. And in nested txns,
1773 * we can't spill a page in a child txn if it was already spilled in a
1774 * parent txn. That would alter the parent txns' data even though
1775 * the child hasn't committed yet, and we'd have no way to undo it if
1776 * the child aborted.
1778 * @param[in] m0 cursor A cursor handle identifying the transaction and
1779 * database for which we are checking space.
1780 * @param[in] key For a put operation, the key being stored.
1781 * @param[in] data For a put operation, the data being stored.
1782 * @return 0 on success, non-zero on failure.
1785 mdb_page_spill(MDB_cursor *m0, MDB_val *key, MDB_val *data)
1787 MDB_txn *txn = m0->mc_txn;
1789 MDB_ID2L dl = txn->mt_u.dirty_list;
1790 unsigned int i, j, need;
1793 if (m0->mc_flags & C_SUB)
1796 /* Estimate how much space this op will take */
1797 i = m0->mc_db->md_depth;
1798 /* Named DBs also dirty the main DB */
1799 if (m0->mc_dbi > MAIN_DBI)
1800 i += txn->mt_dbs[MAIN_DBI].md_depth;
1801 /* For puts, roughly factor in the key+data size */
1803 i += (LEAFSIZE(key, data) + txn->mt_env->me_psize) / txn->mt_env->me_psize;
1804 i += i; /* double it for good measure */
1807 if (txn->mt_dirty_room > i)
1810 if (!txn->mt_spill_pgs) {
1811 txn->mt_spill_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX);
1812 if (!txn->mt_spill_pgs)
1815 /* purge deleted slots */
1816 MDB_IDL sl = txn->mt_spill_pgs;
1817 unsigned int num = sl[0];
1819 for (i=1; i<=num; i++) {
1826 /* Preserve pages which may soon be dirtied again */
1827 if ((rc = mdb_pages_xkeep(m0, P_DIRTY, 1)) != MDB_SUCCESS)
1830 /* Less aggressive spill - we originally spilled the entire dirty list,
1831 * with a few exceptions for cursor pages and DB root pages. But this
1832 * turns out to be a lot of wasted effort because in a large txn many
1833 * of those pages will need to be used again. So now we spill only 1/8th
1834 * of the dirty pages. Testing revealed this to be a good tradeoff,
1835 * better than 1/2, 1/4, or 1/10.
1837 if (need < MDB_IDL_UM_MAX / 8)
1838 need = MDB_IDL_UM_MAX / 8;
1840 /* Save the page IDs of all the pages we're flushing */
1841 /* flush from the tail forward, this saves a lot of shifting later on. */
1842 for (i=dl[0].mid; i && need; i--) {
1843 MDB_ID pn = dl[i].mid << 1;
1845 if (dp->mp_flags & (P_LOOSE|P_KEEP))
1847 /* Can't spill twice, make sure it's not already in a parent's
1850 if (txn->mt_parent) {
1852 for (tx2 = txn->mt_parent; tx2; tx2 = tx2->mt_parent) {
1853 if (tx2->mt_spill_pgs) {
1854 j = mdb_midl_search(tx2->mt_spill_pgs, pn);
1855 if (j <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[j] == pn) {
1856 dp->mp_flags |= P_KEEP;
1864 if ((rc = mdb_midl_append(&txn->mt_spill_pgs, pn)))
1868 mdb_midl_sort(txn->mt_spill_pgs);
1870 /* Flush the spilled part of dirty list */
1871 if ((rc = mdb_page_flush(txn, i)) != MDB_SUCCESS)
1874 /* Reset any dirty pages we kept that page_flush didn't see */
1875 rc = mdb_pages_xkeep(m0, P_DIRTY|P_KEEP, i);
1878 txn->mt_flags |= rc ? MDB_TXN_ERROR : MDB_TXN_SPILLS;
1882 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
1884 mdb_find_oldest(MDB_txn *txn)
1887 txnid_t mr, oldest = txn->mt_txnid - 1;
1888 if (txn->mt_env->me_txns) {
1889 MDB_reader *r = txn->mt_env->me_txns->mti_readers;
1890 for (i = txn->mt_env->me_txns->mti_numreaders; --i >= 0; ) {
1901 /** Add a page to the txn's dirty list */
1903 mdb_page_dirty(MDB_txn *txn, MDB_page *mp)
1906 int rc, (*insert)(MDB_ID2L, MDB_ID2 *);
1908 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1909 insert = mdb_mid2l_append;
1911 insert = mdb_mid2l_insert;
1913 mid.mid = mp->mp_pgno;
1915 rc = insert(txn->mt_u.dirty_list, &mid);
1916 mdb_tassert(txn, rc == 0);
1917 txn->mt_dirty_room--;
1920 /** Allocate page numbers and memory for writing. Maintain me_pglast,
1921 * me_pghead and mt_next_pgno.
1923 * If there are free pages available from older transactions, they
1924 * are re-used first. Otherwise allocate a new page at mt_next_pgno.
1925 * Do not modify the freedB, just merge freeDB records into me_pghead[]
1926 * and move me_pglast to say which records were consumed. Only this
1927 * function can create me_pghead and move me_pglast/mt_next_pgno.
1928 * @param[in] mc cursor A cursor handle identifying the transaction and
1929 * database for which we are allocating.
1930 * @param[in] num the number of pages to allocate.
1931 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1932 * will always be satisfied by a single contiguous chunk of memory.
1933 * @return 0 on success, non-zero on failure.
1936 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1938 #ifdef MDB_PARANOID /* Seems like we can ignore this now */
1939 /* Get at most <Max_retries> more freeDB records once me_pghead
1940 * has enough pages. If not enough, use new pages from the map.
1941 * If <Paranoid> and mc is updating the freeDB, only get new
1942 * records if me_pghead is empty. Then the freelist cannot play
1943 * catch-up with itself by growing while trying to save it.
1945 enum { Paranoid = 1, Max_retries = 500 };
1947 enum { Paranoid = 0, Max_retries = INT_MAX /*infinite*/ };
1949 int rc, retry = num * 20;
1950 MDB_txn *txn = mc->mc_txn;
1951 MDB_env *env = txn->mt_env;
1952 pgno_t pgno, *mop = env->me_pghead;
1953 unsigned i, j, mop_len = mop ? mop[0] : 0, n2 = num-1;
1955 txnid_t oldest = 0, last;
1959 /* If there are any loose pages, just use them */
1960 if (num == 1 && txn->mt_loose_pgs) {
1961 np = txn->mt_loose_pgs;
1962 txn->mt_loose_pgs = NEXT_LOOSE_PAGE(np);
1963 txn->mt_loose_count--;
1964 DPRINTF(("db %d use loose page %"Z"u", DDBI(mc),
1972 /* If our dirty list is already full, we can't do anything */
1973 if (txn->mt_dirty_room == 0) {
1978 for (op = MDB_FIRST;; op = MDB_NEXT) {
1983 /* Seek a big enough contiguous page range. Prefer
1984 * pages at the tail, just truncating the list.
1990 if (mop[i-n2] == pgno+n2)
1997 if (op == MDB_FIRST) { /* 1st iteration */
1998 /* Prepare to fetch more and coalesce */
1999 oldest = mdb_find_oldest(txn);
2000 last = env->me_pglast;
2001 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
2004 key.mv_data = &last; /* will look up last+1 */
2005 key.mv_size = sizeof(last);
2007 if (Paranoid && mc->mc_dbi == FREE_DBI)
2010 if (Paranoid && retry < 0 && mop_len)
2014 /* Do not fetch more if the record will be too recent */
2017 rc = mdb_cursor_get(&m2, &key, NULL, op);
2019 if (rc == MDB_NOTFOUND)
2023 last = *(txnid_t*)key.mv_data;
2026 np = m2.mc_pg[m2.mc_top];
2027 leaf = NODEPTR(np, m2.mc_ki[m2.mc_top]);
2028 if ((rc = mdb_node_read(txn, leaf, &data)) != MDB_SUCCESS)
2031 idl = (MDB_ID *) data.mv_data;
2034 if (!(env->me_pghead = mop = mdb_midl_alloc(i))) {
2039 if ((rc = mdb_midl_need(&env->me_pghead, i)) != 0)
2041 mop = env->me_pghead;
2043 env->me_pglast = last;
2045 DPRINTF(("IDL read txn %"Z"u root %"Z"u num %u",
2046 last, txn->mt_dbs[FREE_DBI].md_root, i));
2048 DPRINTF(("IDL %"Z"u", idl[j]));
2050 /* Merge in descending sorted order */
2051 mdb_midl_xmerge(mop, idl);
2055 /* Use new pages from the map when nothing suitable in the freeDB */
2057 pgno = txn->mt_next_pgno;
2058 if (pgno + num >= env->me_maxpg) {
2059 DPUTS("DB size maxed out");
2065 if (env->me_flags & MDB_WRITEMAP) {
2066 np = (MDB_page *)(env->me_map + env->me_psize * pgno);
2068 if (!(np = mdb_page_malloc(txn, num))) {
2074 mop[0] = mop_len -= num;
2075 /* Move any stragglers down */
2076 for (j = i-num; j < mop_len; )
2077 mop[++j] = mop[++i];
2079 txn->mt_next_pgno = pgno + num;
2082 mdb_page_dirty(txn, np);
2088 txn->mt_flags |= MDB_TXN_ERROR;
2092 /** Copy the used portions of a non-overflow page.
2093 * @param[in] dst page to copy into
2094 * @param[in] src page to copy from
2095 * @param[in] psize size of a page
2098 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
2100 enum { Align = sizeof(pgno_t) };
2101 indx_t upper = src->mp_upper, lower = src->mp_lower, unused = upper-lower;
2103 /* If page isn't full, just copy the used portion. Adjust
2104 * alignment so memcpy may copy words instead of bytes.
2106 if ((unused &= -Align) && !IS_LEAF2(src)) {
2107 upper = (upper + PAGEBASE) & -Align;
2108 memcpy(dst, src, (lower + PAGEBASE + (Align-1)) & -Align);
2109 memcpy((pgno_t *)((char *)dst+upper), (pgno_t *)((char *)src+upper),
2112 memcpy(dst, src, psize - unused);
2116 /** Pull a page off the txn's spill list, if present.
2117 * If a page being referenced was spilled to disk in this txn, bring
2118 * it back and make it dirty/writable again.
2119 * @param[in] txn the transaction handle.
2120 * @param[in] mp the page being referenced. It must not be dirty.
2121 * @param[out] ret the writable page, if any. ret is unchanged if
2122 * mp wasn't spilled.
2125 mdb_page_unspill(MDB_txn *txn, MDB_page *mp, MDB_page **ret)
2127 MDB_env *env = txn->mt_env;
2130 pgno_t pgno = mp->mp_pgno, pn = pgno << 1;
2132 for (tx2 = txn; tx2; tx2=tx2->mt_parent) {
2133 if (!tx2->mt_spill_pgs)
2135 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
2136 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
2139 if (txn->mt_dirty_room == 0)
2140 return MDB_TXN_FULL;
2141 if (IS_OVERFLOW(mp))
2145 if (env->me_flags & MDB_WRITEMAP) {
2148 np = mdb_page_malloc(txn, num);
2152 memcpy(np, mp, num * env->me_psize);
2154 mdb_page_copy(np, mp, env->me_psize);
2157 /* If in current txn, this page is no longer spilled.
2158 * If it happens to be the last page, truncate the spill list.
2159 * Otherwise mark it as deleted by setting the LSB.
2161 if (x == txn->mt_spill_pgs[0])
2162 txn->mt_spill_pgs[0]--;
2164 txn->mt_spill_pgs[x] |= 1;
2165 } /* otherwise, if belonging to a parent txn, the
2166 * page remains spilled until child commits
2169 mdb_page_dirty(txn, np);
2170 np->mp_flags |= P_DIRTY;
2178 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
2179 * @param[in] mc cursor pointing to the page to be touched
2180 * @return 0 on success, non-zero on failure.
2183 mdb_page_touch(MDB_cursor *mc)
2185 MDB_page *mp = mc->mc_pg[mc->mc_top], *np;
2186 MDB_txn *txn = mc->mc_txn;
2187 MDB_cursor *m2, *m3;
2191 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
2192 if (txn->mt_flags & MDB_TXN_SPILLS) {
2194 rc = mdb_page_unspill(txn, mp, &np);
2200 if ((rc = mdb_midl_need(&txn->mt_free_pgs, 1)) ||
2201 (rc = mdb_page_alloc(mc, 1, &np)))
2204 DPRINTF(("touched db %d page %"Z"u -> %"Z"u", DDBI(mc),
2205 mp->mp_pgno, pgno));
2206 mdb_cassert(mc, mp->mp_pgno != pgno);
2207 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
2208 /* Update the parent page, if any, to point to the new page */
2210 MDB_page *parent = mc->mc_pg[mc->mc_top-1];
2211 MDB_node *node = NODEPTR(parent, mc->mc_ki[mc->mc_top-1]);
2212 SETPGNO(node, pgno);
2214 mc->mc_db->md_root = pgno;
2216 } else if (txn->mt_parent && !IS_SUBP(mp)) {
2217 MDB_ID2 mid, *dl = txn->mt_u.dirty_list;
2219 /* If txn has a parent, make sure the page is in our
2223 unsigned x = mdb_mid2l_search(dl, pgno);
2224 if (x <= dl[0].mid && dl[x].mid == pgno) {
2225 if (mp != dl[x].mptr) { /* bad cursor? */
2226 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
2227 txn->mt_flags |= MDB_TXN_ERROR;
2228 return MDB_CORRUPTED;
2233 mdb_cassert(mc, dl[0].mid < MDB_IDL_UM_MAX);
2235 np = mdb_page_malloc(txn, 1);
2240 rc = mdb_mid2l_insert(dl, &mid);
2241 mdb_cassert(mc, rc == 0);
2246 mdb_page_copy(np, mp, txn->mt_env->me_psize);
2248 np->mp_flags |= P_DIRTY;
2251 /* Adjust cursors pointing to mp */
2252 mc->mc_pg[mc->mc_top] = np;
2253 m2 = txn->mt_cursors[mc->mc_dbi];
2254 if (mc->mc_flags & C_SUB) {
2255 for (; m2; m2=m2->mc_next) {
2256 m3 = &m2->mc_xcursor->mx_cursor;
2257 if (m3->mc_snum < mc->mc_snum) continue;
2258 if (m3->mc_pg[mc->mc_top] == mp)
2259 m3->mc_pg[mc->mc_top] = np;
2262 for (; m2; m2=m2->mc_next) {
2263 if (m2->mc_snum < mc->mc_snum) continue;
2264 if (m2->mc_pg[mc->mc_top] == mp) {
2265 m2->mc_pg[mc->mc_top] = np;
2266 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
2268 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
2270 MDB_node *leaf = NODEPTR(np, mc->mc_ki[mc->mc_top]);
2271 if (!(leaf->mn_flags & F_SUBDATA))
2272 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
2280 txn->mt_flags |= MDB_TXN_ERROR;
2285 mdb_env_sync(MDB_env *env, int force)
2288 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
2289 if (env->me_flags & MDB_WRITEMAP) {
2290 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
2291 ? MS_ASYNC : MS_SYNC;
2292 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
2295 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
2299 if (MDB_FDATASYNC(env->me_fd))
2306 /** Back up parent txn's cursors, then grab the originals for tracking */
2308 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
2310 MDB_cursor *mc, *bk;
2315 for (i = src->mt_numdbs; --i >= 0; ) {
2316 if ((mc = src->mt_cursors[i]) != NULL) {
2317 size = sizeof(MDB_cursor);
2319 size += sizeof(MDB_xcursor);
2320 for (; mc; mc = bk->mc_next) {
2326 mc->mc_db = &dst->mt_dbs[i];
2327 /* Kill pointers into src - and dst to reduce abuse: The
2328 * user may not use mc until dst ends. Otherwise we'd...
2330 mc->mc_txn = NULL; /* ...set this to dst */
2331 mc->mc_dbflag = NULL; /* ...and &dst->mt_dbflags[i] */
2332 if ((mx = mc->mc_xcursor) != NULL) {
2333 *(MDB_xcursor *)(bk+1) = *mx;
2334 mx->mx_cursor.mc_txn = NULL; /* ...and dst. */
2336 mc->mc_next = dst->mt_cursors[i];
2337 dst->mt_cursors[i] = mc;
2344 /** Close this write txn's cursors, give parent txn's cursors back to parent.
2345 * @param[in] txn the transaction handle.
2346 * @param[in] merge true to keep changes to parent cursors, false to revert.
2347 * @return 0 on success, non-zero on failure.
2350 mdb_cursors_close(MDB_txn *txn, unsigned merge)
2352 MDB_cursor **cursors = txn->mt_cursors, *mc, *next, *bk;
2356 for (i = txn->mt_numdbs; --i >= 0; ) {
2357 for (mc = cursors[i]; mc; mc = next) {
2359 if ((bk = mc->mc_backup) != NULL) {
2361 /* Commit changes to parent txn */
2362 mc->mc_next = bk->mc_next;
2363 mc->mc_backup = bk->mc_backup;
2364 mc->mc_txn = bk->mc_txn;
2365 mc->mc_db = bk->mc_db;
2366 mc->mc_dbflag = bk->mc_dbflag;
2367 if ((mx = mc->mc_xcursor) != NULL)
2368 mx->mx_cursor.mc_txn = bk->mc_txn;
2370 /* Abort nested txn */
2372 if ((mx = mc->mc_xcursor) != NULL)
2373 *mx = *(MDB_xcursor *)(bk+1);
2377 /* Only malloced cursors are permanently tracked. */
2385 #define mdb_txn_reset0(txn, act) mdb_txn_reset0(txn)
2388 mdb_txn_reset0(MDB_txn *txn, const char *act);
2390 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2396 Pidset = F_SETLK, Pidcheck = F_GETLK
2400 /** Set or check a pid lock. Set returns 0 on success.
2401 * Check returns 0 if the process is certainly dead, nonzero if it may
2402 * be alive (the lock exists or an error happened so we do not know).
2404 * On Windows Pidset is a no-op, we merely check for the existence
2405 * of the process with the given pid. On POSIX we use a single byte
2406 * lock on the lockfile, set at an offset equal to the pid.
2409 mdb_reader_pid(MDB_env *env, enum Pidlock_op op, MDB_PID_T pid)
2411 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2414 if (op == Pidcheck) {
2415 h = OpenProcess(env->me_pidquery, FALSE, pid);
2416 /* No documented "no such process" code, but other program use this: */
2418 return ErrCode() != ERROR_INVALID_PARAMETER;
2419 /* A process exists until all handles to it close. Has it exited? */
2420 ret = WaitForSingleObject(h, 0) != 0;
2427 struct flock lock_info;
2428 memset(&lock_info, 0, sizeof(lock_info));
2429 lock_info.l_type = F_WRLCK;
2430 lock_info.l_whence = SEEK_SET;
2431 lock_info.l_start = pid;
2432 lock_info.l_len = 1;
2433 if ((rc = fcntl(env->me_lfd, op, &lock_info)) == 0) {
2434 if (op == F_GETLK && lock_info.l_type != F_UNLCK)
2436 } else if ((rc = ErrCode()) == EINTR) {
2444 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
2445 * @param[in] txn the transaction handle to initialize
2446 * @return 0 on success, non-zero on failure.
2449 mdb_txn_renew0(MDB_txn *txn)
2451 MDB_env *env = txn->mt_env;
2452 MDB_txninfo *ti = env->me_txns;
2456 int rc, new_notls = 0;
2459 txn->mt_numdbs = env->me_numdbs;
2460 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
2462 if (txn->mt_flags & MDB_TXN_RDONLY) {
2464 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2465 txn->mt_txnid = meta->mm_txnid;
2466 txn->mt_u.reader = NULL;
2468 MDB_reader *r = (env->me_flags & MDB_NOTLS) ? txn->mt_u.reader :
2469 pthread_getspecific(env->me_txkey);
2471 if (r->mr_pid != env->me_pid || r->mr_txnid != (txnid_t)-1)
2472 return MDB_BAD_RSLOT;
2474 MDB_PID_T pid = env->me_pid;
2475 MDB_THR_T tid = pthread_self();
2477 if (!env->me_live_reader) {
2478 rc = mdb_reader_pid(env, Pidset, pid);
2481 env->me_live_reader = 1;
2485 nr = ti->mti_numreaders;
2486 for (i=0; i<nr; i++)
2487 if (ti->mti_readers[i].mr_pid == 0)
2489 if (i == env->me_maxreaders) {
2490 UNLOCK_MUTEX_R(env);
2491 return MDB_READERS_FULL;
2493 ti->mti_readers[i].mr_pid = pid;
2494 ti->mti_readers[i].mr_tid = tid;
2496 ti->mti_numreaders = ++nr;
2497 /* Save numreaders for un-mutexed mdb_env_close() */
2498 env->me_numreaders = nr;
2499 UNLOCK_MUTEX_R(env);
2501 r = &ti->mti_readers[i];
2502 new_notls = (env->me_flags & MDB_NOTLS);
2503 if (!new_notls && (rc=pthread_setspecific(env->me_txkey, r))) {
2508 txn->mt_txnid = r->mr_txnid = ti->mti_txnid;
2509 txn->mt_u.reader = r;
2510 meta = env->me_metas[txn->mt_txnid & 1];
2516 txn->mt_txnid = ti->mti_txnid;
2517 meta = env->me_metas[txn->mt_txnid & 1];
2519 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2520 txn->mt_txnid = meta->mm_txnid;
2524 if (txn->mt_txnid == mdb_debug_start)
2527 txn->mt_dirty_room = MDB_IDL_UM_MAX;
2528 txn->mt_u.dirty_list = env->me_dirty_list;
2529 txn->mt_u.dirty_list[0].mid = 0;
2530 txn->mt_free_pgs = env->me_free_pgs;
2531 txn->mt_free_pgs[0] = 0;
2532 txn->mt_spill_pgs = NULL;
2534 memcpy(txn->mt_dbiseqs, env->me_dbiseqs, env->me_maxdbs * sizeof(unsigned int));
2537 /* Copy the DB info and flags */
2538 memcpy(txn->mt_dbs, meta->mm_dbs, 2 * sizeof(MDB_db));
2540 /* Moved to here to avoid a data race in read TXNs */
2541 txn->mt_next_pgno = meta->mm_last_pg+1;
2543 for (i=2; i<txn->mt_numdbs; i++) {
2544 x = env->me_dbflags[i];
2545 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
2546 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_STALE : 0;
2548 txn->mt_dbflags[0] = txn->mt_dbflags[1] = DB_VALID;
2550 if (env->me_maxpg < txn->mt_next_pgno) {
2551 mdb_txn_reset0(txn, "renew0-mapfail");
2553 txn->mt_u.reader->mr_pid = 0;
2554 txn->mt_u.reader = NULL;
2556 return MDB_MAP_RESIZED;
2563 mdb_txn_renew(MDB_txn *txn)
2567 if (!txn || txn->mt_dbxs) /* A reset txn has mt_dbxs==NULL */
2570 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
2571 DPUTS("environment had fatal error, must shutdown!");
2575 rc = mdb_txn_renew0(txn);
2576 if (rc == MDB_SUCCESS) {
2577 DPRINTF(("renew txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2578 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2579 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root));
2585 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
2589 int rc, size, tsize = sizeof(MDB_txn);
2591 if (env->me_flags & MDB_FATAL_ERROR) {
2592 DPUTS("environment had fatal error, must shutdown!");
2595 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
2598 /* Nested transactions: Max 1 child, write txns only, no writemap */
2599 if (parent->mt_child ||
2600 (flags & MDB_RDONLY) ||
2601 (parent->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR)) ||
2602 (env->me_flags & MDB_WRITEMAP))
2604 return (parent->mt_flags & MDB_TXN_RDONLY) ? EINVAL : MDB_BAD_TXN;
2606 tsize = sizeof(MDB_ntxn);
2608 size = tsize + env->me_maxdbs * (sizeof(MDB_db)+1);
2609 if (!(flags & MDB_RDONLY)) {
2610 size += env->me_maxdbs * sizeof(MDB_cursor *);
2611 /* child txns use parent's dbiseqs */
2613 size += env->me_maxdbs * sizeof(unsigned int);
2616 if ((txn = calloc(1, size)) == NULL) {
2617 DPRINTF(("calloc: %s", strerror(errno)));
2620 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
2621 if (flags & MDB_RDONLY) {
2622 txn->mt_flags |= MDB_TXN_RDONLY;
2623 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
2624 txn->mt_dbiseqs = env->me_dbiseqs;
2626 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
2628 txn->mt_dbiseqs = parent->mt_dbiseqs;
2629 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
2631 txn->mt_dbiseqs = (unsigned int *)(txn->mt_cursors + env->me_maxdbs);
2632 txn->mt_dbflags = (unsigned char *)(txn->mt_dbiseqs + env->me_maxdbs);
2639 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
2640 if (!txn->mt_u.dirty_list ||
2641 !(txn->mt_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)))
2643 free(txn->mt_u.dirty_list);
2647 txn->mt_txnid = parent->mt_txnid;
2648 txn->mt_dirty_room = parent->mt_dirty_room;
2649 txn->mt_u.dirty_list[0].mid = 0;
2650 txn->mt_spill_pgs = NULL;
2651 txn->mt_next_pgno = parent->mt_next_pgno;
2652 parent->mt_child = txn;
2653 txn->mt_parent = parent;
2654 txn->mt_numdbs = parent->mt_numdbs;
2655 txn->mt_flags = parent->mt_flags;
2656 txn->mt_dbxs = parent->mt_dbxs;
2657 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2658 /* Copy parent's mt_dbflags, but clear DB_NEW */
2659 for (i=0; i<txn->mt_numdbs; i++)
2660 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
2662 ntxn = (MDB_ntxn *)txn;
2663 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
2664 if (env->me_pghead) {
2665 size = MDB_IDL_SIZEOF(env->me_pghead);
2666 env->me_pghead = mdb_midl_alloc(env->me_pghead[0]);
2668 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
2673 rc = mdb_cursor_shadow(parent, txn);
2675 mdb_txn_reset0(txn, "beginchild-fail");
2677 rc = mdb_txn_renew0(txn);
2683 DPRINTF(("begin txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2684 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2685 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root));
2692 mdb_txn_env(MDB_txn *txn)
2694 if(!txn) return NULL;
2698 /** Export or close DBI handles opened in this txn. */
2700 mdb_dbis_update(MDB_txn *txn, int keep)
2703 MDB_dbi n = txn->mt_numdbs;
2704 MDB_env *env = txn->mt_env;
2705 unsigned char *tdbflags = txn->mt_dbflags;
2707 for (i = n; --i >= 2;) {
2708 if (tdbflags[i] & DB_NEW) {
2710 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2712 char *ptr = env->me_dbxs[i].md_name.mv_data;
2714 env->me_dbxs[i].md_name.mv_data = NULL;
2715 env->me_dbxs[i].md_name.mv_size = 0;
2716 env->me_dbflags[i] = 0;
2717 env->me_dbiseqs[i]++;
2723 if (keep && env->me_numdbs < n)
2727 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
2728 * May be called twice for readonly txns: First reset it, then abort.
2729 * @param[in] txn the transaction handle to reset
2730 * @param[in] act why the transaction is being reset
2733 mdb_txn_reset0(MDB_txn *txn, const char *act)
2735 MDB_env *env = txn->mt_env;
2737 /* Close any DBI handles opened in this txn */
2738 mdb_dbis_update(txn, 0);
2740 DPRINTF(("%s txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2741 act, txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2742 (void *) txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root));
2744 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2745 if (txn->mt_u.reader) {
2746 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
2747 if (!(env->me_flags & MDB_NOTLS))
2748 txn->mt_u.reader = NULL; /* txn does not own reader */
2750 txn->mt_numdbs = 0; /* close nothing if called again */
2751 txn->mt_dbxs = NULL; /* mark txn as reset */
2753 mdb_cursors_close(txn, 0);
2755 if (!(env->me_flags & MDB_WRITEMAP)) {
2756 mdb_dlist_free(txn);
2758 mdb_midl_free(env->me_pghead);
2760 if (txn->mt_parent) {
2761 txn->mt_parent->mt_child = NULL;
2762 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2763 mdb_midl_free(txn->mt_free_pgs);
2764 mdb_midl_free(txn->mt_spill_pgs);
2765 free(txn->mt_u.dirty_list);
2769 if (mdb_midl_shrink(&txn->mt_free_pgs))
2770 env->me_free_pgs = txn->mt_free_pgs;
2771 env->me_pghead = NULL;
2775 /* The writer mutex was locked in mdb_txn_begin. */
2777 UNLOCK_MUTEX_W(env);
2782 mdb_txn_reset(MDB_txn *txn)
2787 /* This call is only valid for read-only txns */
2788 if (!(txn->mt_flags & MDB_TXN_RDONLY))
2791 mdb_txn_reset0(txn, "reset");
2795 mdb_txn_abort(MDB_txn *txn)
2801 mdb_txn_abort(txn->mt_child);
2803 mdb_txn_reset0(txn, "abort");
2804 /* Free reader slot tied to this txn (if MDB_NOTLS && writable FS) */
2805 if ((txn->mt_flags & MDB_TXN_RDONLY) && txn->mt_u.reader)
2806 txn->mt_u.reader->mr_pid = 0;
2811 /** Save the freelist as of this transaction to the freeDB.
2812 * This changes the freelist. Keep trying until it stabilizes.
2815 mdb_freelist_save(MDB_txn *txn)
2817 /* env->me_pghead[] can grow and shrink during this call.
2818 * env->me_pglast and txn->mt_free_pgs[] can only grow.
2819 * Page numbers cannot disappear from txn->mt_free_pgs[].
2822 MDB_env *env = txn->mt_env;
2823 int rc, maxfree_1pg = env->me_maxfree_1pg, more = 1;
2824 txnid_t pglast = 0, head_id = 0;
2825 pgno_t freecnt = 0, *free_pgs, *mop;
2826 ssize_t head_room = 0, total_room = 0, mop_len, clean_limit;
2828 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2830 if (env->me_pghead) {
2831 /* Make sure first page of freeDB is touched and on freelist */
2832 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST|MDB_PS_MODIFY);
2833 if (rc && rc != MDB_NOTFOUND)
2837 if (!env->me_pghead && txn->mt_loose_pgs) {
2838 /* Put loose page numbers in mt_free_pgs, since
2839 * we may be unable to return them to me_pghead.
2841 MDB_page *mp = txn->mt_loose_pgs;
2842 if ((rc = mdb_midl_need(&txn->mt_free_pgs, txn->mt_loose_count)) != 0)
2844 for (; mp; mp = NEXT_LOOSE_PAGE(mp))
2845 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
2846 txn->mt_loose_pgs = NULL;
2847 txn->mt_loose_count = 0;
2850 /* MDB_RESERVE cancels meminit in ovpage malloc (when no WRITEMAP) */
2851 clean_limit = (env->me_flags & (MDB_NOMEMINIT|MDB_WRITEMAP))
2852 ? SSIZE_MAX : maxfree_1pg;
2855 /* Come back here after each Put() in case freelist changed */
2860 /* If using records from freeDB which we have not yet
2861 * deleted, delete them and any we reserved for me_pghead.
2863 while (pglast < env->me_pglast) {
2864 rc = mdb_cursor_first(&mc, &key, NULL);
2867 pglast = head_id = *(txnid_t *)key.mv_data;
2868 total_room = head_room = 0;
2869 mdb_tassert(txn, pglast <= env->me_pglast);
2870 rc = mdb_cursor_del(&mc, 0);
2875 /* Save the IDL of pages freed by this txn, to a single record */
2876 if (freecnt < txn->mt_free_pgs[0]) {
2878 /* Make sure last page of freeDB is touched and on freelist */
2879 rc = mdb_page_search(&mc, NULL, MDB_PS_LAST|MDB_PS_MODIFY);
2880 if (rc && rc != MDB_NOTFOUND)
2883 free_pgs = txn->mt_free_pgs;
2884 /* Write to last page of freeDB */
2885 key.mv_size = sizeof(txn->mt_txnid);
2886 key.mv_data = &txn->mt_txnid;
2888 freecnt = free_pgs[0];
2889 data.mv_size = MDB_IDL_SIZEOF(free_pgs);
2890 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2893 /* Retry if mt_free_pgs[] grew during the Put() */
2894 free_pgs = txn->mt_free_pgs;
2895 } while (freecnt < free_pgs[0]);
2896 mdb_midl_sort(free_pgs);
2897 memcpy(data.mv_data, free_pgs, data.mv_size);
2900 unsigned int i = free_pgs[0];
2901 DPRINTF(("IDL write txn %"Z"u root %"Z"u num %u",
2902 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, i));
2904 DPRINTF(("IDL %"Z"u", free_pgs[i]));
2910 mop = env->me_pghead;
2911 mop_len = (mop ? mop[0] : 0) + txn->mt_loose_count;
2913 /* Reserve records for me_pghead[]. Split it if multi-page,
2914 * to avoid searching freeDB for a page range. Use keys in
2915 * range [1,me_pglast]: Smaller than txnid of oldest reader.
2917 if (total_room >= mop_len) {
2918 if (total_room == mop_len || --more < 0)
2920 } else if (head_room >= maxfree_1pg && head_id > 1) {
2921 /* Keep current record (overflow page), add a new one */
2925 /* (Re)write {key = head_id, IDL length = head_room} */
2926 total_room -= head_room;
2927 head_room = mop_len - total_room;
2928 if (head_room > maxfree_1pg && head_id > 1) {
2929 /* Overflow multi-page for part of me_pghead */
2930 head_room /= head_id; /* amortize page sizes */
2931 head_room += maxfree_1pg - head_room % (maxfree_1pg + 1);
2932 } else if (head_room < 0) {
2933 /* Rare case, not bothering to delete this record */
2936 key.mv_size = sizeof(head_id);
2937 key.mv_data = &head_id;
2938 data.mv_size = (head_room + 1) * sizeof(pgno_t);
2939 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2942 /* IDL is initially empty, zero out at least the length */
2943 pgs = (pgno_t *)data.mv_data;
2944 j = head_room > clean_limit ? head_room : 0;
2948 total_room += head_room;
2951 /* Return loose page numbers to me_pghead, though usually none are
2952 * left at this point. The pages themselves remain in dirty_list.
2954 if (txn->mt_loose_pgs) {
2955 MDB_page *mp = txn->mt_loose_pgs;
2956 unsigned count = txn->mt_loose_count;
2958 /* Room for loose pages + temp IDL with same */
2959 if ((rc = mdb_midl_need(&env->me_pghead, 2*count+1)) != 0)
2961 mop = env->me_pghead;
2962 loose = mop + MDB_IDL_ALLOCLEN(mop) - count;
2963 for (count = 0; mp; mp = NEXT_LOOSE_PAGE(mp))
2964 loose[ ++count ] = mp->mp_pgno;
2966 mdb_midl_sort(loose);
2967 mdb_midl_xmerge(mop, loose);
2968 txn->mt_loose_pgs = NULL;
2969 txn->mt_loose_count = 0;
2973 /* Fill in the reserved me_pghead records */
2979 rc = mdb_cursor_first(&mc, &key, &data);
2980 for (; !rc; rc = mdb_cursor_next(&mc, &key, &data, MDB_NEXT)) {
2981 txnid_t id = *(txnid_t *)key.mv_data;
2982 ssize_t len = (ssize_t)(data.mv_size / sizeof(MDB_ID)) - 1;
2985 mdb_tassert(txn, len >= 0 && id <= env->me_pglast);
2987 if (len > mop_len) {
2989 data.mv_size = (len + 1) * sizeof(MDB_ID);
2991 data.mv_data = mop -= len;
2994 rc = mdb_cursor_put(&mc, &key, &data, MDB_CURRENT);
2996 if (rc || !(mop_len -= len))
3003 /** Flush (some) dirty pages to the map, after clearing their dirty flag.
3004 * @param[in] txn the transaction that's being committed
3005 * @param[in] keep number of initial pages in dirty_list to keep dirty.
3006 * @return 0 on success, non-zero on failure.
3009 mdb_page_flush(MDB_txn *txn, int keep)
3011 MDB_env *env = txn->mt_env;
3012 MDB_ID2L dl = txn->mt_u.dirty_list;
3013 unsigned psize = env->me_psize, j;
3014 int i, pagecount = dl[0].mid, rc;
3015 size_t size = 0, pos = 0;
3017 MDB_page *dp = NULL;
3021 struct iovec iov[MDB_COMMIT_PAGES];
3022 ssize_t wpos = 0, wsize = 0, wres;
3023 size_t next_pos = 1; /* impossible pos, so pos != next_pos */
3029 if (env->me_flags & MDB_WRITEMAP) {
3030 /* Clear dirty flags */
3031 while (++i <= pagecount) {
3033 /* Don't flush this page yet */
3034 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3035 dp->mp_flags &= ~P_KEEP;
3039 dp->mp_flags &= ~P_DIRTY;
3044 /* Write the pages */
3046 if (++i <= pagecount) {
3048 /* Don't flush this page yet */
3049 if (dp->mp_flags & (P_LOOSE|P_KEEP)) {
3050 dp->mp_flags &= ~P_KEEP;
3055 /* clear dirty flag */
3056 dp->mp_flags &= ~P_DIRTY;
3059 if (IS_OVERFLOW(dp)) size *= dp->mp_pages;
3064 /* Windows actually supports scatter/gather I/O, but only on
3065 * unbuffered file handles. Since we're relying on the OS page
3066 * cache for all our data, that's self-defeating. So we just
3067 * write pages one at a time. We use the ov structure to set
3068 * the write offset, to at least save the overhead of a Seek
3071 DPRINTF(("committing page %"Z"u", pgno));
3072 memset(&ov, 0, sizeof(ov));
3073 ov.Offset = pos & 0xffffffff;
3074 ov.OffsetHigh = pos >> 16 >> 16;
3075 if (!WriteFile(env->me_fd, dp, size, NULL, &ov)) {
3077 DPRINTF(("WriteFile: %d", rc));
3081 /* Write up to MDB_COMMIT_PAGES dirty pages at a time. */
3082 if (pos!=next_pos || n==MDB_COMMIT_PAGES || wsize+size>MAX_WRITE) {
3084 /* Write previous page(s) */
3085 #ifdef MDB_USE_PWRITEV
3086 wres = pwritev(env->me_fd, iov, n, wpos);
3089 wres = pwrite(env->me_fd, iov[0].iov_base, wsize, wpos);
3091 if (lseek(env->me_fd, wpos, SEEK_SET) == -1) {
3093 DPRINTF(("lseek: %s", strerror(rc)));
3096 wres = writev(env->me_fd, iov, n);
3099 if (wres != wsize) {
3102 DPRINTF(("Write error: %s", strerror(rc)));
3104 rc = EIO; /* TODO: Use which error code? */
3105 DPUTS("short write, filesystem full?");
3116 DPRINTF(("committing page %"Z"u", pgno));
3117 next_pos = pos + size;
3118 iov[n].iov_len = size;
3119 iov[n].iov_base = (char *)dp;
3125 /* MIPS has cache coherency issues, this is a no-op everywhere else
3126 * Note: for any size >= on-chip cache size, entire on-chip cache is
3129 CACHEFLUSH(env->me_map, txn->mt_next_pgno * env->me_psize, DCACHE);
3131 for (i = keep; ++i <= pagecount; ) {
3133 /* This is a page we skipped above */
3136 dl[j].mid = dp->mp_pgno;
3139 mdb_dpage_free(env, dp);
3144 txn->mt_dirty_room += i - j;
3150 mdb_txn_commit(MDB_txn *txn)
3156 if (txn == NULL || txn->mt_env == NULL)
3159 if (txn->mt_child) {
3160 rc = mdb_txn_commit(txn->mt_child);
3161 txn->mt_child = NULL;
3168 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
3169 mdb_dbis_update(txn, 1);
3170 txn->mt_numdbs = 2; /* so txn_abort() doesn't close any new handles */
3175 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
3176 DPUTS("error flag is set, can't commit");
3178 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
3183 if (txn->mt_parent) {
3184 MDB_txn *parent = txn->mt_parent;
3188 unsigned x, y, len, ps_len;
3190 /* Append our free list to parent's */
3191 rc = mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs);
3194 mdb_midl_free(txn->mt_free_pgs);
3195 /* Failures after this must either undo the changes
3196 * to the parent or set MDB_TXN_ERROR in the parent.
3199 parent->mt_next_pgno = txn->mt_next_pgno;
3200 parent->mt_flags = txn->mt_flags;
3202 /* Merge our cursors into parent's and close them */
3203 mdb_cursors_close(txn, 1);
3205 /* Update parent's DB table. */
3206 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
3207 parent->mt_numdbs = txn->mt_numdbs;
3208 parent->mt_dbflags[0] = txn->mt_dbflags[0];
3209 parent->mt_dbflags[1] = txn->mt_dbflags[1];
3210 for (i=2; i<txn->mt_numdbs; i++) {
3211 /* preserve parent's DB_NEW status */
3212 x = parent->mt_dbflags[i] & DB_NEW;
3213 parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
3216 dst = parent->mt_u.dirty_list;
3217 src = txn->mt_u.dirty_list;
3218 /* Remove anything in our dirty list from parent's spill list */
3219 if ((pspill = parent->mt_spill_pgs) && (ps_len = pspill[0])) {
3221 pspill[0] = (pgno_t)-1;
3222 /* Mark our dirty pages as deleted in parent spill list */
3223 for (i=0, len=src[0].mid; ++i <= len; ) {
3224 MDB_ID pn = src[i].mid << 1;
3225 while (pn > pspill[x])
3227 if (pn == pspill[x]) {
3232 /* Squash deleted pagenums if we deleted any */
3233 for (x=y; ++x <= ps_len; )
3234 if (!(pspill[x] & 1))
3235 pspill[++y] = pspill[x];
3239 /* Find len = length of merging our dirty list with parent's */
3241 dst[0].mid = 0; /* simplify loops */
3242 if (parent->mt_parent) {
3243 len = x + src[0].mid;
3244 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
3245 for (i = x; y && i; y--) {
3246 pgno_t yp = src[y].mid;
3247 while (yp < dst[i].mid)
3249 if (yp == dst[i].mid) {
3254 } else { /* Simplify the above for single-ancestor case */
3255 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
3257 /* Merge our dirty list with parent's */
3259 for (i = len; y; dst[i--] = src[y--]) {
3260 pgno_t yp = src[y].mid;
3261 while (yp < dst[x].mid)
3262 dst[i--] = dst[x--];
3263 if (yp == dst[x].mid)
3264 free(dst[x--].mptr);
3266 mdb_tassert(txn, i == x);
3268 free(txn->mt_u.dirty_list);
3269 parent->mt_dirty_room = txn->mt_dirty_room;
3270 if (txn->mt_spill_pgs) {
3271 if (parent->mt_spill_pgs) {
3272 /* TODO: Prevent failure here, so parent does not fail */
3273 rc = mdb_midl_append_list(&parent->mt_spill_pgs, txn->mt_spill_pgs);
3275 parent->mt_flags |= MDB_TXN_ERROR;
3276 mdb_midl_free(txn->mt_spill_pgs);
3277 mdb_midl_sort(parent->mt_spill_pgs);
3279 parent->mt_spill_pgs = txn->mt_spill_pgs;
3283 /* Append our loose page list to parent's */
3284 for (lp = &parent->mt_loose_pgs; *lp; lp = &NEXT_LOOSE_PAGE(lp))
3286 *lp = txn->mt_loose_pgs;
3287 parent->mt_loose_count += txn->mt_loose_count;
3289 parent->mt_child = NULL;
3290 mdb_midl_free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pghead);
3295 if (txn != env->me_txn) {
3296 DPUTS("attempt to commit unknown transaction");
3301 mdb_cursors_close(txn, 0);
3303 if (!txn->mt_u.dirty_list[0].mid &&
3304 !(txn->mt_flags & (MDB_TXN_DIRTY|MDB_TXN_SPILLS)))
3307 DPRINTF(("committing txn %"Z"u %p on mdbenv %p, root page %"Z"u",
3308 txn->mt_txnid, (void*)txn, (void*)env, txn->mt_dbs[MAIN_DBI].md_root));
3310 /* Update DB root pointers */
3311 if (txn->mt_numdbs > 2) {
3315 data.mv_size = sizeof(MDB_db);
3317 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
3318 for (i = 2; i < txn->mt_numdbs; i++) {
3319 if (txn->mt_dbflags[i] & DB_DIRTY) {
3320 if (TXN_DBI_CHANGED(txn, i)) {
3324 data.mv_data = &txn->mt_dbs[i];
3325 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
3332 rc = mdb_freelist_save(txn);
3336 mdb_midl_free(env->me_pghead);
3337 env->me_pghead = NULL;
3338 if (mdb_midl_shrink(&txn->mt_free_pgs))
3339 env->me_free_pgs = txn->mt_free_pgs;
3345 if ((rc = mdb_page_flush(txn, 0)) ||
3346 (rc = mdb_env_sync(env, 0)) ||
3347 (rc = mdb_env_write_meta(txn)))
3350 /* Free P_LOOSE pages left behind in dirty_list */
3351 if (!(env->me_flags & MDB_WRITEMAP))
3352 mdb_dlist_free(txn);
3357 mdb_dbis_update(txn, 1);
3360 UNLOCK_MUTEX_W(env);
3370 /** Read the environment parameters of a DB environment before
3371 * mapping it into memory.
3372 * @param[in] env the environment handle
3373 * @param[out] meta address of where to store the meta information
3374 * @return 0 on success, non-zero on failure.
3377 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
3383 enum { Size = sizeof(pbuf) };
3385 /* We don't know the page size yet, so use a minimum value.
3386 * Read both meta pages so we can use the latest one.
3389 for (i=off=0; i<2; i++, off = meta->mm_psize) {
3393 memset(&ov, 0, sizeof(ov));
3395 rc = ReadFile(env->me_fd, &pbuf, Size, &len, &ov) ? (int)len : -1;
3396 if (rc == -1 && ErrCode() == ERROR_HANDLE_EOF)
3399 rc = pread(env->me_fd, &pbuf, Size, off);
3402 if (rc == 0 && off == 0)
3404 rc = rc < 0 ? (int) ErrCode() : MDB_INVALID;
3405 DPRINTF(("read: %s", mdb_strerror(rc)));
3409 p = (MDB_page *)&pbuf;
3411 if (!F_ISSET(p->mp_flags, P_META)) {
3412 DPRINTF(("page %"Z"u not a meta page", p->mp_pgno));
3417 if (m->mm_magic != MDB_MAGIC) {
3418 DPUTS("meta has invalid magic");
3422 if (m->mm_version != MDB_DATA_VERSION) {
3423 DPRINTF(("database is version %u, expected version %u",
3424 m->mm_version, MDB_DATA_VERSION));
3425 return MDB_VERSION_MISMATCH;
3428 if (off == 0 || m->mm_txnid > meta->mm_txnid)
3435 mdb_env_init_meta0(MDB_env *env, MDB_meta *meta)
3437 meta->mm_magic = MDB_MAGIC;
3438 meta->mm_version = MDB_DATA_VERSION;
3439 meta->mm_mapsize = env->me_mapsize;
3440 meta->mm_psize = env->me_psize;
3441 meta->mm_last_pg = 1;
3442 meta->mm_flags = env->me_flags & 0xffff;
3443 meta->mm_flags |= MDB_INTEGERKEY;
3444 meta->mm_dbs[0].md_root = P_INVALID;
3445 meta->mm_dbs[1].md_root = P_INVALID;
3448 /** Write the environment parameters of a freshly created DB environment.
3449 * @param[in] env the environment handle
3450 * @param[out] meta address of where to store the meta information
3451 * @return 0 on success, non-zero on failure.
3454 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
3462 memset(&ov, 0, sizeof(ov));
3463 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3465 rc = WriteFile(fd, ptr, size, &len, &ov); } while(0)
3468 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3469 len = pwrite(fd, ptr, size, pos); \
3470 rc = (len >= 0); } while(0)
3473 DPUTS("writing new meta page");
3475 psize = env->me_psize;
3477 mdb_env_init_meta0(env, meta);
3479 p = calloc(2, psize);
3481 p->mp_flags = P_META;
3482 *(MDB_meta *)METADATA(p) = *meta;
3484 q = (MDB_page *)((char *)p + psize);
3486 q->mp_flags = P_META;
3487 *(MDB_meta *)METADATA(q) = *meta;
3489 DO_PWRITE(rc, env->me_fd, p, psize * 2, len, 0);
3492 else if ((unsigned) len == psize * 2)
3500 /** Update the environment info to commit a transaction.
3501 * @param[in] txn the transaction that's being committed
3502 * @return 0 on success, non-zero on failure.
3505 mdb_env_write_meta(MDB_txn *txn)
3508 MDB_meta meta, metab, *mp;
3511 int rc, len, toggle;
3520 toggle = txn->mt_txnid & 1;
3521 DPRINTF(("writing meta page %d for root page %"Z"u",
3522 toggle, txn->mt_dbs[MAIN_DBI].md_root));
3525 mp = env->me_metas[toggle];
3526 mapsize = env->me_metas[toggle ^ 1]->mm_mapsize;
3527 /* Persist any increases of mapsize config */
3528 if (mapsize < env->me_mapsize)
3529 mapsize = env->me_mapsize;
3531 if (env->me_flags & MDB_WRITEMAP) {
3532 mp->mm_mapsize = mapsize;
3533 mp->mm_dbs[0] = txn->mt_dbs[0];
3534 mp->mm_dbs[1] = txn->mt_dbs[1];
3535 mp->mm_last_pg = txn->mt_next_pgno - 1;
3536 mp->mm_txnid = txn->mt_txnid;
3537 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
3538 unsigned meta_size = env->me_psize;
3539 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
3542 #ifndef _WIN32 /* POSIX msync() requires ptr = start of OS page */
3543 if (meta_size < env->me_os_psize)
3544 meta_size += meta_size;
3549 if (MDB_MSYNC(ptr, meta_size, rc)) {
3556 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
3557 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
3559 meta.mm_mapsize = mapsize;
3560 meta.mm_dbs[0] = txn->mt_dbs[0];
3561 meta.mm_dbs[1] = txn->mt_dbs[1];
3562 meta.mm_last_pg = txn->mt_next_pgno - 1;
3563 meta.mm_txnid = txn->mt_txnid;
3565 off = offsetof(MDB_meta, mm_mapsize);
3566 ptr = (char *)&meta + off;
3567 len = sizeof(MDB_meta) - off;
3569 off += env->me_psize;
3572 /* Write to the SYNC fd */
3573 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
3574 env->me_fd : env->me_mfd;
3577 memset(&ov, 0, sizeof(ov));
3579 if (!WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov))
3583 rc = pwrite(mfd, ptr, len, off);
3586 rc = rc < 0 ? ErrCode() : EIO;
3587 DPUTS("write failed, disk error?");
3588 /* On a failure, the pagecache still contains the new data.
3589 * Write some old data back, to prevent it from being used.
3590 * Use the non-SYNC fd; we know it will fail anyway.
3592 meta.mm_last_pg = metab.mm_last_pg;
3593 meta.mm_txnid = metab.mm_txnid;
3595 memset(&ov, 0, sizeof(ov));
3597 WriteFile(env->me_fd, ptr, len, NULL, &ov);
3599 r2 = pwrite(env->me_fd, ptr, len, off);
3600 (void)r2; /* Silence warnings. We don't care about pwrite's return value */
3603 env->me_flags |= MDB_FATAL_ERROR;
3607 /* MIPS has cache coherency issues, this is a no-op everywhere else */
3608 if (!(env->me_flags & MDB_WRITEMAP)) {
3609 CACHEFLUSH(env->me_map + off, len, DCACHE);
3611 /* Memory ordering issues are irrelevant; since the entire writer
3612 * is wrapped by wmutex, all of these changes will become visible
3613 * after the wmutex is unlocked. Since the DB is multi-version,
3614 * readers will get consistent data regardless of how fresh or
3615 * how stale their view of these values is.
3618 env->me_txns->mti_txnid = txn->mt_txnid;
3623 /** Check both meta pages to see which one is newer.
3624 * @param[in] env the environment handle
3625 * @return meta toggle (0 or 1).
3628 mdb_env_pick_meta(const MDB_env *env)
3630 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
3634 mdb_env_create(MDB_env **env)
3638 e = calloc(1, sizeof(MDB_env));
3642 e->me_maxreaders = DEFAULT_READERS;
3643 e->me_maxdbs = e->me_numdbs = 2;
3644 e->me_fd = INVALID_HANDLE_VALUE;
3645 e->me_lfd = INVALID_HANDLE_VALUE;
3646 e->me_mfd = INVALID_HANDLE_VALUE;
3647 #ifdef MDB_USE_POSIX_SEM
3648 e->me_rmutex = SEM_FAILED;
3649 e->me_wmutex = SEM_FAILED;
3651 e->me_pid = getpid();
3652 GET_PAGESIZE(e->me_os_psize);
3653 VGMEMP_CREATE(e,0,0);
3659 mdb_env_map(MDB_env *env, void *addr)
3662 unsigned int flags = env->me_flags;
3666 LONG sizelo, sizehi;
3669 if (flags & MDB_RDONLY) {
3670 /* Don't set explicit map size, use whatever exists */
3675 msize = env->me_mapsize;
3676 sizelo = msize & 0xffffffff;
3677 sizehi = msize >> 16 >> 16; /* only needed on Win64 */
3679 /* Windows won't create mappings for zero length files.
3680 * and won't map more than the file size.
3681 * Just set the maxsize right now.
3683 if (SetFilePointer(env->me_fd, sizelo, &sizehi, 0) != (DWORD)sizelo
3684 || !SetEndOfFile(env->me_fd)
3685 || SetFilePointer(env->me_fd, 0, NULL, 0) != 0)
3689 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
3690 PAGE_READWRITE : PAGE_READONLY,
3691 sizehi, sizelo, NULL);
3694 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
3695 FILE_MAP_WRITE : FILE_MAP_READ,
3697 rc = env->me_map ? 0 : ErrCode();
3702 int prot = PROT_READ;
3703 if (flags & MDB_WRITEMAP) {
3705 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
3708 env->me_map = mmap(addr, env->me_mapsize, prot, MAP_SHARED,
3710 if (env->me_map == MAP_FAILED) {
3715 if (flags & MDB_NORDAHEAD) {
3716 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
3718 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
3720 #ifdef POSIX_MADV_RANDOM
3721 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
3722 #endif /* POSIX_MADV_RANDOM */
3723 #endif /* MADV_RANDOM */
3727 /* Can happen because the address argument to mmap() is just a
3728 * hint. mmap() can pick another, e.g. if the range is in use.
3729 * The MAP_FIXED flag would prevent that, but then mmap could
3730 * instead unmap existing pages to make room for the new map.
3732 if (addr && env->me_map != addr)
3733 return EBUSY; /* TODO: Make a new MDB_* error code? */
3735 p = (MDB_page *)env->me_map;
3736 env->me_metas[0] = METADATA(p);
3737 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + env->me_psize);
3743 mdb_env_set_mapsize(MDB_env *env, size_t size)
3745 /* If env is already open, caller is responsible for making
3746 * sure there are no active txns.
3754 size = env->me_metas[mdb_env_pick_meta(env)]->mm_mapsize;
3755 else if (size < env->me_mapsize) {
3756 /* If the configured size is smaller, make sure it's
3757 * still big enough. Silently round up to minimum if not.
3759 size_t minsize = (env->me_metas[mdb_env_pick_meta(env)]->mm_last_pg + 1) * env->me_psize;
3763 munmap(env->me_map, env->me_mapsize);
3764 env->me_mapsize = size;
3765 old = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : NULL;
3766 rc = mdb_env_map(env, old);
3770 env->me_mapsize = size;
3772 env->me_maxpg = env->me_mapsize / env->me_psize;
3777 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
3781 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
3786 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
3788 if (env->me_map || readers < 1)
3790 env->me_maxreaders = readers;
3795 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
3797 if (!env || !readers)
3799 *readers = env->me_maxreaders;
3803 /** Further setup required for opening an LMDB environment
3806 mdb_env_open2(MDB_env *env)
3808 unsigned int flags = env->me_flags;
3809 int i, newenv = 0, rc;
3813 /* See if we should use QueryLimited */
3815 if ((rc & 0xff) > 5)
3816 env->me_pidquery = MDB_PROCESS_QUERY_LIMITED_INFORMATION;
3818 env->me_pidquery = PROCESS_QUERY_INFORMATION;
3821 memset(&meta, 0, sizeof(meta));
3823 if ((i = mdb_env_read_header(env, &meta)) != 0) {
3826 DPUTS("new mdbenv");
3828 env->me_psize = env->me_os_psize;
3829 if (env->me_psize > MAX_PAGESIZE)
3830 env->me_psize = MAX_PAGESIZE;
3832 env->me_psize = meta.mm_psize;
3835 /* Was a mapsize configured? */
3836 if (!env->me_mapsize) {
3837 /* If this is a new environment, take the default,
3838 * else use the size recorded in the existing env.
3840 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
3841 } else if (env->me_mapsize < meta.mm_mapsize) {
3842 /* If the configured size is smaller, make sure it's
3843 * still big enough. Silently round up to minimum if not.
3845 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
3846 if (env->me_mapsize < minsize)
3847 env->me_mapsize = minsize;
3850 rc = mdb_env_map(env, (flags & MDB_FIXEDMAP) ? meta.mm_address : NULL);
3855 if (flags & MDB_FIXEDMAP)
3856 meta.mm_address = env->me_map;
3857 i = mdb_env_init_meta(env, &meta);
3858 if (i != MDB_SUCCESS) {
3863 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
3864 env->me_nodemax = (((env->me_psize - PAGEHDRSZ) / MDB_MINKEYS) & -2)
3866 #if !(MDB_MAXKEYSIZE)
3867 env->me_maxkey = env->me_nodemax - (NODESIZE + sizeof(MDB_db));
3869 env->me_maxpg = env->me_mapsize / env->me_psize;
3873 int toggle = mdb_env_pick_meta(env);
3874 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
3876 DPRINTF(("opened database version %u, pagesize %u",
3877 env->me_metas[0]->mm_version, env->me_psize));
3878 DPRINTF(("using meta page %d", toggle));
3879 DPRINTF(("depth: %u", db->md_depth));
3880 DPRINTF(("entries: %"Z"u", db->md_entries));
3881 DPRINTF(("branch pages: %"Z"u", db->md_branch_pages));
3882 DPRINTF(("leaf pages: %"Z"u", db->md_leaf_pages));
3883 DPRINTF(("overflow pages: %"Z"u", db->md_overflow_pages));
3884 DPRINTF(("root: %"Z"u", db->md_root));
3892 /** Release a reader thread's slot in the reader lock table.
3893 * This function is called automatically when a thread exits.
3894 * @param[in] ptr This points to the slot in the reader lock table.
3897 mdb_env_reader_dest(void *ptr)
3899 MDB_reader *reader = ptr;
3905 /** Junk for arranging thread-specific callbacks on Windows. This is
3906 * necessarily platform and compiler-specific. Windows supports up
3907 * to 1088 keys. Let's assume nobody opens more than 64 environments
3908 * in a single process, for now. They can override this if needed.
3910 #ifndef MAX_TLS_KEYS
3911 #define MAX_TLS_KEYS 64
3913 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
3914 static int mdb_tls_nkeys;
3916 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
3920 case DLL_PROCESS_ATTACH: break;
3921 case DLL_THREAD_ATTACH: break;
3922 case DLL_THREAD_DETACH:
3923 for (i=0; i<mdb_tls_nkeys; i++) {
3924 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
3926 mdb_env_reader_dest(r);
3930 case DLL_PROCESS_DETACH: break;
3935 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3937 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3941 /* Force some symbol references.
3942 * _tls_used forces the linker to create the TLS directory if not already done
3943 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
3945 #pragma comment(linker, "/INCLUDE:_tls_used")
3946 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
3947 #pragma const_seg(".CRT$XLB")
3948 extern const PIMAGE_TLS_CALLBACK mdb_tls_cbp;
3949 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3952 #pragma comment(linker, "/INCLUDE:__tls_used")
3953 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
3954 #pragma data_seg(".CRT$XLB")
3955 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3957 #endif /* WIN 32/64 */
3958 #endif /* !__GNUC__ */
3961 /** Downgrade the exclusive lock on the region back to shared */
3963 mdb_env_share_locks(MDB_env *env, int *excl)
3965 int rc = 0, toggle = mdb_env_pick_meta(env);
3967 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
3972 /* First acquire a shared lock. The Unlock will
3973 * then release the existing exclusive lock.
3975 memset(&ov, 0, sizeof(ov));
3976 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3979 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3985 struct flock lock_info;
3986 /* The shared lock replaces the existing lock */
3987 memset((void *)&lock_info, 0, sizeof(lock_info));
3988 lock_info.l_type = F_RDLCK;
3989 lock_info.l_whence = SEEK_SET;
3990 lock_info.l_start = 0;
3991 lock_info.l_len = 1;
3992 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3993 (rc = ErrCode()) == EINTR) ;
3994 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
4001 /** Try to get exlusive lock, otherwise shared.
4002 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
4005 mdb_env_excl_lock(MDB_env *env, int *excl)
4009 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
4013 memset(&ov, 0, sizeof(ov));
4014 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
4021 struct flock lock_info;
4022 memset((void *)&lock_info, 0, sizeof(lock_info));
4023 lock_info.l_type = F_WRLCK;
4024 lock_info.l_whence = SEEK_SET;
4025 lock_info.l_start = 0;
4026 lock_info.l_len = 1;
4027 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
4028 (rc = ErrCode()) == EINTR) ;
4032 # ifdef MDB_USE_POSIX_SEM
4033 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
4036 lock_info.l_type = F_RDLCK;
4037 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
4038 (rc = ErrCode()) == EINTR) ;
4048 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
4050 * @(#) $Revision: 5.1 $
4051 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
4052 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
4054 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
4058 * Please do not copyright this code. This code is in the public domain.
4060 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
4061 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
4062 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
4063 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
4064 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
4065 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
4066 * PERFORMANCE OF THIS SOFTWARE.
4069 * chongo <Landon Curt Noll> /\oo/\
4070 * http://www.isthe.com/chongo/
4072 * Share and Enjoy! :-)
4075 typedef unsigned long long mdb_hash_t;
4076 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
4078 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
4079 * @param[in] val value to hash
4080 * @param[in] hval initial value for hash
4081 * @return 64 bit hash
4083 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
4084 * hval arg on the first call.
4087 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
4089 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
4090 unsigned char *end = s + val->mv_size;
4092 * FNV-1a hash each octet of the string
4095 /* xor the bottom with the current octet */
4096 hval ^= (mdb_hash_t)*s++;
4098 /* multiply by the 64 bit FNV magic prime mod 2^64 */
4099 hval += (hval << 1) + (hval << 4) + (hval << 5) +
4100 (hval << 7) + (hval << 8) + (hval << 40);
4102 /* return our new hash value */
4106 /** Hash the string and output the encoded hash.
4107 * This uses modified RFC1924 Ascii85 encoding to accommodate systems with
4108 * very short name limits. We don't care about the encoding being reversible,
4109 * we just want to preserve as many bits of the input as possible in a
4110 * small printable string.
4111 * @param[in] str string to hash
4112 * @param[out] encbuf an array of 11 chars to hold the hash
4114 static const char mdb_a85[]= "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~";
4117 mdb_pack85(unsigned long l, char *out)
4121 for (i=0; i<5; i++) {
4122 *out++ = mdb_a85[l % 85];
4128 mdb_hash_enc(MDB_val *val, char *encbuf)
4130 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
4132 mdb_pack85(h, encbuf);
4133 mdb_pack85(h>>32, encbuf+5);
4138 /** Open and/or initialize the lock region for the environment.
4139 * @param[in] env The LMDB environment.
4140 * @param[in] lpath The pathname of the file used for the lock region.
4141 * @param[in] mode The Unix permissions for the file, if we create it.
4142 * @param[out] excl Resulting file lock type: -1 none, 0 shared, 1 exclusive
4143 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
4144 * @return 0 on success, non-zero on failure.
4147 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
4150 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
4152 # define MDB_ERRCODE_ROFS EROFS
4153 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
4154 # define MDB_CLOEXEC O_CLOEXEC
4157 # define MDB_CLOEXEC 0
4164 env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
4165 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
4166 FILE_ATTRIBUTE_NORMAL, NULL);
4168 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
4170 if (env->me_lfd == INVALID_HANDLE_VALUE) {
4172 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
4177 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
4178 /* Lose record locks when exec*() */
4179 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
4180 fcntl(env->me_lfd, F_SETFD, fdflags);
4183 if (!(env->me_flags & MDB_NOTLS)) {
4184 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
4187 env->me_flags |= MDB_ENV_TXKEY;
4189 /* Windows TLS callbacks need help finding their TLS info. */
4190 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
4194 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
4198 /* Try to get exclusive lock. If we succeed, then
4199 * nobody is using the lock region and we should initialize it.
4201 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
4204 size = GetFileSize(env->me_lfd, NULL);
4206 size = lseek(env->me_lfd, 0, SEEK_END);
4207 if (size == -1) goto fail_errno;
4209 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
4210 if (size < rsize && *excl > 0) {
4212 if (SetFilePointer(env->me_lfd, rsize, NULL, FILE_BEGIN) != (DWORD)rsize
4213 || !SetEndOfFile(env->me_lfd))
4216 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
4220 size = rsize - sizeof(MDB_txninfo);
4221 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
4226 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
4228 if (!mh) goto fail_errno;
4229 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
4231 if (!env->me_txns) goto fail_errno;
4233 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
4235 if (m == MAP_FAILED) goto fail_errno;
4241 BY_HANDLE_FILE_INFORMATION stbuf;
4250 if (!mdb_sec_inited) {
4251 InitializeSecurityDescriptor(&mdb_null_sd,
4252 SECURITY_DESCRIPTOR_REVISION);
4253 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
4254 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
4255 mdb_all_sa.bInheritHandle = FALSE;
4256 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
4259 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
4260 idbuf.volume = stbuf.dwVolumeSerialNumber;
4261 idbuf.nhigh = stbuf.nFileIndexHigh;
4262 idbuf.nlow = stbuf.nFileIndexLow;
4263 val.mv_data = &idbuf;
4264 val.mv_size = sizeof(idbuf);
4265 mdb_hash_enc(&val, encbuf);
4266 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", encbuf);
4267 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", encbuf);
4268 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
4269 if (!env->me_rmutex) goto fail_errno;
4270 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
4271 if (!env->me_wmutex) goto fail_errno;
4272 #elif defined(MDB_USE_POSIX_SEM)
4281 #if defined(__NetBSD__)
4282 #define MDB_SHORT_SEMNAMES 1 /* limited to 14 chars */
4284 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
4285 idbuf.dev = stbuf.st_dev;
4286 idbuf.ino = stbuf.st_ino;
4287 val.mv_data = &idbuf;
4288 val.mv_size = sizeof(idbuf);
4289 mdb_hash_enc(&val, encbuf);
4290 #ifdef MDB_SHORT_SEMNAMES
4291 encbuf[9] = '\0'; /* drop name from 15 chars to 14 chars */
4293 sprintf(env->me_txns->mti_rmname, "/MDBr%s", encbuf);
4294 sprintf(env->me_txns->mti_wmname, "/MDBw%s", encbuf);
4295 /* Clean up after a previous run, if needed: Try to
4296 * remove both semaphores before doing anything else.
4298 sem_unlink(env->me_txns->mti_rmname);
4299 sem_unlink(env->me_txns->mti_wmname);
4300 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
4301 O_CREAT|O_EXCL, mode, 1);
4302 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4303 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
4304 O_CREAT|O_EXCL, mode, 1);
4305 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4306 #else /* MDB_USE_POSIX_SEM */
4307 pthread_mutexattr_t mattr;
4309 if ((rc = pthread_mutexattr_init(&mattr))
4310 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
4311 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
4312 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
4314 pthread_mutexattr_destroy(&mattr);
4315 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
4317 env->me_txns->mti_magic = MDB_MAGIC;
4318 env->me_txns->mti_format = MDB_LOCK_FORMAT;
4319 env->me_txns->mti_txnid = 0;
4320 env->me_txns->mti_numreaders = 0;
4323 if (env->me_txns->mti_magic != MDB_MAGIC) {
4324 DPUTS("lock region has invalid magic");
4328 if (env->me_txns->mti_format != MDB_LOCK_FORMAT) {
4329 DPRINTF(("lock region has format+version 0x%x, expected 0x%x",
4330 env->me_txns->mti_format, MDB_LOCK_FORMAT));
4331 rc = MDB_VERSION_MISMATCH;
4335 if (rc && rc != EACCES && rc != EAGAIN) {
4339 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
4340 if (!env->me_rmutex) goto fail_errno;
4341 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
4342 if (!env->me_wmutex) goto fail_errno;
4343 #elif defined(MDB_USE_POSIX_SEM)
4344 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
4345 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
4346 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
4347 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4358 /** The name of the lock file in the DB environment */
4359 #define LOCKNAME "/lock.mdb"
4360 /** The name of the data file in the DB environment */
4361 #define DATANAME "/data.mdb"
4362 /** The suffix of the lock file when no subdir is used */
4363 #define LOCKSUFF "-lock"
4364 /** Only a subset of the @ref mdb_env flags can be changed
4365 * at runtime. Changing other flags requires closing the
4366 * environment and re-opening it with the new flags.
4368 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC|MDB_NOMEMINIT)
4369 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP| \
4370 MDB_NOTLS|MDB_NOLOCK|MDB_NORDAHEAD)
4372 #if VALID_FLAGS & PERSISTENT_FLAGS & (CHANGEABLE|CHANGELESS)
4373 # error "Persistent DB flags & env flags overlap, but both go in mm_flags"
4377 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
4379 int oflags, rc, len, excl = -1;
4380 char *lpath, *dpath;
4382 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
4386 if (flags & MDB_NOSUBDIR) {
4387 rc = len + sizeof(LOCKSUFF) + len + 1;
4389 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
4394 if (flags & MDB_NOSUBDIR) {
4395 dpath = lpath + len + sizeof(LOCKSUFF);
4396 sprintf(lpath, "%s" LOCKSUFF, path);
4397 strcpy(dpath, path);
4399 dpath = lpath + len + sizeof(LOCKNAME);
4400 sprintf(lpath, "%s" LOCKNAME, path);
4401 sprintf(dpath, "%s" DATANAME, path);
4405 flags |= env->me_flags;
4406 if (flags & MDB_RDONLY) {
4407 /* silently ignore WRITEMAP when we're only getting read access */
4408 flags &= ~MDB_WRITEMAP;
4410 if (!((env->me_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)) &&
4411 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
4414 env->me_flags = flags |= MDB_ENV_ACTIVE;
4418 env->me_path = strdup(path);
4419 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
4420 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
4421 env->me_dbiseqs = calloc(env->me_maxdbs, sizeof(unsigned int));
4422 if (!(env->me_dbxs && env->me_path && env->me_dbflags && env->me_dbiseqs)) {
4427 /* For RDONLY, get lockfile after we know datafile exists */
4428 if (!(flags & (MDB_RDONLY|MDB_NOLOCK))) {
4429 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4435 if (F_ISSET(flags, MDB_RDONLY)) {
4436 oflags = GENERIC_READ;
4437 len = OPEN_EXISTING;
4439 oflags = GENERIC_READ|GENERIC_WRITE;
4442 mode = FILE_ATTRIBUTE_NORMAL;
4443 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
4444 NULL, len, mode, NULL);
4446 if (F_ISSET(flags, MDB_RDONLY))
4449 oflags = O_RDWR | O_CREAT;
4451 env->me_fd = open(dpath, oflags, mode);
4453 if (env->me_fd == INVALID_HANDLE_VALUE) {
4458 if ((flags & (MDB_RDONLY|MDB_NOLOCK)) == MDB_RDONLY) {
4459 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4464 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
4465 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
4466 env->me_mfd = env->me_fd;
4468 /* Synchronous fd for meta writes. Needed even with
4469 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
4472 len = OPEN_EXISTING;
4473 env->me_mfd = CreateFile(dpath, oflags,
4474 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
4475 mode | FILE_FLAG_WRITE_THROUGH, NULL);
4478 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
4480 if (env->me_mfd == INVALID_HANDLE_VALUE) {
4485 DPRINTF(("opened dbenv %p", (void *) env));
4487 rc = mdb_env_share_locks(env, &excl);
4491 if (!((flags & MDB_RDONLY) ||
4492 (env->me_pbuf = calloc(1, env->me_psize))))
4498 mdb_env_close0(env, excl);
4504 /** Destroy resources from mdb_env_open(), clear our readers & DBIs */
4506 mdb_env_close0(MDB_env *env, int excl)
4510 if (!(env->me_flags & MDB_ENV_ACTIVE))
4513 /* Doing this here since me_dbxs may not exist during mdb_env_close */
4514 for (i = env->me_maxdbs; --i > MAIN_DBI; )
4515 free(env->me_dbxs[i].md_name.mv_data);
4518 free(env->me_dbiseqs);
4519 free(env->me_dbflags);
4522 free(env->me_dirty_list);
4523 mdb_midl_free(env->me_free_pgs);
4525 if (env->me_flags & MDB_ENV_TXKEY) {
4526 pthread_key_delete(env->me_txkey);
4528 /* Delete our key from the global list */
4529 for (i=0; i<mdb_tls_nkeys; i++)
4530 if (mdb_tls_keys[i] == env->me_txkey) {
4531 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
4539 munmap(env->me_map, env->me_mapsize);
4541 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
4542 (void) close(env->me_mfd);
4543 if (env->me_fd != INVALID_HANDLE_VALUE)
4544 (void) close(env->me_fd);
4546 MDB_PID_T pid = env->me_pid;
4547 /* Clearing readers is done in this function because
4548 * me_txkey with its destructor must be disabled first.
4550 for (i = env->me_numreaders; --i >= 0; )
4551 if (env->me_txns->mti_readers[i].mr_pid == pid)
4552 env->me_txns->mti_readers[i].mr_pid = 0;
4554 if (env->me_rmutex) {
4555 CloseHandle(env->me_rmutex);
4556 if (env->me_wmutex) CloseHandle(env->me_wmutex);
4558 /* Windows automatically destroys the mutexes when
4559 * the last handle closes.
4561 #elif defined(MDB_USE_POSIX_SEM)
4562 if (env->me_rmutex != SEM_FAILED) {
4563 sem_close(env->me_rmutex);
4564 if (env->me_wmutex != SEM_FAILED)
4565 sem_close(env->me_wmutex);
4566 /* If we have the filelock: If we are the
4567 * only remaining user, clean up semaphores.
4570 mdb_env_excl_lock(env, &excl);
4572 sem_unlink(env->me_txns->mti_rmname);
4573 sem_unlink(env->me_txns->mti_wmname);
4577 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
4579 if (env->me_lfd != INVALID_HANDLE_VALUE) {
4582 /* Unlock the lockfile. Windows would have unlocked it
4583 * after closing anyway, but not necessarily at once.
4585 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4588 (void) close(env->me_lfd);
4591 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
4596 mdb_env_close(MDB_env *env)
4603 VGMEMP_DESTROY(env);
4604 while ((dp = env->me_dpages) != NULL) {
4605 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
4606 env->me_dpages = dp->mp_next;
4610 mdb_env_close0(env, 0);
4614 /** Compare two items pointing at aligned size_t's */
4616 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
4618 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
4619 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
4622 /** Compare two items pointing at aligned unsigned int's */
4624 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
4626 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
4627 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
4630 /** Compare two items pointing at unsigned ints of unknown alignment.
4631 * Nodes and keys are guaranteed to be 2-byte aligned.
4634 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
4636 #if BYTE_ORDER == LITTLE_ENDIAN
4637 unsigned short *u, *c;
4640 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4641 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
4644 } while(!x && u > (unsigned short *)a->mv_data);
4647 unsigned short *u, *c, *end;
4650 end = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4651 u = (unsigned short *)a->mv_data;
4652 c = (unsigned short *)b->mv_data;
4655 } while(!x && u < end);
4660 /** Compare two items pointing at size_t's of unknown alignment. */
4661 #ifdef MISALIGNED_OK
4662 # define mdb_cmp_clong mdb_cmp_long
4664 # define mdb_cmp_clong mdb_cmp_cint
4667 /** Compare two items lexically */
4669 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
4676 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4682 diff = memcmp(a->mv_data, b->mv_data, len);
4683 return diff ? diff : len_diff<0 ? -1 : len_diff;
4686 /** Compare two items in reverse byte order */
4688 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
4690 const unsigned char *p1, *p2, *p1_lim;
4694 p1_lim = (const unsigned char *)a->mv_data;
4695 p1 = (const unsigned char *)a->mv_data + a->mv_size;
4696 p2 = (const unsigned char *)b->mv_data + b->mv_size;
4698 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4704 while (p1 > p1_lim) {
4705 diff = *--p1 - *--p2;
4709 return len_diff<0 ? -1 : len_diff;
4712 /** Search for key within a page, using binary search.
4713 * Returns the smallest entry larger or equal to the key.
4714 * If exactp is non-null, stores whether the found entry was an exact match
4715 * in *exactp (1 or 0).
4716 * Updates the cursor index with the index of the found entry.
4717 * If no entry larger or equal to the key is found, returns NULL.
4720 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
4722 unsigned int i = 0, nkeys;
4725 MDB_page *mp = mc->mc_pg[mc->mc_top];
4726 MDB_node *node = NULL;
4731 nkeys = NUMKEYS(mp);
4733 DPRINTF(("searching %u keys in %s %spage %"Z"u",
4734 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
4737 low = IS_LEAF(mp) ? 0 : 1;
4739 cmp = mc->mc_dbx->md_cmp;
4741 /* Branch pages have no data, so if using integer keys,
4742 * alignment is guaranteed. Use faster mdb_cmp_int.
4744 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
4745 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
4752 nodekey.mv_size = mc->mc_db->md_pad;
4753 node = NODEPTR(mp, 0); /* fake */
4754 while (low <= high) {
4755 i = (low + high) >> 1;
4756 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
4757 rc = cmp(key, &nodekey);
4758 DPRINTF(("found leaf index %u [%s], rc = %i",
4759 i, DKEY(&nodekey), rc));
4768 while (low <= high) {
4769 i = (low + high) >> 1;
4771 node = NODEPTR(mp, i);
4772 nodekey.mv_size = NODEKSZ(node);
4773 nodekey.mv_data = NODEKEY(node);
4775 rc = cmp(key, &nodekey);
4778 DPRINTF(("found leaf index %u [%s], rc = %i",
4779 i, DKEY(&nodekey), rc));
4781 DPRINTF(("found branch index %u [%s -> %"Z"u], rc = %i",
4782 i, DKEY(&nodekey), NODEPGNO(node), rc));
4793 if (rc > 0) { /* Found entry is less than the key. */
4794 i++; /* Skip to get the smallest entry larger than key. */
4796 node = NODEPTR(mp, i);
4799 *exactp = (rc == 0 && nkeys > 0);
4800 /* store the key index */
4801 mc->mc_ki[mc->mc_top] = i;
4803 /* There is no entry larger or equal to the key. */
4806 /* nodeptr is fake for LEAF2 */
4812 mdb_cursor_adjust(MDB_cursor *mc, func)
4816 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4817 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
4824 /** Pop a page off the top of the cursor's stack. */
4826 mdb_cursor_pop(MDB_cursor *mc)
4830 MDB_page *top = mc->mc_pg[mc->mc_top];
4836 DPRINTF(("popped page %"Z"u off db %d cursor %p", top->mp_pgno,
4837 DDBI(mc), (void *) mc));
4841 /** Push a page onto the top of the cursor's stack. */
4843 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
4845 DPRINTF(("pushing page %"Z"u on db %d cursor %p", mp->mp_pgno,
4846 DDBI(mc), (void *) mc));
4848 if (mc->mc_snum >= CURSOR_STACK) {
4849 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4850 return MDB_CURSOR_FULL;
4853 mc->mc_top = mc->mc_snum++;
4854 mc->mc_pg[mc->mc_top] = mp;
4855 mc->mc_ki[mc->mc_top] = 0;
4860 /** Find the address of the page corresponding to a given page number.
4861 * @param[in] txn the transaction for this access.
4862 * @param[in] pgno the page number for the page to retrieve.
4863 * @param[out] ret address of a pointer where the page's address will be stored.
4864 * @param[out] lvl dirty_list inheritance level of found page. 1=current txn, 0=mapped page.
4865 * @return 0 on success, non-zero on failure.
4868 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret, int *lvl)
4870 MDB_env *env = txn->mt_env;
4874 if (!((txn->mt_flags & MDB_TXN_RDONLY) | (env->me_flags & MDB_WRITEMAP))) {
4878 MDB_ID2L dl = tx2->mt_u.dirty_list;
4880 /* Spilled pages were dirtied in this txn and flushed
4881 * because the dirty list got full. Bring this page
4882 * back in from the map (but don't unspill it here,
4883 * leave that unless page_touch happens again).
4885 if (tx2->mt_spill_pgs) {
4886 MDB_ID pn = pgno << 1;
4887 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
4888 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
4889 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
4894 unsigned x = mdb_mid2l_search(dl, pgno);
4895 if (x <= dl[0].mid && dl[x].mid == pgno) {
4901 } while ((tx2 = tx2->mt_parent) != NULL);
4904 if (pgno < txn->mt_next_pgno) {
4906 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
4908 DPRINTF(("page %"Z"u not found", pgno));
4909 txn->mt_flags |= MDB_TXN_ERROR;
4910 return MDB_PAGE_NOTFOUND;
4920 /** Finish #mdb_page_search() / #mdb_page_search_lowest().
4921 * The cursor is at the root page, set up the rest of it.
4924 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int flags)
4926 MDB_page *mp = mc->mc_pg[mc->mc_top];
4930 while (IS_BRANCH(mp)) {
4934 DPRINTF(("branch page %"Z"u has %u keys", mp->mp_pgno, NUMKEYS(mp)));
4935 mdb_cassert(mc, NUMKEYS(mp) > 1);
4936 DPRINTF(("found index 0 to page %"Z"u", NODEPGNO(NODEPTR(mp, 0))));
4938 if (flags & (MDB_PS_FIRST|MDB_PS_LAST)) {
4940 if (flags & MDB_PS_LAST)
4941 i = NUMKEYS(mp) - 1;
4944 node = mdb_node_search(mc, key, &exact);
4946 i = NUMKEYS(mp) - 1;
4948 i = mc->mc_ki[mc->mc_top];
4950 mdb_cassert(mc, i > 0);
4954 DPRINTF(("following index %u for key [%s]", i, DKEY(key)));
4957 mdb_cassert(mc, i < NUMKEYS(mp));
4958 node = NODEPTR(mp, i);
4960 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
4963 mc->mc_ki[mc->mc_top] = i;
4964 if ((rc = mdb_cursor_push(mc, mp)))
4967 if (flags & MDB_PS_MODIFY) {
4968 if ((rc = mdb_page_touch(mc)) != 0)
4970 mp = mc->mc_pg[mc->mc_top];
4975 DPRINTF(("internal error, index points to a %02X page!?",
4977 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
4978 return MDB_CORRUPTED;
4981 DPRINTF(("found leaf page %"Z"u for key [%s]", mp->mp_pgno,
4982 key ? DKEY(key) : "null"));
4983 mc->mc_flags |= C_INITIALIZED;
4984 mc->mc_flags &= ~C_EOF;
4989 /** Search for the lowest key under the current branch page.
4990 * This just bypasses a NUMKEYS check in the current page
4991 * before calling mdb_page_search_root(), because the callers
4992 * are all in situations where the current page is known to
4996 mdb_page_search_lowest(MDB_cursor *mc)
4998 MDB_page *mp = mc->mc_pg[mc->mc_top];
4999 MDB_node *node = NODEPTR(mp, 0);
5002 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
5005 mc->mc_ki[mc->mc_top] = 0;
5006 if ((rc = mdb_cursor_push(mc, mp)))
5008 return mdb_page_search_root(mc, NULL, MDB_PS_FIRST);
5011 /** Search for the page a given key should be in.
5012 * Push it and its parent pages on the cursor stack.
5013 * @param[in,out] mc the cursor for this operation.
5014 * @param[in] key the key to search for, or NULL for first/last page.
5015 * @param[in] flags If MDB_PS_MODIFY is set, visited pages in the DB
5016 * are touched (updated with new page numbers).
5017 * If MDB_PS_FIRST or MDB_PS_LAST is set, find first or last leaf.
5018 * This is used by #mdb_cursor_first() and #mdb_cursor_last().
5019 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
5020 * @return 0 on success, non-zero on failure.
5023 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
5028 /* Make sure the txn is still viable, then find the root from
5029 * the txn's db table and set it as the root of the cursor's stack.
5031 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
5032 DPUTS("transaction has failed, must abort");
5035 /* Make sure we're using an up-to-date root */
5036 if (*mc->mc_dbflag & DB_STALE) {
5038 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
5040 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
5041 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, 0);
5048 MDB_node *leaf = mdb_node_search(&mc2,
5049 &mc->mc_dbx->md_name, &exact);
5051 return MDB_NOTFOUND;
5052 rc = mdb_node_read(mc->mc_txn, leaf, &data);
5055 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
5057 /* The txn may not know this DBI, or another process may
5058 * have dropped and recreated the DB with other flags.
5060 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
5061 return MDB_INCOMPATIBLE;
5062 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
5064 *mc->mc_dbflag &= ~DB_STALE;
5066 root = mc->mc_db->md_root;
5068 if (root == P_INVALID) { /* Tree is empty. */
5069 DPUTS("tree is empty");
5070 return MDB_NOTFOUND;
5074 mdb_cassert(mc, root > 1);
5075 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
5076 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0], NULL)) != 0)
5082 DPRINTF(("db %d root page %"Z"u has flags 0x%X",
5083 DDBI(mc), root, mc->mc_pg[0]->mp_flags));
5085 if (flags & MDB_PS_MODIFY) {
5086 if ((rc = mdb_page_touch(mc)))
5090 if (flags & MDB_PS_ROOTONLY)
5093 return mdb_page_search_root(mc, key, flags);
5097 mdb_ovpage_free(MDB_cursor *mc, MDB_page *mp)
5099 MDB_txn *txn = mc->mc_txn;
5100 pgno_t pg = mp->mp_pgno;
5101 unsigned x = 0, ovpages = mp->mp_pages;
5102 MDB_env *env = txn->mt_env;
5103 MDB_IDL sl = txn->mt_spill_pgs;
5104 MDB_ID pn = pg << 1;
5107 DPRINTF(("free ov page %"Z"u (%d)", pg, ovpages));
5108 /* If the page is dirty or on the spill list we just acquired it,
5109 * so we should give it back to our current free list, if any.
5110 * Otherwise put it onto the list of pages we freed in this txn.
5112 * Won't create me_pghead: me_pglast must be inited along with it.
5113 * Unsupported in nested txns: They would need to hide the page
5114 * range in ancestor txns' dirty and spilled lists.
5116 if (env->me_pghead &&
5118 ((mp->mp_flags & P_DIRTY) ||
5119 (sl && (x = mdb_midl_search(sl, pn)) <= sl[0] && sl[x] == pn)))
5123 MDB_ID2 *dl, ix, iy;
5124 rc = mdb_midl_need(&env->me_pghead, ovpages);
5127 if (!(mp->mp_flags & P_DIRTY)) {
5128 /* This page is no longer spilled */
5135 /* Remove from dirty list */
5136 dl = txn->mt_u.dirty_list;
5138 for (ix = dl[x]; ix.mptr != mp; ix = iy) {
5144 mdb_cassert(mc, x > 1);
5146 dl[j] = ix; /* Unsorted. OK when MDB_TXN_ERROR. */
5147 txn->mt_flags |= MDB_TXN_ERROR;
5148 return MDB_CORRUPTED;
5151 if (!(env->me_flags & MDB_WRITEMAP))
5152 mdb_dpage_free(env, mp);
5154 /* Insert in me_pghead */
5155 mop = env->me_pghead;
5156 j = mop[0] + ovpages;
5157 for (i = mop[0]; i && mop[i] < pg; i--)
5163 rc = mdb_midl_append_range(&txn->mt_free_pgs, pg, ovpages);
5167 mc->mc_db->md_overflow_pages -= ovpages;
5171 /** Return the data associated with a given node.
5172 * @param[in] txn The transaction for this operation.
5173 * @param[in] leaf The node being read.
5174 * @param[out] data Updated to point to the node's data.
5175 * @return 0 on success, non-zero on failure.
5178 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
5180 MDB_page *omp; /* overflow page */
5184 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5185 data->mv_size = NODEDSZ(leaf);
5186 data->mv_data = NODEDATA(leaf);
5190 /* Read overflow data.
5192 data->mv_size = NODEDSZ(leaf);
5193 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
5194 if ((rc = mdb_page_get(txn, pgno, &omp, NULL)) != 0) {
5195 DPRINTF(("read overflow page %"Z"u failed", pgno));
5198 data->mv_data = METADATA(omp);
5204 mdb_get(MDB_txn *txn, MDB_dbi dbi,
5205 MDB_val *key, MDB_val *data)
5212 DPRINTF(("===> get db %u key [%s]", dbi, DKEY(key)));
5214 if (!key || !data || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
5217 if (txn->mt_flags & MDB_TXN_ERROR)
5220 mdb_cursor_init(&mc, txn, dbi, &mx);
5221 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
5224 /** Find a sibling for a page.
5225 * Replaces the page at the top of the cursor's stack with the
5226 * specified sibling, if one exists.
5227 * @param[in] mc The cursor for this operation.
5228 * @param[in] move_right Non-zero if the right sibling is requested,
5229 * otherwise the left sibling.
5230 * @return 0 on success, non-zero on failure.
5233 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
5239 if (mc->mc_snum < 2) {
5240 return MDB_NOTFOUND; /* root has no siblings */
5244 DPRINTF(("parent page is page %"Z"u, index %u",
5245 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]));
5247 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
5248 : (mc->mc_ki[mc->mc_top] == 0)) {
5249 DPRINTF(("no more keys left, moving to %s sibling",
5250 move_right ? "right" : "left"));
5251 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
5252 /* undo cursor_pop before returning */
5259 mc->mc_ki[mc->mc_top]++;
5261 mc->mc_ki[mc->mc_top]--;
5262 DPRINTF(("just moving to %s index key %u",
5263 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]));
5265 mdb_cassert(mc, IS_BRANCH(mc->mc_pg[mc->mc_top]));
5267 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5268 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp, NULL)) != 0) {
5269 /* mc will be inconsistent if caller does mc_snum++ as above */
5270 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
5274 mdb_cursor_push(mc, mp);
5276 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
5281 /** Move the cursor to the next data item. */
5283 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5289 if (mc->mc_flags & C_EOF) {
5290 return MDB_NOTFOUND;
5293 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5295 mp = mc->mc_pg[mc->mc_top];
5297 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5298 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5299 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5300 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
5301 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
5302 if (op != MDB_NEXT || rc != MDB_NOTFOUND) {
5303 if (rc == MDB_SUCCESS)
5304 MDB_GET_KEY(leaf, key);
5309 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5310 if (op == MDB_NEXT_DUP)
5311 return MDB_NOTFOUND;
5315 DPRINTF(("cursor_next: top page is %"Z"u in cursor %p",
5316 mdb_dbg_pgno(mp), (void *) mc));
5317 if (mc->mc_flags & C_DEL)
5320 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
5321 DPUTS("=====> move to next sibling page");
5322 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
5323 mc->mc_flags |= C_EOF;
5326 mp = mc->mc_pg[mc->mc_top];
5327 DPRINTF(("next page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5329 mc->mc_ki[mc->mc_top]++;
5332 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5333 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5336 key->mv_size = mc->mc_db->md_pad;
5337 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5341 mdb_cassert(mc, IS_LEAF(mp));
5342 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5344 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5345 mdb_xcursor_init1(mc, leaf);
5348 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5351 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5352 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5353 if (rc != MDB_SUCCESS)
5358 MDB_GET_KEY(leaf, key);
5362 /** Move the cursor to the previous data item. */
5364 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5370 mdb_cassert(mc, mc->mc_flags & C_INITIALIZED);
5372 mp = mc->mc_pg[mc->mc_top];
5374 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5375 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5376 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5377 if (op == MDB_PREV || op == MDB_PREV_DUP) {
5378 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
5379 if (op != MDB_PREV || rc != MDB_NOTFOUND) {
5380 if (rc == MDB_SUCCESS) {
5381 MDB_GET_KEY(leaf, key);
5382 mc->mc_flags &= ~C_EOF;
5387 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5388 if (op == MDB_PREV_DUP)
5389 return MDB_NOTFOUND;
5394 DPRINTF(("cursor_prev: top page is %"Z"u in cursor %p",
5395 mdb_dbg_pgno(mp), (void *) mc));
5397 if (mc->mc_ki[mc->mc_top] == 0) {
5398 DPUTS("=====> move to prev sibling page");
5399 if ((rc = mdb_cursor_sibling(mc, 0)) != MDB_SUCCESS) {
5402 mp = mc->mc_pg[mc->mc_top];
5403 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
5404 DPRINTF(("prev page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5406 mc->mc_ki[mc->mc_top]--;
5408 mc->mc_flags &= ~C_EOF;
5410 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5411 mdb_dbg_pgno(mp), NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5414 key->mv_size = mc->mc_db->md_pad;
5415 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5419 mdb_cassert(mc, IS_LEAF(mp));
5420 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5422 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5423 mdb_xcursor_init1(mc, leaf);
5426 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5429 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5430 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5431 if (rc != MDB_SUCCESS)
5436 MDB_GET_KEY(leaf, key);
5440 /** Set the cursor on a specific data item. */
5442 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5443 MDB_cursor_op op, int *exactp)
5447 MDB_node *leaf = NULL;
5450 if (key->mv_size == 0)
5451 return MDB_BAD_VALSIZE;
5454 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5456 /* See if we're already on the right page */
5457 if (mc->mc_flags & C_INITIALIZED) {
5460 mp = mc->mc_pg[mc->mc_top];
5462 mc->mc_ki[mc->mc_top] = 0;
5463 return MDB_NOTFOUND;
5465 if (mp->mp_flags & P_LEAF2) {
5466 nodekey.mv_size = mc->mc_db->md_pad;
5467 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
5469 leaf = NODEPTR(mp, 0);
5470 MDB_GET_KEY2(leaf, nodekey);
5472 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5474 /* Probably happens rarely, but first node on the page
5475 * was the one we wanted.
5477 mc->mc_ki[mc->mc_top] = 0;
5484 unsigned int nkeys = NUMKEYS(mp);
5486 if (mp->mp_flags & P_LEAF2) {
5487 nodekey.mv_data = LEAF2KEY(mp,
5488 nkeys-1, nodekey.mv_size);
5490 leaf = NODEPTR(mp, nkeys-1);
5491 MDB_GET_KEY2(leaf, nodekey);
5493 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5495 /* last node was the one we wanted */
5496 mc->mc_ki[mc->mc_top] = nkeys-1;
5502 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
5503 /* This is definitely the right page, skip search_page */
5504 if (mp->mp_flags & P_LEAF2) {
5505 nodekey.mv_data = LEAF2KEY(mp,
5506 mc->mc_ki[mc->mc_top], nodekey.mv_size);
5508 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5509 MDB_GET_KEY2(leaf, nodekey);
5511 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5513 /* current node was the one we wanted */
5523 /* If any parents have right-sibs, search.
5524 * Otherwise, there's nothing further.
5526 for (i=0; i<mc->mc_top; i++)
5528 NUMKEYS(mc->mc_pg[i])-1)
5530 if (i == mc->mc_top) {
5531 /* There are no other pages */
5532 mc->mc_ki[mc->mc_top] = nkeys;
5533 return MDB_NOTFOUND;
5537 /* There are no other pages */
5538 mc->mc_ki[mc->mc_top] = 0;
5539 if (op == MDB_SET_RANGE && !exactp) {
5543 return MDB_NOTFOUND;
5547 rc = mdb_page_search(mc, key, 0);
5548 if (rc != MDB_SUCCESS)
5551 mp = mc->mc_pg[mc->mc_top];
5552 mdb_cassert(mc, IS_LEAF(mp));
5555 leaf = mdb_node_search(mc, key, exactp);
5556 if (exactp != NULL && !*exactp) {
5557 /* MDB_SET specified and not an exact match. */
5558 return MDB_NOTFOUND;
5562 DPUTS("===> inexact leaf not found, goto sibling");
5563 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
5564 return rc; /* no entries matched */
5565 mp = mc->mc_pg[mc->mc_top];
5566 mdb_cassert(mc, IS_LEAF(mp));
5567 leaf = NODEPTR(mp, 0);
5571 mc->mc_flags |= C_INITIALIZED;
5572 mc->mc_flags &= ~C_EOF;
5575 if (op == MDB_SET_RANGE || op == MDB_SET_KEY) {
5576 key->mv_size = mc->mc_db->md_pad;
5577 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5582 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5583 mdb_xcursor_init1(mc, leaf);
5586 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5587 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
5588 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5591 if (op == MDB_GET_BOTH) {
5597 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
5598 if (rc != MDB_SUCCESS)
5601 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
5603 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
5605 rc = mc->mc_dbx->md_dcmp(data, &d2);
5607 if (op == MDB_GET_BOTH || rc > 0)
5608 return MDB_NOTFOUND;
5615 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5616 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5621 /* The key already matches in all other cases */
5622 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
5623 MDB_GET_KEY(leaf, key);
5624 DPRINTF(("==> cursor placed on key [%s]", DKEY(key)));
5629 /** Move the cursor to the first item in the database. */
5631 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5637 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5639 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5640 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
5641 if (rc != MDB_SUCCESS)
5644 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
5646 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
5647 mc->mc_flags |= C_INITIALIZED;
5648 mc->mc_flags &= ~C_EOF;
5650 mc->mc_ki[mc->mc_top] = 0;
5652 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5653 key->mv_size = mc->mc_db->md_pad;
5654 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
5659 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5660 mdb_xcursor_init1(mc, leaf);
5661 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5665 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5669 MDB_GET_KEY(leaf, key);
5673 /** Move the cursor to the last item in the database. */
5675 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5681 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5683 if (!(mc->mc_flags & C_EOF)) {
5685 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5686 rc = mdb_page_search(mc, NULL, MDB_PS_LAST);
5687 if (rc != MDB_SUCCESS)
5690 mdb_cassert(mc, IS_LEAF(mc->mc_pg[mc->mc_top]));
5693 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
5694 mc->mc_flags |= C_INITIALIZED|C_EOF;
5695 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5697 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5698 key->mv_size = mc->mc_db->md_pad;
5699 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
5704 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5705 mdb_xcursor_init1(mc, leaf);
5706 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5710 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5715 MDB_GET_KEY(leaf, key);
5720 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5725 int (*mfunc)(MDB_cursor *mc, MDB_val *key, MDB_val *data);
5730 if (mc->mc_txn->mt_flags & MDB_TXN_ERROR)
5734 case MDB_GET_CURRENT:
5735 if (!(mc->mc_flags & C_INITIALIZED)) {
5738 MDB_page *mp = mc->mc_pg[mc->mc_top];
5739 int nkeys = NUMKEYS(mp);
5740 if (!nkeys || mc->mc_ki[mc->mc_top] >= nkeys) {
5741 mc->mc_ki[mc->mc_top] = nkeys;
5747 key->mv_size = mc->mc_db->md_pad;
5748 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5750 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5751 MDB_GET_KEY(leaf, key);
5753 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5754 if (mc->mc_flags & C_DEL)
5755 mdb_xcursor_init1(mc, leaf);
5756 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
5758 rc = mdb_node_read(mc->mc_txn, leaf, data);
5765 case MDB_GET_BOTH_RANGE:
5770 if (mc->mc_xcursor == NULL) {
5771 rc = MDB_INCOMPATIBLE;
5781 rc = mdb_cursor_set(mc, key, data, op,
5782 op == MDB_SET_RANGE ? NULL : &exact);
5785 case MDB_GET_MULTIPLE:
5786 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5790 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5791 rc = MDB_INCOMPATIBLE;
5795 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
5796 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
5799 case MDB_NEXT_MULTIPLE:
5804 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5805 rc = MDB_INCOMPATIBLE;
5808 if (!(mc->mc_flags & C_INITIALIZED))
5809 rc = mdb_cursor_first(mc, key, data);
5811 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
5812 if (rc == MDB_SUCCESS) {
5813 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
5816 mx = &mc->mc_xcursor->mx_cursor;
5817 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
5819 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
5820 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
5828 case MDB_NEXT_NODUP:
5829 if (!(mc->mc_flags & C_INITIALIZED))
5830 rc = mdb_cursor_first(mc, key, data);
5832 rc = mdb_cursor_next(mc, key, data, op);
5836 case MDB_PREV_NODUP:
5837 if (!(mc->mc_flags & C_INITIALIZED)) {
5838 rc = mdb_cursor_last(mc, key, data);
5841 mc->mc_flags |= C_INITIALIZED;
5842 mc->mc_ki[mc->mc_top]++;
5844 rc = mdb_cursor_prev(mc, key, data, op);
5847 rc = mdb_cursor_first(mc, key, data);
5850 mfunc = mdb_cursor_first;
5852 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5856 if (mc->mc_xcursor == NULL) {
5857 rc = MDB_INCOMPATIBLE;
5861 MDB_node *leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5862 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5863 MDB_GET_KEY(leaf, key);
5865 rc = mdb_node_read(mc->mc_txn, leaf, data);
5869 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
5873 rc = mfunc(&mc->mc_xcursor->mx_cursor, data, NULL);
5876 rc = mdb_cursor_last(mc, key, data);
5879 mfunc = mdb_cursor_last;
5882 DPRINTF(("unhandled/unimplemented cursor operation %u", op));
5887 if (mc->mc_flags & C_DEL)
5888 mc->mc_flags ^= C_DEL;
5893 /** Touch all the pages in the cursor stack. Set mc_top.
5894 * Makes sure all the pages are writable, before attempting a write operation.
5895 * @param[in] mc The cursor to operate on.
5898 mdb_cursor_touch(MDB_cursor *mc)
5900 int rc = MDB_SUCCESS;
5902 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
5905 if (TXN_DBI_CHANGED(mc->mc_txn, mc->mc_dbi))
5907 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, &mcx);
5908 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
5911 *mc->mc_dbflag |= DB_DIRTY;
5916 rc = mdb_page_touch(mc);
5917 } while (!rc && ++(mc->mc_top) < mc->mc_snum);
5918 mc->mc_top = mc->mc_snum-1;
5923 /** Do not spill pages to disk if txn is getting full, may fail instead */
5924 #define MDB_NOSPILL 0x8000
5927 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5930 enum { MDB_NO_ROOT = MDB_LAST_ERRCODE+10 }; /* internal code */
5932 MDB_node *leaf = NULL;
5935 MDB_val xdata, *rdata, dkey, olddata;
5937 int do_sub = 0, insert_key, insert_data;
5938 unsigned int mcount = 0, dcount = 0, nospill;
5941 unsigned int nflags;
5944 if (mc == NULL || key == NULL)
5947 env = mc->mc_txn->mt_env;
5949 /* Check this first so counter will always be zero on any
5952 if (flags & MDB_MULTIPLE) {
5953 dcount = data[1].mv_size;
5954 data[1].mv_size = 0;
5955 if (!F_ISSET(mc->mc_db->md_flags, MDB_DUPFIXED))
5956 return MDB_INCOMPATIBLE;
5959 nospill = flags & MDB_NOSPILL;
5960 flags &= ~MDB_NOSPILL;
5962 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
5963 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
5965 if (key->mv_size-1 >= ENV_MAXKEY(env))
5966 return MDB_BAD_VALSIZE;
5968 #if SIZE_MAX > MAXDATASIZE
5969 if (data->mv_size > ((mc->mc_db->md_flags & MDB_DUPSORT) ? ENV_MAXKEY(env) : MAXDATASIZE))
5970 return MDB_BAD_VALSIZE;
5972 if ((mc->mc_db->md_flags & MDB_DUPSORT) && data->mv_size > ENV_MAXKEY(env))
5973 return MDB_BAD_VALSIZE;
5976 DPRINTF(("==> put db %d key [%s], size %"Z"u, data size %"Z"u",
5977 DDBI(mc), DKEY(key), key ? key->mv_size : 0, data->mv_size));
5981 if (flags == MDB_CURRENT) {
5982 if (!(mc->mc_flags & C_INITIALIZED))
5985 } else if (mc->mc_db->md_root == P_INVALID) {
5986 /* new database, cursor has nothing to point to */
5989 mc->mc_flags &= ~C_INITIALIZED;
5994 if (flags & MDB_APPEND) {
5996 rc = mdb_cursor_last(mc, &k2, &d2);
5998 rc = mc->mc_dbx->md_cmp(key, &k2);
6001 mc->mc_ki[mc->mc_top]++;
6003 /* new key is <= last key */
6008 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
6010 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
6011 DPRINTF(("duplicate key [%s]", DKEY(key)));
6013 return MDB_KEYEXIST;
6015 if (rc && rc != MDB_NOTFOUND)
6019 if (mc->mc_flags & C_DEL)
6020 mc->mc_flags ^= C_DEL;
6022 /* Cursor is positioned, check for room in the dirty list */
6024 if (flags & MDB_MULTIPLE) {
6026 xdata.mv_size = data->mv_size * dcount;
6030 if ((rc2 = mdb_page_spill(mc, key, rdata)))
6034 if (rc == MDB_NO_ROOT) {
6036 /* new database, write a root leaf page */
6037 DPUTS("allocating new root leaf page");
6038 if ((rc2 = mdb_page_new(mc, P_LEAF, 1, &np))) {
6041 mdb_cursor_push(mc, np);
6042 mc->mc_db->md_root = np->mp_pgno;
6043 mc->mc_db->md_depth++;
6044 *mc->mc_dbflag |= DB_DIRTY;
6045 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
6047 np->mp_flags |= P_LEAF2;
6048 mc->mc_flags |= C_INITIALIZED;
6050 /* make sure all cursor pages are writable */
6051 rc2 = mdb_cursor_touch(mc);
6056 insert_key = insert_data = rc;
6058 /* The key does not exist */
6059 DPRINTF(("inserting key at index %i", mc->mc_ki[mc->mc_top]));
6060 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
6061 LEAFSIZE(key, data) > env->me_nodemax)
6063 /* Too big for a node, insert in sub-DB. Set up an empty
6064 * "old sub-page" for prep_subDB to expand to a full page.
6066 fp_flags = P_LEAF|P_DIRTY;
6068 fp->mp_pad = data->mv_size; /* used if MDB_DUPFIXED */
6069 fp->mp_lower = fp->mp_upper = (PAGEHDRSZ-PAGEBASE);
6070 olddata.mv_size = PAGEHDRSZ;
6074 /* there's only a key anyway, so this is a no-op */
6075 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
6077 unsigned int ksize = mc->mc_db->md_pad;
6078 if (key->mv_size != ksize)
6079 return MDB_BAD_VALSIZE;
6080 ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
6081 memcpy(ptr, key->mv_data, ksize);
6083 /* if overwriting slot 0 of leaf, need to
6084 * update branch key if there is a parent page
6086 if (mc->mc_top && !mc->mc_ki[mc->mc_top]) {
6087 unsigned short top = mc->mc_top;
6089 /* slot 0 is always an empty key, find real slot */
6090 while (mc->mc_top && !mc->mc_ki[mc->mc_top])
6092 if (mc->mc_ki[mc->mc_top])
6093 rc2 = mdb_update_key(mc, key);
6104 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6105 olddata.mv_size = NODEDSZ(leaf);
6106 olddata.mv_data = NODEDATA(leaf);
6109 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
6110 /* Prepare (sub-)page/sub-DB to accept the new item,
6111 * if needed. fp: old sub-page or a header faking
6112 * it. mp: new (sub-)page. offset: growth in page
6113 * size. xdata: node data with new page or DB.
6115 unsigned i, offset = 0;
6116 mp = fp = xdata.mv_data = env->me_pbuf;
6117 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
6119 /* Was a single item before, must convert now */
6120 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6121 /* Just overwrite the current item */
6122 if (flags == MDB_CURRENT)
6125 #if UINT_MAX < SIZE_MAX
6126 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && olddata.mv_size == sizeof(size_t))
6127 mc->mc_dbx->md_dcmp = mdb_cmp_clong;
6129 /* does data match? */
6130 if (!mc->mc_dbx->md_dcmp(data, &olddata)) {
6131 if (flags & MDB_NODUPDATA)
6132 return MDB_KEYEXIST;
6137 /* Back up original data item */
6138 dkey.mv_size = olddata.mv_size;
6139 dkey.mv_data = memcpy(fp+1, olddata.mv_data, olddata.mv_size);
6141 /* Make sub-page header for the dup items, with dummy body */
6142 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
6143 fp->mp_lower = (PAGEHDRSZ-PAGEBASE);
6144 xdata.mv_size = PAGEHDRSZ + dkey.mv_size + data->mv_size;
6145 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6146 fp->mp_flags |= P_LEAF2;
6147 fp->mp_pad = data->mv_size;
6148 xdata.mv_size += 2 * data->mv_size; /* leave space for 2 more */
6150 xdata.mv_size += 2 * (sizeof(indx_t) + NODESIZE) +
6151 (dkey.mv_size & 1) + (data->mv_size & 1);
6153 fp->mp_upper = xdata.mv_size - PAGEBASE;
6154 olddata.mv_size = xdata.mv_size; /* pretend olddata is fp */
6155 } else if (leaf->mn_flags & F_SUBDATA) {
6156 /* Data is on sub-DB, just store it */
6157 flags |= F_DUPDATA|F_SUBDATA;
6160 /* Data is on sub-page */
6161 fp = olddata.mv_data;
6164 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
6165 offset = EVEN(NODESIZE + sizeof(indx_t) +
6169 offset = fp->mp_pad;
6170 if (SIZELEFT(fp) < offset) {
6171 offset *= 4; /* space for 4 more */
6174 /* FALLTHRU: Big enough MDB_DUPFIXED sub-page */
6176 fp->mp_flags |= P_DIRTY;
6177 COPY_PGNO(fp->mp_pgno, mp->mp_pgno);
6178 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
6182 xdata.mv_size = olddata.mv_size + offset;
6185 fp_flags = fp->mp_flags;
6186 if (NODESIZE + NODEKSZ(leaf) + xdata.mv_size > env->me_nodemax) {
6187 /* Too big for a sub-page, convert to sub-DB */
6188 fp_flags &= ~P_SUBP;
6190 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6191 fp_flags |= P_LEAF2;
6192 dummy.md_pad = fp->mp_pad;
6193 dummy.md_flags = MDB_DUPFIXED;
6194 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
6195 dummy.md_flags |= MDB_INTEGERKEY;
6201 dummy.md_branch_pages = 0;
6202 dummy.md_leaf_pages = 1;
6203 dummy.md_overflow_pages = 0;
6204 dummy.md_entries = NUMKEYS(fp);
6205 xdata.mv_size = sizeof(MDB_db);
6206 xdata.mv_data = &dummy;
6207 if ((rc = mdb_page_alloc(mc, 1, &mp)))
6209 offset = env->me_psize - olddata.mv_size;
6210 flags |= F_DUPDATA|F_SUBDATA;
6211 dummy.md_root = mp->mp_pgno;
6214 mp->mp_flags = fp_flags | P_DIRTY;
6215 mp->mp_pad = fp->mp_pad;
6216 mp->mp_lower = fp->mp_lower;
6217 mp->mp_upper = fp->mp_upper + offset;
6218 if (fp_flags & P_LEAF2) {
6219 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
6221 memcpy((char *)mp + mp->mp_upper + PAGEBASE, (char *)fp + fp->mp_upper + PAGEBASE,
6222 olddata.mv_size - fp->mp_upper - PAGEBASE);
6223 for (i=0; i<NUMKEYS(fp); i++)
6224 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
6232 mdb_node_del(mc, 0);
6236 /* overflow page overwrites need special handling */
6237 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6240 int level, ovpages, dpages = OVPAGES(data->mv_size, env->me_psize);
6242 memcpy(&pg, olddata.mv_data, sizeof(pg));
6243 if ((rc2 = mdb_page_get(mc->mc_txn, pg, &omp, &level)) != 0)
6245 ovpages = omp->mp_pages;
6247 /* Is the ov page large enough? */
6248 if (ovpages >= dpages) {
6249 if (!(omp->mp_flags & P_DIRTY) &&
6250 (level || (env->me_flags & MDB_WRITEMAP)))
6252 rc = mdb_page_unspill(mc->mc_txn, omp, &omp);
6255 level = 0; /* dirty in this txn or clean */
6258 if (omp->mp_flags & P_DIRTY) {
6259 /* yes, overwrite it. Note in this case we don't
6260 * bother to try shrinking the page if the new data
6261 * is smaller than the overflow threshold.
6264 /* It is writable only in a parent txn */
6265 size_t sz = (size_t) env->me_psize * ovpages, off;
6266 MDB_page *np = mdb_page_malloc(mc->mc_txn, ovpages);
6272 rc2 = mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &id2);
6273 mdb_cassert(mc, rc2 == 0);
6274 if (!(flags & MDB_RESERVE)) {
6275 /* Copy end of page, adjusting alignment so
6276 * compiler may copy words instead of bytes.
6278 off = (PAGEHDRSZ + data->mv_size) & -sizeof(size_t);
6279 memcpy((size_t *)((char *)np + off),
6280 (size_t *)((char *)omp + off), sz - off);
6283 memcpy(np, omp, sz); /* Copy beginning of page */
6286 SETDSZ(leaf, data->mv_size);
6287 if (F_ISSET(flags, MDB_RESERVE))
6288 data->mv_data = METADATA(omp);
6290 memcpy(METADATA(omp), data->mv_data, data->mv_size);
6294 if ((rc2 = mdb_ovpage_free(mc, omp)) != MDB_SUCCESS)
6296 } else if (data->mv_size == olddata.mv_size) {
6297 /* same size, just replace it. Note that we could
6298 * also reuse this node if the new data is smaller,
6299 * but instead we opt to shrink the node in that case.
6301 if (F_ISSET(flags, MDB_RESERVE))
6302 data->mv_data = olddata.mv_data;
6303 else if (!(mc->mc_flags & C_SUB))
6304 memcpy(olddata.mv_data, data->mv_data, data->mv_size);
6306 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
6311 mdb_node_del(mc, 0);
6317 nflags = flags & NODE_ADD_FLAGS;
6318 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(env, key, rdata);
6319 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
6320 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
6321 nflags &= ~MDB_APPEND; /* sub-page may need room to grow */
6323 nflags |= MDB_SPLIT_REPLACE;
6324 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
6326 /* There is room already in this leaf page. */
6327 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
6328 if (rc == 0 && insert_key) {
6329 /* Adjust other cursors pointing to mp */
6330 MDB_cursor *m2, *m3;
6331 MDB_dbi dbi = mc->mc_dbi;
6332 unsigned i = mc->mc_top;
6333 MDB_page *mp = mc->mc_pg[i];
6335 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6336 if (mc->mc_flags & C_SUB)
6337 m3 = &m2->mc_xcursor->mx_cursor;
6340 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
6341 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
6348 if (rc == MDB_SUCCESS) {
6349 /* Now store the actual data in the child DB. Note that we're
6350 * storing the user data in the keys field, so there are strict
6351 * size limits on dupdata. The actual data fields of the child
6352 * DB are all zero size.
6360 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6361 if (flags & MDB_CURRENT) {
6362 xflags = MDB_CURRENT|MDB_NOSPILL;
6364 mdb_xcursor_init1(mc, leaf);
6365 xflags = (flags & MDB_NODUPDATA) ?
6366 MDB_NOOVERWRITE|MDB_NOSPILL : MDB_NOSPILL;
6368 /* converted, write the original data first */
6370 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
6374 /* Adjust other cursors pointing to mp */
6376 unsigned i = mc->mc_top;
6377 MDB_page *mp = mc->mc_pg[i];
6379 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6380 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6381 if (!(m2->mc_flags & C_INITIALIZED)) continue;
6382 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
6383 mdb_xcursor_init1(m2, leaf);
6387 /* we've done our job */
6390 ecount = mc->mc_xcursor->mx_db.md_entries;
6391 if (flags & MDB_APPENDDUP)
6392 xflags |= MDB_APPEND;
6393 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
6394 if (flags & F_SUBDATA) {
6395 void *db = NODEDATA(leaf);
6396 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6398 insert_data = mc->mc_xcursor->mx_db.md_entries - ecount;
6400 /* Increment count unless we just replaced an existing item. */
6402 mc->mc_db->md_entries++;
6404 /* Invalidate txn if we created an empty sub-DB */
6407 /* If we succeeded and the key didn't exist before,
6408 * make sure the cursor is marked valid.
6410 mc->mc_flags |= C_INITIALIZED;
6412 if (flags & MDB_MULTIPLE) {
6415 /* let caller know how many succeeded, if any */
6416 data[1].mv_size = mcount;
6417 if (mcount < dcount) {
6418 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
6419 insert_key = insert_data = 0;
6426 if (rc == MDB_KEYEXIST) /* should not happen, we deleted that item */
6429 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6434 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
6440 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
6441 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6443 if (!(mc->mc_flags & C_INITIALIZED))
6446 if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6447 return MDB_NOTFOUND;
6449 if (!(flags & MDB_NOSPILL) && (rc = mdb_page_spill(mc, NULL, NULL)))
6452 rc = mdb_cursor_touch(mc);
6456 mp = mc->mc_pg[mc->mc_top];
6459 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6461 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6462 if (flags & MDB_NODUPDATA) {
6463 /* mdb_cursor_del0() will subtract the final entry */
6464 mc->mc_db->md_entries -= mc->mc_xcursor->mx_db.md_entries - 1;
6466 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
6467 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6469 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, MDB_NOSPILL);
6472 /* If sub-DB still has entries, we're done */
6473 if (mc->mc_xcursor->mx_db.md_entries) {
6474 if (leaf->mn_flags & F_SUBDATA) {
6475 /* update subDB info */
6476 void *db = NODEDATA(leaf);
6477 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6480 /* shrink fake page */
6481 mdb_node_shrink(mp, mc->mc_ki[mc->mc_top]);
6482 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6483 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6484 /* fix other sub-DB cursors pointed at this fake page */
6485 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6486 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6487 if (m2->mc_pg[mc->mc_top] == mp &&
6488 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
6489 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6492 mc->mc_db->md_entries--;
6493 mc->mc_flags |= C_DEL;
6496 /* otherwise fall thru and delete the sub-DB */
6499 if (leaf->mn_flags & F_SUBDATA) {
6500 /* add all the child DB's pages to the free list */
6501 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6507 /* add overflow pages to free list */
6508 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6512 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6513 if ((rc = mdb_page_get(mc->mc_txn, pg, &omp, NULL)) ||
6514 (rc = mdb_ovpage_free(mc, omp)))
6519 return mdb_cursor_del0(mc);
6522 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6526 /** Allocate and initialize new pages for a database.
6527 * @param[in] mc a cursor on the database being added to.
6528 * @param[in] flags flags defining what type of page is being allocated.
6529 * @param[in] num the number of pages to allocate. This is usually 1,
6530 * unless allocating overflow pages for a large record.
6531 * @param[out] mp Address of a page, or NULL on failure.
6532 * @return 0 on success, non-zero on failure.
6535 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
6540 if ((rc = mdb_page_alloc(mc, num, &np)))
6542 DPRINTF(("allocated new mpage %"Z"u, page size %u",
6543 np->mp_pgno, mc->mc_txn->mt_env->me_psize));
6544 np->mp_flags = flags | P_DIRTY;
6545 np->mp_lower = (PAGEHDRSZ-PAGEBASE);
6546 np->mp_upper = mc->mc_txn->mt_env->me_psize - PAGEBASE;
6549 mc->mc_db->md_branch_pages++;
6550 else if (IS_LEAF(np))
6551 mc->mc_db->md_leaf_pages++;
6552 else if (IS_OVERFLOW(np)) {
6553 mc->mc_db->md_overflow_pages += num;
6561 /** Calculate the size of a leaf node.
6562 * The size depends on the environment's page size; if a data item
6563 * is too large it will be put onto an overflow page and the node
6564 * size will only include the key and not the data. Sizes are always
6565 * rounded up to an even number of bytes, to guarantee 2-byte alignment
6566 * of the #MDB_node headers.
6567 * @param[in] env The environment handle.
6568 * @param[in] key The key for the node.
6569 * @param[in] data The data for the node.
6570 * @return The number of bytes needed to store the node.
6573 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
6577 sz = LEAFSIZE(key, data);
6578 if (sz > env->me_nodemax) {
6579 /* put on overflow page */
6580 sz -= data->mv_size - sizeof(pgno_t);
6583 return EVEN(sz + sizeof(indx_t));
6586 /** Calculate the size of a branch node.
6587 * The size should depend on the environment's page size but since
6588 * we currently don't support spilling large keys onto overflow
6589 * pages, it's simply the size of the #MDB_node header plus the
6590 * size of the key. Sizes are always rounded up to an even number
6591 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
6592 * @param[in] env The environment handle.
6593 * @param[in] key The key for the node.
6594 * @return The number of bytes needed to store the node.
6597 mdb_branch_size(MDB_env *env, MDB_val *key)
6602 if (sz > env->me_nodemax) {
6603 /* put on overflow page */
6604 /* not implemented */
6605 /* sz -= key->size - sizeof(pgno_t); */
6608 return sz + sizeof(indx_t);
6611 /** Add a node to the page pointed to by the cursor.
6612 * @param[in] mc The cursor for this operation.
6613 * @param[in] indx The index on the page where the new node should be added.
6614 * @param[in] key The key for the new node.
6615 * @param[in] data The data for the new node, if any.
6616 * @param[in] pgno The page number, if adding a branch node.
6617 * @param[in] flags Flags for the node.
6618 * @return 0 on success, non-zero on failure. Possible errors are:
6620 * <li>ENOMEM - failed to allocate overflow pages for the node.
6621 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
6622 * should never happen since all callers already calculate the
6623 * page's free space before calling this function.
6627 mdb_node_add(MDB_cursor *mc, indx_t indx,
6628 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
6631 size_t node_size = NODESIZE;
6635 MDB_page *mp = mc->mc_pg[mc->mc_top];
6636 MDB_page *ofp = NULL; /* overflow page */
6639 mdb_cassert(mc, mp->mp_upper >= mp->mp_lower);
6641 DPRINTF(("add to %s %spage %"Z"u index %i, data size %"Z"u key size %"Z"u [%s]",
6642 IS_LEAF(mp) ? "leaf" : "branch",
6643 IS_SUBP(mp) ? "sub-" : "",
6644 mdb_dbg_pgno(mp), indx, data ? data->mv_size : 0,
6645 key ? key->mv_size : 0, key ? DKEY(key) : "null"));
6648 /* Move higher keys up one slot. */
6649 int ksize = mc->mc_db->md_pad, dif;
6650 char *ptr = LEAF2KEY(mp, indx, ksize);
6651 dif = NUMKEYS(mp) - indx;
6653 memmove(ptr+ksize, ptr, dif*ksize);
6654 /* insert new key */
6655 memcpy(ptr, key->mv_data, ksize);
6657 /* Just using these for counting */
6658 mp->mp_lower += sizeof(indx_t);
6659 mp->mp_upper -= ksize - sizeof(indx_t);
6663 room = (ssize_t)SIZELEFT(mp) - (ssize_t)sizeof(indx_t);
6665 node_size += key->mv_size;
6667 mdb_cassert(mc, data);
6668 if (F_ISSET(flags, F_BIGDATA)) {
6669 /* Data already on overflow page. */
6670 node_size += sizeof(pgno_t);
6671 } else if (node_size + data->mv_size > mc->mc_txn->mt_env->me_nodemax) {
6672 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
6674 /* Put data on overflow page. */
6675 DPRINTF(("data size is %"Z"u, node would be %"Z"u, put data on overflow page",
6676 data->mv_size, node_size+data->mv_size));
6677 node_size = EVEN(node_size + sizeof(pgno_t));
6678 if ((ssize_t)node_size > room)
6680 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
6682 DPRINTF(("allocated overflow page %"Z"u", ofp->mp_pgno));
6686 node_size += data->mv_size;
6689 node_size = EVEN(node_size);
6690 if ((ssize_t)node_size > room)
6694 /* Move higher pointers up one slot. */
6695 for (i = NUMKEYS(mp); i > indx; i--)
6696 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
6698 /* Adjust free space offsets. */
6699 ofs = mp->mp_upper - node_size;
6700 mdb_cassert(mc, ofs >= mp->mp_lower + sizeof(indx_t));
6701 mp->mp_ptrs[indx] = ofs;
6703 mp->mp_lower += sizeof(indx_t);
6705 /* Write the node data. */
6706 node = NODEPTR(mp, indx);
6707 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
6708 node->mn_flags = flags;
6710 SETDSZ(node,data->mv_size);
6715 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
6718 mdb_cassert(mc, key);
6720 if (F_ISSET(flags, F_BIGDATA))
6721 memcpy(node->mn_data + key->mv_size, data->mv_data,
6723 else if (F_ISSET(flags, MDB_RESERVE))
6724 data->mv_data = node->mn_data + key->mv_size;
6726 memcpy(node->mn_data + key->mv_size, data->mv_data,
6729 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
6731 if (F_ISSET(flags, MDB_RESERVE))
6732 data->mv_data = METADATA(ofp);
6734 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
6741 DPRINTF(("not enough room in page %"Z"u, got %u ptrs",
6742 mdb_dbg_pgno(mp), NUMKEYS(mp)));
6743 DPRINTF(("upper-lower = %u - %u = %"Z"d", mp->mp_upper,mp->mp_lower,room));
6744 DPRINTF(("node size = %"Z"u", node_size));
6745 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6746 return MDB_PAGE_FULL;
6749 /** Delete the specified node from a page.
6750 * @param[in] mc Cursor pointing to the node to delete.
6751 * @param[in] ksize The size of a node. Only used if the page is
6752 * part of a #MDB_DUPFIXED database.
6755 mdb_node_del(MDB_cursor *mc, int ksize)
6757 MDB_page *mp = mc->mc_pg[mc->mc_top];
6758 indx_t indx = mc->mc_ki[mc->mc_top];
6760 indx_t i, j, numkeys, ptr;
6764 DPRINTF(("delete node %u on %s page %"Z"u", indx,
6765 IS_LEAF(mp) ? "leaf" : "branch", mdb_dbg_pgno(mp)));
6766 numkeys = NUMKEYS(mp);
6767 mdb_cassert(mc, indx < numkeys);
6770 int x = numkeys - 1 - indx;
6771 base = LEAF2KEY(mp, indx, ksize);
6773 memmove(base, base + ksize, x * ksize);
6774 mp->mp_lower -= sizeof(indx_t);
6775 mp->mp_upper += ksize - sizeof(indx_t);
6779 node = NODEPTR(mp, indx);
6780 sz = NODESIZE + node->mn_ksize;
6782 if (F_ISSET(node->mn_flags, F_BIGDATA))
6783 sz += sizeof(pgno_t);
6785 sz += NODEDSZ(node);
6789 ptr = mp->mp_ptrs[indx];
6790 for (i = j = 0; i < numkeys; i++) {
6792 mp->mp_ptrs[j] = mp->mp_ptrs[i];
6793 if (mp->mp_ptrs[i] < ptr)
6794 mp->mp_ptrs[j] += sz;
6799 base = (char *)mp + mp->mp_upper + PAGEBASE;
6800 memmove(base + sz, base, ptr - mp->mp_upper);
6802 mp->mp_lower -= sizeof(indx_t);
6806 /** Compact the main page after deleting a node on a subpage.
6807 * @param[in] mp The main page to operate on.
6808 * @param[in] indx The index of the subpage on the main page.
6811 mdb_node_shrink(MDB_page *mp, indx_t indx)
6817 indx_t i, numkeys, ptr;
6819 node = NODEPTR(mp, indx);
6820 sp = (MDB_page *)NODEDATA(node);
6821 delta = SIZELEFT(sp);
6822 xp = (MDB_page *)((char *)sp + delta);
6824 /* shift subpage upward */
6826 nsize = NUMKEYS(sp) * sp->mp_pad;
6828 return; /* do not make the node uneven-sized */
6829 memmove(METADATA(xp), METADATA(sp), nsize);
6832 numkeys = NUMKEYS(sp);
6833 for (i=numkeys-1; i>=0; i--)
6834 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
6836 xp->mp_upper = sp->mp_lower;
6837 xp->mp_lower = sp->mp_lower;
6838 xp->mp_flags = sp->mp_flags;
6839 xp->mp_pad = sp->mp_pad;
6840 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
6842 nsize = NODEDSZ(node) - delta;
6843 SETDSZ(node, nsize);
6845 /* shift lower nodes upward */
6846 ptr = mp->mp_ptrs[indx];
6847 numkeys = NUMKEYS(mp);
6848 for (i = 0; i < numkeys; i++) {
6849 if (mp->mp_ptrs[i] <= ptr)
6850 mp->mp_ptrs[i] += delta;
6853 base = (char *)mp + mp->mp_upper + PAGEBASE;
6854 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
6855 mp->mp_upper += delta;
6858 /** Initial setup of a sorted-dups cursor.
6859 * Sorted duplicates are implemented as a sub-database for the given key.
6860 * The duplicate data items are actually keys of the sub-database.
6861 * Operations on the duplicate data items are performed using a sub-cursor
6862 * initialized when the sub-database is first accessed. This function does
6863 * the preliminary setup of the sub-cursor, filling in the fields that
6864 * depend only on the parent DB.
6865 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
6868 mdb_xcursor_init0(MDB_cursor *mc)
6870 MDB_xcursor *mx = mc->mc_xcursor;
6872 mx->mx_cursor.mc_xcursor = NULL;
6873 mx->mx_cursor.mc_txn = mc->mc_txn;
6874 mx->mx_cursor.mc_db = &mx->mx_db;
6875 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
6876 mx->mx_cursor.mc_dbi = mc->mc_dbi;
6877 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
6878 mx->mx_cursor.mc_snum = 0;
6879 mx->mx_cursor.mc_top = 0;
6880 mx->mx_cursor.mc_flags = C_SUB;
6881 mx->mx_dbx.md_name.mv_size = 0;
6882 mx->mx_dbx.md_name.mv_data = NULL;
6883 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
6884 mx->mx_dbx.md_dcmp = NULL;
6885 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
6888 /** Final setup of a sorted-dups cursor.
6889 * Sets up the fields that depend on the data from the main cursor.
6890 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
6891 * @param[in] node The data containing the #MDB_db record for the
6892 * sorted-dup database.
6895 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
6897 MDB_xcursor *mx = mc->mc_xcursor;
6899 if (node->mn_flags & F_SUBDATA) {
6900 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
6901 mx->mx_cursor.mc_pg[0] = 0;
6902 mx->mx_cursor.mc_snum = 0;
6903 mx->mx_cursor.mc_top = 0;
6904 mx->mx_cursor.mc_flags = C_SUB;
6906 MDB_page *fp = NODEDATA(node);
6907 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
6908 mx->mx_db.md_flags = 0;
6909 mx->mx_db.md_depth = 1;
6910 mx->mx_db.md_branch_pages = 0;
6911 mx->mx_db.md_leaf_pages = 1;
6912 mx->mx_db.md_overflow_pages = 0;
6913 mx->mx_db.md_entries = NUMKEYS(fp);
6914 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
6915 mx->mx_cursor.mc_snum = 1;
6916 mx->mx_cursor.mc_top = 0;
6917 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
6918 mx->mx_cursor.mc_pg[0] = fp;
6919 mx->mx_cursor.mc_ki[0] = 0;
6920 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6921 mx->mx_db.md_flags = MDB_DUPFIXED;
6922 mx->mx_db.md_pad = fp->mp_pad;
6923 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
6924 mx->mx_db.md_flags |= MDB_INTEGERKEY;
6927 DPRINTF(("Sub-db -%u root page %"Z"u", mx->mx_cursor.mc_dbi,
6928 mx->mx_db.md_root));
6929 mx->mx_dbflag = DB_VALID|DB_DIRTY; /* DB_DIRTY guides mdb_cursor_touch */
6930 #if UINT_MAX < SIZE_MAX
6931 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
6932 mx->mx_dbx.md_cmp = mdb_cmp_clong;
6936 /** Initialize a cursor for a given transaction and database. */
6938 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
6941 mc->mc_backup = NULL;
6944 mc->mc_db = &txn->mt_dbs[dbi];
6945 mc->mc_dbx = &txn->mt_dbxs[dbi];
6946 mc->mc_dbflag = &txn->mt_dbflags[dbi];
6951 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
6952 mdb_tassert(txn, mx != NULL);
6953 mc->mc_xcursor = mx;
6954 mdb_xcursor_init0(mc);
6956 mc->mc_xcursor = NULL;
6958 if (*mc->mc_dbflag & DB_STALE) {
6959 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
6964 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
6967 size_t size = sizeof(MDB_cursor);
6969 if (!ret || !TXN_DBI_EXIST(txn, dbi))
6972 if (txn->mt_flags & MDB_TXN_ERROR)
6975 /* Allow read access to the freelist */
6976 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
6979 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
6980 size += sizeof(MDB_xcursor);
6982 if ((mc = malloc(size)) != NULL) {
6983 mdb_cursor_init(mc, txn, dbi, (MDB_xcursor *)(mc + 1));
6984 if (txn->mt_cursors) {
6985 mc->mc_next = txn->mt_cursors[dbi];
6986 txn->mt_cursors[dbi] = mc;
6987 mc->mc_flags |= C_UNTRACK;
6999 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
7001 if (!mc || !TXN_DBI_EXIST(txn, mc->mc_dbi))
7004 if ((mc->mc_flags & C_UNTRACK) || txn->mt_cursors)
7007 if (txn->mt_flags & MDB_TXN_ERROR)
7010 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
7014 /* Return the count of duplicate data items for the current key */
7016 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
7020 if (mc == NULL || countp == NULL)
7023 if (mc->mc_xcursor == NULL)
7024 return MDB_INCOMPATIBLE;
7026 if (mc->mc_txn->mt_flags & MDB_TXN_ERROR)
7029 if (!(mc->mc_flags & C_INITIALIZED))
7032 if (!mc->mc_snum || (mc->mc_flags & C_EOF))
7033 return MDB_NOTFOUND;
7035 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
7036 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
7039 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
7042 *countp = mc->mc_xcursor->mx_db.md_entries;
7048 mdb_cursor_close(MDB_cursor *mc)
7050 if (mc && !mc->mc_backup) {
7051 /* remove from txn, if tracked */
7052 if ((mc->mc_flags & C_UNTRACK) && mc->mc_txn->mt_cursors) {
7053 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
7054 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
7056 *prev = mc->mc_next;
7063 mdb_cursor_txn(MDB_cursor *mc)
7065 if (!mc) return NULL;
7070 mdb_cursor_dbi(MDB_cursor *mc)
7075 /** Replace the key for a branch node with a new key.
7076 * @param[in] mc Cursor pointing to the node to operate on.
7077 * @param[in] key The new key to use.
7078 * @return 0 on success, non-zero on failure.
7081 mdb_update_key(MDB_cursor *mc, MDB_val *key)
7087 int delta, ksize, oksize;
7088 indx_t ptr, i, numkeys, indx;
7091 indx = mc->mc_ki[mc->mc_top];
7092 mp = mc->mc_pg[mc->mc_top];
7093 node = NODEPTR(mp, indx);
7094 ptr = mp->mp_ptrs[indx];
7098 char kbuf2[DKBUF_MAXKEYSIZE*2+1];
7099 k2.mv_data = NODEKEY(node);
7100 k2.mv_size = node->mn_ksize;
7101 DPRINTF(("update key %u (ofs %u) [%s] to [%s] on page %"Z"u",
7103 mdb_dkey(&k2, kbuf2),
7109 /* Sizes must be 2-byte aligned. */
7110 ksize = EVEN(key->mv_size);
7111 oksize = EVEN(node->mn_ksize);
7112 delta = ksize - oksize;
7114 /* Shift node contents if EVEN(key length) changed. */
7116 if (delta > 0 && SIZELEFT(mp) < delta) {
7118 /* not enough space left, do a delete and split */
7119 DPRINTF(("Not enough room, delta = %d, splitting...", delta));
7120 pgno = NODEPGNO(node);
7121 mdb_node_del(mc, 0);
7122 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
7125 numkeys = NUMKEYS(mp);
7126 for (i = 0; i < numkeys; i++) {
7127 if (mp->mp_ptrs[i] <= ptr)
7128 mp->mp_ptrs[i] -= delta;
7131 base = (char *)mp + mp->mp_upper + PAGEBASE;
7132 len = ptr - mp->mp_upper + NODESIZE;
7133 memmove(base - delta, base, len);
7134 mp->mp_upper -= delta;
7136 node = NODEPTR(mp, indx);
7139 /* But even if no shift was needed, update ksize */
7140 if (node->mn_ksize != key->mv_size)
7141 node->mn_ksize = key->mv_size;
7144 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
7150 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
7152 /** Move a node from csrc to cdst.
7155 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
7162 unsigned short flags;
7166 /* Mark src and dst as dirty. */
7167 if ((rc = mdb_page_touch(csrc)) ||
7168 (rc = mdb_page_touch(cdst)))
7171 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7172 key.mv_size = csrc->mc_db->md_pad;
7173 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
7175 data.mv_data = NULL;
7179 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
7180 mdb_cassert(csrc, !((size_t)srcnode & 1));
7181 srcpg = NODEPGNO(srcnode);
7182 flags = srcnode->mn_flags;
7183 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7184 unsigned int snum = csrc->mc_snum;
7186 /* must find the lowest key below src */
7187 rc = mdb_page_search_lowest(csrc);
7190 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7191 key.mv_size = csrc->mc_db->md_pad;
7192 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7194 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7195 key.mv_size = NODEKSZ(s2);
7196 key.mv_data = NODEKEY(s2);
7198 csrc->mc_snum = snum--;
7199 csrc->mc_top = snum;
7201 key.mv_size = NODEKSZ(srcnode);
7202 key.mv_data = NODEKEY(srcnode);
7204 data.mv_size = NODEDSZ(srcnode);
7205 data.mv_data = NODEDATA(srcnode);
7207 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
7208 unsigned int snum = cdst->mc_snum;
7211 /* must find the lowest key below dst */
7212 mdb_cursor_copy(cdst, &mn);
7213 rc = mdb_page_search_lowest(&mn);
7216 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7217 bkey.mv_size = mn.mc_db->md_pad;
7218 bkey.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, bkey.mv_size);
7220 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7221 bkey.mv_size = NODEKSZ(s2);
7222 bkey.mv_data = NODEKEY(s2);
7224 mn.mc_snum = snum--;
7227 rc = mdb_update_key(&mn, &bkey);
7232 DPRINTF(("moving %s node %u [%s] on page %"Z"u to node %u on page %"Z"u",
7233 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
7234 csrc->mc_ki[csrc->mc_top],
7236 csrc->mc_pg[csrc->mc_top]->mp_pgno,
7237 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno));
7239 /* Add the node to the destination page.
7241 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
7242 if (rc != MDB_SUCCESS)
7245 /* Delete the node from the source page.
7247 mdb_node_del(csrc, key.mv_size);
7250 /* Adjust other cursors pointing to mp */
7251 MDB_cursor *m2, *m3;
7252 MDB_dbi dbi = csrc->mc_dbi;
7253 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
7255 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7256 if (csrc->mc_flags & C_SUB)
7257 m3 = &m2->mc_xcursor->mx_cursor;
7260 if (m3 == csrc) continue;
7261 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
7262 csrc->mc_ki[csrc->mc_top]) {
7263 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
7264 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
7269 /* Update the parent separators.
7271 if (csrc->mc_ki[csrc->mc_top] == 0) {
7272 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
7273 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7274 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7276 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7277 key.mv_size = NODEKSZ(srcnode);
7278 key.mv_data = NODEKEY(srcnode);
7280 DPRINTF(("update separator for source page %"Z"u to [%s]",
7281 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key)));
7282 mdb_cursor_copy(csrc, &mn);
7285 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
7288 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7290 indx_t ix = csrc->mc_ki[csrc->mc_top];
7291 nullkey.mv_size = 0;
7292 csrc->mc_ki[csrc->mc_top] = 0;
7293 rc = mdb_update_key(csrc, &nullkey);
7294 csrc->mc_ki[csrc->mc_top] = ix;
7295 mdb_cassert(csrc, rc == MDB_SUCCESS);
7299 if (cdst->mc_ki[cdst->mc_top] == 0) {
7300 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
7301 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7302 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
7304 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
7305 key.mv_size = NODEKSZ(srcnode);
7306 key.mv_data = NODEKEY(srcnode);
7308 DPRINTF(("update separator for destination page %"Z"u to [%s]",
7309 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key)));
7310 mdb_cursor_copy(cdst, &mn);
7313 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
7316 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
7318 indx_t ix = cdst->mc_ki[cdst->mc_top];
7319 nullkey.mv_size = 0;
7320 cdst->mc_ki[cdst->mc_top] = 0;
7321 rc = mdb_update_key(cdst, &nullkey);
7322 cdst->mc_ki[cdst->mc_top] = ix;
7323 mdb_cassert(csrc, rc == MDB_SUCCESS);
7330 /** Merge one page into another.
7331 * The nodes from the page pointed to by \b csrc will
7332 * be copied to the page pointed to by \b cdst and then
7333 * the \b csrc page will be freed.
7334 * @param[in] csrc Cursor pointing to the source page.
7335 * @param[in] cdst Cursor pointing to the destination page.
7336 * @return 0 on success, non-zero on failure.
7339 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
7341 MDB_page *psrc, *pdst;
7348 psrc = csrc->mc_pg[csrc->mc_top];
7349 pdst = cdst->mc_pg[cdst->mc_top];
7351 DPRINTF(("merging page %"Z"u into %"Z"u", psrc->mp_pgno, pdst->mp_pgno));
7353 mdb_cassert(csrc, csrc->mc_snum > 1); /* can't merge root page */
7354 mdb_cassert(csrc, cdst->mc_snum > 1);
7356 /* Mark dst as dirty. */
7357 if ((rc = mdb_page_touch(cdst)))
7360 /* Move all nodes from src to dst.
7362 j = nkeys = NUMKEYS(pdst);
7363 if (IS_LEAF2(psrc)) {
7364 key.mv_size = csrc->mc_db->md_pad;
7365 key.mv_data = METADATA(psrc);
7366 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7367 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
7368 if (rc != MDB_SUCCESS)
7370 key.mv_data = (char *)key.mv_data + key.mv_size;
7373 for (i = 0; i < NUMKEYS(psrc); i++, j++) {
7374 srcnode = NODEPTR(psrc, i);
7375 if (i == 0 && IS_BRANCH(psrc)) {
7378 mdb_cursor_copy(csrc, &mn);
7379 /* must find the lowest key below src */
7380 rc = mdb_page_search_lowest(&mn);
7383 if (IS_LEAF2(mn.mc_pg[mn.mc_top])) {
7384 key.mv_size = mn.mc_db->md_pad;
7385 key.mv_data = LEAF2KEY(mn.mc_pg[mn.mc_top], 0, key.mv_size);
7387 s2 = NODEPTR(mn.mc_pg[mn.mc_top], 0);
7388 key.mv_size = NODEKSZ(s2);
7389 key.mv_data = NODEKEY(s2);
7392 key.mv_size = srcnode->mn_ksize;
7393 key.mv_data = NODEKEY(srcnode);
7396 data.mv_size = NODEDSZ(srcnode);
7397 data.mv_data = NODEDATA(srcnode);
7398 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
7399 if (rc != MDB_SUCCESS)
7404 DPRINTF(("dst page %"Z"u now has %u keys (%.1f%% filled)",
7405 pdst->mp_pgno, NUMKEYS(pdst),
7406 (float)PAGEFILL(cdst->mc_txn->mt_env, pdst) / 10));
7408 /* Unlink the src page from parent and add to free list.
7411 mdb_node_del(csrc, 0);
7412 if (csrc->mc_ki[csrc->mc_top] == 0) {
7414 rc = mdb_update_key(csrc, &key);
7422 psrc = csrc->mc_pg[csrc->mc_top];
7423 /* If not operating on FreeDB, allow this page to be reused
7424 * in this txn. Otherwise just add to free list.
7426 rc = mdb_page_loose(csrc, psrc);
7430 csrc->mc_db->md_leaf_pages--;
7432 csrc->mc_db->md_branch_pages--;
7434 /* Adjust other cursors pointing to mp */
7435 MDB_cursor *m2, *m3;
7436 MDB_dbi dbi = csrc->mc_dbi;
7438 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7439 if (csrc->mc_flags & C_SUB)
7440 m3 = &m2->mc_xcursor->mx_cursor;
7443 if (m3 == csrc) continue;
7444 if (m3->mc_snum < csrc->mc_snum) continue;
7445 if (m3->mc_pg[csrc->mc_top] == psrc) {
7446 m3->mc_pg[csrc->mc_top] = pdst;
7447 m3->mc_ki[csrc->mc_top] += nkeys;
7452 unsigned int snum = cdst->mc_snum;
7453 uint16_t depth = cdst->mc_db->md_depth;
7454 mdb_cursor_pop(cdst);
7455 rc = mdb_rebalance(cdst);
7456 /* Did the tree shrink? */
7457 if (depth > cdst->mc_db->md_depth)
7459 cdst->mc_snum = snum;
7460 cdst->mc_top = snum-1;
7465 /** Copy the contents of a cursor.
7466 * @param[in] csrc The cursor to copy from.
7467 * @param[out] cdst The cursor to copy to.
7470 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
7474 cdst->mc_txn = csrc->mc_txn;
7475 cdst->mc_dbi = csrc->mc_dbi;
7476 cdst->mc_db = csrc->mc_db;
7477 cdst->mc_dbx = csrc->mc_dbx;
7478 cdst->mc_snum = csrc->mc_snum;
7479 cdst->mc_top = csrc->mc_top;
7480 cdst->mc_flags = csrc->mc_flags;
7482 for (i=0; i<csrc->mc_snum; i++) {
7483 cdst->mc_pg[i] = csrc->mc_pg[i];
7484 cdst->mc_ki[i] = csrc->mc_ki[i];
7488 /** Rebalance the tree after a delete operation.
7489 * @param[in] mc Cursor pointing to the page where rebalancing
7491 * @return 0 on success, non-zero on failure.
7494 mdb_rebalance(MDB_cursor *mc)
7498 unsigned int ptop, minkeys;
7502 minkeys = 1 + (IS_BRANCH(mc->mc_pg[mc->mc_top]));
7503 DPRINTF(("rebalancing %s page %"Z"u (has %u keys, %.1f%% full)",
7504 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
7505 mdb_dbg_pgno(mc->mc_pg[mc->mc_top]), NUMKEYS(mc->mc_pg[mc->mc_top]),
7506 (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10));
7508 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD &&
7509 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
7510 DPRINTF(("no need to rebalance page %"Z"u, above fill threshold",
7511 mdb_dbg_pgno(mc->mc_pg[mc->mc_top])));
7515 if (mc->mc_snum < 2) {
7516 MDB_page *mp = mc->mc_pg[0];
7518 DPUTS("Can't rebalance a subpage, ignoring");
7521 if (NUMKEYS(mp) == 0) {
7522 DPUTS("tree is completely empty");
7523 mc->mc_db->md_root = P_INVALID;
7524 mc->mc_db->md_depth = 0;
7525 mc->mc_db->md_leaf_pages = 0;
7526 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7529 /* Adjust cursors pointing to mp */
7532 mc->mc_flags &= ~C_INITIALIZED;
7534 MDB_cursor *m2, *m3;
7535 MDB_dbi dbi = mc->mc_dbi;
7537 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7538 if (mc->mc_flags & C_SUB)
7539 m3 = &m2->mc_xcursor->mx_cursor;
7542 if (m3->mc_snum < mc->mc_snum) continue;
7543 if (m3->mc_pg[0] == mp) {
7546 m3->mc_flags &= ~C_INITIALIZED;
7550 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
7552 DPUTS("collapsing root page!");
7553 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7556 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
7557 rc = mdb_page_get(mc->mc_txn,mc->mc_db->md_root,&mc->mc_pg[0],NULL);
7560 mc->mc_db->md_depth--;
7561 mc->mc_db->md_branch_pages--;
7562 mc->mc_ki[0] = mc->mc_ki[1];
7563 for (i = 1; i<mc->mc_db->md_depth; i++) {
7564 mc->mc_pg[i] = mc->mc_pg[i+1];
7565 mc->mc_ki[i] = mc->mc_ki[i+1];
7568 /* Adjust other cursors pointing to mp */
7569 MDB_cursor *m2, *m3;
7570 MDB_dbi dbi = mc->mc_dbi;
7572 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7573 if (mc->mc_flags & C_SUB)
7574 m3 = &m2->mc_xcursor->mx_cursor;
7577 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
7578 if (m3->mc_pg[0] == mp) {
7581 for (i=0; i<m3->mc_snum; i++) {
7582 m3->mc_pg[i] = m3->mc_pg[i+1];
7583 m3->mc_ki[i] = m3->mc_ki[i+1];
7589 DPUTS("root page doesn't need rebalancing");
7593 /* The parent (branch page) must have at least 2 pointers,
7594 * otherwise the tree is invalid.
7596 ptop = mc->mc_top-1;
7597 mdb_cassert(mc, NUMKEYS(mc->mc_pg[ptop]) > 1);
7599 /* Leaf page fill factor is below the threshold.
7600 * Try to move keys from left or right neighbor, or
7601 * merge with a neighbor page.
7606 mdb_cursor_copy(mc, &mn);
7607 mn.mc_xcursor = NULL;
7609 oldki = mc->mc_ki[mc->mc_top];
7610 if (mc->mc_ki[ptop] == 0) {
7611 /* We're the leftmost leaf in our parent.
7613 DPUTS("reading right neighbor");
7615 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7616 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7619 mn.mc_ki[mn.mc_top] = 0;
7620 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
7622 /* There is at least one neighbor to the left.
7624 DPUTS("reading left neighbor");
7626 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7627 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7630 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
7631 mc->mc_ki[mc->mc_top] = 0;
7634 DPRINTF(("found neighbor page %"Z"u (%u keys, %.1f%% full)",
7635 mn.mc_pg[mn.mc_top]->mp_pgno, NUMKEYS(mn.mc_pg[mn.mc_top]),
7636 (float)PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) / 10));
7638 /* If the neighbor page is above threshold and has enough keys,
7639 * move one key from it. Otherwise we should try to merge them.
7640 * (A branch page must never have less than 2 keys.)
7642 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
7643 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys) {
7644 rc = mdb_node_move(&mn, mc);
7645 if (mc->mc_ki[ptop]) {
7649 if (mc->mc_ki[ptop] == 0) {
7650 rc = mdb_page_merge(&mn, mc);
7652 oldki += NUMKEYS(mn.mc_pg[mn.mc_top]);
7653 mn.mc_ki[mn.mc_top] += mc->mc_ki[mn.mc_top] + 1;
7654 rc = mdb_page_merge(mc, &mn);
7655 mdb_cursor_copy(&mn, mc);
7657 mc->mc_flags &= ~C_EOF;
7659 mc->mc_ki[mc->mc_top] = oldki;
7663 /** Complete a delete operation started by #mdb_cursor_del(). */
7665 mdb_cursor_del0(MDB_cursor *mc)
7672 ki = mc->mc_ki[mc->mc_top];
7673 mdb_node_del(mc, mc->mc_db->md_pad);
7674 mc->mc_db->md_entries--;
7675 rc = mdb_rebalance(mc);
7677 if (rc == MDB_SUCCESS) {
7678 MDB_cursor *m2, *m3;
7679 MDB_dbi dbi = mc->mc_dbi;
7681 mp = mc->mc_pg[mc->mc_top];
7682 nkeys = NUMKEYS(mp);
7684 /* if mc points past last node in page, find next sibling */
7685 if (mc->mc_ki[mc->mc_top] >= nkeys) {
7686 rc = mdb_cursor_sibling(mc, 1);
7687 if (rc == MDB_NOTFOUND) {
7688 mc->mc_flags |= C_EOF;
7693 /* Adjust other cursors pointing to mp */
7694 for (m2 = mc->mc_txn->mt_cursors[dbi]; !rc && m2; m2=m2->mc_next) {
7695 m3 = (mc->mc_flags & C_SUB) ? &m2->mc_xcursor->mx_cursor : m2;
7696 if (! (m2->mc_flags & m3->mc_flags & C_INITIALIZED))
7698 if (m3 == mc || m3->mc_snum < mc->mc_snum)
7700 if (m3->mc_pg[mc->mc_top] == mp) {
7701 if (m3->mc_ki[mc->mc_top] >= ki) {
7702 m3->mc_flags |= C_DEL;
7703 if (m3->mc_ki[mc->mc_top] > ki)
7704 m3->mc_ki[mc->mc_top]--;
7705 else if (mc->mc_db->md_flags & MDB_DUPSORT)
7706 m3->mc_xcursor->mx_cursor.mc_flags |= C_EOF;
7708 if (m3->mc_ki[mc->mc_top] >= nkeys) {
7709 rc = mdb_cursor_sibling(m3, 1);
7710 if (rc == MDB_NOTFOUND) {
7711 m3->mc_flags |= C_EOF;
7717 mc->mc_flags |= C_DEL;
7721 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
7726 mdb_del(MDB_txn *txn, MDB_dbi dbi,
7727 MDB_val *key, MDB_val *data)
7729 if (!key || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
7732 if (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
7733 return (txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
7735 if (!F_ISSET(txn->mt_dbs[dbi].md_flags, MDB_DUPSORT)) {
7736 /* must ignore any data */
7740 return mdb_del0(txn, dbi, key, data, 0);
7744 mdb_del0(MDB_txn *txn, MDB_dbi dbi,
7745 MDB_val *key, MDB_val *data, unsigned flags)
7750 MDB_val rdata, *xdata;
7754 DPRINTF(("====> delete db %u key [%s]", dbi, DKEY(key)));
7756 mdb_cursor_init(&mc, txn, dbi, &mx);
7765 flags |= MDB_NODUPDATA;
7767 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
7769 /* let mdb_page_split know about this cursor if needed:
7770 * delete will trigger a rebalance; if it needs to move
7771 * a node from one page to another, it will have to
7772 * update the parent's separator key(s). If the new sepkey
7773 * is larger than the current one, the parent page may
7774 * run out of space, triggering a split. We need this
7775 * cursor to be consistent until the end of the rebalance.
7777 mc.mc_flags |= C_UNTRACK;
7778 mc.mc_next = txn->mt_cursors[dbi];
7779 txn->mt_cursors[dbi] = &mc;
7780 rc = mdb_cursor_del(&mc, flags);
7781 txn->mt_cursors[dbi] = mc.mc_next;
7786 /** Split a page and insert a new node.
7787 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
7788 * The cursor will be updated to point to the actual page and index where
7789 * the node got inserted after the split.
7790 * @param[in] newkey The key for the newly inserted node.
7791 * @param[in] newdata The data for the newly inserted node.
7792 * @param[in] newpgno The page number, if the new node is a branch node.
7793 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
7794 * @return 0 on success, non-zero on failure.
7797 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
7798 unsigned int nflags)
7801 int rc = MDB_SUCCESS, new_root = 0, did_split = 0;
7804 int i, j, split_indx, nkeys, pmax;
7805 MDB_env *env = mc->mc_txn->mt_env;
7807 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
7808 MDB_page *copy = NULL;
7809 MDB_page *mp, *rp, *pp;
7814 mp = mc->mc_pg[mc->mc_top];
7815 newindx = mc->mc_ki[mc->mc_top];
7816 nkeys = NUMKEYS(mp);
7818 DPRINTF(("-----> splitting %s page %"Z"u and adding [%s] at index %i/%i",
7819 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
7820 DKEY(newkey), mc->mc_ki[mc->mc_top], nkeys));
7822 /* Create a right sibling. */
7823 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
7825 DPRINTF(("new right sibling: page %"Z"u", rp->mp_pgno));
7827 if (mc->mc_snum < 2) {
7828 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
7830 /* shift current top to make room for new parent */
7831 mc->mc_pg[1] = mc->mc_pg[0];
7832 mc->mc_ki[1] = mc->mc_ki[0];
7835 mc->mc_db->md_root = pp->mp_pgno;
7836 DPRINTF(("root split! new root = %"Z"u", pp->mp_pgno));
7837 mc->mc_db->md_depth++;
7840 /* Add left (implicit) pointer. */
7841 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
7842 /* undo the pre-push */
7843 mc->mc_pg[0] = mc->mc_pg[1];
7844 mc->mc_ki[0] = mc->mc_ki[1];
7845 mc->mc_db->md_root = mp->mp_pgno;
7846 mc->mc_db->md_depth--;
7853 ptop = mc->mc_top-1;
7854 DPRINTF(("parent branch page is %"Z"u", mc->mc_pg[ptop]->mp_pgno));
7857 mc->mc_flags |= C_SPLITTING;
7858 mdb_cursor_copy(mc, &mn);
7859 mn.mc_pg[mn.mc_top] = rp;
7860 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
7862 if (nflags & MDB_APPEND) {
7863 mn.mc_ki[mn.mc_top] = 0;
7865 split_indx = newindx;
7869 split_indx = (nkeys+1) / 2;
7874 unsigned int lsize, rsize, ksize;
7875 /* Move half of the keys to the right sibling */
7876 x = mc->mc_ki[mc->mc_top] - split_indx;
7877 ksize = mc->mc_db->md_pad;
7878 split = LEAF2KEY(mp, split_indx, ksize);
7879 rsize = (nkeys - split_indx) * ksize;
7880 lsize = (nkeys - split_indx) * sizeof(indx_t);
7881 mp->mp_lower -= lsize;
7882 rp->mp_lower += lsize;
7883 mp->mp_upper += rsize - lsize;
7884 rp->mp_upper -= rsize - lsize;
7885 sepkey.mv_size = ksize;
7886 if (newindx == split_indx) {
7887 sepkey.mv_data = newkey->mv_data;
7889 sepkey.mv_data = split;
7892 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
7893 memcpy(rp->mp_ptrs, split, rsize);
7894 sepkey.mv_data = rp->mp_ptrs;
7895 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
7896 memcpy(ins, newkey->mv_data, ksize);
7897 mp->mp_lower += sizeof(indx_t);
7898 mp->mp_upper -= ksize - sizeof(indx_t);
7901 memcpy(rp->mp_ptrs, split, x * ksize);
7902 ins = LEAF2KEY(rp, x, ksize);
7903 memcpy(ins, newkey->mv_data, ksize);
7904 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
7905 rp->mp_lower += sizeof(indx_t);
7906 rp->mp_upper -= ksize - sizeof(indx_t);
7907 mc->mc_ki[mc->mc_top] = x;
7908 mc->mc_pg[mc->mc_top] = rp;
7911 int psize, nsize, k;
7912 /* Maximum free space in an empty page */
7913 pmax = env->me_psize - PAGEHDRSZ;
7915 nsize = mdb_leaf_size(env, newkey, newdata);
7917 nsize = mdb_branch_size(env, newkey);
7918 nsize = EVEN(nsize);
7920 /* grab a page to hold a temporary copy */
7921 copy = mdb_page_malloc(mc->mc_txn, 1);
7926 copy->mp_pgno = mp->mp_pgno;
7927 copy->mp_flags = mp->mp_flags;
7928 copy->mp_lower = (PAGEHDRSZ-PAGEBASE);
7929 copy->mp_upper = env->me_psize - PAGEBASE;
7931 /* prepare to insert */
7932 for (i=0, j=0; i<nkeys; i++) {
7934 copy->mp_ptrs[j++] = 0;
7936 copy->mp_ptrs[j++] = mp->mp_ptrs[i];
7939 /* When items are relatively large the split point needs
7940 * to be checked, because being off-by-one will make the
7941 * difference between success or failure in mdb_node_add.
7943 * It's also relevant if a page happens to be laid out
7944 * such that one half of its nodes are all "small" and
7945 * the other half of its nodes are "large." If the new
7946 * item is also "large" and falls on the half with
7947 * "large" nodes, it also may not fit.
7949 * As a final tweak, if the new item goes on the last
7950 * spot on the page (and thus, onto the new page), bias
7951 * the split so the new page is emptier than the old page.
7952 * This yields better packing during sequential inserts.
7954 if (nkeys < 20 || nsize > pmax/16 || newindx >= nkeys) {
7955 /* Find split point */
7957 if (newindx <= split_indx || newindx >= nkeys) {
7959 k = newindx >= nkeys ? nkeys : split_indx+2;
7964 for (; i!=k; i+=j) {
7969 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
7970 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
7972 if (F_ISSET(node->mn_flags, F_BIGDATA))
7973 psize += sizeof(pgno_t);
7975 psize += NODEDSZ(node);
7977 psize = EVEN(psize);
7979 if (psize > pmax || i == k-j) {
7980 split_indx = i + (j<0);
7985 if (split_indx == newindx) {
7986 sepkey.mv_size = newkey->mv_size;
7987 sepkey.mv_data = newkey->mv_data;
7989 node = (MDB_node *)((char *)mp + copy->mp_ptrs[split_indx] + PAGEBASE);
7990 sepkey.mv_size = node->mn_ksize;
7991 sepkey.mv_data = NODEKEY(node);
7996 DPRINTF(("separator is %d [%s]", split_indx, DKEY(&sepkey)));
7998 /* Copy separator key to the parent.
8000 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(env, &sepkey)) {
8004 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
8009 if (mn.mc_snum == mc->mc_snum) {
8010 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
8011 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
8012 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
8013 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
8018 /* Right page might now have changed parent.
8019 * Check if left page also changed parent.
8021 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8022 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8023 for (i=0; i<ptop; i++) {
8024 mc->mc_pg[i] = mn.mc_pg[i];
8025 mc->mc_ki[i] = mn.mc_ki[i];
8027 mc->mc_pg[ptop] = mn.mc_pg[ptop];
8028 if (mn.mc_ki[ptop]) {
8029 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
8031 /* find right page's left sibling */
8032 mc->mc_ki[ptop] = mn.mc_ki[ptop];
8033 mdb_cursor_sibling(mc, 0);
8038 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
8041 mc->mc_flags ^= C_SPLITTING;
8042 if (rc != MDB_SUCCESS) {
8045 if (nflags & MDB_APPEND) {
8046 mc->mc_pg[mc->mc_top] = rp;
8047 mc->mc_ki[mc->mc_top] = 0;
8048 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
8051 for (i=0; i<mc->mc_top; i++)
8052 mc->mc_ki[i] = mn.mc_ki[i];
8053 } else if (!IS_LEAF2(mp)) {
8055 mc->mc_pg[mc->mc_top] = rp;
8060 rkey.mv_data = newkey->mv_data;
8061 rkey.mv_size = newkey->mv_size;
8067 /* Update index for the new key. */
8068 mc->mc_ki[mc->mc_top] = j;
8070 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i] + PAGEBASE);
8071 rkey.mv_data = NODEKEY(node);
8072 rkey.mv_size = node->mn_ksize;
8074 xdata.mv_data = NODEDATA(node);
8075 xdata.mv_size = NODEDSZ(node);
8078 pgno = NODEPGNO(node);
8079 flags = node->mn_flags;
8082 if (!IS_LEAF(mp) && j == 0) {
8083 /* First branch index doesn't need key data. */
8087 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
8093 mc->mc_pg[mc->mc_top] = copy;
8098 } while (i != split_indx);
8100 nkeys = NUMKEYS(copy);
8101 for (i=0; i<nkeys; i++)
8102 mp->mp_ptrs[i] = copy->mp_ptrs[i];
8103 mp->mp_lower = copy->mp_lower;
8104 mp->mp_upper = copy->mp_upper;
8105 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
8106 env->me_psize - copy->mp_upper - PAGEBASE);
8108 /* reset back to original page */
8109 if (newindx < split_indx) {
8110 mc->mc_pg[mc->mc_top] = mp;
8111 if (nflags & MDB_RESERVE) {
8112 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
8113 if (!(node->mn_flags & F_BIGDATA))
8114 newdata->mv_data = NODEDATA(node);
8117 mc->mc_pg[mc->mc_top] = rp;
8119 /* Make sure mc_ki is still valid.
8121 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
8122 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
8123 for (i=0; i<=ptop; i++) {
8124 mc->mc_pg[i] = mn.mc_pg[i];
8125 mc->mc_ki[i] = mn.mc_ki[i];
8132 /* Adjust other cursors pointing to mp */
8133 MDB_cursor *m2, *m3;
8134 MDB_dbi dbi = mc->mc_dbi;
8135 int fixup = NUMKEYS(mp);
8137 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
8138 if (mc->mc_flags & C_SUB)
8139 m3 = &m2->mc_xcursor->mx_cursor;
8144 if (!(m2->mc_flags & m3->mc_flags & C_INITIALIZED))
8146 if (m3->mc_flags & C_SPLITTING)
8151 for (k=m3->mc_top; k>=0; k--) {
8152 m3->mc_ki[k+1] = m3->mc_ki[k];
8153 m3->mc_pg[k+1] = m3->mc_pg[k];
8155 if (m3->mc_ki[0] >= split_indx) {
8160 m3->mc_pg[0] = mc->mc_pg[0];
8164 if (m3->mc_top >= mc->mc_top && m3->mc_pg[mc->mc_top] == mp) {
8165 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
8166 m3->mc_ki[mc->mc_top]++;
8167 if (m3->mc_ki[mc->mc_top] >= fixup) {
8168 m3->mc_pg[mc->mc_top] = rp;
8169 m3->mc_ki[mc->mc_top] -= fixup;
8170 m3->mc_ki[ptop] = mn.mc_ki[ptop];
8172 } else if (!did_split && m3->mc_top >= ptop && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
8173 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
8178 DPRINTF(("mp left: %d, rp left: %d", SIZELEFT(mp), SIZELEFT(rp)));
8181 if (copy) /* tmp page */
8182 mdb_page_free(env, copy);
8184 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
8189 mdb_put(MDB_txn *txn, MDB_dbi dbi,
8190 MDB_val *key, MDB_val *data, unsigned int flags)
8195 if (!key || !data || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
8198 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP)) != flags)
8201 mdb_cursor_init(&mc, txn, dbi, &mx);
8202 return mdb_cursor_put(&mc, key, data, flags);
8206 #define MDB_WBUF (1024*1024)
8209 /** State needed for a compacting copy. */
8210 typedef struct mdb_copy {
8211 pthread_mutex_t mc_mutex;
8212 pthread_cond_t mc_cond;
8219 pgno_t mc_next_pgno;
8222 volatile int mc_new;
8227 /** Dedicated writer thread for compacting copy. */
8228 static THREAD_RET ESECT
8229 mdb_env_copythr(void *arg)
8233 int toggle = 0, wsize, rc;
8236 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
8239 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
8242 pthread_mutex_lock(&my->mc_mutex);
8244 pthread_cond_signal(&my->mc_cond);
8247 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8248 if (my->mc_new < 0) {
8253 wsize = my->mc_wlen[toggle];
8254 ptr = my->mc_wbuf[toggle];
8257 DO_WRITE(rc, my->mc_fd, ptr, wsize, len);
8261 } else if (len > 0) {
8275 /* If there's an overflow page tail, write it too */
8276 if (my->mc_olen[toggle]) {
8277 wsize = my->mc_olen[toggle];
8278 ptr = my->mc_over[toggle];
8279 my->mc_olen[toggle] = 0;
8282 my->mc_wlen[toggle] = 0;
8284 pthread_cond_signal(&my->mc_cond);
8286 pthread_cond_signal(&my->mc_cond);
8287 pthread_mutex_unlock(&my->mc_mutex);
8288 return (THREAD_RET)0;
8292 /** Tell the writer thread there's a buffer ready to write */
8294 mdb_env_cthr_toggle(mdb_copy *my, int st)
8296 int toggle = my->mc_toggle ^ 1;
8297 pthread_mutex_lock(&my->mc_mutex);
8298 if (my->mc_status) {
8299 pthread_mutex_unlock(&my->mc_mutex);
8300 return my->mc_status;
8302 while (my->mc_new == 1)
8303 pthread_cond_wait(&my->mc_cond, &my->mc_mutex);
8305 my->mc_toggle = toggle;
8306 pthread_cond_signal(&my->mc_cond);
8307 pthread_mutex_unlock(&my->mc_mutex);
8311 /** Depth-first tree traversal for compacting copy. */
8313 mdb_env_cwalk(mdb_copy *my, pgno_t *pg, int flags)
8316 MDB_txn *txn = my->mc_txn;
8318 MDB_page *mo, *mp, *leaf;
8323 /* Empty DB, nothing to do */
8324 if (*pg == P_INVALID)
8331 rc = mdb_page_get(my->mc_txn, *pg, &mc.mc_pg[0], NULL);
8334 rc = mdb_page_search_root(&mc, NULL, MDB_PS_FIRST);
8338 /* Make cursor pages writable */
8339 buf = ptr = malloc(my->mc_env->me_psize * mc.mc_snum);
8343 for (i=0; i<mc.mc_top; i++) {
8344 mdb_page_copy((MDB_page *)ptr, mc.mc_pg[i], my->mc_env->me_psize);
8345 mc.mc_pg[i] = (MDB_page *)ptr;
8346 ptr += my->mc_env->me_psize;
8349 /* This is writable space for a leaf page. Usually not needed. */
8350 leaf = (MDB_page *)ptr;
8352 toggle = my->mc_toggle;
8353 while (mc.mc_snum > 0) {
8355 mp = mc.mc_pg[mc.mc_top];
8359 if (!IS_LEAF2(mp) && !(flags & F_DUPDATA)) {
8360 for (i=0; i<n; i++) {
8361 ni = NODEPTR(mp, i);
8362 if (ni->mn_flags & F_BIGDATA) {
8366 /* Need writable leaf */
8368 mc.mc_pg[mc.mc_top] = leaf;
8369 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8371 ni = NODEPTR(mp, i);
8374 memcpy(&pg, NODEDATA(ni), sizeof(pg));
8375 rc = mdb_page_get(txn, pg, &omp, NULL);
8378 if (my->mc_wlen[toggle] >= MDB_WBUF) {
8379 rc = mdb_env_cthr_toggle(my, 1);
8382 toggle = my->mc_toggle;
8384 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
8385 memcpy(mo, omp, my->mc_env->me_psize);
8386 mo->mp_pgno = my->mc_next_pgno;
8387 my->mc_next_pgno += omp->mp_pages;
8388 my->mc_wlen[toggle] += my->mc_env->me_psize;
8389 if (omp->mp_pages > 1) {
8390 my->mc_olen[toggle] = my->mc_env->me_psize * (omp->mp_pages - 1);
8391 my->mc_over[toggle] = (char *)omp + my->mc_env->me_psize;
8392 rc = mdb_env_cthr_toggle(my, 1);
8395 toggle = my->mc_toggle;
8397 memcpy(NODEDATA(ni), &mo->mp_pgno, sizeof(pgno_t));
8398 } else if (ni->mn_flags & F_SUBDATA) {
8401 /* Need writable leaf */
8403 mc.mc_pg[mc.mc_top] = leaf;
8404 mdb_page_copy(leaf, mp, my->mc_env->me_psize);
8406 ni = NODEPTR(mp, i);
8409 memcpy(&db, NODEDATA(ni), sizeof(db));
8410 my->mc_toggle = toggle;
8411 rc = mdb_env_cwalk(my, &db.md_root, ni->mn_flags & F_DUPDATA);
8414 toggle = my->mc_toggle;
8415 memcpy(NODEDATA(ni), &db, sizeof(db));
8420 mc.mc_ki[mc.mc_top]++;
8421 if (mc.mc_ki[mc.mc_top] < n) {
8424 ni = NODEPTR(mp, mc.mc_ki[mc.mc_top]);
8426 rc = mdb_page_get(txn, pg, &mp, NULL);
8431 mc.mc_ki[mc.mc_top] = 0;
8432 if (IS_BRANCH(mp)) {
8433 /* Whenever we advance to a sibling branch page,
8434 * we must proceed all the way down to its first leaf.
8436 mdb_page_copy(mc.mc_pg[mc.mc_top], mp, my->mc_env->me_psize);
8439 mc.mc_pg[mc.mc_top] = mp;
8443 if (my->mc_wlen[toggle] >= MDB_WBUF) {
8444 rc = mdb_env_cthr_toggle(my, 1);
8447 toggle = my->mc_toggle;
8449 mo = (MDB_page *)(my->mc_wbuf[toggle] + my->mc_wlen[toggle]);
8450 mdb_page_copy(mo, mp, my->mc_env->me_psize);
8451 mo->mp_pgno = my->mc_next_pgno++;
8452 my->mc_wlen[toggle] += my->mc_env->me_psize;
8454 /* Update parent if there is one */
8455 ni = NODEPTR(mc.mc_pg[mc.mc_top-1], mc.mc_ki[mc.mc_top-1]);
8456 SETPGNO(ni, mo->mp_pgno);
8457 mdb_cursor_pop(&mc);
8459 /* Otherwise we're done */
8469 /** Copy environment with compaction. */
8471 mdb_env_copyfd1(MDB_env *env, HANDLE fd)
8476 MDB_txn *txn = NULL;
8481 my.mc_mutex = CreateMutex(NULL, FALSE, NULL);
8482 my.mc_cond = CreateEvent(NULL, FALSE, FALSE, NULL);
8483 my.mc_wbuf[0] = _aligned_malloc(MDB_WBUF*2, env->me_os_psize);
8484 if (my.mc_wbuf[0] == NULL)
8487 pthread_mutex_init(&my.mc_mutex, NULL);
8488 pthread_cond_init(&my.mc_cond, NULL);
8489 #ifdef HAVE_MEMALIGN
8490 my.mc_wbuf[0] = memalign(env->me_os_psize, MDB_WBUF*2);
8491 if (my.mc_wbuf[0] == NULL)
8494 rc = posix_memalign((void **)&my.mc_wbuf[0], env->me_os_psize, MDB_WBUF*2);
8499 memset(my.mc_wbuf[0], 0, MDB_WBUF*2);
8500 my.mc_wbuf[1] = my.mc_wbuf[0] + MDB_WBUF;
8505 my.mc_next_pgno = 2;
8511 THREAD_CREATE(thr, mdb_env_copythr, &my);
8513 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
8517 mp = (MDB_page *)my.mc_wbuf[0];
8518 memset(mp, 0, 2*env->me_psize);
8520 mp->mp_flags = P_META;
8521 mm = (MDB_meta *)METADATA(mp);
8522 mdb_env_init_meta0(env, mm);
8523 mm->mm_address = env->me_metas[0]->mm_address;
8525 mp = (MDB_page *)(my.mc_wbuf[0] + env->me_psize);
8527 mp->mp_flags = P_META;
8528 *(MDB_meta *)METADATA(mp) = *mm;
8529 mm = (MDB_meta *)METADATA(mp);
8531 /* Count the number of free pages, subtract from lastpg to find
8532 * number of active pages
8535 MDB_ID freecount = 0;
8538 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
8539 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
8540 freecount += *(MDB_ID *)data.mv_data;
8541 freecount += txn->mt_dbs[0].md_branch_pages +
8542 txn->mt_dbs[0].md_leaf_pages +
8543 txn->mt_dbs[0].md_overflow_pages;
8545 /* Set metapage 1 */
8546 mm->mm_last_pg = txn->mt_next_pgno - freecount - 1;
8547 mm->mm_dbs[1] = txn->mt_dbs[1];
8548 mm->mm_dbs[1].md_root = mm->mm_last_pg;
8551 my.mc_wlen[0] = env->me_psize * 2;
8553 pthread_mutex_lock(&my.mc_mutex);
8555 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
8556 pthread_mutex_unlock(&my.mc_mutex);
8557 rc = mdb_env_cwalk(&my, &txn->mt_dbs[1].md_root, 0);
8558 if (rc == MDB_SUCCESS && my.mc_wlen[my.mc_toggle])
8559 rc = mdb_env_cthr_toggle(&my, 1);
8560 mdb_env_cthr_toggle(&my, -1);
8561 pthread_mutex_lock(&my.mc_mutex);
8563 pthread_cond_wait(&my.mc_cond, &my.mc_mutex);
8564 pthread_mutex_unlock(&my.mc_mutex);
8569 CloseHandle(my.mc_cond);
8570 CloseHandle(my.mc_mutex);
8571 _aligned_free(my.mc_wbuf[0]);
8573 pthread_cond_destroy(&my.mc_cond);
8574 pthread_mutex_destroy(&my.mc_mutex);
8575 free(my.mc_wbuf[0]);
8580 /** Copy environment as-is. */
8582 mdb_env_copyfd0(MDB_env *env, HANDLE fd)
8584 MDB_txn *txn = NULL;
8590 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
8594 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
8597 /* Do the lock/unlock of the reader mutex before starting the
8598 * write txn. Otherwise other read txns could block writers.
8600 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
8605 /* We must start the actual read txn after blocking writers */
8606 mdb_txn_reset0(txn, "reset-stage1");
8608 /* Temporarily block writers until we snapshot the meta pages */
8611 rc = mdb_txn_renew0(txn);
8613 UNLOCK_MUTEX_W(env);
8618 wsize = env->me_psize * 2;
8622 DO_WRITE(rc, fd, ptr, w2, len);
8626 } else if (len > 0) {
8632 /* Non-blocking or async handles are not supported */
8638 UNLOCK_MUTEX_W(env);
8643 w2 = txn->mt_next_pgno * env->me_psize;
8646 LARGE_INTEGER fsize;
8647 GetFileSizeEx(env->me_fd, &fsize);
8648 if (w2 > fsize.QuadPart)
8649 w2 = fsize.QuadPart;
8654 fstat(env->me_fd, &st);
8655 if (w2 > (size_t)st.st_size)
8661 if (wsize > MAX_WRITE)
8665 DO_WRITE(rc, fd, ptr, w2, len);
8669 } else if (len > 0) {
8686 mdb_env_copyfd2(MDB_env *env, HANDLE fd, unsigned int flags)
8688 if (flags & MDB_CP_COMPACT)
8689 return mdb_env_copyfd1(env, fd);
8691 return mdb_env_copyfd0(env, fd);
8695 mdb_env_copyfd(MDB_env *env, HANDLE fd)
8697 return mdb_env_copyfd2(env, fd, 0);
8701 mdb_env_copy2(MDB_env *env, const char *path, unsigned int flags)
8705 HANDLE newfd = INVALID_HANDLE_VALUE;
8707 if (env->me_flags & MDB_NOSUBDIR) {
8708 lpath = (char *)path;
8711 len += sizeof(DATANAME);
8712 lpath = malloc(len);
8715 sprintf(lpath, "%s" DATANAME, path);
8718 /* The destination path must exist, but the destination file must not.
8719 * We don't want the OS to cache the writes, since the source data is
8720 * already in the OS cache.
8723 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
8724 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
8726 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL, 0666);
8728 if (newfd == INVALID_HANDLE_VALUE) {
8733 if (env->me_psize >= env->me_os_psize) {
8735 /* Set O_DIRECT if the file system supports it */
8736 if ((rc = fcntl(newfd, F_GETFL)) != -1)
8737 (void) fcntl(newfd, F_SETFL, rc | O_DIRECT);
8739 #ifdef F_NOCACHE /* __APPLE__ */
8740 rc = fcntl(newfd, F_NOCACHE, 1);
8748 rc = mdb_env_copyfd2(env, newfd, flags);
8751 if (!(env->me_flags & MDB_NOSUBDIR))
8753 if (newfd != INVALID_HANDLE_VALUE)
8754 if (close(newfd) < 0 && rc == MDB_SUCCESS)
8761 mdb_env_copy(MDB_env *env, const char *path)
8763 return mdb_env_copy2(env, path, 0);
8767 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
8769 if ((flag & CHANGEABLE) != flag)
8772 env->me_flags |= flag;
8774 env->me_flags &= ~flag;
8779 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
8784 *arg = env->me_flags;
8789 mdb_env_set_userctx(MDB_env *env, void *ctx)
8793 env->me_userctx = ctx;
8798 mdb_env_get_userctx(MDB_env *env)
8800 return env ? env->me_userctx : NULL;
8804 mdb_env_set_assert(MDB_env *env, MDB_assert_func *func)
8809 env->me_assert_func = func;
8815 mdb_env_get_path(MDB_env *env, const char **arg)
8820 *arg = env->me_path;
8825 mdb_env_get_fd(MDB_env *env, mdb_filehandle_t *arg)
8834 /** Common code for #mdb_stat() and #mdb_env_stat().
8835 * @param[in] env the environment to operate in.
8836 * @param[in] db the #MDB_db record containing the stats to return.
8837 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
8838 * @return 0, this function always succeeds.
8841 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
8843 arg->ms_psize = env->me_psize;
8844 arg->ms_depth = db->md_depth;
8845 arg->ms_branch_pages = db->md_branch_pages;
8846 arg->ms_leaf_pages = db->md_leaf_pages;
8847 arg->ms_overflow_pages = db->md_overflow_pages;
8848 arg->ms_entries = db->md_entries;
8854 mdb_env_stat(MDB_env *env, MDB_stat *arg)
8858 if (env == NULL || arg == NULL)
8861 toggle = mdb_env_pick_meta(env);
8863 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
8867 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
8871 if (env == NULL || arg == NULL)
8874 toggle = mdb_env_pick_meta(env);
8875 arg->me_mapaddr = env->me_metas[toggle]->mm_address;
8876 arg->me_mapsize = env->me_mapsize;
8877 arg->me_maxreaders = env->me_maxreaders;
8879 /* me_numreaders may be zero if this process never used any readers. Use
8880 * the shared numreader count if it exists.
8882 arg->me_numreaders = env->me_txns ? env->me_txns->mti_numreaders : env->me_numreaders;
8884 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
8885 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
8889 /** Set the default comparison functions for a database.
8890 * Called immediately after a database is opened to set the defaults.
8891 * The user can then override them with #mdb_set_compare() or
8892 * #mdb_set_dupsort().
8893 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
8894 * @param[in] dbi A database handle returned by #mdb_dbi_open()
8897 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
8899 uint16_t f = txn->mt_dbs[dbi].md_flags;
8901 txn->mt_dbxs[dbi].md_cmp =
8902 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
8903 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
8905 txn->mt_dbxs[dbi].md_dcmp =
8906 !(f & MDB_DUPSORT) ? 0 :
8907 ((f & MDB_INTEGERDUP)
8908 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
8909 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
8912 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
8918 int rc, dbflag, exact;
8919 unsigned int unused = 0, seq;
8922 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
8923 mdb_default_cmp(txn, FREE_DBI);
8926 if ((flags & VALID_FLAGS) != flags)
8928 if (txn->mt_flags & MDB_TXN_ERROR)
8934 if (flags & PERSISTENT_FLAGS) {
8935 uint16_t f2 = flags & PERSISTENT_FLAGS;
8936 /* make sure flag changes get committed */
8937 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
8938 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
8939 txn->mt_flags |= MDB_TXN_DIRTY;
8942 mdb_default_cmp(txn, MAIN_DBI);
8946 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
8947 mdb_default_cmp(txn, MAIN_DBI);
8950 /* Is the DB already open? */
8952 for (i=2; i<txn->mt_numdbs; i++) {
8953 if (!txn->mt_dbxs[i].md_name.mv_size) {
8954 /* Remember this free slot */
8955 if (!unused) unused = i;
8958 if (len == txn->mt_dbxs[i].md_name.mv_size &&
8959 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
8965 /* If no free slot and max hit, fail */
8966 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
8967 return MDB_DBS_FULL;
8969 /* Cannot mix named databases with some mainDB flags */
8970 if (txn->mt_dbs[MAIN_DBI].md_flags & (MDB_DUPSORT|MDB_INTEGERKEY))
8971 return (flags & MDB_CREATE) ? MDB_INCOMPATIBLE : MDB_NOTFOUND;
8973 /* Find the DB info */
8974 dbflag = DB_NEW|DB_VALID;
8977 key.mv_data = (void *)name;
8978 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
8979 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
8980 if (rc == MDB_SUCCESS) {
8981 /* make sure this is actually a DB */
8982 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
8983 if (!(node->mn_flags & F_SUBDATA))
8984 return MDB_INCOMPATIBLE;
8985 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
8986 /* Create if requested */
8987 data.mv_size = sizeof(MDB_db);
8988 data.mv_data = &dummy;
8989 memset(&dummy, 0, sizeof(dummy));
8990 dummy.md_root = P_INVALID;
8991 dummy.md_flags = flags & PERSISTENT_FLAGS;
8992 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
8996 /* OK, got info, add to table */
8997 if (rc == MDB_SUCCESS) {
8998 unsigned int slot = unused ? unused : txn->mt_numdbs;
8999 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
9000 txn->mt_dbxs[slot].md_name.mv_size = len;
9001 txn->mt_dbxs[slot].md_rel = NULL;
9002 txn->mt_dbflags[slot] = dbflag;
9003 /* txn-> and env-> are the same in read txns, use
9004 * tmp variable to avoid undefined assignment
9006 seq = ++txn->mt_env->me_dbiseqs[slot];
9007 txn->mt_dbiseqs[slot] = seq;
9009 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
9011 mdb_default_cmp(txn, slot);
9020 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
9022 if (!arg || !TXN_DBI_EXIST(txn, dbi))
9025 if (txn->mt_flags & MDB_TXN_ERROR)
9028 if (txn->mt_dbflags[dbi] & DB_STALE) {
9031 /* Stale, must read the DB's root. cursor_init does it for us. */
9032 mdb_cursor_init(&mc, txn, dbi, &mx);
9034 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
9037 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
9040 if (dbi <= MAIN_DBI || dbi >= env->me_maxdbs)
9042 ptr = env->me_dbxs[dbi].md_name.mv_data;
9043 /* If there was no name, this was already closed */
9045 env->me_dbxs[dbi].md_name.mv_data = NULL;
9046 env->me_dbxs[dbi].md_name.mv_size = 0;
9047 env->me_dbflags[dbi] = 0;
9048 env->me_dbiseqs[dbi]++;
9053 int mdb_dbi_flags(MDB_txn *txn, MDB_dbi dbi, unsigned int *flags)
9055 /* We could return the flags for the FREE_DBI too but what's the point? */
9056 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9058 *flags = txn->mt_dbs[dbi].md_flags & PERSISTENT_FLAGS;
9062 /** Add all the DB's pages to the free list.
9063 * @param[in] mc Cursor on the DB to free.
9064 * @param[in] subs non-Zero to check for sub-DBs in this DB.
9065 * @return 0 on success, non-zero on failure.
9068 mdb_drop0(MDB_cursor *mc, int subs)
9072 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
9073 if (rc == MDB_SUCCESS) {
9074 MDB_txn *txn = mc->mc_txn;
9079 /* LEAF2 pages have no nodes, cannot have sub-DBs */
9080 if (IS_LEAF2(mc->mc_pg[mc->mc_top]))
9083 mdb_cursor_copy(mc, &mx);
9084 while (mc->mc_snum > 0) {
9085 MDB_page *mp = mc->mc_pg[mc->mc_top];
9086 unsigned n = NUMKEYS(mp);
9088 for (i=0; i<n; i++) {
9089 ni = NODEPTR(mp, i);
9090 if (ni->mn_flags & F_BIGDATA) {
9093 memcpy(&pg, NODEDATA(ni), sizeof(pg));
9094 rc = mdb_page_get(txn, pg, &omp, NULL);
9097 mdb_cassert(mc, IS_OVERFLOW(omp));
9098 rc = mdb_midl_append_range(&txn->mt_free_pgs,
9102 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
9103 mdb_xcursor_init1(mc, ni);
9104 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
9110 if ((rc = mdb_midl_need(&txn->mt_free_pgs, n)) != 0)
9112 for (i=0; i<n; i++) {
9114 ni = NODEPTR(mp, i);
9117 mdb_midl_xappend(txn->mt_free_pgs, pg);
9122 mc->mc_ki[mc->mc_top] = i;
9123 rc = mdb_cursor_sibling(mc, 1);
9125 if (rc != MDB_NOTFOUND)
9127 /* no more siblings, go back to beginning
9128 * of previous level.
9132 for (i=1; i<mc->mc_snum; i++) {
9134 mc->mc_pg[i] = mx.mc_pg[i];
9139 rc = mdb_midl_append(&txn->mt_free_pgs, mc->mc_db->md_root);
9142 txn->mt_flags |= MDB_TXN_ERROR;
9143 } else if (rc == MDB_NOTFOUND) {
9149 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
9151 MDB_cursor *mc, *m2;
9154 if ((unsigned)del > 1 || dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9157 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
9160 if (dbi > MAIN_DBI && TXN_DBI_CHANGED(txn, dbi))
9163 rc = mdb_cursor_open(txn, dbi, &mc);
9167 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
9168 /* Invalidate the dropped DB's cursors */
9169 for (m2 = txn->mt_cursors[dbi]; m2; m2 = m2->mc_next)
9170 m2->mc_flags &= ~(C_INITIALIZED|C_EOF);
9174 /* Can't delete the main DB */
9175 if (del && dbi > MAIN_DBI) {
9176 rc = mdb_del0(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL, 0);
9178 txn->mt_dbflags[dbi] = DB_STALE;
9179 mdb_dbi_close(txn->mt_env, dbi);
9181 txn->mt_flags |= MDB_TXN_ERROR;
9184 /* reset the DB record, mark it dirty */
9185 txn->mt_dbflags[dbi] |= DB_DIRTY;
9186 txn->mt_dbs[dbi].md_depth = 0;
9187 txn->mt_dbs[dbi].md_branch_pages = 0;
9188 txn->mt_dbs[dbi].md_leaf_pages = 0;
9189 txn->mt_dbs[dbi].md_overflow_pages = 0;
9190 txn->mt_dbs[dbi].md_entries = 0;
9191 txn->mt_dbs[dbi].md_root = P_INVALID;
9193 txn->mt_flags |= MDB_TXN_DIRTY;
9196 mdb_cursor_close(mc);
9200 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9202 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9205 txn->mt_dbxs[dbi].md_cmp = cmp;
9209 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
9211 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9214 txn->mt_dbxs[dbi].md_dcmp = cmp;
9218 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
9220 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9223 txn->mt_dbxs[dbi].md_rel = rel;
9227 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
9229 if (dbi == FREE_DBI || !TXN_DBI_EXIST(txn, dbi))
9232 txn->mt_dbxs[dbi].md_relctx = ctx;
9237 mdb_env_get_maxkeysize(MDB_env *env)
9239 return ENV_MAXKEY(env);
9243 mdb_reader_list(MDB_env *env, MDB_msg_func *func, void *ctx)
9245 unsigned int i, rdrs;
9248 int rc = 0, first = 1;
9252 if (!env->me_txns) {
9253 return func("(no reader locks)\n", ctx);
9255 rdrs = env->me_txns->mti_numreaders;
9256 mr = env->me_txns->mti_readers;
9257 for (i=0; i<rdrs; i++) {
9259 txnid_t txnid = mr[i].mr_txnid;
9260 sprintf(buf, txnid == (txnid_t)-1 ?
9261 "%10d %"Z"x -\n" : "%10d %"Z"x %"Z"u\n",
9262 (int)mr[i].mr_pid, (size_t)mr[i].mr_tid, txnid);
9265 rc = func(" pid thread txnid\n", ctx);
9269 rc = func(buf, ctx);
9275 rc = func("(no active readers)\n", ctx);
9280 /** Insert pid into list if not already present.
9281 * return -1 if already present.
9284 mdb_pid_insert(MDB_PID_T *ids, MDB_PID_T pid)
9286 /* binary search of pid in list */
9288 unsigned cursor = 1;
9290 unsigned n = ids[0];
9293 unsigned pivot = n >> 1;
9294 cursor = base + pivot + 1;
9295 val = pid - ids[cursor];
9300 } else if ( val > 0 ) {
9305 /* found, so it's a duplicate */
9314 for (n = ids[0]; n > cursor; n--)
9321 mdb_reader_check(MDB_env *env, int *dead)
9323 unsigned int i, j, rdrs;
9325 MDB_PID_T *pids, pid;
9334 rdrs = env->me_txns->mti_numreaders;
9335 pids = malloc((rdrs+1) * sizeof(MDB_PID_T));
9339 mr = env->me_txns->mti_readers;
9340 for (i=0; i<rdrs; i++) {
9341 if (mr[i].mr_pid && mr[i].mr_pid != env->me_pid) {
9343 if (mdb_pid_insert(pids, pid) == 0) {
9344 if (!mdb_reader_pid(env, Pidcheck, pid)) {
9346 /* Recheck, a new process may have reused pid */
9347 if (!mdb_reader_pid(env, Pidcheck, pid)) {
9348 for (j=i; j<rdrs; j++)
9349 if (mr[j].mr_pid == pid) {
9350 DPRINTF(("clear stale reader pid %u txn %"Z"d",
9351 (unsigned) pid, mr[j].mr_txnid));
9356 UNLOCK_MUTEX_R(env);
projects / openldap / blob