2 * @brief memory-mapped database library
4 * A Btree-based database management library modeled loosely on the
5 * BerkeleyDB API, but much simplified.
8 * Copyright 2011-2013 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.
38 #include <sys/types.h>
42 /** getpid() returns int; MinGW defines pid_t but MinGW64 typedefs it
43 * as int64 which is wrong. MSVC doesn't define it at all, so just
48 # include <sys/param.h>
50 # define LITTLE_ENDIAN 1234
51 # define BIG_ENDIAN 4321
52 # define BYTE_ORDER LITTLE_ENDIAN
54 # define SSIZE_MAX INT_MAX
58 #define MDB_PID_T pid_t
59 #include <sys/param.h>
62 #ifdef HAVE_SYS_FILE_H
79 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
80 #include <netinet/in.h>
81 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
84 #if defined(__APPLE__) || defined (BSD)
85 # define MDB_USE_POSIX_SEM 1
86 # define MDB_FDATASYNC fsync
87 #elif defined(ANDROID)
88 # define MDB_FDATASYNC fsync
93 #ifdef MDB_USE_POSIX_SEM
94 # define MDB_USE_HASH 1
95 #include <semaphore.h>
100 #include <valgrind/memcheck.h>
101 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
102 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
103 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
104 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
105 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
107 #define VGMEMP_CREATE(h,r,z)
108 #define VGMEMP_ALLOC(h,a,s)
109 #define VGMEMP_FREE(h,a)
110 #define VGMEMP_DESTROY(h)
111 #define VGMEMP_DEFINED(a,s)
115 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
116 /* Solaris just defines one or the other */
117 # define LITTLE_ENDIAN 1234
118 # define BIG_ENDIAN 4321
119 # ifdef _LITTLE_ENDIAN
120 # define BYTE_ORDER LITTLE_ENDIAN
122 # define BYTE_ORDER BIG_ENDIAN
125 # define BYTE_ORDER __BYTE_ORDER
129 #ifndef LITTLE_ENDIAN
130 #define LITTLE_ENDIAN __LITTLE_ENDIAN
133 #define BIG_ENDIAN __BIG_ENDIAN
136 #if defined(__i386) || defined(__x86_64) || defined(_M_IX86)
137 #define MISALIGNED_OK 1
143 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
144 # error "Unknown or unsupported endianness (BYTE_ORDER)"
145 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
146 # error "Two's complement, reasonably sized integer types, please"
149 /** @defgroup internal MDB Internals
152 /** @defgroup compat Windows Compatibility Macros
153 * A bunch of macros to minimize the amount of platform-specific ifdefs
154 * needed throughout the rest of the code. When the features this library
155 * needs are similar enough to POSIX to be hidden in a one-or-two line
156 * replacement, this macro approach is used.
160 #define MDB_USE_HASH 1
161 #define MDB_PIDLOCK 0
162 #define pthread_t DWORD
163 #define pthread_mutex_t HANDLE
164 #define pthread_key_t DWORD
165 #define pthread_self() GetCurrentThreadId()
166 #define pthread_key_create(x,y) \
167 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
168 #define pthread_key_delete(x) TlsFree(x)
169 #define pthread_getspecific(x) TlsGetValue(x)
170 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
171 #define pthread_mutex_unlock(x) ReleaseMutex(x)
172 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
173 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
174 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
175 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
176 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
177 #define getpid() GetCurrentProcessId()
178 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
179 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
180 #define ErrCode() GetLastError()
181 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
182 #define close(fd) (CloseHandle(fd) ? 0 : -1)
183 #define munmap(ptr,len) UnmapViewOfFile(ptr)
184 #ifdef PROCESS_QUERY_LIMITED_INFORMATION
185 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION PROCESS_QUERY_LIMITED_INFORMATION
187 #define MDB_PROCESS_QUERY_LIMITED_INFORMATION 0x1000
192 #define Z "z" /**< printf format modifier for size_t */
194 /** For MDB_LOCK_FORMAT: True if readers take a pid lock in the lockfile */
195 #define MDB_PIDLOCK 1
197 #ifdef MDB_USE_POSIX_SEM
199 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
200 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
201 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
202 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
205 mdb_sem_wait(sem_t *sem)
208 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
213 /** Lock the reader mutex.
215 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
216 /** Unlock the reader mutex.
218 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
220 /** Lock the writer mutex.
221 * Only a single write transaction is allowed at a time. Other writers
222 * will block waiting for this mutex.
224 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
225 /** Unlock the writer mutex.
227 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
228 #endif /* MDB_USE_POSIX_SEM */
230 /** Get the error code for the last failed system function.
232 #define ErrCode() errno
234 /** An abstraction for a file handle.
235 * On POSIX systems file handles are small integers. On Windows
236 * they're opaque pointers.
240 /** A value for an invalid file handle.
241 * Mainly used to initialize file variables and signify that they are
244 #define INVALID_HANDLE_VALUE (-1)
246 /** Get the size of a memory page for the system.
247 * This is the basic size that the platform's memory manager uses, and is
248 * fundamental to the use of memory-mapped files.
250 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
253 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
256 #define MNAME_LEN (sizeof(pthread_mutex_t))
262 /** A flag for opening a file and requesting synchronous data writes.
263 * This is only used when writing a meta page. It's not strictly needed;
264 * we could just do a normal write and then immediately perform a flush.
265 * But if this flag is available it saves us an extra system call.
267 * @note If O_DSYNC is undefined but exists in /usr/include,
268 * preferably set some compiler flag to get the definition.
269 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
272 # define MDB_DSYNC O_DSYNC
276 /** Function for flushing the data of a file. Define this to fsync
277 * if fdatasync() is not supported.
279 #ifndef MDB_FDATASYNC
280 # define MDB_FDATASYNC fdatasync
284 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
295 /** A page number in the database.
296 * Note that 64 bit page numbers are overkill, since pages themselves
297 * already represent 12-13 bits of addressable memory, and the OS will
298 * always limit applications to a maximum of 63 bits of address space.
300 * @note In the #MDB_node structure, we only store 48 bits of this value,
301 * which thus limits us to only 60 bits of addressable data.
303 typedef MDB_ID pgno_t;
305 /** A transaction ID.
306 * See struct MDB_txn.mt_txnid for details.
308 typedef MDB_ID txnid_t;
310 /** @defgroup debug Debug Macros
314 /** Enable debug output. Needs variable argument macros (a C99 feature).
315 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
316 * read from and written to the database (used for free space management).
322 static int mdb_debug;
323 static txnid_t mdb_debug_start;
325 /** Print a debug message with printf formatting.
326 * Requires double parenthesis around 2 or more args.
328 # define DPRINTF(args) ((void) ((mdb_debug) && DPRINTF0 args))
329 # define DPRINTF0(fmt, ...) \
330 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)
332 # define DPRINTF(args) ((void) 0)
334 /** Print a debug string.
335 * The string is printed literally, with no format processing.
337 #define DPUTS(arg) DPRINTF(("%s", arg))
338 /** Debuging output value of a cursor DBI: Negative in a sub-cursor. */
340 (((mc)->mc_flags & C_SUB) ? -(int)(mc)->mc_dbi : (int)(mc)->mc_dbi)
343 /** @brief The maximum size of a database page.
345 * This is 32k, since it must fit in #MDB_page.#mp_upper.
347 * LMDB will use database pages < OS pages if needed.
348 * That causes more I/O in write transactions: The OS must
349 * know (read) the whole page before writing a partial page.
351 * Note that we don't currently support Huge pages. On Linux,
352 * regular data files cannot use Huge pages, and in general
353 * Huge pages aren't actually pageable. We rely on the OS
354 * demand-pager to read our data and page it out when memory
355 * pressure from other processes is high. So until OSs have
356 * actual paging support for Huge pages, they're not viable.
358 #define MAX_PAGESIZE 0x8000
360 /** The minimum number of keys required in a database page.
361 * Setting this to a larger value will place a smaller bound on the
362 * maximum size of a data item. Data items larger than this size will
363 * be pushed into overflow pages instead of being stored directly in
364 * the B-tree node. This value used to default to 4. With a page size
365 * of 4096 bytes that meant that any item larger than 1024 bytes would
366 * go into an overflow page. That also meant that on average 2-3KB of
367 * each overflow page was wasted space. The value cannot be lower than
368 * 2 because then there would no longer be a tree structure. With this
369 * value, items larger than 2KB will go into overflow pages, and on
370 * average only 1KB will be wasted.
372 #define MDB_MINKEYS 2
374 /** A stamp that identifies a file as an MDB file.
375 * There's nothing special about this value other than that it is easily
376 * recognizable, and it will reflect any byte order mismatches.
378 #define MDB_MAGIC 0xBEEFC0DE
380 /** The version number for a database's datafile format. */
381 #define MDB_DATA_VERSION 1
382 /** The version number for a database's lockfile format. */
383 #define MDB_LOCK_VERSION 1
385 /** @brief The max size of a key we can write, or 0 for dynamic max.
387 * Define this as 0 to compute the max from the page size. 511
388 * is default for backwards compat: liblmdb <= 0.9.10 can break
389 * when modifying a DB with keys/dupsort data bigger than its max.
391 * Data items in an #MDB_DUPSORT database are also limited to
392 * this size, since they're actually keys of a sub-DB. Keys and
393 * #MDB_DUPSORT data items must fit on a node in a regular page.
395 #ifndef MDB_MAXKEYSIZE
396 #define MDB_MAXKEYSIZE 511
399 /** The maximum size of a key we can write to the environment. */
401 #define ENV_MAXKEY(env) (MDB_MAXKEYSIZE)
403 #define ENV_MAXKEY(env) ((env)->me_maxkey)
406 /** @brief The maximum size of a data item.
408 * We only store a 32 bit value for node sizes.
410 #define MAXDATASIZE 0xffffffffUL
413 /** Key size which fits in a #DKBUF.
416 #define DKBUF_MAXKEYSIZE ((MDB_MAXKEYSIZE) > 0 ? (MDB_MAXKEYSIZE) : 511)
419 * This is used for printing a hex dump of a key's contents.
421 #define DKBUF char kbuf[DKBUF_MAXKEYSIZE*2+1]
422 /** Display a key in hex.
424 * Invoke a function to display a key in hex.
426 #define DKEY(x) mdb_dkey(x, kbuf)
432 /** An invalid page number.
433 * Mainly used to denote an empty tree.
435 #define P_INVALID (~(pgno_t)0)
437 /** Test if the flags \b f are set in a flag word \b w. */
438 #define F_ISSET(w, f) (((w) & (f)) == (f))
440 /** Round \b n up to an even number. */
441 #define EVEN(n) (((n) + 1U) & -2) /* sign-extending -2 to match n+1U */
443 /** Used for offsets within a single page.
444 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
447 typedef uint16_t indx_t;
449 /** Default size of memory map.
450 * This is certainly too small for any actual applications. Apps should always set
451 * the size explicitly using #mdb_env_set_mapsize().
453 #define DEFAULT_MAPSIZE 1048576
455 /** @defgroup readers Reader Lock Table
456 * Readers don't acquire any locks for their data access. Instead, they
457 * simply record their transaction ID in the reader table. The reader
458 * mutex is needed just to find an empty slot in the reader table. The
459 * slot's address is saved in thread-specific data so that subsequent read
460 * transactions started by the same thread need no further locking to proceed.
462 * If #MDB_NOTLS is set, the slot address is not saved in thread-specific data.
464 * No reader table is used if the database is on a read-only filesystem, or
465 * if #MDB_NOLOCK is set.
467 * Since the database uses multi-version concurrency control, readers don't
468 * actually need any locking. This table is used to keep track of which
469 * readers are using data from which old transactions, so that we'll know
470 * when a particular old transaction is no longer in use. Old transactions
471 * that have discarded any data pages can then have those pages reclaimed
472 * for use by a later write transaction.
474 * The lock table is constructed such that reader slots are aligned with the
475 * processor's cache line size. Any slot is only ever used by one thread.
476 * This alignment guarantees that there will be no contention or cache
477 * thrashing as threads update their own slot info, and also eliminates
478 * any need for locking when accessing a slot.
480 * A writer thread will scan every slot in the table to determine the oldest
481 * outstanding reader transaction. Any freed pages older than this will be
482 * reclaimed by the writer. The writer doesn't use any locks when scanning
483 * this table. This means that there's no guarantee that the writer will
484 * see the most up-to-date reader info, but that's not required for correct
485 * operation - all we need is to know the upper bound on the oldest reader,
486 * we don't care at all about the newest reader. So the only consequence of
487 * reading stale information here is that old pages might hang around a
488 * while longer before being reclaimed. That's actually good anyway, because
489 * the longer we delay reclaiming old pages, the more likely it is that a
490 * string of contiguous pages can be found after coalescing old pages from
491 * many old transactions together.
494 /** Number of slots in the reader table.
495 * This value was chosen somewhat arbitrarily. 126 readers plus a
496 * couple mutexes fit exactly into 8KB on my development machine.
497 * Applications should set the table size using #mdb_env_set_maxreaders().
499 #define DEFAULT_READERS 126
501 /** The size of a CPU cache line in bytes. We want our lock structures
502 * aligned to this size to avoid false cache line sharing in the
504 * This value works for most CPUs. For Itanium this should be 128.
510 /** The information we store in a single slot of the reader table.
511 * In addition to a transaction ID, we also record the process and
512 * thread ID that owns a slot, so that we can detect stale information,
513 * e.g. threads or processes that went away without cleaning up.
514 * @note We currently don't check for stale records. We simply re-init
515 * the table when we know that we're the only process opening the
518 typedef struct MDB_rxbody {
519 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
520 * Multiple readers that start at the same time will probably have the
521 * same ID here. Again, it's not important to exclude them from
522 * anything; all we need to know is which version of the DB they
523 * started from so we can avoid overwriting any data used in that
524 * particular version.
527 /** The process ID of the process owning this reader txn. */
529 /** The thread ID of the thread owning this txn. */
533 /** The actual reader record, with cacheline padding. */
534 typedef struct MDB_reader {
537 /** shorthand for mrb_txnid */
538 #define mr_txnid mru.mrx.mrb_txnid
539 #define mr_pid mru.mrx.mrb_pid
540 #define mr_tid mru.mrx.mrb_tid
541 /** cache line alignment */
542 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
546 /** The header for the reader table.
547 * The table resides in a memory-mapped file. (This is a different file
548 * than is used for the main database.)
550 * For POSIX the actual mutexes reside in the shared memory of this
551 * mapped file. On Windows, mutexes are named objects allocated by the
552 * kernel; we store the mutex names in this mapped file so that other
553 * processes can grab them. This same approach is also used on
554 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
555 * process-shared POSIX mutexes. For these cases where a named object
556 * is used, the object name is derived from a 64 bit FNV hash of the
557 * environment pathname. As such, naming collisions are extremely
558 * unlikely. If a collision occurs, the results are unpredictable.
560 typedef struct MDB_txbody {
561 /** Stamp identifying this as an MDB file. It must be set
564 /** Format of this lock file. Must be set to #MDB_LOCK_FORMAT. */
566 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
567 char mtb_rmname[MNAME_LEN];
569 /** Mutex protecting access to this table.
570 * This is the reader lock that #LOCK_MUTEX_R acquires.
572 pthread_mutex_t mtb_mutex;
574 /** The ID of the last transaction committed to the database.
575 * This is recorded here only for convenience; the value can always
576 * be determined by reading the main database meta pages.
579 /** The number of slots that have been used in the reader table.
580 * This always records the maximum count, it is not decremented
581 * when readers release their slots.
583 unsigned mtb_numreaders;
586 /** The actual reader table definition. */
587 typedef struct MDB_txninfo {
590 #define mti_magic mt1.mtb.mtb_magic
591 #define mti_format mt1.mtb.mtb_format
592 #define mti_mutex mt1.mtb.mtb_mutex
593 #define mti_rmname mt1.mtb.mtb_rmname
594 #define mti_txnid mt1.mtb.mtb_txnid
595 #define mti_numreaders mt1.mtb.mtb_numreaders
596 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
599 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
600 char mt2_wmname[MNAME_LEN];
601 #define mti_wmname mt2.mt2_wmname
603 pthread_mutex_t mt2_wmutex;
604 #define mti_wmutex mt2.mt2_wmutex
606 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
608 MDB_reader mti_readers[1];
611 /** Lockfile format signature: version, features and field layout */
612 #define MDB_LOCK_FORMAT \
614 ((MDB_LOCK_VERSION) \
615 /* Flags which describe functionality */ \
616 + (((MDB_PIDLOCK) != 0) << 16)))
619 /** Common header for all page types.
620 * Overflow records occupy a number of contiguous pages with no
621 * headers on any page after the first.
623 typedef struct MDB_page {
624 #define mp_pgno mp_p.p_pgno
625 #define mp_next mp_p.p_next
627 pgno_t p_pgno; /**< page number */
628 void * p_next; /**< for in-memory list of freed structs */
631 /** @defgroup mdb_page Page Flags
633 * Flags for the page headers.
636 #define P_BRANCH 0x01 /**< branch page */
637 #define P_LEAF 0x02 /**< leaf page */
638 #define P_OVERFLOW 0x04 /**< overflow page */
639 #define P_META 0x08 /**< meta page */
640 #define P_DIRTY 0x10 /**< dirty page, also set for #P_SUBP pages */
641 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
642 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
643 #define P_KEEP 0x8000 /**< leave this page alone during spill */
645 uint16_t mp_flags; /**< @ref mdb_page */
646 #define mp_lower mp_pb.pb.pb_lower
647 #define mp_upper mp_pb.pb.pb_upper
648 #define mp_pages mp_pb.pb_pages
651 indx_t pb_lower; /**< lower bound of free space */
652 indx_t pb_upper; /**< upper bound of free space */
654 uint32_t pb_pages; /**< number of overflow pages */
656 indx_t mp_ptrs[1]; /**< dynamic size */
659 /** Size of the page header, excluding dynamic data at the end */
660 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
662 /** Address of first usable data byte in a page, after the header */
663 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
665 /** Number of nodes on a page */
666 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
668 /** The amount of space remaining in the page */
669 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
671 /** The percentage of space used in the page, in tenths of a percent. */
672 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
673 ((env)->me_psize - PAGEHDRSZ))
674 /** The minimum page fill factor, in tenths of a percent.
675 * Pages emptier than this are candidates for merging.
677 #define FILL_THRESHOLD 250
679 /** Test if a page is a leaf page */
680 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
681 /** Test if a page is a LEAF2 page */
682 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
683 /** Test if a page is a branch page */
684 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
685 /** Test if a page is an overflow page */
686 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
687 /** Test if a page is a sub page */
688 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
690 /** The number of overflow pages needed to store the given size. */
691 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
693 /** Header for a single key/data pair within a page.
694 * Used in pages of type #P_BRANCH and #P_LEAF without #P_LEAF2.
695 * We guarantee 2-byte alignment for 'MDB_node's.
697 typedef struct MDB_node {
698 /** lo and hi are used for data size on leaf nodes and for
699 * child pgno on branch nodes. On 64 bit platforms, flags
700 * is also used for pgno. (Branch nodes have no flags).
701 * They are in host byte order in case that lets some
702 * accesses be optimized into a 32-bit word access.
704 #if BYTE_ORDER == LITTLE_ENDIAN
705 unsigned short mn_lo, mn_hi; /**< part of data size or pgno */
707 unsigned short mn_hi, mn_lo;
709 /** @defgroup mdb_node Node Flags
711 * Flags for node headers.
714 #define F_BIGDATA 0x01 /**< data put on overflow page */
715 #define F_SUBDATA 0x02 /**< data is a sub-database */
716 #define F_DUPDATA 0x04 /**< data has duplicates */
718 /** valid flags for #mdb_node_add() */
719 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
722 unsigned short mn_flags; /**< @ref mdb_node */
723 unsigned short mn_ksize; /**< key size */
724 char mn_data[1]; /**< key and data are appended here */
727 /** Size of the node header, excluding dynamic data at the end */
728 #define NODESIZE offsetof(MDB_node, mn_data)
730 /** Bit position of top word in page number, for shifting mn_flags */
731 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
733 /** Size of a node in a branch page with a given key.
734 * This is just the node header plus the key, there is no data.
736 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
738 /** Size of a node in a leaf page with a given key and data.
739 * This is node header plus key plus data size.
741 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
743 /** Address of node \b i in page \b p */
744 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
746 /** Address of the key for the node */
747 #define NODEKEY(node) (void *)((node)->mn_data)
749 /** Address of the data for a node */
750 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
752 /** Get the page number pointed to by a branch node */
753 #define NODEPGNO(node) \
754 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
755 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
756 /** Set the page number in a branch node */
757 #define SETPGNO(node,pgno) do { \
758 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
759 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
761 /** Get the size of the data in a leaf node */
762 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
763 /** Set the size of the data for a leaf node */
764 #define SETDSZ(node,size) do { \
765 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
766 /** The size of a key in a node */
767 #define NODEKSZ(node) ((node)->mn_ksize)
769 /** Copy a page number from src to dst */
771 #define COPY_PGNO(dst,src) dst = src
773 #if SIZE_MAX > 4294967295UL
774 #define COPY_PGNO(dst,src) do { \
775 unsigned short *s, *d; \
776 s = (unsigned short *)&(src); \
777 d = (unsigned short *)&(dst); \
784 #define COPY_PGNO(dst,src) do { \
785 unsigned short *s, *d; \
786 s = (unsigned short *)&(src); \
787 d = (unsigned short *)&(dst); \
793 /** The address of a key in a LEAF2 page.
794 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
795 * There are no node headers, keys are stored contiguously.
797 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
799 /** Set the \b node's key into \b keyptr, if requested. */
800 #define MDB_GET_KEY(node, keyptr) { if ((keyptr) != NULL) { \
801 (keyptr)->mv_size = NODEKSZ(node); (keyptr)->mv_data = NODEKEY(node); } }
803 /** Set the \b node's key into \b key. */
804 #define MDB_GET_KEY2(node, key) { key.mv_size = NODEKSZ(node); key.mv_data = NODEKEY(node); }
806 /** Information about a single database in the environment. */
807 typedef struct MDB_db {
808 uint32_t md_pad; /**< also ksize for LEAF2 pages */
809 uint16_t md_flags; /**< @ref mdb_dbi_open */
810 uint16_t md_depth; /**< depth of this tree */
811 pgno_t md_branch_pages; /**< number of internal pages */
812 pgno_t md_leaf_pages; /**< number of leaf pages */
813 pgno_t md_overflow_pages; /**< number of overflow pages */
814 size_t md_entries; /**< number of data items */
815 pgno_t md_root; /**< the root page of this tree */
818 /** mdb_dbi_open flags */
819 #define MDB_VALID 0x8000 /**< DB handle is valid, for me_dbflags */
820 #define PERSISTENT_FLAGS (0xffff & ~(MDB_VALID))
821 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
822 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
824 /** Handle for the DB used to track free pages. */
826 /** Handle for the default DB. */
829 /** Meta page content.
830 * A meta page is the start point for accessing a database snapshot.
831 * Pages 0-1 are meta pages. Transaction N writes meta page #(N % 2).
833 typedef struct MDB_meta {
834 /** Stamp identifying this as an MDB file. It must be set
837 /** Version number of this lock file. Must be set to #MDB_DATA_VERSION. */
839 void *mm_address; /**< address for fixed mapping */
840 size_t mm_mapsize; /**< size of mmap region */
841 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
842 /** The size of pages used in this DB */
843 #define mm_psize mm_dbs[0].md_pad
844 /** Any persistent environment flags. @ref mdb_env */
845 #define mm_flags mm_dbs[0].md_flags
846 pgno_t mm_last_pg; /**< last used page in file */
847 txnid_t mm_txnid; /**< txnid that committed this page */
850 /** Buffer for a stack-allocated meta page.
851 * The members define size and alignment, and silence type
852 * aliasing warnings. They are not used directly; that could
853 * mean incorrectly using several union members in parallel.
855 typedef union MDB_metabuf {
858 char mm_pad[PAGEHDRSZ];
863 /** Auxiliary DB info.
864 * The information here is mostly static/read-only. There is
865 * only a single copy of this record in the environment.
867 typedef struct MDB_dbx {
868 MDB_val md_name; /**< name of the database */
869 MDB_cmp_func *md_cmp; /**< function for comparing keys */
870 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
871 MDB_rel_func *md_rel; /**< user relocate function */
872 void *md_relctx; /**< user-provided context for md_rel */
875 /** A database transaction.
876 * Every operation requires a transaction handle.
879 MDB_txn *mt_parent; /**< parent of a nested txn */
880 MDB_txn *mt_child; /**< nested txn under this txn */
881 pgno_t mt_next_pgno; /**< next unallocated page */
882 /** The ID of this transaction. IDs are integers incrementing from 1.
883 * Only committed write transactions increment the ID. If a transaction
884 * aborts, the ID may be re-used by the next writer.
887 MDB_env *mt_env; /**< the DB environment */
888 /** The list of pages that became unused during this transaction.
891 /** The sorted list of dirty pages we temporarily wrote to disk
892 * because the dirty list was full. page numbers in here are
893 * shifted left by 1, deleted slots have the LSB set.
895 MDB_IDL mt_spill_pgs;
897 /** For write txns: Modified pages. Sorted when not MDB_WRITEMAP. */
899 /** For read txns: This thread/txn's reader table slot, or NULL. */
902 /** Array of records for each DB known in the environment. */
904 /** Array of MDB_db records for each known DB */
906 /** @defgroup mt_dbflag Transaction DB Flags
910 #define DB_DIRTY 0x01 /**< DB was modified or is DUPSORT data */
911 #define DB_STALE 0x02 /**< Named-DB record is older than txnID */
912 #define DB_NEW 0x04 /**< Named-DB handle opened in this txn */
913 #define DB_VALID 0x08 /**< DB handle is valid, see also #MDB_VALID */
915 /** In write txns, array of cursors for each DB */
916 MDB_cursor **mt_cursors;
917 /** Array of flags for each DB */
918 unsigned char *mt_dbflags;
919 /** Number of DB records in use. This number only ever increments;
920 * we don't decrement it when individual DB handles are closed.
924 /** @defgroup mdb_txn Transaction Flags
928 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
929 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
930 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
931 #define MDB_TXN_SPILLS 0x08 /**< txn or a parent has spilled pages */
933 unsigned int mt_flags; /**< @ref mdb_txn */
934 /** dirty_list room: Array size - #dirty pages visible to this txn.
935 * Includes ancestor txns' dirty pages not hidden by other txns'
936 * dirty/spilled pages. Thus commit(nested txn) has room to merge
937 * dirty_list into mt_parent after freeing hidden mt_parent pages.
939 unsigned int mt_dirty_room;
942 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
943 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
944 * raise this on a 64 bit machine.
946 #define CURSOR_STACK 32
950 /** Cursors are used for all DB operations.
951 * A cursor holds a path of (page pointer, key index) from the DB
952 * root to a position in the DB, plus other state. #MDB_DUPSORT
953 * cursors include an xcursor to the current data item. Write txns
954 * track their cursors and keep them up to date when data moves.
955 * Exception: An xcursor's pointer to a #P_SUBP page can be stale.
956 * (A node with #F_DUPDATA but no #F_SUBDATA contains a subpage).
959 /** Next cursor on this DB in this txn */
961 /** Backup of the original cursor if this cursor is a shadow */
962 MDB_cursor *mc_backup;
963 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
964 struct MDB_xcursor *mc_xcursor;
965 /** The transaction that owns this cursor */
967 /** The database handle this cursor operates on */
969 /** The database record for this cursor */
971 /** The database auxiliary record for this cursor */
973 /** The @ref mt_dbflag for this database */
974 unsigned char *mc_dbflag;
975 unsigned short mc_snum; /**< number of pushed pages */
976 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
977 /** @defgroup mdb_cursor Cursor Flags
979 * Cursor state flags.
982 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
983 #define C_EOF 0x02 /**< No more data */
984 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
985 #define C_DEL 0x08 /**< last op was a cursor_del */
986 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
987 #define C_UNTRACK 0x40 /**< Un-track cursor when closing */
989 unsigned int mc_flags; /**< @ref mdb_cursor */
990 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
991 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
994 /** Context for sorted-dup records.
995 * We could have gone to a fully recursive design, with arbitrarily
996 * deep nesting of sub-databases. But for now we only handle these
997 * levels - main DB, optional sub-DB, sorted-duplicate DB.
999 typedef struct MDB_xcursor {
1000 /** A sub-cursor for traversing the Dup DB */
1001 MDB_cursor mx_cursor;
1002 /** The database record for this Dup DB */
1004 /** The auxiliary DB record for this Dup DB */
1006 /** The @ref mt_dbflag for this Dup DB */
1007 unsigned char mx_dbflag;
1010 /** State of FreeDB old pages, stored in the MDB_env */
1011 typedef struct MDB_pgstate {
1012 pgno_t *mf_pghead; /**< Reclaimed freeDB pages, or NULL before use */
1013 txnid_t mf_pglast; /**< ID of last used record, or 0 if !mf_pghead */
1016 /** The database environment. */
1018 HANDLE me_fd; /**< The main data file */
1019 HANDLE me_lfd; /**< The lock file */
1020 HANDLE me_mfd; /**< just for writing the meta pages */
1021 /** Failed to update the meta page. Probably an I/O error. */
1022 #define MDB_FATAL_ERROR 0x80000000U
1023 /** Some fields are initialized. */
1024 #define MDB_ENV_ACTIVE 0x20000000U
1025 /** me_txkey is set */
1026 #define MDB_ENV_TXKEY 0x10000000U
1027 /** Have liveness lock in reader table */
1028 #define MDB_LIVE_READER 0x08000000U
1029 uint32_t me_flags; /**< @ref mdb_env */
1030 unsigned int me_psize; /**< DB page size, inited from me_os_psize */
1031 unsigned int me_os_psize; /**< OS page size, from #GET_PAGESIZE */
1032 unsigned int me_maxreaders; /**< size of the reader table */
1033 unsigned int me_numreaders; /**< max numreaders set by this env */
1034 MDB_dbi me_numdbs; /**< number of DBs opened */
1035 MDB_dbi me_maxdbs; /**< size of the DB table */
1036 MDB_PID_T me_pid; /**< process ID of this env */
1037 char *me_path; /**< path to the DB files */
1038 char *me_map; /**< the memory map of the data file */
1039 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
1040 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
1041 void *me_pbuf; /**< scratch area for DUPSORT put() */
1042 MDB_txn *me_txn; /**< current write transaction */
1043 size_t me_mapsize; /**< size of the data memory map */
1044 off_t me_size; /**< current file size */
1045 pgno_t me_maxpg; /**< me_mapsize / me_psize */
1046 MDB_dbx *me_dbxs; /**< array of static DB info */
1047 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
1048 pthread_key_t me_txkey; /**< thread-key for readers */
1049 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
1050 # define me_pglast me_pgstate.mf_pglast
1051 # define me_pghead me_pgstate.mf_pghead
1052 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
1053 /** IDL of pages that became unused in a write txn */
1054 MDB_IDL me_free_pgs;
1055 /** ID2L of pages written during a write txn. Length MDB_IDL_UM_SIZE. */
1056 MDB_ID2L me_dirty_list;
1057 /** Max number of freelist items that can fit in a single overflow page */
1059 /** Max size of a node on a page */
1060 unsigned int me_nodemax;
1061 #if !(MDB_MAXKEYSIZE)
1062 unsigned int me_maxkey; /**< max size of a key */
1065 int me_pidquery; /**< Used in OpenProcess */
1066 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
1068 #elif defined(MDB_USE_POSIX_SEM)
1069 sem_t *me_rmutex; /* Shared mutexes are not supported */
1074 /** Nested transaction */
1075 typedef struct MDB_ntxn {
1076 MDB_txn mnt_txn; /**< the transaction */
1077 MDB_pgstate mnt_pgstate; /**< parent transaction's saved freestate */
1080 /** max number of pages to commit in one writev() call */
1081 #define MDB_COMMIT_PAGES 64
1082 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
1083 #undef MDB_COMMIT_PAGES
1084 #define MDB_COMMIT_PAGES IOV_MAX
1087 /* max bytes to write in one call */
1088 #define MAX_WRITE (0x80000000U >> (sizeof(ssize_t) == 4))
1090 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
1091 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
1092 static int mdb_page_touch(MDB_cursor *mc);
1094 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp, int *lvl);
1095 static int mdb_page_search_root(MDB_cursor *mc,
1096 MDB_val *key, int modify);
1097 #define MDB_PS_MODIFY 1
1098 #define MDB_PS_ROOTONLY 2
1099 #define MDB_PS_FIRST 4
1100 #define MDB_PS_LAST 8
1101 static int mdb_page_search(MDB_cursor *mc,
1102 MDB_val *key, int flags);
1103 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
1105 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
1106 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
1107 pgno_t newpgno, unsigned int nflags);
1109 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1110 static int mdb_env_pick_meta(const MDB_env *env);
1111 static int mdb_env_write_meta(MDB_txn *txn);
1112 #if !(defined(_WIN32) || defined(MDB_USE_POSIX_SEM)) /* Drop unused excl arg */
1113 # define mdb_env_close0(env, excl) mdb_env_close1(env)
1115 static void mdb_env_close0(MDB_env *env, int excl);
1117 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1118 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1119 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1120 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
1121 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1122 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1123 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1124 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1125 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1127 static int mdb_rebalance(MDB_cursor *mc);
1128 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1130 static void mdb_cursor_pop(MDB_cursor *mc);
1131 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1133 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
1134 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1135 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1136 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1137 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1139 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1140 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1142 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1143 static void mdb_xcursor_init0(MDB_cursor *mc);
1144 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1146 static int mdb_drop0(MDB_cursor *mc, int subs);
1147 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1150 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1154 static SECURITY_DESCRIPTOR mdb_null_sd;
1155 static SECURITY_ATTRIBUTES mdb_all_sa;
1156 static int mdb_sec_inited;
1159 /** Return the library version info. */
1161 mdb_version(int *major, int *minor, int *patch)
1163 if (major) *major = MDB_VERSION_MAJOR;
1164 if (minor) *minor = MDB_VERSION_MINOR;
1165 if (patch) *patch = MDB_VERSION_PATCH;
1166 return MDB_VERSION_STRING;
1169 /** Table of descriptions for MDB @ref errors */
1170 static char *const mdb_errstr[] = {
1171 "MDB_KEYEXIST: Key/data pair already exists",
1172 "MDB_NOTFOUND: No matching key/data pair found",
1173 "MDB_PAGE_NOTFOUND: Requested page not found",
1174 "MDB_CORRUPTED: Located page was wrong type",
1175 "MDB_PANIC: Update of meta page failed",
1176 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1177 "MDB_INVALID: File is not an MDB file",
1178 "MDB_MAP_FULL: Environment mapsize limit reached",
1179 "MDB_DBS_FULL: Environment maxdbs limit reached",
1180 "MDB_READERS_FULL: Environment maxreaders limit reached",
1181 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1182 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1183 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1184 "MDB_PAGE_FULL: Internal error - page has no more space",
1185 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1186 "MDB_INCOMPATIBLE: Operation and DB incompatible, or DB flags changed",
1187 "MDB_BAD_RSLOT: Invalid reuse of reader locktable slot",
1188 "MDB_BAD_TXN: Transaction cannot recover - it must be aborted",
1189 "MDB_BAD_VALSIZE: Too big key/data, key is empty, or wrong DUPFIXED size",
1193 mdb_strerror(int err)
1197 return ("Successful return: 0");
1199 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1200 i = err - MDB_KEYEXIST;
1201 return mdb_errstr[i];
1204 return strerror(err);
1208 /** Display a key in hexadecimal and return the address of the result.
1209 * @param[in] key the key to display
1210 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1211 * @return The key in hexadecimal form.
1214 mdb_dkey(MDB_val *key, char *buf)
1217 unsigned char *c = key->mv_data;
1223 if (key->mv_size > DKBUF_MAXKEYSIZE)
1224 return "MDB_MAXKEYSIZE";
1225 /* may want to make this a dynamic check: if the key is mostly
1226 * printable characters, print it as-is instead of converting to hex.
1230 for (i=0; i<key->mv_size; i++)
1231 ptr += sprintf(ptr, "%02x", *c++);
1233 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1238 /** Display all the keys in the page. */
1240 mdb_page_list(MDB_page *mp)
1243 unsigned int i, nkeys, nsize, total = 0;
1247 nkeys = NUMKEYS(mp);
1248 fprintf(stderr, "Page %"Z"u numkeys %d\n", mp->mp_pgno, nkeys);
1249 for (i=0; i<nkeys; i++) {
1250 node = NODEPTR(mp, i);
1251 key.mv_size = node->mn_ksize;
1252 key.mv_data = node->mn_data;
1253 nsize = NODESIZE + key.mv_size;
1254 if (IS_BRANCH(mp)) {
1255 fprintf(stderr, "key %d: page %"Z"u, %s\n", i, NODEPGNO(node),
1259 if (F_ISSET(node->mn_flags, F_BIGDATA))
1260 nsize += sizeof(pgno_t);
1262 nsize += NODEDSZ(node);
1264 nsize += sizeof(indx_t);
1265 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1267 total = EVEN(total);
1269 fprintf(stderr, "Total: %d\n", total);
1273 mdb_cursor_chk(MDB_cursor *mc)
1279 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1280 for (i=0; i<mc->mc_top; i++) {
1282 node = NODEPTR(mp, mc->mc_ki[i]);
1283 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1286 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1292 /** Count all the pages in each DB and in the freelist
1293 * and make sure it matches the actual number of pages
1296 static void mdb_audit(MDB_txn *txn)
1300 MDB_ID freecount, count;
1305 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1306 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1307 freecount += *(MDB_ID *)data.mv_data;
1310 for (i = 0; i<txn->mt_numdbs; i++) {
1312 mdb_cursor_init(&mc, txn, i, &mx);
1313 if (txn->mt_dbs[i].md_root == P_INVALID)
1315 count += txn->mt_dbs[i].md_branch_pages +
1316 txn->mt_dbs[i].md_leaf_pages +
1317 txn->mt_dbs[i].md_overflow_pages;
1318 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1319 mdb_page_search(&mc, NULL, MDB_PS_FIRST);
1323 mp = mc.mc_pg[mc.mc_top];
1324 for (j=0; j<NUMKEYS(mp); j++) {
1325 MDB_node *leaf = NODEPTR(mp, j);
1326 if (leaf->mn_flags & F_SUBDATA) {
1328 memcpy(&db, NODEDATA(leaf), sizeof(db));
1329 count += db.md_branch_pages + db.md_leaf_pages +
1330 db.md_overflow_pages;
1334 while (mdb_cursor_sibling(&mc, 1) == 0);
1337 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1338 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1339 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1345 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1347 return txn->mt_dbxs[dbi].md_cmp(a, b);
1351 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1353 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1356 /** Allocate memory for a page.
1357 * Re-use old malloc'd pages first for singletons, otherwise just malloc.
1360 mdb_page_malloc(MDB_txn *txn, unsigned num)
1362 MDB_env *env = txn->mt_env;
1363 MDB_page *ret = env->me_dpages;
1364 size_t psize = env->me_psize, sz = psize, off;
1365 /* For ! #MDB_NOMEMINIT, psize counts how much to init.
1366 * For a single page alloc, we init everything after the page header.
1367 * For multi-page, we init the final page; if the caller needed that
1368 * many pages they will be filling in at least up to the last page.
1372 VGMEMP_ALLOC(env, ret, sz);
1373 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1374 env->me_dpages = ret->mp_next;
1377 psize -= off = PAGEHDRSZ;
1382 if ((ret = malloc(sz)) != NULL) {
1383 if (!(env->me_flags & MDB_NOMEMINIT)) {
1384 memset((char *)ret + off, 0, psize);
1387 VGMEMP_ALLOC(env, ret, sz);
1392 /** Free a single page.
1393 * Saves single pages to a list, for future reuse.
1394 * (This is not used for multi-page overflow pages.)
1397 mdb_page_free(MDB_env *env, MDB_page *mp)
1399 mp->mp_next = env->me_dpages;
1400 VGMEMP_FREE(env, mp);
1401 env->me_dpages = mp;
1404 /** Free a dirty page */
1406 mdb_dpage_free(MDB_env *env, MDB_page *dp)
1408 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1409 mdb_page_free(env, dp);
1411 /* large pages just get freed directly */
1412 VGMEMP_FREE(env, dp);
1417 /** Return all dirty pages to dpage list */
1419 mdb_dlist_free(MDB_txn *txn)
1421 MDB_env *env = txn->mt_env;
1422 MDB_ID2L dl = txn->mt_u.dirty_list;
1423 unsigned i, n = dl[0].mid;
1425 for (i = 1; i <= n; i++) {
1426 mdb_dpage_free(env, dl[i].mptr);
1431 /** Set or clear P_KEEP in dirty, non-overflow, non-sub pages watched by txn.
1432 * @param[in] mc A cursor handle for the current operation.
1433 * @param[in] pflags Flags of the pages to update:
1434 * P_DIRTY to set P_KEEP, P_DIRTY|P_KEEP to clear it.
1435 * @param[in] all No shortcuts. Needed except after a full #mdb_page_flush().
1436 * @return 0 on success, non-zero on failure.
1439 mdb_pages_xkeep(MDB_cursor *mc, unsigned pflags, int all)
1441 enum { Mask = P_SUBP|P_DIRTY|P_KEEP };
1442 MDB_txn *txn = mc->mc_txn;
1448 int rc = MDB_SUCCESS, level;
1450 /* Mark pages seen by cursors */
1451 if (mc->mc_flags & C_UNTRACK)
1452 mc = NULL; /* will find mc in mt_cursors */
1453 for (i = txn->mt_numdbs;; mc = txn->mt_cursors[--i]) {
1454 for (; mc; mc=mc->mc_next) {
1455 if (!(mc->mc_flags & C_INITIALIZED))
1457 for (m3 = mc;; m3 = &mx->mx_cursor) {
1459 for (j=0; j<m3->mc_snum; j++) {
1461 if ((mp->mp_flags & Mask) == pflags)
1462 mp->mp_flags ^= P_KEEP;
1464 mx = m3->mc_xcursor;
1465 /* Proceed to mx if it is at a sub-database */
1466 if (! (mx && (mx->mx_cursor.mc_flags & C_INITIALIZED)))
1468 if (! (mp && (mp->mp_flags & P_LEAF)))
1470 leaf = NODEPTR(mp, m3->mc_ki[j-1]);
1471 if (!(leaf->mn_flags & F_SUBDATA))
1480 /* Mark dirty root pages */
1481 for (i=0; i<txn->mt_numdbs; i++) {
1482 if (txn->mt_dbflags[i] & DB_DIRTY) {
1483 pgno_t pgno = txn->mt_dbs[i].md_root;
1484 if (pgno == P_INVALID)
1486 if ((rc = mdb_page_get(txn, pgno, &dp, &level)) != MDB_SUCCESS)
1488 if ((dp->mp_flags & Mask) == pflags && level <= 1)
1489 dp->mp_flags ^= P_KEEP;
1497 static int mdb_page_flush(MDB_txn *txn, int keep);
1499 /** Spill pages from the dirty list back to disk.
1500 * This is intended to prevent running into #MDB_TXN_FULL situations,
1501 * but note that they may still occur in a few cases:
1502 * 1) our estimate of the txn size could be too small. Currently this
1503 * seems unlikely, except with a large number of #MDB_MULTIPLE items.
1504 * 2) child txns may run out of space if their parents dirtied a
1505 * lot of pages and never spilled them. TODO: we probably should do
1506 * a preemptive spill during #mdb_txn_begin() of a child txn, if
1507 * the parent's dirty_room is below a given threshold.
1509 * Otherwise, if not using nested txns, it is expected that apps will
1510 * not run into #MDB_TXN_FULL any more. The pages are flushed to disk
1511 * the same way as for a txn commit, e.g. their P_DIRTY flag is cleared.
1512 * If the txn never references them again, they can be left alone.
1513 * If the txn only reads them, they can be used without any fuss.
1514 * If the txn writes them again, they can be dirtied immediately without
1515 * going thru all of the work of #mdb_page_touch(). Such references are
1516 * handled by #mdb_page_unspill().
1518 * Also note, we never spill DB root pages, nor pages of active cursors,
1519 * because we'll need these back again soon anyway. And in nested txns,
1520 * we can't spill a page in a child txn if it was already spilled in a
1521 * parent txn. That would alter the parent txns' data even though
1522 * the child hasn't committed yet, and we'd have no way to undo it if
1523 * the child aborted.
1525 * @param[in] m0 cursor A cursor handle identifying the transaction and
1526 * database for which we are checking space.
1527 * @param[in] key For a put operation, the key being stored.
1528 * @param[in] data For a put operation, the data being stored.
1529 * @return 0 on success, non-zero on failure.
1532 mdb_page_spill(MDB_cursor *m0, MDB_val *key, MDB_val *data)
1534 MDB_txn *txn = m0->mc_txn;
1536 MDB_ID2L dl = txn->mt_u.dirty_list;
1537 unsigned int i, j, need;
1540 if (m0->mc_flags & C_SUB)
1543 /* Estimate how much space this op will take */
1544 i = m0->mc_db->md_depth;
1545 /* Named DBs also dirty the main DB */
1546 if (m0->mc_dbi > MAIN_DBI)
1547 i += txn->mt_dbs[MAIN_DBI].md_depth;
1548 /* For puts, roughly factor in the key+data size */
1550 i += (LEAFSIZE(key, data) + txn->mt_env->me_psize) / txn->mt_env->me_psize;
1551 i += i; /* double it for good measure */
1554 if (txn->mt_dirty_room > i)
1557 if (!txn->mt_spill_pgs) {
1558 txn->mt_spill_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX);
1559 if (!txn->mt_spill_pgs)
1562 /* purge deleted slots */
1563 MDB_IDL sl = txn->mt_spill_pgs;
1564 unsigned int num = sl[0];
1566 for (i=1; i<=num; i++) {
1573 /* Preserve pages which may soon be dirtied again */
1574 if ((rc = mdb_pages_xkeep(m0, P_DIRTY, 1)) != MDB_SUCCESS)
1577 /* Less aggressive spill - we originally spilled the entire dirty list,
1578 * with a few exceptions for cursor pages and DB root pages. But this
1579 * turns out to be a lot of wasted effort because in a large txn many
1580 * of those pages will need to be used again. So now we spill only 1/8th
1581 * of the dirty pages. Testing revealed this to be a good tradeoff,
1582 * better than 1/2, 1/4, or 1/10.
1584 if (need < MDB_IDL_UM_MAX / 8)
1585 need = MDB_IDL_UM_MAX / 8;
1587 /* Save the page IDs of all the pages we're flushing */
1588 /* flush from the tail forward, this saves a lot of shifting later on. */
1589 for (i=dl[0].mid; i && need; i--) {
1590 MDB_ID pn = dl[i].mid << 1;
1592 if (dp->mp_flags & P_KEEP)
1594 /* Can't spill twice, make sure it's not already in a parent's
1597 if (txn->mt_parent) {
1599 for (tx2 = txn->mt_parent; tx2; tx2 = tx2->mt_parent) {
1600 if (tx2->mt_spill_pgs) {
1601 j = mdb_midl_search(tx2->mt_spill_pgs, pn);
1602 if (j <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[j] == pn) {
1603 dp->mp_flags |= P_KEEP;
1611 if ((rc = mdb_midl_append(&txn->mt_spill_pgs, pn)))
1615 mdb_midl_sort(txn->mt_spill_pgs);
1617 /* Flush the spilled part of dirty list */
1618 if ((rc = mdb_page_flush(txn, i)) != MDB_SUCCESS)
1621 /* Reset any dirty pages we kept that page_flush didn't see */
1622 rc = mdb_pages_xkeep(m0, P_DIRTY|P_KEEP, i);
1625 txn->mt_flags |= rc ? MDB_TXN_ERROR : MDB_TXN_SPILLS;
1629 /** Find oldest txnid still referenced. Expects txn->mt_txnid > 0. */
1631 mdb_find_oldest(MDB_txn *txn)
1634 txnid_t mr, oldest = txn->mt_txnid - 1;
1635 if (txn->mt_env->me_txns) {
1636 MDB_reader *r = txn->mt_env->me_txns->mti_readers;
1637 for (i = txn->mt_env->me_txns->mti_numreaders; --i >= 0; ) {
1648 /** Add a page to the txn's dirty list */
1650 mdb_page_dirty(MDB_txn *txn, MDB_page *mp)
1653 int (*insert)(MDB_ID2L, MDB_ID2 *);
1655 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1656 insert = mdb_mid2l_append;
1658 insert = mdb_mid2l_insert;
1660 mid.mid = mp->mp_pgno;
1662 insert(txn->mt_u.dirty_list, &mid);
1663 txn->mt_dirty_room--;
1666 /** Allocate page numbers and memory for writing. Maintain me_pglast,
1667 * me_pghead and mt_next_pgno.
1669 * If there are free pages available from older transactions, they
1670 * are re-used first. Otherwise allocate a new page at mt_next_pgno.
1671 * Do not modify the freedB, just merge freeDB records into me_pghead[]
1672 * and move me_pglast to say which records were consumed. Only this
1673 * function can create me_pghead and move me_pglast/mt_next_pgno.
1674 * @param[in] mc cursor A cursor handle identifying the transaction and
1675 * database for which we are allocating.
1676 * @param[in] num the number of pages to allocate.
1677 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1678 * will always be satisfied by a single contiguous chunk of memory.
1679 * @return 0 on success, non-zero on failure.
1682 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1684 #ifdef MDB_PARANOID /* Seems like we can ignore this now */
1685 /* Get at most <Max_retries> more freeDB records once me_pghead
1686 * has enough pages. If not enough, use new pages from the map.
1687 * If <Paranoid> and mc is updating the freeDB, only get new
1688 * records if me_pghead is empty. Then the freelist cannot play
1689 * catch-up with itself by growing while trying to save it.
1691 enum { Paranoid = 1, Max_retries = 500 };
1693 enum { Paranoid = 0, Max_retries = INT_MAX /*infinite*/ };
1695 int rc, retry = Max_retries;
1696 MDB_txn *txn = mc->mc_txn;
1697 MDB_env *env = txn->mt_env;
1698 pgno_t pgno, *mop = env->me_pghead;
1699 unsigned i, j, k, mop_len = mop ? mop[0] : 0, n2 = num-1;
1701 txnid_t oldest = 0, last;
1707 /* If our dirty list is already full, we can't do anything */
1708 if (txn->mt_dirty_room == 0)
1709 return MDB_TXN_FULL;
1711 for (op = MDB_FIRST;; op = MDB_NEXT) {
1714 pgno_t *idl, old_id, new_id;
1716 /* Seek a big enough contiguous page range. Prefer
1717 * pages at the tail, just truncating the list.
1723 if (mop[i-n2] == pgno+n2)
1726 if (Max_retries < INT_MAX && --retry < 0)
1730 if (op == MDB_FIRST) { /* 1st iteration */
1731 /* Prepare to fetch more and coalesce */
1732 oldest = mdb_find_oldest(txn);
1733 last = env->me_pglast;
1734 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1737 key.mv_data = &last; /* will look up last+1 */
1738 key.mv_size = sizeof(last);
1740 if (Paranoid && mc->mc_dbi == FREE_DBI)
1743 if (Paranoid && retry < 0 && mop_len)
1747 /* Do not fetch more if the record will be too recent */
1750 rc = mdb_cursor_get(&m2, &key, NULL, op);
1752 if (rc == MDB_NOTFOUND)
1756 last = *(txnid_t*)key.mv_data;
1759 np = m2.mc_pg[m2.mc_top];
1760 leaf = NODEPTR(np, m2.mc_ki[m2.mc_top]);
1761 if ((rc = mdb_node_read(txn, leaf, &data)) != MDB_SUCCESS)
1764 idl = (MDB_ID *) data.mv_data;
1767 if (!(env->me_pghead = mop = mdb_midl_alloc(i)))
1770 if ((rc = mdb_midl_need(&env->me_pghead, i)) != 0)
1772 mop = env->me_pghead;
1774 env->me_pglast = last;
1776 DPRINTF(("IDL read txn %"Z"u root %"Z"u num %u",
1777 last, txn->mt_dbs[FREE_DBI].md_root, i));
1779 DPRINTF(("IDL %"Z"u", idl[k]));
1781 /* Merge in descending sorted order */
1784 mop[0] = (pgno_t)-1;
1788 for (; old_id < new_id; old_id = mop[--j])
1795 /* Use new pages from the map when nothing suitable in the freeDB */
1797 pgno = txn->mt_next_pgno;
1798 if (pgno + num >= env->me_maxpg) {
1799 DPUTS("DB size maxed out");
1800 return MDB_MAP_FULL;
1804 if (env->me_flags & MDB_WRITEMAP) {
1805 np = (MDB_page *)(env->me_map + env->me_psize * pgno);
1807 if (!(np = mdb_page_malloc(txn, num)))
1811 mop[0] = mop_len -= num;
1812 /* Move any stragglers down */
1813 for (j = i-num; j < mop_len; )
1814 mop[++j] = mop[++i];
1816 txn->mt_next_pgno = pgno + num;
1819 mdb_page_dirty(txn, np);
1825 /** Copy the used portions of a non-overflow page.
1826 * @param[in] dst page to copy into
1827 * @param[in] src page to copy from
1828 * @param[in] psize size of a page
1831 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1833 enum { Align = sizeof(pgno_t) };
1834 indx_t upper = src->mp_upper, lower = src->mp_lower, unused = upper-lower;
1836 /* If page isn't full, just copy the used portion. Adjust
1837 * alignment so memcpy may copy words instead of bytes.
1839 if ((unused &= -Align) && !IS_LEAF2(src)) {
1841 memcpy(dst, src, (lower + (Align-1)) & -Align);
1842 memcpy((pgno_t *)((char *)dst+upper), (pgno_t *)((char *)src+upper),
1845 memcpy(dst, src, psize - unused);
1849 /** Pull a page off the txn's spill list, if present.
1850 * If a page being referenced was spilled to disk in this txn, bring
1851 * it back and make it dirty/writable again.
1852 * @param[in] txn the transaction handle.
1853 * @param[in] mp the page being referenced. It must not be dirty.
1854 * @param[out] ret the writable page, if any. ret is unchanged if
1855 * mp wasn't spilled.
1858 mdb_page_unspill(MDB_txn *txn, MDB_page *mp, MDB_page **ret)
1860 MDB_env *env = txn->mt_env;
1863 pgno_t pgno = mp->mp_pgno, pn = pgno << 1;
1865 for (tx2 = txn; tx2; tx2=tx2->mt_parent) {
1866 if (!tx2->mt_spill_pgs)
1868 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
1869 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
1872 if (txn->mt_dirty_room == 0)
1873 return MDB_TXN_FULL;
1874 if (IS_OVERFLOW(mp))
1878 if (env->me_flags & MDB_WRITEMAP) {
1881 np = mdb_page_malloc(txn, num);
1885 memcpy(np, mp, num * env->me_psize);
1887 mdb_page_copy(np, mp, env->me_psize);
1890 /* If in current txn, this page is no longer spilled.
1891 * If it happens to be the last page, truncate the spill list.
1892 * Otherwise mark it as deleted by setting the LSB.
1894 if (x == txn->mt_spill_pgs[0])
1895 txn->mt_spill_pgs[0]--;
1897 txn->mt_spill_pgs[x] |= 1;
1898 } /* otherwise, if belonging to a parent txn, the
1899 * page remains spilled until child commits
1902 mdb_page_dirty(txn, np);
1903 np->mp_flags |= P_DIRTY;
1911 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1912 * @param[in] mc cursor pointing to the page to be touched
1913 * @return 0 on success, non-zero on failure.
1916 mdb_page_touch(MDB_cursor *mc)
1918 MDB_page *mp = mc->mc_pg[mc->mc_top], *np;
1919 MDB_txn *txn = mc->mc_txn;
1920 MDB_cursor *m2, *m3;
1924 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1925 if (txn->mt_flags & MDB_TXN_SPILLS) {
1927 rc = mdb_page_unspill(txn, mp, &np);
1933 if ((rc = mdb_midl_need(&txn->mt_free_pgs, 1)) ||
1934 (rc = mdb_page_alloc(mc, 1, &np)))
1937 DPRINTF(("touched db %d page %"Z"u -> %"Z"u", DDBI(mc),
1938 mp->mp_pgno, pgno));
1939 assert(mp->mp_pgno != pgno);
1940 mdb_midl_xappend(txn->mt_free_pgs, mp->mp_pgno);
1941 /* Update the parent page, if any, to point to the new page */
1943 MDB_page *parent = mc->mc_pg[mc->mc_top-1];
1944 MDB_node *node = NODEPTR(parent, mc->mc_ki[mc->mc_top-1]);
1945 SETPGNO(node, pgno);
1947 mc->mc_db->md_root = pgno;
1949 } else if (txn->mt_parent && !IS_SUBP(mp)) {
1950 MDB_ID2 mid, *dl = txn->mt_u.dirty_list;
1952 /* If txn has a parent, make sure the page is in our
1956 unsigned x = mdb_mid2l_search(dl, pgno);
1957 if (x <= dl[0].mid && dl[x].mid == pgno) {
1958 if (mp != dl[x].mptr) { /* bad cursor? */
1959 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
1960 return MDB_CORRUPTED;
1965 assert(dl[0].mid < MDB_IDL_UM_MAX);
1967 np = mdb_page_malloc(txn, 1);
1972 mdb_mid2l_insert(dl, &mid);
1977 mdb_page_copy(np, mp, txn->mt_env->me_psize);
1979 np->mp_flags |= P_DIRTY;
1982 /* Adjust cursors pointing to mp */
1983 mc->mc_pg[mc->mc_top] = np;
1984 m2 = txn->mt_cursors[mc->mc_dbi];
1985 if (mc->mc_flags & C_SUB) {
1986 for (; m2; m2=m2->mc_next) {
1987 m3 = &m2->mc_xcursor->mx_cursor;
1988 if (m3->mc_snum < mc->mc_snum) continue;
1989 if (m3->mc_pg[mc->mc_top] == mp)
1990 m3->mc_pg[mc->mc_top] = np;
1993 for (; m2; m2=m2->mc_next) {
1994 if (m2->mc_snum < mc->mc_snum) continue;
1995 if (m2->mc_pg[mc->mc_top] == mp) {
1996 m2->mc_pg[mc->mc_top] = np;
1997 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
1998 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
2000 MDB_node *leaf = NODEPTR(np, mc->mc_ki[mc->mc_top]);
2001 if (!(leaf->mn_flags & F_SUBDATA))
2002 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
2011 mdb_env_sync(MDB_env *env, int force)
2014 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
2015 if (env->me_flags & MDB_WRITEMAP) {
2016 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
2017 ? MS_ASYNC : MS_SYNC;
2018 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
2021 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
2025 if (MDB_FDATASYNC(env->me_fd))
2032 /** Back up parent txn's cursors, then grab the originals for tracking */
2034 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
2036 MDB_cursor *mc, *bk;
2041 for (i = src->mt_numdbs; --i >= 0; ) {
2042 if ((mc = src->mt_cursors[i]) != NULL) {
2043 size = sizeof(MDB_cursor);
2045 size += sizeof(MDB_xcursor);
2046 for (; mc; mc = bk->mc_next) {
2052 mc->mc_db = &dst->mt_dbs[i];
2053 /* Kill pointers into src - and dst to reduce abuse: The
2054 * user may not use mc until dst ends. Otherwise we'd...
2056 mc->mc_txn = NULL; /* ...set this to dst */
2057 mc->mc_dbflag = NULL; /* ...and &dst->mt_dbflags[i] */
2058 if ((mx = mc->mc_xcursor) != NULL) {
2059 *(MDB_xcursor *)(bk+1) = *mx;
2060 mx->mx_cursor.mc_txn = NULL; /* ...and dst. */
2062 mc->mc_next = dst->mt_cursors[i];
2063 dst->mt_cursors[i] = mc;
2070 /** Close this write txn's cursors, give parent txn's cursors back to parent.
2071 * @param[in] txn the transaction handle.
2072 * @param[in] merge true to keep changes to parent cursors, false to revert.
2073 * @return 0 on success, non-zero on failure.
2076 mdb_cursors_close(MDB_txn *txn, unsigned merge)
2078 MDB_cursor **cursors = txn->mt_cursors, *mc, *next, *bk;
2082 for (i = txn->mt_numdbs; --i >= 0; ) {
2083 for (mc = cursors[i]; mc; mc = next) {
2085 if ((bk = mc->mc_backup) != NULL) {
2087 /* Commit changes to parent txn */
2088 mc->mc_next = bk->mc_next;
2089 mc->mc_backup = bk->mc_backup;
2090 mc->mc_txn = bk->mc_txn;
2091 mc->mc_db = bk->mc_db;
2092 mc->mc_dbflag = bk->mc_dbflag;
2093 if ((mx = mc->mc_xcursor) != NULL)
2094 mx->mx_cursor.mc_txn = bk->mc_txn;
2096 /* Abort nested txn */
2098 if ((mx = mc->mc_xcursor) != NULL)
2099 *mx = *(MDB_xcursor *)(bk+1);
2103 /* Only malloced cursors are permanently tracked. */
2111 #define mdb_txn_reset0(txn, act) mdb_txn_reset0(txn)
2114 mdb_txn_reset0(MDB_txn *txn, const char *act);
2116 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2122 Pidset = F_SETLK, Pidcheck = F_GETLK
2126 /** Set or check a pid lock. Set returns 0 on success.
2127 * Check returns 0 if the process is certainly dead, nonzero if it may
2128 * be alive (the lock exists or an error happened so we do not know).
2130 * On Windows Pidset is a no-op, we merely check for the existence
2131 * of the process with the given pid. On POSIX we use a single byte
2132 * lock on the lockfile, set at an offset equal to the pid.
2135 mdb_reader_pid(MDB_env *env, enum Pidlock_op op, MDB_PID_T pid)
2137 #if !(MDB_PIDLOCK) /* Currently the same as defined(_WIN32) */
2140 if (op == Pidcheck) {
2141 h = OpenProcess(env->me_pidquery, FALSE, pid);
2142 /* No documented "no such process" code, but other program use this: */
2144 return ErrCode() != ERROR_INVALID_PARAMETER;
2145 /* A process exists until all handles to it close. Has it exited? */
2146 ret = WaitForSingleObject(h, 0) != 0;
2153 struct flock lock_info;
2154 memset(&lock_info, 0, sizeof(lock_info));
2155 lock_info.l_type = F_WRLCK;
2156 lock_info.l_whence = SEEK_SET;
2157 lock_info.l_start = pid;
2158 lock_info.l_len = 1;
2159 if ((rc = fcntl(env->me_lfd, op, &lock_info)) == 0) {
2160 if (op == F_GETLK && lock_info.l_type != F_UNLCK)
2162 } else if ((rc = ErrCode()) == EINTR) {
2170 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
2171 * @param[in] txn the transaction handle to initialize
2172 * @return 0 on success, non-zero on failure.
2175 mdb_txn_renew0(MDB_txn *txn)
2177 MDB_env *env = txn->mt_env;
2178 MDB_txninfo *ti = env->me_txns;
2182 int rc, new_notls = 0;
2185 txn->mt_numdbs = env->me_numdbs;
2186 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
2188 if (txn->mt_flags & MDB_TXN_RDONLY) {
2190 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2191 txn->mt_txnid = meta->mm_txnid;
2192 txn->mt_u.reader = NULL;
2194 MDB_reader *r = (env->me_flags & MDB_NOTLS) ? txn->mt_u.reader :
2195 pthread_getspecific(env->me_txkey);
2197 if (r->mr_pid != env->me_pid || r->mr_txnid != (txnid_t)-1)
2198 return MDB_BAD_RSLOT;
2200 MDB_PID_T pid = env->me_pid;
2201 pthread_t tid = pthread_self();
2203 if (!(env->me_flags & MDB_LIVE_READER)) {
2204 rc = mdb_reader_pid(env, Pidset, pid);
2206 UNLOCK_MUTEX_R(env);
2209 env->me_flags |= MDB_LIVE_READER;
2213 nr = ti->mti_numreaders;
2214 for (i=0; i<nr; i++)
2215 if (ti->mti_readers[i].mr_pid == 0)
2217 if (i == env->me_maxreaders) {
2218 UNLOCK_MUTEX_R(env);
2219 return MDB_READERS_FULL;
2221 ti->mti_readers[i].mr_pid = pid;
2222 ti->mti_readers[i].mr_tid = tid;
2224 ti->mti_numreaders = ++nr;
2225 /* Save numreaders for un-mutexed mdb_env_close() */
2226 env->me_numreaders = nr;
2227 UNLOCK_MUTEX_R(env);
2229 r = &ti->mti_readers[i];
2230 new_notls = (env->me_flags & MDB_NOTLS);
2231 if (!new_notls && (rc=pthread_setspecific(env->me_txkey, r))) {
2236 txn->mt_txnid = r->mr_txnid = ti->mti_txnid;
2237 txn->mt_u.reader = r;
2238 meta = env->me_metas[txn->mt_txnid & 1];
2244 txn->mt_txnid = ti->mti_txnid;
2245 meta = env->me_metas[txn->mt_txnid & 1];
2247 meta = env->me_metas[ mdb_env_pick_meta(env) ];
2248 txn->mt_txnid = meta->mm_txnid;
2252 if (txn->mt_txnid == mdb_debug_start)
2255 txn->mt_dirty_room = MDB_IDL_UM_MAX;
2256 txn->mt_u.dirty_list = env->me_dirty_list;
2257 txn->mt_u.dirty_list[0].mid = 0;
2258 txn->mt_free_pgs = env->me_free_pgs;
2259 txn->mt_free_pgs[0] = 0;
2260 txn->mt_spill_pgs = NULL;
2264 /* Copy the DB info and flags */
2265 memcpy(txn->mt_dbs, meta->mm_dbs, 2 * sizeof(MDB_db));
2267 /* Moved to here to avoid a data race in read TXNs */
2268 txn->mt_next_pgno = meta->mm_last_pg+1;
2270 for (i=2; i<txn->mt_numdbs; i++) {
2271 x = env->me_dbflags[i];
2272 txn->mt_dbs[i].md_flags = x & PERSISTENT_FLAGS;
2273 txn->mt_dbflags[i] = (x & MDB_VALID) ? DB_VALID|DB_STALE : 0;
2275 txn->mt_dbflags[0] = txn->mt_dbflags[1] = DB_VALID;
2277 if (env->me_maxpg < txn->mt_next_pgno) {
2278 mdb_txn_reset0(txn, "renew0-mapfail");
2280 txn->mt_u.reader->mr_pid = 0;
2281 txn->mt_u.reader = NULL;
2283 return MDB_MAP_RESIZED;
2290 mdb_txn_renew(MDB_txn *txn)
2294 if (!txn || txn->mt_dbxs) /* A reset txn has mt_dbxs==NULL */
2297 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
2298 DPUTS("environment had fatal error, must shutdown!");
2302 rc = mdb_txn_renew0(txn);
2303 if (rc == MDB_SUCCESS) {
2304 DPRINTF(("renew txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2305 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2306 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root));
2312 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
2316 int rc, size, tsize = sizeof(MDB_txn);
2318 if (env->me_flags & MDB_FATAL_ERROR) {
2319 DPUTS("environment had fatal error, must shutdown!");
2322 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
2325 /* Nested transactions: Max 1 child, write txns only, no writemap */
2326 if (parent->mt_child ||
2327 (flags & MDB_RDONLY) ||
2328 (parent->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR)) ||
2329 (env->me_flags & MDB_WRITEMAP))
2331 return (parent->mt_flags & MDB_TXN_RDONLY) ? EINVAL : MDB_BAD_TXN;
2333 tsize = sizeof(MDB_ntxn);
2335 size = tsize + env->me_maxdbs * (sizeof(MDB_db)+1);
2336 if (!(flags & MDB_RDONLY))
2337 size += env->me_maxdbs * sizeof(MDB_cursor *);
2339 if ((txn = calloc(1, size)) == NULL) {
2340 DPRINTF(("calloc: %s", strerror(ErrCode())));
2343 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
2344 if (flags & MDB_RDONLY) {
2345 txn->mt_flags |= MDB_TXN_RDONLY;
2346 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
2348 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
2349 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
2355 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
2356 if (!txn->mt_u.dirty_list ||
2357 !(txn->mt_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)))
2359 free(txn->mt_u.dirty_list);
2363 txn->mt_txnid = parent->mt_txnid;
2364 txn->mt_dirty_room = parent->mt_dirty_room;
2365 txn->mt_u.dirty_list[0].mid = 0;
2366 txn->mt_spill_pgs = NULL;
2367 txn->mt_next_pgno = parent->mt_next_pgno;
2368 parent->mt_child = txn;
2369 txn->mt_parent = parent;
2370 txn->mt_numdbs = parent->mt_numdbs;
2371 txn->mt_flags = parent->mt_flags;
2372 txn->mt_dbxs = parent->mt_dbxs;
2373 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2374 /* Copy parent's mt_dbflags, but clear DB_NEW */
2375 for (i=0; i<txn->mt_numdbs; i++)
2376 txn->mt_dbflags[i] = parent->mt_dbflags[i] & ~DB_NEW;
2378 ntxn = (MDB_ntxn *)txn;
2379 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
2380 if (env->me_pghead) {
2381 size = MDB_IDL_SIZEOF(env->me_pghead);
2382 env->me_pghead = mdb_midl_alloc(env->me_pghead[0]);
2384 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
2389 rc = mdb_cursor_shadow(parent, txn);
2391 mdb_txn_reset0(txn, "beginchild-fail");
2393 rc = mdb_txn_renew0(txn);
2399 DPRINTF(("begin txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2400 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2401 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root));
2408 mdb_txn_env(MDB_txn *txn)
2410 if(!txn) return NULL;
2414 /** Export or close DBI handles opened in this txn. */
2416 mdb_dbis_update(MDB_txn *txn, int keep)
2419 MDB_dbi n = txn->mt_numdbs;
2420 MDB_env *env = txn->mt_env;
2421 unsigned char *tdbflags = txn->mt_dbflags;
2423 for (i = n; --i >= 2;) {
2424 if (tdbflags[i] & DB_NEW) {
2426 env->me_dbflags[i] = txn->mt_dbs[i].md_flags | MDB_VALID;
2428 char *ptr = env->me_dbxs[i].md_name.mv_data;
2429 env->me_dbxs[i].md_name.mv_data = NULL;
2430 env->me_dbxs[i].md_name.mv_size = 0;
2431 env->me_dbflags[i] = 0;
2436 if (keep && env->me_numdbs < n)
2440 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
2441 * May be called twice for readonly txns: First reset it, then abort.
2442 * @param[in] txn the transaction handle to reset
2443 * @param[in] act why the transaction is being reset
2446 mdb_txn_reset0(MDB_txn *txn, const char *act)
2448 MDB_env *env = txn->mt_env;
2450 /* Close any DBI handles opened in this txn */
2451 mdb_dbis_update(txn, 0);
2453 DPRINTF(("%s txn %"Z"u%c %p on mdbenv %p, root page %"Z"u",
2454 act, txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2455 (void *) txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root));
2457 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2458 if (txn->mt_u.reader) {
2459 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
2460 if (!(env->me_flags & MDB_NOTLS))
2461 txn->mt_u.reader = NULL; /* txn does not own reader */
2463 txn->mt_numdbs = 0; /* close nothing if called again */
2464 txn->mt_dbxs = NULL; /* mark txn as reset */
2466 mdb_cursors_close(txn, 0);
2468 if (!(env->me_flags & MDB_WRITEMAP)) {
2469 mdb_dlist_free(txn);
2471 mdb_midl_free(env->me_pghead);
2473 if (txn->mt_parent) {
2474 txn->mt_parent->mt_child = NULL;
2475 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2476 mdb_midl_free(txn->mt_free_pgs);
2477 mdb_midl_free(txn->mt_spill_pgs);
2478 free(txn->mt_u.dirty_list);
2482 if (mdb_midl_shrink(&txn->mt_free_pgs))
2483 env->me_free_pgs = txn->mt_free_pgs;
2484 env->me_pghead = NULL;
2488 /* The writer mutex was locked in mdb_txn_begin. */
2490 UNLOCK_MUTEX_W(env);
2495 mdb_txn_reset(MDB_txn *txn)
2500 /* This call is only valid for read-only txns */
2501 if (!(txn->mt_flags & MDB_TXN_RDONLY))
2504 mdb_txn_reset0(txn, "reset");
2508 mdb_txn_abort(MDB_txn *txn)
2514 mdb_txn_abort(txn->mt_child);
2516 mdb_txn_reset0(txn, "abort");
2517 /* Free reader slot tied to this txn (if MDB_NOTLS && writable FS) */
2518 if ((txn->mt_flags & MDB_TXN_RDONLY) && txn->mt_u.reader)
2519 txn->mt_u.reader->mr_pid = 0;
2524 /** Save the freelist as of this transaction to the freeDB.
2525 * This changes the freelist. Keep trying until it stabilizes.
2528 mdb_freelist_save(MDB_txn *txn)
2530 /* env->me_pghead[] can grow and shrink during this call.
2531 * env->me_pglast and txn->mt_free_pgs[] can only grow.
2532 * Page numbers cannot disappear from txn->mt_free_pgs[].
2535 MDB_env *env = txn->mt_env;
2536 int rc, maxfree_1pg = env->me_maxfree_1pg, more = 1;
2537 txnid_t pglast = 0, head_id = 0;
2538 pgno_t freecnt = 0, *free_pgs, *mop;
2539 ssize_t head_room = 0, total_room = 0, mop_len, clean_limit;
2541 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2543 if (env->me_pghead) {
2544 /* Make sure first page of freeDB is touched and on freelist */
2545 rc = mdb_page_search(&mc, NULL, MDB_PS_FIRST|MDB_PS_MODIFY);
2546 if (rc && rc != MDB_NOTFOUND)
2550 /* MDB_RESERVE cancels meminit in ovpage malloc (when no WRITEMAP) */
2551 clean_limit = (env->me_flags & (MDB_NOMEMINIT|MDB_WRITEMAP))
2552 ? SSIZE_MAX : maxfree_1pg;
2555 /* Come back here after each Put() in case freelist changed */
2560 /* If using records from freeDB which we have not yet
2561 * deleted, delete them and any we reserved for me_pghead.
2563 while (pglast < env->me_pglast) {
2564 rc = mdb_cursor_first(&mc, &key, NULL);
2567 pglast = head_id = *(txnid_t *)key.mv_data;
2568 total_room = head_room = 0;
2569 assert(pglast <= env->me_pglast);
2570 rc = mdb_cursor_del(&mc, 0);
2575 /* Save the IDL of pages freed by this txn, to a single record */
2576 if (freecnt < txn->mt_free_pgs[0]) {
2578 /* Make sure last page of freeDB is touched and on freelist */
2579 rc = mdb_page_search(&mc, NULL, MDB_PS_LAST|MDB_PS_MODIFY);
2580 if (rc && rc != MDB_NOTFOUND)
2583 free_pgs = txn->mt_free_pgs;
2584 /* Write to last page of freeDB */
2585 key.mv_size = sizeof(txn->mt_txnid);
2586 key.mv_data = &txn->mt_txnid;
2588 freecnt = free_pgs[0];
2589 data.mv_size = MDB_IDL_SIZEOF(free_pgs);
2590 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2593 /* Retry if mt_free_pgs[] grew during the Put() */
2594 free_pgs = txn->mt_free_pgs;
2595 } while (freecnt < free_pgs[0]);
2596 mdb_midl_sort(free_pgs);
2597 memcpy(data.mv_data, free_pgs, data.mv_size);
2600 unsigned int i = free_pgs[0];
2601 DPRINTF(("IDL write txn %"Z"u root %"Z"u num %u",
2602 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, i));
2604 DPRINTF(("IDL %"Z"u", free_pgs[i]));
2610 mop = env->me_pghead;
2611 mop_len = mop ? mop[0] : 0;
2613 /* Reserve records for me_pghead[]. Split it if multi-page,
2614 * to avoid searching freeDB for a page range. Use keys in
2615 * range [1,me_pglast]: Smaller than txnid of oldest reader.
2617 if (total_room >= mop_len) {
2618 if (total_room == mop_len || --more < 0)
2620 } else if (head_room >= maxfree_1pg && head_id > 1) {
2621 /* Keep current record (overflow page), add a new one */
2625 /* (Re)write {key = head_id, IDL length = head_room} */
2626 total_room -= head_room;
2627 head_room = mop_len - total_room;
2628 if (head_room > maxfree_1pg && head_id > 1) {
2629 /* Overflow multi-page for part of me_pghead */
2630 head_room /= head_id; /* amortize page sizes */
2631 head_room += maxfree_1pg - head_room % (maxfree_1pg + 1);
2632 } else if (head_room < 0) {
2633 /* Rare case, not bothering to delete this record */
2636 key.mv_size = sizeof(head_id);
2637 key.mv_data = &head_id;
2638 data.mv_size = (head_room + 1) * sizeof(pgno_t);
2639 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2642 /* IDL is initially empty, zero out at least the length */
2643 pgs = (pgno_t *)data.mv_data;
2644 j = head_room > clean_limit ? head_room : 0;
2648 total_room += head_room;
2651 /* Fill in the reserved me_pghead records */
2657 rc = mdb_cursor_first(&mc, &key, &data);
2658 for (; !rc; rc = mdb_cursor_next(&mc, &key, &data, MDB_NEXT)) {
2659 unsigned flags = MDB_CURRENT;
2660 txnid_t id = *(txnid_t *)key.mv_data;
2661 ssize_t len = (ssize_t)(data.mv_size / sizeof(MDB_ID)) - 1;
2664 assert(len >= 0 && id <= env->me_pglast);
2666 if (len > mop_len) {
2668 data.mv_size = (len + 1) * sizeof(MDB_ID);
2671 data.mv_data = mop -= len;
2674 rc = mdb_cursor_put(&mc, &key, &data, flags);
2676 if (rc || !(mop_len -= len))
2683 /** Flush (some) dirty pages to the map, after clearing their dirty flag.
2684 * @param[in] txn the transaction that's being committed
2685 * @param[in] keep number of initial pages in dirty_list to keep dirty.
2686 * @return 0 on success, non-zero on failure.
2689 mdb_page_flush(MDB_txn *txn, int keep)
2691 MDB_env *env = txn->mt_env;
2692 MDB_ID2L dl = txn->mt_u.dirty_list;
2693 unsigned psize = env->me_psize, j;
2694 int i, pagecount = dl[0].mid, rc;
2695 size_t size = 0, pos = 0;
2697 MDB_page *dp = NULL;
2701 struct iovec iov[MDB_COMMIT_PAGES];
2702 ssize_t wpos = 0, wsize = 0, wres;
2703 size_t next_pos = 1; /* impossible pos, so pos != next_pos */
2709 if (env->me_flags & MDB_WRITEMAP) {
2710 /* Clear dirty flags */
2711 while (++i <= pagecount) {
2713 /* Don't flush this page yet */
2714 if (dp->mp_flags & P_KEEP) {
2715 dp->mp_flags ^= P_KEEP;
2719 dp->mp_flags &= ~P_DIRTY;
2724 /* Write the pages */
2726 if (++i <= pagecount) {
2728 /* Don't flush this page yet */
2729 if (dp->mp_flags & P_KEEP) {
2730 dp->mp_flags ^= P_KEEP;
2735 /* clear dirty flag */
2736 dp->mp_flags &= ~P_DIRTY;
2739 if (IS_OVERFLOW(dp)) size *= dp->mp_pages;
2744 /* Windows actually supports scatter/gather I/O, but only on
2745 * unbuffered file handles. Since we're relying on the OS page
2746 * cache for all our data, that's self-defeating. So we just
2747 * write pages one at a time. We use the ov structure to set
2748 * the write offset, to at least save the overhead of a Seek
2751 DPRINTF(("committing page %"Z"u", pgno));
2752 memset(&ov, 0, sizeof(ov));
2753 ov.Offset = pos & 0xffffffff;
2754 ov.OffsetHigh = pos >> 16 >> 16;
2755 if (!WriteFile(env->me_fd, dp, size, NULL, &ov)) {
2757 DPRINTF(("WriteFile: %d", rc));
2761 /* Write up to MDB_COMMIT_PAGES dirty pages at a time. */
2762 if (pos!=next_pos || n==MDB_COMMIT_PAGES || wsize+size>MAX_WRITE) {
2764 /* Write previous page(s) */
2765 #ifdef MDB_USE_PWRITEV
2766 wres = pwritev(env->me_fd, iov, n, wpos);
2769 wres = pwrite(env->me_fd, iov[0].iov_base, wsize, wpos);
2771 if (lseek(env->me_fd, wpos, SEEK_SET) == -1) {
2773 DPRINTF(("lseek: %s", strerror(rc)));
2776 wres = writev(env->me_fd, iov, n);
2779 if (wres != wsize) {
2782 DPRINTF(("Write error: %s", strerror(rc)));
2784 rc = EIO; /* TODO: Use which error code? */
2785 DPUTS("short write, filesystem full?");
2796 DPRINTF(("committing page %"Z"u", pgno));
2797 next_pos = pos + size;
2798 iov[n].iov_len = size;
2799 iov[n].iov_base = (char *)dp;
2805 for (i = keep; ++i <= pagecount; ) {
2807 /* This is a page we skipped above */
2810 dl[j].mid = dp->mp_pgno;
2813 mdb_dpage_free(env, dp);
2818 txn->mt_dirty_room += i - j;
2824 mdb_txn_commit(MDB_txn *txn)
2830 assert(txn != NULL);
2831 assert(txn->mt_env != NULL);
2833 if (txn->mt_child) {
2834 rc = mdb_txn_commit(txn->mt_child);
2835 txn->mt_child = NULL;
2842 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2843 mdb_dbis_update(txn, 1);
2844 txn->mt_numdbs = 2; /* so txn_abort() doesn't close any new handles */
2849 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
2850 DPUTS("error flag is set, can't commit");
2852 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
2857 if (txn->mt_parent) {
2858 MDB_txn *parent = txn->mt_parent;
2861 unsigned x, y, len, ps_len;
2863 /* Append our free list to parent's */
2864 rc = mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs);
2867 mdb_midl_free(txn->mt_free_pgs);
2868 /* Failures after this must either undo the changes
2869 * to the parent or set MDB_TXN_ERROR in the parent.
2872 parent->mt_next_pgno = txn->mt_next_pgno;
2873 parent->mt_flags = txn->mt_flags;
2875 /* Merge our cursors into parent's and close them */
2876 mdb_cursors_close(txn, 1);
2878 /* Update parent's DB table. */
2879 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2880 parent->mt_numdbs = txn->mt_numdbs;
2881 parent->mt_dbflags[0] = txn->mt_dbflags[0];
2882 parent->mt_dbflags[1] = txn->mt_dbflags[1];
2883 for (i=2; i<txn->mt_numdbs; i++) {
2884 /* preserve parent's DB_NEW status */
2885 x = parent->mt_dbflags[i] & DB_NEW;
2886 parent->mt_dbflags[i] = txn->mt_dbflags[i] | x;
2889 dst = parent->mt_u.dirty_list;
2890 src = txn->mt_u.dirty_list;
2891 /* Remove anything in our dirty list from parent's spill list */
2892 if ((pspill = parent->mt_spill_pgs) && (ps_len = pspill[0])) {
2894 pspill[0] = (pgno_t)-1;
2895 /* Mark our dirty pages as deleted in parent spill list */
2896 for (i=0, len=src[0].mid; ++i <= len; ) {
2897 MDB_ID pn = src[i].mid << 1;
2898 while (pn > pspill[x])
2900 if (pn == pspill[x]) {
2905 /* Squash deleted pagenums if we deleted any */
2906 for (x=y; ++x <= ps_len; )
2907 if (!(pspill[x] & 1))
2908 pspill[++y] = pspill[x];
2912 /* Find len = length of merging our dirty list with parent's */
2914 dst[0].mid = 0; /* simplify loops */
2915 if (parent->mt_parent) {
2916 len = x + src[0].mid;
2917 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
2918 for (i = x; y && i; y--) {
2919 pgno_t yp = src[y].mid;
2920 while (yp < dst[i].mid)
2922 if (yp == dst[i].mid) {
2927 } else { /* Simplify the above for single-ancestor case */
2928 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
2930 /* Merge our dirty list with parent's */
2932 for (i = len; y; dst[i--] = src[y--]) {
2933 pgno_t yp = src[y].mid;
2934 while (yp < dst[x].mid)
2935 dst[i--] = dst[x--];
2936 if (yp == dst[x].mid)
2937 free(dst[x--].mptr);
2941 free(txn->mt_u.dirty_list);
2942 parent->mt_dirty_room = txn->mt_dirty_room;
2943 if (txn->mt_spill_pgs) {
2944 if (parent->mt_spill_pgs) {
2945 /* TODO: Prevent failure here, so parent does not fail */
2946 rc = mdb_midl_append_list(&parent->mt_spill_pgs, txn->mt_spill_pgs);
2948 parent->mt_flags |= MDB_TXN_ERROR;
2949 mdb_midl_free(txn->mt_spill_pgs);
2950 mdb_midl_sort(parent->mt_spill_pgs);
2952 parent->mt_spill_pgs = txn->mt_spill_pgs;
2956 parent->mt_child = NULL;
2957 mdb_midl_free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pghead);
2962 if (txn != env->me_txn) {
2963 DPUTS("attempt to commit unknown transaction");
2968 mdb_cursors_close(txn, 0);
2970 if (!txn->mt_u.dirty_list[0].mid &&
2971 !(txn->mt_flags & (MDB_TXN_DIRTY|MDB_TXN_SPILLS)))
2974 DPRINTF(("committing txn %"Z"u %p on mdbenv %p, root page %"Z"u",
2975 txn->mt_txnid, (void*)txn, (void*)env, txn->mt_dbs[MAIN_DBI].md_root));
2977 /* Update DB root pointers */
2978 if (txn->mt_numdbs > 2) {
2982 data.mv_size = sizeof(MDB_db);
2984 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
2985 for (i = 2; i < txn->mt_numdbs; i++) {
2986 if (txn->mt_dbflags[i] & DB_DIRTY) {
2987 data.mv_data = &txn->mt_dbs[i];
2988 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
2995 rc = mdb_freelist_save(txn);
2999 mdb_midl_free(env->me_pghead);
3000 env->me_pghead = NULL;
3001 if (mdb_midl_shrink(&txn->mt_free_pgs))
3002 env->me_free_pgs = txn->mt_free_pgs;
3008 if ((rc = mdb_page_flush(txn, 0)) ||
3009 (rc = mdb_env_sync(env, 0)) ||
3010 (rc = mdb_env_write_meta(txn)))
3016 mdb_dbis_update(txn, 1);
3019 UNLOCK_MUTEX_W(env);
3029 /** Read the environment parameters of a DB environment before
3030 * mapping it into memory.
3031 * @param[in] env the environment handle
3032 * @param[out] meta address of where to store the meta information
3033 * @return 0 on success, non-zero on failure.
3036 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
3042 enum { Size = sizeof(pbuf) };
3044 /* We don't know the page size yet, so use a minimum value.
3045 * Read both meta pages so we can use the latest one.
3048 for (i=off=0; i<2; i++, off = meta->mm_psize) {
3052 memset(&ov, 0, sizeof(ov));
3054 rc = ReadFile(env->me_fd, &pbuf, Size, &len, &ov) ? (int)len : -1;
3055 if (rc == -1 && ErrCode() == ERROR_HANDLE_EOF)
3058 rc = pread(env->me_fd, &pbuf, Size, off);
3061 if (rc == 0 && off == 0)
3063 rc = rc < 0 ? (int) ErrCode() : MDB_INVALID;
3064 DPRINTF(("read: %s", mdb_strerror(rc)));
3068 p = (MDB_page *)&pbuf;
3070 if (!F_ISSET(p->mp_flags, P_META)) {
3071 DPRINTF(("page %"Z"u not a meta page", p->mp_pgno));
3076 if (m->mm_magic != MDB_MAGIC) {
3077 DPUTS("meta has invalid magic");
3081 if (m->mm_version != MDB_DATA_VERSION) {
3082 DPRINTF(("database is version %u, expected version %u",
3083 m->mm_version, MDB_DATA_VERSION));
3084 return MDB_VERSION_MISMATCH;
3087 if (off == 0 || m->mm_txnid > meta->mm_txnid)
3093 /** Write the environment parameters of a freshly created DB environment.
3094 * @param[in] env the environment handle
3095 * @param[out] meta address of where to store the meta information
3096 * @return 0 on success, non-zero on failure.
3099 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
3107 memset(&ov, 0, sizeof(ov));
3108 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3110 rc = WriteFile(fd, ptr, size, &len, &ov); } while(0)
3113 #define DO_PWRITE(rc, fd, ptr, size, len, pos) do { \
3114 len = pwrite(fd, ptr, size, pos); \
3115 rc = (len >= 0); } while(0)
3118 DPUTS("writing new meta page");
3120 psize = env->me_psize;
3122 meta->mm_magic = MDB_MAGIC;
3123 meta->mm_version = MDB_DATA_VERSION;
3124 meta->mm_mapsize = env->me_mapsize;
3125 meta->mm_psize = psize;
3126 meta->mm_last_pg = 1;
3127 meta->mm_flags = env->me_flags & 0xffff;
3128 meta->mm_flags |= MDB_INTEGERKEY;
3129 meta->mm_dbs[0].md_root = P_INVALID;
3130 meta->mm_dbs[1].md_root = P_INVALID;
3132 p = calloc(2, psize);
3134 p->mp_flags = P_META;
3135 *(MDB_meta *)METADATA(p) = *meta;
3137 q = (MDB_page *)((char *)p + psize);
3139 q->mp_flags = P_META;
3140 *(MDB_meta *)METADATA(q) = *meta;
3142 DO_PWRITE(rc, env->me_fd, p, psize * 2, len, 0);
3145 else if ((unsigned) len == psize * 2)
3153 /** Update the environment info to commit a transaction.
3154 * @param[in] txn the transaction that's being committed
3155 * @return 0 on success, non-zero on failure.
3158 mdb_env_write_meta(MDB_txn *txn)
3161 MDB_meta meta, metab, *mp;
3163 int rc, len, toggle;
3172 assert(txn != NULL);
3173 assert(txn->mt_env != NULL);
3175 toggle = txn->mt_txnid & 1;
3176 DPRINTF(("writing meta page %d for root page %"Z"u",
3177 toggle, txn->mt_dbs[MAIN_DBI].md_root));
3180 mp = env->me_metas[toggle];
3182 if (env->me_flags & MDB_WRITEMAP) {
3183 /* Persist any increases of mapsize config */
3184 if (env->me_mapsize > mp->mm_mapsize)
3185 mp->mm_mapsize = env->me_mapsize;
3186 mp->mm_dbs[0] = txn->mt_dbs[0];
3187 mp->mm_dbs[1] = txn->mt_dbs[1];
3188 mp->mm_last_pg = txn->mt_next_pgno - 1;
3189 mp->mm_txnid = txn->mt_txnid;
3190 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
3191 unsigned meta_size = env->me_psize;
3192 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
3195 #ifndef _WIN32 /* POSIX msync() requires ptr = start of OS page */
3196 if (meta_size < env->me_os_psize)
3197 meta_size += meta_size;
3202 if (MDB_MSYNC(ptr, meta_size, rc)) {
3209 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
3210 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
3212 ptr = (char *)&meta;
3213 if (env->me_mapsize > mp->mm_mapsize) {
3214 /* Persist any increases of mapsize config */
3215 meta.mm_mapsize = env->me_mapsize;
3216 off = offsetof(MDB_meta, mm_mapsize);
3218 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
3220 len = sizeof(MDB_meta) - off;
3223 meta.mm_dbs[0] = txn->mt_dbs[0];
3224 meta.mm_dbs[1] = txn->mt_dbs[1];
3225 meta.mm_last_pg = txn->mt_next_pgno - 1;
3226 meta.mm_txnid = txn->mt_txnid;
3229 off += env->me_psize;
3232 /* Write to the SYNC fd */
3233 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
3234 env->me_fd : env->me_mfd;
3237 memset(&ov, 0, sizeof(ov));
3239 if (!WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov))
3243 rc = pwrite(mfd, ptr, len, off);
3246 rc = rc < 0 ? ErrCode() : EIO;
3247 DPUTS("write failed, disk error?");
3248 /* On a failure, the pagecache still contains the new data.
3249 * Write some old data back, to prevent it from being used.
3250 * Use the non-SYNC fd; we know it will fail anyway.
3252 meta.mm_last_pg = metab.mm_last_pg;
3253 meta.mm_txnid = metab.mm_txnid;
3255 memset(&ov, 0, sizeof(ov));
3257 WriteFile(env->me_fd, ptr, len, NULL, &ov);
3259 r2 = pwrite(env->me_fd, ptr, len, off);
3260 (void)r2; /* Silence warnings. We don't care about pwrite's return value */
3263 env->me_flags |= MDB_FATAL_ERROR;
3267 /* Memory ordering issues are irrelevant; since the entire writer
3268 * is wrapped by wmutex, all of these changes will become visible
3269 * after the wmutex is unlocked. Since the DB is multi-version,
3270 * readers will get consistent data regardless of how fresh or
3271 * how stale their view of these values is.
3274 env->me_txns->mti_txnid = txn->mt_txnid;
3279 /** Check both meta pages to see which one is newer.
3280 * @param[in] env the environment handle
3281 * @return meta toggle (0 or 1).
3284 mdb_env_pick_meta(const MDB_env *env)
3286 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
3290 mdb_env_create(MDB_env **env)
3294 e = calloc(1, sizeof(MDB_env));
3298 e->me_maxreaders = DEFAULT_READERS;
3299 e->me_maxdbs = e->me_numdbs = 2;
3300 e->me_fd = INVALID_HANDLE_VALUE;
3301 e->me_lfd = INVALID_HANDLE_VALUE;
3302 e->me_mfd = INVALID_HANDLE_VALUE;
3303 #ifdef MDB_USE_POSIX_SEM
3304 e->me_rmutex = SEM_FAILED;
3305 e->me_wmutex = SEM_FAILED;
3307 e->me_pid = getpid();
3308 GET_PAGESIZE(e->me_os_psize);
3309 VGMEMP_CREATE(e,0,0);
3315 mdb_env_map(MDB_env *env, void *addr, int newsize)
3318 unsigned int flags = env->me_flags;
3322 LONG sizelo, sizehi;
3323 sizelo = env->me_mapsize & 0xffffffff;
3324 sizehi = env->me_mapsize >> 16 >> 16; /* only needed on Win64 */
3326 /* Windows won't create mappings for zero length files.
3327 * Just allocate the maxsize right now.
3330 if (SetFilePointer(env->me_fd, sizelo, &sizehi, 0) != (DWORD)sizelo
3331 || !SetEndOfFile(env->me_fd)
3332 || SetFilePointer(env->me_fd, 0, NULL, 0) != 0)
3335 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
3336 PAGE_READWRITE : PAGE_READONLY,
3337 sizehi, sizelo, NULL);
3340 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
3341 FILE_MAP_WRITE : FILE_MAP_READ,
3342 0, 0, env->me_mapsize, addr);
3343 rc = env->me_map ? 0 : ErrCode();
3348 int prot = PROT_READ;
3349 if (flags & MDB_WRITEMAP) {
3351 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
3354 env->me_map = mmap(addr, env->me_mapsize, prot, MAP_SHARED,
3356 if (env->me_map == MAP_FAILED) {
3361 if (flags & MDB_NORDAHEAD) {
3362 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
3364 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
3366 #ifdef POSIX_MADV_RANDOM
3367 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
3368 #endif /* POSIX_MADV_RANDOM */
3369 #endif /* MADV_RANDOM */
3373 /* Can happen because the address argument to mmap() is just a
3374 * hint. mmap() can pick another, e.g. if the range is in use.
3375 * The MAP_FIXED flag would prevent that, but then mmap could
3376 * instead unmap existing pages to make room for the new map.
3378 if (addr && env->me_map != addr)
3379 return EBUSY; /* TODO: Make a new MDB_* error code? */
3381 p = (MDB_page *)env->me_map;
3382 env->me_metas[0] = METADATA(p);
3383 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + env->me_psize);
3389 mdb_env_set_mapsize(MDB_env *env, size_t size)
3391 /* If env is already open, caller is responsible for making
3392 * sure there are no active txns.
3400 size = env->me_metas[mdb_env_pick_meta(env)]->mm_mapsize;
3401 else if (size < env->me_mapsize) {
3402 /* If the configured size is smaller, make sure it's
3403 * still big enough. Silently round up to minimum if not.
3405 size_t minsize = (env->me_metas[mdb_env_pick_meta(env)]->mm_last_pg + 1) * env->me_psize;
3409 munmap(env->me_map, env->me_mapsize);
3410 env->me_mapsize = size;
3411 old = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : NULL;
3412 rc = mdb_env_map(env, old, 1);
3416 env->me_mapsize = size;
3418 env->me_maxpg = env->me_mapsize / env->me_psize;
3423 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
3427 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
3432 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
3434 if (env->me_map || readers < 1)
3436 env->me_maxreaders = readers;
3441 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
3443 if (!env || !readers)
3445 *readers = env->me_maxreaders;
3449 /** Further setup required for opening an MDB environment
3452 mdb_env_open2(MDB_env *env)
3454 unsigned int flags = env->me_flags;
3455 int i, newenv = 0, rc;
3459 /* See if we should use QueryLimited */
3461 if ((rc & 0xff) > 5)
3462 env->me_pidquery = MDB_PROCESS_QUERY_LIMITED_INFORMATION;
3464 env->me_pidquery = PROCESS_QUERY_INFORMATION;
3467 memset(&meta, 0, sizeof(meta));
3469 if ((i = mdb_env_read_header(env, &meta)) != 0) {
3472 DPUTS("new mdbenv");
3474 env->me_psize = env->me_os_psize;
3475 if (env->me_psize > MAX_PAGESIZE)
3476 env->me_psize = MAX_PAGESIZE;
3478 env->me_psize = meta.mm_psize;
3481 /* Was a mapsize configured? */
3482 if (!env->me_mapsize) {
3483 /* If this is a new environment, take the default,
3484 * else use the size recorded in the existing env.
3486 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
3487 } else if (env->me_mapsize < meta.mm_mapsize) {
3488 /* If the configured size is smaller, make sure it's
3489 * still big enough. Silently round up to minimum if not.
3491 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
3492 if (env->me_mapsize < minsize)
3493 env->me_mapsize = minsize;
3496 rc = mdb_env_map(env, meta.mm_address, newenv);
3501 if (flags & MDB_FIXEDMAP)
3502 meta.mm_address = env->me_map;
3503 i = mdb_env_init_meta(env, &meta);
3504 if (i != MDB_SUCCESS) {
3509 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
3510 env->me_nodemax = (((env->me_psize - PAGEHDRSZ) / MDB_MINKEYS) & -2)
3512 #if !(MDB_MAXKEYSIZE)
3513 env->me_maxkey = env->me_nodemax - (NODESIZE + sizeof(MDB_db));
3515 env->me_maxpg = env->me_mapsize / env->me_psize;
3519 int toggle = mdb_env_pick_meta(env);
3520 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
3522 DPRINTF(("opened database version %u, pagesize %u",
3523 env->me_metas[0]->mm_version, env->me_psize));
3524 DPRINTF(("using meta page %d", toggle));
3525 DPRINTF(("depth: %u", db->md_depth));
3526 DPRINTF(("entries: %"Z"u", db->md_entries));
3527 DPRINTF(("branch pages: %"Z"u", db->md_branch_pages));
3528 DPRINTF(("leaf pages: %"Z"u", db->md_leaf_pages));
3529 DPRINTF(("overflow pages: %"Z"u", db->md_overflow_pages));
3530 DPRINTF(("root: %"Z"u", db->md_root));
3538 /** Release a reader thread's slot in the reader lock table.
3539 * This function is called automatically when a thread exits.
3540 * @param[in] ptr This points to the slot in the reader lock table.
3543 mdb_env_reader_dest(void *ptr)
3545 MDB_reader *reader = ptr;
3551 /** Junk for arranging thread-specific callbacks on Windows. This is
3552 * necessarily platform and compiler-specific. Windows supports up
3553 * to 1088 keys. Let's assume nobody opens more than 64 environments
3554 * in a single process, for now. They can override this if needed.
3556 #ifndef MAX_TLS_KEYS
3557 #define MAX_TLS_KEYS 64
3559 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
3560 static int mdb_tls_nkeys;
3562 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
3566 case DLL_PROCESS_ATTACH: break;
3567 case DLL_THREAD_ATTACH: break;
3568 case DLL_THREAD_DETACH:
3569 for (i=0; i<mdb_tls_nkeys; i++) {
3570 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
3571 mdb_env_reader_dest(r);
3574 case DLL_PROCESS_DETACH: break;
3579 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3581 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
3585 /* Force some symbol references.
3586 * _tls_used forces the linker to create the TLS directory if not already done
3587 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
3589 #pragma comment(linker, "/INCLUDE:_tls_used")
3590 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
3591 #pragma const_seg(".CRT$XLB")
3592 extern const PIMAGE_TLS_CALLBACK mdb_tls_cbp;
3593 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3596 #pragma comment(linker, "/INCLUDE:__tls_used")
3597 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
3598 #pragma data_seg(".CRT$XLB")
3599 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
3601 #endif /* WIN 32/64 */
3602 #endif /* !__GNUC__ */
3605 /** Downgrade the exclusive lock on the region back to shared */
3607 mdb_env_share_locks(MDB_env *env, int *excl)
3609 int rc = 0, toggle = mdb_env_pick_meta(env);
3611 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
3616 /* First acquire a shared lock. The Unlock will
3617 * then release the existing exclusive lock.
3619 memset(&ov, 0, sizeof(ov));
3620 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3623 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3629 struct flock lock_info;
3630 /* The shared lock replaces the existing lock */
3631 memset((void *)&lock_info, 0, sizeof(lock_info));
3632 lock_info.l_type = F_RDLCK;
3633 lock_info.l_whence = SEEK_SET;
3634 lock_info.l_start = 0;
3635 lock_info.l_len = 1;
3636 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3637 (rc = ErrCode()) == EINTR) ;
3638 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
3645 /** Try to get exlusive lock, otherwise shared.
3646 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
3649 mdb_env_excl_lock(MDB_env *env, int *excl)
3653 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
3657 memset(&ov, 0, sizeof(ov));
3658 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3665 struct flock lock_info;
3666 memset((void *)&lock_info, 0, sizeof(lock_info));
3667 lock_info.l_type = F_WRLCK;
3668 lock_info.l_whence = SEEK_SET;
3669 lock_info.l_start = 0;
3670 lock_info.l_len = 1;
3671 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3672 (rc = ErrCode()) == EINTR) ;
3676 # ifdef MDB_USE_POSIX_SEM
3677 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
3680 lock_info.l_type = F_RDLCK;
3681 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
3682 (rc = ErrCode()) == EINTR) ;
3692 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
3694 * @(#) $Revision: 5.1 $
3695 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
3696 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
3698 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
3702 * Please do not copyright this code. This code is in the public domain.
3704 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
3705 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
3706 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
3707 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
3708 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
3709 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
3710 * PERFORMANCE OF THIS SOFTWARE.
3713 * chongo <Landon Curt Noll> /\oo/\
3714 * http://www.isthe.com/chongo/
3716 * Share and Enjoy! :-)
3719 typedef unsigned long long mdb_hash_t;
3720 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
3722 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
3723 * @param[in] val value to hash
3724 * @param[in] hval initial value for hash
3725 * @return 64 bit hash
3727 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
3728 * hval arg on the first call.
3731 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
3733 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
3734 unsigned char *end = s + val->mv_size;
3736 * FNV-1a hash each octet of the string
3739 /* xor the bottom with the current octet */
3740 hval ^= (mdb_hash_t)*s++;
3742 /* multiply by the 64 bit FNV magic prime mod 2^64 */
3743 hval += (hval << 1) + (hval << 4) + (hval << 5) +
3744 (hval << 7) + (hval << 8) + (hval << 40);
3746 /* return our new hash value */
3750 /** Hash the string and output the encoded hash.
3751 * This uses modified RFC1924 Ascii85 encoding to accommodate systems with
3752 * very short name limits. We don't care about the encoding being reversible,
3753 * we just want to preserve as many bits of the input as possible in a
3754 * small printable string.
3755 * @param[in] str string to hash
3756 * @param[out] encbuf an array of 11 chars to hold the hash
3758 static const char mdb_a85[]= "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~";
3761 mdb_pack85(unsigned long l, char *out)
3765 for (i=0; i<5; i++) {
3766 *out++ = mdb_a85[l % 85];
3772 mdb_hash_enc(MDB_val *val, char *encbuf)
3774 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
3776 mdb_pack85(h, encbuf);
3777 mdb_pack85(h>>32, encbuf+5);
3782 /** Open and/or initialize the lock region for the environment.
3783 * @param[in] env The MDB environment.
3784 * @param[in] lpath The pathname of the file used for the lock region.
3785 * @param[in] mode The Unix permissions for the file, if we create it.
3786 * @param[out] excl Resulting file lock type: -1 none, 0 shared, 1 exclusive
3787 * @param[in,out] excl In -1, out lock type: -1 none, 0 shared, 1 exclusive
3788 * @return 0 on success, non-zero on failure.
3791 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
3794 # define MDB_ERRCODE_ROFS ERROR_WRITE_PROTECT
3796 # define MDB_ERRCODE_ROFS EROFS
3797 #ifdef O_CLOEXEC /* Linux: Open file and set FD_CLOEXEC atomically */
3798 # define MDB_CLOEXEC O_CLOEXEC
3801 # define MDB_CLOEXEC 0
3808 env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
3809 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
3810 FILE_ATTRIBUTE_NORMAL, NULL);
3812 env->me_lfd = open(lpath, O_RDWR|O_CREAT|MDB_CLOEXEC, mode);
3814 if (env->me_lfd == INVALID_HANDLE_VALUE) {
3816 if (rc == MDB_ERRCODE_ROFS && (env->me_flags & MDB_RDONLY)) {
3821 #if ! ((MDB_CLOEXEC) || defined(_WIN32))
3822 /* Lose record locks when exec*() */
3823 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
3824 fcntl(env->me_lfd, F_SETFD, fdflags);
3827 if (!(env->me_flags & MDB_NOTLS)) {
3828 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3831 env->me_flags |= MDB_ENV_TXKEY;
3833 /* Windows TLS callbacks need help finding their TLS info. */
3834 if (mdb_tls_nkeys >= MAX_TLS_KEYS) {
3838 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3842 /* Try to get exclusive lock. If we succeed, then
3843 * nobody is using the lock region and we should initialize it.
3845 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
3848 size = GetFileSize(env->me_lfd, NULL);
3850 size = lseek(env->me_lfd, 0, SEEK_END);
3851 if (size == -1) goto fail_errno;
3853 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
3854 if (size < rsize && *excl > 0) {
3856 if (SetFilePointer(env->me_lfd, rsize, NULL, FILE_BEGIN) != (DWORD)rsize
3857 || !SetEndOfFile(env->me_lfd))
3860 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
3864 size = rsize - sizeof(MDB_txninfo);
3865 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
3870 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
3872 if (!mh) goto fail_errno;
3873 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
3875 if (!env->me_txns) goto fail_errno;
3877 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
3879 if (m == MAP_FAILED) goto fail_errno;
3885 BY_HANDLE_FILE_INFORMATION stbuf;
3894 if (!mdb_sec_inited) {
3895 InitializeSecurityDescriptor(&mdb_null_sd,
3896 SECURITY_DESCRIPTOR_REVISION);
3897 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
3898 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
3899 mdb_all_sa.bInheritHandle = FALSE;
3900 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
3903 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
3904 idbuf.volume = stbuf.dwVolumeSerialNumber;
3905 idbuf.nhigh = stbuf.nFileIndexHigh;
3906 idbuf.nlow = stbuf.nFileIndexLow;
3907 val.mv_data = &idbuf;
3908 val.mv_size = sizeof(idbuf);
3909 mdb_hash_enc(&val, encbuf);
3910 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", encbuf);
3911 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", encbuf);
3912 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
3913 if (!env->me_rmutex) goto fail_errno;
3914 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
3915 if (!env->me_wmutex) goto fail_errno;
3916 #elif defined(MDB_USE_POSIX_SEM)
3925 #if defined(__NetBSD__)
3926 #define MDB_SHORT_SEMNAMES 1 /* limited to 14 chars */
3928 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
3929 idbuf.dev = stbuf.st_dev;
3930 idbuf.ino = stbuf.st_ino;
3931 val.mv_data = &idbuf;
3932 val.mv_size = sizeof(idbuf);
3933 mdb_hash_enc(&val, encbuf);
3934 #ifdef MDB_SHORT_SEMNAMES
3935 encbuf[9] = '\0'; /* drop name from 15 chars to 14 chars */
3937 sprintf(env->me_txns->mti_rmname, "/MDBr%s", encbuf);
3938 sprintf(env->me_txns->mti_wmname, "/MDBw%s", encbuf);
3939 /* Clean up after a previous run, if needed: Try to
3940 * remove both semaphores before doing anything else.
3942 sem_unlink(env->me_txns->mti_rmname);
3943 sem_unlink(env->me_txns->mti_wmname);
3944 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
3945 O_CREAT|O_EXCL, mode, 1);
3946 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3947 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
3948 O_CREAT|O_EXCL, mode, 1);
3949 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3950 #else /* MDB_USE_POSIX_SEM */
3951 pthread_mutexattr_t mattr;
3953 if ((rc = pthread_mutexattr_init(&mattr))
3954 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
3955 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
3956 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
3958 pthread_mutexattr_destroy(&mattr);
3959 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
3961 env->me_txns->mti_magic = MDB_MAGIC;
3962 env->me_txns->mti_format = MDB_LOCK_FORMAT;
3963 env->me_txns->mti_txnid = 0;
3964 env->me_txns->mti_numreaders = 0;
3967 if (env->me_txns->mti_magic != MDB_MAGIC) {
3968 DPUTS("lock region has invalid magic");
3972 if (env->me_txns->mti_format != MDB_LOCK_FORMAT) {
3973 DPRINTF(("lock region has format+version 0x%x, expected 0x%x",
3974 env->me_txns->mti_format, MDB_LOCK_FORMAT));
3975 rc = MDB_VERSION_MISMATCH;
3979 if (rc && rc != EACCES && rc != EAGAIN) {
3983 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3984 if (!env->me_rmutex) goto fail_errno;
3985 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3986 if (!env->me_wmutex) goto fail_errno;
3987 #elif defined(MDB_USE_POSIX_SEM)
3988 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3989 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3990 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3991 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
4002 /** The name of the lock file in the DB environment */
4003 #define LOCKNAME "/lock.mdb"
4004 /** The name of the data file in the DB environment */
4005 #define DATANAME "/data.mdb"
4006 /** The suffix of the lock file when no subdir is used */
4007 #define LOCKSUFF "-lock"
4008 /** Only a subset of the @ref mdb_env flags can be changed
4009 * at runtime. Changing other flags requires closing the
4010 * environment and re-opening it with the new flags.
4012 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC|MDB_NOMEMINIT)
4013 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP| \
4014 MDB_NOTLS|MDB_NOLOCK|MDB_NORDAHEAD)
4017 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mdb_mode_t mode)
4019 int oflags, rc, len, excl = -1;
4020 char *lpath, *dpath;
4022 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
4026 if (flags & MDB_NOSUBDIR) {
4027 rc = len + sizeof(LOCKSUFF) + len + 1;
4029 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
4034 if (flags & MDB_NOSUBDIR) {
4035 dpath = lpath + len + sizeof(LOCKSUFF);
4036 sprintf(lpath, "%s" LOCKSUFF, path);
4037 strcpy(dpath, path);
4039 dpath = lpath + len + sizeof(LOCKNAME);
4040 sprintf(lpath, "%s" LOCKNAME, path);
4041 sprintf(dpath, "%s" DATANAME, path);
4045 flags |= env->me_flags;
4046 if (flags & MDB_RDONLY) {
4047 /* silently ignore WRITEMAP when we're only getting read access */
4048 flags &= ~MDB_WRITEMAP;
4050 if (!((env->me_free_pgs = mdb_midl_alloc(MDB_IDL_UM_MAX)) &&
4051 (env->me_dirty_list = calloc(MDB_IDL_UM_SIZE, sizeof(MDB_ID2)))))
4054 env->me_flags = flags |= MDB_ENV_ACTIVE;
4058 env->me_path = strdup(path);
4059 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
4060 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
4061 if (!(env->me_dbxs && env->me_path && env->me_dbflags)) {
4066 /* For RDONLY, get lockfile after we know datafile exists */
4067 if (!(flags & (MDB_RDONLY|MDB_NOLOCK))) {
4068 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4074 if (F_ISSET(flags, MDB_RDONLY)) {
4075 oflags = GENERIC_READ;
4076 len = OPEN_EXISTING;
4078 oflags = GENERIC_READ|GENERIC_WRITE;
4081 mode = FILE_ATTRIBUTE_NORMAL;
4082 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
4083 NULL, len, mode, NULL);
4085 if (F_ISSET(flags, MDB_RDONLY))
4088 oflags = O_RDWR | O_CREAT;
4090 env->me_fd = open(dpath, oflags, mode);
4092 if (env->me_fd == INVALID_HANDLE_VALUE) {
4097 if ((flags & (MDB_RDONLY|MDB_NOLOCK)) == MDB_RDONLY) {
4098 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
4103 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
4104 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
4105 env->me_mfd = env->me_fd;
4107 /* Synchronous fd for meta writes. Needed even with
4108 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
4111 len = OPEN_EXISTING;
4112 env->me_mfd = CreateFile(dpath, oflags,
4113 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
4114 mode | FILE_FLAG_WRITE_THROUGH, NULL);
4117 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
4119 if (env->me_mfd == INVALID_HANDLE_VALUE) {
4124 DPRINTF(("opened dbenv %p", (void *) env));
4126 rc = mdb_env_share_locks(env, &excl);
4130 if (!((flags & MDB_RDONLY) ||
4131 (env->me_pbuf = calloc(1, env->me_psize))))
4137 mdb_env_close0(env, excl);
4143 /** Destroy resources from mdb_env_open(), clear our readers & DBIs */
4145 mdb_env_close0(MDB_env *env, int excl)
4149 if (!(env->me_flags & MDB_ENV_ACTIVE))
4152 /* Doing this here since me_dbxs may not exist during mdb_env_close */
4153 for (i = env->me_maxdbs; --i > MAIN_DBI; )
4154 free(env->me_dbxs[i].md_name.mv_data);
4157 free(env->me_dbflags);
4160 free(env->me_dirty_list);
4161 mdb_midl_free(env->me_free_pgs);
4163 if (env->me_flags & MDB_ENV_TXKEY) {
4164 pthread_key_delete(env->me_txkey);
4166 /* Delete our key from the global list */
4167 for (i=0; i<mdb_tls_nkeys; i++)
4168 if (mdb_tls_keys[i] == env->me_txkey) {
4169 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
4177 munmap(env->me_map, env->me_mapsize);
4179 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
4180 (void) close(env->me_mfd);
4181 if (env->me_fd != INVALID_HANDLE_VALUE)
4182 (void) close(env->me_fd);
4184 MDB_PID_T pid = env->me_pid;
4185 /* Clearing readers is done in this function because
4186 * me_txkey with its destructor must be disabled first.
4188 for (i = env->me_numreaders; --i >= 0; )
4189 if (env->me_txns->mti_readers[i].mr_pid == pid)
4190 env->me_txns->mti_readers[i].mr_pid = 0;
4192 if (env->me_rmutex) {
4193 CloseHandle(env->me_rmutex);
4194 if (env->me_wmutex) CloseHandle(env->me_wmutex);
4196 /* Windows automatically destroys the mutexes when
4197 * the last handle closes.
4199 #elif defined(MDB_USE_POSIX_SEM)
4200 if (env->me_rmutex != SEM_FAILED) {
4201 sem_close(env->me_rmutex);
4202 if (env->me_wmutex != SEM_FAILED)
4203 sem_close(env->me_wmutex);
4204 /* If we have the filelock: If we are the
4205 * only remaining user, clean up semaphores.
4208 mdb_env_excl_lock(env, &excl);
4210 sem_unlink(env->me_txns->mti_rmname);
4211 sem_unlink(env->me_txns->mti_wmname);
4215 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
4217 if (env->me_lfd != INVALID_HANDLE_VALUE) {
4220 /* Unlock the lockfile. Windows would have unlocked it
4221 * after closing anyway, but not necessarily at once.
4223 UnlockFile(env->me_lfd, 0, 0, 1, 0);
4226 (void) close(env->me_lfd);
4229 env->me_flags &= ~(MDB_ENV_ACTIVE|MDB_ENV_TXKEY);
4233 mdb_env_copyfd(MDB_env *env, HANDLE fd)
4235 MDB_txn *txn = NULL;
4241 #define DO_WRITE(rc, fd, ptr, w2, len) rc = WriteFile(fd, ptr, w2, &len, NULL)
4245 #define DO_WRITE(rc, fd, ptr, w2, len) len = write(fd, ptr, w2); rc = (len >= 0)
4248 /* Do the lock/unlock of the reader mutex before starting the
4249 * write txn. Otherwise other read txns could block writers.
4251 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
4256 /* We must start the actual read txn after blocking writers */
4257 mdb_txn_reset0(txn, "reset-stage1");
4259 /* Temporarily block writers until we snapshot the meta pages */
4262 rc = mdb_txn_renew0(txn);
4264 UNLOCK_MUTEX_W(env);
4269 wsize = env->me_psize * 2;
4273 DO_WRITE(rc, fd, ptr, w2, len);
4277 } else if (len > 0) {
4283 /* Non-blocking or async handles are not supported */
4289 UNLOCK_MUTEX_W(env);
4294 wsize = txn->mt_next_pgno * env->me_psize - wsize;
4296 if (wsize > MAX_WRITE)
4300 DO_WRITE(rc, fd, ptr, w2, len);
4304 } else if (len > 0) {
4321 mdb_env_copy(MDB_env *env, const char *path)
4325 HANDLE newfd = INVALID_HANDLE_VALUE;
4327 if (env->me_flags & MDB_NOSUBDIR) {
4328 lpath = (char *)path;
4331 len += sizeof(DATANAME);
4332 lpath = malloc(len);
4335 sprintf(lpath, "%s" DATANAME, path);
4338 /* The destination path must exist, but the destination file must not.
4339 * We don't want the OS to cache the writes, since the source data is
4340 * already in the OS cache.
4343 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
4344 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
4346 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL, 0666);
4348 if (newfd == INVALID_HANDLE_VALUE) {
4354 /* Set O_DIRECT if the file system supports it */
4355 if ((rc = fcntl(newfd, F_GETFL)) != -1)
4356 (void) fcntl(newfd, F_SETFL, rc | O_DIRECT);
4358 #ifdef F_NOCACHE /* __APPLE__ */
4359 rc = fcntl(newfd, F_NOCACHE, 1);
4366 rc = mdb_env_copyfd(env, newfd);
4369 if (!(env->me_flags & MDB_NOSUBDIR))
4371 if (newfd != INVALID_HANDLE_VALUE)
4372 if (close(newfd) < 0 && rc == MDB_SUCCESS)
4379 mdb_env_close(MDB_env *env)
4386 VGMEMP_DESTROY(env);
4387 while ((dp = env->me_dpages) != NULL) {
4388 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
4389 env->me_dpages = dp->mp_next;
4393 mdb_env_close0(env, 0);
4397 /** Compare two items pointing at aligned size_t's */
4399 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
4401 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
4402 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
4405 /** Compare two items pointing at aligned unsigned int's */
4407 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
4409 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
4410 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
4413 /** Compare two items pointing at unsigned ints of unknown alignment.
4414 * Nodes and keys are guaranteed to be 2-byte aligned.
4417 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
4419 #if BYTE_ORDER == LITTLE_ENDIAN
4420 unsigned short *u, *c;
4423 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
4424 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
4427 } while(!x && u > (unsigned short *)a->mv_data);
4430 return memcmp(a->mv_data, b->mv_data, a->mv_size);
4434 /** Compare two items lexically */
4436 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
4443 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4449 diff = memcmp(a->mv_data, b->mv_data, len);
4450 return diff ? diff : len_diff<0 ? -1 : len_diff;
4453 /** Compare two items in reverse byte order */
4455 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
4457 const unsigned char *p1, *p2, *p1_lim;
4461 p1_lim = (const unsigned char *)a->mv_data;
4462 p1 = (const unsigned char *)a->mv_data + a->mv_size;
4463 p2 = (const unsigned char *)b->mv_data + b->mv_size;
4465 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
4471 while (p1 > p1_lim) {
4472 diff = *--p1 - *--p2;
4476 return len_diff<0 ? -1 : len_diff;
4479 /** Search for key within a page, using binary search.
4480 * Returns the smallest entry larger or equal to the key.
4481 * If exactp is non-null, stores whether the found entry was an exact match
4482 * in *exactp (1 or 0).
4483 * Updates the cursor index with the index of the found entry.
4484 * If no entry larger or equal to the key is found, returns NULL.
4487 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
4489 unsigned int i = 0, nkeys;
4492 MDB_page *mp = mc->mc_pg[mc->mc_top];
4493 MDB_node *node = NULL;
4498 nkeys = NUMKEYS(mp);
4503 COPY_PGNO(pgno, mp->mp_pgno);
4504 DPRINTF(("searching %u keys in %s %spage %"Z"u",
4505 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
4510 low = IS_LEAF(mp) ? 0 : 1;
4512 cmp = mc->mc_dbx->md_cmp;
4514 /* Branch pages have no data, so if using integer keys,
4515 * alignment is guaranteed. Use faster mdb_cmp_int.
4517 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
4518 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
4525 nodekey.mv_size = mc->mc_db->md_pad;
4526 node = NODEPTR(mp, 0); /* fake */
4527 while (low <= high) {
4528 i = (low + high) >> 1;
4529 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
4530 rc = cmp(key, &nodekey);
4531 DPRINTF(("found leaf index %u [%s], rc = %i",
4532 i, DKEY(&nodekey), rc));
4541 while (low <= high) {
4542 i = (low + high) >> 1;
4544 node = NODEPTR(mp, i);
4545 nodekey.mv_size = NODEKSZ(node);
4546 nodekey.mv_data = NODEKEY(node);
4548 rc = cmp(key, &nodekey);
4551 DPRINTF(("found leaf index %u [%s], rc = %i",
4552 i, DKEY(&nodekey), rc));
4554 DPRINTF(("found branch index %u [%s -> %"Z"u], rc = %i",
4555 i, DKEY(&nodekey), NODEPGNO(node), rc));
4566 if (rc > 0) { /* Found entry is less than the key. */
4567 i++; /* Skip to get the smallest entry larger than key. */
4569 node = NODEPTR(mp, i);
4572 *exactp = (rc == 0 && nkeys > 0);
4573 /* store the key index */
4574 mc->mc_ki[mc->mc_top] = i;
4576 /* There is no entry larger or equal to the key. */
4579 /* nodeptr is fake for LEAF2 */
4585 mdb_cursor_adjust(MDB_cursor *mc, func)
4589 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
4590 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
4597 /** Pop a page off the top of the cursor's stack. */
4599 mdb_cursor_pop(MDB_cursor *mc)
4603 MDB_page *top = mc->mc_pg[mc->mc_top];
4609 DPRINTF(("popped page %"Z"u off db %d cursor %p", top->mp_pgno,
4610 DDBI(mc), (void *) mc));
4614 /** Push a page onto the top of the cursor's stack. */
4616 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
4618 DPRINTF(("pushing page %"Z"u on db %d cursor %p", mp->mp_pgno,
4619 DDBI(mc), (void *) mc));
4621 if (mc->mc_snum >= CURSOR_STACK) {
4622 assert(mc->mc_snum < CURSOR_STACK);
4623 return MDB_CURSOR_FULL;
4626 mc->mc_top = mc->mc_snum++;
4627 mc->mc_pg[mc->mc_top] = mp;
4628 mc->mc_ki[mc->mc_top] = 0;
4633 /** Find the address of the page corresponding to a given page number.
4634 * @param[in] txn the transaction for this access.
4635 * @param[in] pgno the page number for the page to retrieve.
4636 * @param[out] ret address of a pointer where the page's address will be stored.
4637 * @param[out] lvl dirty_list inheritance level of found page. 1=current txn, 0=mapped page.
4638 * @return 0 on success, non-zero on failure.
4641 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret, int *lvl)
4643 MDB_env *env = txn->mt_env;
4647 if (!((txn->mt_flags & MDB_TXN_RDONLY) | (env->me_flags & MDB_WRITEMAP))) {
4651 MDB_ID2L dl = tx2->mt_u.dirty_list;
4653 /* Spilled pages were dirtied in this txn and flushed
4654 * because the dirty list got full. Bring this page
4655 * back in from the map (but don't unspill it here,
4656 * leave that unless page_touch happens again).
4658 if (tx2->mt_spill_pgs) {
4659 MDB_ID pn = pgno << 1;
4660 x = mdb_midl_search(tx2->mt_spill_pgs, pn);
4661 if (x <= tx2->mt_spill_pgs[0] && tx2->mt_spill_pgs[x] == pn) {
4662 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
4667 unsigned x = mdb_mid2l_search(dl, pgno);
4668 if (x <= dl[0].mid && dl[x].mid == pgno) {
4674 } while ((tx2 = tx2->mt_parent) != NULL);
4677 if (pgno < txn->mt_next_pgno) {
4679 p = (MDB_page *)(env->me_map + env->me_psize * pgno);
4681 DPRINTF(("page %"Z"u not found", pgno));
4683 return MDB_PAGE_NOTFOUND;
4693 /** Finish #mdb_page_search() / #mdb_page_search_lowest().
4694 * The cursor is at the root page, set up the rest of it.
4697 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int flags)
4699 MDB_page *mp = mc->mc_pg[mc->mc_top];
4703 while (IS_BRANCH(mp)) {
4707 DPRINTF(("branch page %"Z"u has %u keys", mp->mp_pgno, NUMKEYS(mp)));
4708 assert(NUMKEYS(mp) > 1);
4709 DPRINTF(("found index 0 to page %"Z"u", NODEPGNO(NODEPTR(mp, 0))));
4711 if (flags & (MDB_PS_FIRST|MDB_PS_LAST)) {
4713 if (flags & MDB_PS_LAST)
4714 i = NUMKEYS(mp) - 1;
4717 node = mdb_node_search(mc, key, &exact);
4719 i = NUMKEYS(mp) - 1;
4721 i = mc->mc_ki[mc->mc_top];
4727 DPRINTF(("following index %u for key [%s]", i, DKEY(key)));
4730 assert(i < NUMKEYS(mp));
4731 node = NODEPTR(mp, i);
4733 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
4736 mc->mc_ki[mc->mc_top] = i;
4737 if ((rc = mdb_cursor_push(mc, mp)))
4740 if (flags & MDB_PS_MODIFY) {
4741 if ((rc = mdb_page_touch(mc)) != 0)
4743 mp = mc->mc_pg[mc->mc_top];
4748 DPRINTF(("internal error, index points to a %02X page!?",
4750 return MDB_CORRUPTED;
4753 DPRINTF(("found leaf page %"Z"u for key [%s]", mp->mp_pgno,
4754 key ? DKEY(key) : "null"));
4755 mc->mc_flags |= C_INITIALIZED;
4756 mc->mc_flags &= ~C_EOF;
4761 /** Search for the lowest key under the current branch page.
4762 * This just bypasses a NUMKEYS check in the current page
4763 * before calling mdb_page_search_root(), because the callers
4764 * are all in situations where the current page is known to
4768 mdb_page_search_lowest(MDB_cursor *mc)
4770 MDB_page *mp = mc->mc_pg[mc->mc_top];
4771 MDB_node *node = NODEPTR(mp, 0);
4774 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp, NULL)) != 0)
4777 mc->mc_ki[mc->mc_top] = 0;
4778 if ((rc = mdb_cursor_push(mc, mp)))
4780 return mdb_page_search_root(mc, NULL, MDB_PS_FIRST);
4783 /** Search for the page a given key should be in.
4784 * Push it and its parent pages on the cursor stack.
4785 * @param[in,out] mc the cursor for this operation.
4786 * @param[in] key the key to search for, or NULL for first/last page.
4787 * @param[in] flags If MDB_PS_MODIFY is set, visited pages in the DB
4788 * are touched (updated with new page numbers).
4789 * If MDB_PS_FIRST or MDB_PS_LAST is set, find first or last leaf.
4790 * This is used by #mdb_cursor_first() and #mdb_cursor_last().
4791 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
4792 * @return 0 on success, non-zero on failure.
4795 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
4800 /* Make sure the txn is still viable, then find the root from
4801 * the txn's db table and set it as the root of the cursor's stack.
4803 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
4804 DPUTS("transaction has failed, must abort");
4807 /* Make sure we're using an up-to-date root */
4808 if (*mc->mc_dbflag & DB_STALE) {
4810 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4811 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, 0);
4818 MDB_node *leaf = mdb_node_search(&mc2,
4819 &mc->mc_dbx->md_name, &exact);
4821 return MDB_NOTFOUND;
4822 rc = mdb_node_read(mc->mc_txn, leaf, &data);
4825 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
4827 /* The txn may not know this DBI, or another process may
4828 * have dropped and recreated the DB with other flags.
4830 if ((mc->mc_db->md_flags & PERSISTENT_FLAGS) != flags)
4831 return MDB_INCOMPATIBLE;
4832 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
4834 *mc->mc_dbflag &= ~DB_STALE;
4836 root = mc->mc_db->md_root;
4838 if (root == P_INVALID) { /* Tree is empty. */
4839 DPUTS("tree is empty");
4840 return MDB_NOTFOUND;
4845 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
4846 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0], NULL)) != 0)
4852 DPRINTF(("db %d root page %"Z"u has flags 0x%X",
4853 DDBI(mc), root, mc->mc_pg[0]->mp_flags));
4855 if (flags & MDB_PS_MODIFY) {
4856 if ((rc = mdb_page_touch(mc)))
4860 if (flags & MDB_PS_ROOTONLY)
4863 return mdb_page_search_root(mc, key, flags);
4867 mdb_ovpage_free(MDB_cursor *mc, MDB_page *mp)
4869 MDB_txn *txn = mc->mc_txn;
4870 pgno_t pg = mp->mp_pgno;
4871 unsigned x = 0, ovpages = mp->mp_pages;
4872 MDB_env *env = txn->mt_env;
4873 MDB_IDL sl = txn->mt_spill_pgs;
4874 MDB_ID pn = pg << 1;
4877 DPRINTF(("free ov page %"Z"u (%d)", pg, ovpages));
4878 /* If the page is dirty or on the spill list we just acquired it,
4879 * so we should give it back to our current free list, if any.
4880 * Otherwise put it onto the list of pages we freed in this txn.
4882 * Won't create me_pghead: me_pglast must be inited along with it.
4883 * Unsupported in nested txns: They would need to hide the page
4884 * range in ancestor txns' dirty and spilled lists.
4886 if (env->me_pghead &&
4888 ((mp->mp_flags & P_DIRTY) ||
4889 (sl && (x = mdb_midl_search(sl, pn)) <= sl[0] && sl[x] == pn)))
4893 MDB_ID2 *dl, ix, iy;
4894 rc = mdb_midl_need(&env->me_pghead, ovpages);
4897 if (!(mp->mp_flags & P_DIRTY)) {
4898 /* This page is no longer spilled */
4905 /* Remove from dirty list */
4906 dl = txn->mt_u.dirty_list;
4908 for (ix = dl[x]; ix.mptr != mp; ix = iy) {
4916 dl[j] = ix; /* Unsorted. OK when MDB_TXN_ERROR. */
4917 txn->mt_flags |= MDB_TXN_ERROR;
4918 return MDB_CORRUPTED;
4921 if (!(env->me_flags & MDB_WRITEMAP))
4922 mdb_dpage_free(env, mp);
4924 /* Insert in me_pghead */
4925 mop = env->me_pghead;
4926 j = mop[0] + ovpages;
4927 for (i = mop[0]; i && mop[i] < pg; i--)
4933 rc = mdb_midl_append_range(&txn->mt_free_pgs, pg, ovpages);
4937 mc->mc_db->md_overflow_pages -= ovpages;
4941 /** Return the data associated with a given node.
4942 * @param[in] txn The transaction for this operation.
4943 * @param[in] leaf The node being read.
4944 * @param[out] data Updated to point to the node's data.
4945 * @return 0 on success, non-zero on failure.
4948 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
4950 MDB_page *omp; /* overflow page */
4954 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4955 data->mv_size = NODEDSZ(leaf);
4956 data->mv_data = NODEDATA(leaf);
4960 /* Read overflow data.
4962 data->mv_size = NODEDSZ(leaf);
4963 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
4964 if ((rc = mdb_page_get(txn, pgno, &omp, NULL)) != 0) {
4965 DPRINTF(("read overflow page %"Z"u failed", pgno));
4968 data->mv_data = METADATA(omp);
4974 mdb_get(MDB_txn *txn, MDB_dbi dbi,
4975 MDB_val *key, MDB_val *data)
4984 DPRINTF(("===> get db %u key [%s]", dbi, DKEY(key)));
4986 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
4989 if (txn->mt_flags & MDB_TXN_ERROR)
4992 mdb_cursor_init(&mc, txn, dbi, &mx);
4993 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
4996 /** Find a sibling for a page.
4997 * Replaces the page at the top of the cursor's stack with the
4998 * specified sibling, if one exists.
4999 * @param[in] mc The cursor for this operation.
5000 * @param[in] move_right Non-zero if the right sibling is requested,
5001 * otherwise the left sibling.
5002 * @return 0 on success, non-zero on failure.
5005 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
5011 if (mc->mc_snum < 2) {
5012 return MDB_NOTFOUND; /* root has no siblings */
5016 DPRINTF(("parent page is page %"Z"u, index %u",
5017 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]));
5019 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
5020 : (mc->mc_ki[mc->mc_top] == 0)) {
5021 DPRINTF(("no more keys left, moving to %s sibling",
5022 move_right ? "right" : "left"));
5023 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
5024 /* undo cursor_pop before returning */
5031 mc->mc_ki[mc->mc_top]++;
5033 mc->mc_ki[mc->mc_top]--;
5034 DPRINTF(("just moving to %s index key %u",
5035 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]));
5037 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
5039 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5040 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp, NULL)) != 0) {
5041 /* mc will be inconsistent if caller does mc_snum++ as above */
5042 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
5046 mdb_cursor_push(mc, mp);
5048 mc->mc_ki[mc->mc_top] = NUMKEYS(mp)-1;
5053 /** Move the cursor to the next data item. */
5055 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5061 if (mc->mc_flags & C_EOF) {
5062 return MDB_NOTFOUND;
5065 assert(mc->mc_flags & C_INITIALIZED);
5067 mp = mc->mc_pg[mc->mc_top];
5069 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5070 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5071 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5072 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
5073 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
5074 if (op != MDB_NEXT || rc != MDB_NOTFOUND) {
5075 if (rc == MDB_SUCCESS)
5076 MDB_GET_KEY(leaf, key);
5081 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5082 if (op == MDB_NEXT_DUP)
5083 return MDB_NOTFOUND;
5087 DPRINTF(("cursor_next: top page is %"Z"u in cursor %p", mp->mp_pgno, (void *) mc));
5088 if (mc->mc_flags & C_DEL)
5091 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
5092 DPUTS("=====> move to next sibling page");
5093 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS) {
5094 mc->mc_flags |= C_EOF;
5097 mp = mc->mc_pg[mc->mc_top];
5098 DPRINTF(("next page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5100 mc->mc_ki[mc->mc_top]++;
5103 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5104 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5107 key->mv_size = mc->mc_db->md_pad;
5108 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5112 assert(IS_LEAF(mp));
5113 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5115 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5116 mdb_xcursor_init1(mc, leaf);
5119 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5122 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5123 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5124 if (rc != MDB_SUCCESS)
5129 MDB_GET_KEY(leaf, key);
5133 /** Move the cursor to the previous data item. */
5135 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
5141 assert(mc->mc_flags & C_INITIALIZED);
5143 mp = mc->mc_pg[mc->mc_top];
5145 if (mc->mc_db->md_flags & MDB_DUPSORT) {
5146 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5147 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5148 if (op == MDB_PREV || op == MDB_PREV_DUP) {
5149 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
5150 if (op != MDB_PREV || rc != MDB_NOTFOUND) {
5151 if (rc == MDB_SUCCESS)
5152 MDB_GET_KEY(leaf, key);
5156 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5157 if (op == MDB_PREV_DUP)
5158 return MDB_NOTFOUND;
5163 DPRINTF(("cursor_prev: top page is %"Z"u in cursor %p", mp->mp_pgno, (void *) mc));
5165 if (mc->mc_ki[mc->mc_top] == 0) {
5166 DPUTS("=====> move to prev sibling page");
5167 if ((rc = mdb_cursor_sibling(mc, 0)) != MDB_SUCCESS) {
5170 mp = mc->mc_pg[mc->mc_top];
5171 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
5172 DPRINTF(("prev page is %"Z"u, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]));
5174 mc->mc_ki[mc->mc_top]--;
5176 mc->mc_flags &= ~C_EOF;
5178 DPRINTF(("==> cursor points to page %"Z"u with %u keys, key index %u",
5179 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]));
5182 key->mv_size = mc->mc_db->md_pad;
5183 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5187 assert(IS_LEAF(mp));
5188 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5190 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5191 mdb_xcursor_init1(mc, leaf);
5194 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5197 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5198 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5199 if (rc != MDB_SUCCESS)
5204 MDB_GET_KEY(leaf, key);
5208 /** Set the cursor on a specific data item. */
5210 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5211 MDB_cursor_op op, int *exactp)
5215 MDB_node *leaf = NULL;
5220 if (key->mv_size == 0)
5221 return MDB_BAD_VALSIZE;
5224 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5226 /* See if we're already on the right page */
5227 if (mc->mc_flags & C_INITIALIZED) {
5230 mp = mc->mc_pg[mc->mc_top];
5232 mc->mc_ki[mc->mc_top] = 0;
5233 return MDB_NOTFOUND;
5235 if (mp->mp_flags & P_LEAF2) {
5236 nodekey.mv_size = mc->mc_db->md_pad;
5237 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
5239 leaf = NODEPTR(mp, 0);
5240 MDB_GET_KEY2(leaf, nodekey);
5242 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5244 /* Probably happens rarely, but first node on the page
5245 * was the one we wanted.
5247 mc->mc_ki[mc->mc_top] = 0;
5254 unsigned int nkeys = NUMKEYS(mp);
5256 if (mp->mp_flags & P_LEAF2) {
5257 nodekey.mv_data = LEAF2KEY(mp,
5258 nkeys-1, nodekey.mv_size);
5260 leaf = NODEPTR(mp, nkeys-1);
5261 MDB_GET_KEY2(leaf, nodekey);
5263 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5265 /* last node was the one we wanted */
5266 mc->mc_ki[mc->mc_top] = nkeys-1;
5272 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
5273 /* This is definitely the right page, skip search_page */
5274 if (mp->mp_flags & P_LEAF2) {
5275 nodekey.mv_data = LEAF2KEY(mp,
5276 mc->mc_ki[mc->mc_top], nodekey.mv_size);
5278 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5279 MDB_GET_KEY2(leaf, nodekey);
5281 rc = mc->mc_dbx->md_cmp(key, &nodekey);
5283 /* current node was the one we wanted */
5293 /* If any parents have right-sibs, search.
5294 * Otherwise, there's nothing further.
5296 for (i=0; i<mc->mc_top; i++)
5298 NUMKEYS(mc->mc_pg[i])-1)
5300 if (i == mc->mc_top) {
5301 /* There are no other pages */
5302 mc->mc_ki[mc->mc_top] = nkeys;
5303 return MDB_NOTFOUND;
5307 /* There are no other pages */
5308 mc->mc_ki[mc->mc_top] = 0;
5309 if (op == MDB_SET_RANGE) {
5313 return MDB_NOTFOUND;
5317 rc = mdb_page_search(mc, key, 0);
5318 if (rc != MDB_SUCCESS)
5321 mp = mc->mc_pg[mc->mc_top];
5322 assert(IS_LEAF(mp));
5325 leaf = mdb_node_search(mc, key, exactp);
5326 if (exactp != NULL && !*exactp) {
5327 /* MDB_SET specified and not an exact match. */
5328 return MDB_NOTFOUND;
5332 DPUTS("===> inexact leaf not found, goto sibling");
5333 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
5334 return rc; /* no entries matched */
5335 mp = mc->mc_pg[mc->mc_top];
5336 assert(IS_LEAF(mp));
5337 leaf = NODEPTR(mp, 0);
5341 mc->mc_flags |= C_INITIALIZED;
5342 mc->mc_flags &= ~C_EOF;
5345 key->mv_size = mc->mc_db->md_pad;
5346 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5350 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5351 mdb_xcursor_init1(mc, leaf);
5354 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5355 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
5356 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5359 if (op == MDB_GET_BOTH) {
5365 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
5366 if (rc != MDB_SUCCESS)
5369 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
5371 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
5373 rc = mc->mc_dbx->md_dcmp(data, &d2);
5375 if (op == MDB_GET_BOTH || rc > 0)
5376 return MDB_NOTFOUND;
5383 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5384 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5389 /* The key already matches in all other cases */
5390 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
5391 MDB_GET_KEY(leaf, key);
5392 DPRINTF(("==> cursor placed on key [%s]", DKEY(key)));
5397 /** Move the cursor to the first item in the database. */
5399 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5405 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5407 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5408 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
5409 if (rc != MDB_SUCCESS)
5412 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
5414 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
5415 mc->mc_flags |= C_INITIALIZED;
5416 mc->mc_flags &= ~C_EOF;
5418 mc->mc_ki[mc->mc_top] = 0;
5420 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5421 key->mv_size = mc->mc_db->md_pad;
5422 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
5427 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5428 mdb_xcursor_init1(mc, leaf);
5429 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
5433 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5437 MDB_GET_KEY(leaf, key);
5441 /** Move the cursor to the last item in the database. */
5443 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
5449 mc->mc_xcursor->mx_cursor.mc_flags &= ~(C_INITIALIZED|C_EOF);
5451 if (!(mc->mc_flags & C_EOF)) {
5453 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
5454 rc = mdb_page_search(mc, NULL, MDB_PS_LAST);
5455 if (rc != MDB_SUCCESS)
5458 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
5461 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
5462 mc->mc_flags |= C_INITIALIZED|C_EOF;
5463 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5465 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5466 key->mv_size = mc->mc_db->md_pad;
5467 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
5472 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5473 mdb_xcursor_init1(mc, leaf);
5474 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
5478 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
5483 MDB_GET_KEY(leaf, key);
5488 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5493 int (*mfunc)(MDB_cursor *mc, MDB_val *key, MDB_val *data);
5497 if (mc->mc_txn->mt_flags & MDB_TXN_ERROR)
5501 case MDB_GET_CURRENT:
5502 if (!(mc->mc_flags & C_INITIALIZED)) {
5505 MDB_page *mp = mc->mc_pg[mc->mc_top];
5506 int nkeys = NUMKEYS(mp);
5507 if (!nkeys || mc->mc_ki[mc->mc_top] >= nkeys) {
5508 mc->mc_ki[mc->mc_top] = nkeys;
5514 key->mv_size = mc->mc_db->md_pad;
5515 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
5517 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
5518 MDB_GET_KEY(leaf, key);
5520 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5521 if (mc->mc_flags & C_DEL)
5522 mdb_xcursor_init1(mc, leaf);
5523 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
5525 rc = mdb_node_read(mc->mc_txn, leaf, data);
5532 case MDB_GET_BOTH_RANGE:
5537 if (mc->mc_xcursor == NULL) {
5538 rc = MDB_INCOMPATIBLE;
5548 rc = mdb_cursor_set(mc, key, data, op,
5549 op == MDB_SET_RANGE ? NULL : &exact);
5552 case MDB_GET_MULTIPLE:
5553 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5557 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5558 rc = MDB_INCOMPATIBLE;
5562 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
5563 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
5566 case MDB_NEXT_MULTIPLE:
5571 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5572 rc = MDB_INCOMPATIBLE;
5575 if (!(mc->mc_flags & C_INITIALIZED))
5576 rc = mdb_cursor_first(mc, key, data);
5578 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
5579 if (rc == MDB_SUCCESS) {
5580 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
5583 mx = &mc->mc_xcursor->mx_cursor;
5584 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
5586 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
5587 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
5595 case MDB_NEXT_NODUP:
5596 if (!(mc->mc_flags & C_INITIALIZED))
5597 rc = mdb_cursor_first(mc, key, data);
5599 rc = mdb_cursor_next(mc, key, data, op);
5603 case MDB_PREV_NODUP:
5604 if (!(mc->mc_flags & C_INITIALIZED)) {
5605 rc = mdb_cursor_last(mc, key, data);
5608 mc->mc_flags |= C_INITIALIZED;
5609 mc->mc_ki[mc->mc_top]++;
5611 rc = mdb_cursor_prev(mc, key, data, op);
5614 rc = mdb_cursor_first(mc, key, data);
5617 mfunc = mdb_cursor_first;
5619 if (data == NULL || !(mc->mc_flags & C_INITIALIZED)) {
5623 if (mc->mc_xcursor == NULL) {
5624 rc = MDB_INCOMPATIBLE;
5627 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
5631 rc = mfunc(&mc->mc_xcursor->mx_cursor, data, NULL);
5634 rc = mdb_cursor_last(mc, key, data);
5637 mfunc = mdb_cursor_last;
5640 DPRINTF(("unhandled/unimplemented cursor operation %u", op));
5645 if (mc->mc_flags & C_DEL)
5646 mc->mc_flags ^= C_DEL;
5651 /** Touch all the pages in the cursor stack. Set mc_top.
5652 * Makes sure all the pages are writable, before attempting a write operation.
5653 * @param[in] mc The cursor to operate on.
5656 mdb_cursor_touch(MDB_cursor *mc)
5658 int rc = MDB_SUCCESS;
5660 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
5663 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, &mcx);
5664 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
5667 *mc->mc_dbflag |= DB_DIRTY;
5672 rc = mdb_page_touch(mc);
5673 } while (!rc && ++(mc->mc_top) < mc->mc_snum);
5674 mc->mc_top = mc->mc_snum-1;
5679 /** Do not spill pages to disk if txn is getting full, may fail instead */
5680 #define MDB_NOSPILL 0x8000
5683 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
5686 enum { MDB_NO_ROOT = MDB_LAST_ERRCODE+10 }; /* internal code */
5687 MDB_env *env = mc->mc_txn->mt_env;
5688 MDB_node *leaf = NULL;
5691 MDB_val xdata, *rdata, dkey, olddata;
5693 int do_sub = 0, insert;
5694 unsigned int mcount = 0, dcount = 0, nospill;
5697 unsigned int nflags;
5700 /* Check this first so counter will always be zero on any
5703 if (flags & MDB_MULTIPLE) {
5704 dcount = data[1].mv_size;
5705 data[1].mv_size = 0;
5706 if (!F_ISSET(mc->mc_db->md_flags, MDB_DUPFIXED))
5707 return MDB_INCOMPATIBLE;
5710 nospill = flags & MDB_NOSPILL;
5711 flags &= ~MDB_NOSPILL;
5713 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
5714 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
5716 if (flags != MDB_CURRENT && key->mv_size-1 >= ENV_MAXKEY(env))
5717 return MDB_BAD_VALSIZE;
5719 #if SIZE_MAX > MAXDATASIZE
5720 if (data->mv_size > ((mc->mc_db->md_flags & MDB_DUPSORT) ? ENV_MAXKEY(env) : MAXDATASIZE))
5721 return MDB_BAD_VALSIZE;
5723 if ((mc->mc_db->md_flags & MDB_DUPSORT) && data->mv_size > ENV_MAXKEY(env))
5724 return MDB_BAD_VALSIZE;
5727 DPRINTF(("==> put db %d key [%s], size %"Z"u, data size %"Z"u",
5728 DDBI(mc), DKEY(key), key ? key->mv_size : 0, data->mv_size));
5732 if (flags == MDB_CURRENT) {
5733 if (!(mc->mc_flags & C_INITIALIZED))
5736 } else if (mc->mc_db->md_root == P_INVALID) {
5737 /* new database, cursor has nothing to point to */
5740 mc->mc_flags &= ~C_INITIALIZED;
5745 if (flags & MDB_APPEND) {
5747 rc = mdb_cursor_last(mc, &k2, &d2);
5749 rc = mc->mc_dbx->md_cmp(key, &k2);
5752 mc->mc_ki[mc->mc_top]++;
5754 /* new key is <= last key */
5759 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
5761 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
5762 DPRINTF(("duplicate key [%s]", DKEY(key)));
5764 return MDB_KEYEXIST;
5766 if (rc && rc != MDB_NOTFOUND)
5770 if (mc->mc_flags & C_DEL)
5771 mc->mc_flags ^= C_DEL;
5773 /* Cursor is positioned, check for room in the dirty list */
5775 if (flags & MDB_MULTIPLE) {
5777 xdata.mv_size = data->mv_size * dcount;
5781 if ((rc2 = mdb_page_spill(mc, key, rdata)))
5785 if (rc == MDB_NO_ROOT) {
5787 /* new database, write a root leaf page */
5788 DPUTS("allocating new root leaf page");
5789 if ((rc2 = mdb_page_new(mc, P_LEAF, 1, &np))) {
5792 mdb_cursor_push(mc, np);
5793 mc->mc_db->md_root = np->mp_pgno;
5794 mc->mc_db->md_depth++;
5795 *mc->mc_dbflag |= DB_DIRTY;
5796 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
5798 np->mp_flags |= P_LEAF2;
5799 mc->mc_flags |= C_INITIALIZED;
5801 /* make sure all cursor pages are writable */
5802 rc2 = mdb_cursor_touch(mc);
5809 /* The key does not exist */
5810 DPRINTF(("inserting key at index %i", mc->mc_ki[mc->mc_top]));
5811 if ((mc->mc_db->md_flags & MDB_DUPSORT) &&
5812 LEAFSIZE(key, data) > env->me_nodemax)
5814 /* Too big for a node, insert in sub-DB */
5815 fp_flags = P_LEAF|P_DIRTY;
5817 fp->mp_pad = data->mv_size; /* used if MDB_DUPFIXED */
5818 fp->mp_lower = fp->mp_upper = olddata.mv_size = PAGEHDRSZ;
5822 /* there's only a key anyway, so this is a no-op */
5823 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
5824 unsigned int ksize = mc->mc_db->md_pad;
5825 if (key->mv_size != ksize)
5826 return MDB_BAD_VALSIZE;
5827 if (flags == MDB_CURRENT) {
5828 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
5829 memcpy(ptr, key->mv_data, ksize);
5835 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5836 olddata.mv_size = NODEDSZ(leaf);
5837 olddata.mv_data = NODEDATA(leaf);
5840 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
5841 /* Prepare (sub-)page/sub-DB to accept the new item,
5842 * if needed. fp: old sub-page or a header faking
5843 * it. mp: new (sub-)page. offset: growth in page
5844 * size. xdata: node data with new page or DB.
5846 unsigned i, offset = 0;
5847 mp = fp = xdata.mv_data = env->me_pbuf;
5848 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5850 /* Was a single item before, must convert now */
5851 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5852 /* Just overwrite the current item */
5853 if (flags == MDB_CURRENT)
5856 #if UINT_MAX < SIZE_MAX
5857 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && olddata.mv_size == sizeof(size_t))
5858 #ifdef MISALIGNED_OK
5859 mc->mc_dbx->md_dcmp = mdb_cmp_long;
5861 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
5864 /* if data matches, skip it */
5865 if (!mc->mc_dbx->md_dcmp(data, &olddata)) {
5866 if (flags & MDB_NODUPDATA)
5868 else if (flags & MDB_MULTIPLE)
5875 /* Back up original data item */
5876 dkey.mv_size = olddata.mv_size;
5877 dkey.mv_data = memcpy(fp+1, olddata.mv_data, olddata.mv_size);
5879 /* Make sub-page header for the dup items, with dummy body */
5880 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
5881 fp->mp_lower = PAGEHDRSZ;
5882 xdata.mv_size = PAGEHDRSZ + dkey.mv_size + data->mv_size;
5883 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5884 fp->mp_flags |= P_LEAF2;
5885 fp->mp_pad = data->mv_size;
5886 xdata.mv_size += 2 * data->mv_size; /* leave space for 2 more */
5888 xdata.mv_size += 2 * (sizeof(indx_t) + NODESIZE) +
5889 (dkey.mv_size & 1) + (data->mv_size & 1);
5891 fp->mp_upper = xdata.mv_size;
5892 olddata.mv_size = fp->mp_upper; /* pretend olddata is fp */
5893 } else if (leaf->mn_flags & F_SUBDATA) {
5894 /* Data is on sub-DB, just store it */
5895 flags |= F_DUPDATA|F_SUBDATA;
5898 /* Data is on sub-page */
5899 fp = olddata.mv_data;
5902 if (!(mc->mc_db->md_flags & MDB_DUPFIXED)) {
5903 offset = EVEN(NODESIZE + sizeof(indx_t) +
5907 offset = fp->mp_pad;
5908 if (SIZELEFT(fp) < offset) {
5909 offset *= 4; /* space for 4 more */
5912 /* FALLTHRU: Big enough MDB_DUPFIXED sub-page */
5914 fp->mp_flags |= P_DIRTY;
5915 COPY_PGNO(fp->mp_pgno, mp->mp_pgno);
5916 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
5920 xdata.mv_size = olddata.mv_size + offset;
5923 fp_flags = fp->mp_flags;
5924 if (NODESIZE + NODEKSZ(leaf) + xdata.mv_size > env->me_nodemax) {
5925 /* Too big for a sub-page, convert to sub-DB */
5926 fp_flags &= ~P_SUBP;
5928 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5929 fp_flags |= P_LEAF2;
5930 dummy.md_pad = fp->mp_pad;
5931 dummy.md_flags = MDB_DUPFIXED;
5932 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5933 dummy.md_flags |= MDB_INTEGERKEY;
5939 dummy.md_branch_pages = 0;
5940 dummy.md_leaf_pages = 1;
5941 dummy.md_overflow_pages = 0;
5942 dummy.md_entries = NUMKEYS(fp);
5943 xdata.mv_size = sizeof(MDB_db);
5944 xdata.mv_data = &dummy;
5945 if ((rc = mdb_page_alloc(mc, 1, &mp)))
5947 offset = env->me_psize - olddata.mv_size;
5948 flags |= F_DUPDATA|F_SUBDATA;
5949 dummy.md_root = mp->mp_pgno;
5952 mp->mp_flags = fp_flags | P_DIRTY;
5953 mp->mp_pad = fp->mp_pad;
5954 mp->mp_lower = fp->mp_lower;
5955 mp->mp_upper = fp->mp_upper + offset;
5956 if (fp_flags & P_LEAF2) {
5957 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
5959 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper,
5960 olddata.mv_size - fp->mp_upper);
5961 for (i=0; i<NUMKEYS(fp); i++)
5962 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
5970 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5974 /* overflow page overwrites need special handling */
5975 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5978 int level, ovpages, dpages = OVPAGES(data->mv_size, env->me_psize);
5980 memcpy(&pg, olddata.mv_data, sizeof(pg));
5981 if ((rc2 = mdb_page_get(mc->mc_txn, pg, &omp, &level)) != 0)
5983 ovpages = omp->mp_pages;
5985 /* Is the ov page large enough? */
5986 if (ovpages >= dpages) {
5987 if (!(omp->mp_flags & P_DIRTY) &&
5988 (level || (env->me_flags & MDB_WRITEMAP)))
5990 rc = mdb_page_unspill(mc->mc_txn, omp, &omp);
5993 level = 0; /* dirty in this txn or clean */
5996 if (omp->mp_flags & P_DIRTY) {
5997 /* yes, overwrite it. Note in this case we don't
5998 * bother to try shrinking the page if the new data
5999 * is smaller than the overflow threshold.
6002 /* It is writable only in a parent txn */
6003 size_t sz = (size_t) env->me_psize * ovpages, off;
6004 MDB_page *np = mdb_page_malloc(mc->mc_txn, ovpages);
6010 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &id2);
6011 if (!(flags & MDB_RESERVE)) {
6012 /* Copy end of page, adjusting alignment so
6013 * compiler may copy words instead of bytes.
6015 off = (PAGEHDRSZ + data->mv_size) & -sizeof(size_t);
6016 memcpy((size_t *)((char *)np + off),
6017 (size_t *)((char *)omp + off), sz - off);
6020 memcpy(np, omp, sz); /* Copy beginning of page */
6023 SETDSZ(leaf, data->mv_size);
6024 if (F_ISSET(flags, MDB_RESERVE))
6025 data->mv_data = METADATA(omp);
6027 memcpy(METADATA(omp), data->mv_data, data->mv_size);
6031 if ((rc2 = mdb_ovpage_free(mc, omp)) != MDB_SUCCESS)
6033 } else if (data->mv_size == olddata.mv_size) {
6034 /* same size, just replace it. Note that we could
6035 * also reuse this node if the new data is smaller,
6036 * but instead we opt to shrink the node in that case.
6038 if (F_ISSET(flags, MDB_RESERVE))
6039 data->mv_data = olddata.mv_data;
6040 else if (data->mv_size)
6041 memcpy(olddata.mv_data, data->mv_data, data->mv_size);
6043 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
6046 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
6047 mc->mc_db->md_entries--;
6053 nflags = flags & NODE_ADD_FLAGS;
6054 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(env, key, rdata);
6055 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
6056 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
6057 nflags &= ~MDB_APPEND;
6059 nflags |= MDB_SPLIT_REPLACE;
6060 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
6062 /* There is room already in this leaf page. */
6063 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
6064 if (rc == 0 && !do_sub && insert) {
6065 /* Adjust other cursors pointing to mp */
6066 MDB_cursor *m2, *m3;
6067 MDB_dbi dbi = mc->mc_dbi;
6068 unsigned i = mc->mc_top;
6069 MDB_page *mp = mc->mc_pg[i];
6071 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6072 if (mc->mc_flags & C_SUB)
6073 m3 = &m2->mc_xcursor->mx_cursor;
6076 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
6077 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
6084 if (rc != MDB_SUCCESS)
6085 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6087 /* Now store the actual data in the child DB. Note that we're
6088 * storing the user data in the keys field, so there are strict
6089 * size limits on dupdata. The actual data fields of the child
6090 * DB are all zero size.
6097 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6098 if (flags & MDB_CURRENT) {
6099 xflags = MDB_CURRENT|MDB_NOSPILL;
6101 mdb_xcursor_init1(mc, leaf);
6102 xflags = (flags & MDB_NODUPDATA) ?
6103 MDB_NOOVERWRITE|MDB_NOSPILL : MDB_NOSPILL;
6105 /* converted, write the original data first */
6107 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
6111 /* Adjust other cursors pointing to mp */
6113 unsigned i = mc->mc_top;
6114 MDB_page *mp = mc->mc_pg[i];
6116 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6117 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6118 if (!(m2->mc_flags & C_INITIALIZED)) continue;
6119 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
6120 mdb_xcursor_init1(m2, leaf);
6124 /* we've done our job */
6127 if (flags & MDB_APPENDDUP)
6128 xflags |= MDB_APPEND;
6129 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
6130 if (flags & F_SUBDATA) {
6131 void *db = NODEDATA(leaf);
6132 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6135 /* sub-writes might have failed so check rc again.
6136 * Don't increment count if we just replaced an existing item.
6138 if (!rc && !(flags & MDB_CURRENT))
6139 mc->mc_db->md_entries++;
6140 if (flags & MDB_MULTIPLE) {
6144 /* let caller know how many succeeded, if any */
6145 data[1].mv_size = mcount;
6146 if (mcount < dcount) {
6147 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
6154 /* If we succeeded and the key didn't exist before, make sure
6155 * the cursor is marked valid.
6158 mc->mc_flags |= C_INITIALIZED;
6163 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
6169 if (mc->mc_txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
6170 return (mc->mc_txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
6172 if (!(mc->mc_flags & C_INITIALIZED))
6175 if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6176 return MDB_NOTFOUND;
6178 if (!(flags & MDB_NOSPILL) && (rc = mdb_page_spill(mc, NULL, NULL)))
6181 rc = mdb_cursor_touch(mc);
6185 mp = mc->mc_pg[mc->mc_top];
6186 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6188 if (!IS_LEAF2(mp) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6189 if (!(flags & MDB_NODUPDATA)) {
6190 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
6191 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6193 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, MDB_NOSPILL);
6194 /* If sub-DB still has entries, we're done */
6195 if (mc->mc_xcursor->mx_db.md_entries) {
6196 if (leaf->mn_flags & F_SUBDATA) {
6197 /* update subDB info */
6198 void *db = NODEDATA(leaf);
6199 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
6202 /* shrink fake page */
6203 mdb_node_shrink(mp, mc->mc_ki[mc->mc_top]);
6204 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6205 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6206 /* fix other sub-DB cursors pointed at this fake page */
6207 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
6208 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
6209 if (m2->mc_pg[mc->mc_top] == mp &&
6210 m2->mc_ki[mc->mc_top] == mc->mc_ki[mc->mc_top])
6211 m2->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
6214 mc->mc_db->md_entries--;
6215 mc->mc_flags |= C_DEL;
6218 /* otherwise fall thru and delete the sub-DB */
6221 if (leaf->mn_flags & F_SUBDATA) {
6222 /* add all the child DB's pages to the free list */
6223 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
6224 if (rc == MDB_SUCCESS) {
6225 mc->mc_db->md_entries -=
6226 mc->mc_xcursor->mx_db.md_entries;
6231 return mdb_cursor_del0(mc, leaf);
6234 /** Allocate and initialize new pages for a database.
6235 * @param[in] mc a cursor on the database being added to.
6236 * @param[in] flags flags defining what type of page is being allocated.
6237 * @param[in] num the number of pages to allocate. This is usually 1,
6238 * unless allocating overflow pages for a large record.
6239 * @param[out] mp Address of a page, or NULL on failure.
6240 * @return 0 on success, non-zero on failure.
6243 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
6248 if ((rc = mdb_page_alloc(mc, num, &np)))
6250 DPRINTF(("allocated new mpage %"Z"u, page size %u",
6251 np->mp_pgno, mc->mc_txn->mt_env->me_psize));
6252 np->mp_flags = flags | P_DIRTY;
6253 np->mp_lower = PAGEHDRSZ;
6254 np->mp_upper = mc->mc_txn->mt_env->me_psize;
6257 mc->mc_db->md_branch_pages++;
6258 else if (IS_LEAF(np))
6259 mc->mc_db->md_leaf_pages++;
6260 else if (IS_OVERFLOW(np)) {
6261 mc->mc_db->md_overflow_pages += num;
6269 /** Calculate the size of a leaf node.
6270 * The size depends on the environment's page size; if a data item
6271 * is too large it will be put onto an overflow page and the node
6272 * size will only include the key and not the data. Sizes are always
6273 * rounded up to an even number of bytes, to guarantee 2-byte alignment
6274 * of the #MDB_node headers.
6275 * @param[in] env The environment handle.
6276 * @param[in] key The key for the node.
6277 * @param[in] data The data for the node.
6278 * @return The number of bytes needed to store the node.
6281 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
6285 sz = LEAFSIZE(key, data);
6286 if (sz > env->me_nodemax) {
6287 /* put on overflow page */
6288 sz -= data->mv_size - sizeof(pgno_t);
6291 return EVEN(sz + sizeof(indx_t));
6294 /** Calculate the size of a branch node.
6295 * The size should depend on the environment's page size but since
6296 * we currently don't support spilling large keys onto overflow
6297 * pages, it's simply the size of the #MDB_node header plus the
6298 * size of the key. Sizes are always rounded up to an even number
6299 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
6300 * @param[in] env The environment handle.
6301 * @param[in] key The key for the node.
6302 * @return The number of bytes needed to store the node.
6305 mdb_branch_size(MDB_env *env, MDB_val *key)
6310 if (sz > env->me_nodemax) {
6311 /* put on overflow page */
6312 /* not implemented */
6313 /* sz -= key->size - sizeof(pgno_t); */
6316 return sz + sizeof(indx_t);
6319 /** Add a node to the page pointed to by the cursor.
6320 * @param[in] mc The cursor for this operation.
6321 * @param[in] indx The index on the page where the new node should be added.
6322 * @param[in] key The key for the new node.
6323 * @param[in] data The data for the new node, if any.
6324 * @param[in] pgno The page number, if adding a branch node.
6325 * @param[in] flags Flags for the node.
6326 * @return 0 on success, non-zero on failure. Possible errors are:
6328 * <li>ENOMEM - failed to allocate overflow pages for the node.
6329 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
6330 * should never happen since all callers already calculate the
6331 * page's free space before calling this function.
6335 mdb_node_add(MDB_cursor *mc, indx_t indx,
6336 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
6339 size_t node_size = NODESIZE;
6343 MDB_page *mp = mc->mc_pg[mc->mc_top];
6344 MDB_page *ofp = NULL; /* overflow page */
6347 assert(mp->mp_upper >= mp->mp_lower);
6349 DPRINTF(("add to %s %spage %"Z"u index %i, data size %"Z"u key size %"Z"u [%s]",
6350 IS_LEAF(mp) ? "leaf" : "branch",
6351 IS_SUBP(mp) ? "sub-" : "",
6352 mp->mp_pgno, indx, data ? data->mv_size : 0,
6353 key ? key->mv_size : 0, key ? DKEY(key) : "null"));
6356 /* Move higher keys up one slot. */
6357 int ksize = mc->mc_db->md_pad, dif;
6358 char *ptr = LEAF2KEY(mp, indx, ksize);
6359 dif = NUMKEYS(mp) - indx;
6361 memmove(ptr+ksize, ptr, dif*ksize);
6362 /* insert new key */
6363 memcpy(ptr, key->mv_data, ksize);
6365 /* Just using these for counting */
6366 mp->mp_lower += sizeof(indx_t);
6367 mp->mp_upper -= ksize - sizeof(indx_t);
6371 room = (ssize_t)SIZELEFT(mp) - (ssize_t)sizeof(indx_t);
6373 node_size += key->mv_size;
6376 if (F_ISSET(flags, F_BIGDATA)) {
6377 /* Data already on overflow page. */
6378 node_size += sizeof(pgno_t);
6379 } else if (node_size + data->mv_size > mc->mc_txn->mt_env->me_nodemax) {
6380 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
6382 /* Put data on overflow page. */
6383 DPRINTF(("data size is %"Z"u, node would be %"Z"u, put data on overflow page",
6384 data->mv_size, node_size+data->mv_size));
6385 node_size = EVEN(node_size + sizeof(pgno_t));
6386 if ((ssize_t)node_size > room)
6388 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
6390 DPRINTF(("allocated overflow page %"Z"u", ofp->mp_pgno));
6394 node_size += data->mv_size;
6397 node_size = EVEN(node_size);
6398 if ((ssize_t)node_size > room)
6402 /* Move higher pointers up one slot. */
6403 for (i = NUMKEYS(mp); i > indx; i--)
6404 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
6406 /* Adjust free space offsets. */
6407 ofs = mp->mp_upper - node_size;
6408 assert(ofs >= mp->mp_lower + sizeof(indx_t));
6409 mp->mp_ptrs[indx] = ofs;
6411 mp->mp_lower += sizeof(indx_t);
6413 /* Write the node data. */
6414 node = NODEPTR(mp, indx);
6415 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
6416 node->mn_flags = flags;
6418 SETDSZ(node,data->mv_size);
6423 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
6428 if (F_ISSET(flags, F_BIGDATA))
6429 memcpy(node->mn_data + key->mv_size, data->mv_data,
6431 else if (F_ISSET(flags, MDB_RESERVE))
6432 data->mv_data = node->mn_data + key->mv_size;
6434 memcpy(node->mn_data + key->mv_size, data->mv_data,
6437 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
6439 if (F_ISSET(flags, MDB_RESERVE))
6440 data->mv_data = METADATA(ofp);
6442 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
6449 DPRINTF(("not enough room in page %"Z"u, got %u ptrs",
6450 mp->mp_pgno, NUMKEYS(mp)));
6451 DPRINTF(("upper-lower = %u - %u = %"Z"d", mp->mp_upper,mp->mp_lower,room));
6452 DPRINTF(("node size = %"Z"u", node_size));
6453 return MDB_PAGE_FULL;
6456 /** Delete the specified node from a page.
6457 * @param[in] mp The page to operate on.
6458 * @param[in] indx The index of the node to delete.
6459 * @param[in] ksize The size of a node. Only used if the page is
6460 * part of a #MDB_DUPFIXED database.
6463 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
6466 indx_t i, j, numkeys, ptr;
6473 COPY_PGNO(pgno, mp->mp_pgno);
6474 DPRINTF(("delete node %u on %s page %"Z"u", indx,
6475 IS_LEAF(mp) ? "leaf" : "branch", pgno));
6478 assert(indx < NUMKEYS(mp));
6481 int x = NUMKEYS(mp) - 1 - indx;
6482 base = LEAF2KEY(mp, indx, ksize);
6484 memmove(base, base + ksize, x * ksize);
6485 mp->mp_lower -= sizeof(indx_t);
6486 mp->mp_upper += ksize - sizeof(indx_t);
6490 node = NODEPTR(mp, indx);
6491 sz = NODESIZE + node->mn_ksize;
6493 if (F_ISSET(node->mn_flags, F_BIGDATA))
6494 sz += sizeof(pgno_t);
6496 sz += NODEDSZ(node);
6500 ptr = mp->mp_ptrs[indx];
6501 numkeys = NUMKEYS(mp);
6502 for (i = j = 0; i < numkeys; i++) {
6504 mp->mp_ptrs[j] = mp->mp_ptrs[i];
6505 if (mp->mp_ptrs[i] < ptr)
6506 mp->mp_ptrs[j] += sz;
6511 base = (char *)mp + mp->mp_upper;
6512 memmove(base + sz, base, ptr - mp->mp_upper);
6514 mp->mp_lower -= sizeof(indx_t);
6518 /** Compact the main page after deleting a node on a subpage.
6519 * @param[in] mp The main page to operate on.
6520 * @param[in] indx The index of the subpage on the main page.
6523 mdb_node_shrink(MDB_page *mp, indx_t indx)
6529 indx_t i, numkeys, ptr;
6531 node = NODEPTR(mp, indx);
6532 sp = (MDB_page *)NODEDATA(node);
6533 delta = SIZELEFT(sp);
6534 xp = (MDB_page *)((char *)sp + delta);
6536 /* shift subpage upward */
6538 nsize = NUMKEYS(sp) * sp->mp_pad;
6540 return; /* do not make the node uneven-sized */
6541 memmove(METADATA(xp), METADATA(sp), nsize);
6544 numkeys = NUMKEYS(sp);
6545 for (i=numkeys-1; i>=0; i--)
6546 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
6548 xp->mp_upper = sp->mp_lower;
6549 xp->mp_lower = sp->mp_lower;
6550 xp->mp_flags = sp->mp_flags;
6551 xp->mp_pad = sp->mp_pad;
6552 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
6554 nsize = NODEDSZ(node) - delta;
6555 SETDSZ(node, nsize);
6557 /* shift lower nodes upward */
6558 ptr = mp->mp_ptrs[indx];
6559 numkeys = NUMKEYS(mp);
6560 for (i = 0; i < numkeys; i++) {
6561 if (mp->mp_ptrs[i] <= ptr)
6562 mp->mp_ptrs[i] += delta;
6565 base = (char *)mp + mp->mp_upper;
6566 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
6567 mp->mp_upper += delta;
6570 /** Initial setup of a sorted-dups cursor.
6571 * Sorted duplicates are implemented as a sub-database for the given key.
6572 * The duplicate data items are actually keys of the sub-database.
6573 * Operations on the duplicate data items are performed using a sub-cursor
6574 * initialized when the sub-database is first accessed. This function does
6575 * the preliminary setup of the sub-cursor, filling in the fields that
6576 * depend only on the parent DB.
6577 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
6580 mdb_xcursor_init0(MDB_cursor *mc)
6582 MDB_xcursor *mx = mc->mc_xcursor;
6584 mx->mx_cursor.mc_xcursor = NULL;
6585 mx->mx_cursor.mc_txn = mc->mc_txn;
6586 mx->mx_cursor.mc_db = &mx->mx_db;
6587 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
6588 mx->mx_cursor.mc_dbi = mc->mc_dbi;
6589 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
6590 mx->mx_cursor.mc_snum = 0;
6591 mx->mx_cursor.mc_top = 0;
6592 mx->mx_cursor.mc_flags = C_SUB;
6593 mx->mx_dbx.md_name.mv_size = 0;
6594 mx->mx_dbx.md_name.mv_data = NULL;
6595 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
6596 mx->mx_dbx.md_dcmp = NULL;
6597 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
6600 /** Final setup of a sorted-dups cursor.
6601 * Sets up the fields that depend on the data from the main cursor.
6602 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
6603 * @param[in] node The data containing the #MDB_db record for the
6604 * sorted-dup database.
6607 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
6609 MDB_xcursor *mx = mc->mc_xcursor;
6611 if (node->mn_flags & F_SUBDATA) {
6612 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
6613 mx->mx_cursor.mc_pg[0] = 0;
6614 mx->mx_cursor.mc_snum = 0;
6615 mx->mx_cursor.mc_top = 0;
6616 mx->mx_cursor.mc_flags = C_SUB;
6618 MDB_page *fp = NODEDATA(node);
6619 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
6620 mx->mx_db.md_flags = 0;
6621 mx->mx_db.md_depth = 1;
6622 mx->mx_db.md_branch_pages = 0;
6623 mx->mx_db.md_leaf_pages = 1;
6624 mx->mx_db.md_overflow_pages = 0;
6625 mx->mx_db.md_entries = NUMKEYS(fp);
6626 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
6627 mx->mx_cursor.mc_snum = 1;
6628 mx->mx_cursor.mc_top = 0;
6629 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
6630 mx->mx_cursor.mc_pg[0] = fp;
6631 mx->mx_cursor.mc_ki[0] = 0;
6632 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
6633 mx->mx_db.md_flags = MDB_DUPFIXED;
6634 mx->mx_db.md_pad = fp->mp_pad;
6635 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
6636 mx->mx_db.md_flags |= MDB_INTEGERKEY;
6639 DPRINTF(("Sub-db -%u root page %"Z"u", mx->mx_cursor.mc_dbi,
6640 mx->mx_db.md_root));
6641 mx->mx_dbflag = DB_VALID|DB_DIRTY; /* DB_DIRTY guides mdb_cursor_touch */
6642 #if UINT_MAX < SIZE_MAX
6643 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
6644 #ifdef MISALIGNED_OK
6645 mx->mx_dbx.md_cmp = mdb_cmp_long;
6647 mx->mx_dbx.md_cmp = mdb_cmp_cint;
6652 /** Initialize a cursor for a given transaction and database. */
6654 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
6657 mc->mc_backup = NULL;
6660 mc->mc_db = &txn->mt_dbs[dbi];
6661 mc->mc_dbx = &txn->mt_dbxs[dbi];
6662 mc->mc_dbflag = &txn->mt_dbflags[dbi];
6667 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
6669 mc->mc_xcursor = mx;
6670 mdb_xcursor_init0(mc);
6672 mc->mc_xcursor = NULL;
6674 if (*mc->mc_dbflag & DB_STALE) {
6675 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
6680 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
6683 size_t size = sizeof(MDB_cursor);
6685 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
6688 if (txn->mt_flags & MDB_TXN_ERROR)
6691 /* Allow read access to the freelist */
6692 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
6695 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
6696 size += sizeof(MDB_xcursor);
6698 if ((mc = malloc(size)) != NULL) {
6699 mdb_cursor_init(mc, txn, dbi, (MDB_xcursor *)(mc + 1));
6700 if (txn->mt_cursors) {
6701 mc->mc_next = txn->mt_cursors[dbi];
6702 txn->mt_cursors[dbi] = mc;
6703 mc->mc_flags |= C_UNTRACK;
6715 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
6717 if (txn == NULL || mc == NULL || mc->mc_dbi >= txn->mt_numdbs)
6720 if ((mc->mc_flags & C_UNTRACK) || txn->mt_cursors)
6723 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
6727 /* Return the count of duplicate data items for the current key */
6729 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
6733 if (mc == NULL || countp == NULL)
6736 if (mc->mc_xcursor == NULL)
6737 return MDB_INCOMPATIBLE;
6739 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
6740 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
6743 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
6746 *countp = mc->mc_xcursor->mx_db.md_entries;
6752 mdb_cursor_close(MDB_cursor *mc)
6754 if (mc && !mc->mc_backup) {
6755 /* remove from txn, if tracked */
6756 if ((mc->mc_flags & C_UNTRACK) && mc->mc_txn->mt_cursors) {
6757 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
6758 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
6760 *prev = mc->mc_next;
6767 mdb_cursor_txn(MDB_cursor *mc)
6769 if (!mc) return NULL;
6774 mdb_cursor_dbi(MDB_cursor *mc)
6780 /** Replace the key for a branch node with a new key.
6781 * @param[in] mc Cursor pointing to the node to operate on.
6782 * @param[in] key The new key to use.
6783 * @return 0 on success, non-zero on failure.
6786 mdb_update_key(MDB_cursor *mc, MDB_val *key)
6792 int delta, ksize, oksize;
6793 indx_t ptr, i, numkeys, indx;
6796 indx = mc->mc_ki[mc->mc_top];
6797 mp = mc->mc_pg[mc->mc_top];
6798 node = NODEPTR(mp, indx);
6799 ptr = mp->mp_ptrs[indx];
6803 char kbuf2[DKBUF_MAXKEYSIZE*2+1];
6804 k2.mv_data = NODEKEY(node);
6805 k2.mv_size = node->mn_ksize;
6806 DPRINTF(("update key %u (ofs %u) [%s] to [%s] on page %"Z"u",
6808 mdb_dkey(&k2, kbuf2),
6814 /* Sizes must be 2-byte aligned. */
6815 ksize = EVEN(key->mv_size);
6816 oksize = EVEN(node->mn_ksize);
6817 delta = ksize - oksize;
6819 /* Shift node contents if EVEN(key length) changed. */
6821 if (delta > 0 && SIZELEFT(mp) < delta) {
6823 /* not enough space left, do a delete and split */
6824 DPRINTF(("Not enough room, delta = %d, splitting...", delta));
6825 pgno = NODEPGNO(node);
6826 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
6827 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
6830 numkeys = NUMKEYS(mp);
6831 for (i = 0; i < numkeys; i++) {
6832 if (mp->mp_ptrs[i] <= ptr)
6833 mp->mp_ptrs[i] -= delta;
6836 base = (char *)mp + mp->mp_upper;
6837 len = ptr - mp->mp_upper + NODESIZE;
6838 memmove(base - delta, base, len);
6839 mp->mp_upper -= delta;
6841 node = NODEPTR(mp, indx);
6844 /* But even if no shift was needed, update ksize */
6845 if (node->mn_ksize != key->mv_size)
6846 node->mn_ksize = key->mv_size;
6849 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
6855 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
6857 /** Move a node from csrc to cdst.
6860 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
6867 unsigned short flags;
6871 /* Mark src and dst as dirty. */
6872 if ((rc = mdb_page_touch(csrc)) ||
6873 (rc = mdb_page_touch(cdst)))
6876 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6877 key.mv_size = csrc->mc_db->md_pad;
6878 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6880 data.mv_data = NULL;
6884 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
6885 assert(!((size_t)srcnode&1));
6886 srcpg = NODEPGNO(srcnode);
6887 flags = srcnode->mn_flags;
6888 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6889 unsigned int snum = csrc->mc_snum;
6891 /* must find the lowest key below src */
6892 mdb_page_search_lowest(csrc);
6893 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6894 key.mv_size = csrc->mc_db->md_pad;
6895 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6897 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6898 key.mv_size = NODEKSZ(s2);
6899 key.mv_data = NODEKEY(s2);
6901 csrc->mc_snum = snum--;
6902 csrc->mc_top = snum;
6904 key.mv_size = NODEKSZ(srcnode);
6905 key.mv_data = NODEKEY(srcnode);
6907 data.mv_size = NODEDSZ(srcnode);
6908 data.mv_data = NODEDATA(srcnode);
6910 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
6911 unsigned int snum = cdst->mc_snum;
6914 /* must find the lowest key below dst */
6915 mdb_page_search_lowest(cdst);
6916 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
6917 bkey.mv_size = cdst->mc_db->md_pad;
6918 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
6920 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6921 bkey.mv_size = NODEKSZ(s2);
6922 bkey.mv_data = NODEKEY(s2);
6924 cdst->mc_snum = snum--;
6925 cdst->mc_top = snum;
6926 mdb_cursor_copy(cdst, &mn);
6928 rc = mdb_update_key(&mn, &bkey);
6933 DPRINTF(("moving %s node %u [%s] on page %"Z"u to node %u on page %"Z"u",
6934 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
6935 csrc->mc_ki[csrc->mc_top],
6937 csrc->mc_pg[csrc->mc_top]->mp_pgno,
6938 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno));
6940 /* Add the node to the destination page.
6942 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
6943 if (rc != MDB_SUCCESS)
6946 /* Delete the node from the source page.
6948 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6951 /* Adjust other cursors pointing to mp */
6952 MDB_cursor *m2, *m3;
6953 MDB_dbi dbi = csrc->mc_dbi;
6954 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
6956 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6957 if (csrc->mc_flags & C_SUB)
6958 m3 = &m2->mc_xcursor->mx_cursor;
6961 if (m3 == csrc) continue;
6962 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
6963 csrc->mc_ki[csrc->mc_top]) {
6964 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
6965 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
6970 /* Update the parent separators.
6972 if (csrc->mc_ki[csrc->mc_top] == 0) {
6973 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
6974 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6975 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6977 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6978 key.mv_size = NODEKSZ(srcnode);
6979 key.mv_data = NODEKEY(srcnode);
6981 DPRINTF(("update separator for source page %"Z"u to [%s]",
6982 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key)));
6983 mdb_cursor_copy(csrc, &mn);
6986 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6989 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6991 indx_t ix = csrc->mc_ki[csrc->mc_top];
6992 nullkey.mv_size = 0;
6993 csrc->mc_ki[csrc->mc_top] = 0;
6994 rc = mdb_update_key(csrc, &nullkey);
6995 csrc->mc_ki[csrc->mc_top] = ix;
6996 assert(rc == MDB_SUCCESS);
7000 if (cdst->mc_ki[cdst->mc_top] == 0) {
7001 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
7002 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7003 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
7005 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
7006 key.mv_size = NODEKSZ(srcnode);
7007 key.mv_data = NODEKEY(srcnode);
7009 DPRINTF(("update separator for destination page %"Z"u to [%s]",
7010 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key)));
7011 mdb_cursor_copy(cdst, &mn);
7014 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
7017 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
7019 indx_t ix = cdst->mc_ki[cdst->mc_top];
7020 nullkey.mv_size = 0;
7021 cdst->mc_ki[cdst->mc_top] = 0;
7022 rc = mdb_update_key(cdst, &nullkey);
7023 cdst->mc_ki[cdst->mc_top] = ix;
7024 assert(rc == MDB_SUCCESS);
7031 /** Merge one page into another.
7032 * The nodes from the page pointed to by \b csrc will
7033 * be copied to the page pointed to by \b cdst and then
7034 * the \b csrc page will be freed.
7035 * @param[in] csrc Cursor pointing to the source page.
7036 * @param[in] cdst Cursor pointing to the destination page.
7039 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
7047 DPRINTF(("merging page %"Z"u into %"Z"u", csrc->mc_pg[csrc->mc_top]->mp_pgno,
7048 cdst->mc_pg[cdst->mc_top]->mp_pgno));
7050 assert(csrc->mc_snum > 1); /* can't merge root page */
7051 assert(cdst->mc_snum > 1);
7053 /* Mark dst as dirty. */
7054 if ((rc = mdb_page_touch(cdst)))
7057 /* Move all nodes from src to dst.
7059 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
7060 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7061 key.mv_size = csrc->mc_db->md_pad;
7062 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
7063 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
7064 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
7065 if (rc != MDB_SUCCESS)
7067 key.mv_data = (char *)key.mv_data + key.mv_size;
7070 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
7071 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
7072 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
7073 unsigned int snum = csrc->mc_snum;
7075 /* must find the lowest key below src */
7076 mdb_page_search_lowest(csrc);
7077 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
7078 key.mv_size = csrc->mc_db->md_pad;
7079 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
7081 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
7082 key.mv_size = NODEKSZ(s2);
7083 key.mv_data = NODEKEY(s2);
7085 csrc->mc_snum = snum--;
7086 csrc->mc_top = snum;
7088 key.mv_size = srcnode->mn_ksize;
7089 key.mv_data = NODEKEY(srcnode);
7092 data.mv_size = NODEDSZ(srcnode);
7093 data.mv_data = NODEDATA(srcnode);
7094 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
7095 if (rc != MDB_SUCCESS)
7100 DPRINTF(("dst page %"Z"u now has %u keys (%.1f%% filled)",
7101 cdst->mc_pg[cdst->mc_top]->mp_pgno, NUMKEYS(cdst->mc_pg[cdst->mc_top]),
7102 (float)PAGEFILL(cdst->mc_txn->mt_env, cdst->mc_pg[cdst->mc_top]) / 10));
7104 /* Unlink the src page from parent and add to free list.
7106 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
7107 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
7110 rc = mdb_update_key(csrc, &key);
7116 rc = mdb_midl_append(&csrc->mc_txn->mt_free_pgs,
7117 csrc->mc_pg[csrc->mc_top]->mp_pgno);
7120 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
7121 csrc->mc_db->md_leaf_pages--;
7123 csrc->mc_db->md_branch_pages--;
7125 /* Adjust other cursors pointing to mp */
7126 MDB_cursor *m2, *m3;
7127 MDB_dbi dbi = csrc->mc_dbi;
7128 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
7130 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7131 if (csrc->mc_flags & C_SUB)
7132 m3 = &m2->mc_xcursor->mx_cursor;
7135 if (m3 == csrc) continue;
7136 if (m3->mc_snum < csrc->mc_snum) continue;
7137 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
7138 m3->mc_pg[csrc->mc_top] = mp;
7139 m3->mc_ki[csrc->mc_top] += nkeys;
7143 mdb_cursor_pop(csrc);
7145 return mdb_rebalance(csrc);
7148 /** Copy the contents of a cursor.
7149 * @param[in] csrc The cursor to copy from.
7150 * @param[out] cdst The cursor to copy to.
7153 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
7157 cdst->mc_txn = csrc->mc_txn;
7158 cdst->mc_dbi = csrc->mc_dbi;
7159 cdst->mc_db = csrc->mc_db;
7160 cdst->mc_dbx = csrc->mc_dbx;
7161 cdst->mc_snum = csrc->mc_snum;
7162 cdst->mc_top = csrc->mc_top;
7163 cdst->mc_flags = csrc->mc_flags;
7165 for (i=0; i<csrc->mc_snum; i++) {
7166 cdst->mc_pg[i] = csrc->mc_pg[i];
7167 cdst->mc_ki[i] = csrc->mc_ki[i];
7171 /** Rebalance the tree after a delete operation.
7172 * @param[in] mc Cursor pointing to the page where rebalancing
7174 * @return 0 on success, non-zero on failure.
7177 mdb_rebalance(MDB_cursor *mc)
7181 unsigned int ptop, minkeys;
7184 minkeys = 1 + (IS_BRANCH(mc->mc_pg[mc->mc_top]));
7188 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
7189 DPRINTF(("rebalancing %s page %"Z"u (has %u keys, %.1f%% full)",
7190 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
7191 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]),
7192 (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10));
7196 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD &&
7197 NUMKEYS(mc->mc_pg[mc->mc_top]) >= minkeys) {
7200 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
7201 DPRINTF(("no need to rebalance page %"Z"u, above fill threshold",
7207 if (mc->mc_snum < 2) {
7208 MDB_page *mp = mc->mc_pg[0];
7210 DPUTS("Can't rebalance a subpage, ignoring");
7213 if (NUMKEYS(mp) == 0) {
7214 DPUTS("tree is completely empty");
7215 mc->mc_db->md_root = P_INVALID;
7216 mc->mc_db->md_depth = 0;
7217 mc->mc_db->md_leaf_pages = 0;
7218 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7221 /* Adjust cursors pointing to mp */
7224 mc->mc_flags &= ~C_INITIALIZED;
7226 MDB_cursor *m2, *m3;
7227 MDB_dbi dbi = mc->mc_dbi;
7229 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7230 if (mc->mc_flags & C_SUB)
7231 m3 = &m2->mc_xcursor->mx_cursor;
7234 if (m3->mc_snum < mc->mc_snum) continue;
7235 if (m3->mc_pg[0] == mp) {
7238 m3->mc_flags &= ~C_INITIALIZED;
7242 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
7243 DPUTS("collapsing root page!");
7244 rc = mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
7247 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
7248 rc = mdb_page_get(mc->mc_txn,mc->mc_db->md_root,&mc->mc_pg[0],NULL);
7251 mc->mc_db->md_depth--;
7252 mc->mc_db->md_branch_pages--;
7253 mc->mc_ki[0] = mc->mc_ki[1];
7255 /* Adjust other cursors pointing to mp */
7256 MDB_cursor *m2, *m3;
7257 MDB_dbi dbi = mc->mc_dbi;
7259 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7260 if (mc->mc_flags & C_SUB)
7261 m3 = &m2->mc_xcursor->mx_cursor;
7264 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
7265 if (m3->mc_pg[0] == mp) {
7269 for (i=0; i<m3->mc_snum; i++) {
7270 m3->mc_pg[i] = m3->mc_pg[i+1];
7271 m3->mc_ki[i] = m3->mc_ki[i+1];
7277 DPUTS("root page doesn't need rebalancing");
7281 /* The parent (branch page) must have at least 2 pointers,
7282 * otherwise the tree is invalid.
7284 ptop = mc->mc_top-1;
7285 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
7287 /* Leaf page fill factor is below the threshold.
7288 * Try to move keys from left or right neighbor, or
7289 * merge with a neighbor page.
7294 mdb_cursor_copy(mc, &mn);
7295 mn.mc_xcursor = NULL;
7297 if (mc->mc_ki[ptop] == 0) {
7298 /* We're the leftmost leaf in our parent.
7300 DPUTS("reading right neighbor");
7302 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7303 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7306 mn.mc_ki[mn.mc_top] = 0;
7307 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
7309 /* There is at least one neighbor to the left.
7311 DPUTS("reading left neighbor");
7313 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
7314 rc = mdb_page_get(mc->mc_txn,NODEPGNO(node),&mn.mc_pg[mn.mc_top],NULL);
7317 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
7318 mc->mc_ki[mc->mc_top] = 0;
7321 DPRINTF(("found neighbor page %"Z"u (%u keys, %.1f%% full)",
7322 mn.mc_pg[mn.mc_top]->mp_pgno, NUMKEYS(mn.mc_pg[mn.mc_top]),
7323 (float)PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) / 10));
7325 /* If the neighbor page is above threshold and has enough keys,
7326 * move one key from it. Otherwise we should try to merge them.
7327 * (A branch page must never have less than 2 keys.)
7329 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
7330 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys)
7331 return mdb_node_move(&mn, mc);
7333 if (mc->mc_ki[ptop] == 0)
7334 rc = mdb_page_merge(&mn, mc);
7336 mn.mc_ki[mn.mc_top] += mc->mc_ki[mn.mc_top] + 1;
7337 rc = mdb_page_merge(mc, &mn);
7338 mdb_cursor_copy(&mn, mc);
7340 mc->mc_flags &= ~(C_INITIALIZED|C_EOF);
7345 /** Complete a delete operation started by #mdb_cursor_del(). */
7347 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
7354 mp = mc->mc_pg[mc->mc_top];
7355 ki = mc->mc_ki[mc->mc_top];
7357 /* add overflow pages to free list */
7358 if (!IS_LEAF2(mp) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
7362 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
7363 if ((rc = mdb_page_get(mc->mc_txn, pg, &omp, NULL)) ||
7364 (rc = mdb_ovpage_free(mc, omp)))
7367 mdb_node_del(mp, ki, mc->mc_db->md_pad);
7368 mc->mc_db->md_entries--;
7369 rc = mdb_rebalance(mc);
7370 if (rc != MDB_SUCCESS)
7371 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
7374 MDB_dbi dbi = mc->mc_dbi;
7376 mp = mc->mc_pg[mc->mc_top];
7377 nkeys = NUMKEYS(mp);
7379 /* if mc points past last node in page, find next sibling */
7380 if (mc->mc_ki[mc->mc_top] >= nkeys)
7381 mdb_cursor_sibling(mc, 1);
7383 /* Adjust other cursors pointing to mp */
7384 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7385 if (m2 == mc || m2->mc_snum < mc->mc_snum)
7387 if (!(m2->mc_flags & C_INITIALIZED))
7389 if (m2->mc_pg[mc->mc_top] == mp) {
7390 if (m2->mc_ki[mc->mc_top] >= ki) {
7391 m2->mc_flags |= C_DEL;
7392 if (m2->mc_ki[mc->mc_top] > ki)
7393 m2->mc_ki[mc->mc_top]--;
7395 if (m2->mc_ki[mc->mc_top] >= nkeys)
7396 mdb_cursor_sibling(m2, 1);
7399 mc->mc_flags |= C_DEL;
7406 mdb_del(MDB_txn *txn, MDB_dbi dbi,
7407 MDB_val *key, MDB_val *data)
7412 MDB_val rdata, *xdata;
7416 assert(key != NULL);
7418 DPRINTF(("====> delete db %u key [%s]", dbi, DKEY(key)));
7420 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7423 if (txn->mt_flags & (MDB_TXN_RDONLY|MDB_TXN_ERROR))
7424 return (txn->mt_flags & MDB_TXN_RDONLY) ? EACCES : MDB_BAD_TXN;
7426 mdb_cursor_init(&mc, txn, dbi, &mx);
7429 if (!F_ISSET(txn->mt_dbs[dbi].md_flags, MDB_DUPSORT)) {
7430 /* must ignore any data */
7441 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
7443 /* let mdb_page_split know about this cursor if needed:
7444 * delete will trigger a rebalance; if it needs to move
7445 * a node from one page to another, it will have to
7446 * update the parent's separator key(s). If the new sepkey
7447 * is larger than the current one, the parent page may
7448 * run out of space, triggering a split. We need this
7449 * cursor to be consistent until the end of the rebalance.
7451 mc.mc_flags |= C_UNTRACK;
7452 mc.mc_next = txn->mt_cursors[dbi];
7453 txn->mt_cursors[dbi] = &mc;
7454 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
7455 txn->mt_cursors[dbi] = mc.mc_next;
7460 /** Split a page and insert a new node.
7461 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
7462 * The cursor will be updated to point to the actual page and index where
7463 * the node got inserted after the split.
7464 * @param[in] newkey The key for the newly inserted node.
7465 * @param[in] newdata The data for the newly inserted node.
7466 * @param[in] newpgno The page number, if the new node is a branch node.
7467 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
7468 * @return 0 on success, non-zero on failure.
7471 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
7472 unsigned int nflags)
7475 int rc = MDB_SUCCESS, new_root = 0, did_split = 0;
7478 int i, j, split_indx, nkeys, pmax;
7479 MDB_env *env = mc->mc_txn->mt_env;
7481 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
7482 MDB_page *copy = NULL;
7483 MDB_page *mp, *rp, *pp;
7488 mp = mc->mc_pg[mc->mc_top];
7489 newindx = mc->mc_ki[mc->mc_top];
7490 nkeys = NUMKEYS(mp);
7492 DPRINTF(("-----> splitting %s page %"Z"u and adding [%s] at index %i/%i",
7493 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
7494 DKEY(newkey), mc->mc_ki[mc->mc_top], nkeys));
7496 /* Create a right sibling. */
7497 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
7499 DPRINTF(("new right sibling: page %"Z"u", rp->mp_pgno));
7501 if (mc->mc_snum < 2) {
7502 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
7504 /* shift current top to make room for new parent */
7505 mc->mc_pg[1] = mc->mc_pg[0];
7506 mc->mc_ki[1] = mc->mc_ki[0];
7509 mc->mc_db->md_root = pp->mp_pgno;
7510 DPRINTF(("root split! new root = %"Z"u", pp->mp_pgno));
7511 mc->mc_db->md_depth++;
7514 /* Add left (implicit) pointer. */
7515 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
7516 /* undo the pre-push */
7517 mc->mc_pg[0] = mc->mc_pg[1];
7518 mc->mc_ki[0] = mc->mc_ki[1];
7519 mc->mc_db->md_root = mp->mp_pgno;
7520 mc->mc_db->md_depth--;
7527 ptop = mc->mc_top-1;
7528 DPRINTF(("parent branch page is %"Z"u", mc->mc_pg[ptop]->mp_pgno));
7531 mc->mc_flags |= C_SPLITTING;
7532 mdb_cursor_copy(mc, &mn);
7533 mn.mc_pg[mn.mc_top] = rp;
7534 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
7536 if (nflags & MDB_APPEND) {
7537 mn.mc_ki[mn.mc_top] = 0;
7539 split_indx = newindx;
7543 split_indx = (nkeys+1) / 2;
7548 unsigned int lsize, rsize, ksize;
7549 /* Move half of the keys to the right sibling */
7551 x = mc->mc_ki[mc->mc_top] - split_indx;
7552 ksize = mc->mc_db->md_pad;
7553 split = LEAF2KEY(mp, split_indx, ksize);
7554 rsize = (nkeys - split_indx) * ksize;
7555 lsize = (nkeys - split_indx) * sizeof(indx_t);
7556 mp->mp_lower -= lsize;
7557 rp->mp_lower += lsize;
7558 mp->mp_upper += rsize - lsize;
7559 rp->mp_upper -= rsize - lsize;
7560 sepkey.mv_size = ksize;
7561 if (newindx == split_indx) {
7562 sepkey.mv_data = newkey->mv_data;
7564 sepkey.mv_data = split;
7567 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
7568 memcpy(rp->mp_ptrs, split, rsize);
7569 sepkey.mv_data = rp->mp_ptrs;
7570 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
7571 memcpy(ins, newkey->mv_data, ksize);
7572 mp->mp_lower += sizeof(indx_t);
7573 mp->mp_upper -= ksize - sizeof(indx_t);
7576 memcpy(rp->mp_ptrs, split, x * ksize);
7577 ins = LEAF2KEY(rp, x, ksize);
7578 memcpy(ins, newkey->mv_data, ksize);
7579 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
7580 rp->mp_lower += sizeof(indx_t);
7581 rp->mp_upper -= ksize - sizeof(indx_t);
7582 mc->mc_ki[mc->mc_top] = x;
7583 mc->mc_pg[mc->mc_top] = rp;
7586 int psize, nsize, k;
7587 /* Maximum free space in an empty page */
7588 pmax = env->me_psize - PAGEHDRSZ;
7590 nsize = mdb_leaf_size(env, newkey, newdata);
7592 nsize = mdb_branch_size(env, newkey);
7593 nsize = EVEN(nsize);
7595 /* grab a page to hold a temporary copy */
7596 copy = mdb_page_malloc(mc->mc_txn, 1);
7599 copy->mp_pgno = mp->mp_pgno;
7600 copy->mp_flags = mp->mp_flags;
7601 copy->mp_lower = PAGEHDRSZ;
7602 copy->mp_upper = env->me_psize;
7604 /* prepare to insert */
7605 for (i=0, j=0; i<nkeys; i++) {
7607 copy->mp_ptrs[j++] = 0;
7609 copy->mp_ptrs[j++] = mp->mp_ptrs[i];
7612 /* When items are relatively large the split point needs
7613 * to be checked, because being off-by-one will make the
7614 * difference between success or failure in mdb_node_add.
7616 * It's also relevant if a page happens to be laid out
7617 * such that one half of its nodes are all "small" and
7618 * the other half of its nodes are "large." If the new
7619 * item is also "large" and falls on the half with
7620 * "large" nodes, it also may not fit.
7622 * As a final tweak, if the new item goes on the last
7623 * spot on the page (and thus, onto the new page), bias
7624 * the split so the new page is emptier than the old page.
7625 * This yields better packing during sequential inserts.
7627 if (nkeys < 20 || nsize > pmax/16 || newindx >= nkeys) {
7628 /* Find split point */
7630 if (newindx <= split_indx || newindx >= nkeys) {
7632 k = newindx >= nkeys ? nkeys : split_indx+2;
7637 for (; i!=k; i+=j) {
7642 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i]);
7643 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
7645 if (F_ISSET(node->mn_flags, F_BIGDATA))
7646 psize += sizeof(pgno_t);
7648 psize += NODEDSZ(node);
7650 psize = EVEN(psize);
7652 if (psize > pmax || i == k-j) {
7653 split_indx = i + (j<0);
7658 if (split_indx == newindx) {
7659 sepkey.mv_size = newkey->mv_size;
7660 sepkey.mv_data = newkey->mv_data;
7662 node = (MDB_node *)((char *)mp + copy->mp_ptrs[split_indx]);
7663 sepkey.mv_size = node->mn_ksize;
7664 sepkey.mv_data = NODEKEY(node);
7669 DPRINTF(("separator is %d [%s]", split_indx, DKEY(&sepkey)));
7671 /* Copy separator key to the parent.
7673 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(env, &sepkey)) {
7677 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
7680 if (mn.mc_snum == mc->mc_snum) {
7681 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
7682 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
7683 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
7684 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
7689 /* Right page might now have changed parent.
7690 * Check if left page also changed parent.
7692 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
7693 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
7694 for (i=0; i<ptop; i++) {
7695 mc->mc_pg[i] = mn.mc_pg[i];
7696 mc->mc_ki[i] = mn.mc_ki[i];
7698 mc->mc_pg[ptop] = mn.mc_pg[ptop];
7699 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
7703 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
7706 mc->mc_flags ^= C_SPLITTING;
7707 if (rc != MDB_SUCCESS) {
7710 if (nflags & MDB_APPEND) {
7711 mc->mc_pg[mc->mc_top] = rp;
7712 mc->mc_ki[mc->mc_top] = 0;
7713 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
7716 for (i=0; i<mc->mc_top; i++)
7717 mc->mc_ki[i] = mn.mc_ki[i];
7718 } else if (!IS_LEAF2(mp)) {
7720 mc->mc_pg[mc->mc_top] = rp;
7725 rkey.mv_data = newkey->mv_data;
7726 rkey.mv_size = newkey->mv_size;
7732 /* Update index for the new key. */
7733 mc->mc_ki[mc->mc_top] = j;
7735 node = (MDB_node *)((char *)mp + copy->mp_ptrs[i]);
7736 rkey.mv_data = NODEKEY(node);
7737 rkey.mv_size = node->mn_ksize;
7739 xdata.mv_data = NODEDATA(node);
7740 xdata.mv_size = NODEDSZ(node);
7743 pgno = NODEPGNO(node);
7744 flags = node->mn_flags;
7747 if (!IS_LEAF(mp) && j == 0) {
7748 /* First branch index doesn't need key data. */
7752 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
7754 /* return tmp page to freelist */
7755 mdb_page_free(env, copy);
7761 mc->mc_pg[mc->mc_top] = copy;
7766 } while (i != split_indx);
7768 nkeys = NUMKEYS(copy);
7769 for (i=0; i<nkeys; i++)
7770 mp->mp_ptrs[i] = copy->mp_ptrs[i];
7771 mp->mp_lower = copy->mp_lower;
7772 mp->mp_upper = copy->mp_upper;
7773 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
7774 env->me_psize - copy->mp_upper);
7776 /* reset back to original page */
7777 if (newindx < split_indx) {
7778 mc->mc_pg[mc->mc_top] = mp;
7779 if (nflags & MDB_RESERVE) {
7780 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
7781 if (!(node->mn_flags & F_BIGDATA))
7782 newdata->mv_data = NODEDATA(node);
7785 mc->mc_pg[mc->mc_top] = rp;
7787 /* Make sure mc_ki is still valid.
7789 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
7790 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
7791 for (i=0; i<ptop; i++) {
7792 mc->mc_pg[i] = mn.mc_pg[i];
7793 mc->mc_ki[i] = mn.mc_ki[i];
7795 mc->mc_pg[ptop] = mn.mc_pg[ptop];
7796 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
7799 /* return tmp page to freelist */
7800 mdb_page_free(env, copy);
7804 /* Adjust other cursors pointing to mp */
7805 MDB_cursor *m2, *m3;
7806 MDB_dbi dbi = mc->mc_dbi;
7807 int fixup = NUMKEYS(mp);
7809 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
7810 if (mc->mc_flags & C_SUB)
7811 m3 = &m2->mc_xcursor->mx_cursor;
7816 if (!(m2->mc_flags & m3->mc_flags & C_INITIALIZED))
7818 if (m3->mc_flags & C_SPLITTING)
7823 for (k=m3->mc_top; k>=0; k--) {
7824 m3->mc_ki[k+1] = m3->mc_ki[k];
7825 m3->mc_pg[k+1] = m3->mc_pg[k];
7827 if (m3->mc_ki[0] >= split_indx) {
7832 m3->mc_pg[0] = mc->mc_pg[0];
7836 if (m3->mc_top >= mc->mc_top && m3->mc_pg[mc->mc_top] == mp) {
7837 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
7838 m3->mc_ki[mc->mc_top]++;
7839 if (m3->mc_ki[mc->mc_top] >= fixup) {
7840 m3->mc_pg[mc->mc_top] = rp;
7841 m3->mc_ki[mc->mc_top] -= fixup;
7842 m3->mc_ki[ptop] = mn.mc_ki[ptop];
7844 } else if (!did_split && m3->mc_top >= ptop && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
7845 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
7850 DPRINTF(("mp left: %d, rp left: %d", SIZELEFT(mp), SIZELEFT(rp)));
7855 mdb_put(MDB_txn *txn, MDB_dbi dbi,
7856 MDB_val *key, MDB_val *data, unsigned int flags)
7861 assert(key != NULL);
7862 assert(data != NULL);
7864 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
7867 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND|MDB_APPENDDUP)) != flags)
7870 mdb_cursor_init(&mc, txn, dbi, &mx);
7871 return mdb_cursor_put(&mc, key, data, flags);
7875 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
7877 if ((flag & CHANGEABLE) != flag)
7880 env->me_flags |= flag;
7882 env->me_flags &= ~flag;
7887 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
7892 *arg = env->me_flags;
7897 mdb_env_get_path(MDB_env *env, const char **arg)
7902 *arg = env->me_path;
7907 mdb_env_get_fd(MDB_env *env, mdb_filehandle_t *arg)
7916 /** Common code for #mdb_stat() and #mdb_env_stat().
7917 * @param[in] env the environment to operate in.
7918 * @param[in] db the #MDB_db record containing the stats to return.
7919 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
7920 * @return 0, this function always succeeds.
7923 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
7925 arg->ms_psize = env->me_psize;
7926 arg->ms_depth = db->md_depth;
7927 arg->ms_branch_pages = db->md_branch_pages;
7928 arg->ms_leaf_pages = db->md_leaf_pages;
7929 arg->ms_overflow_pages = db->md_overflow_pages;
7930 arg->ms_entries = db->md_entries;
7935 mdb_env_stat(MDB_env *env, MDB_stat *arg)
7939 if (env == NULL || arg == NULL)
7942 toggle = mdb_env_pick_meta(env);
7944 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
7948 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
7952 if (env == NULL || arg == NULL)
7955 toggle = mdb_env_pick_meta(env);
7956 arg->me_mapaddr = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : 0;
7957 arg->me_mapsize = env->me_mapsize;
7958 arg->me_maxreaders = env->me_maxreaders;
7960 /* me_numreaders may be zero if this process never used any readers. Use
7961 * the shared numreader count if it exists.
7963 arg->me_numreaders = env->me_txns ? env->me_txns->mti_numreaders : env->me_numreaders;
7965 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
7966 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
7970 /** Set the default comparison functions for a database.
7971 * Called immediately after a database is opened to set the defaults.
7972 * The user can then override them with #mdb_set_compare() or
7973 * #mdb_set_dupsort().
7974 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
7975 * @param[in] dbi A database handle returned by #mdb_dbi_open()
7978 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
7980 uint16_t f = txn->mt_dbs[dbi].md_flags;
7982 txn->mt_dbxs[dbi].md_cmp =
7983 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
7984 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
7986 txn->mt_dbxs[dbi].md_dcmp =
7987 !(f & MDB_DUPSORT) ? 0 :
7988 ((f & MDB_INTEGERDUP)
7989 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
7990 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
7993 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
7998 int rc, dbflag, exact;
7999 unsigned int unused = 0;
8002 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
8003 mdb_default_cmp(txn, FREE_DBI);
8006 if ((flags & VALID_FLAGS) != flags)
8008 if (txn->mt_flags & MDB_TXN_ERROR)
8014 if (flags & PERSISTENT_FLAGS) {
8015 uint16_t f2 = flags & PERSISTENT_FLAGS;
8016 /* make sure flag changes get committed */
8017 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
8018 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
8019 txn->mt_flags |= MDB_TXN_DIRTY;
8022 mdb_default_cmp(txn, MAIN_DBI);
8026 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
8027 mdb_default_cmp(txn, MAIN_DBI);
8030 /* Is the DB already open? */
8032 for (i=2; i<txn->mt_numdbs; i++) {
8033 if (!txn->mt_dbxs[i].md_name.mv_size) {
8034 /* Remember this free slot */
8035 if (!unused) unused = i;
8038 if (len == txn->mt_dbxs[i].md_name.mv_size &&
8039 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
8045 /* If no free slot and max hit, fail */
8046 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
8047 return MDB_DBS_FULL;
8049 /* Cannot mix named databases with some mainDB flags */
8050 if (txn->mt_dbs[MAIN_DBI].md_flags & (MDB_DUPSORT|MDB_INTEGERKEY))
8051 return (flags & MDB_CREATE) ? MDB_INCOMPATIBLE : MDB_NOTFOUND;
8053 /* Find the DB info */
8054 dbflag = DB_NEW|DB_VALID;
8057 key.mv_data = (void *)name;
8058 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
8059 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
8060 if (rc == MDB_SUCCESS) {
8061 /* make sure this is actually a DB */
8062 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
8063 if (!(node->mn_flags & F_SUBDATA))
8064 return MDB_INCOMPATIBLE;
8065 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
8066 /* Create if requested */
8068 data.mv_size = sizeof(MDB_db);
8069 data.mv_data = &dummy;
8070 memset(&dummy, 0, sizeof(dummy));
8071 dummy.md_root = P_INVALID;
8072 dummy.md_flags = flags & PERSISTENT_FLAGS;
8073 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
8077 /* OK, got info, add to table */
8078 if (rc == MDB_SUCCESS) {
8079 unsigned int slot = unused ? unused : txn->mt_numdbs;
8080 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
8081 txn->mt_dbxs[slot].md_name.mv_size = len;
8082 txn->mt_dbxs[slot].md_rel = NULL;
8083 txn->mt_dbflags[slot] = dbflag;
8084 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
8086 mdb_default_cmp(txn, slot);
8095 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
8097 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
8100 if (txn->mt_dbflags[dbi] & DB_STALE) {
8103 /* Stale, must read the DB's root. cursor_init does it for us. */
8104 mdb_cursor_init(&mc, txn, dbi, &mx);
8106 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
8109 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
8112 if (dbi <= MAIN_DBI || dbi >= env->me_maxdbs)
8114 ptr = env->me_dbxs[dbi].md_name.mv_data;
8115 env->me_dbxs[dbi].md_name.mv_data = NULL;
8116 env->me_dbxs[dbi].md_name.mv_size = 0;
8117 env->me_dbflags[dbi] = 0;
8121 int mdb_dbi_flags(MDB_txn *txn, MDB_dbi dbi, unsigned int *flags)
8123 /* We could return the flags for the FREE_DBI too but what's the point? */
8124 if (txn == NULL || dbi < MAIN_DBI || dbi >= txn->mt_numdbs)
8126 *flags = txn->mt_dbs[dbi].md_flags & PERSISTENT_FLAGS;
8130 /** Add all the DB's pages to the free list.
8131 * @param[in] mc Cursor on the DB to free.
8132 * @param[in] subs non-Zero to check for sub-DBs in this DB.
8133 * @return 0 on success, non-zero on failure.
8136 mdb_drop0(MDB_cursor *mc, int subs)
8140 rc = mdb_page_search(mc, NULL, MDB_PS_FIRST);
8141 if (rc == MDB_SUCCESS) {
8142 MDB_txn *txn = mc->mc_txn;
8147 /* LEAF2 pages have no nodes, cannot have sub-DBs */
8148 if (IS_LEAF2(mc->mc_pg[mc->mc_top]))
8151 mdb_cursor_copy(mc, &mx);
8152 while (mc->mc_snum > 0) {
8153 MDB_page *mp = mc->mc_pg[mc->mc_top];
8154 unsigned n = NUMKEYS(mp);
8156 for (i=0; i<n; i++) {
8157 ni = NODEPTR(mp, i);
8158 if (ni->mn_flags & F_BIGDATA) {
8161 memcpy(&pg, NODEDATA(ni), sizeof(pg));
8162 rc = mdb_page_get(txn, pg, &omp, NULL);
8165 assert(IS_OVERFLOW(omp));
8166 rc = mdb_midl_append_range(&txn->mt_free_pgs,
8170 } else if (subs && (ni->mn_flags & F_SUBDATA)) {
8171 mdb_xcursor_init1(mc, ni);
8172 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
8178 if ((rc = mdb_midl_need(&txn->mt_free_pgs, n)) != 0)
8180 for (i=0; i<n; i++) {
8182 ni = NODEPTR(mp, i);
8185 mdb_midl_xappend(txn->mt_free_pgs, pg);
8190 mc->mc_ki[mc->mc_top] = i;
8191 rc = mdb_cursor_sibling(mc, 1);
8193 /* no more siblings, go back to beginning
8194 * of previous level.
8198 for (i=1; i<mc->mc_snum; i++) {
8200 mc->mc_pg[i] = mx.mc_pg[i];
8205 rc = mdb_midl_append(&txn->mt_free_pgs, mc->mc_db->md_root);
8206 } else if (rc == MDB_NOTFOUND) {
8212 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
8214 MDB_cursor *mc, *m2;
8217 if (!txn || !dbi || dbi >= txn->mt_numdbs || (unsigned)del > 1 || !(txn->mt_dbflags[dbi] & DB_VALID))
8220 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
8223 rc = mdb_cursor_open(txn, dbi, &mc);
8227 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
8228 /* Invalidate the dropped DB's cursors */
8229 for (m2 = txn->mt_cursors[dbi]; m2; m2 = m2->mc_next)
8230 m2->mc_flags &= ~(C_INITIALIZED|C_EOF);
8234 /* Can't delete the main DB */
8235 if (del && dbi > MAIN_DBI) {
8236 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
8238 txn->mt_dbflags[dbi] = DB_STALE;
8239 mdb_dbi_close(txn->mt_env, dbi);
8242 /* reset the DB record, mark it dirty */
8243 txn->mt_dbflags[dbi] |= DB_DIRTY;
8244 txn->mt_dbs[dbi].md_depth = 0;
8245 txn->mt_dbs[dbi].md_branch_pages = 0;
8246 txn->mt_dbs[dbi].md_leaf_pages = 0;
8247 txn->mt_dbs[dbi].md_overflow_pages = 0;
8248 txn->mt_dbs[dbi].md_entries = 0;
8249 txn->mt_dbs[dbi].md_root = P_INVALID;
8251 txn->mt_flags |= MDB_TXN_DIRTY;
8254 mdb_cursor_close(mc);
8258 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
8260 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
8263 txn->mt_dbxs[dbi].md_cmp = cmp;
8267 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
8269 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
8272 txn->mt_dbxs[dbi].md_dcmp = cmp;
8276 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
8278 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
8281 txn->mt_dbxs[dbi].md_rel = rel;
8285 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
8287 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs || !(txn->mt_dbflags[dbi] & DB_VALID))
8290 txn->mt_dbxs[dbi].md_relctx = ctx;
8294 int mdb_env_get_maxkeysize(MDB_env *env)
8296 return ENV_MAXKEY(env);
8299 int mdb_reader_list(MDB_env *env, MDB_msg_func *func, void *ctx)
8301 unsigned int i, rdrs;
8304 int rc = 0, first = 1;
8308 if (!env->me_txns) {
8309 return func("(no reader locks)\n", ctx);
8311 rdrs = env->me_txns->mti_numreaders;
8312 mr = env->me_txns->mti_readers;
8313 for (i=0; i<rdrs; i++) {
8317 if (mr[i].mr_txnid == (txnid_t)-1) {
8318 sprintf(buf, "%10d %"Z"x -\n", mr[i].mr_pid, tid);
8320 sprintf(buf, "%10d %"Z"x %"Z"u\n", mr[i].mr_pid, tid, mr[i].mr_txnid);
8324 rc = func(" pid thread txnid\n", ctx);
8328 rc = func(buf, ctx);
8334 rc = func("(no active readers)\n", ctx);
8339 /** Insert pid into list if not already present.
8340 * return -1 if already present.
8342 static int mdb_pid_insert(MDB_PID_T *ids, MDB_PID_T pid)
8344 /* binary search of pid in list */
8346 unsigned cursor = 1;
8348 unsigned n = ids[0];
8351 unsigned pivot = n >> 1;
8352 cursor = base + pivot + 1;
8353 val = pid - ids[cursor];
8358 } else if ( val > 0 ) {
8363 /* found, so it's a duplicate */
8372 for (n = ids[0]; n > cursor; n--)
8378 int mdb_reader_check(MDB_env *env, int *dead)
8380 unsigned int i, j, rdrs;
8382 MDB_PID_T *pids, pid;
8391 rdrs = env->me_txns->mti_numreaders;
8392 pids = malloc((rdrs+1) * sizeof(MDB_PID_T));
8396 mr = env->me_txns->mti_readers;
8397 for (i=0; i<rdrs; i++) {
8398 if (mr[i].mr_pid && mr[i].mr_pid != env->me_pid) {
8400 if (mdb_pid_insert(pids, pid) == 0) {
8401 if (!mdb_reader_pid(env, Pidcheck, pid)) {
8403 /* Recheck, a new process may have reused pid */
8404 if (!mdb_reader_pid(env, Pidcheck, pid)) {
8405 for (j=i; j<rdrs; j++)
8406 if (mr[j].mr_pid == pid) {
8407 DPRINTF(("clear stale reader pid %u txn %"Z"d",
8408 (unsigned) pid, mr[j].mr_txnid));
8413 UNLOCK_MUTEX_R(env);
projects / openldap / blob