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.
36 #include <sys/types.h>
38 #include <sys/param.h>
44 #ifdef HAVE_SYS_FILE_H
61 #if !(defined(BYTE_ORDER) || defined(__BYTE_ORDER))
62 #include <resolv.h> /* defines BYTE_ORDER on HPUX and Solaris */
65 #if defined(__APPLE__) || defined (BSD)
66 # define MDB_USE_POSIX_SEM 1
67 # define MDB_FDATASYNC fsync
68 #elif defined(ANDROID)
69 # define MDB_FDATASYNC fsync
74 #ifdef MDB_USE_POSIX_SEM
75 #include <semaphore.h>
80 #include <valgrind/memcheck.h>
81 #define VGMEMP_CREATE(h,r,z) VALGRIND_CREATE_MEMPOOL(h,r,z)
82 #define VGMEMP_ALLOC(h,a,s) VALGRIND_MEMPOOL_ALLOC(h,a,s)
83 #define VGMEMP_FREE(h,a) VALGRIND_MEMPOOL_FREE(h,a)
84 #define VGMEMP_DESTROY(h) VALGRIND_DESTROY_MEMPOOL(h)
85 #define VGMEMP_DEFINED(a,s) VALGRIND_MAKE_MEM_DEFINED(a,s)
87 #define VGMEMP_CREATE(h,r,z)
88 #define VGMEMP_ALLOC(h,a,s)
89 #define VGMEMP_FREE(h,a)
90 #define VGMEMP_DESTROY(h)
91 #define VGMEMP_DEFINED(a,s)
95 # if (defined(_LITTLE_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN))
96 /* Solaris just defines one or the other */
97 # define LITTLE_ENDIAN 1234
98 # define BIG_ENDIAN 4321
99 # ifdef _LITTLE_ENDIAN
100 # define BYTE_ORDER LITTLE_ENDIAN
102 # define BYTE_ORDER BIG_ENDIAN
105 # define BYTE_ORDER __BYTE_ORDER
109 #ifndef LITTLE_ENDIAN
110 #define LITTLE_ENDIAN __LITTLE_ENDIAN
113 #define BIG_ENDIAN __BIG_ENDIAN
116 #if defined(__i386) || defined(__x86_64)
117 #define MISALIGNED_OK 1
123 #if (BYTE_ORDER == LITTLE_ENDIAN) == (BYTE_ORDER == BIG_ENDIAN)
124 # error "Unknown or unsupported endianness (BYTE_ORDER)"
125 #elif (-6 & 5) || CHAR_BIT != 8 || UINT_MAX < 0xffffffff || ULONG_MAX % 0xFFFF
126 # error "Two's complement, reasonably sized integer types, please"
129 /** @defgroup internal MDB Internals
132 /** @defgroup compat Windows Compatibility Macros
133 * A bunch of macros to minimize the amount of platform-specific ifdefs
134 * needed throughout the rest of the code. When the features this library
135 * needs are similar enough to POSIX to be hidden in a one-or-two line
136 * replacement, this macro approach is used.
140 #define pthread_t DWORD
141 #define pthread_mutex_t HANDLE
142 #define pthread_key_t DWORD
143 #define pthread_self() GetCurrentThreadId()
144 #define pthread_key_create(x,y) \
145 ((*(x) = TlsAlloc()) == TLS_OUT_OF_INDEXES ? ErrCode() : 0)
146 #define pthread_key_delete(x) TlsFree(x)
147 #define pthread_getspecific(x) TlsGetValue(x)
148 #define pthread_setspecific(x,y) (TlsSetValue(x,y) ? 0 : ErrCode())
149 #define pthread_mutex_unlock(x) ReleaseMutex(x)
150 #define pthread_mutex_lock(x) WaitForSingleObject(x, INFINITE)
151 #define LOCK_MUTEX_R(env) pthread_mutex_lock((env)->me_rmutex)
152 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock((env)->me_rmutex)
153 #define LOCK_MUTEX_W(env) pthread_mutex_lock((env)->me_wmutex)
154 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock((env)->me_wmutex)
155 #define getpid() GetCurrentProcessId()
156 #define MDB_FDATASYNC(fd) (!FlushFileBuffers(fd))
157 #define MDB_MSYNC(addr,len,flags) (!FlushViewOfFile(addr,len))
158 #define ErrCode() GetLastError()
159 #define GET_PAGESIZE(x) {SYSTEM_INFO si; GetSystemInfo(&si); (x) = si.dwPageSize;}
160 #define close(fd) CloseHandle(fd)
161 #define munmap(ptr,len) UnmapViewOfFile(ptr)
164 #ifdef MDB_USE_POSIX_SEM
166 #define LOCK_MUTEX_R(env) mdb_sem_wait((env)->me_rmutex)
167 #define UNLOCK_MUTEX_R(env) sem_post((env)->me_rmutex)
168 #define LOCK_MUTEX_W(env) mdb_sem_wait((env)->me_wmutex)
169 #define UNLOCK_MUTEX_W(env) sem_post((env)->me_wmutex)
172 mdb_sem_wait(sem_t *sem)
175 while ((rc = sem_wait(sem)) && (rc = errno) == EINTR) ;
180 /** Lock the reader mutex.
182 #define LOCK_MUTEX_R(env) pthread_mutex_lock(&(env)->me_txns->mti_mutex)
183 /** Unlock the reader mutex.
185 #define UNLOCK_MUTEX_R(env) pthread_mutex_unlock(&(env)->me_txns->mti_mutex)
187 /** Lock the writer mutex.
188 * Only a single write transaction is allowed at a time. Other writers
189 * will block waiting for this mutex.
191 #define LOCK_MUTEX_W(env) pthread_mutex_lock(&(env)->me_txns->mti_wmutex)
192 /** Unlock the writer mutex.
194 #define UNLOCK_MUTEX_W(env) pthread_mutex_unlock(&(env)->me_txns->mti_wmutex)
195 #endif /* MDB_USE_POSIX_SEM */
197 /** Get the error code for the last failed system function.
199 #define ErrCode() errno
201 /** An abstraction for a file handle.
202 * On POSIX systems file handles are small integers. On Windows
203 * they're opaque pointers.
207 /** A value for an invalid file handle.
208 * Mainly used to initialize file variables and signify that they are
211 #define INVALID_HANDLE_VALUE (-1)
213 /** Get the size of a memory page for the system.
214 * This is the basic size that the platform's memory manager uses, and is
215 * fundamental to the use of memory-mapped files.
217 #define GET_PAGESIZE(x) ((x) = sysconf(_SC_PAGE_SIZE))
220 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
223 #define MNAME_LEN (sizeof(pthread_mutex_t))
229 /** A flag for opening a file and requesting synchronous data writes.
230 * This is only used when writing a meta page. It's not strictly needed;
231 * we could just do a normal write and then immediately perform a flush.
232 * But if this flag is available it saves us an extra system call.
234 * @note If O_DSYNC is undefined but exists in /usr/include,
235 * preferably set some compiler flag to get the definition.
236 * Otherwise compile with the less efficient -DMDB_DSYNC=O_SYNC.
239 # define MDB_DSYNC O_DSYNC
243 /** Function for flushing the data of a file. Define this to fsync
244 * if fdatasync() is not supported.
246 #ifndef MDB_FDATASYNC
247 # define MDB_FDATASYNC fdatasync
251 # define MDB_MSYNC(addr,len,flags) msync(addr,len,flags)
262 /** A page number in the database.
263 * Note that 64 bit page numbers are overkill, since pages themselves
264 * already represent 12-13 bits of addressable memory, and the OS will
265 * always limit applications to a maximum of 63 bits of address space.
267 * @note In the #MDB_node structure, we only store 48 bits of this value,
268 * which thus limits us to only 60 bits of addressable data.
270 typedef MDB_ID pgno_t;
272 /** A transaction ID.
273 * See struct MDB_txn.mt_txnid for details.
275 typedef MDB_ID txnid_t;
277 /** @defgroup debug Debug Macros
281 /** Enable debug output.
282 * Set this to 1 for copious tracing. Set to 2 to add dumps of all IDLs
283 * read from and written to the database (used for free space management).
288 #if !(__STDC_VERSION__ >= 199901L || defined(__GNUC__))
289 # define DPRINTF (void) /* Vararg macros may be unsupported */
291 static int mdb_debug;
292 static txnid_t mdb_debug_start;
294 /** Print a debug message with printf formatting. */
295 # define DPRINTF(fmt, ...) /**< Requires 2 or more args */ \
296 ((void) ((mdb_debug) && \
297 fprintf(stderr, "%s:%d " fmt "\n", __func__, __LINE__, __VA_ARGS__)))
299 # define DPRINTF(fmt, ...) ((void) 0)
300 # define MDB_DEBUG_SKIP
302 /** Print a debug string.
303 * The string is printed literally, with no format processing.
305 #define DPUTS(arg) DPRINTF("%s", arg)
308 /** A default memory page size.
309 * The actual size is platform-dependent, but we use this for
310 * boot-strapping. We probably should not be using this any more.
311 * The #GET_PAGESIZE() macro is used to get the actual size.
313 * Note that we don't currently support Huge pages. On Linux,
314 * regular data files cannot use Huge pages, and in general
315 * Huge pages aren't actually pageable. We rely on the OS
316 * demand-pager to read our data and page it out when memory
317 * pressure from other processes is high. So until OSs have
318 * actual paging support for Huge pages, they're not viable.
320 #define MDB_PAGESIZE 4096
322 /** The minimum number of keys required in a database page.
323 * Setting this to a larger value will place a smaller bound on the
324 * maximum size of a data item. Data items larger than this size will
325 * be pushed into overflow pages instead of being stored directly in
326 * the B-tree node. This value used to default to 4. With a page size
327 * of 4096 bytes that meant that any item larger than 1024 bytes would
328 * go into an overflow page. That also meant that on average 2-3KB of
329 * each overflow page was wasted space. The value cannot be lower than
330 * 2 because then there would no longer be a tree structure. With this
331 * value, items larger than 2KB will go into overflow pages, and on
332 * average only 1KB will be wasted.
334 #define MDB_MINKEYS 2
336 /** A stamp that identifies a file as an MDB file.
337 * There's nothing special about this value other than that it is easily
338 * recognizable, and it will reflect any byte order mismatches.
340 #define MDB_MAGIC 0xBEEFC0DE
342 /** The version number for a database's file format. */
343 #define MDB_VERSION 1
345 /** @brief The maximum size of a key in the database.
347 * We require that keys all fit onto a regular page. This limit
348 * could be raised a bit further if needed; to something just
349 * under #MDB_PAGESIZE / #MDB_MINKEYS.
351 * Note that data items in an #MDB_DUPSORT database are actually keys
352 * of a subDB, so they're also limited to this size.
354 #ifndef MDB_MAXKEYSIZE
355 #define MDB_MAXKEYSIZE 511
358 /** @brief The maximum size of a data item.
360 * We only store a 32 bit value for node sizes.
362 #define MAXDATASIZE 0xffffffffUL
367 * This is used for printing a hex dump of a key's contents.
369 #define DKBUF char kbuf[(MDB_MAXKEYSIZE*2+1)]
370 /** Display a key in hex.
372 * Invoke a function to display a key in hex.
374 #define DKEY(x) mdb_dkey(x, kbuf)
376 #define DKBUF typedef int dummy_kbuf /* so we can put ';' after */
380 /** An invalid page number.
381 * Mainly used to denote an empty tree.
383 #define P_INVALID (~(pgno_t)0)
385 /** Test if the flags \b f are set in a flag word \b w. */
386 #define F_ISSET(w, f) (((w) & (f)) == (f))
388 /** Used for offsets within a single page.
389 * Since memory pages are typically 4 or 8KB in size, 12-13 bits,
392 typedef uint16_t indx_t;
394 /** Default size of memory map.
395 * This is certainly too small for any actual applications. Apps should always set
396 * the size explicitly using #mdb_env_set_mapsize().
398 #define DEFAULT_MAPSIZE 1048576
400 /** @defgroup readers Reader Lock Table
401 * Readers don't acquire any locks for their data access. Instead, they
402 * simply record their transaction ID in the reader table. The reader
403 * mutex is needed just to find an empty slot in the reader table. The
404 * slot's address is saved in thread-specific data so that subsequent read
405 * transactions started by the same thread need no further locking to proceed.
407 * No reader table is used if the database is on a read-only filesystem.
409 * Since the database uses multi-version concurrency control, readers don't
410 * actually need any locking. This table is used to keep track of which
411 * readers are using data from which old transactions, so that we'll know
412 * when a particular old transaction is no longer in use. Old transactions
413 * that have discarded any data pages can then have those pages reclaimed
414 * for use by a later write transaction.
416 * The lock table is constructed such that reader slots are aligned with the
417 * processor's cache line size. Any slot is only ever used by one thread.
418 * This alignment guarantees that there will be no contention or cache
419 * thrashing as threads update their own slot info, and also eliminates
420 * any need for locking when accessing a slot.
422 * A writer thread will scan every slot in the table to determine the oldest
423 * outstanding reader transaction. Any freed pages older than this will be
424 * reclaimed by the writer. The writer doesn't use any locks when scanning
425 * this table. This means that there's no guarantee that the writer will
426 * see the most up-to-date reader info, but that's not required for correct
427 * operation - all we need is to know the upper bound on the oldest reader,
428 * we don't care at all about the newest reader. So the only consequence of
429 * reading stale information here is that old pages might hang around a
430 * while longer before being reclaimed. That's actually good anyway, because
431 * the longer we delay reclaiming old pages, the more likely it is that a
432 * string of contiguous pages can be found after coalescing old pages from
433 * many old transactions together.
436 /** Number of slots in the reader table.
437 * This value was chosen somewhat arbitrarily. 126 readers plus a
438 * couple mutexes fit exactly into 8KB on my development machine.
439 * Applications should set the table size using #mdb_env_set_maxreaders().
441 #define DEFAULT_READERS 126
443 /** The size of a CPU cache line in bytes. We want our lock structures
444 * aligned to this size to avoid false cache line sharing in the
446 * This value works for most CPUs. For Itanium this should be 128.
452 /** The information we store in a single slot of the reader table.
453 * In addition to a transaction ID, we also record the process and
454 * thread ID that owns a slot, so that we can detect stale information,
455 * e.g. threads or processes that went away without cleaning up.
456 * @note We currently don't check for stale records. We simply re-init
457 * the table when we know that we're the only process opening the
460 typedef struct MDB_rxbody {
461 /** Current Transaction ID when this transaction began, or (txnid_t)-1.
462 * Multiple readers that start at the same time will probably have the
463 * same ID here. Again, it's not important to exclude them from
464 * anything; all we need to know is which version of the DB they
465 * started from so we can avoid overwriting any data used in that
466 * particular version.
469 /** The process ID of the process owning this reader txn. */
471 /** The thread ID of the thread owning this txn. */
475 /** The actual reader record, with cacheline padding. */
476 typedef struct MDB_reader {
479 /** shorthand for mrb_txnid */
480 #define mr_txnid mru.mrx.mrb_txnid
481 #define mr_pid mru.mrx.mrb_pid
482 #define mr_tid mru.mrx.mrb_tid
483 /** cache line alignment */
484 char pad[(sizeof(MDB_rxbody)+CACHELINE-1) & ~(CACHELINE-1)];
488 /** The header for the reader table.
489 * The table resides in a memory-mapped file. (This is a different file
490 * than is used for the main database.)
492 * For POSIX the actual mutexes reside in the shared memory of this
493 * mapped file. On Windows, mutexes are named objects allocated by the
494 * kernel; we store the mutex names in this mapped file so that other
495 * processes can grab them. This same approach is also used on
496 * MacOSX/Darwin (using named semaphores) since MacOSX doesn't support
497 * process-shared POSIX mutexes. For these cases where a named object
498 * is used, the object name is derived from a 64 bit FNV hash of the
499 * environment pathname. As such, naming collisions are extremely
500 * unlikely. If a collision occurs, the results are unpredictable.
502 typedef struct MDB_txbody {
503 /** Stamp identifying this as an MDB file. It must be set
506 /** Version number of this lock file. Must be set to #MDB_VERSION. */
507 uint32_t mtb_version;
508 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
509 char mtb_rmname[MNAME_LEN];
511 /** Mutex protecting access to this table.
512 * This is the reader lock that #LOCK_MUTEX_R acquires.
514 pthread_mutex_t mtb_mutex;
516 /** The ID of the last transaction committed to the database.
517 * This is recorded here only for convenience; the value can always
518 * be determined by reading the main database meta pages.
521 /** The number of slots that have been used in the reader table.
522 * This always records the maximum count, it is not decremented
523 * when readers release their slots.
525 unsigned mtb_numreaders;
528 /** The actual reader table definition. */
529 typedef struct MDB_txninfo {
532 #define mti_magic mt1.mtb.mtb_magic
533 #define mti_version mt1.mtb.mtb_version
534 #define mti_mutex mt1.mtb.mtb_mutex
535 #define mti_rmname mt1.mtb.mtb_rmname
536 #define mti_txnid mt1.mtb.mtb_txnid
537 #define mti_numreaders mt1.mtb.mtb_numreaders
538 char pad[(sizeof(MDB_txbody)+CACHELINE-1) & ~(CACHELINE-1)];
541 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
542 char mt2_wmname[MNAME_LEN];
543 #define mti_wmname mt2.mt2_wmname
545 pthread_mutex_t mt2_wmutex;
546 #define mti_wmutex mt2.mt2_wmutex
548 char pad[(MNAME_LEN+CACHELINE-1) & ~(CACHELINE-1)];
550 MDB_reader mti_readers[1];
554 /** Common header for all page types.
555 * Overflow records occupy a number of contiguous pages with no
556 * headers on any page after the first.
558 typedef struct MDB_page {
559 #define mp_pgno mp_p.p_pgno
560 #define mp_next mp_p.p_next
562 pgno_t p_pgno; /**< page number */
563 void * p_next; /**< for in-memory list of freed structs */
566 /** @defgroup mdb_page Page Flags
568 * Flags for the page headers.
571 #define P_BRANCH 0x01 /**< branch page */
572 #define P_LEAF 0x02 /**< leaf page */
573 #define P_OVERFLOW 0x04 /**< overflow page */
574 #define P_META 0x08 /**< meta page */
575 #define P_DIRTY 0x10 /**< dirty page */
576 #define P_LEAF2 0x20 /**< for #MDB_DUPFIXED records */
577 #define P_SUBP 0x40 /**< for #MDB_DUPSORT sub-pages */
579 uint16_t mp_flags; /**< @ref mdb_page */
580 #define mp_lower mp_pb.pb.pb_lower
581 #define mp_upper mp_pb.pb.pb_upper
582 #define mp_pages mp_pb.pb_pages
585 indx_t pb_lower; /**< lower bound of free space */
586 indx_t pb_upper; /**< upper bound of free space */
588 uint32_t pb_pages; /**< number of overflow pages */
590 indx_t mp_ptrs[1]; /**< dynamic size */
593 /** Size of the page header, excluding dynamic data at the end */
594 #define PAGEHDRSZ ((unsigned) offsetof(MDB_page, mp_ptrs))
596 /** Address of first usable data byte in a page, after the header */
597 #define METADATA(p) ((void *)((char *)(p) + PAGEHDRSZ))
599 /** Number of nodes on a page */
600 #define NUMKEYS(p) (((p)->mp_lower - PAGEHDRSZ) >> 1)
602 /** The amount of space remaining in the page */
603 #define SIZELEFT(p) (indx_t)((p)->mp_upper - (p)->mp_lower)
605 /** The percentage of space used in the page, in tenths of a percent. */
606 #define PAGEFILL(env, p) (1000L * ((env)->me_psize - PAGEHDRSZ - SIZELEFT(p)) / \
607 ((env)->me_psize - PAGEHDRSZ))
608 /** The minimum page fill factor, in tenths of a percent.
609 * Pages emptier than this are candidates for merging.
611 #define FILL_THRESHOLD 250
613 /** Test if a page is a leaf page */
614 #define IS_LEAF(p) F_ISSET((p)->mp_flags, P_LEAF)
615 /** Test if a page is a LEAF2 page */
616 #define IS_LEAF2(p) F_ISSET((p)->mp_flags, P_LEAF2)
617 /** Test if a page is a branch page */
618 #define IS_BRANCH(p) F_ISSET((p)->mp_flags, P_BRANCH)
619 /** Test if a page is an overflow page */
620 #define IS_OVERFLOW(p) F_ISSET((p)->mp_flags, P_OVERFLOW)
621 /** Test if a page is a sub page */
622 #define IS_SUBP(p) F_ISSET((p)->mp_flags, P_SUBP)
624 /** The number of overflow pages needed to store the given size. */
625 #define OVPAGES(size, psize) ((PAGEHDRSZ-1 + (size)) / (psize) + 1)
627 /** Header for a single key/data pair within a page.
628 * We guarantee 2-byte alignment for nodes.
630 typedef struct MDB_node {
631 /** lo and hi are used for data size on leaf nodes and for
632 * child pgno on branch nodes. On 64 bit platforms, flags
633 * is also used for pgno. (Branch nodes have no flags).
634 * They are in host byte order in case that lets some
635 * accesses be optimized into a 32-bit word access.
637 #define mn_lo mn_offset[BYTE_ORDER!=LITTLE_ENDIAN]
638 #define mn_hi mn_offset[BYTE_ORDER==LITTLE_ENDIAN] /**< part of dsize or pgno */
639 unsigned short mn_offset[2]; /**< storage for #mn_lo and #mn_hi */
640 /** @defgroup mdb_node Node Flags
642 * Flags for node headers.
645 #define F_BIGDATA 0x01 /**< data put on overflow page */
646 #define F_SUBDATA 0x02 /**< data is a sub-database */
647 #define F_DUPDATA 0x04 /**< data has duplicates */
649 /** valid flags for #mdb_node_add() */
650 #define NODE_ADD_FLAGS (F_DUPDATA|F_SUBDATA|MDB_RESERVE|MDB_APPEND)
653 unsigned short mn_flags; /**< @ref mdb_node */
654 unsigned short mn_ksize; /**< key size */
655 char mn_data[1]; /**< key and data are appended here */
658 /** Size of the node header, excluding dynamic data at the end */
659 #define NODESIZE offsetof(MDB_node, mn_data)
661 /** Bit position of top word in page number, for shifting mn_flags */
662 #define PGNO_TOPWORD ((pgno_t)-1 > 0xffffffffu ? 32 : 0)
664 /** Size of a node in a branch page with a given key.
665 * This is just the node header plus the key, there is no data.
667 #define INDXSIZE(k) (NODESIZE + ((k) == NULL ? 0 : (k)->mv_size))
669 /** Size of a node in a leaf page with a given key and data.
670 * This is node header plus key plus data size.
672 #define LEAFSIZE(k, d) (NODESIZE + (k)->mv_size + (d)->mv_size)
674 /** Address of node \b i in page \b p */
675 #define NODEPTR(p, i) ((MDB_node *)((char *)(p) + (p)->mp_ptrs[i]))
677 /** Address of the key for the node */
678 #define NODEKEY(node) (void *)((node)->mn_data)
680 /** Address of the data for a node */
681 #define NODEDATA(node) (void *)((char *)(node)->mn_data + (node)->mn_ksize)
683 /** Get the page number pointed to by a branch node */
684 #define NODEPGNO(node) \
685 ((node)->mn_lo | ((pgno_t) (node)->mn_hi << 16) | \
686 (PGNO_TOPWORD ? ((pgno_t) (node)->mn_flags << PGNO_TOPWORD) : 0))
687 /** Set the page number in a branch node */
688 #define SETPGNO(node,pgno) do { \
689 (node)->mn_lo = (pgno) & 0xffff; (node)->mn_hi = (pgno) >> 16; \
690 if (PGNO_TOPWORD) (node)->mn_flags = (pgno) >> PGNO_TOPWORD; } while(0)
692 /** Get the size of the data in a leaf node */
693 #define NODEDSZ(node) ((node)->mn_lo | ((unsigned)(node)->mn_hi << 16))
694 /** Set the size of the data for a leaf node */
695 #define SETDSZ(node,size) do { \
696 (node)->mn_lo = (size) & 0xffff; (node)->mn_hi = (size) >> 16;} while(0)
697 /** The size of a key in a node */
698 #define NODEKSZ(node) ((node)->mn_ksize)
700 /** Copy a page number from src to dst */
702 #define COPY_PGNO(dst,src) dst = src
704 #if SIZE_MAX > 4294967295UL
705 #define COPY_PGNO(dst,src) do { \
706 unsigned short *s, *d; \
707 s = (unsigned short *)&(src); \
708 d = (unsigned short *)&(dst); \
715 #define COPY_PGNO(dst,src) do { \
716 unsigned short *s, *d; \
717 s = (unsigned short *)&(src); \
718 d = (unsigned short *)&(dst); \
724 /** The address of a key in a LEAF2 page.
725 * LEAF2 pages are used for #MDB_DUPFIXED sorted-duplicate sub-DBs.
726 * There are no node headers, keys are stored contiguously.
728 #define LEAF2KEY(p, i, ks) ((char *)(p) + PAGEHDRSZ + ((i)*(ks)))
730 /** Set the \b node's key into \b key, if requested. */
731 #define MDB_GET_KEY(node, key) { if ((key) != NULL) { \
732 (key)->mv_size = NODEKSZ(node); (key)->mv_data = NODEKEY(node); } }
734 /** Information about a single database in the environment. */
735 typedef struct MDB_db {
736 uint32_t md_pad; /**< also ksize for LEAF2 pages */
737 uint16_t md_flags; /**< @ref mdb_dbi_open */
738 uint16_t md_depth; /**< depth of this tree */
739 pgno_t md_branch_pages; /**< number of internal pages */
740 pgno_t md_leaf_pages; /**< number of leaf pages */
741 pgno_t md_overflow_pages; /**< number of overflow pages */
742 size_t md_entries; /**< number of data items */
743 pgno_t md_root; /**< the root page of this tree */
746 /** Handle for the DB used to track free pages. */
748 /** Handle for the default DB. */
751 /** Meta page content. */
752 typedef struct MDB_meta {
753 /** Stamp identifying this as an MDB file. It must be set
756 /** Version number of this lock file. Must be set to #MDB_VERSION. */
758 void *mm_address; /**< address for fixed mapping */
759 size_t mm_mapsize; /**< size of mmap region */
760 MDB_db mm_dbs[2]; /**< first is free space, 2nd is main db */
761 /** The size of pages used in this DB */
762 #define mm_psize mm_dbs[0].md_pad
763 /** Any persistent environment flags. @ref mdb_env */
764 #define mm_flags mm_dbs[0].md_flags
765 pgno_t mm_last_pg; /**< last used page in file */
766 txnid_t mm_txnid; /**< txnid that committed this page */
769 /** Buffer for a stack-allocated dirty page.
770 * The members define size and alignment, and silence type
771 * aliasing warnings. They are not used directly; that could
772 * mean incorrectly using several union members in parallel.
774 typedef union MDB_pagebuf {
775 char mb_raw[MDB_PAGESIZE];
778 char mm_pad[PAGEHDRSZ];
783 /** Auxiliary DB info.
784 * The information here is mostly static/read-only. There is
785 * only a single copy of this record in the environment.
787 typedef struct MDB_dbx {
788 MDB_val md_name; /**< name of the database */
789 MDB_cmp_func *md_cmp; /**< function for comparing keys */
790 MDB_cmp_func *md_dcmp; /**< function for comparing data items */
791 MDB_rel_func *md_rel; /**< user relocate function */
792 void *md_relctx; /**< user-provided context for md_rel */
795 /** A database transaction.
796 * Every operation requires a transaction handle.
799 MDB_txn *mt_parent; /**< parent of a nested txn */
800 MDB_txn *mt_child; /**< nested txn under this txn */
801 pgno_t mt_next_pgno; /**< next unallocated page */
802 /** The ID of this transaction. IDs are integers incrementing from 1.
803 * Only committed write transactions increment the ID. If a transaction
804 * aborts, the ID may be re-used by the next writer.
807 MDB_env *mt_env; /**< the DB environment */
808 /** The list of pages that became unused during this transaction.
812 MDB_ID2L dirty_list; /**< for write txns: modified pages */
813 MDB_reader *reader; /**< this thread's reader table slot or NULL */
815 /** Array of records for each DB known in the environment. */
817 /** Array of MDB_db records for each known DB */
819 /** @defgroup mt_dbflag Transaction DB Flags
823 #define DB_DIRTY 0x01 /**< DB was written in this txn */
824 #define DB_STALE 0x02 /**< DB record is older than txnID */
826 /** In write txns, array of cursors for each DB */
827 MDB_cursor **mt_cursors;
828 /** Array of flags for each DB */
829 unsigned char *mt_dbflags;
830 /** Number of DB records in use. This number only ever increments;
831 * we don't decrement it when individual DB handles are closed.
835 /** @defgroup mdb_txn Transaction Flags
839 #define MDB_TXN_RDONLY 0x01 /**< read-only transaction */
840 #define MDB_TXN_ERROR 0x02 /**< an error has occurred */
841 #define MDB_TXN_DIRTY 0x04 /**< must write, even if dirty list is empty */
843 unsigned int mt_flags; /**< @ref mdb_txn */
844 /** dirty_list maxsize - #allocated pages including in parent txns */
845 unsigned int mt_dirty_room;
846 /** Tracks which of the two meta pages was used at the start
847 * of this transaction.
849 unsigned int mt_toggle;
852 /** Enough space for 2^32 nodes with minimum of 2 keys per node. I.e., plenty.
853 * At 4 keys per node, enough for 2^64 nodes, so there's probably no need to
854 * raise this on a 64 bit machine.
856 #define CURSOR_STACK 32
860 /** Cursors are used for all DB operations */
862 /** Next cursor on this DB in this txn */
864 /** Original cursor if this is a shadow */
866 /** Context used for databases with #MDB_DUPSORT, otherwise NULL */
867 struct MDB_xcursor *mc_xcursor;
868 /** The transaction that owns this cursor */
870 /** The database handle this cursor operates on */
872 /** The database record for this cursor */
874 /** The database auxiliary record for this cursor */
876 /** The @ref mt_dbflag for this database */
877 unsigned char *mc_dbflag;
878 unsigned short mc_snum; /**< number of pushed pages */
879 unsigned short mc_top; /**< index of top page, normally mc_snum-1 */
880 /** @defgroup mdb_cursor Cursor Flags
882 * Cursor state flags.
885 #define C_INITIALIZED 0x01 /**< cursor has been initialized and is valid */
886 #define C_EOF 0x02 /**< No more data */
887 #define C_SUB 0x04 /**< Cursor is a sub-cursor */
888 #define C_SHADOW 0x08 /**< Cursor is a dup from a parent txn */
889 #define C_ALLOCD 0x10 /**< Cursor was malloc'd */
890 #define C_SPLITTING 0x20 /**< Cursor is in page_split */
892 unsigned int mc_flags; /**< @ref mdb_cursor */
893 MDB_page *mc_pg[CURSOR_STACK]; /**< stack of pushed pages */
894 indx_t mc_ki[CURSOR_STACK]; /**< stack of page indices */
897 /** Context for sorted-dup records.
898 * We could have gone to a fully recursive design, with arbitrarily
899 * deep nesting of sub-databases. But for now we only handle these
900 * levels - main DB, optional sub-DB, sorted-duplicate DB.
902 typedef struct MDB_xcursor {
903 /** A sub-cursor for traversing the Dup DB */
904 MDB_cursor mx_cursor;
905 /** The database record for this Dup DB */
907 /** The auxiliary DB record for this Dup DB */
909 /** The @ref mt_dbflag for this Dup DB */
910 unsigned char mx_dbflag;
913 /** State of FreeDB old pages, stored in the MDB_env */
914 typedef struct MDB_pgstate {
915 txnid_t mf_pglast; /**< ID of last old page record we used */
916 pgno_t *mf_pghead; /**< old pages reclaimed from freelist */
917 pgno_t *mf_pgfree; /**< memory to free when dropping me_pghead */
920 /** The database environment. */
922 HANDLE me_fd; /**< The main data file */
923 HANDLE me_lfd; /**< The lock file */
924 HANDLE me_mfd; /**< just for writing the meta pages */
925 /** Failed to update the meta page. Probably an I/O error. */
926 #define MDB_FATAL_ERROR 0x80000000U
927 /** Read-only Filesystem. Allow read access, no locking. */
928 #define MDB_ROFS 0x40000000U
929 /** Some fields are initialized. */
930 #define MDB_ENV_ACTIVE 0x20000000U
931 uint32_t me_flags; /**< @ref mdb_env */
932 unsigned int me_psize; /**< size of a page, from #GET_PAGESIZE */
933 unsigned int me_maxreaders; /**< size of the reader table */
934 unsigned int me_numreaders; /**< max numreaders set by this env */
935 MDB_dbi me_numdbs; /**< number of DBs opened */
936 MDB_dbi me_maxdbs; /**< size of the DB table */
937 pid_t me_pid; /**< process ID of this env */
938 char *me_path; /**< path to the DB files */
939 char *me_map; /**< the memory map of the data file */
940 MDB_txninfo *me_txns; /**< the memory map of the lock file or NULL */
941 MDB_meta *me_metas[2]; /**< pointers to the two meta pages */
942 MDB_txn *me_txn; /**< current write transaction */
943 size_t me_mapsize; /**< size of the data memory map */
944 off_t me_size; /**< current file size */
945 pgno_t me_maxpg; /**< me_mapsize / me_psize */
946 MDB_dbx *me_dbxs; /**< array of static DB info */
947 uint16_t *me_dbflags; /**< array of flags from MDB_db.md_flags */
948 pthread_key_t me_txkey; /**< thread-key for readers */
949 MDB_pgstate me_pgstate; /**< state of old pages from freeDB */
950 # define me_pglast me_pgstate.mf_pglast
951 # define me_pghead me_pgstate.mf_pghead
952 # define me_pgfree me_pgstate.mf_pgfree
953 MDB_page *me_dpages; /**< list of malloc'd blocks for re-use */
954 /** IDL of pages that became unused in a write txn */
956 /** ID2L of pages that were written during a write txn */
957 MDB_ID2 me_dirty_list[MDB_IDL_UM_SIZE];
958 /** Max number of freelist items that can fit in a single overflow page */
959 unsigned int me_maxfree_1pg;
960 /** Max size of a node on a page */
961 unsigned int me_nodemax;
963 HANDLE me_rmutex; /* Windows mutexes don't reside in shared mem */
965 #elif defined(MDB_USE_POSIX_SEM)
966 sem_t *me_rmutex; /* Shared mutexes are not supported */
971 /** Nested transaction */
972 typedef struct MDB_ntxn {
973 MDB_txn mnt_txn; /* the transaction */
974 MDB_pgstate mnt_pgstate; /* parent transaction's saved freestate */
977 /** max number of pages to commit in one writev() call */
978 #define MDB_COMMIT_PAGES 64
979 #if defined(IOV_MAX) && IOV_MAX < MDB_COMMIT_PAGES
980 #undef MDB_COMMIT_PAGES
981 #define MDB_COMMIT_PAGES IOV_MAX
984 static int mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp);
985 static int mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp);
986 static int mdb_page_touch(MDB_cursor *mc);
988 static int mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **mp);
989 static int mdb_page_search_root(MDB_cursor *mc,
990 MDB_val *key, int modify);
991 #define MDB_PS_MODIFY 1
992 #define MDB_PS_ROOTONLY 2
993 static int mdb_page_search(MDB_cursor *mc,
994 MDB_val *key, int flags);
995 static int mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst);
997 #define MDB_SPLIT_REPLACE MDB_APPENDDUP /**< newkey is not new */
998 static int mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata,
999 pgno_t newpgno, unsigned int nflags);
1001 static int mdb_env_read_header(MDB_env *env, MDB_meta *meta);
1002 static int mdb_env_pick_meta(const MDB_env *env);
1003 static int mdb_env_write_meta(MDB_txn *txn);
1004 static void mdb_env_close0(MDB_env *env, int excl);
1006 static MDB_node *mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp);
1007 static int mdb_node_add(MDB_cursor *mc, indx_t indx,
1008 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags);
1009 static void mdb_node_del(MDB_page *mp, indx_t indx, int ksize);
1010 static void mdb_node_shrink(MDB_page *mp, indx_t indx);
1011 static int mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst);
1012 static int mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data);
1013 static size_t mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data);
1014 static size_t mdb_branch_size(MDB_env *env, MDB_val *key);
1016 static int mdb_rebalance(MDB_cursor *mc);
1017 static int mdb_update_key(MDB_cursor *mc, MDB_val *key);
1019 static void mdb_cursor_pop(MDB_cursor *mc);
1020 static int mdb_cursor_push(MDB_cursor *mc, MDB_page *mp);
1022 static int mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf);
1023 static int mdb_cursor_sibling(MDB_cursor *mc, int move_right);
1024 static int mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1025 static int mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op);
1026 static int mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op,
1028 static int mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1029 static int mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data);
1031 static void mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx);
1032 static void mdb_xcursor_init0(MDB_cursor *mc);
1033 static void mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node);
1035 static int mdb_drop0(MDB_cursor *mc, int subs);
1036 static void mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi);
1039 static MDB_cmp_func mdb_cmp_memn, mdb_cmp_memnr, mdb_cmp_int, mdb_cmp_cint, mdb_cmp_long;
1043 static SECURITY_DESCRIPTOR mdb_null_sd;
1044 static SECURITY_ATTRIBUTES mdb_all_sa;
1045 static int mdb_sec_inited;
1048 /** Return the library version info. */
1050 mdb_version(int *major, int *minor, int *patch)
1052 if (major) *major = MDB_VERSION_MAJOR;
1053 if (minor) *minor = MDB_VERSION_MINOR;
1054 if (patch) *patch = MDB_VERSION_PATCH;
1055 return MDB_VERSION_STRING;
1058 /** Table of descriptions for MDB @ref errors */
1059 static char *const mdb_errstr[] = {
1060 "MDB_KEYEXIST: Key/data pair already exists",
1061 "MDB_NOTFOUND: No matching key/data pair found",
1062 "MDB_PAGE_NOTFOUND: Requested page not found",
1063 "MDB_CORRUPTED: Located page was wrong type",
1064 "MDB_PANIC: Update of meta page failed",
1065 "MDB_VERSION_MISMATCH: Database environment version mismatch",
1066 "MDB_INVALID: File is not an MDB file",
1067 "MDB_MAP_FULL: Environment mapsize limit reached",
1068 "MDB_DBS_FULL: Environment maxdbs limit reached",
1069 "MDB_READERS_FULL: Environment maxreaders limit reached",
1070 "MDB_TLS_FULL: Thread-local storage keys full - too many environments open",
1071 "MDB_TXN_FULL: Transaction has too many dirty pages - transaction too big",
1072 "MDB_CURSOR_FULL: Internal error - cursor stack limit reached",
1073 "MDB_PAGE_FULL: Internal error - page has no more space",
1074 "MDB_MAP_RESIZED: Database contents grew beyond environment mapsize",
1075 "MDB_INCOMPATIBLE: Database flags changed or would change",
1079 mdb_strerror(int err)
1083 return ("Successful return: 0");
1085 if (err >= MDB_KEYEXIST && err <= MDB_LAST_ERRCODE) {
1086 i = err - MDB_KEYEXIST;
1087 return mdb_errstr[i];
1090 return strerror(err);
1094 /** Display a key in hexadecimal and return the address of the result.
1095 * @param[in] key the key to display
1096 * @param[in] buf the buffer to write into. Should always be #DKBUF.
1097 * @return The key in hexadecimal form.
1100 mdb_dkey(MDB_val *key, char *buf)
1103 unsigned char *c = key->mv_data;
1109 if (key->mv_size > MDB_MAXKEYSIZE)
1110 return "MDB_MAXKEYSIZE";
1111 /* may want to make this a dynamic check: if the key is mostly
1112 * printable characters, print it as-is instead of converting to hex.
1116 for (i=0; i<key->mv_size; i++)
1117 ptr += sprintf(ptr, "%02x", *c++);
1119 sprintf(buf, "%.*s", key->mv_size, key->mv_data);
1124 /** Display all the keys in the page. */
1126 mdb_page_list(MDB_page *mp)
1129 unsigned int i, nkeys, nsize;
1133 nkeys = NUMKEYS(mp);
1134 fprintf(stderr, "Page %zu numkeys %d\n", mp->mp_pgno, nkeys);
1135 for (i=0; i<nkeys; i++) {
1136 node = NODEPTR(mp, i);
1137 key.mv_size = node->mn_ksize;
1138 key.mv_data = node->mn_data;
1139 nsize = NODESIZE + NODEKSZ(node) + sizeof(indx_t);
1140 if (IS_BRANCH(mp)) {
1141 fprintf(stderr, "key %d: page %zu, %s\n", i, NODEPGNO(node),
1144 if (F_ISSET(node->mn_flags, F_BIGDATA))
1145 nsize += sizeof(pgno_t);
1147 nsize += NODEDSZ(node);
1148 fprintf(stderr, "key %d: nsize %d, %s\n", i, nsize, DKEY(&key));
1154 mdb_cursor_chk(MDB_cursor *mc)
1160 if (!mc->mc_snum && !(mc->mc_flags & C_INITIALIZED)) return;
1161 for (i=0; i<mc->mc_top; i++) {
1163 node = NODEPTR(mp, mc->mc_ki[i]);
1164 if (NODEPGNO(node) != mc->mc_pg[i+1]->mp_pgno)
1167 if (mc->mc_ki[i] >= NUMKEYS(mc->mc_pg[i]))
1173 /** Count all the pages in each DB and in the freelist
1174 * and make sure it matches the actual number of pages
1177 static void mdb_audit(MDB_txn *txn)
1181 MDB_ID freecount, count;
1186 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
1187 while ((rc = mdb_cursor_get(&mc, &key, &data, MDB_NEXT)) == 0)
1188 freecount += *(MDB_ID *)data.mv_data;
1191 for (i = 0; i<txn->mt_numdbs; i++) {
1192 MDB_xcursor mx, *mxp;
1193 mxp = (txn->mt_dbs[i].md_flags & MDB_DUPSORT) ? &mx : NULL;
1194 mdb_cursor_init(&mc, txn, i, mxp);
1195 if (txn->mt_dbs[i].md_root == P_INVALID)
1197 count += txn->mt_dbs[i].md_branch_pages +
1198 txn->mt_dbs[i].md_leaf_pages +
1199 txn->mt_dbs[i].md_overflow_pages;
1200 if (txn->mt_dbs[i].md_flags & MDB_DUPSORT) {
1201 mdb_page_search(&mc, NULL, 0);
1205 mp = mc.mc_pg[mc.mc_top];
1206 for (j=0; j<NUMKEYS(mp); j++) {
1207 MDB_node *leaf = NODEPTR(mp, j);
1208 if (leaf->mn_flags & F_SUBDATA) {
1210 memcpy(&db, NODEDATA(leaf), sizeof(db));
1211 count += db.md_branch_pages + db.md_leaf_pages +
1212 db.md_overflow_pages;
1216 while (mdb_cursor_sibling(&mc, 1) == 0);
1219 if (freecount + count + 2 /* metapages */ != txn->mt_next_pgno) {
1220 fprintf(stderr, "audit: %lu freecount: %lu count: %lu total: %lu next_pgno: %lu\n",
1221 txn->mt_txnid, freecount, count+2, freecount+count+2, txn->mt_next_pgno);
1227 mdb_cmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1229 return txn->mt_dbxs[dbi].md_cmp(a, b);
1233 mdb_dcmp(MDB_txn *txn, MDB_dbi dbi, const MDB_val *a, const MDB_val *b)
1235 if (txn->mt_dbxs[dbi].md_dcmp)
1236 return txn->mt_dbxs[dbi].md_dcmp(a, b);
1238 return EINVAL; /* too bad you can't distinguish this from a valid result */
1241 /** Allocate a single page.
1242 * Re-use old malloc'd pages first, otherwise just malloc.
1245 mdb_page_malloc(MDB_cursor *mc) {
1247 size_t sz = mc->mc_txn->mt_env->me_psize;
1248 if ((ret = mc->mc_txn->mt_env->me_dpages) != NULL) {
1249 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1250 VGMEMP_DEFINED(ret, sizeof(ret->mp_next));
1251 mc->mc_txn->mt_env->me_dpages = ret->mp_next;
1252 } else if ((ret = malloc(sz)) != NULL) {
1253 VGMEMP_ALLOC(mc->mc_txn->mt_env, ret, sz);
1259 mdb_page_free(MDB_env *env, MDB_page *mp)
1261 mp->mp_next = env->me_dpages;
1262 VGMEMP_FREE(env, mp);
1263 env->me_dpages = mp;
1266 /** Allocate pages for writing.
1267 * If there are free pages available from older transactions, they
1268 * will be re-used first. Otherwise a new page will be allocated.
1269 * @param[in] mc cursor A cursor handle identifying the transaction and
1270 * database for which we are allocating.
1271 * @param[in] num the number of pages to allocate.
1272 * @param[out] mp Address of the allocated page(s). Requests for multiple pages
1273 * will always be satisfied by a single contiguous chunk of memory.
1274 * @return 0 on success, non-zero on failure.
1277 mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp)
1279 MDB_txn *txn = mc->mc_txn;
1281 pgno_t pgno = P_INVALID;
1283 txnid_t oldest = 0, last;
1288 /* If our dirty list is already full, we can't do anything */
1289 if (txn->mt_dirty_room == 0)
1290 return MDB_TXN_FULL;
1292 /* The free list won't have any content at all until txn 2 has
1293 * committed. The pages freed by txn 2 will be unreferenced
1294 * after txn 3 commits, and so will be safe to re-use in txn 4.
1296 if (txn->mt_txnid > 3) {
1297 if (!txn->mt_env->me_pghead &&
1298 txn->mt_dbs[FREE_DBI].md_root != P_INVALID) {
1299 /* See if there's anything in the free DB */
1306 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1307 if (!txn->mt_env->me_pglast) {
1308 mdb_page_search(&m2, NULL, 0);
1309 leaf = NODEPTR(m2.mc_pg[m2.mc_top], 0);
1310 kptr = (txnid_t *)NODEKEY(leaf);
1315 last = txn->mt_env->me_pglast + 1;
1317 key.mv_data = &last;
1318 key.mv_size = sizeof(last);
1319 rc = mdb_cursor_set(&m2, &key, &data, MDB_SET_RANGE, NULL);
1322 last = *(txnid_t *)key.mv_data;
1328 oldest = txn->mt_txnid - 1;
1329 nr = txn->mt_env->me_txns->mti_numreaders;
1330 r = txn->mt_env->me_txns->mti_readers;
1331 for (i=0; i<nr; i++) {
1332 if (!r[i].mr_pid) continue;
1339 if (oldest > last) {
1340 /* It's usable, grab it.
1344 if (!txn->mt_env->me_pglast) {
1345 mdb_node_read(txn, leaf, &data);
1347 idl = (MDB_ID *) data.mv_data;
1348 /* We might have a zero-length IDL due to freelist growth
1349 * during a prior commit
1352 txn->mt_env->me_pglast = last;
1355 mop = malloc(MDB_IDL_SIZEOF(idl));
1358 txn->mt_env->me_pglast = last;
1359 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = mop;
1360 memcpy(mop, idl, MDB_IDL_SIZEOF(idl));
1365 DPRINTF("IDL read txn %zu root %zu num %zu",
1366 last, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
1367 for (i=0; i<idl[0]; i++) {
1368 DPRINTF("IDL %zu", idl[i+1]);
1375 if (txn->mt_env->me_pghead) {
1376 pgno_t *mop = txn->mt_env->me_pghead;
1379 int retry = 1, readit = 0, n2 = num-1;
1380 unsigned int i, j, k;
1382 /* If current list is too short, must fetch more and coalesce */
1383 if (mop[0] < (unsigned)num)
1386 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
1388 /* If on freelist, don't try to read more. If what we have
1389 * right now isn't enough just use new pages.
1390 * TODO: get all of this working. Many circular dependencies...
1392 if (mc->mc_dbi == FREE_DBI) {
1400 last = txn->mt_env->me_pglast + 1;
1402 /* We haven't hit the readers list yet? */
1408 oldest = txn->mt_txnid - 1;
1409 nr = txn->mt_env->me_txns->mti_numreaders;
1410 r = txn->mt_env->me_txns->mti_readers;
1411 for (i=0; i<nr; i++) {
1412 if (!r[i].mr_pid) continue;
1419 /* There's nothing we can use on the freelist */
1420 if (oldest - last < 1)
1423 key.mv_data = &last;
1424 key.mv_size = sizeof(last);
1425 rc = mdb_cursor_set(&m2,&key,&data,MDB_SET_RANGE,NULL);
1427 if (rc == MDB_NOTFOUND)
1431 last = *(txnid_t*)key.mv_data;
1434 idl = (MDB_ID *) data.mv_data;
1435 mop2 = malloc(MDB_IDL_SIZEOF(idl) + MDB_IDL_SIZEOF(mop));
1438 /* merge in sorted order */
1439 i = idl[0]; j = mop[0]; mop2[0] = k = i+j;
1441 while (i>0 || j>0) {
1442 if (i && idl[i] < mop[j])
1443 mop2[k--] = idl[i--];
1445 mop2[k--] = mop[j--];
1447 txn->mt_env->me_pglast = last;
1448 free(txn->mt_env->me_pgfree);
1449 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = mop2;
1451 /* Keep trying to read until we have enough */
1452 if (mop[0] < (unsigned)num) {
1457 /* current list has enough pages, but are they contiguous? */
1458 for (i=mop[0]; i>=(unsigned)num; i--) {
1459 if (mop[i-n2] == mop[i] + n2) {
1462 /* move any stragglers down */
1463 for (j=i+num; j<=mop[0]; j++)
1470 /* Stop if we succeeded, or no retries */
1471 if (!retry || pgno != P_INVALID)
1477 /* peel pages off tail, so we only have to truncate the list */
1478 pgno = MDB_IDL_LAST(mop);
1481 if (MDB_IDL_IS_ZERO(mop)) {
1482 free(txn->mt_env->me_pgfree);
1483 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = NULL;
1488 if (pgno == P_INVALID) {
1489 /* DB size is maxed out */
1490 if (txn->mt_next_pgno + num >= txn->mt_env->me_maxpg) {
1491 DPUTS("DB size maxed out");
1492 return MDB_MAP_FULL;
1495 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1496 if (pgno == P_INVALID) {
1497 pgno = txn->mt_next_pgno;
1498 txn->mt_next_pgno += num;
1500 np = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
1503 if (txn->mt_env->me_dpages && num == 1) {
1504 np = txn->mt_env->me_dpages;
1505 VGMEMP_ALLOC(txn->mt_env, np, txn->mt_env->me_psize);
1506 VGMEMP_DEFINED(np, sizeof(np->mp_next));
1507 txn->mt_env->me_dpages = np->mp_next;
1509 size_t sz = txn->mt_env->me_psize * num;
1510 if ((np = malloc(sz)) == NULL)
1512 VGMEMP_ALLOC(txn->mt_env, np, sz);
1514 if (pgno == P_INVALID) {
1515 np->mp_pgno = txn->mt_next_pgno;
1516 txn->mt_next_pgno += num;
1521 mid.mid = np->mp_pgno;
1523 if (txn->mt_env->me_flags & MDB_WRITEMAP) {
1524 mdb_mid2l_append(txn->mt_u.dirty_list, &mid);
1526 mdb_mid2l_insert(txn->mt_u.dirty_list, &mid);
1528 txn->mt_dirty_room--;
1534 /** Copy a page: avoid copying unused portions of the page.
1535 * @param[in] dst page to copy into
1536 * @param[in] src page to copy from
1539 mdb_page_copy(MDB_page *dst, MDB_page *src, unsigned int psize)
1541 dst->mp_flags = src->mp_flags | P_DIRTY;
1542 dst->mp_pages = src->mp_pages;
1544 if (IS_LEAF2(src)) {
1545 memcpy(dst->mp_ptrs, src->mp_ptrs, psize - PAGEHDRSZ - SIZELEFT(src));
1547 unsigned int i, nkeys = NUMKEYS(src);
1548 for (i=0; i<nkeys; i++)
1549 dst->mp_ptrs[i] = src->mp_ptrs[i];
1550 memcpy((char *)dst+src->mp_upper, (char *)src+src->mp_upper,
1551 psize - src->mp_upper);
1555 /** Touch a page: make it dirty and re-insert into tree with updated pgno.
1556 * @param[in] mc cursor pointing to the page to be touched
1557 * @return 0 on success, non-zero on failure.
1560 mdb_page_touch(MDB_cursor *mc)
1562 MDB_page *mp = mc->mc_pg[mc->mc_top];
1566 if (!F_ISSET(mp->mp_flags, P_DIRTY)) {
1568 if ((rc = mdb_page_alloc(mc, 1, &np)))
1570 DPRINTF("touched db %u page %zu -> %zu", mc->mc_dbi, mp->mp_pgno, np->mp_pgno);
1571 assert(mp->mp_pgno != np->mp_pgno);
1572 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
1574 /* If page isn't full, just copy the used portion */
1575 mdb_page_copy(np, mp, mc->mc_txn->mt_env->me_psize);
1578 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1580 np->mp_flags |= P_DIRTY;
1585 /* Adjust other cursors pointing to mp */
1586 if (mc->mc_flags & C_SUB) {
1587 MDB_cursor *m2, *m3;
1588 MDB_dbi dbi = mc->mc_dbi-1;
1590 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
1591 if (m2 == mc) continue;
1592 m3 = &m2->mc_xcursor->mx_cursor;
1593 if (m3->mc_snum < mc->mc_snum) continue;
1594 if (m3->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1595 m3->mc_pg[mc->mc_top] = mp;
1601 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
1602 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
1603 if (m2->mc_pg[mc->mc_top] == mc->mc_pg[mc->mc_top]) {
1604 m2->mc_pg[mc->mc_top] = mp;
1608 mc->mc_pg[mc->mc_top] = mp;
1609 /** If this page has a parent, update the parent to point to
1613 SETPGNO(NODEPTR(mc->mc_pg[mc->mc_top-1], mc->mc_ki[mc->mc_top-1]), mp->mp_pgno);
1615 mc->mc_db->md_root = mp->mp_pgno;
1616 } else if (mc->mc_txn->mt_parent) {
1619 /* If txn has a parent, make sure the page is in our
1622 if (mc->mc_txn->mt_u.dirty_list[0].mid) {
1623 unsigned x = mdb_mid2l_search(mc->mc_txn->mt_u.dirty_list, mp->mp_pgno);
1624 if (x <= mc->mc_txn->mt_u.dirty_list[0].mid &&
1625 mc->mc_txn->mt_u.dirty_list[x].mid == mp->mp_pgno) {
1626 if (mc->mc_txn->mt_u.dirty_list[x].mptr != mp) {
1627 mp = mc->mc_txn->mt_u.dirty_list[x].mptr;
1628 mc->mc_pg[mc->mc_top] = mp;
1633 assert(mc->mc_txn->mt_u.dirty_list[0].mid < MDB_IDL_UM_MAX);
1635 np = mdb_page_malloc(mc);
1638 memcpy(np, mp, mc->mc_txn->mt_env->me_psize);
1639 mid.mid = np->mp_pgno;
1641 mdb_mid2l_insert(mc->mc_txn->mt_u.dirty_list, &mid);
1649 mdb_env_sync(MDB_env *env, int force)
1652 if (force || !F_ISSET(env->me_flags, MDB_NOSYNC)) {
1653 if (env->me_flags & MDB_WRITEMAP) {
1654 int flags = ((env->me_flags & MDB_MAPASYNC) && !force)
1655 ? MS_ASYNC : MS_SYNC;
1656 if (MDB_MSYNC(env->me_map, env->me_mapsize, flags))
1659 else if (flags == MS_SYNC && MDB_FDATASYNC(env->me_fd))
1663 if (MDB_FDATASYNC(env->me_fd))
1670 /** Make shadow copies of all of parent txn's cursors */
1672 mdb_cursor_shadow(MDB_txn *src, MDB_txn *dst)
1674 MDB_cursor *mc, *m2;
1675 unsigned int i, j, size;
1677 for (i=0;i<src->mt_numdbs; i++) {
1678 if (src->mt_cursors[i]) {
1679 size = sizeof(MDB_cursor);
1680 if (src->mt_cursors[i]->mc_xcursor)
1681 size += sizeof(MDB_xcursor);
1682 for (m2 = src->mt_cursors[i]; m2; m2=m2->mc_next) {
1689 mc->mc_db = &dst->mt_dbs[i];
1690 mc->mc_dbx = m2->mc_dbx;
1691 mc->mc_dbflag = &dst->mt_dbflags[i];
1692 mc->mc_snum = m2->mc_snum;
1693 mc->mc_top = m2->mc_top;
1694 mc->mc_flags = m2->mc_flags | C_SHADOW;
1695 for (j=0; j<mc->mc_snum; j++) {
1696 mc->mc_pg[j] = m2->mc_pg[j];
1697 mc->mc_ki[j] = m2->mc_ki[j];
1699 if (m2->mc_xcursor) {
1700 MDB_xcursor *mx, *mx2;
1701 mx = (MDB_xcursor *)(mc+1);
1702 mc->mc_xcursor = mx;
1703 mx2 = m2->mc_xcursor;
1704 mx->mx_db = mx2->mx_db;
1705 mx->mx_dbx = mx2->mx_dbx;
1706 mx->mx_dbflag = mx2->mx_dbflag;
1707 mx->mx_cursor.mc_txn = dst;
1708 mx->mx_cursor.mc_dbi = mx2->mx_cursor.mc_dbi;
1709 mx->mx_cursor.mc_db = &mx->mx_db;
1710 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
1711 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
1712 mx->mx_cursor.mc_snum = mx2->mx_cursor.mc_snum;
1713 mx->mx_cursor.mc_top = mx2->mx_cursor.mc_top;
1714 mx->mx_cursor.mc_flags = mx2->mx_cursor.mc_flags | C_SHADOW;
1715 for (j=0; j<mx2->mx_cursor.mc_snum; j++) {
1716 mx->mx_cursor.mc_pg[j] = mx2->mx_cursor.mc_pg[j];
1717 mx->mx_cursor.mc_ki[j] = mx2->mx_cursor.mc_ki[j];
1720 mc->mc_xcursor = NULL;
1722 mc->mc_next = dst->mt_cursors[i];
1723 dst->mt_cursors[i] = mc;
1730 /** Merge shadow cursors back into parent's */
1732 mdb_cursor_merge(MDB_txn *txn)
1735 for (i=0; i<txn->mt_numdbs; i++) {
1736 if (txn->mt_cursors[i]) {
1738 while ((mc = txn->mt_cursors[i])) {
1739 txn->mt_cursors[i] = mc->mc_next;
1740 if (mc->mc_flags & C_SHADOW) {
1741 MDB_cursor *m2 = mc->mc_orig;
1743 m2->mc_snum = mc->mc_snum;
1744 m2->mc_top = mc->mc_top;
1745 for (j=0; j<mc->mc_snum; j++) {
1746 m2->mc_pg[j] = mc->mc_pg[j];
1747 m2->mc_ki[j] = mc->mc_ki[j];
1750 if (mc->mc_flags & C_ALLOCD)
1758 mdb_txn_reset0(MDB_txn *txn);
1760 /** Common code for #mdb_txn_begin() and #mdb_txn_renew().
1761 * @param[in] txn the transaction handle to initialize
1762 * @return 0 on success, non-zero on failure. This can only
1763 * fail for read-only transactions, and then only if the
1764 * reader table is full.
1767 mdb_txn_renew0(MDB_txn *txn)
1769 MDB_env *env = txn->mt_env;
1774 txn->mt_numdbs = env->me_numdbs;
1775 txn->mt_dbxs = env->me_dbxs; /* mostly static anyway */
1777 if (txn->mt_flags & MDB_TXN_RDONLY) {
1778 if (env->me_flags & MDB_ROFS) {
1779 i = mdb_env_pick_meta(env);
1780 txn->mt_txnid = env->me_metas[i]->mm_txnid;
1781 txn->mt_u.reader = NULL;
1783 MDB_reader *r = pthread_getspecific(env->me_txkey);
1785 pid_t pid = env->me_pid;
1786 pthread_t tid = pthread_self();
1789 for (i=0; i<env->me_txns->mti_numreaders; i++)
1790 if (env->me_txns->mti_readers[i].mr_pid == 0)
1792 if (i == env->me_maxreaders) {
1793 UNLOCK_MUTEX_R(env);
1794 return MDB_READERS_FULL;
1796 env->me_txns->mti_readers[i].mr_pid = pid;
1797 env->me_txns->mti_readers[i].mr_tid = tid;
1798 if (i >= env->me_txns->mti_numreaders)
1799 env->me_txns->mti_numreaders = i+1;
1800 /* Save numreaders for un-mutexed mdb_env_close() */
1801 env->me_numreaders = env->me_txns->mti_numreaders;
1802 UNLOCK_MUTEX_R(env);
1803 r = &env->me_txns->mti_readers[i];
1804 if ((rc = pthread_setspecific(env->me_txkey, r)) != 0) {
1805 env->me_txns->mti_readers[i].mr_pid = 0;
1809 txn->mt_txnid = r->mr_txnid = env->me_txns->mti_txnid;
1810 txn->mt_u.reader = r;
1812 txn->mt_toggle = txn->mt_txnid & 1;
1813 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1817 txn->mt_txnid = env->me_txns->mti_txnid;
1818 txn->mt_toggle = txn->mt_txnid & 1;
1819 txn->mt_next_pgno = env->me_metas[txn->mt_toggle]->mm_last_pg+1;
1822 if (txn->mt_txnid == mdb_debug_start)
1825 txn->mt_dirty_room = MDB_IDL_UM_MAX;
1826 txn->mt_u.dirty_list = env->me_dirty_list;
1827 txn->mt_u.dirty_list[0].mid = 0;
1828 txn->mt_free_pgs = env->me_free_pgs;
1829 txn->mt_free_pgs[0] = 0;
1833 /* Copy the DB info and flags */
1834 memcpy(txn->mt_dbs, env->me_metas[txn->mt_toggle]->mm_dbs, 2 * sizeof(MDB_db));
1835 for (i=2; i<txn->mt_numdbs; i++)
1836 txn->mt_dbs[i].md_flags = env->me_dbflags[i];
1837 txn->mt_dbflags[0] = txn->mt_dbflags[1] = 0;
1838 if (txn->mt_numdbs > 2)
1839 memset(txn->mt_dbflags+2, DB_STALE, txn->mt_numdbs-2);
1841 if (env->me_maxpg < txn->mt_next_pgno) {
1842 mdb_txn_reset0(txn);
1843 return MDB_MAP_RESIZED;
1850 mdb_txn_renew(MDB_txn *txn)
1854 if (! (txn && (txn->mt_flags & MDB_TXN_RDONLY)))
1857 if (txn->mt_env->me_flags & MDB_FATAL_ERROR) {
1858 DPUTS("environment had fatal error, must shutdown!");
1862 rc = mdb_txn_renew0(txn);
1863 if (rc == MDB_SUCCESS) {
1864 DPRINTF("renew txn %zu%c %p on mdbenv %p, root page %zu",
1865 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1866 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
1872 mdb_txn_begin(MDB_env *env, MDB_txn *parent, unsigned int flags, MDB_txn **ret)
1876 int rc, size, tsize = sizeof(MDB_txn);
1878 if (env->me_flags & MDB_FATAL_ERROR) {
1879 DPUTS("environment had fatal error, must shutdown!");
1882 if ((env->me_flags & MDB_RDONLY) && !(flags & MDB_RDONLY))
1885 /* Nested transactions: Max 1 child, write txns only, no writemap */
1886 if (parent->mt_child ||
1887 (flags & MDB_RDONLY) || (parent->mt_flags & MDB_TXN_RDONLY) ||
1888 (env->me_flags & MDB_WRITEMAP))
1892 tsize = sizeof(MDB_ntxn);
1894 size = tsize + env->me_maxdbs * (sizeof(MDB_db)+1);
1895 if (!(flags & MDB_RDONLY))
1896 size += env->me_maxdbs * sizeof(MDB_cursor *);
1898 if ((txn = calloc(1, size)) == NULL) {
1899 DPRINTF("calloc: %s", strerror(ErrCode()));
1902 txn->mt_dbs = (MDB_db *) ((char *)txn + tsize);
1903 if (flags & MDB_RDONLY) {
1904 txn->mt_flags |= MDB_TXN_RDONLY;
1905 txn->mt_dbflags = (unsigned char *)(txn->mt_dbs + env->me_maxdbs);
1907 txn->mt_cursors = (MDB_cursor **)(txn->mt_dbs + env->me_maxdbs);
1908 txn->mt_dbflags = (unsigned char *)(txn->mt_cursors + env->me_maxdbs);
1913 txn->mt_free_pgs = mdb_midl_alloc();
1914 if (!txn->mt_free_pgs) {
1918 txn->mt_u.dirty_list = malloc(sizeof(MDB_ID2)*MDB_IDL_UM_SIZE);
1919 if (!txn->mt_u.dirty_list) {
1920 free(txn->mt_free_pgs);
1924 txn->mt_txnid = parent->mt_txnid;
1925 txn->mt_toggle = parent->mt_toggle;
1926 txn->mt_dirty_room = parent->mt_dirty_room;
1927 txn->mt_u.dirty_list[0].mid = 0;
1928 txn->mt_free_pgs[0] = 0;
1929 txn->mt_next_pgno = parent->mt_next_pgno;
1930 parent->mt_child = txn;
1931 txn->mt_parent = parent;
1932 txn->mt_numdbs = parent->mt_numdbs;
1933 txn->mt_dbxs = parent->mt_dbxs;
1934 memcpy(txn->mt_dbs, parent->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
1935 memcpy(txn->mt_dbflags, parent->mt_dbflags, txn->mt_numdbs);
1937 ntxn = (MDB_ntxn *)txn;
1938 ntxn->mnt_pgstate = env->me_pgstate; /* save parent me_pghead & co */
1939 if (env->me_pghead) {
1940 size = MDB_IDL_SIZEOF(env->me_pghead);
1941 env->me_pghead = malloc(size);
1943 memcpy(env->me_pghead, ntxn->mnt_pgstate.mf_pghead, size);
1947 env->me_pgfree = env->me_pghead;
1949 rc = mdb_cursor_shadow(parent, txn);
1951 mdb_txn_reset0(txn);
1953 rc = mdb_txn_renew0(txn);
1959 DPRINTF("begin txn %zu%c %p on mdbenv %p, root page %zu",
1960 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
1961 (void *) txn, (void *) env, txn->mt_dbs[MAIN_DBI].md_root);
1967 /** Common code for #mdb_txn_reset() and #mdb_txn_abort().
1968 * @param[in] txn the transaction handle to reset
1971 mdb_txn_reset0(MDB_txn *txn)
1973 MDB_env *env = txn->mt_env;
1975 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
1976 if (!(env->me_flags & MDB_ROFS))
1977 txn->mt_u.reader->mr_txnid = (txnid_t)-1;
1982 /* close(free) all cursors */
1983 for (i=0; i<txn->mt_numdbs; i++) {
1984 if (txn->mt_cursors[i]) {
1986 while ((mc = txn->mt_cursors[i])) {
1987 txn->mt_cursors[i] = mc->mc_next;
1988 if (mc->mc_flags & C_ALLOCD)
1994 if (!(env->me_flags & MDB_WRITEMAP)) {
1995 /* return all dirty pages to dpage list */
1996 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
1997 dp = txn->mt_u.dirty_list[i].mptr;
1998 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
1999 mdb_page_free(txn->mt_env, dp);
2001 /* large pages just get freed directly */
2002 VGMEMP_FREE(txn->mt_env, dp);
2008 free(env->me_pgfree);
2010 if (txn->mt_parent) {
2011 txn->mt_parent->mt_child = NULL;
2012 env->me_pgstate = ((MDB_ntxn *)txn)->mnt_pgstate;
2013 mdb_midl_free(txn->mt_free_pgs);
2014 free(txn->mt_u.dirty_list);
2017 if (mdb_midl_shrink(&txn->mt_free_pgs))
2018 env->me_free_pgs = txn->mt_free_pgs;
2021 txn->mt_env->me_pghead = txn->mt_env->me_pgfree = NULL;
2022 txn->mt_env->me_pglast = 0;
2025 /* The writer mutex was locked in mdb_txn_begin. */
2026 UNLOCK_MUTEX_W(env);
2031 mdb_txn_reset(MDB_txn *txn)
2036 DPRINTF("reset txn %zu%c %p on mdbenv %p, root page %zu",
2037 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2038 (void *) txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
2040 mdb_txn_reset0(txn);
2044 mdb_txn_abort(MDB_txn *txn)
2049 DPRINTF("abort txn %zu%c %p on mdbenv %p, root page %zu",
2050 txn->mt_txnid, (txn->mt_flags & MDB_TXN_RDONLY) ? 'r' : 'w',
2051 (void *)txn, (void *)txn->mt_env, txn->mt_dbs[MAIN_DBI].md_root);
2054 mdb_txn_abort(txn->mt_child);
2056 mdb_txn_reset0(txn);
2061 mdb_txn_commit(MDB_txn *txn)
2069 pgno_t next, freecnt;
2070 txnid_t oldpg_txnid, id;
2073 assert(txn != NULL);
2074 assert(txn->mt_env != NULL);
2076 if (txn->mt_child) {
2077 mdb_txn_commit(txn->mt_child);
2078 txn->mt_child = NULL;
2083 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
2084 if (txn->mt_numdbs > env->me_numdbs) {
2085 /* update the DB flags */
2087 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
2088 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
2095 if (F_ISSET(txn->mt_flags, MDB_TXN_ERROR)) {
2096 DPUTS("error flag is set, can't commit");
2098 txn->mt_parent->mt_flags |= MDB_TXN_ERROR;
2103 if (txn->mt_parent) {
2104 MDB_txn *parent = txn->mt_parent;
2108 /* Append our free list to parent's */
2109 if (mdb_midl_append_list(&parent->mt_free_pgs, txn->mt_free_pgs)) {
2113 mdb_midl_free(txn->mt_free_pgs);
2115 parent->mt_next_pgno = txn->mt_next_pgno;
2116 parent->mt_flags = txn->mt_flags;
2118 /* Merge (and close) our cursors with parent's */
2119 mdb_cursor_merge(txn);
2121 /* Update parent's DB table. */
2122 memcpy(parent->mt_dbs, txn->mt_dbs, txn->mt_numdbs * sizeof(MDB_db));
2123 memcpy(parent->mt_dbflags, txn->mt_dbflags, txn->mt_numdbs);
2124 txn->mt_parent->mt_numdbs = txn->mt_numdbs;
2126 dst = txn->mt_parent->mt_u.dirty_list;
2127 src = txn->mt_u.dirty_list;
2128 /* Find len = length of merging our dirty list with parent's */
2130 dst[0].mid = 0; /* simplify loops */
2131 if (parent->mt_parent) {
2132 len = x + src[0].mid;
2133 y = mdb_mid2l_search(src, dst[x].mid + 1) - 1;
2134 for (i = x; y && i; y--) {
2135 pgno_t yp = src[y].mid;
2136 while (yp < dst[i].mid)
2138 if (yp == dst[i].mid) {
2143 } else { /* Simplify the above for single-ancestor case */
2144 len = MDB_IDL_UM_MAX - txn->mt_dirty_room;
2146 /* Merge our dirty list with parent's */
2148 for (i = len; y; dst[i--] = src[y--]) {
2149 pgno_t yp = src[y].mid;
2150 while (yp < dst[x].mid)
2151 dst[i--] = dst[x--];
2152 if (yp == dst[x].mid)
2153 free(dst[x--].mptr);
2157 free(txn->mt_u.dirty_list);
2158 parent->mt_dirty_room = txn->mt_dirty_room;
2160 txn->mt_parent->mt_child = NULL;
2161 free(((MDB_ntxn *)txn)->mnt_pgstate.mf_pgfree);
2166 if (txn != env->me_txn) {
2167 DPUTS("attempt to commit unknown transaction");
2172 if (!txn->mt_u.dirty_list[0].mid && !(txn->mt_flags & MDB_TXN_DIRTY))
2175 DPRINTF("committing txn %zu %p on mdbenv %p, root page %zu",
2176 txn->mt_txnid, (void *)txn, (void *)env, txn->mt_dbs[MAIN_DBI].md_root);
2178 /* Update DB root pointers */
2179 if (txn->mt_numdbs > 2) {
2182 data.mv_size = sizeof(MDB_db);
2184 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
2185 for (i = 2; i < txn->mt_numdbs; i++) {
2186 if (txn->mt_dbflags[i] & DB_DIRTY) {
2187 data.mv_data = &txn->mt_dbs[i];
2188 rc = mdb_cursor_put(&mc, &txn->mt_dbxs[i].md_name, &data, 0);
2195 /* Save the freelist as of this transaction to the freeDB. This
2196 * can change the freelist, so keep trying until it stabilizes.
2198 * env->me_pglast and the length of txn->mt_free_pgs cannot decrease,
2199 * except the code below can decrease env->me_pglast to split pghead.
2200 * Page numbers cannot disappear from txn->mt_free_pgs. New pages
2201 * can only appear in env->me_pghead when env->me_pglast increases.
2202 * Until then, the me_pghead pointer won't move but can become NULL.
2205 mdb_cursor_init(&mc, txn, FREE_DBI, NULL);
2206 oldpg_txnid = id = 0;
2209 /* should only be one record now */
2210 if (env->me_pghead || env->me_pglast) {
2211 /* make sure first page of freeDB is touched and on freelist */
2212 rc = mdb_page_search(&mc, NULL, MDB_PS_MODIFY);
2213 if (rc && rc != MDB_NOTFOUND) {
2220 /* Delete IDLs we used from the free list */
2221 if (env->me_pglast) {
2226 rc = mdb_cursor_first(&mc, &key, NULL);
2229 oldpg_txnid = *(txnid_t *)key.mv_data;
2231 assert(oldpg_txnid <= env->me_pglast);
2233 rc = mdb_cursor_del(&mc, 0);
2236 } while (oldpg_txnid < env->me_pglast);
2239 /* Save IDL of pages freed by this txn, to freeDB */
2241 if (freecnt != txn->mt_free_pgs[0]) {
2244 /* make sure last page of freeDB is touched and on freelist */
2245 key.mv_size = MDB_MAXKEYSIZE+1;
2247 rc = mdb_page_search(&mc, &key, MDB_PS_MODIFY);
2248 if (rc && rc != MDB_NOTFOUND)
2254 MDB_IDL idl = txn->mt_free_pgs;
2255 mdb_midl_sort(txn->mt_free_pgs);
2256 DPRINTF("IDL write txn %zu root %zu num %zu",
2257 txn->mt_txnid, txn->mt_dbs[FREE_DBI].md_root, idl[0]);
2258 for (i=1; i<=idl[0]; i++) {
2259 DPRINTF("IDL %zu", idl[i]);
2263 /* write to last page of freeDB */
2264 key.mv_size = sizeof(pgno_t);
2265 key.mv_data = &txn->mt_txnid;
2266 /* The free list can still grow during this call,
2267 * despite the pre-emptive touches above. So retry
2268 * until the reserved space remains big enough.
2271 assert(freecnt < txn->mt_free_pgs[0]);
2272 freecnt = txn->mt_free_pgs[0];
2273 data.mv_size = MDB_IDL_SIZEOF(txn->mt_free_pgs);
2274 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2277 } while (freecnt != txn->mt_free_pgs[0]);
2278 mdb_midl_sort(txn->mt_free_pgs);
2279 memcpy(data.mv_data, txn->mt_free_pgs, data.mv_size);
2280 if (oldpg_txnid < env->me_pglast || (!env->me_pghead && id))
2281 goto free_pgfirst; /* used up freeDB[oldpg_txnid] */
2284 /* Put back page numbers we took from freeDB but did not use */
2285 if (env->me_pghead) {
2290 mop = env->me_pghead;
2291 id = env->me_pglast;
2292 key.mv_size = sizeof(id);
2294 /* These steps may grow the freelist again
2295 * due to freed overflow pages...
2300 if (orig > env->me_maxfree_1pg && id > 4)
2301 orig = env->me_maxfree_1pg; /* Do not use more than 1 page */
2302 data.mv_size = (orig + 1) * sizeof(pgno_t);
2303 rc = mdb_cursor_put(&mc, &key, &data, MDB_RESERVE);
2306 assert(!env->me_pghead || env->me_pglast);
2307 /* mop could have been used again here */
2308 if (id != env->me_pglast || env->me_pghead == NULL)
2309 goto again; /* was completely used up */
2310 assert(mop == env->me_pghead);
2311 } while (mop[0] < orig && --i);
2312 memcpy(data.mv_data, mop, data.mv_size);
2315 *(pgno_t *)data.mv_data = orig;
2316 mop[orig] = mop[0] - orig;
2317 env->me_pghead = mop += orig;
2318 /* Save more oldpages at the previous txnid. */
2319 assert(env->me_pglast == id && id == oldpg_txnid);
2320 env->me_pglast = --oldpg_txnid;
2324 /* Check for growth of freelist again */
2325 if (freecnt != txn->mt_free_pgs[0])
2328 free(env->me_pgfree);
2329 env->me_pghead = env->me_pgfree = NULL;
2331 if (!MDB_IDL_IS_ZERO(txn->mt_free_pgs)) {
2332 if (mdb_midl_shrink(&txn->mt_free_pgs))
2333 env->me_free_pgs = txn->mt_free_pgs;
2340 if (env->me_flags & MDB_WRITEMAP) {
2341 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2342 dp = txn->mt_u.dirty_list[i].mptr;
2343 /* clear dirty flag */
2344 dp->mp_flags &= ~P_DIRTY;
2345 txn->mt_u.dirty_list[i].mid = 0;
2347 txn->mt_u.dirty_list[0].mid = 0;
2351 /* Commit up to MDB_COMMIT_PAGES dirty pages to disk until done.
2357 /* Windows actually supports scatter/gather I/O, but only on
2358 * unbuffered file handles. Since we're relying on the OS page
2359 * cache for all our data, that's self-defeating. So we just
2360 * write pages one at a time. We use the ov structure to set
2361 * the write offset, to at least save the overhead of a Seek
2365 memset(&ov, 0, sizeof(ov));
2366 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2368 dp = txn->mt_u.dirty_list[i].mptr;
2369 DPRINTF("committing page %zu", dp->mp_pgno);
2370 size = dp->mp_pgno * env->me_psize;
2371 ov.Offset = size & 0xffffffff;
2372 ov.OffsetHigh = size >> 16;
2373 ov.OffsetHigh >>= 16;
2374 /* clear dirty flag */
2375 dp->mp_flags &= ~P_DIRTY;
2376 wsize = env->me_psize;
2377 if (IS_OVERFLOW(dp)) wsize *= dp->mp_pages;
2378 rc = WriteFile(env->me_fd, dp, wsize, NULL, &ov);
2381 DPRINTF("WriteFile: %d", n);
2388 struct iovec iov[MDB_COMMIT_PAGES];
2392 for (; i<=txn->mt_u.dirty_list[0].mid; i++) {
2393 dp = txn->mt_u.dirty_list[i].mptr;
2394 if (dp->mp_pgno != next) {
2396 rc = writev(env->me_fd, iov, n);
2400 DPUTS("short write, filesystem full?");
2402 DPRINTF("writev: %s", strerror(n));
2409 lseek(env->me_fd, dp->mp_pgno * env->me_psize, SEEK_SET);
2412 DPRINTF("committing page %zu", dp->mp_pgno);
2413 iov[n].iov_len = env->me_psize;
2414 if (IS_OVERFLOW(dp)) iov[n].iov_len *= dp->mp_pages;
2415 iov[n].iov_base = (char *)dp;
2416 size += iov[n].iov_len;
2417 next = dp->mp_pgno + (IS_OVERFLOW(dp) ? dp->mp_pages : 1);
2418 /* clear dirty flag */
2419 dp->mp_flags &= ~P_DIRTY;
2420 if (++n >= MDB_COMMIT_PAGES) {
2430 rc = writev(env->me_fd, iov, n);
2434 DPUTS("short write, filesystem full?");
2436 DPRINTF("writev: %s", strerror(n));
2443 /* Drop the dirty pages.
2445 for (i=1; i<=txn->mt_u.dirty_list[0].mid; i++) {
2446 dp = txn->mt_u.dirty_list[i].mptr;
2447 if (!IS_OVERFLOW(dp) || dp->mp_pages == 1) {
2448 mdb_page_free(txn->mt_env, dp);
2450 VGMEMP_FREE(txn->mt_env, dp);
2453 txn->mt_u.dirty_list[i].mid = 0;
2455 txn->mt_u.dirty_list[0].mid = 0;
2458 if ((n = mdb_env_sync(env, 0)) != 0 ||
2459 (n = mdb_env_write_meta(txn)) != MDB_SUCCESS) {
2467 if (txn->mt_numdbs > env->me_numdbs) {
2468 /* update the DB flags */
2470 for (i = env->me_numdbs; i<txn->mt_numdbs; i++)
2471 env->me_dbflags[i] = txn->mt_dbs[i].md_flags;
2475 UNLOCK_MUTEX_W(env);
2481 /** Read the environment parameters of a DB environment before
2482 * mapping it into memory.
2483 * @param[in] env the environment handle
2484 * @param[out] meta address of where to store the meta information
2485 * @return 0 on success, non-zero on failure.
2488 mdb_env_read_header(MDB_env *env, MDB_meta *meta)
2495 /* We don't know the page size yet, so use a minimum value.
2496 * Read both meta pages so we can use the latest one.
2499 for (i=0; i<2; i++) {
2501 if (!ReadFile(env->me_fd, &pbuf, MDB_PAGESIZE, (DWORD *)&rc, NULL) || rc == 0)
2503 if ((rc = read(env->me_fd, &pbuf, MDB_PAGESIZE)) == 0)
2508 else if (rc != MDB_PAGESIZE) {
2512 DPRINTF("read: %s", strerror(err));
2516 p = (MDB_page *)&pbuf;
2518 if (!F_ISSET(p->mp_flags, P_META)) {
2519 DPRINTF("page %zu not a meta page", p->mp_pgno);
2524 if (m->mm_magic != MDB_MAGIC) {
2525 DPUTS("meta has invalid magic");
2529 if (m->mm_version != MDB_VERSION) {
2530 DPRINTF("database is version %u, expected version %u",
2531 m->mm_version, MDB_VERSION);
2532 return MDB_VERSION_MISMATCH;
2536 if (m->mm_txnid > meta->mm_txnid)
2537 memcpy(meta, m, sizeof(*m));
2539 memcpy(meta, m, sizeof(*m));
2541 if (SetFilePointer(env->me_fd, meta->mm_psize, NULL, FILE_BEGIN) != meta->mm_psize)
2543 if (lseek(env->me_fd, meta->mm_psize, SEEK_SET) != meta->mm_psize)
2551 /** Write the environment parameters of a freshly created DB environment.
2552 * @param[in] env the environment handle
2553 * @param[out] meta address of where to store the meta information
2554 * @return 0 on success, non-zero on failure.
2557 mdb_env_init_meta(MDB_env *env, MDB_meta *meta)
2564 DPUTS("writing new meta page");
2566 GET_PAGESIZE(psize);
2568 meta->mm_magic = MDB_MAGIC;
2569 meta->mm_version = MDB_VERSION;
2570 meta->mm_mapsize = env->me_mapsize;
2571 meta->mm_psize = psize;
2572 meta->mm_last_pg = 1;
2573 meta->mm_flags = env->me_flags & 0xffff;
2574 meta->mm_flags |= MDB_INTEGERKEY;
2575 meta->mm_dbs[0].md_root = P_INVALID;
2576 meta->mm_dbs[1].md_root = P_INVALID;
2578 p = calloc(2, psize);
2580 p->mp_flags = P_META;
2583 memcpy(m, meta, sizeof(*meta));
2585 q = (MDB_page *)((char *)p + psize);
2588 q->mp_flags = P_META;
2591 memcpy(m, meta, sizeof(*meta));
2596 SetFilePointer(env->me_fd, 0, NULL, FILE_BEGIN);
2597 rc = WriteFile(env->me_fd, p, psize * 2, &len, NULL);
2598 rc = (len == psize * 2) ? MDB_SUCCESS : ErrCode();
2601 lseek(env->me_fd, 0, SEEK_SET);
2602 rc = write(env->me_fd, p, psize * 2);
2603 rc = (rc == (int)psize * 2) ? MDB_SUCCESS : ErrCode();
2609 /** Update the environment info to commit a transaction.
2610 * @param[in] txn the transaction that's being committed
2611 * @return 0 on success, non-zero on failure.
2614 mdb_env_write_meta(MDB_txn *txn)
2617 MDB_meta meta, metab, *mp;
2619 int rc, len, toggle;
2626 assert(txn != NULL);
2627 assert(txn->mt_env != NULL);
2629 toggle = !txn->mt_toggle;
2630 DPRINTF("writing meta page %d for root page %zu",
2631 toggle, txn->mt_dbs[MAIN_DBI].md_root);
2634 mp = env->me_metas[toggle];
2636 if (env->me_flags & MDB_WRITEMAP) {
2637 /* Persist any increases of mapsize config */
2638 if (env->me_mapsize > mp->mm_mapsize)
2639 mp->mm_mapsize = env->me_mapsize;
2640 mp->mm_dbs[0] = txn->mt_dbs[0];
2641 mp->mm_dbs[1] = txn->mt_dbs[1];
2642 mp->mm_last_pg = txn->mt_next_pgno - 1;
2643 mp->mm_txnid = txn->mt_txnid;
2644 if (!(env->me_flags & (MDB_NOMETASYNC|MDB_NOSYNC))) {
2645 rc = (env->me_flags & MDB_MAPASYNC) ? MS_ASYNC : MS_SYNC;
2648 ptr += env->me_psize;
2649 if (MDB_MSYNC(ptr, env->me_psize, rc)) {
2656 metab.mm_txnid = env->me_metas[toggle]->mm_txnid;
2657 metab.mm_last_pg = env->me_metas[toggle]->mm_last_pg;
2659 ptr = (char *)&meta;
2660 if (env->me_mapsize > mp->mm_mapsize) {
2661 /* Persist any increases of mapsize config */
2662 meta.mm_mapsize = env->me_mapsize;
2663 off = offsetof(MDB_meta, mm_mapsize);
2665 off = offsetof(MDB_meta, mm_dbs[0].md_depth);
2667 len = sizeof(MDB_meta) - off;
2670 meta.mm_dbs[0] = txn->mt_dbs[0];
2671 meta.mm_dbs[1] = txn->mt_dbs[1];
2672 meta.mm_last_pg = txn->mt_next_pgno - 1;
2673 meta.mm_txnid = txn->mt_txnid;
2676 off += env->me_psize;
2679 /* Write to the SYNC fd */
2680 mfd = env->me_flags & (MDB_NOSYNC|MDB_NOMETASYNC) ?
2681 env->me_fd : env->me_mfd;
2684 memset(&ov, 0, sizeof(ov));
2686 WriteFile(mfd, ptr, len, (DWORD *)&rc, &ov);
2689 rc = pwrite(mfd, ptr, len, off);
2694 DPUTS("write failed, disk error?");
2695 /* On a failure, the pagecache still contains the new data.
2696 * Write some old data back, to prevent it from being used.
2697 * Use the non-SYNC fd; we know it will fail anyway.
2699 meta.mm_last_pg = metab.mm_last_pg;
2700 meta.mm_txnid = metab.mm_txnid;
2702 WriteFile(env->me_fd, ptr, len, NULL, &ov);
2704 r2 = pwrite(env->me_fd, ptr, len, off);
2707 env->me_flags |= MDB_FATAL_ERROR;
2711 /* Memory ordering issues are irrelevant; since the entire writer
2712 * is wrapped by wmutex, all of these changes will become visible
2713 * after the wmutex is unlocked. Since the DB is multi-version,
2714 * readers will get consistent data regardless of how fresh or
2715 * how stale their view of these values is.
2717 txn->mt_env->me_txns->mti_txnid = txn->mt_txnid;
2722 /** Check both meta pages to see which one is newer.
2723 * @param[in] env the environment handle
2724 * @return meta toggle (0 or 1).
2727 mdb_env_pick_meta(const MDB_env *env)
2729 return (env->me_metas[0]->mm_txnid < env->me_metas[1]->mm_txnid);
2733 mdb_env_create(MDB_env **env)
2737 e = calloc(1, sizeof(MDB_env));
2741 e->me_free_pgs = mdb_midl_alloc();
2742 if (!e->me_free_pgs) {
2746 e->me_maxreaders = DEFAULT_READERS;
2748 e->me_fd = INVALID_HANDLE_VALUE;
2749 e->me_lfd = INVALID_HANDLE_VALUE;
2750 e->me_mfd = INVALID_HANDLE_VALUE;
2751 #ifdef MDB_USE_POSIX_SEM
2752 e->me_rmutex = SEM_FAILED;
2753 e->me_wmutex = SEM_FAILED;
2755 e->me_pid = getpid();
2756 VGMEMP_CREATE(e,0,0);
2762 mdb_env_set_mapsize(MDB_env *env, size_t size)
2766 env->me_mapsize = size;
2768 env->me_maxpg = env->me_mapsize / env->me_psize;
2773 mdb_env_set_maxdbs(MDB_env *env, MDB_dbi dbs)
2777 env->me_maxdbs = dbs + 2; /* Named databases + main and free DB */
2782 mdb_env_set_maxreaders(MDB_env *env, unsigned int readers)
2784 if (env->me_map || readers < 1)
2786 env->me_maxreaders = readers;
2791 mdb_env_get_maxreaders(MDB_env *env, unsigned int *readers)
2793 if (!env || !readers)
2795 *readers = env->me_maxreaders;
2799 /** Further setup required for opening an MDB environment
2802 mdb_env_open2(MDB_env *env)
2804 unsigned int flags = env->me_flags;
2805 int i, newenv = 0, prot;
2809 memset(&meta, 0, sizeof(meta));
2811 if ((i = mdb_env_read_header(env, &meta)) != 0) {
2814 DPUTS("new mdbenv");
2818 /* Was a mapsize configured? */
2819 if (!env->me_mapsize) {
2820 /* If this is a new environment, take the default,
2821 * else use the size recorded in the existing env.
2823 env->me_mapsize = newenv ? DEFAULT_MAPSIZE : meta.mm_mapsize;
2824 } else if (env->me_mapsize < meta.mm_mapsize) {
2825 /* If the configured size is smaller, make sure it's
2826 * still big enough. Silently round up to minimum if not.
2828 size_t minsize = (meta.mm_last_pg + 1) * meta.mm_psize;
2829 if (env->me_mapsize < minsize)
2830 env->me_mapsize = minsize;
2836 LONG sizelo, sizehi;
2837 sizelo = env->me_mapsize & 0xffffffff;
2838 sizehi = env->me_mapsize >> 16; /* pointless on WIN32, only needed on W64 */
2840 /* Windows won't create mappings for zero length files.
2841 * Just allocate the maxsize right now.
2844 SetFilePointer(env->me_fd, sizelo, sizehi ? &sizehi : NULL, 0);
2845 if (!SetEndOfFile(env->me_fd))
2847 SetFilePointer(env->me_fd, 0, NULL, 0);
2849 mh = CreateFileMapping(env->me_fd, NULL, flags & MDB_WRITEMAP ?
2850 PAGE_READWRITE : PAGE_READONLY,
2851 sizehi, sizelo, NULL);
2854 env->me_map = MapViewOfFileEx(mh, flags & MDB_WRITEMAP ?
2855 FILE_MAP_WRITE : FILE_MAP_READ,
2856 0, 0, env->me_mapsize, meta.mm_address);
2864 if (flags & MDB_WRITEMAP) {
2866 if (ftruncate(env->me_fd, env->me_mapsize) < 0)
2869 env->me_map = mmap(meta.mm_address, env->me_mapsize, prot, i,
2871 if (env->me_map == MAP_FAILED) {
2875 /* Turn off readahead. It's harmful when the DB is larger than RAM. */
2877 madvise(env->me_map, env->me_mapsize, MADV_RANDOM);
2879 #ifdef POSIX_MADV_RANDOM
2880 posix_madvise(env->me_map, env->me_mapsize, POSIX_MADV_RANDOM);
2881 #endif /* POSIX_MADV_RANDOM */
2882 #endif /* MADV_RANDOM */
2886 if (flags & MDB_FIXEDMAP)
2887 meta.mm_address = env->me_map;
2888 i = mdb_env_init_meta(env, &meta);
2889 if (i != MDB_SUCCESS) {
2892 } else if (meta.mm_address && env->me_map != meta.mm_address) {
2893 /* Can happen because the address argument to mmap() is just a
2894 * hint. mmap() can pick another, e.g. if the range is in use.
2895 * The MAP_FIXED flag would prevent that, but then mmap could
2896 * instead unmap existing pages to make room for the new map.
2898 return EBUSY; /* TODO: Make a new MDB_* error code? */
2900 env->me_psize = meta.mm_psize;
2901 env->me_maxfree_1pg = (env->me_psize - PAGEHDRSZ) / sizeof(pgno_t) - 1;
2902 env->me_nodemax = (env->me_psize - PAGEHDRSZ) / MDB_MINKEYS;
2904 env->me_maxpg = env->me_mapsize / env->me_psize;
2906 p = (MDB_page *)env->me_map;
2907 env->me_metas[0] = METADATA(p);
2908 env->me_metas[1] = (MDB_meta *)((char *)env->me_metas[0] + meta.mm_psize);
2912 int toggle = mdb_env_pick_meta(env);
2913 MDB_db *db = &env->me_metas[toggle]->mm_dbs[MAIN_DBI];
2915 DPRINTF("opened database version %u, pagesize %u",
2916 env->me_metas[0]->mm_version, env->me_psize);
2917 DPRINTF("using meta page %d", toggle);
2918 DPRINTF("depth: %u", db->md_depth);
2919 DPRINTF("entries: %zu", db->md_entries);
2920 DPRINTF("branch pages: %zu", db->md_branch_pages);
2921 DPRINTF("leaf pages: %zu", db->md_leaf_pages);
2922 DPRINTF("overflow pages: %zu", db->md_overflow_pages);
2923 DPRINTF("root: %zu", db->md_root);
2931 /** Release a reader thread's slot in the reader lock table.
2932 * This function is called automatically when a thread exits.
2933 * @param[in] ptr This points to the slot in the reader lock table.
2936 mdb_env_reader_dest(void *ptr)
2938 MDB_reader *reader = ptr;
2944 /** Junk for arranging thread-specific callbacks on Windows. This is
2945 * necessarily platform and compiler-specific. Windows supports up
2946 * to 1088 keys. Let's assume nobody opens more than 64 environments
2947 * in a single process, for now. They can override this if needed.
2949 #ifndef MAX_TLS_KEYS
2950 #define MAX_TLS_KEYS 64
2952 static pthread_key_t mdb_tls_keys[MAX_TLS_KEYS];
2953 static int mdb_tls_nkeys;
2955 static void NTAPI mdb_tls_callback(PVOID module, DWORD reason, PVOID ptr)
2959 case DLL_PROCESS_ATTACH: break;
2960 case DLL_THREAD_ATTACH: break;
2961 case DLL_THREAD_DETACH:
2962 for (i=0; i<mdb_tls_nkeys; i++) {
2963 MDB_reader *r = pthread_getspecific(mdb_tls_keys[i]);
2964 mdb_env_reader_dest(r);
2967 case DLL_PROCESS_DETACH: break;
2972 const PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2974 PIMAGE_TLS_CALLBACK mdb_tls_cbp __attribute__((section (".CRT$XLB"))) = mdb_tls_callback;
2978 /* Force some symbol references.
2979 * _tls_used forces the linker to create the TLS directory if not already done
2980 * mdb_tls_cbp prevents whole-program-optimizer from dropping the symbol.
2982 #pragma comment(linker, "/INCLUDE:_tls_used")
2983 #pragma comment(linker, "/INCLUDE:mdb_tls_cbp")
2984 #pragma const_seg(".CRT$XLB")
2985 extern const PIMAGE_TLS_CALLBACK mdb_tls_callback;
2986 const PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2989 #pragma comment(linker, "/INCLUDE:__tls_used")
2990 #pragma comment(linker, "/INCLUDE:_mdb_tls_cbp")
2991 #pragma data_seg(".CRT$XLB")
2992 PIMAGE_TLS_CALLBACK mdb_tls_cbp = mdb_tls_callback;
2994 #endif /* WIN 32/64 */
2995 #endif /* !__GNUC__ */
2998 /** Downgrade the exclusive lock on the region back to shared */
3000 mdb_env_share_locks(MDB_env *env, int *excl)
3002 int rc = 0, toggle = mdb_env_pick_meta(env);
3004 env->me_txns->mti_txnid = env->me_metas[toggle]->mm_txnid;
3009 /* First acquire a shared lock. The Unlock will
3010 * then release the existing exclusive lock.
3012 memset(&ov, 0, sizeof(ov));
3013 if (!LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3016 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3022 struct flock lock_info;
3023 /* The shared lock replaces the existing lock */
3024 memset((void *)&lock_info, 0, sizeof(lock_info));
3025 lock_info.l_type = F_RDLCK;
3026 lock_info.l_whence = SEEK_SET;
3027 lock_info.l_start = 0;
3028 lock_info.l_len = 1;
3029 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3030 (rc = ErrCode()) == EINTR) ;
3031 *excl = rc ? -1 : 0; /* error may mean we lost the lock */
3038 /** Try to get exlusive lock, otherwise shared.
3039 * Maintain *excl = -1: no/unknown lock, 0: shared, 1: exclusive.
3042 mdb_env_excl_lock(MDB_env *env, int *excl)
3046 if (LockFile(env->me_lfd, 0, 0, 1, 0)) {
3050 memset(&ov, 0, sizeof(ov));
3051 if (LockFileEx(env->me_lfd, 0, 0, 1, 0, &ov)) {
3058 struct flock lock_info;
3059 memset((void *)&lock_info, 0, sizeof(lock_info));
3060 lock_info.l_type = F_WRLCK;
3061 lock_info.l_whence = SEEK_SET;
3062 lock_info.l_start = 0;
3063 lock_info.l_len = 1;
3064 while ((rc = fcntl(env->me_lfd, F_SETLK, &lock_info)) &&
3065 (rc = ErrCode()) == EINTR) ;
3069 # ifdef MDB_USE_POSIX_SEM
3070 if (*excl < 0) /* always true when !MDB_USE_POSIX_SEM */
3073 lock_info.l_type = F_RDLCK;
3074 while ((rc = fcntl(env->me_lfd, F_SETLKW, &lock_info)) &&
3075 (rc = ErrCode()) == EINTR) ;
3083 #if defined(_WIN32) || defined(MDB_USE_POSIX_SEM)
3085 * hash_64 - 64 bit Fowler/Noll/Vo-0 FNV-1a hash code
3087 * @(#) $Revision: 5.1 $
3088 * @(#) $Id: hash_64a.c,v 5.1 2009/06/30 09:01:38 chongo Exp $
3089 * @(#) $Source: /usr/local/src/cmd/fnv/RCS/hash_64a.c,v $
3091 * http://www.isthe.com/chongo/tech/comp/fnv/index.html
3095 * Please do not copyright this code. This code is in the public domain.
3097 * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
3098 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
3099 * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
3100 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
3101 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
3102 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
3103 * PERFORMANCE OF THIS SOFTWARE.
3106 * chongo <Landon Curt Noll> /\oo/\
3107 * http://www.isthe.com/chongo/
3109 * Share and Enjoy! :-)
3112 typedef unsigned long long mdb_hash_t;
3113 #define MDB_HASH_INIT ((mdb_hash_t)0xcbf29ce484222325ULL)
3115 /** perform a 64 bit Fowler/Noll/Vo FNV-1a hash on a buffer
3116 * @param[in] str string to hash
3117 * @param[in] hval initial value for hash
3118 * @return 64 bit hash
3120 * NOTE: To use the recommended 64 bit FNV-1a hash, use MDB_HASH_INIT as the
3121 * hval arg on the first call.
3124 mdb_hash_val(MDB_val *val, mdb_hash_t hval)
3126 unsigned char *s = (unsigned char *)val->mv_data; /* unsigned string */
3127 unsigned char *end = s + val->mv_size;
3129 * FNV-1a hash each octet of the string
3132 /* xor the bottom with the current octet */
3133 hval ^= (mdb_hash_t)*s++;
3135 /* multiply by the 64 bit FNV magic prime mod 2^64 */
3136 hval += (hval << 1) + (hval << 4) + (hval << 5) +
3137 (hval << 7) + (hval << 8) + (hval << 40);
3139 /* return our new hash value */
3143 /** Hash the string and output the hash in hex.
3144 * @param[in] str string to hash
3145 * @param[out] hexbuf an array of 17 chars to hold the hash
3148 mdb_hash_hex(MDB_val *val, char *hexbuf)
3151 mdb_hash_t h = mdb_hash_val(val, MDB_HASH_INIT);
3152 for (i=0; i<8; i++) {
3153 hexbuf += sprintf(hexbuf, "%02x", (unsigned int)h & 0xff);
3159 /** Open and/or initialize the lock region for the environment.
3160 * @param[in] env The MDB environment.
3161 * @param[in] lpath The pathname of the file used for the lock region.
3162 * @param[in] mode The Unix permissions for the file, if we create it.
3163 * @param[out] excl Resulting file lock type: -1 none, 0 shared, 1 exclusive
3164 * @return 0 on success, non-zero on failure.
3167 mdb_env_setup_locks(MDB_env *env, char *lpath, int mode, int *excl)
3175 if ((env->me_lfd = CreateFile(lpath, GENERIC_READ|GENERIC_WRITE,
3176 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_ALWAYS,
3177 FILE_ATTRIBUTE_NORMAL, NULL)) == INVALID_HANDLE_VALUE) {
3179 if (rc == ERROR_WRITE_PROTECT && (env->me_flags & MDB_RDONLY)) {
3180 env->me_flags |= MDB_ROFS;
3185 /* Try to get exclusive lock. If we succeed, then
3186 * nobody is using the lock region and we should initialize it.
3188 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
3189 size = GetFileSize(env->me_lfd, NULL);
3195 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT, mode)) == -1) {
3197 if (rc == EROFS && (env->me_flags & MDB_RDONLY)) {
3198 env->me_flags |= MDB_ROFS;
3203 /* Lose record locks when exec*() */
3204 if ((fdflags = fcntl(env->me_lfd, F_GETFD) | FD_CLOEXEC) >= 0)
3205 fcntl(env->me_lfd, F_SETFD, fdflags);
3207 #else /* O_CLOEXEC on Linux: Open file and set FD_CLOEXEC atomically */
3208 if ((env->me_lfd = open(lpath, O_RDWR|O_CREAT|O_CLOEXEC, mode)) == -1) {
3210 if (rc == EROFS && (env->me_flags & MDB_RDONLY)) {
3211 env->me_flags |= MDB_ROFS;
3218 /* Try to get exclusive lock. If we succeed, then
3219 * nobody is using the lock region and we should initialize it.
3221 if ((rc = mdb_env_excl_lock(env, excl))) goto fail;
3223 size = lseek(env->me_lfd, 0, SEEK_END);
3225 rsize = (env->me_maxreaders-1) * sizeof(MDB_reader) + sizeof(MDB_txninfo);
3226 if (size < rsize && *excl > 0) {
3228 SetFilePointer(env->me_lfd, rsize, NULL, 0);
3229 if (!SetEndOfFile(env->me_lfd)) goto fail_errno;
3231 if (ftruncate(env->me_lfd, rsize) != 0) goto fail_errno;
3235 size = rsize - sizeof(MDB_txninfo);
3236 env->me_maxreaders = size/sizeof(MDB_reader) + 1;
3241 mh = CreateFileMapping(env->me_lfd, NULL, PAGE_READWRITE,
3243 if (!mh) goto fail_errno;
3244 env->me_txns = MapViewOfFileEx(mh, FILE_MAP_WRITE, 0, 0, rsize, NULL);
3246 if (!env->me_txns) goto fail_errno;
3248 void *m = mmap(NULL, rsize, PROT_READ|PROT_WRITE, MAP_SHARED,
3250 if (m == MAP_FAILED) goto fail_errno;
3256 BY_HANDLE_FILE_INFORMATION stbuf;
3265 if (!mdb_sec_inited) {
3266 InitializeSecurityDescriptor(&mdb_null_sd,
3267 SECURITY_DESCRIPTOR_REVISION);
3268 SetSecurityDescriptorDacl(&mdb_null_sd, TRUE, 0, FALSE);
3269 mdb_all_sa.nLength = sizeof(SECURITY_ATTRIBUTES);
3270 mdb_all_sa.bInheritHandle = FALSE;
3271 mdb_all_sa.lpSecurityDescriptor = &mdb_null_sd;
3274 if (!GetFileInformationByHandle(env->me_lfd, &stbuf)) goto fail_errno;
3275 idbuf.volume = stbuf.dwVolumeSerialNumber;
3276 idbuf.nhigh = stbuf.nFileIndexHigh;
3277 idbuf.nlow = stbuf.nFileIndexLow;
3278 val.mv_data = &idbuf;
3279 val.mv_size = sizeof(idbuf);
3280 mdb_hash_hex(&val, hexbuf);
3281 sprintf(env->me_txns->mti_rmname, "Global\\MDBr%s", hexbuf);
3282 sprintf(env->me_txns->mti_wmname, "Global\\MDBw%s", hexbuf);
3283 env->me_rmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_rmname);
3284 if (!env->me_rmutex) goto fail_errno;
3285 env->me_wmutex = CreateMutex(&mdb_all_sa, FALSE, env->me_txns->mti_wmname);
3286 if (!env->me_wmutex) goto fail_errno;
3287 #elif defined(MDB_USE_POSIX_SEM)
3296 if (fstat(env->me_lfd, &stbuf)) goto fail_errno;
3297 idbuf.dev = stbuf.st_dev;
3298 idbuf.ino = stbuf.st_ino;
3299 val.mv_data = &idbuf;
3300 val.mv_size = sizeof(idbuf);
3301 mdb_hash_hex(&val, hexbuf);
3302 sprintf(env->me_txns->mti_rmname, "/MDBr%s", hexbuf);
3303 sprintf(env->me_txns->mti_wmname, "/MDBw%s", hexbuf);
3304 /* Clean up after a previous run, if needed: Try to
3305 * remove both semaphores before doing anything else.
3307 sem_unlink(env->me_txns->mti_rmname);
3308 sem_unlink(env->me_txns->mti_wmname);
3309 env->me_rmutex = sem_open(env->me_txns->mti_rmname,
3310 O_CREAT|O_EXCL, mode, 1);
3311 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3312 env->me_wmutex = sem_open(env->me_txns->mti_wmname,
3313 O_CREAT|O_EXCL, mode, 1);
3314 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3315 #else /* MDB_USE_POSIX_SEM */
3316 pthread_mutexattr_t mattr;
3318 if ((rc = pthread_mutexattr_init(&mattr))
3319 || (rc = pthread_mutexattr_setpshared(&mattr, PTHREAD_PROCESS_SHARED))
3320 || (rc = pthread_mutex_init(&env->me_txns->mti_mutex, &mattr))
3321 || (rc = pthread_mutex_init(&env->me_txns->mti_wmutex, &mattr)))
3323 pthread_mutexattr_destroy(&mattr);
3324 #endif /* _WIN32 || MDB_USE_POSIX_SEM */
3326 env->me_txns->mti_version = MDB_VERSION;
3327 env->me_txns->mti_magic = MDB_MAGIC;
3328 env->me_txns->mti_txnid = 0;
3329 env->me_txns->mti_numreaders = 0;
3332 if (env->me_txns->mti_magic != MDB_MAGIC) {
3333 DPUTS("lock region has invalid magic");
3337 if (env->me_txns->mti_version != MDB_VERSION) {
3338 DPRINTF("lock region is version %u, expected version %u",
3339 env->me_txns->mti_version, MDB_VERSION);
3340 rc = MDB_VERSION_MISMATCH;
3344 if (rc != EACCES && rc != EAGAIN) {
3348 env->me_rmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_rmname);
3349 if (!env->me_rmutex) goto fail_errno;
3350 env->me_wmutex = OpenMutex(SYNCHRONIZE, FALSE, env->me_txns->mti_wmname);
3351 if (!env->me_wmutex) goto fail_errno;
3352 #elif defined(MDB_USE_POSIX_SEM)
3353 env->me_rmutex = sem_open(env->me_txns->mti_rmname, 0);
3354 if (env->me_rmutex == SEM_FAILED) goto fail_errno;
3355 env->me_wmutex = sem_open(env->me_txns->mti_wmname, 0);
3356 if (env->me_wmutex == SEM_FAILED) goto fail_errno;
3367 /** The name of the lock file in the DB environment */
3368 #define LOCKNAME "/lock.mdb"
3369 /** The name of the data file in the DB environment */
3370 #define DATANAME "/data.mdb"
3371 /** The suffix of the lock file when no subdir is used */
3372 #define LOCKSUFF "-lock"
3373 /** Only a subset of the @ref mdb_env flags can be changed
3374 * at runtime. Changing other flags requires closing the
3375 * environment and re-opening it with the new flags.
3377 #define CHANGEABLE (MDB_NOSYNC|MDB_NOMETASYNC|MDB_MAPASYNC)
3378 #define CHANGELESS (MDB_FIXEDMAP|MDB_NOSUBDIR|MDB_RDONLY|MDB_WRITEMAP)
3381 mdb_env_open(MDB_env *env, const char *path, unsigned int flags, mode_t mode)
3383 int oflags, rc, len, excl;
3384 char *lpath, *dpath;
3386 if (env->me_fd!=INVALID_HANDLE_VALUE || (flags & ~(CHANGEABLE|CHANGELESS)))
3390 if (flags & MDB_NOSUBDIR) {
3391 rc = len + sizeof(LOCKSUFF) + len + 1;
3393 rc = len + sizeof(LOCKNAME) + len + sizeof(DATANAME);
3398 if (flags & MDB_NOSUBDIR) {
3399 dpath = lpath + len + sizeof(LOCKSUFF);
3400 sprintf(lpath, "%s" LOCKSUFF, path);
3401 strcpy(dpath, path);
3403 dpath = lpath + len + sizeof(LOCKNAME);
3404 sprintf(lpath, "%s" LOCKNAME, path);
3405 sprintf(dpath, "%s" DATANAME, path);
3408 flags |= env->me_flags;
3409 /* silently ignore WRITEMAP if we're only getting read access */
3410 if (F_ISSET(flags, MDB_RDONLY|MDB_WRITEMAP))
3411 flags ^= MDB_WRITEMAP;
3412 env->me_flags = flags |= MDB_ENV_ACTIVE;
3414 rc = mdb_env_setup_locks(env, lpath, mode, &excl);
3419 if (F_ISSET(flags, MDB_RDONLY)) {
3420 oflags = GENERIC_READ;
3421 len = OPEN_EXISTING;
3423 oflags = GENERIC_READ|GENERIC_WRITE;
3426 mode = FILE_ATTRIBUTE_NORMAL;
3427 env->me_fd = CreateFile(dpath, oflags, FILE_SHARE_READ|FILE_SHARE_WRITE,
3428 NULL, len, mode, NULL);
3430 if (F_ISSET(flags, MDB_RDONLY))
3433 oflags = O_RDWR | O_CREAT;
3435 env->me_fd = open(dpath, oflags, mode);
3437 if (env->me_fd == INVALID_HANDLE_VALUE) {
3442 if ((rc = mdb_env_open2(env)) == MDB_SUCCESS) {
3443 if (flags & (MDB_RDONLY|MDB_WRITEMAP)) {
3444 env->me_mfd = env->me_fd;
3446 /* Synchronous fd for meta writes. Needed even with
3447 * MDB_NOSYNC/MDB_NOMETASYNC, in case these get reset.
3450 env->me_mfd = CreateFile(dpath, oflags,
3451 FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, len,
3452 mode | FILE_FLAG_WRITE_THROUGH, NULL);
3454 env->me_mfd = open(dpath, oflags | MDB_DSYNC, mode);
3456 if (env->me_mfd == INVALID_HANDLE_VALUE) {
3461 DPRINTF("opened dbenv %p", (void *) env);
3462 rc = pthread_key_create(&env->me_txkey, mdb_env_reader_dest);
3465 env->me_numdbs = 2; /* this notes that me_txkey was set */
3467 /* Windows TLS callbacks need help finding their TLS info. */
3468 if (mdb_tls_nkeys < MAX_TLS_KEYS)
3469 mdb_tls_keys[mdb_tls_nkeys++] = env->me_txkey;
3476 rc = mdb_env_share_locks(env, &excl);
3480 env->me_dbxs = calloc(env->me_maxdbs, sizeof(MDB_dbx));
3481 env->me_dbflags = calloc(env->me_maxdbs, sizeof(uint16_t));
3482 env->me_path = strdup(path);
3483 if (!env->me_dbxs || !env->me_dbflags || !env->me_path)
3489 mdb_env_close0(env, excl);
3495 /** Destroy resources from mdb_env_open() and clear our readers */
3497 mdb_env_close0(MDB_env *env, int excl)
3501 if (!(env->me_flags & MDB_ENV_ACTIVE))
3504 free(env->me_dbflags);
3508 if (env->me_numdbs) {
3509 pthread_key_delete(env->me_txkey);
3511 /* Delete our key from the global list */
3512 for (i=0; i<mdb_tls_nkeys; i++)
3513 if (mdb_tls_keys[i] == env->me_txkey) {
3514 mdb_tls_keys[i] = mdb_tls_keys[mdb_tls_nkeys-1];
3522 munmap(env->me_map, env->me_mapsize);
3524 if (env->me_mfd != env->me_fd && env->me_mfd != INVALID_HANDLE_VALUE)
3526 if (env->me_fd != INVALID_HANDLE_VALUE)
3529 pid_t pid = env->me_pid;
3530 /* Clearing readers is done in this function because
3531 * me_txkey with its destructor must be disabled first.
3533 for (i = env->me_numreaders; --i >= 0; )
3534 if (env->me_txns->mti_readers[i].mr_pid == pid)
3535 env->me_txns->mti_readers[i].mr_pid = 0;
3537 if (env->me_rmutex) {
3538 CloseHandle(env->me_rmutex);
3539 if (env->me_wmutex) CloseHandle(env->me_wmutex);
3541 /* Windows automatically destroys the mutexes when
3542 * the last handle closes.
3544 #elif defined(MDB_USE_POSIX_SEM)
3545 if (env->me_rmutex != SEM_FAILED) {
3546 sem_close(env->me_rmutex);
3547 if (env->me_wmutex != SEM_FAILED)
3548 sem_close(env->me_wmutex);
3549 /* If we have the filelock: If we are the
3550 * only remaining user, clean up semaphores.
3553 mdb_env_excl_lock(env, &excl);
3555 sem_unlink(env->me_txns->mti_rmname);
3556 sem_unlink(env->me_txns->mti_wmname);
3560 munmap((void *)env->me_txns, (env->me_maxreaders-1)*sizeof(MDB_reader)+sizeof(MDB_txninfo));
3562 if (env->me_lfd != INVALID_HANDLE_VALUE) {
3565 /* Unlock the lockfile. Windows would have unlocked it
3566 * after closing anyway, but not necessarily at once.
3568 UnlockFile(env->me_lfd, 0, 0, 1, 0);
3574 env->me_flags &= ~MDB_ENV_ACTIVE;
3578 mdb_env_copy(MDB_env *env, const char *path)
3580 MDB_txn *txn = NULL;
3584 HANDLE newfd = INVALID_HANDLE_VALUE;
3586 if (env->me_flags & MDB_NOSUBDIR) {
3587 lpath = (char *)path;
3590 len += sizeof(DATANAME);
3591 lpath = malloc(len);
3594 sprintf(lpath, "%s" DATANAME, path);
3597 /* The destination path must exist, but the destination file must not.
3598 * We don't want the OS to cache the writes, since the source data is
3599 * already in the OS cache.
3602 newfd = CreateFile(lpath, GENERIC_WRITE, 0, NULL, CREATE_NEW,
3603 FILE_FLAG_NO_BUFFERING|FILE_FLAG_WRITE_THROUGH, NULL);
3605 newfd = open(lpath, O_WRONLY|O_CREAT|O_EXCL
3611 if (!(env->me_flags & MDB_NOSUBDIR))
3613 if (newfd == INVALID_HANDLE_VALUE) {
3618 #ifdef F_NOCACHE /* __APPLE__ */
3619 rc = fcntl(newfd, F_NOCACHE, 1);
3626 /* Do the lock/unlock of the reader mutex before starting the
3627 * write txn. Otherwise other read txns could block writers.
3629 rc = mdb_txn_begin(env, NULL, MDB_RDONLY, &txn);
3633 if (!(env->me_flags & MDB_ROFS)) {
3634 /* We must start the actual read txn after blocking writers */
3635 mdb_txn_reset0(txn);
3637 /* Temporarily block writers until we snapshot the meta pages */
3640 rc = mdb_txn_renew0(txn);
3642 UNLOCK_MUTEX_W(env);
3647 wsize = env->me_psize * 2;
3651 rc = WriteFile(newfd, env->me_map, wsize, &len, NULL);
3652 rc = (len == wsize) ? MDB_SUCCESS : ErrCode();
3655 rc = write(newfd, env->me_map, wsize);
3656 rc = (rc == (int)wsize) ? MDB_SUCCESS : ErrCode();
3658 if (! (env->me_flags & MDB_ROFS))
3659 UNLOCK_MUTEX_W(env);
3664 ptr = env->me_map + wsize;
3665 wsize = txn->mt_next_pgno * env->me_psize - wsize;
3666 #define MAX_WRITE 2147483648U
3670 if (wsize > MAX_WRITE)
3674 rc = WriteFile(newfd, ptr, w2, &len, NULL);
3675 rc = (len == w2) ? MDB_SUCCESS : ErrCode();
3684 if (wsize > MAX_WRITE)
3688 wres = write(newfd, ptr, w2);
3689 rc = (wres > 0) ? MDB_SUCCESS : ErrCode();
3698 if (newfd != INVALID_HANDLE_VALUE)
3705 mdb_env_close(MDB_env *env)
3712 VGMEMP_DESTROY(env);
3713 while ((dp = env->me_dpages) != NULL) {
3714 VGMEMP_DEFINED(&dp->mp_next, sizeof(dp->mp_next));
3715 env->me_dpages = dp->mp_next;
3719 mdb_env_close0(env, 0);
3720 mdb_midl_free(env->me_free_pgs);
3724 /** Compare two items pointing at aligned size_t's */
3726 mdb_cmp_long(const MDB_val *a, const MDB_val *b)
3728 return (*(size_t *)a->mv_data < *(size_t *)b->mv_data) ? -1 :
3729 *(size_t *)a->mv_data > *(size_t *)b->mv_data;
3732 /** Compare two items pointing at aligned int's */
3734 mdb_cmp_int(const MDB_val *a, const MDB_val *b)
3736 return (*(unsigned int *)a->mv_data < *(unsigned int *)b->mv_data) ? -1 :
3737 *(unsigned int *)a->mv_data > *(unsigned int *)b->mv_data;
3740 /** Compare two items pointing at ints of unknown alignment.
3741 * Nodes and keys are guaranteed to be 2-byte aligned.
3744 mdb_cmp_cint(const MDB_val *a, const MDB_val *b)
3746 #if BYTE_ORDER == LITTLE_ENDIAN
3747 unsigned short *u, *c;
3750 u = (unsigned short *) ((char *) a->mv_data + a->mv_size);
3751 c = (unsigned short *) ((char *) b->mv_data + a->mv_size);
3754 } while(!x && u > (unsigned short *)a->mv_data);
3757 return memcmp(a->mv_data, b->mv_data, a->mv_size);
3761 /** Compare two items lexically */
3763 mdb_cmp_memn(const MDB_val *a, const MDB_val *b)
3770 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3776 diff = memcmp(a->mv_data, b->mv_data, len);
3777 return diff ? diff : len_diff<0 ? -1 : len_diff;
3780 /** Compare two items in reverse byte order */
3782 mdb_cmp_memnr(const MDB_val *a, const MDB_val *b)
3784 const unsigned char *p1, *p2, *p1_lim;
3788 p1_lim = (const unsigned char *)a->mv_data;
3789 p1 = (const unsigned char *)a->mv_data + a->mv_size;
3790 p2 = (const unsigned char *)b->mv_data + b->mv_size;
3792 len_diff = (ssize_t) a->mv_size - (ssize_t) b->mv_size;
3798 while (p1 > p1_lim) {
3799 diff = *--p1 - *--p2;
3803 return len_diff<0 ? -1 : len_diff;
3806 /** Search for key within a page, using binary search.
3807 * Returns the smallest entry larger or equal to the key.
3808 * If exactp is non-null, stores whether the found entry was an exact match
3809 * in *exactp (1 or 0).
3810 * Updates the cursor index with the index of the found entry.
3811 * If no entry larger or equal to the key is found, returns NULL.
3814 mdb_node_search(MDB_cursor *mc, MDB_val *key, int *exactp)
3816 unsigned int i = 0, nkeys;
3819 MDB_page *mp = mc->mc_pg[mc->mc_top];
3820 MDB_node *node = NULL;
3825 nkeys = NUMKEYS(mp);
3830 COPY_PGNO(pgno, mp->mp_pgno);
3831 DPRINTF("searching %u keys in %s %spage %zu",
3832 nkeys, IS_LEAF(mp) ? "leaf" : "branch", IS_SUBP(mp) ? "sub-" : "",
3839 low = IS_LEAF(mp) ? 0 : 1;
3841 cmp = mc->mc_dbx->md_cmp;
3843 /* Branch pages have no data, so if using integer keys,
3844 * alignment is guaranteed. Use faster mdb_cmp_int.
3846 if (cmp == mdb_cmp_cint && IS_BRANCH(mp)) {
3847 if (NODEPTR(mp, 1)->mn_ksize == sizeof(size_t))
3854 nodekey.mv_size = mc->mc_db->md_pad;
3855 node = NODEPTR(mp, 0); /* fake */
3856 while (low <= high) {
3857 i = (low + high) >> 1;
3858 nodekey.mv_data = LEAF2KEY(mp, i, nodekey.mv_size);
3859 rc = cmp(key, &nodekey);
3860 DPRINTF("found leaf index %u [%s], rc = %i",
3861 i, DKEY(&nodekey), rc);
3870 while (low <= high) {
3871 i = (low + high) >> 1;
3873 node = NODEPTR(mp, i);
3874 nodekey.mv_size = NODEKSZ(node);
3875 nodekey.mv_data = NODEKEY(node);
3877 rc = cmp(key, &nodekey);
3880 DPRINTF("found leaf index %u [%s], rc = %i",
3881 i, DKEY(&nodekey), rc);
3883 DPRINTF("found branch index %u [%s -> %zu], rc = %i",
3884 i, DKEY(&nodekey), NODEPGNO(node), rc);
3895 if (rc > 0) { /* Found entry is less than the key. */
3896 i++; /* Skip to get the smallest entry larger than key. */
3898 node = NODEPTR(mp, i);
3901 *exactp = (rc == 0);
3902 /* store the key index */
3903 mc->mc_ki[mc->mc_top] = i;
3905 /* There is no entry larger or equal to the key. */
3908 /* nodeptr is fake for LEAF2 */
3914 mdb_cursor_adjust(MDB_cursor *mc, func)
3918 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
3919 if (m2->mc_pg[m2->mc_top] == mc->mc_pg[mc->mc_top]) {
3926 /** Pop a page off the top of the cursor's stack. */
3928 mdb_cursor_pop(MDB_cursor *mc)
3931 #ifndef MDB_DEBUG_SKIP
3932 MDB_page *top = mc->mc_pg[mc->mc_top];
3938 DPRINTF("popped page %zu off db %u cursor %p", top->mp_pgno,
3939 mc->mc_dbi, (void *) mc);
3943 /** Push a page onto the top of the cursor's stack. */
3945 mdb_cursor_push(MDB_cursor *mc, MDB_page *mp)
3947 DPRINTF("pushing page %zu on db %u cursor %p", mp->mp_pgno,
3948 mc->mc_dbi, (void *) mc);
3950 if (mc->mc_snum >= CURSOR_STACK) {
3951 assert(mc->mc_snum < CURSOR_STACK);
3952 return MDB_CURSOR_FULL;
3955 mc->mc_top = mc->mc_snum++;
3956 mc->mc_pg[mc->mc_top] = mp;
3957 mc->mc_ki[mc->mc_top] = 0;
3962 /** Find the address of the page corresponding to a given page number.
3963 * @param[in] txn the transaction for this access.
3964 * @param[in] pgno the page number for the page to retrieve.
3965 * @param[out] ret address of a pointer where the page's address will be stored.
3966 * @return 0 on success, non-zero on failure.
3969 mdb_page_get(MDB_txn *txn, pgno_t pgno, MDB_page **ret)
3973 if (!((txn->mt_flags & MDB_TXN_RDONLY) |
3974 (txn->mt_env->me_flags & MDB_WRITEMAP)))
3978 MDB_ID2L dl = tx2->mt_u.dirty_list;
3980 unsigned x = mdb_mid2l_search(dl, pgno);
3981 if (x <= dl[0].mid && dl[x].mid == pgno) {
3986 } while ((tx2 = tx2->mt_parent) != NULL);
3989 if (pgno < txn->mt_next_pgno) {
3990 p = (MDB_page *)(txn->mt_env->me_map + txn->mt_env->me_psize * pgno);
3992 DPRINTF("page %zu not found", pgno);
3998 return (p != NULL) ? MDB_SUCCESS : MDB_PAGE_NOTFOUND;
4001 /** Search for the page a given key should be in.
4002 * Pushes parent pages on the cursor stack. This function continues a
4003 * search on a cursor that has already been initialized. (Usually by
4004 * #mdb_page_search() but also by #mdb_node_move().)
4005 * @param[in,out] mc the cursor for this operation.
4006 * @param[in] key the key to search for. If NULL, search for the lowest
4007 * page. (This is used by #mdb_cursor_first().)
4008 * @param[in] flags If MDB_PS_MODIFY set, visited pages are updated with new page numbers.
4009 * If MDB_PS_ROOTONLY set, just fetch root node, no further lookups.
4010 * @return 0 on success, non-zero on failure.
4013 mdb_page_search_root(MDB_cursor *mc, MDB_val *key, int modify)
4015 MDB_page *mp = mc->mc_pg[mc->mc_top];
4020 while (IS_BRANCH(mp)) {
4024 DPRINTF("branch page %zu has %u keys", mp->mp_pgno, NUMKEYS(mp));
4025 assert(NUMKEYS(mp) > 1);
4026 DPRINTF("found index 0 to page %zu", NODEPGNO(NODEPTR(mp, 0)));
4028 if (key == NULL) /* Initialize cursor to first page. */
4030 else if (key->mv_size > MDB_MAXKEYSIZE && key->mv_data == NULL) {
4031 /* cursor to last page */
4035 node = mdb_node_search(mc, key, &exact);
4037 i = NUMKEYS(mp) - 1;
4039 i = mc->mc_ki[mc->mc_top];
4048 DPRINTF("following index %u for key [%s]",
4050 assert(i < NUMKEYS(mp));
4051 node = NODEPTR(mp, i);
4053 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mp)))
4056 mc->mc_ki[mc->mc_top] = i;
4057 if ((rc = mdb_cursor_push(mc, mp)))
4061 if ((rc = mdb_page_touch(mc)) != 0)
4063 mp = mc->mc_pg[mc->mc_top];
4068 DPRINTF("internal error, index points to a %02X page!?",
4070 return MDB_CORRUPTED;
4073 DPRINTF("found leaf page %zu for key [%s]", mp->mp_pgno,
4074 key ? DKEY(key) : NULL);
4079 /** Search for the page a given key should be in.
4080 * Pushes parent pages on the cursor stack. This function just sets up
4081 * the search; it finds the root page for \b mc's database and sets this
4082 * as the root of the cursor's stack. Then #mdb_page_search_root() is
4083 * called to complete the search.
4084 * @param[in,out] mc the cursor for this operation.
4085 * @param[in] key the key to search for. If NULL, search for the lowest
4086 * page. (This is used by #mdb_cursor_first().)
4087 * @param[in] modify If true, visited pages are updated with new page numbers.
4088 * @return 0 on success, non-zero on failure.
4091 mdb_page_search(MDB_cursor *mc, MDB_val *key, int flags)
4096 /* Make sure the txn is still viable, then find the root from
4097 * the txn's db table.
4099 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_ERROR)) {
4100 DPUTS("transaction has failed, must abort");
4103 /* Make sure we're using an up-to-date root */
4104 if (mc->mc_dbi > MAIN_DBI) {
4105 if ((*mc->mc_dbflag & DB_STALE) ||
4106 ((flags & MDB_PS_MODIFY) && !(*mc->mc_dbflag & DB_DIRTY))) {
4108 unsigned char dbflag = 0;
4109 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI, NULL);
4110 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, flags & MDB_PS_MODIFY);
4113 if (*mc->mc_dbflag & DB_STALE) {
4117 MDB_node *leaf = mdb_node_search(&mc2,
4118 &mc->mc_dbx->md_name, &exact);
4120 return MDB_NOTFOUND;
4121 mdb_node_read(mc->mc_txn, leaf, &data);
4122 memcpy(&flags, ((char *) data.mv_data + offsetof(MDB_db, md_flags)),
4124 /* The txn may not know this DBI, or another process may
4125 * have dropped and recreated the DB with other flags.
4127 if (mc->mc_db->md_flags != flags)
4128 return MDB_INCOMPATIBLE;
4129 memcpy(mc->mc_db, data.mv_data, sizeof(MDB_db));
4131 if (flags & MDB_PS_MODIFY)
4133 *mc->mc_dbflag = dbflag;
4136 root = mc->mc_db->md_root;
4138 if (root == P_INVALID) { /* Tree is empty. */
4139 DPUTS("tree is empty");
4140 return MDB_NOTFOUND;
4145 if (!mc->mc_pg[0] || mc->mc_pg[0]->mp_pgno != root)
4146 if ((rc = mdb_page_get(mc->mc_txn, root, &mc->mc_pg[0])))
4152 DPRINTF("db %u root page %zu has flags 0x%X",
4153 mc->mc_dbi, root, mc->mc_pg[0]->mp_flags);
4155 if (flags & MDB_PS_MODIFY) {
4156 if ((rc = mdb_page_touch(mc)))
4160 if (flags & MDB_PS_ROOTONLY)
4163 return mdb_page_search_root(mc, key, flags);
4166 /** Return the data associated with a given node.
4167 * @param[in] txn The transaction for this operation.
4168 * @param[in] leaf The node being read.
4169 * @param[out] data Updated to point to the node's data.
4170 * @return 0 on success, non-zero on failure.
4173 mdb_node_read(MDB_txn *txn, MDB_node *leaf, MDB_val *data)
4175 MDB_page *omp; /* overflow page */
4179 if (!F_ISSET(leaf->mn_flags, F_BIGDATA)) {
4180 data->mv_size = NODEDSZ(leaf);
4181 data->mv_data = NODEDATA(leaf);
4185 /* Read overflow data.
4187 data->mv_size = NODEDSZ(leaf);
4188 memcpy(&pgno, NODEDATA(leaf), sizeof(pgno));
4189 if ((rc = mdb_page_get(txn, pgno, &omp))) {
4190 DPRINTF("read overflow page %zu failed", pgno);
4193 data->mv_data = METADATA(omp);
4199 mdb_get(MDB_txn *txn, MDB_dbi dbi,
4200 MDB_val *key, MDB_val *data)
4209 DPRINTF("===> get db %u key [%s]", dbi, DKEY(key));
4211 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
4214 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4218 mdb_cursor_init(&mc, txn, dbi, &mx);
4219 return mdb_cursor_set(&mc, key, data, MDB_SET, &exact);
4222 /** Find a sibling for a page.
4223 * Replaces the page at the top of the cursor's stack with the
4224 * specified sibling, if one exists.
4225 * @param[in] mc The cursor for this operation.
4226 * @param[in] move_right Non-zero if the right sibling is requested,
4227 * otherwise the left sibling.
4228 * @return 0 on success, non-zero on failure.
4231 mdb_cursor_sibling(MDB_cursor *mc, int move_right)
4237 if (mc->mc_snum < 2) {
4238 return MDB_NOTFOUND; /* root has no siblings */
4242 DPRINTF("parent page is page %zu, index %u",
4243 mc->mc_pg[mc->mc_top]->mp_pgno, mc->mc_ki[mc->mc_top]);
4245 if (move_right ? (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mc->mc_pg[mc->mc_top]))
4246 : (mc->mc_ki[mc->mc_top] == 0)) {
4247 DPRINTF("no more keys left, moving to %s sibling",
4248 move_right ? "right" : "left");
4249 if ((rc = mdb_cursor_sibling(mc, move_right)) != MDB_SUCCESS) {
4250 /* undo cursor_pop before returning */
4257 mc->mc_ki[mc->mc_top]++;
4259 mc->mc_ki[mc->mc_top]--;
4260 DPRINTF("just moving to %s index key %u",
4261 move_right ? "right" : "left", mc->mc_ki[mc->mc_top]);
4263 assert(IS_BRANCH(mc->mc_pg[mc->mc_top]));
4265 indx = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4266 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(indx), &mp)))
4269 mdb_cursor_push(mc, mp);
4274 /** Move the cursor to the next data item. */
4276 mdb_cursor_next(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4282 if (mc->mc_flags & C_EOF) {
4283 return MDB_NOTFOUND;
4286 assert(mc->mc_flags & C_INITIALIZED);
4288 mp = mc->mc_pg[mc->mc_top];
4290 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4291 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4292 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4293 if (op == MDB_NEXT || op == MDB_NEXT_DUP) {
4294 rc = mdb_cursor_next(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_NEXT);
4295 if (op != MDB_NEXT || rc == MDB_SUCCESS)
4299 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4300 if (op == MDB_NEXT_DUP)
4301 return MDB_NOTFOUND;
4305 DPRINTF("cursor_next: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4307 if (mc->mc_ki[mc->mc_top] + 1u >= NUMKEYS(mp)) {
4308 DPUTS("=====> move to next sibling page");
4309 if (mdb_cursor_sibling(mc, 1) != MDB_SUCCESS) {
4310 mc->mc_flags |= C_EOF;
4311 mc->mc_flags &= ~C_INITIALIZED;
4312 return MDB_NOTFOUND;
4314 mp = mc->mc_pg[mc->mc_top];
4315 DPRINTF("next page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4317 mc->mc_ki[mc->mc_top]++;
4319 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4320 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4323 key->mv_size = mc->mc_db->md_pad;
4324 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4328 assert(IS_LEAF(mp));
4329 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4331 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4332 mdb_xcursor_init1(mc, leaf);
4335 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4338 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4339 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4340 if (rc != MDB_SUCCESS)
4345 MDB_GET_KEY(leaf, key);
4349 /** Move the cursor to the previous data item. */
4351 mdb_cursor_prev(MDB_cursor *mc, MDB_val *key, MDB_val *data, MDB_cursor_op op)
4357 assert(mc->mc_flags & C_INITIALIZED);
4359 mp = mc->mc_pg[mc->mc_top];
4361 if (mc->mc_db->md_flags & MDB_DUPSORT) {
4362 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4363 if (op == MDB_PREV || op == MDB_PREV_DUP) {
4364 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4365 rc = mdb_cursor_prev(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_PREV);
4366 if (op != MDB_PREV || rc == MDB_SUCCESS)
4369 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4370 if (op == MDB_PREV_DUP)
4371 return MDB_NOTFOUND;
4376 DPRINTF("cursor_prev: top page is %zu in cursor %p", mp->mp_pgno, (void *) mc);
4378 if (mc->mc_ki[mc->mc_top] == 0) {
4379 DPUTS("=====> move to prev sibling page");
4380 if (mdb_cursor_sibling(mc, 0) != MDB_SUCCESS) {
4381 mc->mc_flags &= ~C_INITIALIZED;
4382 return MDB_NOTFOUND;
4384 mp = mc->mc_pg[mc->mc_top];
4385 mc->mc_ki[mc->mc_top] = NUMKEYS(mp) - 1;
4386 DPRINTF("prev page is %zu, key index %u", mp->mp_pgno, mc->mc_ki[mc->mc_top]);
4388 mc->mc_ki[mc->mc_top]--;
4390 mc->mc_flags &= ~C_EOF;
4392 DPRINTF("==> cursor points to page %zu with %u keys, key index %u",
4393 mp->mp_pgno, NUMKEYS(mp), mc->mc_ki[mc->mc_top]);
4396 key->mv_size = mc->mc_db->md_pad;
4397 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4401 assert(IS_LEAF(mp));
4402 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4404 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4405 mdb_xcursor_init1(mc, leaf);
4408 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4411 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4412 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4413 if (rc != MDB_SUCCESS)
4418 MDB_GET_KEY(leaf, key);
4422 /** Set the cursor on a specific data item. */
4424 mdb_cursor_set(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4425 MDB_cursor_op op, int *exactp)
4429 MDB_node *leaf = NULL;
4434 assert(key->mv_size > 0);
4436 /* See if we're already on the right page */
4437 if (mc->mc_flags & C_INITIALIZED) {
4440 mp = mc->mc_pg[mc->mc_top];
4442 mc->mc_ki[mc->mc_top] = 0;
4443 return MDB_NOTFOUND;
4445 if (mp->mp_flags & P_LEAF2) {
4446 nodekey.mv_size = mc->mc_db->md_pad;
4447 nodekey.mv_data = LEAF2KEY(mp, 0, nodekey.mv_size);
4449 leaf = NODEPTR(mp, 0);
4450 MDB_GET_KEY(leaf, &nodekey);
4452 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4454 /* Probably happens rarely, but first node on the page
4455 * was the one we wanted.
4457 mc->mc_ki[mc->mc_top] = 0;
4464 unsigned int nkeys = NUMKEYS(mp);
4466 if (mp->mp_flags & P_LEAF2) {
4467 nodekey.mv_data = LEAF2KEY(mp,
4468 nkeys-1, nodekey.mv_size);
4470 leaf = NODEPTR(mp, nkeys-1);
4471 MDB_GET_KEY(leaf, &nodekey);
4473 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4475 /* last node was the one we wanted */
4476 mc->mc_ki[mc->mc_top] = nkeys-1;
4482 if (mc->mc_ki[mc->mc_top] < NUMKEYS(mp)) {
4483 /* This is definitely the right page, skip search_page */
4484 if (mp->mp_flags & P_LEAF2) {
4485 nodekey.mv_data = LEAF2KEY(mp,
4486 mc->mc_ki[mc->mc_top], nodekey.mv_size);
4488 leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4489 MDB_GET_KEY(leaf, &nodekey);
4491 rc = mc->mc_dbx->md_cmp(key, &nodekey);
4493 /* current node was the one we wanted */
4503 /* If any parents have right-sibs, search.
4504 * Otherwise, there's nothing further.
4506 for (i=0; i<mc->mc_top; i++)
4508 NUMKEYS(mc->mc_pg[i])-1)
4510 if (i == mc->mc_top) {
4511 /* There are no other pages */
4512 mc->mc_ki[mc->mc_top] = nkeys;
4513 return MDB_NOTFOUND;
4517 /* There are no other pages */
4518 mc->mc_ki[mc->mc_top] = 0;
4519 return MDB_NOTFOUND;
4523 rc = mdb_page_search(mc, key, 0);
4524 if (rc != MDB_SUCCESS)
4527 mp = mc->mc_pg[mc->mc_top];
4528 assert(IS_LEAF(mp));
4531 leaf = mdb_node_search(mc, key, exactp);
4532 if (exactp != NULL && !*exactp) {
4533 /* MDB_SET specified and not an exact match. */
4534 return MDB_NOTFOUND;
4538 DPUTS("===> inexact leaf not found, goto sibling");
4539 if ((rc = mdb_cursor_sibling(mc, 1)) != MDB_SUCCESS)
4540 return rc; /* no entries matched */
4541 mp = mc->mc_pg[mc->mc_top];
4542 assert(IS_LEAF(mp));
4543 leaf = NODEPTR(mp, 0);
4547 mc->mc_flags |= C_INITIALIZED;
4548 mc->mc_flags &= ~C_EOF;
4551 key->mv_size = mc->mc_db->md_pad;
4552 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4556 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4557 mdb_xcursor_init1(mc, leaf);
4560 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4561 if (op == MDB_SET || op == MDB_SET_KEY || op == MDB_SET_RANGE) {
4562 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4565 if (op == MDB_GET_BOTH) {
4571 rc = mdb_cursor_set(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_SET_RANGE, ex2p);
4572 if (rc != MDB_SUCCESS)
4575 } else if (op == MDB_GET_BOTH || op == MDB_GET_BOTH_RANGE) {
4577 if ((rc = mdb_node_read(mc->mc_txn, leaf, &d2)) != MDB_SUCCESS)
4579 rc = mc->mc_dbx->md_dcmp(data, &d2);
4581 if (op == MDB_GET_BOTH || rc > 0)
4582 return MDB_NOTFOUND;
4587 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4588 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4593 /* The key already matches in all other cases */
4594 if (op == MDB_SET_RANGE || op == MDB_SET_KEY)
4595 MDB_GET_KEY(leaf, key);
4596 DPRINTF("==> cursor placed on key [%s]", DKEY(key));
4601 /** Move the cursor to the first item in the database. */
4603 mdb_cursor_first(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4608 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4609 rc = mdb_page_search(mc, NULL, 0);
4610 if (rc != MDB_SUCCESS)
4613 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4615 leaf = NODEPTR(mc->mc_pg[mc->mc_top], 0);
4616 mc->mc_flags |= C_INITIALIZED;
4617 mc->mc_flags &= ~C_EOF;
4619 mc->mc_ki[mc->mc_top] = 0;
4621 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4622 key->mv_size = mc->mc_db->md_pad;
4623 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], 0, key->mv_size);
4628 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4629 mdb_xcursor_init1(mc, leaf);
4630 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4635 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4636 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4640 MDB_GET_KEY(leaf, key);
4644 /** Move the cursor to the last item in the database. */
4646 mdb_cursor_last(MDB_cursor *mc, MDB_val *key, MDB_val *data)
4651 if (!(mc->mc_flags & C_EOF)) {
4653 if (!(mc->mc_flags & C_INITIALIZED) || mc->mc_top) {
4656 lkey.mv_size = MDB_MAXKEYSIZE+1;
4657 lkey.mv_data = NULL;
4658 rc = mdb_page_search(mc, &lkey, 0);
4659 if (rc != MDB_SUCCESS)
4662 assert(IS_LEAF(mc->mc_pg[mc->mc_top]));
4664 mc->mc_flags |= C_INITIALIZED|C_EOF;
4665 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]) - 1;
4667 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4669 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4670 key->mv_size = mc->mc_db->md_pad;
4671 key->mv_data = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], key->mv_size);
4676 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4677 mdb_xcursor_init1(mc, leaf);
4678 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4683 mc->mc_xcursor->mx_cursor.mc_flags &= ~C_INITIALIZED;
4684 if ((rc = mdb_node_read(mc->mc_txn, leaf, data)) != MDB_SUCCESS)
4689 MDB_GET_KEY(leaf, key);
4694 mdb_cursor_get(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4703 case MDB_GET_CURRENT:
4704 if (!(mc->mc_flags & C_INITIALIZED)) {
4707 MDB_page *mp = mc->mc_pg[mc->mc_top];
4709 mc->mc_ki[mc->mc_top] = 0;
4715 key->mv_size = mc->mc_db->md_pad;
4716 key->mv_data = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], key->mv_size);
4718 MDB_node *leaf = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
4719 MDB_GET_KEY(leaf, key);
4721 if (F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4722 rc = mdb_cursor_get(&mc->mc_xcursor->mx_cursor, data, NULL, MDB_GET_CURRENT);
4724 rc = mdb_node_read(mc->mc_txn, leaf, data);
4731 case MDB_GET_BOTH_RANGE:
4732 if (data == NULL || mc->mc_xcursor == NULL) {
4740 if (key == NULL || key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
4742 } else if (op == MDB_SET_RANGE)
4743 rc = mdb_cursor_set(mc, key, data, op, NULL);
4745 rc = mdb_cursor_set(mc, key, data, op, &exact);
4747 case MDB_GET_MULTIPLE:
4749 !(mc->mc_db->md_flags & MDB_DUPFIXED) ||
4750 !(mc->mc_flags & C_INITIALIZED)) {
4755 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) ||
4756 (mc->mc_xcursor->mx_cursor.mc_flags & C_EOF))
4759 case MDB_NEXT_MULTIPLE:
4761 !(mc->mc_db->md_flags & MDB_DUPFIXED)) {
4765 if (!(mc->mc_flags & C_INITIALIZED))
4766 rc = mdb_cursor_first(mc, key, data);
4768 rc = mdb_cursor_next(mc, key, data, MDB_NEXT_DUP);
4769 if (rc == MDB_SUCCESS) {
4770 if (mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED) {
4773 mx = &mc->mc_xcursor->mx_cursor;
4774 data->mv_size = NUMKEYS(mx->mc_pg[mx->mc_top]) *
4776 data->mv_data = METADATA(mx->mc_pg[mx->mc_top]);
4777 mx->mc_ki[mx->mc_top] = NUMKEYS(mx->mc_pg[mx->mc_top])-1;
4785 case MDB_NEXT_NODUP:
4786 if (!(mc->mc_flags & C_INITIALIZED))
4787 rc = mdb_cursor_first(mc, key, data);
4789 rc = mdb_cursor_next(mc, key, data, op);
4793 case MDB_PREV_NODUP:
4794 if (!(mc->mc_flags & C_INITIALIZED) || (mc->mc_flags & C_EOF)) {
4795 rc = mdb_cursor_last(mc, key, data);
4796 mc->mc_flags |= C_INITIALIZED;
4797 mc->mc_ki[mc->mc_top]++;
4799 rc = mdb_cursor_prev(mc, key, data, op);
4802 rc = mdb_cursor_first(mc, key, data);
4806 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4807 !(mc->mc_flags & C_INITIALIZED) ||
4808 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4812 rc = mdb_cursor_first(&mc->mc_xcursor->mx_cursor, data, NULL);
4815 rc = mdb_cursor_last(mc, key, data);
4819 !(mc->mc_db->md_flags & MDB_DUPSORT) ||
4820 !(mc->mc_flags & C_INITIALIZED) ||
4821 !(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED)) {
4825 rc = mdb_cursor_last(&mc->mc_xcursor->mx_cursor, data, NULL);
4828 DPRINTF("unhandled/unimplemented cursor operation %u", op);
4836 /** Touch all the pages in the cursor stack.
4837 * Makes sure all the pages are writable, before attempting a write operation.
4838 * @param[in] mc The cursor to operate on.
4841 mdb_cursor_touch(MDB_cursor *mc)
4845 if (mc->mc_dbi > MAIN_DBI && !(*mc->mc_dbflag & DB_DIRTY)) {
4848 mdb_cursor_init(&mc2, mc->mc_txn, MAIN_DBI,
4849 mc->mc_txn->mt_dbs[MAIN_DBI].md_flags & MDB_DUPSORT ? &mcx : NULL);
4850 rc = mdb_page_search(&mc2, &mc->mc_dbx->md_name, MDB_PS_MODIFY);
4853 *mc->mc_dbflag = DB_DIRTY;
4855 for (mc->mc_top = 0; mc->mc_top < mc->mc_snum; mc->mc_top++) {
4856 rc = mdb_page_touch(mc);
4860 mc->mc_top = mc->mc_snum-1;
4865 mdb_cursor_put(MDB_cursor *mc, MDB_val *key, MDB_val *data,
4868 MDB_node *leaf = NULL;
4869 MDB_val xdata, *rdata, dkey;
4872 int do_sub = 0, insert = 0;
4873 unsigned int mcount = 0;
4877 char dbuf[MDB_MAXKEYSIZE+1];
4878 unsigned int nflags;
4881 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
4884 if (flags != MDB_CURRENT && (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE))
4887 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT) && data->mv_size > MDB_MAXKEYSIZE)
4890 #if SIZE_MAX > MAXDATASIZE
4891 if (data->mv_size > MAXDATASIZE)
4895 DPRINTF("==> put db %u key [%s], size %zu, data size %zu",
4896 mc->mc_dbi, DKEY(key), key ? key->mv_size:0, data->mv_size);
4900 if (flags == MDB_CURRENT) {
4901 if (!(mc->mc_flags & C_INITIALIZED))
4904 } else if (mc->mc_db->md_root == P_INVALID) {
4906 /* new database, write a root leaf page */
4907 DPUTS("allocating new root leaf page");
4908 if ((rc = mdb_page_new(mc, P_LEAF, 1, &np))) {
4912 mdb_cursor_push(mc, np);
4913 mc->mc_db->md_root = np->mp_pgno;
4914 mc->mc_db->md_depth++;
4915 *mc->mc_dbflag = DB_DIRTY;
4916 if ((mc->mc_db->md_flags & (MDB_DUPSORT|MDB_DUPFIXED))
4918 np->mp_flags |= P_LEAF2;
4919 mc->mc_flags |= C_INITIALIZED;
4925 if (flags & MDB_APPEND) {
4927 rc = mdb_cursor_last(mc, &k2, &d2);
4929 rc = mc->mc_dbx->md_cmp(key, &k2);
4932 mc->mc_ki[mc->mc_top]++;
4938 rc = mdb_cursor_set(mc, key, &d2, MDB_SET, &exact);
4940 if ((flags & MDB_NOOVERWRITE) && rc == 0) {
4941 DPRINTF("duplicate key [%s]", DKEY(key));
4943 return MDB_KEYEXIST;
4945 if (rc && rc != MDB_NOTFOUND)
4949 /* Cursor is positioned, now make sure all pages are writable */
4950 rc2 = mdb_cursor_touch(mc);
4955 /* The key already exists */
4956 if (rc == MDB_SUCCESS) {
4957 /* there's only a key anyway, so this is a no-op */
4958 if (IS_LEAF2(mc->mc_pg[mc->mc_top])) {
4959 unsigned int ksize = mc->mc_db->md_pad;
4960 if (key->mv_size != ksize)
4962 if (flags == MDB_CURRENT) {
4963 char *ptr = LEAF2KEY(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], ksize);
4964 memcpy(ptr, key->mv_data, ksize);
4969 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
4972 if (F_ISSET(mc->mc_db->md_flags, MDB_DUPSORT)) {
4973 /* Was a single item before, must convert now */
4975 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
4976 /* Just overwrite the current item */
4977 if (flags == MDB_CURRENT)
4980 dkey.mv_size = NODEDSZ(leaf);
4981 dkey.mv_data = NODEDATA(leaf);
4982 #if UINT_MAX < SIZE_MAX
4983 if (mc->mc_dbx->md_dcmp == mdb_cmp_int && dkey.mv_size == sizeof(size_t))
4984 #ifdef MISALIGNED_OK
4985 mc->mc_dbx->md_dcmp = mdb_cmp_long;
4987 mc->mc_dbx->md_dcmp = mdb_cmp_cint;
4990 /* if data matches, ignore it */
4991 if (!mc->mc_dbx->md_dcmp(data, &dkey))
4992 return (flags == MDB_NODUPDATA) ? MDB_KEYEXIST : MDB_SUCCESS;
4994 /* create a fake page for the dup items */
4995 memcpy(dbuf, dkey.mv_data, dkey.mv_size);
4996 dkey.mv_data = dbuf;
4997 fp = (MDB_page *)&pbuf;
4998 fp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
4999 fp->mp_flags = P_LEAF|P_DIRTY|P_SUBP;
5000 fp->mp_lower = PAGEHDRSZ;
5001 fp->mp_upper = PAGEHDRSZ + dkey.mv_size + data->mv_size;
5002 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5003 fp->mp_flags |= P_LEAF2;
5004 fp->mp_pad = data->mv_size;
5005 fp->mp_upper += 2 * data->mv_size; /* leave space for 2 more */
5007 fp->mp_upper += 2 * sizeof(indx_t) + 2 * NODESIZE +
5008 (dkey.mv_size & 1) + (data->mv_size & 1);
5010 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5013 xdata.mv_size = fp->mp_upper;
5018 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5019 /* See if we need to convert from fake page to subDB */
5021 unsigned int offset;
5024 fp = NODEDATA(leaf);
5025 if (flags == MDB_CURRENT) {
5027 fp->mp_flags |= P_DIRTY;
5028 COPY_PGNO(fp->mp_pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
5029 mc->mc_xcursor->mx_cursor.mc_pg[0] = fp;
5033 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5034 offset = fp->mp_pad;
5035 if (SIZELEFT(fp) >= offset)
5037 offset *= 4; /* space for 4 more */
5039 offset = NODESIZE + sizeof(indx_t) + data->mv_size;
5041 offset += offset & 1;
5042 if (NODESIZE + sizeof(indx_t) + NODEKSZ(leaf) + NODEDSZ(leaf) +
5043 offset >= mc->mc_txn->mt_env->me_nodemax) {
5044 /* yes, convert it */
5046 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5047 dummy.md_pad = fp->mp_pad;
5048 dummy.md_flags = MDB_DUPFIXED;
5049 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5050 dummy.md_flags |= MDB_INTEGERKEY;
5053 dummy.md_branch_pages = 0;
5054 dummy.md_leaf_pages = 1;
5055 dummy.md_overflow_pages = 0;
5056 dummy.md_entries = NUMKEYS(fp);
5058 xdata.mv_size = sizeof(MDB_db);
5059 xdata.mv_data = &dummy;
5060 if ((rc = mdb_page_alloc(mc, 1, &mp)))
5062 offset = mc->mc_txn->mt_env->me_psize - NODEDSZ(leaf);
5063 flags |= F_DUPDATA|F_SUBDATA;
5064 dummy.md_root = mp->mp_pgno;
5066 /* no, just grow it */
5068 xdata.mv_size = NODEDSZ(leaf) + offset;
5069 xdata.mv_data = &pbuf;
5070 mp = (MDB_page *)&pbuf;
5071 mp->mp_pgno = mc->mc_pg[mc->mc_top]->mp_pgno;
5074 mp->mp_flags = fp->mp_flags | P_DIRTY;
5075 mp->mp_pad = fp->mp_pad;
5076 mp->mp_lower = fp->mp_lower;
5077 mp->mp_upper = fp->mp_upper + offset;
5079 memcpy(METADATA(mp), METADATA(fp), NUMKEYS(fp) * fp->mp_pad);
5081 nsize = NODEDSZ(leaf) - fp->mp_upper;
5082 memcpy((char *)mp + mp->mp_upper, (char *)fp + fp->mp_upper, nsize);
5083 for (i=0; i<NUMKEYS(fp); i++)
5084 mp->mp_ptrs[i] = fp->mp_ptrs[i] + offset;
5086 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5090 /* data is on sub-DB, just store it */
5091 flags |= F_DUPDATA|F_SUBDATA;
5095 /* overflow page overwrites need special handling */
5096 if (F_ISSET(leaf->mn_flags, F_BIGDATA)) {
5099 int ovpages, dpages;
5101 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
5102 dpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
5103 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
5104 mdb_page_get(mc->mc_txn, pg, &omp);
5105 /* Is the ov page writable and large enough? */
5106 if ((omp->mp_flags & P_DIRTY) && ovpages >= dpages) {
5107 /* yes, overwrite it. Note in this case we don't
5108 * bother to try shrinking the node if the new data
5109 * is smaller than the overflow threshold.
5111 if (F_ISSET(flags, MDB_RESERVE))
5112 data->mv_data = METADATA(omp);
5114 memcpy(METADATA(omp), data->mv_data, data->mv_size);
5117 /* no, free ovpages */
5119 mc->mc_db->md_overflow_pages -= ovpages;
5120 for (i=0; i<ovpages; i++) {
5121 DPRINTF("freed ov page %zu", pg);
5122 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
5126 } else if (NODEDSZ(leaf) == data->mv_size) {
5127 /* same size, just replace it. Note that we could
5128 * also reuse this node if the new data is smaller,
5129 * but instead we opt to shrink the node in that case.
5131 if (F_ISSET(flags, MDB_RESERVE))
5132 data->mv_data = NODEDATA(leaf);
5133 else if (data->mv_size)
5134 memcpy(NODEDATA(leaf), data->mv_data, data->mv_size);
5136 memcpy(NODEKEY(leaf), key->mv_data, key->mv_size);
5139 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5140 mc->mc_db->md_entries--;
5142 DPRINTF("inserting key at index %i", mc->mc_ki[mc->mc_top]);
5149 nflags = flags & NODE_ADD_FLAGS;
5150 nsize = IS_LEAF2(mc->mc_pg[mc->mc_top]) ? key->mv_size : mdb_leaf_size(mc->mc_txn->mt_env, key, rdata);
5151 if (SIZELEFT(mc->mc_pg[mc->mc_top]) < nsize) {
5152 if (( flags & (F_DUPDATA|F_SUBDATA)) == F_DUPDATA )
5153 nflags &= ~MDB_APPEND;
5155 nflags |= MDB_SPLIT_REPLACE;
5156 rc = mdb_page_split(mc, key, rdata, P_INVALID, nflags);
5158 /* There is room already in this leaf page. */
5159 rc = mdb_node_add(mc, mc->mc_ki[mc->mc_top], key, rdata, 0, nflags);
5160 if (rc == 0 && !do_sub && insert) {
5161 /* Adjust other cursors pointing to mp */
5162 MDB_cursor *m2, *m3;
5163 MDB_dbi dbi = mc->mc_dbi;
5164 unsigned i = mc->mc_top;
5165 MDB_page *mp = mc->mc_pg[i];
5167 if (mc->mc_flags & C_SUB)
5170 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
5171 if (mc->mc_flags & C_SUB)
5172 m3 = &m2->mc_xcursor->mx_cursor;
5175 if (m3 == mc || m3->mc_snum < mc->mc_snum) continue;
5176 if (m3->mc_pg[i] == mp && m3->mc_ki[i] >= mc->mc_ki[i]) {
5183 if (rc != MDB_SUCCESS)
5184 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
5186 /* Now store the actual data in the child DB. Note that we're
5187 * storing the user data in the keys field, so there are strict
5188 * size limits on dupdata. The actual data fields of the child
5189 * DB are all zero size.
5196 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5197 if (flags & MDB_CURRENT) {
5198 xflags = MDB_CURRENT;
5200 mdb_xcursor_init1(mc, leaf);
5201 xflags = (flags & MDB_NODUPDATA) ? MDB_NOOVERWRITE : 0;
5203 /* converted, write the original data first */
5205 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, &dkey, &xdata, xflags);
5209 /* Adjust other cursors pointing to mp */
5211 unsigned i = mc->mc_top;
5212 MDB_page *mp = mc->mc_pg[i];
5214 for (m2 = mc->mc_txn->mt_cursors[mc->mc_dbi]; m2; m2=m2->mc_next) {
5215 if (m2 == mc || m2->mc_snum < mc->mc_snum) continue;
5216 if (m2->mc_pg[i] == mp && m2->mc_ki[i] == mc->mc_ki[i]) {
5217 mdb_xcursor_init1(m2, leaf);
5221 /* we've done our job */
5224 if (flags & MDB_APPENDDUP)
5225 xflags |= MDB_APPEND;
5226 rc = mdb_cursor_put(&mc->mc_xcursor->mx_cursor, data, &xdata, xflags);
5227 if (flags & F_SUBDATA) {
5228 void *db = NODEDATA(leaf);
5229 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5232 /* sub-writes might have failed so check rc again.
5233 * Don't increment count if we just replaced an existing item.
5235 if (!rc && !(flags & MDB_CURRENT))
5236 mc->mc_db->md_entries++;
5237 if (flags & MDB_MULTIPLE) {
5239 if (mcount < data[1].mv_size) {
5240 data[0].mv_data = (char *)data[0].mv_data + data[0].mv_size;
5241 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5247 /* If we succeeded and the key didn't exist before, make sure
5248 * the cursor is marked valid.
5251 mc->mc_flags |= C_INITIALIZED;
5256 mdb_cursor_del(MDB_cursor *mc, unsigned int flags)
5261 if (F_ISSET(mc->mc_txn->mt_flags, MDB_TXN_RDONLY))
5264 if (!(mc->mc_flags & C_INITIALIZED))
5267 rc = mdb_cursor_touch(mc);
5271 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5273 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5274 if (flags != MDB_NODUPDATA) {
5275 if (!F_ISSET(leaf->mn_flags, F_SUBDATA)) {
5276 mc->mc_xcursor->mx_cursor.mc_pg[0] = NODEDATA(leaf);
5278 rc = mdb_cursor_del(&mc->mc_xcursor->mx_cursor, 0);
5279 /* If sub-DB still has entries, we're done */
5280 if (mc->mc_xcursor->mx_db.md_entries) {
5281 if (leaf->mn_flags & F_SUBDATA) {
5282 /* update subDB info */
5283 void *db = NODEDATA(leaf);
5284 memcpy(db, &mc->mc_xcursor->mx_db, sizeof(MDB_db));
5286 /* shrink fake page */
5287 mdb_node_shrink(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5289 mc->mc_db->md_entries--;
5292 /* otherwise fall thru and delete the sub-DB */
5295 if (leaf->mn_flags & F_SUBDATA) {
5296 /* add all the child DB's pages to the free list */
5297 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
5298 if (rc == MDB_SUCCESS) {
5299 mc->mc_db->md_entries -=
5300 mc->mc_xcursor->mx_db.md_entries;
5305 return mdb_cursor_del0(mc, leaf);
5308 /** Allocate and initialize new pages for a database.
5309 * @param[in] mc a cursor on the database being added to.
5310 * @param[in] flags flags defining what type of page is being allocated.
5311 * @param[in] num the number of pages to allocate. This is usually 1,
5312 * unless allocating overflow pages for a large record.
5313 * @param[out] mp Address of a page, or NULL on failure.
5314 * @return 0 on success, non-zero on failure.
5317 mdb_page_new(MDB_cursor *mc, uint32_t flags, int num, MDB_page **mp)
5322 if ((rc = mdb_page_alloc(mc, num, &np)))
5324 DPRINTF("allocated new mpage %zu, page size %u",
5325 np->mp_pgno, mc->mc_txn->mt_env->me_psize);
5326 np->mp_flags = flags | P_DIRTY;
5327 np->mp_lower = PAGEHDRSZ;
5328 np->mp_upper = mc->mc_txn->mt_env->me_psize;
5331 mc->mc_db->md_branch_pages++;
5332 else if (IS_LEAF(np))
5333 mc->mc_db->md_leaf_pages++;
5334 else if (IS_OVERFLOW(np)) {
5335 mc->mc_db->md_overflow_pages += num;
5343 /** Calculate the size of a leaf node.
5344 * The size depends on the environment's page size; if a data item
5345 * is too large it will be put onto an overflow page and the node
5346 * size will only include the key and not the data. Sizes are always
5347 * rounded up to an even number of bytes, to guarantee 2-byte alignment
5348 * of the #MDB_node headers.
5349 * @param[in] env The environment handle.
5350 * @param[in] key The key for the node.
5351 * @param[in] data The data for the node.
5352 * @return The number of bytes needed to store the node.
5355 mdb_leaf_size(MDB_env *env, MDB_val *key, MDB_val *data)
5359 sz = LEAFSIZE(key, data);
5360 if (sz >= env->me_nodemax) {
5361 /* put on overflow page */
5362 sz -= data->mv_size - sizeof(pgno_t);
5366 return sz + sizeof(indx_t);
5369 /** Calculate the size of a branch node.
5370 * The size should depend on the environment's page size but since
5371 * we currently don't support spilling large keys onto overflow
5372 * pages, it's simply the size of the #MDB_node header plus the
5373 * size of the key. Sizes are always rounded up to an even number
5374 * of bytes, to guarantee 2-byte alignment of the #MDB_node headers.
5375 * @param[in] env The environment handle.
5376 * @param[in] key The key for the node.
5377 * @return The number of bytes needed to store the node.
5380 mdb_branch_size(MDB_env *env, MDB_val *key)
5385 if (sz >= env->me_nodemax) {
5386 /* put on overflow page */
5387 /* not implemented */
5388 /* sz -= key->size - sizeof(pgno_t); */
5391 return sz + sizeof(indx_t);
5394 /** Add a node to the page pointed to by the cursor.
5395 * @param[in] mc The cursor for this operation.
5396 * @param[in] indx The index on the page where the new node should be added.
5397 * @param[in] key The key for the new node.
5398 * @param[in] data The data for the new node, if any.
5399 * @param[in] pgno The page number, if adding a branch node.
5400 * @param[in] flags Flags for the node.
5401 * @return 0 on success, non-zero on failure. Possible errors are:
5403 * <li>ENOMEM - failed to allocate overflow pages for the node.
5404 * <li>MDB_PAGE_FULL - there is insufficient room in the page. This error
5405 * should never happen since all callers already calculate the
5406 * page's free space before calling this function.
5410 mdb_node_add(MDB_cursor *mc, indx_t indx,
5411 MDB_val *key, MDB_val *data, pgno_t pgno, unsigned int flags)
5414 size_t node_size = NODESIZE;
5417 MDB_page *mp = mc->mc_pg[mc->mc_top];
5418 MDB_page *ofp = NULL; /* overflow page */
5421 assert(mp->mp_upper >= mp->mp_lower);
5423 DPRINTF("add to %s %spage %zu index %i, data size %zu key size %zu [%s]",
5424 IS_LEAF(mp) ? "leaf" : "branch",
5425 IS_SUBP(mp) ? "sub-" : "",
5426 mp->mp_pgno, indx, data ? data->mv_size : 0,
5427 key ? key->mv_size : 0, key ? DKEY(key) : NULL);
5430 /* Move higher keys up one slot. */
5431 int ksize = mc->mc_db->md_pad, dif;
5432 char *ptr = LEAF2KEY(mp, indx, ksize);
5433 dif = NUMKEYS(mp) - indx;
5435 memmove(ptr+ksize, ptr, dif*ksize);
5436 /* insert new key */
5437 memcpy(ptr, key->mv_data, ksize);
5439 /* Just using these for counting */
5440 mp->mp_lower += sizeof(indx_t);
5441 mp->mp_upper -= ksize - sizeof(indx_t);
5446 node_size += key->mv_size;
5450 if (F_ISSET(flags, F_BIGDATA)) {
5451 /* Data already on overflow page. */
5452 node_size += sizeof(pgno_t);
5453 } else if (node_size + data->mv_size >= mc->mc_txn->mt_env->me_nodemax) {
5454 int ovpages = OVPAGES(data->mv_size, mc->mc_txn->mt_env->me_psize);
5456 /* Put data on overflow page. */
5457 DPRINTF("data size is %zu, node would be %zu, put data on overflow page",
5458 data->mv_size, node_size+data->mv_size);
5459 node_size += sizeof(pgno_t);
5460 if ((rc = mdb_page_new(mc, P_OVERFLOW, ovpages, &ofp)))
5462 DPRINTF("allocated overflow page %zu", ofp->mp_pgno);
5465 node_size += data->mv_size;
5468 node_size += node_size & 1;
5470 if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
5471 DPRINTF("not enough room in page %zu, got %u ptrs",
5472 mp->mp_pgno, NUMKEYS(mp));
5473 DPRINTF("upper - lower = %u - %u = %u", mp->mp_upper, mp->mp_lower,
5474 mp->mp_upper - mp->mp_lower);
5475 DPRINTF("node size = %zu", node_size);
5476 return MDB_PAGE_FULL;
5479 /* Move higher pointers up one slot. */
5480 for (i = NUMKEYS(mp); i > indx; i--)
5481 mp->mp_ptrs[i] = mp->mp_ptrs[i - 1];
5483 /* Adjust free space offsets. */
5484 ofs = mp->mp_upper - node_size;
5485 assert(ofs >= mp->mp_lower + sizeof(indx_t));
5486 mp->mp_ptrs[indx] = ofs;
5488 mp->mp_lower += sizeof(indx_t);
5490 /* Write the node data. */
5491 node = NODEPTR(mp, indx);
5492 node->mn_ksize = (key == NULL) ? 0 : key->mv_size;
5493 node->mn_flags = flags;
5495 SETDSZ(node,data->mv_size);
5500 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5505 if (F_ISSET(flags, F_BIGDATA))
5506 memcpy(node->mn_data + key->mv_size, data->mv_data,
5508 else if (F_ISSET(flags, MDB_RESERVE))
5509 data->mv_data = node->mn_data + key->mv_size;
5511 memcpy(node->mn_data + key->mv_size, data->mv_data,
5514 memcpy(node->mn_data + key->mv_size, &ofp->mp_pgno,
5516 if (F_ISSET(flags, MDB_RESERVE))
5517 data->mv_data = METADATA(ofp);
5519 memcpy(METADATA(ofp), data->mv_data, data->mv_size);
5526 /** Delete the specified node from a page.
5527 * @param[in] mp The page to operate on.
5528 * @param[in] indx The index of the node to delete.
5529 * @param[in] ksize The size of a node. Only used if the page is
5530 * part of a #MDB_DUPFIXED database.
5533 mdb_node_del(MDB_page *mp, indx_t indx, int ksize)
5536 indx_t i, j, numkeys, ptr;
5543 COPY_PGNO(pgno, mp->mp_pgno);
5544 DPRINTF("delete node %u on %s page %zu", indx,
5545 IS_LEAF(mp) ? "leaf" : "branch", pgno);
5548 assert(indx < NUMKEYS(mp));
5551 int x = NUMKEYS(mp) - 1 - indx;
5552 base = LEAF2KEY(mp, indx, ksize);
5554 memmove(base, base + ksize, x * ksize);
5555 mp->mp_lower -= sizeof(indx_t);
5556 mp->mp_upper += ksize - sizeof(indx_t);
5560 node = NODEPTR(mp, indx);
5561 sz = NODESIZE + node->mn_ksize;
5563 if (F_ISSET(node->mn_flags, F_BIGDATA))
5564 sz += sizeof(pgno_t);
5566 sz += NODEDSZ(node);
5570 ptr = mp->mp_ptrs[indx];
5571 numkeys = NUMKEYS(mp);
5572 for (i = j = 0; i < numkeys; i++) {
5574 mp->mp_ptrs[j] = mp->mp_ptrs[i];
5575 if (mp->mp_ptrs[i] < ptr)
5576 mp->mp_ptrs[j] += sz;
5581 base = (char *)mp + mp->mp_upper;
5582 memmove(base + sz, base, ptr - mp->mp_upper);
5584 mp->mp_lower -= sizeof(indx_t);
5588 /** Compact the main page after deleting a node on a subpage.
5589 * @param[in] mp The main page to operate on.
5590 * @param[in] indx The index of the subpage on the main page.
5593 mdb_node_shrink(MDB_page *mp, indx_t indx)
5600 indx_t i, numkeys, ptr;
5602 node = NODEPTR(mp, indx);
5603 sp = (MDB_page *)NODEDATA(node);
5604 osize = NODEDSZ(node);
5606 delta = sp->mp_upper - sp->mp_lower;
5607 SETDSZ(node, osize - delta);
5608 xp = (MDB_page *)((char *)sp + delta);
5610 /* shift subpage upward */
5612 nsize = NUMKEYS(sp) * sp->mp_pad;
5613 memmove(METADATA(xp), METADATA(sp), nsize);
5616 nsize = osize - sp->mp_upper;
5617 numkeys = NUMKEYS(sp);
5618 for (i=numkeys-1; i>=0; i--)
5619 xp->mp_ptrs[i] = sp->mp_ptrs[i] - delta;
5621 xp->mp_upper = sp->mp_lower;
5622 xp->mp_lower = sp->mp_lower;
5623 xp->mp_flags = sp->mp_flags;
5624 xp->mp_pad = sp->mp_pad;
5625 COPY_PGNO(xp->mp_pgno, mp->mp_pgno);
5627 /* shift lower nodes upward */
5628 ptr = mp->mp_ptrs[indx];
5629 numkeys = NUMKEYS(mp);
5630 for (i = 0; i < numkeys; i++) {
5631 if (mp->mp_ptrs[i] <= ptr)
5632 mp->mp_ptrs[i] += delta;
5635 base = (char *)mp + mp->mp_upper;
5636 memmove(base + delta, base, ptr - mp->mp_upper + NODESIZE + NODEKSZ(node));
5637 mp->mp_upper += delta;
5640 /** Initial setup of a sorted-dups cursor.
5641 * Sorted duplicates are implemented as a sub-database for the given key.
5642 * The duplicate data items are actually keys of the sub-database.
5643 * Operations on the duplicate data items are performed using a sub-cursor
5644 * initialized when the sub-database is first accessed. This function does
5645 * the preliminary setup of the sub-cursor, filling in the fields that
5646 * depend only on the parent DB.
5647 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5650 mdb_xcursor_init0(MDB_cursor *mc)
5652 MDB_xcursor *mx = mc->mc_xcursor;
5654 mx->mx_cursor.mc_xcursor = NULL;
5655 mx->mx_cursor.mc_txn = mc->mc_txn;
5656 mx->mx_cursor.mc_db = &mx->mx_db;
5657 mx->mx_cursor.mc_dbx = &mx->mx_dbx;
5658 mx->mx_cursor.mc_dbi = mc->mc_dbi+1;
5659 mx->mx_cursor.mc_dbflag = &mx->mx_dbflag;
5660 mx->mx_cursor.mc_snum = 0;
5661 mx->mx_cursor.mc_top = 0;
5662 mx->mx_cursor.mc_flags = C_SUB;
5663 mx->mx_dbx.md_cmp = mc->mc_dbx->md_dcmp;
5664 mx->mx_dbx.md_dcmp = NULL;
5665 mx->mx_dbx.md_rel = mc->mc_dbx->md_rel;
5668 /** Final setup of a sorted-dups cursor.
5669 * Sets up the fields that depend on the data from the main cursor.
5670 * @param[in] mc The main cursor whose sorted-dups cursor is to be initialized.
5671 * @param[in] node The data containing the #MDB_db record for the
5672 * sorted-dup database.
5675 mdb_xcursor_init1(MDB_cursor *mc, MDB_node *node)
5677 MDB_xcursor *mx = mc->mc_xcursor;
5679 if (node->mn_flags & F_SUBDATA) {
5680 memcpy(&mx->mx_db, NODEDATA(node), sizeof(MDB_db));
5681 mx->mx_cursor.mc_pg[0] = 0;
5682 mx->mx_cursor.mc_snum = 0;
5683 mx->mx_cursor.mc_flags = C_SUB;
5685 MDB_page *fp = NODEDATA(node);
5686 mx->mx_db.md_pad = mc->mc_pg[mc->mc_top]->mp_pad;
5687 mx->mx_db.md_flags = 0;
5688 mx->mx_db.md_depth = 1;
5689 mx->mx_db.md_branch_pages = 0;
5690 mx->mx_db.md_leaf_pages = 1;
5691 mx->mx_db.md_overflow_pages = 0;
5692 mx->mx_db.md_entries = NUMKEYS(fp);
5693 COPY_PGNO(mx->mx_db.md_root, fp->mp_pgno);
5694 mx->mx_cursor.mc_snum = 1;
5695 mx->mx_cursor.mc_flags = C_INITIALIZED|C_SUB;
5696 mx->mx_cursor.mc_top = 0;
5697 mx->mx_cursor.mc_pg[0] = fp;
5698 mx->mx_cursor.mc_ki[0] = 0;
5699 if (mc->mc_db->md_flags & MDB_DUPFIXED) {
5700 mx->mx_db.md_flags = MDB_DUPFIXED;
5701 mx->mx_db.md_pad = fp->mp_pad;
5702 if (mc->mc_db->md_flags & MDB_INTEGERDUP)
5703 mx->mx_db.md_flags |= MDB_INTEGERKEY;
5706 DPRINTF("Sub-db %u for db %u root page %zu", mx->mx_cursor.mc_dbi, mc->mc_dbi,
5708 mx->mx_dbflag = (F_ISSET(mc->mc_pg[mc->mc_top]->mp_flags, P_DIRTY)) ?
5710 mx->mx_dbx.md_name.mv_data = NODEKEY(node);
5711 mx->mx_dbx.md_name.mv_size = node->mn_ksize;
5712 #if UINT_MAX < SIZE_MAX
5713 if (mx->mx_dbx.md_cmp == mdb_cmp_int && mx->mx_db.md_pad == sizeof(size_t))
5714 #ifdef MISALIGNED_OK
5715 mx->mx_dbx.md_cmp = mdb_cmp_long;
5717 mx->mx_dbx.md_cmp = mdb_cmp_cint;
5722 /** Initialize a cursor for a given transaction and database. */
5724 mdb_cursor_init(MDB_cursor *mc, MDB_txn *txn, MDB_dbi dbi, MDB_xcursor *mx)
5729 mc->mc_db = &txn->mt_dbs[dbi];
5730 mc->mc_dbx = &txn->mt_dbxs[dbi];
5731 mc->mc_dbflag = &txn->mt_dbflags[dbi];
5736 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5738 mc->mc_xcursor = mx;
5739 mdb_xcursor_init0(mc);
5741 mc->mc_xcursor = NULL;
5743 if (*mc->mc_dbflag & DB_STALE) {
5744 mdb_page_search(mc, NULL, MDB_PS_ROOTONLY);
5749 mdb_cursor_open(MDB_txn *txn, MDB_dbi dbi, MDB_cursor **ret)
5752 MDB_xcursor *mx = NULL;
5753 size_t size = sizeof(MDB_cursor);
5755 if (txn == NULL || ret == NULL || dbi >= txn->mt_numdbs)
5758 /* Allow read access to the freelist */
5759 if (!dbi && !F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
5762 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT)
5763 size += sizeof(MDB_xcursor);
5765 if ((mc = malloc(size)) != NULL) {
5766 if (txn->mt_dbs[dbi].md_flags & MDB_DUPSORT) {
5767 mx = (MDB_xcursor *)(mc + 1);
5769 mdb_cursor_init(mc, txn, dbi, mx);
5770 if (txn->mt_cursors) {
5771 mc->mc_next = txn->mt_cursors[dbi];
5772 txn->mt_cursors[dbi] = mc;
5774 mc->mc_flags |= C_ALLOCD;
5785 mdb_cursor_renew(MDB_txn *txn, MDB_cursor *mc)
5787 if (txn == NULL || mc == NULL || mc->mc_dbi >= txn->mt_numdbs)
5790 if (txn->mt_cursors)
5793 mdb_cursor_init(mc, txn, mc->mc_dbi, mc->mc_xcursor);
5797 /* Return the count of duplicate data items for the current key */
5799 mdb_cursor_count(MDB_cursor *mc, size_t *countp)
5803 if (mc == NULL || countp == NULL)
5806 if (!(mc->mc_db->md_flags & MDB_DUPSORT))
5809 leaf = NODEPTR(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top]);
5810 if (!F_ISSET(leaf->mn_flags, F_DUPDATA)) {
5813 if (!(mc->mc_xcursor->mx_cursor.mc_flags & C_INITIALIZED))
5816 *countp = mc->mc_xcursor->mx_db.md_entries;
5822 mdb_cursor_close(MDB_cursor *mc)
5825 /* remove from txn, if tracked */
5826 if (mc->mc_txn->mt_cursors) {
5827 MDB_cursor **prev = &mc->mc_txn->mt_cursors[mc->mc_dbi];
5828 while (*prev && *prev != mc) prev = &(*prev)->mc_next;
5830 *prev = mc->mc_next;
5832 if (mc->mc_flags & C_ALLOCD)
5838 mdb_cursor_txn(MDB_cursor *mc)
5840 if (!mc) return NULL;
5845 mdb_cursor_dbi(MDB_cursor *mc)
5851 /** Replace the key for a node with a new key.
5852 * @param[in] mp The page containing the node to operate on.
5853 * @param[in] indx The index of the node to operate on.
5854 * @param[in] key The new key to use.
5855 * @return 0 on success, non-zero on failure.
5858 mdb_update_key(MDB_cursor *mc, MDB_val *key)
5865 indx_t ptr, i, numkeys, indx;
5868 indx = mc->mc_ki[mc->mc_top];
5869 mp = mc->mc_pg[mc->mc_top];
5870 node = NODEPTR(mp, indx);
5871 ptr = mp->mp_ptrs[indx];
5875 char kbuf2[(MDB_MAXKEYSIZE*2+1)];
5876 k2.mv_data = NODEKEY(node);
5877 k2.mv_size = node->mn_ksize;
5878 DPRINTF("update key %u (ofs %u) [%s] to [%s] on page %zu",
5880 mdb_dkey(&k2, kbuf2),
5886 delta0 = delta = key->mv_size - node->mn_ksize;
5888 /* Must be 2-byte aligned. If new key is
5889 * shorter by 1, the shift will be skipped.
5891 delta += (delta & 1);
5893 if (delta > 0 && SIZELEFT(mp) < delta) {
5895 /* not enough space left, do a delete and split */
5896 DPRINTF("Not enough room, delta = %d, splitting...", delta);
5897 pgno = NODEPGNO(node);
5898 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], 0);
5899 return mdb_page_split(mc, key, NULL, pgno, MDB_SPLIT_REPLACE);
5902 numkeys = NUMKEYS(mp);
5903 for (i = 0; i < numkeys; i++) {
5904 if (mp->mp_ptrs[i] <= ptr)
5905 mp->mp_ptrs[i] -= delta;
5908 base = (char *)mp + mp->mp_upper;
5909 len = ptr - mp->mp_upper + NODESIZE;
5910 memmove(base - delta, base, len);
5911 mp->mp_upper -= delta;
5913 node = NODEPTR(mp, indx);
5916 /* But even if no shift was needed, update ksize */
5918 node->mn_ksize = key->mv_size;
5921 memcpy(NODEKEY(node), key->mv_data, key->mv_size);
5927 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst);
5929 /** Move a node from csrc to cdst.
5932 mdb_node_move(MDB_cursor *csrc, MDB_cursor *cdst)
5939 unsigned short flags;
5943 /* Mark src and dst as dirty. */
5944 if ((rc = mdb_page_touch(csrc)) ||
5945 (rc = mdb_page_touch(cdst)))
5948 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5949 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0); /* fake */
5950 key.mv_size = csrc->mc_db->md_pad;
5951 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
5953 data.mv_data = NULL;
5957 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top]);
5958 assert(!((long)srcnode&1));
5959 srcpg = NODEPGNO(srcnode);
5960 flags = srcnode->mn_flags;
5961 if (csrc->mc_ki[csrc->mc_top] == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
5962 unsigned int snum = csrc->mc_snum;
5964 /* must find the lowest key below src */
5965 mdb_page_search_root(csrc, NULL, 0);
5966 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
5967 key.mv_size = csrc->mc_db->md_pad;
5968 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
5970 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
5971 key.mv_size = NODEKSZ(s2);
5972 key.mv_data = NODEKEY(s2);
5974 csrc->mc_snum = snum--;
5975 csrc->mc_top = snum;
5977 key.mv_size = NODEKSZ(srcnode);
5978 key.mv_data = NODEKEY(srcnode);
5980 data.mv_size = NODEDSZ(srcnode);
5981 data.mv_data = NODEDATA(srcnode);
5983 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top]) && cdst->mc_ki[cdst->mc_top] == 0) {
5984 unsigned int snum = cdst->mc_snum;
5987 /* must find the lowest key below dst */
5988 mdb_page_search_root(cdst, NULL, 0);
5989 if (IS_LEAF2(cdst->mc_pg[cdst->mc_top])) {
5990 bkey.mv_size = cdst->mc_db->md_pad;
5991 bkey.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, bkey.mv_size);
5993 s2 = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
5994 bkey.mv_size = NODEKSZ(s2);
5995 bkey.mv_data = NODEKEY(s2);
5997 cdst->mc_snum = snum--;
5998 cdst->mc_top = snum;
5999 mdb_cursor_copy(cdst, &mn);
6001 rc = mdb_update_key(&mn, &bkey);
6006 DPRINTF("moving %s node %u [%s] on page %zu to node %u on page %zu",
6007 IS_LEAF(csrc->mc_pg[csrc->mc_top]) ? "leaf" : "branch",
6008 csrc->mc_ki[csrc->mc_top],
6010 csrc->mc_pg[csrc->mc_top]->mp_pgno,
6011 cdst->mc_ki[cdst->mc_top], cdst->mc_pg[cdst->mc_top]->mp_pgno);
6013 /* Add the node to the destination page.
6015 rc = mdb_node_add(cdst, cdst->mc_ki[cdst->mc_top], &key, &data, srcpg, flags);
6016 if (rc != MDB_SUCCESS)
6019 /* Delete the node from the source page.
6021 mdb_node_del(csrc->mc_pg[csrc->mc_top], csrc->mc_ki[csrc->mc_top], key.mv_size);
6024 /* Adjust other cursors pointing to mp */
6025 MDB_cursor *m2, *m3;
6026 MDB_dbi dbi = csrc->mc_dbi;
6027 MDB_page *mp = csrc->mc_pg[csrc->mc_top];
6029 if (csrc->mc_flags & C_SUB)
6032 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6033 if (m2 == csrc) continue;
6034 if (csrc->mc_flags & C_SUB)
6035 m3 = &m2->mc_xcursor->mx_cursor;
6038 if (m3->mc_pg[csrc->mc_top] == mp && m3->mc_ki[csrc->mc_top] ==
6039 csrc->mc_ki[csrc->mc_top]) {
6040 m3->mc_pg[csrc->mc_top] = cdst->mc_pg[cdst->mc_top];
6041 m3->mc_ki[csrc->mc_top] = cdst->mc_ki[cdst->mc_top];
6046 /* Update the parent separators.
6048 if (csrc->mc_ki[csrc->mc_top] == 0) {
6049 if (csrc->mc_ki[csrc->mc_top-1] != 0) {
6050 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6051 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6053 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6054 key.mv_size = NODEKSZ(srcnode);
6055 key.mv_data = NODEKEY(srcnode);
6057 DPRINTF("update separator for source page %zu to [%s]",
6058 csrc->mc_pg[csrc->mc_top]->mp_pgno, DKEY(&key));
6059 mdb_cursor_copy(csrc, &mn);
6062 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6065 if (IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6067 indx_t ix = csrc->mc_ki[csrc->mc_top];
6068 nullkey.mv_size = 0;
6069 csrc->mc_ki[csrc->mc_top] = 0;
6070 rc = mdb_update_key(csrc, &nullkey);
6071 csrc->mc_ki[csrc->mc_top] = ix;
6072 assert(rc == MDB_SUCCESS);
6076 if (cdst->mc_ki[cdst->mc_top] == 0) {
6077 if (cdst->mc_ki[cdst->mc_top-1] != 0) {
6078 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6079 key.mv_data = LEAF2KEY(cdst->mc_pg[cdst->mc_top], 0, key.mv_size);
6081 srcnode = NODEPTR(cdst->mc_pg[cdst->mc_top], 0);
6082 key.mv_size = NODEKSZ(srcnode);
6083 key.mv_data = NODEKEY(srcnode);
6085 DPRINTF("update separator for destination page %zu to [%s]",
6086 cdst->mc_pg[cdst->mc_top]->mp_pgno, DKEY(&key));
6087 mdb_cursor_copy(cdst, &mn);
6090 if ((rc = mdb_update_key(&mn, &key)) != MDB_SUCCESS)
6093 if (IS_BRANCH(cdst->mc_pg[cdst->mc_top])) {
6095 indx_t ix = cdst->mc_ki[cdst->mc_top];
6096 nullkey.mv_size = 0;
6097 cdst->mc_ki[cdst->mc_top] = 0;
6098 rc = mdb_update_key(cdst, &nullkey);
6099 cdst->mc_ki[cdst->mc_top] = ix;
6100 assert(rc == MDB_SUCCESS);
6107 /** Merge one page into another.
6108 * The nodes from the page pointed to by \b csrc will
6109 * be copied to the page pointed to by \b cdst and then
6110 * the \b csrc page will be freed.
6111 * @param[in] csrc Cursor pointing to the source page.
6112 * @param[in] cdst Cursor pointing to the destination page.
6115 mdb_page_merge(MDB_cursor *csrc, MDB_cursor *cdst)
6123 DPRINTF("merging page %zu into %zu", csrc->mc_pg[csrc->mc_top]->mp_pgno,
6124 cdst->mc_pg[cdst->mc_top]->mp_pgno);
6126 assert(csrc->mc_snum > 1); /* can't merge root page */
6127 assert(cdst->mc_snum > 1);
6129 /* Mark dst as dirty. */
6130 if ((rc = mdb_page_touch(cdst)))
6133 /* Move all nodes from src to dst.
6135 j = nkeys = NUMKEYS(cdst->mc_pg[cdst->mc_top]);
6136 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6137 key.mv_size = csrc->mc_db->md_pad;
6138 key.mv_data = METADATA(csrc->mc_pg[csrc->mc_top]);
6139 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6140 rc = mdb_node_add(cdst, j, &key, NULL, 0, 0);
6141 if (rc != MDB_SUCCESS)
6143 key.mv_data = (char *)key.mv_data + key.mv_size;
6146 for (i = 0; i < NUMKEYS(csrc->mc_pg[csrc->mc_top]); i++, j++) {
6147 srcnode = NODEPTR(csrc->mc_pg[csrc->mc_top], i);
6148 if (i == 0 && IS_BRANCH(csrc->mc_pg[csrc->mc_top])) {
6149 unsigned int snum = csrc->mc_snum;
6151 /* must find the lowest key below src */
6152 mdb_page_search_root(csrc, NULL, 0);
6153 if (IS_LEAF2(csrc->mc_pg[csrc->mc_top])) {
6154 key.mv_size = csrc->mc_db->md_pad;
6155 key.mv_data = LEAF2KEY(csrc->mc_pg[csrc->mc_top], 0, key.mv_size);
6157 s2 = NODEPTR(csrc->mc_pg[csrc->mc_top], 0);
6158 key.mv_size = NODEKSZ(s2);
6159 key.mv_data = NODEKEY(s2);
6161 csrc->mc_snum = snum--;
6162 csrc->mc_top = snum;
6164 key.mv_size = srcnode->mn_ksize;
6165 key.mv_data = NODEKEY(srcnode);
6168 data.mv_size = NODEDSZ(srcnode);
6169 data.mv_data = NODEDATA(srcnode);
6170 rc = mdb_node_add(cdst, j, &key, &data, NODEPGNO(srcnode), srcnode->mn_flags);
6171 if (rc != MDB_SUCCESS)
6176 DPRINTF("dst page %zu now has %u keys (%.1f%% filled)",
6177 cdst->mc_pg[cdst->mc_top]->mp_pgno, NUMKEYS(cdst->mc_pg[cdst->mc_top]), (float)PAGEFILL(cdst->mc_txn->mt_env, cdst->mc_pg[cdst->mc_top]) / 10);
6179 /* Unlink the src page from parent and add to free list.
6181 mdb_node_del(csrc->mc_pg[csrc->mc_top-1], csrc->mc_ki[csrc->mc_top-1], 0);
6182 if (csrc->mc_ki[csrc->mc_top-1] == 0) {
6185 rc = mdb_update_key(csrc, &key);
6191 mdb_midl_append(&csrc->mc_txn->mt_free_pgs, csrc->mc_pg[csrc->mc_top]->mp_pgno);
6192 if (IS_LEAF(csrc->mc_pg[csrc->mc_top]))
6193 csrc->mc_db->md_leaf_pages--;
6195 csrc->mc_db->md_branch_pages--;
6197 /* Adjust other cursors pointing to mp */
6198 MDB_cursor *m2, *m3;
6199 MDB_dbi dbi = csrc->mc_dbi;
6200 MDB_page *mp = cdst->mc_pg[cdst->mc_top];
6202 if (csrc->mc_flags & C_SUB)
6205 for (m2 = csrc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6206 if (csrc->mc_flags & C_SUB)
6207 m3 = &m2->mc_xcursor->mx_cursor;
6210 if (m3 == csrc) continue;
6211 if (m3->mc_snum < csrc->mc_snum) continue;
6212 if (m3->mc_pg[csrc->mc_top] == csrc->mc_pg[csrc->mc_top]) {
6213 m3->mc_pg[csrc->mc_top] = mp;
6214 m3->mc_ki[csrc->mc_top] += nkeys;
6218 mdb_cursor_pop(csrc);
6220 return mdb_rebalance(csrc);
6223 /** Copy the contents of a cursor.
6224 * @param[in] csrc The cursor to copy from.
6225 * @param[out] cdst The cursor to copy to.
6228 mdb_cursor_copy(const MDB_cursor *csrc, MDB_cursor *cdst)
6232 cdst->mc_txn = csrc->mc_txn;
6233 cdst->mc_dbi = csrc->mc_dbi;
6234 cdst->mc_db = csrc->mc_db;
6235 cdst->mc_dbx = csrc->mc_dbx;
6236 cdst->mc_snum = csrc->mc_snum;
6237 cdst->mc_top = csrc->mc_top;
6238 cdst->mc_flags = csrc->mc_flags;
6240 for (i=0; i<csrc->mc_snum; i++) {
6241 cdst->mc_pg[i] = csrc->mc_pg[i];
6242 cdst->mc_ki[i] = csrc->mc_ki[i];
6246 /** Rebalance the tree after a delete operation.
6247 * @param[in] mc Cursor pointing to the page where rebalancing
6249 * @return 0 on success, non-zero on failure.
6252 mdb_rebalance(MDB_cursor *mc)
6262 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6263 DPRINTF("rebalancing %s page %zu (has %u keys, %.1f%% full)",
6264 IS_LEAF(mc->mc_pg[mc->mc_top]) ? "leaf" : "branch",
6265 pgno, NUMKEYS(mc->mc_pg[mc->mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) / 10);
6269 if (PAGEFILL(mc->mc_txn->mt_env, mc->mc_pg[mc->mc_top]) >= FILL_THRESHOLD) {
6272 COPY_PGNO(pgno, mc->mc_pg[mc->mc_top]->mp_pgno);
6273 DPRINTF("no need to rebalance page %zu, above fill threshold",
6279 if (mc->mc_snum < 2) {
6280 MDB_page *mp = mc->mc_pg[0];
6281 if (NUMKEYS(mp) == 0) {
6282 DPUTS("tree is completely empty");
6283 mc->mc_db->md_root = P_INVALID;
6284 mc->mc_db->md_depth = 0;
6285 mc->mc_db->md_leaf_pages = 0;
6286 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6290 /* Adjust other cursors pointing to mp */
6291 MDB_cursor *m2, *m3;
6292 MDB_dbi dbi = mc->mc_dbi;
6294 if (mc->mc_flags & C_SUB)
6297 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6298 if (m2 == mc) continue;
6299 if (mc->mc_flags & C_SUB)
6300 m3 = &m2->mc_xcursor->mx_cursor;
6303 if (m3->mc_snum < mc->mc_snum) continue;
6304 if (m3->mc_pg[0] == mp) {
6310 } else if (IS_BRANCH(mp) && NUMKEYS(mp) == 1) {
6311 DPUTS("collapsing root page!");
6312 mdb_midl_append(&mc->mc_txn->mt_free_pgs, mp->mp_pgno);
6313 mc->mc_db->md_root = NODEPGNO(NODEPTR(mp, 0));
6314 if ((rc = mdb_page_get(mc->mc_txn, mc->mc_db->md_root,
6317 mc->mc_db->md_depth--;
6318 mc->mc_db->md_branch_pages--;
6320 /* Adjust other cursors pointing to mp */
6321 MDB_cursor *m2, *m3;
6322 MDB_dbi dbi = mc->mc_dbi;
6324 if (mc->mc_flags & C_SUB)
6327 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6328 if (m2 == mc) continue;
6329 if (mc->mc_flags & C_SUB)
6330 m3 = &m2->mc_xcursor->mx_cursor;
6333 if (m3->mc_snum < mc->mc_snum) continue;
6334 if (m3->mc_pg[0] == mp) {
6335 m3->mc_pg[0] = mc->mc_pg[0];
6340 DPUTS("root page doesn't need rebalancing");
6344 /* The parent (branch page) must have at least 2 pointers,
6345 * otherwise the tree is invalid.
6347 ptop = mc->mc_top-1;
6348 assert(NUMKEYS(mc->mc_pg[ptop]) > 1);
6350 /* Leaf page fill factor is below the threshold.
6351 * Try to move keys from left or right neighbor, or
6352 * merge with a neighbor page.
6357 mdb_cursor_copy(mc, &mn);
6358 mn.mc_xcursor = NULL;
6360 if (mc->mc_ki[ptop] == 0) {
6361 /* We're the leftmost leaf in our parent.
6363 DPUTS("reading right neighbor");
6365 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6366 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
6368 mn.mc_ki[mn.mc_top] = 0;
6369 mc->mc_ki[mc->mc_top] = NUMKEYS(mc->mc_pg[mc->mc_top]);
6371 /* There is at least one neighbor to the left.
6373 DPUTS("reading left neighbor");
6375 node = NODEPTR(mc->mc_pg[ptop], mn.mc_ki[ptop]);
6376 if ((rc = mdb_page_get(mc->mc_txn, NODEPGNO(node), &mn.mc_pg[mn.mc_top])))
6378 mn.mc_ki[mn.mc_top] = NUMKEYS(mn.mc_pg[mn.mc_top]) - 1;
6379 mc->mc_ki[mc->mc_top] = 0;
6382 DPRINTF("found neighbor page %zu (%u keys, %.1f%% full)",
6383 mn.mc_pg[mn.mc_top]->mp_pgno, NUMKEYS(mn.mc_pg[mn.mc_top]), (float)PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) / 10);
6385 /* If the neighbor page is above threshold and has enough keys,
6386 * move one key from it. Otherwise we should try to merge them.
6387 * (A branch page must never have less than 2 keys.)
6389 minkeys = 1 + (IS_BRANCH(mn.mc_pg[mn.mc_top]));
6390 if (PAGEFILL(mc->mc_txn->mt_env, mn.mc_pg[mn.mc_top]) >= FILL_THRESHOLD && NUMKEYS(mn.mc_pg[mn.mc_top]) > minkeys)
6391 return mdb_node_move(&mn, mc);
6393 if (mc->mc_ki[ptop] == 0)
6394 rc = mdb_page_merge(&mn, mc);
6396 rc = mdb_page_merge(mc, &mn);
6397 mc->mc_flags &= ~C_INITIALIZED;
6402 /** Complete a delete operation started by #mdb_cursor_del(). */
6404 mdb_cursor_del0(MDB_cursor *mc, MDB_node *leaf)
6408 /* add overflow pages to free list */
6409 if (!IS_LEAF2(mc->mc_pg[mc->mc_top]) && F_ISSET(leaf->mn_flags, F_BIGDATA)) {
6413 memcpy(&pg, NODEDATA(leaf), sizeof(pg));
6414 ovpages = OVPAGES(NODEDSZ(leaf), mc->mc_txn->mt_env->me_psize);
6415 mc->mc_db->md_overflow_pages -= ovpages;
6416 for (i=0; i<ovpages; i++) {
6417 DPRINTF("freed ov page %zu", pg);
6418 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
6422 mdb_node_del(mc->mc_pg[mc->mc_top], mc->mc_ki[mc->mc_top], mc->mc_db->md_pad);
6423 mc->mc_db->md_entries--;
6424 rc = mdb_rebalance(mc);
6425 if (rc != MDB_SUCCESS)
6426 mc->mc_txn->mt_flags |= MDB_TXN_ERROR;
6427 /* if mc points past last node in page, invalidate */
6428 else if (mc->mc_ki[mc->mc_top] >= NUMKEYS(mc->mc_pg[mc->mc_top]))
6429 mc->mc_flags &= ~C_INITIALIZED;
6435 mdb_del(MDB_txn *txn, MDB_dbi dbi,
6436 MDB_val *key, MDB_val *data)
6441 MDB_val rdata, *xdata;
6445 assert(key != NULL);
6447 DPRINTF("====> delete db %u key [%s]", dbi, DKEY(key));
6449 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6452 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6456 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
6460 mdb_cursor_init(&mc, txn, dbi, &mx);
6471 rc = mdb_cursor_set(&mc, key, xdata, op, &exact);
6473 /* let mdb_page_split know about this cursor if needed:
6474 * delete will trigger a rebalance; if it needs to move
6475 * a node from one page to another, it will have to
6476 * update the parent's separator key(s). If the new sepkey
6477 * is larger than the current one, the parent page may
6478 * run out of space, triggering a split. We need this
6479 * cursor to be consistent until the end of the rebalance.
6481 mc.mc_next = txn->mt_cursors[dbi];
6482 txn->mt_cursors[dbi] = &mc;
6483 rc = mdb_cursor_del(&mc, data ? 0 : MDB_NODUPDATA);
6484 txn->mt_cursors[dbi] = mc.mc_next;
6489 /** Split a page and insert a new node.
6490 * @param[in,out] mc Cursor pointing to the page and desired insertion index.
6491 * The cursor will be updated to point to the actual page and index where
6492 * the node got inserted after the split.
6493 * @param[in] newkey The key for the newly inserted node.
6494 * @param[in] newdata The data for the newly inserted node.
6495 * @param[in] newpgno The page number, if the new node is a branch node.
6496 * @param[in] nflags The #NODE_ADD_FLAGS for the new node.
6497 * @return 0 on success, non-zero on failure.
6500 mdb_page_split(MDB_cursor *mc, MDB_val *newkey, MDB_val *newdata, pgno_t newpgno,
6501 unsigned int nflags)
6504 int rc = MDB_SUCCESS, ins_new = 0, new_root = 0, newpos = 1, did_split = 0;
6507 unsigned int i, j, split_indx, nkeys, pmax;
6509 MDB_val sepkey, rkey, xdata, *rdata = &xdata;
6511 MDB_page *mp, *rp, *pp;
6516 mp = mc->mc_pg[mc->mc_top];
6517 newindx = mc->mc_ki[mc->mc_top];
6519 DPRINTF("-----> splitting %s page %zu and adding [%s] at index %i",
6520 IS_LEAF(mp) ? "leaf" : "branch", mp->mp_pgno,
6521 DKEY(newkey), mc->mc_ki[mc->mc_top]);
6523 /* Create a right sibling. */
6524 if ((rc = mdb_page_new(mc, mp->mp_flags, 1, &rp)))
6526 DPRINTF("new right sibling: page %zu", rp->mp_pgno);
6528 if (mc->mc_snum < 2) {
6529 if ((rc = mdb_page_new(mc, P_BRANCH, 1, &pp)))
6531 /* shift current top to make room for new parent */
6532 mc->mc_pg[1] = mc->mc_pg[0];
6533 mc->mc_ki[1] = mc->mc_ki[0];
6536 mc->mc_db->md_root = pp->mp_pgno;
6537 DPRINTF("root split! new root = %zu", pp->mp_pgno);
6538 mc->mc_db->md_depth++;
6541 /* Add left (implicit) pointer. */
6542 if ((rc = mdb_node_add(mc, 0, NULL, NULL, mp->mp_pgno, 0)) != MDB_SUCCESS) {
6543 /* undo the pre-push */
6544 mc->mc_pg[0] = mc->mc_pg[1];
6545 mc->mc_ki[0] = mc->mc_ki[1];
6546 mc->mc_db->md_root = mp->mp_pgno;
6547 mc->mc_db->md_depth--;
6554 ptop = mc->mc_top-1;
6555 DPRINTF("parent branch page is %zu", mc->mc_pg[ptop]->mp_pgno);
6558 mc->mc_flags |= C_SPLITTING;
6559 mdb_cursor_copy(mc, &mn);
6560 mn.mc_pg[mn.mc_top] = rp;
6561 mn.mc_ki[ptop] = mc->mc_ki[ptop]+1;
6563 if (nflags & MDB_APPEND) {
6564 mn.mc_ki[mn.mc_top] = 0;
6566 split_indx = newindx;
6571 nkeys = NUMKEYS(mp);
6572 split_indx = nkeys / 2;
6573 if (newindx < split_indx)
6579 unsigned int lsize, rsize, ksize;
6580 /* Move half of the keys to the right sibling */
6582 x = mc->mc_ki[mc->mc_top] - split_indx;
6583 ksize = mc->mc_db->md_pad;
6584 split = LEAF2KEY(mp, split_indx, ksize);
6585 rsize = (nkeys - split_indx) * ksize;
6586 lsize = (nkeys - split_indx) * sizeof(indx_t);
6587 mp->mp_lower -= lsize;
6588 rp->mp_lower += lsize;
6589 mp->mp_upper += rsize - lsize;
6590 rp->mp_upper -= rsize - lsize;
6591 sepkey.mv_size = ksize;
6592 if (newindx == split_indx) {
6593 sepkey.mv_data = newkey->mv_data;
6595 sepkey.mv_data = split;
6598 ins = LEAF2KEY(mp, mc->mc_ki[mc->mc_top], ksize);
6599 memcpy(rp->mp_ptrs, split, rsize);
6600 sepkey.mv_data = rp->mp_ptrs;
6601 memmove(ins+ksize, ins, (split_indx - mc->mc_ki[mc->mc_top]) * ksize);
6602 memcpy(ins, newkey->mv_data, ksize);
6603 mp->mp_lower += sizeof(indx_t);
6604 mp->mp_upper -= ksize - sizeof(indx_t);
6607 memcpy(rp->mp_ptrs, split, x * ksize);
6608 ins = LEAF2KEY(rp, x, ksize);
6609 memcpy(ins, newkey->mv_data, ksize);
6610 memcpy(ins+ksize, split + x * ksize, rsize - x * ksize);
6611 rp->mp_lower += sizeof(indx_t);
6612 rp->mp_upper -= ksize - sizeof(indx_t);
6613 mc->mc_ki[mc->mc_top] = x;
6614 mc->mc_pg[mc->mc_top] = rp;
6619 /* For leaf pages, check the split point based on what
6620 * fits where, since otherwise mdb_node_add can fail.
6622 * This check is only needed when the data items are
6623 * relatively large, such that being off by one will
6624 * make the difference between success or failure.
6626 * It's also relevant if a page happens to be laid out
6627 * such that one half of its nodes are all "small" and
6628 * the other half of its nodes are "large." If the new
6629 * item is also "large" and falls on the half with
6630 * "large" nodes, it also may not fit.
6633 unsigned int psize, nsize;
6634 /* Maximum free space in an empty page */
6635 pmax = mc->mc_txn->mt_env->me_psize - PAGEHDRSZ;
6636 nsize = mdb_leaf_size(mc->mc_txn->mt_env, newkey, newdata);
6637 if ((nkeys < 20) || (nsize > pmax/16)) {
6638 if (newindx <= split_indx) {
6641 for (i=0; i<split_indx; i++) {
6642 node = NODEPTR(mp, i);
6643 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6644 if (F_ISSET(node->mn_flags, F_BIGDATA))
6645 psize += sizeof(pgno_t);
6647 psize += NODEDSZ(node);
6651 split_indx = newindx;
6662 for (i=nkeys-1; i>=split_indx; i--) {
6663 node = NODEPTR(mp, i);
6664 psize += NODESIZE + NODEKSZ(node) + sizeof(indx_t);
6665 if (F_ISSET(node->mn_flags, F_BIGDATA))
6666 psize += sizeof(pgno_t);
6668 psize += NODEDSZ(node);
6672 split_indx = newindx;
6683 /* First find the separating key between the split pages.
6684 * The case where newindx == split_indx is ambiguous; the
6685 * new item could go to the new page or stay on the original
6686 * page. If newpos == 1 it goes to the new page.
6688 if (newindx == split_indx && newpos) {
6689 sepkey.mv_size = newkey->mv_size;
6690 sepkey.mv_data = newkey->mv_data;
6692 node = NODEPTR(mp, split_indx);
6693 sepkey.mv_size = node->mn_ksize;
6694 sepkey.mv_data = NODEKEY(node);
6698 DPRINTF("separator is [%s]", DKEY(&sepkey));
6700 /* Copy separator key to the parent.
6702 if (SIZELEFT(mn.mc_pg[ptop]) < mdb_branch_size(mc->mc_txn->mt_env, &sepkey)) {
6706 rc = mdb_page_split(&mn, &sepkey, NULL, rp->mp_pgno, 0);
6709 if (mn.mc_snum == mc->mc_snum) {
6710 mc->mc_pg[mc->mc_snum] = mc->mc_pg[mc->mc_top];
6711 mc->mc_ki[mc->mc_snum] = mc->mc_ki[mc->mc_top];
6712 mc->mc_pg[mc->mc_top] = mc->mc_pg[ptop];
6713 mc->mc_ki[mc->mc_top] = mc->mc_ki[ptop];
6718 /* Right page might now have changed parent.
6719 * Check if left page also changed parent.
6721 if (mn.mc_pg[ptop] != mc->mc_pg[ptop] &&
6722 mc->mc_ki[ptop] >= NUMKEYS(mc->mc_pg[ptop])) {
6723 for (i=0; i<ptop; i++) {
6724 mc->mc_pg[i] = mn.mc_pg[i];
6725 mc->mc_ki[i] = mn.mc_ki[i];
6727 mc->mc_pg[ptop] = mn.mc_pg[ptop];
6728 mc->mc_ki[ptop] = mn.mc_ki[ptop] - 1;
6732 rc = mdb_node_add(&mn, mn.mc_ki[ptop], &sepkey, NULL, rp->mp_pgno, 0);
6735 mc->mc_flags ^= C_SPLITTING;
6736 if (rc != MDB_SUCCESS) {
6739 if (nflags & MDB_APPEND) {
6740 mc->mc_pg[mc->mc_top] = rp;
6741 mc->mc_ki[mc->mc_top] = 0;
6742 rc = mdb_node_add(mc, 0, newkey, newdata, newpgno, nflags);
6745 for (i=0; i<mc->mc_top; i++)
6746 mc->mc_ki[i] = mn.mc_ki[i];
6753 /* Move half of the keys to the right sibling. */
6755 /* grab a page to hold a temporary copy */
6756 copy = mdb_page_malloc(mc);
6760 copy->mp_pgno = mp->mp_pgno;
6761 copy->mp_flags = mp->mp_flags;
6762 copy->mp_lower = PAGEHDRSZ;
6763 copy->mp_upper = mc->mc_txn->mt_env->me_psize;
6764 mc->mc_pg[mc->mc_top] = copy;
6765 for (i = j = 0; i <= nkeys; j++) {
6766 if (i == split_indx) {
6767 /* Insert in right sibling. */
6768 /* Reset insert index for right sibling. */
6769 if (i != newindx || (newpos ^ ins_new)) {
6771 mc->mc_pg[mc->mc_top] = rp;
6775 if (i == newindx && !ins_new) {
6776 /* Insert the original entry that caused the split. */
6777 rkey.mv_data = newkey->mv_data;
6778 rkey.mv_size = newkey->mv_size;
6787 /* Update index for the new key. */
6788 mc->mc_ki[mc->mc_top] = j;
6789 } else if (i == nkeys) {
6792 node = NODEPTR(mp, i);
6793 rkey.mv_data = NODEKEY(node);
6794 rkey.mv_size = node->mn_ksize;
6796 xdata.mv_data = NODEDATA(node);
6797 xdata.mv_size = NODEDSZ(node);
6800 pgno = NODEPGNO(node);
6801 flags = node->mn_flags;
6806 if (!IS_LEAF(mp) && j == 0) {
6807 /* First branch index doesn't need key data. */
6811 rc = mdb_node_add(mc, j, &rkey, rdata, pgno, flags);
6815 nkeys = NUMKEYS(copy);
6816 for (i=0; i<nkeys; i++)
6817 mp->mp_ptrs[i] = copy->mp_ptrs[i];
6818 mp->mp_lower = copy->mp_lower;
6819 mp->mp_upper = copy->mp_upper;
6820 memcpy(NODEPTR(mp, nkeys-1), NODEPTR(copy, nkeys-1),
6821 mc->mc_txn->mt_env->me_psize - copy->mp_upper);
6823 /* reset back to original page */
6824 if (newindx < split_indx || (!newpos && newindx == split_indx)) {
6825 mc->mc_pg[mc->mc_top] = mp;
6826 if (nflags & MDB_RESERVE) {
6827 node = NODEPTR(mp, mc->mc_ki[mc->mc_top]);
6828 if (!(node->mn_flags & F_BIGDATA))
6829 newdata->mv_data = NODEDATA(node);
6835 /* return tmp page to freelist */
6836 mdb_page_free(mc->mc_txn->mt_env, copy);
6839 /* Adjust other cursors pointing to mp */
6840 MDB_cursor *m2, *m3;
6841 MDB_dbi dbi = mc->mc_dbi;
6842 int fixup = NUMKEYS(mp);
6844 if (mc->mc_flags & C_SUB)
6847 for (m2 = mc->mc_txn->mt_cursors[dbi]; m2; m2=m2->mc_next) {
6848 if (m2 == mc) continue;
6849 if (mc->mc_flags & C_SUB)
6850 m3 = &m2->mc_xcursor->mx_cursor;
6853 if (!(m3->mc_flags & C_INITIALIZED))
6855 if (m3->mc_flags & C_SPLITTING)
6860 for (k=m3->mc_top; k>=0; k--) {
6861 m3->mc_ki[k+1] = m3->mc_ki[k];
6862 m3->mc_pg[k+1] = m3->mc_pg[k];
6864 if (m3->mc_ki[0] >= split_indx) {
6869 m3->mc_pg[0] = mc->mc_pg[0];
6873 if (m3->mc_pg[mc->mc_top] == mp) {
6874 if (m3->mc_ki[mc->mc_top] >= newindx && !(nflags & MDB_SPLIT_REPLACE))
6875 m3->mc_ki[mc->mc_top]++;
6876 if (m3->mc_ki[mc->mc_top] >= fixup) {
6877 m3->mc_pg[mc->mc_top] = rp;
6878 m3->mc_ki[mc->mc_top] -= fixup;
6879 m3->mc_ki[ptop] = mn.mc_ki[ptop];
6881 } else if (!did_split && m3->mc_pg[ptop] == mc->mc_pg[ptop] &&
6882 m3->mc_ki[ptop] >= mc->mc_ki[ptop]) {
6891 mdb_put(MDB_txn *txn, MDB_dbi dbi,
6892 MDB_val *key, MDB_val *data, unsigned int flags)
6897 assert(key != NULL);
6898 assert(data != NULL);
6900 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
6903 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY)) {
6907 if (key->mv_size == 0 || key->mv_size > MDB_MAXKEYSIZE) {
6911 if ((flags & (MDB_NOOVERWRITE|MDB_NODUPDATA|MDB_RESERVE|MDB_APPEND)) != flags)
6914 mdb_cursor_init(&mc, txn, dbi, &mx);
6915 return mdb_cursor_put(&mc, key, data, flags);
6919 mdb_env_set_flags(MDB_env *env, unsigned int flag, int onoff)
6921 if ((flag & CHANGEABLE) != flag)
6924 env->me_flags |= flag;
6926 env->me_flags &= ~flag;
6931 mdb_env_get_flags(MDB_env *env, unsigned int *arg)
6936 *arg = env->me_flags;
6941 mdb_env_get_path(MDB_env *env, const char **arg)
6946 *arg = env->me_path;
6950 /** Common code for #mdb_stat() and #mdb_env_stat().
6951 * @param[in] env the environment to operate in.
6952 * @param[in] db the #MDB_db record containing the stats to return.
6953 * @param[out] arg the address of an #MDB_stat structure to receive the stats.
6954 * @return 0, this function always succeeds.
6957 mdb_stat0(MDB_env *env, MDB_db *db, MDB_stat *arg)
6959 arg->ms_psize = env->me_psize;
6960 arg->ms_depth = db->md_depth;
6961 arg->ms_branch_pages = db->md_branch_pages;
6962 arg->ms_leaf_pages = db->md_leaf_pages;
6963 arg->ms_overflow_pages = db->md_overflow_pages;
6964 arg->ms_entries = db->md_entries;
6969 mdb_env_stat(MDB_env *env, MDB_stat *arg)
6973 if (env == NULL || arg == NULL)
6976 toggle = mdb_env_pick_meta(env);
6978 return mdb_stat0(env, &env->me_metas[toggle]->mm_dbs[MAIN_DBI], arg);
6982 mdb_env_info(MDB_env *env, MDB_envinfo *arg)
6986 if (env == NULL || arg == NULL)
6989 toggle = mdb_env_pick_meta(env);
6990 arg->me_mapaddr = (env->me_flags & MDB_FIXEDMAP) ? env->me_map : 0;
6991 arg->me_mapsize = env->me_mapsize;
6992 arg->me_maxreaders = env->me_maxreaders;
6993 arg->me_numreaders = env->me_numreaders;
6994 arg->me_last_pgno = env->me_metas[toggle]->mm_last_pg;
6995 arg->me_last_txnid = env->me_metas[toggle]->mm_txnid;
6999 /** Set the default comparison functions for a database.
7000 * Called immediately after a database is opened to set the defaults.
7001 * The user can then override them with #mdb_set_compare() or
7002 * #mdb_set_dupsort().
7003 * @param[in] txn A transaction handle returned by #mdb_txn_begin()
7004 * @param[in] dbi A database handle returned by #mdb_dbi_open()
7007 mdb_default_cmp(MDB_txn *txn, MDB_dbi dbi)
7009 uint16_t f = txn->mt_dbs[dbi].md_flags;
7011 txn->mt_dbxs[dbi].md_cmp =
7012 (f & MDB_REVERSEKEY) ? mdb_cmp_memnr :
7013 (f & MDB_INTEGERKEY) ? mdb_cmp_cint : mdb_cmp_memn;
7015 txn->mt_dbxs[dbi].md_dcmp =
7016 !(f & MDB_DUPSORT) ? 0 :
7017 ((f & MDB_INTEGERDUP)
7018 ? ((f & MDB_DUPFIXED) ? mdb_cmp_int : mdb_cmp_cint)
7019 : ((f & MDB_REVERSEDUP) ? mdb_cmp_memnr : mdb_cmp_memn));
7022 #define PERSISTENT_FLAGS 0xffff
7023 #define VALID_FLAGS (MDB_REVERSEKEY|MDB_DUPSORT|MDB_INTEGERKEY|MDB_DUPFIXED|\
7024 MDB_INTEGERDUP|MDB_REVERSEDUP|MDB_CREATE)
7025 int mdb_dbi_open(MDB_txn *txn, const char *name, unsigned int flags, MDB_dbi *dbi)
7031 int rc, dbflag, exact;
7032 unsigned int unused = 0;
7035 if (txn->mt_dbxs[FREE_DBI].md_cmp == NULL) {
7036 mdb_default_cmp(txn, FREE_DBI);
7039 if ((flags & VALID_FLAGS) != flags)
7045 if (flags & PERSISTENT_FLAGS) {
7046 uint16_t f2 = flags & PERSISTENT_FLAGS;
7047 /* make sure flag changes get committed */
7048 if ((txn->mt_dbs[MAIN_DBI].md_flags | f2) != txn->mt_dbs[MAIN_DBI].md_flags) {
7049 txn->mt_dbs[MAIN_DBI].md_flags |= f2;
7050 txn->mt_flags |= MDB_TXN_DIRTY;
7053 mdb_default_cmp(txn, MAIN_DBI);
7057 if (txn->mt_dbxs[MAIN_DBI].md_cmp == NULL) {
7058 mdb_default_cmp(txn, MAIN_DBI);
7061 /* Is the DB already open? */
7063 for (i=2; i<txn->mt_numdbs; i++) {
7064 if (!txn->mt_dbxs[i].md_name.mv_size) {
7065 /* Remember this free slot */
7066 if (!unused) unused = i;
7069 if (len == txn->mt_dbxs[i].md_name.mv_size &&
7070 !strncmp(name, txn->mt_dbxs[i].md_name.mv_data, len)) {
7076 /* If no free slot and max hit, fail */
7077 if (!unused && txn->mt_numdbs >= txn->mt_env->me_maxdbs)
7078 return MDB_DBS_FULL;
7080 /* Find the DB info */
7084 key.mv_data = (void *)name;
7085 mdb_cursor_init(&mc, txn, MAIN_DBI, NULL);
7086 rc = mdb_cursor_set(&mc, &key, &data, MDB_SET, &exact);
7087 if (rc == MDB_SUCCESS) {
7088 /* make sure this is actually a DB */
7089 MDB_node *node = NODEPTR(mc.mc_pg[mc.mc_top], mc.mc_ki[mc.mc_top]);
7090 if (!(node->mn_flags & F_SUBDATA))
7092 } else if (rc == MDB_NOTFOUND && (flags & MDB_CREATE)) {
7093 /* Create if requested */
7095 data.mv_size = sizeof(MDB_db);
7096 data.mv_data = &dummy;
7097 memset(&dummy, 0, sizeof(dummy));
7098 dummy.md_root = P_INVALID;
7099 dummy.md_flags = flags & PERSISTENT_FLAGS;
7100 rc = mdb_cursor_put(&mc, &key, &data, F_SUBDATA);
7104 /* OK, got info, add to table */
7105 if (rc == MDB_SUCCESS) {
7106 unsigned int slot = unused ? unused : txn->mt_numdbs;
7107 txn->mt_dbxs[slot].md_name.mv_data = strdup(name);
7108 txn->mt_dbxs[slot].md_name.mv_size = len;
7109 txn->mt_dbxs[slot].md_rel = NULL;
7110 txn->mt_dbflags[slot] = dbflag;
7111 memcpy(&txn->mt_dbs[slot], data.mv_data, sizeof(MDB_db));
7113 txn->mt_env->me_dbflags[slot] = mdflags = txn->mt_dbs[slot].md_flags;
7114 mdb_default_cmp(txn, slot);
7117 txn->mt_env->me_numdbs++;
7119 /* Open the DB in parent txns as well */
7120 while ((txn = txn->mt_parent) != NULL) {
7121 txn->mt_dbflags[slot] = DB_STALE;
7122 txn->mt_dbs[slot].md_flags = mdflags;
7131 int mdb_stat(MDB_txn *txn, MDB_dbi dbi, MDB_stat *arg)
7133 if (txn == NULL || arg == NULL || dbi >= txn->mt_numdbs)
7136 return mdb_stat0(txn->mt_env, &txn->mt_dbs[dbi], arg);
7139 void mdb_dbi_close(MDB_env *env, MDB_dbi dbi)
7142 if (dbi <= MAIN_DBI || dbi >= env->me_numdbs)
7144 ptr = env->me_dbxs[dbi].md_name.mv_data;
7145 env->me_dbxs[dbi].md_name.mv_data = NULL;
7146 env->me_dbxs[dbi].md_name.mv_size = 0;
7150 /** Add all the DB's pages to the free list.
7151 * @param[in] mc Cursor on the DB to free.
7152 * @param[in] subs non-Zero to check for sub-DBs in this DB.
7153 * @return 0 on success, non-zero on failure.
7156 mdb_drop0(MDB_cursor *mc, int subs)
7160 rc = mdb_page_search(mc, NULL, 0);
7161 if (rc == MDB_SUCCESS) {
7166 /* LEAF2 pages have no nodes, cannot have sub-DBs */
7167 if (!subs || IS_LEAF2(mc->mc_pg[mc->mc_top]))
7170 mdb_cursor_copy(mc, &mx);
7171 while (mc->mc_snum > 0) {
7172 if (IS_LEAF(mc->mc_pg[mc->mc_top])) {
7173 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
7174 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
7175 if (ni->mn_flags & F_SUBDATA) {
7176 mdb_xcursor_init1(mc, ni);
7177 rc = mdb_drop0(&mc->mc_xcursor->mx_cursor, 0);
7183 for (i=0; i<NUMKEYS(mc->mc_pg[mc->mc_top]); i++) {
7185 ni = NODEPTR(mc->mc_pg[mc->mc_top], i);
7188 mdb_midl_append(&mc->mc_txn->mt_free_pgs, pg);
7193 rc = mdb_cursor_sibling(mc, 1);
7195 /* no more siblings, go back to beginning
7196 * of previous level.
7199 for (i=1; i<mc->mc_top; i++)
7200 mc->mc_pg[i] = mx.mc_pg[i];
7204 mdb_midl_append(&mc->mc_txn->mt_free_pgs,
7205 mc->mc_db->md_root);
7210 int mdb_drop(MDB_txn *txn, MDB_dbi dbi, int del)
7215 if (!txn || !dbi || dbi >= txn->mt_numdbs || (unsigned)del > 1)
7218 if (F_ISSET(txn->mt_flags, MDB_TXN_RDONLY))
7221 rc = mdb_cursor_open(txn, dbi, &mc);
7225 rc = mdb_drop0(mc, mc->mc_db->md_flags & MDB_DUPSORT);
7229 /* Can't delete the main DB */
7230 if (del && dbi > MAIN_DBI) {
7231 rc = mdb_del(txn, MAIN_DBI, &mc->mc_dbx->md_name, NULL);
7233 txn->mt_dbflags[dbi] = DB_STALE;
7234 mdb_dbi_close(txn->mt_env, dbi);
7237 /* reset the DB record, mark it dirty */
7238 txn->mt_dbflags[dbi] |= DB_DIRTY;
7239 txn->mt_dbs[dbi].md_depth = 0;
7240 txn->mt_dbs[dbi].md_branch_pages = 0;
7241 txn->mt_dbs[dbi].md_leaf_pages = 0;
7242 txn->mt_dbs[dbi].md_overflow_pages = 0;
7243 txn->mt_dbs[dbi].md_entries = 0;
7244 txn->mt_dbs[dbi].md_root = P_INVALID;
7246 if (!txn->mt_u.dirty_list[0].mid) {
7249 /* make sure we have at least one dirty page in this txn
7250 * otherwise these changes will be ignored.
7252 key.mv_size = sizeof(txnid_t);
7253 key.mv_data = &txn->mt_txnid;
7254 data.mv_size = sizeof(MDB_ID);
7255 data.mv_data = txn->mt_free_pgs;
7256 mdb_cursor_init(&m2, txn, FREE_DBI, NULL);
7257 rc = mdb_cursor_put(&m2, &key, &data, 0);
7261 mdb_cursor_close(mc);
7265 int mdb_set_compare(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7267 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
7270 txn->mt_dbxs[dbi].md_cmp = cmp;
7274 int mdb_set_dupsort(MDB_txn *txn, MDB_dbi dbi, MDB_cmp_func *cmp)
7276 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
7279 txn->mt_dbxs[dbi].md_dcmp = cmp;
7283 int mdb_set_relfunc(MDB_txn *txn, MDB_dbi dbi, MDB_rel_func *rel)
7285 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
7288 txn->mt_dbxs[dbi].md_rel = rel;
7292 int mdb_set_relctx(MDB_txn *txn, MDB_dbi dbi, void *ctx)
7294 if (txn == NULL || !dbi || dbi >= txn->mt_numdbs)
7297 txn->mt_dbxs[dbi].md_relctx = ctx;
projects / openldap / blob